How can we show that $(I-A)$ is invertible?
$begingroup$
$A$ is an $ntimes n$ matrix with $|A|≤a<1 $ . I need to prove that the matrix $(I-A)$ is invertible with $|(I-A)^{-1}|lefrac1{(1-a)}$.
It doesn't say anything more. The norm makes me confuse. How can we start to solve this. Could you please help?
matrices
$endgroup$
add a comment |
$begingroup$
$A$ is an $ntimes n$ matrix with $|A|≤a<1 $ . I need to prove that the matrix $(I-A)$ is invertible with $|(I-A)^{-1}|lefrac1{(1-a)}$.
It doesn't say anything more. The norm makes me confuse. How can we start to solve this. Could you please help?
matrices
$endgroup$
1
$begingroup$
Do you know of the geometric series?
$endgroup$
– Mariano Suárez-Álvarez
Feb 17 '12 at 6:39
$begingroup$
yes I know geometric series
$endgroup$
– rose
Feb 17 '12 at 6:50
add a comment |
$begingroup$
$A$ is an $ntimes n$ matrix with $|A|≤a<1 $ . I need to prove that the matrix $(I-A)$ is invertible with $|(I-A)^{-1}|lefrac1{(1-a)}$.
It doesn't say anything more. The norm makes me confuse. How can we start to solve this. Could you please help?
matrices
$endgroup$
$A$ is an $ntimes n$ matrix with $|A|≤a<1 $ . I need to prove that the matrix $(I-A)$ is invertible with $|(I-A)^{-1}|lefrac1{(1-a)}$.
It doesn't say anything more. The norm makes me confuse. How can we start to solve this. Could you please help?
matrices
matrices
edited Feb 17 '12 at 11:14
Asaf Karagila♦
303k32429761
303k32429761
asked Feb 17 '12 at 6:33
roserose
9315
9315
1
$begingroup$
Do you know of the geometric series?
$endgroup$
– Mariano Suárez-Álvarez
Feb 17 '12 at 6:39
$begingroup$
yes I know geometric series
$endgroup$
– rose
Feb 17 '12 at 6:50
add a comment |
1
$begingroup$
Do you know of the geometric series?
$endgroup$
– Mariano Suárez-Álvarez
Feb 17 '12 at 6:39
$begingroup$
yes I know geometric series
$endgroup$
– rose
Feb 17 '12 at 6:50
1
1
$begingroup$
Do you know of the geometric series?
$endgroup$
– Mariano Suárez-Álvarez
Feb 17 '12 at 6:39
$begingroup$
Do you know of the geometric series?
$endgroup$
– Mariano Suárez-Álvarez
Feb 17 '12 at 6:39
$begingroup$
yes I know geometric series
$endgroup$
– rose
Feb 17 '12 at 6:50
$begingroup$
yes I know geometric series
$endgroup$
– rose
Feb 17 '12 at 6:50
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
Hint: Show that a certain series converges in the norm $|cdot |$ and that this is an inverse for $I-A$.
$endgroup$
add a comment |
$begingroup$
You can also argue without using the geometric series. The matrix $I-A$ is invertible if and only if $lambda = 1$ is not an eigenvalue of $A$.
For a contradiction, assume $lambda = 1$ is an eigenvalue. Then $Ax = x$ for some $x$ with $|x| = 1$, so $|A| ge 1$.
$endgroup$
add a comment |
$begingroup$
$bf Hint$: Consider the series $sum_{n=0}^infty A^n$
$endgroup$
add a comment |
$begingroup$
Another way to show this is the following:
$I-A$ is invertible iff $ker(I-A) = {0}$.
Now, let $x in mathbb{R}^nbackslash { 0 }$. Then
$$
lVert x rVert leq lVert x-AxrVert + lVert Ax rVert leq lVert (I - A) x rVert +lVert A rVert lVert x rVert underset{text{Assumption}}{<} lVert (I - A) x rVert + lVert x rVert
$$
So $0 < lVert (I-A) x rVert$ and thus $x notin ker(I-A)$.
$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%2f110274%2fhow-can-we-show-that-i-a-is-invertible%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hint: Show that a certain series converges in the norm $|cdot |$ and that this is an inverse for $I-A$.
$endgroup$
add a comment |
$begingroup$
Hint: Show that a certain series converges in the norm $|cdot |$ and that this is an inverse for $I-A$.
$endgroup$
add a comment |
$begingroup$
Hint: Show that a certain series converges in the norm $|cdot |$ and that this is an inverse for $I-A$.
$endgroup$
Hint: Show that a certain series converges in the norm $|cdot |$ and that this is an inverse for $I-A$.
answered Feb 17 '12 at 6:40
Robert IsraelRobert Israel
321k23210462
321k23210462
add a comment |
add a comment |
$begingroup$
You can also argue without using the geometric series. The matrix $I-A$ is invertible if and only if $lambda = 1$ is not an eigenvalue of $A$.
For a contradiction, assume $lambda = 1$ is an eigenvalue. Then $Ax = x$ for some $x$ with $|x| = 1$, so $|A| ge 1$.
$endgroup$
add a comment |
$begingroup$
You can also argue without using the geometric series. The matrix $I-A$ is invertible if and only if $lambda = 1$ is not an eigenvalue of $A$.
For a contradiction, assume $lambda = 1$ is an eigenvalue. Then $Ax = x$ for some $x$ with $|x| = 1$, so $|A| ge 1$.
$endgroup$
add a comment |
$begingroup$
You can also argue without using the geometric series. The matrix $I-A$ is invertible if and only if $lambda = 1$ is not an eigenvalue of $A$.
For a contradiction, assume $lambda = 1$ is an eigenvalue. Then $Ax = x$ for some $x$ with $|x| = 1$, so $|A| ge 1$.
$endgroup$
You can also argue without using the geometric series. The matrix $I-A$ is invertible if and only if $lambda = 1$ is not an eigenvalue of $A$.
For a contradiction, assume $lambda = 1$ is an eigenvalue. Then $Ax = x$ for some $x$ with $|x| = 1$, so $|A| ge 1$.
answered Feb 17 '12 at 11:12
mrfmrf
37.4k54685
37.4k54685
add a comment |
add a comment |
$begingroup$
$bf Hint$: Consider the series $sum_{n=0}^infty A^n$
$endgroup$
add a comment |
$begingroup$
$bf Hint$: Consider the series $sum_{n=0}^infty A^n$
$endgroup$
add a comment |
$begingroup$
$bf Hint$: Consider the series $sum_{n=0}^infty A^n$
$endgroup$
$bf Hint$: Consider the series $sum_{n=0}^infty A^n$
answered Feb 17 '12 at 6:39
azarelazarel
11.1k22431
11.1k22431
add a comment |
add a comment |
$begingroup$
Another way to show this is the following:
$I-A$ is invertible iff $ker(I-A) = {0}$.
Now, let $x in mathbb{R}^nbackslash { 0 }$. Then
$$
lVert x rVert leq lVert x-AxrVert + lVert Ax rVert leq lVert (I - A) x rVert +lVert A rVert lVert x rVert underset{text{Assumption}}{<} lVert (I - A) x rVert + lVert x rVert
$$
So $0 < lVert (I-A) x rVert$ and thus $x notin ker(I-A)$.
$endgroup$
add a comment |
$begingroup$
Another way to show this is the following:
$I-A$ is invertible iff $ker(I-A) = {0}$.
Now, let $x in mathbb{R}^nbackslash { 0 }$. Then
$$
lVert x rVert leq lVert x-AxrVert + lVert Ax rVert leq lVert (I - A) x rVert +lVert A rVert lVert x rVert underset{text{Assumption}}{<} lVert (I - A) x rVert + lVert x rVert
$$
So $0 < lVert (I-A) x rVert$ and thus $x notin ker(I-A)$.
$endgroup$
add a comment |
$begingroup$
Another way to show this is the following:
$I-A$ is invertible iff $ker(I-A) = {0}$.
Now, let $x in mathbb{R}^nbackslash { 0 }$. Then
$$
lVert x rVert leq lVert x-AxrVert + lVert Ax rVert leq lVert (I - A) x rVert +lVert A rVert lVert x rVert underset{text{Assumption}}{<} lVert (I - A) x rVert + lVert x rVert
$$
So $0 < lVert (I-A) x rVert$ and thus $x notin ker(I-A)$.
$endgroup$
Another way to show this is the following:
$I-A$ is invertible iff $ker(I-A) = {0}$.
Now, let $x in mathbb{R}^nbackslash { 0 }$. Then
$$
lVert x rVert leq lVert x-AxrVert + lVert Ax rVert leq lVert (I - A) x rVert +lVert A rVert lVert x rVert underset{text{Assumption}}{<} lVert (I - A) x rVert + lVert x rVert
$$
So $0 < lVert (I-A) x rVert$ and thus $x notin ker(I-A)$.
answered Nov 27 '18 at 15:58
bruderjakob17bruderjakob17
1997
1997
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%2f110274%2fhow-can-we-show-that-i-a-is-invertible%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
1
$begingroup$
Do you know of the geometric series?
$endgroup$
– Mariano Suárez-Álvarez
Feb 17 '12 at 6:39
$begingroup$
yes I know geometric series
$endgroup$
– rose
Feb 17 '12 at 6:50