
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
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
1 / 1
This page cannot be seen from the preview
Don't miss anything!

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:
m
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.