Finite Fields in Math 155: Properties and Extensions, Study notes of Designs and Groups

Finite fields, their unique prime fields, and the fundamental theorem that guarantees their existence for every prime and integer. It covers the properties of these fields, including their automorphism groups and subfields. The document focuses on the finite fields fq of cardinality q = pn, where p is a prime, and discusses their use in algebra and linear algebra. The fields f4 and f9 are highlighted as important examples.

Typology: Study notes

2010/2011

Uploaded on 11/02/2011

jamal33
jamal33 🇺🇸

4.3

(51)

340 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 155: Designs and groups
Handout #2 (1 February 2010): Finite fields
Since we’re studying finite combinatorial structures, we’ll have to do algebra and
linear algebra over finite fields. The most familiar of these are the prime fields
Fp=Z/pZwhere pZis a prime. In general any finite field Fcontains a unique
prime field, consisting of all the elements of Fof the form 1 + 1 + . . . + 1. The size,
call it again p, of this prime field is the characteristic of F. Since Fis a vector space
over Fpwe have #F=pnfor some natural number n(namely the dimension of
that vector space). We cite without proof the following fundamental theorem, due
in essence to Galois:
For each prime pand integer n>1 there exists a finite field F
of cardinality pn. This field is unique up to isomorphism. The
automorphism group of Fis canonically isomorphic with Z/nZ
and is generated by the Frobenius automorphism x7→ xp. For each
positive divisor mof n, that field contains a unique subfield F1of
cardinality qm, namely {x:xqm=x}. The field extension F/F1
is normal, with cyclic Galois group of order m/n generated by
x7→ xpm.
We shall use F
qfor the finite field of cardinality q=pn; the older notation GF(q)
for F
q(“GF” as in “Galois field”) is still occasionally seen in the literature. These
fields are a natural and important generalization of the familiar prime fields Fp;
in general anything that can be done with Fpworks just as well with Fq, and
sometimes one can do a bit more with the non-prime fields thanks to the nontrivial
automorphisms (as is true for C, which though less familiar than Rturns out to
be equally fundamental and sometimes more tractable). For example, you probably
know that for every prime pthere is at least one “primitive residue” mod p, which
is to say that the multiplicative group F
pis cyclic; the same is true (with much the
same proof) for F
qfor any finite field Fq. Warning: once n > 1, the finite field of
pnelements is not Z/pnZ(and its additive group is not cyclic).
Except for the familiar prime fields (with n=1), the only finite fields we shall have
much use for are F
4and F9; these may be defined as the quadratic extensions F2(ρ)
and F3(i) of their prime fields, where ρ2+ρ= 1 and iis a square root of 1.

Partial preview of the text

Download Finite Fields in Math 155: Properties and Extensions and more Study notes Designs and Groups in PDF only on Docsity!

Math 155: Designs and groups Handout #2 (1 February 2010): Finite fields

Since we’re studying finite combinatorial structures, we’ll have to do algebra and linear algebra over finite fields. The most familiar of these are the prime fields Fp = Z/pZ where p ∈ Z is a prime. In general any finite field F contains a unique prime field, consisting of all the elements of F of the form 1 + 1 +... + 1. The size, call it again p, of this prime field is the characteristic of F. Since F is a vector space over Fp we have #F = pn^ for some natural number n (namely the dimension of that vector space). We cite without proof the following fundamental theorem, due in essence to Galois:

For each prime p and integer n > 1 there exists a finite field F

of cardinality pn. This field is unique up to isomorphism. The

automorphism group of F is canonically isomorphic with Z/nZ

and is generated by the Frobenius automorphism x 7 → xp. For each

positive divisor m of n, that field contains a unique subfield F 1 of

cardinality qm, namely {x : xq

m

= x}. The field extension F/F 1

is normal, with cyclic Galois group of order m/n generated by

x 7 → xp

m

We shall use Fq for the finite field of cardinality q = pn; the older notation GF(q) for Fq (“GF” as in “Galois field”) is still occasionally seen in the literature. These fields are a natural and important generalization of the familiar prime fields Fp; in general anything that can be done with Fp works just as well with Fq, and sometimes one can do a bit more with the non-prime fields thanks to the nontrivial automorphisms (as is true for C, which though less familiar than R turns out to be equally fundamental and sometimes more tractable). For example, you probably know that for every prime p there is at least one “primitive residue” mod p, which is to say that the multiplicative group F∗ p is cyclic; the same is true (with much the same proof) for F∗ q for any finite field Fq. Warning: once n > 1, the finite field of pn^ elements is not Z/pnZ (and its additive group is not cyclic).

Except for the familiar prime fields (with n = 1), the only finite fields we shall have much use for are F 4 and F 9 ; these may be defined as the quadratic extensions F 2 (ρ) and F 3 (i) of their prime fields, where ρ^2 + ρ = 1 and i is a square root of −1.