Triangular Similar Matrix question

  • Thread starter Thread starter Alupsaiu
  • Start date Start date
  • Tags Tags
    Matrix
Alupsaiu
Messages
13
Reaction score
0
Hi,

Is every matrix similar to a triangular matrix? If it is, anyone have an idea how to prove it?
Thanks
 
Physics news on Phys.org
Alupsaiu said:
Hi,

Is every matrix similar to a triangular matrix? If it is, anyone have an idea how to prove it?
Thanks

The proof can be done by induction. (Idea): In the field of complex numbers any n x n matrix has at least an eigenvector v. Complete v to get a basis of C^n. With respect to this basis, the first column of A has only the first element (let's call it a) eventually non zero, so A is similar to a block-triangular matrix, with a being the first 1 x 1 block and a certain (n-1)x(n-1) matrix B being the second block. Apply the inductive hypotesis to B and you get the result.
 
Every matrix is similar to a diagonal matrix or to a "Jordan Normal Form" both of which are upper triangular.
 
schur triangle theorem and it can be unitary similar
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top