A square matrix of order has all its principle diagonal elements and the elements lying below the principle diagonal equal to 0.
Prove that is a 0 matrix.
Note: Solve it using eigenvalues method.I already have solved using induction,so please do not give a solution using induction.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
By definition, the eigen values of A are the roots of the polynomial in k, ∣A−kI∣=0.This can be simplified to get (−1)nkn=0.Hence, we get that, all the n eigen values of A are identically equal to 0.Hence, the n eigen values of An are also each equal to 0.Also, when k is an eigen value of An , then for the vector X, AnX=kX=0.Since, every eigen value of An is 0, so we get, AnX=0, which means that the matrix operation An is scaling the vector X , into a zero vector.Does this imply An=0 ? I am not able to understand from this step onwards.
Log in to reply
Can anyone help me?
Recalling that the eigenvalues of a triangular matrix are the elements on the principal diagonal (which are all 0 for A), this is now trivial by the Cayley-Hamilton theorem.
Yes,that works.Every square matrix satisfies its own characteristic equation and hence the result follows.