← Latest papers
🔢 mathematics

The Drinfeld-Grinberg-Kazhdan theorem and embedding codimension of the arc space

This paper extends the Drinfeld-Grinberg-Kazhdan theorem to arcs with arbitrary residue fields and applies this result to demonstrate the generic constancy of embedding codimension on irreducible subsets of arc spaces, thereby linking finite formal models of maximal divisorial sets to singularity invariants and characterizing arcs of embedding codimension zero.

Original authors: Christopher Heng Chiu

Published 2026-06-30
📖 5 min read🧠 Deep dive

Original authors: Christopher Heng Chiu

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

Imagine you are looking at a complex, crumpled piece of paper (a mathematical object called a "variety"). Some parts of this paper are smooth, but others are crumpled, pinched, or have sharp corners. These crumpled spots are called singularities.

Mathematicians have a special tool called an arc space. Think of an "arc" not as a curve you draw on paper, but as a tiny, infinitely flexible robot arm that can slide along the surface of your crumpled paper. The "arc space" is the collection of all possible positions this robot arm can take.

The paper by Christopher Heng Chiu is about understanding the "neighborhood" around where this robot arm is sitting. Specifically, it asks: If the robot arm is sitting on a smooth part of the paper, what does the space around it look like?

Here is a breakdown of the paper's main ideas using simple analogies:

1. The Big Discovery: The "Universal Blueprint" (The Drinfeld–Grinberg–Kazhdan Theorem)

For a long time, mathematicians knew that if your robot arm is sitting on a smooth spot, the space around it looks like a mix of two things:

  1. A finite, manageable model (like a small, detailed Lego set).
  2. An infinite, smooth tube (like a long, straight hallway that goes on forever).

This was known as the Drinfeld–Grinberg–Kazhdan theorem. However, it only worked if the robot arm was sitting on a very specific, "rational" spot (think of it as a spot with a simple, standard address).

What this paper does:
The author extends this rule to any spot the robot arm can be on, even if that spot has a complicated, non-standard address (an "arbitrary residue field").

  • The Analogy: Imagine you have a blueprint for a house. Previously, you could only use the blueprint if the house was built on a flat, standard plot of land. This paper proves you can use the same blueprint logic even if the house is built on a weird, sloped, or foreign plot of land. You just might need to translate the blueprint slightly (change the "coefficient field") to make it fit, but the core structure remains the same.

2. The "Ruler" of Complexity (Embedding Codimension)

The paper introduces a concept called embedding codimension. Think of this as a "complexity score" or a "messiness meter" for the space around the robot arm.

  • If the score is 0, the space is perfectly smooth and regular (like a clean sheet of paper).
  • If the score is high, the space is very crumpled or complicated.

The Main Result (Theorem B):
The author proves that if you look at a specific, connected group of robot arms (an "irreducible subset") that are all sitting on smooth parts of the paper, their "messiness scores" will be the same for almost all of them.

  • The Analogy: Imagine a crowd of people standing on a smooth dance floor. Even if they are wearing different shoes, if they are all standing on the same smooth patch, the "roughness" of the floor under their feet is identical. You don't need to measure every single person; if you measure one, you know the rest are the same.

3. Connecting the Model to the Reality

The paper connects these "messiness scores" to the actual crumpled paper (the original variety).

  • If the robot arm is on a smooth part of the paper, the "messiness score" of the space around it is zero.
  • If the robot arm is on a crumpled part, the score is infinity (or very high).

This confirms that the "messiness" of the robot arm's neighborhood is a direct reflection of whether the paper itself is smooth or crumpled at that point.

4. The "Pinch Point" Surprise

The author also tests a specific, tricky shape called a "pinch point" (where a surface pinches together like a pair of lips).

  • They found a robot arm sitting on a spot that looks "unibranch" (it has one main path coming out of it), but it's not "geometrically unibranch" (if you look at it through a different lens, it splits).
  • The Result: Even though the path looked simple, the "messiness score" was zero (it looked smooth), but the local ring (the mathematical description of the spot) was not regular (it had hidden "ghosts" or nilpotent elements).
  • The Takeaway: This shows that sometimes things look smooth from one angle but are actually tricky underneath. It solves a specific puzzle about when we can trust our "smoothness" measurements.

Summary

In short, this paper takes a powerful mathematical tool that was previously limited to simple, standard cases and upgrades it to work for any situation. It proves that for most points on a smooth surface, the complexity of the surrounding space is constant and predictable. It also clarifies exactly when a space is truly "smooth" versus when it is hiding a secret complexity, helping mathematicians better understand the geometry of crumpled shapes.

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 →