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.
The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and
Statement
Let be a vector space over a field (Vector space over a field) and let and be linear subspaces of (Linear subspace of a vector space), both finite-dimensional over (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis). Then and (The sum of two linear subspaces and the sum of a finite family) are finite-dimensional and
The ambient space is arbitrary and need not be finite-dimensional.
The two boundary cases. If the formula reads , since ; if it reads .
No choice principle is used. The bases of and of extending a basis of come from claim 3 of If and is a linear subspace of , then is finite-dimensional, , and if and only if , which is proved by a largest-independent-subset argument inside a finite-dimensional space. Zorn's lemma is not used anywhere below, and the Zorn-based extension theorem of this page is neither cited nor needed; the remarks say where the difference lies.
Facts & Assumptions
Given: A field ; a vector space over ; and finite-dimensional linear subspaces and of ; write and .
means has a basis with elements; if has one finite basis then every basis of is finite, and any two have the same size (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis, If has a basis with elements and a basis with elements then ; and if has one finite basis then every basis of is finite).
The intersection of two linear subspaces of is a linear subspace of (The intersection of a nonempty family of linear subspaces of is a linear subspace of ); a linear subspace of contained in is a linear subspace of , linear independence is the same computed in a linear subspace or in , and spans agree (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, section on bases of a linear subspace, Linear subspace of a vector space).
A linear subspace of a finite-dimensional space is finite-dimensional of no greater dimension (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
If has a spanning set with elements then every linearly independent subset of is finite with at most elements (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with ).
In a finite-dimensional vector space over , every linearly independent is contained in a basis of , and no choice principle is used to produce it (If and is a linear subspace of , then is finite-dimensional, , and if and only if , claim 3, which states this for a linear subspace and notes that a space is a linear subspace of itself). Also for a linear subspace (The span is monotone and idempotent, exactly when is a linear subspace, and , claim 4).
Concatenation: for and there is exactly one with for and for ; for it satisfies ; and if are injective with disjoint images then is injective with image . A list is linearly independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent (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 , 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, claims 3, 6 and 7). The scalar case is the same statement read in , a vector space over itself (A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars).
A subset is linearly dependent exactly when some lies in (A subset is linearly dependent if and only if some lies in ; and is already the set of linear combinations of INJECTIVE finite lists into , claim 1).
is a linear subspace containing , contained in every linear subspace containing , monotone in , and equal to the set of linear combinations of finite lists into ; and (Linear combination of a finite list, and the span as the smallest linear subspace containing , The span is monotone and idempotent, exactly when is a linear subspace, and , is exactly the set of linear combinations of finite lists of elements of , and , , so the sum is the smallest linear subspace containing every , The sum of two linear subspaces and the sum of a finite family).
is an abelian group; ; ; (V4) ; (F1) an all- list sums to ; and a scalar passes through a finite sum (Vector space over a field, In any vector space , , , , and forces or , Field, The sum of two linear subspaces and the sum of a finite family, The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity).
A finite set is equinumerous with exactly one natural number (The pigeonhole principle on , claim 3); addition on is associative and commutative (Addition of natural numbers, Addition is associative, Addition is commutative); , images and injectivity are as in Equinumerous sets, and , Finite, countably infinite, countable, uncountable, Injection, surjection, bijection, The natural numbers (von Neumann), On the order is membership: .
Proof
is a linear subspace of contained in , hence a linear subspace of ; since is finite-dimensional, so is . Write , fix a basis of with , and fix an injective list with image . Note , and that independence and spans may be computed in throughout.
Extending in each of and . The set is linearly independent with , and is finite-dimensional, so is contained in a basis of ; likewise gives a basis of with . Both extensions are the finite-dimensional ones, with no appeal to Zorn's lemma. Put and , which are disjoint from by construction. Each is a subset of a linearly independent set, hence linearly independent, and each lies in a space with a finite basis, hence is finite; fix and with and , and injective lists with image and with image .
The sizes add up. The lists and are injective with disjoint images, so their concatenation is an injective list with image ; hence . Also is a basis of , so , and a finite set is equinumerous with exactly one natural number, so . The same argument with gives .
and are disjoint. Suppose . Then and , so . But means , so and monotonicity gives , which makes linearly dependent and contradicts its being a basis.
One list carrying all three blocks. Let be the concatenation of and , an injective list with image , and let be the concatenation of and , a list . By step 3.2 the images and are disjoint, since would lie in or in , both empty; so is injective with image . For scalars the sum splits as .
The list is linearly independent. Let with , and write and , so by step 4.1 and hence . Now is a linear combination of the list , whose values lie in , so and therefore ; and is a linear combination of , whose values lie in , so . Hence , so for some . Let be the concatenation of and , injective with image since and are disjoint, and let be the concatenation of with ; then . As is an injective list into the linearly independent set , it is a linearly independent list, so every ; in particular for every , and for every , whence by (F1) and . Finally is an injective list into the linearly independent set , hence linearly independent, so forces for every . Every coefficient of therefore vanishes.
. From and and monotonicity, and , so and hence . Conversely , and is a linear subspace, so .
is a basis of with elements. By step 5.1 the list is linearly independent, hence injective with linearly independent image and ; by step 5.2 it spans . So is finite-dimensional with .
The formula. By step 3.1, and , so step 6.1 gives , and with from step 1.1 we get , using associativity and commutativity of addition on .
Remarks
-
The crux is independence, not spanning. That spans is immediate from monotonicity of the span; what has to be worked for is that it is independent, and the whole force of the hypothesis is spent there: a vanishing combination pushes the -part into , hence into , hence into the span of , after which independence of kills its coefficients.
-
The three blocks are pairwise disjoint, and that is proved rather than assumed. meets neither nor by construction, and meets only if some vector of lies in , which would make dependent. Without disjointness the count would be wrong even though the set were still a basis.
-
The proof costs no choice principle, and the reason is that and are finite-dimensional. The only existence step is 2.1, and the extension used there is claim 3 of If and is a linear subspace of , then is finite-dimensional, , and if and only if : among the linearly independent subsets of containing there is one of greatest size, because If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with bounds their sizes and The well-ordering principle then produces the largest, and a set of that size is already a basis by If is linearly independent and then is linearly independent and ; and if then . Nothing is selected from an infinite family, so Zorn's lemma is not needed. The corresponding statement for an arbitrary vector space, Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if with independent and , there is a basis of with , does need the Axiom of Choice; this theorem does not use it, and Every linear subspace of a vector space has a complement: a linear subspace with is the item on this page that genuinely does.
-
Nothing here needs the ambient to be finite-dimensional, only and . The consequence for a finite family of summands is If with every finite-dimensional, then is finite-dimensional and ; in particular , and the failure of the inclusion-exclusion analogue for three subspaces is recorded on the companion page.
Depends on
If and is a linear subspace of , then is finite-dimensional, , and if and only if
Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis
If has a basis with elements and a basis with elements then ; and if has one finite basis then every basis of is finite
If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with
A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis
A subset is linearly dependent if and only if some lies in ; and is already the set of linear combinations of INJECTIVE finite lists into
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 , 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
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent
The sum of two linear subspaces and the sum of a finite family
, so the sum is the smallest linear subspace containing every
Linear subspace of a vector space
The intersection of a nonempty family of linear subspaces of is a linear subspace of
Linear combination of a finite list, and the span as the smallest linear subspace containing
is exactly the set of linear combinations of finite lists of elements of , and
The span is monotone and idempotent, exactly when is a linear subspace, and
The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity
A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars
Vector space over a field
Field
In any vector space , , , , and forces or
Addition of natural numbers
Addition is associative
Addition is commutative
Finite, countably infinite, countable, uncountable
Equinumerous sets, and
Injection, surjection, bijection
The pigeonhole principle on
The natural numbers (von Neumann)
On the order is membership: