Betti Numbers of Odd Biisotropic Symplectic Grassmannians

summary

The gist

BETTI NUMBERS OF ODD BIISOTROPIC SYMPLECTIC GRASSMANNIANS is computed by presenting an explicit dimension-preserving combinatorial bijection between the Białynicki-Birula cells in S2Gr(k…

In short

The paper computes Betti numbers for odd biisotropic symplectic Grassmannians by finding a combinatorial bijection between their Białynicki-Birula cells and Schubert cells in another variety. This establishes an isomorphism between their cohomology groups, meaning they share the same algebraic structure. The method uses unit-free subsets to index these cells.

Key concepts

Odd Biisotropic Symplectic Grassmannian S2Gr(k, 2n + 1)
This is a smooth Fano variety of dimension 2k(n + 1 − k). It has an action related to the stabilizer of a general pencil of skew-forms and is decomposed into cells by Białynicki-Birula theory. Its cohomology structure is what the paper aims to understand.
Białynicki-Birula Cells
These are locally closed subvarieties that form an algebraic decomposition of the variety S2Gr(k, 2n + 1). The number of these cells determines the rank of the degree 2d cohomology group. They are indexed combinatorially using unit-free subsets.
Schubert Cells in Gr(k, 2n + 2 − k)
These are specific cells within another variety, Gr(k, 2n + 2 − k). The paper establishes a direct correspondence between the Białynicki-Birula cells and these Schubert cells. This link is key to proving the isomorphism of their cohomology groups.
Unit-Free Subsets
These are specific subsets I of [−n, n] where no two elements i1, i2 in I satisfy i1 + i2 = ±1. These subsets are used as a combinatorial indexing scheme to map the cells from the Grassmannian variety to the Schubert cells.

Terminology used across episodes

This episode discusses

The paper

Betti Numbers of Odd Biisotropic Symplectic Grassmannians · Read on arXiv

ANTON FONAREV, ALEXANDER KUZNETSOV

Russian Science Foundation

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: "Betti Numbers of Odd Biisotropic Symplectic Grassmannians".

Emmy: Here's the gist of the paper. BETTI NUMBERS OF ODD BIISOTROPIC SYMPLECTIC GRASSMANNIANS is computed by presenting an explicit dimension-preserving combinatorial bijection between the Białynicki-Birula cells in S2Gr(k, 2n + 1) and the Schubert cells in Gr(k, 2n + 2 − k) This result establishes an isomorphism of graded abelian groups between the singular cohomology groups of these two varieties The odd biisotropic symplectic Grassmannian S2Gr(k, 2n + 1) is a smooth Fano variety of dimension 2k(n + 1 − k) It admits an action of the stabilizer of the general pencil of skew-forms, identified with the semidirect product G = GL2⋉G2n a, and this action has exactly 2n+2−k fixed points By a theorem of Białynicki-Birula, S2Gr(k, 2n + 1) has an algebraic cellular decomposition into locally closed subvarieties isomorphic to affine spaces The rank of the degree 2d cohomology group equals the number of d-dimensional cells in the Białynicki-Birula decomposition Combinatorial Indexing via Unit-Free Subsets The proof relies on establishing a bijection between unit-free subsets and Schubert cells The Gm-fixed points on S2Gr(k, 2n + 1) are identified with certain subsets of the set

−n, n: called unit-free A subset I is defined as unit-free if for all i1, i2 ∈ I, i1 + i2 ≠ ±1 The dimension of the cell corresponding to a Gm-fixed point

U: is given by dim T+S2Gr(k,V),

UI: = d(I) − s+(I) − s−(I) + k(2n + 1 − k)/2 Bijection Between Cell Types The main result is established by constructing a bijection between the set of unit-free subsets

−n, n: kuf and the set of d-dimensional Schubert cells in Gr(k, 2n + 2 − k) This bijection is formalized through a map ϵ:

−n,n: kuf →

−n,n: kstr The dimension of the Schubert cell corresponding to I ∈

−n, n: kstr equals d(I) + k(n + 1 − k) Proposition 3.4 states that there exists a bijection such that d(ϵ(I)) = d(I) + k(k − 1)/2 − s−(I) − s+(I) for all I ∈

−n,n: kuf Proof Strategy and Key Lemmas The proof involves several key steps, including showing that the cardinality of unit-free subsets equals the cardinality of strict subsets, as shown in Corollary 3.6 The map ϵ is proven to be bijective by induction on n Furthermore, the condition for equality of dimensions is verified by relating the combinatorial invariants s+(I) and s-(I) to the structure of the map ϵ The final step confirms that d(ϵ(I)) − d(I) = p−(I) − p+(I), which matches the required dimension difference Cardinality and Involutions A simpler bijection between

−n, n: kuf and

−n, n: kstr is provided using the involution η:

−n,n: k ∼−→

−n,n: k which interchanges the two sets This lemma shows that one set is contained within the other The cardinality equality is derived from this bijection and Lemma 3.5 The Dimension Equality Proof The dimension equality d(ϵ(I)) − d(I) = k(k − 1)/2 − s−(I) − s+(I) is shown by relating the difference in dimensions to the difference between positive and negative pairs, p−(I) - p+(I) This is achieved by noting that for unit-free sets, p+(I) = s+(I), leading to d(ϵ(I)) − d(I) = P i∈I l− I(i) − X j∈I r+ I(j) The relationship between these sums and the required term is established by Lemma 3.10 The map ϵ is constructed using the formula eI (t) = t + l− I(t) − r+ I(t) Proposition 3.8 ensures that this map maps unit-free subsets to strict subsets The proof of bijectivity for all k is completed by analyzing the behavior of ϵ on subsets decomposed with respect to the endpoints ±n and n This confirms that the number of d-dimensional cells in S2Gr(k, 2n + 1) equals the number of d-dimensional Schubert cells in Gr(k, 2n + 2 − k) References

BB73: A.

Ada: Białynicki-Birula.

Emmy: Some theorems on actions of algebraic groups.

Ada: Ann.

Title and authors: Emmy: The paper goes on to detail how they establish this isomorphism by first identifying the fixed points of the group action on the odd biisotropic symplectic Grassmannian with specific subsets of integers, which they call unit-free sets.

Ada: They define a set as unit-free if for any two elements you pick from it, their sum isn't plus or minus one. This constraint is crucial because it restricts which subsets can actually correspond to cells in the Białynicki-Birula decomposition.

Emmy: Then, they introduce a map, which we’ll call epsilon, that takes these unit-free subsets and maps them to strict subsets in the other variety. The core of their argument is showing that this map preserves dimension exactly as required by the structure of the Schubert cells.

Kolya: I'm wondering about those combinatorial invariants they use for dimension calculation. They mention a formula involving d(I) and some terms called s+ and s-. What does that mean for the actual geometry?

Ada: That formula is how they prove the dimension equality holds between the cell types. It shows that the difference in dimensions between a unit-free set and its image under epsilon is exactly equal to that specific combination of d(I) and those s terms.

Emmy: It’s essentially proving that the combinatorial data perfectly matches the geometric structure imposed by the Schubert cells, which is what solidifies the graded abelian group isomorphism they claim.

Kolya: So, if we look at this through a probabilistic lens, how does this combinatorial counting relate to what you might expect from random walks or growth processes on these varieties? Does this bijection imply anything about the distribution of these cells?

Ada: It implies that the structure is highly ordered. The existence of this perfect map means there isn't any 'noise' in the counting; every unit-free set has a corresponding Schubert cell, and vice versa.

The paper's summary: Ada: Now, let’s look at what the authors suggest could be improved or where the scope might be extended based on their work on Betti numbers of Odd Biisotropic Symplectic Grassmannians.

Emmy: They point out that while they proved the isomorphism for a specific range of k, there are still questions about determining the actual ring structure of those cohomology groups, which is a separate question they mention in Remark one point two <ref:2610.03309#pg2>.

Ada: That’s the next step for them: figuring out not just if the groups are isomorphic as abelian groups, but what their underlying algebraic structure actually is—like how they multiply together. That’s where the real deep structural work lies.

Kolya: From a research standpoint, I see an opportunity here to ask if this combinatorial machinery can be adapted to handle slightly more complex geometric structures, maybe moving away from just the odd biisotropic case.

Emmy: They do suggest that their method for constructing this map epsilon is generalizable, but they admit that verifying the bijectivity of this map across all values of k requires a careful analysis of how it behaves near the endpoints plus or minus n.

Ada: Exactly. The way they prove it works by induction on n suggests that future work might focus on proving that map works universally, not just for specific dimensions.

The paper's improvements: Emmy: To wrap up, the paper establishes a dimension-preserving bijection between the Białynicki-Birula cells and Schubert cells, which proves the isomorphism of their singular cohomology groups. This is a strong structural result linking two seemingly different geometric objects.

Ada: And they confirm that this entire process relies on counting unit-free subsets and using that counting to establish the required dimension equality, specifically d(epsilon(I)) = d(I) + k times some terms involving s+ and s-.

Kolya: From a probabilistic view, this means we have a precise way to calculate the Betti numbers. It’s not just an estimate; it’s an exact count derived from combinatorics. That level of precision is what makes this interesting for applications in algebraic topology.

Emmy: And looking ahead, while they solved the isomorphism part, they still have that open question about the ring structure of the cohomology itself. It opens up a new direction for studying these varieties beyond just their dimensions and simple group structure.

Ada: So, to summarize this paper on "Betti Numbers of Odd Biisotropic Symplectic Grassmannians," we got an explicit combinatorial map connecting two cell decompositions, proving their cohomology groups are isomorphic as graded abelian groups.

Kolya: And the next thing to watch for is whether that combinatorial framework can be pushed into more general settings, perhaps dealing with different types of constraints on those subsets.

Emmy: That’s what we’ll be looking at next: how this kind of cellular decomposition counting methods might apply to other complicated geometric spaces.

Conclusion: Ada: So we’ve looked at how they connected the cells in the odd biisotropic symplectic Grassmannian to Schubert cells in another variety, and they proved those cohomology groups are isomorphic as graded abelian groups.

Emmy: Yeah, it really shows how deep that combinatorial machinery goes when you look at these algebraic geometry objects. It’s not just a coincidence.

Kolya: I like that the dimension equality relies on counting unit-free subsets; it tells us there’s a very strict structure governing how those cells fit together.

Ada: Exactly, and the fact that they used those combinatorial invariants involving d and the s terms to verify the dimension difference is really what locks down that isomorphism.

Emmy: It’s like proving a blueprint perfectly matches the physical building you’re trying to describe; if every piece fits exactly where it should, then the whole structure is sound.

Kolya: From my side, I think what this means for us in probability is that we have a very precise way to count these features, which is usually hard when you're dealing with random walks on these spaces.

Ada: Right, so it gives us an exact counting method instead of just an approximation. That’s the utility there.

Emmy: It’s about taking that abstract geometric action and turning it into a concrete enumeration problem you can solve with specific sets of numbers.

Kolya: I wonder if we could use this technique to get bounds on something else, like how fast these counting functions grow as n gets really big.

Ada: That’s a good thought; the authors are open about the ring structure, so there’s definitely room for that kind of follow-up work.

Emmy: It opens up a whole new way to visualize what those cohomology groups are actually made of, beyond just knowing they're isomorphic.

Kolya: Well, I think we should keep an eye on how they use these counting tools for the next set of problems, because that’s where the real application might be.

Ada: Definitely. And next week, we’ll be looking at that accelerated proximal gradient method for Bures-Wasserstein space. Stay tuned.

More episodes

← Home