← Latest papers
🔢 mathematics

Proof of Miyanishi's conjecture on endomorphisms of varieties

This paper proves Miyanishi's conjecture by demonstrating that any birational endomorphism of a quasi-projective variety which is injective outside a closed subset of codimension at least two is necessarily an automorphism, a result established through a key finiteness theorem on class groups.

Original authors: Supravat Sarkar

Published 2026-02-19
📖 5 min read🧠 Deep dive

Original authors: Supravat Sarkar

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 Big Picture: The "Shape-Shifter" Problem

Imagine you have a complex, multi-dimensional shape (mathematicians call this a variety). Now, imagine you have a machine (a map or endomorphism) that takes this shape, squishes it, stretches it, and rearranges its parts to create a new version of itself.

The big question mathematicians have been asking for decades is: If this machine rearranges the shape without ever crashing two different points into the same spot (injectivity), does it actually just move the shape around perfectly without tearing or folding it?

In other words: If the machine doesn't "glue" any points together, is it a perfect, reversible transformation (an automorphism)?

The Catch: The "Tiny Hole" Rule

For a long time, mathematicians knew the answer was "Yes" if the machine was perfect everywhere. But what if the machine is messy in a few tiny, specific spots?

  • The Old Rule: If the machine is injective (doesn't glue points) on a dense open set (most of the shape), it might still fail.
    • Analogy: Imagine a map of a city. If you can walk from any neighborhood to any other without getting stuck, that's good. But if there is a specific rule that says "You can't cross the river," you might think you can go everywhere, but you actually can't.
  • The New Question (Miyanishi's Conjecture): What if the machine is messy only on a set of points so small that they are like "dust" compared to the whole shape?
    • In math terms, if the "messy" part has a codimension of 2 or more (think of it as a single point in a 3D room, or a line in a 4D space), does the rule still hold?

Miyanishi's Conjecture (1980s): "Yes. If the machine only messes up on these tiny, dust-like spots, then the whole machine is actually a perfect, reversible transformation."

The Solution: Sarkar's Proof

Supravat Sarkar has finally proved this conjecture is true for almost all shapes (quasi-projective varieties), regardless of the mathematical "field" (the number system) they are built on.

Here is how he did it, broken down into three simple steps:

1. The "Finiteness" Check (The Library Analogy)

Before proving the machine works, Sarkar had to check the "library" of the shape.

  • The Concept: Mathematicians use something called a Class Group to count the different ways you can slice a shape.
  • The Analogy: Imagine the shape is a library. The Class Group is the catalog of all possible bookshelves you can build.
  • The Discovery: Sarkar proved that for these shapes, the catalog isn't infinite. It's a finite list (or at least, a list that doesn't get infinitely complicated). This was a crucial "finiteness result" that acts as the foundation for the rest of the proof.

2. The "Dimension Drop" (The Shrinking Room)

Sarkar then looked at what happens if the machine isn't perfect.

  • The Logic: He imagined a scenario where the machine does fail to be a perfect transformation. He showed that if this happens, the "catalog" (the Class Group) of the new shape would have to be strictly smaller than the catalog of the original shape.
  • The Analogy: Imagine you have a room with 10 unique chairs. If you rearrange the room and the machine fails, you suddenly find you only have 9 unique chairs left.
  • The Contradiction: But wait! We already proved in Step 1 that the catalog is finite and stable. You can't keep shrinking the catalog forever. If the machine fails, it forces the catalog to shrink, which creates a logical loop that breaks the rules of the shape. Therefore, the machine cannot fail.

3. The Final Push (The "No-Exit" Door)

Once he proved the machine doesn't "glue" points together (it's an "open immersion"), he used a famous older theorem by Ax.

  • The Analogy: Ax's theorem is like a security guard who says, "If you can get in without getting stuck, and the building is finite, you must be able to get out too."
  • The Result: Since the machine doesn't glue points and the shape is "finite" in a mathematical sense, the machine must be a perfect, reversible loop. It is an isomorphism (a perfect match).

Why This Matters

  • It Solves a 40-Year Mystery: This confirms a guess made by Miyanishi in the 1980s.
  • It's More Robust: Previous proofs only worked for specific types of shapes or specific number systems (like real numbers). Sarkar's proof works for any shape that fits the description, even in weird mathematical universes (positive characteristic).
  • The "Codimension 2" Rule: It confirms that in geometry, if you ignore a "tiny" set of errors (like a single point in 3D space), the global behavior of the shape is still perfectly controlled.

Summary in One Sentence

Sarkar proved that if you have a geometric shape and you rearrange it without gluing any points together—except for a few tiny, insignificant "dust" spots—then you haven't actually changed the shape at all; you've just moved it perfectly, and you can reverse the process.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →