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.
Simplicial chain maps carried by specified cones are chain homotopic
Statement
Assign to each nonempty simplex of a cone subcomplex with a specified augmented contraction . Suppose whenever . If augmentation-preserving chain maps are carried by (their values on are supported in ), then a carried chain homotopy satisfies , with .
Source locators
4.3.9 proof, p.119, carried induction; specialized cone version.
Facts & Assumptions
A specified cone contraction fills each augmented cycle. An augmented simplicial cone has an explicit chain contraction.
The equation is the definition of chain homotopy. A chain homotopy.
Proof
Given: Nested cone carriers with specified contractions, and augmentation-preserving carried chain maps .
Set . For an oriented vertex , has augmentation . It lies in its carrier, so satisfies , using . Changing the sign of the generator changes by the same sign.
Suppose is defined through degree with there. For an oriented -simplex put . The nesting of the carriers puts all summands in . Since commute with boundary, . Here is part of the given chain complexes.
Define . The contraction identity gives , so . The formula is alternating in the original oriented representative: the boundary and are alternating, the already defined is linear, and depends only on the underlying face. It therefore defines a homomorphism without choosing orientations on all simplices. Induction defines all degrees, carried by , with the asserted identity; in degree both maps are the identity on , so their difference is zero. This is a chain homotopy by definition.
Depends on
Used by
Dependency tree · two levels
10 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
- C. R. F. Maunder, Algebraic Topology (standard reference, not scraped)