Definition of Finite Field: Addition and Multiplication Groups

  • Thread starter Thread starter Greg Bernhardt
  • Start date Start date
  • Tags Tags
    Field Finite
Messages
19,773
Reaction score
10,726
Definition/Summary

All finite fields are known; they are the Galois fields GF(p^n), where p is a prime.

They have addition group Z(p)^n and multiplication group Z(p^n-1); their multiplication groups are cyclic.

If p = 2, then addition and multiplication can be done very fast by typical computer hardware using bitwise exclusive or and shifting.

Equations



Extended explanation

The finite fields GF(p) are {0, 1, ..., p-1} under addition and multiplication modulo p, which must be a prime number.

Finite fields GF(pn) for n > 1 can be described using polynomials in a variable x with coefficients having values in {0, 1, ..., p-1}.

Every element is a polynomial with a degree at most n-1.

Element addition is polynomial addition modulo p, while element multiplication is polynomial multiplication modulo p and a degree-n primitive or irreducible polynomial.

A primitive polynomial is one that cannot be factored in this construction of GF(pn). Primitive polynomials are not unique; there are
N(p,n) = \frac{1}{n} \sum_{m|n} \mu(m) p^{n/m}

monic ones, where μ is the Möbius mu function. That function is (-1)number of prime factors if they all have power 1, and 0 otherwise.

A finite field GF(pn) has subfield GF(pm) if m evenly divides n. If n is a prime, then GF(pn) only has only the trivial subfields, itself and GF(p).


* This entry is from our old Library feature. If you know who wrote it, please let us know so we can attribute a writer. Thanks!
 
Physics news on Phys.org
E. H. Moore probably coined in 1893 the English term Galois field in honor of Évariste Galois, who has already calculated with certain imaginary numbers modulo ##p##.

The Wedderburn Theorem states that multiplication in a finite division ring is necessarily commutative. That is, finite division rings are always finite fields.

Gauss had already shown that one can count on numbers modulo a prime "as with rational numbers". Galois introduced imaginary numbers into calculation modulo ## p##, much like the imaginary unit ##\mathrm {i}## in the complex numbers. He was probably the first to consider field extensions of ##\mathbb{F}_ {p}## - although the abstract concept of fields was first introduced by Heinrich Weber in 1895 and Frobenius was the first to introduce it 1896 as extensions to finite structures.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top