Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-sonnet-5)
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 UU and WW are linear subspaces of a vector space VV over a field FF (Linear subspace of a vector space), then UWU \cup W is a linear subspace of VV.

The corresponding statement for intersections is true and is The intersection of a nonempty family of linear subspaces of VV is a linear subspace of VV. For unions it fails, and it already fails in the plane over any field: with e0,e1F2e_0, e_1 \in F^{2} the vectors with coordinates (1F,0F)(1_F, 0_F) and (0F,1F)(0_F, 1_F) (The vector space FXF^{X} of all functions XFX \to F with pointwise operations, and FnF^{n} as the case X=n={0,1,,n1}X = n = \{0, 1, \dots, n-1\}), take U:=span{e0}U := \operatorname{span}\{e_0\} and W:=span{e1}W := \operatorname{span}\{e_1\} (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS). Then e0Ue_0 \in U and e1We_1 \in W, so both lie in UWU \cup W, while their sum, with coordinates (1F,1F)(1_F, 1_F), lies in neither.

Facts & Assumptions

Given: A field FF, the vector space F2F^{2} over FF, the vectors e0e_0 and e1e_1, and the linear subspaces U=span{e0}U = \operatorname{span}\{e_0\} and W=span{e1}W = \operatorname{span}\{e_1\}.

[L1]

F2F^{2} is the vector space of functions 2F2 \to F with (x+y)i=xi+yi(x+y)_i = x_i + y_i and (λx)i=λxi(\lambda x)_i = \lambda x_i, where 2={0,1}2 = \{0,1\}; two elements are equal exactly when both coordinates agree (The vector space FXF^{X} of all functions XFX \to F with pointwise operations, and FnF^{n} as the case X=n={0,1,,n1}X = n = \{0, 1, \dots, n-1\}, Vector space over a field, The natural numbers N\mathbb{N} (von Neumann), On N\mathbb{N} the order is membership: m<n    mnm < n \iff m \in n).

[L4]

In a field: 1F0F1_F \ne 0_F; λ1F=λ\lambda 1_F = \lambda; 0Fλ=0F0_F \lambda = 0_F (Multiplication by zero: 0a=00 \cdot a = 0) and multiplication is commutative, so λ0F=0F\lambda 0_F = 0_F; and 0F0_F 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

UU and WW are linear subspaces of F2F^{2}, being spans of one-element subsets.

L1L2
1.2

The elements of UU are the vectors (λ,0F)(\lambda, 0_F) and the elements of WW are the vectors (0F,λ)(0_F, \lambda), for λF\lambda \in F: indeed (λe0)0=λ1F=λ(\lambda e_0)_0 = \lambda 1_F = \lambda, (λe0)1=λ0F=0F(\lambda e_0)_1 = \lambda 0_F = 0_F, and symmetrically for e1e_1.

L1L2L4
1.3

e0+e1e_0 + e_1 has coordinates (1F+0F,  0F+1F)=(1F,1F)(1_F + 0_F,\; 0_F + 1_F) = (1_F, 1_F).

L1L4
2.1

e0Ue_0 \in U and e1We_1 \in W, since ej=1Feje_j = 1_F e_j; so both lie in UWU \cup W.

step 1.2L2L4
2.2

e0+e1UWe_0 + e_1 \notin U \cup W: if it lay in UU its coordinate at index 11 would be 0F0_F, and if it lay in WW its coordinate at index 00 would be 0F0_F, whereas both coordinates are 1F1_F and 1F0F1_F \ne 0_F.

step 1.2step 1.3L1L4
3.1

So UWU \cup W contains e0e_0 and e1e_1 but not e0+e1e_0 + e_1: it is not closed under addition, so condition (W2) fails and it is not a linear subspace of F2F^{2}, although UU and WW both are. The claim of [L5] is false.

step 1.1step 2.1step 2.2L3L5

Remarks

Depends on

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