maths.freeAbstract Algebra › 22. Finite Fields › Structure of a Finite Field

Structure of a Finite Field

Recall that a field F has characteristic p if p is the smallest positive integer such that for every nonzero element \alpha in F, we have p \alpha = 0. If no such integer exists, then F has characteristic 0.

Structure of a Finite Field

Recall that a field \(F\) has characteristic \(p\) if \(p\) is the smallest positive integer such that for every nonzero element \(\alpha\) in \(F\), we have \(p \alpha = 0\). If no such integer exists, then \(F\) has characteristic \(0\). From we know that \(p\) must be prime. Suppose that \(F\) is a finite field with \(n\) elements. Then \(n \alpha = 0\) for all \(\alpha\) in \(F\). Consequently, the characteristic of \(F\) must be \(p\), where \(p\) is a prime dividing \(n\). This discussion is summarized in the following proposition.

Throughout this chapter we will assume that \(p\) is a prime number unless otherwise stated.

Let \(F\) be a field. A polynomial \(f(x) \in F[x]\) of degree \(n\) is separable if it has \(n\) distinct roots in the splitting field of \(f(x)\); that is, \(f(x)\) is separable when it factors into distinct linear factors over the splitting field of \(f\). An extension \(E\) of \(F\) is a separable extension of \(F\) if every element in \(E\) is the root of a separable polynomial in \(F[x]\).

The unique finite field with \(p^n\) elements is called the Galois field of order \(p^n\). We will denote this field by \(\gf(p^n)\). \(\gf(p^n)\) Galois field of order \(p^n\)

Condensed — the full section is in Judson, Abstract Algebra: Theory and Applications.

Symbols used here

x \in A,\ A \subseteq B
element of, subset
x belongs to A; every element of A is in B.
\mathbb{N},\ \mathbb{Z},\ \mathbb{Q},\ \mathbb{R},\ \mathbb{C}
number sets
Naturals, integers, rationals, reals, complex numbers.
\blacksquare\ \text{or}\ \square
end of proof (halmos)
Marks the point where the statement has been established.
a \equiv b \pmod n
congruent modulo n
n divides a − b; a and b have the same remainder.
a \mid b,\ \gcd(a,b)
divides, greatest common divisor
b is a multiple of a; the largest number dividing both.
(G, \cdot),\ e,\ g^{-1}
group, identity, inverse
A set with an operation; the do-nothing element; the element that undoes g.
G \cong H,\ G / N
isomorphic, quotient group
Same structure; the group of cosets of a normal subgroup N.
\mathbb{Z}/n\mathbb{Z},\ \mathbb{Z}_n
integers modulo n
The remainders 0…n−1 with clock arithmetic.
\operatorname{Hom}(A, B),\ f \circ g
arrows from A to B, composition
The set of morphisms; do g then f.

Questions people ask

What is a group, in plain words?

A set with one operation that is associative, has an identity, and lets every element be undone. Symmetries of any object form a group — that is where the idea came from.

What is the difference between a ring and a field?

A ring has addition and multiplication that behave like the integers (you cannot always divide); a field is a ring where every non-zero element has a reciprocal, like the rationals or the reals.

Δοκίμασε μόνος σου.

Parts of this page are adapted from Judson, Abstract Algebra: Theory and Applications (GFDL 1.3). Condensed and re-explained here; errors are ours.

Περισσότερα σε Abstract Algebra