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

A short, self-contained axiomatic derivation: from two natural axioms we show that the determinant of an arbitrary covariant rank-2 tensor is forced to be the determinant of its component matrix.

1. Setup

Let VV be an nn-dimensional vector space over a field KK (think K=RK=\mathbb{R} or C\mathbb{C}), and let TT be a (0,2)(0,2) tensor on VV — i.e. a bilinear form

T:V×VK.T:V\times V\to K .

No symmetry is assumed: TT is completely arbitrary. Fix a basis {e1,,en}\{e_1,\dots,e_n\}. The components of TT form the n×nn\times n Gram matrix

M=(Mij),Mij:=T(ei,ej).M=(M_{ij}),\qquad M_{ij}:=T(e_i,e_j).

We ask: what scalar deserves to be called the determinant of TT, and is it uniquely forced?

2. How the components transform

Change basis by PGL(V)P\in GL(V), writing ej=iPijeie'_j=\sum_i P^{i}{}_{j}\,e_i. Then

Mkl=T(ek,el)=i,jPikPjlT(ei,ej)=(PTMP)kl,M'_{kl}=T(e'_k,e'_l)=\sum_{i,j}P^{i}{}_{k}P^{j}{}_{l}\,T(e_i,e_j)=(P^{\mathsf T}MP)_{kl},

so the components transform by

M=PTMP.M'=P^{\mathsf T}MP .

Taking determinants, detM=(detP)2detM\det M'=(\det P)^2\det M. Thus detM\det M is not a basis-independent number: under a change of basis it is multiplied by (detP)2(\det P)^2. An object transforming this way is a scalar density of weight 2. The most we can hope to characterize is therefore a weight-2 density; the goal is to show it is unique.

3. The natural operation on a bilinear form

Because TT takes two independent arguments, any pair of linear maps A,BGL(V)A,B\in GL(V) yields a new bilinear form

TA,B(v,w):=T(Av,Bw).T_{A,B}(v,w):=T(Av,\,Bw).

Its components are

(TA,B)ij=T(Aei,Bej)=k,lAkiBljMkl=(ATMB)ij,(T_{A,B})_{ij}=T(Ae_i,Be_j)=\sum_{k,l}A^{k}{}_{i}\,B^{l}{}_{j}\,M_{kl}=(A^{\mathsf T}MB)_{ij},

so the Gram matrix of TA,BT_{A,B} is ATMBA^{\mathsf T}MB. The change of basis of Section 2 is exactly the diagonal special case A=B=PA=B=P.

4. The axioms

We seek a rule DD that assigns to each bilinear form — equivalently, to its Gram matrix MM — a scalar D(M)KD(M)\in K, subject to just two requirements.

Axiom I (bilinear weight law). Transforming the two slots independently multiplies the answer by the corresponding determinants:

D(ATMB)=det(A)det(B)D(M)for all A,BGL(V).D(A^{\mathsf T}MB)=\det(A)\,\det(B)\,D(M)\qquad\text{for all }A,B\in GL(V).

Axiom II (normalization).

D(I)=1.D(I)=1 .

Why these are the natural axioms. A (0,2)(0,2) tensor is an element of VVV^{*}\otimes V^{*}, whose two covariant slots are a priori independent copies of VV^{*}. Axiom I says the determinant scales by one factor of det\det in each slot separately — precisely as a volume form is multilinear and alternating in each of its arguments. Setting A=B=PA=B=P, Axiom I already contains the weight-2 density law D(PTMP)=(detP)2D(M)D(P^{\mathsf T}MP)=(\det P)^2D(M) of Section 2; but it says strictly more, and that surplus is exactly what makes the determinant unique. (The weight-2 law by itself does not pin DD down — it leaves room for impostors that depend on the mismatch between the two slots. Axiom I closes that gap.) Axiom II only fixes the overall scale. The usual change-of-basis law is only the diagonal case A=B=PA=B=P; why one is entitled to transform the two slots independently is taken up in Appendix D.

5. Derivation

We show Axioms I–II force D=detD=\det, in two short steps. Assume KK has more than two elements (e.g. R\mathbb{R} or C\mathbb{C}).

Step 1 — nondegenerate forms. Let MM be invertible. Apply Axiom I to the reference matrix II, with A=IA=I and B=MB=M. Since ITIM=MI^{\mathsf T}\,I\,M=M,

D(M)=D ⁣(ITIM)=det(I)det(M)D(I)=det(M),D(M)=D\!\left(I^{\mathsf T}\,I\,M\right)=\det(I)\,\det(M)\,D(I)=\det(M),

the last equality by Axiom II. Hence D(M)=det(M)D(M)=\det(M) for every invertible MM.

Step 2 — degenerate forms. Let MM be singular; we show D(M)=0D(M)=0 without any extra axiom. Since detM=0\det M=0, the map MM has a nontrivial kernel: there is a column vector u0u\neq 0 with Mu=0Mu=0. Pick a row vector wTw^{\mathsf T} with wTu=cw^{\mathsf T}u=c, where c0c\neq 0 and c1c\neq -1 (possible: u0u\neq0, so wTuw^{\mathsf T}u can be scaled to any value, and KK has an element outside {0,1}\{0,-1\}). Set

B:=I+uwTGL(V),detB=1+wTu=1+c0.B:=I+u\,w^{\mathsf T}\in GL(V),\qquad \det B=1+w^{\mathsf T}u=1+c\neq 0 .

Because Mu=0Mu=0,

MB=M(I+uwT)=M+(Mu)wT=M.MB=M\bigl(I+u\,w^{\mathsf T}\bigr)=M+(Mu)\,w^{\mathsf T}=M .

Now apply Axiom I with A=IA=I:

D(M)=D ⁣(ITMB)=det(B)D(M)=(1+c)D(M).D(M)=D\!\left(I^{\mathsf T}MB\right)=\det(B)\,D(M)=(1+c)\,D(M).

As 1+c11+c\neq 1, this forces D(M)=0=det(M)D(M)=0=\det(M).

Combining the two steps, D(M)=det(M)D(M)=\det(M) for all MM. \qquad\blacksquare

6. Existence

Uniqueness is only meaningful if a solution exists at all — and the determinant itself is one:

det(ATMB)=det(A)det(M)det(B),det(I)=1,\det(A^{\mathsf T}MB)=\det(A)\det(M)\det(B),\qquad \det(I)=1,

the first equality by multiplicativity of det\det. So D=detD=\det is the one and only rule satisfying Axioms I–II.

7. Conclusion

For an arbitrary (0,2)(0,2) tensor TT with components Mij=T(ei,ej)M_{ij}=T(e_i,e_j), the determinant is forced to be

d(T)=det(Tij),\boxed{\,d(T)=\det\bigl(T_{ij}\bigr)\,},

and, by Section 2, it is not a scalar but a density of weight 2, transforming as d(T)(detP)2d(T)d(T)\mapsto(\det P)^2\,d(T) under a change of basis PP.

Two closing remarks:


Appendix: Deriving Axiom I from the determinant of endomorphisms

Axiom I can be proved rather than assumed, once we grant the one genuinely primitive notion: the determinant of an endomorphism (a map VVV\to V). We recall it, define the tensor determinant constructively, and then Axiom I drops out of functoriality.

A.1 The primitive: determinant of an endomorphism. The top exterior power nV\bigwedge^{n}V is one-dimensional. Any endomorphism g:VVg:V\to V induces a linear map ng:nVnV\bigwedge^{n}g:\bigwedge^{n}V\to\bigwedge^{n}V, which — being a linear map of a line to itself — is multiplication by a scalar. Define that scalar to be det(g)\det(g):

ng=det(g)idnV.\textstyle\bigwedge^{n}g=\det(g)\cdot\mathrm{id}_{\bigwedge^{n}V}.

Concretely, expanding multilinearly and using antisymmetry of \wedge,

g(e1)g(en)=(σSnsgn(σ)igiσ(i))e1en,g(e_1)\wedge\cdots\wedge g(e_n)=\Big(\sum_{\sigma\in S_n}\operatorname{sgn}(\sigma)\prod_i g^{\,i}{}_{\sigma(i)}\Big)\,e_1\wedge\cdots\wedge e_n,

so this scalar is the usual Leibniz determinant of the matrix of gg. Two properties are immediate from the fact that n\bigwedge^{n} is a functor (it respects composition and identities):

det(gh)=det(g)det(h),det(id)=1.\det(g\circ h)=\det(g)\det(h),\qquad \det(\mathrm{id})=1.

This is the only determinant we take for granted — the ordinary scalar one, for maps of a space to itself.

A.2 The construction: tensor determinant via the top exterior power. A (0,2)(0,2) tensor TT is the same data as the linear “lowering” map

ϕT:VV,ϕT(v):=T(v,).\phi_T:V\to V^{*},\qquad \phi_T(v):=T(v,\cdot).

Applying the functor n\bigwedge^{n} to it gives a map between the two lines nV\bigwedge^{n}V and nV\bigwedge^{n}V^{*}:

d(T):=nϕT: nVnV.d(T):=\textstyle\bigwedge^{n}\phi_T:\ \bigwedge^{n}V\longrightarrow\bigwedge^{n}V^{*}.

In the bases e1ene_1\wedge\cdots\wedge e_n and e1ene^1\wedge\cdots\wedge e^n, the matrix of ϕT\phi_T is MTM^{\mathsf T}, so d(T)d(T) is multiplication by det(MT)=det(M)\det(M^{\mathsf T})=\det(M) — it is exactly det(Tij)\det(T_{ij}), now seen as the canonical element of the weight-2 density line Hom ⁣(nV,nV)\operatorname{Hom}\!\big(\bigwedge^{n}V,\bigwedge^{n}V^{*}\big).

A.3 Deriving Axiom I. Compute the lowering map of TA,BT_{A,B}. For any v,wv,w,

ϕTA,B(v)(w)=TA,B(v,w)=T(Av,Bw)=ϕT(Av)(Bw)=(BϕT(Av))(w),\phi_{T_{A,B}}(v)(w)=T_{A,B}(v,w)=T(Av,Bw)=\phi_T(Av)(Bw)=\big(B^{*}\phi_T(Av)\big)(w),

where B:VVB^{*}:V^{*}\to V^{*} is the dual map, (Bξ)(w):=ξ(Bw)(B^{*}\xi)(w):=\xi(Bw). Hence, as maps VVV\to V^{*},

ϕTA,B=BϕTA.\phi_{T_{A,B}}=B^{*}\circ\phi_T\circ A .

Apply the functor n\bigwedge^{n} and use n(gh)=ngnh\bigwedge^{n}(g\circ h)=\bigwedge^{n}g\circ\bigwedge^{n}h together with A.1 (noting det(B)=det(B)\det(B^{*})=\det(B), since the matrix of BB^{*} is BTB^{\mathsf T}):

d(TA,B)=nϕTA,B=nBnϕTnA=det(B)det(A)  nϕT=det(A)det(B)d(T).d(T_{A,B})=\textstyle\bigwedge^{n}\phi_{T_{A,B}} =\bigwedge^{n}B^{*}\circ\bigwedge^{n}\phi_T\circ\bigwedge^{n}A =\det(B)\,\det(A)\;\bigwedge^{n}\phi_T =\det(A)\det(B)\,d(T).

This is Axiom I. \qquad\blacksquare

So the two-slot law is a consequence of a single fact — that the determinant of an endomorphism is its action on the top exterior power — propagated through the functoriality of n\bigwedge^{n}. Nothing about (0,2)(0,2) tensors had to be assumed beyond the definition d(T)=nϕTd(T)=\bigwedge^{n}\phi_T.

Remark (an equivalent, purely matrix-level answer). If one prefers to avoid exterior algebra, Axiom I is also equivalent — given D(I)=1D(I)=1 — to the classical characterization of det\det as the unique function that is multilinear and alternating in the columns (or rows) of MM. From that characterization D=detD=\det, and then D(ATMB)=det(A)det(B)D(M)D(A^{\mathsf T}MB)=\det(A)\det(B)D(M) follows from multiplicativity. Either way, Axiom I is not an independent leap: it is equivalent to the standard determinant axioms and provable from them.


Appendix B: An alternative axiom set — multiplicativity and homogeneity

Axiom I can also be replaced by the more familiar pair (here K=CK=\mathbb{C}, and D≢0D\not\equiv0):

Step 1 — multiplicativity alone gives D=gdetD=g\circ\det. On GL(n,C)GL(n,\mathbb{C}) the map DD takes values in C\mathbb{C}^{*} — if DD vanished at one invertible M0M_0, then D(I)=D(M0)D(M01)=0D(I)=D(M_0)D(M_0^{-1})=0 and hence D0D\equiv0 — so D:GL(n,C)CD:GL(n,\mathbb{C})\to\mathbb{C}^{*} is a group homomorphism. The factorization theorem of Determinant From Homomorphism then yields

D(M)=g(detM)on GL(n,C),D(M)=g(\det M)\qquad\text{on }GL(n,\mathbb{C}),

for some homomorphism g:CCg:\mathbb{C}^{*}\to\mathbb{C}^{*}. (There det\det is the Leibniz polynomial, proved single-valued and multiplicative on GL(n,C)GL(n,\mathbb{C}).) Thus multiplicativity by itself already determines DD up to the single character gg.

Step 2 — homogeneity fixes g=idg=\mathrm{id}. Apply (H) at M=IM=I: on one hand D(λI)=λnD(I)=λnD(\lambda I)=\lambda^{n}D(I)=\lambda^{n}, on the other D(λI)=g(det(λI))=g(λn)D(\lambda I)=g(\det(\lambda I))=g(\lambda^{n}). Hence

g(λn)=λnfor all λC.g(\lambda^{n})=\lambda^{n}\qquad\text{for all }\lambda\in\mathbb{C}^{*}.

Because C\mathbb{C} is algebraically closed, every tCt\in\mathbb{C}^{*} is an nn-th power, so g(t)=tg(t)=t for all tt: g=idg=\mathrm{id} and D=detD=\det on GL(n,C)GL(n,\mathbb{C}).

Step 3 — singular matrices. If detM=0\det M=0, column-reduce: choose invertible QQ so that MQMQ has a zero column, say the last. Then Λμ:=diag(1,,1,μ)\Lambda_\mu:=\operatorname{diag}(1,\dots,1,\mu) satisfies MQΛμ=MQMQ\,\Lambda_\mu=MQ, so D(MQ)=D(MQ)D(Λμ)=D(MQ)μD(MQ)=D(MQ)\,D(\Lambda_\mu)=D(MQ)\,\mu. Taking μ1\mu\neq1 forces D(MQ)=0D(MQ)=0, hence D(M)=D(MQ)D(Q1)=0=detMD(M)=D(MQ)\,D(Q^{-1})=0=\det M. So D=detD=\det everywhere. \qquad\blacksquare

Two caveats — and why this set is less natural than Axiom I.


Appendix C: Deriving Axiom I from relative invariance

Axiom I prescribes the exact multiplier det(A)det(B)\det(A)\det(B). We now assume far less — only that some multiplier works — and derive that it must be the determinants. This is the most tensor-native route: it asks merely that DD be a relative invariant of the natural symmetry group, with the character left completely unspecified.

The bare hypothesis (relative invariance). Say DD (with D≢0D\not\equiv0) is a relative invariant of the two-slot action if there is some function χ:GL(V)×GL(V)K\chi:GL(V)\times GL(V)\to K^{*} with

D(ATMB)=χ(A,B)D(M)for all A,BGL(V) and all M.D(A^{\mathsf T}MB)=\chi(A,B)\,D(M)\qquad\text{for all }A,B\in GL(V)\text{ and all }M.

Nothing about χ\chi is presupposed — this is just the statement that the symmetry group rescales DD by a scalar, the defining property of a density / relative invariant.

Step 1 — the character separates and is multiplicative. Put α(A):=χ(A,I)\alpha(A):=\chi(A,I) and β(B):=χ(I,B)\beta(B):=\chi(I,B). Writing ATMB=AT(MB)A^{\mathsf T}MB=A^{\mathsf T}(MB) and applying the hypothesis one slot at a time,

D(ATMB)=α(A)D(MB)=α(A)β(B)D(M),soχ(A,B)=α(A)β(B).D(A^{\mathsf T}MB)=\alpha(A)\,D(MB)=\alpha(A)\beta(B)\,D(M),\qquad\text{so}\qquad \chi(A,B)=\alpha(A)\,\beta(B).

Moreover α\alpha is a homomorphism: from (A1A2)T=A2TA1T(A_1A_2)^{\mathsf T}=A_2^{\mathsf T}A_1^{\mathsf T},

α(A1A2)D(M)=D ⁣(A2TA1TM)=α(A2)α(A1)D(M),\alpha(A_1A_2)\,D(M)=D\!\big(A_2^{\mathsf T}A_1^{\mathsf T}M\big)=\alpha(A_2)\alpha(A_1)\,D(M),

so α(A1A2)=α(A1)α(A2)\alpha(A_1A_2)=\alpha(A_1)\alpha(A_2); likewise β\beta. Thus α,β:GL(V)K\alpha,\beta:GL(V)\to K^{*} are multiplicative characters.

Step 2 — every character of GLGL factors through det\det. By the factorization theorem of Determinant From Homomorphism (taking K=CK=\mathbb{C}), α=g1det\alpha=g_1\circ\det and β=g2det\beta=g_2\circ\det for homomorphisms g1,g2:CCg_1,g_2:\mathbb{C}^{*}\to\mathbb{C}^{*}. Hence the multiplier is forced to be built from the two determinants:

χ(A,B)=g1(detA)g2(detB).\chi(A,B)=g_1(\det A)\,g_2(\det B).

This is the whole point: relative invariance alone already says the factor can only depend on A,BA,B through detA\det A and detB\det B.

Step 3 — reach MM from II, and g1=g2g_1=g_2. For invertible MM, normalize D(I)=1D(I)=1 and compute D(M)D(M) two ways. Through the second slot, M=ITIMM=I^{\mathsf T}\,I\,M gives D(M)=β(M)=g2(detM)D(M)=\beta(M)=g_2(\det M); through the first slot, M=(MT)TIM=(M^{\mathsf T})^{\mathsf T}\,I gives D(M)=α(MT)=g1(detM)D(M)=\alpha(M^{\mathsf T})=g_1(\det M). Equating, g1=g2=:gg_1=g_2=:g, and

D(M)=g(detM)on GL(V).D(M)=g(\det M)\qquad\text{on }GL(V).

Step 4 — homogeneity fixes g=idg=\mathrm{id}. Assume DD is homogeneous of degree nn (the only natural choice: det\det of an n×nn\times n matrix has degree nn). Then D(λI)=λn=g(λn)D(\lambda I)=\lambda^{n}=g(\lambda^{n}) for all λ\lambda, and since every element of C\mathbb{C}^{*} is an nn-th power, g=idg=\mathrm{id}. Therefore

χ(A,B)=det(A)det(B),D(M)=det(M)  on GL(V),\chi(A,B)=\det(A)\,\det(B),\qquad D(M)=\det(M)\ \text{ on }GL(V),

which is exactly Axiom I, now derived. The degenerate case D=0=detD=0=\det follows as in Section 5 (or Appendix B, Step 3). \qquad\blacksquare

Why the group must be the full two-slot GL×GLGL\times GL — not just change of basis. It is tempting to apply the same idea to the genuine basis-change group, i.e. congruence A=B=PA=B=P, asking only that D(PTMP)=χ(P)D(M)D(P^{\mathsf T}MP)=\chi(P)\,D(M). The homomorphism theorem again gives χ(P)=g(detP)\chi(P)=g(\det P) — with degree nn this is the weight-2 density law D(PTMP)=(detP)2D(M)D(P^{\mathsf T}MP)=(\det P)^{2}D(M). But congruence does not act transitively on the invertible matrices, so Step 3 collapses and DD is not determined: the cosquare impostors of the companion document,

D(M)=det(M)exp ⁣(trβ(S+S1)),S=MTM,D(M)=\det(M)\,\exp\!\big(\operatorname{tr}\,\beta(S+S^{-1})\big),\qquad S=M^{-\mathsf T}M,

are genuine weight-2 relative invariants of congruence (D(PTMP)=(detP)2D(M)D(P^{\mathsf T}MP)=(\det P)^2D(M) holds exactly) yet differ from det\det. They are not relative invariants of the two-slot action — the ratio D(ATMB)/D(M)D(A^{\mathsf T}MB)/D(M) depends on MM when ABA\neq B — which is precisely why enlarging congruence to the full two-slot group rescues the derivation. In the language of prehomogeneous vector spaces, (GL(V)×GL(V), Matn, MATMB)\big(GL(V)\times GL(V),\ \mathrm{Mat}_n,\ M\mapsto A^{\mathsf T}MB\big) has a dense orbit (the invertible matrices), and its relative invariants form the free group generated by a single irreducible one — the determinant. Relative invariance therefore characterizes det\det, provided it is imposed for the two independent slots that the tensor TVVT\in V^{*}\otimes V^{*} actually has.


Appendix D: Deriving the relative-invariance equation from covariance in each slot

The equation

D(ATMB)=χ(A,B)D(M)D(A^{\mathsf T}MB)=\chi(A,B)\,D(M)

is a pure rescaling (covariance) statement: it says the two-slot operation multiplies DD by a number independent of MM. It contains no antisymmetry. So it ought to be derived from a covariance hypothesis — not by writing down the antisymmetric determinant and verifying, which only confirms it for the one function we already suspected. Here is a derivation whose single ingredient is relative invariance itself, imposed one slot at a time.

The primitive: DD is a relative scalar in each slot. A (0,2)(0,2) tensor has two independent arguments — it is bilinear. Recombining the first argument by an invertible AA, i.e. replacing T(v,w)T(v,w) by T(Av,w)T(Av,w), changes the components by

Mij  T(Aei,ej)=AkiMkj=(ATM)ij,M_{ij}\ \longmapsto\ T(Ae_i,e_j)=A_{ki}M_{kj}=(A^{\mathsf T}M)_{ij},

and recombining the second argument by BB, i.e. T(v,w)T(v,Bw)T(v,w)\mapsto T(v,Bw), gives MMBM\mapsto MB. Each of these is a change of basis within one slot. The defining property of a density (a relative scalar) attached to the tensor is that such a change of basis rescales it by a factor that depends only on the change, not on the tensor:

D(ATM)=α(A)D(M),D(MB)=β(B)D(M).()D(A^{\mathsf T}M)=\alpha(A)\,D(M),\qquad D(MB)=\beta(B)\,D(M). \tag{$\dagger$}

This is the natural covariance assumption. It mentions no antisymmetry and builds nothing; it is the same kind of statement as “a weight-ww density transforms by (detP)w(\det P)^{w}”, written before the factor is known. (It is also genuinely non-trivial: setting M=IM=I already gives D(AT)=α(AT)D(I)D(A^{\mathsf T})=\alpha(A^{\mathsf T})\,D(I), so DD on invertible matrices is essentially the factor itself — relative invariance in even one slot is nearly as strong as being the determinant. That strength is unavoidable, by Appendix C; what we can choose is to assume it as a clean covariance law rather than to construct it.)

Two-slot invariance is the product of the two. The first- and second-slot operations are independent and commute, AT(MB)=(ATM)BA^{\mathsf T}(MB)=(A^{\mathsf T}M)B, so applying both and using (\dagger) twice,

D(ATMB)=D(AT(MB))=α(A)D(MB)=α(A)β(B)D(M).D(A^{\mathsf T}MB)=D\big(A^{\mathsf T}(MB)\big)=\alpha(A)\,D(MB)=\alpha(A)\,\beta(B)\,D(M).

Hence

D(ATMB)=χ(A,B)D(M),χ(A,B):=α(A)β(B),\boxed{\,D(A^{\mathsf T}MB)=\chi(A,B)\,D(M),\qquad \chi(A,B):=\alpha(A)\,\beta(B)\,,}

with χ\chi manifestly independent of MM. The two-slot equation is nothing but per-slot covariance imposed in each of the two arguments — no antisymmetric contraction anywhere, as befits an equation that is not antisymmetric in anything.

The factors are automatically multiplicative. Composition within one slot forces α\alpha and β\beta to be characters. Recombining the first argument by A1A_1 and then by A2A_2 is recombining it by A2A1A_2A_1; since (A2A1)TM=A1T(A2TM)(A_2A_1)^{\mathsf T}M=A_1^{\mathsf T}(A_2^{\mathsf T}M),

α(A2A1)D(M)=D(A1T(A2TM))=α(A1)α(A2)D(M),\alpha(A_2A_1)\,D(M)=D\big(A_1^{\mathsf T}(A_2^{\mathsf T}M)\big)=\alpha(A_1)\,\alpha(A_2)\,D(M),

so α(A1A2)=α(A1)α(A2)\alpha(A_1A_2)=\alpha(A_1)\alpha(A_2), and likewise β(B1B2)=β(B1)β(B2)\beta(B_1B_2)=\beta(B_1)\beta(B_2). Thus α,β:GL(V)K\alpha,\beta:GL(V)\to K^{*} are multiplicative characters — a derived consequence, not an assumption.

What remains. We now have the relative-invariance equation with χ=αβ\chi=\alpha\beta and α,β\alpha,\beta characters, obtained from covariance alone. Appendix C finishes the job: the homomorphism theorem forces α=gdet\alpha=g\circ\det and β=gdet\beta=g\circ\det, and homogeneity fixes g=idg=\operatorname{id}, giving χ(A,B)=det(A)det(B)\chi(A,B)=\det(A)\det(B) and D=detD=\det. The determinant is therefore the value of the factor, never an input.

Why per-slot, and not change of basis. Imposing (\dagger) in each slot treats the two arguments independently, AA and BB unrelated — legitimate precisely because TT is bilinear. An honest change of basis of the single space VV ties the slots together, A=B=PA=B=P, and yields only D(PTMP)=α(P)β(P)D(M)D(P^{\mathsf T}MP)=\alpha(P)\beta(P)D(M) — the weight law of Section 2. That diagonal case is strictly weaker and does not give back (\dagger): the cosquare impostors of Appendix C obey it yet fail to be relatively invariant slot by slot. All the force is in allowing ABA\neq B, i.e. in reading the bilinearity of TT as covariance in each argument on its own.