Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)
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.

Nearest-point projection is the tubular retraction after shrinking

Statement

Assume countable choice. Let S⊆Rm be a closed embedded smooth submanifold. After shrinking the tubular neighbourhood from the Euclidean tubular neighbourhood theorem, the tubular retraction agrees with the unique nearest-point projection onto S.

Facts & Assumptions

Given: Countable choice and a closed embedded smooth submanifold S⊆Rm.

[L1]

Under countable choice (The Axiom of Countable Choice (ACω)), the Euclidean tubular theorem constructs E:Ωδ→U with a positive radius satisfying δ(p)≤r(p)/4, where E is a diffeomorphism on each local set Va(p)={(q,w):∥q−p∥<a, ∥w∥<a} for a<r(p) (The Euclidean tubular neighbourhood theorem, proof steps 2.1–4.1).

[L2]

The tubular retraction is r=π∘E−1, where π(p,v)=p is the normal-bundle projection (directly from [L1]).

Proof

technique · direct
1.1L1givenalgebra

If S is empty the assertion is vacuous. Otherwise fix x=E(p,v)=p+v in the tube from [L1]. Since S is closed, the continuous distance function to x attains a minimum on the compact set S∩B‾(x,∥v∥); let q be a minimizer. Because p∈S, ∥x−q∥≤∥v∥. The first derivative of y↦∥x−y∥2 along every tangent vector at q vanishes, so x−q⊥TqS and x=E(q,x−q).

2.1L1step 1.1algebra

The triangle inequality gives ∥q−p∥≤∥q−x∥+∥x−p∥≤2∥v∥<r(p)/2. Also ∥x−q∥≤∥v∥<r(p)/4. Choose a with 2∥v∥<a<r(p). Both (p,v) and (q,x−q) then lie in Va(p), on which [L1] makes E injective. Since they have the same image x, they coincide, and in particular q=p. The same argument applies to any minimizing q, so the nearest point is unique.

3.1L2step 2.1∎

By [L2], r(x)=p. Step 2.1 shows that p is exactly the unique nearest point. The theorem’s constructed tube already has this property, hence so does any smaller tube.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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