Maximum eigenvalue of $uv^T+(uv^T)^T$
$begingroup$
What is the maximum eigenvalue of $mathbf A$ where $mathbf A =mathbf{Q} + mathbf{Q}^{T}$ and $mathbf{Q} = uv^{T}$ ?
$u$ and $v$ are two unit vectors. I know the maximum eigenvalue of $textbf{Q}$ is $u^{T}v$. However, I cannot deduce a relation of maximum eigen value of sum of two outer product matrices.
Is there any relation between Positive semidefinite matrices, max. eigen value and sum?
linear-algebra eigenvalues-eigenvectors
$endgroup$
add a comment |
$begingroup$
What is the maximum eigenvalue of $mathbf A$ where $mathbf A =mathbf{Q} + mathbf{Q}^{T}$ and $mathbf{Q} = uv^{T}$ ?
$u$ and $v$ are two unit vectors. I know the maximum eigenvalue of $textbf{Q}$ is $u^{T}v$. However, I cannot deduce a relation of maximum eigen value of sum of two outer product matrices.
Is there any relation between Positive semidefinite matrices, max. eigen value and sum?
linear-algebra eigenvalues-eigenvectors
$endgroup$
$begingroup$
Related : math.stackexchange.com/questions/1637362/…
$endgroup$
– Arnaud D.
Dec 14 '18 at 15:08
add a comment |
$begingroup$
What is the maximum eigenvalue of $mathbf A$ where $mathbf A =mathbf{Q} + mathbf{Q}^{T}$ and $mathbf{Q} = uv^{T}$ ?
$u$ and $v$ are two unit vectors. I know the maximum eigenvalue of $textbf{Q}$ is $u^{T}v$. However, I cannot deduce a relation of maximum eigen value of sum of two outer product matrices.
Is there any relation between Positive semidefinite matrices, max. eigen value and sum?
linear-algebra eigenvalues-eigenvectors
$endgroup$
What is the maximum eigenvalue of $mathbf A$ where $mathbf A =mathbf{Q} + mathbf{Q}^{T}$ and $mathbf{Q} = uv^{T}$ ?
$u$ and $v$ are two unit vectors. I know the maximum eigenvalue of $textbf{Q}$ is $u^{T}v$. However, I cannot deduce a relation of maximum eigen value of sum of two outer product matrices.
Is there any relation between Positive semidefinite matrices, max. eigen value and sum?
linear-algebra eigenvalues-eigenvectors
linear-algebra eigenvalues-eigenvectors
edited Dec 14 '18 at 15:01
StubbornAtom
5,49711138
5,49711138
asked Dec 14 '18 at 12:00
joejoe
305
305
$begingroup$
Related : math.stackexchange.com/questions/1637362/…
$endgroup$
– Arnaud D.
Dec 14 '18 at 15:08
add a comment |
$begingroup$
Related : math.stackexchange.com/questions/1637362/…
$endgroup$
– Arnaud D.
Dec 14 '18 at 15:08
$begingroup$
Related : math.stackexchange.com/questions/1637362/…
$endgroup$
– Arnaud D.
Dec 14 '18 at 15:08
$begingroup$
Related : math.stackexchange.com/questions/1637362/…
$endgroup$
– Arnaud D.
Dec 14 '18 at 15:08
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
We know that $A$ has rank at most equal to $2$. Let $lambda_1,lambda_2$ denote the (possibly) non-zero eigenvalues of $A$. These eigenvalues satisfy
$$
begin{align*}
lambda_1 + lambda_2 &= operatorname{tr}(A) = 2(u^Tv)\
lambda_1^2 + lambda_2^2 &= operatorname{tr}(A^2) = operatorname{tr}((u^Tv)(uv^T + vu^T) + (v^Tv)uu^T + (u^Tu)vv^T)\
&= 2[(u^Tv)^2 + (u^Tu)(v^Tv)]
end{align*}
$$
We can solve these equations for $lambda_1$ and $lambda_2$.
In particular, we note that
$$
lambda_1 lambda_2 = frac 12 [(lambda_1 + lambda_2)^2 - (lambda_1^2 + lambda_2^2)] = (u^Tv)^2 - (u^Tu)(v^Tv)
$$
which means that the $lambda_i$ are the two solutions to the quadratic equation
$$
lambda^2 - [2(u^Tv)]lambda + [(u^Tv)^2 - (u^Tu)(v^Tv)] = 0
$$
which means that the larger eigenvalue will be given by
$$
lambda = (u^Tv) + sqrt{(u^Tv)^2 - [(u^Tv)^2 - (u^Tu)(v^Tv)]} =
u^Tv + sqrt{u^Tu}sqrt{v^Tv} = u^Tv + 1
$$
Another approach:
Write $v = au + bv_perp$, where $u_perp$ is a unit vector orthogonal to $u$. Notably, $a = u^Tv$, and $a^2 + b^2 = 1$. We have
$$
A = uv^T + v^Tu =
2auu^T + buu_perp^T + bu_perp u^T
$$
That is, if $U$ is the matrix whose columns are $u,u_perp$, then we have $A = UMU^T$, where
$$
M = pmatrix{2a&b\b&0}
$$
Let $W$ be such that $[U W]$ is an orthogonal matrix. We then have
$$
A = pmatrix{U & W}pmatrix{M & 0\0 & 0} pmatrix{U & W}^T
$$
That is, $A$ is similar to the block-diagonal matrix $operatorname{diag}(M,0)$. Conclude that the eigenvalues of $M$ are the non-zero eigenvalues of $A$.
The characteristic polynomial of $M$ is the equation on $lambda$ given above.
$endgroup$
add a comment |
$begingroup$
Generally, $Q+Q^T$'s maximum eigenvalue is $langle u,vrangle + lVert urVertlVert vrVert$. We can see this in another (perhaps geometric) way. Note that any symmetric matrix $A$ has maximum eigenvalue equal to
$$
lambda_{max}(A) = max_{lVert xrVert = 1} x^TAx.
$$ In this case, we have $$x^T(Q + Q^T)x = x^T(uv^T+vu^T)x = 2langle x,uranglelangle x,vrangle$$ where $langle a,brangle = a^Tb$ denotes the standard inner product. Suppose $u,v$ are unit vectors with $$cos(theta(u,v)) = langle u,vrangle$$ where $theta(u,v)$ is an angle between $u$ and $v$. Assume $theta(u,x) = phi$. Then we have $theta(v,x)geq theta(u,v)-phi, $ and hence that
$$
2langle x,uranglelangle x,vrangleleq 2cos (phi)cdotcos(theta(u,v)-phi) = cos(theta(u,v)) + cos(theta(u,v)-2phi)leq langle u,vrangle +1,
$$ where equality holds when $phi = frac{theta(u,v)}{2}$. This proves the result. For the general case, let $u'=frac{1}{lVert urVert}u$ and $v'=frac{1}{lVert vrVert}v$ to get $$lVert urVertlVert vrVert(langle u',v'rangle+1)=langle u,vrangle + lVert urVertlVert vrVert.$$
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3039278%2fmaximum-eigenvalue-of-uvtuvtt%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$
We know that $A$ has rank at most equal to $2$. Let $lambda_1,lambda_2$ denote the (possibly) non-zero eigenvalues of $A$. These eigenvalues satisfy
$$
begin{align*}
lambda_1 + lambda_2 &= operatorname{tr}(A) = 2(u^Tv)\
lambda_1^2 + lambda_2^2 &= operatorname{tr}(A^2) = operatorname{tr}((u^Tv)(uv^T + vu^T) + (v^Tv)uu^T + (u^Tu)vv^T)\
&= 2[(u^Tv)^2 + (u^Tu)(v^Tv)]
end{align*}
$$
We can solve these equations for $lambda_1$ and $lambda_2$.
In particular, we note that
$$
lambda_1 lambda_2 = frac 12 [(lambda_1 + lambda_2)^2 - (lambda_1^2 + lambda_2^2)] = (u^Tv)^2 - (u^Tu)(v^Tv)
$$
which means that the $lambda_i$ are the two solutions to the quadratic equation
$$
lambda^2 - [2(u^Tv)]lambda + [(u^Tv)^2 - (u^Tu)(v^Tv)] = 0
$$
which means that the larger eigenvalue will be given by
$$
lambda = (u^Tv) + sqrt{(u^Tv)^2 - [(u^Tv)^2 - (u^Tu)(v^Tv)]} =
u^Tv + sqrt{u^Tu}sqrt{v^Tv} = u^Tv + 1
$$
Another approach:
Write $v = au + bv_perp$, where $u_perp$ is a unit vector orthogonal to $u$. Notably, $a = u^Tv$, and $a^2 + b^2 = 1$. We have
$$
A = uv^T + v^Tu =
2auu^T + buu_perp^T + bu_perp u^T
$$
That is, if $U$ is the matrix whose columns are $u,u_perp$, then we have $A = UMU^T$, where
$$
M = pmatrix{2a&b\b&0}
$$
Let $W$ be such that $[U W]$ is an orthogonal matrix. We then have
$$
A = pmatrix{U & W}pmatrix{M & 0\0 & 0} pmatrix{U & W}^T
$$
That is, $A$ is similar to the block-diagonal matrix $operatorname{diag}(M,0)$. Conclude that the eigenvalues of $M$ are the non-zero eigenvalues of $A$.
The characteristic polynomial of $M$ is the equation on $lambda$ given above.
$endgroup$
add a comment |
$begingroup$
We know that $A$ has rank at most equal to $2$. Let $lambda_1,lambda_2$ denote the (possibly) non-zero eigenvalues of $A$. These eigenvalues satisfy
$$
begin{align*}
lambda_1 + lambda_2 &= operatorname{tr}(A) = 2(u^Tv)\
lambda_1^2 + lambda_2^2 &= operatorname{tr}(A^2) = operatorname{tr}((u^Tv)(uv^T + vu^T) + (v^Tv)uu^T + (u^Tu)vv^T)\
&= 2[(u^Tv)^2 + (u^Tu)(v^Tv)]
end{align*}
$$
We can solve these equations for $lambda_1$ and $lambda_2$.
In particular, we note that
$$
lambda_1 lambda_2 = frac 12 [(lambda_1 + lambda_2)^2 - (lambda_1^2 + lambda_2^2)] = (u^Tv)^2 - (u^Tu)(v^Tv)
$$
which means that the $lambda_i$ are the two solutions to the quadratic equation
$$
lambda^2 - [2(u^Tv)]lambda + [(u^Tv)^2 - (u^Tu)(v^Tv)] = 0
$$
which means that the larger eigenvalue will be given by
$$
lambda = (u^Tv) + sqrt{(u^Tv)^2 - [(u^Tv)^2 - (u^Tu)(v^Tv)]} =
u^Tv + sqrt{u^Tu}sqrt{v^Tv} = u^Tv + 1
$$
Another approach:
Write $v = au + bv_perp$, where $u_perp$ is a unit vector orthogonal to $u$. Notably, $a = u^Tv$, and $a^2 + b^2 = 1$. We have
$$
A = uv^T + v^Tu =
2auu^T + buu_perp^T + bu_perp u^T
$$
That is, if $U$ is the matrix whose columns are $u,u_perp$, then we have $A = UMU^T$, where
$$
M = pmatrix{2a&b\b&0}
$$
Let $W$ be such that $[U W]$ is an orthogonal matrix. We then have
$$
A = pmatrix{U & W}pmatrix{M & 0\0 & 0} pmatrix{U & W}^T
$$
That is, $A$ is similar to the block-diagonal matrix $operatorname{diag}(M,0)$. Conclude that the eigenvalues of $M$ are the non-zero eigenvalues of $A$.
The characteristic polynomial of $M$ is the equation on $lambda$ given above.
$endgroup$
add a comment |
$begingroup$
We know that $A$ has rank at most equal to $2$. Let $lambda_1,lambda_2$ denote the (possibly) non-zero eigenvalues of $A$. These eigenvalues satisfy
$$
begin{align*}
lambda_1 + lambda_2 &= operatorname{tr}(A) = 2(u^Tv)\
lambda_1^2 + lambda_2^2 &= operatorname{tr}(A^2) = operatorname{tr}((u^Tv)(uv^T + vu^T) + (v^Tv)uu^T + (u^Tu)vv^T)\
&= 2[(u^Tv)^2 + (u^Tu)(v^Tv)]
end{align*}
$$
We can solve these equations for $lambda_1$ and $lambda_2$.
In particular, we note that
$$
lambda_1 lambda_2 = frac 12 [(lambda_1 + lambda_2)^2 - (lambda_1^2 + lambda_2^2)] = (u^Tv)^2 - (u^Tu)(v^Tv)
$$
which means that the $lambda_i$ are the two solutions to the quadratic equation
$$
lambda^2 - [2(u^Tv)]lambda + [(u^Tv)^2 - (u^Tu)(v^Tv)] = 0
$$
which means that the larger eigenvalue will be given by
$$
lambda = (u^Tv) + sqrt{(u^Tv)^2 - [(u^Tv)^2 - (u^Tu)(v^Tv)]} =
u^Tv + sqrt{u^Tu}sqrt{v^Tv} = u^Tv + 1
$$
Another approach:
Write $v = au + bv_perp$, where $u_perp$ is a unit vector orthogonal to $u$. Notably, $a = u^Tv$, and $a^2 + b^2 = 1$. We have
$$
A = uv^T + v^Tu =
2auu^T + buu_perp^T + bu_perp u^T
$$
That is, if $U$ is the matrix whose columns are $u,u_perp$, then we have $A = UMU^T$, where
$$
M = pmatrix{2a&b\b&0}
$$
Let $W$ be such that $[U W]$ is an orthogonal matrix. We then have
$$
A = pmatrix{U & W}pmatrix{M & 0\0 & 0} pmatrix{U & W}^T
$$
That is, $A$ is similar to the block-diagonal matrix $operatorname{diag}(M,0)$. Conclude that the eigenvalues of $M$ are the non-zero eigenvalues of $A$.
The characteristic polynomial of $M$ is the equation on $lambda$ given above.
$endgroup$
We know that $A$ has rank at most equal to $2$. Let $lambda_1,lambda_2$ denote the (possibly) non-zero eigenvalues of $A$. These eigenvalues satisfy
$$
begin{align*}
lambda_1 + lambda_2 &= operatorname{tr}(A) = 2(u^Tv)\
lambda_1^2 + lambda_2^2 &= operatorname{tr}(A^2) = operatorname{tr}((u^Tv)(uv^T + vu^T) + (v^Tv)uu^T + (u^Tu)vv^T)\
&= 2[(u^Tv)^2 + (u^Tu)(v^Tv)]
end{align*}
$$
We can solve these equations for $lambda_1$ and $lambda_2$.
In particular, we note that
$$
lambda_1 lambda_2 = frac 12 [(lambda_1 + lambda_2)^2 - (lambda_1^2 + lambda_2^2)] = (u^Tv)^2 - (u^Tu)(v^Tv)
$$
which means that the $lambda_i$ are the two solutions to the quadratic equation
$$
lambda^2 - [2(u^Tv)]lambda + [(u^Tv)^2 - (u^Tu)(v^Tv)] = 0
$$
which means that the larger eigenvalue will be given by
$$
lambda = (u^Tv) + sqrt{(u^Tv)^2 - [(u^Tv)^2 - (u^Tu)(v^Tv)]} =
u^Tv + sqrt{u^Tu}sqrt{v^Tv} = u^Tv + 1
$$
Another approach:
Write $v = au + bv_perp$, where $u_perp$ is a unit vector orthogonal to $u$. Notably, $a = u^Tv$, and $a^2 + b^2 = 1$. We have
$$
A = uv^T + v^Tu =
2auu^T + buu_perp^T + bu_perp u^T
$$
That is, if $U$ is the matrix whose columns are $u,u_perp$, then we have $A = UMU^T$, where
$$
M = pmatrix{2a&b\b&0}
$$
Let $W$ be such that $[U W]$ is an orthogonal matrix. We then have
$$
A = pmatrix{U & W}pmatrix{M & 0\0 & 0} pmatrix{U & W}^T
$$
That is, $A$ is similar to the block-diagonal matrix $operatorname{diag}(M,0)$. Conclude that the eigenvalues of $M$ are the non-zero eigenvalues of $A$.
The characteristic polynomial of $M$ is the equation on $lambda$ given above.
edited Dec 14 '18 at 14:43
answered Dec 14 '18 at 14:06
OmnomnomnomOmnomnomnom
127k789177
127k789177
add a comment |
add a comment |
$begingroup$
Generally, $Q+Q^T$'s maximum eigenvalue is $langle u,vrangle + lVert urVertlVert vrVert$. We can see this in another (perhaps geometric) way. Note that any symmetric matrix $A$ has maximum eigenvalue equal to
$$
lambda_{max}(A) = max_{lVert xrVert = 1} x^TAx.
$$ In this case, we have $$x^T(Q + Q^T)x = x^T(uv^T+vu^T)x = 2langle x,uranglelangle x,vrangle$$ where $langle a,brangle = a^Tb$ denotes the standard inner product. Suppose $u,v$ are unit vectors with $$cos(theta(u,v)) = langle u,vrangle$$ where $theta(u,v)$ is an angle between $u$ and $v$. Assume $theta(u,x) = phi$. Then we have $theta(v,x)geq theta(u,v)-phi, $ and hence that
$$
2langle x,uranglelangle x,vrangleleq 2cos (phi)cdotcos(theta(u,v)-phi) = cos(theta(u,v)) + cos(theta(u,v)-2phi)leq langle u,vrangle +1,
$$ where equality holds when $phi = frac{theta(u,v)}{2}$. This proves the result. For the general case, let $u'=frac{1}{lVert urVert}u$ and $v'=frac{1}{lVert vrVert}v$ to get $$lVert urVertlVert vrVert(langle u',v'rangle+1)=langle u,vrangle + lVert urVertlVert vrVert.$$
$endgroup$
add a comment |
$begingroup$
Generally, $Q+Q^T$'s maximum eigenvalue is $langle u,vrangle + lVert urVertlVert vrVert$. We can see this in another (perhaps geometric) way. Note that any symmetric matrix $A$ has maximum eigenvalue equal to
$$
lambda_{max}(A) = max_{lVert xrVert = 1} x^TAx.
$$ In this case, we have $$x^T(Q + Q^T)x = x^T(uv^T+vu^T)x = 2langle x,uranglelangle x,vrangle$$ where $langle a,brangle = a^Tb$ denotes the standard inner product. Suppose $u,v$ are unit vectors with $$cos(theta(u,v)) = langle u,vrangle$$ where $theta(u,v)$ is an angle between $u$ and $v$. Assume $theta(u,x) = phi$. Then we have $theta(v,x)geq theta(u,v)-phi, $ and hence that
$$
2langle x,uranglelangle x,vrangleleq 2cos (phi)cdotcos(theta(u,v)-phi) = cos(theta(u,v)) + cos(theta(u,v)-2phi)leq langle u,vrangle +1,
$$ where equality holds when $phi = frac{theta(u,v)}{2}$. This proves the result. For the general case, let $u'=frac{1}{lVert urVert}u$ and $v'=frac{1}{lVert vrVert}v$ to get $$lVert urVertlVert vrVert(langle u',v'rangle+1)=langle u,vrangle + lVert urVertlVert vrVert.$$
$endgroup$
add a comment |
$begingroup$
Generally, $Q+Q^T$'s maximum eigenvalue is $langle u,vrangle + lVert urVertlVert vrVert$. We can see this in another (perhaps geometric) way. Note that any symmetric matrix $A$ has maximum eigenvalue equal to
$$
lambda_{max}(A) = max_{lVert xrVert = 1} x^TAx.
$$ In this case, we have $$x^T(Q + Q^T)x = x^T(uv^T+vu^T)x = 2langle x,uranglelangle x,vrangle$$ where $langle a,brangle = a^Tb$ denotes the standard inner product. Suppose $u,v$ are unit vectors with $$cos(theta(u,v)) = langle u,vrangle$$ where $theta(u,v)$ is an angle between $u$ and $v$. Assume $theta(u,x) = phi$. Then we have $theta(v,x)geq theta(u,v)-phi, $ and hence that
$$
2langle x,uranglelangle x,vrangleleq 2cos (phi)cdotcos(theta(u,v)-phi) = cos(theta(u,v)) + cos(theta(u,v)-2phi)leq langle u,vrangle +1,
$$ where equality holds when $phi = frac{theta(u,v)}{2}$. This proves the result. For the general case, let $u'=frac{1}{lVert urVert}u$ and $v'=frac{1}{lVert vrVert}v$ to get $$lVert urVertlVert vrVert(langle u',v'rangle+1)=langle u,vrangle + lVert urVertlVert vrVert.$$
$endgroup$
Generally, $Q+Q^T$'s maximum eigenvalue is $langle u,vrangle + lVert urVertlVert vrVert$. We can see this in another (perhaps geometric) way. Note that any symmetric matrix $A$ has maximum eigenvalue equal to
$$
lambda_{max}(A) = max_{lVert xrVert = 1} x^TAx.
$$ In this case, we have $$x^T(Q + Q^T)x = x^T(uv^T+vu^T)x = 2langle x,uranglelangle x,vrangle$$ where $langle a,brangle = a^Tb$ denotes the standard inner product. Suppose $u,v$ are unit vectors with $$cos(theta(u,v)) = langle u,vrangle$$ where $theta(u,v)$ is an angle between $u$ and $v$. Assume $theta(u,x) = phi$. Then we have $theta(v,x)geq theta(u,v)-phi, $ and hence that
$$
2langle x,uranglelangle x,vrangleleq 2cos (phi)cdotcos(theta(u,v)-phi) = cos(theta(u,v)) + cos(theta(u,v)-2phi)leq langle u,vrangle +1,
$$ where equality holds when $phi = frac{theta(u,v)}{2}$. This proves the result. For the general case, let $u'=frac{1}{lVert urVert}u$ and $v'=frac{1}{lVert vrVert}v$ to get $$lVert urVertlVert vrVert(langle u',v'rangle+1)=langle u,vrangle + lVert urVertlVert vrVert.$$
answered Dec 14 '18 at 15:26
SongSong
7,578423
7,578423
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.
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%2f3039278%2fmaximum-eigenvalue-of-uvtuvtt%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
$begingroup$
Related : math.stackexchange.com/questions/1637362/…
$endgroup$
– Arnaud D.
Dec 14 '18 at 15:08