Eventually stable polynomial

A non-constant polynomial with coefficients in a field is said to be eventually stable if the number of irreducible factors of the n -fold iteration of the polynomial is eventually constant as a function of n .

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A non-constant polynomial with coefficients in a field is said to be eventually stable if the number of irreducible factors of the n-fold iteration of the polynomial is eventually constant as a function of n. The terminology is due to R. Jones and A. Levy,[1] who generalized the seminal notion of stability first introduced by R. Odoni.[2]

Definition

edit edit source

Let K be a field and f∈K[x] be a non-constant polynomial. The polynomial f is called stable or dynamically irreducible if, for every natural number n, the n-fold composition fn=f∘f∘…∘f is irreducible over K.

A non-constant polynomial g∈K[x] is called f-stable if, for every natural number n≥1, the composition g∘fn is irreducible over K.

The polynomial f is called eventually stable if there exists a natural number N such that fN is a product of f-stable factors. Equivalently, f is eventually stable if there exist natural numbers N,r≥1 such that for every n≥N the polynomial fn decomposes in K[x] as a product of r irreducible factors.

Examples

edit edit source
  • If f=(x−γ)2+c∈K[x] is such that −c and fn(γ) are all non-squares in K for every n≥2, then f is stable. If K is a finite field, the two conditions are equivalent.[3]
  • Let f=xd+c∈K[x] where K is a field of characteristic not dividing d. If there exists a discrete non-archimedean absolute value on K such that |c|<1, then f is eventually stable. In particular, if K=ℚ and c is not the reciprocal of an integer, then xd+c∈ℚ[x] is eventually stable.[4]

Generalization to rational functions and arbitrary basepoints

edit edit source

Let K be a field and ϕ∈K(x) be a rational function of degree at least 2. Let α∈K. For every natural number n≥1, let ϕn(x)=fn(x)gn(x) for coprime fn(x),gn(x)∈K[x].

We say that the pair (ϕ,α) is eventually stable if there exist natural numbers N,r such that for every n≥N the polynomial fn(x)−αgn(x) decomposes in K[x] as a product of r irreducible factors. If, in particular, r=1, we say that the pair (ϕ,α) is stable.

R. Jones and A. Levy proposed the following conjecture in 2017.[1]

Conjecture: Let K be a field and ϕ∈K(x) be a rational function of degree at least 2. Let α∈K be a point that is not periodic for ϕ.
  1. If K is a number field, then the pair (ϕ,α) is eventually stable.
  2. If K is a function field and ϕ is not isotrivial, then (ϕ,α) is eventually stable.

Several cases of the above conjecture have been proved by Jones and Levy,[1] Hamblen et al.,[4] and DeMark et al.[5]

References

edit edit source
  1. ^ a b c Jones, Rafe; Levy, Alon (2017). "Eventually stable rational functions". International Journal of Number Theory. 13 (9): 2299–2318. arXiv:1603.00673. doi:10.1142/S1793042117501263. Wikipedia revision 1322448593, retrieved 2026-11-18
  2. ^ Odoni, R.W.K. (1985). "The Galois theory of iterates and composites of polynomials". Proceedings of the London Mathematical Society. 51 (3): 385–414. doi:10.1112/plms/s3-51.3.385. Wikipedia revision 1322448593, retrieved 2026-11-18
  3. ^ Jones, Rafe (2012). "An iterative construction of irreducible polynomials reducible modulo every prime". Journal of Algebra. 369: 114–128. arXiv:1012.2857. doi:10.1016/j.jalgebra.2012.05.020. Wikipedia revision 1322448593, retrieved 2026-11-18
  4. ^ a b Hamblen, Spencer; Jones, Rafe; Madhu, Kalyani (2015). "The density of primes in orbits of zd+c". IMRN International Mathematics Research Notices (7): 1924–1958. Wikipedia revision 1322448593, retrieved 2026-11-18
  5. ^ DeMark, David; Hindes, Wade; Jones, Rafe; Misplon, Moses; Stoll, Michael; Stoneman, Michael (2020). "Eventually stable quadratic polynomials over ℚ". New York Journal of Mathematics. 26: 526–561. Wikipedia revision 1322448593, retrieved 2026-11-18

Text derived from https://en.wikipedia.org/w/index.php?oldid=1322448593 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001322448593 · captured 2025-11-16 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “Eventually stable polynomial”, snapshot enwiki-001322448593. https://encyclopegia.org/a/eventually-stable-polynomial