Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck 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.

FALSE: every level set of a smooth map is locally a graph

Statement

Every level set of a smooth Euclidean map is locally a C1 graph.

Facts & Assumptions

Given: The smooth map F(x,y,z)=x2+y2−z2.

[L2]

The regular-level graph theorem assumes surjectivity of the derivative at every point of the fibre (Regular and critical points, regular and critical values, and level sets, A regular level set is locally a Ck graph of dimension m−n).

Refutation

technique · direct
1.1givenL1L2

The zero level is the double cone x2+y2=z2, and [L1] gives DF(0,0,0)=0, so the apex is critical and [L2] does not apply there.

1.2givenalgebra

The cone contains rays from the apex in the linearly independent directions (1,0,1), (1,0,−1), and (0,1,1). If it were a C1 graph near the apex, all these curve velocities would lie in its single two-dimensional tangent plane, which is impossible.

2.1step 1.1step 1.2∎

Thus this smooth polynomial has a level set that is not locally a C1 graph at the apex, refuting the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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