Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

Three distinct lines U0,U1,U2U_0, U_1, U_2 in F2F^{2} have dimF(U0+U1+U2)=2\dim_F(U_0+U_1+U_2) = 2 while the inclusion-exclusion analogue of the dimension formula predicts 33, so the two-subspace formula does not extend

Statement refuted

False claim: for finite-dimensional linear subspaces U0,U1,U2U_0, U_1, U_2 of a vector space VV over FF,

dimF(j<3Uj)+dimF(U0U1)+dimF(U0U2)+dimF(U1U2)  =  dimFU0+dimFU1+dimFU2+dimF(U0U1U2).\dim_F\Bigl(\sum_{j<3}U_j\Bigr) + \dim_F(U_0 \cap U_1) + \dim_F(U_0 \cap U_2) + \dim_F(U_1 \cap U_2) \;=\; \dim_F U_0 + \dim_F U_1 + \dim_F U_2 + \dim_F(U_0 \cap U_1 \cap U_2).

This is the inclusion-exclusion analogue of The dimension formula: for finite-dimensional linear subspaces UU and WW of VV, the subspaces U+WU + W and UWU \cap W are finite-dimensional and dimF(U+W)+dimF(UW)=dimFU+dimFW\dim_F(U+W) + \dim_F(U \cap W) = \dim_F U + \dim_F W, written without subtraction so that both sides are natural numbers; for two subspaces the same rearrangement is exactly that theorem.

Let FF be any field, let F2F^{2} be the function space on 2={0,1}2 = \{0,1\} (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\}) with e0=(1F,0F)e_0 = (1_F,0_F), e1=(0F,1F)e_1 = (0_F,1_F) and d:=e0+e1=(1F,1F)d := e_0 + e_1 = (1_F,1_F), and put

U0:=span{e0},U1:=span{e1},U2:=span{d}.U_0 := \operatorname{span}\{e_0\}, \qquad U_1 := \operatorname{span}\{e_1\}, \qquad U_2 := \operatorname{span}\{d\} .

Then dimFUj=1\dim_F U_j = 1 for each jj, all three pairwise intersections and the triple intersection equal {0V}\{0_V\} and so have dimension 00, and j<3Uj=F2\sum_{j<3}U_j = F^{2} has dimension 22. The left-hand side is 2+0+0+0=22 + 0 + 0 + 0 = 2 and the right-hand side is 1+1+1+0=31 + 1 + 1 + 0 = 3, so the claimed identity fails.

The three sets are called lines informally, as on the order-69 examples page; the word carries no separate definition here.

Facts & Assumptions

Given: A field FF, the vector space F2F^{2}, the vectors e0e_0, e1e_1, d=e0+e1d = e_0+e_1, and the linear subspaces U0,U1,U2U_0, U_1, U_2 above.

[L1]

span{v}={λv:λF}\operatorname{span}\{v\} = \{\, \lambda v : \lambda \in F \,\}; if v0Vv \ne 0_V then λv=0V\lambda v = 0_V only for λ=0F\lambda = 0_F and span{v}{0V}\operatorname{span}\{v\} \ne \{0_V\} (span{v}={λv:λF}\operatorname{span}\{v\} = \{\, \lambda v : \lambda \in F \,\}, which is {0V}\{0_V\} when v=0Vv = 0_V, and when v0Vv \ne 0_V contains 0V0_V only as the multiple 0Fv0_F v, claims 1 and 3).

[L2]

e:2F2e : 2 \to F^{2} is an ordered basis with (i<2λiei)(j)=λj\bigl(\sum_{i<2}\lambda_i e_i\bigr)(j) = \lambda_j, and dimFF2=2\dim_F F^{2} = 2 (The standard list e:nFne : n \to F^{n} with ei(i)=1Fe_i(i) = 1_F and ei(j)=0Fe_i(j) = 0_F for jij \ne i is an ordered basis of FnF^{n}; hence dimFFn=n\dim_F F^{n} = n, and F0F^{0} is the zero space with basis \varnothing and dimension 00, claims 2, 3 and 4).

[L7]

Counterexample

technique · direct
1.1

Each of e0e_0, e1e_1, dd is nonzero, since each takes the value 1F0F1_F \ne 0_F somewhere, and the three are pairwise distinct: e0e_0 and dd differ at 11, e1e_1 and dd differ at 00, and e0e_0 and e1e_1 differ at 00.

L6
1.2

dimFUj=1\dim_F U_j = 1 for each j<3j < 3. Take vv to be e0e_0, e1e_1 or dd; then {v}\{v\} spans span{v}\operatorname{span}\{v\}, and it is linearly independent, since an injective list into {v}\{v\} has length 00 or is the one-term list vv, and λv=0V\lambda v = 0_V forces λ=0F\lambda = 0_F because v0Vv \ne 0_V. So {v}\{v\} is a basis with exactly one element.

L1L4L5L6
1.3

The pairwise intersections are {0V}\{0_V\}. An element of U0U1U_0 \cap U_1 is λe0=μe1\lambda e_0 = \mu e_1; evaluating at 00 gives λ1F=μ0F\lambda 1_F = \mu 0_F, that is λ=0F\lambda = 0_F, so the element is 0Fe0=0V0_F e_0 = 0_V. An element of U0U2U_0 \cap U_2 is λe0=μd\lambda e_0 = \mu d; evaluating at 11 gives 0F=μ0_F = \mu, so it is 0V0_V. An element of U1U2U_1 \cap U_2 is λe1=μd\lambda e_1 = \mu d; evaluating at 00 gives 0F=μ0_F = \mu, so it is 0V0_V. Each intersection also contains 0V0_V, being an intersection of linear subspaces, so all three equal {0V}\{0_V\}.

L1L4L6
1.4

j<3Uj=F2\sum_{j<3}U_j = F^{2}. The sum contains each UjU_j, hence contains e0e_0 and e1e_1; being a linear subspace it contains span{e0,e1}=F2\operatorname{span}\{e_0,e_1\} = F^{2}, and it is contained in F2F^{2}.

L2L3L4
2.1

The two sides. The triple intersection U0U1U2U_0 \cap U_1 \cap U_2 is contained in U0U1={0V}U_0 \cap U_1 = \{0_V\} by step 1.3 and contains 0V0_V, so it is {0V}\{0_V\}; hence all four intersection terms have dimension 00 by step 1.3. By step 1.4 and the standard basis, dimF(j<3Uj)=dimFF2=2\dim_F\bigl(\sum_{j<3}U_j\bigr) = \dim_F F^{2} = 2, and by step 1.2 each dimFUj=1\dim_F U_j = 1. So the left-hand side of the claimed identity is 2+0+0+0=22 + 0 + 0 + 0 = 2 and the right-hand side is 1+1+1+0=31 + 1 + 1 + 0 = 3.

step 1.2step 1.3step 1.4L2L4L5L7
3.1

Since 232 \ne 3, the claimed identity fails for these three finite-dimensional linear subspaces of F2F^{2}, so the two-subspace dimension formula has no inclusion-exclusion extension to three subspaces.

step 2.1L5

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: 87 results over 27 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