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

Saturday, 23 February 2013

Finite Fields and Finite Vector Spaces

Definition An Affine transformation of Fq is a map fa,b taking λ to aλ+b where aF#q is nonzero. The group of such maps is called A(Fq).

Proposition A(Fq) is sharply 2-transitive of order q(q1).
proof: Let α,β distinct, the system of equations α=a0+b, β=a1+b has a unique solution.

Corollary By a general lemma about sharply 2-transitive groups this group must have a regular characteristic subgroup, this group is {f1,b|bFq}.

Proposition A(Fq) has a one point extension which is sharply 3-transitive of degree q+1.
proof: This is a straightforward application of the one point extension theorem, adjoin to Fq and define x on Fq{} to swap 0 and and invert all other elements λx=λ1. Clearly x2=1. Let G0={fa,0aF#q} and note fxa,0 fixes 0 and while for λF#q we fxa,0=fa1,0 so Gx0=G0. Finally a system for the double cosets is given by just 1 and any other element e.g. f=f1,1 will do (so λf=1λ and f2=1). We see that xf acts on the ,1,0 by cycling them and for the remaining elements λ(xf)3=1111λ=λ and (apparently...) xf=fxGxG so we have a one point extension.

Definition Vn(q) is the n-dimensional vector space over Fq, clearly |Vn(q)|=qn.

Definition If V  is a vector space then a linear automorphism of V is a bijective linear map VV. The group of these is called the general linear group GL(V) or GLn(q) when V=Vn(q).

Definition The special linear group SL(V) of linear automorphisms of determinant 1.

Lemma If V is a vector space over Fq then SL(V) is a normal subgroup of GL(V) and the index is q1: |GL(V):SL(V)|=q1.
proof: SL is just the kernel of the surjective determinant map from GL to F×q. As a consequence GL/SLF#q so |GL:SL|=q1.

Lemma The group GL(V) acts transitively on V# and if the dimension of V is >1 the same is true of SL(V).
proof: Take two nonzero vectors e1,f1 then to get a map between them choose bases e1,,en and f1,,fn this gives gGL(V) mapping between them. If n>1, since we don't necessarily have det(g)=1 let det(g)=μ and replace en by μ1en. Now g mapping between these bases has determinant 1. (did I get this right?)

Proposition |GLn(q)|=qn(n1)/2ni=1(qi1) and |SLn(q)|=qn(n1)/2ni=2(qi1).
proof: GLn(q) acts regularly on ordered bases of Vn(q), so the size of GLn(q) is equal to the number of ordered bases: qn1 choices for the first element, and having chosen e1,,ei (which spans a qi sized space) already there are qnqi choices for the next. The size of SL comes from the lemma before the previous.

No comments:

Post a Comment