Let A = ( 4 − 9 1 − 2 ) . If A 1 0 0 can be represented as A 1 0 0 = ( a c b d ) , what is the value of a + b + c + d ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
What if B had not been nilpotent?
Log in to reply
The Jordan matrix is not nilpotent, but it can be expressed as λ I n + B n , where I is the identity matrix and B is the shift matrix. The shift matrix is a nilpotent matrix by definition.
Log in to reply
Are you talking about Cayley Hamilton? Oh yes! It works! Thanks!
Log in to reply
@Pranjal Jain – I see you are a nice writer! Downloaded all of your books! Gonna spend this cold night reading them! Keep it up! Can you write some wikis here on Brilliant?
Log in to reply
@Pranjal Jain – When I have time. I am pretty busy with school and educational activities (i.e. teaching, organizing competitions and events).
Nice Problem ! But Can You please Explain How Can we Use Binomial Expansion For Matrix ? Since Matrix is an Representation !
So How Can we Prove This rigorously ? thanks !
Log in to reply
Binomial expansion can be applied to matrices A , B for any natural no. n , if A a n d B commute i.e. A B = B A . I think It can be proved using Principle of mathematical induction. have a look at that. @Deepanshu Gupta
Log in to reply
Nice solution! With Cayley Hamilton it was pretty long
I think any differentiable function applies! You can even Taylor expand a matrix .
I see you used the nilpotence of B . I wrote about the general explanation here .
Great solution! I did it the same way.
Thanks for this nice concept bro ..
A = ( 4 − 9 1 − 2 ) .
A 2 = ( 7 − 1 8 2 − 5 ) .
Now, using Induction we can prove that,
A n = ( 3 n + 1 − 9 n n − 3 n + 1 ) .
Now, A 1 0 0 = ( 3 0 1 − 9 0 0 1 0 0 − 2 9 9 ) .
So, a + b + c + d = − 7 9 8
Same as I did!
The general procedure for taking any matrix power is to find a similar matrix into the form P − 1 D P , where D is the diagonal matrix. However, this matrix cannot be diagonalized due to the repeated eigenvalue λ = 1 . Thus we must find the similar matrix in the Jordan form .
Here we get A = ( − 1 3 − 1 / 3 0 ) ( 1 0 1 1 ) ( 0 − 3 1 / 3 − 1 )
hence
A 1 0 0 = ( − 1 3 − 1 / 3 0 ) ( 1 0 1 1 ) 1 0 0 ( 0 − 3 1 / 3 − 1 )
What is cool about the middle matrix is the property ( 1 0 1 1 ) n = ( 1 0 n 1 )
We multiply back the matrix and get A 1 0 0 = ( 3 0 1 − 9 0 0 1 0 0 − 2 9 9 )
Problem Loading...
Note Loading...
Set Loading...
Given : A = ( 4 − 9 1 − 2 ) = ( 1 + 3 − 9 1 1 − 3 ) = ( 1 0 0 1 ) + ( 3 − 9 1 − 3 ) = I + B
I is the identity or unit matrix and lets me assume that ( 3 − 9 1 − 3 ) = B
Now B 2 = ( 3 − 9 1 − 3 ) × ( 3 − 9 1 − 3 ) = ( 0 0 0 0 )
As I and B commute - unit matrix commutes with any matrix .
So using binomial expansion, we can write A 1 0 0 = ( I + B ) 1 0 0
⟹ A 1 0 0 = I + 1 0 0 C 1 . B + 1 0 0 C 2 . B 2 + . . . . + 1 0 0 C 1 0 0 . B 1 0 0
But B k = 0 , ∀ k ≥ 2 . So the above reduces to
A 1 0 0 = I + 1 0 0 . B
= ( 0 0 0 0 ) + 1 0 0 . ( 3 − 9 1 − 3 )
= ( 3 0 1 − 9 0 0 1 0 0 − 2 9 9 )
⟹ R e q u i r e d = 3 0 1 + 1 0 0 − 9 0 0 − 2 9 9 = − 7 9 8
where n C r = r ! × ( n − r ) ! n !
enjoy