Let be an matrix with non-zero real eigenvalues. Suppose that
Then
denotes the trace of the matrix .
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.
Given T r ( A 2 ) = T r ( A 3 ) = T r ( A 4 ) . Suppose ( λ 1 , λ 2 … λ n ) be the eigenvalues of A .
Condition implies k = 1 ∑ n λ k 2 = k = 1 ∑ n λ k 3 = k = 1 ∑ n λ k 4 .
Consider the vectors x 1 = ( λ 1 , λ 2 … λ n ) and x 2 = ( λ 1 2 , λ 2 2 … λ n 2 ) .
We have ∣ ⟨ x 1 , x 2 ⟩ ∣ 2 = ( k = 1 ∑ n λ k 3 ) 2
also, ⟨ x 1 , x 1 ⟩ = ∣ ∣ x 1 ∣ ∣ 2 = k = 1 ∑ n λ k 2 = k = 1 ∑ n λ k 3
and ⟨ x 2 , x 2 ⟩ = ∣ ∣ x 2 ∣ ∣ 2 = k = 1 ∑ n λ k 4 = k = 1 ∑ n λ k 3
Now we have ∣ ⟨ x 1 , x 2 ⟩ ∣ 2 = ⟨ x 1 , x 1 ⟩ ⋅ ⟨ x 2 , x 2 ⟩
This is the case of equality in Cauchy-Schwarz inequality and hence we can conclude x 2 = k ⋅ x 1 for some scalar k .
i.e., ( λ 1 2 , λ 2 2 … λ n 2 ) = k ⋅ ( λ 1 , λ 2 … λ n ) .
for each λ j , we have λ j 2 = k λ j . Since λ j = 0 ∀ 0 ≤ j ≤ n , λ j = k for all 0 ≤ j ≤ n
Again since we have k = 1 ∑ n λ k 2 = k = 1 ∑ n λ k 3 = k = 1 ∑ n λ k 4 ⟹ n k 2 = n k 3 = n k 4 ⟹ k = 1 .
Hence k = 1 ∑ n λ k = n