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.
Compatible smooth simplex faces have a neighbourhood extension
Statement
Assume countable choice . Let be a smooth manifold without boundary. For every codimension-one face of , let be smooth in the affine-neighbourhood sense. Suppose on . Then there are an open neighbourhood of in the affine span of and a smooth with . Only face values are extended, not independently prescribed off-face extensions. No filling of the whole simplex is asserted.
Facts & Assumptions
Given: The compatible face maps and the boundaryless target.
Smooth simplex maps have smooth extensions on open affine neighbourhoods (Smooth singular simplex).
Under countable choice, the explicit auxiliary construction in the Whitney proof gives a smooth embedding , image , smooth inverse , an open and smooth retraction fixing (Whitney approximation for manifold-valued maps, Proof 1.1–6.1).
The smooth step is zero on , one on and takes values in (The standard smooth step function).
Countable choice is The Axiom of Countable Choice (), the countable instance of The Axiom of Choice; only the former is assumed here.
Proof
If , take and the empty map. Otherwise the face maps glue continuously to , because the boundary is a finite closed union and the maps agree on all intersections. Fix the data in [F2]. The only infinite-choice use in this proof is the countable embedding construction inherited there.
At write for its incident faces, where are barycentric coordinates. Choose one and use the other coordinates as affine coordinates on . Shrink around so every nonincident remains positive. For a nonempty , define by setting the coordinates in to zero and adding their sum to . Then , , and by nonnegativity of the retained and added coordinates.
On take a smooth Euclidean extension of on its actual face intersection near : restrict an extension of for one to . The intersections of the finitely many inverse extension domains give an open where every is defined. Set . For , choose with . Pair each nonempty omitting with . Their projected points coincide and lie in the actual intersection face, by step 2.1, so compatibility gives equal values with opposite signs. Only remains, giving . No agreement of the arbitrary extensions outside the actual simplex intersections was assumed.
Consider all local data from steps 2.1–3.1 together with balls whose closed doubled balls lie in . They form a cover of compact . Extract finitely many, indexed by , with extensions on neighbourhoods of their closed doubled balls. Define . It equals one on the radius- ball and zero outside the radius- ball. The product , extended by zero, is globally smooth: its support is contained in a closed ball strictly inside the domain of . This uses a finite subcover of all eligible data, not a simultaneous point-indexed choice.
Put and , an open neighbourhood of the boundary. On , is smooth. At a boundary point every active equals , hence . Thus is open and contains the boundary, and is smooth and restricts to . This proves the asserted neighbourhood extension.
In dimension one the boundary is two points and the same finite construction applies, regardless of their images; a filling is not inferred. Empty target with cannot satisfy the supplied-face hypothesis. Repeated or constant face values create no exception to the cancellation in step 3.1. The endpoint was treated in step 1.1; all other selections were finite. The boundaryless hypothesis is essential: compatibility alone does not guarantee nonnegative smooth extensions for a half-space target.
Depends on
Used by
Dependency tree · two levels
25 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)