Overview
- When are only finitely many fibers F−λ reducible?
- How does a composition F=h(H) affect its fibers?
- What does Bertini’s theorem say over infinite and finite fields?
Fibers and composition
A nonconstant polynomial , with , defines a map to the affine line. The fiber over is the hypersurface . Call composite if for a polynomial and a univariate polynomial of degree at least two.
If , then every factors over : factor into linear factors and substitute . Repeated factors count as reducibility. Thus composition explains a whole family of reducible fibers, rather than a single exceptional value.
The converse holds: if is not composite, all but finitely many are irreducible. Equivalently, is irreducible over .
References 1
- BodinDebesNajib2009Spectrum · §1, statements (1)–(2)Source
The generic fiber and its field
For every nonconstant , the polynomial is already irreducible over : the quotient is , and localization in the nonzero polynomials in remains a domain. This ordinary irreducibility does not imply that general complex fibers are irreducible.
Example
Take . The polynomial is irreducible over , but over its algebraic closure it factors as . Every complex fiber is reducible, and the fiber over zero is nonreduced. In contrast, is irreducible for every , by Gauss’s lemma applied in .
References 1
- BodinDebesNajib2009Spectrum · §1; the distinction between k(t) and its algebraic closureSource
The spectrum and Stein’s bound
The spectrum of is the set of for which is reducible. For a non-composite of total degree , let be the number of distinct irreducible factors of . Stein’s theorem gives
In particular, there are at most reducible fibers. For , the only such value is zero, where has two components; equality holds.
Lorenzini extended the theorem to algebraically closed fields of arbitrary characteristic and refined the bound. Bodin–Dèbes–Najib study how the spectrum changes under specialization and reduction. For a rational function , the corresponding family is , with a separate fiber at infinity; its bounds and hypotheses differ from the polynomial case. Benelmekki–Najib give a later proof of a rational-function bound using Lüroth’s theorem.
References 4
- Stein1989 · Main theoremSource
- Lorenzini1993Source
- BodinDebesNajib2009Spectrum · Theorem 2.1Source
- BenelmekkiNajib2023 · Introduction; proof using Lüroth’s theoremSource
General linear sections
Bertini’s theorem concerns a different variation: intersect a fixed variety with a varying hyperplane. Over an algebraically closed field, a smooth irreducible projective variety of dimension at least two has a smooth irreducible general hyperplane section. Here “general” means that the hyperplanes lie in a nonempty Zariski open subset of the parameter space.
The dimension assumption matters. A general hyperplane meets a projective curve in finitely many points, and this intersection need not be irreducible. The theorem also concerns varying hyperplanes: it does not say that every section in a chosen pencil is irreducible.
There are quantitative versions. Poonen–Slavov bound the dimension of the exceptional hyperplanes for suitable morphisms to projective space. Kmentt–Shute extend the dimension estimate to linear sections of higher codimension.
References 3
- StacksBertini · Tag 0G4C, Remark 37.32.4Source
- PoonenSlavov2022 · Theorems 1.1 and 1.5Source
- KmenttShute2022 · Theorem 1.2Source
Sections over finite fields
Over a finite field, a nonempty open subset of the parameter space need not contain a rational point. The usual existence argument for a general hyperplane therefore does not apply directly.
Charles–Poonen prove the following replacement. Let be geometrically irreducible with . Among all degree- homogeneous polynomials over , the proportion whose hypersurfaces meet in a geometrically irreducible scheme tends to one as . This is a statement about geometric irreducibility; reducedness is a separate property.
The published erratum corrects part of the proof and leaves the main results unchanged.
References 2
- CharlesPoonen2016 · Theorem 1.1Source
- CharlesPoonen2019Erratum · Correction to Lemma 5.1Source
Related topics
Polynomials in several variables
Ground-field and geometric irreducibility are different properties.
Related toSpecialization and Hilbert irreducibility
Hilbert irreducibility concerns arithmetic specializations over the ground field.
Related toPolynomial decomposition
Composition determines whether general geometric fibers are irreducible.
Related toIrreducibility over finite fields
Finite fields require separate existence and counting arguments.
References
- Indecomposable polynomials and their spectrum
Bodin, Arnaud and Dèbes, Pierre and Najib, Salah. Acta Arithmetica, 139(1), 79–100, 2009.
Read the source - The total reducibility order of a polynomial in two variables
Stein, Yosef. Israel Journal of Mathematics, 68, 109–122, 1989.
Read the source - Reducibility of polynomials in two variables
Lorenzini, Dino. Journal of Algebra, 156(1), 65–75, 1993.
Read the source - A note on the spectrum of a rational function
Benelmekki, Mohamed and Najib, Salah. Annales mathématiques Blaise Pascal, 30(2), 107–114, 2023.
Read the source - Bertini theorems
The Stacks Project Authors. The Stacks Project, 2026.
Read the source - The Exceptional Locus in the Bertini Irreducibility Theorem for a Morphism
Poonen, Bjorn and Slavov, Kaloyan. International Mathematics Research Notices, 2022(6), 4503–4513, 2022.
Read the source - The Bertini irreducibility theorem for higher codimensional slices
Kmentt, Philip and Shute, Alec. Finite Fields and Their Applications, 83, 102085, 2022.
Read the source - Bertini irreducibility theorems over finite fields
Charles, François and Poonen, Bjorn. Journal of the American Mathematical Society, 29(1), 81–94, 2016.
Read the source - Erratum to “Bertini irreducibility theorems over finite fields”
Charles, François and Poonen, Bjorn. Journal of the American Mathematical Society, 32(2), 605–607, 2019.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.