Overview
- How does absolute irreducibility differ from irreducibility over the ground field?
- When can a polynomial be treated as a polynomial in one variable?
- When do specialization or smoothness prove irreducibility?
Irreducibility and the ground field
Let be a field and let be nonconstant. It is irreducible over if every factorization in this ring has a constant factor. It is absolutely irreducible if the same holds over an algebraic closure .
The distinction matters even for quadratic polynomials. The polynomial is irreducible over , but over it equals . In contrast, is absolutely irreducible: its quotient ring is , a domain.
More generally, absolute irreducibility says that the hypersurface has an integral coordinate ring after extending the field. The geometric term is geometrically integral. This includes both irreducibility and reducedness. In characteristic , the polynomial over is irreducible but becomes over . Its zero set has one component, but its coordinate ring is not reduced.
References 2
- StacksGeometricIntegrality · Tags 05DW and 038KSource
- Lang2002 · Chapter IV, polynomial ringsSource
One variable over a function field
Write . Its content in is a greatest common divisor of its coefficients in . If the content is a unit, is primitive in . Gauss’s lemma gives, for ,
This reduces many questions in several variables to familiar tests over a field. To prove absolute irreducibility, make the same argument over . The coefficient field here is a rational function field; it is not the algebraic closure of that function field.
Example
If , , and , then is absolutely irreducible. The identity persists over , and a polynomial of degree one in is irreducible over . Thus is absolutely irreducible over every field.
Eisenstein over a polynomial ring
The prime in Eisenstein’s criterion can be an irreducible polynomial. Let , let be irreducible, and write , primitive in . If , for , and , then is irreducible in .
Example
For , the polynomial is Eisenstein at over . It is therefore absolutely irreducible in every characteristic.
Specializing a variable
Proposition
Let be primitive in , and let . If its leading coefficient in does not vanish at and is irreducible in , then is irreducible in .
In a nontrivial factorization, primitivity forces both factors to have positive -degree. The product of their leading coefficients is the leading coefficient of , so neither leading coefficient vanishes at . Specialization would give two nonconstant factors of , a contradiction.
Both hypotheses have a purpose. The polynomial specializes at to the irreducible polynomial , because one factor loses degree. Likewise, specializes to over at , but is not primitive in .
For example, is irreducible over because its specialization at is irreducible. Its absolute irreducibility follows instead from the linear-variable argument. Over an algebraically closed field, a specialized univariate polynomial of degree greater than one always factors.
Smooth projective curves
For a bivariate polynomial of total degree , its homogenization is . It defines the projective closure of the affine curve .
Proposition
If the projective plane curve is smooth over , then is absolutely irreducible.
Two distinct projective plane components meet by Bézout’s theorem. At such an intersection, all partial derivatives of their product vanish. A repeated component also gives singular points. Thus a smooth projective plane curve has a single reduced component.
For , the conic is smooth: its three partial derivatives cannot vanish at a projective point. Hence is absolutely irreducible.
Affine smoothness alone does not suffice. The curve consists of two disjoint smooth affine lines. Their projective closures meet at infinity. Conversely, an irreducible curve may be singular: is irreducible over and has a cusp at the origin.
References 1
- Fulton2008Curves · Chapters 3–5; especially §5.3, Bézout’s theoremSource
Support, fibers, and factorization
Newton polytopes constrain factor supports. The fibers connect irreducibility with polynomial composition. Factorization algorithms recover factors from coefficient equations, lifting, or differential identities.
These methods developed along different lines: elimination theory gives Noether’s coefficient criteria; Ostrowski’s product formula leads to the polytope method; the study of curves connects ramification and permutation groups with factorization. Modern algorithms often combine these viewpoints.
The following articles give the statements and examples: Newton polytopes, separated variables, polynomial fibers and Bertini’s theorem, and factorization in several variables.
References 3
- GaoLauder2001 · §§1–2Source
- Kaltofen1995 · §§1 and 5Source
- DavenportLewisSchinzel1961Source
Questions
Which coefficient conditions imply absolute irreducibility when the Newton polytope decomposes?
Scope. A fixed multivariate support and a specified coefficient field
A decomposition of the polytope gives possible supports of factors, but does not determine whether those factors exist. For a specified family, one can study the reducibility locus in coefficient space or combine the support conditions with differential or lifting methods. The question concerns criteria adapted to that family, rather than a general factorization algorithm.
References 3
Related topics
Connected diagrams
- How can exponent geometry prove absolute irreducibility? · Published
- A complete proposed classification of reducible f(X) − g(Y) · Claimed
Newton polytopes and irreducibility
Exponent supports constrain possible factor supports.
Related toPolynomials with separated variables
Differences f(x)−g(y) connect multivariate irreducibility with monodromy.
Related toPolynomial fibers and Bertini’s theorem
Composition controls the irreducibility of general fibers.
Related toFactorization in several variables
Coefficient equations and local expansions give effective methods.
References
- Geometrically integral algebras and schemes
The Stacks Project Authors. The Stacks Project, 2026.
Read the source - Algebra
Lang, Serge. Edition 3. Springer, Graduate Texts in Mathematics, vol. 211, 2002.
Read the source - Algebraic Curves: An Introduction to Algebraic Geometry
Fulton, William. Author’s electronic edition, 2008.
Read the source - Decomposition of Polytopes and Polynomials
Gao, Shuhong and Lauder, Alan G. B. Discrete & Computational Geometry, 26(1), 89–104, 2001.
Read the source - Effective Noether irreducibility forms and applications
Kaltofen, Erich. Journal of Computer and System Sciences, 50(2), 274–295, 1995.
Read the source - Equations of the form f(x)=g(y)
Davenport, Harold and Lewis, Donald J. and Schinzel, Andrzej. The Quarterly Journal of Mathematics, 12(1), 304–312, 1961.
Read the source - Factoring multivariate polynomials via partial differential equations
Gao, Shuhong. Mathematics of Computation, 72(242), 801–822, 2003.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.