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.
FALSE: The union of two linear subspaces is a linear subspace
Statement
False claim: if and are linear subspaces of a vector space over a field (Linear subspace of a vector space), then is a linear subspace of .
The corresponding statement for intersections is true and is The intersection of a nonempty family of linear subspaces of is a linear subspace of . For unions it fails, and it already fails in the plane over any field: with the vectors with coordinates and (The vector space of all functions with pointwise operations, and as the case ), take and (Linear combination of a finite list, and the span as the smallest linear subspace containing ). Then and , so both lie in , while their sum, with coordinates , lies in neither.
Facts & Assumptions
Given: A field , the vector space over , the vectors and , and the linear subspaces and .
is the vector space of functions with and , where ; two elements are equal exactly when both coordinates agree (The vector space of all functions with pointwise operations, and as the case , Vector space over a field, The natural numbers (von Neumann), On the order is membership: ).
, and a span is a linear subspace (, which is when , and when contains only as the multiple , Linear combination of a finite list, and the span as the smallest linear subspace containing ).
A linear subspace is closed under addition, by condition (W2) (Linear subspace of a vector space, One-step subspace test: a nonempty is a linear subspace if and only if for all and ).
In a field: ; ; (Multiplication by zero: ) and multiplication is commutative, so ; and is the additive identity (Field).
The refuted claim: the union of two linear subspaces of a vector space is a linear subspace of it.
Refutation
and are linear subspaces of , being spans of one-element subsets.
The elements of are the vectors and the elements of are the vectors , for : indeed , , and symmetrically for .
has coordinates .
and , since ; so both lie in .
: if it lay in its coordinate at index would be , and if it lay in its coordinate at index would be , whereas both coordinates are and .
So contains and but not : it is not closed under addition, so condition (W2) fails and it is not a linear subspace of , although and both are. The claim of [L5] is false.
Remarks
-
Intersections behave, unions do not. An intersection of linear subspaces is always a linear subspace (The intersection of a nonempty family of linear subspaces of is a linear subspace of ), which is what makes definable as the smallest linear subspace containing (Linear combination of a finite list, and the span as the smallest linear subspace containing ). On the union side there is no corresponding construction, and the repair is to take the sum rather than the union: is a linear subspace, and it is exactly (, so the sum is the smallest linear subspace containing every ).
-
The exact condition. For linear subspaces of a vector space , the union is a linear subspace if and only if or . One direction is immediate, the union then being the larger of the two. For the other, suppose neither inclusion holds and choose and . If were in then , and if were in then ; both contradict the choice, since a linear subspace is closed under addition and under additive inverses. So and the union is not closed under addition.
-
The witness above is an instance of that criterion, since neither of and contains the other: has coordinate at index and so is not of the form , and symmetrically for .
Depends on
- Linear subspace of a vector space
- One-step subspace test: a nonempty $W \subseteq V$ is a linear subspace if and only if $\lambda u + v \in W$ for all $\lambda \in F$ and $u, v \in W$
- $\operatorname{span}\{v\} = \{\, \lambda v : \lambda \in F \,\}$, which is $\{0_V\}$ when $v = 0_V$, and when $v \ne 0_V$ contains $0_V$ only as the multiple $0_F v$
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- The intersection of a nonempty family of linear subspaces of $V$ is a linear subspace of $V$
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Vector space over a field
- Field
- Multiplication by zero: $0 \cdot a = 0$
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 53 results over 19 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)
- Union (set theory) (Wikipedia) (standard reference, not scraped)
- S. Axler, Linear Algebra Done Right, 4th ed. (free PDF, CC BY-NC) (standard reference, not scraped)
- The union of vector subspaces (Andrea Minini) (standard reference, not scraped)