Stanley–Reisner ring

Last updated

In mathematics, a Stanley–Reisner ring, or face ring, is a quotient of a polynomial algebra over a field by a square-free monomial ideal. Such ideals are described more geometrically in terms of finite simplicial complexes. The Stanley–Reisner ring construction is a basic tool within algebraic combinatorics and combinatorial commutative algebra. [1] Its properties were investigated by Richard Stanley, Melvin Hochster, and Gerald Reisner in the early 1970s.

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

In algebra, a monomial ideal is an ideal generated by some monomials in a multivariate polynomial ring over a field.

In ring theory, a branch of abstract algebra, an ideal is a special subset of a ring. Ideals generalize certain subsets of the integers, such as the even numbers or the multiples of 3. Addition and subtraction of even numbers preserves evenness, and multiplying an even number by any other integer results in another even number; these closure and absorption properties are the defining properties of an ideal. An ideal can be used to construct a quotient ring similarly to the way that, in group theory, a normal subgroup can be used to construct a quotient group.

Contents

Definition and properties

Given an abstract simplicial complex Δ on the vertex set {x1,...,xn} and a field k, the corresponding Stanley–Reisner ring, or face ring, denoted k[Δ], is obtained from the polynomial ring k[x1,...,xn] by quotienting out the ideal IΔ generated by the square-free monomials corresponding to the non-faces of Δ:

Abstract simplicial complex

In mathematics, an abstract simplicial complex is a purely combinatorial description of the geometric notion of a simplicial complex, consisting of a family of non-empty finite sets closed under the operation of taking non-empty subsets. In the context of matroids and greedoids, abstract simplicial complexes are also called independence systems.

The ideal IΔ is called the Stanley–Reisner ideal or the face ideal of Δ. [2]

Properties

whose summands k[Δ]σ have a basis of the monomials (not necessarily square-free) supported on the faces σ of Δ.

In commutative algebra, the Krull dimension of a commutative ring R, named after Wolfgang Krull, is the supremum of the lengths of all chains of prime ideals. The Krull dimension need not be finite even for a Noetherian ring. More generally the Krull dimension can be defined for modules over possibly non-commutative rings as the deviation of the poset of submodules.

where d = dim(Δ) + 1 is the Krull dimension of k[Δ] and fi is the number of i-faces of Δ. If it is written in the form
then the coefficients (h0, ..., hd) of the numerator form the h-vector of the simplicial complex Δ.

Examples

It is common to assume that every vertex {xi} is a simplex in Δ. Thus none of the variables belongs to the Stanley–Reisner ideal IΔ.

Simplex generalization of the notion of a triangle or tetrahedron to arbitrary dimensions

In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. Specifically, a k-simplex is a k-dimensional polytope which is the convex hull of its k + 1 vertices. More formally, suppose the k + 1 points are affinely independent, which means are linearly independent. Then, the simplex determined by them is the set of points

is the polynomial algebra in n variables over k.
and the Stanley–Reisner ring is the following truncation of the polynomial ring in n variables over k:

In mathematics, the tensor productVW of two vector spaces V and W is itself a vector space, endowed with the operation of bilinear composition, denoted by , from ordered pairs in the Cartesian product V × W onto VW in a way that generalizes the outer product. The tensor product of V and W is the vector space generated by the symbols vw, with vV and wW, in which the relations of bilinearity are imposed for the product operation , and no other relations are assumed to hold. The tensor product space is thus the "freest" such vector space, in the sense of having the fewest constraints.

Cohen–Macaulay condition and the upper bound conjecture

The face ring k[Δ] is a multigraded algebra over k all of whose components with respect to the fine grading have dimension at most 1. Consequently, its homology can be studied by combinatorial and geometric methods. An abstract simplicial complex Δ is called Cohen–Macaulay over k if its face ring is a Cohen–Macaulay ring. [3] In his 1974 thesis, Gerald Reisner gave a complete characterization of such complexes. This was soon followed up by more precise homological results about face rings due to Melvin Hochster. Then Richard Stanley found a way to prove the Upper Bound Conjecture for simplicial spheres, which was open at the time, using the face ring construction and Reisner's criterion of Cohen–Macaulayness. Stanley's idea of translating difficult conjectures in algebraic combinatorics into statements from commutative algebra and proving them by means of homological techniques was the origin of the rapidly developing field of combinatorial commutative algebra.

Reisner's criterion

A simplicial complex Δ is Cohen–Macaulay over k if and only if for all simplices σ ∈ Δ, all reduced simplicial homology groups of the link of σ in Δ with coefficients in k are zero, except the top dimensional one: [3]

A result due to Munkres then shows that the Cohen–Macaulayness of Δ over k is a topological property: it depends only on the homeomorphism class of the simplicial complex Δ. Namely, let |Δ| be the geometric realization of Δ. Then the vanishing of the simplicial homology groups in Reisner's criterion is equivalent to the following statement about the reduced and relative singular homology groups of |Δ|:

In particular, if the complex Δ is a simplicial sphere, that is, |Δ| is homeomorphic to a sphere, then it is Cohen–Macaulay over any field. This is a key step in Stanley's proof of the Upper Bound Conjecture. By contrast, there are examples of simplicial complexes whose CohenMacaulayness depends on the characteristic of the field k.

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n".

In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity.

Simplicial complex

In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their n-dimensional counterparts. Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory. The purely combinatorial counterpart to a simplicial complex is an abstract simplicial complex.

In mathematics, a simplicial set is an object made up of "simplices" in a specific way. Simplicial sets are higher-dimensional generalizations of directed graphs, partially ordered sets and categories. Formally, a simplicial set may be defined as a contravariant functor from the simplex category to the category of sets. Simplicial sets were introduced in 1950 by Samuel Eilenberg and J. A. Zilber.

In algebraic combinatorics, the Kruskal–Katona theorem gives a complete characterization of the f-vectors of abstract simplicial complexes. It includes as a special case the Erdős–Ko–Rado theorem and can be restated in terms of uniform hypergraphs. The theorem is named after Joseph Kruskal and Gyula O. H. Katona. It was independently proved by Marcel-Paul Schützenberger, but his contribution escaped notice for several years.

<i>n</i>-skeleton

In mathematics, particularly in algebraic topology, the n-skeleton of a topological space X presented as a simplicial complex refers to the subspace Xn that is the union of the simplices of X of dimensions mn. In other words, given an inductive definition of a complex, the n-skeleton is obtained by stopping at the n-th step.

In algebraic topology the cap product is a method of adjoining a chain of degree p with a cochain of degree q, such that qp, to form a composite chain of degree pq. It was introduced by Eduard Čech in 1936, and independently by Hassler Whitney in 1938.

In commutative algebra, the Hilbert function, the Hilbert polynomial, and the Hilbert series of a graded commutative algebra finitely generated over a field are three strongly related notions which measure the growth of the dimension of the homogeneous components of the algebra.

In mathematics, Kan complexes and Kan fibrations are part of the theory of simplicial sets. Kan fibrations are the fibrations of the standard model category for simplicial sets and are therefore of fundamental importance. Kan complexes are the fibrant objects in this model category. The name is in honor of Daniel Kan.

In mathematics, Hochschild homology is a homology theory for associative algebras over rings. There is also a theory for Hochschild homology of certain functors. Hochschild cohomology was introduced by Gerhard Hochschild (1945) for algebras over a field, and extended to algebras over more general rings by Henri Cartan and Samuel Eilenberg (1956).

Combinatorial commutative algebra is a relatively new, rapidly developing mathematical discipline. As the name implies, it lies at the intersection of two more established fields, commutative algebra and combinatorics, and frequently uses methods of one to address problems arising in the other. Less obviously, polyhedral geometry plays a significant role.

In algebraic combinatorics, the h-vector of a simplicial polytope is a fundamental invariant of the polytope which encodes the number of faces of different dimensions and allows one to express the Dehn–Sommerville equations in a particularly simple form. A characterization of the set of h-vectors of simplicial polytopes was conjectured by Peter McMullen and proved by Lou Billera and Carl W. Lee and Richard Stanley (g-theorem). The definition of h-vector applies to arbitrary abstract simplicial complexes. The g-conjecture states that for simplicial spheres, all possible h-vectors occur already among the h-vectors of the boundaries of convex simplicial polytopes.

Discrete Morse theory is a combinatorial adaptation of Morse theory developed by Robin Forman. The theory has various practical applications in diverse fields of applied mathematics and computer science, such as configuration spaces, homology computation, denoising, mesh compression, and topological data analysis.

In mathematics, a Δ-setS, often called a semi-simplicial set, is a combinatorial object that is useful in the construction and triangulation of topological spaces, and also in the computation of related algebraic invariants of such spaces. A Δ-set is somewhat more general than a simplicial complex, yet not quite as general as a simplicial set.

In mathematics, a cyclic polytope, denoted C(n,d), is a convex polytope formed as a convex hull of n distinct points on a rational normal curve in Rd, where n is greater than d. These polytopes were studied by Constantin Carathéodory, David Gale, Theodore Motzkin, Victor Klee, and others. They play an important role in polyhedral combinatorics: according to the upper bound theorem, proved by Peter McMullen and Richard Stanley, the boundary Δ(n,d) of the cyclic polytope C(n,d) maximizes the number fi of i-dimensional faces among all simplicial spheres of dimension d − 1 with n vertices.

In mathematics, and especially topology, a Poincaré complex is an abstraction of the singular chain complex of a closed, orientable manifold.

In the geometry of numbers, the Klein polyhedron, named after Felix Klein, is used to generalize the concept of continued fractions to higher dimensions.

In mathematics, the upper bound theorem states that cyclic polytopes have the largest possible number of faces among all convex polytopes with a given dimension and number of vertices. It is one of the central results of polyhedral combinatorics.

References

  1. Miller & Sturmfels (2005) p.19
  2. Miller & Sturmfels (2005) pp.3–5
  3. 1 2 Miller & Sturmfels (2005) p.101

Further reading