Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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 Euclidean sphere is a regular level set with tangent hyperplanes

Example

For R>0, the sphere SRm−1={x∈Rm:∥x∥2=R} is the regular level F−1(R2) of F(x)=∥x∥22. At x∈SRm−1, TxSRm−1=x⊥={h:⟨x,h⟩=0}.

Facts & Assumptions

Given: A radius R>0 and F(x)=⟨x,x⟩ on Rm, with m≥1.

[L2]

A regular level is locally a graph, its tangent space is the derivative kernel, and its tangent vectors are exactly its curve velocities (A regular level set is locally a Ck graph of dimension m−n, The tangent space to a regular level set, Tangent vectors to a regular level set are exactly its curve velocities).

Verification

technique · direct
1.1givenL1

By [L1], F−1(R2)=SRm−1 and DF(x)h=2⟨x,h⟩.

2.1step 1.1algebra

If x lies on the sphere, then x≠0 and DF(x)x=2R2≠0, so DF(x):Rm→R is surjective.

3.1step 2.1L2

Thus R2 is a regular value. By [L2], the sphere is locally a graph and TxSRm−1=ker⁡DF(x)=x⊥, with the same set realized by curve velocities.

4.1step 1.1∎

Negative levels are empty and hence regular by the vacuous convention; the zero level is {0} and is critical because DF(0)=0. Neither boundary case is included in the positive-radius claim.

Depends on

Used by

Dependency tree · two levels

60 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