Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

The Trace of a (0,2) Tensor from a Metric

Starting from a covariant rank-2 tensor TT together with a metric gg, and a few invariance assumptions, we derive — with no skipped steps — that the only linear scalar one can attach to TT is the metric trace gijTijg^{ij}T_{ij}, which in any orthonormal basis is the ordinary trace iTii\sum_i T_{ii} of the component matrix.

This is the additive, metric-dependent companion of The Determinant of a (0,2)(0,2) Tensor from Relative Invariance. The contrast is the whole point. The determinant of a (0,2)(0,2) tensor needs no metric: it is a relative scalar (a density of weight 2) under the full GLGL congruence group. A (0,2)(0,2) tensor has no intrinsic trace — under congruence MATMAM\mapsto A^{\mathsf T}MA the coordinate sum iMii\sum_i M_{ii} is not preserved — and a metric is exactly the extra datum that repairs this, by letting one index be raised.

Setup

Let VV be an nn-dimensional vector space over C\mathbb C and TT a (0,2)(0,2) tensor, i.e. a bilinear form T:V×VCT:V\times V\to\mathbb C. Fix a basis e1,,ene_1,\dots,e_n and form the component matrix

Mij=T(ei,ej).M_{ij}=T(e_i,e_j).

A metric is a nondegenerate symmetric (0,2)(0,2) tensor gg with components Gij=g(ei,ej)G_{ij}=g(e_i,e_j); its inverse is the (2,0)(2,0) tensor with components gij:=(G1)ijg^{ij}:=(G^{-1})_{ij}, so that jgijGjk=δki\sum_j g^{ij}G_{jk}=\delta^i_k.

For AGL(V)A\in GL(V) (the matrix of a change of basis), both covariant tensors transform by congruence, and the inverse metric contravariantly:

MATMA,GATGA,G1A1G1AT.M\mapsto A^{\mathsf T}MA,\qquad G\mapsto A^{\mathsf T}GA,\qquad G^{-1}\mapsto A^{-1}G^{-1}A^{-\mathsf T}.

A basis is orthonormal for gg when G=IG=I, i.e. g(ei,ej)=δijg(e_i,e_j)=\delta_{ij}. Over C\mathbb C every nondegenerate symmetric form admits an orthonormal basis (diagonalize, then rescale each diagonal entry to 1 using a complex square root). The changes of basis that preserve gg form the isometry group

O(g):={AGL(V):ATGA=G};O(g):=\{A\in GL(V):A^{\mathsf T}GA=G\};

in an orthonormal basis O(g)=O(n,C)={A:ATA=I}O(g)=O(n,\mathbb C)=\{A:A^{\mathsf T}A=I\}, and there congruence by an isometry coincides with conjugation, ATMA=A1MAA^{\mathsf T}MA=A^{-1}MA.

We seek a scalar D(M)CD(M)\in\mathbb C built from the components of TT, with the metric fixed as background data.

Assumptions

Step 1 — the character is trivial

Set M=GM=G in (I). Since ATGA=GA^{\mathsf T}GA=G for every isometry,

D(G)=D(ATGA)=κ(A)D(G).D(G)=D\big(A^{\mathsf T}GA\big)=\kappa(A)\,D(G).

By (N), D(G)=n0D(G)=n\neq0, so κ(A)=1\kappa(A)=1 for all AO(g)A\in O(g):

D(ATMA)=D(M)(AO(g)).D\big(A^{\mathsf T}MA\big)=D(M)\qquad(A\in O(g)).

So DD is an absolute invariant under isometries — a scalar of weight 0, in contrast with the determinant, whose weight-2 density survives only as a relative scalar. The normalization is what trivializes the character; note O(n,C)O(n,\mathbb C) does carry the nontrivial character AdetA=±1A\mapsto\det A=\pm1, but D(G)0D(G)\neq0 excludes it.

Step 2 — work in an orthonormal basis

Choosing an orthonormal basis makes G=IG=I, the isometry group O(n,C)O(n,\mathbb C), and (6) the conjugation invariance

D(A1MA)=D(M)(AO(n,C)).D\big(A^{-1}MA\big)=D(M)\qquad(A\in O(n,\mathbb C)).

Everything below is computed in this basis; the basis-free form is restored in Step 4.

Step 3 — signed permutations force D=λtrD=\lambda\operatorname{tr}

By linearity (L), DD is determined by its values on the matrix units EijE_{ij}:

D(M)=i,jcijMij,cij:=D(Eij).D(M)=\sum_{i,j}c_{ij}M_{ij},\qquad c_{ij}:=D(E_{ij}).

Two families of isometries pin the coefficients cijc_{ij}. Both are signed permutation matrices, which satisfy ATA=IA^{\mathsf T}A=I and so lie in O(n,C)O(n,\mathbb C).

Diagonal sign matrices kill the off-diagonal coefficients. For ε{±1}n\varepsilon\in\{\pm1\}^n let S=diag(ε1,,εn)S=\operatorname{diag}(\varepsilon_1,\dots,\varepsilon_n), so S1=SS^{-1}=S and (S1MS)ij=εiεjMij(S^{-1}MS)_{ij}=\varepsilon_i\varepsilon_j M_{ij}. Invariance (7) gives ijcijεiεjMij=ijcijMij\sum_{ij}c_{ij}\varepsilon_i\varepsilon_j M_{ij}=\sum_{ij}c_{ij}M_{ij} for all MM, hence cij(εiεj1)=0c_{ij}(\varepsilon_i\varepsilon_j-1)=0. For iji\neq j, take εi=1\varepsilon_i=-1 and the rest +1; then εiεj=1\varepsilon_i\varepsilon_j=-1 and

cij=0(ij).c_{ij}=0\qquad(i\neq j).

Permutations equate the diagonal coefficients. For a transposition τ=(i  j)\tau=(i\;j) the permutation matrix PτO(n,C)P_\tau\in O(n,\mathbb C) acts by (Pτ1MPτ)kl=Mτ(k)τ(l)(P_\tau^{-1}MP_\tau)_{kl}=M_{\tau(k)\tau(l)}, so (7) forces cτ(k)τ(l)=cklc_{\tau(k)\tau(l)}=c_{kl}; on the diagonal this is cii=cjjc_{ii}=c_{jj}. Thus all diagonal coefficients share one value

λ:=c11=c22==cnn.\lambda:=c_{11}=c_{22}=\dots=c_{nn}.

Combining (9) and (10),

D(M)=λiMii=λtr(M).D(M)=\lambda\sum_i M_{ii}=\lambda\operatorname{tr}(M).

Step 4 — normalization and the covariant formula

In the orthonormal basis G=IG=I, so (N) reads D(I)=λn=nD(I)=\lambda n=n, giving λ=1\lambda=1 and

D(M)=iMii=tr(M)(orthonormal basis).D(M)=\sum_i M_{ii}=\operatorname{tr}(M)\qquad(\text{orthonormal basis}).

To see the same scalar in an arbitrary basis, contract TT with the inverse metric:

trg(T):=i,jgijMij=tr ⁣(G1M),\operatorname{tr}_g(T):=\sum_{i,j}g^{ij}M_{ij}=\operatorname{tr}\!\big(G^{-1}M\big),

which collapses to iMii\sum_i M_{ii} exactly when G=IG=I. The next section verifies that (13) is itself a genuine scalar satisfying (L), (I), (N), so by the uniqueness just proved it is the answer.

Existence: the metric trace is a scalar

Equation (13) defines one explicit functional, which we check directly.

Quick route: raise an index

The metric trace need not be rederived from scratch. It collapses, in two lines, to the trace of a genuine endomorphism — to which Trace From Linearity and Cyclicity applies verbatim, since that endomorphism is an ordinary matrix.

A (0,2)(0,2) tensor carries no trace of its own; the metric supplies one by raising an index. Lowering the upper index of an endomorphism SkjS^{k}{}_{j} with gg produces a (0,2)(0,2) tensor,

Mij=gikSkj,that isM=GS,M_{ij}=g_{ik}\,S^{k}{}_{j},\qquad\text{that is}\qquad M=GS,

and because GG is invertible this is a linear bijection between endomorphisms and (0,2)(0,2) tensors. Inverting it raises the index back:

S=G1M,Skj=gkiMij.S=G^{-1}M,\qquad S^{k}{}_{j}=g^{ki}M_{ij}.

Now SkjS^{k}{}_{j} is an ordinary matrix, so Trace From Linearity and Cyclicity hands us its trace at once, tr(S)=Sii\operatorname{tr}(S)=S^{i}{}_{i}. Since the trace is intrinsic only on the (1,1)(1,1) side, we define the trace of the (0,2)(0,2) tensor TT to be that of its raised form — the metric-furnished extension of the (1,1)(1,1) trace. Substituting (16),

trg(T):=tr(S)=Sii=gijMij=tr ⁣(G1M),\operatorname{tr}_g(T):=\operatorname{tr}(S)=S^{i}{}_{i}=g^{ij}M_{ij}=\operatorname{tr}\!\big(G^{-1}M\big),

which reproduces (13) — and iMii\sum_i M_{ii} when G=IG=I — with no axiomatic machinery at all. The defining :=:= is deliberate: (17) is a definition, not a consequence of (L), (I), (N). It is the constructive counterpart of the axiomatic characterization, and the two name the same scalar by the existence-and-uniqueness theorem of Steps 1–4.

The raised index may be either one. Raising the second index of TT instead gives the endomorphism MG1MG^{-1}, whose trace tr(MG1)=tr(G1M)\operatorname{tr}(MG^{-1})=\operatorname{tr}(G^{-1}M) by cyclicity; so trg(T)\operatorname{tr}_g(T) does not depend on which slot is raised. (As gg is symmetric it sees only the symmetric part of TT — see the Remarks.)

Invariance is automatic. Under a change of basis (2), MATMAM\mapsto A^{\mathsf T}MA and G1A1G1ATG^{-1}\mapsto A^{-1}G^{-1}A^{-\mathsf T}, so the endomorphism transforms by similarity,

S=G1M    A1G1ATATMA=A1SA,S=G^{-1}M\;\longmapsto\;A^{-1}G^{-1}A^{-\mathsf T}\,A^{\mathsf T}MA=A^{-1}SA,

and the conjugation invariance of the trace — Step 1 of Trace From Linearity and Cyclicity, i.e. cyclicity — makes trg(T)=gijMij\operatorname{tr}_g(T)=g^{ij}M_{ij} a scalar under the full GL(V)GL(V), not merely the isometries.

Why uniqueness still needs Step 3. The shortcut yields the formula and its invariance, but not uniqueness — and the obstruction is a commutant. Every linear functional of the endomorphism SS has the form D~(S)=tr(CS)\tilde D(S)=\operatorname{tr}(CS) for a unique matrix CC, and invariance under conjugation by a group HH,

D~(A1SA)=tr(ACA1S)=D~(S)(AH),\tilde D\big(A^{-1}SA\big)=\operatorname{tr}\big(ACA^{-1}S\big)=\tilde D(S)\qquad(\forall A\in H),

holds exactly when CC commutes with every AHA\in H. So the linear HH-invariants, up to scale, form the commutant of HH, and uniqueness means that commutant is only the scalars {λI}\{\lambda I\}. For H=GL(V)H=GL(V) this is the content of Trace From Linearity and Cyclicity: the standard representation is irreducible, so the commutant is scalar. But with GG fixed the bijection (16) turns isometry invariance of TT only into invariance of SS under H=O(g)H=O(g), a smaller group with an a priori larger commutant — so the full-GLGL theorem does not apply. That the commutant of O(g)O(g) collapses to the scalars anyway is the separate fact proved elementarily in Step 3: diagonal sign matrices force CC diagonal, permutations force it constant. Index-raising buys existence and invariance; Step 3 buys uniqueness.

Conclusion

In every orthonormal basis the linear, isometry-invariant, normalized scalar of a (0,2)(0,2) tensor is the trace of its component matrix, and in an arbitrary basis it is the metric contraction:

D(M)=trg(T)=i,jgijMij=tr ⁣(G1M)    G=I    iMii.\boxed{\,D(M)=\operatorname{tr}_g(T)=\sum_{i,j}g^{ij}M_{ij}=\operatorname{tr}\!\big(G^{-1}M\big)\;\xrightarrow[\;G=I\;]{}\;\sum_i M_{ii}.\,}

Linearity (L), isometry invariance (I), and the scale (N) force the trace of a (0,2)(0,2) tensor — taken against the metric — to be the ordinary component trace in any orthonormal frame. \qquad\blacksquare

Remarks

Only the symmetric part is seen. Since gijg^{ij} is symmetric, gijMij=gijM(ij)g^{ij}M_{ij}=g^{ij}M_{(ij)} depends only on the symmetric part of TT; equivalently, an antisymmetric Mij=MjiM_{ij}=-M_{ji} has Mii=0M_{ii}=0, so iMii=0\sum_i M_{ii}=0. The metric trace is blind to the 2-form part of TT.

Why a metric is unavoidable. Without the metric the only invariance available on a (0,2)(0,2) tensor is the full congruence group, under which no nonzero linear scalar is invariant: writing D(M)=tr(CTM)D(M)=\operatorname{tr}(C^{\mathsf T}M) and taking the scaling A=cIA=cI gives D(ATMA)=c2D(M)D(A^{\mathsf T}MA)=c^2D(M), so D(ATMA)=D(M)D(A^{\mathsf T}MA)=D(M) for all AGL(V)A\in GL(V) already forces c2D(M)=D(M)c^2D(M)=D(M) for every cc, hence D0D\equiv0. The determinant escapes this because it is relative, scaling by det(A)2\det(A)^2 rather than staying fixed; the trace cannot, so it must borrow a metric to lower the symmetry to the isometry subgroup O(g)O(g), on which iMii\sum_i M_{ii} is invariant. The metric-free home of the trace is instead the mixed (1,1)(1,1) tensor of Trace From Linearity and Cyclicity, recovered here as tr(G1M)\operatorname{tr}(G^{-1}M).

Two routes to uniqueness. The signed-permutation argument of Step 3 is needed only because the assumed symmetry is the geometric one — isometry invariance (I), which the metric cuts down to O(g)O(g), strictly weaker than full GLGL. Trading (I) for a stronger algebraic hypothesis removes it. Pulling cyclicity back through the index-raising (16), with D~(S):=D(GS)\tilde D(S):=D(GS) the cyclicity D~(S1S2)=D~(S2S1)\tilde D(S_1S_2)=\tilde D(S_2S_1) becomes

D(M1G1M2)=D(M2G1M1)(M1,M2),D\big(M_1\,G^{-1}M_2\big)=D\big(M_2\,G^{-1}M_1\big)\qquad(\forall\,M_1,M_2),

“metric-cyclicity” — the trace of a metric-product is symmetric in its two factors. Assuming (L) together with (21) in place of (I) makes D~\tilde D a linear cyclic functional on ordinary matrices, so Trace From Linearity and Cyclicity delivers D~=λtr\tilde D=\lambda\operatorname{tr} at full GL(V)GL(V) at once, giving D(M)=λgijMijD(M)=\lambda\,g^{ij}M_{ij} with no signed-permutation step. It is a genuine trade-off: the weaker geometric (I) needs Step 3, the stronger algebraic (21) inherits uniqueness directly. Either way uniqueness rests on an assumption — only the constructive definition (17) needs none.

Parallel with the determinant. The determinant note reduces its per-slot relative invariance to two homomorphisms GL(n,C)CGL(n,\mathbb C)\to\mathbb C^{*} and identifies them with det\det via Determinant From Homomorphism. Here the relative invariance reduces, after the character is trivialized in Step 1, to a single linear functional invariant under O(n,C)O(n,\mathbb C)-conjugation, identified with tr\operatorname{tr} via the signed-permutation argument of Step 3 — the orthogonal-group shadow of Trace From Linearity and Cyclicity.