On the ranks of principal submatrices of diagonalizable matrices
    
    
  
  
  
      
      
      
        
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXI, Tome 359 (2008), pp. 42-44
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			As is well known, the rank of a diagonalizable complex matrix can be characterized as the maximum order of the nonzero principal minors of this matrix. The standard proof of this fact is based on representing the coefficients of the characteristic polynomial as the (alternating) sums of all the principal minors of appropriate order. We show that in the case of normal matrices, one can give a simple direct proof, not relying on those representations. Bibl. – 2 titles.
			
            
            
            
          
        
      @article{ZNSL_2008_359_a4,
     author = {Kh. D. Ikramov},
     title = {On the ranks of principal submatrices of diagonalizable matrices},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {42--44},
     publisher = {mathdoc},
     volume = {359},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2008_359_a4/}
}
                      
                      
                    Kh. D. Ikramov. On the ranks of principal submatrices of diagonalizable matrices. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXI, Tome 359 (2008), pp. 42-44. http://geodesic.mathdoc.fr/item/ZNSL_2008_359_a4/