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 is linearly independent and then is linearly independent and ; and if then
Statement
Let be a vector space over a field (Vector space over a field), let and let .
- If then (Linear combination of a finite list, and the span as the smallest linear subspace containing ).
- If is linearly independent (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent) and , then , the set is linearly independent, and .
Facts & Assumptions
Given: A field , a vector space over , a subset and a vector .
For , is a linear subspace of containing and contained in every linear subspace of containing ; and implies (Linear combination of a finite list, and the span as the smallest linear subspace containing , The span is monotone and idempotent, exactly when is a linear subspace, and ).
is exactly the set of vectors with , and ( is exactly the set of linear combinations of finite lists of elements of , and ).
Finite sums: (The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity, Linear combination of a finite list, and the span as the smallest linear subspace containing ); (F1) an all- list sums to ; (F3) for , with agreeing with off and at (The sum of two linear subspaces and the sum of a finite family).
Deleting one index: for the map is injective with image , and a list with satisfies (Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never , its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent, claim 2).
A list is independent when forces every ; a subset is independent when every injective finite list into it is (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent).
is an abelian group; ; ; (V4) ; and a linear subspace contains and is closed under , under scalar multiplication and hence under additive inverses, since (Vector space over a field, In any vector space , , , , and forces or , Linear subspace of a vector space).
is a field: every has an inverse with (Field).
Every natural number is a successor, and (Every nonzero natural number is a successor, The natural numbers (von Neumann), On the order is membership: ); injectivity is as in Injection, surjection, bijection.
Proof
Claim 1. From we get . Conversely, assume ; since also , the set is contained in , which is a linear subspace of , so minimality gives . The two inclusions give the claim.
The two easy parts of claim 2. Assume . Then , because . Also by monotonicity, and lies in the larger set and not in the smaller, so the inclusion is strict.
Now assume in addition that is independent, and let be an injective finite list with and . If is not a value of , then is an injective finite list into , so independence of gives for every and there is nothing more to prove.
In the remaining case for exactly one , since is injective. Then , say , and is an injective finite list : it is injective as a composite of injections, and its values are the with , each of which lies in and differs from . Moreover, for every with the list has the value at , so deleting that index gives .
In that case the coefficient of vanishes. Suppose . Applying (F3) at to the list gives , where with and for , using to identify the deleted entry. By step 1.4 applied to , , which is a linear combination of elements of and therefore lies in . Then lies in , that set being a linear subspace, and hence so does , contradicting . So .
The remaining coefficients vanish too. Since by step 2.1, step 1.4 applied to itself gives ; the list is an injective finite list into the independent set , hence independent, so for every . As has image , this says for every , and with every coefficient vanishes.
Steps 1.3 and 3.1 show that every injective finite list into is independent, so is linearly independent; with step 1.2 this is claim 2, and step 1.1 is claim 1.
Remarks
-
This is the engine of both existence arguments below. Claim 2 is what makes a maximal independent set span (For the following are equivalent: is a basis; is a maximal linearly independent subset of ; is a minimal spanning subset of — maximality and minimality being in the inclusion order), what makes the maximal element produced by Zorn's lemma a basis (Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if with independent and , there is a basis of with ), and what forbids an independent set of vectors inside a space with a spanning set of (If and is a linear subspace of , then is finite-dimensional, , and if and only if ). Claim 1 is the complementary bookkeeping: adjoining a vector already in the span changes nothing.
-
Both hypotheses of claim 2 are needed. Independence of alone does not make independent, and alone does not either, since may already be dependent. The companion page's false statement that a union of two independent sets is independent is the same point in its most tempting false form: it is not enough that the adjoined part be independent, it must lie outside the span.
-
Where the field is used. Only at the inversion in the proof above. That is the single place where a vector space over a field behaves better than a module over a ring, and it is why the notions of this page are stated for fields throughout.
Depends on
- 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
- Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never $0_V$, its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- $\operatorname{span}(S)$ is exactly the set of linear combinations of finite lists of elements of $S$, and $\operatorname{span}(\varnothing) = \{0_V\}$
- The span is monotone and idempotent, $\operatorname{span}(S) = S$ exactly when $S$ is a linear subspace, and $\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S)$
- Linear subspace of a vector space
- The sum $U + W$ of two linear subspaces and the sum $\sum_{i<n} U_i$ of a finite family
- The product $g_0 g_1 \cdots g_{n-1}$ of a finite list in a monoid, by recursion, with the empty product ($n = 0$) equal to the identity
- Vector space over a field
- Field
- In any vector space $0_F v = 0_V$, $\lambda 0_V = 0_V$, $(-\lambda)v = -(\lambda v)$, $(-1_F)v = -v$, and $\lambda v = 0_V$ forces $\lambda = 0_F$ or $v = 0_V$
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Every nonzero natural number is a successor
- Injection, surjection, bijection
Used by
- FALSE: the union of two linearly independent subsets of a vector space is linearly independent False statement
- For B ⊆ V the following are equivalent: B is a basis; B is a maximal linearly independent subset of V; B is a minimal spanning subset of V — maximality and minimality being in the inclusion order Lemma
- If dim_F V = n and U is a linear subspace of V, then U is finite-dimensional, dim_F U ≤ n, and dim_F U = n if and only if U = V Theorem
- Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if L ⊆ S ⊆ V with L independent and span(S) = V, there is a basis B of V with L ⊆ B ⊆ S Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 66 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Linear independence (Wikipedia) (standard reference, not scraped)
- S. Axler, Linear Algebra Done Right, 4th ed., Ch. 2 (standard reference, not scraped)
- Dartmouth College linear algebra lecture notes: Linear independence (standard reference, not scraped)