15.10  The Exterior Algebra, and Clifford at Last

The exterior powers have so far been used one degree at a time, and the wedge of two of them has had nowhere to live: Λ2V and Λ3V are different spaces, and until now nothing said what (u∧w)∧x means as an operation. Stacking them fixes that, exactly as stacking the tensor powers produced the tensor algebra (Definition 15.6.2) and stacking the symmetric powers produced the symmetric algebra (Definition 15.7.3). The result is a 2n-dimensional algebra, and it is the last object this chapter needs. With it we can finally pay the debt Chapter 14 recorded in writing: a Clifford algebra of (V,q) exists, and its dimension is 2n.

Throughout, F is a field and V is a vector space over F with dim⁡V=n. From the subsection on decomposability on, charF≠2, because Definition 14.12.2 assumes it. We use the exterior powers of Definition 15.8.2 with their universal property for alternating maps, their bases of increasing wedges (Theorem 15.8.5), the test Theorem 15.8.7, and the reordering rule Lemma 15.8.1 (b) of the previous section.

15.10.1. Stacking the exterior powers

The pieces are already in place; only the multiplication is missing. The pattern is the one Proposition 15.7.4 used for symmetric powers: a product of a k-fold wedge and an l-fold wedge ought to be the (k+l)-fold wedge of all the vectors, and the only thing to check is that this depends on the two factors and not on the way each was written.

Proposition 15.10.1 (The Wedge of Two Exterior Powers)

Let k,l≥1. There is a unique bilinear map ΛkV×ΛlV→Λk+lV,(ω,η)↦ω∧η, such that for all u1,…,uk,w1,…,wl∈V, (u1∧⋯∧uk)∧(w1∧⋯∧wl)=u1∧⋯∧uk∧w1∧⋯∧wl.

Idea. Freeze the second factor’s vectors and use the universal property once, in the first k slots; that turns the left-hand factor into an element of ΛkV. Then let the second factor’s vectors vary: what we have built depends on them l-linearly, and vanishes as soon as two of them coincide, with values in a space of linear maps, so the universal property applies a second time.

Proof. Fix w1,…,wl∈V. The map Vk→Λk+lV given by (u1,…,uk)↦u1∧⋯∧uk∧w1∧⋯∧wl is k-linear, since the wedge of k+l vectors is linear in each slot and the last l are frozen, and alternating, since a repeat among the first k arguments is a repeat among all k+l. By Definition 15.8.2 it induces a unique linear map R(w1,…,wl):ΛkV→Λk+lV with R(w1,…,wl)(u1∧⋯∧uk) equal to the displayed wedge.

Now let the w’s vary. The assignment (w1,…,wl)↦R(w1,…,wl), with values in the vector space L(ΛkV,Λk+lV), is l-linear and alternating: two linear maps on ΛkV are equal as soon as they agree on the wedges u1∧⋯∧uk, which span ΛkV (Theorem 15.8.5), and on those the required identities are the linearity and the alternation of the wedge of k+l vectors in its last l slots. So Definition 15.8.2 applies again and gives a unique linear map ΛlV→L(ΛkV,Λk+lV),w1∧⋯∧wl↦R(w1,…,wl). Reading a linear map into a space of linear maps as a bilinear map gives the required product, with the stated values. It is unique because the wedges span both factors and a bilinear map is determined on a pair of spanning sets. This proves the proposition.

With the product in hand, the algebra assembles itself.

The exterior algebra is all the exterior powers at once, multiplied by wedging.

Definition 15.10.1 (Exterior Algebra)

Let V be a vector space over F, with Λ0V=F and Λ1V=V as in Definition 15.8.2. The exterior algebra, or Grassmann algebra, of V is the vector space ΛV:=⨁k≥0ΛkV, whose elements are the sequences x=(x0,x1,…) with xk∈ΛkV and only finitely many xk non-zero, with componentwise operations, and whose multiplication is (x∧y)m=∑k+l=mxk∧yl, where ∧ on the right is Proposition 15.10.1 for k,l≥1, and is scalar multiplication when k=0 or l=0. We identify each ΛkV with the sequences supported in position k, so that F and V are subspaces of ΛV, and call an element of ΛkV⊆ΛV homogeneous of degree k.

In words: an element of ΛV is a finite sum x0+x1+⋯+xN of pieces of different degrees, the scalars sit inside as the degree-0 piece, and the product adds degrees. The finiteness clause is automatic here, since ΛkV={0} once k>n (Theorem 15.8.5).

Theorem 15.10.2 (Structure of the Exterior Algebra)

Let dim⁡V=n with basis (e1,…,en). For a subset S={i1<⋯<ik}⊆[n] write eS=ei1∧⋯∧eik, with e∅=1. Then

  • (a) ΛV is an associative unital F-algebra with identity 1∈Λ0V=F, and ΛkV∧ΛlV⊆Λk+lV.
  • (b) The 2n elements eS, one for each subset S⊆[n], form a basis of ΛV. In particular dimF⁡ΛV=2n.
  • (c) ΛV is generated as an algebra by 1 and V.

Proof.

  • (a) Bilinearity of the product holds componentwise, by Proposition 15.10.1. For associativity, both (x∧y)∧z and x∧(y∧z) are trilinear in (x,y,z), so it is enough to compare them on homogeneous elements, and then on the wedges of vectors, which span each ΛkV for k≥1 (Theorem 15.8.5) while Λ0V is spanned by 1. On those both sides are the single wedge of all the listed vectors in order, by the defining identity of Proposition 15.10.1 applied twice. The scalar 1 acts on each ΛkV as multiplication by 1, hence as the identity. The grading statement is built into the definition of the product.

  • (b) By Theorem 15.8.5 the eS with |S|=k form a basis of ΛkV, and ΛkV={0} for k>n. A basis of a direct sum is the union of bases of the summands, so the eS over all S⊆[n] form a basis of ΛV. Their number is ∑k=0n(nk)=2n, by the binomial theorem applied to (1+1)n.

  • (c) Each eS is a product of elements of V by the defining identity of the product, and the eS span by (b).

The one structural fact that is not inherited from the tensor algebra is how the order of a product matters.

Theorem 15.10.3 (Graded Commutativity)

Let ω∈ΛkV and η∈ΛlV. Then ω∧η=(−1)klη∧ω. In particular ω∧ω=0 whenever k is odd, over every field.

Idea. Count the swaps. To turn w1∧⋯∧wl∧u1∧⋯∧uk into u1∧⋯∧uk∧w1∧⋯∧wl, each of the k vectors ui must cross each of the l vectors wj, and every crossing costs a sign.

Proof. Both sides are bilinear in (ω,η), so by Theorem 15.8.5 it suffices to take ω=u1∧⋯∧uk and η=w1∧⋯∧wl, and the cases k=0 or l=0 are scalar multiplication and are clear. The permutation of {1,…,k+l} carrying the list (w1,…,wl,u1,…,uk) to (u1,…,uk,w1,…,wl) has exactly kl inversions, one for each pair consisting of a u and a w, so its sign is (−1)kl (Definition 7.3.2). By Lemma 15.8.1 (b) the two wedges differ by that factor, which is the claim.

For the last sentence let k be odd and ω∈ΛkV. Write ω=∑ScSeS in the basis of Theorem 15.10.2, the sum over the S with |S|=k. Then ω∧ω=∑S∑TcScTeS∧eT. A term with S=T has a repeated vector, so eS∧eS=0. A pair S≠T occurs twice, and the two occurrences are cScTeS∧eT and cTcSeT∧eS=−cScTeS∧eT, since (−1)kl=(−1)k2=−1 for odd k. So the two cancel, and nothing divides by 2 anywhere.

Warning. Graded commutative is not commutative. In ΛF2 we have e1∧e2=−e2∧e1, and these are different elements unless charF=2. What is true in all degrees is only the signed rule. And the sign is +1 as soon as one of the degrees is even, so an element of Λ2V commutes with everything, while two elements of Λ1V=V anticommute.

Warning. ω∧ω need not be zero. The identity v∧v=0 is a statement about degree 1. For ω=e1∧e2+e3∧e4 in ΛF4, a direct expansion gives ω∧ω=2e1∧e2∧e3∧e4, which is non-zero whenever charF≠2. Squaring to zero is the privilege of odd degree.

Example (The exterior algebra of a three-dimensional space)

Describe ΛF3 completely, and compute (e1+e2∧e3)∧(e2+e1∧e3).

Solution. By Theorem 15.10.2 it has dimension 23=8, with basis 1;e1,e2,e3;e12,e13,e23;e123, writing eij for ei∧ej and e123 for e1∧e2∧e3. The degrees have dimensions 1,3,3,1. Every product of two elements of degree ≥2 lands in degree ≥4, hence is 0.

For the computation, expand by bilinearity into four products: e1∧e2=e12,e1∧(e1∧e3)=0(repeated e1),(e2∧e3)∧e2=0(repeated e2),(e2∧e3)∧(e1∧e3)=0(degree 4). So the product is e12, while the reversed product is −e12 plus the same three zeros.

Quick check. In ΛF4, what is (e1∧e2)∧(e2∧e3), and what is (e1∧e2)∧(e3∧e4)?

Solution. The first is e1∧e2∧e2∧e3=0, since e2 is repeated. The second is e1∧e2∧e3∧e4, a basis vector of Λ4F4, so it is non-zero. Wedging two 2-vectors gives zero exactly when the four vectors involved are dependent.

15.10.2. Decomposable elements

Section 2 warned that not every element of V⊗W is a simple tensor v⊗w, and proved it with e1⊗e1+e2⊗e2 (Example (A tensor that is not simple)). The same thing happens one floor up, and for the same reason: the simple objects form a low-dimensional cone inside a large space, and a sum of two of them usually escapes it.

Definition 15.10.2 (Decomposable Element)

Let k≥1. An element ω∈ΛkV is decomposable, or a k-blade, if there exist v1,…,vk∈V with ω=v1∧v2∧⋯∧vk.

Examples. Every element of Λ1V=V is decomposable, with k=1; so is 0, being v∧v∧v3∧⋯∧vk; and so is every element of the line ΛnV, since ce1∧⋯∧en=(ce1)∧e2∧⋯∧en.

Why the word. A decomposable ω≠0 carries a k-dimensional subspace: its factors are independent by Theorem 15.8.7, and they span one. Non-decomposable elements are exactly those that come from no single subspace, which is why the failure below is a phenomenon and not a notational accident.

Theorem 15.10.4 (Not Every 2-Vector Is Decomposable)

Let dim⁡V=n≥4, let (e1,…,en) be a basis of V, and set ω=e1∧e2+e3∧e4∈Λ2V. Then ω is not decomposable.

Idea. A decomposable 2-vector u∧w squares to zero, because the four-fold wedge u∧w∧u∧w repeats a vector. So compute ω∧ω and find it non-zero. That test needs charF≠2; the proof below takes a second route that does not, by asking which vectors annihilate ω.

Proof. Suppose ω=u∧w for some u,w∈V. Since e1∧e2 and e3∧e4 are distinct basis vectors of Λ2V (Theorem 15.8.5), ω≠0, so (u,w) is linearly independent by Theorem 15.8.7; in particular u≠0.

Consider u∧ω=u∧u∧w=0, the wedge having a repeated argument. We show this is impossible. Let v=∑i=1nxiei be any vector and compute v∧ω, using bilinearity and dropping every term with a repeated basis vector: v∧ω=x3e3∧e1∧e2+x4e4∧e1∧e2+x1e1∧e3∧e4+x2e2∧e3∧e4+∑i≥5xi(ei∧e1∧e2+ei∧e3∧e4). Sorting each wedge by Lemma 15.8.1 (b) turns this into a combination of the distinct basis vectors e123, e124, e134, e234, e12i, e34i (i≥5) of Λ3V, with coefficients x3,x4,x1,x2 and xi,xi respectively, up to signs. Since these basis vectors are distinct and the eS are independent (Theorem 15.8.5), v∧ω=0 forces x1=x2=⋯=xn=0, that is, v=0. This contradicts u≠0 with u∧ω=0. Hence ω is not decomposable.

Remark. When charF≠2 there is a one-line version: ω∧ω=2e1∧e2∧e3∧e4≠0, whereas (u∧w)∧(u∧w)=0 always. The proof above was written to avoid that division, because the test fails over F2 — see the warning next.

Warning. The square test is blind in characteristic 2. Over F2 every ω∈Λ2V satisfies ω∧ω=0: in the expansion ∑S,TcScTeS∧eT the diagonal terms vanish and each off-diagonal pair contributes 2cScTeS∧eT=0. So over F2 the vanishing of ω∧ω says nothing at all, while e1∧e2+e3∧e4 is still not decomposable, by the proof above. A criterion and a phenomenon are different things.

Quick check. Why does Theorem 15.10.4 need n≥4? Show that every element of Λ2V is decomposable when dim⁡V=3.

Solution. With n≤3 there is no room to write e1∧e2+e3∧e4 at all. For n=3, take ω=ae12+be13+ce23. If a=b=c=0 then ω=0, which is decomposable. If a≠0, then (e1−cae3)∧(ae2+be3)=ae12+be13+ce23=ω, using e3∧e2=−e23. If a=0, relabel the basis so that the surviving non-zero coefficient sits in the first slot and repeat. So the phenomenon starts exactly at n=4.

Together with Example (A tensor that is not simple) this is the chapter’s negative result, stated in its two forms: a general tensor is not a simple tensor, and a general k-vector is not a blade. The optimistic reading — that every element of a space built from V is built from finitely many vectors of V in the obvious way — is false in both places, and Section 11 will find the first form of it wearing a physical name.

15.10.3. Algebras modulo relations

One tool is still missing. The Clifford algebra is to be built by imposing relations on T(V), and imposing relations on an algebra means dividing by more than a subspace: the relations must stay relations after multiplication on either side. Chapter 6 met the commutative version of the idea for F[x] (Definition 6.2.1).

Definition 15.10.3 (Two-Sided Ideal, and the Ideal Generated by a Set)

Let A be an F-algebra (Definition 14.12.1). A two-sided ideal of A is a subspace I⊆A such that yx∈I and xy∈I for every x∈I and every y∈A. For a subset S⊆A, the ideal generated by S is ⟨S⟩:=span{ysz:y,z∈A, s∈S}.

Examples. In F[x] the ideals are the sets ⟨p⟩ of Definition 6.2.1; in any A, both {0} and A are ideals. Non-example by minimal change. The diagonal matrices in M2(F) form a subspace closed under multiplication, but not an ideal: it contains E11, while E21E11=E21 is not diagonal. Being closed among one’s own elements is not the condition; absorbing products with the whole algebra is.

The span above is a subspace by construction, and it is a two-sided ideal because a(ysz)=(ay)sz and (ysz)a=ys(za) are again of the listed form. It contains S, taking y=z=1A, and every two-sided ideal containing S contains each ysz; so ⟨S⟩ is the smallest two-sided ideal containing S, which is what “generated” means.

Lemma 15.10.5 (Quotient of an Algebra by an Ideal)

Let A be an F-algebra and I a two-sided ideal of A.

  • (a) The quotient space A/I carries exactly one multiplication making the quotient map π:A→A/I an algebra homomorphism, namely (x+I)(y+I)=xy+I; with it A/I is an F-algebra with identity 1A+I, and kerπ=I.
  • (b) If φ:A→B is an algebra homomorphism with I⊆kerφ, then there is exactly one algebra homomorphism φ¯:A/I→B with φ¯∘π=φ.
  • (c) The kernel of any algebra homomorphism is a two-sided ideal.

Proof.

  • (a) The rule is well defined: if x′=x+u and y′=y+w with u,w∈I, then x′y′=xy+uy+xw+uw∈xy+I, since I absorbs multiplication on both sides and is closed under addition. Bilinearity, associativity and the identity are then inherited from A, because each is an identity among cosets that follows by applying π to the corresponding identity in A. Any multiplication making π multiplicative must satisfy the displayed rule, and π is surjective, so the multiplication is unique. Finally kerπ=I by Lemma 4.4.3.

  • (b) Since φ is linear with I⊆kerφ, Theorem 4.4.10 (a) gives exactly one linear φ¯ with φ¯π=φ. It is multiplicative: every element of A/I is π(x) for some x, and φ¯(π(x)π(y))=φ¯(π(xy))=φ(xy)=φ(x)φ(y), which is φ¯(π(x))φ¯(π(y)). Also φ¯(π(1A))=φ(1A)=1B. Uniqueness is already contained in the uniqueness of the linear map.

  • (c) If φ(x)=0 and y∈A, then φ(xy)=φ(x)φ(y)=0 and φ(yx)=0; and kerφ is a subspace because φ is linear.

15.10.4. The Clifford algebra, constructed

Chapter 14 §12 defined a Clifford algebra of (V,q) as a pair (C,ι) with ι:V→C linear satisfying

  • (C1) ι(v)2=q(v)1C for every v∈V, and
  • (C2) the universal property: every linear f:V→A into an F-algebra with f(v)2=q(v)1A factors as f=f¯∘ι for a unique algebra homomorphism f¯,

and then said in as many words that it could not produce one: “The definition says what a Clifford algebra would be; it does not produce one.” What it needed was an algebra of formal strings of vectors, which is now Definition 15.6.2, and a way to impose the relation v⊗v=q(v)1, which is now Lemma 15.10.5.

Theorem 15.10.6 (Existence of the Clifford Algebra)

Let F be a field with charF≠2, let V be a finite-dimensional F-vector space, let β be a symmetric bilinear form on V and q(v)=β(v,v). Let Iq:=⟨v⊗v−q(v)1:v∈V⟩⊆T(V) be the two-sided ideal generated by these elements, put Cl(q):=T(V)/Iq, and let ι:V→Cl(q) be the restriction to V⊆T(V) of the quotient map π. Then (Cl(q),ι) is a Clifford algebra of (V,q) in the sense of Definition 14.12.2.

In particular a Clifford algebra exists for every (V,q), and by Proposition 14.12.1 any two are isomorphic by a unique isomorphism compatible with the structure maps.

Idea. The tensor algebra is the free associative algebra on V: a linear map out of V extends uniquely to it (Theorem 15.6.6), with no relations in the way. Dividing by the smallest ideal containing v⊗v−q(v)1 imposes exactly the relation (C1) and nothing else, and “nothing else” is precisely what the universal property (C2) asserts.

Proof. By Lemma 15.10.5 (a), Cl(q) is an F-algebra and π is a surjective algebra homomorphism with kerπ=Iq. The map ι=π|V is linear, being a restriction of a linear map.

(C1). Let v∈V. In T(V) the product of v with itself is v⊗v (Definition 15.6.2), and v⊗v−q(v)1 is a generator of Iq=kerπ. Since π is multiplicative and linear, ι(v)2=π(v)π(v)=π(v⊗v)=π(q(v)1)=q(v)1Cl(q).

(C2). Let A be an F-algebra and let f:V→A be linear with f(v)2=q(v)1A for every v∈V. By Theorem 15.6.6 there is a unique algebra homomorphism f~:T(V)→A with f~|V=f. For every v∈V, f~(v⊗v−q(v)1)=f(v)f(v)−q(v)1A=0, so kerf~ contains every generator of Iq. By Lemma 15.10.5 (c), kerf~ is a two-sided ideal, and Iq is the smallest one containing those generators (Definition 15.10.3), so Iq⊆kerf~. By Lemma 15.10.5 (b) there is exactly one algebra homomorphism f¯:Cl(q)→A with f¯∘π=f~, and restricting to V gives f¯∘ι=f~|V=f.

For the uniqueness clause of (C2), let g:Cl(q)→A be any algebra homomorphism with g∘ι=f. Then g∘π is an algebra homomorphism T(V)→A whose restriction to V is gι=f, so gπ=f~ by the uniqueness clause of Theorem 15.6.6. Hence gπ=f¯π, and π is surjective, so g=f¯. This proves the theorem.

Remark. Neither charF≠2 nor finite dimension was used in this proof; the construction and both checks work for any V and any quadratic form. The hypotheses are carried because Definition 14.12.2 states them, and because the dimension count below needs an orthogonal basis.

15.10.5. The dimension, at last

Chapter 14 proved half of the count. Its Proposition 14.12.3 showed that for an orthogonal basis (e1,…,en) of β the 2n sorted products ι(ei1)ι(ei2)⋯ι(eik),i1<i2<⋯<ik, span C, so that dimF⁡C≤2n. The other half — their independence — is what this section owes. The idea is to make ΛV, which has exactly the right dimension, into a place where the vectors of V act with square q(v); the universal property then sends C into the operators on ΛV, and evaluating at 1 turns the sorted products into distinct basis vectors.

Two families of operators on ΛV do the work: wedging a basis vector on, and deleting it again.

Lemma 15.10.7 (Creation and Deletion Operators)

Let (e1,…,en) be a basis of V, and for S⊆[n] let eS be as in Theorem 15.10.2. For i∈[n] write σ(i,S)=|{j∈S:j<i}|. Let Ei∈L(ΛV) be left multiplication by ei, that is, Ei(ω)=ei∧ω, and let Di∈L(ΛV) be the unique linear map with Di(eS)={(−1)σ(i,S)eS∖{i},i∈S,0,i∉S, which exists and is unique because the eS form a basis (Theorem 15.10.2). Then for all i,j∈[n], EiEj+EjEi=0,DiDj+DjDi=0,DiEj+EjDi=δijidΛV.

Idea. Ei inserts the index i into the set S and Di removes it, each at the cost of the sign needed to move ei past the smaller members of S. All three identities are then a comparison of two signs, and in the third the two cases “i∈S” and “i∉S” are exactly the two ways the identity can be satisfied: one term is zero and the other is eS.

Proof. First record what Ei does on the basis. If i∈S then ei∧eS repeats ei and is 0. If i∉S, then sorting ei∧eS moves ei past the σ(i,S) members of S smaller than i, so by Lemma 15.8.1 (b) Ei(eS)=(−1)σ(i,S)eS∪{i}.

First identity. For every ω∈ΛV, EiEj(ω)=ei∧ej∧ω and EjEi(ω)=ej∧ei∧ω, and ej∧ei=−ei∧ej by Theorem 15.10.3. Adding gives 0. (For i=j each term is separately 0.)

Third identity, case i=j. If i∉S, then Di(eS)=0 and Ei(eS)=(−1)σ(i,S)eS∪{i}; since σ(i,S∪{i})=σ(i,S), applying Di returns (−1)2σ(i,S)eS=eS. If i∈S, then Ei(eS)=0 and Di(eS)=(−1)σ(i,S)eS∖{i}; since σ(i,S∖{i})=σ(i,S), applying Ei returns eS. Either way the sum is eS.

Third identity, case i≠j. If j∈S then Ej(eS)=0, and Di(eS) is either 0 or a multiple of eS∖{i}, which still contains j, so Ej kills it; both terms vanish. If j∉S and i∉S then Di(eS)=0 and Di(eS∪{j})=0 as well, since i≠j; again both terms vanish. So let j∉S and i∈S. Then DiEj(eS)=(−1)σ(j,S)+σ(i,S∪{j})e(S∪{j})∖{i},EjDi(eS)=(−1)σ(i,S)+σ(j,S∖{i})e(S∖{i})∪{j}, and the two index sets agree. Now σ(i,S∪{j})=σ(i,S)+[j<i] and σ(j,S∖{i})=σ(j,S)−[i<j], writing [P] for 1 if P holds and 0 otherwise. So the two exponents differ by [j<i]+[i<j]=1, which is odd because i≠j. The two terms therefore cancel.

Second identity. Both DiDj(eS) and DjDi(eS) vanish unless i,j∈S and i≠j, and in that case they are (−1)σ(j,S)+σ(i,S∖{j}) and (−1)σ(i,S)+σ(j,S∖{i}) times the same eS∖{i,j}. The same two identities for σ show the exponents differ by an odd number, so the terms cancel. For i=j, Di2(eS)=0 because i∉S∖{i}. This proves the lemma.

Theorem 15.10.8 (Dimension of a Clifford Algebra)

Let F be a field with charF≠2, let dim⁡V=n, let β be a symmetric bilinear form on V with quadratic form q, and let (C,ι) be a Clifford algebra of (V,q). Let (e1,…,en) be an orthogonal basis of V for β. Then the 2n sorted products of Proposition 14.12.3 form a basis of C. Consequently dimF⁡C=2n, the map ι is injective, and C is isomorphic to ΛV as a vector space. This is Theorem 14.12.4.

Idea. Build a representation. ① Turn each basis vector ei into the operator ci=Ei+diDi on ΛV, where di=q(ei); Lemma 15.10.7 makes these anticommute and gives ci2=diid, which is exactly (C1). ② The universal property then hands us an algebra homomorphism C→L(ΛV). ③ Evaluate at the element 1∈Λ0V: the sorted product for the index set S is sent to eS, because at each step the new index is smaller than all the ones already there, so the deletion half contributes nothing. Distinct basis vectors come out, so the sorted products were independent.

Proof. An orthogonal basis exists by Theorem 14.4.2, since charF≠2. Write di=q(ei) and ci=Ei+diDi∈L(ΛV), with Ei,Di as in Lemma 15.10.7. By Proposition 14.12.3 the sorted products span C and dimF⁡C≤2n, so only independence is left.

Step 1: the ci satisfy the Clifford relations. Expanding the product and collecting the four brackets, cicj+cjci=(EiEj+EjEi)+dj(EiDj+DjEi)+di(DiEj+EjDi)+didj(DiDj+DjDi). By Lemma 15.10.7 the first and last brackets are 0 and each middle bracket is δijid. So cicj=−cjci for i≠j. Setting i=j in the display would give 2ci2, so expand ci2 directly instead; with Ei2=Di2=0, which were checked separately in the lemma, ci2=Ei2+di(EiDi+DiEi)+di2Di2=diid, with no division by 2 anywhere. Now L(ΛV) is an F-algebra under composition (Definition 14.12.1). Let f:V→L(ΛV) be the linear map with f(ei)=ci, which exists and is unique by Theorem 2.1.6. For v=∑ixiei, f(v)2=∑ixi2ci2+∑i<jxixj(cicj+cjci)=(∑idixi2)id, the cross terms vanishing because i≠j there. Since the basis is orthogonal, β(ei,ej)=0 for i≠j, so q(v)=β(v,v)=∑idixi2. Hence f(v)2=q(v)id, which is (C1) for f.

Step 2: the induced homomorphism. By the universal property (C2) of Definition 14.12.2 there is an algebra homomorphism Ψ:C→L(ΛV) with Ψι=f. Define the linear map Φ:C→ΛV,Φ(x)=Ψ(x)(1), where 1∈Λ0V=F⊆ΛV. It is linear because Ψ is linear and evaluation at a fixed element is linear.

Step 3: Φ sends sorted products to basis vectors. Let S={i1<⋯<ik}⊆[n]. Since Ψ is multiplicative and Ψι=f, Ψ(ι(ei1)⋯ι(eik))=ci1ci2⋯cik. We claim circir+1⋯cik(1)=eTr with Tr={ir,…,ik}, by downward induction on r. For r=k+1 the product is empty and the value is 1=e∅. Assume the claim for r+1. Because ir<ir+1 and the indices increase, ir∉Tr+1, so Dir(eTr+1)=0; and ir is smaller than every element of Tr+1, so σ(ir,Tr+1)=0 and Eir(eTr+1)=eTr. Hence cir(eTr+1)=eTr, completing the induction. Taking r=1, Φ(ι(ei1)⋯ι(eik))=eS, and for S=∅, Φ(1C)=id(1)=1=e∅.

Step 4: conclusion. Suppose a linear combination of the sorted products is 0. Applying Φ gives the same combination of the eS, which are linearly independent by Theorem 15.10.2 (b); so all coefficients vanish. The sorted products are therefore linearly independent, and being also a spanning list they form a basis of C, of size 2n. Thus dimF⁡C=2n.

Since 1C and ι(e1),…,ι(en) are among the basis elements just found, the list (ι(e1),…,ι(en)) is independent, so ι carries a basis of V to an independent list and is injective. Finally Φ carries the basis of C bijectively onto the basis (eS) of ΛV, so Φ is a vector space isomorphism. This proves the theorem.

The debt, and how it was paid. Chapter 14 §12 stated Theorem 14.12.4 and then wrote, under the heading “What is proved here, and what is not”, that the inequality dimF⁡C≤2n was proved in full, while “the reverse inequality — that the 2n sorted products are linearly independent — is not proved in this section”, and that the two halves would have to be established together by exhibiting one algebra of dimension exactly 2n satisfying (C1) and (C2). Both halves are now supplied. The missing one was independence, and Theorem 15.10.8 supplies it; the prior question, whether any Clifford algebra exists at all, is Theorem 15.10.6. Chapter 14 read the statement for n≥3 “as quoted from Chapter 15 and not as proved here”; it may now be read as proved.

The prediction was right in substance and slightly off in shape. The algebra of dimension 2n that settled the matter is the exterior algebra, but it is not the Clifford algebra: it is only a space that Cl(q) acts on, and independence came from the action rather than from an identification. Chapter 14 also guessed that “Cl(q) is assembled from the exterior powers ΛkV, one for each k”, and Φ is that assembly, matching the sorted product on S with the wedge eS.

Warning. Cl(q) and ΛV are the same size, not the same algebra. The map Φ above is an isomorphism of vector spaces only. It is not multiplicative, and no other map is either, unless q=0: in ΛV the square of a vector is 0, while in Cl(q) it is q(v)1. Writing an element of Cl(q) as a sum of wedges is a choice of coordinates, not a description of the multiplication.

That warning deserves a proof rather than a slogan.

Proposition 15.10.9 (Comparing the Two Algebras)

Let charF≠2 and dim⁡V=n≥1, and let q be the quadratic form of a symmetric bilinear form on V.

  • (a) If q=0, then Cl(0) and ΛV are isomorphic as F-algebras.
  • (b) If q≠0, they are not isomorphic as F-algebras, although they are isomorphic as vector spaces.

Idea. For (b), find a property of ΛV that Cl(q) fails. In ΛV everything of positive degree is nilpotent, so an element whose square is a non-zero scalar can have no positive-degree part at all; but in Cl(q) a vector v with q(v)≠0 squares to a non-zero scalar and is not a scalar itself.

Proof.

  • (a) Let q=0 and let j:V→ΛV be the inclusion V=Λ1V⊆ΛV. Then j(v)2=v∧v=0=q(v)1, so (C1) holds for j. By the universal property (C2) of Cl(0) there is an algebra homomorphism ψ:Cl(0)→ΛV with ψι=j. Its image is a subalgebra containing 1 and V, hence all of ΛV by Theorem 15.10.2 (c); so ψ is surjective. Both spaces have dimension 2n, by Theorem 15.10.8 and Theorem 15.10.2 (b), so ψ is bijective and is an algebra isomorphism.

  • (b) Claim. If x∈ΛV and x∧x=a⋅1 with a∈F, a≠0, then x∈F⋅1.

Proof of claim. Throughout, yt means the t-fold wedge product of y with itself. Write x=x0+m with x0∈Λ0V=F and m the sum of the components of positive degree. Then x∧x=x02+2x0m+m∧m, and the only degree-0 term is x02, so x02=a≠0 and hence x0≠0. Canceling that term leaves m∧(2x0⋅1+m)=0. Every product of n+1 elements of positive degree lies in ⨁k>nΛkV={0}, so mn+1=0. Put c=2x0, which is non-zero because charF≠2 and x0≠0, and u=−c−1m, so that un+1=0 and c⋅1+m=c(1−u). Then (1−u)∧(1+u+u2+⋯+un)=1−un+1=1, and likewise in the other order, so c⋅1+m is invertible. Multiplying m∧(c⋅1+m)=0 by its inverse gives m=0, so x=x0∈F⋅1, proving the claim.

Now suppose q≠0 and let φ:Cl(q)→ΛV be an algebra isomorphism. Choose v∈V with q(v)≠0 and put x=φ(ι(v)). Then x∧x=φ(ι(v)2)=φ(q(v)1)=q(v)⋅1, a non-zero scalar, so x∈F⋅1 by the claim, say x=c⋅1=φ(c1Cl(q)). Since φ is injective, ι(v)=c1Cl(q). But by Theorem 15.10.8 the elements 1Cl(q),ι(e1),…,ι(en) are part of a basis of Cl(q), and ι(v) is a combination of ι(e1),…,ι(en) alone; comparing coordinates forces c=0 and ι(v)=0, contradicting ι(v)2=q(v)1≠0. So no such φ exists. The vector space isomorphism is Theorem 15.10.8.

The dimension count also makes Clifford algebras easy to recognize, which is how one identifies them in practice.

Corollary 15.10.10 (Recognizing a Clifford Algebra)

Let charF≠2, dim⁡V=n, and let q be as above. Let A be an F-algebra with dimF⁡A=2n, and let ιA:V→A be linear with ιA(v)2=q(v)1A for every v∈V. If A is generated as an algebra by 1A and ιA(V), then (A,ιA) is a Clifford algebra of (V,q).

Proof. Let (C,ι) be the Clifford algebra of Theorem 15.10.6. By its universal property there is an algebra homomorphism ψ:C→A with ψι=ιA. Its image is a subalgebra of A containing 1A and ιA(V), hence is all of A by the generation hypothesis. So ψ is surjective, and dimF⁡C=2n=dimF⁡A by Theorem 15.10.8, so ψ is an isomorphism.

It remains to transport (C2). Let f:V→B be linear with f(v)2=q(v)1B. Then f¯ψ−1:A→B is an algebra homomorphism with f¯ψ−1ιA=f¯ι=f, where f¯:C→B comes from (C2) for C; and if g:A→B is another one, then gψ:C→B satisfies gψι=gιA=f, so gψ=f¯ by uniqueness for C, whence g=f¯ψ−1.

Example (The Clifford algebra of the Euclidean plane)

Let V=R2 with q(x)=x12+x22, the form of signature (2,0). Show that Cl2,0(R)≅M2(R).

Solution. Put A=(100−1),B=(0110) in M2(R), and let ι(x)=x1A+x2B, a linear map R2→M2(R). Multiplying out, A2=B2=I2 and AB=−BA, the products being (01−10) and its negative. Hence ι(x)2=x12A2+x1x2(AB+BA)+x22B2=q(x)I2, which is (C1). Next, dimR⁡M2(R)=4=22, and the four matrices I2,A,B,AB are linearly independent: the first two span the diagonal matrices and the last two span the off-diagonal ones, and the diagonal and off-diagonal matrices meet only in 0. So they are a basis, and M2(R) is generated by I2 and ι(R2). By Corollary 15.10.10, (M2(R),ι) is a Clifford algebra of (R2,q), so Cl2,0(R)≅M2(R).

Compare Chapter 14’s Cl0,2(R)=H (Example (The quaternions)). All three of H, M2(R) and ΛR2 have dimension 4, and no two are isomorphic: H has no zero divisors, M2(R) has plenty, and ΛR2 differs from both by Proposition 15.10.9 (b). Changing a sign in q changes the algebra completely and never changes its size.

Quick check. Where in the proof of Theorem 15.10.8 is the hypothesis charF≠2 used?

Solution. Twice, both times through the orthogonal basis. It is needed to produce one at all: Theorem 14.4.2 assumes charF≠2. And it is needed for Chapter 14’s Proposition 14.12.3, which supplies the spanning half, since that proof uses Lemma 14.12.2, which comes from polarization. The operator identities of Lemma 15.10.7 and the induction of Step 3 use no such hypothesis.

With that, Chapter 14’s last open statement is closed and the construction side of this chapter is complete. The final section spends the machinery on one application, where the failure of decomposability proved above reappears under another name.

15.10.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the exterior algebra ΛV and state its dimension when dim⁡V=n.
  • (b) State the graded commutativity rule, and say what it gives when both degrees are odd.
  • (c) Define what it means for ω∈ΛkV to be decomposable, and give one decomposable and one non-decomposable element of Λ2F4.
  • (d) Which half of Theorem 14.12.4 was left unproved in Chapter 14, and which result of this section supplies it?
  • (e) True or false: Cl(q) and ΛV are isomorphic algebras. Justify your answer.

Solution.

  • (a) ΛV=⨁k≥0ΛkV with the product of Proposition 15.10.1 extended by bilinearity (Definition 15.10.1). Its dimension is ∑k(nk)=2n (Theorem 15.10.2).

  • (b) ω∧η=(−1)klη∧ω for ω∈ΛkV, η∈ΛlV (Theorem 15.10.3). Both odd gives ω∧η=−η∧ω: odd-degree elements anticommute.

  • (c) ω is decomposable if ω=v1∧⋯∧vk for some vi∈V (Definition 15.10.2). Decomposable: e1∧e2. Non-decomposable: e1∧e2+e3∧e4 (Theorem 15.10.4).

  • (d) The independence of the 2n sorted products, that is, the inequality dimF⁡C≥2n. It is supplied by Theorem 15.10.8, which needs Theorem 15.10.6 first so that the object exists.

  • (e) False in general. They are isomorphic as vector spaces, and as algebras exactly when q=0 (Proposition 15.10.9).

B. Practice

Exercise (B1: Multiplying in the exterior algebra)

In ΛF4 with F=Q, put x=e1+e2∧e3 and y=e2+e1∧e4. Compute the following, expressed in the basis of Theorem 15.10.2.

  • (a) x∧y.
  • (b) y∧x.
  • (c) x∧x.

Solution. Write eS for the sorted wedge on S.

  • (a) Expanding into four products: e1∧e2=e12,e1∧(e1∧e4)=0,(e2∧e3)∧e2=0,(e2∧e3)∧(e1∧e4)=e1234. The last one sorts as e2∧e3∧e1∧e4=e1234, since moving e1 two places to the left costs (−1)2. So x∧y=e12+e1234.

  • (b) The surviving products are e2∧e1=−e12 and (e1∧e4)∧(e2∧e3)=e1234, the latter because e1∧e4∧e2∧e3 sorts with two transpositions. So y∧x=−e12+e1234. This agrees with Theorem 15.10.3 applied degree by degree: the (1,1) part changes sign, the (1,2) and (2,2) parts do not.

  • (c) x∧x=e1∧e1+e1∧e2∧e3+e2∧e3∧e1+0=2e123, since e2∧e3∧e1=e123. An inhomogeneous element need not square to zero.

Exercise (B2: Decomposable or not)

In Λ2Q4, writing eij=ei∧ej, determine whether each of the following is decomposable. Justify your answer. ω1=e12+e13+3e14−2e23−e24+5e34,ω2=e12+e34+e14.

Solution. For ω=∑i<jcijeij in Λ2Q4, expanding gives ω∧ω=2(c12c34−c13c24+c14c23)e1234, since the only pairs of index sets with empty intersection are {12},{34} and {13},{24} and {14},{23}, each occurring in two orders, and e13∧e24=−e1234 while the other two products are +e1234.

For ω1: 1⋅5−1⋅(−1)+3⋅(−2)=5+1−6=0, so ω1∧ω1=0 and the test is inconclusive. In fact ω1 is decomposable: it is v1∧v2 for v1=(1,0,2,1) and v2=(0,1,1,3), by Example (A wedge of two vectors in four-dimensional space).

For ω2: 1⋅1−0⋅0+1⋅0=1, so ω2∧ω2=2e1234≠0. A decomposable u∧w satisfies (u∧w)∧(u∧w)=0, so ω2 is not decomposable.

Exercise (B3: A Clifford algebra of a line)

Let V=R with q(x)=x2, the form of signature (1,0). Let A=R×R with componentwise operations, and ιA(x)=(x,−x). Prove that (A,ιA) is a Clifford algebra of (V,q), so that Cl1,0(R)≅R×R. Contrast this with Cl0,1(R).

Solution. A is an associative unital R-algebra with identity (1,1) and dimR⁡A=2=21. The map ιA is linear, and ιA(x)2=(x,−x)(x,−x)=(x2,x2)=q(x)(1,1), which is (C1). The subalgebra generated by (1,1) and ιA(R)=span{(1,−1)} contains the independent pair (1,1),(1,−1), hence is all of A. By Corollary 15.10.10, (A,ιA) is a Clifford algebra of (V,q).

The contrast: Chapter 14 showed Cl0,1(R)=C (Example (The complex numbers)), where q(x)=−x2. Both algebras have dimension 2, but C is a field and R×R has zero divisors, (1,0)(0,1)=(0,0). A single sign in q decides which.

C. Going deeper

Exercise (C1: The Plücker relation)

Let dim⁡V=4 with basis (e1,…,e4), let charF≠2, and let ω=∑i<jcijeij∈Λ2V.

  • (a) Prove that ω∧ω=2(c12c34−c13c24+c14c23)e1234.
  • (b) Deduce that if c12c34−c13c24+c14c23≠0 then ω is not decomposable.
  • (c) Prove the converse: if the expression vanishes, then ω is decomposable. Hint: if ω≠0, some cij≠0; after relabeling the basis assume c12≠0 and look for ω as a wedge of two vectors whose first two coordinates you may normalize.

Solution.

  • (a) By bilinearity, ω∧ω=∑S,TcScTeS∧eT over 2-element sets S,T. A term vanishes unless S∩T=∅, so the surviving pairs are ({1,2},{3,4}), ({1,3},{2,4}), ({1,4},{2,3}) and their reverses. By Theorem 15.10.3 with k=l=2, reversing a pair does not change the product, so each contributes twice. Sorting, e12∧e34=e1234; e13∧e24=e1∧e3∧e2∧e4=−e1234, one transposition; and e14∧e23=e1∧e4∧e2∧e3=e1234, two transpositions. Collecting gives the stated formula.

  • (b) If ω=u∧w then ω∧ω=u∧w∧u∧w=0, a wedge with a repeated vector. Since charF≠2, (a) then forces the bracket to vanish. Contrapositively, a non-zero bracket rules out decomposability.

  • (c) If ω=0 it is decomposable. Otherwise relabel the basis so that c12≠0; this is legitimate because a permutation of the basis permutes the six coefficients up to sign and changes the bracket by at most a sign, so both the hypothesis and the conclusion are preserved. Put u=c12e1−c23e3−c24e4,w=e2+c13c12e3+c14c12e4. Expanding and sorting each wedge, u∧w=c12e12+c13e13+c14e14+c23e23+c24e24+1c12(c13c24−c14c23)e34. Each of the first five coefficients is read off a single product: for instance the e23 term comes from (−c23e3)∧e2=c23e23, and the e13 term from c12e1∧c13c12e3. The last comes from (−c23e3−c24e4)∧(c13c12e3+c14c12e4)=c13c24−c14c23c12e34. By hypothesis c13c24−c14c23=c12c34, so that coefficient is c34 and u∧w=ω. Hence ω is decomposable.

Exercise (C2: Characteristic two)

Let F=F2 and dim⁡V=4 with basis (e1,…,e4).

  • (a) Prove that ω∧ω=0 for every ω∈Λ2V.
  • (b) Explain why (a) does not make every element of Λ2V decomposable, and name the element and the argument that settle it.
  • (c) Is the statement “ω∧ω=0 for every ω of odd degree” also special to characteristic 2? Justify your answer.

Solution.

  • (a) By the computation of Exercise (C1: The Plücker relation) (a), ω∧ω is 2 times an element of Λ4V, and 2=0 in F2. (Equivalently: in ∑S,TcScTeS∧eT the diagonal terms vanish and the off-diagonal ones pair up, each pair summing to 2cScTeS∧eT=0.)

  • (b) Because ω∧ω=0 is only a necessary condition for decomposability, and over F2 everything satisfies it, so it carries no information at all. The element ω=e1∧e2+e3∧e4 is still not decomposable, by Theorem 15.10.4, whose proof computes v∧ω for a general v and never divides by 2.

  • (c) No, that one is characteristic-free: Theorem 15.10.3 proves ω∧ω=0 for odd degree over every field, by pairing off the terms with S≠T rather than by dividing. Over F2 the statement is true but vacuous as a test, for the same reason as in (a).

Exercise (C3: The even part of a Clifford algebra)

Let charF≠2, dim⁡V=n≥1, and let (C,ι) be a Clifford algebra of (V,q), and let (e1,…,en) be an orthogonal basis of V for β. Let C+⊆C be the span of the sorted products with k even, and C− the span of those with k odd. Prove that C=C+⊕C−, that C+ is a subalgebra of C, and that dimF⁡C+=dimF⁡C−=2n−1. Is C− a subalgebra?

Hint: what does the sorting procedure of Proposition 14.12.3 do to the parity of the length of a product?

Solution. The sorted products form a basis of C by Theorem 15.10.8, and they are partitioned by the parity of |S|, so C=C+⊕C− and the two dimensions are ∑k even(nk) and ∑k odd(nk). These are equal and sum to 2n, since ∑k(−1)k(nk)=(1−1)n=0 for n≥1; so each is 2n−1.

For the subalgebra claim, note that the two moves in the proof of Proposition 14.12.3 — swapping two neighboring distinct factors, and replacing ι(ei)2 by the scalar di — change the length of a product by 0 and by 2 respectively. Both preserve parity. So the product of two sorted products of lengths k and l is a combination of sorted products of length congruent to k+l modulo 2. Hence C+C+⊆C+, and since 1C∈C+ (the empty product, of length 0), C+ is a subalgebra.

C− is not: 1C∉C−, and C−C−⊆C+ by the same parity count, so C− fails to be closed as soon as it holds an element with non-zero square, such as ι(ei) with q(ei)≠0.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.