Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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.

If S⊆V is linearly independent and w∉span⁡(S) then S∪{w} is linearly independent and span⁡(S)⊊span⁡(S∪{w}); and if w∈span⁡(S) then span⁡(S∪{w})=span⁡(S)

Statement

Let V be a vector space over a field F (Vector space over a field), let S⊆V and let w∈V.

  1. If w∈span⁡(S) then span⁡(S∪{w})=span⁡(S) (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S).
  2. If S is linearly independent (Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent) and w∉span⁡(S), then w∉S, the set S∪{w} is linearly independent, and span⁡(S)⊊span⁡(S∪{w}).

Facts & Assumptions

Given: A field F, a vector space V over F, a subset S⊆V and a vector w∈V.

[L1]

For T⊆V, span⁡(T) is a linear subspace of V containing T and contained in every linear subspace of V containing T; and T⊆T′ implies span⁡(T)⊆span⁡(T′) (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, The span is monotone and idempotent, span⁡(S)=S exactly when S is a linear subspace, and span⁡(S∪{0V})=span⁡(S)).

[L2]

span⁡(T) is exactly the set of vectors ∑i<pμiyi with p∈N, μ:p→F and y:p→T (span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}).

[L3]

Finite sums: ∑i<σ(p)ui=(∑i<pui)+up (The product g0g1⋯gn−1 of a finite list in a monoid, by recursion, with the empty product (n=0) equal to the identity, Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S); (F1) an all-0V list sums to 0V; (F3) ∑i<pui=uj+∑i<pui(j) for j<p, with u(j) agreeing with u off j and 0V at j (The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family).

[L4]

Deleting one index: for k<σ(p) the map δk:p→σ(p) is injective with image σ(p)∖{k}, and a list u:σ(p)→V with uk=0V satisfies ∑j<σ(p)uj=∑i<puδk(i) (Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never 0V, its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent, claim 2).

[L5]

A list v:p→V is independent when ∑i<pλivi=0V forces every λi=0F; a subset is independent when every injective finite list into it is (Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent).

[L6]

(V,+,0V) is an abelian group; 0Fy=0V; 1Fy=y; (V4) (λμ)y=λ(μy); and a linear subspace contains 0V and is closed under +, under scalar multiplication and hence under additive inverses, since −y=(−1F)y (Vector space over a field, In any vector space 0Fv=0V, λ0V=0V, (−λ)v=−(λv), (−1F)v=−v, and λv=0V forces λ=0F or v=0V, Linear subspace of a vector space).

[L7]

F is a field: every λ≠0F has an inverse with λ−1λ=1F (Field).

Proof

technique · direct
1.1

Claim 1. From S⊆S∪{w} we get span⁡(S)⊆span⁡(S∪{w}). Conversely, assume w∈span⁡(S); since also S⊆span⁡(S), the set S∪{w} is contained in span⁡(S), which is a linear subspace of V, so minimality gives span⁡(S∪{w})⊆span⁡(S). The two inclusions give the claim.

L1
1.2

The two easy parts of claim 2. Assume w∉span⁡(S). Then w∉S, because S⊆span⁡(S). Also span⁡(S)⊆span⁡(S∪{w}) by monotonicity, and w lies in the larger set and not in the smaller, so the inclusion is strict.

L1
1.3

Now assume in addition that S is independent, and let v:n→S∪{w} be an injective finite list with λ:n→F and ∑i<nλivi=0V. If w is not a value of v, then v is an injective finite list into S, so independence of S gives λi=0F for every i<n and there is nothing more to prove.

L5
1.4

In the remaining case w=vk for exactly one k<n, since v is injective. Then n≠0, say n=σ(n′), and y:=v∘δk is an injective finite list n′→S: it is injective as a composite of injections, and its values are the vj with j≠k, each of which lies in S∪{w} and differs from vk=w. Moreover, for every μ:n→F with μk=0F the list i↦μivi has the value 0Fw=0V at k, so deleting that index gives ∑i<nμivi=∑i<n′μδk(i)yi.

L4L6L8
2.1

In that case the coefficient of w vanishes. Suppose λk≠0F. Applying (F3) at k to the list i↦λivi gives 0V=λkw+R, where R=∑i<nλi′vi with λk′:=0F and λi′:=λi for i≠k, using 0Fw=0V to identify the deleted entry. By step 1.4 applied to λ′, R=∑i<n′λδk(i)′yi, which is a linear combination of elements of S and therefore lies in span⁡(S). Then λkw=−R lies in span⁡(S), that set being a linear subspace, and hence so does w=1Fw=(λk−1λk)w=λk−1(λkw), contradicting w∉span⁡(S). So λk=0F.

step 1.4L2L3L6L7
3.1

The remaining coefficients vanish too. Since λk=0F by step 2.1, step 1.4 applied to λ itself gives 0V=∑i<nλivi=∑i<n′λδk(i)yi; the list y is an injective finite list into the independent set S, hence independent, so λδk(i)=0F for every i<n′. As δk has image n∖{k}, this says λj=0F for every j≠k, and with λk=0F every coefficient vanishes.

step 1.4step 2.1L4L5
4.1

Steps 1.3 and 3.1 show that every injective finite list into S∪{w} is independent, so S∪{w} is linearly independent; with step 1.2 this is claim 2, and step 1.1 is claim 1.

step 1.1step 1.2step 1.3step 3.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

49 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