Diagonal matrix: har off-diagonal entry zero hai — nonzero numbers sirf wahan appear karte hain jahan row index column index ke barabar hota hai (aij=0 jab bhi i=j).
KYA: har output entry (i,j) = row i of A · column j of B. KYUN: yahi definition hai jo composition se force hoti hai, (AB)x=A(Bx).
AB=[1⋅0+2⋅(−1)3⋅0+4⋅(−1)1⋅1+2⋅23⋅1+4⋅2]=[−2−4511]
Recall Solution
BA=[0⋅1+1⋅3−1⋅1+2⋅30⋅2+1⋅4−1⋅2+2⋅4]=[3546]
Kyunki [−2−4511]=[3546], clearly AB=BA. Actions ka order matter karta hai.
Recall Solution
KYUN S guaranteed symmetric hai. Usse transpose karo aur do facts use karo — transpose addition par distribute hota hai, (X+Y)⊤=X⊤+Y⊤, aur (A⊤)⊤=A:
S⊤=(21(A+A⊤))⊤=21(A⊤+(A⊤)⊤)=21(A⊤+A)=S.
Kyunki S⊤=S, Ssymmetric hai — chahe A kuch bhi ho.
KYUN K guaranteed skew hai. Same move, sign par dhyan rakhte hue:
K⊤=(21(A−A⊤))⊤=21(A⊤−A)=−21(A−A⊤)=−K.
Kyunki K⊤=−K, Kskew-symmetric hai (aur isliye uska diagonal zero hona chahiye, kyunki kii=−kii).
Ab numbers.A⊤=[4268].
S=21[88816]=[4448],K=21[04−40]=[02−20]
Check: S+K=[4628]=A ✅, aur K ka zero diagonal ✅ (bilkul jaisa proof ne predict kiya tha).
Recall Solution
(AB)⊤=[−25−411].
B⊤=[01−12],A⊤=[1234], isliye
B⊤A⊤=[0⋅1+(−1)⋅21⋅1+2⋅20⋅3+(−1)⋅41⋅3+2⋅4]=[−25−411](AB)⊤ se match karta hai. Order reverse hua — socks-and-shoes.
Part 1. Lo A=[1000],B=[0001]. (AB)ij=∑kaikbkj use karte hue (row i of A ko column j of B se dot karo, legal kyunki inner dims 2=2):
AB=[1⋅0+0⋅00⋅0+0⋅01⋅0+0⋅10⋅0+0⋅1]=[0000]
Phir bhi na A zero matrix hai, na B — zero divisors exist karte hain. (Yahan BA bhi 0 hota hai, isliye yeh pair prove nahi karta ki BA nonzero ho sakta hai.)
Part 2 — edge case. Lo A=[0010],B=[1000].
KYUN yeh:A pehle column ko kill karta hai aur doosre ko upar shift karta hai; B sirf pehle column ko rakhta hai. Wahi summation rule (AB)ij=∑kaikbkj se entry by entry compute karte hue:
AB=[0⋅1+1⋅00⋅1+0⋅00⋅0+1⋅00⋅0+0⋅0]=[0000]
Lekin order swap karne par, (BA)ij=∑kbikakj se:
BA=[1⋅0+0⋅00⋅0+0⋅01⋅1+0⋅00⋅1+0⋅0]=[0010]=0
Toh AB=0 yeh definitely force nahi karta ki BA=0 bhi ho. AB=0 se sirf yeh conclude ho sakta hai: A ya B mein se kisi ke baare mein bhi akele kuch nahi keh sakte.
Recall Solution
N2=[0⋅0+1⋅000⋅1+1⋅00]=[0000]
Ek linear map ke roop mein, Ny-axis ko x-axis par bhejta hai aur x-axis ko 0 par. Isse do baar apply karo: sab kuch pehle x-axis par land karta hai, phir x-axis 0 par squash ho jaata hai — yahi exactly k=2 ke saath nilpotency hai.
Neeche di figure padhna (caption: "N=[[0,1],[0,0]] is nilpotent: N2=0"). Horizontal line x-axis hai, vertical line y-axis hai (dono navy mein drawn hain). Orange arrow hai e1=[10], unit vector x-axis ke along; violet arrow hai e2=[01], unit vector y-axis ke upar. Magenta arrow imageNe2 dikhata hai: yeh x-axis ke along flat lie karta hai aur exactly e1 par land karta hai, kyunki N[01]=[10]. Origin par akela navy dotNe1=[00] mark karta hai — x-axis vector origin par crush ho jaata hai. Toh ek application se poora plane x-axis par flatten ho jaata hai, aur doosra application us line ko 0 par collapse kar deta hai: picture bilkul yahi statement hai N2=0.
Recall Solution
Orthogonal ka matlab hai Q⊤Q=I. Yahan Q⊤=21[1−111], toh
Q⊤Q=21[1−111][11−11]=21[2002]=[1001]=I
✅ orthogonal. Uske columns unit length ke hain aur perpendicular hain; yeh ek 45∘ rotation hai (yeh lengths aur angles preserve karta hai). Dekhna Eigenvalues and Eigenvectors ka parent ka link, ki aisi matrices kyun special hain.
KYA: variables hata do — matrix hi system hai (parent ka core idea).
A=[2113],b=[510].2×2 ke liye, A−1=detA1[d−c−ba] (from Determinant and Inverse of a Matrix). Yahan detA=2⋅3−1⋅1=5=0, toh A non-singular hai.
A−1=51[3−1−12],x=51[3−1−12][510]=51[515]=[13]
Toh x=1,y=3. Check: 2(1)+3=5 ✅, 1+3(3)=10 ✅. Systems of Linear Equations se connect hota hai.
Recall Solution
v hai 2×1, v⊤ hai 1×2.
v⊤v: (1×2)(2×1)=1×1 — ek single number, dot product12+22=5 (squared length).
vv⊤: (2×1)(1×2)=2×2 — ek full matrix:
vv⊤=[12][12]=[1224]
Yeh symmetric hai (jaisa vv⊤ hamesha hota hai, kyunki (vv⊤)⊤=vv⊤). Note: yeh yahan projection nahi hai: ek projector P ko P2=P satisfy karna chahiye, lekin (vv⊤)2=(v⊤v)vv⊤=5vv⊤=vv⊤. Sirf v⊤v se divide karne par — yaani v⊤vvv⊤, jo ek unit direction use karta hai — v ke through line par genuine projection milti hai.
Recall Solution
Proof:ABC=(AB)C group karo. Phir (ABC)⊤=((AB)C)⊤=C⊤(AB)⊤=C⊤B⊤A⊤, reversal law do baar apply karke.
Check.AB=[1213], ABC=[2413], toh (ABC)⊤=[2143].
C⊤B⊤A⊤=[2001][1101][1021]=[2101][1021]=[2143] ✅
Maano M=A⊤A. Uska transpose lo aur reversal law use karo:
M⊤=(A⊤A)⊤=A⊤(A⊤)⊤=A⊤A=M.
Kyunki M⊤=M, M symmetric hai — chahe A kuch bhi ho. (Humne (A⊤)⊤=A use kiya.)
Recall Solution
Step 1 — trace ko double sum ke roop mein likho. Definition se diagonal entry (AB)ii hai row i of A dotted with column i of B, yaani (AB)ii=∑kaikbki. Diagonal par sum karo:
tr(AB)=∑i(AB)ii=∑i∑kaikbki.Step 2 — dono sums ka order swap karo.i aur k dono same finite index set par run karte hain, aur har term aikbki sirf ek ordinary number hai; finite numbers ka sum kisi bhi order mein add kiya ja sakta hai (isliye interchange legal hai — koi limits, koi convergence worries nahi). Toh
∑i∑kaikbki=∑k∑iaikbki.Step 3 — rename karo aur BA pehchano. Kyunki numbers commute karte hain, aikbki=bkiaik. i par inner sum padhte hue: ∑ibkiaik exactly row k of B dotted with column k of A hai, yaani (BA)kk. Isliye
∑k∑ibkiaik=∑k(BA)kk=tr(BA).
Steps 1–3 chain karke milta hai tr(AB)=tr(BA).
Check.AB=[1⋅0+2⋅13⋅0+4⋅11⋅1+2⋅03⋅1+4⋅0]=[2413], toh tr(AB)=2+3=5.
BA=[0⋅1+1⋅31⋅1+0⋅30⋅2+1⋅41⋅2+0⋅4]=[3142], toh tr(BA)=3+2=5 ✅. (Note AB=BA, phir bhi traces agree karte hain — jaisa prove kiya.)
Recall Solution
A=S+K transpose karo: A⊤=S⊤+K⊤=S−K (S⊤=S, K⊤=−K use karke).
Ab hamare paas do equations hain:
A=S+K,A⊤=S−K.
Add karo: A+A⊤=2S⇒S=21(A+A⊤). Subtract karo: A−A⊤=2K⇒K=21(A−A⊤).
Split forced hai — exactly ek hi symmetric+skew decomposition exist karta hai.
Recall Solution
(Qx)⊤(Qy)=x⊤Q⊤Qy=x⊤Iy=x⊤y.
Kyunki dot product lengths aur angles encode karta hai, Q dono ko unchanged rakhta hai: orthogonal maps exactly rigid rotations/reflections hote hain. y=x set karne par dikhta hai ki lengths preserve hoti hain.