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 fp(E;) is called alternating if (x1,,xp)Ep with xi=xi+1 for some 1i<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 XX, 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 1i,jp, define (i,j)Sp by

(i,j)(k)={jk=i,ik=j,kki,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 2j-2i-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 fp(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 1i<p define gi:E2 by

gi(y1,y2)=f(x1,,y1i,y2i+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,

τif=(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 1i<p; we have to show that f(x1,,xp)=0. On the one hand,

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

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

τif(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 ij, 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 fp(E;), define

Apf=1p!σSp(sgnσ)σf.
Lemma 8.

Ap is a linear map p(E;)𝒜p(E;).

Proof.

Let fp(E;). For σSp, σfp(E;), hence Apfp(E;). Namely, Apf is multilinear. It remains to show that it is alternating.

For σSp, as τστ is a bijection SpSp,

σ(Apf) =1p!τSp(sgnτ)στf
=(sgnσ)1p!τSp(sgnτ)τf
=(sgnσ)Af,

showing that Apf is alternating by Theorem 5, so Apf𝒜p(E;). ∎

Theorem 9.

Let fp(E;). f𝒜p(E;) if and only if Apf=f.

Proof.

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

Apf=1p!σSpσf=1p!σSpf=f.

Suppose Apf=f. Lemma 8 tells us Apf𝒜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 hp+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 1k<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 1i,jp; 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=τkA3. For σA3, let i=σ-1(k) and j=σ-1(k+1), for which i<p and jp+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

σA3A4(sgnσ)(σh)(x1,,xp+q)=0.

But Sp,q=A1A2A3A4, so

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

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

Definition 13.

For fp(E;) and gq(E;), define the tensor product fp,qgp+q(E;) by

(fp,qg)(x1,,xp+q)=f(x1,,xp)g(xp+1,,xp+q).

It is apparent that

(fp,qg)p+q,rh=fp,q+r(gq,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;),

fp,qg=ϕp,q(fg),

i.e., for h=fg,

(fp,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;),

fp,qg=(p+q)!p!q!Ap+q(fg).
Proof.

For σSp,q,

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

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

fp,qg =

Theorem 16.

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

gq,pf=(-1)pqfp,qg.
Proof.

Define αSp,q by

α(i)=q+i,1ip,α(p+i)=i,1iq.

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

α=1ip1jq(i+q-j,i+q-j+1).

Thus

sgnα=1ip1jq(-1)=(-1)pq.

Let τSq,p, then for 1ip,

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

and for 1iq,

(τα)(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 σα-1Sq,p.

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

(gq,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)pqσSp,q(sgnσ)f(xσ(1),,xσ(p))g(xσ(p+1),,xσ(p+q))=(-1)pq(fp,qg)(x1,,xp+q).

Thus

gq,pf=(-1)pqfp,qg.

Let 𝒜p,q,r(E;) be the set of those up+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,1ir.

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

σ(i)=i,1ip,σ(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,rSp,q,r¯=Sp,q,r

and

Sp,q+rSp¯,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,1ir.

It follows that

(στ)(1)<<(στ)(p)

and

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

and for 1ir, (στ)(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

(fp,qg)p+q,rh=fp,q+r(gq,rh).
Proof.

On the one hand,

(ϕp+q,rϕp,q,r¯)(fgh) =ϕp+q,r(ϕp,q,r¯((fg)h)
=ϕp+q,r((fp,qg)h)
=(fp,qg)p+q,rh.

On the other hand,

(ϕp,q+rϕp¯,q,r)(fgh) =ϕp,q+r(ϕp¯,q,r)(f(gh))
=ϕp,q+r(f(gq,rh))
=fp,q+r(gq,rh).

But by Lemma 18,

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

hence

(fp,qg)p+q,rh=fp,q+r(gq,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,,fnE* then for (x1,,xn)En,

(f1fn)(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,

(f1f2)(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 n2 and let (f1,,fn,fn+1)E* and (x1,,xn,xn+1)En+1. Then, setting u=f1fn𝒜n(E;), we have

(f1fnfn+1)(x1,,xn,xn+1)=(un,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,,fnE* and x1,,xnE and put

ai,j=fi(xj),1i,jn;

aMatn(). The Leibniz formula for the determinant of an n×n matrix tells us

deta=σSn(sgnσ)i=1nai,σ(i)=σSn(sgnσ)i=1nfi(xσ(j)).

Then Theorem 20 gives

det(fi(xj))1i,jn=(f1fn)(x1,,xn).
Lemma 21.

If f1,,fnE* are linearly independent then there are x1,,xnE such that

fi(xj)=δi,j,1i,jn.
Theorem 22.

f1,,fnE* are linearly dependent if and only if

f1fn=0.
Proof.

Suppose f1,,fn are linearly dependent, say, for some λi, ik,

fk=ikλifi.

Then, as fifi=0,

f1fn=0.

Suppose that f1,,fnE* are linearly independent. By Lemma 21, there are x1,,xnE such that

fi(xj)=δi,j,1i,jn.

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

(f1fn)(x1,,xn)=1,

so f1fn is not identically 0. ∎

4 Rk

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

ξi(x1,,xk)=xi,(x1,,xk)k.

Let ei=(0,,1i,,0)k for 1ik, in other words,

ξi(ej)=δi,j,1i,jk.

For xk,

x=1ikξi(x)ei.
Theorem 23.

(i) If fp(k;) then for (x1,,xk)(k)p,

f(x1,,xp)=1i1,,ipkf(ei1,,eip)ξi1(x1)ξip(xp).

(ii) If f𝒜p(k;) then

f=1i1<<ipkf(ei1,,eip)ξi1ξip.

(iii)

dim𝒜p(k;)=(kp).

(iv) If f𝒜k(k;) then

f=f(e1,,en)ξ1ξk.
Proof.

(i) Let fp(k;). For (x1,,xp)(k)p, because f:(k)p is multilinear,

f(x1,,xp) =f(1i1kξi1(x1)ei1,,1ipkξip(xp)eip)
=1i1,,ipkξi1(x1)ξip(xp)f(ei1,,eip).

(ii) Let f𝒜p(k;). Then f=Apf (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σ)1i1,,ipkξi1(xσ(1))ξip(xσ(p))f(ei1,,eip)
=1p!1i1,,ipkf(ei1,,eip)σSp(sgnσ)ξi1(xσ(1))ξip(xσ(p))
=1p!1i1,,ipkf(ei1,,eip)(ξi1ξip)(x1,,xp).

Since f is alternating, ir=is for rs implies f(ei1,,eip)=0. Let

p,k={I{1,,k}:|I|=p};

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

f =1p!Ip,kτSIf(eτ(I1),,eτ(Ip))ξτ(I1)ξτ(Ip)
=1p!Ip,kτSI(sgnτ)f(eI1,,eIp)(sgnτ)ξI1ξIp
=Ip,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.