🔢 mathematics

Embeddings of weighted projective spaces

This paper establishes sharp arithmetic criteria and combinatorial tools to determine the minimal powers $k$ for which the line bundle $L^{\otimes k}$ on a weighted projective space yields a very ample and projectively normal embedding, extending previous results by Payne, Hering, and Bruns-Gubeladze.

Original authors: Praise Adeyemo, Dominic Bunnett, Fabián Levicán-Santibáñez

Published 2026-02-25

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Praise Adeyemo, Dominic Bunnett, Fabián Levicán-Santibáñez

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

The Big Picture: Building with Lego Bricks

Imagine you are an architect trying to build a perfect structure using a specific set of Lego bricks. In the world of mathematics (specifically algebraic geometry), these "bricks" are called line bundles, and the "structures" are shapes called projective varieties.

The main question this paper asks is: "How many times do I need to copy my set of bricks before I can build a structure that is perfectly stable and fits together without any gaps?"

In math-speak, this is asking when a shape is "very ample" (stable enough to be built) and "projectively normal" (fits together perfectly with no weird holes or missing pieces).

The Characters: Weighted Projective Spaces

The authors focus on a specific type of shape called a Weighted Projective Space.

The Analogy: Think of a standard triangle (a simplex) where all sides are equal. Now, imagine a triangle where the sides are different lengths, or where the "corners" have different weights.
The Weights: These are just numbers (like 1, 6, 10, 15) assigned to the corners. These numbers dictate how the shape behaves.
The Goal: The authors want to know: "If I have these specific weights, how much do I need to 'stretch' or 'dilate' the shape (multiply the weights) before it becomes a perfect, stable building block?"

The Problem: The "Goldilocks" Zone

For a long time, mathematicians knew a safe rule: "If you stretch the shape enough (specifically, $n-1$ times, where $n$ is the number of dimensions), it will definitely work." This is like saying, "If you use enough glue, the tower won't fall."

But the authors wanted to know: Can we do better? Can we find the exact moment the shape becomes perfect? Sometimes, you don't need to stretch it as much as the old rule says. But sometimes, you need to stretch it a lot more than you'd expect.

The Key Discoveries

1. The "Coprime" Secret (The Friendly Neighbors)

The paper finds a simple rule: If the weights on the corners are "friendly" to each other (mathematically, they are coprime, meaning they share no common factors other than 1), the shape is perfect immediately.

Analogy: Imagine a group of people where everyone speaks a different language. They can't form cliques or share secrets. Because they are so distinct, they work together perfectly right away.
Result: If the weights are distinct and coprime, you don't need to stretch the shape at all. It's ready to use!

2. The "Bubble" Problem (The Stubborn Shapes)

The authors discovered that if you have weights that share factors (like 6, 10, and 15, which all share factors of 2, 3, or 5), the shape can get "stuck." It might look like it should work, but it has hidden holes.

The Famous Example: They revisit a famous example from 2005: the shape with weights (1, 6, 10, 15).
The Metaphor: This shape is like a house built with bricks that have a hidden crack. Even if you try to build it, it won't hold together perfectly until you stretch it enough to cover the cracks.
The Breakthrough: The authors proved that this specific combination of numbers is the "first" and "worst" case for 3D shapes. They created a recipe to generate infinite new shapes that are even "stubborner" than this one.

3. The "Hypergraph" Map (The Detective's Board)

To solve these puzzles, the authors invented a new way to look at the numbers. They turned the numbers into a Hypergraph.

The Analogy: Imagine a detective's corkboard.
- The dots on the board are the numbers (weights).
- The strings connecting the dots represent the mathematical relationships between them.
How it helps: By looking at the pattern of strings, the authors can instantly tell if the shape will be stable. If the strings form a specific pattern (like a complete web), the shape is safe. If the strings are sparse or tangled in a specific way, the shape is "non-normal" (has holes).
The Frobenius Connection: They also linked this to the "Coin Problem" (a classic puzzle about making change). They realized that the "holes" in the shape are mathematically identical to the amounts of money you cannot make with a specific set of coins.

The "Maximally Non-Normal" Discovery

The paper's biggest achievement is finding shapes that are as "broken" as possible.

The Goal: They wanted to find shapes that require the maximum possible amount of stretching to become perfect.
The Method: They used an algorithm (a step-by-step recipe) to generate these shapes using prime numbers.
The Result: They proved that for any dimension, you can construct a shape that is "maximally broken." They even gave a specific example: a shape with weights related to the primes 2, 5, 7, 11, and 619. This shape is so stubborn that it requires a massive amount of stretching to fix.

Why Does This Matter?

You might ask, "Who cares about weird shapes with heavy weights?"

Efficiency: In computer science and cryptography, we often need to know the exact properties of these shapes to optimize algorithms. Knowing the "breaking point" helps us save time and computing power.
Understanding the Rules: This paper helps us understand the fundamental rules of geometry. It tells us exactly when a mathematical object behaves "nicely" and when it behaves "badly."
The "Bubble" Analogy: Just as a bubble pops if the surface tension is too weak, these mathematical shapes fail if the weights aren't balanced right. This paper tells us exactly how much tension is needed to keep the bubble from popping.

Summary in One Sentence

This paper is a guidebook for architects of the mathematical universe, teaching them how to spot "broken" shapes, how to fix them by stretching them just the right amount, and providing a new set of tools (hypergraphs) to predict exactly when a shape will finally stand up straight.

1. Problem Statement

The paper addresses a fundamental problem in algebraic geometry and discrete geometry: determining the precise power $k$ for which the tensor power $L^{\otimes k}$ of an ample line bundle $L$ on a projective toric variety $X$ becomes very ample (defining an embedding) and projectively normal (defining a normal embedding).

Context: For a general projective variety, these properties hold asymptotically, but finding sharp bounds is difficult.
Specific Focus: The authors focus on weighted projective spaces $P(a_0, \dots, a_n)$ . Due to the Picard rank being one, the problem reduces to studying the ample generator of the Picard group.
Combinatorial Translation: Via toric geometry, these geometric properties correspond to properties of lattice polytopes. Specifically, for weighted projective spaces (where at least one weight is 1), the relevant polytopes are rectangular simplices $\Delta(\lambda_1, \dots, \lambda_n)$ , defined as the convex hull of $\{0, \lambda_1 e_1, \dots, \lambda_n e_n\}$ .
Key Indices: The authors define two invariants:
- $\mu_{va}(P)$ : The smallest $k$ such that $kP$ is very ample.
- $\mu_{norm}(P)$ : The smallest $k$ such that $kP$ is normal for all $m \ge k$ .
The Gap: While the classical Ewald-Wessels bound guarantees normality for $k \ge n-1$ , the paper investigates cases where this bound is sharp (i.e., finding simplices where $\mu_{norm} = n-1$ ) and explores the relationship between very ampleness and normality.

2. Methodology

The authors employ a hybrid approach combining toric geometry, combinatorial number theory, and hypergraph theory.

Reduction to Rectangular Simplices: They establish that the study of weighted projective spaces $P(1, a_1, \dots, a_n)$ is equivalent to studying rectangular simplices $\Delta(\lambda_1, \dots, \lambda_n)$ .
Divisibility Conditions: They characterize the Lattice Points on Edges (LPE) property. A simplex satisfies $LPE(k)$ if every edge contains at least $k$ lattice points. They prove this is equivalent to a divisibility condition: $\gcd(\lambda_i, \lambda_j) \ge k-1$ for all pairs of entries.
Periodicity: Leveraging results from Bruns and Gubeladze, they utilize the periodicity of normality with respect to the least common multiple (LCM) of the weights. This allows them to construct infinite families of examples from finite sets.
Hypergraph Correspondence: A novel contribution is the introduction of a correspondence between rectangular simplices and weighted hypergraphs. The vertices of the hypergraph represent the indices of the simplex entries, and edges represent the prime factorization structure of the weights. This allows geometric properties (like normality and LPE) to be read off as combinatorial properties of the hypergraph.
Frobenius Coin Problem: They connect the concept of almost 1-normality (a weaker form of normality) to the Frobenius number (the largest integer that cannot be formed by a linear combination of a set of integers). This provides a computational tool to verify normality conditions.

3. Key Contributions and Results

A. General Bounds and Criteria

Repeated Weights: They prove that repeating a weight in the projective space does not change the normality or very ampleness indices. Consequently, maximizing these indices requires distinct weights.
Coprime Weights: If all distinct weights are pairwise coprime, the line bundle is very ample ( $\mu_{va} = 1$ ).
Sharpness of Bounds: They confirm that the Ewald-Wessels bound ( $n-1$ ) is sharp for weighted projective spaces. They provide an algorithmic construction of "genuine" weighted projective spaces (not fake ones) that achieve this maximal non-normality.

B. Maximally Non-Normal Simplices

Theorem 4.3: The authors provide an algorithm to construct infinitely many maximally non-normal rectangular simplices (where $\mu_{norm} = n-1$ $μ_{n or m} = n - 1$ ) for any dimension $n \ge 3$ $n \geq 3$ .
- The construction relies on selecting a set of distinct primes $P = \{p_1, \dots, p_{n-1}\}$ such that $\sum 1/p_i \le 1$ .
- Using the Chinese Remainder Theorem and Dirichlet's theorem on arithmetic progressions, they find a prime $p_n$ such that $\Delta(p_1, \dots, p_n)$ is maximally non-normal.
Example: They explicitly identify $\Delta(2, 5, 7, 11, 619)$ as a simplex with maximal normality index 4.

C. Hypergraphs and Almost 1-Normality

Combinatorial Characterization: They define a bijection between rectangular simplices and weighted hypergraphs. This allows them to determine properties like $LPE(k)$ and normality purely combinatorially.
Theorem 5.14: They prove that if a rectangular simplex satisfies the $LPE(n)$ property (each edge has $n$ $n$ lattice points), it is almost 1-normal.
- Significance: This implies that the $LPE(n)$ condition is insufficient to find a simplex that is very ample but not normal, as "almost 1-normality" is a strong intermediate property.
Frobenius Connection: They use bounds on the Frobenius number (Erdős-Graham, Selmer, Brauer) to prove almost 1-normality for specific families of simplices derived from hypergraphs (e.g., those corresponding to the Fano plane).

D. Specific Counterexamples and Conditions

They revisit the famous example $P(1, 6, 10, 15)$ (associated with $\Delta(2, 3, 5)$ ), proving it is the "first" example of a non-very-ample line bundle in dimension 3.
They derive a precise condition for the very ampleness of $O(\ell)$ on $P(1, 6, 2p, 3p)$ : it is very ample if and only if $p \equiv 1 \pmod 3$ .

4. Significance

Resolution of Open Questions: The paper provides the first systematic construction of genuine weighted projective spaces with maximal normality indices for high dimensions, a problem previously open.
Unification of Fields: It bridges algebraic geometry (embeddings of varieties), discrete geometry (lattice polytopes), and combinatorics (hypergraphs and number theory).
Algorithmic Construction: The paper moves beyond existence proofs by providing Algorithm 1, which can computationally generate specific examples of extremal behavior.
Clarification of Normality vs. Very Ampleness: By proving that $LPE(n)$ implies almost 1-normality, the authors narrow the search space for the open question: "Is there a rectangular simplex that is very ample but not normal?" They suggest that such examples, if they exist, must lie outside the $LPE(n)$ regime.

5. Conclusion

The paper successfully refines the understanding of embeddings in weighted projective spaces. It establishes that while general bounds exist, the arithmetic structure of the weights (specifically their prime factorization and divisibility) dictates the sharpness of these bounds. The introduction of hypergraphs as a tool to analyze these simplices offers a powerful new framework for future research in toric geometry and integer programming. The authors note that their work runs parallel to and complements recent independent work by Muller and Paemurru.