Arcs on rational double points in arbitrary characteristic

arXiv:2508.12423 · math.AG · Submitted 2025-08-17 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Arcs on rational double points in arbitrary characteristic".

Emmy: Here's the gist of the paper. The paper proves that the Nash problem holds for two-dimensional rational double points in all characteristics.

Ada: This result settles a long-standing conjecture by establishing surjectivity of certain maps related to arcs and valuations through direct computation.

Emmy: The Nash Problem Context Nash uncovered a connection between the resolution of singularities and the topology of the space of formal arcs through their singularities.

Ada: In dimension two, this connection is simplified by an injective map called the Nash map, which is interpreted as an inclusion between certain sets of divisorial valuations.

Title and authors: Ada: So we're talking about this paper today, "Arcs on rational double points in arbitrary characteristic." It settles the Nash problem for two-dimensional rational double points in all characteristics. That means it shows that the connection between resolving singularities and the topology of formal arcs through their singularities holds true everywhere.

Emmy: Exactly. We're looking at this paper because it tackles a long-standing conjecture by proving the surjectivity of certain maps related to arcs and valuations through direct computation. It’s about making sure those two sets of valuations are actually the same, which is what Nash conjectured in dimension two.

Kolya: So, if we get this result, it means we have a universal statement for these singularities across all characteristics. That’s a big deal when you're looking at algebraic geometry where things can behave very differently depending on the field you choose.

Ada: Right. The authors are Tommaso De Fernex and Shih-Hsin Wang, and they’ve used direct computation to settle this for two-dimensional rational double points over algebraically closed fields of arbitrary characteristic. It settles a major question that has been around for decades in this area of singularity theory.

Emmy: It’s important to remember that the Nash problem was originally about complex varieties, but the authors extend this result to work over more general fields, which is where it gets really interesting structurally.

Kolya: And they did it by proving surjectivity of a map called Psi X m from non-degenerate arc components to m-jet components for every m greater than one. That's the key mechanism they used here.

Ada: Right, so the paper essentially takes the problem that was known to be hard in some cases and proves it works uniformly across different characteristics by showing this map is surjective. It’s a direct computational approach that bypasses some of those more abstract methods from characteristic zero papers Nas95.

The paper's summary: Ada: So, what the authors actually did in "Arcs on rational double points in arbitrary characteristic" is settle the Nash problem for two-dimensional rational double points over algebraically closed fields of arbitrary characteristic. They focused on establishing three key bijections related to these singularities.

Emmy: The first one is a map called NX from non-degenerate arc components to valuations defined by exceptional divisors on the minimal resolution, and they proved that this map is surjective, which means it's a bijection.

Kolya: Then they have the map Psi X m from arc components to m-jet components for every m greater than one, and they showed this is surjective, which implies the validity of the Nash problem. That’s like saying we can connect all those different ways of looking at arcs together.

Ada: They also established that the map Psi X from arc components to equivalent classes of unbounded directed chains in Gamma X is surjective for every m, which confirms that these sets are indeed identical in this context. It's a comprehensive set of results showing the relationship holds completely.

Emmy: The paper emphasizes that they constructed these irreducible components in the space of arcs starting from those at the finite jet level, moving up one level at a time across the singularity structure. That construction method is what makes the proof work for them.

Kolya: It’s interesting because they did this by adapting computations originally done in characteristic zero, but they had to do some minor adjustments for small characteristics, like between two and three for E6 and E7 singularities, and between two, three and five for the E8 case.

Ada: They explicitly acknowledge that the sensitivity to small characteristics is a sign of the problem's subtlety in those specific settings. That’s an important caveat because it tells us exactly where we need to be careful when applying this result later.

The paper's improvements: Emmy: Now, looking at what they suggest for future work or improvements, the authors point out that they can build on their current construction by showing that the systems used actually prove the components are irreducible and fill up the space of arcs.

Ada: They mention a specific computational strategy where they carefully organize computations and take radicals at every step to simplify those equations of the sets. That’s a very practical improvement because it makes controlling infinitely many equations manageable through careful organization.

Kolya: And they highlight their use of strategies like Proposition three point one and Proposition three point two to systematically eliminate variables in Hasse-Schmidt derivatives, which is essential for determining the inverse image of its smooth locus in X infinity <ref:2508.12423#pg3>. That sounds like a way to get tighter control over the boundary conditions where things might break down or behave weirdly.

Emmy: They also mention constructing specific sets of arc components, like C1 through C8 for E8 singularities, demonstrating how these sets are irreducible and their closures fill up the space X zero infinity. That gives us a concrete picture of what they were actually building computationally.

Ada: They showed that Ci is not a subset of all other components by looking at specific conditions, like if you look at i greater than j, the vanishing of f two i plus two implies y two equals zero on Ci, while the construction for Cj shows y two is not identically zero on Cj. That’s how they proved those components are distinct from each other.

Kolya: It's interesting that they also distinguish between this Nash problem and the wedge lifting problem, showing that these two problems are not equivalent in positive characteristic by using counterexamples like an E8 singularity in characteristics two, three, or five. That’s a crucial piece of context for anyone interested in related problems.

Conclusion: Ada: To wrap up this discussion on "Arcs on rational double points in arbitrary characteristic," the main implication is that the Nash problem holds universally for these singularities across all characteristics. This gives us a solid foundation to work with when studying these geometric objects regardless of the field we are using.

Emmy: Essentially, they’ve provided a direct computational route, showing that this connection between resolution and arc topology is robust enough to hold even in positive characteristic where things can get tricky. The paper confirms that the Nash map is surjective for two-dimensional rational double points in all characteristics.

Kolya: From a probabilistic standpoint, this result means the bounds they derived for these geometric structures are valid across all fields, which helps ensure that the tail behavior of whatever statistical measure we're looking at isn't dependent on the characteristic in this specific setting.

Ada: So, to summarize what we heard about "Arcs on rational double points in arbitrary characteristic," it settles a long-standing conjecture by establishing surjectivity of key maps through direct computation. It shows that the structure of arcs is consistent across all characteristics for these specific types of singularities.

Emmy: It’s important to remember the paper's limitation, which they admit, is that the computations are sensitive to small characteristics, needing minor adjustments between two and three for E6 and E7, and between two, three and five for E8. That tells us where we need extra care when we apply this result in those specific settings.

Kolya: I agree with that caution. The sensitivity to those small characteristics shows the problem isn't entirely straightforward even after this proof, which is exactly what you expect given Reguera’s counterexamples to the wedge lifting problem.

Tommaso de Fernex, Shih-Hsin Wang

math.AG

Submitted: 2025-08-17

Updated: 2026-11-10

Comments: v2: 20 pages, to appear in the Journal of Singularities

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 78/100

The gist: The paper proves that the Nash problem holds for two-dimensional rational double points in all characteristics.

Key concepts

Nash Problem
This is a conjecture connecting the resolution of singularities with the topology of formal arcs. It asks whether two specific sets, derived from different ways to look at valuations on certain geometric objects, are actually the same set.
Rational Double Points
These are specific types of singularities in algebraic geometry that arise when resolving certain surfaces. The paper focuses on these points in two dimensions, which simplifies the study compared to higher dimensions.
Nash Map/Valuations
The Nash map is an injective map between sets of divisorial valuations associated with arcs. The Nash problem asks if this map is surjective, meaning every valuation in one set can be represented by a valuation in the other set.

Terminology

Summary

The paper proves that the Nash problem holds for two-dimensional rational double points in all characteristics. p. 1 This result settles a long-standing conjecture by establishing surjectivity of certain maps related to arcs and valuations through direct computation. p. 0

The Nash Problem Context

Nash uncovered a connection between the resolution of singularities and the topology of the space of formal arcs through their singularities. In dimension two, this connection is simplified by an injective map called the Nash map, which is interpreted as an inclusion between certain sets of divisorial valuations. p. 0 Nash conjectured that this map is surjective, meaning the two sets of valuations are the same. p. 0 The purpose of this paper is to settle the Nash problem for rational double points in positive characteristics. p. 1

Proof Strategy and Key Maps

The proof proceeds by constructing the irreducible components in the space of arcs from those at the finite jet level, going up one level at a time. The approach is inspired by computations in characteristic zero but adapted for arbitrary characteristics. p. 1 A crucial part involves constructing the map ΨX,m from non-degenerate arc components to m-jet components, which is shown to be surjective for every m ≫ 1. p. 4 This surjectivity of ΨX,m implies the validity of the Nash problem. p. 1

Results for Specific Singularities

The theorem establishes three key bijections for two-dimensional rational double points. These include:

  1. The map NX from non-degenerate arc components to valuations defined by exceptional divisors on the minimal resolution is surjective, hence a bijection. p. 4

  2. The map ΨX,m from arc-components to m-jet components is surjective for every m ≫ 1. p. 4

  3. The map ΨX from arc-components to equivalent classes of unbounded directed chains in ΓX is surjective for every m. p. 4

Computational Verification

The proof involves detailed computations stratified by the type of singularity, including An singularities, Dn singularities, and the E6, E7, and E8 cases. For example, in the case of An singularities defined by f(x, y, z) = z(n+1) + xy, the construction involves iteratively defining sets C◦i and proving they are irreducible and fill up the fiber X0∞. p. 6 Similar, more complex constructions are used for Dn singularities, involving a sequence of sets C◦1 through C◦2n-2. p. 0 The proof concludes by showing that no inclusions exist among these constructed components. p. 7

Handling Characteristic Dependence

The computations are shown to be mostly uniform across all characteristics, with minor adjustments needed for small characteristics. The sensitivity to small characteristics is noted as a manifestation of the problem's subtlety. The proof relies on carefully organizing computations, taking radicals at each step to simplify the equations. p. 2 The results for E8 singularities are shown to hold in all characteristics, resolving a difficulty encountered in characteristic zero proofs involving transcendental methods. p. 1 The final verification of component non-inclusion relies on comparing defining equations across different singularity types. p. 6

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved systems can prove that The Nash problem holds for two-dimensional rational double points over algebraically closed fields of arbitrary characteristic, which establishes a universal result in this area of singularity theory.

  2. The improved system can perform direct computation to construct the irreducible components in the space of arcs from the irreducible components at the finite jet level, as described by The proof is inspired by the computations of the irreducible components of the jets spaces through rational double points carried out in characteristic zero in [Mou14].

  3. Systems can verify Theorem 2.1 for specific singularities, including An singularities with a completely characteristic free computation method, providing a robust check across different fields.

  4. The improved system can handle computations sensitive to small characteristics by using the fact that The fact that the computations are sensitive to small characteristics can be seen as a manifestation of the subtlety of the problem in that setting.

  5. The system can utilize computational strategies like Proposition 3.1 and Proposition 3.2 to systematically eliminate variables in Hasse-Schmidt derivatives, which is essential for determining the inverse image of its smooth locus in X infinity.

  6. Improved systems can construct the set of arc components C1 through C8 for E8 singularities, demonstrating the process by constructing locally closed sets C1, . . . , C8 whose closures C1, . . . , C8 are irreducible and fill up X0 infinity.

  7. The system can prove that Ci is not a subset of all other components by showing that for i greater than j, the vanishing of f2i+2 implies y2 equals 0 on Ci, while the construction of Cj shows y2 is not identically zero on Cj.

  8. Improved systems can distinguish between the Nash problem and the wedge lifting problem by demonstrating that the Nash problem and the wedge lifting problem are not equivalent in positive characteristic using counterexamples like an E8 singularity in characteristics 2, 3, or 5.

Sources

Related papers