Alphabeta Math
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

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

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The simplicial homology of a point and an edge

Example

For the one-vertex complex {∅,{v}}, one has C0≅Z[v] and Cn=0 for n≥1. Hence H0simp≅Z and Hnsimp=0 for n>0. The augmentation ε([v])=1 is an isomorphism, so H~nsimp=0 for every n.

For the one-edge complex with vertices v0,v1 and edge [v0,v1], one has C1≅Z[v0,v1], C0≅Z[v0]⊕Z[v1], and ∂[v0,v1]=[v1]−[v0]. The kernel of ∂1 is 0, so H1simp=0. The quotient of C0 by the subgroup generated by [v1]−[v0] is Z, so H0simp≅Z. The augmented complex is exact, hence the reduced homology also vanishes.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The boundary of a triangle has first homology Z

Example

Let K have vertices v0,v1,v2 and edges e01,e12,e20, with no 2-simplex. Then C2(K)=0 and C1(K)≅Z3. If the edges are oriented cyclically, the boundary map is ∂1(e01,e12,e20)=(v1−v0, v2−v1, v0−v2). The sum e01+e12+e20 is a 1-cycle, and every 1-cycle is an integer multiple of this one because the three vertex equations force the three edge coefficients to agree. Since C2(K)=0, one has B1(K)=0, so H1simp(K)≅Z. The complex is connected, so H0simp(K)≅Z, and all higher homology groups vanish.

ExampleConstruction: Literature-sourcedVerification: AI-generatedaudited 2026-09-04Open item page →

The simplicial homology of the tetrahedron boundary

Example

Let K be the boundary of a tetrahedron. It has 4 vertices, 6 edges, and 4 triangular faces. The complex is connected, hence H0simp(K)≅Z.

Orient the faces as [v0,v1,v2], [v0,v1,v3], [v0,v2,v3], and [v1,v2,v3]. The alternating sum [v1,v2,v3]−[v0,v2,v3]+[v0,v1,v3]−[v0,v1,v2] is a 2-cycle because every edge appears twice with opposite signs. Since C3(K)=0, this gives a nonzero class in H2simp(K).

The three face boundaries ∂[v0,v1,v2],∂[v0,v1,v3],∂[v0,v2,v3] are linearly independent in C1(K) because the edges [v1,v2], [v1,v3], and [v2,v3] occur in only one of them. Thus rank⁡B1(K)≥3. On the other hand, rank⁡C1(K)=6 and rank⁡∂1=3 because H0simp(K)≅Z and C0(K)≅Z4, so rank⁡Z1(K)=6−3=3. Hence B1(K)=Z1(K) and H1simp(K)=0.

Now rank⁡∂2=rank⁡B1(K)=3, so rank⁡Z2(K)=4−3=1. Since Z2(K)⊆C2(K)≅Z4 and already contains a nonzero cycle, it follows that H2simp(K)=Z2(K)≅Z. Thus H0simp(K)≅Z,H1simp(K)=0,H2simp(K)≅Z, and Hnsimp(K)=0 for n≥3.

ExampleConstruction: Literature-sourcedVerification: AI-generatedaudited 2026-09-04Open item page →

A contractible simplicial cone

Example

Given a simplicial complex K and a new vertex a, its cone a∗K is obtained by adjoining to every simplex σ the simplex {a}∪σ. The same formula used for a single simplex defines a degree-1 operator by setting h[σ]=[a,σ] when a is not already a vertex of σ and h[σ]=0 otherwise. The same cancellation check gives ∂h+h∂=id⁡ 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.

ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Two contiguous maps of a subdivided interval

Example

Let K be the subdivided interval with vertices x0,x1,x2 and edges {x0,x1} and {x1,x2}. Let L be the full 2-simplex on vertices a,b,c. Define simplicial maps f,g:K→L by f(x0)=a,f(x1)=b,f(x2)=c, g(x0)=a,g(x1)=a,g(x2)=c.

For the edge {x0,x1}, the union of the image vertex sets is {a,b}; for {x1,x2} it is {a,b,c}. Both are simplices of L, and the same is clear for the vertices, so f and g are contiguous. Their realizations are therefore homotopic, and they induce the same map on every simplicial homology group.

ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A finite complex with Euler characteristic zero

Example

The boundary of a triangle is a finite simplicial complex with 3 vertices and 3 edges, so χ(K)=3−3=0. Its simplicial homology groups are H0simp(K)≅Z and H1simp(K)≅Z, with no higher homology. Therefore rank⁡H0simp(K)−rank⁡H1simp(K)=1−1=0, which matches the simplex count. This is the smallest noncontractible example on the page with Euler characteristic zero.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

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 u,v and edge {u,v}, and take the target complex with vertices a,b and no edge {a,b}. The vertex function u↦a, v↦b exists, but it sends the simplex {u,v} to the set {a,b}, which is not a simplex of the target. Hence it is not a simplicial map.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

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 {v}∪{wn:n≥1} and let the simplices be the empty face, all singletons, and all edges {v,wn}. Every simplex has dimension at most 1, so the complex is finite dimensional. But it has infinitely many edges, so it is not finite, and the vertex v lies in infinitely many simplices, so it is not locally finite.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

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.

Sources