Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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 nondegenerate indefinite symmetric form can have W∩W⊥≠0

Statement refuted

Every nondegenerate symmetric bilinear form B on a finite-dimensional real vector space satisfies V=W⊕W⊥B for every subspace W.

Facts & Assumptions

Given: On R2, the symmetric form B(x,y)=x0y0−x1y1, the vector v=(1,1), and W=Rv.

[L1]

A bilinear form is nondegenerate when its radical is zero; for a matrix form this is equivalent to its representing matrix having full rank (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

[L2]

The orthogonal-decomposition theorem requires a positive-definite inner product and then gives V=W⊕W⊥ (For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥).

Counterexample

technique · counterexample
1.1L1algebra

The matrix of B is diag⁡(1,−1), whose determinant is −1, so [L1] makes B nondegenerate. It is indefinite because B((1,0),(1,0))=1 and B((0,1),(0,1))=−1.

1.2algebra

Yet B(v,v)=1−1=0. Therefore B(v,av)=0 for every av∈W, so the nonzero vector v lies in both W and W⊥B. Thus their sum is not direct.

2.1step 1.1step 1.2L2∎

This does not contradict [L2]: positivity, not merely nondegeneracy, is the hypothesis that forces the orthogonal direct sum.

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.