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 Whitney approximation for Euclidean-valued maps
Statement
Let be continuous, let be closed, and suppose is smooth on an open neighbourhood of . For every positive continuous error function on , there exists a smooth map such that:
- on some open neighbourhood of , and
- for all .
Facts & Assumptions
Given: A continuous map , a closed set on which is smooth near , and a positive continuous error function .
Whitney approximation with pointwise positive error holds for Euclidean targets (Whitney approximation for Euclidean-valued maps).
A smooth map defined on a closed neighbourhood extends to a global smooth map (Smooth extension from a closed neighbourhood).
Smooth Urysohn cutoffs separate a closed set from a larger open neighbourhood (A smooth Urysohn lemma for a closed set in an open set).
Proof
Choose an open neighbourhood of on which is smooth, and then choose open sets Apply [L2] to each component of on the closed neighbourhood , and collect the componentwise extensions into a smooth map with on .
Define the continuous map Then vanishes on . Apply [L1] to with the same error function to obtain a smooth map satisfying everywhere.
By [L3], choose a smooth cutoff with on and on . Set On one has . Outside , one has , so Inside , the relation gives Therefore is smooth, agrees with on the neighbourhood of , and stays within .
Depends on
Used by
Dependency tree · two levels
8 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
- John M. Lee, Introduction to Smooth Manifolds, 2nd ed., Smooth Approximation of Maps Between Manifolds (standard reference, not scraped)