Overview

  • How does composition differ from multiplication?
  • How do intermediate fields give decompositions?
  • When is the monodromy group primitive?
  • How can two complete decompositions differ?

Composition factors

A polynomial f∈K[x]f\in K[x] of degree greater than one is indecomposable over KK if it cannot be written as g∘hg\circ h with g,h∈K[x]g,h\in K[x] and deg⁡g,deg⁡h>1\deg g,\deg h>1. A complete decomposition writes f=f1∘⋯∘frf=f_1\circ\cdots\circ f_r with every fif_i indecomposable.

Linear polynomials are the invertible elements for composition. Thus g∘h=(g∘ℓ−1)∘(ℓ∘h)g\circ h=(g\circ\ell^{-1})\circ(\ell\circ h) for every ℓ=ax+b\ell=ax+b, a≠0a\ne0. Such changes give equivalent decompositions. Unlike multiplication, composition is usually not commutative, and distinct complete decompositions need not differ only by linear changes.

References 1

Intermediate fields

Let KK be algebraically closed of characteristic zero and let xx be transcendental over KK. A decomposition f=g∘hf=g\circ h gives

K(f(x))⊆K(h(x))⊆K(x),[K(x):K(h(x))]=deg⁡h.K(f(x))\subseteq K(h(x))\subseteq K(x),\qquad [K(x):K(h(x))]=\deg h.

Conversely, Lüroth’s theorem says that every intermediate field is K(h(x))K(h(x)) for a rational function hh. Because a polynomial has only one pole, at infinity, a linear fractional change of hh makes it polynomial; then f=g∘hf=g\circ h with gg polynomial. Right factors, up to linear changes, therefore correspond to intermediate fields.

References 1

Blocks and primitivity

Let LL be the splitting field of f(X)−tf(X)-t over K(t)K(t), and let GG act on its roots. This action is transitive. If f=g∘hf=g\circ h, the roots with the same value under hh form blocks of size deg⁡h\deg h, permuted by GG.

For the converse, fix a root xx. Blocks containing xx correspond to subgroups between the point stabilizer GxG_x and GG. Galois correspondence and the preceding field argument convert these subgroups into decompositions. Hence

f indecomposable over K⟺Gal⁡(f(X)−t/K(t)) primitive.f\text{ indecomposable over }K\quad\Longleftrightarrow\quad\operatorname{Gal}(f(X)-t/K(t))\text{ primitive}.

This is a statement about the polynomial with variable target tt. A special value of tt can have a smaller Galois group.

References 2

Connections and evidence

Published

Composition, intermediate fields, blocks, and the off-diagonal curve

Functional decomposition is equivalent to an intermediate-field obstruction; double transitivity additionally detects irreducibility of Qf(X,Y)=(f(X)−f(Y))/(X−Y)Q_f(X,Y)=(f(X)-f(Y))/(X-Y).

Scope. Let f∈C[X]f\in\mathbb C[X] have degree n≥2n\ge2, and let G=Gal⁡(f(X)−t/C(t))G=\operatorname{Gal}(f(X)-t/\mathbb C(t)) act on its nn roots. The critical-value implication additionally assumes at least two distinct critical points.

Composition, intermediate fields, blocks, and the off-diagonal curveFunctional decomposition is equivalent to an intermediate-field obstruction; double transitivity additionally detects irreducibility of \(Q_f(X,Y)=(f(X)-f(Y))/(X-Y)\). Connection 1: At least two critical points is an input to AND. The distinct roots of the derivative include at least two points; no simplicity assumption is imposed. Connection 2: Distinct critical values is an input to AND. Different critical points have different images under the polynomial. Connection 3: AND leads to Doubly transitive monodromy. Together these hypotheses imply double transitivity by the published Proposition 3.8. Connection 4: Doubly transitive monodromy is equivalent to Irreducible off-diagonal curve. Double transitivity is equivalent to irreducibility of \(Q_f(X,Y)\) over \(\mathbb C\). Connection 5: Doubly transitive monodromy leads to Primitive: no nontrivial blocks. Every doubly transitive permutation group is primitive. Connection 6: Primitive: no nontrivial blocks is equivalent to No proper intermediate field. The root stabilizer is maximal exactly when \(\mathbb C(f(x))\subset\mathbb C(x)\) has no proper intermediate field. Connection 7: No proper intermediate field is equivalent to Indecomposable polynomial. A proper intermediate field is \(\mathbb C(h(x))\) for a decomposition \(f=g\circ h\) with both degrees greater than one.At least two critical points — related articleAt least two critical pointsDistinct critical values — related articleDistinct critical valuesANDANDDoubly transitive monodromy — related articleDoubly transitivemonodromyIrreducible off-diagonal curve — related articleIrreducible off-diagonalcurvePrimitive: no nontrivial blocks — related articlePrimitive: no nontrivialblocksNo proper intermediate field — related articleNo proper intermediatefieldIndecomposable polynomial — related articleIndecomposablepolynomialConnection 1: The distinct roots of the derivative include at least two points; no simplicity assumption is imposed.First hypothesis [1]Connection 2: Different critical points have different images under the polynomial.Second hypothesis [2]Connection 3: Together these hypotheses imply double transitivity by the published Proposition 3.8.Critical-value criterion[3]Connection 4: Double transitivity is equivalent to irreducibility of \(Q_f(X,Y)\) over \(\mathbb C\).Point-stabilizer orbits[4]Connection 5: Every doubly transitive permutation group is primitive.Stronger group property[5]Connection 6: The root stabilizer is maximal exactly when \(\mathbb C(f(x))\subset\mathbb C(x)\) has no proper intermediate field.Galois correspondence[6]Connection 7: A proper intermediate field is \(\mathbb C(h(x))\) for a decomposition \(f=g\circ h\) with both degrees greater than one.Polynomial Lüroththeorem [7]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow equivalenceAND joint hypotheses

Write f=g∘hf=g\circ h, identifying right components hh up to postcomposition by an invertible affine polynomial. These components correspond to the fields C(f(x))⊆C(h(x))⊆C(x)\mathbb C(f(x))\subseteq\mathbb C(h(x))\subseteq\mathbb C(x), and to blocks containing a chosen root in the monodromy action. A block is a nonempty root subset whose translates are either equal or disjoint. Thus ff has no decomposition with deg⁡g,deg⁡h>1\deg g,\deg h>1 exactly when GG is primitive.

The stronger condition is a separate equivalence:

G doubly transitive⟺Qf(X,Y)=f(X)−f(Y)X−Y irreducible in C[X,Y].G\text{ doubly transitive}\quad\Longleftrightarrow\quad Q_f(X,Y)=\frac{f(X)-f(Y)}{X-Y}\text{ irreducible in }\mathbb C[X,Y].

Indeed, the stabilizer of one root must act transitively on all remaining roots. Kreso–Tichy, Proposition 3.8, supplies a sufficient condition: f′f' has at least two distinct roots, and f(a)≠f(b)f(a)\ne f(b) for every pair of distinct critical points a,ba,b. Multiple roots of f′f' are allowed.

The converse from primitivity to double transitivity fails: f(X)=X5f(X)=X^5 is indecomposable, but its geometric monodromy is cyclic of order five and Qf=∏ζ5=1, ζ≠1(X−ζY)Q_f=\prod_{\zeta^5=1,\,\zeta\ne1}(X-\zeta Y). This example also shows why the condition on the number of critical points cannot be dropped. The coefficient field here is C\mathbb C; arithmetic and geometric monodromy over a nonclosed field require separate treatment.

Inspect all 7 connections and exact references
Evidence for each connection
ConnectionStatement and source
1At least two critical points → ANDConstruction / input

The distinct roots of the derivative include at least two points; no simplicity assumption is imposed.

2Distinct critical values → ANDConstruction / input

Different critical points have different images under the polynomial.

3AND → Doubly transitive monodromyDeduction

Together these hypotheses imply double transitivity by the published Proposition 3.8.

4Doubly transitive monodromy ↔ Irreducible off-diagonal curveEquivalence

Double transitivity is equivalent to irreducibility of Qf(X,Y)Q_f(X,Y) over C\mathbb C.

5Doubly transitive monodromy → Primitive: no nontrivial blocksDeduction

Every doubly transitive permutation group is primitive.

6Primitive: no nontrivial blocks ↔ No proper intermediate fieldEquivalence

The root stabilizer is maximal exactly when C(f(x))⊂C(x)\mathbb C(f(x))\subset\mathbb C(x) has no proper intermediate field.

7No proper intermediate field ↔ Indecomposable polynomialEquivalence

A proper intermediate field is C(h(x))\mathbb C(h(x)) for a decomposition f=g∘hf=g\circ h with both degrees greater than one.

Sources and scope checked .

Ritt’s first theorem

Theorem

Let f∈C[x]f\in\mathbb C[x] have degree greater than one. Any two complete decompositions have the same length and the same multiset of degrees. One can pass between them by successive replacements of two adjacent factors by two factors with the same composition.

The theorem gives a controlled form of nonuniqueness. It does not say that the factors themselves are uniquely determined. At the field level, a complete decomposition is a maximal chain of intermediate fields. The proof uses the cyclic inertia group above infinity to compare these chains.

References 2

Ritt’s second theorem

Over C\mathbb C, suppose A∘B=C∘DA\circ B=C\circ D with all four polynomials nonconstant and

gcd⁡(deg⁡A,deg⁡C)=gcd⁡(deg⁡B,deg⁡D)=1.\gcd(\deg A,\deg C)=\gcd(\deg B,\deg D)=1.

Up to linear changes and exchanging the two decompositions, Ritt’s second theorem reduces the identity to one of two forms:

Tm∘Tn=Tn∘Tm(gcd⁡(m,n)=1),T_m\circ T_n=T_n\circ T_m\qquad(\gcd(m,n)=1),xn∘(xsH(xn))=(xsH(x)n)∘xn(gcd⁡(s,n)=1).x^n\circ\bigl(x^sH(x^n)\bigr)=\bigl(x^sH(x)^n\bigr)\circ x^n\qquad(\gcd(s,n)=1).

Here H(0)≠0H(0)\ne0, s≥0s\ge0, and TnT_n is a Chebyshev polynomial, characterized by Tn(cos⁡θ)=cos⁡(nθ)T_n(\cos\theta)=\cos(n\theta). The displayed identities explain the basic changes between decompositions; the coprimality assumptions belong to the classification.

References 2

Example

The degree-six polynomial x6+2x4+x2x^6+2x^4+x^2 has two complete decompositions:

x2∘(x3+x)=(x(x+1)2)∘x2.x^2\circ(x^3+x)=\bigl(x(x+1)^2\bigr)\circ x^2.

Indeed, both sides expand to (x3+x)2=x2(x2+1)2=x6+2x4+x2(x^3+x)^2=x^2(x^2+1)^2=x^6+2x^4+x^2. The degree sequences are (2,3)(2,3) and (3,2)(3,2). Every component is indecomposable: its degree is prime, whereas a nontrivial composition has composite degree. This is the monomial case of Ritt’s second theorem with n=2n=2, s=1s=1, and H=x+1H=x+1.

References 1

Computing a decomposition

For a proposed factorization deg⁡f=rs\deg f=rs, normalize the right factor to be monic with zero constant term. Comparing the leading coefficients of f=g(h(x))f=g(h(x)) then determines successive coefficients of hh, provided the characteristic does not divide the outer degree rr. One finally checks the exact identity f=g∘hf=g\circ h.

Von zur Gathen gives algorithms and uniqueness results in this tame case. When the characteristic divides rr, the coefficient equations lose information, and different methods are needed. The two papers on tame and wild decomposition treat these cases separately.

References 2

Further connections

Composition also constrains the factorization of f(X)−g(Y)f(X)-g(Y). For example, a common left factor hh, with deg⁡h>1\deg h>1, gives a factor f1(X)−g1(Y)f_1(X)-g_1(Y) of h(f1(X))−h(g1(Y))h(f_1(X))-h(g_1(Y)). The article on separated variables studies this problem and its connection with monodromy.

The repeated composition f∘n=f∘⋯∘ff^{\circ n}=f\circ\cdots\circ f gives nested block partitions, according to the common ancestors of roots in the preimage tree. The Galois group therefore embeds in an iterated wreath product, even when f∘nf^{\circ n} is irreducible.

References 2

Related topics

References

  1. Prime and composite polynomials

    Ritt, Joseph F. Transactions of the American Mathematical Society, 23(1), 51–66, 1922.

    Read the source
  2. On Ritt's polynomial decomposition theorems

    Zieve, Michael E. and Müller, Peter. arXiv preprint, 2008.

    Read the source
  3. Primitive monodromy groups of polynomials

    Müller, Peter. Recent Developments in the Inverse Galois Problem, American Mathematical Society, Contemporary Mathematics, 186, 385–401, 1995.

    Read the source
  4. Functional Decomposition of Polynomials: The Tame Case

    von zur Gathen, Joachim. Journal of Symbolic Computation, 9(3), 281–299, 1990.

    Read the source
  5. Functional Decomposition of Polynomials: The Wild Case

    von zur Gathen, Joachim. Journal of Symbolic Computation, 10(5), 437–452, 1990.

    Read the source
  6. The Galois Theory of Iterates and Composites of Polynomials

    Odoni, R. W. K. Proceedings of the London Mathematical Society (3), 51(3), 385–414, 1985.

    Read the source
  7. The Davenport–Lewis–Schinzel problem on the reducibility of f(X)−g(Y)

    Behajaina, Angelot and König, Joachim and Neftin, Danny. arXiv, 2026.

    Read the source
  8. Diophantine equations in separated variables

    Kreso, Dijana and Tichy, Robert F. Periodica Mathematica Hungarica, 76, 47–67, 2018.

    Read the source