Chabauty--Kim, finite descent, and the Section Conjecture for locally geometric sections

This paper establishes that a smooth projective curve over $\mathbb{Q}$ satisfies a local-to-global variant of Grothendieck's Section Conjecture if it fulfills Kim's Conjecture for almost all auxiliary primes, thereby providing a new computational strategy that is successfully applied to the thrice-punctured line over $\mathbb{Z}[1/2]$.

The Gist

Imagine you are a detective trying to solve a mystery in a vast, complex city called Number Theory. Your goal is to find all the "rational points" on a specific shape (a curve). These rational points are like hidden treasures that exist only at specific, neat coordinates.

However, the city is huge, and the map is incomplete. You can't just look at the whole map at once. So, you have a team of specialists, each with a different tool, trying to narrow down the search area.

This paper is about how three different detective tools relate to each other and how the authors used one tool to prove a major theory about the others.

Here is the breakdown of the paper using simple analogies:

1. The Three Detective Tools

The paper compares three different ways to find these hidden treasures (rational points):

• Tool A: The "Local Search" (Kim's Conjecture)
  Imagine you are looking at the city through a microscope. You pick a specific neighborhood (a prime number $p$) and look very closely at the points there. You use a special filter (the Chabauty–Kim method) to see which points could be the real treasures.

  • The Guess: Kim's Conjecture says that if you look closely enough in enough different neighborhoods, the list of "possible" points you find will shrink until it matches the list of "real" points exactly.

• Tool B: The "Global Filter" (Finite Descent)
  This is a more theoretical approach. Imagine you have a giant sieve (a filter) that you shake over the whole city. It catches points that pass a specific set of local tests.

  • The Guess: Stoll's Conjecture says that this sieve is perfect. If a point passes the sieve, it must be a real treasure. There are no "fake" points that slip through.

• Tool C: The "Section Conjecture" (The Big Picture)
  This is the ultimate goal. It's a famous theory by Grothendieck that says the shape of the city (its fundamental group) contains a secret code. If you can decode the "sections" (splittings) of this code, you can find every single treasure.

  • The Problem: We know that real treasures create valid codes. But do all valid codes come from real treasures? That's the big question.

2. The Big Discovery: Connecting the Dots

The authors of this paper discovered a magical bridge between these tools.

They proved that Tool A and Tool B are actually the same thing.

• If you can prove that the "Local Search" (Kim's Conjecture) works for almost all neighborhoods, then you automatically prove that the "Global Filter" (Finite Descent) works.
• Furthermore, if the "Global Filter" works, then the "Section Conjecture" (Tool C) is also true for the "local" parts of the code.

The Analogy:
Think of the "Local Search" as checking a suspect's alibi in 100 different towns. If you check 100 towns and the suspect's alibi holds up perfectly in every single one, you can be 100% sure they are who they say they are. The paper says: "If we can verify the alibi in almost all towns, we don't need to check the global database; we know the suspect is real."

3. The "Proof of Concept": The Thrice-Punctured Line

To prove their theory works, the authors had to actually do the math on a specific shape. They chose a shape called the Thrice-Punctured Line (a line with three holes cut out of it).

• The Challenge: This shape is tricky. It's like trying to find a needle in a haystack where the needle keeps changing shape.
• The Strategy: They used the "Local Search" tool (Chabauty–Kim) but upgraded it. They didn't just look at the points; they looked at the "refined" points, which is like using a higher-resolution microscope.
• The Result: They successfully calculated the "possible points" for this shape in infinitely many neighborhoods. They found that the list of "possible" points shrank down to exactly match the list of "real" points (which were just three specific numbers: 2, -1, and 1/2).

Why is this cool?
Before this, people could only check a few neighborhoods. The authors found a way to check infinitely many at once. It's like checking the alibi of a suspect in every town in the world simultaneously and proving they are innocent (or guilty) beyond a doubt.

4. The "Folklore" Connection

The paper also had to solve a side mystery. The tools they used were built on two different foundations:

1. Étale Geometry: The standard, rigorous math way.
2. Motivic Geometry: A more abstract, "dream-like" way of thinking about shapes.

The authors had to prove that these two ways of thinking are actually talking about the same thing. They showed that the "dream" (motives) and the "reality" (Galois representations) are just two different languages describing the same object. This allowed them to use the easy calculations from the "dream" world to solve hard problems in the "reality" world.

Summary: What did they achieve?

1. They connected the dots: They showed that if the "Local Search" method works, then the "Global Filter" and the "Section Conjecture" also work. This gives mathematicians a new, powerful strategy: instead of trying to solve the hard global problem directly, just solve the local problem in many neighborhoods.
2. They proved it works: They took a specific, difficult shape (the thrice-punctured line) and used this new strategy to prove that the "Section Conjecture" is true for it.
3. They opened a new door: They showed that by using "refined" math (looking deeper into the structure of the points), we can solve problems that were previously impossible.

In a nutshell: The authors built a bridge between three different mathematical theories, proved that the bridge is solid by walking across it with a specific example, and showed that this bridge leads to a solution for one of the biggest open problems in number theory.

Technical Summary

1. Problem Statement and Context

The paper addresses three major conjectures in arithmetic geometry concerning the rational and integral points on hyperbolic curves:

1. Grothendieck's Section Conjecture: Posits a bijection between rational points $X(K)$ and conjugacy classes of sections of the fundamental exact sequence $1 \to \pi_1^{\text{ét}}(X_{\bar{K}}) \to \pi_1^{\text{ét}}(X) \to G_K \to 1$.
2. Kim's Conjecture: Posits that the Chabauty–Kim method (using $p$-adic non-abelian cohomology) cuts out exactly the set of rational points $X(K)$ (or $S$-integral points $Y(\mathcal{O}_{K,S})$) within the $p$-adic points.
3. Stoll's Conjecture (Finite Descent): Posits that the finite descent obstruction is sufficient to characterize rational points via strong approximation.

The Core Problem: While the Section Conjecture remains largely open, the authors investigate the relationship between these conjectures. Specifically, they focus on the Selmer Section Conjecture, which asserts that every "Selmer section" (a section that is locally induced by a rational point at every place) is globally induced by a rational point. The paper aims to prove that if Kim's Conjecture holds for "almost all" primes, then the Selmer Section Conjecture holds.

2. Methodology

The authors employ a multi-faceted approach combining Galois cohomology, motivic theory, and explicit $p$-adic computations:

• Equivalence of Obstructions: They establish a bridge between the Selmer Section Conjecture and Stoll's Finite Descent Conjecture. Using results by Harari, Stix, and Porowski, they show that the set of Selmer sections is in bijection with the finite descent locus.
• The "Theorem of the Diagonal": They utilize a theorem (extending work by Stoll) stating that if a point in the finite descent locus projects to a specific finite set of points in $p$-adic completions for a set of primes of Dirichlet density 1, then the point must be globally rational (or $S$-integral).
• Motivic vs. Étale Comparison: A significant portion of the methodology involves reconciling two different formulations of the Chabauty–Kim method:
  • The classical étale approach (Kim, Lawrence–Venkatesh).
  • The motivic approach (Corwin, Dan-Cohen, Wewers) using the Tannakian category of mixed Tate motives.
  • The authors prove that the étale realization functor induces an isomorphism between the Tannaka groups of mixed Tate motives and mixed Tate Galois representations (after tensoring with $\mathbb{Q}_p$), allowing them to import explicit formulas from the motivic literature into the étale setting.
• Refined Chabauty–Kim: They work with the refined Chabauty–Kim method (introduced by Betts and Dogg), which imposes stricter local conditions at primes in $S$ (specifically, requiring points to reduce to specific cusps modulo $p$). This refinement is crucial for handling affine curves like the thrice-punctured line.

3. Key Contributions and Theoretical Results

Theorem A (Main Theoretical Result):
The authors prove that if the Refined Kim's Conjecture holds for a hyperbolic curve $Y$ for a set of primes $p$ of Dirichlet density 1, then the $S$-Selmer Section Conjecture holds for $Y$.

• Significance: This provides a new "computational" strategy. Instead of trying to prove the Section Conjecture directly (which is extremely hard), one can attempt to compute the Chabauty–Kim locus for infinitely many primes. If the locus equals the set of integral points for almost all primes, the Section Conjecture follows automatically.

Theorem 1.13 (Motivic-Étale Equivalence):
They prove that the étale realization functor from the category of mixed Tate motives over $\mathcal{O}_{K,S}$ to the category of mixed Tate Galois representations is an equivalence of Tannakian categories (over $\mathbb{Q}_p$). This rigorously justifies using the explicit motivic calculations of Corwin and Dan-Cohen in the context of the classical Chabauty–Kim method.

4. Computational Results and Proofs of Concept

The paper applies the theoretical framework to specific examples, yielding new proofs and cases:

Case 1: The Thrice-Punctured Line over $\mathbb{Z}[1/2]$

• Object: $Y = \mathbb{P}^1_{\mathbb{Z}[1/2]} \setminus \{0, 1, \infty\}$ with $S=\{2\}$.
• Result (Theorem B): The authors verify the Refined Kim's Conjecture for all odd primes $p$.
  • They use the polylogarithmic quotient of the fundamental group.
  • They derive explicit equations for the Chabauty–Kim locus: $\log(z) = 0$ and $\text{Li}_k(z) = 0$ for even $k \geq 2$.
  • Using properties of finite polylogarithms and $p$-adic analysis, they show that the only solution in $Y(\mathbb{Z}_p)$ is $z = -1$ (for the specific refinement condition $\Sigma=(1)$).
  • By exploiting the $S_3$-symmetry of the thrice-punctured line, they extend this to show the full locus consists exactly of the $\{2\}$-integral points $\{2, -1, 1/2\}$.
• Consequence (Theorem C): This proves the $S$-Selmer Section Conjecture for this curve. (Note: While Stix had previously proved this via different methods, this paper provides the first proof using the Chabauty–Kim strategy).

Case 2: The Thrice-Punctured Line over $\mathbb{Z}$ ($S=\emptyset$)

• Result (Theorem D): They prove the original (unrefined) Kim's Conjecture for $Y = \mathbb{P}^1_{\mathbb{Z}} \setminus \{0, 1, \infty\}$ for all primes $p$.
  • They show that for $p \geq 5$, the Chabauty–Kim locus is empty in depth $p-3$, matching the fact that $Y(\mathbb{Z}) = \emptyset$.
  • This improves upon previous results which were limited to specific primes or depths.

Case 3: Higher Genus Curves

• Result (Theorem E): For smooth projective curves $X$ of genus $\geq 2$ where the Jacobian has a factor of dimension $\geq 2$ with Mordell–Weil rank 0 and finite Tate–Shafarevich group, they show that the Chabauty–Kim locus is contained in a finite subscheme $Z$ for all good primes.
• Consequence: This implies the Selmer Section Conjecture for such curves, recovering a result of Stoll but via the Chabauty–Kim lens.

5. Significance

1. New Strategy for the Section Conjecture: The paper establishes a concrete pathway to proving the Selmer Section Conjecture. By shifting the burden to verifying Kim's Conjecture for a density-1 set of primes, it opens the door to computational verification for specific curves.
2. Unification of Methods: It successfully bridges the gap between the "motivic" Chabauty–Kim method (popularized by Corwin and Dan-Cohen) and the "étale" method (Kim's original formulation), proving they are equivalent for mixed Tate motives. This allows the community to leverage explicit motivic period calculations for étale problems.
3. Refinement Power: The paper demonstrates that the refined Chabauty–Kim method is strictly more powerful than the original method for affine curves. The original method failed to prove the conjecture for the thrice-punctured line over $\mathbb{Z}[1/2]$, whereas the refined method succeeded.
4. Computational Breakthrough: The explicit verification for the thrice-punctured line over $\mathbb{Z}[1/2]$ for all odd primes is a significant computational achievement, establishing infinitely many new cases of Kim's Conjecture.

In summary, the paper provides a robust theoretical framework linking descent obstructions to $p$-adic cohomological methods and demonstrates its viability through rigorous proofs and explicit computations on fundamental examples in arithmetic geometry.