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.
Linear subspace of a vector space
Definition
Let be a vector space over a field (Vector space over a field). A subset is a linear subspace of when
- (W1) ;
- (W2) is closed under the vector addition: implies ;
- (W3) is closed under scalar multiplication: and imply .
Every vector space has the two trivial linear subspaces and itself; a linear subspace with is called proper.
The restricted operations are the required data, and is a vector space. By (W2) the vector addition of restricts to a binary operation , and by (W3) the scalar multiplication restricts to a map . With these and the element , the set is a vector space over :
- axioms (V2)–(V5) are equations required of elements of , which are in particular elements of , so they are inherited from ; likewise associativity and commutativity of the restricted addition;
- lies in by (W1) and is a two-sided identity for the restricted addition, since it is one in ;
- for the vector lies in by (W3), and (In any vector space , , , , and forces or ), so and holds in .
So is an abelian group, which is axiom (V1), and is a vector space over whose zero vector and whose additive inverses are those of . In the language of Subgroup, the three displayed conditions (S1) , (S2) closure under addition and (S3) closure under additive inverses all hold, so is a subgroup of the abelian group (Group and abelian group); that reading, and its converse, are recorded as The additive group of a vector space is an abelian group and every linear subspace is a subgroup of it; conversely a subgroup closed under scalar multiplication is a linear subspace and are cited from there rather than re-argued below.
Remarks
-
"Linear subspace", never bare "subspace", in this library. The word subspace is already in use here for the topological notion, a subset of a topological space carrying the induced topology, which is an unrelated idea. The names on this page therefore all say linear:
def-linear-subspace,lem-linear-subspace-criterion,lem-intersection-of-linear-subspaces,lem-linear-subspace-is-a-subgroup,def-sum-of-linear-subspaces. Where the ambient vector space is fixed and no confusion is possible, the surrounding prose still writes the full phrase. -
Closure under negatives is not a fourth condition. It follows from (W3), because the additive inverse of a vector is the scalar multiple . This is why the definition asks for three conditions where the definition of a subgroup asks for three of its own, and why the one-step test (One-step subspace test: a nonempty is a linear subspace if and only if for all and ) can compress them into one.
-
(W1) cannot be replaced by "" while dropping the others. It can be replaced by nonemptiness given (W3), since a nonempty closed under scalar multiplication contains (In any vector space , , , , and forces or ) for any of its elements . Stated with (W1) the definition is checkable one condition at a time, and the economical single test is One-step subspace test: a nonempty is a linear subspace if and only if for all and .
-
The field matters. A subset of may be closed under the scalars of a subfield without being closed under all of , so "linear subspace" always means "linear subspace over the field named". Restriction of scalars (A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars) is what makes that distinction possible.
Depends on
Used by
- Every linear subspace U of a vector space V has a complement: a linear subspace W with V = U ⊕ W Corollary
- Every vector space has a basis Corollary
- If V = bigoplus_i<n Uᵢ with every Uᵢ finite-dimensional, then V is finite-dimensional and dim_F V = ∑_i<n dim_F Uᵢ; in particular dim_F(U ⊕ W) = dim_F U + dim_F W Corollary
- Inside the space of eventually zero families, the linear subspace spanned by { eᵢ : i ≥ 1 } is proper and has a basis equinumerous with a basis of the whole space, so "equal dimension forces equality" fails without finite dimension Counterexample
- The first quadrant of ℝ² contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by -1 Counterexample
- The standard unit families { eᵢ : i ∈ ℕ } are linearly independent in F^ℕ but do not span it: the constant family 1_F is not a finite linear combination of them Counterexample
- The union of the two coordinate axes of F² is closed under scalar multiplication and is not closed under addition, so neither closure condition implies the other Counterexample
- Three distinct lines U₀, U₁, U₂ in F² have dim_F(U₀+U₁+U₂) = 2 while the inclusion-exclusion analogue of the dimension formula predicts 3, so the two-subspace formula does not extend Counterexample
- Three lines in F² that meet pairwise only in 0 and whose sum is F² with decompositions that are not unique, so pairwise trivial intersection does not give a direct sum Counterexample
- Affine subspaces as translates x+U of linear subspaces Definition
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis Definition
- Internal direct sum V = bigoplus_i<n Uᵢ: the sum is everything and each summand meets the sum of the others only in 0_V Definition
- Linear combination of a finite list, and the span span(S) as the smallest linear subspace containing S Definition
- The subspace Γ of directions along which a series converges absolutely, and its orthogonal complement Γ^⊥ Definition
- The sum U + W of two linear subspaces and the sum ∑_i<n Uᵢ of a finite family Definition
- A convergent series in ℝ² with Γ a line and Γ^⊥ a line, computed from the definition Example
- An additive f : ℝ → ℝ that is not x ↦ cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in ℝ², and every nonempty level set is dense in ℝ Example
- F^ℕ is a vector space and the eventually zero families form a linear subspace of it that is the span of the standard unit families Example
- In F³ the three coordinate lines are linear subspaces whose internal direct sum is F³, and F⁰ is the zero space Example
- The standard unit families eₖ ∈ F^ℕ form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle Example
- Two planes in F³ whose sum is F³ and whose intersection is a line, computed explicitly Example
- FALSE: all norms on a real vector space are equivalent False statement
- FALSE: if a convergent series in ℝⁿ does not converge absolutely, then every point of ℝⁿ is the sum of some rearrangement of it False statement
- FALSE: in every normed space a closed bounded set is compact False statement
- FALSE: The union of two linear subspaces is a linear subspace False statement
- ∑_i<n Uᵢ = span(⋃_i<n Uᵢ), so the sum is the smallest linear subspace containing every Uᵢ Lemma
- Assuming the Axiom of Choice, ℝ has a Hamel basis over ℚ: there is B ⊆ ℝ such that every real is a finite ℚ-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined ℚ-linear coefficient map Lemma
- 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 S ⊆ V is linearly independent and w ∉ span(S) then S ∪ {w} is linearly independent and span(S) ⊊ span(S ∪ {w}); and if w ∈ span(S) then span(S ∪ {w}) = span(S) Lemma
- One-step subspace test: a nonempty W ⊆ V is a linear subspace if and only if λ u + v ∈ W for all λ ∈ F and u, v ∈ W Lemma
- span(S) is exactly the set of linear combinations of finite lists of elements of S, and span(∅) = {0_V} Lemma
- span{v} = { λ v : λ ∈ F }, which is {0_V} when v = 0_V, and when v ≠ 0_V contains 0_V only as the multiple 0_F v Lemma
- The additive group of a vector space is an abelian group and every linear subspace is a subgroup of it; conversely a subgroup closed under scalar multiplication is a linear subspace Lemma
- The intersection of a nonempty family of linear subspaces of V is a linear subspace of V Lemma
- The span is monotone and idempotent, span(S) = S exactly when S is a linear subspace, and span(S ∪ {0_V}) = span(S) Lemma
- V = bigoplus_i<n Uᵢ if and only if every v ∈ V is ∑_i<n uᵢ with uᵢ ∈ Uᵢ in exactly one way; equivalently, if and only if the sum is V and ∑_i<n uᵢ = 0_V with uᵢ ∈ Uᵢ forces every uᵢ = 0_V Lemma
- A finite list v : n → V is an ordered basis if and only if every x ∈ V equals ∑_i<n λᵢ vᵢ for exactly one λ : n → F; those scalars are the coordinates of x in that ordered basis Theorem
- 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
- The dimension formula: for finite-dimensional linear subspaces U and W of V, the subspaces U + W and U ∩ W are finite-dimensional and dim_F(U+W) + dim_F(U ∩ W) = dim_F U + dim_F W Theorem
- The set of rearrangement sums of a convergent series in ℝⁿ is a nonempty subset of the affine subspace s + Γ^⊥ Theorem
…and 2 more results.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 17 results over 12 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 subspace (Wikipedia) (standard reference, not scraped)
- S. Axler, Linear Algebra Done Right, 4th ed., Ch. 1 (standard reference, not scraped)