Factorization Functors and Irreducibility1. The Factorization Functor2. Irreducibility as Emptiness3. The Monic Version4. Representability5. Test Rings and Test Diagrams6. A Basic Example7. Eisenstein as a Square-Zero Test8. Fiber Products: Incompatible Factorizations9. Equalizers and Galois Descent10. Inverse Limits and Compatible Lifting
Factorization Functors and Irreducibility
A polynomial factorization can be viewed as a solution to a system of equations in the coefficients of its factors. Changing the coefficient ring transports these solutions. This gives a simple framework for irreducibility: construct a ring in which the relevant solution set is empty, and transfer this obstruction back to the original ring.
Throughout, rings are commutative with identity. Fix a UFD
Here primitive means that the greatest common divisor of the coefficients is a unit. Test algebras need not be domains or UFDs. To avoid conventions about the degree of a polynomial over the zero ring, we work with nonzero
1. The Factorization Functor
For an
This set includes the zero polynomial.
For
A point of this set is an ordered factorization with prescribed degree bounds.
If
This is well-defined because
and applying a ring homomorphism cannot increase degree. These maps respect identities and composition, so
Degree bounds are essential. A ring homomorphism may kill a leading coefficient, so exact degrees need not survive a change of rings. The bounded-degree definition retains these specialized factorizations.
2. Irreducibility as Emptiness
Although degrees may drop over a test algebra, they cannot drop at a point of
Together with the bounds
Thus
Proposition. The following are equivalent:
is irreducible in . is irreducible in . for every .
Proof. The first two conditions are equivalent by Gauss's lemma. Since
Exchanging the factors gives a natural bijection
It therefore suffices to check degrees at most
Degree zero is excluded deliberately. If the definition were extended to
3. The Monic Version
When
This is again a covariant functor. Monic leading coefficients remain equal to
The two versions are related by a natural isomorphism
Explicitly,
To see this, the top coefficient equation for a bounded-degree factorization of a monic polynomial is
Both leading coefficients are therefore units, and the factors can be normalized to be monic. In particular,
4. Representability
The factorization functors are represented by explicit coefficient algebras.
Introduce universal polynomials
and set
Here
Giving an
The representing algebra is nonzero: a factorization of the required degrees exists over an algebraic closure of
For monic
Equivalently,
5. Test Rings and Test Diagrams
Write
The structural homomorphism
Since a nonempty set cannot map to the empty set,
Consequently, if for each
Different degrees may use different test algebras. A nonempty test set simply means that this particular test has not ruled out the degree; its points need not come from
This argument uses only functoriality. Representability gives an additional tool: preservation of limits.
Let
The structure maps from
Therefore,
For instance,
whereas
The second formula requires the two factorizations to agree after mapping to
Fixing the degree matters. For monic
then
which is generally not
6. A Basic Example
Consider the primitive polynomial
Only degrees
Modulo
The quadratic
Modulo
For every
The leading coefficient survives both reductions, so the bounded-degree conditions force exact degrees in these test rings. Functoriality now excludes both possible degrees over
Alternatively, the Chinese remainder theorem combines the tests:
and therefore
The arithmetic work lies in finding useful test algebras and proving that the relevant solution sets, or sets of compatible solutions, are empty. Functoriality transfers these obstructions to the original ring; representability identifies compatible solutions with solutions over a limit ring.
7. Eisenstein as a Square-Zero Test
Eisenstein's criterion is a special case of the test-ring principle: every candidate factorization is ruled out over a quotient by the square of a prime ideal.
Proposition (Eisenstein). Let
Then
and consequently
Proof. Consider
The kernel
Suppose
Since
for nonzero
because
For
The mechanism is a lifting obstruction: factorizations exist after reduction to
8. Fiber Products: Incompatible Factorizations
For a cospan of
the limit is the fiber product
It fits into the pullback square
Preservation of limits gives
Thus points on both branches are insufficient: their images in
Example. Let
| Algebra | Definition | Image of |
|---|---|---|
The maps
For any
In
so their images in
whose images are
The structural map
then implies
Every node of the cospan has factorizations, but there is no compatible family of factorizations.
9. Equalizers and Galois Descent
Let
with diagram
The factorization functor gives
Thus a factorization over
For a finite Galois extension
where
If
by sending
This correspondence is
Example. Let
The two points of
They are exchanged by
10. Inverse Limits and Compatible Lifting
For a monic polynomial
Its limit is
A point on the right is a sequence of factorizations whose coefficients agree under every reduction map.
Each finite-level solution set is finite. An inverse system of finite nonempty sets has a nonempty limit; surjectivity of the transition maps is not required. This follows from compactness, or from the finite branching argument for compatible partial sequences. Therefore,
For a fixed degree, the absence of a
Example. Take
The third level obstructs every possible compatible sequence, so
A limit diagram can always be combined into its limit ring. Its usefulness is that it expresses one test through simpler calculations: simultaneous existence for products, agreement for fiber products, invariance for equalizers, and compatible lifting for inverse limits.
The arithmetic work lies in finding useful test algebras and proving that the relevant solution sets, or sets of compatible solutions, are empty. Functoriality transfers these obstructions to the original ring; representability identifies compatible solutions with solutions over a limit ring.