4.5.7 · Maths › Linear Algebra (Full)
Intuition Bada picture (YE definition KYU hai?)
Ek matrix ek machine hai jo vectors ko transform karti hai (ek linear map). Jab tum do matrices A B multiply karte ho, tum do machines compose kar rahe ho : "pehle B karo, phir A karo". Function composition hi wajah hai ki row-times-column rule waisa dikhta hai jaisa dikhta hai — yeh ek hi aisa rule hai jo ( A B ) x = A ( B x ) ko har vector x ke liye true banata hai.
Neeche sab kuch (dot-product formula, associativity, non-commutativity) bas "matrices composed transformations hain" ke consequences hain.
Definition Matrix product
Agar A , m × n hai aur B , n × p hai, to C = A B , m × p hai jisme
C ij = ∑ k = 1 n A ik B k j .
Inner dimensions match karni chahiye (n = n ); outer dimensions (m , p ) result ka size dete hain.
Sum-of-products KYU? Chalte hain ise derive karte hain. Ek matrix B ek vector x par aise act karti hai:
( B x ) k = ∑ j B k j x j .
Hum demand karte hain ki A B woh single matrix ho jo "A after B " kare, yani ( A B ) x = A ( B x ) har x ke liye. i -th entry compute karo:
( A ( B x ) ) i = ∑ k A ik ( B x ) k = ∑ k A ik ( ∑ j B k j x j ) = ∑ j ( = ( A B ) ij k ∑ A ik B k j ) x j .
To x j ko multiply karne wala coefficient — jo ki ( A B ) ij hai — forced hai ki ∑ k A ik B k j ho. Definition arbitrary nahi hai; composition ise force karti hai.
2 × 2 product
A = ( 1 3 2 4 ) , B = ( 5 7 6 8 ) .
( A B ) 11 = 1 ⋅ 5 + 2 ⋅ 7 = 19 . Kyun? A ki Row 1 ko B ke column 1 se dot kiya.
( A B ) 12 = 1 ⋅ 6 + 2 ⋅ 8 = 22 . Kyun? Row 1 ko column 2 se.
( A B ) 21 = 3 ⋅ 5 + 4 ⋅ 7 = 43 , ( A B ) 22 = 3 ⋅ 6 + 4 ⋅ 8 = 50 .
A B = ( 19 43 22 50 ) .
Worked example Non-square: shapes align karni chahiye
A , 2 × 3 hai, B , 3 × 2 hai:
A = ( 1 − 1 0 3 2 1 ) , B = 4 0 1 1 2 0 .
Inner dims 3 = 3 ✓, result 2 × 2 hai.
( A B ) 11 = 1 ⋅ 4 + 0 ⋅ 0 + 2 ⋅ 1 = 6 . Kyun? Shared index k = 1 , 2 , 3 par teen-term dot product.
( A B ) 12 = 1 ⋅ 1 + 0 ⋅ 2 + 2 ⋅ 0 = 1 ; ( A B ) 21 = − 1 ⋅ 4 + 3 ⋅ 0 + 1 ⋅ 1 = − 3 ; ( A B ) 22 = − 1 ⋅ 1 + 3 ⋅ 2 + 1 ⋅ 0 = 5 .
A B = ( 6 − 3 1 5 ) .
Note karo ki B A ka size 3 × 3 hota — ek alag shape . Non-commutativity ka pehla hint!
Worked example Order matters hai (pehle rotation phir reflection ≠ pehle reflection phir rotation)
Maano R = ( 0 1 − 1 0 ) (90° rotation), F = ( 1 0 0 − 1 ) (y flip).
R F = ( 0 1 1 0 ) , F R = ( 0 − 1 − 1 0 ) .
Yeh step kyun? R F matlab "pehle flip, phir rotate"; F R matlab "pehle rotate, phir flip". Physically yeh ek point ko alag jagah le jaate hain, isliye R F = F R .
Algebraic proof (entrywise). Compatible sizes ke saath,
( ( A B ) C ) i ℓ = ∑ j ( A B ) ij C j ℓ = ∑ j ( ∑ k A ik B k j ) C j ℓ = ∑ k ∑ j A ik B k j C j ℓ .
( A ( B C ) ) i ℓ = ∑ k A ik ( B C ) k ℓ = ∑ k A ik ( ∑ j B k j C j ℓ ) = ∑ k ∑ j A ik B k j C j ℓ .
Dono same double sum ke barabar hain — finite sums reorder ho sakti hain. Ho gaya. Associativity hi wajah hai ki "A B C " unambiguous hai.
Yeh bhi note karo ki distributivity hoti hai: A ( B + C ) = A B + A C aur ( A + B ) C = A C + B C , aur A I = I A = A (identity).
Intuition Order kyun matter karta hai
Matrices = transformations. Transformations compose karna order-sensitive hai ("pehle moze phir joote" ≠ "pehle joote phir moze"). Sirf special pairs commute karte hain (jaise I ke saath, apni powers ke saath, simultaneously diagonalizable matrices).
Teen reasons ki A B = B A :
Shape: A B aur B A ke sizes alag ho sakte hain (Example 2) — tab woh equal ho hi nahi sakte .
Jab dono square bhi hon: dot products rows/cols ko alag tarike se mix karte hain. Upar R F vs F R dekho.
Commutator failure measure karta hai: [ A , B ] := A B − B A . Yeh 0 hai iff woh commute karte hain.
Worked example Concrete non-commuting square pair
A = ( 1 0 1 1 ) , B = ( 1 1 0 1 ) .
A B = ( 2 1 1 1 ) , B A = ( 1 1 1 2 ) . Kyun? Har entry row·column ke roop mein compute karo; diagonal par alag hain. To [ A , B ] = ( 1 0 0 − 1 ) = 0 .
Common mistake "Matrix multiplication entrywise hoti hai, jaise addition."
Kyun sahi lagta hai: addition hoti hai entrywise, to symmetry suggest karti hai multiplication bhi aisi hogi. Fix: entrywise product (Hadamard) composition ka meaning kho deta hai aur ( A B ) x = A ( B x ) tod deta hai. Real multiplication row·column hai taaki yeh maps ka composition represent kare.
( A B ) − 1 = A − 1 B − 1 ."
Kyun sahi lagta hai: numbers jaisa lagta hai ( ab ) − 1 = a − 1 b − 1 . Fix: order reverse hota hai! ( A B ) − 1 = B − 1 A − 1 — "B phir A" undo karne ke liye pehle A undo karo: ( A B ) ( B − 1 A − 1 ) = A ( B B − 1 ) A − 1 = I .
A B = 0 ⇒ A = 0 ya B = 0 ."
Kyun sahi lagta hai: real numbers ke liye true hai (zero divisors nahi hote). Fix: matrices mein zero divisors hote hain, jaise ( 0 0 1 0 ) 2 = 0 lekin matrix 0 nahi hai.
( A + B ) 2 = A 2 + 2 A B + B 2 ."
Kyun sahi lagta hai: binomial ki aadat. Fix: ( A + B ) 2 = A 2 + A B + B A + B 2 ; A B + B A ko 2 A B mein merge tab hi kar sakte ho jab woh commute karein.
Recall Feynman: ek 12-saal ke bachche ko samjhao (hidden)
Har matrix ko ek chhoti si recipe machine samjho jo ek grid par dots ko move karti hai. A B matlab "machine B chalao, phir machine A , ek saath ek combined machine ki tarah." Woh combined machine banane ke liye A ki har row ko B ke har column ke upar slide karo, matching numbers multiply karo aur add karo — yahi row-dot-column rule hai. Kyunki B -then-A karna usually A -then-B se alag hota hai (jaise pehle moze phir joote vs pehle joote phir moze), order badalne se usually alag machine milti hai — yahi non-commutativity hai. Lekin teen machines ko group karna ( A B ) C vs A ( B C ) same pipeline deta hai, isliye grouping free hai — yahi associativity hai.
Mnemonic Rules yaad rakho
"Rows Cross Columns; Order Counts; Brackets Don't."
RCC = entries ke liye row·column; Order Counts = A B = B A ; Brackets Don't (matter) = associativity.
C = A B ke liye C ij kya hai?∑ k A ik B k j — A ki row i को B के column j से dot kiya.
A B form karne ke liye kaunse dimensions match karni chahiye?Inner wale: A , m × n hai, B , n × p hai; result m × p hota hai.
Product row·column sums se kyun define hota hai, entrywise nahi? Taaki ( A B ) x = A ( B x ) ho, yani A B do linear maps ka composition represent kare.
Associativity state karo aur justify karo. ( A B ) C = A ( B C ) ; dono kisi bhi vector par maps ko C , B , A order mein apply karte hain, aur entrywise dono ∑ j , k A ik B k j C j ℓ ke barabar hain.
Kya matrix multiplication commutative hai? Ek counterexample do. Nahi. Jaise ( 1 0 1 1 ) ( 1 1 0 1 ) = ulta.
( A B ) − 1 kya hai?B − 1 A − 1 (order reverse hota hai).
Matrices ke liye ( A + B ) 2 expand karo. A 2 + A B + B A + B 2 (na ki A 2 + 2 A B + B 2 jab tak A , B commute na karein).
Commutator define karo aur yeh kya measure karta hai. [ A , B ] = A B − B A ; yeh 0 hai iff A aur B commute karte hain.
Kya A B = 0 ho sakta hai jab A , B dono nonzero hon? Haan — matrices mein zero divisors hote hain, jaise ( 0 0 1 0 ) 2 = 0 .
Linear Transformations — matrix product = maps ka composition.
Identity and Inverse Matrices — ( A B ) − 1 = B − 1 A − 1 .
Dot Product — A B ki har entry ek dot product hai.
Determinants — det ( A B ) = det A det B (non-commutativity ke bawajood multiplicative).
Transpose — ( A B ) ⊤ = B ⊤ A ⊤ (order yahan bhi reverse hota hai).
Matrix Powers and Diagonalization — commuting matrices ke eigenvectors share hote hain.
Definition Cij = sum Aik Bkj
Entry / Column / Row views
Associativity AB C = A BC
Non-commutativity AB != BA
Rotation then flip != flip then rotation