English

Invariant varieties for polynomial dynamical systems

Dynamical Systems 2012-12-11 v3 Algebraic Geometry Logic Number Theory

Abstract

We study algebraic dynamical systems (and, more generally, σ\sigma-varieties) Φ:ACnACn\Phi:{\mathbb A}^n_{\mathbb C} \to {\mathbb A}^n_{\mathbb C} given by coordinatewise univariate polynomials by refining a theorem of Ritt. More precisely, we find a nearly canonical way to write a polynomial as a composition of "clusters". Our main result is an explicit description of the (weakly) skew-invariant varieties. As a special case, we show that if f(x)C[x]f(x) \in {\mathbb C}[x] is a polynomial of degree at least two which is not conjugate to a monomial, Chebyshev polynomial or a negative Chebyshev polynomial, and XAC2X \subseteq {\mathbb A}^2_{\mathbb C} is an irreducible curve which is invariant under the action of (x,y)(f(x),f(y))(x,y) \mapsto (f(x),f(y)) and projects dominantly in both directions, then XX must be the graph of a polynomial which commutes with ff under composition. As consequences, we deduce a variant of a conjecture of Zhang on the existence of rational points with Zariski dense forward orbits and a strong form of the dynamical Manin-Mumford conjecture for liftings of the Frobenius. We also show that in models of ACFA0_0, a disintegrated set defined by σ(x)=f(x)\sigma(x) = f(x) for a polynomial ff has Morley rank one and is usually strongly minimal, that model theoretic algebraic closure is a locally finite closure operator on the nonalgebraic points of this set unless the skew-conjugacy class of ff is defined over a fixed field of a power of σ\sigma, and that nonorthogonality between two such sets is definable in families if the skew-conjugacy class of ff is defined over a fixed field of a power of σ\sigma.

Keywords

Cite

@article{arxiv.0901.2352,
  title  = {Invariant varieties for polynomial dynamical systems},
  author = {Alice Medvedev and Thomas Scanlon},
  journal= {arXiv preprint arXiv:0901.2352},
  year   = {2012}
}

Comments

The paper has been substantially reorganized and a new formalism of "clustering" has been introduced to analyze polynomial decompositions. The title has been changed to better reflect its contents. This is the authors' version of a paper which is to appear in the Annals of Mathematics

R2 v1 2026-06-21T12:01:27.555Z