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 - Examples
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
- 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
- Simplicial Complexes and Simplicial Homology
- 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
These examples keep the AT-1 page concrete. They compute low-dimensional homology groups, exhibit contiguity and cone constructions on explicit finite complexes, separate the finiteness notions used on the A page, and record the efficient torus delta-complex model without changing the page's abstract simplicial-complex convention.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The simplicial homology of a point and an edge
Example
For the one-vertex complex , one has and for . Hence and for . The augmentation is an isomorphism, so for every .
For the one-edge complex with vertices and edge , one has , , and . The kernel of is , so . The quotient of by the subgroup generated by is , so . The augmented complex is exact, hence the reduced homology also vanishes.
The boundary of a triangle has first homology Z
Example
Let have vertices and edges , with no 2-simplex. Then and . If the edges are oriented cyclically, the boundary map is The sum is a -cycle, and every -cycle is an integer multiple of this one because the three vertex equations force the three edge coefficients to agree. Since , one has , so The complex is connected, so , and all higher homology groups vanish.
The simplicial homology of the tetrahedron boundary
Example
Let be the boundary of a tetrahedron. It has vertices, edges, and triangular faces. The complex is connected, hence .
Orient the faces as , , , and . The alternating sum is a -cycle because every edge appears twice with opposite signs. Since , this gives a nonzero class in .
The three face boundaries are linearly independent in because the edges , , and occur in only one of them. Thus . On the other hand, and because and , so . Hence and .
Now , so . Since and already contains a nonzero cycle, it follows that . Thus and for .
A contractible simplicial cone
Example
Given a simplicial complex and a new vertex , its cone is obtained by adjoining to every simplex the simplex . The same formula used for a single simplex defines a degree- operator by setting when is not already a vertex of and otherwise. The same cancellation check gives on the augmented simplicial chain complex.
Thus the augmented chain complex of a simplicial cone is contractible, so its reduced simplicial homology vanishes. In particular, a simplicial cone is a concrete combinatorial model of a contractible space.
Two contiguous maps of a subdivided interval
Example
Let be the subdivided interval with vertices and edges and . Let be the full -simplex on vertices . Define simplicial maps by
For the edge , the union of the image vertex sets is ; for it is . Both are simplices of , and the same is clear for the vertices, so and are contiguous. Their realizations are therefore homotopic, and they induce the same map on every simplicial homology group.
A finite complex with Euler characteristic zero
Example
The boundary of a triangle is a finite simplicial complex with vertices and edges, so Its simplicial homology groups are and , with no higher homology. Therefore which matches the simplex count. This is the smallest noncontractible example on the page with Euler characteristic zero.
A vertex map need not be simplicial
Statement refuted
Every function on vertex sets extends to a simplicial map.
Take the domain complex with vertices and edge , and take the target complex with vertices and no edge . The vertex function , exists, but it sends the simplex to the set , which is not a simplex of the target. Hence it is not a simplicial map.
Finite dimensional does not imply finite or locally finite
Statement refuted
Every finite-dimensional simplicial complex is finite and locally finite.
Let the vertex set be and let the simplices be the empty face, all singletons, and all edges . Every simplex has dimension at most , so the complex is finite dimensional. But it has infinitely many edges, so it is not finite, and the vertex lies in infinitely many simplices, so it is not locally finite.
A delta-complex structure on the torus
Example
Start with a square whose opposite sides are identified to form a torus. Cut the square along one diagonal. The result is a delta-complex with two 2-simplices, three 1-simplices, and one 0-simplex after the side identifications are imposed.
This example is kept on the B page precisely because it is not an abstract simplicial complex: the same edge and vertex occur several times in the face maps of the two triangles. It is useful as a compact model of the torus, but it does not replace the A-page convention that simplices are determined by their vertex sets.