Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

The graph of a Ck Euclidean map is a regular level set

Example

Let ψ:URmRn be Ck, k1, and define G:U×RnRn by G(x,y)=yψ(x). Then 0 is a regular value, G1(0) is the graph of ψ, and T(x,ψ(x))G1(0)={(v,Dψ(x)v):vRm}.

Facts & Assumptions

Given: The map ψ and the associated map G.

[L1]

Finite sums and scalar multiples of Ck Euclidean maps are Ck, coordinate maps are Ck componentwise, and total-derivative algebra gives DG(x,y)(v,w)=wDψ(x)v (Ck Euclidean maps are closed under componentwise algebra and composition, Ck Euclidean maps and diffeomorphisms, Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives).

[L2]

A regular level is locally a graph and has tangent space equal to the derivative kernel (A regular level set is locally a Ck graph of dimension mn, The tangent space to a regular level set).

Verification

technique · direct
1.1

The equation G(x,y)=0 is equivalent to y=ψ(x), so G1(0) is precisely the graph.

givenalgebra
1.2

By [L1], DG(x,y)(0,w)=w for every wRn, so DG(x,y) is surjective at every point and 0 is a regular value.

givenL1
2.1

Solving DG(x,ψ(x))(v,w)=0 gives w=Dψ(x)v, and [L2] identifies this kernel with the displayed tangent space.

step 1.2L1L2
3.1

The graph conclusion holds on the whole open set U, including when U is empty, in which case both sides are empty.

step 1.1step 2.1

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