is a subspace when and is stable under addition and scalar multiplication — equivalently:
A subspace is itself a vector space. Any intersection of subspaces is a subspace; a union almost never is (same proof as Exercise 7.6).
Examples
Example 18.4
In : the continuous functions, the differentiable ones, the polynomials of degree (written inside ), the solutions of a homogeneous linear differential equation (Theorem 5.10 said just that). Non-examples: (no zero), degree exactly (not stable under addition).
Example 18.5 (Subspace or not: four verdicts, argued)
In the space of real sequences:
- is a subspace: is bounded, and if , , then .
- is not: the zero sequence is missing (and the sum of two members tends to ).
- is not: and are monotone, their sum is not; stability under addition is the axiom that fails, even though the set contains and all scalar multiples of its members.
- is not: it contains but escapes as soon as is a nonzero member ( in general) — squaring is the nonlinearity.
The working order is always the same: test first (cheapest), then stability — and to refute, one explicit counterexample pair beats any amount of doubt.
Example 18.12 (A supplementary pair in )
Fix and set , (the constants). Then . Indeed consists of the constants vanishing at , i.e. ; and every decomposes as
The decomposition is worth memorizing: subtracting the value at a point is the standard way to project onto “functions vanishing at ”. Note that is a large subspace and a small one; a supplementary pair need not be balanced in any sense.