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.
Triangular 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 with some coefficient nonzero, and let be the least index with .
Pairing with and using [F1] gives . The terms with vanish by the choice of , and the terms with vanish by the triangular hypothesis, so only remains.
Since and a field has no zero divisors by [F2], this forces , contradicting step 1.1. Therefore are linearly independent.
Remarks
- The direction of the triangular hypothesis matters. The proof chooses the least nonzero coefficient, so it kills the terms below the diagonal by minimality and the terms above it by hypothesis.
Depends on
- Diagonal criterion: if $\langle v_i,w_i\rangle\ne0$ and $\langle v_i,w_j\rangle=0$ for $i\ne j$, then $v_1,\dots,v_m$ are linearly independent
- 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
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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)