Alphabeta Math
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.

✓ 8 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Vector Spaces and Linear Subspaces: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-02 (claude-opus-5)Open item page →

R is a vector space over itself, over the embedded copy of Q by restriction of scalars, and over Q itself via the embedding

Example

Let R be the real numbers (The real numbers), a field (The reals form a field) and an ordered field (The reals form a totally ordered field, Ordered field), and let Q be the rationals, a field (The rationals form a field).

  1. R is a vector space over itself (Vector space over a field): the vectors are the reals, the vector addition is the field addition, the zero vector is 0, and the scalar multiplication is the field multiplication.
  2. Let ι:Q→R be the unique field homomorphism (The unique embedding of ℚ into an ordered field, Field homomorphism and embedding), which is injective and order-preserving. Its image QR:=ι[Q]={ ι(q):q∈Q } is a subfield of R (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations), and by restriction of scalars (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars) R is a vector space over QR, the scalar multiplication being the field multiplication restricted to QR×R.
  3. Setting q⋅x:=ι(q) x for q∈Q and x∈R makes R a vector space over Q itself.

The subfield is the image, not Q. Q is not a subset of R in this library: a rational is a class of pairs of integers and a real is a class of Cauchy sequences of rationals (The real numbers). What sits inside R as a subfield is the image QR of the embedding, and claim 2 is a statement about that image. Claim 3 is the statement about Q itself, and it is proved directly rather than by restricting scalars, because restriction of scalars requires a subfield.

Facts & Assumptions

Given: The field R, the field Q, and the map ι:Q→R of The unique embedding of ℚ into an ordered field.

[L1]

R is a field (The reals form a field, The real numbers) and is an ordered field with positive cone as in Ordered field (The reals form a totally ordered field).

[L2]
[L3]

There is a unique field homomorphism ι:Q→R, and it is injective and order-preserving (The unique embedding of ℚ into an ordered field).

[L4]

A field homomorphism φ satisfies φ(x+y)=φ(x)+φ(y), φ(xy)=φ(x)φ(y) and φ(1)=1, and consequently φ(0)=0, φ(−x)=−φ(x) and φ(x−1)=φ(x)−1 for x≠0 (Field homomorphism and embedding).

[L5]

A subfield of a field F is a subring of F containing x−1 for each of its nonzero elements; equivalently, a subset containing 1F and closed under a−b and ab, and containing x−1 for each of its nonzero elements. Such a subset contains 0F and is closed under addition and additive inverses (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).

[L6]

A field is a vector space over itself, and over any subfield K of F every F-vector space is a K-vector space by restricting the scalar multiplication to K (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars).

[L7]

The vector space axioms (V1)–(V5) (Vector space over a field), and the field axioms of R: (R,+,0) is an abelian group, multiplication is associative and commutative with identity 1, and it distributes over addition (Field).

Verification

technique · direct
1.1

R is a field, so it is a vector space over itself with the field addition as vector addition and the field multiplication as scalar multiplication; this is claim 1.

L1L6
1.2

Since R is an ordered field, there is a unique field homomorphism ι:Q→R, and it is injective.

L1L2L3
1.3

QR=ι[Q] is a subfield of R: it contains ι(0)=0 and ι(1)=1; for p,q∈Q it contains ι(p)+ι(q)=ι(p+q), −ι(q)=ι(−q) and ι(p)ι(q)=ι(pq); and if ι(q)≠0 then q≠0, since ι(0)=0, so ι(q)−1=ι(q−1)∈QR.

L2L3L4L5
1.4

The assignment (q,x)↦ι(q) x is a map Q×R→R, since ι(q)∈R and the field multiplication of R takes values in R.

L3L7
2.1

Applying restriction of scalars to the R-vector space of step 1.1 and the subfield of step 1.3 shows that R is a vector space over QR, with the field multiplication restricted to QR×R as scalar multiplication; this is claim 2.

step 1.1step 1.3L6
2.2

The operation of step 1.4 satisfies the five axioms over Q. (V1) holds because (R,+,0) is an abelian group. For p,q∈Q and x,y∈R: q⋅(x+y)=ι(q)(x+y)=ι(q)x+ι(q)y=q⋅x+q⋅y by distributivity, which is (V2); (p+q)⋅x=ι(p+q)x=(ι(p)+ι(q))x=ι(p)x+ι(q)x=p⋅x+q⋅x by additivity of ι and distributivity, which is (V3); (pq)⋅x=ι(pq)x=(ι(p)ι(q))x=ι(p)(ι(q)x)=p⋅(q⋅x) by multiplicativity of ι and associativity, which is (V4); and 1⋅x=ι(1)x=1 x=x, which is (V5).

step 1.4L3L4L7
3.1

Claim 1 is step 1.1, claim 2 is step 2.1, and claim 3 is step 2.2, so R carries all three structures at once: over itself, over the embedded copy of Q inside it, and over Q.

step 1.1step 2.1step 2.2∎

Remarks

  • Three structures on one set. The vectors are the same reals throughout and the addition is the same in all three cases; what changes is which scalars are allowed to act. Claims 2 and 3 differ only in bookkeeping: the scalars are the elements of QR in one and the elements of Q in the other, and ι matches them up bijectively, being injective onto its image.

  • Nothing here is said about size. How big R is as a vector space over Q is a question about bases and dimension, which are developed on a later page; no claim about either is made above, and the verification uses neither.

  • Why the ordered field hypothesis appears at all. The embedding ι is supplied by The unique embedding of ℚ into an ordered field, which is stated for an ordered field, and R is one. The order plays no further role: once ι is in hand, every step above uses only that it is a field homomorphism.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

In F3 the three coordinate lines are linear subspaces whose internal direct sum is F3, and F0 is the zero space

Example

Let F be a field (Field) and consider the vector space F3 of functions 3→F with the pointwise operations (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}). Since 3={0,1,2} (The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n), an element is written x=(x0,x1,x2) with xi:=x(i), indexed from 0. For j<3 let ej∈F3 be given by ej(j)=1F and ej(i)=0F for i≠j, and put

Lj  :=  { x∈F3  :  xi=0F for every i<3 with i≠j }.

Then:

  1. Lj={ λej:λ∈F }=span⁡{ej}, so each Lj is a linear subspace of F3 (Linear subspace of a vector space, Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S);
  2. F3=⨁j<3Lj (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V), the unique decomposition of x∈F3 being x=x0e0+x1e1+x2e2;
  3. F0 is the zero space: it has exactly one element, the empty function.

The sets Lj are called the coordinate lines of F3; the word "line" is used informally, since dimension is not available here and nothing below uses it.

Facts & Assumptions

Given: A field F, the vector space F3 of functions 3→F with pointwise operations, the vectors ej for j<3, and the sets Lj as displayed.

[L1]

FX is a vector space over F with (x+y)(i)=x(i)+y(i), (λx)(i)=λx(i) and zero the constant function at 0F; for X=n a natural number, n={0,…,n−1}; and F0 has exactly one element, the empty function, which is its zero vector (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field, The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

[L3]

The elements of ∑i<nUi are exactly the ∑i<nui with ui∈Ui; and ∑i<3ui=(u0+u1)+u2, by the recursion ∑i<0ui=0 and ∑i<σ(m)ui=(∑i<mui)+um together with 0+u0=u0 (The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family).

[L5]

In a field: 1Fλ=λ, multiplication is commutative, 0Fλ=0F (Multiplication by zero: 0⋅a=0) and hence λ0F=0F, and 0F is the additive identity (Field).

Verification

technique · direct
1.1

F3 is the set of functions 3→F with the pointwise operations, and 3={0,1,2}, so the coordinates of an element are x0,x1,x2.

L1
1.2

Each ej is an element of F3, and each Lj is a subset of F3, both by their displayed descriptions.

L1L5
1.3

Lj={ λej:λ∈F } for every j<3. If λ∈F then (λej)j=λ1F=λ and (λej)i=λ0F=0F for i≠j, so λej∈Lj. Conversely if x∈Lj then x and xjej have the same value at every i<3, namely xj at i=j and 0F elsewhere, so x=xjej.

L1L5
1.4

For u0,u1,u2∈F3 the finite sum is ∑j<3uj=(u0+u1)+u2, whose value at i<3 is (u0(i)+u1(i))+u2(i), by the pointwise definition of the addition.

L1L3
1.5

F0 has exactly one element, the empty function, and that element is its zero vector, so F0 is the zero space; this is claim 3.

L1
2.1

Each Lj is a linear subspace of F3 and equals span⁡{ej}: by step 1.3 it is the set of scalar multiples of ej, which is exactly the span of {ej}, and a span is a linear subspace. This is claim 1.

step 1.3L2
2.2

Every x∈F3 decomposes. Put uj:=xjej, which lies in Lj by step 1.3. The value of ∑j<3uj at i<3 is (x0e0(i)+x1e1(i))+x2e2(i); since ej(i)=0F for j≠i and ei(i)=1F, exactly one summand is xi and the others are 0F, so the value is xi. Hence ∑j<3uj=x, and ∑j<3Lj=F3.

step 1.3step 1.4L1L5
3.1

The decomposition is unique. Suppose uj∈Lj for j<3 and ∑j<3uj=x. Evaluating at i<3 gives (u0(i)+u1(i))+u2(i)=xi, and uj(i)=0F whenever j≠i, so the left-hand side is ui(i); thus ui(i)=xi, and step 1.3 gives ui=ui(i)ei=xiei. So the list is the one of step 2.2.

step 1.3step 1.4L1L5
4.1

By steps 2.2 and 3.1 every x∈F3 is ∑j<3uj with uj∈Lj in exactly one way, so F3=⨁j<3Lj, and the decomposition is x=x0e0+x1e1+x2e2. This is claim 2.

step 2.2step 3.1L4
5.1

Claim 1 is step 2.1, claim 2 is step 4.1 and claim 3 is step 1.5.

step 1.5step 2.1step 4.1∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

FN 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

Let F be a field (Field) and let FN be the function space of all families x:N→F with the pointwise operations (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}), written x=(xn)n∈N with xn:=x(n); the index runs over N, which contains 0 (The natural numbers N (von Neumann)). Put

E  :=  { x∈FN  :  there is N∈N with xn=0F for every n≥N },

the set of eventually zero families, and for k∈N let ek∈FN be the standard unit family given by ek(k)=1F and ek(n)=0F for n≠k. Then:

  1. E is a linear subspace of FN (Linear subspace of a vector space);
  2. E=span⁡{ ek:k∈N } (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S);
  3. E≠FN, the constant family at 1F lying outside E.

Facts & Assumptions

Given: A field F, the vector space FN with pointwise operations, the set E of eventually zero families, and the families ek for k∈N.

[L1]

FX is a vector space over F with (x+y)(n)=x(n)+y(n), (λx)(n)=λx(n), and zero the constant family at 0F; two elements are equal exactly when they agree at every point (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field).

[L2]

One-step test: a nonempty subset closed under λu+v is a linear subspace, and a linear subspace satisfies (W1), (W2), (W3) (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, Linear subspace of a vector space).

[L3]
[L6]

The order of N is total and reflexive, m<σ(N) is equivalent to m≤N, and m<n implies m≠n (≤ is a linear order on N, Order on the natural numbers, On N the order is membership: m<n  ⟺  m∈n).

[L7]

In a field: 0Fλ=0F (Multiplication by zero: 0⋅a=0) and multiplication is commutative, so λ0F=0F; λ1F=λ; 0F+0F=0F and 0F is the additive identity; and 1F≠0F (Field).

Verification

technique · direct
1.1

FN is a vector space over F, being the function space on the index set N, and its zero is the constant family at 0F.

L1
1.2

E is nonempty: the zero family has xn=0F for every n, so N=0 witnesses that it lies in E.

L1
1.3

E is closed under the one-step expression. Let λ∈F and u,v∈E, with witnesses N1 for u and N2 for v. The order of N is total, so one of N1,N2 is at least the other; let N be that one. For n≥N we have n≥N1 and n≥N2, hence (λu+v)n=λun+vn=λ0F+0F=0F. So N witnesses λu+v∈E.

L1L6L7
1.4

Each ek lies in E: if n≥σ(k) then k<n, so n≠k and ek(n)=0F; thus σ(k) is a witness.

L6L7
1.5

For x∈FN and N∈N, the finite sum sN:=∑k<Nxkek satisfies sN(n)=xn for n<N and sN(n)=0F for N≤n. By induction on N: at N=0 the sum is the zero family, there is no n<0, and the second clause holds. Assuming it at N, we have sσ(N)=sN+xNeN, so sσ(N)(n)=sN(n)+xNeN(n); for n<N this is xn+xN0F=xn, since n≠N; for n=N it is 0F+xN1F=xN; and for σ(N)≤n we have N≤n and n≠N, so it is 0F+xN0F=0F. As n<σ(N) is equivalent to n≤N, this is the claim at σ(N).

L1L4L5L6L7
1.6

The constant family c with cn=1F for every n does not lie in E: for any candidate witness N we have N≥N and cN=1F≠0F. Hence E≠FN, which is claim 3.

L1L6L7
2.1

E is a linear subspace of FN, by the one-step test applied to steps 1.2 and 1.3; this is claim 1.

step 1.2step 1.3L2
2.2

If x∈E with witness N, then x=∑k<Nxkek. Indeed the two families agree at every n: at n<N both are xn, and at N≤n the sum is 0F while xn=0F by the choice of N. So x is a linear combination of elements of { ek:k∈N }.

step 1.5L1
3.1

Claim 2. By step 2.2 every element of E is a linear combination of elements of { ek:k∈N }, hence lies in its span. Conversely each ek lies in E by step 1.4 and E is a linear subspace by step 2.1, so the span, being the smallest linear subspace containing all the ek, is contained in E.

step 1.4step 2.1step 2.2L3
4.1

Claim 1 is step 2.1, claim 2 is step 3.1 and claim 3 is step 1.6.

step 1.6step 2.1step 3.1∎

Remarks

  • The spanning set is infinite and every combination is finite. The span of an infinite set consists of the vectors built from finitely many of its elements (span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}), which is exactly why the span of all the ek is the eventually zero families and not all of FN. Claim 3 is the concrete form of that distinction.

  • No topology and no convergence are involved. "Eventually zero" is a purely algebraic condition on a family indexed by N: some tail is identically 0F. Nothing here needs an order or a metric on F, and F is an arbitrary field.

  • The witness N is not unique and nothing above assumes it is. If N witnesses that x is eventually zero then so does every larger natural number, which is what makes the argument in step 1.3 work: two families are handled by taking the larger of their witnesses.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The first quadrant of R2 contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by −1

Statement refuted

False claim: if V is a vector space over a field F and W⊆V contains 0V and is closed under the vector addition, then W is a linear subspace of V (Linear subspace of a vector space).

The first quadrant of R2 refutes it. Take F=R (The reals form a field) and V=R2 (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}), and put

Q  :=  { x∈R2  :  0≤x0 and 0≤x1 }.

Then 0V∈Q and Q is closed under addition, but the vector e0 with coordinates (1,0) lies in Q while (−1)e0, with coordinates (−1,0), does not. So Q is not closed under scalar multiplication and is not a linear subspace.

Facts & Assumptions

Given: The field R (The reals form a field, The real numbers) with its order, the vector space R2 over R, and the subset Q displayed above.

[L1]

R is an ordered field with positive cone P: (O1) for each x exactly one of x∈P, x=0, −x∈P holds; (O2) P is closed under addition and multiplication; x>0 means x∈P, and a≤b means a<b or a=b (The reals form a totally ordered field, Ordered field).

[L2]

Every nonzero square of an ordered field is positive (Squares of nonzero elements are positive).

[L3]

R2 is a vector space over R with (x+y)i=xi+yi and (λx)i=λxi for i∈2={0,1}, and its zero vector has both coordinates 0 (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field, The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

[L4]

A linear subspace satisfies (W1) 0V∈W, (W2) closure under +, and (W3) closure under scalar multiplication (Linear subspace of a vector space); the three conditions are together equivalent to the one-step test on a nonempty subset (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).

[L7]

Field arithmetic in R: 1≠0; 1⋅a=a; a⋅0=0; 0 is the additive identity; and −(−1)=1, since (F,+,0) is an abelian group (Field).

[L8]

The refuted claim: a subset of a vector space containing the zero vector and closed under addition is a linear subspace.

Counterexample

technique · direct
1.1

R2 is the vector space of functions 2→R with coordinatewise operations, 2={0,1}, so an element is x=(x0,x1) and the zero vector is (0,0).

L3
1.2

The zero vector lies in Q, since 0≤0; in particular Q is nonempty.

L1L3
1.3

0<1 in R: 1≠0 and 1=1⋅1 is a square, so 1∈P.

L1L2L7
1.4

If a,b∈R satisfy 0≤a and 0≤b, then 0≤a+b: if a=0 then a+b=b; if b=0 then a+b=a; and otherwise a,b∈P, so a+b∈P by (O2).

L1L7
2.1

Q is closed under addition: for x,y∈Q and i∈{0,1} we have (x+y)i=xi+yi with 0≤xi and 0≤yi, hence 0≤(x+y)i.

step 1.4L1L3
2.2

It is not the case that 0≤−1: applying trichotomy to −1, exactly one of −1∈P, −1=0, −(−1)=1∈P holds, and the last one does, so −1∉P and −1≠0.

step 1.3L1L7
2.3

The vector e0 with (e0)0=1 and (e0)1=0 lies in Q, since 0≤1 and 0≤0.

step 1.3L1L3
3.1

(−1)e0 has coordinates ((−1)⋅1,(−1)⋅0)=(−1,0), and its coordinate at index 0 fails 0≤−1, so (−1)e0∉Q. Hence Q is not closed under scalar multiplication: condition (W3) fails, and Q is not a linear subspace of R2.

step 2.2step 2.3L3L4L7
4.1

So Q contains the zero vector and is closed under addition, by steps 1.2 and 2.1, and is not a linear subspace, by step 3.1; the claim of [L8] is therefore false. The failure can also be read in the additive group: (−1)e0=−e0 lies outside Q, so Q is not even a subgroup of the additive group of R2, whereas a linear subspace always is.

step 1.2step 2.1step 3.1L5L6L8∎

Remarks

  • Exactly one of the three conditions fails. Q satisfies (W1) and (W2) and fails (W3), and it fails it at a single scalar, −1. The reverse failure, a subset closed under scalar multiplication but not under addition, is recorded in The union of the two coordinate axes of F2 is closed under scalar multiplication and is not closed under addition, so neither closure condition implies the other, so neither closure condition implies the other.

  • What the order is doing here. The example needs a field in which some element is not the negative of a nonnegative one, so it needs an order; over an arbitrary field there is no "first quadrant" to speak of. That is why this witness is stated over R while its companion is stated over an arbitrary field.

  • Q is closed under multiplication by nonnegative scalars. If 0≤λ and x∈Q then λx∈Q, by the closure of P under multiplication together with the zero cases. So the failure is confined to the negative scalars; a subset with this weaker closure property is a cone, not a linear subspace, and the difference is exactly what the example isolates.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

The union of the two coordinate axes of F2 is closed under scalar multiplication and is not closed under addition, so neither closure condition implies the other

Statement refuted

False claim: if V is a vector space over a field F and W⊆V contains 0V and is closed under scalar multiplication, then W is a linear subspace of V (Linear subspace of a vector space).

The union of the two coordinate axes of F2 refutes it, over any field F. Let e0,e1∈F2 be the vectors with coordinates (1F,0F) and (0F,1F) (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}), let Lj:=span⁡{ej} (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S), and put A:=L0∪L1. Then 0V∈A and A is closed under scalar multiplication, while e0,e1∈A and e0+e1∉A.

Together with The first quadrant of R2 contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by −1, which exhibits a subset closed under addition and not under scalar multiplication, this shows that neither of the two closure conditions in Linear subspace of a vector space implies the other.

Facts & Assumptions

Given: A field F, the vector space F2 over F, the vectors e0,e1, the sets L0,L1 and their union A, as displayed.

[L1]

F2 is the vector space of functions 2→F with (x+y)i=xi+yi and (λx)i=λxi, where 2={0,1}, and its zero vector has both coordinates 0F (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field, The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

[L3]

A linear subspace satisfies (W1) 0V∈W, (W2) closure under +, and (W3) closure under scalar multiplication (Linear subspace of a vector space); on a nonempty subset the three are equivalent to the one-step test (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).

[L4]

In a field: 1F≠0F; λ1F=λ; 0Fλ=0F (Multiplication by zero: 0⋅a=0) and multiplication is commutative, so λ0F=0F; and 0F is the additive identity, so 1F+0F=1F=0F+1F (Field).

[L5]

There is a subset of a vector space that contains the zero vector and is closed under addition and is not closed under scalar multiplication (The first quadrant of R2 contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by −1).

[L6]

The refuted claim: a subset of a vector space containing the zero vector and closed under scalar multiplication is a linear subspace.

Counterexample

technique · direct
1.1

F2 is the set of functions 2→F with coordinatewise operations and 2={0,1}, so an element is x=(x0,x1); and Lj={ λej:λ∈F } is a linear subspace of F2 for j∈{0,1}.

L1L2
1.2

Lj={ x∈F2:xi=0F for the index i≠j }. Indeed (λej)j=λ1F=λ and (λej)i=λ0F=0F for i≠j; conversely a vector x whose other coordinate is 0F agrees with xjej at both indices, so x=xjej.

L1L2L4
1.3

0V∈A: the vector 0Fe0 has both coordinates 0F⋅(e0)i=0F, so it is the zero vector, and it lies in L0⊆A.

L1L2L4
1.4

A is closed under scalar multiplication: if x∈A then x∈Lj for some j∈{0,1}, and Lj is a linear subspace, so λx∈Lj⊆A for every λ∈F.

L2L3
1.5

e0+e1 has coordinates (1F+0F,  0F+1F)=(1F,1F).

L1L4
2.1

e0+e1∉A: membership in L0 requires the coordinate at index 1 to be 0F and membership in L1 requires the coordinate at index 0 to be 0F, and both coordinates of e0+e1 are 1F≠0F.

step 1.2step 1.5L4
2.2

e0∈A and e1∈A, since ej=1Fej∈Lj.

step 1.2L2L4
3.1

So A contains the zero vector and is closed under scalar multiplication, while e0 and e1 lie in A and their sum does not; condition (W2) therefore fails and A is not a linear subspace of F2. The claim of [L6] is false.

step 1.3step 1.4step 2.1step 2.2L3L6
4.1

Combining with [L5]: closure under addition does not imply closure under scalar multiplication, and closure under scalar multiplication does not imply closure under addition, so neither of the two conditions implies the other, even for subsets containing the zero vector.

step 3.1L5∎

Remarks

  • The witness works over every field, including F with two elements: the argument uses only 1F≠0F, and never counts the elements of F or the linear subspaces of F2. No claim is made here about how many subsets of F2 of this kind there are.

  • The union of two linear subspaces is the general phenomenon. A is a union of two linear subspaces, neither of which contains the other, and such a union is never a linear subspace; that is recorded separately as FALSE: The union of two linear subspaces is a linear subspace, of which this item is the concrete instance closed under scalar multiplication.

  • "Axis" is informal here, as "line" is elsewhere on this page: it names the set span⁡{ej} and carries no claim about dimension, which is not available at this point in the library.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Three lines in F2 that meet pairwise only in 0 and whose sum is F2 with decompositions that are not unique, so pairwise trivial intersection does not give a direct sum

Statement refuted

False claim: if U0,U1,U2 are linear subspaces of a vector space V with ∑j<3Uj=V and Ui∩Uj={0V} for all i≠j, then V=⨁j<3Uj (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

Three lines in the plane F2 refute it, over any field F. With e0,e1 the vectors of F2 with coordinates (1F,0F) and (0F,1F) (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}) and d:=e0+e1, put

U0:=span⁡{e0},U1:=span⁡{e1},U2:=span⁡{d}

(Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S). Their pairwise intersections are all {0V} and their sum is F2, yet d has two different decompositions, d=e0+e1+0V and d=0V+0V+d, so condition (D2) fails at j=2.

The three sets are called lines informally, as elsewhere on this page; no claim is made about their dimension, nor about how many such sets F2 contains.

Facts & Assumptions

Given: A field F, the vector space F2 over F, the vectors e0,e1 and d=e0+e1, and the linear subspaces U0,U1,U2 as displayed.

[L1]

F2 is the vector space of functions 2→F with (x+y)i=xi+yi and (λx)i=λxi, where 2={0,1}, and its zero vector has both coordinates 0F; the index set of a three-term family is 3={0,1,2} (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field, The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

[L3]

The elements of ∑i<nUi are exactly the ∑i<nui with ui∈Ui, and ∑i<3ui=(u0+u1)+u2 (The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family).

[L4]

V=⨁i<nUi requires (D1) ∑i<nUi=V and (D2) Uj∩∑i≠jUi={0V} for every j<n, where ∑i≠jUi is the sum of the family that agrees with U off j and is {0V} at j (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

[L6]

In a field: 1F≠0F; λ1F=λ; 0Fλ=0F (Multiplication by zero: 0⋅a=0) and multiplication is commutative, so λ0F=0F; and 0F is the additive identity (Field).

[L7]

A linear subspace contains 0V, by condition (W1) (Linear subspace of a vector space).

[L8]

The refuted claim: three linear subspaces whose sum is V and whose pairwise intersections are {0V} form an internal direct sum of V.

Counterexample

technique · direct
1.1

In F2 the vectors e0, e1 and d=e0+e1 have coordinates (1F,0F), (0F,1F) and (1F+0F, 0F+1F)=(1F,1F); and U0,U1,U2 are linear subspaces of F2, being spans.

L1L2L6
1.2

The elements of the three subspaces have the coordinates λe0=(λ,0F), λe1=(0F,λ) and λd=(λ,λ), for λ∈F.

L1L2L6
1.3

e0, e1 and d are all different from 0V, since each has a coordinate equal to 1F and 1F≠0F.

L1L6
2.1

The pairwise intersections are {0V}. Each contains 0V, every Uj being a linear subspace. Conversely, if x∈U0∩U1 then x=(λ,0F)=(0F,μ) for some λ,μ, so λ=0F and x=0V; if x∈U0∩U2 then x=(λ,0F)=(μ,μ), so μ=0F and λ=0F; and if x∈U1∩U2 then x=(0F,λ)=(μ,μ), so μ=0F and λ=0F.

step 1.2L1L7
2.2

∑j<3Uj=F2. Given x∈F2, the list (x0e0,  x1e1,  0V) has its j-th entry in Uj, and its sum is (x0e0+x1e1)+0V, whose coordinates are (x0+0F,  0F+x1)=(x0,x1), that is x. The reverse inclusion holds because the sum is a subset of F2.

step 1.2L1L3L6L7
2.3

The vector d has two different decompositions with j-th entry in Uj: the list (e0,e1,0V) sums to (e0+e1)+0V=d, and the list (0V,0V,d) sums to (0V+0V)+d=d; the two lists differ at index 0, since e0≠0V.

step 1.2step 1.3L1L3L6L7
3.1

Condition (D2) fails at j=2. The family agreeing with U off 2 and equal to {0V} at 2 admits the list (e0,e1,0V), which sums to d, so d∈∑i≠2Ui; also d=1Fd∈U2; and d≠0V. Hence U2∩∑i≠2Ui contains a vector other than 0V.

step 1.3step 2.3L2L4L6
4.1

So U0,U1,U2 satisfy both hypotheses of [L8], by steps 2.1 and 2.2, and fail its conclusion, by step 3.1: the claim is false. The failure is visible directly in step 2.3 as the loss of unique decomposition, which by the direct sum criterion is equivalent to the failure of the direct sum.

step 2.1step 2.2step 2.3step 3.1L5L8∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28Open item page →

Two planes in F3 whose sum is F3 and whose intersection is a line, computed explicitly

Example

Let F be a field (Field) and let F3 be the vector space of functions 3→F with the pointwise operations (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}), where 3={0,1,2}, so an element is x=(x0,x1,x2) indexed from 0. Let e1∈F3 have coordinates (0F,1F,0F) and put

U  :=  { x∈F3:x2=0F },W  :=  { x∈F3:x0=0F }.

Then:

  1. U and W are linear subspaces of F3 (Linear subspace of a vector space);
  2. U+W=F3 (The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family), a decomposition of x being x=(x0,x1,0F)+(0F,0F,x2);
  3. U∩W={ x∈F3:x0=0F and x2=0F }=span⁡{e1};
  4. the sum is not direct: it is not the case that F3=U⊕W, because U∩W≠{0V}.

U and W are called planes and U∩W a line, informally and by analogy only; dimension is not available at this point in the library and nothing below uses it.

Facts & Assumptions

Given: A field F, the vector space F3 with pointwise operations, the vector e1, and the sets U and W as displayed.

[L1]

F3 is the vector space of functions 3→F with (x+y)i=xi+yi and (λx)i=λxi, where 3={0,1,2}; its zero vector has all three coordinates 0F; and two elements are equal exactly when all three coordinates agree (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field, The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

[L2]

One-step test: a nonempty T⊆V with λu+v∈T for all λ∈F and u,v∈T is a linear subspace (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, Linear subspace of a vector space).

[L3]

The intersection of a nonempty family of linear subspaces is a linear subspace (The intersection of a nonempty family of linear subspaces of V is a linear subspace of V).

[L4]

U+W={ u+w:u∈U, w∈W }, and it is a linear subspace (The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family).

[L6]

For two summands, F3=U⊕W requires U+W=F3 and U∩W={0V} (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

[L7]

In a field: 1F≠0F; λ1F=λ; 0Fλ=0F (Multiplication by zero: 0⋅a=0) and multiplication is commutative, so λ0F=0F; and 0F is the additive identity (Field).

Verification

technique · direct
1.1

F3 is the set of functions 3→F with coordinatewise operations, and e1 has coordinates (0F,1F,0F), so e1∈F3.

L1L7
1.2

U is a linear subspace: it contains the zero vector, whose coordinate at index 2 is 0F, so it is nonempty; and for λ∈F and u,v∈U the vector λu+v has (λu+v)2=λu2+v2=λ0F+0F=0F, so it lies in U. The same argument at index 0 shows W is a linear subspace.

L1L2L7
1.3

U∩W={ x∈F3:x0=0F and x2=0F }, directly from the two defining conditions.

L1
1.4

The scalar multiples of e1 are exactly the vectors with coordinates (0F,λ,0F): (λe1)0=λ0F=0F, (λe1)1=λ1F=λ and (λe1)2=λ0F=0F. Conversely a vector x with x0=x2=0F agrees with x1e1 at all three indices, so x=x1e1.

L1L7
2.1

Claim 1 is step 1.2.

step 1.2L2
2.2

Claim 3: by steps 1.3 and 1.4 the intersection U∩W is exactly { λe1:λ∈F }, which is span⁡{e1}; it is a linear subspace, being an intersection of two of them.

step 1.3step 1.4L3L5
2.3

Claim 2: given x∈F3, put u:=(x0,x1,0F) and w:=(0F,0F,x2). Then u∈U and w∈W by step 1.2, and u+w has coordinates (x0+0F,  x1+0F,  0F+x2)=(x0,x1,x2), so u+w=x. Hence F3⊆U+W, and the reverse inclusion holds because U+W is a subset of F3.

step 1.2L1L4L7
3.1

Claim 4: e1∈U∩W by step 2.2, and e1≠0V because its coordinate at index 1 is 1F≠0F; so U∩W≠{0V} and the condition for a direct sum of two summands fails.

step 2.2L1L6L7
4.1

Claims 1, 2, 3 and 4 are steps 2.1, 2.3, 2.2 and 3.1: the two planes have sum F3 and intersection span⁡{e1}, and the sum is not direct.

step 2.1step 2.2step 2.3step 3.1∎

Remarks

  • A sum can be everything without being direct. Condition (D1) holds here and (D2) fails, and the two are independent: the failure is exactly the nonzero overlap span⁡{e1}. Concretely, e1 decomposes in more than one way, for instance as e1+0V with e1∈U and as 0V+e1 with e1∈W.

  • The intersection did not have to be computed by hand to know it is a subspace, since intersections of linear subspaces always are (The intersection of a nonempty family of linear subspaces of V is a linear subspace of V). What the computation adds is the identification of that subspace as span⁡{e1}, which is the point of the example.

  • Everything here is over an arbitrary field. No order, no square roots and no counting are used; the only field facts needed are 1F≠0F and the identity laws.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-sonnet-5)Open item page →

FALSE: The union of two linear subspaces is a linear subspace

Statement

False claim: if U and W are linear subspaces of a vector space V over a field F (Linear subspace of a vector space), then U∪W is a linear subspace of V.

The corresponding statement for intersections is true and is The intersection of a nonempty family of linear subspaces of V is a linear subspace of V. For unions it fails, and it already fails in the plane over any field: with e0,e1∈F2 the vectors with coordinates (1F,0F) and (0F,1F) (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}), take U:=span⁡{e0} and W:=span⁡{e1} (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S). Then e0∈U and e1∈W, so both lie in U∪W, while their sum, with coordinates (1F,1F), lies in neither.

Facts & Assumptions

Given: A field F, the vector space F2 over F, the vectors e0 and e1, and the linear subspaces U=span⁡{e0} and W=span⁡{e1}.

[L1]

F2 is the vector space of functions 2→F with (x+y)i=xi+yi and (λx)i=λxi, where 2={0,1}; two elements are equal exactly when both coordinates agree (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field, The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

[L4]

In a field: 1F≠0F; λ1F=λ; 0Fλ=0F (Multiplication by zero: 0⋅a=0) and multiplication is commutative, so λ0F=0F; and 0F is the additive identity (Field).

[L5]

The refuted claim: the union of two linear subspaces of a vector space is a linear subspace of it.

Refutation

technique · direct
1.1

U and W are linear subspaces of F2, being spans of one-element subsets.

L1L2
1.2

The elements of U are the vectors (λ,0F) and the elements of W are the vectors (0F,λ), for λ∈F: indeed (λe0)0=λ1F=λ, (λe0)1=λ0F=0F, and symmetrically for e1.

L1L2L4
1.3

e0+e1 has coordinates (1F+0F,  0F+1F)=(1F,1F).

L1L4
2.1

e0∈U and e1∈W, since ej=1Fej; so both lie in U∪W.

step 1.2L2L4
2.2

e0+e1∉U∪W: if it lay in U its coordinate at index 1 would be 0F, and if it lay in W its coordinate at index 0 would be 0F, whereas both coordinates are 1F and 1F≠0F.

step 1.2step 1.3L1L4
3.1

So U∪W contains e0 and e1 but not e0+e1: it is not closed under addition, so condition (W2) fails and it is not a linear subspace of F2, although U and W both are. The claim of [L5] is false.

step 1.1step 2.1step 2.2L3L5∎

Remarks

Sources