Multiplier rigidity for complex Hénon maps

This paper establishes that complex Hénon maps of a fixed degree are determined up to finitely many choices by their multiplier spectra, extending McMullen's classical rigidity theorem to higher dimensions by proving the nonexistence of stable algebraic families through precise asymptotic bounds on Lyapunov exponents.

The Gist

Imagine you have a magical, infinite kaleidoscope. Every time you twist it, the pattern inside changes. Now, imagine you are a detective trying to figure out exactly how you twisted the kaleidoscope just by looking at the final pattern.

This paper, written by Serge Cantat and Romain Dujardin, is about solving that detective puzzle for a specific type of mathematical "kaleidoscope" called a Complex Hénon Map.

Here is the breakdown of their discovery, translated into everyday language.

1. The Mystery: Can You Identify the Map?

In the world of math, these maps are like complex machines that take a point in space, twist it, stretch it, and send it somewhere else. If you run this machine over and over, the points either fly off to infinity or get trapped in a chaotic, beautiful mess called a Julia set (think of it as the "fingerprint" of the machine).

The big question the authors ask is: If I give you a list of the "speeds" (called multipliers) at which the machine repeats its patterns, can you figure out exactly what the machine looks like?

• The Analogy: Imagine a drum. If you hit it, it vibrates at specific frequencies (notes). If I tell you the exact list of notes this drum makes, can you tell me its size, shape, and material?
• The Result: The authors say YES. For these specific 2D machines, the list of "notes" (the multiplier spectrum) is almost enough to rebuild the machine. There might be a tiny handful of look-alikes, but for the vast majority of cases, the list of notes uniquely identifies the machine.

2. The "Fingerprint" vs. The "Blueprint"

Usually, to describe a machine, you need to know its blueprint (its exact formula). But the authors found that you don't need the blueprint. You just need the fingerprint.

• The Fingerprint: This is the collection of all the "speeds" at which the machine's repeating cycles happen.
• The Discovery: They proved that if two machines have the exact same fingerprint, they are essentially the same machine, just maybe rotated or shifted slightly. You can't have two completely different machines that produce the exact same list of repeating speeds.

3. The "Stability" Problem: Why Don't They Change?

To prove this, the authors had to tackle a tricky concept called Stability.

• The Analogy: Imagine a family of identical twins. If you tweak one twin's diet slightly, their face might change a little. But if you tweak them too much, they might look completely different.
• The Math Problem: The authors asked: "If we have a whole family of these machines, and they all share the same fingerprint, can they change into different shapes without changing their fingerprint?"
• The Answer: No. They proved that if a family of these machines is "stable" (meaning their behavior doesn't suddenly jump or break), they cannot actually change at all. They are stuck in one specific shape. If they tried to change, their "fingerprint" would have to change too.

This is like saying: "If a group of people all sing the exact same song perfectly, and they are a 'stable' choir, they must all be standing in the exact same spot. They can't move around without messing up the song."

4. The Secret Weapon: The "Lyapunov Exponent"

How did they prove that the machines can't change? They used a tool called the Lyapunov Exponent.

• The Analogy: Think of the Lyapunov Exponent as a speedometer for chaos. It measures how fast two points that start very close together will fly apart as the machine runs.
  • Low speed = The machine is calm and predictable.
  • High speed = The machine is wild and chaotic.
• The Insight: The authors discovered a deep connection between the "notes" (multipliers) and the "speedometer" (Lyapunov exponent).
  • If the machine tries to change its shape (degenerate), the speedometer goes crazy (goes to infinity).
  • But, if the "notes" (multipliers) stay the same, the speedometer must stay within a certain range.
  • The Contradiction: You can't have the notes stay the same while the speedometer goes crazy. Therefore, the machine cannot change its shape. It is "rigid."

5. The "One-Dimensional" vs. "Two-Dimensional" Twist

There is a famous result in math for 1D machines (like simple polynomials) that says this rigidity holds true. The authors asked: "Does this work for 2D machines (like Hénon maps)?"

• The Challenge: 2D is much more complicated. It's like trying to balance a spinning plate on a stick (1D) versus balancing a spinning plate on a stick while walking on a tightrope (2D).
• The Breakthrough: They found that it does work, but with a few extra rules. You have to fix a few specific settings (like the "Jacobian," which is like the machine's internal tension) to make the rigidity hold. Once those are fixed, the 2D machine is just as rigid as the 1D one.

Summary: What Does This Mean?

This paper is a victory for Rigidity.

In a world where things are usually fluid and changeable, the authors found a class of mathematical objects that are frozen in place by their own internal rhythms. If you know the rhythm (the multipliers), you know the object. You can't sneakily alter the object without changing the rhythm.

In simple terms:
If you know the exact sequence of beats a complex machine makes, you know exactly what that machine is. You can't build a different machine that plays the exact same song. The song defines the machine.

Technical Summary

Here is a detailed technical summary of the paper "Multiplier Rigidity for Complex Hénon Maps" by Serge Cantat and Romain Dujardin.

1. Problem Statement and Context

The paper addresses the multiplier rigidity problem for polynomial automorphisms of $\mathbb{C}^2$. The central question is whether a dynamical system in a specific class is uniquely determined (up to a finite number of choices) by the multipliers (eigenvalues of the derivative) of its periodic orbits.

• Background: In one-dimensional complex dynamics (rational maps), this problem was famously settled by McMullen, who showed that stable algebraic families of rational maps are trivial. This implies that a map is determined by its multiplier spectrum.
• The Gap: For polynomial automorphisms of $\mathbb{C}^2$ (specifically Hénon maps and their compositions), the problem remained open. While Friedland and Milnor established a normal form for these maps, the relationship between the multiplier spectrum and the conjugacy class was not fully understood, particularly regarding the necessity of fixing the Jacobian determinant.
• Goal: To prove that a complex Hénon map (or a composition of such maps) is determined up to finitely many choices by its trace spectrum (sums of eigenvalues) or its unstable multiplier spectrum (the expanding eigenvalues of saddle periodic points).

2. Methodology

The authors employ a strategy analogous to McMullen's approach in one dimension but adapted to the two-dimensional setting. The core logic follows this chain:

1. Reduction to Stability: Prove that if a map is determined by its spectrum, then any algebraic family of maps sharing the same spectrum must be "stable" in a dynamical sense.
2. Triviality of Stable Families: Prove that any stable irreducible algebraic family of Hénon maps is trivial (i.e., consists of a single conjugacy class).
3. Lyapunov Exponent Divergence: The proof of triviality relies on showing that in a non-trivial algebraic family, the Lyapunov exponents of the maximal entropy measure must diverge (grow unbounded) as the parameters go to infinity. If the family were stable, these exponents would have to remain constant, leading to a contradiction unless the family is bounded (and thus finite).

Key Technical Tools:

• Friedland-Milnor Normal Form: Decomposing loxodromic automorphisms into compositions of elementary Hénon maps $h_i(x,y) = (a_i y + p_i(x), x)$.
• Green Functions and Böttcher Coordinates: Analyzing the asymptotic behavior of the Green functions $G_f$ and the associated Böttcher coordinates $\phi_f$ to control the geometry of the Julia set.
• Crossed Mappings: Utilizing the theory of crossed mappings (introduced by Hubbard and adapted by Dujardin) to study the interaction between the map and bidisks in $\mathbb{C}^2$.
• Critical Measure Analysis: Using the Bedford-Smillie formula for Lyapunov exponents, which relates $\chi_+(\mu_f)$ to the distribution of critical points of the underlying polynomials.

3. Key Contributions and Results

A. Main Rigidity Theorems

The paper establishes the following main results:

• Theorem A (Hénon Maps): A complex Hénon map $f(x,y) = (ay + p(x), x)$ of a given degree is determined up to finitely many choices by its trace spectrum (or unstable multiplier spectrum).
  • Significance: This holds even without fixing the Jacobian $a$. A generic Hénon map is uniquely determined by its spectrum up to conjugacy.
• Theorem B (Compositions): For a composition of Hénon maps $f = h_k \circ \dots \circ h_1$, the conjugacy class is determined up to finitely many choices by its multidegree, multi-Jacobian, and trace/unstable multiplier spectrum.
• Theorem C (Local and Global Rigidity):
  • The $C^1$ conjugacy class of a Hénon map (or composition) with fixed degree (and multi-Jacobian) is finite.
  • If two maps are $C^1$ conjugate near their Julia sets and sufficiently close, they are identical.

B. Structural Stability and Triviality

• Theorem D: Any stable irreducible algebraic family of complex Hénon maps is trivial. The same holds for compositions of Hénon maps provided the multi-Jacobian is fixed.
  • Note: The assumption of a fixed multi-Jacobian is crucial for compositions. The authors provide examples showing that if the Jacobian is allowed to vary, the connectedness locus may not be compact, and rigidity can fail.

C. Asymptotic Bounds on Lyapunov Exponents

The technical heart of the paper is Theorem E, which provides precise asymptotic bounds for the Lyapunov exponents $\chi_+(\mu_f)$ of the maximal entropy measure $\mu_f$.

• Let $M(f)$ be a quantity related to the maximal escape rate of the polynomials in the normal form of $f$.
• Theorem E: There exist constants $C_1, C_2$ such that for maps with large $M(f)$:
  $$C_1 M(f) \leq \chi_+(\mu_f) \leq C_2 M(f)$$
• This result generalizes the Manning-Przytycki formula from one-dimensional dynamics to the two-dimensional Hénon setting. It proves that as the parameters of the map diverge (making the map "large"), the Lyapunov exponent grows linearly with the "size" of the map.

D. Special Cases and Counterexamples

• Jacobian $\neq -1$: The authors provide a direct proof using Huguin's theorem (from 1D dynamics) showing that for Hénon maps with Jacobian $\neq -1$, the multipliers of period 1 and 2 points are sufficient to determine the map.
• Jacobian $= -1$: The case of Jacobian $-1$ is more subtle. The paper constructs a non-trivial family of Hénon maps with Jacobian $-1$ where the period 1 and 2 traces are constant, demonstrating that Huguin's method fails here. The general proof (Theorem A) is required to handle this case.
• Characteristic $p$: The paper notes that these rigidity results do not hold in positive characteristic, providing a counterexample involving additive automorphisms.

4. Significance and Impact

1. Extension of McMullen's Theorem: This work successfully extends the landmark rigidity results of McMullen from rational maps on $\mathbb{P}^1$ to polynomial automorphisms on $\mathbb{C}^2$, a significantly more complex dynamical setting.
2. Spectral Characterization: It establishes that the "spectral data" (multipliers) is a powerful invariant for Hénon maps, effectively classifying them up to finite ambiguity. This resolves a long-standing question in the field of complex dynamics.
3. New Analytic Tools: The development of precise asymptotic bounds for Lyapunov exponents in terms of the escape rate $M(f)$ for compositions of Hénon maps is a major technical achievement. It bridges the gap between the geometry of the parameter space and the ergodic properties of the maps.
4. Compactness of Connectedness Loci: The results imply the compactness of the connectedness locus (the set of maps with connected Julia sets) within the space of compositions with fixed multi-Jacobian, a fundamental structural property of the parameter space.

In summary, Cantat and Dujardin prove that the spectral fingerprint of a complex Hénon map is sufficient to reconstruct the map (up to finite choices), relying on a deep analysis of the divergence of Lyapunov exponents in degenerating families.