Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 SRm1={xRm:x2=R} is the regular level F1(R2) of F(x)=x22. At xSRm1, TxSRm1=x={h:x,h=0}.

Facts & Assumptions

Given: A radius R>0 and F(x)=x,x on Rm, with m1.

[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 mn, The tangent space to a regular level set, Tangent vectors to a regular level set are exactly its curve velocities).

Verification

technique · direct
1.1

By [L1], F1(R2)=SRm1 and DF(x)h=2x,h.

givenL1
2.1

If x lies on the sphere, then x0 and DF(x)x=2R20, so DF(x):RmR is surjective.

step 1.1algebra
3.1

Thus R2 is a regular value. By [L2], the sphere is locally a graph and TxSRm1=kerDF(x)=x, with the same set realized by curve velocities.

step 2.1L2
4.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.

step 1.1

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