Loading [MathJax]/jax/output/HTML-CSS/jax.js

Saturday, 23 February 2013

Transvections

Assume n2 throughout,

Definition A linear functional on V is a linear map from V to Fq. The set of these is the dual space V. Given fV write Vf for the kernel of f, if f0 then Vf is a subspace of dimension n1 (any such space of codimension 1 we call a hyperplane).

Lemma If you have f,fV with the same hyperplane then there exists λ such that f=λf.
proof: The result is clear if Vf=V assume not so f,f0. Take vVVf (i.e. not in the common hyperplane) so vf,vf0 and put λ=(vf)(vf)1 then fλfV and its kernel is contained in Vf,v=V so it equals zero.

Definition A linear automorphism τGL(V) is called a transvection with direction dV# if τ fixes d and vτv is a scalar multiple of v for all v.

Clearly 1 is a transvection of any direction.

Lemma If τ is a transvection with direction d then the vectorspace fix(τ) is a hyperplane containing d.
proof: Define f:VFq by (vf)d=vτv i.e. f is that scalar multiple which a transvection defines. Since τ is linear fV. The result is clear for τ=1 and if not f0 so dfix(τ)=Vf.

Corollary Any transvection can be written as τf,d mapping v to v+(vf)d for some fV, d(Vf)#.

Lemma For f,fV, dV#, gGL(V) we have
  • τgf,g=τg1f,dg
  • τf,dτf,d=τf+f,d
proof: first we need to check (dg)(g1f)=0 and d(f+f)=0 for the notation to be meaningful. Now the results follow by computation.

Definition For a direction dV# set T(d)={τf,d|fV,dVf} and T the union over all directions (all transvections).

Proposition T# is a single conjugacy class in GL(V) and lies in SL(V). If n3 then T# is a single conjugacy class in SL(V).
proof: By the calculation lemma previous, we know that T# is closed under conjugation. Let τf,d,τf,dT# and write e1=d,e1=d then take bases e1,,en1 and e1,,en1 of the hyperplanes Vf,Vf, choose en,en such that enf=enf=1. Now we have bases for V so there is a GL map g from one to the other.
For i<n we have ei(g1f)=eif=0 so Vg1f is the space spanned by e1,,en1=Vf so they are scalar multiples of each other, let λ be such that f=λ(g1f) and 1=enf=λen(g1f)=λenf=λ so since dg=d it follows that τgf,d=τf,d!
If they are all conjugate they all have the same determinant δ, now det(τf,dτf,d)=det(τf+f,d) so δ2=δ proves they lie in SL.
For n3 we can use the μ trick as before to get them in SL.

Proposition If dV# then T(d) is an abelian normal subgroup of the stabilizer SL(V)d; T(d) are all conjugates in SL(V).
proof: Certainly elements of T(d) stabilize d, by the computational lemma before we see that it is an abelian group (commutative and closed, therefore has identity and inverses). If gSL(V) with dg=d then T(d)g=T(d) (by the previous) so T(d)SL(V)d. Given d,dV# by the transitivity lemma (that requires dimension > 1) exists gSL(V) which takes d to d then T(d)g=T(d).

Proposition The set T generates SL(V).
proof: Elementary matrices.

Definition A group if perfect if G=G. This is equivalent to there being no nontrivial abelian quotients: Clearly if G/[G,G]1 then G[G,G]. Conversely if G/NA={Ng} then we always have Ngg=Ngg i.e. there is some n such that gg=ngg. So every commutator [g,g] is an element of N.

Proposition If n2 the group SLn(q) is perfect provided (n,q) isn't (2,2) or (2,3).
proof: We just need to show that each τT# is a commutator since that set generates our group. If τ has direction d take some σT(d)# not equal to τ1, then στT(d)# so there is a gSLn(q) that conjugates στ=σg, whence τ=σ1g1σg=[σ,g].
For n=2 we will use 2×2 matrices directly, in some basis τ=(1γ01) (nonzero γ), now for any nonzero λ and μFq we have (λ00λ1)(1μ01)(λ100λ)(1μ01)=(1μ(λ21)01) so for q>3 take λ0,1,1 then λ210 so let μ=γ(λ21)1.

Proposition
  • Z(GL(V))={λ1|λF#q}
  • Z(SL(V))={λ1|λF#q,λn=1}
proof: Certainly these are contained in the center, suppose gZ(GL(V)) or Z(SL(V)) then for each nonzero vector dV# take a transvection τf,dT(d), this should be unaffected by conjugation but we know τgf,d=τg1f,dg so dg=λdd. Then λdd+λvd=(d+v)g=λd+v(d+v)=λd+vd+λd+vv so λd=λv=λ and g=λI. For SL we also require det(g)=λn=1. This tells us that Z(GLn(q))F#q and Z(SLn(q))C(n,q1).

No comments:

Post a Comment