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.
If satisfy for and , they are linearly independent
Statement
Let and let . Suppose
Then are linearly independent.
Facts & Assumptions
Given: vectors satisfying the displayed hypotheses.
The standard inner product is bilinear (The standard formulas on and on are inner products).
A sum of nonnegative real numbers is only when every summand is (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
Proof
Suppose . Taking the inner product of this vector with itself and expanding bilinearly gives
Each summand on the right is nonnegative: by hypothesis and . Therefore [F2] forces every term to vanish, and hence every is .
So the only linear relation is the trivial one, and the vectors are linearly independent.
Remarks
- This is the one place in the page where the order and positivity of are load-bearing. That is exactly what fails over .
Depends on
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- Real and complex inner product spaces, with the inner product linear in the first argument
- The standard bilinear form $\langle x,y\rangle=\sum_{i<n}x_iy_i$ on $F^{n}$
- 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
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- The sum $\sum_{i \in S} a_i$ over a finite index set, and its product form
Used by
Dependency tree · two levels
30 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
- J. Matousek, Thirty-three Miniatures, Miniature 4 (standard reference, not scraped)