Absolute irreducibility of a group representation Created 2026-10-14 Updated 2026-11-05
A group representation over a field is absolutely irreducible if it remains irreducible after every field extension. For a finite-dimensional representation it is enough to check an algebraic closure. Irreducibility over the original field alone is weaker: the two-dimensional real rotation representation of the cyclic group of order three splits into two lines over the complex numbers.
The James submodule theorem follows from . A nonzero restricted form therefore gives a simple radical quotient. If counts equal-length rows, all integral polytabloid pairings are divisible by , while pairing with row reversal gives . Thus the form is nonzero modulo exactly for regular partitions. The construction and the proof commute with every field extension, so the quotient is absolutely irreducible, including over the prime field.
Adjoining a root of an irreducible polynomial Created 2026-09-29 Updated 2026-11-05
Algebraically independent elements Created 2026-09-29 Updated 2026-11-05
Elements of a field extension of are algebraically independent over when no nonzero polynomial in vanishes at .
Algebraic element Created 2026-09-24 Updated 2026-11-05
Algebraic extension Created 2026-10-14 Updated 2026-11-05
A field extension is algebraic if every element of is an algebraic element over . Every finite field extension is algebraic, but algebraic extensions can have infinite degree.
Algebraic norm Created 2026-10-03 Updated 2026-11-05
The algebraic norm of an element of a finite field extension is the determinant of multiplication by that element. In a quadratic subring of , it is often .
Artin–Schreier extension Created 2026-10-03 Updated 2026-11-05
An Artin–Schreier extension is a field extension generated by a root of an irreducible Artin–Schreier polynomial. It is a cyclic Galois extension of degree , with automorphisms for .
Automorphism of a field extension Created 2026-10-25 Updated 2026-11-05
An automorphism of a field extension is a field automorphism fixing every element of . Such maps form the field automorphism group under composition. For a Finite Galois extension this is the Galois group . Specifying the fixed base field distinguishes these maps from arbitrary field automorphisms of .
BCH code Created 2026-09-24 Updated 2026-11-05
Let be a finite field, let be coprime to , and choose an element of multiplicative order in an field extension. A BCH code of length , starting exponent , and design distance is the cyclic code whose generator polynomial of a cyclic code iswhere is the algebraic minimal polynomial of over . Equivalently, is the least-degree monic polynomial over the base finite field vanishing at consecutive powers. This least-degree condition distinguishes the BCH code from its proper cyclic code subcodes with additional zeros. The BCH bound gives minimum Hamming distance at least .
For example, over the field with two elements, let and let be a polynomial root of . The roots and have the same algebraic minimal polynomial, so and give , a Hamming code of length seven.[ref]
Shift-Register Synthesis and BCH Decoding by James L. Massey. Sections IV–V: BCH codes and synthesis-based decoding
Fix a number field , a positive integer , and a finite set of its finite places. There are finitely many field extensions of degree at most unramified outside , inside a fixed algebraic closure. To see this, view them as extensions of the rational numbers of bounded degree. Their ramified rational primes belong to a fixed finite set. At each of these primes, the different exponent is bounded in terms of the local degree and ramification index, giving a bound for the absolute field discriminant. The Hermite–Minkowski theorem gives finitely many fields up to isomorphism, and each has only finitely many embeddings into the fixed closure. This useful form of arithmetic compactness is stated and proved for in Andrew Sutherland's number-theory notes, Theorem 14.25; the preceding reduction gives the general case.
Ci field Created 2026-10-07 Updated 2026-10-14
A field is if every homogeneous polynomial of degree in more than variables has a nonzero zero. Algebraically closed fields are , finite fields are , and the Lang-Nagata theorem for Ci fields controls function-field extensions.
If and are separable algebraic elements, put and . The minimal polynomial of over divides its separable polynomial over , and is therefore separable. The extension count for field embeddings gives embeddings of into an algebraic closure, each with extensions to . Hence has embeddings. For , each embedding of has at most extensions, so there are at least embeddings of and hence exactly that number. Since is a simple field extension, its minimal polynomial has distinct roots. Thus is a separable algebraic element.
Coefficient pairing for a monogenic algebra Created 2026-10-06 Updated 2026-11-05
For a monic degree- polynomial over a commutative ring , let and let take the coefficient of in the reduced representative. The pairing is unimodular on : reversing one basis order gives a triangular matrix with diagonal ones. When embeds in a separable field extension, Lagrange interpolation identifies with . This yields the derivative formula for the inverse different.
Complexification fibres of a real scheme Created 2026-10-07 Updated 2026-10-14
For a scheme over , its base change of a morphism of schemes to has scheme-theoretic fibre over a point equal to . This is the spectrum of . It has two points if is a square in the residue field, and otherwise one point with a quadratic field extension. In both cases it is reduced, because the quadratic polynomial has no repeated root in characteristic zero. The distinction applies to generic points as well as closed points.
Constructible circle 2026-10-31
A constructible circle has a constructible point as its centre and radius equal to the distance between two constructible points. When those coordinates lie in a real field , its equation has coefficients in because the squared radius is a sum of squared coordinate differences. Intersecting it with a constructible line reduces to a quadratic equation. Intersecting two distinct circles reduces to the same situation by subtracting their normalized equations to obtain the radical axis. Thus each isolated real intersection requires at most a real quadratic field extension.
Constructible point 2026-10-31
A point of the Euclidean plane is constructible if it can be obtained from and by finitely many straightedge-and-compass operations: draw a line through two obtained distinct points, draw a circle with obtained centre and radius equal to an obtained segment length, and retain isolated intersection points. Its two coordinates are constructible numbers. Conversely, constructible real coordinates can be placed on perpendicular axes and their coordinate lines intersected, giving the point. Coordinates created at each isolated intersection require only solving linear or quadratic equations over the current coordinate field; hence they lie in a real field extension obtained by a finite tower of quadratic extensions. Coincident curves supply no isolated new intersection points.
Degree of a field extension Created 2026-09-29 Updated 2026-11-05
Differentials detect algebraic independence in characteristic zero Created 2026-10-07 Updated 2026-11-05
For a finitely generated field extension in characteristic zero, a tuple is algebraically independent exactly when its differentials are linearly independent in the Kähler differentials. A relation of minimum total degree gives a nontrivial differential relation; an independent tuple extends to a transcendence basis. In positive characteristic, derivatives of nonconstant relations can vanish identically.
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.