Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Cellular homology of the one-polygon surface model

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a compact connected oriented topological surface of genus g≥0. The Axiom of Choice is used only to invoke the polygonal normal form and surface classification (Polygonal normal forms for compact connected surfaces, Classification of compact connected surfaces) and identify the standard one-polygon model Σg with X. For g=0, Σ0 is the paired sphere digon with boundary word aa−1; for g≥1, Σg is the 4g-gon with boundary word ∏i=1gaibiai−1bi−1 (Polygonal schemas and paired boundary edges). In the associated cellular chain complex with integral coefficients:

  1. If g≥1, there is one 0-cell, 2g oriented 1-cells e1,…,e2g corresponding in order to a1,b1,…,ag,bg, and one 2-cell, with ∂1=∂2=0. Thus H1(X;Z)≅Z2g, freely based by the side-loop classes, while H0(X;Z)≅H2(X;Z)≅Z and Hq(X;Z)=0 for q≥3.
  2. If g=0, the digon has two 0-cells v0,v1, one oriented 1-cell e from v0 to v1, and one 2-cell. Its differentials are ∂1e=v1−v0 and ∂2=0, so H1(X;Z)=0, H0(X;Z)≅H2(X;Z)≅Z, and Hq(X;Z)=0 for q≥3.
  3. The Euler characteristic of the displayed cell structure is 2−2g in both cases.

For g≥1, subdividing one loop 1-cell by inserting a vertex and replacing it by two oriented edges leaves H1 free of rank 2g: the subdivided side class is represented by the sum of the two new edge classes, together with the other side-loop classes.

Facts & Assumptions

Given: X is a compact connected oriented topological surface of genus g≥0.

[F1]

Under the Axiom of Choice, the polygonal normal form and surface classification identify X with the sphere digon when g=0, and with the commutator 4g-gon when g≥1 (Polygonal normal forms for compact connected surfaces, Classification of compact connected surfaces, The Axiom of Choice).

[F2]

A one-polygon schema has a finite CW structure with its corner classes as 0-cells, paired side classes as 1-cells, and polygon interiors as 2-cells (Polygonal schemas and paired boundary edges).

[F3]

The cellular groups and boundary maps are those of Oriented cellular chain group and Cellular boundary from three consecutive skeleta; the incidence-degree formula computes each boundary coefficient (Incidence number of two CW cells, Cellular boundary is the incidence degree matrix), and ∂2=0 (The cellular boundary squares to zero).

[F4]

Cellular homology is the homology of this chain complex and agrees naturally with singular homology (Cellular homology, Cellular homology computes singular homology).

[F5]

For a finite CW structure, Euler characteristic is the alternating cell count (Euler characteristic of a finite CW complex).

Proof

technique · direct
1.1F1F2

By [F1], it is enough to compute on the indicated polygonal model; the homeomorphism transfers the resulting singular homology groups to X. In the commutator polygon, let v0,…,v4g=v0 be the successive corners. For each handle block aibiai−1bi−1, its side identifications join the four corners in that block successively: the ai pair identifies the first with the fourth and the second with the third, while the bi pair identifies the second with the next block's first and the third with the fourth. Thus every corner lies in one class. There are consequently one 0-cell, 2g paired 1-cells, and one 2-cell.

1.2F1F2F3

For g=0, the sphere digon has two corner classes: its paired sides identify each corner with itself, leaving the two distinct corners v0,v1. Orient the single paired edge from v0 to v1. The 1-cell incidence formula gives ∂1e=v1−v0. The attaching word aa−1 has total exponent zero, so its 2-cell has ∂2=0. Therefore ker⁡∂1=0 and coker⁡∂1≅Z.

2.1F3step 1.1

When g≥1, every 1-cell is a loop at the unique vertex, so ∂1=0 by [F3]. The coefficient of each 1-cell in ∂2 is the degree of the attaching word after the other edges are collapsed; each label occurs once with each exponent, so that degree is 1−1=0. Hence ∂2=0. The chain groups are C2=Z, C1=Z2g, C0=Z, and Cq=0 for q≥3.

3.1F4F5step 2.1step 1.2

Taking kernels modulo images in the chain complexes of steps 2.1 and 1.2 gives the stated cellular homology groups in both cases. By [F4], these are the singular homology groups, and the cellular generators in the commutator model are exactly its side-loop classes. Counting cells gives 1−2g+1=2−2g for g≥1 and 2−1+1=2 for the digon, proving the Euler-characteristic claim by [F5].

4.1F3step 2.1∎

To verify the subdivision claim, let the new vertex be w and orient the two replacement edges from the old vertex v to w and from w to v. Their boundaries are w−v and v−w; all other loop edges still have zero boundary. In the attaching word the subdivided side occurs once in each direction, so each new edge also has total exponent zero and ∂2=0. The kernel of ∂1 is generated by the sum of the two replacement edges and the other 2g−1 loop edges. This gives the asserted basis, with the original side class represented by that sum.

Depends on

Used by

Dependency tree · two levels

34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources