The Determinant as an Alternating Form

What is the determinant of a linear operator, really? This is true once you strip away the cofactor formulas and row-reduction algorithms. A student first meets the determinant as a number. It is built from an n×nn\times n array of scalars. This uses an intimidating alternating sum over permutations. This works, but it hides the real content. The determinant measures how a linear map scales signed volume. It does so without depending on any choice of coordinates. The goal of this article is to construct that invariant honestly. We use the top exterior power of a vector space. We then show it recovers — and explains — the familiar matrix determinant. The key idea is to isolate the algebraic property that makes "signed volume" well-defined. It is a function of nn vectors. It is linear in each argument separately. It is also forced to vanish whenever two arguments coincide. Such a function is called an alternating multilinear form. A cornerstone fact, taken as known here from Existence and Uniqueness of the Determinant, is this: on an nn-dimensional space, the space of alternating nn-linear forms is one-dimensional. This single dimension count is the entire reason a coordinate-free determinant exists. Pick any nonzero alternating nn-form ω\omega. Every linear operator TT acts on that one-dimensional space by some scalar. We define this scalar to be det⁡T\det T. This construction matters because it severs the determinant from any particular basis. The classical formula det⁡[aij]=∑σsgn⁡(σ)∏iai,σ(i)\det[a_{ij}] = \sum_{\sigma} \operatorname{sgn}(\sigma) \prod_i a_{i,\sigma(i)} looks like it depends on writing TT as a matrix. But the exterior-power viewpoint shows something different. The resulting number is an intrinsic feature of the linear map T:V→VT: V \to V itself. Changing basis conjugates the matrix of TT. The exterior power construction will show this conjugation cannot change the scalar produced. That basis-independence, together with the multiplicative behavior of the induced scalar, are the two facts this framework is built to deliver. This article develops the top exterior power ΛnV\Lambda^n V. It shows this space is one-dimensional when dim⁡V=n\dim V = n. It defines det⁡T\det T as the scalar by which TT acts on ΛnV\Lambda^n V. It then proves this agrees with the matrix determinant computed in any basis. Along the way we make rigorous the intuitive picture of the determinant. This picture treats it as a signed volume distortion factor. This sets up the coordinate-free proofs of Basis-Independence of the Determinant and Multiplicativity of the Determinant.

Key takeaways
  • An alternating nn-linear form on an nn-dimensional space is unique up to scalar multiple — the space of such forms is 11-dimensional.
  • A linear operator T:V→VT:V\to V acts on this 11-dimensional space of top forms by multiplication by a single scalar.
  • That scalar is defined to be det⁡T\det T, and it is by construction independent of any basis or matrix representation.
  • Composing operators corresponds to composing these scalar actions, which is the seed of multiplicativity: det⁡(ST)=det⁡(S)det⁡(T)\det(ST) = \det(S)\det(T).
  • Choosing a basis and unwinding the definition on standard basis vectors reproduces exactly the classical permutation-sum formula for det⁡\det of a matrix.
  • Key idea: the determinant is the unique scalar by which TT rescales the (one-dimensional) space of alternating top-degree forms on VV.

Where this lives today

The top exterior power ΛnV\Lambda^n V underlies the modern definition of orientation in differential geometry: an orientation of an nn-manifold is a consistent choice of generator of Λn(TpM)∗\Lambda^n(T_pM)^* at each point, and the determinant of the Jacobian of a coordinate change is exactly the scalar by which the top form transforms — a direct descendant of this construction. In differential forms and Stokes' theorem, the top-degree form dx1∧⋯∧dxndx_1 \wedge \cdots \wedge dx_n plays the role of ω0\omega_0, and pullback of forms under a diffeomorphism generalizes the operator action T∗ωT^*\omega studied here. In multivariable calculus, the change-of-variables formula for integrals features the absolute value of the Jacobian determinant precisely because it is the scalar factor by which the volume form is rescaled. In physics, the Jacobian determinant of a canonical transformation appearing in Liouville's theorem (conservation of phase-space volume in Hamiltonian mechanics) is again this same scalar, now acting on Λ2n\Lambda^{2n} of phase space. In algebraic geometry and representation theory, ΛnV\Lambda^n V for VV an nn-dimensional representation is the determinant representation, a one-dimensional representation whose character is exactly det⁡T\det T on group elements TT; this is a fundamental building block in the representation theory of GLnGL_n and appears throughout invariant theory. In numerical linear algebra and computer graphics, the sign and magnitude of det⁡T\det T for a transformation matrix TT tells you instantly whether an orientation (e.g., of a triangle mesh) is preserved or flipped, and by what volumetric factor — a direct computational shadow of the coordinate-free scalar constructed here.

Ask the tutor: Why does the alternating property alone force dim⁡Λn(V∗)=1\dim \Lambda^n(V^*) = 1 when dim⁡V=n\dim V = n, and where exactly does the proof of that fact use the assumption that we're looking at exactly nn-linear forms rather than kk-linear forms for k≠nk \ne n?

DefinitionAlternating multilinear forms and the determinant of an operator

Let VV be a vector space over a field F\mathbb{F} with dim⁡V=n<∞\dim V = n < \infty.

Multilinear form. A function ω:Vn→F\omega : V^n \to \mathbb{F} is nn-linear (or multilinear) if for each index i∈{1,…,n}i \in \{1,\dots,n\} and each fixed choice of the other n−1n-1 vectors, the map

v↦ω(v1,…,vi−1,v,vi+1,…,vn)v \mapsto \omega(v_1,\dots,v_{i-1}, v, v_{i+1},\dots, v_n)

is linear.

Alternating form. An nn-linear form ω\omega is alternating if

ω(v1,…,vn)=0whenever vi=vj for some i≠j.\omega(v_1,\dots,v_n) = 0 \quad \text{whenever } v_i = v_j \text{ for some } i \neq j.

Write Λn(V∗)\Lambda^n(V^*) (or Alt⁡n(V)\operatorname{Alt}^n(V)) for the vector space of all alternating nn-linear forms Vn→FV^n \to \mathbb{F}, with pointwise addition and scalar multiplication. This is the space we call the top exterior power of the dual, since n=dim⁡Vn = \dim V.

The one-dimensionality fact. When dim⁡V=n\dim V = n, the space Λn(V∗)\Lambda^n(V^*) is one-dimensional. (This is precisely the content established by the existence-and-uniqueness theorem for determinants: fixing a basis e1,…,ene_1,\dots,e_n of VV, there is exactly one alternating nn-form ω0\omega_0 with ω0(e1,…,en)=1\omega_0(e_1,\dots,e_n) = 1, and every alternating nn-form is a scalar multiple of ω0\omega_0.)

The determinant of an operator. Let T:V→VT : V \to V be linear. For any ω∈Λn(V∗)\omega \in \Lambda^n(V^*), define T∗ω:Vn→FT^*\omega : V^n \to \mathbb{F} by

(T∗ω)(v1,…,vn)=ω(Tv1,…,Tvn).(T^*\omega)(v_1,\dots,v_n) = \omega(Tv_1,\dots,Tv_n).

One checks T∗ωT^*\omega is again alternating and nn-linear (this is Lemma 1 below), so T∗T^* is a linear map Λn(V∗)→Λn(V∗)\Lambda^n(V^*) \to \Lambda^n(V^*). Since Λn(V∗)\Lambda^n(V^*) is one-dimensional, T∗T^* acts as multiplication by a single scalar. The determinant of TT, written det⁡T\det T, is that scalar:

T∗ω=(det⁡T) ωfor every ω∈Λn(V∗).T^*\omega = (\det T)\,\omega \qquad \text{for every } \omega \in \Lambda^n(V^*).

Equivalently, for any nonzero ω0∈Λn(V∗)\omega_0 \in \Lambda^n(V^*) and any v1,…,vn∈Vv_1,\dots,v_n \in V,

ω0(Tv1,…,Tvn)=(det⁡T) ω0(v1,…,vn).\omega_0(Tv_1,\dots,Tv_n) = (\det T)\, \omega_0(v_1,\dots,v_n).

Intuition

Think of an alternating nn-form ω\omega on an nn-dimensional space VV as a signed volume functional: ω(v1,…,vn)\omega(v_1,\dots,v_n) measures the signed volume of the parallelepiped spanned by v1,…,vnv_1,\dots,v_n, relative to some fixed unit of volume. Multilinearity captures the idea that stretching one edge of the parallelepiped by a scalar cc scales the volume by cc, and additivity in each slot encodes how volumes combine when you shear one edge by adding another vector to it. The alternating condition — vanishing when two arguments coincide — encodes the geometric fact that a degenerate parallelepiped (two edges equal, hence lying in a common line) has zero volume. The one-dimensionality of Λn(V∗)\Lambda^n(V^*) says something remarkable: up to an overall scalar, there is only one notion of signed volume on an nn-dimensional space. Any two alternating top-forms are proportional. This matches intuition — once you fix a unit cube's volume to be 11, the volume of every other parallelepiped is determined. Since a linear operator TT sends the "unit" parallelepiped spanned by any v1,…,vnv_1,\dots,v_n to the parallelepiped spanned by Tv1,…,TvnTv_1,\dots,Tv_n, and since all volume functionals are proportional, TT must scale every volume functional by the same factor. That universal scaling factor is det⁡T\det T.

Figure
A linear operator TT scales the signed area of every parallelogram by the same factor det⁡T=2\det T = 2
v₁ v₂ area = ω(v₁,v₂) Domain: parallelogram spanned by v₁, v₂ Tv₁ Tv₂ area = ω(Tv₁,Tv₂) = 2·ω(v₁,v₂) Image: spanned by Tv₁, Tv₂

proof-technique preview

Because the entire framework rests on Λn(V∗)\Lambda^n(V^*) being one-dimensional, the theorem below both re-derives the key structural facts (that T∗T^* is a well-defined scalar operator) and proves that this scalar, computed via any basis, is exactly the classical matrix determinant. The technique is direct construction plus uniqueness: build the candidate scalar, then show it must equal the standard determinant by testing it against the standard basis.

TheoremThe operator determinant equals the matrix determinant

Let VV be an nn-dimensional vector space over a field F\mathbb{F}, let T:V→VT : V \to V be linear, and let β=(e1,…,en)\beta = (e_1,\dots,e_n) be any basis of VV. Let A=[T]βA = [T]_\beta be the matrix of TT with respect to β\beta. Then: 1. For every alternating nn-linear form ω\omega on VV, the map T∗ωT^*\omega defined by (T∗ω)(v1,…,vn)=ω(Tv1,…,Tvn)(T^*\omega)(v_1,\dots,v_n) = \omega(Tv_1,\dots,Tv_n) is again an alternating nn-linear form. 2. There is a unique scalar c∈Fc \in \mathbb{F}, depending only on TT (not on ω\omega or β\beta), such that T∗ω=c ωT^*\omega = c\,\omega for every alternating nn-form ω\omega. 3. This scalar equals the classical determinant of the matrix AA:

c=det⁡A=∑σ∈Snsgn⁡(σ)∏i=1naσ(i),i.c = \det A = \sum_{\sigma \in S_n} \operatorname{sgn}(\sigma) \prod_{i=1}^n a_{\sigma(i), i}.

We define det⁡T:=c\det T := c; part 3 shows this agrees with det⁡[T]β\det[T]_\beta for every choice of basis β\beta.

Proof

Step 1: T∗ωT^*\omega is alternating and nn-linear. Let ω∈Λn(V∗)\omega \in \Lambda^n(V^*) and fix TT linear. To check multilinearity in slot ii, fix vectors v1,…,vi−1,vi+1,…,vnv_1,\dots,v_{i-1},v_{i+1},\dots,v_n and consider

f(v):=(T∗ω)(v1,…,vi−1,v,vi+1,…,vn)=ω(Tv1,…,Tvi−1,Tv,Tvi+1,…,Tvn).f(v) := (T^*\omega)(v_1,\dots,v_{i-1},v,v_{i+1},\dots,v_n) = \omega(Tv_1,\dots,Tv_{i-1},Tv,Tv_{i+1},\dots,Tv_n).

Since TT is linear, v↦Tvv \mapsto Tv is linear, and since ω\omega is linear in its ii-th slot, the composite ff is linear in vv: for v,w∈Vv,w \in V and scalars a,ba,b,

f(av+bw)=ω(…,T(av+bw),… )=ω(…,aTv+bTw,… )=a ω(…,Tv,… )+b ω(…,Tw,… )=af(v)+bf(w),f(av+bw) = \omega(\dots, T(av+bw), \dots) = \omega(\dots, aTv + bTw, \dots) = a\,\omega(\dots,Tv,\dots) + b\,\omega(\dots,Tw,\dots) = af(v)+bf(w),

using linearity of ω\omega in the ii-th argument. This holds for every ii, so T∗ωT^*\omega is nn-linear. For the alternating property, suppose vi=vjv_i = v_j for some i≠ji \ne j. Then Tvi=TvjTv_i = Tv_j, so the ii-th and jj-th arguments of ω\omega in (T∗ω)(v1,…,vn)=ω(Tv1,…,Tvn)(T^*\omega)(v_1,\dots,v_n) = \omega(Tv_1,\dots,Tv_n) coincide. Since ω\omega is alternating, ω(Tv1,…,Tvn)=0\omega(Tv_1,\dots,Tv_n) = 0. Hence T∗ωT^*\omega is alternating. This proves part 1, and in particular shows T∗:Λn(V∗)→Λn(V∗)T^* : \Lambda^n(V^*) \to \Lambda^n(V^*) is a well-defined map; it is visibly linear in ω\omega since (T∗(aω+bω′))(v1,…,vn)=aω(Tv1,…,Tvn)+bω′(Tv1,…,Tvn)(T^*(a\omega+b\omega'))(v_1,\dots,v_n) = a\omega(Tv_1,\dots,Tv_n)+b\omega'(Tv_1,\dots,Tv_n).

Step 2: T∗T^* is scalar multiplication on the one-dimensional space Λn(V∗)\Lambda^n(V^*). By hypothesis (the existence-and-uniqueness theorem for determinants, taken as known), dim⁡Λn(V∗)=1\dim \Lambda^n(V^*) = 1. Fix any nonzero ω0∈Λn(V∗)\omega_0 \in \Lambda^n(V^*); it is a basis for this one-dimensional space. By Step 1, T∗ω0∈Λn(V∗)T^*\omega_0 \in \Lambda^n(V^*), so there is a unique scalar c∈Fc \in \mathbb{F} with

T∗ω0=c ω0.T^*\omega_0 = c\,\omega_0.

Now let ω\omega be any element of Λn(V∗)\Lambda^n(V^*). Since Λn(V∗)\Lambda^n(V^*) is one-dimensional and ω0≠0\omega_0 \ne 0, there is a scalar λ\lambda with ω=λω0\omega = \lambda \omega_0. Using linearity of T∗T^* (established in Step 1):

T∗ω=T∗(λω0)=λ T∗ω0=λ c ω0=c (λω0)=c ω.T^*\omega = T^*(\lambda \omega_0) = \lambda\, T^*\omega_0 = \lambda\, c\,\omega_0 = c\,(\lambda \omega_0) = c\,\omega.

Thus the same scalar cc satisfies T∗ω=c ωT^*\omega = c\,\omega for every ω∈Λn(V∗)\omega \in \Lambda^n(V^*), not just for ω0\omega_0. This proves existence in part 2. For uniqueness of cc: since ω0≠0\omega_0 \ne 0, there exist vectors u1,…,unu_1,\dots,u_n with ω0(u1,…,un)≠0\omega_0(u_1,\dots,u_n) \ne 0 (an alternating form that vanishes on every nn-tuple is the zero form). If cc and c′c' both satisfy T∗ω0=c ω0=c′ ω0T^*\omega_0 = c\,\omega_0 = c'\,\omega_0, then evaluating at (u1,…,un)(u_1,\dots,u_n) gives c ω0(u1,…,un)=c′ ω0(u1,…,un)c\,\omega_0(u_1,\dots,u_n) = c'\,\omega_0(u_1,\dots,u_n), and since ω0(u1,…,un)≠0\omega_0(u_1,\dots,u_n) \ne 0 we may cancel to get c=c′c = c'. This proves part 2 in full, and shows cc does not depend on the choice of ω\omega used to compute it.

Step 3: computing cc via a basis identifies it with det⁡A\det A. By the existence-and-uniqueness theorem, fix the basis β=(e1,…,en)\beta = (e_1,\dots,e_n) and let ω0\omega_0 be the alternating nn-form normalized by ω0(e1,…,en)=1\omega_0(e_1,\dots,e_n) = 1 (such a form exists and is unique by that theorem). Write A=[aij]A = [a_{ij}] for the matrix of TT in β\beta, so that

Tej=∑i=1naijei,j=1,…,n.T e_j = \sum_{i=1}^n a_{ij} e_i, \qquad j = 1,\dots,n.

By Step 2, cc is characterized by T∗ω0=c ω0T^*\omega_0 = c\,\omega_0; evaluating both sides at (e1,…,en)(e_1,\dots,e_n):

c=c⋅ω0(e1,…,en)=(T∗ω0)(e1,…,en)=ω0(Te1,…,Ten).c = c \cdot \omega_0(e_1,\dots,e_n) = (T^*\omega_0)(e_1,\dots,e_n) = \omega_0(Te_1,\dots,Te_n).

Now expand using multilinearity of ω0\omega_0 in each slot, substituting Tej=∑iaijeiTe_j = \sum_i a_{ij} e_i:

ω0(Te1,…,Ten)=ω0 ⁣(∑i1ai1,1ei1,…,∑inain,nein)=∑i1,…,in=1nai1,1⋯ain,n  ω0(ei1,…,ein),\omega_0(Te_1,\dots,Te_n) = \omega_0\!\left(\sum_{i_1} a_{i_1,1} e_{i_1}, \dots, \sum_{i_n} a_{i_n,n} e_{i_n}\right) = \sum_{i_1,\dots,i_n=1}^n a_{i_1,1}\cdots a_{i_n,n}\; \omega_0(e_{i_1},\dots,e_{i_n}),

where the sum is over all functions {1,…,n}→{1,…,n}\{1,\dots,n\}\to\{1,\dots,n\} sending j↦ijj \mapsto i_j, by iterated linearity in each of the nn slots. Since ω0\omega_0 is alternating, ω0(ei1,…,ein)=0\omega_0(e_{i_1},\dots,e_{i_n}) = 0 whenever two of the indices i1,…,ini_1,\dots,i_n coincide (this is the alternating property applied directly). So only terms where j↦ijj \mapsto i_j is a bijection, i.e. a permutation σ∈Sn\sigma \in S_n with ij=σ(j)i_j = \sigma(j), survive:

c=∑σ∈Snaσ(1),1⋯aσ(n),n  ω0(eσ(1),…,eσ(n)).c = \sum_{\sigma \in S_n} a_{\sigma(1),1}\cdots a_{\sigma(n),n}\; \omega_0(e_{\sigma(1)},\dots,e_{\sigma(n)}).

It remains to identify ω0(eσ(1),…,eσ(n))\omega_0(e_{\sigma(1)},\dots,e_{\sigma(n)}). A standard property of alternating forms (again part of the existence-and-uniqueness theorem's toolkit, provable by induction on the number of transpositions in σ\sigma) is that permuting the arguments of an alternating form by σ\sigma multiplies its value by sgn⁡(σ)\operatorname{sgn}(\sigma):

ω0(eσ(1),…,eσ(n))=sgn⁡(σ) ω0(e1,…,en)=sgn⁡(σ)⋅1=sgn⁡(σ).\omega_0(e_{\sigma(1)},\dots,e_{\sigma(n)}) = \operatorname{sgn}(\sigma)\,\omega_0(e_1,\dots,e_n) = \operatorname{sgn}(\sigma)\cdot 1 = \operatorname{sgn}(\sigma).

(Briefly: swapping two arguments of an alternating multilinear form negates it — expand 0=ω(…,v+w,…,v+w,… )0 = \omega(\dots,v+w,\dots,v+w,\dots) by bilinearity in those two slots to see ω(…,v,…,w,… )=−ω(…,w,…,v,… )\omega(\dots,v,\dots,w,\dots) = -\omega(\dots,w,\dots,v,\dots) — and every permutation is a product of transpositions, each contributing a factor of sgn⁡\operatorname{sgn}.) Substituting back,

c=∑σ∈Snsgn⁡(σ) aσ(1),1aσ(2),2⋯aσ(n),n,c = \sum_{\sigma \in S_n} \operatorname{sgn}(\sigma)\, a_{\sigma(1),1} a_{\sigma(2),2}\cdots a_{\sigma(n),n},

which is precisely the classical formula

det⁡A=∑σ∈Snsgn⁡(σ)∏i=1naσ(i),i.\det A = \sum_{\sigma \in S_n} \operatorname{sgn}(\sigma) \prod_{i=1}^n a_{\sigma(i),i}.

This proves part 3. Since cc was shown in Step 2 to be independent of the choice of ω\omega, and the computation above shows it equals det⁡A\det A for A=[T]βA = [T]_\beta regardless of which basis β\beta was used to define ω0\omega_0 and compute AA, the number c=det⁡Tc = \det T is a single well-defined scalar attached to the operator TT, computable as the matrix determinant in any basis. ■\blacksquare

∎

Worked examples

Example 1: a shear-and-scale operator on R3\mathbb{R}^3, computed via the top exterior power directly. Let V=R3V = \mathbb{R}^3 with standard basis e1,e2,e3e_1,e_2,e_3, and let TT be defined by

Te1=2e1+e3,Te2=e1+3e2−e3,Te3=−e2+4e3.Te_1 = 2e_1 + e_3, \qquad Te_2 = e_1 + 3e_2 - e_3, \qquad Te_3 = -e_2 + 4e_3.

So in the standard basis,

A=[T]β=(21003−11−14).A = [T]_\beta = \begin{pmatrix} 2 & 1 & 0 \\ 0 & 3 & -1 \\ 1 & -1 & 4 \end{pmatrix}.

We compute det⁡T\det T two ways to illustrate the equivalence proven above. Via the classical formula. Expanding along the first row:

det⁡A=2det⁡(3−1−14)−1det⁡(0−114)+0=2(12−1)−1(0−(−1))=2(11)−1(1)=22−1=21.\det A = 2\det\begin{pmatrix}3 & -1 \\ -1 & 4\end{pmatrix} - 1\det\begin{pmatrix}0 & -1 \\ 1 & 4\end{pmatrix} + 0 = 2(12-1) - 1(0-(-1)) = 2(11) - 1(1) = 22 - 1 = 21.

Via the alternating form directly. Let ω0\omega_0 be the unique alternating 33-form with ω0(e1,e2,e3)=1\omega_0(e_1,e_2,e_3) = 1 (this is the signed-volume form, and ω0(u,v,w)=det⁡[u ∣ v ∣ w]\omega_0(u,v,w) = \det[u\,|\,v\,|\,w] when u,v,wu,v,w are written in coordinates). By Step 3 of the theorem, det⁡T=ω0(Te1,Te2,Te3)\det T = \omega_0(Te_1,Te_2,Te_3). Expand by multilinearity:

ω0(Te1,Te2,Te3)=ω0(2e1+e3, e1+3e2−e3, −e2+4e3).\omega_0(Te_1,Te_2,Te_3) = \omega_0(2e_1+e_3,\ e_1+3e_2-e_3,\ -e_2+4e_3).

Rather than expanding all 2727 terms, we use the alternating property to discard repeated basis vectors term by term (equivalently, this reconstructs the permutation sum), which is exactly why the formula in Step 3 collapses to the six permutation terms of S3S_3. Carrying out that six-term sum with AA's entries: the permutations of {1,2,3}\{1,2,3\} contribute

σ=id:+a11a22a33=2⋅3⋅4=24σ=(23):−a11a32a23=−2⋅(−1)⋅(−1)=−2σ=(12):−a21a12a33=−0⋅1⋅4=0σ=(123):+a21a32a13=0⋅(−1)⋅0=0σ=(132):+a31a12a23=1⋅1⋅(−1)=−1σ=(13):−a31a22a13=−1⋅3⋅0=0\begin{aligned} \sigma = \mathrm{id}:&\quad +a_{11}a_{22}a_{33} = 2\cdot 3\cdot 4 = 24\\ \sigma = (23):&\quad -a_{11}a_{32}a_{23} = -2\cdot(-1)\cdot(-1) = -2\\ \sigma = (12):&\quad -a_{21}a_{12}a_{33} = -0\cdot 1\cdot 4 = 0\\ \sigma = (123):&\quad +a_{21}a_{32}a_{13} = 0\cdot(-1)\cdot 0 = 0\\ \sigma = (132):&\quad +a_{31}a_{12}a_{23} = 1\cdot 1\cdot(-1) = -1\\ \sigma = (13):&\quad -a_{31}a_{22}a_{13} = -1\cdot 3\cdot 0 = 0 \end{aligned}

Summing: 24−2+0+0−1+0=2124 - 2 + 0 + 0 - 1 + 0 = 21. This matches det⁡A=21\det A = 21 found above, confirming that ω0(Te1,Te2,Te3)\omega_0(Te_1,Te_2,Te_3) — the definition-theoretic computation of det⁡T\det T — agrees exactly with the classical cofactor expansion, as guaranteed by the theorem.

Example 2: basis-change invariance made explicit. Let T:R2→R2T : \mathbb{R}^2 \to \mathbb{R}^2 be given in the standard basis β=(e1,e2)\beta = (e_1,e_2) by

A=[T]β=(4123),det⁡A=4⋅3−1⋅2=10.A = [T]_\beta = \begin{pmatrix} 4 & 1 \\ 2 & 3 \end{pmatrix}, \qquad \det A = 4\cdot 3 - 1\cdot 2 = 10.

Now switch to the (non-orthogonal, asymmetric) basis β′=(f1,f2)\beta' = (f_1, f_2) with f1=e1+e2f_1 = e_1 + e_2, f2=e1−2e2f_2 = e_1 - 2e_2. The change-of-basis matrix from β′\beta'-coordinates to β\beta-coordinates is

P=(111−2),det⁡P=1⋅(−2)−1⋅1=−3,P−1=1−3(−2−1−11)=(2/31/31/3−1/3).P = \begin{pmatrix} 1 & 1 \\ 1 & -2 \end{pmatrix}, \qquad \det P = 1\cdot(-2) - 1\cdot 1 = -3, \qquad P^{-1} = \frac{1}{-3}\begin{pmatrix} -2 & -1 \\ -1 & 1 \end{pmatrix} = \begin{pmatrix} 2/3 & 1/3 \\ 1/3 & -1/3 \end{pmatrix}.

The matrix of TT in the new basis is A′=P−1APA' = P^{-1}AP. Compute:

AP=(4123)(111−2)=(525−4),AP = \begin{pmatrix}4&1\\2&3\end{pmatrix}\begin{pmatrix}1&1\\1&-2\end{pmatrix} = \begin{pmatrix}5 & 2\\ 5 & -4\end{pmatrix},
A′=P−1(AP)=(2/31/31/3−1/3)(525−4)=(103+5343−4353−5323+43)=(5002).A' = P^{-1}(AP) = \begin{pmatrix}2/3 & 1/3 \\ 1/3 & -1/3\end{pmatrix}\begin{pmatrix}5 & 2\\5 & -4\end{pmatrix} = \begin{pmatrix} \tfrac{10}{3}+\tfrac{5}{3} & \tfrac{4}{3}-\tfrac{4}{3} \\ \tfrac{5}{3}-\tfrac{5}{3} & \tfrac{2}{3}+\tfrac{4}{3}\end{pmatrix} = \begin{pmatrix} 5 & 0 \\ 0 & 2 \end{pmatrix}.

Then det⁡A′=5⋅2−0⋅0=10\det A' = 5 \cdot 2 - 0 \cdot 0 = 10, matching det⁡A=10\det A = 10 exactly. This is not a coincidence: the theorem shows both computations equal ω0(Tv1,Tv2)/ω0(v1,v2)\omega_0(Tv_1, Tv_2)/\omega_0(v_1,v_2)-type invariants — more precisely, the scalar cc by which T∗T^* acts on the one-dimensional space Λ2(V∗)\Lambda^2(V^*) — which by Step 2 of the proof does not depend on which basis was used to build AA or A′A'. This equality is the content foreshadowed by Basis-Independence of the Determinant: the exterior-power definition of det⁡T\det T makes such basis-invariance automatic rather than something to verify by direct matrix computation each time.

CounterexampleDropping finite-dimensionality collapses the construction

The entire argument hinges on the fact that Λn(V∗)\Lambda^n(V^*) is exactly one-dimensional when dim⁡V=n\dim V = n. If we drop the hypothesis that VV is finite-dimensional, this fails, and the notion of "the determinant of TT" as a single scalar breaks down. Let V=R(N)V = \mathbb{R}^{(\mathbb{N})}, the space of sequences (x1,x2,x3,… )(x_1,x_2,x_3,\dots) of real numbers with only finitely many nonzero terms, with basis e1,e2,e3,…e_1,e_2,e_3,\dots. There is no integer nn with dim⁡V=n\dim V = n; formally, dim⁡V=∞\dim V = \infty. Consider trying to build an alternating "top-degree" form. For every finite nn, one can still define an alternating nn-linear form

ωn(v1,…,vn)=det⁡[(vj)i]1≤i,j≤n\omega_n(v_1,\dots,v_n) = \det\big[(v_j)_i\big]_{1\le i,j\le n}

using just the first nn coordinates of each vector. But there is no single largest nn: for any candidate "top" degree nn, one can always find n+1n+1 linearly independent vectors, e.g. e1,…,en+1e_1,\dots,e_{n+1}, and ωn\omega_n is not even defined as an (n+1)(n+1)-linear form, while attempting to extend ωn\omega_n to more variables using the same recipe just produces a new, higher-degree alternating form, never a stable "the" top form. There is no integer NN for which ΛN(V∗)\Lambda^N(V^*) is one-dimensional and every alternating (N+1)(N+1)-form on VV vanishes — indeed alternating kk-forms exist for every kk, and none of the corresponding spaces is a natural "top" one. Consequently, the shift operator S(ei)=ei+1S(e_i) = e_{i+1} (linear, injective, not surjective) has no well-defined single scalar det⁡S\det S: for each finite nn, restricting to the subspace spanned by e1,…,ene_1,\dots,e_n and tracking how SS maps this into the span of e2,…,en+1e_2,\dots,e_{n+1} does not even give an endomorphism of a fixed finite-dimensional space, so the "acts by a scalar on Λn(V∗)\Lambda^n(V^*)" argument from Step 2 of the theorem has no analogue. The proof's Step 2 explicitly used dim⁡Λn(V∗)=1\dim \Lambda^n(V^*) = 1; without finite-dimensionality this hypothesis is simply unavailable, and the construction gives no scalar at all.

Scope, edge cases & common traps

SituationWhat happensWhy
dim⁡V=n\dim V = n, field F\mathbb{F} arbitraryTheorem applies verbatim; c∈Fc \in \mathbb{F}Proof used only field axioms and the one-dimensionality fact
dim⁡V=0\dim V = 0V={0}V = \{0\}; the unique alternating 00-form is ω0()=1\omega_0() = 1; every linear map T:V→VT:V\to V is the zero map on the zero space, and det⁡T=1\det T = 1 by conventionConsistent with det⁡\det of the empty matrix being 11
VV infinite-dimensionalNo well-defined "top" exterior power; construction failsSee counterexample above
TT not linearT∗ωT^*\omega need not be multilinear; whole construction collapsesStep 1 of the proof used linearity of TT in each slot
Field of characteristic 22Theorem still holds, but sgn⁡(σ)=±1\operatorname{sgn}(\sigma) = \pm 1 collapses since 1=−11 = -1; alternating and "antisymmetric" notions can diverge in general (not for forms built as here)Alternating is defined by vanishing on repeats, which is the robust notion in all characteristics

The mathematician behind it

Origins · 1 minHermann Grassmann and how this was discovered
HG
Hermann Grassmann
1809–1877 · Prussian mathematician, linguist, and schoolteacher

Hermann Grassmann worked largely outside the professional mathematical establishment of his day, teaching at a gymnasium in Stettin while developing, almost single-handedly, the theory of what we now call exterior algebra. His 1844 treatise Die lineale Ausdehnungslehre introduced the algebra of extended magnitudes — vectors, bivectors, and higher exterior products — laying the conceptual groundwork for treating "signed area" and "signed volume" as algebraic objects satisfying precise multilinear, alternating axioms, exactly the structure this article formalizes as Λn(V∗)\Lambda^n(V^*).

History
- 1844: Grassmann publishes the Ausdehnungslehre, introducing exterior products and the algebra of extended magnitudes.
- 1846: Cauchy and others had already developed determinants via permutation sums decades earlier, but lacked Grassmann's coordinate-free exterior algebra framing.
- 1862: Grassmann publishes a revised, clearer edition of the Ausdehnungslehre, still receiving little recognition in his lifetime.
- 1920s–1930s: Élie Cartan and Hermann Weyl popularize exterior algebra and differential forms, cementing Λn(V∗)\Lambda^n(V^*) as standard machinery in geometry.
- Mid-20th century: the coordinate-free treatment of the determinant via the one-dimensional top exterior power becomes standard in linear algebra pedagogy, notably in texts following Axler's "determinant-free" philosophy adapted here in reverse to construct determinants intrinsically.
Why bother with Λn(V∗)\Lambda^n(V^*) instead of just using the permutation-sum formula directly?

The permutation formula is perfectly correct and computationally essential, but it is stated for a matrix, i.e. after a basis has already been chosen. It is not obvious from that formula alone why two different matrices representing the same operator TT in two different bases must have the same determinant; verifying this directly requires an extra multiplicativity argument, det⁡(P−1AP)=det⁡(P)−1det⁡(A)det⁡(P)=det⁡(A)\det(P^{-1}AP)=\det(P)^{-1}\det(A)\det(P)=\det(A). The exterior-power construction sidesteps this: it defines det⁡T\det T before choosing a basis, as the scalar action on Λn(V∗)\Lambda^n(V^*), so basis-independence is automatic rather than a separate theorem to prove afterward.

Is Λn(V∗)\Lambda^n(V^*) the same as the space of all nn-linear forms?

No. The space of all nn-linear forms on an nn-dimensional VV has dimension n2nn^{2n} divided appropriately — more precisely it has dimension nnn^n if we think of it via a basis dual construction, and it is much larger than Λn(V∗)\Lambda^n(V^*). The alternating condition is a strong restriction: it forces the form to vanish on the vast majority of "degenerate" or repeated-argument inputs, cutting the dimension all the way down to exactly 11 when the form-degree matches dim⁡V\dim V. This dramatic collapse to dimension 11 is precisely why a coordinate-free determinant can exist at all.

What is the relationship between Λn(V∗)\Lambda^n(V^*) here and the "wedge product" notation dx∧dydx\wedge dy seen in calculus?

They are the same construction viewed from two angles. The differential form dx1∧⋯∧dxndx_1 \wedge \cdots \wedge dx_n on Rn\mathbb{R}^n is exactly a generator of Λn((Rn)∗)\Lambda^n((\mathbb{R}^n)^*) at each point, normalized so that it evaluates to 11 on the standard basis vectors. Pulling back a top-degree form under a smooth map's derivative (Jacobian) at a point reproduces exactly the operator T∗T^* defined in this article, applied pointwise; the resulting scalar factor is the Jacobian determinant appearing in the change-of-variables formula.

Does this construction require the field F\mathbb{F} to be R\mathbb{R} or C\mathbb{C}?

No. The entire argument — multilinearity, the alternating property, the one-dimensionality of Λn(V∗)\Lambda^n(V^*), and the identification with the permutation-sum formula — works over any field F\mathbb{F}. The only place characteristic can subtly matter is in distinguishing "alternating" (vanishes on repeated arguments) from "antisymmetric" (negates under transpositions): these coincide when char⁡(F)≠2\operatorname{char}(\mathbb{F}) \ne 2, but the robust definition used throughout, vanishing on repeats, is the one that behaves correctly in every characteristic, including 22.

How does this framework foreshadow multiplicativity of the determinant?

If S,T:V→VS, T : V \to V are linear, then for any ω∈Λn(V∗)\omega \in \Lambda^n(V^*) and any v1,…,vnv_1,\dots,v_n,

((ST)∗ω)(v1,…,vn)=ω(STv1,…,STvn)=(T∗(S∗ω))(v1,…,vn),((ST)^*\omega)(v_1,\dots,v_n) = \omega(STv_1,\dots,STv_n) = (T^*(S^*\omega))(v_1,\dots,v_n),

so (ST)∗=T∗∘S∗(ST)^* = T^* \circ S^* as operators on Λn(V∗)\Lambda^n(V^*). Since S∗S^* acts as multiplication by det⁡S\det S and T∗T^* as multiplication by det⁡T\det T, composing these scalar multiplications gives (ST)∗ω=det⁡(S)det⁡(T) ω(ST)^*\omega = \det(S)\det(T)\,\omega, forcing det⁡(ST)=det⁡(S)det⁡(T)\det(ST) = \det(S)\det(T). This one-line composition argument is the seed expanded fully in Multiplicativity of the Determinant.

What happens to det⁡T\det T if TT is not invertible?

If TT is not invertible, its image has dimension strictly less than nn, so Tv1,…,TvnTv_1,\dots,Tv_n are always linearly dependent for any choice of v1,…,vnv_1,\dots,v_n; hence ω0(Tv1,…,Tvn)=0\omega_0(Tv_1,\dots,Tv_n) = 0 for every alternating form ω0\omega_0 (an alternating form vanishes on any linearly dependent tuple, a fact provable by writing one vector as a combination of the others and using multilinearity plus the alternating property). By the theorem, this forces the scalar c=det⁡Tc = \det T to equal 00. This matches the classical fact that a square matrix is singular exactly when its determinant vanishes.

Before this

Where this leads