Parent note padhne se pehle, tumhare paas symbols ka ek chhota toolbox hona chahiye. Neeche har symbol aur idea diya gaya hai jo parent use karta hai, bilkul zero se bana hua, ek aisi tartib mein jahan har cheez sirf usse pehle wali cheez pe depend karti hai.
Figure dekho: laal arrow origin (point (0,0)) se shuru hota hai aur uski tip point (x1,x2) par jaake rukti hai. Do kaali dashed legs "daayein" wali amount x1 aur "upar" wali amount x2 dikhati hain.
Woh special arrow jisme saare zeros hain, 0=(00), zero vector kehlata hai — iske paas koi length nahi hai aur yeh kahin point nahi karta. Isse yaad rakho: parent note ise eigenvector ke roop mein forbid karta hai, aur hum dekhenge kyun.
A ko vector x se multiply karne par ek naya vector Ax milta hai, row-by-row compute hota hai:
Ax=(acbd)(x1x2)=(ax1+bx2cx1+dx2).
Figure mein, kaala arrow input x hai; laal arrow output Ax hai. Dhyan do yeh alag direction mein point kar raha hai — machine ne ise ghuma diya. Eigenvector woh special input hai jahan kaala aur laal ek hi line par hote hain.
λ=−1: same length, flip hokar opposite direction mein point karta hai.
λ=0: zero vector mein collapse ho jaata hai.
Figure mein ek kaala arrow 2 se, −1 se, aur 0 se scale kiya gaya hai — teeno copies origin se guzarne wali same dashed line par rehti hain. Us line par rehna hi "sirf stretch, kabhi ghuma nahi" ka visual meaning hai, jo Ax=λx demand karta hai.
Parent note λI mein achanak I kyun use karta hai? Kyunki tum ek plain number ko matrix se subtract nahi kar sakte: expression "A−λ" meaningless hai — ek grid minus ek single number ka koi defined rule nahi hai. Lekin identity ko scale karna, λI, ek genuine matrix hai:
λI=(λ00λ).
Ab A−λI ek legal grid-minus-grid subtraction hai. Yahi ek wajah hai ki I appear hota hai.
Topic ko determinant ke zero hone ki care kyun hai? Zero area ka matlab hai parallelogram ek line par squash ho gaya — machine ne 2D ko 1D mein crush kar diya. Jab aisa hota hai machine singular hoti hai: yeh information destroy karti hai aur ise undo nahi kiya ja sakta. Poori story ke liye Determinants dekho.
Left: ek normal matrix — uske do column arrows (kaale) ek laal parallelogram span karte hain jiska real area hai. Right: ek singular matrix — columns line up ho gaye hain, laal parallelogram ek segment mein flatten ho gaya hai, area =0.
Parent ka Step 3 kehta hai: "Mx=0 ka ek nonzero solution hai iffM singular hai." Yahan simple words mein kyun:
Agar M undo kiya ja sakta (invertible), toh undo-machine M−1 ko Mx=0 ke dono sides par apply karne se x=0 milta hai — sirf boring zero arrow solution hai.
Toh ek nonzero solution tab hi exist kar sakta hai jab M undo nahi kiya ja sakta — yaani M singular hai — yaani detM=0.
Yeh chain, "nonzero solution ⇔ singular ⇔ determinant zero," woh engine hai jo eigen-equation ko ek solvable polynomial mein badal deta hai. Aur details Null Space and Rank mein hain.
Ek 2×2 matrix ke liye, det(A−λI) ek degree-2 polynomial nikalta hai (iska highest power λ2 hai); n×n ke liye iska degree n hota hai. Uske roots eigenvalues hain. Toh poori hunt ek school-algebra task tak reduce ho jaati hai: ek polynomial ke roots dhundho.
Topic ko inki zaroorat kyun hai: kuch real matrices (jaise 90∘ rotation) har arrow ko ghuma deti hain, toh koi bhi real arrow kabhi apni line par nahi rehta. Tab characteristic polynomial, jaise λ2+1=0, ke koi real roots nahi hote — lekin iske complex roots±i hote hain. Complex λ allow karne se guarantee hoti hai ki treasure map mein hamesha khazana milega.