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

The cusp y2=x3 has a rank drop at the origin

Statement refuted

A polynomial level curve need not be regular everywhere. The zero level of F(x,y)=y2x3 has derivative rank 1 away from the origin and rank 0 at the origin.

Facts & Assumptions

Given: The polynomial F(x,y)=y2x3 and the curve γ(t)=(t2,t3).

[L2]

Regularity means surjectivity of the derivative, and a regular level is locally a C1 graph (Regular and critical points, regular and critical values, and level sets, A regular level set is locally a Ck graph of dimension mn).

Counterexample

technique · direct
1.1

One has F(γ(t))=t6t6=0, so the parametrized cusp lies in the zero level, and [L1] gives DF(0,0)=0 and γ(0)=0.

givenL1algebra
1.2

If (x,y)(0,0) lies on F1(0), then (3x2,2y)(0,0), so DF(x,y) has rank 1 and is surjective onto R.

givenL1algebra
2.1

Hence the derivative rank drops precisely at the cusp point. The two values y=±x3/2 for x>0 prevent a graph y=g(x) there, while the relation x=y2/3 is not differentiable at 0, in accord with the missing hypothesis in [L2].

step 1.1step 1.2L2algebra
3.1

The polynomial level curve therefore supplies the claimed rank-drop counterexample.

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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