Algebraic number Created 2026-09-24 Updated 2026-11-05
An algebraic number is a complex number satisfying a nonzero polynomial equation with coefficients in the rational numbers, or equivalently with coefficients in the integers after clearing denominators. For instance, satisfies and satisfies . Every rational number is algebraic, since vanishes at it.[ref]
The monic irreducible polynomial over that vanishes at an algebraic number is its minimal polynomial; its degree measures the number of independent rational coordinates needed in the simple field extension it generates. Thus has basis . An algebraic integer has the stronger requirement of satisfying a monic polynomial with coefficients in the integers: is algebraic but is not an algebraic integer.
An irreducible plane cubic has at most one singular point Created 2026-10-07 Updated 2026-10-14
Two distinct singular points would impose at least two zeros each on the restriction of the cubic to their joining line. A nonzero homogeneous polynomial of degree three cannot have total zero multiplicity four, so that restriction vanishes identically. The line would be a component, contradicting the irreducible polynomial hypothesis. This argument works in every characteristic.
Artin–Schreier polynomial Created 2026-10-03 Updated 2026-11-05
An Artin–Schreier polynomial over a field of characteristic has the form
If it has one root , all its roots are for . It either has a root in the base field and splits completely, or is an irreducible polynomial of degree .
Characteristic zero Created 2026-10-06 Updated 2026-11-05
A field has characteristic zero when no positive integer multiple of its identity vanishes. Equivalently, its prime field is isomorphic to . Every irreducible polynomial over such a field is a separable polynomial.
For an integral normal variety that is Noetherian, removing a closed subset of codimension at least two does not create new regular functions. Affine-locally, a normal Noetherian domain is the intersection of its localizations at height-one primes inside its fraction field. The complement still contains every height-one point, so a regular function on it lies in each such localization and therefore in the original ring. On projective space this also follows directly by excluding irreducible polynomial factor of the denominators on each polynomial affine chart.
Completion at an irreducible polynomial over a finite field Created 2026-09-28 Updated 2026-11-05
For an irreducible polynomial of degree , the -adic completion of is isomorphic to . Its residue field is and is a uniformizer.
If counts conjugacy classes in , then . Associate a partition to each irreducible polynomial other than t. The Euler product over those polynomials counts monic polynomials with nonzero constant term and is .
Counting matrices with a fixed primary polynomial Created 2026-10-14 Updated 2026-11-05
Fix an irreducible polynomial f of degree d with nonzero constant term. In , the number of matrices whose minimal polynomial is a power of f is . The primary matrix centralizer formula is identical to the unipotent centralizer formula over , and summing reciprocal centralizer orders reduces to counting nilpotent matrices by the Fitting decomposition.
The degree of an algebraic number is the degree of a polynomial of its minimal polynomial of an algebraic element over . Equivalently, it is the field extension degree . If that degree is , then form a basis over the rational numbers: higher powers reduce using the minimal polynomial of an algebraic element, while a dependence among these first powers would contradict minimality.[ref]
For , the irreducible polynomial gives degree two and expressions . For , the polynomial is irreducible over because a reducible cubic would have a rational root of a polynomial, which the rational root theorem excludes. Its degree is three. Merely finding a polynomial equation gives an upper bound: also satisfies , but its degree is still two.
Eisenstein polynomial Created 2026-09-24 Updated 2026-11-05
For a discrete valuation ring with uniformizer , an Eisenstein polynomial is a monic polynomial whose nonleading coefficients are divisible by and whose constant coefficient is not divisible by . It is irreducible, and adjoining one of its roots gives a totally ramified extension.
Suppose a Non-Archimedean absolute value on has a unique extension to every finite field extension. Any K-isomorphism between conjugate roots pulls the absolute value back to an extension on the source field, which must be the given one. Thus for every . This argument includes inseparable irreducible polynomials: no transitive Galois action or completeness assumption is needed.
Existence and uniqueness of unramified local extensions Created 2026-10-05 Updated 2026-11-05
For a non-Archimedean local field , every finite extension of its residue field is realized by an unramified extension of , unique up to -isomorphism. Lift the irreducible polynomial of a residue generator to a monic integral polynomial and adjoin a root. Its residue degree equals its field degree, forcing ramification index one. In any other such extension the Hensel lemma lifts the same simple residue root, giving an isomorphism.
Field with four elements Created 2026-10-06 Updated 2026-10-14
Build this finite field by taking a quotient ring of a polynomial ring:
The polynomial has in the prime field . A polynomial of polynomial degree two is an irreducible polynomial exactly when it has no polynomial root in the coefficient field. Thus the quotient by an irreducible polynomial is a field construction applies. Its elements have unique representatives , with : precisely .
The defining relation is . Since this finite field has characteristic two, every element equals its additive inverse, and the relation becomes . Addition acts separately on the two coefficients:
All coefficient calculations use modular arithmetic modulo two. For example, and . Encoding as the pair of bits gives , , , and ; addition is bitwise exclusive or. These are coordinates in the basis , so the label does not make the element .
For multiplication, expand using the distributive property and replace every by :
For example, , while . The following complete tables are computed from the coefficient rules. Colors identify results, rather than their numerical sizes. Every row of the addition table lists all four elements, and every nonzero row of the multiplication table does too: adding an element, or multiplying by a nonzero element, can be undone.
Figure 1.
Computed addition and multiplication tables for the field with four elements
. Details.
The nonzero multiplicative inverses are , , and . Consequently the equation has the unique solution . Repeated multiplication gives , , , and . They cycle through every element of the multiplicative group of a finite field.
Compare the ring , also with four elements. Its addition satisfies , and its multiplication satisfies . Thus is a zero divisor, with no multiplicative inverse, and this ring is not a field. Multiplying by collapses different inputs to the same output: both and give , while both and give . In the field with four elements, multiplying by instead rotates the three nonzero elements, preserving their distinctness. The figure makes visible why counting four elements alone does not specify their arithmetic.
Figure 2.
Four elements with different arithmetic: a field and integers modulo four
. Details.
Finite field Created 2026-09-24 Updated 2026-10-13
A finite field is a field with finitely many elements: addition, subtraction, multiplication, and division by a nonzero element all stay inside a finite collection. Write , or , for a finite field with elements. The subscript counts elements; it does not prescribe modular arithmetic modulo . The field with four elements is the smallest example where that distinction matters.
Every finite field has size , where is a prime number and is a positive integer. To see the counting mechanism, use its prime field : the finite field is a finite-dimensional vector space over . For a basis , every element has exactly one expression
Each coefficient has choices, so there are expressions. Here is the characteristic of a field and is the dimension of a vector space. Thus sizes are possible, whereas are not prime powers and cannot be finite field sizes.
Conversely, every prime power occurs, and any two finite fields of the same size admit a field isomorphism. These are classification statements, beyond the counting argument. See Conrad's Theorems 1.5, 2.2, and 2.7.[ref] Uniqueness means the arithmetic agrees after relabeling; it does not choose a basis, an irreducible polynomial for a quotient ring representation, or a particular field isomorphism. Even for the field with four elements, exchanging and preserves the arithmetic.
The appeal for coding theory is exact, finite arithmetic with reliable division: polynomial interpolation and linear algebra work over a finite alphabet. A Reed-Solomon code represents messages by polynomials and adds redundancy by evaluating them at several distinct finite field elements. Forney's MIT notes develop this arithmetic as preparation for such error-correcting codes.[ref] In cryptography, finite fields likewise supply exact arithmetic on finitely many symbols, with operations that can be implemented using bits.
Historically, Évariste Galois published work on finite fields beyond prime fields in 1830, constructing them by adjoining elements satisfying irreducible polynomials over prime fields. Conrad's historical account also records E. H. Moore's 1893 terminology, from which the name Galois field and notation descend.[ref]
Irreducibility of cyclotomic polynomials Created 2026-10-03 Updated 2026-11-05
Every cyclotomic polynomial is an irreducible polynomial over . If a monic irreducible factor contains a primitive root , then it also contains for every prime number : otherwise, writing , reduction modulo and the Frobenius endomorphism give . Some irreducible factor would then divide both and , giving a repeated factor of , contrary to separability of roots of unity. Iterating over the prime factors of every integer coprime to shows that contains all primitive th roots, so .
Irreducible factors of a finite-field Frobenius polynomial Created 2026-09-29 Updated 2026-11-05
Every monic irreducible polynomial over whose degree divides divides . In particular, if has degree and is one of its roots, then has elements, so and the minimal polynomial divides .
Irreducible polynomial Created 2026-09-24 Updated 2026-11-05
An irreducible polynomial is a nonconstant polynomial that cannot be written as a product of two nonconstant polynomials over its coefficient field. Over a general integral domain, neither factor may be a unit.
Irreducible real polynomial Created 2026-09-24 Updated 2026-11-05
The irreducible polynomials over have degree one, or degree two with negative discriminant.
Let be a companion matrix of a monic irreducible polynomial of degree . Form the -by- block matrix with on its diagonal, immediately above the diagonal, and zero elsewhere. If the field characteristic is , write with maximal, so that ; in characteristic zero take and . Then
Thus a separable polynomial gives , but an irreducible polynomial with zero formal derivative can give a smaller exponent. For example, over the rational function field , the irreducible polynomial has , so a two-block chain still has minimal polynomial .
To prove the formula, write , where has diagonal blocks and is the block shift. These are commuting operators, and vanishes exactly when . The binomial theorem in positive field characteristic gives . Expanding gives , with commuting with . The diagonal blocks of are , which are invertible by Bézout's identity for polynomials, since is irreducible with nonzero formal derivative and . Therefore vanishes exactly when . Finally, the block upper triangular matrix determinant gives the displayed characteristic polynomial, while the Cayley-Hamilton theorem and irreducibility force the minimal polynomial to be a power of .
Minimal polynomial of a normal operator Created 2026-10-25 Updated 2026-10-31
On a real or complex inner product space of finite dimension, a normal operator has a square-free polynomial as its minimal polynomial. To prove this without the spectral theorem, suppose an irreducible polynomial occurs at least twice in . Put and . Since polynomials of a normal operator are normal, is a normal operator. For every ,
By kernel stabilization for a normal operator, . Hence the smaller-degree monic polynomial annihilates , contradicting minimality.
Over the complex numbers, all irreducible polynomials are linear, so the primary decomposition theorem for linear maps now gives a basis of eigenvectors. Over the real numbers, irreducible quadratics can remain: a nontrivial planar rotation need not have any real eigenvectors, although its minimal polynomial is square-free.