Question
Example of a closed set under scalar multiplication that is not a subspace
Original question: Give an example, with complete reasoning and evidence, of a vector space over a scalar field which has a proper non-empty subset such that for all and all , but is not a subspace of .
[100 marks]
Expert Verified Solution
Expert intro: This question tests a subtle subspace criterion: closure under scalar multiplication alone is not enough to guarantee a subspace.
Detailed walkthrough
A valid example
Let over the scalar field , and define
This is the union of the two coordinate axes.
It is a proper non-empty subset of , and it is closed under scalar multiplication: if and , then is still on the same axis as , so .
However, is not a subspace of because it is not closed under addition. For example,
but
So satisfies scalar-multiplication closure but fails the addition axiom, which means it is not a subspace.
Why this works
A subspace must satisfy three core conditions: it must contain the zero vector, be closed under addition, and be closed under scalar multiplication. Many students remember only the scalar-multiplication test and forget that addition is equally necessary.
In this example, contains because the origin lies on both axes. It is also closed under scalar multiplication. The failure happens only when vectors from different axes are added together.
General principle
A proper subset can be closed under scaling without being a subspace if it is made from several “pieces” that are individually stable under scalar multiplication but do not stay closed when combined by addition. The union of subspaces is a common source of such examples, provided the union is not itself a subspace.
Evidence and explanation
To verify the claim rigorously, we check each requested property:
- Proper subset: because, for instance, but not in .
- Non-empty: .
- Closed under scalar multiplication: if , then ; if , then .
- Not a subspace: addition fails, as shown above.
That satisfies the requirement exactly.
💡 Pitfall guide
A frequent mistake is to give a set that is not even closed under scalar multiplication, such as a single open disk or a half-plane. That does not answer the question. Another error is to choose a subset that contains only the zero vector, because that is actually a subspace. The key is to find a proper non-empty set that survives scaling but breaks under addition. The union of two axes is a clean example because the failure is easy to demonstrate with a single counterexample.
🔄 Real-world variant
If the scalar field were changed to and the subset were the union of two lines through the origin in , the same idea would still work as long as the lines are distinct and not closed under addition together. Another useful variant is in ; it is still closed under scalar multiplication but not under addition, since adding one vector from each line can produce a vector on neither line.
🔍 Related terms
subspace criterion, closure under scalar multiplication, closure under addition
FAQ
What is an example of a set closed under scalar multiplication but not a subspace?
In R^2, the union of the x-axis and y-axis is closed under scalar multiplication but not under addition. Adding (1,0) and (0,1) gives (1,1), which is not in the set.
Which subspace axiom fails for the union of two coordinate axes?
Closure under addition fails. Each axis is stable under scaling, but vectors from different axes can add to a point that lies on neither axis.