Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)
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 j:N↪Rm be a closed embedded smooth submanifold with tubular neighbourhood U, and let F:M→N be continuous. Then there exists a positive continuous error function ε on M such that every smooth map H~:M→Rm satisfying ∥H~(p)−j(F(p))∥<ε(p) for all p has image contained in U.

Facts & Assumptions

Given: A continuous map F:M→N and a tubular neighbourhood U of the embedded image j(N)⊆Rm.

[F1]

A positive continuous error function is a continuous map into (0,∞) (Positive continuous error functions for strong approximation).

[L1]

The prescribed tubular neighbourhood is open and contains j(N). (Tubular neighbourhoods of embedded submanifolds)

[L2]

Distance to a fixed nonempty set is a finite nonnegative real-valued 1-Lipschitz function. (∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz)

Proof

technique · direct
1.1givenF1L1

Put C=Rm∖U. If C=∅, take ε≡1. It is positive and continuous, and every map into Rm=U already has the required image. This also covers m=0. If M is empty the unique error function and the conclusion are vacuous.

1.2givenF1L1L2construct

Suppose C≠∅. Set ε(p)=min⁡{1,12d(j(F(p)),C)}. The distance is a finite real number by [L2]. For each p, openness of U gives a ball of some radius r>0 about j(F(p)) contained in U; every point of C is therefore at distance at least r. Thus d(j(F(p)),C)≥r>0. By [L2] the distance function is continuous; composing with j∘F and taking its minimum with 1 preserves continuity. Explicitly, ∣min⁡(1,a)−min⁡(1,b)∣≤∣a−b∣ by the three cases a,b≤1, a,b≥1, and one on each side. Hence ε is positive, finite, continuous and at most 1, without making any simultaneous choices of the pointwise radii.

2.1step 1.2L2

If H~(p)∈C, the defining infimum gives [step 1.2, L2] d(j(F(p)),C)≤∥H~(p)−j(F(p))∥. This contradicts the assumed bound, since ε(p)≤d(j(F(p)),C)/2<d(j(F(p)),C). Thus H~(p)∈U for every p.

3.1step 1.1step 2.1∎

Therefore every approximation with the specified error bound lands in [step 1.1, step 2.1] the prescribed U. 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