Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-06
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.

The cover-small inclusion is a chain homotopy equivalence

Statement

The inclusion of the cover-small complex into the singular complex is a chain homotopy equivalence.

Facts & Assumptions

Given: A family U whose interiors cover X, an abelian group G, and the barycentric subdivision data. Write A=CU(X;Z) and C=C(X;Z). We first construct integral operators and then tensor with G.

Proof

technique · direct
1.1

Use S and T with 1S=T+T from Subdivision is chain homotopic to the identity. Their constructions in Barycentric subdivision operator and Subdivision prism homotopy take each singular simplex to a finite sum of its compositions with affine simplices in its own domain. Thus neither operator enlarges the image of a simplex, and both preserve A. Also S is a chain map: applying on either side of the displayed homotopy identity gives S=S. Set Dq=i=0q1TSi for q0, so D0=0 and 1Sq=Dq+Dq by telescoping.

givenconstruct
2.1

For each singular simplex σ, let a(σ) be the least q0 with SqσA; existence follows from Finite chains eventually become cover-small with integer coefficients. Define m recursively on dimension: on vertices set m=0, and for positive-dimensional σ set m(σ)=max({a(σ)}{m(σδj):0jdimσ}). Every maximum is finite and uses already defined lower-dimensional values. Since S preserves small chains, Sm(σ)σ is small. Every face τ has m(τ)m(σ) by construction, regardless of cancellations in subdivided chains. If σ is already small, all its faces are small, so this recursion gives m(σ)=0.

step 1.1construct
3.1

Define Dσ=Dm(σ)σ on integral generators and extend linearly. Put R=1DD on C. The identity 2=0 gives R=R. On a simplex, telescoping gives Rσ=Sm(σ)σ+Dm(σ)(σ)D(σ). The first term is small. For each face τ, its signed correction is i=m(τ)m(σ)1TSiτ. Each Siτ is small for these indices, and T preserves small chains. Therefore Rσ is small.

step 1.1step 2.1algebra
4.1

Regard R as a chain map r:CA and let ι:AC. Then 1ιr=D+D. On every small simplex m=0, hence D=0 on A; its boundary is also small, so rι=1. Thus one inverse composite is the identity and the other is chain homotopic to it. In degree zero all vertices are small and D=0; if X is empty both complexes are zero.

step 2.1step 3.1algebra
5.1

The group An is the direct summand of the free abelian group Cn spanned by small singular simplices. Tensoring its inclusion with G identifies AnG with the cover-small subgroup of Cn(X;G). Tensor r,D and their identities with idG; these identities remain valid for every abelian G, including G=0, without a flatness assumption. This proves the stated chain homotopy equivalence with the page's coefficients.

step 4.1algebra

Depends on

Used by

Dependency tree · two levels

11 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