Alphabeta Math
ExampleConstruction: 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.

The map (x,y)↦(x,xy) has nonconstant rank on every neighbourhood of the origin

Example

For f(x,y)=(x,xy), the derivative has rank 1 on the vertical axis and rank 2 off it. Thus no neighbourhood of (0,0) has constant rank, although Df is continuous.

Facts & Assumptions

Given: The polynomial map f:R2→R2, f(x,y)=(x,xy).

[L2]

A square matrix has rank 2 exactly when its determinant is nonzero, while its nonzero first row gives rank at least 1; every point of an open set has a ball contained in it (A matrix has rank at least r exactly when it has a nonzero r-rowed minor, The rank of a derivative and constant-rank Euclidean maps, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

Verification

technique · direct
1.1givenL1L2algebra

By [L1], det⁡Jf(x,y)=x. Thus [L2] gives rank 2 when x≠0 and rank exactly 1 when x=0.

1.2givenL2choose

Every open ball about the origin contains (0,0) and also (ε,0) for some nonzero sufficiently small ε.

2.1step 1.1step 1.2∎

Step 1.1 assigns different ranks to those points, so no neighbourhood of the origin has constant rank. The polynomial entries in [L1] are continuous, proving the final assertion.

Depends on

Used by

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