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.
A fine Euclidean approximation lands in a prescribed tubular neighbourhood
Statement
Let be a closed embedded smooth submanifold with tubular neighbourhood , and let be continuous. Then there exists a positive continuous error function on such that every smooth map satisfying for all has image contained in .
Facts & Assumptions
Given: A continuous map and a tubular neighbourhood of the embedded image .
A positive continuous error function is a continuous map into (Positive continuous error functions for strong approximation).
The prescribed tubular neighbourhood is open and contains . (Tubular neighbourhoods of embedded submanifolds)
Distance to a fixed nonempty set is a finite nonnegative real-valued -Lipschitz function. (, so the distance to a fixed nonempty set is -Lipschitz)
Proof
Put . If , take . It is positive and continuous, and every map into already has the required image. This also covers . If is empty the unique error function and the conclusion are vacuous.
Suppose . Set The distance is a finite real number by [L2]. For each , openness of gives a ball of some radius about contained in ; every point of is therefore at distance at least . Thus . By [L2] the distance function is continuous; composing with and taking its minimum with preserves continuity. Explicitly, by the three cases , , and one on each side. Hence is positive, finite, continuous and at most , without making any simultaneous choices of the pointwise radii.
If , the defining infimum gives [step 1.2, L2] . This contradicts the assumed bound, since . Thus for every .
Therefore every approximation with the specified error bound lands in [step 1.1, step 2.1] the prescribed . The construction is choice-free and uses neither an approximation existence theorem nor a new tubular neighbourhood.
Depends on
Used by
Dependency tree · two levels
18 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)