Existence. Spanning literally says some w=∑civi exists. ✔
Uniqueness. Suppose w had two representations:
w=∑iciviandw=∑idivi.
Subtract them (legal — same vector minus itself):
0=w−w=∑i(ci−di)vi.Why this step? Because turning "two equal sums" into "something =0" lets us invoke independence, which is a statement about combinations equaling zero.
By linear independence, the only way ∑i(ci−di)vi=0 is if every coefficient is zero:
ci−di=0⇒ci=di∀i.
So the two representations were the same. Uniqueness proved. ∎
Proof of "⇐": uniqueness gives basis.
Existence-for-all = spanning. ✔
Uniqueness applied to w=0: one rep is 0=∑0⋅vi. Uniqueness says it's the only one, so ∑civi=0⇒ci=0 → that's exactly independence. ✔ ∎
Which basis property guarantees existence of a representation?
Spanning.
Which basis property guarantees uniqueness of a representation?
Linear independence.
State the uniqueness theorem.
B is a basis ⟺ every w∈V is uniquely w=∑civi.
In the uniqueness proof, after assuming two reps, what trick is used?
Subtract them to get ∑(ci−di)vi=0, then apply independence.
What are the ci in w=∑civi called?
The coordinates of w relative to basis B.
Coordinates of (4,2) in basis {(1,1),(1,−1)}?
(3,1).
Why isn't {e1,e2,(1,1)} a basis of R2?
It spans but is dependent, so coordinates aren't unique.
Why isn't {e1,e2} a basis of R3?
Independent but doesn't span; (0,0,1) is unreachable.
How does uniqueness for w=0 recover independence?
Only rep of 0 is all-zero coeffs, which IS the definition of independence.
What is the size of any basis equal to?
dimV.
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.
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 w ke do alag-alag representations hai: w=∑civi aur w=∑divi. Inko subtract karo to 0=∑(ci−di)vi milta hai. Ab independence kehta hai ki zero banane ka sirf ek tareeka hai — saare coefficients zero. Iska matlab ci=di, 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) in R2), 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,e2 in R3), to kuch vectors reach hi nahi hote. Toh size bilkul dimV 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.