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

A positive-definite quadratic ellipsoid is a regular level set

Example

Let A be a symmetric positive-definite real m×m matrix and put F(x)=⟨Ax,x⟩. The ellipsoid F−1(1) is a regular level set, and TxF−1(1)=(Ax)⊥.

Facts & Assumptions

Given: A symmetric positive-definite matrix A and the quadratic function F.

[L3]

At a regular level point, the level is locally a graph and its tangent space is the derivative kernel (A regular level set is locally a Ck graph of dimension m−n, The tangent space to a regular level set).

Verification

technique · direct
1.1givenL1

If F(x)=1, then x≠0 by [L1], and Ax≠0 because Ax=0 would give F(x)=0.

2.1step 1.1L2

By [L2], DF(x)(Ax)=2∥Ax∥22>0, so DF(x) is a nonzero functional and hence surjective onto R.

3.1step 2.1L3

Therefore 1 is a regular value, and [L3] gives TxF−1(1)=ker⁡DF(x)={h:⟨Ax,h⟩=0}=(Ax)⊥.

4.1step 1.1step 3.1∎

The calculation also shows that no singular point can occur on the asserted level; positive definiteness and the level value 1 exclude the only possible degeneracy x=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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