Table of Contents
Fetching ...

Rational functions sharing preimages and height functions

Fedor Pakovich

TL;DR

Let $A,B$ be non-constant rational functions and $K$ an infinite set contained in $\mathbb{P}^1(\boldsymbol{k})$ with $\boldsymbol{k}$ finitely generated, or a discrete infinite subset when $A,B$ are polynomials. The paper proves that if $A^{-1}(K)\subseteq B^{-1}(K)$, then ${\rm deg}\,B\ge{\rm deg}\,A$, and hence $A^{-1}(K)=B^{-1}(K)$ is impossible unless ${\rm deg}\,A={\rm deg}\,B$; it also derives corollaries about infinite completely invariant sets of the correspondence $(\mathbb{P}^1,A,B)$. The main method combines height machinery, notably the Moriwaki height, with orbit considerations of the multivalued map $H(z)=B(A^{-1}(z))$, augmented by a simple height argument for the polynomial/discrete case. These results generalize prior compact-$K$ findings to broad infinite sets, revealing rigidity phenomena in the dynamics of rational maps and providing tools for studying invariant sets of rational correspondences.

Abstract

Let $A$ and $B$ be non-constant rational functions over $\mathbb{C}$, and let $K \subset \mathbb{P}^1(\mathbb{C})$ be an infinite set. Using height functions, we prove that the inclusion $ A^{-1}(K) \subseteq B^{-1}(K) $ implies the inequality $ {\rm deg} B \geq {\rm deg} A $ in the following two cases: the set $K$ is contained in $\mathbb{P}^1(k)$, where $ k$ is a finitely generated subfield of $\mathbb{C}$, or the set $K$ is discrete in $\mathbb{C}$, and $A$ and $B$ are polynomials. In particular, this implies that for $A$, $B$, and $K$ as above, the equality $ A^{-1}(K) = B^{-1}(K) $ is impossible, unless $ {\rm deg} B = {\rm deg} A $.

Rational functions sharing preimages and height functions

TL;DR

Let be non-constant rational functions and an infinite set contained in with finitely generated, or a discrete infinite subset when are polynomials. The paper proves that if , then , and hence is impossible unless ; it also derives corollaries about infinite completely invariant sets of the correspondence . The main method combines height machinery, notably the Moriwaki height, with orbit considerations of the multivalued map , augmented by a simple height argument for the polynomial/discrete case. These results generalize prior compact- findings to broad infinite sets, revealing rigidity phenomena in the dynamics of rational maps and providing tools for studying invariant sets of rational correspondences.

Abstract

Let and be non-constant rational functions over , and let be an infinite set. Using height functions, we prove that the inclusion implies the inequality in the following two cases: the set is contained in , where is a finitely generated subfield of , or the set is discrete in , and and are polynomials. In particular, this implies that for , , and as above, the equality is impossible, unless .

Paper Structure

This paper contains 2 sections, 6 theorems, 28 equations.

Table of Contents

  1. Introduction
  2. Proofs

Key Result

Theorem 1.1

Let $A$ and $B$ be non-constant rational functions over ${\mathbb C}$, and let $K$ be an infinite subset of $\mathbb{P}^1({\bm k})$, where $\bm{k}$ is a finitely generated subfield of $\mathbb{C}$. If $A^{-1}(K) \subseteq B^{-1}(K)$, then ${\rm deg\,} B \geq {\rm deg\,} A$. In particular, $A^{-1}(K)

Theorems & Definitions (6)

  • Theorem 1.1
  • Corollary 1.2
  • Theorem 1.3
  • Corollary 1.4
  • Lemma 2.1
  • Proposition 2.2