Parent note on cofactor expansion padhne se pehle, aapko har woh symbol aana chahiye jo woh use karta hai. Neeche, har ek idea pichle ke upar build hota hai — upar se neeche padho, kuch bhi skip mat karo.
Ise picture karo ek spreadsheet ki tarah: rows ko upar se neeche 1,2,…,n number karo aur columns ko left se right 1,2,…,n. Figure s01 hamare example matrix par in row aur column indices ko label karta hai.
Topic ko iske zaroorat kyun hai: determinant sirf square matrices ke liye defined hai, aur general formulas 1,2,…,n par run karte hain — isliye koi bhi sum samajhne se pehle aapko pata hona chahiye ki n kya count karta hai.
Ise ek street address ki tarah padho: a23 matlab "row 2 par jao, phir column 3". Upar wali matrix mein, a23=5 aur a31=1.
Topic ko iske zaroorat kyun hai: parent note ke har formula mein specific entries aij multiply hoti hain; aapko grid mein se exact number instantly nikalna aana chahiye.
Humne abhi tak yeh nahi bataya ki badi matrix ke liye detAkaise compute karein — yahi parent note ka poora point hai. Yahan hum sirf symbol ka matlab fix kar rahe hain taaki baad ke formulas jaise detA=… padhe jaayein "number detA equals …". Aane wale sections (§4, §5) chote cases ke liye actual recipes dete hain.
Topic ko iske zaroorat kyun hai: parent note seedha "detA=∑…" se shuru hota hai — aap woh line tab tak nahi padh sakte jab tak det ka matlab kuch na ho aapke liye.
Topic ko iske zaroorat kyun hai: expansion formula detA=∑j=1naijCij iske siwa kuch nahi hai "ek line ke saath chalo aur pieces add karo". ∑ ke bina aap ise padh hi nahi sakte.
Parent note jo bhi karta hai woh recurse karta hai neeche jab tak baaki matrices tiny na ho jaayein. Isliye humein sabse chote cases nail karne hain jahan det directly defined hai, koi recipe nahi chahiye.
Topic ko iske zaroorat kyun hai: cofactor expansion ek 3×3 ko 2×2 pieces mein todta hai, aur ek 4×4 ko 3×3 se 2×2 se 1×1 mein. Yeh do tiny cases recursion ka floor hain — recipe yahan rukti hai kyunki yeh directly defined hain.
Topic ko iske zaroorat kyun hai: minor woh chota determinant hai jo expansion ke har step par produce hota hai. Yahi woh hai jis se recursion physically hoti hai — ek 3×3 minor-hunt 2×2 leftovers deta hai, jo 1×1 leftovers dete hain.
−1 ko power tak raise karne se yeh kyun hota hai? Kyunki −1 ko even baar multiply karne par +1 milta hai, aur odd baar par −1. Isliye i+j ki parity (even-ya-odd-ness) hi sirf matter karti hai.
Topic ko iske zaroorat kyun hai: is sign ke bina chote determinants galat number mein add hote. Yeh sign ek gehra fact encode karta hai (permutation parity, Leibniz formula for determinants se) — lekin computing ke liye, yeh simply checkerboard hai.
Pehle ek particular row fix karo, uska number i rakhte hain (koi bhi single value 1 se n tak jo aap choose karo). Phirj ko us row ke across sweep karo. Ab parent formula ka har piece defined hai:
detA=§4 add upj=1∑n§2 entryaij§7 sign(−1)i+j§6 minorMij(row i fixed)
Zor se padho: "Ek row i chuno. Us row ke saath chalo; har entry ke liye, uske checkerboard sign aur uske minor se multiply karo; sab add karo."