University College London · FACULTY OF MATHEMATICS

MATH0005 Chap.3 Subspaces, Span and Independence

- one subject, every graph, every model, every mark
7 Chapters4-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 3 of 8 · MATH0005

Subspaces, Span and Independence

Subspaces, Span and Independence distinguishes three related questions. A subspace must contain zero and remain closed under every linear combination of its members. A spanning sequence asks whether every target in the subspace can be formed from listed vectors. Linear independence asks whether the zero vector has only the trivial coefficient representation. A basis satisfies both spanning and independence.

Homogeneous equations naturally define subspaces because linear combinations of solutions remain solutions, while equations with nonzero constants usually define affine sets that miss zero. The span of one nonzero real vector is a line through the origin, and two independent vectors in three-dimensional space span a plane through the origin.

A spanning list may contain redundant vectors; a nontrivial coefficient relation proves dependence and identifies a vector that can often be removed without changing the span. Parameterising an equation-defined set provides generators, while a homogeneous coefficient system tests independence.

The chapter pairs algebraic proof with geometric intuition and insists on naming the first property that fails when a set or sequence does not qualify. Explicit coefficient relations and minimal counterexamples make every conclusion auditable rather than dependent on a picture or an unsupported dimension guess.

In this chapter

What this chapter covers

  • 01

    Subspace closure

  • 02

    Homogeneous constraints

  • 03

    Linear combinations

  • 04

    Spanning sequences

  • 05

    Dependence relations

  • 06

    Basis tests

  • 07

    Affine sets

Worked example · free

Prove a plane is a subspace and choose a basis

Q [9 marks]. Let U be the vectors (x,y,z) in R3 satisfying x+2y-z=0. Prove U is a subspace and find a basis. These marks are not an official university marking scheme for a subspace proof.
The blue plane passes through the origin, and every combination of the two generating arrows remains in that plane; the green arrow illustrates one such combinaThe blue plane passes through the origin, and every combination of the two generating arrows remains in that plane; the green arrow illustrates one such combination.uvau+bvsubspace through zero
The blue plane passes through the origin, and every combination of the two generating arrows remains in that plane; the green arrow illustrates one such combination.
  • 3Use the linear expression L(x,y,z)=x+2y-z and show L(au+bv)=aL(u)+bL(v)=0 for members u and v.
  • 3Let y=s and z=t, giving x=-2s+t and every vector as s(-2,1,0)+t(1,0,1).
  • 3The two displayed generators are independent because their second and third coordinates force both coefficients to zero.
U is a subspace with basis ((-2,1,0),(1,0,1)). The closure argument and parameterisation establish the two required basis properties. The practice points are not an official marking scheme.
Sia tip — Use the defining equation for closure, then parameterise every member to build the spanning vectors.
Glossary

Key terms

Subspace
A subset that contains zero and is closed under all linear combinations.
Span
The set of every linear combination of a stated sequence of vectors.
Affine set
A translated linear set that need not contain the zero vector.
FAQ

Subspaces, Span and Independence FAQ

What is the fastest way to reject a subspace?

Test the zero vector first. A condition with a nonzero constant often fails immediately. Otherwise find one pair of members whose sum leaves the set or one member whose scalar multiple leaves it, and display the counterexample explicitly.

How are spanning and independence different?

Spanning asks whether the list reaches every vector in the target space. Independence asks whether its coefficient representation is unique. A redundant list can still span, while an independent list can fail to reach the whole target. A basis requires both.

How should I prove dependence?

Write a nontrivial relation c1v1+...+ckvk=0 with at least one nonzero coefficient. That relation is stronger than the label dependent because it shows the redundancy and often tells you which vector can be removed without changing the span.

Study strategy

Exam move

Organise revision around the property being tested. For a set, check zero and closure under a general linear combination. For membership in a span, solve a coefficient system and interpret consistency. For independence, solve the homogeneous coefficient system and look for free variables. For basis status, write both independent and spanning in the conclusion.

Practise homogeneous equation sets and compare them with nearly identical nonhomogeneous affine sets so the role of zero becomes automatic. Draw lines and planes through the origin for intuition, but use equations when dimensions exceed the picture. Whenever a list is dependent, record the explicit relation and remove one vector with nonzero coefficient to test whether the remaining list is a basis for the same span.

When a set is not a subspace, give the smallest clean counterexample instead of a vague closure claim. Keep the ambient space and field visible, since a sequence's independence can depend on the scalar field. Link the chapter to systems by placing candidate spanning vectors as matrix columns. Link it to dimension by counting the vectors only after basis status is proved.

Finish every proof with the precise object established: subspace, spanning list, independent sequence or basis. Build contrast pairs from one equation by changing a homogeneous right-hand side to a nonzero constant, or by replacing a linear condition with a nonlinear one. For each pair, predict the first axiom likely to fail and then exhibit it.

When testing a list, keep the column equation visible so the same reduction answers both membership and dependence questions with different right-hand sides. Practise extracting a smaller spanning list from each nontrivial relation and confirm the span is unchanged in both directions. This makes redundancy a constructive tool rather than only a failed test.

Working through Subspaces, Span and Independence in MATH0005? Sia is AskSia’s AI Mathematics tutor — ask any MATH0005 Subspaces, Span and Independence question and get a clear, step-by-step explanation grounded in how MATH0005 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 32 of your subjects at University College London, plus 1,000+ more Bibles across the AskSia library.
Sia - your MATH0005 tutor, unlimited, worked the way the exam marks it
The full 4-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works