Abstract
Let us recall that a subset C ⊂ ℝ n is convex if x, y ∈ C, t ∈ [0, 1] \({\Rightarrow} tx + (1 - t)y \in C\). The convex hull of a subset X ⊂ ℝ n is the smallest convex subset of ℝ n, which contains X. We say that d + 1 points x 0, x 1, …, x d belonging to the Euclidean space ℝ n are linearly independent (from the affine point of view) if the vectors x 1 − x 0, x 2 − x 0, \(\ldots \), x d − x 0 are linearly independent. A vector x − x 0 of the vector space generated by these vectors can be written as a sum \(x - {x}_{0} ={ \sum \nolimits }_{i=1}^{d}{r}_{i}({x}_{i} - {x}_{0})\) with real coefficients r i ; notice that if we write x as \(x ={ \sum \nolimits }_{i=0}^{d}{\alpha }_{i}{x}_{i}\), then \({\sum \nolimits }_{i=0}^{d}{\alpha }_{i} = 1\). If \(\{{x}_{0},\ldots, {x}_{d}\} \in X\) are affinely independent, the convex hull of X is said to be an (Euclidean) simplex of dimension d contained in ℝ n; its points x can be written in a unique fashion as linear combinations
with real coefficients λ i . The coefficients λ i are called barycentric coordinates of x; they are nonnegative real numbers and satisfy the equality \({\sum \nolimits }_{i=0}^{d}{\lambda }_{i} = 1\). The points x i are the vertices of the simplex. The standard n-simplex is the simplex obtained by taking the convex hull of the n + 1 points of the standard basis of ℝ n + 1 (see Figs. II.1 and II.2 for dimensions n = 1 and n = 2, respectively). The faces of a simplex s ⊂ ℝ n are the convex hulls of the subsets of its vertices; the faces which do not coincide with s are the proper faces. We can define the interior of a simplex s as the set of all points of s with positive barycentric coordinates λ i > 0. We indicate the interior of s with ˚s. If the dimension of s is at least 1, ˚s coincides with the topological interior. At any rate, it is not hard to prove that we obtain the interior of a simplex by removing all of its proper faces.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
It is possible to define Euclidean complexes with infinitely many simplexes, provided we add the local finiteness property that is to say, we ask that each point of a simplex has a neighborhood, which intersects only finitely many simplexes of K. We do this so that the topology of the (infinite) Euclidean complex K coincides with the topology of the geometric realization \(\vert \widehat{K}\vert \) (we are referring to the topology defined by Remark II.2.13) of the abstract simplicial complex \(\vert \widehat{K}\vert \) associated in a natural fashion to K (we shall give the definition of abstract simplicial complex in a short while).
- 2.
In some textbooks, polyhedra are the geometric realizations of two-dimensional complexes; for the more general case, they use the word polytopes.
- 3.
In some textbooks, it is called differential operator.
- 4.
- 5.
Chain complexes can be constructed over Λ-modules, with Λ a commutative ring with unit element.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Ferrario, D.L., Piccinini, R.A. (2011). The Category of Simplicial Complexes. In: Simplicial Structures in Topology. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7236-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7236-1_2
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7235-4
Online ISBN: 978-1-4419-7236-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)