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 be an -dimensional vector space over a field (think or ), and let be a tensor on — i.e. a bilinear form
No symmetry is assumed: is completely arbitrary. Fix a basis . The components of form the Gram matrix
We ask: what scalar deserves to be called the determinant of , and is it uniquely forced?
2. How the components transform¶
Change basis by , writing . Then
so the components transform by
Taking determinants, . Thus is not a basis-independent number: under a change of basis it is multiplied by . 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 takes two independent arguments, any pair of linear maps yields a new bilinear form
Its components are
so the Gram matrix of is . The change of basis of Section 2 is exactly the diagonal special case .
4. The axioms¶
We seek a rule that assigns to each bilinear form — equivalently, to its Gram matrix — a scalar , subject to just two requirements.
Axiom I (bilinear weight law). Transforming the two slots independently multiplies the answer by the corresponding determinants:
Axiom II (normalization).
Why these are the natural axioms. A tensor is an element of , whose two covariant slots are a priori independent copies of . Axiom I says the determinant scales by one factor of in each slot separately — precisely as a volume form is multilinear and alternating in each of its arguments. Setting , Axiom I already contains the weight-2 density law 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 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 ; why one is entitled to transform the two slots independently is taken up in Appendix D.
5. Derivation¶
We show Axioms I–II force , in two short steps. Assume has more than two elements (e.g. or ).
Step 1 — nondegenerate forms. Let be invertible. Apply Axiom I to the reference matrix , with and . Since ,
the last equality by Axiom II. Hence for every invertible .
Step 2 — degenerate forms. Let be singular; we show without any extra axiom. Since , the map has a nontrivial kernel: there is a column vector with . Pick a row vector with , where and (possible: , so can be scaled to any value, and has an element outside ). Set
Because ,
Now apply Axiom I with :
As , this forces .
Combining the two steps, for all .
6. Existence¶
Uniqueness is only meaningful if a solution exists at all — and the determinant itself is one:
the first equality by multiplicativity of . So is the one and only rule satisfying Axioms I–II.
7. Conclusion¶
For an arbitrary tensor with components , the determinant is forced to be
and, by Section 2, it is not a scalar but a density of weight 2, transforming as under a change of basis .
Two closing remarks:
Nothing used any symmetry of . The derivation applies verbatim to symmetric, antisymmetric, and fully general bilinear forms alike. No regularity hypothesis (polynomiality, continuity, …) was needed: Axiom I is strong enough on its own because the operation already reaches every invertible matrix from .
Axiom I is not a primitive assumption — it can be derived. The factors on its right-hand side are determinants of the endomorphisms , i.e. the ordinary scalar determinant. Taking that as the only primitive and defining the tensor determinant functorially, , turns Axiom I into a theorem. This is carried out in the Appendix.
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 ). 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 is one-dimensional. Any endomorphism induces a linear map , which — being a linear map of a line to itself — is multiplication by a scalar. Define that scalar to be :
Concretely, expanding multilinearly and using antisymmetry of ,
so this scalar is the usual Leibniz determinant of the matrix of . Two properties are immediate from the fact that is a functor (it respects composition and identities):
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 tensor is the same data as the linear “lowering” map
Applying the functor to it gives a map between the two lines and :
In the bases and , the matrix of is , so is multiplication by — it is exactly , now seen as the canonical element of the weight-2 density line .
A.3 Deriving Axiom I. Compute the lowering map of . For any ,
where is the dual map, . Hence, as maps ,
Apply the functor and use together with A.1 (noting , since the matrix of is ):
This is Axiom I.
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 . Nothing about tensors had to be assumed beyond the definition .
Remark (an equivalent, purely matrix-level answer). If one prefers to avoid exterior algebra, Axiom I is also equivalent — given — to the classical characterization of as the unique function that is multilinear and alternating in the columns (or rows) of . From that characterization , and then 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 , and ):
(M) Multiplicativity. for all .
(H) Homogeneity. for all .
Step 1 — multiplicativity alone gives . On the map takes values in — if vanished at one invertible , then and hence — so is a group homomorphism. The factorization theorem of Determinant From Homomorphism then yields
for some homomorphism . (There is the Leibniz polynomial, proved single-valued and multiplicative on .) Thus multiplicativity by itself already determines up to the single character .
Step 2 — homogeneity fixes . Apply (H) at : on one hand , on the other . Hence
Because is algebraically closed, every is an -th power, so for all : and on .
Step 3 — singular matrices. If , column-reduce: choose invertible so that has a zero column, say the last. Then satisfies , so . Taking forces , hence . So everywhere.
Two caveats — and why this set is less natural than Axiom I.
The same even- subtlety over . Over , Step 2 only gives on the -th powers . For odd that is all of , so . For even it is only , leaving free: gives , while gives the impostor — genuinely multiplicative and homogeneous of even degree. One extra sign normalization (e.g. ) removes it. This is the very same ambiguity met in Sections 7.5 of the companion document.
Multiplicativity is a consequence, not a more primitive axiom. For a tensor the product of two Gram matrices is not a tensorial operation: under a change of basis , , the product transforms as unless is orthogonal. So (M) silently invokes the endomorphism structure, whereas the two-slot law is basis-natural. Indeed (M) follows from our result: once (Sections 4–5), , the multiplicativity of the Leibniz polynomial. So the answer to “can we prove ?” is yes — it is a theorem for every satisfying the axioms of Section 4; one may instead assume it (with (H)) as a starting point, at the price of the field caveat and a less tensor-native hypothesis.
Appendix C: Deriving Axiom I from relative invariance¶
Axiom I prescribes the exact multiplier . 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 be a relative invariant of the natural symmetry group, with the character left completely unspecified.
The bare hypothesis (relative invariance). Say (with ) is a relative invariant of the two-slot action if there is some function with
Nothing about is presupposed — this is just the statement that the symmetry group rescales by a scalar, the defining property of a density / relative invariant.
Step 1 — the character separates and is multiplicative. Put and . Writing and applying the hypothesis one slot at a time,
Moreover is a homomorphism: from ,
so ; likewise . Thus are multiplicative characters.
Step 2 — every character of factors through . By the factorization theorem of Determinant From Homomorphism (taking ), and for homomorphisms . Hence the multiplier is forced to be built from the two determinants:
This is the whole point: relative invariance alone already says the factor can only depend on through and .
Step 3 — reach from , and . For invertible , normalize and compute two ways. Through the second slot, gives ; through the first slot, gives . Equating, , and
Step 4 — homogeneity fixes . Assume is homogeneous of degree (the only natural choice: of an matrix has degree ). Then for all , and since every element of is an -th power, . Therefore
which is exactly Axiom I, now derived. The degenerate case follows as in Section 5 (or Appendix B, Step 3).
Why the group must be the full two-slot — not just change of basis. It is tempting to apply the same idea to the genuine basis-change group, i.e. congruence , asking only that . The homomorphism theorem again gives — with degree this is the weight-2 density law . But congruence does not act transitively on the invertible matrices, so Step 3 collapses and is not determined: the cosquare impostors of the companion document,
are genuine weight-2 relative invariants of congruence ( holds exactly) yet differ from . They are not relative invariants of the two-slot action — the ratio depends on when — which is precisely why enlarging congruence to the full two-slot group rescues the derivation. In the language of prehomogeneous vector spaces, 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 , provided it is imposed for the two independent slots that the tensor actually has.
Appendix D: Deriving the relative-invariance equation from covariance in each slot¶
The equation
is a pure rescaling (covariance) statement: it says the two-slot operation multiplies by a number independent of . 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: is a relative scalar in each slot. A tensor has two independent arguments — it is bilinear. Recombining the first argument by an invertible , i.e. replacing by , changes the components by
and recombining the second argument by , i.e. , gives . 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:
This is the natural covariance assumption. It mentions no antisymmetry and builds nothing; it is the same kind of statement as “a weight- density transforms by ”, written before the factor is known. (It is also genuinely non-trivial: setting already gives , so 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, , so applying both and using () twice,
Hence
with manifestly independent of . 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 and to be characters. Recombining the first argument by and then by is recombining it by ; since ,
so , and likewise . Thus are multiplicative characters — a derived consequence, not an assumption.
What remains. We now have the relative-invariance equation with and characters, obtained from covariance alone. Appendix C finishes the job: the homomorphism theorem forces and , and homogeneity fixes , giving and . The determinant is therefore the value of the factor, never an input.
Why per-slot, and not change of basis. Imposing () in each slot treats the two arguments independently, and unrelated — legitimate precisely because is bilinear. An honest change of basis of the single space ties the slots together, , and yields only — the weight law of Section 2. That diagonal case is strictly weaker and does not give back (): the cosquare impostors of Appendix C obey it yet fail to be relatively invariant slot by slot. All the force is in allowing , i.e. in reading the bilinearity of as covariance in each argument on its own.