Geometric multiplicity of the largest eigenvalue












4












$begingroup$


Let
$$
A= begin{bmatrix}
a & 2f & 0 \
2f & b & 3f \
0 & 3f & c
end{bmatrix},
$$

where $a$, $b$, $c$, $f$ are real numbers and $fneq 0$. Find the geometric multiplicity of the largest eigenvalue of $A$.



I don't think I have to use the characteristic equation. Or do I?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Welcome to MSE. You do have a math editor. It is Latex. See math.meta.stackexchange.com/questions/5020/….
    $endgroup$
    – mathcounterexamples.net
    Jan 17 at 9:13










  • $begingroup$
    This same question was asked a couple of weeks ago (math.stackexchange.com/q/3063378/265466) and got no response.
    $endgroup$
    – amd
    Jan 17 at 22:50
















4












$begingroup$


Let
$$
A= begin{bmatrix}
a & 2f & 0 \
2f & b & 3f \
0 & 3f & c
end{bmatrix},
$$

where $a$, $b$, $c$, $f$ are real numbers and $fneq 0$. Find the geometric multiplicity of the largest eigenvalue of $A$.



I don't think I have to use the characteristic equation. Or do I?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Welcome to MSE. You do have a math editor. It is Latex. See math.meta.stackexchange.com/questions/5020/….
    $endgroup$
    – mathcounterexamples.net
    Jan 17 at 9:13










  • $begingroup$
    This same question was asked a couple of weeks ago (math.stackexchange.com/q/3063378/265466) and got no response.
    $endgroup$
    – amd
    Jan 17 at 22:50














4












4








4


0



$begingroup$


Let
$$
A= begin{bmatrix}
a & 2f & 0 \
2f & b & 3f \
0 & 3f & c
end{bmatrix},
$$

where $a$, $b$, $c$, $f$ are real numbers and $fneq 0$. Find the geometric multiplicity of the largest eigenvalue of $A$.



I don't think I have to use the characteristic equation. Or do I?










share|cite|improve this question











$endgroup$




Let
$$
A= begin{bmatrix}
a & 2f & 0 \
2f & b & 3f \
0 & 3f & c
end{bmatrix},
$$

where $a$, $b$, $c$, $f$ are real numbers and $fneq 0$. Find the geometric multiplicity of the largest eigenvalue of $A$.



I don't think I have to use the characteristic equation. Or do I?







linear-algebra eigenvalues-eigenvectors






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 25 at 10:21









amWhy

1




1










asked Jan 17 at 8:01









A.CA.C

213




213












  • $begingroup$
    Welcome to MSE. You do have a math editor. It is Latex. See math.meta.stackexchange.com/questions/5020/….
    $endgroup$
    – mathcounterexamples.net
    Jan 17 at 9:13










  • $begingroup$
    This same question was asked a couple of weeks ago (math.stackexchange.com/q/3063378/265466) and got no response.
    $endgroup$
    – amd
    Jan 17 at 22:50


















  • $begingroup$
    Welcome to MSE. You do have a math editor. It is Latex. See math.meta.stackexchange.com/questions/5020/….
    $endgroup$
    – mathcounterexamples.net
    Jan 17 at 9:13










  • $begingroup$
    This same question was asked a couple of weeks ago (math.stackexchange.com/q/3063378/265466) and got no response.
    $endgroup$
    – amd
    Jan 17 at 22:50
















$begingroup$
Welcome to MSE. You do have a math editor. It is Latex. See math.meta.stackexchange.com/questions/5020/….
$endgroup$
– mathcounterexamples.net
Jan 17 at 9:13




$begingroup$
Welcome to MSE. You do have a math editor. It is Latex. See math.meta.stackexchange.com/questions/5020/….
$endgroup$
– mathcounterexamples.net
Jan 17 at 9:13












$begingroup$
This same question was asked a couple of weeks ago (math.stackexchange.com/q/3063378/265466) and got no response.
$endgroup$
– amd
Jan 17 at 22:50




$begingroup$
This same question was asked a couple of weeks ago (math.stackexchange.com/q/3063378/265466) and got no response.
$endgroup$
– amd
Jan 17 at 22:50










2 Answers
2






active

oldest

votes


















2












$begingroup$

let $lambda $ be an eigen value then
$$A - lambda I =
begin{bmatrix}
a-lambda & 2f & 0 \
2f & b-lambda & 3f \
0 & 3f & c-lambda \
end{bmatrix}
$$

then $ Rank(A-lambda I )$ = 2 because



Minor wrt $a_{31}$ = $begin{vmatrix} 2f & 0 \
b-lambda & 3f \
end{vmatrix} = 6f^{2} ne 0$
as $ f ne 0$



So geometric multiplicity of $ lambda = 3 - Rank(A-lambda I ) = 1$ for all Eigen Values of this matrix irrespective of $ lambda$.



Hence the geometric multiplicity of the largest eigenvalue of A also equals 1.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
    $endgroup$
    – Widawensen
    Jan 28 at 16:35












  • $begingroup$
    @Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:36








  • 1




    $begingroup$
    From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
    $endgroup$
    – Widawensen
    Jan 28 at 16:39












  • $begingroup$
    Yes got your point. Thanks for sharing.
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:40










  • $begingroup$
    O.k. Now answer is accurate.
    $endgroup$
    – Widawensen
    Jan 28 at 16:42



















0












$begingroup$

We can check the matrix for some values (matrix is symmetric so it has only real eigenvalues)



Substitute for example $a=b=c=f=1$.

For this you have $λ_1 = 1 + sqrt{13}$, $λ_2 = 1 - sqrt{13}$ , $λ_3=1$.



More generally for $a=b=c=n$ and $f $

(matrix of the form $nI+fB$ where $B= begin{bmatrix}
0 & 2 & 0 \
2 & 0 & 3 \
0 & 3 & 0
end{bmatrix}$
)



you have $λ_1 = n+fsqrt{13}$, $λ_2 = n -fsqrt{13}$ , $λ_3=n$.



Evidently at least for some pattern of values multiplicity is just $1$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
    $endgroup$
    – Widawensen
    Jan 25 at 16:42













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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076720%2fgeometric-multiplicity-of-the-largest-eigenvalue%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









2












$begingroup$

let $lambda $ be an eigen value then
$$A - lambda I =
begin{bmatrix}
a-lambda & 2f & 0 \
2f & b-lambda & 3f \
0 & 3f & c-lambda \
end{bmatrix}
$$

then $ Rank(A-lambda I )$ = 2 because



Minor wrt $a_{31}$ = $begin{vmatrix} 2f & 0 \
b-lambda & 3f \
end{vmatrix} = 6f^{2} ne 0$
as $ f ne 0$



So geometric multiplicity of $ lambda = 3 - Rank(A-lambda I ) = 1$ for all Eigen Values of this matrix irrespective of $ lambda$.



Hence the geometric multiplicity of the largest eigenvalue of A also equals 1.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
    $endgroup$
    – Widawensen
    Jan 28 at 16:35












  • $begingroup$
    @Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:36








  • 1




    $begingroup$
    From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
    $endgroup$
    – Widawensen
    Jan 28 at 16:39












  • $begingroup$
    Yes got your point. Thanks for sharing.
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:40










  • $begingroup$
    O.k. Now answer is accurate.
    $endgroup$
    – Widawensen
    Jan 28 at 16:42
















2












$begingroup$

let $lambda $ be an eigen value then
$$A - lambda I =
begin{bmatrix}
a-lambda & 2f & 0 \
2f & b-lambda & 3f \
0 & 3f & c-lambda \
end{bmatrix}
$$

then $ Rank(A-lambda I )$ = 2 because



Minor wrt $a_{31}$ = $begin{vmatrix} 2f & 0 \
b-lambda & 3f \
end{vmatrix} = 6f^{2} ne 0$
as $ f ne 0$



So geometric multiplicity of $ lambda = 3 - Rank(A-lambda I ) = 1$ for all Eigen Values of this matrix irrespective of $ lambda$.



Hence the geometric multiplicity of the largest eigenvalue of A also equals 1.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
    $endgroup$
    – Widawensen
    Jan 28 at 16:35












  • $begingroup$
    @Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:36








  • 1




    $begingroup$
    From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
    $endgroup$
    – Widawensen
    Jan 28 at 16:39












  • $begingroup$
    Yes got your point. Thanks for sharing.
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:40










  • $begingroup$
    O.k. Now answer is accurate.
    $endgroup$
    – Widawensen
    Jan 28 at 16:42














2












2








2





$begingroup$

let $lambda $ be an eigen value then
$$A - lambda I =
begin{bmatrix}
a-lambda & 2f & 0 \
2f & b-lambda & 3f \
0 & 3f & c-lambda \
end{bmatrix}
$$

then $ Rank(A-lambda I )$ = 2 because



Minor wrt $a_{31}$ = $begin{vmatrix} 2f & 0 \
b-lambda & 3f \
end{vmatrix} = 6f^{2} ne 0$
as $ f ne 0$



So geometric multiplicity of $ lambda = 3 - Rank(A-lambda I ) = 1$ for all Eigen Values of this matrix irrespective of $ lambda$.



Hence the geometric multiplicity of the largest eigenvalue of A also equals 1.






share|cite|improve this answer











$endgroup$



let $lambda $ be an eigen value then
$$A - lambda I =
begin{bmatrix}
a-lambda & 2f & 0 \
2f & b-lambda & 3f \
0 & 3f & c-lambda \
end{bmatrix}
$$

then $ Rank(A-lambda I )$ = 2 because



Minor wrt $a_{31}$ = $begin{vmatrix} 2f & 0 \
b-lambda & 3f \
end{vmatrix} = 6f^{2} ne 0$
as $ f ne 0$



So geometric multiplicity of $ lambda = 3 - Rank(A-lambda I ) = 1$ for all Eigen Values of this matrix irrespective of $ lambda$.



Hence the geometric multiplicity of the largest eigenvalue of A also equals 1.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 28 at 16:40

























answered Jan 26 at 13:19









Pradeep BihaniPradeep Bihani

499




499












  • $begingroup$
    You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
    $endgroup$
    – Widawensen
    Jan 28 at 16:35












  • $begingroup$
    @Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:36








  • 1




    $begingroup$
    From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
    $endgroup$
    – Widawensen
    Jan 28 at 16:39












  • $begingroup$
    Yes got your point. Thanks for sharing.
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:40










  • $begingroup$
    O.k. Now answer is accurate.
    $endgroup$
    – Widawensen
    Jan 28 at 16:42


















  • $begingroup$
    You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
    $endgroup$
    – Widawensen
    Jan 28 at 16:35












  • $begingroup$
    @Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:36








  • 1




    $begingroup$
    From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
    $endgroup$
    – Widawensen
    Jan 28 at 16:39












  • $begingroup$
    Yes got your point. Thanks for sharing.
    $endgroup$
    – Pradeep Bihani
    Jan 28 at 16:40










  • $begingroup$
    O.k. Now answer is accurate.
    $endgroup$
    – Widawensen
    Jan 28 at 16:42
















$begingroup$
You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
$endgroup$
– Widawensen
Jan 28 at 16:35






$begingroup$
You have written $N=R$ . I think $N+R=3$ See en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem. Principal minor is wrt diagonal entries, I suppose.
$endgroup$
– Widawensen
Jan 28 at 16:35














$begingroup$
@Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
$endgroup$
– Pradeep Bihani
Jan 28 at 16:36






$begingroup$
@Widawensen I am new to this forum. Please correct me If I am missing something here 1. $N(A-lambda I) = Rank(A-lambda I )$ because Null space here will be equal to rank of the matrix span by $A-lambda$ right ? thanks for pointing out mistake for minor. I corrected the same
$endgroup$
– Pradeep Bihani
Jan 28 at 16:36






1




1




$begingroup$
From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
$endgroup$
– Widawensen
Jan 28 at 16:39






$begingroup$
From wikipedia - Nullity, the dimension of the kernel of a mathematical operator or null space of a matrix. Nullity is just =1 in this case, rank =2.
$endgroup$
– Widawensen
Jan 28 at 16:39














$begingroup$
Yes got your point. Thanks for sharing.
$endgroup$
– Pradeep Bihani
Jan 28 at 16:40




$begingroup$
Yes got your point. Thanks for sharing.
$endgroup$
– Pradeep Bihani
Jan 28 at 16:40












$begingroup$
O.k. Now answer is accurate.
$endgroup$
– Widawensen
Jan 28 at 16:42




$begingroup$
O.k. Now answer is accurate.
$endgroup$
– Widawensen
Jan 28 at 16:42











0












$begingroup$

We can check the matrix for some values (matrix is symmetric so it has only real eigenvalues)



Substitute for example $a=b=c=f=1$.

For this you have $λ_1 = 1 + sqrt{13}$, $λ_2 = 1 - sqrt{13}$ , $λ_3=1$.



More generally for $a=b=c=n$ and $f $

(matrix of the form $nI+fB$ where $B= begin{bmatrix}
0 & 2 & 0 \
2 & 0 & 3 \
0 & 3 & 0
end{bmatrix}$
)



you have $λ_1 = n+fsqrt{13}$, $λ_2 = n -fsqrt{13}$ , $λ_3=n$.



Evidently at least for some pattern of values multiplicity is just $1$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
    $endgroup$
    – Widawensen
    Jan 25 at 16:42


















0












$begingroup$

We can check the matrix for some values (matrix is symmetric so it has only real eigenvalues)



Substitute for example $a=b=c=f=1$.

For this you have $λ_1 = 1 + sqrt{13}$, $λ_2 = 1 - sqrt{13}$ , $λ_3=1$.



More generally for $a=b=c=n$ and $f $

(matrix of the form $nI+fB$ where $B= begin{bmatrix}
0 & 2 & 0 \
2 & 0 & 3 \
0 & 3 & 0
end{bmatrix}$
)



you have $λ_1 = n+fsqrt{13}$, $λ_2 = n -fsqrt{13}$ , $λ_3=n$.



Evidently at least for some pattern of values multiplicity is just $1$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
    $endgroup$
    – Widawensen
    Jan 25 at 16:42
















0












0








0





$begingroup$

We can check the matrix for some values (matrix is symmetric so it has only real eigenvalues)



Substitute for example $a=b=c=f=1$.

For this you have $λ_1 = 1 + sqrt{13}$, $λ_2 = 1 - sqrt{13}$ , $λ_3=1$.



More generally for $a=b=c=n$ and $f $

(matrix of the form $nI+fB$ where $B= begin{bmatrix}
0 & 2 & 0 \
2 & 0 & 3 \
0 & 3 & 0
end{bmatrix}$
)



you have $λ_1 = n+fsqrt{13}$, $λ_2 = n -fsqrt{13}$ , $λ_3=n$.



Evidently at least for some pattern of values multiplicity is just $1$.






share|cite|improve this answer











$endgroup$



We can check the matrix for some values (matrix is symmetric so it has only real eigenvalues)



Substitute for example $a=b=c=f=1$.

For this you have $λ_1 = 1 + sqrt{13}$, $λ_2 = 1 - sqrt{13}$ , $λ_3=1$.



More generally for $a=b=c=n$ and $f $

(matrix of the form $nI+fB$ where $B= begin{bmatrix}
0 & 2 & 0 \
2 & 0 & 3 \
0 & 3 & 0
end{bmatrix}$
)



you have $λ_1 = n+fsqrt{13}$, $λ_2 = n -fsqrt{13}$ , $λ_3=n$.



Evidently at least for some pattern of values multiplicity is just $1$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 25 at 17:15

























answered Jan 25 at 16:21









WidawensenWidawensen

4,51321446




4,51321446












  • $begingroup$
    See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
    $endgroup$
    – Widawensen
    Jan 25 at 16:42




















  • $begingroup$
    See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
    $endgroup$
    – Widawensen
    Jan 25 at 16:42


















$begingroup$
See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
$endgroup$
– Widawensen
Jan 25 at 16:42






$begingroup$
See also for eigendecomposition of sym. matrices en.wikipedia.org/wiki/…
$endgroup$
– Widawensen
Jan 25 at 16:42




















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076720%2fgeometric-multiplicity-of-the-largest-eigenvalue%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith