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.
Relative smoothing fixes the endpoints of a path
Example
Assume . A continuous path in a smooth manifold without boundary, with and , is homotopic relative to both endpoints to a strict smooth singular path. For the explicit cusp path in , one endpoint-fixed smoothing is the constant path .
Facts & Assumptions
Given: The continuous path in the boundaryless target and its two endpoint values.
Boundaryless relative simplex smoothing preserves prescribed compatible face homotopies with their exact time parameter, using countable choice (Relative smoothing of a continuous simplex along its faces).
Countable choice is the axiom used here (The Axiom of Countable Choice ()).
Proof
Regard as . Its two faces are the separate points and . Prescribe their smooth zero-simplices with values and the constant homotopies , . The faces have empty intersection, so compatibility is vacuous. Under [F2], [F1] supplies a strict smooth path and a continuous homotopy satisfying and for every , as required.
The neighbourhood hypothesis behind [F1] is concrete in this dimension: disjoint small affine neighbourhoods of the two endpoint faces carry the constant smooth maps and . The relative-smoothing proof first changes the continuous path, keeping the endpoints fixed, to agree with such a smooth neighbourhood extension near the endpoint union; only then does it apply relative Whitney approximation. Thus no claim is made that mere equality of endpoint values already means smoothness near those endpoints.
In the explicit real example define . This is continuous, equals at , equals the constant smooth path at , and has at every time. Its middle value is , exhibiting the actual change of the path. If the original path is smooth, [F1] also permits the constant homotopy with , including constant paths and a one-point target. An empty target admits no path. The general assertion inherits only countable choice; the displayed real formula needs none.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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)