No. On the real vector space , use the symmetric bilinear formIts matrix of a bilinear form is , whose determinant is , so it is a nondegenerate bilinear form. LetA vector belongs to the bilinear orthogonal complement exactly when . HenceIn particular, the claimed direct sum fails. The isotropic vector has zero self-pairing, although it pairs nontrivially with other vectors of .
The dimension identity in part (i) counts both vector subspaces but does not force their intersection of vector subspaces to be zero. For a symmetric bilinear form, is the radical of a bilinear form restricted to . Thus the precise criterion isIndeed, trivial intersection of vector subspaces and part (i) give a sum of vector subspaces of dimension . A positive-definite bilinear form would guarantee this for every ; symmetry alone does not.
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 1 8D Solution Created 2026-09-24 Updated 2026-10-14
A vector space over the real numbers is a set with an addition making it an abelian group and a scalar multiplication by satisfying, for scalars and vectors , the identities , , and . A vector subspace is a nonempty subset closed under addition and scalar multiplication; a proper vector subspace is one unequal to . A spanning set is a set whose finite linear combinations give every vector of . A basis is a linearly independent spanning set. The dimension is the number of vectors in a basis, or its cardinality when the basis is infinite.
The sum of vector subspaces and their intersection of vector subspaces areBoth are vector subspaces: addition and scalar multiplication preserve the displayed forms or simultaneous membership. The intersection of vector subspaces is never empty because .
For the two given hyperplanes, adding and subtracting their defining equations gives and . HenceThese two nonzero vectors are orthogonal, and consequently form an orthogonal basis of the intersection of vector subspaces. Put and . Direct substitution gives , . Their dot products with vanish, and . Each defining equation of or is one nonzero linear constraint in four variables, so each vector subspace has dimension three. Thus each space has the indicated orthogonal basis:The last four vectors are nonzero and mutually orthogonal, so they are a basis of . They lie in , proving . The dimension identity is therefore verified numerically:
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 3 7F a Solution Created 2026-09-24 Updated 2026-10-14
True. Both vector subspaces contain zero, and if , every linear combination belongs to each of and . Thus it belongs to their intersection. This proves the intersection of vector subspaces is a vector subspace.
Past exam of the mathematics course of the University of Cambridge 2019 ib Paper 2 1F Solution Created 2026-09-24 Updated 2026-09-29
Let . Choose a basis of the intersection of vector subspaces, extend it to a basis of , and independently extend it to a basis of . The combined listspans the sum of vector subspaces . It is also linearly independent: a vanishing linear combination says that a combination of the belongs to , and its expression in the chosen basis of forces all its coefficients to vanish; the coefficients of the then vanish in the same way. This proves the dimension formula for a sum of subspaces
Parametrize the two linear subspaces asPutting a vector of in first forces its fourth coordinate to vanish; the remaining defining equation is then automatic. Thusand the dimension formula gives .
The linear functionalvanishes on each displayed generator of and . Its kernel is three-dimensional because , so the inclusion between two three-dimensional subspaces is equality.
The intersection of vector subspaces contains zero, so . If and are scalars, thenbecause by the vector subspace conditions. These pairs belong to , since both and belong to the required factors. Thus is a vector subspace of .