K-unstable Toric Varieties and Secondary Polytopes

arXiv:2610.05179 · math.AG, math.CO, math.DG · Submitted 2026-10-04 · Read on arXiv

Listen

Radio episode about this paper

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: "K-unstable Toric Varieties and Secondary Polytopes".

Emmy: Here's the gist of the paper. For K-unstable toric varieties and secondary polytopes, this paper investigates how maximal Chow-destabilizers quantize maximal K-destabilizers through a connection involving shortest GKZ vectors.

Ada: The Connection Between Stability Concepts The paper establishes that the optimal test function for K-stability, denoted as ΘP, can be quantized by the maximal Chow-destabilizers for Chow-stability, which are given by the shortest GKZ vectors.

Emmy: This connection is central to detecting K-unstability of toric varieties.

Ada: Maximal Destabilizers and Combinatorial Objects The maximal Chow-destabilizers for a toric variety (X, L) are determined by the shortest GKZ vector, which is the least norm point on the secondary polytope associated to point set Pk.

Title and authors: Ada: So we're looking at this paper right now called "K-unstable Toric Varieties and Secondary Polytopes". It comes from Chi Li, Li Sheng, and Yi Yao. It looks like they're tying together some concepts that usually live in different mathematical areas to find a way to check for K-unstability in toric varieties.

Emmy: I agree. The title itself sounds very technical, but the abstract suggests they are taking the optimal test function for K-stability, which is this function called Theta P, and trying to relate it to something more combinatorial using secondary polytopes and GKZ vectors.

Kolya: So if I'm hearing right, the paper is basically trying to quantify how we detect K-unstability by using these maximal Chow-destabilizers instead of just the standard K-destabilizers. That sounds like a very concrete way to approach a problem that's usually very abstract.

Ada: Exactly. The main idea they are pushing is that this optimal test function Theta P, which tells us about the limiting behavior of the Calabi flow, can be quantized by these maximal Chow-destabilizers for Chow-stability. They do this by connecting it to what we call shortest GKZ vectors.

Emmy: And how they do it is through a connection involving shortest GKZ vectors. They use these vectors, which are defined as the least norm point on the secondary polytope for the set P intersect k minus one Z n, to quantize Theta P <ref:2610.05179#pg1,the least norm point on the secondary polytope for the set P>. That's a big structural link they are proposing here.

Kolya: So what does this mean in terms of detecting instability? Is it just a neat mathematical trick, or does it give us something practical about when a toric variety isn't K-stable? I'm wondering if this helps us find varieties that we can actually study.

Ada: It suggests a new method for detection. Corollary five in the paper states that if you have a relatively K-unstable Delzant polytope P, then the maximal relative Chow-destabilizer Mrel P of sigma or k is less than zero for sufficiently large k. That gives us a direct criterion to spot K-unstability in these toric settings.

Emmy: But they are also building up the machinery that makes this work. They introduce properties for these sGKZ vectors, like convexity and positivity, and they even give you an algorithm to compute them, which is based on solving a quadratic programming problem over the secondary polytope.

Kolya: An algorithm is good for checking if something works, but what about the convergence part? The paper spends a lot of time showing that these maximal Chow-destabilizers actually converge to the maximal K-destabilizers in a specific sense. Does that convergence hold up under any kind of noise or approximation?

Title and authors: Ada: They prove the convergence of the minimizer psi k to negative Theta P in L2(P) and uniformly on every compact set K inside P. This convergence is established by showing that the lower limit of the boundary integral L k psi k is greater than or equal to hat P psi d sigma.

Emmy: That inequality, lim inf k Lk psi k greater than or equal to hat P psi d sigma, seems to be the heart of their proof for why these objects are equivalent. It connects the boundary behavior of the sequence of functions directly back to the optimal test function structure.

Kolya: So if we look at what this means for someone just interested in geometry, it implies that we can use a combinatorial object—the shortest GKZ vector—to measure or approximate a continuous stability concept like K-stability. That's quite powerful.

Ada: It is, because they show that minimizing the functional Psi k gives you the same result as minimizing the original functional Psi and that its minimizer converges to negative Theta P in L2(P). This equivalence between two minimization problems is a significant structural statement about these objects.

Emmy: The paper also touches on how this relates to non-Archimedean quantization of cscK metrics, showing that these maximal destabilizers for Chow-stability can quantize the cscK metrics themselves. That's where the algebraic geometry part really shines, linking it to those non-Archimedean norms.

Kolya: I wonder about the limitations here. The paper mentions that they use a specific estimate, Proposition fifty-seven which gives bounds involving constants C1, C2 and k0 that depend only on P for any smooth function phi. Is this bound strong enough to guarantee that the sequence of minimizers converges uniformly without having to impose some extra regularity on the initial data?

Ada: The bound is crucial for proving convergence. It shows that if the sequence of minimizers psi k does not converge in L2, then you can find a subsequence where the difference between Psi k and Psi is bounded away from zero. This forces the entire sequence to converge to negative Theta P in L2(P).

Emmy: And they use asymptotic behavior here too. Theorem sixty-one shows a folklore expansion for the Riemann sum, showing that as k goes to infinity, the terms of the sum approximate half of hat P f d sigma. This asymptotic relationship is what ultimately drives the convergence analysis for these functionals.

Kolya: From my side, I'm interested in how this scales. If we were dealing with a much higher dimension or a more complex polytope structure than what they studied, does this entire framework remain tractable? The computation of the sGKZ vector via the iterative process involving solving a quadratic programming problem seems like it could get computationally expensive quickly.

Title and authors: Ada: The algorithm for finding the shortest GKZ vectors is designed to be efficient. It's based on an iterative process that solves a quadratic programming problem over the secondary polytope, and it's structured so that you don't have to visit the entire secondary polytope to find sigma A. That makes it feasible for computation.

Emmy: The paper also discusses how this relates back to Chow-stability by showing that maximal Chow-destabilizers quantify maximal K-destabilizers in that specific sense. This is the bridge they build between the two stability concepts we started with at the beginning of this discussion.

Kolya: So, if we put it all together, what does this mean for a researcher trying to understand toric geometry? Does it give them a new language, or is it just another layer of machinery on top of existing tools like secondary polytopes?

Ada: It seems to offer a new way to probe K-unstability. Instead of relying only on the standard K-destabilizers, you can use these maximal Chow-destabilizers derived from shortest GKZ vectors as a tool for detection. The paper provides both the theory and the algorithm for that detection.

Emmy: It connects the continuous stability problem with discrete combinatorial objects in a very concrete way. And it shows how this connection is robust enough to establish convergence of these minimizers to Theta P in L2(P) and uniformly on compact sets.

Kolya: So, the main implication for me is that we have a new way to test for K-unstability using geometry derived from secondary polytopes, which has concrete computational tools available through the sGKZ algorithm. That feels like a solid contribution to this area of study.

Ada: It definitely seems like it provides a novel way to detect K-unstability of toric varieties by computing these sGKZ vectors. This whole paper, "K-unstable Toric Varieties and Secondary Polytopes", is a piece that connects optimal test functions with combinatorial structures in a very explicit manner.

Emmy: And it formalizes the idea that these maximal Chow-destabilizers can quantize cscK metrics by relating them to the maximal destabilizers for Chow-stability. It establishes this relationship through non-Archimedean quantization, which is a key tool in this field.

Kolya: I think the convergence proof is what makes it truly solid, showing that the sequence of minimizers actually settles down to negative Theta P. That's what gives us confidence that we are looking at something real and not just some artifact of the approximation.

Ada: Exactly. So, we've established a criterion for detecting K-unstability and a constructive method to find the relevant combinatorial objects via the sGKZ algorithm, all tied together by this quantization of Theta P. This paper is a major step forward in understanding these stability notions in toric settings.

The paper's summary: Ada: So, to recap, this paper is about finding a new way to check for K-unstability in toric varieties by looking at combinatorial objects called secondary polytopes and shortest GKZ vectors.

Emmy: Exactly. They show that the optimal test function for K-stability, which we call Theta P, can actually be quantified by these maximal Chow-destabilizers derived from those shortest GKZ vectors.

Ada: And this connection is key because it lets them detect K-unstability in a very concrete way using a criterion involving the relative Chow-destabilizer being less than zero.

Emmy: It’s like they’re taking something abstract and continuous, the K-stability of the variety, and grounding it in discrete geometry from secondary polytopes.

Ada: They build an algorithm to find those shortest GKZ vectors using a computer program called sGKZ that solves a quadratic programming problem over the secondary polytope.

Emmy: And they prove that this process converges. The sequence of minimizers for K-stability settles down to negative Theta P in a way that’s strong, both in the overall measure and locally on compact sets inside the variety.

Ada: That convergence is shown by looking at how the boundary integrals behave, which gives us a lower bound related to those shortest GKZ vectors.

Emmy: This means we have a concrete tool—the sGKZ algorithm—that can be used to test if a toric variety is K-unstable right now.

Ada: But what does this actually change for the world outside of pure mathematics? It connects continuous stability problems with discrete combinatorial data in a very explicit way.

Emmy: It also shows that these maximal Chow-destabilizers can quantify those cscK metrics we use, which is a big deal because it links algebraic geometry to non-Archimedean norms.

Ada: So, we have a criterion for detecting instability and an algorithm to find the right geometric objects. The next thing we need to think about is how robust this whole system is when you apply it to bigger or more complex varieties.

The paper's improvements: Ada: So, we're talking about how the authors suggest improving their own work on K-unstable toric varieties and secondary polytopes.

Emmy: They propose a way to make the detection even more direct by focusing on a specific set of points for those GKZ vectors.

Ada: They suggest defining the shortest GKZ vector not just as the least norm point on the whole secondary polytope, but specifically as "the least norm point on the secondary polytope for P intersect k minus one Z n."

Emmy: That’s a tighter constraint. It means we are looking at how these combinatorial objects behave when you restrict the problem to this smaller set of points related to k minus one integers.

Ada: The implication here is that this refined definition of the shortest GKZ vector should give us an even more precise handle on the maximal Chow-destabilizers for Chow-stability.

Emmy: It makes the connection between Theta P and those vectors even more specific, tying it directly to the structure of k minus one integers.

Ada: It seems like they are trying to refine the tools so that they can pinpoint K-unstability with higher precision than before.

Emmy: This moves us closer to having a more robust way to use these combinatorial objects as a direct probe for continuous stability metrics.

Ada: But you have to be careful with this refinement. The paper notes that this new definition requires the set P intersect k minus one Z n to be well-behaved in some sense for the algorithm to work properly.

Emmy: Yes, and they are focused on proving those properties hold, which is a necessary step before we can use it reliably in practice across different polytopes.

Ada: So, what does this refinement actually change for the world? It gives us a more granular way to analyze the stability of these toric spaces.

Emmy: It means that when we look at a specific polytope, say one with many facets, we can use this method to see if it's unstable without having to check every possible subdivision of it.

Ada: It’s about making the detection criterion more sensitive to subtle differences in the variety's structure.

Emmy: And they are setting up the framework for how this approach might work on even more complicated geometric objects down the line.

Conclusion: Ada: So, to wrap up, this paper on "K-unstable Toric Varieties and Secondary Polytopes" shows how we can use combinatorial objects like shortest GKZ vectors to test for K-unstability.

Emmy: It establishes that these vectors quantify the optimal test function Theta P through a connection involving maximal Chow-destabilizers for Chow-stability.

Ada: The main result is that this relationship quantizes the K-destabilizers, which we use to detect when a toric variety is unstable.

Emmy: It means we have a concrete way to bridge the gap between continuous stability theory and discrete geometry for these varieties.

Kolya: From my side, I'm interested in that convergence you mentioned. The paper shows the minimizers actually settle down to negative Theta P in a specific sense, which is what gives us confidence in the method.

Ada: Exactly. That convergence is proven by looking at how the boundary integrals behave, which ties back to those shortest GKZ vectors through an inequality involving a lower limit.

Emmy: It’s pretty solid because it connects the functional minimization problem directly to those combinatorial objects we use for geometry.

Kolya: So, what does this mean for the next step? If we apply this to more complex toric spaces, are there any immediate limitations you see?

Ada: The paper itself notes that the algorithm is based on solving a quadratic programming problem over the secondary polytope, which is computationally intensive.

Emmy: And they point out that if you want to use this for very large or highly subdivided polytopes, the computational cost grows quite fast.

Kolya: So it’s not just a theoretical tool; there are practical hurdles with the scaling of the computation.

Ada: Right, and they also have to be careful about those conditions where P intersects k minus one Z n behaves nicely enough for their estimates to hold.

Emmy: It’s a very specific domain they’re working in, so the application might be limited by how nice the input polytope P is.

Ada: Overall, this work provides a powerful new lens for probing K-unstability in toric geometry using these combinatorial tools.

Emmy: It formalizes how Chow-stability can quantify things like cscK metrics through non-Archimedean quantization, which is a deep structural link we needed.

Kolya: I think it’s a significant contribution because it gives us a direct path to testing stability using computable data instead of just abstract analysis.

Ada: So, this paper on "K-unstable Toric Varieties and Secondary Polytopes" shows us how to use shortest GKZ vectors to detect K-unstability, and the next challenge is figuring out how to make that algorithm work for even more complex geometric situations.

National Natural Science Foundation of China

math.AG, math.CO, math.DG

Submitted: 2026-10-04

Updated: 2026-11-11

Comments: 53 pages, 8 figures. language polishing

Code: https://github.com/yeeyoe/sGKZ

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 92/100

The gist: For K-unstable toric varieties and secondary polytopes, this paper investigates how maximal Chow-destabilizers quantize maximal K-destabilizers through a connection involving shortest GKZ vectors.

Key concepts

K-stability
A measure of how 'stable' a toric variety is under certain geometric conditions. The paper investigates how this stability relates to Chow-stability, using specific mathematical tools to detect when a variety is K-unstable.
Shortest GKZ Vector
These are specific points on the secondary polytope associated with a point set Pk. They represent the 'least norm' points in this polytope, which are crucial for defining maximal Chow-destabilizers and quantifying K-destabilizers.
Secondary Polytope
A geometric object that encodes all possible subdivisions of a given structure (like a fan or point set). It is essential here because it determines the maximal Chow-destabilizers via the shortest GKZ vector, linking combinatorial geometry to stability concepts.

Terminology

Summary

For K-unstable toric varieties and secondary polytopes, this paper investigates how maximal Chow-destabilizers quantize maximal K-destabilizers through a connection involving shortest GKZ vectors. p. 0

Where the paper says it

For K-unstable toric varieties, Székelyhidi’s optimal test-function ΘP is a mysterious concave function over the moment polytope P, which gives the maximal destabilizer for K-stability, and encodes the limiting behavior of the divergent Calabi flow. As balanced norms quantize cscK metrics, we show that ΘP can be quantized by the maximal destabilizers for Chow-stability, which are given by the shortest GKZ vectors, i.

The Connection Between Stability Concepts

The paper establishes that the optimal test function for K-stability, denoted as ΘP, can be quantized by the maximal Chow-destabilizers for Chow-stability, which are given by the shortest GKZ vectors. This connection is central to detecting K-unstability of toric varieties. p. 0

Where the paper says it

Properties and algorithm for general sGKZ vectors are given. Our result may provide a new method to detect the K-unstability of toric varieties.

Maximal Destabilizers and Combinatorial Objects

The maximal Chow-destabilizers for a toric variety (X, L) are determined by the shortest GKZ vector, which is the least norm point on the secondary polytope associated to point set Pk. The paper introduces two properties for sGKZ vectors: convexity and positivity, and provides an algorithm to compute them. p. 2

Where the paper says it

The main results are (1) We determine the maximal Chow-destabilizers by a combinatorial object called the shortest GKZ vector, see Theorem 2 below. We find two properties for sGKZ vectors: convexity and positivity, and provide an algorithm to compute them.

Quantization via Quantum Functionals

The main result shows that the quantum minimizer ψk (1.4) converges to −ΘP in L2(P) and uniformly on every compact set K ⊂ intP. p. 4

Where the paper says it

(1) When P is a Delzant lattice polytope, the quantum minimizer ψk (1. 4) converges to −ΘP in L 2 (P) and uniformly on every compact set K ⊂ intP.

This convergence is achieved by relating the quantum functional Ψk to the functional Ψ via a Γ-convergence argument. p. 0
Where the paper says it

Quantum functional Ψk 29 5. Uniform bounds for integrals via lattice sums 30 5.

Detection of K-Unstability

Corollary 5 states that if P is a relatively K-unstable Delzant polytope, then Mrel P(σ∨k) < 0 for sufficiently large k. This provides a criterion for detecting the relative K-unstability of toric varieties. p. 0

Where the paper says it

Properties and algorithm for general sGKZ vectors are given. Our result may provide a new method to detect the K-unstability of toric varieties.

Properties of Shortest GKZ Vectors

The shortest GKZ vector σA is convex, meaning the restriction of the convex envelope σ∨AA = σA. Furthermore, σA is positive at each point in A. p. 4

Where the paper says it

For any marked polytope (Q, A) with shortest GKZ vector σA ∈ Σ(A), we have (1) σA is convex, that means the restriction of the convex envelope σ ∨ A|A = σA. (2) σA : A → R is positive at each point.

Algorithm for Shortest GKZ Vectors

The paper presents an algorithm to compute the shortest GKZ vectors, sGKZ [Yao26]. This program is based on an iterative process involving solving a quadratic programming problem over the secondary polytope. p. 5

Where the paper says it

Translate the Fubini–Study and super-norm operators into simple operations in convex-analysis, in order to derive the formula of Chow-weights in §3. In §3, we study the minimization problem for Chow-weight via the secondary polytopes, and investigate the shortest GKZ vectors in §3.

Convergence of Minimizers

The convergence of the minimizer ψk to −ΘP in L2(P) and uniformly on every compact set K ⊂ intP is proven by showing that lim inf k Lk(ψk) ≥ ˆ∂P ψ∗dσ. This implies that the maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense. p. 4

Where the paper says it

, uniformly bounded and equicontinuous. Hence for smooth K-unstable toric varieties, the maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense.

p. 4
Where the paper says it

, uniformly bounded and equicontinuous. Hence for smooth K-unstable toric varieties, the maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense.

Uniform Bounds and Convergence

Proposition 57 shows that for a Delzant lattice polytope P, there exists a constant C1, C2, Cb > 0 and k0 (all only depend on P) such that for any 0 ≤ ϕ ∈ C(P) and k > k0, we have knˆPϕ ≤ Xu∈Pk2−cd(u)ϕ(u) + C1kXu∈Pk∩∂Pϕ(u) + C2k2Xu∈Pkϕ(u). This estimate is crucial for proving the convergence of the sequence. p. 4

Where the paper says it

Hence for smooth K-unstable toric varieties, the maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense. The proof uses a Γ-convergence argument, the keystone is the estimate (5.

Convergence to the Optimal Test Function

The proof shows that if ψk does not L2-converge to ψ, then there exists δ > 0 and a subsequence ψkj such that Ψkj - ψL2 ≥ δ, ∀j ≥ 1. This leads to the conclusion that the sequence of minimizers converges to −ΘP in L2(P). p. 4

Where the paper says it

(1) When P is a Delzant lattice polytope, the quantum minimizer ψk (1. 4) converges to −ΘP in L 2 (P) and uniformly on every compact set K ⊂ intP.

Convergence of Boundary Integrals

The convergence of the boundary integral Lk(ψk) to ˆ∂P ψ is shown by combining estimate (5.15) and (5.8), which implies that lim inf k Lk(ψk) ≥ ˆ∂P ψdσ. p. 4

Where the paper says it

, η ∈ C(P), which is the toric version of the general functional Q˘ k in [Yao25]. We have lim k→∞ Ψk(η) = Ψ(η), ∀η ∈ C(P).

This implies that the boundary integral converges to ˆ∂P ψ since αk → α and βk → lP uniformly. p. 4
Where the paper says it

(1) When P is a Delzant lattice polytope, the quantum minimizer ψk (1. 4) converges to −ΘP in L 2 (P) and uniformly on every compact set K ⊂ intP.

Convergence of Test Functions

The final step shows that the sequence of test functions ψk converges to ψ in L2(P) and locally uniformly on intP. This is achieved by showing that lim sup k Ψk(ψk) = Ψ(ψ), which forces ψ∗ = ψ by the uniqueness of minimizer. p. 4

Where the paper says it

We have lim k→∞ Ψk(η) = Ψ(η), ∀η ∈ C(P). Theorem 50 shows that Ψk admits a unique minimizer ψk := 2VP k n+1σ ∨ k − 2k.

Asymptotics of Riemann Sums

Theorem 61 establishes a folklore expansion of the Riemann sum for convex functions, showing that lim k→∞ 1/kn−1 Xu∈Pkfk(u) - knˆPfk dx = 1/2 ˆ∂Pfdσ. This is fundamental to the convergence analysis. p. 5

Where the paper says it

In §2, we review the structure of Berkovich analytification of toric varieties. Translate the Fubini–Study and super-norm operators into simple operations in convex-analysis, in order to derive the formula of Chow-weights in §3.

Bounding the Minimizers

The boundedness of ψk is established by showing that Lk(ψk) is bounded, and then using the fine estimate (5.7) to obtain uniform bounds on various quantities. p. 0

Where the paper says it

Quantum functional Ψk 29 5. Uniform bounds for integrals via lattice sums 30 5.

This boundedness ensures that the sequence of minimizers converges in a suitable topology.

The sGKZ algorithm is described as a computer program based on an iterative process involving solving a quadratic programming problem over the secondary polytope. This algorithm allows for the computation of σA without visiting the entire secondary polytope. p. 0

Where the paper says it

, the least norm point on the secondary polytope for the set P ∩k −1Z n. Properties and algorithm for general sGKZ vectors are given.

Connection to Chow-Stability

The paper connects Chow-stability to K-stability by showing that the maximal Chow-destabilizers quantize the maximal K-destabilizers in a certain sense. This is achieved by relating ΘP with the shortest GKZ vectors σk attached to Pk. p. 4

Where the paper says it

Connect the maximal destabilizers for Chow and K-stability. The problem is reduced to connecting ΘP with the shortest GKZ vectors σk attached to Pk.

Equivalence of Minimization Problems

The paper demonstrates that minimizing the functional Ψk(η) is equivalent to minimizing Ψ, and that its minimizer ψk converges to −ΘP. This equivalence is established through a series of reductions in Step 1 and Step 2. p. 1

Where the paper says it

There are two kinds of strengthened conditions: uniform K-stabilities [Der16] and testing more functions [Szé15]. To date, various versions of equivalence have been established, refer to [Don08; CLS18; CC21; His20; Li22; LLS23; Jub23; NS21] and their references.

The Role of the Optimal Test Function

The optimal test function ΘP is shown to be the unique minimizer of the functional Ψ(η) = 1/2ˆP η squared dx + ˆ∂P η dσ. This function encodes important information about X. p. 1

Where the paper says it

As [Szé08] showed, ΘP encodes important information of X. For instance, if the Calabi flow admits long-time solution, then the scalar curvature (as function on P) would converge to ΘP .

Final Conclusion on Convergence

The convergence of the sequence of minimizers to −ΘP in L2(P) and uniformly on every compact set K ⊂ intP is proven by showing that lim inf k Lk(ψk) ≥ ˆ∂P ψ∗dσ. This implies that the maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense.

The Role of Non-Archimedean Quantization

The use of non-Archimedean norms allows for a quantization of cscK metrics, and this is achieved by using the maximal destabilizers for Chow-stability. This is a key tool in the study of toric varieties. p. 2

Where the paper says it

One difference is that there is no Euler–Lagrange equation for maximal destabilizers, only a variational inequality. This paper study this problem for toric varieties.

The Role of Secondary Polytopes

Secondary polytopes encode all subdivisions of (P, Pk) and are crucial for determining the maximal Chow-destabilizers via the shortest GKZ vector. They are also used to determine Chow-stability by relating it to the location of Σ(A). p. 0

Where the paper says it

Integral representation of secondary polytopes 16 3. Determine Chow-stability by secondary polytopes 18 3.

p. 0
Where the paper says it

Integral representation of secondary polytopes 16 3. Determine Chow-stability by secondary polytopes 18 3.

p. 0
Where the paper says it

Integral representation of secondary polytopes 16 3. Determine Chow-stability by secondary polytopes 18 3.

The Role of Integral Representation

The integral representation of secondary polytopes relates them to §5.2 and is used to derive the formula for Chow-weights. p. 2

Where the paper says it

For toric varieties, an explicit formula of Chow-weights (for 1-ps in the diagonal torus) is obtained in [KSZ92], see also [GKZ94; Ono13]. We will derive this formula via the NA expression of Chow-weight obtained in [Yao25].

This is a gentle description of Σ(A) due to [BS92]. p. 8
Where the paper says it

(2) For a torus-invariant metric φ on L an, its tropical potential Fφ : NR → R is defined as Fφ(y) := − log |sD|φ (ϑy) = ϑy(sD) + φ(ϑy) = FP (y) + φ(ϑy). 7) The last = is due to Proposition 10 (1) below, and FP (y) := maxu∈P ⟨u, y⟩ is the support function of P.

The Role of Super-Norm Map

The super-norm map SNk: L∞ → N (Rk) is identified with the restriction map C(P) → RPk. This identification is key to relating NA norms on Rk to convex functions on P. p. 0

Where the paper says it

Uniform bounds for integrals via lattice sums 30 5. Control the normalized convex functions 34 5.

p. 0
Where the paper says it

Uniform bounds for integrals via lattice sums 30 5. Control the normalized convex functions 34 5.

The Role of Tropicalization

The tropicalization map ϱ: Xan → NP is used to reduce the Fubini–Study and super-norm maps to operations in convex-analysis. This reduction is essential for deriving the formula of Chow-weights in §3. p. 2

Where the paper says it

Maximal Chow-destabilizers for toric varieties. For toric varieties, an explicit formula of Chow-weights (for 1-ps in the diagonal torus) is obtained in [KSZ92], see also [GKZ94; Ono13].

1.

The Role of Convex Analysis

The identification FSk: N (Rk) → CPSHNA(L) is with the convex envelope map ∨: RPk → C(P), f 7→ f∨. This identifies the Chow-weight Mk (1. p. 2

Where the paper says it

For toric varieties, an explicit formula of Chow-weights (for 1-ps in the diagonal torus) is obtained in [KSZ92], see also [GKZ94; Ono13]. We will derive this formula via the NA expression of Chow-weight obtained in [Yao25].

2) with MPk(f). p. 3
Where the paper says it

9) R Pk convex envelope ∨ −−−−−−−−− ↽−−−−−−−−−⇀ restriction C(P) The Chow-weight Mk (1. 2) is identified with MPk (f) := 1 |Pk| X u∈Pk f(u) − 1 VP ˆ P f ∨ dx, ∀f ∈ R Pk , which is consistent with the formula in [KSZ92; Ono13].

The Role of Legendre Transform

The Legendre transform of the tropical potential Fφ is identified with the convex envelope of f, i.e., f∨. This is a key step in relating the Chow-weight Mk (1. p. 2

Where the paper says it

For toric varieties, an explicit formula of Chow-weights (for 1-ps in the diagonal torus) is obtained in [KSZ92], see also [GKZ94; Ono13]. We will derive this formula via the NA expression of Chow-weight obtained in [Yao25].

2) to MPk(f). p. 3
Where the paper says it

9) R Pk convex envelope ∨ −−−−−−−−− ↽−−−−−−−−−⇀ restriction C(P) The Chow-weight Mk (1. 2) is identified with MPk (f) := 1 |Pk| X u∈Pk f(u) − 1 VP ˆ P f ∨ dx, ∀f ∈ R Pk , which is consistent with the formula in [KSZ92; Ono13].

The super-norm map SNk: CPSHNA(L) → N (Rk) is identified with the restriction map C(P) → RPk. This identification is key to relating NA norms on Rk to convex functions on P.

The Role of Asymptotics

The asymptotic behavior of the volumes of super-norms Ek (SNk(φ)) = E(φ) + o(1), as k → ∞. This is a key result in relating NA Monge–Ampère energy to the toric NA K-energy. p. 2

Where the paper says it

2) where FSk(χ) (2. 6) is the NA Fubini–Study metric induced by χ, E is NA Monge–Ampère energy, and Ek(χ) is the average of jumping numbers (2.

The Role of Riemann Sum Expansion

The asymptotic behavior of the Riemann sum (A.2) provides a way to approximate the functional Ψk(η) by Ψ. p. 0

Where the paper says it

Connect shortest GKZ vector with optimal test-function 29 5. Quantum functional Ψk 29 5.

This expansion is used to show that lim k→∞ Ψk(η) = Ψ(η), ∀η ∈ C(P). p. 5
Where the paper says it

AI disclosure. Generative AI tools (GPT, Gemini) were used to help construct the proof of minimizer convergence and the Riemann sum expansion (A.

The Role of Lattice Sums

Proposition 52 provides a rough estimate for the integral of convex functions, showing that Pϕdx ≤ CPk n Xu∈Pkϕ(u). This is used to bound the integral terms in the convergence proof. p. 5

Where the paper says it

AI disclosure. Generative AI tools (GPT, Gemini) were used to help construct the proof of minimizer convergence and the Riemann sum expansion (A.

The Role of Fine Estimate

The fine estimate (5.7) provides a crucial bound on the terms in the convergence proof, which is essential for proving that u = uh almost everywhere. p. 0

Where the paper says it

Bound the minimizers 35 5. Convergence 36 5.

This estimate is only available for Delzant polytopes. p. 4
Where the paper says it

7), which simplifies a result of Lee and Yotsutani [LY26]. This estimate is the only part relying on Delzant condition, it may fail for non-Delzant polytopes, see Remark 60.

The Role of Continuity Modulus

The continuity modulus ωˆ(δ) is used to show that the sequence of convex functions converges, and it is subadditive. This property is essential for establishing the uniform convergence. p. 0

Where the paper says it

Quantum functional Ψk 29 5. Uniform bounds for integrals via lattice sums 30 5.

The Role of Subpolytope Decomposition

The decomposition of P into Pρ = Xρ with apex 0 and base Fρ (facet of P associated to ρ) is used in the analysis. This decomposition is key to relating the integral terms in the convergence proof. p. 4

Where the paper says it

Hence for smooth K-unstable toric varieties, the maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense. The proof uses a Γ-convergence argument, the keystone is the estimate (5.

The Role of GKZ Vectors

GKZ vectors are used to determine maximal Chow-destabilizers via Theorem 23, which relates them to the face poset of Σ(A). They are also used to determine Chow-stability by relating it to the location of Σ(A).

Secondary polytopes encode all subdivisions of (Q, A) and are crucial for determining the maximal Chow-destabilizers via the shortest GKZ vector. They are also used to determine Chow-stability by relating it to the location of Σ(A).

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved system can detect K-unstability of toric varieties by computing sGKZ vectors, which are defined as the least norm point on the secondary polytope for the set P intersect k minus 1 Z n.

  2. The system can determine maximal Chow-destabilizers for toric varieties by identifying them with the shortest GKZ vectors, allowing it to detect the K-unstability of toric varieties and establishing a connection between optimal test function ΘP and the shortest GKZ vectors σk attached to Pk.

  3. The AI system can quantify cscK metrics by relating them to Chow-stability maximal destabilizers, showing that ΘP can be quantized by the maximal destabilizers for Chow-stability, which are given by the shortest GKZ vectors.

  4. The system can compute the optimal test function ΘP for K-unstable toric varieties by finding its unique minimizer of a specific functional, as shown in Theorem 43: inf Mbar P (eta) 0 not equal eta in C1(P) and L2(P) = -ΘP - Sbar L2.

  5. The system can verify the convergence of maximal Chow-destabilizers to maximal K-destabilizers, as stated in Theorem 4: The maximal Chow-destabilizers quantize the maximal K-destabilizers in the above sense.

  6. The AI system can implement an algorithm for finding shortest GKZ vectors using a computer program called sGKZ, which solves a quadratic programming problem to find ρ = argmin g 2 g in conv(V) subset Σ(A)."

Abstract

For a K-unstable toric variety, Székelyhidi's optimal test-function Θ P is a mysterious concave function over the moment polytope P, which gives the maximal destabilizer for K-stability, and encodes the limiting behavior of the divergent Calabi flow. As balanced norms quantize cscK metrics, we show that Θ P can be quantized by the maximal destabilizers for Chow-stability, which are given by the shortest GKZ vectors, i.e., the least norm point on the secondary polytope associated to the set P k-1 Z n. The proof is via the Γ-convergence method. Properties and algorithms for general sGKZ vectors are given. It may provide a new method to detect the K-instability of Delzant polytopes.

Sources

Related papers