Gopakumar-Vafa invariants and Macdonald formula II
This paper establishes the cohomological Gopakumar-Vafa/Pandharipande-Thomas correspondence for the local plane and quadric in all effective curve classes and Euler characteristics by proving that the strict supports of stable pair vanishing cycle direct images are closures of transverse unions of smooth connected curves, thereby reducing the problem to an identity of semisimplified perverse direct images on the Chow variety via the family Macdonald formula.
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
In the vast landscape of modern mathematics, there is a branch dedicated to counting and classifying shapes that exist in higher dimensions. These are not the simple triangles and circles of a child's drawing, but complex, multi-layered structures that can twist and fold in ways our three-dimensional intuition cannot easily grasp. One of the most persistent challenges in this field is understanding how these shapes behave when they are slightly altered or when they break apart into smaller pieces. Mathematicians have developed different "languages" or methods to describe these objects. Some methods focus on the shapes themselves, while others look at the bundles of information, or sheaves, that can be wrapped around them. For decades, a major goal has been to prove that these different languages are actually describing the same underlying reality, just using different vocabulary. If they are indeed equivalent, it means that a calculation done in one language can be translated perfectly into another, unlocking new ways to solve problems that were previously impossible.
This paper, authored by Lutian Zhao, tackles a specific and difficult version of this translation problem. The author focuses on two particular types of surfaces: the familiar flat plane and a shape that looks like a stretched-out square, known as a quadric. In the mathematical universe, these surfaces are often studied by attaching a special kind of three-dimensional space to them, creating a "local" environment where curves can live. The central question is how to count the ways these curves can sit inside this space, especially when the curves are allowed to be broken, disconnected, or have multiple layers. The paper aims to prove that two specific counting methods—one based on stable pairs (which are essentially a curve with a specific marking) and another based on counting sheaves (bundles of data)—yield identical results for every possible curve class and every possible Euler characteristic (a number that describes the shape's topological complexity).
The journey to this proof begins by looking at the "supports" of these mathematical objects. In simple terms, a support is the specific location or region where a mathematical object actually exists. The author first had to determine exactly where these objects could live. It turns out that the most complex objects, which might seem to exist in messy, non-reduced forms, are actually built from simpler, smooth, and connected curves that intersect each other cleanly, like roads crossing at a single point without forming a traffic jam. The paper rigorously proves that every possible configuration of these curves is essentially a collection of these smooth, transverse intersections. This is a crucial step because it narrows down the infinite possibilities to a manageable set of geometric scenarios.
Once the possible locations were mapped out, the author used a powerful technique called wall-crossing. Imagine a landscape where the rules for what counts as a stable object change as you move across a boundary, or a "wall." By carefully analyzing how the counts change as one crosses these walls, the author could relate the complex counting problem to a much simpler one. The paper demonstrates that for the two surfaces in question, the behavior of these objects is constrained to a specific, finite range of complexity. Outside of this range, the objects simply do not exist. Inside this range, the author shows that the counting problem can be reduced to a calculation on the "reduced" locus, which is the space of smooth, non-repeating curves.
The final breakthrough comes from applying a known formula, originally developed for symmetric products of curves, to this specific setting. The author proves that the complex data gathered from the stable pairs is exactly the same as the data gathered from the sheaf-counting method. This is not just a numerical coincidence; the paper establishes a deep structural identity between the two, showing that they are two sides of the same coin. The proof relies on a clever use of "point modifications," which are operations that add or remove a single point from a curve. By studying how these operations interact, the author derives a relationship that forces the counting numbers to align perfectly.
The result is a complete and rigorous confirmation of the correspondence between these two counting methods for the local plane and the quadric. The paper rules out the possibility that there are any "hidden" configurations or strange, non-reduced cycles that would break this correspondence. Instead, it confirms that the entire structure is built from the clean, transverse unions of smooth curves. This work provides a solid foundation for understanding how different mathematical perspectives on curve counting are unified, offering a clear and complete picture of these geometric objects in these specific environments. It stands as a definitive proof, leaving no ambiguity about the relationship between the stable pair invariants and the sheaf-theoretic invariants in these cases.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.