Alternating multilinear forms

Jordan Bell
August 21, 2018

1 Permutations

We follow Cartan [2] and Abraham and Marsden [1].

Let E be a real vector space. Let ℒp⁢(E;ℝ) be the set of multilinear maps Ep→ℝ.

Definition 1.

A map f∈ℒp⁢(E;ℝ) is called alternating if (x1,…,xp)∈Ep with xi=xi+1 for some 1≤i<p implies f⁢(x1,…,xp)=0. Let 𝒜p⁢(E;ℝ) be the set of alternating elements of ℒp⁢(E;ℝ).

For a set X, let SX be the group of bijections X→X, and let Sp=S{1,…,p}. For σ,τ∈SX, write σ⁢τ=σ∘τ.

Definition 2.

For a function f:Ep→ℝ and a permutation σ∈Sp, define the function σ⁢f:Ep→ℝ by

(σ⁢f)⁢(x1,…,xp)=f⁢(xσ⁢(1),…,xσ⁢(p)),(x1,…,xp)∈Ep.
Theorem 3.

For a function f:Ep→ℝ and for σ,τ∈Sp,

τ⁢(σ⁢f)=(τ⁢σ)⁢f.
Proof.

Define g=σ⁢f. For (x1,…,xp)∈Ep and for yi=xτ⁢(i), we have

τ⁢(σ⁢f)⁢(x1,…,xp) =τ⁢(g)⁢(x1,…,xp)
=g⁢(xτ⁢(1),…,xτ⁢(p))
=g⁢(y1,…,yp)
=(σ⁢f)⁢(y1,…,yp)
=f⁢(yσ⁢(1),…,yσ⁢(p))
=f⁢(xτ⁢(σ⁢(1)),…,xτ⁢(σ⁢(p)))
=(τ⁢σ)⁢(f)⁢(x1,…,xp).

Thus

τ⁢(σ⁢f)=(τ⁢σ)⁢f.

∎

For 1≤i,j≤p, define (i,j)∈Sp by

(i,j)⁢(k)={jk=i,ik=j,kk≠i,j,

called a transposition. Define

τi=(i,i+1),

called an adjacent transposition. We can write a transposition (i,j), i<j, as a product of 2⁢j-2⁢i-1 adjacent transpositions:

(i,j) =(j-1,j)⁢(j-2,j-1)⁢⋯⁢(i+1,i+2)⁢(i,i+1)⁢(i+1,i+2)⁢⋯⁢(j-1,j)
=τj-1⁢⋯⁢τi+1⁢τi⁢τi+1⁢⋯⁢τj-1.
Theorem 4.

For σ,τ∈Sp,

sgn⁢(σ⁢τ)=sgn⁢(σ)⁢sgn⁢(τ).
Theorem 5.

Let f∈ℒp⁢(E;ℝ). f∈𝒜p⁢(E;ℝ) if and only if σ⁢f=(sgn⁢σ)⁢f for all σ∈Sp.

Proof.

(i) Suppose that f∈𝒜p⁢(E;ℝ) and let σ∈Sp; we have to show that σ⁢f=(sgn⁢σ)⁢f. Let (x1,…,xp)∈Ep and for 1≤i<p define gi:E2→ℝ by

gi⁢(y1,y2)=f⁢(x1,…,y1⏟i,y2⏟i+1,…,xp),(y1,y2)∈E2.

Because f is multilinear and alternating, on the one hand

gi⁢(xi+xi+1,xi+xi+1)=0,

and on the other hand

gi⁢(xi+xi+1,xi+xi+1) =gi⁢(xi,xi)+gi⁢(xi,xi+1)+gi⁢(xi+1,xi)+gi⁢(xi+1,xi+1)
=gi⁢(xi,xi+1)+gi⁢(xi+1,xi).

Therefore

gi⁢(xi+1,xi)=-gi⁢(xi,xi+1),

that is,

f⁢(x1,…,xp)=-f⁢(x1,…,xp).

Thus, as sgn⁢τi=-1,

τi⁢f=(sgn⁢τi)⁢f.

Because σ is equal to a product of adjacent transpositions, it then follows from Theorem 3 and Theorem 4 that σ⁢f=(sgn⁢σ)⁢f.

(ii) Suppose that σ⁢f=(sgn⁢σ)⁢f for all σ∈Sp. Let (x1,…,xp)∈Ep with xi=xi+1 for some 1≤i<p; we have to show that f⁢(x1,…,xp)=0. On the one hand,

τi⁢f⁢(x1,…,xp)=(sgn⁢τi)⁢f⁢(x1,…,xp)=-f⁢(x1,…,xp).

On the other hand, using that xi=xi+1,

τi⁢f⁢(x1,…,xp) =f⁢(xτi⁢(1),…,xτi⁢(i),xτi⁢(i+1),…,xτi⁢(p))
=f⁢(x1,…,xi+1,xi,…,xp)
=f⁢(x1,…,xi,xi+1,…,xp).

Hence

-f⁢(x1,…,xp)=f⁢(x1,…,xp),

which implies that f⁢(x1,…,xp)=0. This shows that f∈𝒜p⁢(E;ℝ). ∎

Theorem 6.

Let f∈𝒜p⁢(E;ℝ). If (x1,…,xp)∈Ep with xi=xj for some i≠j, then f⁢(x1,…,xp)=0.

Proof.

Check that there is some σ∈Sp satisfying σ⁢(1)=i and σ⁢(2)=j. For this σ,

(σ⁢f)⁢(x1,…,xp) =f⁢(xi,xj,xσ⁢(3),…,xσ⁢(p))
=f⁢(xi,xi,xσ⁢(3),…,xσ⁢(p))
=0.

But (σ⁢f)=(sgn⁢σ)⁢f, so (sgn⁢σ)⁢f⁢(x1,…,xp)=0. Therefore f⁢(x1,…,xp)=0. ∎

Definition 7.

For f∈ℒp⁢(E;ℝ), define

Ap⁢f=1p!⁢∑σ∈Sp(sgn⁢σ)⁢σ⁢f.
Lemma 8.

Ap is a linear map ℒp⁢(E;ℝ)→𝒜p⁢(E;ℝ).

Proof.

Let f∈ℒp⁢(E;ℝ). For σ∈Sp, σ⁢f∈ℒp⁢(E;ℝ), hence Ap⁢f∈ℒp⁢(E;ℝ). Namely, Ap⁢f is multilinear. It remains to show that it is alternating.

For σ∈Sp, as τ↦σ⁢τ is a bijection Sp→Sp,

σ⁢(Ap⁢f) =1p!⁢∑τ∈Sp(sgn⁢τ)⁢σ⁢τ⁢f
=(sgn⁢σ)⁢1p!⁢∑τ∈Sp(sgn⁢τ)⁢τ⁢f
=(sgn⁢σ)⁢A⁢f,

showing that Ap⁢f is alternating by Theorem 5, so Ap⁢f∈𝒜p⁢(E;ℝ). ∎

Theorem 9.

Let f∈ℒp⁢(E;ℝ). f∈𝒜p⁢(E;ℝ) if and only if Ap⁢f=f.

Proof.

Suppose f∈𝒜p⁢(E;ℝ). Then σ⁢f=(sgn⁢σ)⁢f for each σ∈Sp, by Theorem 5. Then

Ap⁢f=1p!⁢∑σ∈Spσ⁢f=1p!⁢∑σ∈Spf=f.

Suppose Ap⁢f=f. Lemma 8 tells us Ap⁢f∈𝒜p⁢(E;ℝ), hence f∈𝒜p⁢(E;ℝ). ∎

2 Wedge products

A permutation σ∈Sp+q is called a (p,q)-riffle shuffle if

σ⁢(1)<⋯<σ⁢(p),σ⁢(p+1)<⋯<σ⁢(p+q).

Denote by Sp,q those elements of Sp+q that are (p,q)-riffle shuffles.

Lemma 10.

|Sp,q|=(p+qp)=(p+q)!p!⁢q!.

Let 𝒜p,q⁢(E;ℝ) be the set of those h∈ℒp+q⁢(E;ℝ) such that (i) for each (y1,…,yq)∈Eq, the map

(x1,…,xp)↦h⁢(x1,…,xp,y1,…,yq),Ep→ℝ,

belongs to 𝒜p⁢(E;ℝ), and (ii) for (x1,…,xp)∈Ep, the map

(y1,…,yq)↦h⁢(x1,…,xp,y1,…,yq),Eq→ℝ,

belongs to 𝒜q⁢(E;ℝ).

Definition 11.

For h∈𝒜p,q⁢(E;ℝ) define

ϕp,q⁢(h)=∑σ∈Sp,q(sgn⁢σ)⁢(σ⁢h).
Theorem 12.

ϕp,q is a linear map 𝒜p,q⁢(E;ℝ)→𝒜p+q⁢(E;ℝ).

Proof.

Let h∈𝒜p,q⁢(E;ℝ), and say (x1,…,xp+q)∈Ep+q with xk=xk+1 for some 1≤k<p.

Let A1 be those σ∈Sp,q such that i=σ-1⁢(k),j=σ-1⁢(k+1)≤p. For σ∈A1, by Theorem 6,11 1 i,j are distinct and 1≤i,j≤p; they need not be adjacent.

(σ⁢h)⁢(x1,…,xp+q)=h⁢(xσ⁢(1),…,xσ⁢(p),…,xσ⁢(p+q))=0.

Let A2 be those σ∈Sp,q such that σ-1⁢(k),σ-1⁢(k+1)≥p+1. For σ∈A2, by Theorem 6,

(σ⁢h)⁢(x1,…,xp+q)=h⁢(xσ⁢(1),…,xσ⁢(p),…,xσ⁢(p+q))=0.

Thus

∑σ∈A1(sgn⁢σ)⁢(σ⁢h)⁢(x1,…,xp+q)=0

and

∑σ∈A2(sgn⁢σ)⁢(σ⁢h)⁢(x1,…,xp+q)=0.

Let A3 be those σ∈Sp,q for which σ-1⁢(k)<p and σ-1⁢(k+1)≥p+1 and let A4 be those σ∈Sp,q for which σ-1⁢(k)≥p+1 and σ-1⁢(k+1)≤p. If σ∈A3 then

(τk⁢σ)-1⁢(k)=σ-1⁢τk-1⁢(k)=σ-1⁢(k+1)≥p+1

and

(τk⁢σ)-1⁢(k+1)=σ-1⁢τk-1⁢(k+1)=σ-1⁢(k)<p,

so τk⁢σ∈A4. Likewise, if σ∈A4 then τk⁢σ∈A3. Thus A4=τk⁢A3. For σ∈A3, let i=σ-1⁢(k) and j=σ-1⁢(k+1), for which i<p and j≥p+1. Then, as xk=xk+1,

(sgn⁢σ)⁢(σ⁢h)⁢(x1,…,xp+q)+(sgn⁢τk⁢σ)⁢(τk⁢σ⁢h)⁢(x1,…,xp+q)=(sgn⁢σ)⁢h⁢(xσ⁢(1),…,xσ⁢(p+q))-(sgn⁢σ)⁢h⁢(xτk⁢σ⁢(1),…,xτk⁢σ⁢(p+q))=(sgn⁢σ)⁢(h⁢(xσ⁢(1),…,xσ⁢(p+q))-h⁢(xτk⁢σ⁢(1),…,xτk⁢σ⁢(i),…,xτk⁢σ⁢(j),…,xτk⁢σ⁢(p+q)))=(sgn⁢σ)⁢(h⁢(xσ⁢(1),…,xσ⁢(p+q))-h⁢(xτk⁢σ⁢(1),…,xτk⁢(k),…,xτk⁢(k+1),…,xτk⁢σ⁢(p+q)))=(sgn⁢σ)⁢(h⁢(xσ⁢(1),…,xσ⁢(p+q))-h⁢(xσ⁢(1),…,xk+1,…,xk,…,xσ⁢(p+q)))=(sgn⁢σ)⁢(h⁢(xσ⁢(1),…,xσ⁢(p+q))-h⁢(xσ⁢(1),…,xk,…,xk+1,…,xσ⁢(p+q)))=(sgn⁢σ)⁢(h⁢(xσ⁢(1),…,xσ⁢(p+q))-h⁢(xσ⁢(1),…,xσ⁢(p+q)))=0.

Therefore

∑σ∈A3∪A4(sgn⁢σ)⁢(σ⁢h)⁢(x1,…,xp+q)=0.

But Sp,q=A1∪A2∪A3∪A4, so

ϕp,q⁢(h)⁢(x1,…,xp+q)=0.

Thus ϕp,q⁢(h)∈𝒜p+q⁢(E;ℝ). ∎

Definition 13.

For f∈ℒp⁢(E;ℝ) and g∈ℒq⁢(E;ℝ), define the tensor product f⊗p,qg∈ℒp+q⁢(E;ℝ) by

(f⊗p,qg)⁢(x1,…,xp+q)=f⁢(x1,…,xp)⁢g⁢(xp+1,…,xp+q).

It is apparent that

(f⊗p,qg)⊗p+q,rh=f⊗p,q+r(g⊗q,rh),

and thus it makes sense to write the tensor product without indices.

Definition 14.

Define the wedge product

∧p,q:𝒜p(E;ℝ)×𝒜q(E;ℝ)→𝒜p+q(E;ℝ)

by, for f∈𝒜p⁢(E;ℝ),g∈𝒜q⁢(E;ℝ),

f∧p,qg=ϕp,q⁢(f⊗g),

i.e., for h=f⊗g,

(f∧p,qg)⁢(x1,…,xp+q) =∑σ∈Sp,q(sgn⁢σ)⁢(σ⁢h)
=∑σ∈Sp,q(sgn⁢σ)⁢h⁢(xσ⁢(1),…,xσ⁢(p+q))
=∑σ∈Sp,q(sgn⁢σ)⁢f⁢(xσ⁢(1),…,xσ⁢(p))⁢g⁢(xσ⁢(p+1),…,xσ⁢(p+q)).
Theorem 15.

For f∈𝒜p⁢(E;ℝ) and g∈𝒜q⁢(E;ℝ),

f∧p,qg=(p+q)!p!⁢q!⁢Ap+q⁢(f⊗g).
Proof.

For σ∈Sp,q,

σ⁢(1)<⋯<σ⁢(p),σ⁢(p+1)<⋯<σ⁢(p+q).

Let Iσ={σ⁢(i):1≤i≤p} and Jσ={σ⁢(i):p+1≤i≤p+q}.

f∧p,qg =

∎

Theorem 16.

For f∈𝒜p⁢(E;ℝ) and g∈𝒜q⁢(E;ℝ),

g∧q,pf=(-1)p⁢q⁢f∧p,qg.
Proof.

Define α∈Sp,q by

α⁢(i)=q+i,1≤i≤p,α⁢(p+i)=i,1≤i≤q.

Then22 2 For example, take p=3 and q=2. Then α⁢(1)=3,α⁢(2)=4,α⁢(3)=5,α⁢(4)=1,α⁢(5)=2. Here ∏1≤i≤p∏1≤j≤q(i+q-j,i+q-j+1) =∏1≤i≤3∏1≤j≤2(i-j+2,i-j+3) =∏1≤i≤3(i+1,i+2)⁢(i,i+1) =(2,3)⁢(1,2)⁢(3,4)⁢(2,3)⁢(4,5)⁢(3,4) =α.

α=∏1≤i≤p∏1≤j≤q(i+q-j,i+q-j+1).

Thus

sgn⁢α=∏1≤i≤p∏1≤j≤q(-1)=(-1)p⁢q.

Let τ∈Sq,p, then for 1≤i≤p,

(τ⁢α)⁢(i)=τ⁢(q+i)

and for 1≤i≤q,

(τ⁢α)⁢(p+i)=τ⁢(i),

But τ∈Sq,p so

τ⁢(1)<⋯<τ⁢(q),τ⁢(q+1)<⋯<τ⁢(q+p),

thus

(τ⁢α)⁢(1)<⋯<(τ⁢α)⁢(p),(τ⁢α)⁢(p+1)<⋯<(τ⁢α)⁢(p+q),

which means that τ⁢α∈Sp,q. Likewise, if σ∈Sp,q then

(σ⁢α-1)⁢(1)=σ⁢(q+1),…,(σ⁢α-1)⁢(q)=σ⁢(p+q)

and

(σ⁢α-1)⁢(q+1)=σ⁢(1),…,(σ⁢α-1)⁢(q+p)=σ⁢(p),

and because σ∈Sp,q it follows that σ⁢α-1∈Sq,p.

Hence for (x1,…,xp+q)∈Ep+q,

(g∧q,pf)⁢(x1,…,xp+q)=∑τ∈Sq,p(sgn⁢τ)⁢g⁢(xτ⁢(1),…,xτ⁢(q))⁢f⁢(xτ⁢(q+1),…,xτ⁢(q+p))=∑σ∈Sp,q(sgn⁢σ⁢α-1)⁢g⁢(x(σ⁢α-1)⁢(1),…,x(σ⁢α-1)⁢(q))⁢f⁢(x(σ⁢α-1)⁢(q+1),…,x(σ⁢α-1)⁢(q+p))=(sgn⁢α-1)⁢∑σ∈Sp,q(sgn⁢σ)⁢g⁢(xσ⁢(p+1),…,xσ⁢(p+q))⁢f⁢(xσ⁢(1),…,xσ⁢(p))=(-1)p⁢q⁢∑σ∈Sp,q(sgn⁢σ)⁢f⁢(xσ⁢(1),…,xσ⁢(p))⁢g⁢(xσ⁢(p+1),…,xσ⁢(p+q))=(-1)p⁢q⁢(f∧p,qg)⁢(x1,…,xp+q).

Thus

g∧q,pf=(-1)p⁢q⁢f∧p,qg.

∎

Let 𝒜p,q,r⁢(E;ℝ) be the set of those u∈ℒp+q+r⁢(E;ℝ) such that (i) for each (y1,…,yq,z1,…,zr)∈Eq+r, the map

(x1,…,xp)↦u⁢(x1,…,xp,y1,…,yq,z1,…,zr),Ep→ℝ,

belongs to 𝒜p⁢(E;ℝ), (ii) for (x1,…,xp,z1,…,zr)∈Ep+r, the map

(y1,…,yq)↦u⁢(x1,…,xp,y1,…,yq,z1,…,zr),Eq→ℝ,

belongs to 𝒜q⁢(E;ℝ), and (iii) for (x1,…,xp,y1,…,yq)∈Ep+q, the map

(z1,…,zr)↦u⁢(x1,…,xp,y1,…,yq,z1,…,zr),Er→ℝ,

belongs to 𝒜r⁢(E;ℝ).

Let Sp,q,r¯ be those σ∈Sp+q+r such that

σ⁢(1)<⋯<σ⁢(p),σ⁢(p+1)<⋯<σ⁢(p+q),σ⁢(p+q+i)=p+q+i,1≤i≤r.

Let Sp¯,q,r be those σ∈Sp+q+r such that

σ⁢(i)=i,1≤i≤p,σ⁢(p+1)<⋯<σ⁢(p+q),σ⁢(p+q+1)<⋯<σ⁢(p+q+r).

Let Sp,q,r be those σ∈Sp+q+r such that

σ⁢(1)<⋯<σ⁢(p),σ⁢(p+1)<⋯<σ⁢(p+q),σ⁢(p+q+1)<⋯<σ⁢(p+q+r).
Lemma 17.
Sp+q,r⁢Sp,q,r¯=Sp,q,r

and

Sp,q+r⁢Sp¯,q,r=Sp,q,r.
Proof.

Let σ∈Sp+q,r and τ∈Sp,q,r¯. Then

σ⁢(1)<⋯<σ⁢(p+q),σ⁢(p+q+1)<⋯<σ⁢(p+q+r)

and

τ⁢(1)<⋯<τ⁢(p),τ⁢(p+1)<⋯<τ⁢(p+q),τ⁢(p+q+i)=p+q+i,1≤i≤r.

It follows that

(σ⁢τ)⁢(1)<⋯<(σ⁢τ)⁢(p)

and

(σ⁢τ)⁢(p+1)<⋯<(σ⁢τ)⁢(p+q)

and for 1≤i≤r, (σ⁢τ)⁢(p+q+i)=σ⁢(p+q+i), so

(σ⁢τ)⁢(p+q+1)<⋯<σ⁢(p+q+r).

Thus σ⁢τ∈Sp,q,r. ∎

Define ϕp,q,r¯:𝒜p,q,r⁢(E;ℝ)→𝒜p+q,r⁢(E;ℝ) by

ϕp,q,r¯⁢(u)=∑σ∈Sp,q,r¯(sgn⁢σ)⁢(σ⁢u),u∈𝒜p,q,r⁢(E;ℝ)

and define ϕp¯,q,r:𝒜p,q,r⁢(E;ℝ)→𝒜p,q+r⁢(E;ℝ) by

ϕp¯,q,r⁢(u)=∑σ∈Sp¯,q,r(sgn⁢σ)⁢(σ⁢u),u∈𝒜p,q,r⁢(E;ℝ)
Lemma 18.

For u∈𝒜p,q,r⁢(E;ℝ),

(ϕp+q,r∘ϕp,q,r¯)⁢u=∑ρ∈Sp,q,r(sgn⁢ρ)⁢ρ⁢u

and

(ϕp,q+r∘ϕp¯,q,r)⁢u=∑ρ∈Sp,q,r(sgn⁢ρ)⁢ρ⁢u,

and so

ϕp+q,r∘ϕp,q,r¯=ϕp,q+r∘ϕp¯,q,r.
Proof.

Applying Lemma 17 we get

(ϕp+q,r∘ϕp,q,r¯)⁢u =∑σ∈Sp+q,r(sgn⁢σ)⁢σ⁢ϕp,q,r¯⁢(u)
=∑σ∈Sp+q,r(sgn⁢σ)⁢σ⁢∑τ∈Sp,q,r¯(sgn⁢τ)⁢(τ⁢u)
=∑σ∈Sp+q,r(sgn⁢σ⁢τ)⁢∑τ∈Sp,q,r¯σ⁢τ⁢u
=∑ρ∈Sp,q,r(sgn⁢ρ)⁢ρ⁢u

and similarly

(ϕp,q+r∘ϕp¯,q,r)⁢u =∑σ∈Sp,q+r(sgn⁢σ)⁢σ⁢ϕp¯,q,r⁢(u)
=∑σ∈Sp,q+r(sgn⁢σ)⁢σ⁢∑τ∈Sp¯,q,r(sgn⁢τ)⁢(τ⁢u)
=∑σ∈Sp,q+r(sgn⁢σ⁢τ)⁢∑τ∈Sp¯,q,rσ⁢τ⁢u
=∑ρ∈Sp,q,r(sgn⁢ρ)⁢ρ⁢u.

Thus

(ϕp+q,r∘ϕp,q,r¯)⁢u=(ϕp,q+r∘ϕp¯,q,r)⁢u,

from which the claim follows. ∎

Theorem 19.

If f∈𝒜p⁢(E;ℝ), g∈𝒜q⁢(E;ℝ), and h∈𝒜r⁢(E;ℝ), then

(f∧p,qg)∧p+q,rh=f∧p,q+r(g∧q,rh).
Proof.

On the one hand,

(ϕp+q,r∘ϕp,q,r¯)⁢(f⊗g⊗h) =ϕp+q,r(ϕp,q,r¯((f⊗g)⊗h)
=ϕp+q,r⁢((f∧p,qg)⊗h)
=(f∧p,qg)∧p+q,rh.

On the other hand,

(ϕp,q+r∘ϕp¯,q,r)⁢(f⊗g⊗h) =ϕp,q+r⁢(ϕp¯,q,r)⁢(f⊗(g⊗h))
=ϕp,q+r⁢(f⊗(g∧q,rh))
=f∧p,q+r(g∧q,rh).

But by Lemma 18,

ϕp+q,r∘ϕp,q,r¯=ϕp,q+r∘ϕp¯,q,r,

hence

(f∧p,qg)∧p+q,rh=f∧p,q+r(g∧q,rh).

∎

3 Linear forms

Let E*=ℒ1⁢(E;ℝ), the dual space of E, whose elements we call linear forms. It is immediate that 𝒜1⁢(E;ℝ)=ℒ1⁢(E;ℝ)=E*.

Theorem 20.

If f1,…,fn∈E* then for (x1,…,xn)∈En,

(f1∧⋯∧fn)⁢(x1,…,xn)=∑σ∈Sn(sgn⁢σ)⁢f1⁢(xσ⁢(1))⁢⋯⁢fn⁢(xσ⁢(n)).
Proof.

For n=1 the claim is immediate. For n=2, on the one hand, using the definition of the wedge product,

(f1∧f2)⁢(x1,x2)=∑σ∈S1,1(sgn⁢σ)⁢f1⁢(xσ⁢(1))⁢f2⁢(xσ⁢(2)),

and as S1,1=S2 the claim is true for n=2. Suppose the claim is true for some n≥2 and let (f1,…,fn,fn+1)∈E* and (x1,…,xn,xn+1)∈En+1. Then, setting u=f1∧⋯∧fn∈𝒜n⁢(E;ℝ), we have

(f1∧⋯∧fn∧fn+1)⁢(x1,…,xn,xn+1)=(u∧n,1fn+1)⁢(x1,…,xn,xn+1)=∑σ∈Sn,1(sgn⁢σ)⁢u⁢(xσ⁢(1),…,xσ⁢(n))⁢fn+1⁢(xσ⁢(n+1))=∑σ∈Sn,1(sgn⁢σ)⁢(∑τ∈Sn(sgn⁢τ)⁢f1⁢(x(σ⁢τ)⁢(1))⁢⋯⁢fn⁢(x(σ⁢τ)⁢(n)))⁢fn+1⁢(xσ⁢(n+1))=∑ρ∈Sn+1(sgn⁢ρ)⁢f1⁢(xρ⁢(1))⁢⋯⁢fn⁢(xρ⁢(n))⁢fn+1⁢(xρ⁢(n+1)),

thus the claim is true for n+1. ∎

Let f1,…,fn∈E* and x1,…,xn∈E and put

ai,j=fi⁢(xj),1≤i,j≤n;

a∈Matn⁢(ℝ). The Leibniz formula for the determinant of an n×n matrix tells us

det⁡a=∑σ∈Sn(sgn⁢σ)⁢∏i=1nai,σ⁢(i)=∑σ∈Sn(sgn⁢σ)⁢∏i=1nfi⁢(xσ⁢(j)).

Then Theorem 20 gives

det⁡(fi⁢(xj))1≤i,j≤n=(f1∧⋯∧fn)⁢(x1,…,xn).
Lemma 21.

If f1,…,fn∈E* are linearly independent then there are x1,…,xn∈E such that

fi⁢(xj)=δi,j,1≤i,j≤n.
Theorem 22.

f1,…,fn∈E* are linearly dependent if and only if

f1∧⋯∧fn=0.
Proof.

Suppose f1,…,fn are linearly dependent, say, for some λi∈ℝ, i≠k,

fk=∑i≠kλi⁢fi.

Then, as fi∧fi=0,

f1∧⋯∧fn=0.

Suppose that f1,…,fn∈E* are linearly independent. By Lemma 21, there are x1,…,xn∈E such that

fi⁢(xj)=δi,j,1≤i,j≤n.

Then det⁡(fi⁢(xj))=1, and hence

(f1∧⋯∧fn)⁢(x1,…,xn)=1,

so f1∧⋯∧fn is not identically 0. ∎

4 Rk

We now take E=ℝk. For 1≤i≤k define ξi∈(ℝk)* by

ξi⁢(x1,…,xk)=xi,(x1,…,xk)∈ℝk.

Let ei=(0,…,1⏟i,…,0)∈ℝk for 1≤i≤k, in other words,

ξi⁢(ej)=δi,j,1≤i,j≤k.

For x∈ℝk,

x=∑1≤i≤kξi⁢(x)⁢ei.
Theorem 23.

(i) If f∈ℒp⁢(ℝk;ℝ) then for (x1,…,xk)∈(ℝk)p,

f⁢(x1,…,xp)=∑1≤i1,…,ip≤kf⁢(ei1,…,eip)⁢ξi1⁢(x1)⁢⋯⁢ξip⁢(xp).

(ii) If f∈𝒜p⁢(ℝk;ℝ) then

f=∑1≤i1<⋯<ip≤kf⁢(ei1,…,eip)⁢ξi1∧⋯∧ξip.

(iii)

dim⁡𝒜p⁢(ℝk;ℝ)=(kp).

(iv) If f∈𝒜k⁢(ℝk;ℝ) then

f=f⁢(e1,…,en)⁢ξ1∧⋯∧ξk.
Proof.

(i) Let f∈ℒp⁢(ℝk;ℝ). For (x1,…,xp)∈(ℝk)p, because f:(ℝk)p→ℝ is multilinear,

f⁢(x1,…,xp) =f⁢(∑1≤i1≤kξi1⁢(x1)⁢ei1,…,∑1≤ip≤kξip⁢(xp)⁢eip)
=∑1≤i1,…,ip≤kξi1⁢(x1)⁢⋯⁢ξip⁢(xp)⁢f⁢(ei1,…,eip).

(ii) Let f∈𝒜p⁢(ℝk;ℝ). Then f=Ap⁢f (Theorem 9),

f=1p!⁢∑σ∈Sp(sgn⁢σ)⁢σ⁢f,

so for (x1,…,xp)∈(ℝk)p, applying Theorem 20,

f⁢(x1,…,xp) =1p!⁢∑σ∈Sp(sgn⁢σ)⁢f⁢(xσ⁢(1),…,xσ⁢(p))
=1p!⁢∑σ∈Sp(sgn⁢σ)⁢∑1≤i1,…,ip≤kξi1⁢(xσ⁢(1))⁢⋯⁢ξip⁢(xσ⁢(p))⁢f⁢(ei1,…,eip)
=1p!⁢∑1≤i1,…,ip≤kf⁢(ei1,…,eip)⁢∑σ∈Sp(sgn⁢σ)⁢ξi1⁢(xσ⁢(1))⁢⋯⁢ξip⁢(xσ⁢(p))
=1p!⁢∑1≤i1,…,ip≤kf⁢(ei1,…,eip)⁢(ξi1∧⋯∧ξip)⁢(x1,…,xp).

Since f is alternating, ir=is for r≠s implies f⁢(ei1,…,eip)=0. Let

ℐp,k={I⊂{1,…,k}:|I|=p};

For I∈ℐp,k, define I1,…,Ip by I={I1,…,Ip} and I1<⋯<Ip. Then, applying Theorem 16, as |SI|=p!,

f =1p!⁢∑I∈ℐp,k∑τ∈SIf⁢(eτ⁢(I1),…,eτ⁢(Ip))⁢ξτ⁢(I1)∧⋯∧ξτ⁢(Ip)
=1p!⁢∑I∈ℐp,k∑τ∈SI(sgn⁢τ)⁢f⁢(eI1,…,eIp)⁢(sgn⁢τ)⁢ξI1∧⋯∧ξIp
=∑I∈ℐp,kf⁢(eI1,…,eIp)⁢ξI1∧⋯∧ξIp.

proving the claim.

(iii) |ℐp,k|=(kp).

(iv) This follows from (ii) and the fact that |ℐp,k|=1 with ℐp,k={{1,…,k}}. ∎

References

  • [1] R. Abraham and J. E. Marsden (2008) Foundations of mechanics. second edition, AMS Chelsea Publishing, Providence, RI. Cited by: §1.
  • [2] H. Cartan (1970) Differential forms. Hermann, Paris. Cited by: §1.