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.
Smooth singular simplices in a coordinate ball
Example
Let be a smooth chart with a convex open ball in , and take finitely many . Then is a smooth singular -simplex. Repeated vertices are permitted.
Facts & Assumptions
Given: The chart, the specified vertices, and the affine hyperplane containing .
A smooth simplex requires a smooth target-valued extension on an open neighbourhood in (Smooth singular simplex).
Proof
The affine map , , is smooth. Convexity implies . Therefore is open in and contains the entire simplex. The smooth map is the extension required by [F1]. This constructs one common neighbourhood directly.
To make the uniform margin explicit, is compact. If , the continuous function attains a maximum on . Put . Any point within distance of lies in by the triangle inequality. Hence is a single open neighbourhood of the closed simplex on which the same extension is defined. For example, with and vertices , the path is , whose extension remains in for .
For this gives the constant extension on the one-point affine space. For repeated or coincident vertices the affine formula is still smooth and may be constant; no independence is needed. The construction includes all faces and endpoints because contains the closed simplex. Empty balls cannot carry the given vertex tuple; in dimension zero the ball is a point and the same formula is constant. Only a supplied finite tuple is used, so no AC is required.
Depends on
Used by
Nothing in the library uses this result yet.
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)