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 Determinant of a (0,2) Tensor by Raising an Index

The determinant is already settled for (1,1)(1,1) tensors. By Determinant From Homomorphism, an endomorphism MM of an nn-dimensional space has a determinant

det(M)=σSnsgn(σ)i=1nMiσ(i),\det(M)=\sum_{\sigma\in S_n}\operatorname{sgn}(\sigma)\prod_{i=1}^{n}M^{i}{}_{\sigma(i)},

the single-valued Leibniz polynomial; it is multiplicative, det(M1M2)=det(M1)det(M2)\det(M_1M_2)=\det(M_1)\det(M_2), and therefore conjugation-invariant, det(P1MP)=det(M)\det(P^{-1}MP)=\det(M) — an intrinsic scalar.

A (0,2)(0,2) tensor has no determinant of its own as a scalar: the determinant of its component matrix, det(Aij)\det(A_{ij}), is basis-dependent — under a change of basis APTAPA\mapsto P^{\mathsf T}AP it picks up a factor det(P)2\det(P)^2, making it a density of weight 2 (the subject of The Determinant of a (0,2)(0,2) Tensor from Relative Invariance). A metric repairs this by raising an index, exactly as for the trace. This note takes that construction as the definition, reads off existence and every property by piggybacking on the (1,1)(1,1) determinant, and proves uniqueness from multiplicativity only at the very end.

Setup

Let VV be nn-dimensional over C\mathbb C. A metric is a nondegenerate symmetric (0,2)(0,2) tensor gg with matrix G=(gij)G=(g_{ij}) and inverse gij=(G1)ijg^{ij}=(G^{-1})_{ij}. In a basis e1,,ene_1,\dots,e_n we meet three kinds of components:

The metric lowers the upper index of MM, and because GG is invertible this is reversible — it raises the lower index of AA:

Aij=gikMkj    (A=GM),Mkj=gkiAij    (M=G1A).A_{ij}=g_{ik}\,M^{k}{}_{j}\;\;(A=GM),\qquad\qquad M^{k}{}_{j}=g^{ki}A_{ij}\;\;(M=G^{-1}A).

Under a change of basis PGL(V)P\in GL(V) the two covariant objects transform by congruence and the endomorphism by similarity,

APTAP,GPTGP,M=G1AP1MP,A\mapsto P^{\mathsf T}AP,\qquad G\mapsto P^{\mathsf T}GP,\qquad M=G^{-1}A\mapsto P^{-1}MP,

the last following from the first two. A basis is orthonormal for gg when G=IG=I (one exists over C\mathbb C).

The (1,1)(1,1) determinant

These are the facts we borrow from Determinant From Homomorphism. On endomorphisms the determinant is

Definition

The (0,2)(0,2) tensor AA has no intrinsic determinant; the metric supplies one. Raise its index to the endomorphism M=G1AM=G^{-1}A and define the determinant of AA to be that of MM:

detg(A):=det(M)=det ⁣(G1A).\det\nolimits_g(A):=\det(M)=\det\!\big(G^{-1}A\big).

This is the metric-furnished extension of the (1,1)(1,1) determinant to (0,2)(0,2) tensors. Everything below is an immediate consequence.

Existence and consequences

Existence and component formula. The Leibniz polynomial makes det(G1A)\det(G^{-1}A) an explicit, single-valued polynomial in the entries of AA, and by multiplicativity

detg(A)=det ⁣(G1A)=det(Aij)det(gij).\det\nolimits_g(A)=\det\!\big(G^{-1}A\big)=\frac{\det(A_{ij})}{\det(g_{ij})}.

In an orthonormal basis, where det(gij)=1\det(g_{ij})=1, its value is the component determinant det(Aij)\det(A_{ij}). But that component determinant is only a coordinate number: under APTAPA\mapsto P^{\mathsf T}AP it scales by det(P)2\det(P)^2, so it is a weight-2 density, not basis-independent, and it agrees with detg(A)\det_g(A) only because the orthonormal metric has unit determinant. This is exactly why AA has no determinant of its own as a scalar — and why an index had to be raised to define one.

It is a scalar. Under (3) the endomorphism transforms by similarity MP1MPM\mapsto P^{-1}MP, so the conjugation invariance of the (1,1)(1,1) determinant makes detg(A)\det_g(A) basis-independent — for the full GL(V)GL(V).

Multiplicative under metric-composition. Composing two (0,2)(0,2) tensors through the metric, A1G1A2A_1\,G^{-1}A_2 is again a (0,2)(0,2) tensor, and

detg ⁣(A1G1A2)=det ⁣(G1A1G1A2)=det ⁣(G1A1)det ⁣(G1A2)=detg(A1)detg(A2).\det\nolimits_g\!\big(A_1\,G^{-1}A_2\big)=\det\!\big(G^{-1}A_1G^{-1}A_2\big)=\det\!\big(G^{-1}A_1\big)\det\!\big(G^{-1}A_2\big)=\det\nolimits_g(A_1)\,\det\nolimits_g(A_2).

Homogeneous of degree nn. detg(cA)=det(cG1A)=cndetg(A)\det_g(cA)=\det(cG^{-1}A)=c^{n}\det_g(A) for cCc\in\mathbb C.

The raised index may be either one. Raising the second index of AA produces the endomorphism AG1AG^{-1}, and det(AG1)=det(G1A)\det(AG^{-1})=\det(G^{-1}A), so (4) does not depend on which slot is raised.

Normalization. Taking A=gA=g, detg(g)=det(G1G)=det(I)=1\det_g(g)=\det(G^{-1}G)=\det(I)=1.

That is the whole theory: the definition (4), the formula (5), basis-independence, multiplicativity, the degree, and the normalization, all inherited from the (1,1)(1,1) determinant without a single new computation.

Uniqueness

The construction produces one functional; we close by showing it is the only one of its kind. The hypotheses are the multiplicative analogues of the trace’s linear ones.

Claim. Let DD be a function on (0,2)(0,2) tensors, nonzero on the nondegenerate ones, with

  • (M) metric-multiplicativity: D(A1G1A2)=D(A1)D(A2)D(A_1G^{-1}A_2)=D(A_1)D(A_2) for all nondegenerate A1,A2A_1,A_2;

  • (H) homogeneity: D(cA)=cnD(A)D(cA)=c^{n}D(A) for cCc\in\mathbb C^{*};

  • (N) normalization: D(g)=1D(g)=1. Then D=detgD=\det_g on every nondegenerate (0,2)(0,2) tensor.

Pull back along the index-raising. For MGL(V)M\in GL(V) set D~(M):=D(GM)\tilde D(M):=D(GM); then A=GMA=GM is nondegenerate, so D~(M)C\tilde D(M)\in\mathbb C^{*}. By (M), for M1,M2GL(V)M_1,M_2\in GL(V),

D~(M1M2)=D(GM1M2)=D((GM1)G1(GM2))=D(GM1)D(GM2)=D~(M1)D~(M2),\tilde D(M_1M_2)=D(GM_1M_2)=D\big((GM_1)\,G^{-1}\,(GM_2)\big)=D(GM_1)\,D(GM_2)=\tilde D(M_1)\,\tilde D(M_2),

so D~:GL(V)C\tilde D:GL(V)\to\mathbb C^{*} is a group homomorphism. By Determinant From Homomorphism it factors,

D~=hdet,h:CC a homomorphism.\tilde D=h\circ\det,\qquad h:\mathbb C^{*}\to\mathbb C^{*}\ \text{a homomorphism}.

Now evaluate on the metric ray. By (H) and (N), D(cg)=cnD(g)=cnD(cg)=c^{n}D(g)=c^{n}; on the other hand cg=G(cI)cg=G(cI), so D(cg)=D~(cI)=h(det(cI))=h(cn)D(cg)=\tilde D(cI)=h(\det(cI))=h(c^{n}). Hence

h(cn)=cnfor every cC.h(c^{n})=c^{n}\qquad\text{for every }c\in\mathbb C^{*}.

Over C\mathbb C every element is an nn-th power, so h=idh=\operatorname{id}, and (8) collapses to D~=det\tilde D=\det. Therefore, for every nondegenerate AA,

D(A)=D~(G1A)=det ⁣(G1A)=detg(A).D(A)=\tilde D\big(G^{-1}A\big)=\det\!\big(G^{-1}A\big)=\det\nolimits_g(A).\qquad\blacksquare

On a degenerate AA both sides vanish — detg(A)=0\det_g(A)=0 by (5), and the explicit polynomial detg\det_g extends the identity there by continuity — so D=detgD=\det_g outright once DD is taken to be the everywhere-defined Leibniz extension.

Density versus scalar: reconciling with the relative-invariance derivation

It is worth comparing this result with The Determinant of a (0,2)(0,2) Tensor from Relative Invariance, which derives a different object — by design. There are two inequivalent notions of “the determinant of a (0,2)(0,2) tensor,” and the metric is exactly what separates them.

The component determinant is a density, not a scalar. Under (3), APTAPA\mapsto P^{\mathsf T}AP, so

det(Aij)    det(PTAP)=det(P)2det(Aij).\det(A_{ij})\;\longmapsto\;\det(P^{\mathsf T}AP)=\det(P)^{2}\,\det(A_{ij}).

The bare component determinant is therefore not basis-independent — it rescales by det(P)2\det(P)^2. It is a density of weight 2 (a relative scalar). This is the object the relative-invariance note characterizes, using no metric: the cost of staying metric-free is that the answer is a density, allowed to transform by that factor, rather than a true number.

Raising an index produces a genuine scalar instead. The metric determinant detg(A)=det(G1A)\det_g(A)=\det(G^{-1}A) is invariant under the full GL(V)GL(V) — weight 0, a true scalar. The two objects differ by exactly one factor of the metric’s own density:

detg(A)=det(Aij)det(gij),equivalentlydet(Aij)=det(G)detg(A).\det\nolimits_g(A)=\frac{\det(A_{ij})}{\det(g_{ij})}\,,\qquad\text{equivalently}\qquad \det(A_{ij})=\det(G)\,\det\nolimits_g(A).

Because det(gij)\det(g_{ij}) is itself a weight-2 density — it too rescales by det(P)2\det(P)^2 — the quotient is weight 0: the two factors of det(P)2\det(P)^2 cancel. Dividing the density of AA by the density of gg is the standard way a metric turns a density into a number.

Where they agree, and where they part. In an orthonormal basis det(gij)=1\det(g_{ij})=1, so detg(A)=det(Aij)\det_g(A)=\det(A_{ij}): both notes give the same number. In a general basis they differ by the factor det(G)\det(G) — the relative-invariance note’s det(Aij)\det(A_{ij}) keeps rescaling as a density, while detg(A)\det_g(A) stays fixed. The two derivations are thus consistent, not competing: one gives the determinant as a density (metric-free), the other as a scalar (metric-bound), equal up to det(G)\det(G).

Why this route can only land on the scalar. The construction is built on the (1,1)(1,1) determinant, which is conjugation-invariant — a genuine scalar — so anything assembled from it is a genuine scalar too. The density det(Aij)\det(A_{ij}) is not a scalar, so it cannot be the output here; the method is forced to deliver the weight-0 quotient det(A)/det(G)\det(A)/\det(G).

Why the determinant has two notions while the trace has one. The component determinant survives metric-free, as a density, only because it is a true relative invariant: det(PTAP)=det(P)2det(A)\det(P^{\mathsf T}AP)=\det(P)^2\det(A) carries the clean character Pdet(P)2P\mapsto\det(P)^2. The trace enjoys no such thing — iAiitr(PTAP)\sum_i A_{ii}\mapsto\operatorname{tr}(P^{\mathsf T}AP) rescales by no character of PP, so it is not even a density, only a basis-dependent number with no invariant meaning. Hence there is a “determinant from relative invariance” but no “trace from relative invariance”: the trace has only its metric scalar gijAijg^{ij}A_{ij}, whereas the determinant has both the metric-free density and the metric scalar.

Remarks

Existence piggybacked; uniqueness used multiplicativity. As with the trace, existence, the component formula, and invariance came straight from the (1,1)(1,1) determinant by raising an index. Uniqueness, however, rested on (M) — multiplicativity — and reduced, through the same index-raising, to the homomorphism theorem of Determinant From Homomorphism. It is the determinant’s counterpart of the trace’s pull-back of cyclicity.

Why isometry-invariance is not enough — the contrast with the trace. For the trace, linearity together with isometry-invariance pinned trg\operatorname{tr}_g uniquely (a signed-permutation argument). For the determinant the same geometric hypothesis is far too weak: every coefficient of the characteristic polynomial of M=G1AM=G^{-1}A — the elementary symmetric functions tr(M), , det(M)\operatorname{tr}(M),\ \dots,\ \det(M) of its eigenvalues — is an isometry-invariant scalar built from AA, and detg\det_g is only the last of them. Linearity selects the first of these (the trace); multiplicativity selects the last (the determinant). This is why the determinant’s uniqueness must invoke its multiplicative structure rather than a symmetry.

Geometric meaning. M=G1AM=G^{-1}A is the endomorphism of the generalized eigenvalue problem Av=λgvA\,v=\lambda\,g\,v, so detg(A)\det_g(A) is the product of the eigenvalues of AA relative to gg — the ratio of the volume form determined by AA to that determined by gg. Unlike the trace, which saw only the symmetric part of AA, the determinant sees all of it: a nonzero antisymmetric AA can have detg(A)0\det_g(A)\neq0.