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

The Gram determinant of two vectors is ∥u∥2∥v∥2−∣⟨u,v⟩∣2 and detects dependence

Example

For two vectors u,v, the Gram determinant is

det⁡G(u,v)=∥u∥2∥v∥2−∣⟨u,v⟩∣2.

In standard R2, u=(1,0) and v=(1,2) give determinant 4. Replacing v by 2u gives determinant 0.

Facts & Assumptions

Given: Two vectors u,v in an inner product space.

[L1]

A Gram determinant is positive exactly for an independent list and zero exactly for a dependent list (A Gram determinant is nonnegative and is positive exactly when the vector list is linearly independent).

[L2]

Cauchy–Schwarz says ∣⟨u,v⟩∣2≤∥u∥2∥v∥2, with equality exactly for dependent u,v (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Verification

technique · computation
1.1L1L2algebra

Expanding the determinant of (⟨u,u⟩⟨u,v⟩⟨v,u⟩⟨v,v⟩) and using conjugate symmetry gives the displayed formula. Its nonnegativity and equality case agree with [L1] and [L2].

2.1step 1.1L1algebra∎

For (1,0),(1,2), the Gram matrix is (1115), whose determinant is 4; this is positive, and (1,0),(1,2) are independent, as [L1] requires. For (u,2u), the two rows are dependent and the determinant is 0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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.