4.5.27 · D1 · Maths › Linear Algebra (Full) › Linear transformations — definition, kernel, image
Ek linear transformation ek aisi machine hai jo poore arrows (vectors) ko idhar-udhar move karti hai, lekin do vaade nibhate hue: pehle add karke move karna, aur pehle move karke add karna — dono ek hi result dete hain; aur ek arrow ko stretch karna matlab uska output bhi utna hi stretch hoga. Parent page ki baaki sab cheezein — kernel, image, rank, nullity — bas yeh poochh rahi hain ki kaun se arrows zero mein crush ho jaate hain aur kaun se arrows machine produce kar sakti hai .
Parent note padhne se pehle, symbols ka ek poora toolbox quietly assume kiya jaata hai. Yeh page har ek cheez ko zero se build karti hai, ek aisi order mein jahan har idea sirf usse pehle wali cheezoon par tikaa ho.
Ek vector ek aisa arrow hai jiske paas ek length aur ek direction hoti hai, jo ek fixed point se shuru hota hai jise origin kehte hain. Coordinates mein hum ise numbers ki list ke roop mein likhte hain, jaise v = ( 3 , 2 ) , matlab "daayein 3 jaao aur upar 2 jaao".
kyun arrows hain
Pair ( 3 , 2 ) aur origin se 3 -daayein-2 -upar wale point tak jaane wala arrow — dono ek hi object ke do naam hain. Coordinates se hum calculate kar sakte hain; arrow se hum dekh sakte hain.
Figure s01 bilkul yahi dikhata hai: lavender arrow v = ( 3 , 2 ) origin (dark dot) se coral point tak jaata hai. Dashed grey lines follow karo — neeche "daayein 3 " aur phir side se "2 upar" — taaki dekh sako kaise do numbers us arrow ko spell out karte hain. Origin wo jagah hai jahan is poore page ka har vector start hota hai.
Yeh isliye zaroori hai kyunki ek linear transformation ek aisi machine hai jiske inputs aur outputs arrows hote hain . Arrows nahin, toh transform karne ko kuch nahin.
Arrows ko sirf do tareekon se combine kiya ja sakta hai, aur ek linear map in dono tareekon ko respect karne se hi define hoti hai.
Definition Vectors ko add karna (tip-to-tail)
u + v add karne ke liye: u draw karo, phir v ko u ki tip se start karo. Origin se final tip tak ka arrow u + v hai. Coordinates mein bas matching entries add karo: ( a , b ) + ( c , d ) = ( a + c , b + d ) .
Definition Vector ko scale karna
c v scale karne ke liye (c ek plain number hai): v ko c factor se stretch karo. Agar c = 2 toh arrow double ho jaata hai; agar c = 2 1 toh aadha ho jaata hai; agar c = − 1 toh flip ho jaata hai aur opposite direction mein point karta hai. Coordinates mein: c ( a , b ) = ( c a , c b ) .
Figure s02 dono moves dikhata hai. Left side par, lavender u aur mint v tip-to-tail rakhe gaye hain, aur coral arrow u + v path close karta hai — woh coral arrow hi sum hai . Right side par, ek lavender arrow w butter-coloured 2 w ban jaata hai (double lamba, same direction) aur coral − w (same length, opposite direction mein flip). Yahi do cheezein hain jo arrows ke saath karna allowed hai.
Intuition Exactly yahi do kyun?
Arrows ki ek space in do moves se build hoti hai — har arrow jo tum reach kar sako woh doosron ki koi scaling-and-adding hai. Toh ek machine jo "structure respect kare" ko sirf yeh do operations respect karni hogi. Exactly yahi additivity (T ( u + v ) = T ( u ) + T ( v ) ) aur homogeneity (T ( c v ) = c T ( v ) ) kehte hain.
Definition Scalar aur field
F
Ek scalar (upar wala letter c ) ek plain number hai jisse tum ek arrow ko multiply karte ho. Field F bas woh pool hai jin scalars se draw kiye jaate hain — numbers ka woh collection jisse tum scale kar sakte ho, aur jiske andar add, subtract, multiply aur divide (0 ke alawa kisi bhi cheez se) kar sako aur pool ke andar raho. Parent note likhta hai "V , W vector spaces over the field F " aur "scalars c ∈ F "; woh F woh jagah hai jahan c rehta hai. Is page par sab kuch ke liye F = R hai, yaani real numbers, toh tum safely "c ∈ F " ko "c koi bhi real number hai" padh sakte ho. Yeh sirf isliye matter karta hai kyunki additivity aur homogeneity F ke saare scalars ke liye stated hain — rules pool ke har number ke liye hold karne chahiye, sirf kuch ke liye nahin.
Definition Vector space aur
R n
Ek vector space un saare arrows ka collection hai jo tum upar wali do operations se build kar sakte ho. Hum spaces ko capital letters V (input space) aur W (output space) se naam dete hain.
Symbol R 2 ka matlab hai "saare arrows jo 2 real numbers se describe hote hain" — flat plane. R 3 yaani 3 numbers — ordinary space. R n n numbers tak generalise hota hai.
∈ , ⊆ , { } padhna
v ∈ V padho "v set V ka member hai " — arrow v space V mein rehta hai.
{ x : condition } padho "un saare x ka set jaise ki condition hold kare". Colon ka matlab "such that" hai.
A ⊆ B padho "A B ke andar contained hai " — A ka har member B ka bhi member hai.
Topic ko yeh kyun chahiye: kernel likha jaata hai ker T = { v ∈ V : T ( v ) = 0 } — tum literally woh line nahin padh sakte jab tak ∈ , colon, aur braces nahin jaante. Parent note bhi insist karta hai "ker T ⊆ V " — woh ⊆ ek common galti ka poora point hai.
Definition Function (map)
Ek function ek aisa rule hai jo har input leke exactly ek output deta hai. Hum T : V → W likhte hain matlab "T ek aisa rule hai jo V se ek arrow khaata hai aur W mein ek arrow produce karta hai". Notation T ( v ) ka matlab hai "output jab T , v khaata hai".
Intuition Machine wali picture
T ko ek box socho: ek arrow left se andar aata hai (V side), ek possibly alag arrow right se baahir aata hai (W side). Notation ka arrow → direction dikhata hai: input space se output space ki taraf.
Figure s03 wohi box hai: lavender arrow "input v in V " butter-coloured T -box mein jaata hai, aur coral arrow "output T ( v ) in W " doosri side se baahir aata hai. Neeche ka label T : V → W poori picture ko naam deta hai. Yeh image dhyan mein rakho — kernel aur image bas yeh sawaal hain ki is box mein kaun se arrows andar aur baahir jaate hain.
Topic ko yeh kyun chahiye: "linear transformation" ek special kind of function hai. Pehle jaanna zaroori hai function kya hota hai, phir hi un do fairness rules ko add kiya ja sakta hai jo ise linear banati hain.
0
Zero vector 0 zero length ka arrow hai — yeh exactly origin par baitha hai aur kahin point nahin karta. Ise add karne se kuch nahin badalta: v + 0 = v .
Definition Basis aur basis vectors
e i
Ek basis arrows ka woh smallest set hai jisse har doosra arrow scaling aur adding ke zariye build kiya ja sake. R 2 mein standard basis hai e 1 = ( 1 , 0 ) (ek step daayein) aur e 2 = ( 0 , 1 ) (ek step upar). Toh ( 3 , 2 ) = 3 e 1 + 2 e 2 .
Figure s04 arrow ( 3 , 2 ) ko basis se build karta hai: chhota mint arrow e 1 aur chhota coral arrow e 2 do building blocks hain. Dashed mint arrow hai "3 steps of e 1 ", dashed coral arrow uski tip par stacked hai "2 steps of e 2 ", aur dono milke exactly lavender ( 3 , 2 ) par land karte hain. Plane mein har arrow aisi hi kisi recipe jaisi hoti hai — yahi matlab hai "ek basis sab kuch build karta hai".
Intuition Basis poore topic ka secret kyun hai
Parent note ka punchline — "ek linear map completely determined hoti hai is baat se ki woh basis vectors ke saath kya karta hai" — tab hi samajh aata hai jab tum jaante ho ki e 1 , e 2 sab kuch span karte hain. Kyunki koi bhi x = x 1 e 1 + ⋯ + x n e n , do rules force karti hain T ( x ) = x 1 T ( e 1 ) + ⋯ + x n T ( e n ) . Kuch basis arrows ke outputs jaano, aur tum machine ka action har arrow par jaante ho. Change of basis dekho jab tum alag basis choose karo.
Kuch arrows ka span woh har arrow hai jise tum unhe scale aur add karke reach kar sako. span {( 1 , − 2 , 1 )} direction ( 1 , − 2 , 1 ) mein origin se guzarne wali poori line hai.
Ek space ki dimension uske liye basis mein arrows ki sankhya hai — independent directions ka count. Ek line ki dimension 1 hoti hai, ek plane ki 2 , ordinary space ki 3 .
Ek subspace ek chhota vector space hai jo ek bade ke andar baitha hota hai, origin se guzarta hai aur do operations ke under closed hota hai (members ko add ya scale karne par tum andar hi rehte ho). Origin se guzarne wali ek line ya plane R 3 ka subspace hai.
Topic ko yeh kyun chahiye: kernel aur image hamesha subspaces hoti hain, aur rank/nullity bas unki dimensions hain. Rank–Nullity Theorem aur Column space and null space dekho jahan yeh cheezein main event ban jaati hain.
Ek matrix A numbers ka ek rectangular grid hai. m × n padho "m rows, n columns". Iske columns vectors hain; T ( e 1 ) , T ( e 2 ) , … ko side by side columns ke roop mein stack karne se T ki matrix build hoti hai.
A x columns ka weighted sum kyun hai
Yeh yaad karne ke liye koi nayi rule nahin hai — yeh un do cheezoon se follow hoti hai jo humne pehle se build ki hain. Input ko basis mein likho: x = x 1 e 1 + ⋯ + x n e n (Section 5). Kyunki A ek linear map T ki matrix hai, aur A ke columns exactly T ( e 1 ) , … , T ( e n ) hain (upar wale box ki definition), do linearity rules apply karo:
A x = T ( x ) = T ( ∑ i x i e i ) = additivity ∑ i T ( x i e i ) = homogeneity ∑ i x i T ( e i ) = ∑ i x i ( column i ) .
Pehle additivity sum ko alag karta hai, phir homogeneity har scalar x i ko bahar kheencha hai — wohi do vaade Section 2 se, kuch nahin zyada. Toh "A x = columns ka weighted sum" bas basis-expansion plus linearity hai.
Topic ko yeh kyun chahiye: parent claim karta hai "image = column space" exactly isliye kyunki har output A x columns ki scaling-and-adding hai. A x ki mechanics Matrix multiplication mein rehti hain. Injective surjective bijective (the "one-to-one / onto" words) aur Eigenvalues and eigenvectors (special arrows jinhein ek map sirf stretch karta hai) ke saath milke, yeh foundations toolbox complete karte hain.
Ab jab arrows, maps, subspaces aur dimension build ho gaye hain, parent note ke chaar headline symbols plain reading ban jaate hain.
Definition Kernel operator
ker T
ker T (padho "ker of T ", short for kernel ) inputs ke ek set ka naam hai: V mein saare arrows jo machine T zero vector par crush kar deti hai.
ker T = { v ∈ V : T ( v ) = 0 W } .
Picture: Figure s03 ke machine box mein wapas jaao, yeh har woh arrow hai jo right side se baahir aate hue zero length mein flatten ho jaata hai. Yeh hamesha input space V mein rehta hai, aur hamesha ek subspace hota hai (origin se guzarne wala ek flat piece).
Definition Image notation
im T
im T (padho "image of T ", T ( V ) bhi likhte hain, "T applied to all of V ") outputs ke ek set ka naam hai: har woh arrow jo machine actually produce kar sakti hai.
im T = T ( V ) = { T ( v ) : v ∈ V } ⊆ W .
Picture: har possible input arrow ko box se guzaaro aur har output collect karo — woh collected pile, W mein rehne wala ek subspace, image hai.
ker = k ill ho gaye inputs (V mein); im = m ade outputs (W mein); nullity killed count karta hai, rank made count karta hai.
Kernel ker T inputs killed
Right side hide karo aur khud test karo. Agar koi shaky lage, toh upar woh section dobara padho.
T : V → W mein arrow tumhe kya batata hai?T arrows ko input space V se output space W mein bhejtaa hai.
Zor se padho: v ∈ V . "Vector v space V ka member hai."
Zor se padho: { v : T ( v ) = 0 } . "Un saare v ka set jaise ki T ( v ) zero ke barabar ho."
Zor se padho: ker T ⊆ V . "Kernel input space V ke andar contained hai."
Har vector space jo do operations allow karta hai woh hain ___ aur ___. vectors ko add karna (tip-to-tail) aur kisi number se scale karna.
Field F kya hai? Un scalars ka pool jinse scale karna allowed hai; yahan F = R , real numbers.
Zero vector, ek picture ke roop mein, kya hai? Zero length ka ek arrow jo origin par baitha hai, kahin point nahin karta.
R 2 mein e 1 aur e 2 kya hain?e 1 = ( 1 , 0 ) aur e 2 = ( 0 , 1 ) , standard basis (ek daayein, ek upar).
T ( e i ) jaanna, T ko har jagah determine kyun karta hai?Koi bhi x = ∑ x i e i , toh do rules se T ( x ) = ∑ x i T ( e i ) .
A x , A ke columns ka weighted sum kyun hai?x = ∑ x i e i expand karo, phir additivity+homogeneity deti hain A x = ∑ x i T ( e i ) = ∑ x i ( column i ) .
ker T kya naam deta hai, aur yeh kahan rehta hai?Un inputs ka set jo zero mein crush ho jaate hain; yeh input space V mein rehta hai.
im T (yaani T ( V ) ) kya naam deta hai, aur yeh kahan rehta hai?Un saare reachable outputs ka set; yeh output space W mein rehta hai.
Rank aur nullity kin do sets ki ___ hain? Dimensions — im T ki rank, ker T ki nullity.
Ek space ki dimension kya hoti hai? Basis mein arrows ki sankhya — independent directions ka count.
Koi set subspace kab hota hai? Jab usme origin ho aur woh adding aur scaling ke under khud ke andar closed ho.