Alphabeta Math
False statementConstruction: 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.

FALSE: the union of two linearly independent subsets of a vector space is linearly independent

Facts & Assumptions

Given: A field F, the vector space F2 with pointwise operations, and the vectors e0=(1F,0F), e1=(0F,1F) and d=e0+e1=(1F,1F).

[L2]

{e0,e1,d} has exactly three elements and is linearly dependent ({(1,0),(0,1),(1,1)} spans F2 and is linearly dependent, so a spanning set need not be a basis; each of its three two-element subsets is a basis: the three-element count is stated there and claim 2 is that the set is linearly dependent).

[L3]

span⁡{v}={ λv:λ∈F }, and for v≠0V the equation λv=0V forces λ=0F (span⁡{v}={ λv:λ∈F }, which is {0V} when v=0V, and when v≠0V contains 0V only as the multiple 0Fv, claims 1 and 3).

Refutation

technique · direct
1.1

Take V:=F2 over an arbitrary field F, A:={e0,e1} and C:={d}. Then A is linearly independent, being a basis of F2.

L1
1.2

C is linearly independent. Its only injective finite lists are the empty one, which is independent, and the one-term list v0=d; for the latter, ∑i<1λivi=λ0d, and d≠0V because d(0)=1F≠0F, so λ0d=0V forces λ0=0F.

L3L4L5L6
1.3

A∪C={e0,e1,d}, which is linearly dependent.

L2
2.1

So A and C are linearly independent subsets of F2 whose union is linearly dependent, and the statement above is false.

step 1.1step 1.2step 1.3L4∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 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