Computing the spectral norm of a projection matrix The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Is the rank of a matrix the same of its transpose? If yes, how can I prove it?Convexity of the squared Frobenius norm of a matrixTwo norm of the identity matrixMatrix norm proofLipschitz continuity for generalized inverse matrixMatrix factorization by a full row rank matrix in MATLABBounding the matrix $2$-norm of a Frobenius matrixUpper bound on norm of linear projection on column space of $X$Frobenius Norm Inequality; Spectral Radius is smaller than Frobenius NormProof of infinity matrix norm
The following signatures were invalid: EXPKEYSIG 1397BC53640DB551
Huge performance difference of the command find with and without using %M option to show permissions
Button changing its text & action. Good or terrible?
Is 'stolen' appropriate word?
Can each chord in a progression create its own key?
Does Parliament hold absolute power in the UK?
Are spiders unable to hurt humans, especially very small spiders?
How do spell lists change if the party levels up without taking a long rest?
Is every episode of "Where are my Pants?" identical?
What force causes entropy to increase?
Keeping a retro style to sci-fi spaceships?
Identify 80s or 90s comics with ripped creatures (not dwarves)
Make it rain characters
Presidential Pardon
First use of “packing” as in carrying a gun
Accepted by European university, rejected by all American ones I applied to? Possible reasons?
60's-70's movie: home appliances revolting against the owners
Was credit for the black hole image misappropriated?
Student Loan from years ago pops up and is taking my salary
Sort list of array linked objects by keys and values
My body leaves; my core can stay
Why are there uneven bright areas in this photo of black hole?
What do I do when my TA workload is more than expected?
Is there a way to generate uniformly distributed points on a sphere from a fixed amount of random real numbers per point?
Computing the spectral norm of a projection matrix
The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Is the rank of a matrix the same of its transpose? If yes, how can I prove it?Convexity of the squared Frobenius norm of a matrixTwo norm of the identity matrixMatrix norm proofLipschitz continuity for generalized inverse matrixMatrix factorization by a full row rank matrix in MATLABBounding the matrix $2$-norm of a Frobenius matrixUpper bound on norm of linear projection on column space of $X$Frobenius Norm Inequality; Spectral Radius is smaller than Frobenius NormProof of infinity matrix norm
$begingroup$
I was reading a paper in which there was an argument as trivial, but could not make myself sure about it. It is said that given a full row-rank matrix $A$, the norm (probably $ell_2$-induced matrix norm) of $A^T(AA^T)^-1A$ is one. Is that trivial, and correct for any given matrix $A$?
linear-algebra matrices projection-matrices matrix-norms spectral-norm
$endgroup$
add a comment |
$begingroup$
I was reading a paper in which there was an argument as trivial, but could not make myself sure about it. It is said that given a full row-rank matrix $A$, the norm (probably $ell_2$-induced matrix norm) of $A^T(AA^T)^-1A$ is one. Is that trivial, and correct for any given matrix $A$?
linear-algebra matrices projection-matrices matrix-norms spectral-norm
$endgroup$
add a comment |
$begingroup$
I was reading a paper in which there was an argument as trivial, but could not make myself sure about it. It is said that given a full row-rank matrix $A$, the norm (probably $ell_2$-induced matrix norm) of $A^T(AA^T)^-1A$ is one. Is that trivial, and correct for any given matrix $A$?
linear-algebra matrices projection-matrices matrix-norms spectral-norm
$endgroup$
I was reading a paper in which there was an argument as trivial, but could not make myself sure about it. It is said that given a full row-rank matrix $A$, the norm (probably $ell_2$-induced matrix norm) of $A^T(AA^T)^-1A$ is one. Is that trivial, and correct for any given matrix $A$?
linear-algebra matrices projection-matrices matrix-norms spectral-norm
linear-algebra matrices projection-matrices matrix-norms spectral-norm
edited Mar 31 at 7:42
Rodrigo de Azevedo
13.2k41962
13.2k41962
asked Jul 24 '18 at 10:02
Majid MohammadiMajid Mohammadi
275
275
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Given a fat matrix $rm A$ with full row rank,
$$rm P := A^top (A A^top)^-1 A$$
is the (symmetric) projection matrix that projects onto the row space of $rm A$. Every projection matrix has eigenvalues $0$ and $1$. Since $rm P$ is symmetric and positive semidefinite,
$$| rm P |_2 = sigma_max (rm P) = lambda_max (rm P) = 1$$
$endgroup$
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
1
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
add a comment |
$begingroup$
We recognize in that expression a projection matrix onto $operatornameRow(A)$ and since $A$ is a full row rank we have that
$$P=A^T(AA^T)^-1A implies supleftfrac,, xneq 0right=1$$
$endgroup$
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
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%2f2861176%2fcomputing-the-spectral-norm-of-a-projection-matrix%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Given a fat matrix $rm A$ with full row rank,
$$rm P := A^top (A A^top)^-1 A$$
is the (symmetric) projection matrix that projects onto the row space of $rm A$. Every projection matrix has eigenvalues $0$ and $1$. Since $rm P$ is symmetric and positive semidefinite,
$$| rm P |_2 = sigma_max (rm P) = lambda_max (rm P) = 1$$
$endgroup$
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
1
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
add a comment |
$begingroup$
Given a fat matrix $rm A$ with full row rank,
$$rm P := A^top (A A^top)^-1 A$$
is the (symmetric) projection matrix that projects onto the row space of $rm A$. Every projection matrix has eigenvalues $0$ and $1$. Since $rm P$ is symmetric and positive semidefinite,
$$| rm P |_2 = sigma_max (rm P) = lambda_max (rm P) = 1$$
$endgroup$
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
1
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
add a comment |
$begingroup$
Given a fat matrix $rm A$ with full row rank,
$$rm P := A^top (A A^top)^-1 A$$
is the (symmetric) projection matrix that projects onto the row space of $rm A$. Every projection matrix has eigenvalues $0$ and $1$. Since $rm P$ is symmetric and positive semidefinite,
$$| rm P |_2 = sigma_max (rm P) = lambda_max (rm P) = 1$$
$endgroup$
Given a fat matrix $rm A$ with full row rank,
$$rm P := A^top (A A^top)^-1 A$$
is the (symmetric) projection matrix that projects onto the row space of $rm A$. Every projection matrix has eigenvalues $0$ and $1$. Since $rm P$ is symmetric and positive semidefinite,
$$| rm P |_2 = sigma_max (rm P) = lambda_max (rm P) = 1$$
edited Jul 24 '18 at 10:44
answered Jul 24 '18 at 10:23
Rodrigo de AzevedoRodrigo de Azevedo
13.2k41962
13.2k41962
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
1
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
add a comment |
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
1
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
$begingroup$
what's the relation with this please? looks like transpose since it's instead $A(A^TA)^-1A^T$
$endgroup$
– BCLC
Jul 24 '18 at 11:26
1
1
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
$begingroup$
@BCLC Your projection matrix requires full column rank and projects onto the column space of $rm A$. Note that the column space of $rm A$ is the row space of $rm A^top$.
$endgroup$
– Rodrigo de Azevedo
Jul 24 '18 at 11:34
add a comment |
$begingroup$
We recognize in that expression a projection matrix onto $operatornameRow(A)$ and since $A$ is a full row rank we have that
$$P=A^T(AA^T)^-1A implies supleftfrac,, xneq 0right=1$$
$endgroup$
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
add a comment |
$begingroup$
We recognize in that expression a projection matrix onto $operatornameRow(A)$ and since $A$ is a full row rank we have that
$$P=A^T(AA^T)^-1A implies supleftfrac,, xneq 0right=1$$
$endgroup$
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
add a comment |
$begingroup$
We recognize in that expression a projection matrix onto $operatornameRow(A)$ and since $A$ is a full row rank we have that
$$P=A^T(AA^T)^-1A implies supleftfrac,, xneq 0right=1$$
$endgroup$
We recognize in that expression a projection matrix onto $operatornameRow(A)$ and since $A$ is a full row rank we have that
$$P=A^T(AA^T)^-1A implies supleftfrac,, xneq 0right=1$$
edited Jul 24 '18 at 10:26
answered Jul 24 '18 at 10:07
gimusigimusi
92.9k84594
92.9k84594
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
add a comment |
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo A is declared a full rank matrix.
$endgroup$
– gimusi
Jul 24 '18 at 10:17
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
$begingroup$
@RodrigodeAzevedo Opsssss...Thanks!
$endgroup$
– gimusi
Jul 24 '18 at 10:20
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.
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%2f2861176%2fcomputing-the-spectral-norm-of-a-projection-matrix%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