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.
Three distinct lines in have while the inclusion-exclusion analogue of the dimension formula predicts , so the two-subspace formula does not extend
Statement refuted
False claim: for finite-dimensional linear subspaces of a vector space over ,
This is the inclusion-exclusion analogue of The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and , written without subtraction so that both sides are natural numbers; for two subspaces the same rearrangement is exactly that theorem.
Let be any field, let be the function space on (The vector space of all functions with pointwise operations, and as the case ) with , and , and put
Then for each , all three pairwise intersections and the triple intersection equal and so have dimension , and has dimension . The left-hand side is and the right-hand side is , so the claimed identity fails.
The three sets are called lines informally, as on the order-69 examples page; the word carries no separate definition here.
Facts & Assumptions
Given: A field , the vector space , the vectors , , , and the linear subspaces above.
; if then only for and (, which is when , and when contains only as the multiple , claims 1 and 3).
is an ordered basis with , and (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension , claims 2, 3 and 4).
, and a sum of a family contains each summand (, so the sum is the smallest linear subspace containing every , The sum of two linear subspaces and the sum of a finite family).
is a linear subspace containing , contained in every linear subspace containing , and monotone; the intersection of two linear subspaces is a linear subspace, and every linear subspace contains (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 , The intersection of a nonempty family of linear subspaces of is a linear subspace of , Linear subspace of a vector space).
means has a basis with elements, and it is well defined; ; a basis is a linearly independent spanning subset (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, 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, Equinumerous sets, and , Finite, countably infinite, countable, uncountable).
In : elements are equal exactly when they agree at and at ; ; ; and (The vector space of all functions with pointwise operations, and as the case , Vector space over a field, In any vector space , , , , and forces or , Field, The natural numbers (von Neumann), On the order is membership: ).
Counterexample
Each of , , is nonzero, since each takes the value somewhere, and the three are pairwise distinct: and differ at , and differ at , and and differ at .
for each . Take to be , or ; then spans , and it is linearly independent, since an injective list into has length or is the one-term list , and forces because . So is a basis with exactly one element.
The pairwise intersections are . An element of is ; evaluating at gives , that is , so the element is . An element of is ; evaluating at gives , so it is . An element of is ; evaluating at gives , so it is . Each intersection also contains , being an intersection of linear subspaces, so all three equal .
. The sum contains each , hence contains and ; being a linear subspace it contains , and it is contained in .
The two sides. The triple intersection is contained in by step 1.3 and contains , so it is ; hence all four intersection terms have dimension by step 1.3. By step 1.4 and the standard basis, , and by step 1.2 each . So the left-hand side of the claimed identity is and the right-hand side is .
Since , the claimed identity fails for these three finite-dimensional linear subspaces of , so the two-subspace dimension formula has no inclusion-exclusion extension to three subspaces.
Remarks
-
Same witness, different failure. The three lines used here are exactly those of Three lines in that meet pairwise only in and whose sum is with decompositions that are not unique, so pairwise trivial intersection does not give a direct sum on the order-69 examples page. That item shows that pairwise trivial intersections together with do not make the sum direct, condition (D2) of Internal direct sum : the sum is everything and each summand meets the sum of the others only in failing at the third summand. This item shows something else about the same configuration: that the dimensions do not obey inclusion-exclusion. Neither statement follows from the other, and the shared witness is a coincidence of economy rather than a duplication.
-
Why the two-subspace formula does not extend. The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and is proved by extending a basis of to bases of and of and showing the union is a basis of . With three subspaces there is no single "common part" to extend from: here every pairwise intersection is trivial, so the naive bookkeeping counts three independent directions in a plane that has only two.
-
The field is arbitrary and is named. Over the two-element field the three lines are still three distinct sets, each with two elements, and every step above uses only and the field axioms.
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$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- If $V$ has a basis with $n$ elements and a basis with $m$ elements then $n = m$; and if $V$ has one finite basis then every basis of $V$ is finite
- 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$
- $\operatorname{span}\{v\} = \{\, \lambda v : \lambda \in F \,\}$, which is $\{0_V\}$ when $v = 0_V$, and when $v \ne 0_V$ contains $0_V$ only as the multiple $0_F v$
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- 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 $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Linear subspace of a vector space
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- The span is monotone and idempotent, $\operatorname{span}(S) = S$ exactly when $S$ is a linear subspace, and $\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S)$
- 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
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Vector space over a field
- Field
- In any vector space $0_F v = 0_V$, $\lambda 0_V = 0_V$, $(-\lambda)v = -(\lambda v)$, $(-1_F)v = -v$, and $\lambda v = 0_V$ forces $\lambda = 0_F$ or $v = 0_V$
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Finite, countably infinite, countable, uncountable
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
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: 87 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
- Dimension theorem for vector spaces (Wikipedia) (standard reference, not scraped)
- Inclusion-exclusion principle (Wikipedia) (standard reference, not scraped)
- UC Berkeley Math 110 notes: Linear algebra (standard reference, not scraped)