Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 2026-09-24 (gpt-6-sol)
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.

Mayer–Vietoris computation of first homology of the torus

Example

Cover T2=S1×S1 by two overlapping product cylinders U,V whose intersection is two cylinders. Then H1(T2;G)≅G⊕G.

Facts & Assumptions

Given: The described cylinder cover, with U,V≃S1 and U∩V≃S1⊔S1.

Verification

technique · direct
1.1givenconstruct

Choose two open arcs A,B⊂S1 covering the first factor with A∩B=I0⊔I1, two open arcs. Put U=A×S1 and V=B×S1. Each overlap component and each of U,V retracts onto the second factor. After ordering I0,I1, the Mayer--Vietoris map H1(U∩V;G)→H1(U;G)⊕H1(V;G) is (a,b)↦(a+b,−a−b), since inclusion preserves the second-factor circle and the sequence uses opposite signs for U and V. The same formula holds in degree zero. Its kernel is {(g,−g):g∈G} and its cokernel is G, with no freeness assumption on G.

2.1step 1.1algebra∎

Exactness gives 0→G→H1(T2;G)→δG→0, where the right G is the displayed degree-zero kernel. Fix y0∈S1 and orient S1×{y0} so that its arc in U has boundary g([x0]−[x1]), with xj∈Ij. Splitting its singular cycle into the arcs in U and V, the chain-level Mayer--Vietoris connecting map sends its class with coefficient g to (g,−g). Hence this first-factor circle supplies a homomorphic section of δ for every abelian G. The second-factor circle at x0 maps to (g,0) in H1(U)⊕H1(V) and represents the cokernel generator of step 1.1. These two circle maps identify H1(T2;G) with G⊕G.

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