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.
Diagonal criterion: if and for , then are linearly independent
Statement
Let be a field, let be an -vector space, and let be a bilinear form. Suppose vectors satisfy
Then are linearly independent.
Facts & Assumptions
Given: a field , a vector space over , a bilinear form on , and vectors satisfying the displayed hypotheses.
A bilinear form is linear in each variable separately (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms).
A field has no zero divisors (Field).
Proof
Suppose . Pairing with and using linearity in the first variable from [F1] gives .
Every term with vanishes by hypothesis, so this reduces to . Since and a field has no zero divisors by [F2], we get .
The index was arbitrary, so every coefficient is . Hence are linearly independent.
Remarks
- The argument uses only bilinearity and the diagonal pattern. No positivity and no nondegeneracy is involved, which is why the criterion works over as well as over .
Depends on
- Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Vector space over a field
- Field
Used by
- FALSE: ⟨ x,y⟩=∑ᵢxᵢyᵢ makes F₂ⁿ an inner product space False statement
- Determinant criterion: if the matrix (⟨ vᵢ,wⱼ⟩)_i,j is invertible then both v₁,…,vₘ and w₁,…,wₘ are linearly independent Lemma
- Triangular criterion: if ⟨ vᵢ,wᵢ⟩≠0 and ⟨ vᵢ,wⱼ⟩=0 for j<i, then v₁,…,vₘ are linearly independent Lemma
- Oddtown: distinct A₁,…,Aₘ⊆[n] with every | Aᵢ| odd and every | Aᵢ∩ Aⱼ| (i≠ j) even satisfy m≤ n Theorem
Dependency tree · two levels
17 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
- L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, §2.1.4 (standard reference, not scraped)