How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Simplicial Complexes and Simplicial Homology
1 · Prerequisites
- Abelian Categories
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Chain Homotopy and the Homotopy Category
- Compactness in Metric Spaces
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits and Colimits
- Metric Spaces
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Preadditive and Additive Categories and Biproducts
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
This page fixes the library's foundational simplicial convention at the level of abstract simplicial complexes: faces are determined by their vertex sets, the empty face is present, and delta-complexes are not substituted for this language. Geometric realization is then built intrinsically from finitely supported barycentric-coordinate functions.
With that topology in place, the page develops orientations, simplicial chain groups, reduced simplicial homology, induced maps, contiguity, the standard simplex contraction, the computation of , disjoint-union splitting, and a finite-rank Euler-Poincare formula along the route specified for AT-1.
3 · Logical flowchart
4 · Definitions, theorems and proofs
An abstract simplicial complex
Definition
An abstract simplicial complex is a pair consisting of a set of vertices and a family of finite subsets of such that:
- ;
- if and , then ;
- every singleton with lies in .
The elements of are the simplices of the complex. If is nonempty, its dimension is , and the empty simplex has dimension .
Subcomplexes, closures, stars, and links in a simplicial complex
Definition
Let be an abstract simplicial complex.
A subcomplex of is a subfamily that is itself closed under taking subsets.
If , its closure is the subcomplex More generally, if , its closure is
For a simplex , the closed star of in is and the open star is the union, after realization, of the relative interiors of simplices with .
The link of in is
Local finiteness, finiteness, and finite dimensionality of a simplicial complex
Definition
Let be an abstract simplicial complex.
The complex is finite if has only finitely many simplices.
It is locally finite if each vertex lies in only finitely many simplices of .
It is finite dimensional if there is an integer such that every simplex of has dimension at most .
These are distinct conditions: finite implies locally finite and finite dimensional, but local finiteness and finite dimensionality do not imply finiteness, and finite dimensionality does not imply local finiteness.
The geometric simplex spanned by affinely independent vertices
Definition
Let be affinely independent. The geometric simplex spanned by these vertices is
The numbers are the barycentric coordinates of the point. When , the simplex is the single point .
Barycentric coordinates are unique
Statement
Let be affinely independent points in . If then for every .
Proof
Given: Two barycentric-coordinate expressions for the same point of the simplex spanned by .
Subtract the two expressions for to obtain , and subtract the two sum conditions to obtain .
The previous step is an affine dependence relation among whose coefficients sum to . Since the vertices are affinely independent, every coefficient vanishes, so for all .
The geometric realization of an abstract simplicial complex
Definition
Let be an abstract simplicial complex. Its geometric realization is the set of functions such that:
- for all but finitely many ;
- ;
- the support is a simplex of .
For each simplex of , write Sending to the barycentric tuple identifies with the geometric simplex spanned by the standard basis vectors indexed by , so carries its Euclidean simplex topology.
We give the weak topology with respect to these simplex inclusions: a subset is declared open exactly when is open in for every simplex of .
Geometric simplices intersect in the realization of their common face
Statement
If , then the corresponding geometric simplices in satisfy
Proof
Given: Two simplices in an abstract simplicial complex .
Let . Viewed as a barycentric-coordinate function on the full vertex set of , the support of is contained in because , and it is contained in because . Hence , so .
Conversely, if , then , so in particular and . Therefore .
Steps 1.1 and 1.2 prove the two inclusions, so the two sets are equal.
A finite simplicial complex has a compact Hausdorff realization
Statement
If is a finite abstract simplicial complex, then its geometric realization is compact and Hausdorff.
Proof
Given: A finite abstract simplicial complex .
If has no nonempty simplices, then , which is compact and Hausdorff. Otherwise has finitely many vertices; write them as . For each simplex of , the subset identifies with a Euclidean simplex in , cut out by finitely many linear equations and inequalities, so is compact.
The realization is the union of the finitely many subsets over the nonempty simplices of , and this union is empty in the case handled at the start of step 1.1. Therefore step 1.1 makes a finite union of compact sets and hence compact.
For each simplex , let be open with . Since there are only finitely many simplices, a subset is weakly open exactly when . Thus the weak topology on agrees with the subspace topology from . The cube is Hausdorff, so is Hausdorff as a subspace.
Steps 2.1 and 2.2 give compactness and Hausdorffness.
A simplicial map and its geometric realization
Definition
Let and be abstract simplicial complexes. A function is a simplicial map if is a simplex of whenever is a simplex of .
The geometric realization of is the map defined by Because has finite support, the sum is finite. The support of is contained in , so it is again a simplex of .
The realization of a simplicial map is continuous and functorial
Statement
If is a simplicial map, then is continuous. In addition, and for composable simplicial maps.
Proof
Given: A simplicial map and, for functoriality, a second simplicial map .
If is a simplex of and has barycentric coordinates , then Thus the restriction is the affine map determined by the vertex map , so it is continuous.
For every barycentric function , the identity vertex map leaves every coefficient unchanged, so . Likewise , so realizations preserve composition.
If and meet, then they meet along , and the affine formulas from step 1.1 agree there because they are both determined by the same vertex map . Since carries the weak topology with respect to its simplices, these simplexwise affine maps patch to a continuous map .
Steps 2.1 and 1.2 give continuity and the identity/composition laws.
An orientation of a simplex
Definition
Let be an -simplex. An orientation of is an equivalence class of orderings of its vertices, where two orderings are equivalent when they differ by an even permutation. For there is only one orientation.
An odd permutation reverses the sign of an oriented simplex
Statement
If is odd, then as oriented simplices.
Proof
Given: An odd permutation of the vertices of an -simplex.
Every odd permutation is a product of an odd number of transpositions, and each transposition switches the two orientation classes by definition.
After composing an odd number of such sign reversals, the final ordering represents the opposite orientation class, so its oriented simplex is the negative of the original one.
Simplicial chain groups and the boundary operator
Definition
For an abstract simplicial complex and an integer , the simplicial chain group is the free abelian group generated by the oriented -simplices of , subject to the relation for every permutation of the vertices of a simplex. For , set .
The boundary operator is in degree . For , it is defined on an oriented simplex by
The well-definedness of this formula with respect to the chosen oriented
representative is recorded in
The simplicial boundary is independent of the chosen oriented representative ↗ through
justified_by.
The simplicial boundary is independent of the chosen oriented representative
Statement
The formula depends only on the orientation class of the simplex, not on the chosen ordered representative.
Proof
Given: Two orderings of the same simplex that represent the same oriented simplex in the chain group.
It is enough to compare two orderings that differ by one adjacent transposition, because adjacent transpositions generate the symmetric group.
Let and . For or , deleting the th vertex from and leaves two orderings of the same face that still differ by one adjacent transposition, so the corresponding face terms differ by a minus sign. The face obtained from by deleting is exactly the face obtained from by deleting in position , and their coefficients are and . Likewise the face obtained from by deleting is the face obtained from by deleting the entry in position , again with opposite coefficients. Hence every term of is the negative of the corresponding term of , so .
Therefore equivalent oriented representatives have the same boundary value, so the boundary formula is well defined on orientation classes.
The simplicial boundary squares to zero
Statement
For every simplicial complex and every , one has
Proof
Given: An integer and an oriented -simplex .
Expanding produces the sum of all codimension-two faces obtained by deleting two vertices, once by deleting then and once by deleting then .
The two appearances of the same codimension-two face have opposite signs because the exponents differ by . Hence every codimension-two face cancels with its partner, and the full sum is .
The boundary maps are homomorphisms, so vanishing on every oriented simplex implies on all of .
Simplicial cycles, boundaries, and homology
Definition
For a simplicial complex , define By , every boundary is a cycle. The th simplicial homology group is
Augmentation and reduced simplicial homology
Definition
For a simplicial complex , the augmentation is the homomorphism determined by for every vertex .
The augmented simplicial chain complex is Its homology groups are the reduced simplicial homology groups .
If has no vertices, then for all , so and for .
The simplicial augmentation is a chain map
Statement
For every simplicial complex , one has so the augmented simplicial chain groups form a chain complex.
Proof
Given: An oriented edge and the augmented simplicial chain complex of .
By the boundary formula, . Applying the augmentation gives .
In degrees , the ordinary simplicial differentials already satisfy , so adding at degree preserves the chain-complex condition.
The induced graded homomorphism of a simplicial map
Definition
Let be a simplicial map. For an oriented simplex of , define Extending linearly gives the induced graded homomorphism in each degree. The next lemma proves that these homomorphisms commute with the boundaries and hence form a chain map.
Induced simplicial chain maps commute with boundaries
Statement
If is simplicial, then on every simplicial chain group.
Proof
Given: A simplicial map and an oriented simplex .
If are pairwise distinct, then deleting one vertex before applying or after applying produces the same oriented face. Therefore term by term.
If some image vertices repeat, then . In , the faces whose remaining image vertices still repeat map to , while the two faces obtained by deleting one of a repeated pair map to the same oriented simplex with opposite signs and cancel. Hence .
Steps 1.1 and 1.2 cover all simplices, so .
Simplicial homology is functorial
Statement
Every simplicial map induces homomorphisms and these induced maps respect identities and composition.
Proof
Given: Simplicial maps and .
The previous lemma shows that each is a chain map, so simplicial homology may be applied degreewise to obtain homomorphisms .
On every oriented simplex, the identity simplicial map induces the identity chain map, and by direct inspection of the defining formula. Therefore the induced homology maps satisfy and .
Thus simplicial homology defines a functor from simplicial complexes and simplicial maps to graded abelian groups.
Contiguous simplicial maps
Definition
Two simplicial maps are contiguous if for every simplex , the union of the vertex sets is a simplex of .
Contiguous simplicial maps have homotopic realizations
Statement
If are contiguous simplicial maps, then their geometric realizations are homotopic.
Proof
Given: Contiguous simplicial maps .
Let lie in a simplex of . Contiguity says that the vertices and together span a simplex of , so for each the barycentric combination lies in .
On each simplex of , the formula in step 1.1 is affine in both and , so it is continuous there. If a point lies on a common face of two simplices, the same barycentric formula is obtained from either side, so the simplexwise formulas patch to a continuous map .
At the formula gives , and at it gives . Thus is a homotopy from to .
Contiguous simplicial maps induce the same map on simplicial homology
Statement
If are contiguous simplicial maps, then for every .
Proof
Given: Contiguous simplicial maps .
Let be an -cycle. Its support generates a finite subcomplex of . Choose a total ordering of the finite vertex set of , and use the increasing vertex order as the preferred oriented generator of every simplex of . On these generators define omitting a summand when its displayed vertices are not pairwise distinct, and extend linearly. This is a well-defined homomorphism on because it is defined on a chosen free basis, and contiguity makes every nondegenerate summand a simplex of .
For each preferred generator of , expand the boundary of the th prism simplex from step 1.1. Consecutive interior faces cancel, the two outer faces give , and the remaining faces give . Terms with repeated image vertices cancel in the corresponding normalized formula. Hence on the chains of .
Applying step 2.1 to the cycle gives because . Thus and represent the same homology class. Every homology class has such a finitely supported cycle representative, so in every degree.
The augmented simplicial chain complex of a simplex is contractible
Statement
Let be a simplex, and choose one of its vertices . The augmented simplicial chain complex of is contractible.
Proof
Given: A simplex with a chosen vertex .
Define by . For an oriented simplex , set if and set if . Because adjoining to a face of a simplex still gives a face of , each is well defined.
If , then the extra face created by applying and deleting is exactly , while every other face cancels with the corresponding term in . If is already among the vertices, then is and the same cancellation leaves the identity term. Thus on the augmented complex.
The family is therefore a contracting homotopy, so the augmented simplicial chain complex of is contractible.
A simplex has zero reduced simplicial homology
Statement
If is a simplex, then for every .
Proof
Given: A simplex .
The previous lemma gives a contracting homotopy for the augmented simplicial chain complex of .
A contractible chain complex is acyclic, so every reduced simplicial homology group of vanishes.
Zero-th simplicial homology is free on connected components
Statement
For every simplicial complex , the group is the free abelian group on the connected components of .
Proof
Given: A simplicial complex .
If and is a vertex of the simplex , then the straight-line barycentric homotopy inside the Euclidean simplex joins to . Hence every point of lies in the same connected component as any vertex of a simplex supporting it, and all vertices of one simplex lie in the same connected component of .
If vertices and are joined by an edge path , then , so vertices in the same edge-path component define the same class in .
Fix a vertex of , let be the set of vertices joined to by edge paths, and let be the subcomplex whose simplices have all vertices in . By step 1.1, every simplex that contains one vertex of has all its vertices in , so for each simplex the intersection is either or . Hence is open and closed in the weak topology. It is connected because every point of lies in a simplex whose vertices are edge-path connected to , so step 1.1 and concatenation of those edge paths connect the point to . Therefore is exactly the connected component of containing . In particular, the connected components of are exactly the realizations of the edge-path components of the vertices, and if every connected component contains a vertex.
Let be the set of connected components of . Since the vertices of every simplex lie in one component by step 1.1, the assignment sending a vertex to the basis vector of the free abelian group extends to a homomorphism . Boundaries of edges map to , so this homomorphism factors through . If , then and both groups are zero. Otherwise step 2.1 shows that every connected component contains a vertex, so is surjective.
Choose one vertex in each nonempty connected component . Every class in is represented by a finite -chain . By step 2.1, two vertices lie in the same connected component exactly when they are edge-path connected, so step 1.2 gives for every . Hence in one has . If , then every component sum is zero, so . Thus is injective.
Therefore is an isomorphism, so is the free abelian group on the connected components of .
Simplicial homology of a disjoint union is the direct sum
Statement
If is a disjoint union of simplicial complexes, then for every ,
Facts & Assumptions
Given: A disjoint union .
For each , the simplicial chain group is the free abelian group on the oriented nondegenerate -simplices of , and the boundary map is defined simplexwise (Simplicial chain groups and the boundary operator).
Simplicial homology is the quotient of the cycle group by the boundary group: (Simplicial cycles, boundaries, and homology)
Proof
Every nonempty simplex of lies in exactly one summand , so for each one has , and under this identification the boundary operator acts componentwise.
Therefore for each the cycle groups, boundary groups, and homology groups split componentwise, giving . For , both sides are zero by definition. This proves the statement for every .
The simplicial Euler characteristic
Definition
If is a finite simplicial complex and denotes the number of -simplices of , the simplicial Euler characteristic of is The sum is finite because a finite simplicial complex has only finitely many simplices.
The Euler-Poincare formula for a finite simplicial complex with free homology
Statement
Let be a finite simplicial complex. Assume that each simplicial homology group is free of finite rank. Then
Proof
Given: A finite simplicial complex whose simplicial homology groups are free of finite rank.
For each , the chain group is free abelian on the oriented -simplices of , so . Since is finite, only finitely many of these groups are nonzero.
Therefore the simplicial chain complex of is a bounded chain complex of finite-rank free abelian groups, and its homology groups are free of finite rank by hypothesis. The finite-free Euler-Poincare theorem applies and gives .
Replace by using step 1.1, and replace the left-hand side by by definition. This yields the stated formula.
5 · Examples, counterexamples and false statements
None yet.