Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Abstract simplicial complex
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Definitions== A collection {{math|Ξ}} of non-empty finite subsets of a [[Set (mathematics)|set]] ''S'' is called a set-family. A set-family {{math|Ξ}} is called an '''abstract simplicial complex''' if, for every set {{mvar|X}} in {{math|Ξ}}, and every non-empty subset {{math|''Y'' β ''X''}}, the set {{mvar|Y}} also belongs to {{math|Ξ}}. The finite sets that belong to {{math|Ξ}} are called '''faces''' of the complex, and a face {{mvar|Y}} is said to belong to another face {{mvar|X}} if {{math|''Y'' β ''X''}}, so the definition of an abstract simplicial complex can be restated as saying that every face of a face of a complex {{math|Ξ}} is itself a face of {{math|Ξ}}. The '''vertex set''' of {{math|Ξ}} is defined as {{math|''V''(Ξ) {{=}} βͺΞ}}, the union of all faces of {{math|Ξ}}. The elements of the vertex set are called the '''vertices''' of the complex. For every vertex ''v'' of {{math|Ξ}}, the set {''v''} is a face of the complex, and every face of the complex is a finite subset of the vertex set. The maximal faces of {{math|Ξ}} (i.e., faces that are not subsets of any other faces) are called '''facets''' of the complex. The '''dimension of a face''' {{mvar|X}} in {{math|Ξ}} is defined as {{math|dim(''X'') {{=}} {{!}}''X''{{!}} β 1}}: faces consisting of a single element are zero-dimensional, faces consisting of two elements are one-dimensional, etc. The '''dimension of the complex''' {{math|dim(Ξ)}} is defined as the largest dimension of any of its faces, or infinity if there is no finite bound on the dimension of the faces. The complex {{math|Ξ}} is said to be '''finite''' if it has finitely many faces, or equivalently if its vertex set is finite. Also, {{math|Ξ}} is said to be '''pure''' if it is finite-dimensional (but not necessarily finite) and every facet has the same dimension. In other words, {{math|Ξ}} is pure if {{math|dim(Ξ)}} is finite and every face is contained in a facet of dimension {{math|dim(Ξ)}}. One-dimensional abstract simplicial complexes are mathematically equivalent to [[simple graph|simple]] [[undirected graph]]s: the vertex set of the complex can be viewed as the vertex set of a graph, and the two-element facets of the complex correspond to undirected edges of a graph. In this view, one-element facets of a complex correspond to isolated vertices that do not have any incident edges. A '''subcomplex''' of {{math|Ξ}} is an abstract simplicial complex ''L'' such that every face of ''L'' belongs to {{math|Ξ}}; that is, {{math|''L'' β Ξ}} and ''L'' is an abstract simplicial complex. A subcomplex that consists of all of the subsets of a single face of {{math|Ξ}} is often called a '''simplex''' of {{math|Ξ}}. (However, some authors use the term "simplex" for a face or, rather ambiguously, for both a face and the subcomplex associated with a face, by analogy with the non-abstract (geometric) [[simplicial complex]] terminology. To avoid ambiguity, we do not use in this article the term "simplex" for a face in the context of abstract complexes). The '''[[d-skeleton|''d''-skeleton]]''' of {{math|Ξ}} is the subcomplex of {{math|Ξ}} consisting of all of the faces of {{math|Ξ}} that have dimension at most ''d''. In particular, the [[skeleton (topology)|1-skeleton]] is called the '''underlying graph''' of {{math|Ξ}}. The 0-skeleton of {{math|Ξ}} can be identified with its vertex set, although formally it is not quite the same thing (the vertex set is a single set of all of the vertices, while the 0-skeleton is a family of single-element sets). The '''link''' of a face {{mvar|Y}} in {{math|Ξ}}, often denoted {{math|Ξ/''Y''}} or {{math|lk<sub>Ξ</sub>(''Y'')}}, is the subcomplex of {{math|Ξ}} defined by :<math> \Delta/Y := \{ X\in \Delta \mid X\cap Y = \varnothing,\, X\cup Y \in \Delta \}. </math> Note that the link of the empty set is {{math|Ξ}} itself. === Simplicial maps === {{Main|Simplicial map}} Given two abstract simplicial complexes, {{math|Ξ}} and {{math|Ξ}}, a '''[[simplicial map]]''' is a [[Function (mathematics)|function]] {{math| ''f'' }} that maps the vertices of {{math|Ξ}} to the vertices of {{math|Ξ}} and that has the property that for any face {{mvar|X}} of {{math|Ξ}}, the [[Image (mathematics)|image]] {{math| ''f'' (''X'')}} is a face of {{math|Ξ}}. There is a [[Category (mathematics)|category]] '''SCpx''' with abstract simplicial complexes as objects and simplicial maps as [[morphism]]s. This is equivalent to a suitable category defined using non-abstract [[simplicial complexes]]. Moreover, the categorical point of view allows us to tighten the relation between the underlying set ''S'' of an abstract simplicial complex {{math|Ξ}} and the vertex set {{math|''V''(Ξ) β ''S''}} of {{math|Ξ}}: for the purposes of defining a category of abstract simplicial complexes, the elements of ''S'' not lying in {{math|''V''(Ξ)}} are irrelevant. More precisely, '''SCpx''' is equivalent to the category where: * an object is a set ''S'' equipped with a collection of non-empty finite subsets {{math|Ξ}} that contains all singletons and such that if {{mvar|X}} is in {{math|Ξ}} and {{math|''Y'' β ''X''}} is non-empty, then {{mvar|Y}} also belongs to {{math|Ξ}}. * a morphism from {{math|(''S'', Ξ)}} to {{math|(''T'', Ξ)}} is a function {{math|''f'' : ''S'' β ''T''}} such that the image of any element of {{math|Ξ}} is an element of {{math|Ξ}}.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)