Simplicial complex
Builds on Finite setPower set
Definition
Let be a finite set. An (abstract) simplicial complex on the vertex set is a family of subsets of such that:
- If and , then .
- for every .
The elements of are its faces; a face has dimension , and the dimension of is the largest dimension of a face. The maximal faces are called facets.
Remarks
Example: on , let be the family of all subsets of except itself. A subset of a set with at most elements has at most elements, so clause 1 holds. Clause 2 holds, and is the boundary of a triangle, of dimension .
Non-example: on , the family fails clause 1, since is missing.
A nonempty complex contains the empty face, of dimension . Some authors allow an infinite vertex set, keeping every face finite. A geometric realization places the vertices as affinely independent points in some and replaces each face by the convex hull of its points.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Finite set concept
- Power set concept
- Simplicial complex definition
Further reading
About this page
| Tag | JR0G4HN9EA |
|---|---|
| URI | m2://JR0G4HN9EA |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05E45, 55U10 |
| Defines | Simplicial complex |
| Uses | Finite set, Power set |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.