Wisconsin Bourbaki Seminar

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last update: 24 March 2014

Notes and References

This is an excerpt from notes of the Wisconsin Bourbaki Seminar, Fall 1993. The notes were written by Oliver Eng, Susan Hollingsworth, Mark Logan, Arun Ram and Louis Solomon.

§2

  1. Let K be a commutative ring with unit, let E be a K-module, and let E* be the dual of E. Let ϕ denote the canonical homomorphism from E⊗E* to End(E).
    1. A pseudo-reflection of E is a non-identity element of End(E) of the form sx,y*=1-ϕ (x⊗y*), where x∈E and y*∈E*. A pseudo-reflection s is called a reflection if one may choose x,y* such that ⟨x,y*⟩=2; show that then one has that s2=1 and that s(x)=-x.
    2. Let x∈E, y*∈E* such that ⟨x,y*⟩=1 and let s be the reflection corresponding to the pair (2x,y*). Show that E is the direct sum of the submodule Kx generated by x and the orthogonal H of y*. Show that Kx is free with base x, and that s is equal to 1 on H and to -1 on Kx.

    Solution.
    1. The map ϕ is given by ϕ: E⊗E* ⟶ End(E) x⊗y* ⟼ x⟨·,y*⟩. Since ⟨,⟩ is bilinear sx,y*2 = (1-ϕ(x⊗y*)) (1-ϕ(x⊗y*)) = 1-2ϕ(x⊗y*)+ ϕ(x⊗y*) (ϕ(x⊗y*)) = 1-2ϕ(x⊗y*)+x ⟨x⟨·,y*⟩,y*⟩ = 1-2ϕ(x⊗y*)+ x⟨·,y*⟩ ⟨x,y*⟩ = 1-2ϕ(x⊗y*)+ ϕ(x⊗y) ⟨x,y*⟩ = 1-ϕ(x⊗y*) (⟨x,y*⟩-2) or any pseudo-reflection sx,y*. Thus, with the assumption that ⟨x,y*⟩=2, we have that sx,y*2=1.
      From the definition of pseudo-reflection we have that sx,y*(x)= [1-ϕ(x⊗y*)] (x)=x-x⟨x,y*⟩. Thus, if ⟨x,y*⟩=2, we have that sx,y*(x)=-x.
    2. Let H={h∈E | ⟨h,y*⟩=0} and Kx={kx | k∈K}.
      We show that if ⟨x,y*⟩=1 then
      1. Kx+H=E.
      2. Kx∩H=0.
      3. Kx is free with basis x.
      4. s2x,y*(kx)=-kx for any k∈K.
      5. s2x,y*(h)=h for any h∈H.
      1. Let e∈E. Then e=⟨e,y*⟩x+(e-⟨e,y*⟩x). Since ⟨e-⟨e,y*⟩x,y*⟩ = ⟨e,y*⟩- ⟨e,y*⟩ ⟨x,y*⟩ = ⟨e,y*⟩ (1-⟨x,y*⟩) = 0, we have that e-⟨e,y*⟩x∈H. It follows that e∈Kx+H.
      2. Let e∈Kx∩H. Write e=kx for some k∈K. Then 0=⟨e,y*⟩= ⟨kx,y*⟩=k 1=k. So k=0 and e=kx=0.
      3. To show that Kx is free with basis x we must show that every element can be written uniquely in the form kx for some k∈K. To see this, suppose that kx=k′x for some k,k′∈K. Then 0=⟨0,y*⟩= ⟨(k-k′)x,y*⟩= (k-k′)⟨x,y*⟩ =k-k′. So k=k′.
      4. Let kx∈Kx. Then, since ⟨x,y*⟩=1, s2x,y*(kx)= kx-⟨kx,y*⟩ 2x=kx-k2x=-kx.
      5. Let h∈H. Then s2x,y*(h) =h-⟨h,y*⟩ 2x=h-0=h.◻
  2. With the notations as in exercise 1, show that det(sx,y*)=1-⟨x,y*⟩ if E is a free K-module of finite type.

    Solution. Let e1,e2,…,en be a basis of E. Then, for any u∈End(E), u(e1)∧ u(e2)∧⋯∧ u(en)=det (u)(e1∧e2∧⋯∧en). (*) We have that sx,y* (e1∧e2∧⋯∧en) = (e1-⟨e1,y*⟩x)∧ (e2-⟨e2,y*⟩x)∧⋯∧ (en-⟨en,y*⟩x) = e1∧⋯∧en-∑i e1∧⋯∧ei-1∧ ⟨ei,y*⟩x ∧ei+1∧⋯∧en+0. Substituting x=c1e1+c2e2+⋯+cnen gives that sx,y* (e1∧e2∧⋯∧en) = e1∧⋯∧en +∑i⟨ei,y*⟩ e1∧⋯∧ei-1∧ (c1e1+c2e2+⋯+cnen) ∧ei+1∧⋯∧en = e1∧⋯∧en-∑i ⟨ei,y*⟩ e1∧⋯∧ei-1∧ ciei∧ei+1∧ ⋯∧en = e1∧⋯∧en-∑i ⟨ciei,y*⟩ e1∧⋯∧ei-1∧ ei∧ei+1∧ ⋯∧en = e1∧⋯∧en- ⟨x,y*⟩ e1∧⋯∧en = (1-⟨x,y*⟩) e1∧e2∧⋯∧en. Thus det(sx,y*)= 1-⟨x,y*⟩. ◻
  3. Let V be a complex Hilbert space with basis e1,…,eℓ. For 1≤i≤ℓ, let si be a unitary pseudo-reflection such that si(ei)=ciei where ci≠1. An element of V is invariant under s if and only if it is orthogonal to ei. Let W be the subgroup of GL(V) generated by the si.
    1. Let i be an integer ≥1. Show that every element of ⋀iV invariant under W is zero.
    2. Suppose that W is finite. Show that for all endomorphisms A of V one has: ∑w∈Wdet (A-w)=Card (W)det(A), ∑w∈Wdet (1-Aw)=Card (W). Deduce that, for all A∈End(V) there exists w∈W such that Aw does not have any nonzero fixed point.
    3. Let Γ be the graph with vertices in the set [1,ℓ] and edges (i,j) determined by the pairs ei,ej such that ei and ej are not orthogonal. Show that V is a simple W-module if and only if Γ is connnected and nonempty.
    4. Suppose that V is a simple W-module. Show that the W-modules ⋀iV (0≤i≤ℓ) are simple. Show that these modules are pairwise nonisomorphic.

    Solution. Let us first see that an element of V is invariant under si if and only if it is orthogonal to ei. Suppose v∈V is such that si(v)=v. Then, since si is unitary, ⟨v,ei⟩= ⟨si(v),si(ei)⟩= ⟨v,ciei⟩= c‾i⟨v,ei⟩. Since ci≠1 it follows that ⟨v,ei⟩=0. So v is orthogonal to ei. To prove the converse, suppose that v is orthogonal to ei. Then, since si is a pseudoreflection, (1-si)v= c(1-si)ei= c(1-ci)ei for some c∈ℂ. Thus ⟨(1-si)v,ei⟩ =c(1-ci) ⟨ei,ei⟩. On the other hand, ⟨(1-si)v,ei⟩ = ⟨v,ei⟩- ⟨siv,ei⟩ = 0-ci-1‾ ⟨siv,siei⟩ = ci-1‾ ⟨v,ei⟩ = 0. Since ci≠1 and ⟨ei,ei⟩≠0 it follows that c=0. So (1-si)v=0 and thus siv=v.
    1. The proof is by induction on ℓ=dim V. When dim V=1 then e1 is a basis of V. Suppose that wce1=ce1, for all w∈W. Then s1ce1=ce1 ⇒c1ce1⇒c (1-c1)e1=0. Since c1≠0 we have that c=0. Now suppose that dim V=ℓ. Let V′ be the subspace spanned by {e1,e2,…,eℓ-1} and let e∈(V′)⊥. Let W′ be the group generated by s1,s2,…,sℓ-1. If v∈⋀iV then v=a+b∧e,where  a∈⋀iV′ and b ∈⋀iV. Suppose that v∈⋀iV and that wv=v for all w∈W. If w∈W′ then wv = w(a+b∧e) = wa+wb∧we = wa+wb∧esince  e∈(V′)⊥ = a+b∧esince wv=v. So wa=a and wb=b for all w∈W′. By induction we have that a=0 and b=0. So v=a+b∧e=0.
    2. We use the determinant relation given in (*). det(A-w)= (A-w) (e1∧⋯∧eℓ)= ∑I⊆[1,ℓ]± ( Aei1∧⋯∧ Aeik∧wej1 ∧⋯∧wejm ) , where the sum is over all subsets I={i1,i2,…,ik} of [1,ℓ]={1,2,…,ℓ} and Ic={j1,j2,…,jm} is the complement of I in [1,ℓ]. Then ∑w∈Wdet(A-w) = ∑w∈W∑I⊆[1,ℓ] ± ( Aei1∧⋯∧ Aeik∧wej1 ∧⋯∧wejm ) = ∑I⊆[1,ℓ]± ( Aei1∧⋯∧ Aeik∧ ( ∑w∈W wej1∧⋯∧wejm ) ) . Then, by part a), provided m≥1, ∑w∈Wwej1∧⋯∧wejm=0 since the left hand side is an invariant element of ⋀mV. So ∑w∈W det(A-w) = ∑w∈WAe1∧ ⋯∧Aeℓ+ ∑I⊂[1,ℓ]I≠[1,ℓ] ±Aei1∧⋯∧Aeik ∧0 = ∑w∈WAe1∧⋯∧ Aeℓ = (det A)Card(W) e1∧⋯∧eℓ. This proves the identity ∑w∈Wdet(A-w)=Card(W)det A. The identity ∑w∈Wdet(1-Aw)=Card(W) is proved in exactly the same fashion. It remains to show that for all A∈End(V) there exists w∈W such that Aw does not have any nonzero fixed point. Suppose that there does not exist w∈W such that Aw has no nonzero fixed point. Then for each w∈W there is a nonzero vector v∈V such that (1-Aw)v=0. So, for each w∈W, det(1-Aw)=0. So ∑w∈Wdet(1-Aw)=0. This is a contradiction to the identity above.
    3. ⇒: Suppose that Γ is connected. Assume that V′ is a nonzero W-submodule of V. Let x∈V′, x≠0. Then six≠x for some i∈[1,ℓ]={1,2,…,ℓ} since ⟨x,ei⟩=0 for all 1≤i≤ℓ is impossible. Let i∈[1,ℓ] be such that six≠x. Since si is a pseudo reflection we have that (1-si)x=cei∈V′. Let k be any other element of [1,ℓ]. Since Γ is connected there is a path ei=ei1→ei2→⋯→eim=ek in Γ connecting ei and ek. Assume eij∈V′. Since sij+1 is a pseudoreflection, (1-sij+1)eij=ceij+1∈V′. Since eij+1 and eij are connected in the graph Γ they are not orthogonal and thus sij+1eij≠eij and so c≠0. So eij+1∈V′. In this way we show that ek∈V′. Thus ek∈V′ for all k∈[1,ℓ]. So V′=V. Thus V is a simple W-module.
      ⇐: Suppose that Γ is not connected and let Γ1 be a connected component of Γ. Let ei1,ei2,…,eik be the vertices in Γ1. Then let V1 be the span of the basis elements eij corresponding to the vertices in Γ1. Let k∈[1,ℓ] and let ei∈V1 Then ei∈V1 and if ek is a vertex in Γ1, then, since (1-sk)ei=cek∈V1, we have that skei∈V1. If ek is not a vertex in Γ1 then ⟨ek,ei⟩=0 and it follows that skei=ei∈V1. Thus, V1 is stable under the action of W. So V1 is a proper submodule of V. So V is not simple.
    4. We will do this problem by completing the following steps.
      1. Let sj∈S. Then the rank of sj on ⋀pV is (n-1i-1).
      2. The modules ⋀iV and ⋀jV are nonisomorphic if i≠j.
      Let j be a vertex in the graph Γ such that Γ-{j} is connected. Let V′=span {ei | i≠j} and let e∈(V′)⊥ so that V=V′⊕ℂe.
      1. sje=e+cej, where c∈ℂ and c≠0.
      2. sje=v′+de, where v′∈V′, v′≠0 and d∈ℂ.
      It is clear that ⋀0V and ⋀nV are irreducible since they are 1-dimensional. Let 0<p<n. Then ⋀pV=U1⊕U2, where U1=⋀pV′ and U2=(⋀p-1V′)∧e. By induction on dim V we know that U1 and U2 are irreducible under the action of W′.
      1. U1 and U2 are not invariant under the action of W.
      2. If E is a nonzero submodule of ⋀pV then E=⋀pV.
      1. Note that if v1,…,vp∈V then, since sj is a pseudo-reflection we have that for every i, sjvi=vi+diej for some di∈ℂ. Thus (sj-1)v1∧⋯∧ vp = sjv1∧⋯∧sj vp-v1∧⋯∧vp = (v1+d1ej)∧⋯∧ (vp+dpej)-v1 ∧⋯∧vp = ∑k=1pdkv a1∧⋯∧ej∧⋯ ∧vp, and also sj(ej∧v1∧⋯∧vp-1) = cjej∧ (v1+d1ej) ∧⋯∧ (vp-1+dp-1ej) -ej∧v1∧⋯∧vp-1 = (cj-1)ej∧ v1∧⋯∧vp-1. The first equality shows that the action of sj on ⋀pV is a map onto ej∧(⋀p-1V). The second equality shows that (sj-1) acts by a nonzero constant on ej∧(⋀p-1V). It follows that the rank of sj-1 acting on ⋀pV is dim(ej∧(⋀p-1V))=(n-1p-1).
      2. Assume that i≠j and that ⋀iV and ⋀jV are isomorphic. Then we have that (ni)=dim (⋀iV)=dim (⋀jV)= (nn-j), giving that i=n-j. We also must have that the rank of sj-1 on ⋀iV is the same as the rank of sj-1 on ⋀jV. It follows that (n-1i-1)=(n-1n-1-(j-1)), from which we get that i-1=n-1-j+1 or i=n-j+1. This is a contradiction to i=n-j. Thus ⋀iV and ⋀jV are nonisomorphic.
      3. Since sj is a pseudo-reflection, (1-sj)e=cej. Since ej is not in V′ we know that eNOTPERPej. So sje≠e. So c≠0.
      4. We know sje=v′+de for some v′∈V′ and some d∈ℂ. If v′=0 then sje=de. In view of c) we see that this implies that ej=d-1ce, which is a contradiction since ejNOTPERPV′. So v′≠0.
      5. We have assumed that 0<p<n. So p-1≤n-2 and thus we can choose vectors v1′,v2′,…,vp-1′∈V′ such that vi′ is orthogonal to ej for all i. Let u0=v1′∧⋯∧vp-1′. Then, by d), sj(u0∧e)= sju0∧sje= u0∧(v′+de) =u0∧v′+du0 ∧e, where u0∧v′∈U1 and is nonzero. This argument shows that U2 is not invariant under the action of W. Since U1=U2⊥ in ⋀pV and we know that the inner product is W-invariant, we get also that U1 is not invariant under the action of W.
      6. Let E⊆⋀pV be a nonzero submodule. Suppose that E∪U1=0. Then let u∈E, u≠0, and write u=u1+u2 where ui∈Ui. Since E∪U1=0, u2≠0. By the induction hypothesis applied to W′ we know that U1 and U2 are irreducible and inequivalent. Thus there exists an element a∈ℂ[W′] such that au1=0 and au2≠0. So au=au2∈E. So E∪U2≠0. Since U2 is irreducible as a W′-module, U2⊆E. Then, by d) we know that there is an element u∈E such that u=u1+u2 and u1≠0. So u1=u2-u∈E. Again, by the irreducibility of U1 as a W′-module, U1⊆E. So E=⋀pV. A similar argument holds in the case that E∪U2=0. Thus ⋀pV is irreducible. ◻

    Notes. Bourbaki notes that this exercise is due to R. Steinberg. The solution to part d) is also due to R. Steinberg (unpublished notes).
    Concerning part b): Let F be a field of arbitrary characteristic, let G be a finite group, and let U be a finite dimensional G-module. For g∈G let gU denote the corresponding endomorphism of U. Let UG be the submodule of G-invariants. A projection onto UG means an idempotent F-linear transformation with range UG.

Lemma: Let π be any projection of U onto UG. Suppose b∈End(U) satisfies bUG⊆UG. Then ∑g∈Gtrace(bgU) =|G| trace(bπ).

Corollary: If UG=0 and b∈End(U) then ∑g∈Gtrace(bgU)=0.

Proof of Lemma: Choose an F-subspace U′ of U such that U=UG⊕U′ and use matrices relative to this decomposition. If a∈End(U) let [a] denote the corresponding matrix. Then |G|[π]= ( |G|IC12 00 ) ∑g∈G[gU]= ( |G|ID12 00 ) where I is the identity matrix of size dim U and C12,D12 are matrices of appropriate size. Since bUG⊆UG we have [b]= ( B11 B12 0 B22 ) . Thus |G|[b][π]= ( |G|B11I B11C12 0 0 ) and[b] ∑g∈G[gU]= ( |G|B11I B11D12 0 0 ) . The assertion follows. ◻

Remark: Note that the argument shows that [b](|g|[π]-∑g∈G[gU]) is nilpotent.

Now let G be a finite group and let V be a G-module. Assume as in the above exercise that (⋀pV)G=0 for 1≤p≤n but make no hypothesis on the characteristic of the ground field F. We may view ⋀pV as a module for the semigroup End(V)⊃G. If a∈End(V) let ∧pa be the corresponding endomorphism of ⋀pV. Thus ∧p(ab)=∧pa·∧pb. For a∈End(V) we have det(1-a)= ∑p=0n (-1)ptrace (∧pa). Let’s take this as known. Replace a by ag. Then det(1-ag)= ∑p=0n trace(∧pa·∧pg). If p>0, use the hypothesis (⋀pV)G=0 and apply the Corollary with U=⋀pV and b=∧pa. This gives ∑g∈Gtrace(∧pa·∧pg)=0 so ∑g∈Gdet(1-ag)= ∑g∈Gtrace (∧0a∧0g)= |G|.

page history