Definition of Finite Field: Addition and Multiplication Groups

In summary, finite fields are known as Galois fields GF(p^n), where p is a prime. They have addition and multiplication groups that are cyclic, and equations can be solved using polynomials with coefficients in {0,1,...,p-1}. The Wedderburn Theorem states that finite division rings are finite fields, and Gauss introduced the concept of using imaginary numbers in calculations modulo p.
  • #1
19,557
10,338
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
[itex]N(p,n) = \frac{1}{n} \sum_{m|n} \mu(m) p^{n/m}[/itex]

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
  • #2
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.
 

FAQ: Definition of Finite Field: Addition and Multiplication Groups

What is a finite field?

A finite field is a mathematical structure that consists of a finite set of elements and two operations, addition and multiplication, which follow certain rules and properties. It is also known as a Galois field.

What are the properties of a finite field?

A finite field must have a finite number of elements, and the operations of addition and multiplication must be closed, associative, commutative, and have identity elements. Additionally, every non-zero element must have a multiplicative inverse.

What does it mean for a finite field to be a group?

A group is a set of elements with a binary operation that satisfies the properties of closure, associativity, identity element, and inverse element. In the context of a finite field, the addition and multiplication operations form groups, known as the addition group and multiplication group, respectively.

How do addition and multiplication work in a finite field?

In a finite field, addition and multiplication follow specific rules and properties. Addition is performed by adding two elements and reducing the result modulo the total number of elements in the field. Multiplication is done by multiplying two elements and reducing the result modulo a fixed irreducible polynomial.

What are some applications of finite fields?

Finite fields have many applications in various fields of science and technology, including coding theory, cryptography, and error-correcting codes. They are also used in algebraic geometry and number theory, as well as in computer science and engineering for efficient data storage and manipulation.

Back
Top