This paper investigates dynamical invariants of toric correspondences, deriving formulas for dynamical degrees, analyzing degree growth, and computing height growth ratios using algebraic geometry and arithmetic methods.
Contribution
It provides explicit formulas for dynamical degrees and links degree growth with log-concavity, advancing understanding of toric correspondence dynamics.
Findings
01
Derived a formula for dynamical degrees
02
Linked degree growth to log-concavity conditions
03
Computed asymptotic height growth ratios
Abstract
We focus on various dynamical invariants associated to toric correspondences, using algebraic geometry or arithmetic. We find a formula for the dynamical degrees, relate the exponential growth of the degree sequences with a strict log-concavity condition on the dynamical degrees and compute the asymptotic ratio of the growth of heights of points of such correspondences.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Advanced Combinatorial Mathematics · Commutative Algebra and Its Applications
We focus on various dynamical invariants associated to monomial correspondences on toric varieties, using algebraic and arithmetic geometry. We find a formula for their dynamical degrees, relate the exponential growth of the degree sequences with a strict log-concavity condition on the dynamical degrees and compute the asymptotic rate of the growth of heights of points of such correspondences.
2010 Mathematics Subject Classification:
14H10 (primary), 14N99, 14M99, 37F05
This work was partially supported by NSF grant 1703308.
Introduction
Let K be an algebraically closed field of characteristic zero, X be a smooth n-dimensional quasiprojective variety over K. A rational correspondenceg on X is a quasiprojective variety Γf together with two maps π1 and π2 to X, such that both maps are dominant when restricted to every irreducible component of Γf. Fix a normal compactification X of X, a compactification Γf′ of Γf extending the maps π1 and π2 to X, and a desingularization Γf of Γf′.
Rational correspondences can be iterated (see Section 1.1); we denote by fp the p-th iterate of the correspondence f. There are invariants of various nature associated to the dynamical system induced by a given correspondence. They can be transcendental or algebraic, or arithmetic if K is Q.
Let us present a first invariant defined purely using algebraic geometry.
Fix an ample divisor D on X and an integer k⩽n, the k-degree of the correspondence g with respect to X and D is the intersection number:
[TABLE]
on Γf.
The asymptotic behavior of the sequence (degk(fp))p roughly measures the algebraic complexity of the iterates of f. These degree sequences have been studied most in the case when Γf is the graph of a rational map f.
The growth of the sequence of degrees is an essential tool when one studies the group of birational transformations (see [Giz80], [DF01], [Can11], [BD15], [BC16] for surfaces, [DS04] for the study of commutative automorphism groups in dimension ≥3 and [CZ12], [Zha14] for some characterizations of positive entropy automorphisms in higher dimension).
When K is the field of complex numbers, Dinh-Sibony [DS05b, DS08] proved that the sequence of degrees is submultiplicative and this result was recently extended to a field of arbitrary characteristic [TT16, Dan17].
As a result, Fekete’s lemma implies that the asymptotic ratio of the sequence degk(gp), called the k-th dynamical degree of g and denoted λk(g) is well-defined and is equal to the limit
[TABLE]
These numbers were first defined for rational maps over the complex projective space by Russakovski-Shiffman [RS97] and are in general birational invariants [TT16].
Dynamical degrees are also a key ingredient in the construction of ergodic invariant measures ([BS92], [Sib99],[DS05a], [Gue05], [DTV10], [DS10], [DDG11]).
The quantity analogous to the dynamical degree in the analytic setting is the topological entropy — the exponential growth rate of the number of (n,ϵ) separated orbits that avoid the indeterminacy locus of a given correspondence.
These two invariants are closely related as the dynamical degrees control the topological entropy ([Gro03, DS05b, DS08]) and the equality between the topological entropy and the logarithm of its largest dynamical degree is achieved for holomorphic maps [Yom87].
Like the entropy, the dynamical degrees are also difficult to compute in general. While the nth dynamical degree λn is the topological degree of g, the issue when 1⩽k<n is that g has in general a non-empty indeterminacy locus and hence the pullback (gp)∗ on the Neron Severi group need not be equal to (g∗)p. Thus computing λk involves computing infinitely many potentially unrelated pullback maps.
Therefore, they have only been computed in low dimension or for maps which preserve certain geometric constraints: they are known for regular morphisms, for birational maps of surfaces [DF01], for endomorphisms of the affine plane [FJ11], for monomial maps [Lin12, FW12], for birational maps of hyperkähler varieties [LB17] and for Hurwitz correspondences (a class of mappings and correspondences obtained from Teichmüller theory in the work of Koch [Koc13]) [KR16, Ram18, Ram19]. The properties of dynamical degrees were studied for particular classes of birational transformations of P3 [DH16, CD18, DL18, Dan18]. Due to this difficulty, there are many open questions. Until recently, it was not known whether every dynamical degree is an algebraic integer; however just this year Bell-Diller-Jonsson [BDJ19] have found a map with a transcendental dynamical degree.
In contrast to the general situation, the dynamical degrees and the sequence of degrees of monomial maps are well understood [BK08, Lin12, FW12, JW11, DX17]. Fix n>0, and denote by T the n-dimensional torus (K∗)n. Let M=(Mij) be an n×n integer matrix. Then M induces a monomial self-map ϕ(M) of T, sending (x1,…xn) to (∏jxjM1j,…,∏jxjMnj). If M is non-singular then ϕ(M) is dominant, with topological degree det(M). The k-th dynamical degree of ϕ(M) is
[TABLE]
where ρ1,…,ρk are the k largest eigenvalues of M.
Now let M and N be two nonsingular integer matrices. Then we have two dominant maps, ϕ(M) and ϕ(N), both from T to T. This induces a rational correspondence on T; we call such a correspondence a monomial correspondence. Here, we compute the dynamical degrees of monomial correspondences. We show:
Theorem A.
For any two n×n integer matrices M and N with non-zero determinant, the k-dynamical degree of the correspondence (T,ϕ(M),ϕ(N)) is equal to
[TABLE]
where ρ1,…,ρk are the k largest eigenvalues of the matrix N⋅M−1.
We obtain further information on the growth of the degrees when the sequence k↦λk(f) is locally strictly log-concave.
Theorem B.
Fix two n×n integer matrices M and N with non-zero determinant and take f the monomial correspondence f:=(T,ϕ(M),ϕ(N)). Suppose that λl2(f)>λl+1(f)λl−1(f) for an integer 1⩽l⩽n, then there exists a constant C>0 and an integer r such that
[TABLE]
We find an appropriate toric compactification Y on which the pullback on the 2k cohomology is functorial (i.e (fp)∗=(f∗)p on H2k(Y(C)) for an embedding of K into C). We say that f is k-stable when this happens.
Theorem C.
Fix two n×n integer matrices M and N with non-zero determinant and take f the monomial correspondence f:=(T,ϕ(M),ϕ(N)).
Suppose that the eigenvalues of the matrix NM−1 are all real, distinct and positive. Then there exists a projective toric variety whith at worst quotient singularities on which f is algebraically k-stable.
Finally, we describe the monomial correspondences by computing these invariants using arithmetic tools.
Recall that given an ample divisor D on Pn, one can associate a function hD:Pn(Q)→R+ called a Weil height.
These heights are essential to understand rational points and integral points on algebraic varieties. More precisely, they are used to count the asymptotic growth of rational points [Sch79], to characterize torsion points on abelian varieties [Né65, Tat74] and to obtain equidistribution results in algebraic dynamics [SUZ97, Yua08, DM17] and to study stability properties of algebraic families of one dimensional maps [MZ10, BD11, DeM16, DWY16, FG18].
In our setting, we fix an embedding from T into Pn so that we get an injection from T(Q) in Pn(Q). Any monomial map or correspondence is regular on the torus T, as are all its iterates, so the indeterminacy locus on any compactification X is supported on the boundary X∖T. Thus if x is a point in T(Q), its image by a monomial correspondence is a well-defined cycle of dimension [math], i.e a finite number of T(Q) points counted with multiplicities ∑ai[xi] for ai∈Z,xi∈T(Q). We define the height of the image as the sum ∑aihD(xi).
Take f:=(T,ϕ(M),ϕ(N)) a monomial correspondence with M,N two matrices with integer entries and fix a x a point in T(Q). We define the arithmetic degree of x as the following asymptotic limit:
[TABLE]
In [KS16a], Kawaguchi and Silverman defined this quantity and conjectured that when f is dominant rational map and when x is a rational point whose orbit is Zariski dense, the quantity αf(x) is equal to the first dynamical degree of f.
Theorem D.
Suppose that the field K=Q is the field of algebraic numbers.
Fix two n×n integer matrices M and N with non-zero determinant and take f the monomial correspondence f:=(T,ϕ(M),ϕ(N)). Then for any point x∈T(Q), the quantity αf(x) is finite and belongs to the set
[TABLE]
where each ρi is an eigenvalue of N⋅M−1.
Let us explain how we can obtain these four results. Fix M,N two n×n integer matrices with non-zero determinant.
Our approach relies on a very simple observation: mainly, by post-composing by the monomial map associated to the matrix det(M)pId, we obtain the following diagram:
[TABLE]
where Γp is the correspondence associated to gp, TCom(M) is the transpose of the cofactor matrix of M, P is the matrix TCom(M)⋅N, and T is the torus Kn.
This diagram allows us to transport the dynamical properties of the monomial map induced by P with the dynamics of the monomial correspondence.
We finally conclude using Favre-Wulcan’s [FW12], Lin-Wulcan’s results [LW14], and Silverman’s result [Sil14] to prove Theorem A, B, C and D respectively.
To pursue the study of these particular correspondences, it is natural to ask whether we can relate the entropy of such correspondence with their dynamical degrees as in the rational setting ([HP07]). Precisely, we formulate the following question.
Question 0.1**.**
Take M and N two n×n integer matrices with non-zero determinant. Is the topological entropy of a monomial correspondence f=(T,ϕ(M),ϕ(N)) equal to
[TABLE]
Once this question is answered, then one would wish to understand the ergodic properties of our correspondences and construct interesting measures for this class of correspondences similar to the approach of [Gue05] for rational maps and to [DS06, Theorem 1.3], mainly:
Question 0.2**.**
When all the iterates of the monomial correspondence are irreducible, is there a measure of maximal entropy and can we compute its Hausdorff dimension?
Structure of the paper
In §1 we review the background on correspondences, degrees and dynamical degrees. Following this, we prove successively in §2 Theorem A,B,C and D.
Acknowledgements
The first author is grateful to Eric Bedford and Mikhail Lyubich for their support on this project, both authors thank Mattias Jonsson for his encouragements and the second author thanks Melody Chan for useful conversations.
1. Background
1.1. Rational
correspondences
A
rational correspondence from X to Y is a multi-valued map to Y
defined on a dense open set of X. When K is the field of complex numbers, they are also called meromorphic multi-valued maps.
Definition 1.1**.**
Let X and Y be irreducible quasiprojective varieties. A
rational correspondencef=(Γf,πX,πY):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@setlinewidth0.32pt\pgfsys@setdash0.0pt\pgfsys@roundcap\pgfsys@roundjoin\pgfsys@moveto-1.19998pt1.59998pt\pgfsys@curveto-1.09998pt0.99998pt0.0pt0.09999pt0.29999pt0.0pt\pgfsys@curveto0.0pt-0.09999pt-1.09998pt-0.99998pt-1.19998pt-1.59998pt\pgfsys@stroke\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureY is a diagram
{\Gamma_{f}}$${X}$${Y}$$\pi_{X}$$\pi_{Y}
where Γf is a quasiprojective variety, not necessarily
irreducible, and the restriction of πX to every irreducible
component of Γf is dominant and generically finite. We say that the variety Γf is the graph of the correspondence f.
Over some dense open set in X, πX is an étale map (over C, a covering map), and
πY∘πX−1 defines a multi-valued map to Y. We define the domain of definition of g to be the largest such open set of X, However,
considered as a multi-valued map from X to Y, it is possible
that πY∘πX−1 has indeterminacy, since some fibers of
πX may be empty or positive-dimensional.
Example 1.2**.**
Let f:X→Y be a rational map. Set Γf to be the graph of f, i.e. the set (x,f(x))∈X×Y, and set πX and πY to be the natural projection maps from Γf to X and Y respectively. Then (Γf,πX,πY):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureY is a rational correspondence, that happens to be generically single-valued. Thus any rational map can be thought of as a rational correspondence.
Example 1.3**.**
Let ϕ be an orientation-preserving branched covering from S2 to itself, such that every critical point of ϕ has finite forward orbit. Thurston [DH93] described a pullback map induced by ϕ on the Teichmüller space of complex structures of S2 marked at the post-critical locus of ϕ; Koch [Koc13] showed that Thurston’s pullback map descends to a correspondence on the moduli space M0,n of configurations of n points on P1. These correspondences are called Hurwitz correspondences and have been studied in [Ram18, Ram19].
Example 1.4**.**
Recall from that the modular surface X0:=SL2(Z)//H defined as the left quotient of the hyperbolic plane by SL2(Z) is isomorphic to C.
We can thus view X0 as an algebraic Riemann surface, whose compactification is the Riemann sphere.
The Hecke operator of weight n is a morphism on the free abelian group generated by the rank two lattices of R2 such that for any lattice Λ in R2, the image T(n)(Λ) is defined as:
[TABLE]
Since X0 is the quotient of the space of rank 2 lattices of R2 up to a scaling by [Ser73, VII §2.2 Proposition 3], the map T(n) descends to a correspondence on X0.
Definition 1.5**.**
Suppose f=(Γf,πX,πY):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureY and
g=(Γg,πY′,πZ′):Y\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureZ are rational correspondences such
that the image under πY of every irreducible component of
Γf intersects the domain of definition of the multi-valued map
πZ′∘(πY′)−1. The compositeg∘f is a rational correspondence from X to Z
defined as follows.
Pick dense open sets UX⊆X and UY⊆Y such
that πY(πX−1(UX))⊆UY, and
πX∣πX−1(UX) and πY′∣(πY′)−1(UY) are
both étale. Set
[TABLE]
where π1 and π2 are the natural maps to X and Z respectively.
This composite does depend on the choices of open sets UX and
UY, but is well-defined up to conjugation by a birational transformation.
1.2. Pullback on numerical groups by correspondences
Fix X a normal projective compactification of X.
We now recall how these correspondences induce a natural action on the numerical groups of k-cycles.
When K is the field of complex numbers and X is smooth, then one can consider Γf the desingularization of a compactification of the correspondence f=(Γf,π1,π2):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureX. One can pull back smooth forms along π2; this induces a linear map π2∗:H2k(X)→H2k(Γf) on de Rham cohomology groups. Also, one can push forward homology classes along π1, obtaining a map π1∗:H2n−2k(Γf)→H2n−2k(X). Finally, since X and Γf are smooth oriented compact manifolds, Poincaré duality induces identifications PDΓf:H2k(Γf)≃H2n−2k(Γf) and PDX:H2k(X)≃H2n−2k(X). We may compose pullback, pushforward, and Poincaré duality maps to obtain a pullback along the correspondence f:
[TABLE]
In order to be able to work over an arbitrary algebraically closed field of characteristic zero, we replace the de Rham cohomology by abelian groups called numerical groups. We first introduce the general terminology on these groups.
A k-cycle on X is a formal linear combination of subvarieties ∑ai[Vi] where ai are real numbers and where Vi are subvarieties of X. The group of k-cycles on X is denoted Zk(X). The rational equivalence classes of k-cycles form the group Ak(X).
In [Ful98, Chapter 3], Fulton introduces the Chern classes of a vector bundle E on X of degree k as operators from Al(X)→Al−k(X). Chern classes can be composed and a product of Chern classes α of degree k is said to be numerically equivalent to zero if the intersection (α⋅z) is equal to zero for any k-cycle z. The numerical group of codimension k of X, denoted Nk(X) is the abelian group generated by product of Chern classes of degree k modulo the numerical equivalence relation.
Dually, we denote by Nk(X) the quotient of the abelian group of k-cycles on X by the group generated by cycles z∈Zk(X) satisfying (α⋅z)=0 for any product of Chern classes of degree k.
When X is smooth or has at worst quotient singularities, then the two groups Nk(X) and Nn−k(X) are isomorphic and the isomorphism is realized by intersecting with the fundamental class [X].
Classes in Nk(X) can be pulled back and conversely classes in Nk(X) can be pushed forward.
Definition 1.6**.**
Suppose f=(Γf,π1,π2):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureX is a rational correspondence, and X is a normal projective variety birational to X. Take a desingularization Γf of some compactification of Γf with the property that π1 and π2 are regular maps on Γf.
The pullback map on the numerical groups, denoted f∙:Nk(X)→Nn−k(X) is given by the following intersection product:
[TABLE]
where α is a class in Nk(X).
1.3. Dynamical degrees
Definition 1.7**.**
Let dimX=n, and let f=(Γf,π1,π2):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureX be a rational
correspondence. Fix a smooth projective compactification X of X, a projective compactification and D an ample divisor class on X. Now pick a projective compactification Γf of Γf such that both maps π1,π2:Γf→X are regular. Now, for k=0,…,n, the k-degree of f with respect to D is the intersection number on Γf:
[TABLE]
Note that while this intersection number very much does depend on the choices of X and D, by the projection formula, it is independent of the choice of compatible compactification Γf.
Definition 1.8**.**
Let f=(Γf,π1,π2):X\leavevmodeto16.67pt\vboxto8.61pt\pgfpicture\makeatletter\lower-4.30554ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash3.0pt,3.0pt0.0pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.010.00002pt0.0pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto9.54002pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.0pt-3.98337pt\pgfsys@lineto9.54002pt-3.98337pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.09.54002pt-3.98337pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpictureX be a rational
correspondence such that the restriction of π2 to every
irreducible component of Γf is dominant. In this case we say
f is a dominant rational self-correspondence.
Definition 1.9**.**
Let Γf be as in Definition 1.8. Let fp=f∘…∘f (p times). Pick any normal projective variety X birational to X and fix D an ample divisor class on X. The kth
dynamical degreeλk(f) of Γf is defined to be
[TABLE]
This limit exists and does not depend on the
choice of the normal projective variety X birational to X nor on the choice of the ample divisor D. Moreover, the sequence k↦λk(f) is log-concave and we shall refer to [TT16] for the general properties of these quantities.
1.4. Monomial correspondences
Fix n>0 and let T be the torus (K∗)n.
Recall that any (n×n) matrix M=(Mij) with integer entries defines a morphism (homomorphism) ϕ(M) on T defined by:
[TABLE]
We have: ϕ(M⋅N)=ϕ(M)∘ϕ(N). Also, ϕ(M) is dominant if and only if M is non-singular (i.e. has non-zero determinant); in which case ϕ(M) is étale of degree det(M). A monomial correspondence is any correspondence on the torus T that given by (T,ϕ(M),ϕ(N)) where M,N are matrices with integer entries, and M is non-singular. The correspondence (T,ϕ(M),ϕ(N)) is dominant if and only if N is non-singular as well.
Example 1.10**.**
Let n=1, so T is the one-dimensional torus K∗. Let M=N=[2], so both ϕ(M) and ϕ(N) are the squaring map z↦z2. Here, we compute explicitly the second iterate g2 of the correspondence g=(T,ϕ(M),ϕ(N)).
For clarity, we use different coordinates on each copy of T — we include the coordinate as a subscript. We have the following commutative diagram:
[TABLE]
The fibered product Tϕ(N)×ϕ(M)T is, explicitly the subset {(x,y)∈T2∣x2=y2}, i.e. the union of two lines L1={(x,y)∈T2∣x=y} and L2={(x,y)∈T2∣x=−y}. Thus the second iterate g2 is the correspondence: ((L1)x⊔(L2)x,x↦x2,x↦x2), which can be thought of as a ‘union’ of two monomial correspondences but isn’t one itself. Observe that the graph of g2 is reducible; in contrast, the graph of a monomial correspondence is required by the definition to be a torus, thus irreducible.
2. Dynamics of monomial correspondences
While the composition of monomial maps ϕ(M) and ϕ(N) is itself a monomial map, namely ϕ(M⋅N), the composition of two monomial correspondences may not be monomial. Also, for a fixed monomial correspondence (T,ϕ(M),ϕ(N)), its iterates may not be monomial, see Example 1.10 above. The essential ingredient to understand the iterates of monomial correspondences is the following lemma, which relates the dynamical behavior of the monomial correspondence (T,ϕ(M),ϕ(N)) to the dynamical behaviour of ϕ(N⋅TCom(M)), where TCom(M) is the transpose of the cofactor matrix of M.
Lemma 2.1**.**
Fix two n×n integer matrices M and N, both with non-zero determinant and take f to be the monomial correspondence f:=(T,ϕ(M),ϕ(N)) and P=N⋅TCom(M) where TCom(M) is the transpose of the cofactor matrix of M.
For any integer p⩾n, the following diagram is commutative:
[TABLE]
where fp:=(Γp,up,vp) denotes the p-th iterate of f.
Proof.
We induct on p. Throughout, we use the facts that ϕ(A⋅B)=ϕ(A)∘ϕ(B), and that a scalar matrix (in particular det(M)Id) commutes with all matrices, so ϕ(det(M)Id commutes with all monomial maps.
Base Case:p=1. Then (Γp,up,vp)=(T,ϕ(M),ϕ(N)). So
[TABLE]
Inductive Hypothesis: For some p>0, ϕ(Pp)∘up=ϕ(det(Mp)Id)∘vp.
Inductive Step: We have the following commutative digram:
[TABLE]
Here, the square is Cartesian, up+1=ϕ(M)∘x, and vp+1=vp∘y.
Now, we post-compose vp+1 by ϕ(det(M)p+1Id) to obtain:
[TABLE]
Here, the second equality follows from the inductive hypothesis and the third equality follows from the commutativity of the Cartesian square.
∎
2.1. Dynamical degree of monomial correspondences
Theorem 2.2**.**
Fix two n×n integer matrices M and N, both with non-zero determinant, and take f to be the monomial correspondence f:=(T,ϕ(M),ϕ(N)). Denote by P=N⋅TCom(M) where TCom(M) is the transpose of the cofactor matrix of M.
For any toric compactification X of T, for any integer p⩾1 and for any integer l⩽n, the following equality holds on Nl(X)⊗Q:
[TABLE]
Proof.
Fix a toric compactification X of T. We observe that for any scalar matrix aId, the map ϕ(aId) is a regular morphism on X and that the pullback satisfies:
[TABLE]
on Nl(X).
Thus the morphism ϕ(det(M)pId) on T induces a regular morphism on X and the pullback satisfies:
[TABLE]
on Nl(X).
As a result, we have the following equality on Nl(X)⊗Q
[TABLE]
By Lemma 2.1, for any integer p, the following diagram is commutative:
[TABLE]
where P=N⋅TCom(M). Note that up and vp are étale of degrees ∣det(M)∣p and ∣det(N)∣p respectively. First, we choose a birational modification π:X~→X so that the map ϕ~(Pp):X~→X induced by ϕ(Pp) is regular. Then, we choose a compactification Γp of Γp so that the map induced by up and vp from Γp to X are regular, and the map u~p:Γp→X~ is also regular. We thus obtain the following commutative diagram:
[TABLE]
Note that u~p as a map from Γp to X~ is generically finite of degree ∣det(M)∣p. Thus, on Nl(X~)⊗Q, we have that (u~p)∗∘u~p∗=∣det(M)∣pId. By the above diagram and (3), we compute the pullback (fp)∙ on Nl(X)⊗Q:
[TABLE]
where the second-to-last equality follows from the fact that (u~p)∗∘u~p∗=∣det(M)∣pId.
∎
From the behavior of the corresponding monomial map associated to the correspondence on the numerical groups, we deduce Theorem A.
2.2. Proof of Theorem A
Let X be any toric compactification of T and P=N⋅TCom(M). For any integer p>0, Theorem 2.2 asserts that:
[TABLE]
on Nl(X)⊗Q.
We fix a norm ∣∣⋅∣∣ on Nl(X)⊗Q and compute the l-dynamical degree of the correspondence using the formula:
[TABLE]
The previous expression thus gives:
[TABLE]
Let ρ1′,…,ρl′ be the l largest eigenvalues (in absolute value, and counted with multiplicity) of the matrix P=N⋅TCom(M)=det(M)⋅N⋅M−1. Let ρ1,…,ρl be the l largest eigenvalues of the matrix N⋅M−1. Then ρi′=det(M)⋅ρi. By [FW12, Lin12] applied to the monomial map associated to P, we have:
[TABLE]
Remark 2.3*.*
It follows immediately from the projection formula that for a general correspondence (Γ,π1,π2) on an n-dimensional variety, the l-th dynamical degree of (Γ,π1,π2) is equal to the (n−l)-th dynamical degree of (Γ,π2,π1). The following computation provides a sanity-check for Theorem A: Let ρ1,…,ρn be the eigenvalues of N⋅M−1, arranged so that the sequence of absolute values is non-increasing. Then ρn1,…,ρ11 are the eigenvalues of M⋅N−1, again arranged so that the sequence of absolute values is non-increasing. We note that:
[TABLE]
2.3. Proof of Theorem B
Fix a monomial correspondence f:=(T,ϕ(M),ϕ(N)) for M,N∈GLn(Z) whose l-dynamical degree satisfies the condition:
[TABLE]
Using Theorem A, this condition implies that:
[TABLE]
where P is the matrix N⋅TCom(M). This prove that ϕ(P) satisfies the conditions of [FW12, Theorem D], hence the asymptotic growth of the l-degree of ϕ(P) is given by:
[TABLE]
as p→+∞ where r is an integer.
Using Theorem 2.2 and the fact that λl(f)∣det(M)∣l−1=λl(ϕ(P)), we deduce that:
[TABLE]
and the theorem is proved.
2.4. Proof of Theorem C
Fix f=(T,ϕ(M),ϕ(N)) a monomial correspondence where M,N are two matrices in GLn(Z) such that the eigenvalues of the matrix NM−1 are all real, distinct and positive. This implies that the eigenvalues of the matrix P=N⋅TCom(M) also satisfy the assumption of the theorem.
By [LW14, Theorem A], we can find a toric compactification X of the torus T, with at worst quotient singularities, on which the monomial map ϕ(P) is k-stable. Using Theorem 2.2 we deduce that that the k-stability of ϕ(P) on X implies the k-stability of the correspondence f on X, i.e. we have on Nl(X)⊗Q:
[TABLE]
2.5. Proof of Theorem D
We fix an embedding of T into Pn.
Fix also an integer p⩾1 and denote by (Γp,up,vp) the p-th iterate of the correspondence f.
By Lemma 2.1, we can find a toric compactification Γp of Γp such that the following diagram is commutative:
[TABLE]
Fix D an ample divisor in Pn, a point x∈T(Q) and denote by hD the Weil-height associated to D.
Observe that since ϕ(det(M)pId) is the map that raises each homogenous coordinate of Pn to its det(M)p-th power, we have:
[TABLE]
for any point x∈T(Q).
As a result, we compute the height of the image of the point x∈T(Q) as:
[TABLE]
As the above diagram is commutative, we thus obtain:
[TABLE]
As the cycle up∗up∗[x] equals ∣det(M)∣p[x], we deduce that:
is well-defined and belongs to the set {1,∣ρ1∣,∣ρ2∣,…,∣ρn∣} where each ρi is an eigenvalue of P and the result is proved.
Remark 2.4*.*
Observe that the Zariski density for the orbit of the monomial correspondence f=(T,ϕ(M),ϕ(N)) does not imply the Zariski density of the orbit of ϕ(P) where P=N⋅TCom(M). One can take for example the case where M=2Id, N=Id and T=C∗. The correspondence f=(T,ϕ(M),ϕ(N)) is the “square root” correspondence, i.e. f(z)={+(z),−(z)}. Consider the point z0=1∈T: its orbit under f is the set {z∈Q∣z(2k)=1}, thus Zariski dense. However, under the monomial map ϕ(P)=z↦z2, the orbit of z0 is {z0}, not Zariski dense.
As a result, one cannot directly apply Silverman’s result to prove that a point x∈T(Q) whose orbit for f is Zariski dense satisfies αf(x)=λ1(f). This later statement is often refered to as Kawaguchi-Silverman’s conjecture ([KS16b])
Bibliography58
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BC 16] Jérémy Blanc and Serge Cantat, Dynamics of birational transformations of projective surfaces , Journal of the American Mathematical Society 29 (2016), 415–471.
2[BD 11] Matthew Baker and Laura De Marco, Preperiodic points and unlikely intersections , Duke Math. J. 159 (2011), no. 1, 1–29. MR 2817647
3[BD 15] Jérémy Blanc and Julie Déserti, Degree growth of birational maps of the plane , Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 14 (2015), no. 2, 507–533. MR 3410471
4[BDJ 19] Jason P. Bell, Jeffrey Diller, and Mattias Jonsson, A transcendental dynamical degree , ar Xiv preprint ar Xiv:1907.00675 (2019).
5[BK 08] Eric Bedford and Kyounghee Kim, Linear recurrences in the degree sequences of monomial mappings , Ergodic Theory Dynam. Systems 28 (2008), no. 5, 1369–1375. MR 2449533
6[BS 92] Eric Bedford and John Smillie, Polynomial diffeomorphisms of ℂ 2 superscript ℂ 2 \mathbb{C}^{2} . III. Ergodicity, exponents and entropy of the equilibrium measure , Math. Ann. 294 (1992), no. 3, 395–420. MR 1188127
7[Can 11] Serge Cantat, Sur les groupes de transformations birationnelles des surfaces , Ann. of Math. (2) 174 (2011), no. 1, 299–340. MR 2811600
8[CD 18] Dominique Cerveau and Julie Déserti, Birational maps preserving the contact structure on ℙ ℂ 3 subscript superscript ℙ 3 ℂ \mathbb{P}^{3}_{\mathbb{C}} , J. Math. Soc. Japan 70 (2018), no. 2, 573–615. MR 3787733