Questions tagged [finite-fields]

Finite fields are fields (number systems with addition, subtraction, multiplication, and division) with only finitely many elements. They arise in abstract algebra, number theory, and cryptography. The order of a finite field is always a prime power, and for each prime power $q$ there is a single isomorphism type. It is usually denoted by $\mathbb{F}_q$ or $\operatorname{GF}(q)$.

The order of a finite field is always a prime power, and for each prime power $q = p^r$ with $p$ prime there is a single isomorphism type. It is usually denoted by $\mathbb{F}_q$ or $\operatorname{GF}(q)$. The finite field $\mathbb F_q$ has characteristic $p$.

In the case $r = 1$ (i.e. $q = p$), a representative of $\mathbb F_p$ is given by the ring $\mathbb{Z}/p\mathbb{Z}$ of integers residue classes modulo $p$. For $r \geq 2$, $\mathbb F_q$ can be constructed by a quotient ring $\mathbb{F}_p[x]/\langle f(x)\rangle$, where $f\in\mathbb F_p[x]$ is an irreducible polynomial of degree $r$.


Questions about finite fields typically fall into one of the following groups:

1: Questions arising in introductory level courses on abstract algebra. Here abstract-algebra is a suitable related tag.

2: Questions about solvability of higher degree congruences and/or factorization of polynomials with integer coefficients modulo a prime number often need basic facts about finite fields. This kind of questions are adequately tagged with polynomials and/or elementary-number-theory. Adding a finite-fields tag may help, but may not be necessary to attract quality answers.

3: Finite fields naturally occur in algebraic-number-theory as their properties are used heavily in the study of prime ideals and their behavior under field extensions. Use the tags jointly, if you see the need for it. A rich area in the intersection of finite fields and number theory is that of characters, most notably character sums. For the latter exponential-sums is an appropriate auxiliary tag.

4: Many error-correcting codes use a finite-field as the alphabet representing data, and such codes depend heavily on the properties of the alphabet fields. Use the coding-theory tag in conjunction with finite-fields, if your question is under this umbrella. Another rich source of applications of finite fields is cryptography.

5: There are special questions considering algebraic varieties and/or algebraic groups over finite fields. Here my recommendation is to use algebraic-geometry or algebraic-groups as the primary tag, and finite-fields as an auxiliary tag. This way your question will most likely attract the attention of those members who are best placed to answer it.


WARNING1: A relatively common mistake is to assume that finite-fields is an appropriate tag for questions about finite field extensions. There the word 'finite' is an attribute of the word 'extension' meaning that the dimension of the larger field as a vector space over the smaller one is finite. If that is what your question is about, you should use some combination of the tags galois-theory, field-theory, extension-field.


WARNING2: Another common source of confusion is the following. It is a well-known fact that a finite subgroup of the multiplicative group of any field is cyclic. Thus the entire multiplicative group of a finite field is cyclic. Any generator $g\in\Bbb{F}_q^*$ of the multiplicative group is called a primitive element. This is a natural extension of the concept of a primitive root in the multiplicative group $\Bbb{Z}/p\Bbb{Z}^*$ of the residue class ring. Unfortunately it is in conflict with the common practice of general field theory to call an element $z\in L$ primitive (w.r.t. the field extension $K/L$), if $L=K(z)$. In the case of finite fields we require more from a primitive element.

An irreducible polynomial $m(x)\in\Bbb{F}_p$ of degree $r$, is called a primitive polynomial, if any (and hence all) of its zeros in $\Bbb{F}_q$ are primitive elements. IOW, primitive polynomials are exactly the minimal polynomials (over the prime field) of primitive elements. This is another unfortunate source of confusion, for in the theory of polynomials over PIDs a polynomial is called primitive, if its coefficients have no non-unital common divisors. This is rarely very confusing for over a field this alternative concept of primitivity is patently meaningless.

Primitive polynomials are extremely useful in software implementations of the arithmetic of a moderate size finite field. This is largely because having a primitive polynomial at hand allows one to generate look-up-tables for both the base $g$ discrete logarithm as well as its inverse function. See this CW question for examples.

For that reason extensive tables of primitive polynomials have been generated. One such table is here.


Learn more: The tome for the keen students of finite fields is the book by Rudolf Lidl and Harald Niederreiter.

4868 questions
96
votes
1 answer

Ring structure on the Galois group of a finite field

Let $F$ be a finite field. There is an isomorphism of topological groups $\left(\mathrm{Gal}(\overline{F}/F),\circ\right) \cong (\widehat{\mathbb{Z}},+)$. It follows that the Galois group carries the structure of a topological ring isomorphic to…
Martin Brandenburg
  • 146,755
  • 15
  • 248
  • 458
76
votes
3 answers

Polynomials irreducible over $\mathbb{Q}$ but reducible over $\mathbb{F}_p$ for every prime $p$

Let $f(x) \in \mathbb{Z}[x]$. If we reduce the coefficents of $f(x)$ modulo $p$, where $p$ is prime, we get a polynomial $f^*(x) \in \mathbb{F}_p[x]$. Then if $f^*(x)$ is irreducible and has the same degree as $f(x)$, the polynomial $f(x)$ is…
63
votes
6 answers

Order of finite fields is $p^n$

Let $F$ be a finite field. How do I prove that the order of $F$ is always of order $p^n$ where $p$ is prime?
Mohan
  • 13,820
  • 17
  • 72
  • 125
60
votes
2 answers

Number of monic irreducible polynomials of prime degree $p$ over finite fields

Suppose $F$ is a field s.t $\left|F\right|=q$. Take $p$ to be some prime. How many monic irreducible polynomials of degree $p$ do exist over $F$? Thanks!
IBS
  • 3,725
  • 4
  • 23
  • 29
52
votes
5 answers

What's so special about characteristic 2?

I've often read about things which do not work in a field with a characteristic $2$, mainly things which have to do with factoring, or similar things. I'm not exactly sure why, but the only example of such a field I could think of is…
49
votes
3 answers

Find all irreducible monic polynomials in $\mathbb{Z}/(2)[x]$ with degree equal or less than 5

Find all irreducible monic polynomials in $\mathbb{Z}/(2)[x]$ with degree equal or less than $5$. This is what I tried: It's evident that $x,x+1$ are irreducible. Then, use these to find all reducible polynomials of degree 2. There ones that can't…
45
votes
1 answer

How to count number of bases and subspaces of a given dimension in a vector space over a finite field?

Let $V_{n}(F)$ be a vector space over the field $F=\mathbb Z_{p}$ with $\dim V_{n} = n$, i.e., the cardinality of $V_{n}(\mathbb Z_{p}) = p^{n}$. What is a general criterion to find the number of bases in such a vector space? For example, find the…
Srijan
  • 11,854
  • 9
  • 64
  • 108
44
votes
3 answers

Irreducible polynomial which is reducible modulo every prime

How to show that $x^4+1$ is irreducible in $\mathbb Z[x]$ but it is reducible modulo every prime $p$? For example I know that $x^4+1=(x+1)^4\bmod 2$. Also $\bmod 3$ we have that $0,1,2$ are not solutions of $x^4+1=0$ then if it is reducible the…
44
votes
4 answers

Do finite algebraically closed fields exist?

Let $K$ be an algebraically closed field ($\operatorname{char}K=p$). Denote $${\mathbb F}_{p^n}=\{x\in K\mid x^{p^n}-x=0\}.$$ It's easy to prove that ${\mathbb F}_{p^n}$ consists of exactly $p^n$ elements. But if $|K|
Aspirin
  • 5,195
  • 5
  • 26
  • 50
42
votes
3 answers

Inner Product Spaces over Finite Fields

Inner product spaces are defined over a field $\mathbb{F}$ which is either $\mathbb{R}$ or $\mathbb{C}$. I want to know what happens if we try to define them over some finite field. Here's an example: Let $\mathbb{F} = \{0,1,a,b\}$ be a finite field…
41
votes
2 answers

Shortest irreducible polynomials over $\Bbb F_p$ of degree $n$

For any prime $p$, one can realize any finite field $\Bbb F_{p^n}$ as the quotient of the ring $\Bbb F_p[X]$ by the maximal ideal generated by an irreducible polynomial $f$ of degree $n$. By dividing by the leading coefficient, we may as well assume…
Travis Willse
  • 83,154
  • 8
  • 100
  • 207
33
votes
1 answer

Universal binary operation and finite fields (ring)

Take Boolean Algebra for instance, the underlying finite field/ring $0, 1, \{AND, OR\}$ is equivalent to $ 0, 1, \{NAND\} $ or $ 0, 1, \{ NOR \}$ where NAND and NOR are considered as universal gates. Does this property, that AND ('multiplication')…
Dilawar
  • 5,747
  • 6
  • 25
  • 36
32
votes
5 answers

Every Function in a Finite Field is a Polynomial Function

From a bank of past master's exams I am going through: Let $F$ be a finite field. Show that any function from $F$ to $F$ is a polynomial function. I know that finite fields are fields of $p$ elements for $p$ prime [EDIT: It's actually $p^n$ for…
Michael Chen
  • 3,981
  • 1
  • 28
  • 43
29
votes
1 answer

Discrete logarithm tables for the fields $\Bbb{F}_8$ and $\Bbb{F}_{16}$.

The smallest non-trivial finite field of characteristic two is $$ \Bbb{F}_4=\{0,1,\beta,\beta+1=\beta^2\}, $$ where $\beta$ and $\beta+1$ are primitive cubic roots of unity, and zeros of the polynomial $x^2+x+1$. Here the multiplication table is…
Jyrki Lahtonen
  • 123,594
  • 24
  • 249
  • 599
29
votes
6 answers

Do we really need polynomials (In contrast to polynomial functions)?

In the following I'm going to call a polynomial expression an element of a suitable algebraic structure (for example a ring, since it has an addition and a multiplication) that has the form $a_{n}x^{n}+\cdots+a_{1}x+a_{0}$, where $x$ is some fixed…
temo
  • 4,989
  • 2
  • 25
  • 56
1
2 3
99 100