Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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