Matrix rank is sab mein kahan se aata hai? Chalte hain ise build karte hain, memorize nahi karte.
x˙=Ax+Bu ka solution x0=0 (rest) se shuru karke yeh hai
x(T)=∫0TeA(T−τ)Bu(τ)dτ.
Yeh step kyun? Yeh standard variation-of-parameters solution hai; matrix exponential eAt state ko propagate karta hai, aur integral input history ka effect accumulate karta hai.
Origin se reachable states ka set eA(T−τ)Bu(τ) form ke saare vectors ka span hai. Isliye reachable subspace eAtB ke columns se span hota hai sabhi t ke liye.
Ab Cayley–Hamilton theorem use karo: har matrix A apni characteristic polynomial satisfy karta hai, isliye An (aur usse bade powers) ko I,A,A2,…,An−1 ke linear combination ke roop mein likha ja sakta hai. Matrix exponential expand karke
eAt=∑k=0∞k!(At)kYeh step kyun? Har power Ak finite set {I,A,…,An−1} par collapse ho jaata hai. Isliye eAtB hamesha sirf inke linear combinations produce karta hai
B,AB,A2B,…,An−1B.
Isliye reachable subspace exactly inhi blocks ko side by side stack karne ka column span hai. Woh stack HI controllability matrix hai.
Rank n kyun aur zyada kyun nahi? Tum kabhi n se zyada dimensions reach nahi kar sakte (state n-dimensional hai). Rank =n matlab columns poora state space span karte hain. Rank <n matlab ek "dead" subspace hai jise koi bhi input touch nahi kar sakta.
Kya koi bhi initial state ko available inputs ka use karke finite time mein kisi bhi target state tak drive kiya ja sakta hai.
Controllability matrix ki definition
C=[BABA2B⋯An−1B].
Controllability ke liye rank condition
rank(C)=n (full row rank).
An−1B par kyun rukein?
Cayley–Hamilton: An aur usse bade I,…,An−1 ke linear combinations hain, isliye bade powers koi nai directions add nahi karte.
n states, m inputs ke liye C ka size
n×(nm).
Kya B mein zero hona uncontrollable imply karta hai?
Nahi — depend karta hai ki AB ko kaise mix karta hai; C ka rank check karna zaroori hai.
Kya controllability aur stability ek hi hai?
Nahi; yeh independent properties hain.
Single-input n=2 ke liye quick controllability check
det[BAB]=0.
Rank <n physically kya matlab hai?
Ek aisi state-space direction (ek mode) exist karti hai jise koi bhi input affect nahi kar sakta.
Recall Feynman: 12-saal ke bachche ko explain karo
Socho ek toy robot floor par hai. Tumhare paas ek remote hai jo ise kuch tareekon se push kar sakta hai. Controllable matlab: tumhare paas jo buttons hain unse tum robot ko eventually kisi bhi jagah kisi bhi direction mein face karte hue le ja sakte ho. Agar kuch buttons missing hain — jaise tum aage/peechhe push kar sakte ho lekin robot glued hai aur kabhi turn nahi kar sakta — toh chahe tum kitna bhi khelo, tum ise kabhi left face nahi karwa sakte. Woh "stuck-ness" hi woh cheez hai jo rank test detect karta hai. Hum har us tarike ko list karte hain jis se tumhari pushes robot ki motion mein ripple karti hain (B,AB,A2B,…) aur poochhte hain: kya yeh saath mein robot ke chalne ke saare tareekon ko cover karte hain? Agar haan (full rank) → total control. Agar nahi → kuch motions hamesha ke liye locked hain.