Blog Archive

Tuesday, September 29, 2026

A Functorial View of Polynomial Irreducibility Test Rings, Lifting Obstructions, and Limit Diagrams

 

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 R, its fraction field K, and a primitive polynomial

f(x)=anxn+⋯+a0∈R[x],an≠0,n≥2.

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 R-algebras and nonempty small diagrams.

1. The Factorization Functor

For an R-algebra A, let fA denote the image of f in A[x], and write

A[x]≤d={∑i=0dbixi:bi∈A}.

This set includes the zero polynomial.

For 1≤e<n, define

D~f,e(A)={(g,h)∈A[x]≤e×A[x]≤n−e:gh=fA}.

A point of this set is an ordered factorization with prescribed degree bounds.

If φ:A→B is an R-algebra homomorphism, apply φ coefficientwise:

D~f,e(φ)(g,h)=(φ∗(g),φ∗(h)).

This is well-defined because

gh=fA⟹φ∗(g)φ∗(h)=fB,

and applying a ring homomorphism cannot increase degree. These maps respect identities and composition, so D~f,e is a covariant functor from nonzero R-algebras to sets.

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 D~f,e(R). Indeed, since R is a domain,

n=deg⁡f=deg⁡g+deg⁡h.

Together with the bounds deg⁡g≤e and deg⁡h≤n−e, this forces

deg⁡g=e,deg⁡h=n−e.

Thus D~f,e(R) records precisely the factorizations of degrees e and n−e.

Proposition. The following are equivalent:

  1. f is irreducible in K[x].

  2. f is irreducible in R[x].

  3. D~f,e(R)=∅ for every 1≤e≤⌊n/2⌋.

Proof. The first two conditions are equivalent by Gauss's lemma. Since f is primitive, a constant factor in R[x] must be a unit: otherwise it would be a nonunit common divisor of all coefficients. Hence reducibility is equivalent to a factorization into two positive-degree polynomials.

Exchanging the factors gives a natural bijection

D~f,e(A)≅D~f,n−e(A).

It therefore suffices to check degrees at most ⌊n/2⌋. ◻

Degree zero is excluded deliberately. If the definition were extended to e=0, the factorization (1,fA) would always give a point, so emptiness would not express the desired obstruction.

3. The Monic Version

When f is monic, define

Df,e(A)={(g,h)∈A[x]2:g,h are monic,deg⁡g=e,deg⁡h=n−e,gh=fA}.

This is again a covariant functor. Monic leading coefficients remain equal to 1 under every change of rings, so exact degrees are preserved.

The two versions are related by a natural isomorphism

D~f,e≅Gm×Df,e,Gm(A)=A×.

Explicitly,

(u,(g,h))⟼(ug,u−1h).

To see this, the top coefficient equation for a bounded-degree factorization of a monic polynomial is

gehn−e=1.

Both leading coefficients are therefore units, and the factors can be normalized to be monic. In particular,

D~f,e(A)=∅⟺Df,e(A)=∅.
4. Representability

The factorization functors are represented by explicit coefficient algebras.

Introduce universal polynomials

U(x)=∑i=0euixi,V(x)=∑j=0n−evjxj,

and set

C~f,e=R[u0,…,ue,v0,…,vn−e]([xk](UV−f):0≤k≤n).

Here [xk](UV−f) denotes the coefficient of xk. The ideal is generated by these coefficient equations.

Giving an R-algebra homomorphism C~f,e→A is exactly giving coefficients for g and h satisfying gh=fA. Hence, naturally in A,

D~f,e(A)≅HomR-alg(C~f,e,A).

The representing algebra is nonzero: a factorization of the required degrees exists over an algebraic closure of K.

For monic f, the monic functor is represented by

Cf,e=C~f,e/(ue−1,vn−e−1).

Equivalently, SpecC~f,e and SpecCf,e are affine schemes whose points over A are the corresponding factorizations.

5. Test Rings and Test Diagrams

Write Fe for either D~f,e or, in the monic case, Df,e.

The structural homomorphism R→A induces

Fe(R)⟶Fe(A).

Since a nonempty set cannot map to the empty set,

Fe(A)=∅⟹Fe(R)=∅.

Consequently, if for each 1≤e≤⌊n/2⌋ there is an R-algebra Ae such that Fe(Ae)=∅, then f is irreducible over K.

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 R.

This argument uses only functoriality. Representability gives an additional tool: preservation of limits.

Let (Ai) be a nonempty small diagram of nonzero R-algebras, with all arrows respecting their R-algebra structures. Then

Fe(lim←i⁡Ai)≅lim←i⁡Fe(Ai).

The structure maps from R form a cone, so

Fe(R)⟶lim←i⁡Fe(Ai).

Therefore,

lim←i⁡Fe(Ai)=∅⟹Fe(R)=∅.

For instance,

Fe(A×B)≅Fe(A)×Fe(B),

whereas

Fe(A×CB)≅Fe(A)×Fe(C)Fe(B).

The second formula requires the two factorizations to agree after mapping to C. Thus all the individual solution sets may be nonempty while their fiber product is empty.

Fixing the degree matters. For monic f, if

Df(A)=∐e=1n−1Df,e(A),

then

Df(A×B)≅∐e=1n−1(Df,e(A)×Df,e(B)),

which is generally not Df(A)×Df(B): the two components must use the same degree.

6. A Basic Example

Consider the primitive polynomial

f(x)=5x4+x2+2x+3∈Z[x].

Only degrees e=1,2 need to be excluded.

Modulo 2,

f(x)≡(x2+x+1)2.

The quadratic x2+x+1 is irreducible over F2, so

D~f,1(F2)=∅.

Modulo 3,

f(x)≡2x(x3+2x+1).

For every a∈F3, one has a3+2a+1=1. Thus the cubic has no root and is irreducible. The only proper factor degrees are 1 and 3, giving

D~f,2(F3)=∅.

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 Z, proving that f is irreducible over Q.

Alternatively, the Chinese remainder theorem combines the tests:

Z/6Z≅F2×F3,

and therefore

D~f,e(Z/6Z)≅D~f,e(F2)×D~f,e(F3)=∅(e=1,2).

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 f=∑i=0naixi∈R[x] be primitive. Suppose that a prime ideal p⊂R satisfies

an∉p,ai∈p(0≤i<n),a0∉p2.

Then

D~f,e(R/p2)=∅(1≤e<n),

and consequently f is irreducible over K.

Proof. Consider

R⟶A:=R/p2⟶B:=R/p.

The kernel I=p/p2 of A→B satisfies I2=0.

Suppose (g,h)∈D~f,e(A). Reducing to the domain B gives

g―h―=a―nxn.

Since a―n≠0, the degree bounds force deg⁡g―=e and deg⁡h―=n−e. A factor of a nonzero scalar multiple of xn over a domain is itself a scalar multiple of a power of x, as can be checked over its fraction field. Thus

g―=bxe,h―=cxn−e

for nonzero b,c∈B. Both constant terms vanish in B, so g(0),h(0)∈I. Hence

fA(0)=g(0)h(0)=0

because I2=0. This contradicts a0∉p2. ◻

For R=Z and p=(p), these are precisely the usual Eisenstein conditions. The test ring is Z/p2Z. For example, x6−2 has no bounded-degree proper factorization over Z/4Z.

The mechanism is a lifting obstruction: factorizations exist after reduction to B, but none can lift to the specified polynomial over A.

8. Fiber Products: Incompatible Factorizations

For a cospan of R-algebras

A1⟶B⟵A2,

the limit is the fiber product

P=A1×BA2={(a1,a2):a1 and a2 have the same image in B}.

It fits into the pullback square

P⟶A1↓↓A2⟶B.

Preservation of limits gives

Fe(P)≅Fe(A1)×Fe(B)Fe(A2).

Thus points on both branches are insufficient: their images in Fe(B) must agree.

Example. Let R=Q[t] and f=x2−t. Specify the following R-algebras:

AlgebraDefinitionImage of t
A1Q[ε1]/(ε13)ε12
A2Q[ε2]/(ε23)4ε22
BQ[δ]/(δ2)0

The maps Ai→B send εi to δ. They respect the R-algebra structures because both images of t become zero.

For any R-algebra A,

Df,1(A)≅{r∈A:r2=tA},r⟼(x−r,x+r).

In A1, all roots are

r=±ε1+cε12,c∈Q,

so their images in B are δ and −δ. In A2, all roots are

r=±2ε2+cε22,

whose images are 2δ and −2δ. These two image sets are disjoint. Therefore

Df,1(A1)×Df,1(B)Df,1(A2)=∅.

The structural map

R⟶P,t⟼(ε12,4ε22),

then implies Df,1(R)=∅. Hence x2−t is irreducible over Q(t).

Every node of the cospan has factorizations, but there is no compatible family of factorizations.

9. Equalizers and Galois Descent

Let α,β:A→B be R-algebra homomorphisms. Their equalizer is

E={a∈A:α(a)=β(a)},

with diagram

E⟶A⇉βαB.

The factorization functor gives

Fe(E)≅{z∈Fe(A):Fe(α)(z)=Fe(β)(z)}.

Thus a factorization over A may fail to descend because its two images disagree.

For a finite Galois extension L/K with group G, the action diagram has limit LG=K. Consequently, for a monic polynomial f∈K[x],

Df,e(K)≅Df,e(L)G,

where G acts coefficientwise on both factors.

If L splits f and f is separable, with root set Ω, then

Df,e(L)≅{S⊆Ω:|S|=e},

by sending S to the ordered pair

(∏α∈S(x−α),∏α∈Ω∖S(x−α)).

This correspondence is G-equivariant. Hence factorizations over K correspond to G-invariant subsets, recovering

f is irreducible over K⟺G acts transitively on Ω.

Example. Let f=x2−2, L=Q(2), and let σ(2)=−2. Then

Q=Eq(L⇉σidL).

The two points of Df,1(L) are

(x−2,x+2),(x+2,x−2).

They are exchanged by σ, so the equalizer of id and Df,1(σ) is empty. This gives Df,1(Q)=∅.

10. Inverse Limits and Compatible Lifting

For a monic polynomial f∈Z[x], consider the inverse system

⋯⟶Z/p3Z⟶Z/p2Z⟶Z/pZ.

Its limit is Zp, so

Df,e(Zp)≅lim←k≥1⁡Df,e(Z/pkZ).

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,

Df,e(Zp)=∅⟺Df,e(Z/pkZ)=∅ for some k.

For a fixed degree, the absence of a p-adic factorization is thus detectable at finite precision.

Example. Take f=x2−5 and p=2. There are roots modulo 2 and modulo 4, but none modulo 8: every square modulo 8 belongs to {0,1,4}. Hence

Df,1(Z/2Z)≠∅,Df,1(Z/4Z)≠∅,Df,1(Z/8Z)=∅.

The third level obstructs every possible compatible sequence, so Df,1(Z2)=∅.

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.

 

 

Popular Posts