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.
A singular cochain need not have finite support on singular simplices
Statement refuted
Refuted claim: every singular cochain on a singular chain group is supported on only finitely many singular simplices.
On the interval , define a homomorphism by for every singular -simplex . This is a perfectly valid singular -cochain, but it is nonzero on every singular -simplex.
Facts & Assumptions
Given: The interval .
Singular -chains are finite integer linear combinations of singular -simplices (Singular simplices and singular chain groups with coefficients).
For each point , the constant map is a singular -simplex (Singular simplices and singular chain groups with coefficients).
Counterexample
The assignment on each singular -simplex extends uniquely to a homomorphism from the free abelian group to , so it is a singular -cochain in the usual dual-group sense.
By [L2], each point determines a singular -simplex , and distinct points give distinct maps, so has infinitely many singular -simplices. The cochain takes the value on every one of them, so its support is infinite.
Thus is a singular cochain whose support is not finite, refuting the claim.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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 (standard reference, not scraped)