🔢 mathematics

Unlikely intersection in higher-dimensional formal groups

This paper extends Berger's one-dimensional rigidity theorem to higher dimensions by proving that simple finite-height formal groups over $p$ -adic integers are uniquely determined by their $p$ -power torsion points, meaning any two such groups sharing infinitely many torsion points must be identical.

Original authors: Ramla Abdellatif, Mabud Ali Sarkar, Absos Ali Shaikh

Published 2026-08-04

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Ramla Abdellatif, Mabud Ali Sarkar, Absos Ali Shaikh

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Invisible Fingerprints of Numbers

Imagine you are a detective trying to identify a mysterious suspect, but you can't see their face. Instead, you only have a list of their favorite hangout spots. In the world of mathematics, specifically a field called number theory, there are objects called formal groups. Think of these not as groups of people, but as complex, invisible machines that follow very strict rules for how they combine numbers. These machines live in a strange, high-dimensional space where numbers behave differently than they do on a calculator.

To figure out what these machines look like, mathematicians look at their "torsion points." If you imagine the machine as a giant clock, torsion points are the specific moments when the hands return to zero after spinning around a certain number of times. In this paper, the authors are interested in the "p-power" torsion points—moments when the hands return to zero after spinning $p$ , $p^2$ , $p^3$ times, and so on, where $p$ is a special type of number called a prime. The big question is: If you know all these return points, can you uniquely identify the machine? For simple, one-dimensional machines, mathematicians already knew the answer was yes. But what about the more complex, multi-dimensional ones? This paper dives into that mystery, proving that even for these complicated, multi-layered machines, their "return points" are a unique fingerprint that identifies them perfectly.

The Paper's Big Discovery: When Two Machines Share a Crowd, They Are the Same Machine

The authors of this paper, Ramla Abdellatif, Mabud Ali Sarkar, and Absos Ali Shaikh, set out to solve a puzzle about these high-dimensional formal groups. They focused on a special type of machine called a simple formal group. You can think of a "simple" machine as one that cannot be broken down into smaller, independent machines working side-by-side; it is a single, indivisible unit.

The researchers proved a powerful rule: If two simple, high-dimensional formal groups share an infinite number of the same torsion points, then they are actually the exact same machine.

To understand why this is a big deal, imagine two different factories (Formal Group F and Formal Group G) that produce toys. Each factory has a specific pattern for when its machines reset (the torsion points). Usually, two different factories might accidentally share a few reset times by coincidence. But if they share infinitely many reset times, it's like finding out they are using the exact same blueprints. The paper proves that for these specific "simple" machines, there is no room for coincidence. If the lists of reset points overlap infinitely, the factories are identical.

How They Solved the Puzzle

The authors didn't just guess this; they built a rigorous mathematical bridge to prove it. Here is the journey they took, explained through a few key steps:

The "Stable" Key: They used a special type of mathematical tool called a "stable endomorphism." Imagine a key that fits perfectly into a lock and turns it in a way that never gets stuck or repeats in a boring loop. They showed that if a mathematical function (a power series) plays nicely with this special key, it must be a part of the machine's own internal structure.
The Galois Detective: They brought in the help of "Galois representations," which are like a team of spies (symmetries) that watch how the torsion points move around. They proved that if the machine is "simple," these spies are very active and can reveal the machine's true identity.
The Infinite Crowd: The core of their argument relies on the fact that if the two machines share an infinite number of torsion points, that shared crowd is so large and spread out that it covers the entire space where the machines live. This "crowd" is so dense that it forces the two machines to behave in exactly the same way.

What They Ruled Out and What Remains Unknown

The paper is very careful about what it claims. It explicitly rules out the idea that this rule works for every kind of formal group. The authors point out that if a machine is not simple—meaning it is actually a combination of two smaller, different machines stuck together—the rule breaks down.

They give a clear example: Imagine Machine A is made of a red part and a blue part, while Machine B is made of the same red part and a different green part. If you look at the red part's reset points, both machines will share them. Since the red part is infinite, the two machines share an infinite number of points, but they are clearly not the same machine. This proves that the "simple" condition is absolutely necessary for their rule to hold.

The authors are 100% certain about their main result for simple groups; they have provided a complete mathematical proof. However, they leave the door open for future exploration. They ask: "What if we relax the 'simple' rule just a little? Is there a weaker condition that still guarantees the machines are the same?" They also wonder if this idea of "uniqueness by shared points" applies to even bigger objects called abelian varieties (which are like multi-dimensional donuts used in advanced math). They suggest it might, but they haven't proven it yet.

Why This Matters

This work is a significant step forward in understanding the rigid structure of numbers. It shows that in the high-dimensional world of p-adic numbers, there is a strict order: you cannot have two different, indivisible machines that accidentally share an infinite number of behaviors. Their "fingerprints" are unique. This extends a famous result from the 1960s and 2000s, taking it from simple, one-dimensional cases to the much more complex, multi-dimensional world. It's a reminder that even in the most abstract corners of mathematics, if you look closely enough at the patterns, the truth reveals itself with perfect clarity.

Technical Summary: Rigidity and Unlikely Intersection in Higher-Dimensional Formal Groups

Problem Statement
The paper addresses the problem of "rigidity" in the context of formal groups over the ring of $p$ -adic integers, $\mathbb{Z}_p$ . Specifically, it investigates whether the set of torsion points of a formal group uniquely determines the group itself. While a foundational result by Berger established that for one-dimensional formal groups, an infinite intersection of torsion point sets implies the groups are identical, this paper seeks to extend this rigidity theorem to higher-dimensional formal groups. The central question is: If two $d$ -dimensional simple formal groups $F$ and $G$ over $\mathbb{Z}_p$ share infinitely many torsion points (i.e., $Tors(F) \cap Tors(G)$ is infinite), does it follow that $F = G$ ?

Methodology
The authors employ a combination of Galois representation theory, the theory of stable endomorphisms, and logarithmic conjugation to transport problems from formal groups to additive formal groups. The methodology proceeds through the following logical steps:

Galois Representations and Torsion Density:
The authors utilize the Galois representation $\rho_F: G_{\mathbb{Q}_p} \to \text{Aut}(T_p(F))$ associated with a simple formal group $F$ . They establish (Lemma 2.1.1) that for a simple formal group of finite height, the image of this representation contains an open subgroup of scalar matrices $a \cdot \text{Id}$ . This leads to Corollary 2.1.2.1, which states that if a Galois element $\sigma$ acts as a scalar $a$ on the Tate module, it acts on torsion points via the endomorphism $[a]_F$ .
Stable Endomorphisms and Commutativity:
A key technical tool is the concept of "stable" power series (Definition 2.0.7), where the eigenvalues of the Jacobian at the origin are non-zero and not roots of unity. The authors prove Theorem 2.2.1: if a power series $w$ commutes with a stable endomorphism $u$ of a formal group $F$ , then $w$ must itself be an endomorphism of $F$ . The proof involves conjugating the endomorphisms via the formal group logarithm $L$ to the additive formal group $\mathbb{G}_a^d$ . In the additive setting, the commutativity relation reduces to a linear algebra problem involving homogeneous polynomial components, where the stability condition forces higher-order terms to vanish.
Rigidity via Common Endomorphisms:
The authors prove that if two formal groups $F$ and $G$ share a stable endomorphism $u$ , then $F = G$ (Theorem 2.3.1). This is demonstrated by showing that the conjugation of $u$ via the logarithms of $F$ and $G$ yields the same linear map, implying the logarithms differ only by a linear map that must be the identity.
Zariski Density and Intersection:
The proof of the main theorem relies on showing that the infinite intersection $Z = Tors(F) \cap Tors(G)$ is Zariski dense. By analyzing the $p$ -divisible groups associated with $F$ and $G$ , the authors argue that the simplicity of $F$ and $G$ forces their common $p$ -divisible subgroup to be the entire group, thereby making the intersection Zariski dense.

Key Contributions and Results

Main Theorem (Theorem 1.0.2): The paper proves that if $F$ and $G$ are $d$ -dimensional simple formal groups over $\mathbb{Z}_p$ and their torsion point sets intersect infinitely, then $F = G$ . This generalizes Berger's one-dimensional result to higher dimensions under the assumption of simplicity.
Technical Lemma (Lemma 2.3.2): The authors establish that any power series $h$ mapping a Zariski dense subset of torsion points of a simple formal group $F$ into $Tors(F)$ must be an endomorphism of $F$ .
Characterization of Simplicity: The paper clarifies that the "simple" condition is necessary. In the Conclusion, the authors provide a counterexample showing that if the groups are not simple (e.g., $F = H \times F_1$ and $G = H \times G_1$ with distinct $F_1, G_1$ ), the intersection of torsion points can be infinite without the groups being equal.

Significance and Claims
The authors claim that this work extends the rigidity phenomenon from the one-dimensional setting to a higher-dimensional family of simple formal groups. The significance lies in identifying a class of higher-dimensional formal groups that are uniquely determined by their $p$ -power torsion points.

The paper modestly frames its contribution as an extension of existing work (specifically Berger's) rather than a complete solution to all higher-dimensional cases. The authors explicitly note that the result relies on the "simple" hypothesis and that the general case for non-simple groups remains open. Furthermore, the paper poses two questions for future direction:

What weaker assumptions than simplicity are sufficient to imply isomorphism (or equality) from an infinite torsion intersection?
Does a similar rigidity phenomenon hold for simple abelian varieties (i.e., if $Tors(A) \cap Tors(B)$ is infinite, are $A$ and $B$ isogenous)?

The work does not propose new experimental applications but situates itself within the theoretical framework of $p$ -adic Galois representations and unlikely intersections in arithmetic geometry.