PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] simultaneous triangularisation of commuting matrices over any field (Theorem)

Let $ \mathbf {e}_i$ denote the (column) vector whose $ i$th position is $ 1$ and where all other positions are 0. Denote by $ [n]$ the set $ \{1,\dotsc,n\}$. Denote by $ \mathrm{M}_n(\mathcal {K})$ the set of all $ n \times n$ matrices over $ \mathcal {K}$, and by $ \mathrm{GL}_n(\mathcal {K})$ the set of all invertible elements of $ \mathrm{M}_n(\mathcal {K})$. Let $ d_i$ be the function which extracts the $ i$th diagonal element of a matrix, i.e., $ d_i(A) = \mathbf {e}_i^{\mathrm{T}}\! A \mathbf {e}_i$.

Theorem 1   Let $ \mathcal {K}$ be a field, let $ A_1,\dotsc,A_r \in \mathrm{M}_n(\mathcal {K})$ be pairwise commuting matrices, and let $ \mathcal {L}$ be a field extension of $ \mathcal {K}$ in which the characteristic polynomials of all $ A_k$ split. Then there exists some $ P \in \mathrm{GL}_n(\mathcal {L})$ such that
  1. $ P^{-1} A_k P$ is upper triangular for all $ k=1,\dotsc,r$, and
  2. if $ i,j,l \in [n]$ are such that $ i \leqslant l \leqslant j$ and $ d_i(P^{-1} A_k P) = d_j(P^{-1} A_k P)$ for all $ k=1,\dotsc,r$, then $ d_l(P^{-1} A_k P) = d_j(P^{-1} A_k P)$ for all $ k=1,\dotsc,r$ as well.

The proof relies on two lemmas.

Lemma 1   Let $ \mathcal {K}$ be a field, let $ A_1,\dotsc,A_r \in \mathrm{M}_n(\mathcal {K})$ be pairwise commuting matrices, and let $ \mathcal {L}$ be a field extension of $ \mathcal {K}$ in which the characteristic polynomials of all $ A_k$ split. Then there exists some nonzero $ \mathbf {u} \in \mathcal {L}^n$ which is an eigenvector of $ A_k$ for all $ k=1,\dotsc,r$.
Lemma 2   For any sequence $ R_1,\dotsc,R_r \in \mathrm{M}_n(\mathcal {L})$ of upper triangular pairwise commuting matrices and every row index $ i \in [n]$, there exists $ \mathbf {v} \in \mathcal {L}^n \setminus \{0\}$ such that
$\displaystyle R_k \mathbf {v} = d_i(R_k) \mathbf {v}$   for all $ k \in [r]$.    

Proof. This is by induction on $ n$. The induction hypothesis is that given pairwise commuting matrices $ A_1,\dotsc,A_r \in \mathrm{M}_n(\mathcal {L})$, whose characteristic polynomials all split in $ \mathcal {L}$, and a sequence of arbitrary scalars $ \mu_1,\dotsc,\mu_r \in \mathcal {L}$, there exists some $ P \in \mathrm{GL}_n(\mathcal {L})$ such that:
  1. $ P^{-1} A_k P$ is upper triangular for all $ k=1,\dotsc,r$.
  2. If some $ i,j \in [n]$ are such that $ i<j$ and $ d_j(P^{-1} A_k P) = d_i(P^{-1} A_k P)$ for all $ k \in [r]$, then $ d_{i+1}(P^{-1} A_k P) = d_i(P^{-1} A_k P)$.
  3. If some $ j \in [n]$ is such that $ d_j(P^{-1} A_k P) = \mu_k$ for all $ k \in [r]$, then $ d_1(P^{-1} A_k P) = \mu_k$ for all $ k \in [r]$.
For $ n=1$ this hypothesis is trivially fulfilled (all $ 1 \times 1$ matrices are upper triangular). Assume that it holds for $ n=m$ and consider the case $ n=m+1$.

It is easy to see that condition 1 implies that $ P\mathbf {e}_1$ must be an eigenvector that is common to all the matrices. If there exists a nonzero vector $ \mathbf {u}_1 \in \mathcal {L}^n$ such that $ A_k \mathbf {u}_1 = \mu_k \mathbf {u}_1$ for all $ k=1,\dotsc,r$ then this is such a common eigenvector, and in that case let $ \lambda_k=\mu_k$ for all $ k=1,\dotsc,r$. Otherwise there by Lemma 1 exists a vector $ \mathbf {u}_1 \in \mathcal {L}^n \setminus \{\mathbf {0}\}$ such that $ A_k \mathbf {u}_1 = \lambda_k \mathbf {u}_1$ for some $ \{\lambda_k\}_{k=1}^r \subseteq \mathcal {L}$. Either way, one gets a suitable candidate $ \mathbf {u}_1$ for $ P\mathbf {e}_1$ and eigenvalues $ \lambda_1,\dotsc,\lambda_r$ that incidentally will satisfy $ d_1(P^{-1} A_k P) = \lambda_k$ for all $ k \in [r]$.

Let $ \mathbf {u}_2,\dotsc,\mathbf {u}_n \in \mathcal {L}^n$ be arbitrary vectors such that $ \{\mathbf {u}_i\}_{i=1}^n$ is a basis of $ \mathcal {L}^n$. Let $ U$ be the $ n \times n$ matrix whose $ i$th column is $ \mathbf {u}_i$ for $ 1 \leqslant i \leqslant n$.1Then $ U$ is invertible and for each $ k$ the first column of $ B_k = U^{-1} A_k U$ is

$\displaystyle U^{-1} A_k U \mathbf {e}_1 = U^{-1} A_k \mathbf {u}_1 = \lambda_k U^{-1} \mathbf {u}_1 = \lambda_k \mathbf {e}_1$   .    

Furthermore
\begin{multline*} B_j B_k = U^{-1} A_j U U^{-1} A_k U = U^{-1} A_j A_k U = \\ = U^{-1} A_k A_j U = U^{-1} A_k U U^{-1} A_j U = B_k B_j \end{multline*}

for all $ j$ and $ k$.

Now let $ A_k'$ be the matrix formed from rows and columns $ 2$ though $ n$ of $ B_k$. Since $ \det(A_k -\nobreak xI) = \det( B_k -\nobreak xI ) = (\lambda_k -\nobreak x) \det( A_k' -\nobreak xI )$ by expansion along the first column, it follows that the characteristic polynomial of $ A_k'$ splits in $ \mathcal {L}$. Furthermore all the $ A_k'$ have side $ m = n-1$ and commute pairwise with each other, whence by the induction hypothesis there exists some $ P' \in \mathrm{GL}_{n-1}(\mathcal {L})$ such that every $ P'^{-1} A_k' P'$ is upper triangular. Let $ P = U \left(\begin{smallmatrix}1& 0 \\ 0& P' \end{smallmatrix}\right) $. Then the submatrix consisting of rows and columns $ 2$ through $ n$ of $ P^{-1} A_k P$ is equal to $ P'^{-1} A_k' P'$ and hence contains no nonzero subdiagonal elements. Furthermore the first column of $ P^{-1} A_k P$ is equal to the first column of $ B_k$ and thus the $ P^{-1} A_k P$ are all upper triangular, as claimed.

It also follows from the induction hypothesis that $ P$ can be chosen such that $ d_2(P^{-1} A_k P) = d_1(P'^{-1} A_k' P') = \lambda_k = d_1(P^{-1} A_k P)$ for all $ k \in [r]$ if there is any $ j \geqslant 2$ for which $ d_j(P^{-1} A_k P) = d_{j-1}(P'^{-1} A_k' P') = \lambda_k = d_1(P^{-1} A_k P)$ for all $ k \in [r]$ and more generally if $ 2 \leqslant i < j$ are such that $ d_j(P^{-1} A_k P) = d_i(P^{-1} A_k P)$ for all $ k \in [r]$ then similarly $ d_{i+1}(P^{-1} A_k P) = d_i(P^{-1} A_k P)$ for all $ k \in [r]$. This has verified condition 2 of the induction hypothesis. For the remaining condition 3, one may first observe that if there is some $ i \in [n]$ such that $ d_i(P^{-1} A_k P) = \mu_k$ for all $ k \in [r]$ then by Lemma 2 there exists a nonzero $ \mathbf {v} \in \mathcal {L}^n$ such that $ P^{-1} A_k P \mathbf {v} = \mu_k \mathbf {v}$ for all $ k \in [r]$. This means $ P \mathbf {v}$ will fulfill the condition for choice of $ \mathbf {u}_1$, and hence $ d_1(P^{-1} A_k P) = \lambda_k = \mu_k$ as claimed.

The theorem now follows from the principle of induction. $ \qedsymbol$



Footnotes

....1
By imposing extra conditions on the choice of the basis $ \{\mathbf {u}_i\}_{i=1}^n$ (such as for example requesting that it is orthonormal) at this point, one can often prove a stronger claim where the choice of $ P$ is restricted to some smaller group of matrices (for example the group of orthogonal matrices), but this requires assuming additional things about the fields $ \mathcal {K}$ and $ \mathcal {L}$.


"simultaneous triangularisation of commuting matrices over any field" is owned by lars_h.
(view preamble)

View style:

See Also: commuting matrices


This object's parent.

Attachments:
common eigenvector of a diagonal element cross-section (Theorem) by lars_h
Log in to rate this entry.
(view current ratings)

Cross-references: submatrix, orthogonal matrices, group, restricted, point, orthonormal, basis, eigenvalues, implies, easy to see, hypothesis, scalars, induction hypothesis, induction, index, row, sequence, eigenvector, proof, upper triangular, characteristic polynomials, field extension, commuting matrices, field, diagonal, function, invertible, matrices, vector, column
There is 1 reference to this entry.

This is version 1 of simultaneous triangularisation of commuting matrices over any field, born on 2005-08-29.
Object id is 7352, canonical name is SimultaneousTriangularisationOfCommutingMatricesOverAnyField2.
Accessed 1672 times total.

Classification:
AMS MSC15A21 (Linear and multilinear algebra; matrix theory :: Canonical forms, reductions, classification)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)