Is there an equivalent property of Similar Matrices for rectangular matrices?
up vote
0
down vote
favorite
Say I have the following:
$Z = A^T B A$
where $Z$ is an $ntimes n$ matrix, $B$ is an $m times m$ matrix, and $A$ is a $m times n$ matrix, $n<m$.
Furthermore, the columns of $A$ are orthogonal, and $B$ is a positive definite matrix and $Z$ is symmetric tridiagonal.
This bears similarities to two similar $mtimes m$ matrices, $X$ and $Y$, requiring Y = $P^{-1}XP$ for some invertible matrix $P$.
Obviously in my case, $B$ and $Z$ don't have the same dimensions, and as $A$ is a truncated orthogonal matrix, it only has the property $A^TA=I$ (and not the other way round).
However, can any properties of similar matrices follow from this, such as the characteristic polynomial, determinant or eigenvalues?
linear-algebra abstract-algebra matrices
add a comment |
up vote
0
down vote
favorite
Say I have the following:
$Z = A^T B A$
where $Z$ is an $ntimes n$ matrix, $B$ is an $m times m$ matrix, and $A$ is a $m times n$ matrix, $n<m$.
Furthermore, the columns of $A$ are orthogonal, and $B$ is a positive definite matrix and $Z$ is symmetric tridiagonal.
This bears similarities to two similar $mtimes m$ matrices, $X$ and $Y$, requiring Y = $P^{-1}XP$ for some invertible matrix $P$.
Obviously in my case, $B$ and $Z$ don't have the same dimensions, and as $A$ is a truncated orthogonal matrix, it only has the property $A^TA=I$ (and not the other way round).
However, can any properties of similar matrices follow from this, such as the characteristic polynomial, determinant or eigenvalues?
linear-algebra abstract-algebra matrices
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Say I have the following:
$Z = A^T B A$
where $Z$ is an $ntimes n$ matrix, $B$ is an $m times m$ matrix, and $A$ is a $m times n$ matrix, $n<m$.
Furthermore, the columns of $A$ are orthogonal, and $B$ is a positive definite matrix and $Z$ is symmetric tridiagonal.
This bears similarities to two similar $mtimes m$ matrices, $X$ and $Y$, requiring Y = $P^{-1}XP$ for some invertible matrix $P$.
Obviously in my case, $B$ and $Z$ don't have the same dimensions, and as $A$ is a truncated orthogonal matrix, it only has the property $A^TA=I$ (and not the other way round).
However, can any properties of similar matrices follow from this, such as the characteristic polynomial, determinant or eigenvalues?
linear-algebra abstract-algebra matrices
Say I have the following:
$Z = A^T B A$
where $Z$ is an $ntimes n$ matrix, $B$ is an $m times m$ matrix, and $A$ is a $m times n$ matrix, $n<m$.
Furthermore, the columns of $A$ are orthogonal, and $B$ is a positive definite matrix and $Z$ is symmetric tridiagonal.
This bears similarities to two similar $mtimes m$ matrices, $X$ and $Y$, requiring Y = $P^{-1}XP$ for some invertible matrix $P$.
Obviously in my case, $B$ and $Z$ don't have the same dimensions, and as $A$ is a truncated orthogonal matrix, it only has the property $A^TA=I$ (and not the other way round).
However, can any properties of similar matrices follow from this, such as the characteristic polynomial, determinant or eigenvalues?
linear-algebra abstract-algebra matrices
linear-algebra abstract-algebra matrices
asked 2 days ago
Thomas Smith
685
685
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
Extend $A$ to an orthogonal matrix $Q=pmatrix{A&ast}$. Then $Z$ is the leading principal $ntimes n$ submatrix of $Q^TBQ$. Therefore $Z$ is positive definite and by Cauchy interlacing inequality, the $i$-th smallest eigenvalue of $Z$ is bounded below by the $i$-th smallest eigenvalue of $B$.
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
Extend $A$ to an orthogonal matrix $Q=pmatrix{A&ast}$. Then $Z$ is the leading principal $ntimes n$ submatrix of $Q^TBQ$. Therefore $Z$ is positive definite and by Cauchy interlacing inequality, the $i$-th smallest eigenvalue of $Z$ is bounded below by the $i$-th smallest eigenvalue of $B$.
add a comment |
up vote
0
down vote
Extend $A$ to an orthogonal matrix $Q=pmatrix{A&ast}$. Then $Z$ is the leading principal $ntimes n$ submatrix of $Q^TBQ$. Therefore $Z$ is positive definite and by Cauchy interlacing inequality, the $i$-th smallest eigenvalue of $Z$ is bounded below by the $i$-th smallest eigenvalue of $B$.
add a comment |
up vote
0
down vote
up vote
0
down vote
Extend $A$ to an orthogonal matrix $Q=pmatrix{A&ast}$. Then $Z$ is the leading principal $ntimes n$ submatrix of $Q^TBQ$. Therefore $Z$ is positive definite and by Cauchy interlacing inequality, the $i$-th smallest eigenvalue of $Z$ is bounded below by the $i$-th smallest eigenvalue of $B$.
Extend $A$ to an orthogonal matrix $Q=pmatrix{A&ast}$. Then $Z$ is the leading principal $ntimes n$ submatrix of $Q^TBQ$. Therefore $Z$ is positive definite and by Cauchy interlacing inequality, the $i$-th smallest eigenvalue of $Z$ is bounded below by the $i$-th smallest eigenvalue of $B$.
answered 2 days ago
user1551
70.5k566125
70.5k566125
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020403%2fis-there-an-equivalent-property-of-similar-matrices-for-rectangular-matrices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown