Intuition The big idea (WHY this exists)We are used to vectors as arrows or columns of numbers in R n \mathbb{R}^n R n same arithmetic rules (add two things, scale a thing) show up for objects that look nothing like arrows: functions , polynomials , matrices , even solutions of a differential equation . A vector space is a promise : "these objects obey 8 algebra rules." Once an object keeps that promise, every theorem of linear algebra (basis, dimension, linear maps, eigenvalues) instantly applies. So we abstract — strip away "arrow-ness" — and keep only the rules that make linear algebra work .
A vector space over a field F \mathbb{F} F R \mathbb{R} R C \mathbb{C} C V V V
Addition + : V × V → V + : V \times V \to V + : V × V → V Scalar multiplication ⋅ : F × V → V \cdot : \mathbb{F} \times V \to V ⋅ : F × V → V
satisfying 8 axioms for all u , v , w ∈ V u,v,w \in V u , v , w ∈ V a , b ∈ F a,b \in \mathbb{F} a , b ∈ F
The two operations must be closed : adding two vectors gives a vector in V V V , scaling a vector stays in V V V . This is hidden axiom #0 and the one beginners forget.
WHY exactly these? Each axiom is the minimum needed so that algebraic manipulations you do automatically ("collect like terms", "factor out a scalar") are legal . Nothing more, nothing less.
Nothing about "0 v = 0 0v=\mathbf{0} 0 v = 0 prove it, using only the 8 axioms — this is the payoff of abstraction.
0 ⋅ v = 0 0\cdot v = \mathbf{0} 0 ⋅ v = 0 v v v Step 1. 0 ⋅ v = ( 0 + 0 ) ⋅ v 0\cdot v = (0+0)\cdot v 0 ⋅ v = ( 0 + 0 ) ⋅ v Why? 0 = 0 + 0 0=0+0 0 = 0 + 0 F \mathbb{F} F Step 2. = 0 ⋅ v + 0 ⋅ v = 0\cdot v + 0\cdot v = 0 ⋅ v + 0 ⋅ v Why? Axiom 8 (distributive over scalar sum).
Step 3. Let w = 0 ⋅ v w = 0\cdot v w = 0 ⋅ v w = w + w w = w+w w = w + w − w -w − w w + ( − w ) = ( w + w ) + ( − w ) w+(-w) = (w+w)+(-w) w + ( − w ) = ( w + w ) + ( − w ) 0 = w + ( w + ( − w ) ) = w + 0 = w \mathbf{0} = w + (w+(-w)) = w+\mathbf{0} = w 0 = w + ( w + ( − w )) = w + 0 = w Why? Axioms 2, 4, 3. Hence w = 0 w=\mathbf{0} w = 0 ■ \blacksquare ■
( − 1 ) ⋅ v = − v (-1)\cdot v = -v ( − 1 ) ⋅ v = − v Step 1. v + ( − 1 ) v = 1 ⋅ v + ( − 1 ) v v + (-1)v = 1\cdot v + (-1)v v + ( − 1 ) v = 1 ⋅ v + ( − 1 ) v Step 2. = ( 1 + ( − 1 ) ) v = 0 ⋅ v = (1 + (-1))v = 0\cdot v = ( 1 + ( − 1 )) v = 0 ⋅ v Step 3. = 0 = \mathbf{0} = 0 Why this matters? So ( − 1 ) v (-1)v ( − 1 ) v v v v − v -v − v ■ \blacksquare ■
These proofs never used arrows or coordinates — they work for functions, matrices, anything obeying the axioms.
Worked example 1. PolynomialsP n P_n P n ≤ n \le n ≤ n V = { a 0 + a 1 x + ⋯ + a n x n } V = \{a_0 + a_1x + \dots + a_n x^n\} V = { a 0 + a 1 x + ⋯ + a n x n } Why a vector space? Sum of two degree-≤ n \le n ≤ n ≤ n \le n ≤ n closed ), zero poly is 0 \mathbf 0 0 R \mathbb{R} R Dimension = n + 1 = n+1 = n + 1 , basis { 1 , x , x 2 , … , x n } \{1, x, x^2, \dots, x^n\} { 1 , x , x 2 , … , x n }
Worked example 2. MatricesM m × n ( R ) M_{m\times n}(\mathbb{R}) M m × n ( R ) 0 \mathbf 0 0 Dimension = m n = mn = mn , basis { E i j } \{E_{ij}\} { E ij } i j ij ij
Worked example 3. Continuous functionsC [ 0 , 1 ] C[0,1] C [ 0 , 1 ] V = V= V = f : [ 0 , 1 ] → R f:[0,1]\to\mathbb{R} f : [ 0 , 1 ] → R ( f + g ) ( x ) = f ( x ) + g ( x ) (f+g)(x)=f(x)+g(x) ( f + g ) ( x ) = f ( x ) + g ( x ) ( a f ) ( x ) = a f ( x ) (af)(x)=a\,f(x) ( a f ) ( x ) = a f ( x ) Why closed? Sum & scalar multiple of continuous functions are continuous.
Dimension = ∞ =\infty = ∞ — no finite basis! Yet still a vector space.
Worked example 4. Solution set of a homogeneous linear ODE{ y : y ′ ′ + y = 0 } \{y : y'' + y = 0\} { y : y ′′ + y = 0 } y 1 , y 2 y_1,y_2 y 1 , y 2 a y 1 + b y 2 a y_1 + b y_2 a y 1 + b y 2 linearity ). 0 \mathbf 0 0 Dimension = 2 =2 = 2 , basis { sin x , cos x } \{\sin x, \cos x\} { sin x , cos x }
C \mathbb{C} C R \mathbb{R} R real scalars. Basis { 1 , i } \{1, i\} { 1 , i } dimension 2 2 2 . Same set C \mathbb C C C \mathbb C C 1 1 1 the dimension depends on the field!
Common mistake "Any set with a '+' is a vector space."Why it feels right: addition looks universal. Where it breaks: V = R > 0 V=\mathbb{R}_{>0} V = R > 0 + + + no zero vector (0 ∉ V 0\notin V 0 ∈ / V Fix: check all axioms incl. closure and the existence of 0 , − v \mathbf 0,-v 0 , − v
0 \mathbf 0 0 Why it feels right: in R n \mathbb{R}^n R n Truth: 0 \mathbf 0 0 v + 0 = v v+\mathbf 0 = v v + 0 = v C [ 0 , 1 ] C[0,1] C [ 0 , 1 ] zero function ; in M 2 × 2 M_{2\times2} M 2 × 2 zero matrix . Fix: identify 0 \mathbf 0 0
Common mistake "Vector spaces must be finite-dimensional."Why it feels right: every example in school is. Truth: C [ 0 , 1 ] C[0,1] C [ 0 , 1 ] Fix: dimension is a property , not part of the definition.
Common mistake Forgetting closure.Lines through the origin are subspaces; a line not through origin is not (no 0 \mathbf 0 0 0 ⋅ v 0\cdot v 0 ⋅ v Fix: test 0 ∈ V \mathbf 0 \in V 0 ∈ V
Recall Feynman: explain to a 12-year-oldImagine LEGO. You can snap two builds together (add) and make a build twice as big (scale). A "vector space" is any box of LEGO where these two moves always give you something still in the box , and there's an "empty build" (the zero) and you can always "undo" a build. Arrows are one box. Recipes (functions), score-sheets (matrices), and even music waves are other boxes that follow the exact same snap-and-scale rules — so the same tricks work on all of them!
Mnemonic Remember the 8 axioms"CAZI" for addition (C ommute, A ssociate, Z ero, I nverse) and "ICDD" for scalars (I dentity 1 v = v 1v=v 1 v = v C ompatible a ( b v ) = ( a b ) v a(bv)=(ab)v a ( b v ) = ( ab ) v D istribute over vectors, D istribute over scalars). "CAZI scalars are ICDD."
How many axioms define a vector space, and what is "axiom #0"? 8 axioms; axiom #0 = closure under addition and scalar multiplication.
State the four additive (group) axioms. Commutativity, associativity, existence of zero vector, existence of additive inverses.
Prove 0 ⋅ v = 0 0\cdot v=\mathbf 0 0 ⋅ v = 0 0 v = ( 0 + 0 ) v = 0 v + 0 v 0v=(0+0)v=0v+0v 0 v = ( 0 + 0 ) v = 0 v + 0 v ; subtract
0 v 0v 0 v from both sides to get
0 = 0 v \mathbf 0=0v 0 = 0 v .
Why is ( − 1 ) v = − v (-1)v=-v ( − 1 ) v = − v v + ( − 1 ) v = ( 1 − 1 ) v = 0 v = 0 v+(-1)v=(1-1)v=0v=\mathbf 0 v + ( − 1 ) v = ( 1 − 1 ) v = 0 v = 0 , so
( − 1 ) v (-1)v ( − 1 ) v is the additive inverse of
v v v .
Give a vector space that is NOT R n \mathbb{R}^n R n e.g.
P n P_n P n (polynomials),
M m × n M_{m\times n} M m × n (matrices),
C [ 0 , 1 ] C[0,1] C [ 0 , 1 ] (continuous functions), ODE solution spaces.
Dimension of P n P_n P n n + 1 n+1 n + 1 ; basis
{ 1 , x , … , x n } \{1,x,\dots,x^n\} { 1 , x , … , x n } .
Dimension of M m × n M_{m\times n} M m × n m n mn mn , basis the elementary matrices
E i j E_{ij} E ij .
Why is C [ 0 , 1 ] C[0,1] C [ 0 , 1 ] Sums/scalar multiples of continuous functions stay continuous; it is infinite-dimensional.
What is dim R C \dim_{\mathbb R}\mathbb C dim R C dim C C \dim_{\mathbb C}\mathbb C dim C C 2 2 2 (basis
{ 1 , i } \{1,i\} { 1 , i } ) vs
1 1 1 (basis
{ 1 } \{1\} { 1 } ) — dimension depends on the field.
Why is the line y = x + 1 y=x+1 y = x + 1 It misses
0 \mathbf 0 0 and isn't closed under scaling.
Closure under + and scaling
Vector space V over field F
Theorem minus1 v equals minus v
All linear algebra theorems apply
Intuition Hinglish mein samjhoDekho, school mein humne vector ko ek "arrow" ya numbers ki column (R n \mathbb{R}^n R n add karo, aur ek cheez ko scale (number se multiply) karo. Agar koi bhi set in do operations ke saath 8 axioms follow karta hai, to wo ek vector space ban jaata hai — chahe wo arrows ho ya nahi.
Ye abstraction kyun important hai? Kyunki ek baar koi object axioms maan le, to linear algebra ke saare theorems — basis, dimension, eigenvalues, linear maps — automatically apply ho jaate hain. Isliye polynomials, matrices, continuous functions C [ 0 , 1 ] C[0,1] C [ 0 , 1 ] y ′ ′ + y = 0 y''+y=0 y ′′ + y = 0 P 2 P_2 P 2 { 1 , x , x 2 } \{1, x, x^2\} { 1 , x , x 2 } y ′ ′ + y = 0 y''+y=0 y ′′ + y = 0 { sin x , cos x } \{\sin x, \cos x\} { sin x , cos x }
Ek important baat: 0 \mathbf{0} 0 closure sabse pehle check karo: agar zero element andar nahi hai ya add karke bahar nikal jaate ho (jaise line y = x + 1 y=x+1 y = x + 1 0 ⋅ v = 0 0\cdot v=\mathbf 0 0 ⋅ v = 0 ( − 1 ) v = − v (-1)v=-v ( − 1 ) v = − v
