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

If SVS \subseteq V is linearly independent and wspan(S)w \notin \operatorname{span}(S) then S{w}S \cup \{w\} is linearly independent and span(S)span(S{w})\operatorname{span}(S) \subsetneq \operatorname{span}(S \cup \{w\}); and if wspan(S)w \in \operatorname{span}(S) then span(S{w})=span(S)\operatorname{span}(S \cup \{w\}) = \operatorname{span}(S)

Statement

Let VV be a vector space over a field FF (Vector space over a field), let SVS \subseteq V and let wVw \in V.

  1. If wspan(S)w \in \operatorname{span}(S) then span(S{w})=span(S)\operatorname{span}(S \cup \{w\}) = \operatorname{span}(S) (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS).
  2. If SS is linearly independent (Linear independence: a finite list v:nVv : n \to V is independent when i<nλivi=0V\sum_{i<n} \lambda_i v_i = 0_V forces every λi=0F\lambda_i = 0_F, and a subset SVS \subseteq V is independent when every injective finite list into SS is independent) and wspan(S)w \notin \operatorname{span}(S), then wSw \notin S, the set S{w}S \cup \{w\} is linearly independent, and span(S)span(S{w})\operatorname{span}(S) \subsetneq \operatorname{span}(S \cup \{w\}).

Facts & Assumptions

Given: A field FF, a vector space VV over FF, a subset SVS \subseteq V and a vector wVw \in V.

[L1]

For TVT \subseteq V, span(T)\operatorname{span}(T) is a linear subspace of VV containing TT and contained in every linear subspace of VV containing TT; and TTT \subseteq T' implies span(T)span(T)\operatorname{span}(T) \subseteq \operatorname{span}(T') (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS, The span is monotone and idempotent, span(S)=S\operatorname{span}(S) = S exactly when SS is a linear subspace, and span(S{0V})=span(S)\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S)).

[L2]

span(T)\operatorname{span}(T) is exactly the set of vectors i<pμiyi\sum_{i<p}\mu_i y_i with pNp \in \mathbb{N}, μ:pF\mu : p \to F and y:pTy : p \to T (span(S)\operatorname{span}(S) is exactly the set of linear combinations of finite lists of elements of SS, and span()={0V}\operatorname{span}(\varnothing) = \{0_V\}).

[L3]

Finite sums: i<σ(p)ui=(i<pui)+up\sum_{i<\sigma(p)} u_i = \bigl(\sum_{i<p} u_i\bigr) + u_p (The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity, Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS); (F1) an all-0V0_V list sums to 0V0_V; (F3) i<pui=uj+i<pui(j)\sum_{i<p} u_i = u_j + \sum_{i<p} u^{(j)}_i for j<pj < p, with u(j)u^{(j)} agreeing with uu off jj and 0V0_V at jj (The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family).

[L4]

Deleting one index: for k<σ(p)k < \sigma(p) the map δk:pσ(p)\delta_k : p \to \sigma(p) is injective with image σ(p){k}\sigma(p) \setminus \{k\}, and a list u:σ(p)Vu : \sigma(p) \to V with uk=0Vu_k = 0_V satisfies j<σ(p)uj=i<puδk(i)\sum_{j<\sigma(p)} u_j = \sum_{i<p} u_{\delta_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 0V0_V, 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:pVv : p \to V is independent when i<pλivi=0V\sum_{i<p}\lambda_i v_i = 0_V forces every λi=0F\lambda_i = 0_F; a subset is independent when every injective finite list into it is (Linear independence: a finite list v:nVv : n \to V is independent when i<nλivi=0V\sum_{i<n} \lambda_i v_i = 0_V forces every λi=0F\lambda_i = 0_F, and a subset SVS \subseteq V is independent when every injective finite list into SS is independent).

[L6]

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

[L7]

FF is a field: every λ0F\lambda \ne 0_F has an inverse with λ1λ=1F\lambda^{-1}\lambda = 1_F (Field).

[L8]

Proof

technique · direct
1.1

Claim 1. From SS{w}S \subseteq S \cup \{w\} we get span(S)span(S{w})\operatorname{span}(S) \subseteq \operatorname{span}(S \cup \{w\}). Conversely, assume wspan(S)w \in \operatorname{span}(S); since also Sspan(S)S \subseteq \operatorname{span}(S), the set S{w}S \cup \{w\} is contained in span(S)\operatorname{span}(S), which is a linear subspace of VV, so minimality gives span(S{w})span(S)\operatorname{span}(S \cup \{w\}) \subseteq \operatorname{span}(S). The two inclusions give the claim.

L1
1.2

The two easy parts of claim 2. Assume wspan(S)w \notin \operatorname{span}(S). Then wSw \notin S, because Sspan(S)S \subseteq \operatorname{span}(S). Also span(S)span(S{w})\operatorname{span}(S) \subseteq \operatorname{span}(S \cup \{w\}) by monotonicity, and ww lies in the larger set and not in the smaller, so the inclusion is strict.

L1
1.3

Now assume in addition that SS is independent, and let v:nS{w}v : n \to S \cup \{w\} be an injective finite list with λ:nF\lambda : n \to F and i<nλivi=0V\sum_{i<n}\lambda_i v_i = 0_V. If ww is not a value of vv, then vv is an injective finite list into SS, so independence of SS gives λi=0F\lambda_i = 0_F for every i<ni < n and there is nothing more to prove.

L5
1.4

In the remaining case w=vkw = v_k for exactly one k<nk < n, since vv is injective. Then n0n \ne 0, say n=σ(n)n = \sigma(n'), and y:=vδky := v \circ \delta_k is an injective finite list nSn' \to S: it is injective as a composite of injections, and its values are the vjv_j with jkj \ne k, each of which lies in S{w}S \cup \{w\} and differs from vk=wv_k = w. Moreover, for every μ:nF\mu : n \to F with μk=0F\mu_k = 0_F the list iμivii \mapsto \mu_i v_i has the value 0Fw=0V0_F w = 0_V at kk, so deleting that index gives i<nμivi=i<nμδk(i)yi\sum_{i<n}\mu_i v_i = \sum_{i<n'}\mu_{\delta_k(i)} y_i.

L4L6L8
2.1

In that case the coefficient of ww vanishes. Suppose λk0F\lambda_k \ne 0_F. Applying (F3) at kk to the list iλivii \mapsto \lambda_i v_i gives 0V=λkw+R0_V = \lambda_k w + R, where R=i<nλiviR = \sum_{i<n}\lambda'_i v_i with λk:=0F\lambda'_k := 0_F and λi:=λi\lambda'_i := \lambda_i for iki \ne k, using 0Fw=0V0_F w = 0_V to identify the deleted entry. By step 1.4 applied to λ\lambda', R=i<nλδk(i)yiR = \sum_{i<n'}\lambda'_{\delta_k(i)} y_i, which is a linear combination of elements of SS and therefore lies in span(S)\operatorname{span}(S). Then λkw=R\lambda_k w = -R lies in span(S)\operatorname{span}(S), that set being a linear subspace, and hence so does w=1Fw=(λk1λk)w=λk1(λkw)w = 1_F w = (\lambda_k^{-1}\lambda_k)w = \lambda_k^{-1}(\lambda_k w), contradicting wspan(S)w \notin \operatorname{span}(S). So λk=0F\lambda_k = 0_F.

step 1.4L2L3L6L7
3.1

The remaining coefficients vanish too. Since λk=0F\lambda_k = 0_F by step 2.1, step 1.4 applied to λ\lambda itself gives 0V=i<nλivi=i<nλδk(i)yi0_V = \sum_{i<n}\lambda_i v_i = \sum_{i<n'}\lambda_{\delta_k(i)} y_i; the list yy is an injective finite list into the independent set SS, hence independent, so λδk(i)=0F\lambda_{\delta_k(i)} = 0_F for every i<ni < n'. As δk\delta_k has image n{k}n \setminus \{k\}, this says λj=0F\lambda_j = 0_F for every jkj \ne k, and with λk=0F\lambda_k = 0_F 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}S \cup \{w\} is independent, so S{w}S \cup \{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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 66 results over 23 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