Abstract simplicial complex
From Maths
Stub grade: E
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Unimportant page at the current time as it will not come up in my exam! However I think it is important! Notes for improvement:
- See Books:Combinatorial Algebraic Topology - Dmitry Kozlov as this allows the emptyset as a simplex and the emptyset as a complex! Alec (talk) 11:27, 19 February 2017 (UTC)
Contents
[hide]Definition
Let S be a collection of sets, it is an abstract simplicial complex, or ASC for short, if[1]:
- ∀A∈S[A≠∅]
- ∀A∈S[|A|∈N0] - where |⋅| denotes cardinality of a set
- ∀A∈S∀B∈P(A)[B≠∅⟹B∈S][Note 1]
Any A∈S is called a simplex of S, and any B∈(P(A)−{∅}) is called a face of A
- Caveat:We may allow both the empty set to be an asc and we may also allow the empty set to be a simplex - as per Books:Combinatorial Algebraic Topology - Dmitry Kozlov
Terminology
- We make the following definitions regarding dimension of an abstract simplicial complex:
- For any simplex, A∈S, we define: Dim(A):=|A|−1 - the dimension of A is one less than the number of items in the simplex considered as a set
- We define the dimension of the abstract simplicial complex itself as follows: Dim(S):=SupA∈S(Dim(A))
Related terminology
- Warning: do not confuse vertex scheme with the vertex set!
Vertex Set
Let S be a abstract simplicial complex, we define the vertex set of S, denoted as just V or VS, as follows[1]:
- VS:=⋃A∈{B∈S | |B|=1}A - the union of all one-point sets in S
Note: we do not usually distinguish between v∈VS and {v}∈S[1], they are notionally identified.
Vertex Scheme
The vertex scheme of a simplicial complex, K, is an abstract simplicial complex.
Definition
Let K be a simplicial complex and let VK be the vertex set of K (not to be confused with the vertex set of an abstract simplicial complex), then we may define K - an abstract simplicial complex - as follows[1]:
- K:={{a0,…,an}∈P(VK) | Span(a0,…,an)∈K}Warning:[Note 2] - that is to say K is the set containing all collections of vertices such that the vertices span a simplex in K
See next
See also
Notes
- Jump up ↑ Perhaps better written as:
- ∀A∈S∀B∈(P(A)−{∅})[B∈S]
- Jump up ↑ n∈N0 here so n may be zero, we are expressing our interest in only those finite members of P(VK) here, and that are non-empty.
- TODO: This needs to be rewritten!
-