← Latest papers
🔢 mathematics

A proof of the Arnold-Givental conjecture

This paper provides a complete proof of the Arnold-Givental conjecture by establishing a lower bound on the number of intersection points between a Lagrangian fixed point set and its Hamiltonian image, utilizing a novel synthesis of integral Floer theory, Hamiltonian Floer cohomology reduction, and Z/2\mathbb{Z}/2-equivariant localization.

Original authors: Shaoyun Bai, Egor Shelukhin, Yi Wang, Guangbo Xu

Published 2026-08-28
📖 5 min read🧠 Deep dive

Original authors: Shaoyun Bai, Egor Shelukhin, Yi Wang, Guangbo Xu

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 world of modern mathematics, there is a branch called symplectic geometry that studies spaces with a special kind of structure, often used to describe the motion of physical systems like planets or particles. Imagine a smooth, closed surface, like the skin of a sphere or a torus, but with this extra layer of geometric rules that dictate how things move across it. Within these spaces, mathematicians look for specific shapes called Lagrangian submanifolds. These are like invisible, flexible sheets that sit inside the larger space, obeying the rules of the geometry in a very precise way. A central question in this field is about rigidity: if you take one of these sheets and wiggle it around using the allowed motions of the space, can you make it avoid touching itself or other sheets entirely? Or is it impossible to move it without creating at least some points of contact? This question is not just about abstract shapes; it touches on the fundamental stability of the universe's geometric fabric.

For decades, mathematicians have suspected that these sheets are incredibly stubborn. A famous idea, known as the Arnold–Givental conjecture, proposed that if you take such a sheet and move it, the number of times it must cross its original position is not random. Instead, this number is strictly tied to the sheet's own internal complexity, specifically a measure of its shape and holes known as its cohomology. The conjecture suggested that no matter how you wiggle the sheet, the number of crossing points cannot be smaller than a specific threshold determined by the sheet's own geometry. While this idea had been proven for many specific, simple shapes, the general case for any possible shape in any possible space remained a massive, unsolved puzzle.

A team of researchers has now solved this puzzle in full generality. They have provided a complete proof that the Arnold–Givental conjecture is true for every closed symplectic manifold and every valid Lagrangian sheet within it. Their work confirms that the minimum number of intersection points is at least equal to the dimension of the sheet's cohomology over a specific field of numbers. This means that the geometric rigidity of these shapes is absolute; you cannot wiggle them out of their own way without leaving a trace of contact that matches their inherent complexity.

To reach this conclusion, the team had to develop a new way of counting these intersection points. In mathematics, simply looking at the final picture of where two shapes cross is often not enough, because the shapes can be deformed in ways that hide the true count. Instead, the researchers used a sophisticated method called Floer theory, which treats the problem as a dynamic process. They imagined the sheet moving through time and analyzed the paths it could take. The challenge was that the sheet in this problem has a special symmetry: it is the fixed point of a reflection, meaning it looks the same when flipped. This symmetry complicated the counting process because standard methods would count the same crossing point twice or miss it entirely.

The researchers overcame this by creating a new framework that respects this reflection symmetry at every step. They built a mathematical machine that could track the sheet's movement while keeping the reflection in mind. This machine allowed them to count the crossing points in a way that was immune to the distortions of deformation. They combined this with a powerful technique involving "localization," which essentially means focusing on the parts of the space where the symmetry is strongest. By doing this, they were able to show that the number of crossing points is governed by a simple, unchangeable rule derived from the sheet's own shape.

The proof is rigorous and leaves no room for doubt. It does not rely on simulations or approximations but uses a chain of logical deductions that holds up under the strictest mathematical scrutiny. The team had to navigate complex technical difficulties, such as ensuring that their counting method worked even when the shapes were not perfectly smooth or when the paths they took were messy. They developed new tools to smooth out these irregularities without breaking the symmetry, ensuring that the final count was accurate.

This result is a landmark because it settles a question that has stood for over thirty years. It confirms that the geometry of these spaces is far more rigid than one might expect. The sheet cannot be moved to avoid its own reflection without leaving a specific, predictable number of traces. This finding deepens our understanding of the stability of symplectic spaces and provides a powerful new tool for mathematicians to explore the hidden structures of the universe. The work demonstrates that even in the most abstract corners of mathematics, there are fundamental laws that govern how shapes interact, and these laws are as unyielding as the shapes themselves.

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 →