Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

A noncompact embedded curve with no uniform tubular radius

Example

The graph γ(t)=(t,sin⁡(t2)), t∈R, is a noncompact smooth embedded curve. For no constant r>0 is the Euclidean normal addition map a diffeomorphism on all normal vectors of length less than r.

Facts & Assumptions

Given: The graph γ(t)=(t,f(t)) with f(t)=sin⁡(t2), and its unit normal ν(t)=(−f′(t),1)/1+f′(t)2.

Verification

technique · direct
1.1givenalgebra

The first coordinate of γ is t, so γ is injective with a continuous inverse on its image; also γ′(t)=(1,f′(t))≠0. Thus it is a smooth embedding, and its image is noncompact because its first-coordinate projection is all of R.

1.2givenalgebra

For k≥0 put tk=π/2+2πk. Direct differentiation gives f′(tk)=0 and f′′(tk)=−4tk2, so ∣f′′(tk)∣→∞.

2.1step 1.2algebra

In the normal-bundle coordinates (t,v), normal addition is E(t,v)=γ(t)+vν(t). At tk, ν(tk)=(0,1) and ν′(tk)=(−f′′(tk),0), so ∂tE(tk,v)=(1−vf′′(tk),0) and ∂vE(tk,v)=(0,1). At vk=1/f′′(tk) the differential of E is singular.

3.1step 2.1algebra∎

Given r>0, choose k with ∣vk∣=1/(4tk2)<r. Then (tk,vk) lies inside the constant-radius normal tube, but its normal addition map is not a local diffeomorphism there. Hence that tube cannot be a tubular diffeomorphism for any fixed r>0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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