Analytic symplectomorphisms displaying minimal ergodicity on the sphere, cylinder and disk

This paper constructs analytic symplectomorphisms on the sphere, disk, and cylinder that exhibit minimal ergodicity with exactly three ergodic measures by generalizing a principle introduced by Berger based on the Anosov-Katok approximation by conjugacy method.

The Gist

Imagine you have a magical, frictionless playground. This playground can be shaped like a sphere (like a beach ball), a cylinder (like a soda can), or a disk (like a coin).

On these surfaces, you can slide objects around without losing any energy or changing the total area they cover. In math, these sliding rules are called symplectomorphisms.

For a long time, mathematicians wondered: Can we create a specific set of sliding rules that are perfectly "analytic" (meaning they follow a smooth, predictable mathematical formula everywhere, with no jagged edges or breaks) and yet behave in a very specific, chaotic way?

Specifically, they wanted to know if we could make a system where the movement is so organized that the entire surface breaks down into exactly three distinct "zones of behavior" (called ergodic measures).

This paper, written by Yann Delaporte, says "Yes, we can."

Here is the story of how he did it, explained through simple analogies.

1. The Problem: The "Rough" vs. The "Smooth"

Imagine you are trying to paint a perfect, smooth mural on a curved wall.

• The Old Way (Smooth but not Analytic): You can use a rough brush to get the general shape right. You can make the paint flow smoothly enough that it looks good from a distance. This is what previous mathematicians did. They could create these "three-zone" systems, but the rules were "rough" (smooth but not perfectly mathematical).
• The Goal (Analytic): The challenge was to use a "laser-precise" brush. The rules had to be defined by perfect mathematical formulas (like sine waves or polynomials) that work everywhere, even right up to the very edge of the wall.

The problem is that when you try to combine these perfect formulas to create complex movements, the "precision" often breaks down near the edges. It's like trying to stack perfect glass bricks; eventually, the stack becomes unstable near the top or bottom.

2. The Tool: The "Lego" Method (Approximation by Conjugacy)

To build these complex movements, mathematicians use a technique called Approximation by Conjugacy (AbC).

Think of it like building a complex Lego structure:

1. You start with a simple, boring rotation (spinning the whole cylinder).
2. You add a "warp" (a conjugacy) that twists the space slightly.
3. You add another rotation.
4. You add another warp.
5. You repeat this thousands of times.

With each step, the structure gets more complex. If you do this infinitely, you hope to arrive at a final, perfect structure that has the chaotic behavior you want.

The Catch: In the "rough" world, you can fix mistakes easily. In the "perfect analytic" world, every time you add a new Lego piece (a new formula), the "precision" of the previous pieces gets slightly distorted. If you aren't careful, the whole thing collapses near the edges.

3. The Innovation: The "Winding" Safety Net

The author, Yann Delaporte, realized that the old method had a blind spot. When building the Lego tower, they were ignoring the very top and bottom edges of the cylinder (or the poles of the sphere). They assumed the chaos wouldn't happen there. But for the system to be truly "minimally ergodic" (having exactly three zones), you have to control every single path an object could take, even the ones hugging the edge.

The Solution: The Bicurve
Delaporte invented a new safety net called a Bicurve.

• Imagine the cylinder is a piece of paper.
• Instead of just worrying about the top and bottom edges, he drew two wavy, winding lines (like a double helix or a twisted ribbon) that wrap around the cylinder.
• These lines divide the cylinder into three parts:
  1. The middle section.
  2. The top section.
  3. The bottom section.

By using these "winding" lines, he could control the behavior of the Lego pieces everywhere, including the tricky edges. He generalized the old "AbC" method into a new "AbC"* method.

The Analogy:
Imagine you are trying to herd three flocks of sheep (the three zones of behavior) into three separate pens.

• The old method built fences that worked great in the middle of the field but had holes near the riverbank (the edges). Sheep would escape into the river, ruining the plan.
• Delaporte's new method builds winding, flexible fences that hug the riverbank perfectly. No sheep can escape. He ensures that every single sheep, no matter where it starts, ends up in exactly the right pen.

4. The Result: The Three Zones

By using this new "winding fence" method, Delaporte proved that you can create these perfect, analytic sliding rules on a sphere, a cylinder, and a disk.

The result is a system where:

1. Zone 1: Everything in the "middle" mixes together perfectly (like milk in coffee).
2. Zone 2: Everything near the "top" stays in the top.
3. Zone 3: Everything near the "bottom" stays in the bottom.

There are no other hidden zones. The system is "minimally ergodic" because it has the absolute minimum number of distinct behaviors possible for these shapes.

Why Does This Matter?

In the real world, this helps us understand how energy moves in perfect, frictionless systems (like planets orbiting or electrons moving in a vacuum). It shows that even in a world governed by perfect, smooth mathematical laws, you can create systems that are incredibly complex and chaotic, yet strictly organized into just three distinct behaviors.

In a nutshell:
Delaporte took a difficult math puzzle about perfect, smooth movements on curved surfaces. He realized the old tools left gaps at the edges. He invented a new tool (the "winding" Bicurve) that seals those gaps, proving that you can build a perfectly smooth, mathematically precise machine that sorts everything into exactly three groups.

Technical Summary

Here is a detailed technical summary of the paper "Analytic symplectomorphisms displaying minimal ergodicity on the sphere, cylinder and disk" by Yann Delaporte.

1. Problem Statement and Context

The Core Problem:
The paper addresses the existence of analytic symplectomorphisms (area-preserving, orientation-preserving maps that are real-analytic) on the sphere ($S$), the disk ($D$), and the cylinder ($A$) that exhibit minimal ergodicity.

• Minimal Ergodicity: A dynamical system is minimally ergodic if it possesses the minimal possible number of ergodic invariant measures. For these surfaces, this number is three:
  1. The Lebesgue measure on the interior.
  2. The measure on the "upper" boundary component (or pole).
  3. The measure on the "lower" boundary component (or pole).
• The Challenge: While smooth ($C^\infty$) examples of such systems were known (e.g., by Fayad and Katok), constructing analytic examples is significantly harder. The standard Approximation by Conjugacy (AbC) method, introduced by Anosov and Katok, is a powerful tool for constructing smooth ergodic systems. However, the AbC method typically fails in the analytic category because the composition of conjugacies causes the radius of convergence of the analytic functions to shrink to zero.

Previous Work & Limitations:

• Berger (2022, 2024): Berger generalized the AbC method to the analytic setting for surfaces like the cylinder, disk, and sphere using entire functions and a specific "AbC Principle." This allowed for the construction of analytic pseudo-rotations that were either ergodic or had high "emergence" (complexity).
• The Gap: The existing AbC Principle works well for properties concerning "almost every" orbit (like ergodicity). However, minimal ergodicity requires controlling the behavior of every orbit, including those near the boundaries or poles. In Berger's original scheme, the approximation theorem relied on Runge's theorem, which leaves a "no-control area" (a neighborhood of the boundary) where the dynamics are not controlled. This uncontrolled region contains infinitely many orbits, making it impossible to guarantee minimal ergodicity (which requires specific behavior on all orbits).

2. Methodology

The author introduces a generalized framework to overcome the "no-control area" limitation of the previous AbC Principle.

A. The AbC$^\star$ Scheme

The paper generalizes the AbC scheme to the AbC$^\star$ scheme.

• Bicurves: The key innovation is the introduction of bicurves ($\gamma$). A bicurve is a pair of disjoint loops on the surface (e.g., two circles on the cylinder) that can be deformed into standard horizontal circles.
• Topology Change: Instead of controlling the map on the interior $\check{M}$ (leaving the boundary uncontrolled), the AbC$^\star$ scheme defines the topology of convergence on the complement of a bicurve's neighborhood, $M \setminus B(\gamma, \kappa)$.
• Winding Annuli: By allowing the "no-control" region to be a "winding" annulus (a neighborhood of a bicurve) rather than just the geometric boundary, the construction can encompass every orbit of the surface. This ensures that the dynamics of orbits near the poles or boundaries are controlled during the inductive construction.

B. The AbC$^\star$ Principle

The paper proves the AbC$^\star$ Principle (Theorem 2.15):

If a property $(P)$ is realizable by an AbC$^\star$ scheme in a $C^r$-topology ($0 \le r \le \infty$), then there exists an **analytic** symplectomorphism satisfying$(P)$.

Proof Strategy:

1. Approximation Theorem (Theorem 4.9): The author generalizes Berger's approximation theorem. It states that a smooth symplectomorphism can be approximated by an analytic one outside a bicurve (rather than just outside the boundary). This is achieved by "straightening" the bicurve via symplectomorphisms and applying Runge's theorem on the resulting domains.
2. Approximation Modulo Deformation (Theorem 4.29): To handle the analytic structure, the author adapts the "approximation modulo deformation" technique. At each step of the AbC$^\star$ scheme, the complex structure and symplectic form are slightly deformed.
3. Limit Convergence: The sequence of deformed structures converges to a limit complex structure and symplectic form. The limit map is analytic and symplectic with respect to these limit structures.
4. Uniqueness of Analytic Structures: Using results from [KL00], the author shows that any real analytic symplectic structure on these surfaces is unique up to analytic symplectomorphism. Thus, the constructed map is analytic with respect to the canonical structure of the sphere, disk, or cylinder.

C. Realization of Minimal Ergodicity

To prove minimal ergodicity is an AbC$^\star$-realizable property:

• The author uses the Kantorovich-Wasserstein distance ($d_K$) to quantify the distance between empirical measures and the convex hull of the desired ergodic measures ($\text{Conv}(\text{Leb}, \mu_1, \mu_{-1})$).
• A specific lemma (Lemma 3.4) constructs a symplectomorphism that pushes forward any measure $\mu_y$ (associated with a latitude) close to this convex hull, while keeping the map identity on the "outer" regions ($O(\gamma)$) defined by the bicurve.
• The scheme iteratively refines the conjugacies to ensure the limit map has exactly three ergodic measures.

3. Key Contributions

1. Generalization of the AbC Method: The paper successfully extends the AbC method to the analytic category for properties requiring control over all orbits, not just almost all. This is achieved by replacing the standard boundary neighborhoods with bicurves.
2. The AbC$^\star$ Principle: A new theorem establishing that any property realizable via an AbC$^\star$ scheme in the smooth category is also realizable in the analytic category.
3. Resolution of the "No-Control" Issue: By defining the uncontrolled region as a winding annulus (bicurve neighborhood) rather than a fixed boundary, the method ensures that no orbit is left uncontrolled, a prerequisite for minimal ergodicity.
4. Construction of Analytic Minimally Ergodic Maps: The paper provides the first construction of analytic symplectomorphisms on the sphere, disk, and cylinder that are minimally ergodic (possessing exactly 3 ergodic measures).

4. Main Results

Theorem A:
There exist minimally ergodic analytic symplectomorphisms on the cylinder, the sphere, and the disk.

• Implication: These maps are pseudo-rotations (finite number of periodic points) that are analytic, area-preserving, and possess exactly three ergodic invariant measures: the Lebesgue measure on the interior and the measures on the two boundary components (or poles).

5. Significance

• Theoretical Breakthrough: This work resolves a long-standing difficulty in dynamical systems: constructing analytic examples of systems with specific global ergodic properties (minimal ergodicity) that were previously only known to exist in the smooth ($C^\infty$) category.
• Methodological Advancement: The introduction of bicurves and the AbC$^\star$ scheme provides a robust toolkit for future research. It allows researchers to apply the powerful AbC method to problems where "almost everywhere" control is insufficient, opening the door to constructing analytic systems with more complex global orbit structures.
• Birkhoff Conjecture Context: While Berger previously disproved Birkhoff's conjecture regarding the existence of analytic ergodic pseudo-rotations on the cylinder, this paper pushes the boundary further by constructing systems with the minimal possible number of ergodic components, a much stricter condition.

In summary, Yann Delaporte's paper bridges the gap between smooth and analytic dynamics for minimal ergodicity by refining the approximation techniques of the AbC method, specifically addressing the control of boundary orbits through the novel use of bicurves.