Math 2.0

Convex and discrete geometry Polytopes and polyhedra Theorem

g-theorem

Builds on f-vector and h-vectorDehn–Sommerville equationsBinomial coefficient

Statement

Let d≥1d \ge 1 and let (h0,h1,…,hd)(h_0, h_1, \dots, h_d) be a sequence of integers. Let g0=h0g_0 = h_0 and gi=hi−hi−1g_i = h_i - h_{i-1} for 1≤i≤⌊d/2⌋1 \le i \le \floor{d/2}. Then (h0,…,hd)(h_0, \dots, h_d) is the h-vector of the boundary complex of a simplicial convex polytope of dimension dd if and only if the following hold:

  1. hi=hd−ih_i = h_{d-i} for 0≤i≤d0 \le i \le d.
  2. g0=1g_0 = 1.
  3. 0≤gi+1≤gi⟨i⟩0 \le g_{i+1} \le g_i^{\langle i \rangle} for 1≤i≤⌊d/2⌋−11 \le i \le \floor{d/2} - 1, and g1≥0g_1 \ge 0.

Here, for integers a≥0a \ge 0 and i≥1i \ge 1, write a=(nii)+(ni−1i−1)+⋯+(njj)a = \binom{n_i}{i} + \binom{n_{i-1}}{i-1} + \dots + \binom{n_j}{j} with ni>ni−1>⋯>nj≥j≥1n_i > n_{i-1} > \dots > n_j \ge j \ge 1 (this expansion exists and is unique), and set a⟨i⟩=(ni+1i+1)+(ni−1+1i)+⋯+(nj+1j+1)a^{\langle i \rangle} = \binom{n_i + 1}{i + 1} + \binom{n_{i-1} + 1}{i} + \dots + \binom{n_j + 1}{j + 1}, with 0⟨i⟩=00^{\langle i \rangle} = 0.

Remarks

Condition 1 is the Dehn–Sommerville equations. Conditions 2 and 3 say that (g0,…,g⌊d/2⌋)(g_0, \dots, g_{\floor{d/2}}) is an M-sequence, the Hilbert function of a graded quotient of a polynomial ring generated in degree 11; in particular h0≤h1≤⋯≤h⌊d/2⌋h_0 \le h_1 \le \dots \le h_{\floor{d/2}}. The conditions were conjectured by McMullen. Billera and Lee proved sufficiency by constructing polytopes, and Stanley proved necessity with the hard Lefschetz theorem for toric varieties.

Example: the boundary of the 44-dimensional cross-polytope has h=(1,4,6,4,1)h = (1, 4, 6, 4, 1) and g=(1,3,2)g = (1, 3, 2). Here 3=(31)3 = \binom{3}{1}, so 3⟨1⟩=(42)=6≥23^{\langle 1 \rangle} = \binom{4}{2} = 6 \ge 2, and all conditions hold.

The sequence (1,1,3,1,1)(1, 1, 3, 1, 1) is symmetric, but g=(1,0,2)g = (1, 0, 2) and 0⟨1⟩=0<20^{\langle 1 \rangle} = 0 < 2, so it is not the h-vector of a simplicial 44-polytope.

Going deeper

For a student

The g-theorem is a model of how commutative algebra and algebraic geometry solve combinatorial problems. The h-vector of a simplicial polytope is the Hilbert function of an Artinian reduction of its Stanley–Reisner ring. The hard Lefschetz property gives an injective multiplication map, and this forces the g-vector to be an M-sequence. The same characterization for all simplicial spheres was a long-standing conjecture; Adiprasito announced a proof in 2018.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binomial coefficient concept
  2. Polytope combinatorics concept
  3. Simplicial complex concept
  4. f-vector and h-vector concept
  5. Dehn–Sommerville equations statement
  6. g-theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Simplicial_sphere
About this page
Tag4CZMWQVC30
URIm2://4CZMWQVC30
Kindstatement, theorem
WritingW0 stub
MSC52B05, 05E45
StatusThis copy of the site has no build data. Run m2 status 4CZMWQVC30.
Aboutf-vector and h-vector
Usesf-vector and h-vector, Dehn–Sommerville equations, Binomial coefficient
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.