Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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 map (x,y)(x,xy) is a diffeomorphism off the vertical axis

Example

Let U={(x,y)R2:x0}. The map

F:UU,F(x,y)=(x,xy),

is a smooth diffeomorphism with inverse G(u,v)=(u,v/u). The same formula on all of R2 omits every point (0,v) with v0.

Facts & Assumptions

Given: The map above.

[L1]

An injective regular Ck map has open image and is a Ck diffeomorphism onto that image (An injective regular Ck map is a Ck diffeomorphism onto its image).

[L2]

Finite componentwise products of Ck Euclidean maps are Ck (Ck Euclidean maps are closed under componentwise algebra and composition).

Verification

technique · direct
1.1

The coordinate functions are smooth, so [L2] makes F(x,y)=(x,xy) smooth. For an increment (h,k), F(x+h,y+k)F(x,y)(h,yh+xk)=(0,hk). Since 2hkh2+k2, the remainder divided by h2+k2 tends to zero. Hence DF(x,y)=(10yx),detDF(x,y)=x. On U, direct substitution gives G(F(x,y))=(x,y) and F(G(u,v))=(u,v).

L2givenalgebra
2.1

Step 1.1 verifies the hypotheses and conclusion of [L1], so F:UU is a smooth diffeomorphism. On the full plane, F(0,y)=(0,0) for every y, and hence no point (0,v) with v0 lies in its image.

step 1.1L1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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