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 by two overlapping product cylinders whose intersection is two cylinders. Then .
Facts & Assumptions
Given: The described cylinder cover, with and .
Verification
Choose two open arcs covering the first factor with , two open arcs. Put and . Each overlap component and each of retracts onto the second factor. After ordering , the Mayer--Vietoris map is , since inclusion preserves the second-factor circle and the sequence uses opposite signs for and . The same formula holds in degree zero. Its kernel is and its cokernel is , with no freeness assumption on .
Exactness gives , where the right is the displayed degree-zero kernel. Fix and orient so that its arc in has boundary , with . Splitting its singular cycle into the arcs in and , the chain-level Mayer--Vietoris connecting map sends its class with coefficient to . Hence this first-factor circle supplies a homomorphic section of for every abelian . The second-factor circle at maps to in and represents the cokernel generator of step 1.1. These two circle maps identify with .
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
- Allen Hatcher, Algebraic Topology, §2.2 (standard reference, not scraped)