Notices of the American Mathematical Society

Welcome to the current issue of the Notices of the American Mathematical Society.
With support from AMS membership, we are pleased to share the journal with the global mathematical community.


Combinatorial Hodge Theory

Christopher Eur
Matt Larson

Communicated by Notices Associate Editor Han-Bom Moon

Developed classically in the context of complex geometry, Hodge theory gives certain rigid structures on the cohomology rings of compact Kähler manifolds. In the past few decades, it has been discovered that these structures exist in other contexts as well. Finding such “Hodge theoretic” structures associated to combinatorial objects has led to remarkable developments, including resolutions of long-standing open problems in combinatorics. Here, we give a broad (and necessarily incomplete) snapshot of these developments in combinatorial Hodge theory. Previous surveys on this topic, with more extensive lists of references, can be found at Huh23Eur24.

In Section 1, we define the structure colloquially known as the “Kähler package” and discuss some general principles for its combinatorial applications. These general principles are illustrated in concrete examples in Sections 2, 3, and 4. These sections each feature a different combinatorial object, but they follow a common template outlined in Section 1.3, so the readers may pick and choose to their taste. In Section 5, we outline some strategies common to the proofs of the “Kähler package” for many different combinatorial structures.

1. The Kähler Package

Let us begin with a toy example.

Example 1.

Let be the polynomial ring modulo the ideal . For each , the degree graded component , as a -vector space, has a basis (as an -vector space) given by the square-free monomials:

While the symmetry in the dimensions of the graded components is apparent, there are more refined structures. For example, multiplication by is an isomorphism , and multiplication by is an isomorphism .

One may recognize the ring in the toy example as the cohomology ring of . The example gives a glimpse of the following property, which was first discovered in the cohomology rings of compact Kähler manifolds.⁠Footnote1

1

More precisely, for a projective Kähler manifold , the subring of real -forms in its cohomology ring satisfies the property stated as the “Kähler package” here. See DN06 for a proof.

Definition 2.

Let be a graded -algebra which is finite-dimensional as a -vector space, together with an isomorphism and a nonempty open convex cone . We say that satisfies the Kähler package if:

(PD)

For each , the symmetric bilinear form given by is nondegenerate.

(HL)

For each and any , the map given by multiplication by is an isomorphism.

(HR)

For each and any , the bilinear form given by is positive definite on the kernel of multiplication by .

The reader may verify these properties for the ring in the toy example, where the cone is and the isomorphism is given by .

(PD), (HL), and (HR) stands for “Poincaré duality property,” “hard Lefschetz property,” and “Hodge–Riemann relations,” after those who discovered such properties in topology and complex geometry. See Figure 1 for a visualization of the Kähler package.

Figure 1.

The rows represent the graded components , with the number of boxes equal to the dimension. The gray boxes represent the kernel of multiplication by . (PD) implies that the diagram is symmetric; (HL) implies that the diagram monotonically widens towards the middle; (HR) and (HL) imply that the signature of the bilinear form is as illustrated.

Graphic without alt text
Remark 3.

One sometimes works with the following more general setup for the Kähler package, at the cost of losing the ring structure. That is, instead of a graded -algebra, let be a (finite-dimensional) graded -vector space , together with a symmetric bilinear form and an open convex subset of commuting linear operators that satisfy . Then (PD), (HL), and (HR) can be formulated as before. Geometrically, this more general setup arises when one extends beyond manifolds to study spaces with singularities, where a “finer” invariant than singular cohomology, known as intersection cohomology, is useful. Intersection cohomology in general does not have a ring structure.

Suppose now that for a combinatorial object of “dimension” , one can construct a graded -algebra that encodes certain combinatorial data about . Examples of such and will be illustrated in Sections 2, 3, and 4. The validity of the Kähler package for can then give highly nontrivial information about . We feature two such ways in the next two subsections. Throughout, suppose that satisfies the Kähler package.

1.1. The hard Lefschetz property and Hilbert functions

Let us consider the Hilbert function, that is, the sequence of the dimensions of the graded pieces of . Firstly, Poincaré duality (PD) implies the symmetry

but the hard Lefschetz property (HL) implies an even more rigid restriction on the Hilbert function: for any and , the multiplication map must be injective for the multiplication map to be an isomorphism. Therefore, (HL) implies

or more strongly, that the sequence of consecutive differences is the Hilbert function of the quotient .

If furthermore is generated as an algebra in degree , then is also. Macaulay classified the Hilbert functions of graded algebras which are generated in degree , as follows. Given positive integers and , one can uniquely write as

Defining , we say that a sequence is a Macaulay vector (or an O-sequence) if for all . Macaulay showed that is the Hilbert function of a finite-dimensional graded algebra which is generated in degree if and only if it is a Macaulay vector HMM13, Section 6.2. We deduce that

The properties here only require the existence of one element satisfying the condition (HL). For a treatment of commutative rings with such an element, see HMM13.

1.2. Hodge–Riemann relations and log-concavity

Another application of the Kähler package concerns intersection numbers, i.e., numbers obtained by applying the map to certain products of elements in . In particular, for any choice of and in , one has a sequence defined by . The Hodge–Riemann relations (HR) with and imply the following properties of this sequence.

Proposition 4.

When and lie in , the closure of in the real vector space , the sequence defined above

is nonnegative, i.e., for all ,

is log-concave, i.e., for all , and

has no internal zeros, i.e., if and for some then for all .

In particular, it is unimodal, i.e., for some .

Proof.

The first two claimed properties are closed conditions, so let us first consider the case where . Then, (HR) with implies that for all .

For the log-concavity, if and are linearly dependent, we have for all , so assume now that they are linearly independent. For a fixed , define the bilinear form by . Then, (HR) with states that is negative definite on a codimension-1 subspace of , so cannot restrict to be positive definite on . Since , the restriction of to the 2-dimensional subspace is not negative definite. Hence, we conclude that , or, equivalently, that , as desired.

Lastly, a limit of positive and log-concave sequences with no internal zeros is nonnegative and log-concave with no internal zeros, yielding the desired result when .

In degrees higher than 1, it is difficult to deduce general inequalities from the Hodge–Riemann relations in a similar way as we have done for log-concavity here. However, the Hodge–Riemann relations in higher degrees are often useful for proving (HL) and provide additional restrictions on the structure of .

1.3. A template

The next three sections will each match the following common template, consisting of five parts.

(1)

Objects (What is ?): We state the combinatorial objects of interest. While we assume a passing familiarity with them, explicit examples are provided for the uninitiated.

(2)

Questions (What about ?): We discuss questions about that were resolved by the development of combinatorial Hodge theory for .

(3)

Algebras (What is ?): We define the algebra that satisfies the Kähler package and explain how it was used to resolve questions about .

(4)

Geometric origin (Where is from?): We explain how, for a certain subset of the objects , the ring has a geometric origin as the cohomology ring of a complex projective manifold.

(5)

“Singular” objects (How about beyond ?): Often, there is a natural enlargement of the class of combinatorial objects . Or, a different question about leads to an algebra different from the one featured in part (3). In both cases, a naive candidate for often fails the Kähler package, but we discuss briefly how one can develop a combinatorial “intersection cohomology” module to amend this failure.⁠Footnote2

2

While this is often a fascinating and intricate part of the story about the combinatorial object , our discussion is kept short due to the introductory nature of this survey.

2. Polytopes

(1) Objects.

Definition 5.

A polytope in is a bounded intersection of finitely many closed half-spaces. A subset of is a face of if it is the locus where a linear functional on achieves its minimum on , and it is a facet if it is a maximal proper face. We say is simplicial if every proper face of is a simplex.

Figure 2.

Two polytopes in . The bipyramid (two regular tetrahedra glued along a triangle) on the left is simplicial, but the cube on the right is not.

\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \setlength{\extrarowheight}{0.0pt}\begin{SVG} \tdplotsetmaincoords{70}{135} \begin{tikzpicture}[tdplot_main_coords] \par\coordinate(O) at (0,0,0); \coordinate(A) at (1,0,0); \coordinate(B) at (0.5,0.866,0); \coordinate(C) at (0.5,0.289,0.816); \coordinate(D) at (2.3, 2, 0); \par\draw[thick, black] (O) -- (A) -- (O) -- (C); \draw[thick, black] (B) -- (O); \draw[thick, black] (A) -- (C) -- (B); \draw[thick, black] (B) -- (D); \draw[thick, black] (A) -- (D); \draw[thick, black] (O) -- (D); \par\draw[thick, black, dashed] (A) -- (B); \par\end{tikzpicture} \quad\quad\quad\quad\quad\quad\begin{tikzpicture}[tdplot_main_coords] \par\coordinate(O) at (0,0,0); \coordinate(A) at (0.995,0.0998,0); \coordinate(B) at (0.995 - 0.0998,0.995 + 0.0998,0); \coordinate(C) at (-0.0998,0.995,0); \coordinate(D) at (0,0,1); \coordinate(E) at (0.995,0.0998,1); \coordinate(F) at (0.995 - 0.0998,0.995 + 0.0998,1); \coordinate(G) at (-0.0998,0.995,1); \par\draw[thick, dashed] (O) -- (A); \draw[thick, dashed] (O) -- (C); \draw[thick, dashed] (O) -- (D); \draw[thick] (F) -- (B); \draw[thick] (F) -- (E); \draw[thick] (F) -- (G); \draw[thick] (C) -- (B); \draw[thick] (C) -- (G); \draw[thick] (G) -- (D); \draw[thick] (E) -- (A); \draw[thick] (E) -- (D); \draw[thick] (B) -- (A); \end{tikzpicture} \end{SVG}

We assume that is full-dimensional in and primarily consider simplicial polytopes. We point to Zie95 as a general reference on polytopes.

(2) Questions. Of enduring interest in combinatorics is the structure of the collection of faces of a polytope . A basic starting point is the number of faces of each dimension. For , let

with for the empty face. The sequence is called the -vector. For example, in Figure 2 the bipyramid has -vector and the cube has -vector .

An intriguing structure is revealed when one applies the following invertible change of coordinates to the -vector of a polytope. Define the -vector of by

Equivalently, the -vector is defined by the relation

where and are the polynomials

For example, the bipyramid has -vector and the cube has -vector . Let us make two observations from these two examples:

We have for both. Indeed, holds in general because is the alternating sum of the face numbers, and the reduced Euler characteristic of the boundary of (which is a -dimensional sphere) is .

For the bipyramid, a simplicial polytope, the -vector is positive, symmetric, and unimodal.

Do these properties persist for all simplicial polytopes? That is, are -vectors of simplicial polytopes always positive, symmetric, and unimodal? Similar questions about nonsimplicial polytopes will be discussed in part (5). For now, we consider the following conjecture of McMullen:

A sequence of integers is the -vector of a simplicial polytope if and only if it is symmetric and the sequence , called the -vector of , is a Macaulay vector.

Note that the condition about the -vector implies the positivity and unimodality of since . Billera and Lee BL80 showed by explicit construction that if a sequence satisfies the stated conditions, then there exists a simplicial polytope with the sequence as its -vector. For the converse, i.e., that every -vector of a simplicial polytope satisfies these conditions, the proof uses the Kähler package of the following algebra associated with a simplical polytope .

(3) Algebras. Without loss of generality, translate so that it contains the origin in its interior.

Definition 6.

Let a vertex of be the polynomial ring whose variables are labelled by the vertices of . Let be the quotient ring

where and are ideals defined by

Note that is graded. A key property of is that the dimensions of the graded pieces are given by the -vector of Sta75. For example, placing the origin at the center of the base triangle of the bipyramid in Figure 2, one finds that in this case

where the variables , and correspond to the vertices of the central simplex, and the variables and correspond to the top and bottom vertices. We see that this ring is isomorphic to , whose graded components , , , have bases , , , , respectively.

Let us further make two observations about in general:

(i)

As is -dimensional (since ), we may choose an isomorphism . There is such a choice such that, for every maximal proper face of , we have .

(ii)

Let us say that a function is piecewise linear if, for every proper face of , the function is linear on the cone . The degree 1 component can be identified with the space of piecewise linear functions modulo the globally linear functions on , as follows. Because is simplicial, each element in the degree part of a vertex] uniquely defines a piecewise linear function by the assignment for every vertex . Under this correspondence, a linear function on is associated with , so the generators of the ideal correspond to globally linear functions.

We say that is ample if, for every proper face of , we can choose a piecewise linear function representing which vanishes on and is strictly positive on all vertices not contained in .⁠Footnote3 The ample elements of form an open cone . This cone is nonempty: for instance, consider the piecewise linear function which takes value on each maximal proper face of .

3

This is equivalent to being a strictly convex piecewise linear function.

Theorem 7 (Sta80aMcM93).

Let be a simplicial polytope. The triple satisfies the Kähler package.

Because is a graded algebra generated in degree 1, from our discussion in Section 1.1 about applications of the hard Lefschetz property, we conclude that the -vector is symmetric and the -vector is a Macaulay vector, i.e., McMullen’s conjecture describing the possible -vectors of simplicial polytopes holds.

(4) Geometric origin. Stanley proved that has the Kähler package by observing that it is the cohomology ring of a projective toric variety. The construction of this toric variety involves perturbing the coordinates of the vertices of so that they have rational coordinates; this does not change the structure of the faces of because is simplicial. This toric variety is in general singular, but the singularities are mild enough that the real -forms in its cohomology ring still have the Kähler package. McMullen later gave a purely combinatorial proof that avoids perturbing the coordinates or constructing toric varieties.

(5) “Singular” objects. For nonsimplicial polytopes, the -vector no longer has the pleasant properties of the -vector of simplicial polytopes. For example, we saw that the -vector of the cube is no longer nonnegative. Instead, one should consider the toric -vector Sta87, which is a combinatorial invariant of a polytope which is recursively defined in terms of the poset of faces of . When is simplicial, it agrees with the -vector. The toric -vector of the -dimensional cube is .

When the polytope has vertices with rational coordinates, the toric -vector records the dimensions of the graded pieces of the intersection cohomology of the associated projective toric variety. The hard Lefschetz theorem for intersection cohomology implies that the toric -vector is symmetric and unimodal.

For arbitrary polytopes, it may not be possible to perturb the vertices so that they have rational coordinates without changing the structure of the poset of faces, so there may be no associated toric variety. Nevertheless, Karu Kar04 showed that the toric -vector is symmetric and unimodal. He proved this by verifying that a version of the Kähler package (as formulated in Remark 3) holds for an analogue of the intersection cohomology of a projective toric variety.

3. Bruhat Posets

(1) Objects. Let be a finite-dimensional real vector space with an inner product. For a hyperplane through the origin, the reflection across defines an automorphism of .

Definition 8.

A finite Coxeter group (represented on ) is the subgroup of generated by the set of reflections where is a finite set of hyperplanes in satisfying for all .

We point to Hum90 as a general reference on Coxeter groups.

Example 9.

With the standard inner product on , the symmetric group of is a finite Coxeter group represented on with , where .

Among the remarkably rich combinatorics of a (finite) Coxeter group is its poset structure, described as follows. Fix any connected component in the complement of the hyperplanes. The connected component is an open cone whose closure has exactly many facets. Let be the reflections by these facet hyperplanes, called simple reflections. Any is a product of simple reflections; let denote the minimum number for which one can write , called the length of .

Definition 10.

The Bruhat poset is a poset on defined as the transitive closure of the relation

Two facts about the Bruhat poset follow:

It has a unique minimal element (which is the identity ) and a unique maximal element, called the longest element and denoted . Let .

It is a graded poset, graded by the length . That is, for all , every maximal chain in the interval has elements.

Remark 11.

The group acts freely and transitively on the set of connected components of the hyperplane arrangement complement . We may thus label the components by , with labelled by the identity, and a component by the unique such that . Then, the length of is the minimum number of hyperplanes that a path from to the component must cross.

Figure 3.

Diagram of the Bruhat poset .

\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \setlength{\extrarowheight}{0.0pt}\begin{tikzpicture}[scale=0.8, vertices/.style={draw, fill=black, circle, inner sep=0pt}] \node[vertices, label=right:{1234}] (0) at (-0+0,0){}; \node[vertices, label=right:{1243}] (1) at (-1.5+0,1.33333){}; \node[vertices, label=right:{2134}] (6) at (-1.5+1.5,1.33333){}; \node[vertices, label=right:{1324}] (2) at (-1.5+3,1.33333){}; \node[vertices, label=right:{2143}] (7) at (-3+0,2.66667){}; \node[vertices, label=right:{2314}] (8) at (-3+1.5,2.66667){}; \node[vertices, label=right:{1342}] (3) at (-3+3,2.66667){}; \node[vertices, label=right:{3124}] (12) at (-3+4.5,2.66667){}; \node[vertices, label=right:{1423}] (4) at (-3+6,2.66667){}; \node[vertices, label=right:{2341}] (9) at (-3.75+0,4){}; \node[vertices, label=right:{3142}] (13) at (-3.75+1.5,4){}; \node[vertices, label=right:{3214}] (14) at (-3.75+3,4){}; \node[vertices, label=right:{1432}] (5) at (-3.75+4.5,4){}; \node[vertices, label=right:{2413}] (10) at (-3.75+6,4){}; \node[vertices, label=right:{4123}] (18) at (-3.75+7.5,4){}; \node[vertices, label=right:{3241}] (15) at (-3+0,5.33333){}; \node[vertices, label=right:{3412}] (16) at (-3+1.5,5.33333){}; \node[vertices, label=right:{2431}] (11) at (-3+3,5.33333){}; \node[vertices, label=right:{4213}] (20) at (-3+4.5,5.33333){}; \node[vertices, label=right:{4132}] (19) at (-3+6,5.33333){}; \node[vertices, label=right:{3421}] (17) at (-1.5+0,6.66667){}; \node[vertices, label=right:{4231}] (21) at (-1.5+1.5,6.66667){}; \node[vertices, label=right:{4312}] (22) at (-1.5+3,6.66667){}; \node[vertices, label=right:{4321}] (23) at (-0+0,8){}; \foreach\to/\from in {0/1, 0/6, 0/2, 1/4, 1/7, 1/3, 2/8, 2/3, 2/12, 2/4, 3/13, 3/9, 3/5, 4/5, 4/10, 4/18, 5/16, 5/11, 5/19, 6/12, 6/8, 6/7, 7/9, 7/18, 7/10, 7/13, 8/9, 8/14, 8/10, 9/15, 9/11, 10/20, 10/16, 10/11, 11/17, 11/21, 12/13, 12/14, 12/18, 13/16, 13/15, 13/19, 14/20, 14/16, 14/15, 15/17, 15/21, 16/17, 16/22, 17/23, 18/20, 18/19, 19/21, 19/22, 20/21, 20/22, 21/23, 22/23} \draw[-] (\to)--(\from); \end{tikzpicture}
Example 12.

Returning to the previous example of the symmetric group represented on , let . The simple reflections correspond to adjacent transpositions . Moreover, one can show, for instance using Remark 11, that the length of a permutation is

the number of inversions of . The Bruhat poset of is illustrated in Figure 3.

(2) Questions. Given a graded poset with a unique minimum , like the Bruhat poset , we may consider its graded components. For , let

and let . A question of enduring interest for a graded poset concerns the Sperner property:

Is the maximum cardinality of an antichain (i.e., a subset consisting of pairwise incomparable elements) in equal to the maximum of ?

We may further ask whether is strongly Sperner:

For each , is there a collection of -many pairwise disjoint chains of the form with and ?

The reader may verify as an exercise that the stated strongly Sperner property indeed implies the Sperner property. Note also that the strongly Sperner property implies that is symmetric and unimodal. We explain how these questions can be answered in the case where , a Bruhat poset, by considering a graded algebra constructed from .

(3) Algebras. Let be the graded algebra of polynomials generated by a basis of . The group acts on it via its action on , so we may consider the ideal generated by the positive degree -invariant polynomials

Definition 13.

The coinvariant algebra of is the quotient

One finds the following properties of the coinvariant algebra from results of Bernšteĭn, Gelfand, and Gelfand BGG73:

(i)

There exists a collection of polynomials that forms a vector space basis in satisfying for all . We call this basis the Schubert basis of .⁠Footnote4

4

When is a Weyl group, these polynomials represents duals to the basis for the homology of the flag variety given by classes of Schubert varieties.

(ii)

Abusing notation, we write also for the image in of the connected region . This image is a nonempty open cone. For , the Schubert basis of satisfies the property that is a linear combination of .

By property (i), we may choose an isomorphism such that .

Theorem 14 (EW14).

The triple satisfies the Kähler package.

Combining the property (i) with the hard Lefschetz property of implies that is symmetric and unimodal. Moreover, Stanley observed Sta80b that combining property (ii) with the hard Lefschetz property leads to the strongly Sperner property of as follows.

Let . For each , the Schubert basis realizes multiplication by as a matrix, denoted . Denote by the submatrix of for a subset of the rows and a subset of the columns. Then, for , the Cauchy–Binet formula gives

where the summation is over all sequences of subsets such that . As is an isomorphism, the left-hand-side in is nonzero, so that a summand in the right-hand-side is nonzero for some . In particular, each square matrix has a permutation pattern with all nonzero entries, which gives a sequence of matchings between and for all . That these matchings respect the order on follows from the property (ii).

Example 15.

When , we have . A particular set of representatives for the Schubert basis of , called Schubert polynomials, is given by the following rule: first, one sets , and whenever , one sets where is an operator on defined by For example, when , we have

and the elements of form the Schubert basis.

Remark 16.

Using similar methods, the results here for the Bruhat poset can be extended to the Bruhat poset on the set of cosets of a parabolic subgroup of . For classical types (A, B, C, and D), the strongly Sperner property of admits an elementary proof Sta80b, Section 7, but this elementary method does not extend to the parabolic case .

(4) Geometric origin. When satisfies an integrality condition of being crystallographic, it is the Weyl group of a complex semisimple Lie group . In this case, Borel showed that the coinvariant algebra is the cohomology ring of the flag variety , which is a smooth projective variety. Thus, the Kähler package for follows from classical Hodge theory in this case. The Schubert basis for comes from the Bruhat decomposition of ; it is a stratification of into affine cells, whose closures in thereby defines a basis for the cohomology ring. Bernšteĭn–Gelfand–Gelfand showed how to interpret this geometric basis for purely algebraically.

For noncrystallographic finite Coxeter groups, where a Lie group is no longer available, Elias and Williamson established the Kähler package in a much more general setting of Soergel bimodules, which we discuss in the next part.

(5) “Singular” objects. For an element , we consider the interval of . Let us denote . We may ask similar questions for the interval as we did for the whole poset . However, a graded algebra with a basis labelled by the elements of the interval cannot in general satisfy the Kähler package—the cardinalities of the graded components of are often not even symmetric. For example, when , the sequence for the interval reads .

Geometrically, when is the Weyl group of a Lie group , this failure is reflected in the fact that the variety under concern is the Schubert variety of , which is in general singular. This singular variety admits a particular desingularization, known as the Bott–Samelson resolution. Extracting key algebraic and combinatorial features of this desingularization leads to Soergel bimodules, which Elias and Williamson showed satisfy the Kähler package as formulated in Remark 3. Combining this with observations made by Björner and Ekedahl BE09 (originally made only for Weyl groups), one can show that the interval satisfies a weak version of the Sperner property: for every , there exists an injection such that .

4. Matroids

(1) Objects. Let be a finite set.

Definition 17.

A matroid on consists of a nonempty set of subsets of , called the independent sets of , satisfying two properties:

if and , then , and

if with , then for some .

Maximal elements of have a common cardinality, which is called the rank of . To avoid trivialities, we suppose that is loopless, i.e., that every one-element subset is independent. We point to Wel71 as a general reference on matroids.

Figure 4.

A finite graph and a matrix representing a subspace of by its row span. The matroids associated with each are identical.

\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \setlength{\extrarowheight}{0.0pt}\begin{SVG} \begin{tabular}{cc} \par\raisebox{11pt}{ \begin{tikzpicture}[scale=0.7] \draw[fill] (0,1.1) circle [radius=0.1] (0,-1.1) circle [radius=0.1] (1.73, 0) circle [radius=0.1] (3.46,0) circle [radius=0.1] ; \draw(0,1.1) -- (0,-1.1) node [left] [midway] {$1$} (1.73, 0) -- (0,1.1) node [above] [midway] {$2$} (0,-1.1) -- (1.73, 0) node [below] [midway] {$3$} (3.46,0) -- (1.73, 0) node [midway] [above] {$4$} ; \end{tikzpicture} } \par&\qquad\raisebox{37pt}{ $ \begin{matrix} v_1 \ \ v_2 \ \ v_3 \ \ v_4 \ \ \begin{matrix} \end{matrix}\\ \begin{bmatrix} 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix} \end{matrix} $ } \end{tabular} \end{SVG}
Example 18.

Let be a finite graph with edges , such as the one illustrated in Figure 4. Then, the set {subsets of which do not contain cycles} is the set of independent sets of a matroid. Such matroids are called graphical matroids.

Example 19.

Let be a vector subspace over a field . Then, the set : the composition is surjective is the set of independent sets of a matroid. Concretely, if is the row span of an by matrix, then consists of linearly independent subsets of the column vectors . Such matroids are called linear or realizable matroids.

We caution that while graphs and linear subspaces are two prototypical sources of matroids, almost every matroid (in some precise sense) does not arise in that way.

(2) Questions. We consider two sequences of numerical invariants of a matroid of rank . First, let be the sequence that counts the number of independent sets according to their cardinality, that is,

For the second sequence, define the rank function by and for a subset . Then, we define by

which counts the subsets of the same rank with signs according to their cardinality. This sequence arises naturally in graph theory as follows. Let be the matroid of a finite connected graph with edges on vertices. A proper coloring of is a coloring of its vertices such that no incident vertices share the same color. Then, its chromatic polynomial

is related to the sequence by

Example 20.

The reader may check that in the matroid of the graph in Figure 4, we have

Long-standing conjectures from the 70s by various matroid theorists, including Mason, Rota, Heron, and Welsh, stated the following.

Both of the sequences

are log-concave with no internal zeros.

Both (and more related conjectures) were recently resolved by establishing the Kähler package for some algebras related to matroids, as we will now describe.

(3) Algebras. To define the algebra associated with a matroid , we need the following notion: a subset is said to be a flat of if it is a maximal subset of of given rank, i.e., if for all .

Definition 21.

The Chow ring of a matroid (with -coefficients) is the graded -algebra defined as the following quotient of a standard graded polynomial ring

where and and .

Let be the set of elements that can be written as

for some function satisfying and for all . Since the sum of two such functions retains this property, the set is an open convex cone in which is nonempty (for instance, let ). A recent breakthrough in matroid theory by Adiprasito, Huh, and Katz states that the Chow ring of a matroid satisfies the Kähler package.

Theorem 22 (AHK18).

There is an isomorphism defined by the property that . The triple satisfies the Kähler package.

To use the Kähler package of to deduce properties about the sequence , we need the following theorem of Huh and Katz. Let be the sequence defined by the property for all (with ).

Theorem 23.

Let and be elements of defined by and . Then, for , we have that

Because the elements and are in the closure of , we thus conclude that is log-concave with no internal zeros. The relation then easily implies that is log-concave with no internal zeros. Because the sequence can be realized as the sequence where is the free co-extension matroid of , it is also log-concave with no internal zeros.

(4) Geometric origin. When is the matroid of a linear subspace , the algebra is the cohomology ring of a complex smooth projective variety known as the wonderful compactification of a hyperplane arrangement complement, introduced by De Concini and Procesi. Thus, in this case, the Kähler package for follows from classical Hodge theory.

Moreover, let us indicate a geometric origin for the formula . Considered as elements in the cohomology ring of , the elements and are divisor classes that define a map to a projective space. For , the associated map has the image known as the reciprocal linear space, whose degree was known to be .

(5) “Singular” objects. Let us consider another numerical invariant of . Define the sequence by

Equivalently, let be the poset of flats of ordered by inclusion, which is graded by rank. Let be the -th graded component of , i.e., the set of rank flats of , so that .

It is conjectured but unknown whether this sequence is log-concave. Dowling and Wilson conjectured a related but different property, namely, that the sequence is top-heavy, i.e.,

More strongly, one may conjecture that there is an injection for each such that for all .

The resolution of this conjecture by Braden, Huh, Matherne, Proudfoot, and Wang BHM is featured in an upcoming What is…? Notices of the AMS survey. Let us give a rough sketch here.

As the question is about the graded poset , taking an inspiration from the previous discussion about the strongly Sperner property for Bruhat posets (Section 3), one may seek an algebra whose basis is naturally labelled by the flats of . Among possibly many such algebras, we consider the following one.

Definition 24.

The graded Möbius algebra of a matroid is a graded -algebra whose -th graded component is the vector space with basis , and with multiplication

where denotes the unique minimal flat of containing both and .

The graded Möbius algebra generally fails to have the Kähler package—the dimensions of its graded pieces are usually not even symmetric. Geometrically, this failure reflects that when is the matroid of a linear subspace , the graded Möbius algebra is the cohomology ring of a singular projective complex variety called the matroid Schubert variety, which is the closure of in . This singular variety admits a particular desingularization, known as the augmented wonderful compactification. By extracting key algebraic and combinatorial features of this desingularization, one can construct the intersection cohomology module of , which is a graded module with an injection . Then, with significant effort, Braden, Huh, Matherne, Proudfoot, and Wang showed that satisfies the Kähler package with consisting of linear operators given by

Then, since is a submodule of , using arguments similar to the one outlined in Section 3, one can conclude that there is an injection such that, for each , . In particular, this proves the top-heavy conjecture of Dowling and Wilson.

5. Proving the Kähler Package

It is usually very difficult to prove that an algebra has the Kähler package. For the cohomology ring of a complex Kähler manifold (or a complex projective manifold), the Kähler package is usually proved by analytic methods. However, analytic methods seem not suitable for the combinatorial settings described above in Sections 2, 3, and 4. In each of the three settings, classical Hodge theory can be used for a subset of the combinatorial objects that arise geometrically, but establishing the Kähler package in general requires an intricate analysis of combinatorics specific to each setting. Nonetheless, there is a basic inductive strategy common to all three settings, first introduced in the case of simplicial polytopes by McMullen McM93. It roughly consists of three steps:

(1)

One first proves (PD) by some direct argument. For example, often it is possible to compute a basis so that the matrix representing the pairing is upper triangular.

(2)

One then proves (HL) for all choices of elements of by inductively assuming (HR) in “lower dimensions.”

(3)

By (HL) and continuity, one then needs to verify (HR) for a single choice of an element in , often via another layer of induction.

We illustrate step 2 in the case of simplicial polytopes. Let be a -dimensional simplicial polytope in which contains the origin in its interior. For each vertex of , let be the polytope in formed by taking the convex hull of the images of the vertices such that is an edge of . We may assume that the Kähler package holds for by induction on the dimension. There is a restriction map which has the property that is ample (as defined in Section 2) if is ample. When the degree map on is normalized appropriately, this map satisfies

Since by (PD), in order to prove (HL) for , it suffices to show that for each and ample, the map given by multiplication by is injective. Suppose is in the kernel of this map. Because is ample, we can write , where for each vertex . We then have

By construction, . Therefore, by (HR) for , we have

with equality if and only if . We therefore must have for all . Then (PD) implies that .

After a variation of this argument is used to prove (HL) for , it remains to carry out step 3 and verify (HR). As the signature of a family of nondegenerate bilinear forms is constant, a continuity argument and (HL) for shows that it suffices to verify the Hodge–Riemann relations for a single choice of . To do this, typically one finds a filtration

where each is equipped with a cone and an isomorphism . The ring is very simple, and one can verify by hand that (HR) holds for it. One attempts to prove that the Kähler package holds for by induction on . We typically have and as -modules. Often this direct sum decomposition can be chosen to be orthogonal with respect to the bilinear form on , for any . One understands the signature of this bilinear form on by induction, and one attempts to relate the module to objects of lower “dimension.” Using this, one attempts to show that the restriction of this bilinear form to is nondegenerate and has the correct signature, verifying (HR) for .

In the case of polytopes one uses a version of the weak factorization theorem, which states that one can obtain any simplicial polytope from the simplex by a series of simple combinatorial operations. One verifies that (HR) is preserved under these operations. This reduces to verifying (HR) for the case of a simplex, which can be done directly.

Lastly, in Sections 2, 3, and 4, we mentioned that one can extend the validity of the Kähler package to “singular cases.” An inductive strategy for doing so in the case of complex projective varieties can be found in dCM05.

Acknowledgments

We thank Ben Elias, Eric Katz, Jacob Matherne, Chris McDaniel, Han-Bom Moon, Richard Stanley, and the referees for helpful comments on an earlier version of this article.

References

[AHK18]
Karim Adiprasito, June Huh, and Eric Katz, Hodge theory for combinatorial geometries, Ann. of Math. (2) 188 (2018), no. 2, 381–452. MR3862944,
Show rawAMSref \bib{AHK18}{article}{ author={Adiprasito, Karim}, author={Huh, June}, author={Katz, Eric}, title={Hodge theory for combinatorial geometries}, date={2018}, issn={0003-486X}, journal={Ann. of Math. (2)}, volume={188}, number={2}, pages={381\ndash 452}, url={https://doi.org/10.4007/annals.2018.188.2.1}, review={\MR {3862944}}, }
[BE09]
Anders Björner and Torsten Ekedahl, On the shape of Bruhat intervals, Ann. of Math. (2) 170 (2009), no. 2, 799–817. MR2552108,
Show rawAMSref \bib{BE09}{article}{ author={Bj\"{o}rner, Anders}, author={Ekedahl, Torsten}, title={On the shape of {B}ruhat intervals}, date={2009}, issn={0003-486X}, journal={Ann. of Math. (2)}, volume={170}, number={2}, pages={799\ndash 817}, review={\MR {2552108}}, }
[BGG73]
I. N. Bernšteĭn, I. M. Gelfand, and S. I. Gelfand, Schubert cells, and the cohomology of the spaces , Uspehi Mat. Nauk 28 (1973), no. 3(171), 3–26. MR429933,
Show rawAMSref \bib{BGG73}{article}{ author={Bern\v {s}te\u {\i }n, I.~N.}, author={Gel{$'$}fand, I.~M.}, author={Gel{$'$}fand, S.~I.}, title={Schubert cells, and the cohomology of the spaces {$G/P$}}, date={1973}, issn={0042-1316}, journal={Uspehi Mat. Nauk}, volume={28}, number={3(171)}, pages={3\ndash 26}, review={\MR {429933}}, }
[BHM]
Tom Braden, June Huh, Jacob Matherne, Nicholas Proudfoot, and Botong Wang, Singular Hodge theory for combinatorial geometries. arXiv:2010.06088.,
Show rawAMSref \bib{BHMPW}{unpublished}{ author={Braden, Tom}, author={Huh, June}, author={Matherne, Jacob}, author={Proudfoot, Nicholas}, author={Wang, Botong}, title={{S}ingular {H}odge theory for combinatorial geometries}, note={{a}rXiv:2010.06088}, }
[BL80]
Louis J. Billera and Carl W. Lee, Sufficiency of McMullen’s conditions for -vectors of simplicial polytopes, Bull. Amer. Math. Soc. (N.S.) 2 (1980), no. 1, 181–185. MR551759,
Show rawAMSref \bib{BL80}{article}{ author={Billera, Louis~J.}, author={Lee, Carl~W.}, title={Sufficiency of {M}c{M}ullen's conditions for {$f$}-vectors of simplicial polytopes}, date={1980}, issn={0273-0979,1088-9485}, journal={Bull. Amer. Math. Soc. (N.S.)}, volume={2}, number={1}, pages={181\ndash 185}, url={https://doi.org/10.1090/S0273-0979-1980-14712-6}, review={\MR {551759}}, }
[dCM05]
Mark Andrea A. de Cataldo and Luca Migliorini, The Hodge theory of algebraic maps, Ann. Sci. École Norm. Sup. (4) 38 (2005), no. 5, 693–750. MR2195257,
Show rawAMSref \bib{dCM05}{article}{ author={de~Cataldo, Mark Andrea~A.}, author={Migliorini, Luca}, title={The {H}odge theory of algebraic maps}, date={2005}, issn={0012-9593}, journal={Ann. Sci. \'{E}cole Norm. Sup. (4)}, volume={38}, number={5}, pages={693\ndash 750}, url={https://doi.org/10.1016/j.ansens.2005.07.001}, review={\MR {2195257}}, }
[DN06]
Tien-Cuong Dinh and Viêt-Anh Nguyên, The mixed Hodge-Riemann bilinear relations for compact Kähler manifolds, Geom. Funct. Anal. 16 (2006), no. 4, 838–849. MR2255382,
Show rawAMSref \bib{DN06}{article}{ author={Dinh, Tien-Cuong}, author={Nguy\^{e}n, Vi\^{e}t-Anh}, title={The mixed {H}odge-{R}iemann bilinear relations for compact {K}\"{a}hler manifolds}, date={2006}, issn={1016-443X,1420-8970}, journal={Geom. Funct. Anal.}, volume={16}, number={4}, pages={838\ndash 849}, url={https://doi.org/10.1007/s00039-006-0572-9}, review={\MR {2255382}}, }
[Eur24]
Christopher Eur, Essence of independence: Hodge theory of matroids since June Huh, Bull. Amer. Math. Soc. (N.S.) 61 (2024), no. 1, 73–102. MR4678572,
Show rawAMSref \bib{Eur24}{article}{ author={Eur, Christopher}, title={Essence of independence: {H}odge theory of matroids since {J}une {H}uh}, date={2024}, issn={0273-0979}, journal={Bull. Amer. Math. Soc. (N.S.)}, volume={61}, number={1}, pages={73\ndash 102}, review={\MR {4678572}}, }
[EW14]
Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules, Ann. of Math. (2) 180 (2014), no. 3, 1089–1136. MR3245013,
Show rawAMSref \bib{EW14}{article}{ author={Elias, Ben}, author={Williamson, Geordie}, title={The {H}odge theory of {S}oergel bimodules}, date={2014}, issn={0003-486X}, journal={Ann. of Math. (2)}, volume={180}, number={3}, pages={1089\ndash 1136}, review={\MR {3245013}}, }
[HMM13]
Tadahito Harima, Toshiaki Maeno, Hideaki Morita, Yasuhide Numata, Akihito Wachi, and Junzo Watanabe, The Lefschetz properties, Lecture Notes in Mathematics, vol. 2080, Springer, Heidelberg, 2013, https://doi.org/10.1007/978-3-642-38206-2. MR3112920,
Show rawAMSref \bib{Lefschetz}{book}{ author={Harima, Tadahito}, author={Maeno, Toshiaki}, author={Morita, Hideaki}, author={Numata, Yasuhide}, author={Wachi, Akihito}, author={Watanabe, Junzo}, title={The {L}efschetz properties}, series={Lecture Notes in Mathematics}, publisher={Springer, Heidelberg}, date={2013}, volume={2080}, isbn={978-3-642-38205-5; 978-3-642-38206-2}, url={https://doi.org/10.1007/978-3-642-38206-2}, review={\MR {3112920}}, }
[Huh23]
June Huh, Combinatorics and Hodge theory, ICM—International Congress of Mathematicians. Vol. I. Prize lectures, 2023, pp. 212–239. MR4680249,
Show rawAMSref \bib{Huh23}{incollection}{ author={Huh, June}, title={Combinatorics and {H}odge theory}, date={2023}, booktitle={I{CM}---{I}nternational {C}ongress of {M}athematicians. {V}ol. {I}. {P}rize lectures}, publisher={EMS Press, Berlin}, pages={212\ndash 239}, review={\MR {4680249}}, }
[Hum90]
James E. Humphreys, Reflection groups and Coxeter groups, Cambridge Studies in Advanced Mathematics, vol. 29, Cambridge University Press, Cambridge, 1990. MR1066460,
Show rawAMSref \bib{Hum90}{book}{ author={Humphreys, James~E.}, title={Reflection groups and {C}oxeter groups}, series={Cambridge Studies in Advanced Mathematics}, publisher={Cambridge University Press, Cambridge}, date={1990}, volume={29}, isbn={0-521-37510-X}, review={\MR {1066460}}, }
[Kar04]
Kalle Karu, Hard Lefschetz theorem for nonrational polytopes, Invent. Math. 157 (2004), no. 2, 419–447. MR2076929,
Show rawAMSref \bib{Kar04}{article}{ author={Karu, Kalle}, title={Hard {L}efschetz theorem for nonrational polytopes}, date={2004}, issn={0020-9910,1432-1297}, journal={Invent. Math.}, volume={157}, number={2}, pages={419\ndash 447}, url={https://doi.org/10.1007/s00222-004-0358-3}, review={\MR {2076929}}, }
[McM93]
Peter McMullen, On simple polytopes, Invent. Math. 113 (1993), no. 2, 419–444. MR1228132,
Show rawAMSref \bib{McM93}{article}{ author={McMullen, Peter}, title={On simple polytopes}, date={1993}, issn={0020-9910,1432-1297}, journal={Invent. Math.}, volume={113}, number={2}, pages={419\ndash 444}, url={https://doi.org/10.1007/BF01244313}, review={\MR {1228132}}, }
[Sta75]
Richard P. Stanley, The upper bound conjecture and Cohen-Macaulay rings, Studies in Appl. Math. 54 (1975), no. 2, 135–142. MR458437,
Show rawAMSref \bib{Sta75}{article}{ author={Stanley, Richard~P.}, title={The upper bound conjecture and {C}ohen-{M}acaulay rings}, date={1975}, issn={0022-2526,1467-9590}, journal={Studies in Appl. Math.}, volume={54}, number={2}, pages={135\ndash 142}, url={https://doi.org/10.1002/sapm1975542135}, review={\MR {458437}}, }
[Sta80a]
Richard P. Stanley, The number of faces of a simplicial convex polytope, Adv. in Math. 35 (1980), no. 3, 236–238. MR563925,
Show rawAMSref \bib{Sta80a}{article}{ author={Stanley, Richard~P.}, title={The number of faces of a simplicial convex polytope}, date={1980}, issn={0001-8708}, journal={Adv. in Math.}, volume={35}, number={3}, pages={236\ndash 238}, url={https://doi.org/10.1016/0001-8708(80)90050-X}, review={\MR {563925}}, }
[Sta80b]
Richard P. Stanley, Weyl groups, the hard Lefschetz theorem, and the Sperner property, SIAM J. Algebraic Discrete Methods 1 (1980), no. 2, 168–184. MR578321,
Show rawAMSref \bib{Sta80b}{article}{ author={Stanley, Richard~P.}, title={Weyl groups, the hard {L}efschetz theorem, and the {S}perner property}, date={1980}, issn={0196-5212}, journal={SIAM J. Algebraic Discrete Methods}, volume={1}, number={2}, pages={168\ndash 184}, review={\MR {578321}}, }
[Sta87]
Richard P. Stanley, Generalized -vectors, intersection cohomology of toric varieties, and related results, Commutative algebra and combinatorics (Kyoto, 1985), 1987, pp. 187–213, https://doi.org/10.2969/aspm/01110187. MR951205,
Show rawAMSref \bib{Sta87}{incollection}{ author={Stanley, Richard~P.}, title={Generalized {$H$}-vectors, intersection cohomology of toric varieties, and related results}, date={1987}, booktitle={Commutative algebra and combinatorics ({K}yoto, 1985)}, series={Adv. Stud. Pure Math.}, volume={11}, publisher={North-Holland, Amsterdam}, pages={187\ndash 213}, url={https://doi.org/10.2969/aspm/01110187}, review={\MR {951205}}, }
[Wel71]
D. J. A. Welsh, Combinatorial problems in matroid theory, Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), 1971, pp. 291–306. MR0278975,
Show rawAMSref \bib{Wel71}{inproceedings}{ author={Welsh, D. J.~A.}, title={Combinatorial problems in matroid theory}, date={1971}, booktitle={Combinatorial {M}athematics and its {A}pplications ({P}roc. {C}onf., {O}xford, 1969)}, publisher={Academic Press, London}, pages={291\ndash 306}, review={\MR {0278975}}, }
[Zie95]
Günter M. Ziegler, Lectures on polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, New York, 1995. MR1311028,
Show rawAMSref \bib{Zie95}{book}{ author={Ziegler, G\"{u}nter~M.}, title={Lectures on polytopes}, series={Graduate Texts in Mathematics}, publisher={Springer-Verlag, New York}, date={1995}, volume={152}, isbn={0-387-94365-X}, review={\MR {1311028}}, }

Credits

Figures 1–4 are courtesy of the authors.

Photo of Christopher Eur is courtesy of Carnegie Mellon University.

Photo of Matt Larson is courtesy of Matt Larson.