4.5.17Linear Algebra (Full)

Basis — definition, uniqueness of representation

1,708 words8 min readdifficulty · medium1 backlinks

1. From scratch: what two properties do we need?

We want a set B={v1,,vn}B = \{v_1, \dots, v_n\} inside a vector space VV to act like coordinate axes.

  • We must be able to build any vector from BB → this is spanning.
  • We must have no redundancy (no axis expressible from the others) → this is linear independence.

2. The central theorem (DERIVE it)

Proof of "\Rightarrow": basis gives uniqueness.

Existence. Spanning literally says some w=civiw=\sum c_i v_i exists. ✔

Uniqueness. Suppose ww had two representations: w=iciviandw=idivi.w = \sum_i c_i v_i \quad\text{and}\quad w = \sum_i d_i v_i. Subtract them (legal — same vector minus itself): 0=ww=i(cidi)vi.\mathbf 0 = w - w = \sum_i (c_i - d_i)\, v_i. Why this step? Because turning "two equal sums" into "something =0=\mathbf 0" lets us invoke independence, which is a statement about combinations equaling zero.

By linear independence, the only way i(cidi)vi=0\sum_i (c_i-d_i)v_i=\mathbf 0 is if every coefficient is zero: cidi=0    ci=dii.c_i - d_i = 0 \;\Rightarrow\; c_i = d_i \quad\forall i. So the two representations were the same. Uniqueness proved. ∎

Proof of "\Leftarrow": uniqueness gives basis.

  • Existence-for-all = spanning. ✔
  • Uniqueness applied to w=0w=\mathbf 0: one rep is 0=0vi\mathbf 0=\sum 0\cdot v_i. Uniqueness says it's the only one, so civi=0ci=0\sum c_i v_i=\mathbf 0\Rightarrow c_i=0 → that's exactly independence. ✔ ∎
Figure — Basis — definition, uniqueness of representation

3. Worked examples


4. Common mistakes (Steel-manned)


5. The 80/20 core


6. Flashcards

What two conditions define a basis?
Linear independence AND spanning of VV.
Which basis property guarantees existence of a representation?
Spanning.
Which basis property guarantees uniqueness of a representation?
Linear independence.
State the uniqueness theorem.
BB is a basis     \iff every wVw\in V is uniquely w=civiw=\sum c_i v_i.
In the uniqueness proof, after assuming two reps, what trick is used?
Subtract them to get (cidi)vi=0\sum(c_i-d_i)v_i=\mathbf 0, then apply independence.
What are the cic_i in w=civiw=\sum c_i v_i called?
The coordinates of ww relative to basis BB.
Coordinates of (4,2)(4,2) in basis {(1,1),(1,1)}\{(1,1),(1,-1)\}?
(3,1)(3,1).
Why isn't {e1,e2,(1,1)}\{e_1,e_2,(1,1)\} a basis of R2\mathbb R^2?
It spans but is dependent, so coordinates aren't unique.
Why isn't {e1,e2}\{e_1,e_2\} a basis of R3\mathbb R^3?
Independent but doesn't span; (0,0,1)(0,0,1) is unreachable.
How does uniqueness for w=0w=\mathbf 0 recover independence?
Only rep of 0\mathbf 0 is all-zero coeffs, which IS the definition of independence.
What is the size of any basis equal to?
dimV\dim V.

Recall Feynman: explain to a 12-year-old

Imagine giving directions on a grid using only "steps East" and "steps North." Those two moves are your basis. Spanning means you can reach any spot. Independence means North isn't secretly the same as East — they're genuinely different directions. Because of that, every spot has one honest answer like "3 East, 1 North." If I gave you a third useless direction (like "Northeast"), suddenly the same spot could be described in many ways — confusing! A basis is the cleanest possible set of directions: enough to reach everywhere, but no leftovers, so every place has exactly one name.

Connections

  • Linear Independence — supplies the uniqueness half.
  • Span and Spanning Sets — supplies the existence half.
  • Dimension — the invariant size of every basis.
  • Coordinate Vectors and Change of Basis — coordinates [w]B[w]_B depend on chosen BB.
  • Subspaces — bases let us measure subspace dimension.
  • Matrix of a Linear Map — built by feeding basis vectors through a map.

Concept Map

requires

requires

guarantees

guarantees

combined with

combined with

scalars are

size n is

enables

zero vector rep forces

Basis of V

Spanning

Linear Independence

Existence of rep

Uniqueness of rep

Exactly one representation

Coordinates c1..cn

Dimension dim V

Vectors as matrix columns

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Dekho, basis ka matlab hai ek vector space ke liye sabse saaf-suthra coordinate system. Iske do hi conditions hai: pehla linear independence (koi bhi vector dusron se banaya na ja sake, yaani koi fizool direction nahi), aur dusra spanning (in vectors se space ka har element ban jaaye). Jab dono saath ho, tab kuch magical hota hai: har vector ka exactly ek hi address ban jaata hai — yaani unique coordinates.

Yeh uniqueness kahan se aati hai? Maano ek vector ww ke do alag-alag representations hai: w=civiw=\sum c_i v_i aur w=diviw=\sum d_i v_i. Inko subtract karo to 0=(cidi)vi\mathbf 0=\sum(c_i-d_i)v_i milta hai. Ab independence kehta hai ki zero banane ka sirf ek tareeka hai — saare coefficients zero. Iska matlab ci=dic_i=d_i, yaani dono representations same the. Bas yahi proof hai! Spanning se "kam se kam ek" representation milta hai (existence), independence se "zyada se zyada ek" (uniqueness) — milke "bilkul ek".

Common galti: students sochte hai ki sirf spanning kaafi hai, ya sirf independence kaafi hai. Agar bahut zyada vectors le lo (jaise e1,e2,(1,1)e_1,e_2,(1,1) in R2\mathbb R^2), to space to ban jaata hai par ek vector ke kai addresses ho jaate hai — yeh basis nahi. Aur agar kam vectors le lo (jaise sirf e1,e2e_1,e_2 in R3\mathbb R^3), to kuch vectors reach hi nahi hote. Toh size bilkul dimV\dim V hona chahiye.

Yeh chapter isliye important hai kyunki ek baar basis fix kar lo, har abstract vector ek number-column ban jaata hai, aur phir poori linear algebra matrices se ho jaati hai — change of basis, transformations, sab kuch. Yaad rakho: S.I. se E.U. — Span + Independence dete hai Existence + Uniqueness.

Go deeper — visual, from zero

Test yourself — Linear Algebra (Full)

Connections