Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 singular homology of a disjoint union is the direct sum

Statement

Let X=αAXα be a disjoint union of topological spaces, and let G be an abelian group. Then for every n0, Hnsing(X;G)αAHnsing(Xα;G).

Facts & Assumptions

Given: A disjoint union X=αAXα, an abelian group G, and an integer n0.

[L1]

Singular homology is computed from the singular chain complex (The singular chain complex and singular homology).

Proof

technique · direct
1.1

The standard simplex Δn is path-connected: if u=(u0,,un) and v=(v0,,vn) are points of Δn, the straight-line map t(1t)u+tv stays in Δn. Therefore any singular simplex σ:ΔnX has connected image. Since the sets Xα are pairwise disjoint and clopen by [L2], the image of σ lies in exactly one summand Xα.

L2given
2.1

Step 1.1 identifies Cn(X;G) with the direct sum of the chain groups Cn(Xα;G), degree by degree, and the singular boundary preserves the chosen summand because each face of a simplex in Xα still lands in Xα. Thus C(X;G)αAC(Xα;G) as chain complexes.

L1step 1.1
3.1

Cycles and boundaries of a direct-sum chain complex are taken componentwise, so homology also splits componentwise. Applying [L1] to the chain-complex isomorphism of step 2.1 yields Hnsing(X;G)αAHnsing(Xα;G).

L1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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