2.1110 min read
The Hammer Lemma and Span Structure
A key lemma connects dependence to span: if appears with a nonzero coefficient in a dependence relation among , then .
This means: in a linearly dependent set, at least one vector is redundant — it can be removed without shrinking the span. This is the pull-off lemma: you can peel away one vector from a dependent set and preserve the span.
Conversely, if , then adding to while preserving independence is always possible (push-on lemma). These two lemmas are the combinatorial engine behind all basis theory.
Formal View
Lemma 2.11 (Hammer) — Dependence Implies Membership in Span
If with , then
Corollary 2.11 (Pull-off)
If is linearly dependent, then some lies in the span of the others, and .
Why This Matters
The Hammer Lemma is the key tool for proving basis-related theorems and the Rank-Nullity theorem.
- Data compression: removing linearly dependent features without losing information
- Signal processing: identifying and removing redundant sensors
- Dimensionality reduction: PCA exploits the pull-off principle to find minimal spanning sets
Quiz
Question 1
If is linearly dependent, then removing one vector always reduces the span.
Common Mistakes
- Thinking all vectors in a dependent set are redundant — only at least one is guaranteed to be removable.