Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-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.

A compact smooth knot has a choice-free normal tube

Statement

Let K⊂R3 be the image of a compact smooth embedded circle, and let E:N⊥K→R3 be the Euclidean normal-addition map E(p,v)=p+v. There is a real ε>0 such that E restricts to a diffeomorphism from {(p,v):∥v∥<ε} onto an open neighborhood Nε of K. Moreover, R3∖K strongly deformation retracts onto R3∖Nε by pushing each nonzero normal vector radially to length ε. The construction uses only a finite cover of the compact circle and no choice axiom.

Facts & Assumptions

Given: A compact smooth embedded circle K⊂R3 and its Euclidean normal-addition map.

[F1]

Normal addition is E(p,v)=p+v on the orthogonal normal bundle. The normal addition map for a Euclidean submanifold

[F2]

At each zero vector (p,0), the differential of normal addition is an isomorphism, so the map is a local diffeomorphism near that point. Normal addition is a local diffeomorphism along the zero section

[F3]

Every open cover of a compact metric space has a positive Lebesgue number: any subset of sufficiently small diameter lies in one member of the cover. Every open cover of a compact metric space has a Lebesgue number: a δ>0 such that every nonempty subset of diameter less than δ lies inside a single member of the cover

[F4]

A deformation retraction consists of a retraction and a homotopy from the identity to inclusion followed by retraction that fixes the retract pointwise. Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise

Proof

1.1givenF2choose

For each p∈K, [F2] supplies a local inverse neighborhood for E. Form the set of all tuples consisting of a local trivialization, an open base set O containing its center, and a radius r>0 such that O×{v:∥v∥<r} lies in that injectivity neighborhood. These base sets cover K. Compactness gives finitely many such tuples whose base sets Oi cover K; their recorded radii have a positive finite minimum r0. The tuples are collected as a set of all witnesses and only a finite subfamily is extracted, so no point-indexed choice is used.

2.1F2F3step 1.1choosealgebra

Apply [F3] to the finite cover {Oi} of the metric space K, obtaining δ>0. Choose 0<ε<min⁡{r0,δ/3}. If E(p,v)=E(q,w) with ∥v∥,∥w∥<ε, then ∥p−q∥=∥w−v∥<2ε<δ. Thus {p,q} lies in one Oi, and both (p,v) and (q,w) lie in the same recorded neighborhood where E is injective; hence (p,v)=(q,w). Every point of the radius-ε tube also lies in one of those local-diffeomorphism neighborhoods, so the restriction is an injective local diffeomorphism.

3.1F1step 2.1

An injective local diffeomorphism is open and has smooth local inverses that agree on overlaps. Therefore E is a diffeomorphism onto its open image Nε, which contains K by [F1].

4.1F1F4step 3.1construct∎

For x=E(p,v)∈Nε∖K, define Ht(x)=E ⁣(p,(1−t)∥v∥+tε∥v∥v),0≤t≤1, and set Ht(x)=x for x∉Nε. The normal coordinates are unique by step 3.1, and the formula approaches the identity at ∥v∥=ε, so these clauses paste continuously. It fixes the exterior pointwise and at t=1 sends every point in the punctured tube to its radius-ε boundary. Thus it is a deformation retraction of R3∖K onto R3∖Nε. Only finitely many local neighborhoods and a finite minimum were used.

Depends on

Used by

Dependency tree · two levels

26 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