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.
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.
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.
The completion of an algebraic closure of is an algebraically closed field. Approximate a polynomial over by one over , use continuity of roots over a non-Archimedean field to obtain a nearby algebraic root, and then use Krasner's lemma to show that the original root already belongs to .
Conjugate element (field theory) Created 2026-10-14 Updated 2026-10-31
The algebraic conjugates of an algebraic element over a field are the polynomial roots of its algebraic minimal polynomial over in an algebraic closure.
The algebraic conjugates of an algebraic number are the polynomial roots of its algebraic minimal polynomial, equivalently its images under field embeddings of its number field into an algebraic closure.
Division point of an elliptic curve 2026-10-14
A division point above is a point over an algebraic closure satisfying , for a specified nonzero integer . Two such points differ by an -torsion point of an elliptic curve. If the characteristic of a field does not divide , there are distinct division points; in other characteristics the scheme fibre still has length , but its geometric points can be fewer. The unramified division torsors at good primes control their coordinate fields over local fields.
Field norm Created 2026-09-24 Updated 2026-10-13
For a finite field extension , multiplication by is a -linear map . Its determinant is the field norm:This does not depend on the chosen basis. If is a separable field extension, thenwhere the product runs over all field embeddings into an algebraic closure of . Embeddings are counted even when several give the same value on : for , the result is . This avoids ambiguity in the phrase “product of algebraic conjugates”.[ref]
https://math.mit.edu/classes/18.785/2021fa/LectureNotes4.pdf. Andrew Sutherland, Number Theory I, Lecture 4, norm and trace
For over , write . In the basis , multiplication by has columns and , henceThe determinant calculation and the product of the two field embeddings give the same answer. In particular,A field norm is an arithmetic invariant; it is not a nonnegative norm measuring length, and need not be positive on nonzero elements.
The field norm is multiplicative, , because and determinants are multiplicative. It vanishes exactly at zero. For a number field over , it takes algebraic integers to integers, and an algebraic integer is a unit exactly when its field norm is or .[ref]
https://math.mit.edu/classes/18.785/2021fa/LectureNotes4.pdf. Sutherland, Lecture 4, properties of the norm
[ref]https://kconrad.math.uconn.edu/blurbs/ugradnumthy/quadratic-integers.pdf. Conrad, Quadratic Integers, norms and units in quadratic rings
This makes the field norm a useful test for divisibility. If nonzero and divides , then the integer divides . For example, has field norm , so it cannot divide , whose field norm is . It does divide , with quotient . This necessary condition can reject a proposed factor without solving for its quotient.
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.
Newton polygon root valuation theorem 2026-10-06
For a polynomial with nonzero constant coefficient over a complete discretely valued field, plot coefficient exponents against their valuations. A lower Newton polygon segment of slope and horizontal length accounts for exactly roots of valuation , counted with multiplicity in an algebraic closure. Zero coefficients are omitted. Reflecting the horizontal axis changes the sign of every slope, so slope conventions must be fixed before reading root valuations.
Nonsingular point of an algebraic curve 2026-10-14
For an affine plane algebraic curve , a point over an algebraic closure is nonsingular when the displayed condition holds. Its Zariski tangent space has dimension one, and a local coordinate can be chosen in the direction of a nonzero partial derivative. A smooth algebraic curve has all points nonsingular. Over a complete local field, the Hensel lemma lifts a nonsingular residue point by solving for a coordinate with unit partial derivative.
Ordinary double point Created 2026-10-05 Updated 2026-10-06
For a reduced plane algebraic curve, an ordinary double point is a point whose lowest nonzero local homogeneous term has degree and factors into two distinct linear factors over an algebraic closure. The two factors give distinct tangent directions. In characteristic not , is an example.
Proceed by induction on . The zero-dimensional case is immediate. Over , the fundamental theorem of algebra supplies a root of the characteristic polynomial. Since , there is a nonzero vector with . The line is invariant, so induces a linear map on . By induction, choose an upper triangular basis for that quotient and lift its vectors to . Then for every . Thus is the required basis and .
The same conclusion holds over when the characteristic polynomial splits over . Indeed an eigenvalue then lies in , and the block matrix arising from the invariant line gives . The quotient characteristic polynomial therefore also splits, so the induction works over without requiring algebraic closure.
Proceed by induction on . The zero-dimensional case is immediate. Over , the fundamental theorem of algebra supplies a root of the characteristic polynomial. Since , there is a nonzero vector with . The line is invariant, so induces a linear map on . By induction, choose an upper triangular basis for that quotient and lift its vectors to . Then for every . Thus is the required basis and .
The same conclusion holds over when the characteristic polynomial splits over . Indeed an eigenvalue then lies in , and the block matrix arising from the invariant line gives . The quotient characteristic polynomial therefore also splits, so the induction works over without requiring algebraic closure.
The eigenvalues in are precisely the roots in of the companion polynomial ; over an algebraic closure take all its roots. Thus the form determines their root set, but an explicit list generally requires factoring or solving and cannot be read off by inspection. This is the relevant distinction in the qualification “with no further calculations”. Over a general field the polynomial may have no roots in at all, and its diagonal entries are not its eigenvalues. If “determinable” means only uniquely specified rather than immediately readable, all the information is of course fixed by the matrix, including this root set.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 2 Solution Created 2026-10-03 Updated 2026-10-14
A Hilbertian field is a field over which generic irreducibility can be retained by specializing a parameter. More precisely, for polynomials irreducible over and separable in , and a nonzero exclusion polynomial , the Hilbert subsetis infinite. Denominators, leading coefficients and discriminants may be incorporated into . The infinite condition permits simultaneous avoidance of any finitely many bad places. Separability is part of the definition, particularly in positive characteristic.
The field-theoretic interpretation is useful in constructive Galois theory. If is finite separable and generated by a root of , specialization at a good is the residue extension at a place over . Irreducibility of means its residue degree is the entire degree . Thus a Hilbertian field has infinitely many unramified rational places which are completely inert in each prescribed finite separable extension. For a finite family, one can work in a primitive-element presentation of their separable compositum; preserving its full degree preserves the degrees of all the subextensions.
Hilbert's irreducibility theorem says that is Hilbertian, and gives the corresponding assertion for number fields, including infinitely many integral specializations in its classical form. Rational function fields over arbitrary fields are also Hilbertian. In particular, global function fields are Hilbertian just as number fields are. These standard field classes and the specialization viewpoint are discussed in Haran and Jarden's introduction to Hilbertian fields. The theorem does not say every parameter is good: is generically irreducible, but a square parameter makes it split. For simultaneous irreducibility, one excludes more exceptional parameters, not the entire field.
Hilbertianity survives finite extensions. For the separable case, let be Hilbertian, finite separable and irreducible and separable. A primitive element of over has degree . Apply Hilbertianity to its minimal polynomial and exclude the presentation's denominators. The resulting residue field contains the constant copy of and has the same total degree over , so its degree over is . Therefore remains irreducible over , even for infinitely many chosen in . This argument also handles finitely many polynomials by a compositum. Purely inseparable finite extensions are treated by separating the separable part and transporting its rational places through the unique purely inseparable extension; the finite-extension stability statement remains valid.
The property is not inherited by arbitrary algebraic extensions. An algebraic closure is not Hilbertian: in characteristic zero, is irreducible over but every specialization has a root in . In characteristic , use instead; a hypothetical rational-function root would give its right side a pole of order divisible by , contradicting its simple pole at infinity. All constant specializations split over the algebraically closed field.
Finite fields also fail. For of characteristic , considerIts right-hand additive datum has a pole of order , not divisible by , and cannot be for a rational function . The polynomial is therefore irreducible over : its roots are for , so its splitting-field group has prime order unless a root already belongs to the base field. At every , however, and the specialization is , which splits. This gives a concrete failure of the required specialization property.
The main constructive application is Galois-preserving Hilbert specialization. Suppose is finite Galois with group , and use a primitive element of the entire splitting field, not merely a generator of one root field. A good specialization retaining degree has residue group embedded in by unramified reduction. Since its order is still , it is exactly . Preserving only the irreducibility of the original degree- polynomial would prove transitivity, which is weaker than preserving its full group. Resolvents or the primitive generator eliminate that ambiguity.
Consequently a regular realization of over , with constant field , yields realizations over the Hilbertian field . This is the bridge from branch-cycle constructions to the Inverse Galois problem over number fields. A realization over alone cannot be specialized to ; descent of its coefficients and constants is an additional step. Rational rigidity can supply that descent under its appropriate hypotheses, while ordinary complex rigidity answers only the geometric uniqueness question.
For example, the family has full symmetric geometric monodromy in characteristic zero. It is irreducible because it is linear in . Its derivative has distinct critical roots satisfying , and their distinct critical values are . Each simple critical point gives a transposition. These finite branch cycles generate the monodromy, since the infinity loop is the inverse product of the finite loops. Their transitive connected-edge action gives . The arithmetic group is also , so the constant field is . Hilbert specialization then produces symmetric Galois groups over . For the same conclusion follows directly from the square-root family.
Finally, the good parameters form a large arithmetic set without being every point or generally a Zariski-open set. Reducibility can occur at infinitely many exceptional points, as the square example shows. The language of thin sets packages those exceptions as images of generically finite separable covers of degree greater than one, together with finitely many points. Hilbertianity asserts that such finitely many exceptional constructions cannot exhaust the rational line. It is an existence principle with powerful constructive consequences, not by itself an algorithm that certifies a particular chosen parameter.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 5 a Solution Created 2026-10-03 Updated 2026-10-14
The PDF has -power exponents; the polynomial is a linearized polynomial over a finite field, not the degree- polynomial produced by the converted TeX. Let be its root set in an algebraic closure. Because and for ,Thus is an -vector space. Its derivative is , and its degree is , so it has exactly distinct roots. A finite vector space of that size has dimension .
Every splitting-field automorphism fixes and carries roots to roots. Hence it acts linearly on . The action is faithful because the splitting field is generated by the roots. Choosing a basis identifies this injection withDifferent bases conjugate the matrix subgroup. The linear action itself is canonical, while a particular matrix realization is basis-dependent.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 5 b Solution Created 2026-10-03 Updated 2026-10-14
Put , so and in the characteristic. For a nonzero root , division by givesThe projective point is therefore represented by , satisfyingTwo nonzero roots give the same exactly when their ratio lies in . Thus the projective points are precisely the roots of . The polynomial is irreducible in , since it is linear in and its quotient ring is . Gauss's lemma makes it irreducible over , so the action on projective points is transitive.
Fix one such coordinate , so . The other coordinates satisfyWe prove its irreducibility even over . Make the birational change , . Multiplication by transforms the equation intoChoose a nontrivial th root of unity over the algebraic closure. Since the characteristic does not divide , has a simple zero at . Viewed as a polynomial in over , is Eisenstein at the prime : the leading coefficient is one, every intermediate coefficient is zero, and the constant term is divisible by that prime exactly once. It is therefore irreducible.
The birational substitution preserves irreducibility after inverting or . No factor supported solely on is lost, because is nonzero. Gauss's lemma then proves that is irreducible over and hence over . Its roots are distinct: a repeated root would have as well as , forcing , impossible generically.
The stabilizer of the chosen projective point is , and the irreducibility of makes it transitive on all the remaining projective points. This proves projective transitivity of a trinomial linearized polynomial, namely two-transitivity on the one-dimensional subspaces. The supplied group-theoretic result now applies to the linear subgroup from part (a), givingThe Eisenstein argument remains valid even though is divisible by the characteristic; it concerns irreducibility in , not separability of that projection. Separability of the projective polynomial has been checked independently.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 5 c Solution Created 2026-10-03 Updated 2026-10-14
Write with , and let be the splitting field. The root set of is an -dimensional vector space over , by the argument of part (a) with replaced by .
The constants really occur inside , rather than only in the ambient algebraic closure. Choose a nonzero root . For every , is also a root, so both elements lie in andLet . Since is Galois of degree two,This index statement does not require proving that has no still larger constant field.
As an extension of , is the splitting field of the same polynomial. Applying part (b) with base constant size and dimension givesThe special linear group is the kernel of determinant in the general linear group, so every element of normalizes it. Therefore is the required normal index-two subgroup normalizing .
In fact the full group is semilinear over : an element outside acts on constants as and satisfies . Field automorphisms preserve determinant one, so this also explains the normalizer behavior geometrically. This is the quadratic constant extension of a q-squared linearized splitting field, not the polynomial of part (b) with its term unchanged.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 36 3 Solution Created 2026-10-03 Updated 2026-10-14
A root of unity over a finite field is an element satisfying , with ; the algebraic closure is essential because all roots need not lie in the base field. Write and , where . In characteristic ,The latter polynomial has distinct roots, since the derivative is nonzero at every root. Those roots are closed under multiplication and inversion and contain , so is a finite multiplicative subgroup of a field. The proof in the preceding solution makes it a cyclic group. In particularThis also explains why the coprimality qualification is needed.
The multiplicative group of a finite field is cyclic of order . It contains the entire group of th roots precisely when . For necessity, a generator of has order and Lagrange's theorem applies. For sufficiency, a cyclic group whose order is divisible by contains roots of ; since there are exactly roots in the algebraic closure, these are all of them. Hence the least positive extension degree isHere is the multiplicative order of the residue class of modulo . If is coprime to , replace by . Existence of this order follows because is a unit modulo .
A primitive th root of unity over a finite field has multiplicative order exactly . If , no such element exists, since all roots have order dividing . If , choose a generator of . The element has order , so it is primitive precisely when . Therefore there are primitive roots, with the Euler totient function.
If is primitive of order , then exactly when , equivalently . The implication from that equality to membership follows because the roots of form , as proved in the preceding solution. Consequentlyfor , and the degree is one for . This is also the length of the finite-field Frobenius automorphism orbit of .
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 27 4 ii Solution Created 2026-10-03 Updated 2026-10-14
Krasner's lemma states: let be complete for a Non-Archimedean absolute value, let be a separable algebraic element over , and let be algebraic over , all in a fixed algebraic closure with the extended field absolute value. Ifthen . If , the conclusion is automatic and there is no conjugate-distance condition to check.
To prove it, put and take a finite splitting field for the minimal polynomial of over . That is a separable polynomial, so is Galois. The finite extension is complete, and uniqueness of extensions of an field absolute value from a complete non-Archimedean field makes every an isometry. It fixes , soIf , it is another -conjugate and this inequality contradicts the strict hypothesis. Every such automorphism therefore fixes . The Fundamental theorem of Galois theory gives , provingOnly needs to be a separable algebraic element: the proof works even when is inseparable, because the splitting field is taken over .