The subspace spanned by $S$ is $\operatorname{span}S$, all finite linear combinations of its elements. It contains $S$ and is closed under combinations because sums and scalar multiples of finite combinations remain finite combinations. Any subspace containing $S$ must contain all these combinations, proving minimality.
Parents
Like how this is organised?
Build your own knowledge tree on knowen.md: notes, decisions and tasks in one connected markdown graph, shared with your team and your AI agents.