Multigraded Betti numbers of Veronese embeddings

This paper investigates the multigraded Betti numbers of Veronese embeddings by interpreting them through Hochster's formula as homology groups of specific simplicial complexes and utilizing Forman's discrete Morse theory to establish vanishing and non-vanishing results.

The Gist

Imagine you are an architect trying to build a massive, intricate sculpture out of Lego bricks. You have a specific set of rules for how the bricks can snap together. In the world of mathematics, this "sculpture" is a geometric shape called a Projective Space, and the "rules" for building it are defined by something called a Veronese Embedding.

This paper is like a detective story where two mathematicians, Christian and Zongpu, are trying to figure out exactly how many different ways this Lego sculpture can be assembled, and more importantly, where it is impossible to build anything at all.

Here is the breakdown of their journey, translated into everyday language:

1. The Big Puzzle: The "Betti Table"

In math, when you build these shapes, you create a "blueprint" called a Betti table. Think of this table as a spreadsheet that tells you:

• Rows: How complex the connections are (like single bricks vs. whole walls).
• Columns: The specific "weight" or "color" of the bricks used.

The goal of this paper is to fill in this spreadsheet. They want to know: For a specific combination of brick colors and weights, does a valid structure exist, or is it a dead end?

2. The Magic Translator: Hochster's Formula

Directly counting the ways to build these structures is incredibly hard, like trying to count every possible grain of sand on a beach by looking at the whole beach at once.

The authors use a "magic translator" called Hochster's Formula. This formula turns the hard algebra problem into a topology problem (the study of shapes).

• The Analogy: Instead of counting Lego bricks, they are now looking at a web of strings (a simplicial complex).
• If the web has "holes" (like a donut has a hole in the middle), that means a valid structure exists.
• If the web is just a solid blob with no holes (or if it's empty), then no structure can be built there.

3. The Strategy: Discrete Morse Theory

Now that they have a web of strings, how do they count the holes? They use a technique called Discrete Morse Theory.

• The Analogy: Imagine the web is a mountain range. You want to find the peaks and valleys.
• The authors act like a hiker with a special map. They pair up parts of the web that cancel each other out (like a hill and a valley merging into flat ground).
• What's left after all the cancellations are the critical points (the true peaks).
• The Result: If you are left with a single peak, you have a sphere (a hole). If you are left with nothing, the shape is empty. This tells them exactly how many "holes" (valid structures) exist.

4. The Three Big Discoveries

Using this hiker's map, the authors found three major rules about where the "holes" (valid structures) appear and where they disappear.

Rule 1: The "Too Heavy" Zone (Vanishing Theorem 1)

• The Scenario: Imagine you try to build your sculpture using too many "heavy" bricks (specifically, too many bricks of the first color).
• The Finding: If the weight of the first color gets too high (above a certain limit called $A_j$), the structure collapses. The web of strings becomes a "cone" (a solid shape with no holes).
• In Plain English: "If you pile too many heavy bricks on the left side, the whole thing becomes too rigid to have any interesting shapes. The answer is zero."

Rule 2: The "Too Light" Zone (Vanishing Theorem 2)

• The Scenario: Now imagine you use almost no "heavy" bricks at all.
• The Finding: If the weight is too low (below a limit called $\tilde{l}_j$), the structure also collapses, but in a different way. It becomes a cone pointing in a different direction.
• In Plain English: "If you don't use enough heavy bricks, the structure falls apart into a flat pancake. Again, the answer is zero."

Rule 3: The "Sweet Spot" (Non-Vanishing Results)

• The Scenario: What happens right in the middle, between the "too heavy" and "too light" zones?
• The Finding: This is where the magic happens. The authors found a specific "sweet spot" where the web of strings forms a perfect sphere (or a bunch of them stuck together).
• The Result: They can count exactly how many spheres are there. It's like finding a hidden treasure chest in the middle of a desert. They proved that in this specific zone, the number of valid structures is exactly equal to the number of ways you can pick certain combinations of bricks.

5. Why Does This Matter?

You might ask, "Who cares about Lego sculptures and string webs?"

• For Mathematicians: This solves a decades-old mystery about how these shapes behave. It's like finally having the complete instruction manual for a very complex toy that everyone has been trying to figure out.
• For the Future: These "Betti numbers" are used in computer science, cryptography, and physics to understand the underlying structure of data and space. Knowing exactly where the "holes" are helps engineers design better algorithms and models.

Summary

The paper is a guidebook for navigating a mathematical landscape.

1. Translate the hard building problem into a shape problem (Hochster).
2. Simplify the shape by pairing up parts that cancel out (Morse Theory).
3. Map the boundaries:
   • Too heavy? No holes.
   • Too light? No holes.
   • Just right? Here are the holes, and here is exactly how many there are.

They didn't just guess; they proved exactly where the "sweet spots" are and showed that their boundaries are the absolute best possible limits.

Technical Summary

Here is a detailed technical summary of the paper "Multigraded Betti Numbers of Veronese Embeddings" by Christian Haase and Zongpu Zhang.

1. Problem Statement

The paper addresses a central open problem in commutative algebra and algebraic geometry: determining the Betti table of the coordinate ring of projective space $\mathbb{P}^m$ under the $d$-uple Veronese embedding ($\mathbb{P}^m \to \mathbb{P}^{n-1}$).

While the case $m=1$ is well-understood and the case $m=2$ has known results for coarsely graded Betti numbers (vanishing ranges), the multigraded Betti numbers $\beta_{p,b}$ remain largely unknown for general $m$ and $d$. The authors aim to:

1. Establish precise vanishing and non-vanishing conditions for these multigraded Betti numbers.
2. Compute exact values for specific boundary cases.
3. Prove the optimality of the derived bounds.

2. Mathematical Framework and Methodology

2.1. Algebraic Setup

• Veronese Subring: Let $A = \{a \in \mathbb{N}^{m+1} \mid |a| = d\}$ be the set of monomials of degree $d$. The Veronese subring $k[NA]$ is the image of the polynomial ring $S = k[x_1, \dots, x_n]$ (where $n = \binom{d+m}{m}$) under the map $\hat{\pi}$ defined by the semigroup homomorphism $\pi: \mathbb{N}^n \to \mathbb{Z}^{m+1}$.
• Multigrading: The ring $k[NA]$ is multigraded by $\mathbb{N}^{m+1}$. The goal is to compute the multigraded Betti numbers $\beta_{p,b}(k[NA])$.

2.2. Combinatorial Translation (Hochster's Formula)

The authors utilize Hochster's Formula to translate the algebraic problem into a topological one.

• For a degree $b \in NA$, they define a simplicial complex $\Delta_b$:
  $$\Delta_b = \{ I \subseteq \{1, \dots, n\} \mid b - \sum_{i \in I} a_i \in NA \}$$
• Key Relation: $\beta_{p,b} = \dim_k \tilde{H}_{p-1}(\Delta_b; k)$.
• Thus, computing Betti numbers reduces to calculating the reduced simplicial homology of $\Delta_b$.

2.3. Topological Tools (Discrete Morse Theory)

To analyze the homology of $\Delta_b$, the authors employ Forman's Discrete Morse Theory.

• They construct discrete vector fields on $\Delta_b$ to pair simplices, thereby canceling them out in homology.
• Critical Simplices: The homotopy type of $\Delta_b$ is determined by the remaining "critical" simplices. If $\Delta_b$ is a cone, its homology vanishes. If it is homotopy equivalent to a wedge of spheres, the Betti numbers correspond to the number of spheres.

3. Key Contributions and Results

The paper establishes three main theorems regarding the behavior of $\beta_{p,b}$.

3.1. Vanishing Theorem 1 (Upper Bound on Coordinates)

Theorem 1.1: If the first coordinate $b_0$ of the degree vector $b$ (where $|b|=dj$) is sufficiently large ($b_0 \geq A_j$), then $\beta_{p,b} = 0$ for all $p$.

• Mechanism: The authors prove that if $b_0$ exceeds a combinatorial bound $A_j$, the complex $\Delta_b$ becomes a cone over the vertex corresponding to the monomial $(d, 0, \dots, 0)$.
• Significance: This provides a sharp upper bound for the support of non-vanishing Betti numbers in the first coordinate direction.

3.2. Vanishing Theorem 2 (Lower Bound on Coordinates)

Theorem 1.2: If $j \geq d+1$ and the first coordinate $b_0$ is sufficiently small ($b_0 \leq \tilde{l}_j$), then $\beta_{p,b} = 0$ for all $p$.

• Mechanism: In this regime, $\Delta_b$ is shown to be a cone over vertices like $(0, d, 0, \dots, 0)$ or $(0, 0, d, \dots, 0)$.
• Note: The bound $\tilde{l}_j$ is defined implicitly via a maximization problem involving the second coordinate sums of subsets, and no closed formula is provided, though tables are given for small $d$.

3.3. Non-Vanishing and Exact Computation

Theorem 1.3: For specific boundary cases where $b_0 = A_{p+1} - 1$ and $|b| = d(p+1)$, the authors compute the exact Betti numbers.

• Result: The complex $\Delta_b$ is homotopy equivalent to a wedge sum of $\#D$ copies of the sphere $S^{p-1}$.
• Formula: $\beta_{p,b} = \#D$, where $D$ is a specific set of subsets determined by the coordinates of $b$.
• Corollary: This yields a precise condition for when $\beta_{p,b} \neq 0$ in these critical cases, refining previous knowledge for the quadratic Veronese ($d=2$) and extending it to general $d$.

3.4. Optimality of Bounds

Theorem 7.1: The authors prove that the upper bounds $A_{p+1}$ derived in Theorem 1.1 are optimal.

• They construct specific degree vectors $b$ where $b_0 = A_{p+1} - 1$ such that $\beta_{p,b} \neq 0$. This confirms that the vanishing region cannot be extended further.

4. Significance and Context

• Advancement over Previous Work: While previous works (e.g., [BEGY20]) computed these numbers computationally for low degrees, this paper provides theoretical proofs and general structural results. It complements existing work on bounded degree graph complexes (where $d=2$) by varying $d$ and generalizing to higher dimensions.
• Methodological Innovation: The paper successfully bridges commutative algebra and combinatorial topology. By using Discrete Morse Theory to analyze the specific structure of Veronese-related simplicial complexes, it offers a powerful tool for determining homology without relying solely on heavy computation.
• Geometric Interpretation: The results clarify the geometry of the syzygies of Veronese embeddings. The vanishing theorems define the "shape" of the Betti table, while the non-vanishing results identify the exact "spikes" where syzygies exist.
• Generalization: While the core proofs are detailed for $m=2$ (projective plane), the paper explicitly generalizes the arguments to arbitrary $m \geq 2$ in Section 6, making the results applicable to Veronese embeddings of any projective space.

5. Conclusion

Haase and Zhang provide a comprehensive combinatorial analysis of the multigraded Betti numbers of Veronese embeddings. By interpreting these numbers through the lens of simplicial homology and applying discrete Morse theory, they establish sharp vanishing bounds and exact formulas for specific critical cases. This work significantly deepens the understanding of the syzygies of Veronese varieties, moving from computational observations to rigorous structural theorems.