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.

17 results · all verified · 13 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Simplicial Complexes and Simplicial Homology

1 · Prerequisites

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 H0, 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

An abstract simplicial complex

Definition

An abstract simplicial complex is a pair (V,K) consisting of a set V of vertices and a family K of finite subsets of V such that:

  1. K;
  2. if σK and τσ, then τK;
  3. every singleton {v} with vV lies in K.

The elements of K are the simplices of the complex. If σK is nonempty, its dimension is dimσ:=σ1, and the empty simplex has dimension 1.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Local finiteness, finiteness, and finite dimensionality of a simplicial complex

Definition

Let (V,K) be an abstract simplicial complex.

The complex is finite if K has only finitely many simplices.

It is locally finite if each vertex vV lies in only finitely many simplices of K.

It is finite dimensional if there is an integer N0 such that every simplex of K has dimension at most N.

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The geometric simplex spanned by affinely independent vertices

Definition

Let v0,,vnRm be affinely independent. The geometric simplex spanned by these vertices is [v0,,vn]:={i=0nλivi:λi0, i=0nλi=1}.

The numbers λ0,,λn are the barycentric coordinates of the point. When n=0, the simplex is the single point v0.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Barycentric coordinates are unique

Statement

Let v0,,vn be affinely independent points in Rm. If x=i=0nλivi=i=0nμivi,i=0nλi=i=0nμi=1, then λi=μi for every i.

Proof

Given: Two barycentric-coordinate expressions for the same point of the simplex spanned by v0,,vn.

1.1

Subtract the two expressions for x to obtain i=0n(λiμi)vi=0, and subtract the two sum conditions to obtain i=0n(λiμi)=0.

given
2.1

The previous step is an affine dependence relation among v0,,vn whose coefficients sum to 0. Since the vertices are affinely independent, every coefficient vanishes, so λiμi=0 for all i.

step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The geometric realization of an abstract simplicial complex

Definition

Let (V,K) be an abstract simplicial complex. Its geometric realization K is the set of functions α:V[0,1] such that:

  1. α(v)=0 for all but finitely many vV;
  2. vVα(v)=1;
  3. the support supp(α):={vV:α(v)0} is a simplex of K.

For each simplex σ={v0,,vn} of K, write σ:={αK:supp(α)σ}. Sending α to the barycentric tuple (α(v0),,α(vn)) identifies σ with the geometric simplex spanned by the standard basis vectors indexed by v0,,vn, so σ carries its Euclidean simplex topology.

We give K the weak topology with respect to these simplex inclusions: a subset UK is declared open exactly when Uσ is open in σ for every simplex σ of K.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Geometric simplices intersect in the realization of their common face

Statement

If σ,τK, then the corresponding geometric simplices in K satisfy στ=στ.

Proof

Given: Two simplices σ,τ in an abstract simplicial complex K.

1.1

Let xστ. Viewed as a barycentric-coordinate function on the full vertex set of K, the support of x is contained in σ because xσ, and it is contained in τ because xτ. Hence supp(x)στ, so xστ.

given
1.2

Conversely, if xστ, then supp(x)στ, so in particular supp(x)σ and supp(x)τ. Therefore xστ.

given
2.1

Steps 1.1 and 1.2 prove the two inclusions, so the two sets are equal.

step 1.1step 1.2
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

A finite simplicial complex has a compact Hausdorff realization

Statement

If K is a finite abstract simplicial complex, then its geometric realization K is compact and Hausdorff.

Proof

Given: A finite abstract simplicial complex K.

1.1

If K has no nonempty simplices, then K=, which is compact and Hausdorff. Otherwise K has finitely many vertices; write them as v1,,vN. For each simplex σ of K, the subset σK identifies with a Euclidean simplex in [0,1]N, cut out by finitely many linear equations and inequalities, so σ is compact.

given
2.1

The realization K is the union of the finitely many subsets σ over the nonempty simplices σ of K, and this union is empty in the case handled at the start of step 1.1. Therefore step 1.1 makes K a finite union of compact sets and hence compact.

step 1.1
2.2

For each simplex σ, let Oσ[0,1]N be open with Uσ=Oσσ. Since there are only finitely many simplices, a subset UK is weakly open exactly when U=(σOσ)K. Thus the weak topology on K agrees with the subspace topology from [0,1]N. The cube [0,1]N is Hausdorff, so K is Hausdorff as a subspace.

step 1.1
3.1

Steps 2.1 and 2.2 give compactness and Hausdorffness.

step 2.1step 2.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A simplicial map and its geometric realization

Definition

Let (V,K) and (W,L) be abstract simplicial complexes. A function f:VW is a simplicial map if f(σ):={f(v):vσ} is a simplex of L whenever σ is a simplex of K.

The geometric realization of f is the map f:KL defined by f(α)(w):=vf1(w)α(v). Because α has finite support, the sum is finite. The support of f(α) is contained in f(supp(α)), so it is again a simplex of L.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The realization of a simplicial map is continuous and functorial

Statement

If f:KL is a simplicial map, then f:KL is continuous. In addition, idK=idK and gf=gf for composable simplicial maps.

Proof

Given: A simplicial map f:KL and, for functoriality, a second simplicial map g:LM.

1.1

If σ={v0,,vn} is a simplex of K and xσ has barycentric coordinates x=i=0nλivi, then f(x)=i=0nλif(vi). Thus the restriction fσ:σf(σ) is the affine map determined by the vertex map f, so it is continuous.

given
1.2

For every barycentric function α, the identity vertex map leaves every coefficient unchanged, so idK(α)=α. Likewise gf(α)(u)=wg1(u)vf1(w)α(v)=g(f(α))(u), so realizations preserve composition.

given
2.1

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 f. Since K carries the weak topology with respect to its simplices, these simplexwise affine maps patch to a continuous map f:KL.

step 1.1
3.1

Steps 2.1 and 1.2 give continuity and the identity/composition laws.

step 2.1step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

An orientation of a simplex

Definition

Let σ={v0,,vn} be an n-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 n=0 there is only one orientation.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

An odd permutation reverses the sign of an oriented simplex

Statement

If πSn+1 is odd, then [vπ(0),,vπ(n)]=[v0,,vn] as oriented simplices.

Proof

Given: An odd permutation π of the vertices of an n-simplex.

1.1

Every odd permutation is a product of an odd number of transpositions, and each transposition switches the two orientation classes by definition.

given
2.1

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.

step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Simplicial chain groups and the boundary operator

Definition

For an abstract simplicial complex K and an integer n0, the simplicial chain group Cn(K) is the free abelian group generated by the oriented n-simplices of K, subject to the relation [vπ(0),,vπ(n)]=sgn(π)[v0,,vn] for every permutation π of the vertices of a simplex. For n<0, set Cn(K)=0.

The boundary operator n:Cn(K)Cn1(K) is 0=0 in degree 0. For n1, it is defined on an oriented simplex by n[v0,,vn]=i=0n(1)i[v0,,vi^,,vn].

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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The simplicial boundary is independent of the chosen oriented representative

Statement

The formula n[v0,,vn]=i=0n(1)i[v0,,vi^,,vn] 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.

1.1

It is enough to compare two orderings that differ by one adjacent transposition, because adjacent transpositions generate the symmetric group.

given
2.1

Let w=[v0,,vi,vi+1,,vn] and w=[v0,,vi+1,vi,,vn]=w. For j<i or j>i+1, deleting the jth vertex from w and w 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 w by deleting vi is exactly the face obtained from w by deleting vi in position i+1, and their coefficients are (1)i and (1)i+1. Likewise the face obtained from w by deleting vi+1 is the face obtained from w by deleting the entry in position i, again with opposite coefficients. Hence every term of w is the negative of the corresponding term of w, so w=w.

step 1.1
3.1

Therefore equivalent oriented representatives have the same boundary value, so the boundary formula is well defined on orientation classes.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The simplicial boundary squares to zero

Statement

For every simplicial complex K and every n1, one has n1n=0:Cn(K)Cn2(K).

Proof

Given: An integer n1 and an oriented n-simplex [v0,,vn].

1.1

Expanding n1n[v0,,vn] produces the sum of all codimension-two faces obtained by deleting two vertices, once by deleting vi then vj and once by deleting vj then vi.

given
2.1

The two appearances of the same codimension-two face have opposite signs because the exponents differ by 1. Hence every codimension-two face cancels with its partner, and the full sum is 0.

step 1.1
3.1

The boundary maps are homomorphisms, so vanishing on every oriented simplex implies n1n=0 on all of Cn(K).

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Simplicial cycles, boundaries, and homology

Definition

For a simplicial complex K, define Zn(K):=ker(n)Cn(K),Bn(K):=im(n+1)Cn(K). By 2=0, every boundary is a cycle. The nth simplicial homology group is Hnsimp(K):=Zn(K)/Bn(K).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Augmentation and reduced simplicial homology

Definition

For a simplicial complex K, the augmentation ε:C0(K)Z is the homomorphism determined by ε([v])=1 for every vertex v.

The augmented simplicial chain complex is C2(K)2C1(K)1C0(K)εZ0. Its homology groups are the reduced simplicial homology groups H~nsimp(K).

If K has no vertices, then Cn(K)=0 for all n0, so H~1simp(K)Z and H~nsimp(K)=0 for n1.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The simplicial augmentation is a chain map

Statement

For every simplicial complex K, one has ε1=0, so the augmented simplicial chain groups form a chain complex.

Proof

Given: An oriented edge [v0,v1] and the augmented simplicial chain complex of K.

1.1

By the boundary formula, 1[v0,v1]=[v1][v0]. Applying the augmentation gives ε([v1][v0])=11=0.

given
2.1

In degrees n1, the ordinary simplicial differentials already satisfy n1n=0, so adding ε at degree 0 preserves the chain-complex condition.

step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The induced graded homomorphism of a simplicial map

Definition

Let f:KL be a simplicial map. For an oriented simplex [v0,,vn] of K, define f#[v0,,vn]={[f(v0),,f(vn)]if f(v0),,f(vn) are pairwise distinct,0otherwise. Extending linearly gives the induced graded homomorphism f#:Cn(K)Cn(L) in each degree. The next lemma proves that these homomorphisms commute with the boundaries and hence form a chain map.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Induced simplicial chain maps commute with boundaries

Statement

If f:KL is simplicial, then f#=f# on every simplicial chain group.

Proof

Given: A simplicial map f:KL and an oriented simplex [v0,,vn].

1.1

If f(v0),,f(vn) are pairwise distinct, then deleting one vertex before applying f or after applying f produces the same oriented face. Therefore f#[v0,,vn]=f#[v0,,vn] term by term.

given
1.2

If some image vertices repeat, then f#[v0,,vn]=0. In f#[v0,,vn], the faces whose remaining image vertices still repeat map to 0, while the two faces obtained by deleting one of a repeated pair map to the same oriented simplex with opposite signs and cancel. Hence f#[v0,,vn]=0=f#[v0,,vn].

given
2.1

Steps 1.1 and 1.2 cover all simplices, so f#=f#.

step 1.1step 1.2
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Simplicial homology is functorial

Statement

Every simplicial map f:KL induces homomorphisms f:Hnsimp(K)Hnsimp(L), and these induced maps respect identities and composition.

Proof

Given: Simplicial maps f:KL and g:LM.

1.1

The previous lemma shows that each f# is a chain map, so simplicial homology may be applied degreewise to obtain homomorphisms f.

given
1.2

On every oriented simplex, the identity simplicial map induces the identity chain map, and (gf)#=g#f# by direct inspection of the defining formula. Therefore the induced homology maps satisfy (idK)=id and (gf)=gf.

given
2.1

Thus simplicial homology defines a functor from simplicial complexes and simplicial maps to graded abelian groups.

step 1.1step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Contiguous simplicial maps

Definition

Two simplicial maps f,g:KL are contiguous if for every simplex σK, the union of the vertex sets f(σ)g(σ) is a simplex of L.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Contiguous simplicial maps have homotopic realizations

Statement

If f,g:KL are contiguous simplicial maps, then their geometric realizations f,g:KL are homotopic.

Proof

Given: Contiguous simplicial maps f,g:KL.

1.1

Let x=iλivi lie in a simplex σ={v0,,vn} of K. Contiguity says that the vertices f(vi) and g(vi) together span a simplex of L, so for each t[0,1] the barycentric combination H(x,t):=i(1t)λif(vi)+itλig(vi) lies in L.

given
2.1

On each simplex of K, the formula in step 1.1 is affine in both x and t, 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 H:K×[0,1]L.

step 1.1
3.1

At t=0 the formula gives f(x), and at t=1 it gives g(x). Thus H is a homotopy from f to g.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Contiguous simplicial maps induce the same map on simplicial homology

Statement

If f,g:KL are contiguous simplicial maps, then f=g:Hnsimp(K)Hnsimp(L) for every n.

Proof

Given: Contiguous simplicial maps f,g:KL.

1.1

Let z be an n-cycle. Its support generates a finite subcomplex Kz of K. Choose a total ordering of the finite vertex set of Kz, and use the increasing vertex order as the preferred oriented generator of every simplex of Kz. On these generators define Pk[v0,,vk]:=i=0k(1)i[f(v0),,f(vi),g(vi),,g(vk)], omitting a summand when its displayed vertices are not pairwise distinct, and extend linearly. This is a well-defined homomorphism on Ck(Kz) because it is defined on a chosen free basis, and contiguity makes every nondegenerate summand a simplex of L.

givenconstruct
2.1

For each preferred generator of Ck(Kz), expand the boundary of the ith prism simplex from step 1.1. Consecutive interior faces cancel, the two outer faces give g#f#, and the remaining faces give P. Terms with repeated image vertices cancel in the corresponding normalized formula. Hence P+P=g#f# on the chains of Kz.

step 1.1algebra
3.1

Applying step 2.1 to the cycle z gives g#zf#z=(Pz), because z=0. Thus f#z and g#z represent the same homology class. Every homology class has such a finitely supported cycle representative, so f=g in every degree.

step 1.1step 2.1algebra
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The augmented simplicial chain complex of a simplex is contractible

Statement

Let Δn be a simplex, and choose one of its vertices a. The augmented simplicial chain complex of Δn is contractible.

Proof

Given: A simplex Δn with a chosen vertex a.

1.1

Define h1:ZC0(Δn) by h1(1)=[a]. For an oriented simplex [v0,,vk], set hk[v0,,vk]=[a,v0,,vk] if a{v0,,vk} and set hk[v0,,vk]=0 if a{v0,,vk}. Because adjoining a to a face of a simplex still gives a face of Δn, each hk is well defined.

given
2.1

If a{v0,,vk}, then the extra face created by applying hk and deleting a is exactly [v0,,vk], while every other face cancels with the corresponding term in hk1. If a is already among the vertices, then hk is 0 and the same cancellation leaves the identity term. Thus h+h=id on the augmented complex.

step 1.1
3.1

The family (hk)k1 is therefore a contracting homotopy, so the augmented simplicial chain complex of Δn is contractible.

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A simplex has zero reduced simplicial homology

Statement

If Δn is a simplex, then H~ksimp(Δn)=0 for every k.

Proof

Given: A simplex Δn.

1.1

The previous lemma gives a contracting homotopy for the augmented simplicial chain complex of Δn.

given
2.1

A contractible chain complex is acyclic, so every reduced simplicial homology group of Δn vanishes.

step 1.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Zero-th simplicial homology is free on connected components

Statement

For every simplicial complex K, the group H0simp(K) is the free abelian group on the connected components of K.

Proof

Given: A simplicial complex K.

1.1

If xσ and u is a vertex of the simplex σ, then the straight-line barycentric homotopy inside the Euclidean simplex σ joins x to u. Hence every point of K 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 K.

given
1.2

If vertices v and w are joined by an edge path v=v0,,vm=w, then [w][v]=i=1m[vi1,vi], so vertices in the same edge-path component define the same class in H0simp(K).

given
2.1

Fix a vertex v of K, let E(v) be the set of vertices joined to v by edge paths, and let K(v) be the subcomplex whose simplices have all vertices in E(v). By step 1.1, every simplex that contains one vertex of E(v) has all its vertices in E(v), so for each simplex σ the intersection K(v)σ is either σ or . Hence K(v) is open and closed in the weak topology. It is connected because every point of K(v) lies in a simplex whose vertices are edge-path connected to v, so step 1.1 and concatenation of those edge paths connect the point to v. Therefore K(v) is exactly the connected component of K containing v. In particular, the connected components of K are exactly the realizations of the edge-path components of the vertices, and if K every connected component contains a vertex.

step 1.1
3.1

Let π0(K) be the set of connected components of K. Since the vertices of every simplex lie in one component by step 1.1, the assignment sending a vertex u to the basis vector e[u] of the free abelian group Cπ0(K)ZeC extends to a homomorphism C0(K)Cπ0(K)ZeC. Boundaries of edges map to 0, so this homomorphism factors through Φ:H0simp(K)Cπ0(K)ZeC. If K=, then C0(K)=0 and both groups are zero. Otherwise step 2.1 shows that every connected component contains a vertex, so Φ is surjective.

step 1.1step 2.1
4.1

Choose one vertex aC in each nonempty connected component C. Every class in H0simp(K) is represented by a finite 0-chain z=unu[u]. By step 2.1, two vertices lie in the same connected component exactly when they are edge-path connected, so step 1.2 gives [u][aC]B0(K) for every uC. Hence in H0simp(K) one has [z]=C(uCnu)[aC]. If Φ([z])=0, then every component sum uCnu is zero, so [z]=0. Thus Φ is injective.

step 1.2step 2.1step 3.1
5.1

Therefore Φ is an isomorphism, so H0simp(K) is the free abelian group on the connected components of K.

step 3.1step 4.1
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Simplicial homology of a disjoint union is the direct sum

Statement

If K=αAKα is a disjoint union of simplicial complexes, then for every n, Hnsimp(K)αAHnsimp(Kα).

Facts & Assumptions

Given: A disjoint union K=αAKα.

[L1]

For each n0, the simplicial chain group Cn(K) is the free abelian group on the oriented nondegenerate n-simplices of K, and the boundary map is defined simplexwise (Simplicial chain groups and the boundary operator).

[L2]

Simplicial homology is the quotient of the cycle group by the boundary group: Hnsimp(K)=Zn(K)/Bn(K). (Simplicial cycles, boundaries, and homology)

Proof

technique · direct
1.1

Every nonempty simplex of K lies in exactly one summand Kα, so for each n0 one has Cn(K)αACn(Kα), and under this identification the boundary operator acts componentwise.

L1given
2.1

Therefore for each n0 the cycle groups, boundary groups, and homology groups split componentwise, giving Hnsimp(K)αAHnsimp(Kα). For n<0, both sides are zero by definition. This proves the statement for every n.

L2step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The simplicial Euler characteristic

Definition

If K is a finite simplicial complex and fn(K) denotes the number of n-simplices of K, the simplicial Euler characteristic of K is χ(K):=n0(1)nfn(K). The sum is finite because a finite simplicial complex has only finitely many simplices.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-04 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The Euler-Poincare formula for a finite simplicial complex with free homology

Statement

Let K be a finite simplicial complex. Assume that each simplicial homology group Hnsimp(K) is free of finite rank. Then χ(K)=n0(1)nrankHnsimp(K).

Proof

Given: A finite simplicial complex K whose simplicial homology groups are free of finite rank.

1.1

For each n, the chain group Cn(K) is free abelian on the oriented n-simplices of K, so rankCn(K)=fn(K). Since K is finite, only finitely many of these groups are nonzero.

given
2.1

Therefore the simplicial chain complex of K 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 n0(1)nrankCn(K)=n0(1)nrankHnsimp(K).

step 1.1
3.1

Replace rankCn(K) by fn(K) using step 1.1, and replace the left-hand side by χ(K) by definition. This yields the stated formula.

step 1.1step 2.1

5 · Examples, counterexamples and false statements

None yet.

Sources