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.
Canonical extension by zero of a singular cochain on a simplex basis
Statement
For a subspace and , restriction has a canonical real-linear section : extend the values on the supplied -simplex basis by zero on every other -simplex. It is a degreewise section, generally not a cochain map. In particular this applies to for an open cover. The construction is choice-free in classical ZF.
Facts & Assumptions
Given: A subspace , and a cochain .
Cochains are arbitrary functions on the simplex basis extended linearly over finite chains, and their differential is signed face precomposition (Real singular cochain complex).
Proof
For each -simplex , set if , and set it to zero otherwise; is the unique continuous corestriction. Extend by the finite sum formula of [F1]. Membership in and the unique corestriction specify a function, so no selection of a vector-space basis or representatives occurs. This formula is linear in .
On an -simplex the first clause always applies, so restriction of is on each generator and hence on every chain. If this is the zero map; if it is the identity. At degree zero it extends point functions by zero, including a one-point subspace. In negative degrees define the unique zero section.
To check that this is not generally a cochain map, take , , and the zero-degree cochain . On the identity path , . But , since every path in is constant and has equal endpoints, so . Thus the two composites differ. Constant and repeated simplices are fully allowed in the formulas. All degreewise section assertions, including the zero cases, follow from the prescribed basis values and require no AC.
Depends on
Used by
Dependency tree · two levels
3 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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)