Schubert calculus is a fundamental part of enumerative algebraic geometry with elegant applications ranging from classical geometry to modern theoretical physics. At its core, Schubert calculus deals with counting the number of geometric objects that satisfy specific intersection conditions. While the original development focused on complex solutions, there has been increasing interest in understanding the real solutions to these problems.
The study of real solutions in Schubert calculus involves both establishing the existence of real solutions and determining lower bounds for the number of such solutions. These questions connect to deep mathematical concepts including intersection theory, the topology of flag manifolds, and real algebraic geometry.
A classical Schubert problem can be formulated as follows: given a collection of linear subspaces in general position, count the number of other subspaces satisfying certain incidence relations with them. For instance, in the projective plane, we might ask how many lines pass through two given pointswhich is exactly one line.
More formally, these problems take place on flag manifolds G/B, where G is a Lie group and B its Borel subgroup. Solutions correspond to intersections of Schubert varieties, which are subvarieties of G/B determined by certain conditions.
The number of complex solutions to such problems is given by products of structure constants of the cohomology ring of G/B, known as Schubert class intersection numbers. These numbers are integers with combinatorial importance.
When we restrict our attention to real solutions, the story becomes more intricate. Not all solutions necessarily have real representatives, and the number of real solutions can vary depending on the specific parameters of the problem.
A fundamental question is: what lower bounds can we establish for the number of real solutions? This question resonates with the broader problem in real algebraic geometry of determining when a system of polynomial equations has real solutions.
For certain families of Schubert problems, complete results are known. For instance, in the Hermitian case (where the data defining the problem is real and Hermitian), there exist positive numbers of real solutions.
An important result by Eremenko and Gabrielov established that for any Hermitian interpolation problem involving real rational functions, there is a non-zero even number of real solutions. This provided the first general lower bound for a significant class of problems.
Several powerful mathematical techniques have been employed to establish lower bounds for real solutions in Schubert calculus:
For different classes of Schubert problems, various lower bounds have been established:
For linear subspace problems on real Grassmannians, the number of real solutions is at least the number of Schubert cells involved when the defining data is real.
In problems on the isotropic Grassmannian satisfying appropriate reality conditions, there is typically at least one real solution.
For the problem of four lines in general position in $\mathbb{P}^3$, there are either 2 or 4 real lines meeting all four given lines.
For the problem of 3 planes in $\mathbb{P}^5$, there are either 0, 2, or 6 real 2-planes meeting all three given planes.
An important general principle is that the lower bound often relates to the topology of the relevant real flag variety. In particular, there is a connection between the sum of the Betti numbers of the real variety and lower bounds for the number of real solutions.
The study of lower bounds for real solutions in Schubert calculus connects to several areas of mathematics:
Recent work has extended our understanding of lower bounds in several directions:
Despite significant progress, many questions remain:
The interplay between the combinatorial structure of Schubert calculus and the topological properties of real flag varieties remains a rich area for future research.
Lower bounds for numbers of real solutions in Schubert calculus represent a beautiful intersection of algebraic geometry, topology, and combinatorics. From the first general guarantees established by Eremenko and Gabrielov to the most recent developments, progress has often come through innovative connections between seemingly disparate mathematical areas.
The continued study of these bounds not only advances our understanding of enumerative geometry but also provides tools and insights that ripple across mathematics. As with many deep mathematical questions, the journey of understanding these bounds has proven as valuable as the answers themselves, forging new pathways that span the mathematical landscape.
