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 with every finite-dimensional, then is finite-dimensional and ; in particular
Statement
Let be a field (Field), let , let be a vector space over (Vector space over a field) and let be a family of linear subspaces of indexed by (Linear subspace of a vector space, The sum of two linear subspaces and the sum of a finite family) with
(Internal direct sum : the sum is everything and each summand meets the sum of the others only in ) and every finite-dimensional over (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis). Then is finite-dimensional over and
the right-hand side being the finite sum of The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity read additively in the commutative monoid (Addition of natural numbers, Left identity for addition, Addition is associative, Addition is commutative).
The base case is a genuine case. At the direct sum of the empty family is and the empty sum of natural numbers is , so the formula reads . At it reads .
No choice principle is used. The only inputs are The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and and If and is a linear subspace of , then is finite-dimensional, , and if and only if , both of which are proved in finite dimension without one.
Facts & Assumptions
Given: A field ; a natural number ; a vector space over ; and a family of finite-dimensional linear subspaces of indexed by with .
means (D1) and (D2) for every , where for the family with ; and holds exactly for the zero space (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
is a linear subspace of whose elements are exactly the with ; ; and the finite sum obeys (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 sum of a family contains each of its summands (, so the sum is the smallest linear subspace containing every ); the intersection of two linear subspaces is a linear subspace (The intersection of a nonempty family of linear subspaces of is a linear subspace of ); and a linear subspace of contained in a linear subspace of is a linear subspace of , with the same independence and the same spans (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).
For finite-dimensional linear subspaces and of a vector space, and are finite-dimensional and (The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and ); and a linear subspace of a finite-dimensional space is finite-dimensional (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
, and depends only on the space and the field (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
Addition makes a commutative monoid, and its finite sums satisfy and (Addition of natural numbers, Left identity for addition, Addition is associative, Addition is commutative, The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity).
Induction on , with and (The principle of mathematical induction, The natural numbers (von Neumann), On the order is membership: , Order on the natural numbers).
Proof
The statement to be proved by induction on is: for every vector space over and every family of finite-dimensional linear subspaces of indexed by with , the space is finite-dimensional with . At the hypothesis holds exactly when , and then , which is also the empty sum .
Two identities used in the successor step. Let and put , a linear subspace of . First, : an element of the right-hand side is with for and , and the recursion makes that , so the two sets have the same elements. Second, : an element of the left-hand side is with for and , which by the recursion is , and conversely.
Assume the displayed statement at the natural number , for every vector space over and every family of finite-dimensional linear subspaces indexed by .
The successor step. Let , let with every finite-dimensional, and let as in step 1.2. Then as a direct sum inside : condition (D1) holds by the definition of , and for every element with is also after setting , so is contained in the corresponding sum for the family indexed by , and (D2) for the larger family at forces , the reverse inclusion holding because both sides are linear subspaces. Each with is contained in and is therefore a linear subspace of , still finite-dimensional. So step 1.3 applies to and gives that is finite-dimensional with . Now and are finite-dimensional linear subspaces of ; by step 1.2 their sum is , and their intersection is by (D2) at . The dimension formula therefore gives , that is , and is finite-dimensional because the dimension formula asserts that the sum of two finite-dimensional subspaces is one.
Step 1.1 and step 2.1 are the base case and the successor step of an induction on , so the statement holds for every ; at it reads , by the recursion for finite sums of naturals.
Remarks
-
(D2), not the pairwise condition, is what makes the induction run. At each stage the intersection term vanishes because meets the sum of all the other summands only in ; pairwise trivial intersections would not give that, and if and only if every is with in exactly one way; equivalently, if and only if the sum is and with forces every records that the two conditions are genuinely different from three summands on. The order-69 examples page carries the witness, and the companion page of this one uses the same three lines for a different failure.
-
The base case is stated rather than started at . contains , the empty direct sum is the zero space (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ) and the empty sum of naturals is (The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity), so is an instance of the formula and not an exception to it.
-
Nothing here bounds the number of summands by the dimension. A direct sum may have many summands equal to , each contributing to the sum; the formula counts dimensions, not summands.
Depends on
- The dimension formula: for finite-dimensional linear subspaces $U$ and $W$ of $V$, the subspaces $U + W$ and $U \cap W$ are finite-dimensional and $\dim_F(U+W) + \dim_F(U \cap W) = \dim_F U + \dim_F W$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Internal direct sum $V = \bigoplus_{i<n} U_i$: the sum is everything and each summand meets the sum of the others only in $0_V$
- The sum $U + W$ of two linear subspaces and the sum $\sum_{i<n} U_i$ of a finite family
- $\sum_{i<n} U_i = \operatorname{span}\bigl(\bigcup_{i<n} U_i\bigr)$, so the sum is the smallest linear subspace containing every $U_i$
- The intersection of a nonempty family of linear subspaces of $V$ is a linear subspace of $V$
- Linear subspace of a vector space
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- The product $g_0 g_1 \cdots g_{n-1}$ of a finite list in a monoid, by recursion, with the empty product ($n = 0$) equal to the identity
- Addition of natural numbers
- Left identity for addition
- Addition is associative
- Addition is commutative
- Vector space over a field
- Field
- The principle of mathematical induction
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Order on the natural numbers
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: 84 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
- Direct sum of modules (Wikipedia) (standard reference, not scraped)
- Dimension (vector space) (Wikipedia) (standard reference, not scraped)
- University of Pennsylvania notes: Vector spaces and direct sums (standard reference, not scraped)