DISCLAIMER: This problem is explained properly on my YouTube channel, at the following link: PROBLEM: Analysis of 2x2 Matrices using Cayley-Hamilton Theorem. I suggest you watch this before looking below.
Before I start, let's recall the Cayley-Hamilton Theorem:
Theorem (Cayley-Hamilton Theorem) If is a square matrix and is its characteristc polynomial, then (allowing for matrices as the polynomial variable) , where is the zero square matrix.
Suppose now that is the following 2 x 2 matrix:
Note that the trace (denoted by ) and determinant (denoted by ) is and respectively. Then the characteristic polynomial of is:
Thus, by the Cayley-Hamilton Theorem:
or:
What we can see is that can be expressed in terms of , and . Can we express in terms of , and ? Well, let's compute this:
So here's two open problems for you:
1) How to express in terms of , and ?
2) Can we do something similar for square matrix of arbitrary sizes? How about a 3 x 3 matrix?
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
For problem 1, here's an outline of an idea that I think might work, though I'm not very sure. Also, I think this method will give the closed form in the form of some cases with conditions imposed on t and Δ.
Denote xn=An and define A0=I where I is the identity matrix of the same order as A. Then we have,
xn=An=A2An−2=(tA−Δ)An−2=tAn−1−ΔAn−2=txn−1−Δxn−2 ∀ n≥2(1)
Since t and Δ only depend on A which is independent of n, we note that t,Δ are independent of n and hence (1) can be seen as a linear recurrence relation with constant coefficients and we can use the method described here to get a closed form for xn, i.e., a closed form for An in terms of t,Δ,A using the initial values x0=I and x1=A.
I tried working on the case where the auxillary equation for the recurrence has distincts non-zero roots, i.e., when Δ=0 and t2=Δ, and let me tell you, the result is not very pretty. We have,
An=c1αn+c2βn
where α,β=2−t±t2−4Δ and c1=β−α1(βI−A) and c2=β−α1(−αI+A)
I think there might be a better way to approach the problem but this is all I have right now. Will update the comment if I figure out a better way.
Log in to reply
I guess Problem 1 is almost solved; once you have the linear recurrence, just find the generating function and go from there (I know I'm projecting, and I'm expecting some sort of sh*tstorm!).
Any ideas on Problem 2?
Log in to reply
Essentially yes. What you want is the characteristic polynomial of the matrix which arises from cayley hamilton theorem. Say it has degree d≤n.
Then, every matrix Ak can be expressed as I,A,A2,…,ad−1 by repeated substituting in the characteristic polynomial. You could use the linear recurrence relations to solve for each coefficient if desired.