Abstract Simplicial Complexes: Definitions
Definition 1
Let’s say an arbitrary set is given.
- A (Abstract Simplicial) Complex that satisfies the following among the finite subsets of the power set of is defined as:
- The elements of the complex are called Simplices.
- The Dimension of a Simplex is defined as the value obtained by subtracting from the cardinality of . The Dimension of the Complex is defined as the maximum value among the dimensions of all simplices in .
- A proper subset of the simplex , which is not the empty set, is called a Face of .
- The union of all simplices in , calculated as follows, is called the Vertex Set of .
- If a subset of a complex is a complex, it is called a Subcomplex.
- If there exists a bijective satisfying the following, two complexes are said to be Isomorphic.
- For a (Geometric) Simplicial Complex , the (Abstract) Simplicial Complex obtained by ignoring all its constructions but maintaining the relationships between vertices is called the Vertex Scheme of , and in this case, is referred to as the Geometric Realization of .
Explanation
The Abstract Simplicial Complex is, as its name suggests, an abstraction of the simplicial complex stripped of its geometric meaning. From a mathematician’s point of view, conditions like convex hulls are just annoying restrictions.
For example, when considering it perfectly satisfies all the conditions of an abstract simplicial complex, and in this case, it’s completely fine to disregard any geometric meaning like the Euclidean space . has -dimensional simplices, -dimensional simplices, and -dimensional simplices, making the complex itself -dimensional with the vertex set . Meanwhile, if a Geometric Simplicial Complex is given, it’s entirely appropriate to consider as the vertex scheme of .
Edelsbrunner, Harer. (2010). Computational Topology An Introduction: p63~64. ↩︎