Absolute irreducibility of a group representation Created 2026-10-14 Updated 2026-10-20
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.
Algebraic extension 2026-10-14
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.
Automorphism of a field extension 2026-10-25
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 .
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.
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.
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.
Existence of transcendence bases 2026-10-31
Apply Zorn's lemma to subsets of a field extension with algebraic independence, ordered by inclusion. The union of a chain is independent because any polynomial relation involves only finitely many distinct elements, all of which lie in one member of the chain. A maximal independent set is a transcendence basis: if any element were transcendental over , adjoining it would preserve independence, by clearing denominators, contradicting maximality. Tuple entries must be distinct in the set-based independence definition; otherwise the nonzero polynomial vanishes on a repeated pair and excludes every nonempty set.
Extension of an absolute value Created 2026-09-24 Updated 2026-10-14
For a field extension , an extension of an absolute value on is an absolute value on whose restriction to is .
Field of algebraic numbers 2026-10-31
The complex algebraic numbers form a field, the algebraic closure of inside . To see closure under the field operations, if are algebraic numbers, the tower law makes a finite-dimensional field extension of . Every element of this extension is an algebraic element, because its successive powers are linearly dependent. In particular it contains , and when .
It is an infinite-degree algebraic extension. A primitive th root of unity has minimal polynomial of an algebraic element of degree for every prime , so the degrees of its finite subextensions are unbounded. Finally a complex root of a polynomial whose coefficients are algebraic numbers is itself algebraic over their finite-degree coefficient field and hence over , again by the tower law. Thus every such polynomial splits in this field, establishing the algebraic closure assertion.
Finite generation descends along a field extension Created 2026-09-24 Updated 2026-09-28
Let be a field extension. If is a finitely generated algebra over , then is finitely generated over . Choose finitely many generators of and collect the finitely many coefficients from occurring in them. The -subalgebra generated by those coefficients satisfies , and faithful flatness of gives .
For an algebraically closed field and a finitely generated field extension of transcendence degree one, choose with finite. The integral closures of the two standard coordinate rings of the projective line in are finite modules and glue to a finite normalization of an algebraic curve of the projective line. A one-dimensional normal local ring is a discrete valuation ring; over the perfect field the resulting projective curve is smooth. Extension of rational maps gives uniqueness of this smooth projective model.
Finite-type integer algebra Created 2026-10-07 Updated 2026-10-14
A unital commutative ring generated by finitely many elements under addition and multiplication, starting from the image of the integers. Equivalently it is a quotient of a finite-variable polynomial ring over . localization of a ring at one element remains finite type, since . Generation here is as an algebra, not merely as a field extension when the ring happens to be a field.
Lang-Nagata theorem for Ci fields 2026-10-07
Matrix similarity invariants Created 2026-10-14 Updated 2026-10-25
Matrix similarity invariants are quantities unchanged by replacing with . Important examples are the characteristic polynomial, trace, determinant, matrix rank, and eigenvalues with their algebraic multiplicities. The characteristic polynomial convention here is , where is the identity matrix.[ref]
Linear Algebra Done Right by Sheldon Axler (4th edition). §9C, Definition 9.63, printed p. 363; Theorem 9.65, printed p. 364: characteristic polynomial, trace, and determinant
The short determinant proof works over any field: because , multiplicativity of the determinant givesThus its roots, the eigenvalues, retain their algebraic multiplicities in any field extension where the polynomial splits. Also . The cyclic property of the trace gives ; equivalently, the trace is determined by the coefficient of in the characteristic polynomial for an -by- matrix.[ref]
Linear Algebra Done Right by Sheldon Axler (4th edition). §8D, Theorems 8.49–8.50, printed pp. 326–327: cyclic trace identity and basis independence
For the two matrices in the opening example,Their entries differ, yet these quantities agree. Agreement is a useful necessary test for matrix similarity; it is not sufficient in general, as same eigenvalues do not imply similarity illustrates.
The relation also preserves repeated application. Adjacent factors cancel to giveFor the opening example, matrix powers therefore have the explicit formAt , this is . Acting on gives , which reconstructs as . More generally for every polynomial , so the minimal polynomial is also unchanged. Multiplication by invertible matrices preserves matrix rank, giving another invariant without finding eigenvalues.