SAS^(-1) is Block Upper Triangular (Blocks of size <= 2) [Possible Schur Decomp]

  • Thread starter Thread starter brru25
  • Start date Start date
  • Tags Tags
    Block
Click For Summary
SUMMARY

The discussion centers on proving that for any n×n real matrix A, there exists a matrix S such that SAS^(-1) is block upper triangular (BUP) with diagonal blocks of size at most 2. This result is closely related to the Schur decomposition, which typically involves unitary matrices. The key distinction is that while the Schur decomposition guarantees BUP for SAS*, this discussion focuses on finding a suitable S for the transformation SAS^(-1).

PREREQUISITES
  • Understanding of block upper triangular matrices (BUP)
  • Familiarity with Schur decomposition principles
  • Knowledge of matrix transformations and inverses
  • Basic linear algebra concepts, including matrix multiplication
NEXT STEPS
  • Study the properties of block upper triangular matrices in detail
  • Explore the Schur decomposition and its applications in linear algebra
  • Investigate matrix similarity transformations and their implications
  • Learn about unitary matrices and their role in matrix decompositions
USEFUL FOR

Students and researchers in linear algebra, mathematicians interested in matrix theory, and anyone studying matrix decompositions and transformations.

brru25
Messages
29
Reaction score
0

Homework Statement



Let A be an n×n real matrix. Show that there exists S such that SAS-1 is block upper triangular with diagonal blocks of size at most 2.

Homework Equations



BUP = block upper triangular

The Attempt at a Solution



It sounds a lot like the Schur decomposition (which is proven by induction), but the only difference is that here the question is asking for an S such that SAS-1 is BUP, but the Schur decomposition says that SAS* is BUP
 
Physics news on Phys.org
so if S is unitary then

S^{-1} = (S^{T})^*
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 1 ·
Replies
1
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K