Definition A linear functional on V is a linear map from V to Fq. The set of these is the dual space V∗. Given f∈V∗ write Vf for the kernel of f, if f≠0 then Vf is a subspace of dimension n−1 (any such space of codimension 1 we call a hyperplane).
Lemma If you have f,f′∈V with the same hyperplane then there exists λ such that f′=λf.
proof: The result is clear if Vf=V assume not so f,f′≠0. Take v∈V∖Vf (i.e. not in the common hyperplane) so vf,vf′≠0 and put λ=(vf′)(vf)−1 then f′−λf∈V∗ 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 d∈V# 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:V→Fq by (vf)d=vτ−v i.e. f is that scalar multiple which a transvection defines. Since τ is linear f∈V∗. The result is clear for τ=1 and if not f≠0 so d∈fix(τ)=Vf.
Corollary Any transvection can be written as τf,d mapping v to v+(vf)d for some f∈V∗, d∈(Vf)#.
Lemma For f,f′∈V∗, d∈V#, g∈GL(V) we have
- τgf,g=τg−1∘f,dg
- τf,dτf′,d=τf+f′,d
Definition For a direction d∈V# set T(d)={τf,d|f∈V∗,d∈Vf} 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 n≥3 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′,d′∈T# and write e1=d,e′1=d′ then take bases e1,…,en−1 and e′1,…,e′n−1 of the hyperplanes Vf,Vf′, choose en,e′n such that enf=e′nf′=1. Now we have bases for V so there is a GL map g from one to the other.
For i<n we have e′i(g−1∘f)=eif=0 so Vg−1∘f is the space spanned by ⟨e′1,…,e′n−1⟩=Vf′ so they are scalar multiples of each other, let λ be such that f′=λ(g−1∘f) and 1=e′nf′=λe′n(g−1∘f)=λ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 n≥3 we can use the μ trick as before to get them in SL.
Proposition If d∈V# 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 g∈SL(V) with dg=d then T(d)g=T(d) (by the previous) so T(d)⊴SL(V)d. Given d,d′∈V# by the transitivity lemma (that requires dimension > 1) exists g∈SL(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/N≃A={Ng} then we always have Ngg′=Ng′g i.e. there is some n such that gg′=ng′g. So every commutator [g,g′] is an element of N.
Proposition If n≥2 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 g∈SLn(q) that conjugates στ=σg, whence τ=σ−1g−1σ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μ(λ2−1)01) so for q>3 take λ≠0,1,−1 then λ2−1≠0 so let μ=γ(λ2−1)−1.
Proposition
- Z(GL(V))={λ1|λ∈F#q}
- Z(SL(V))={λ1|λ∈F#q,λn=1}
No comments:
Post a Comment