Is this subset of $M_4(mathbb R)$ connected?Are matrices which yield a given characteristic polynomial and have specified structure connected?Is the set of real matrices diagonalizable in $M_n(mathbb C)$ dense in the set of block like companion matrices?Are matrices which yield a given characteristic polynomial and have specified structure connected?When are almost block companion matrices which yield a given characteristic polynomial connected?Does this subset of $GL_n(mathbb R)$ have two connected components or more?How many connected components does this subset of $GL_n(mathbb R)$ have?Is this subset of $GL_5(mathbb R)$ under Vandermonde-like parametrization of square matrices path-connected?Does this subset of $GL_2(mathbb R)$ under Vandermonde-like parametrization have precisely two path-connected components?Is $A in E: A text has distinct eigenvalues$ dense in $E = A in M_n(mathbb R): max_i textRe(lambda_i(A))=0$?Are matrices diagonalizable dense in a specific parametrization of $M_5(mathbb R)$?Charaterize the boundary of the set $A in star: max_i textRe(lambda_i(A)) < 0$ where $star$ is some structure on $M_5(mathbb R)$
Codimension of non-flat locus
Why does Kotter return in Welcome Back Kotter?
Is it possible to do 50 km distance without any previous training?
Is it unprofessional to ask if a job posting on GlassDoor is real?
Did Shadowfax go to Valinor?
Modeling an IP Address
strTok function (thread safe, supports empty tokens, doesn't change string)
Alternative to sending password over mail?
What does the "remote control" for a QF-4 look like?
Is it tax fraud for an individual to declare non-taxable revenue as taxable income? (US tax laws)
Intersection point of 2 lines defined by 2 points each
Can a(n) = n/n+1 be written recursively?
Why doesn't H₄O²⁺ exist?
Does detail obscure or enhance action?
Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)
What's that red-plus icon near a text?
dbcc cleantable batch size explanation
tikz convert color string to hex value
Character reincarnated...as a snail
Why is 150k or 200k jobs considered good when there's 300k+ births a month?
A case of the sniffles
Paid for article while in US on F-1 visa?
What is the word for reserving something for yourself before others do?
How to format long polynomial?
Is this subset of $M_4(mathbb R)$ connected?
Are matrices which yield a given characteristic polynomial and have specified structure connected?Is the set of real matrices diagonalizable in $M_n(mathbb C)$ dense in the set of block like companion matrices?Are matrices which yield a given characteristic polynomial and have specified structure connected?When are almost block companion matrices which yield a given characteristic polynomial connected?Does this subset of $GL_n(mathbb R)$ have two connected components or more?How many connected components does this subset of $GL_n(mathbb R)$ have?Is this subset of $GL_5(mathbb R)$ under Vandermonde-like parametrization of square matrices path-connected?Does this subset of $GL_2(mathbb R)$ under Vandermonde-like parametrization have precisely two path-connected components?Is $A in E: A text has distinct eigenvalues$ dense in $E = A in M_n(mathbb R): max_i textRe(lambda_i(A))=0$?Are matrices diagonalizable dense in a specific parametrization of $M_5(mathbb R)$?Charaterize the boundary of the set $A in star: max_i textRe(lambda_i(A)) < 0$ where $star$ is some structure on $M_5(mathbb R)$
$begingroup$
Let us consider an affine structure $star$ of $M_4(mathbb R)$ which has following form
beginalign*
beginpmatrix
0 & * & 0 & * \
1 & * & 0 & * \
0 & * & 0 & * \
0 & * & 1 & *
endpmatrix,
endalign*
where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $star$ since the upper left block and lower right block can be considered as in companion form. We further concern this set
beginalign*
mathcal E = A in star: max_i left( lambda_i(A) right) < 0 .
endalign*
In other words, all elements in $mathcal E$ has above defined structure and all eigenvalues on the left open half plane. I am trying to determine whether the set $mathcal E$ is connected.
My first try was to determine for a fixed monic polynomial, whether all realizations in $star$ is connected. If this is true, for any $A_1, A_2 in mathcal E$, we may first connect them to a companion form in $star$ (by making the $32$ entry to be $1$ and other entries in the second column to be $0$) without changing the eigenvalues, and then the companion forms are connected as a consequence of property of polynomials. But as the question I asked a while ago, this is only true if it has at least one real eigenvalue.
I strongly believe the set is connected. The question is related but I am not sure it is that related. Because the condition there is much more strict. I was asking to connect all realizations in $star$ yielding the same characteristic equation without changing its eigenvalues. Here we allow this to vary inside $mathcal E$.
linear-algebra general-topology path-connected
$endgroup$
add a comment |
$begingroup$
Let us consider an affine structure $star$ of $M_4(mathbb R)$ which has following form
beginalign*
beginpmatrix
0 & * & 0 & * \
1 & * & 0 & * \
0 & * & 0 & * \
0 & * & 1 & *
endpmatrix,
endalign*
where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $star$ since the upper left block and lower right block can be considered as in companion form. We further concern this set
beginalign*
mathcal E = A in star: max_i left( lambda_i(A) right) < 0 .
endalign*
In other words, all elements in $mathcal E$ has above defined structure and all eigenvalues on the left open half plane. I am trying to determine whether the set $mathcal E$ is connected.
My first try was to determine for a fixed monic polynomial, whether all realizations in $star$ is connected. If this is true, for any $A_1, A_2 in mathcal E$, we may first connect them to a companion form in $star$ (by making the $32$ entry to be $1$ and other entries in the second column to be $0$) without changing the eigenvalues, and then the companion forms are connected as a consequence of property of polynomials. But as the question I asked a while ago, this is only true if it has at least one real eigenvalue.
I strongly believe the set is connected. The question is related but I am not sure it is that related. Because the condition there is much more strict. I was asking to connect all realizations in $star$ yielding the same characteristic equation without changing its eigenvalues. Here we allow this to vary inside $mathcal E$.
linear-algebra general-topology path-connected
$endgroup$
add a comment |
$begingroup$
Let us consider an affine structure $star$ of $M_4(mathbb R)$ which has following form
beginalign*
beginpmatrix
0 & * & 0 & * \
1 & * & 0 & * \
0 & * & 0 & * \
0 & * & 1 & *
endpmatrix,
endalign*
where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $star$ since the upper left block and lower right block can be considered as in companion form. We further concern this set
beginalign*
mathcal E = A in star: max_i left( lambda_i(A) right) < 0 .
endalign*
In other words, all elements in $mathcal E$ has above defined structure and all eigenvalues on the left open half plane. I am trying to determine whether the set $mathcal E$ is connected.
My first try was to determine for a fixed monic polynomial, whether all realizations in $star$ is connected. If this is true, for any $A_1, A_2 in mathcal E$, we may first connect them to a companion form in $star$ (by making the $32$ entry to be $1$ and other entries in the second column to be $0$) without changing the eigenvalues, and then the companion forms are connected as a consequence of property of polynomials. But as the question I asked a while ago, this is only true if it has at least one real eigenvalue.
I strongly believe the set is connected. The question is related but I am not sure it is that related. Because the condition there is much more strict. I was asking to connect all realizations in $star$ yielding the same characteristic equation without changing its eigenvalues. Here we allow this to vary inside $mathcal E$.
linear-algebra general-topology path-connected
$endgroup$
Let us consider an affine structure $star$ of $M_4(mathbb R)$ which has following form
beginalign*
beginpmatrix
0 & * & 0 & * \
1 & * & 0 & * \
0 & * & 0 & * \
0 & * & 1 & *
endpmatrix,
endalign*
where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $star$ since the upper left block and lower right block can be considered as in companion form. We further concern this set
beginalign*
mathcal E = A in star: max_i left( lambda_i(A) right) < 0 .
endalign*
In other words, all elements in $mathcal E$ has above defined structure and all eigenvalues on the left open half plane. I am trying to determine whether the set $mathcal E$ is connected.
My first try was to determine for a fixed monic polynomial, whether all realizations in $star$ is connected. If this is true, for any $A_1, A_2 in mathcal E$, we may first connect them to a companion form in $star$ (by making the $32$ entry to be $1$ and other entries in the second column to be $0$) without changing the eigenvalues, and then the companion forms are connected as a consequence of property of polynomials. But as the question I asked a while ago, this is only true if it has at least one real eigenvalue.
I strongly believe the set is connected. The question is related but I am not sure it is that related. Because the condition there is much more strict. I was asking to connect all realizations in $star$ yielding the same characteristic equation without changing its eigenvalues. Here we allow this to vary inside $mathcal E$.
linear-algebra general-topology path-connected
linear-algebra general-topology path-connected
edited Feb 12 at 6:52
MyCindy2012
asked Feb 12 at 6:05
MyCindy2012MyCindy2012
12911
12911
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
One may prove the set is connected by stability analysis of matrices. In following, I will concern the transpose of $star$ and this does not change the connectedness.
Note $star approx mathbb R^2 times 4$. Putting $A= pmatrix0 & 1 & 0 & 0\ 0 & 0 & 0 & 0 \ 0 & 0 & 0 & 1 \ 0 & 0 & 0 & 0$ and $B = pmatrix0 & 0 \ 1 & 0 \0 & 0 \ 0 & 1$, the set $mathcal E$ can be identified by a subset $mathcal F subset mathbb R^2 times 4$ with $mathcal F = X subset mathbb R^2 times 4: A-BX text is stable$.(see definition of stable matrix.) Now by Lyapunov matrix theory, $X in mathcal F$ if and only if there exists some positive definite matrix $P > 0$, such that $(A-BX) P + P(A-BX)^T < 0$ ($< 0$ means negative definite.) A change of variable $Y=XP$ yields
beginalign
labeleq:1
tag$dagger$
AP + PA^T - BY - Y^TB^T < 0.
endalign
Observe the solution set $(P, Y)$ of $dagger$ is a convex set and thus connected. So $mathcal F$ is a continuous image under the map $(P, Y) mapsto YP^-1$.
This method does not reveal too much of set structure which I think should be very nice. Hope someone can give a more transparent argument.
$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%2f3109731%2fis-this-subset-of-m-4-mathbb-r-connected%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
One may prove the set is connected by stability analysis of matrices. In following, I will concern the transpose of $star$ and this does not change the connectedness.
Note $star approx mathbb R^2 times 4$. Putting $A= pmatrix0 & 1 & 0 & 0\ 0 & 0 & 0 & 0 \ 0 & 0 & 0 & 1 \ 0 & 0 & 0 & 0$ and $B = pmatrix0 & 0 \ 1 & 0 \0 & 0 \ 0 & 1$, the set $mathcal E$ can be identified by a subset $mathcal F subset mathbb R^2 times 4$ with $mathcal F = X subset mathbb R^2 times 4: A-BX text is stable$.(see definition of stable matrix.) Now by Lyapunov matrix theory, $X in mathcal F$ if and only if there exists some positive definite matrix $P > 0$, such that $(A-BX) P + P(A-BX)^T < 0$ ($< 0$ means negative definite.) A change of variable $Y=XP$ yields
beginalign
labeleq:1
tag$dagger$
AP + PA^T - BY - Y^TB^T < 0.
endalign
Observe the solution set $(P, Y)$ of $dagger$ is a convex set and thus connected. So $mathcal F$ is a continuous image under the map $(P, Y) mapsto YP^-1$.
This method does not reveal too much of set structure which I think should be very nice. Hope someone can give a more transparent argument.
$endgroup$
add a comment |
$begingroup$
One may prove the set is connected by stability analysis of matrices. In following, I will concern the transpose of $star$ and this does not change the connectedness.
Note $star approx mathbb R^2 times 4$. Putting $A= pmatrix0 & 1 & 0 & 0\ 0 & 0 & 0 & 0 \ 0 & 0 & 0 & 1 \ 0 & 0 & 0 & 0$ and $B = pmatrix0 & 0 \ 1 & 0 \0 & 0 \ 0 & 1$, the set $mathcal E$ can be identified by a subset $mathcal F subset mathbb R^2 times 4$ with $mathcal F = X subset mathbb R^2 times 4: A-BX text is stable$.(see definition of stable matrix.) Now by Lyapunov matrix theory, $X in mathcal F$ if and only if there exists some positive definite matrix $P > 0$, such that $(A-BX) P + P(A-BX)^T < 0$ ($< 0$ means negative definite.) A change of variable $Y=XP$ yields
beginalign
labeleq:1
tag$dagger$
AP + PA^T - BY - Y^TB^T < 0.
endalign
Observe the solution set $(P, Y)$ of $dagger$ is a convex set and thus connected. So $mathcal F$ is a continuous image under the map $(P, Y) mapsto YP^-1$.
This method does not reveal too much of set structure which I think should be very nice. Hope someone can give a more transparent argument.
$endgroup$
add a comment |
$begingroup$
One may prove the set is connected by stability analysis of matrices. In following, I will concern the transpose of $star$ and this does not change the connectedness.
Note $star approx mathbb R^2 times 4$. Putting $A= pmatrix0 & 1 & 0 & 0\ 0 & 0 & 0 & 0 \ 0 & 0 & 0 & 1 \ 0 & 0 & 0 & 0$ and $B = pmatrix0 & 0 \ 1 & 0 \0 & 0 \ 0 & 1$, the set $mathcal E$ can be identified by a subset $mathcal F subset mathbb R^2 times 4$ with $mathcal F = X subset mathbb R^2 times 4: A-BX text is stable$.(see definition of stable matrix.) Now by Lyapunov matrix theory, $X in mathcal F$ if and only if there exists some positive definite matrix $P > 0$, such that $(A-BX) P + P(A-BX)^T < 0$ ($< 0$ means negative definite.) A change of variable $Y=XP$ yields
beginalign
labeleq:1
tag$dagger$
AP + PA^T - BY - Y^TB^T < 0.
endalign
Observe the solution set $(P, Y)$ of $dagger$ is a convex set and thus connected. So $mathcal F$ is a continuous image under the map $(P, Y) mapsto YP^-1$.
This method does not reveal too much of set structure which I think should be very nice. Hope someone can give a more transparent argument.
$endgroup$
One may prove the set is connected by stability analysis of matrices. In following, I will concern the transpose of $star$ and this does not change the connectedness.
Note $star approx mathbb R^2 times 4$. Putting $A= pmatrix0 & 1 & 0 & 0\ 0 & 0 & 0 & 0 \ 0 & 0 & 0 & 1 \ 0 & 0 & 0 & 0$ and $B = pmatrix0 & 0 \ 1 & 0 \0 & 0 \ 0 & 1$, the set $mathcal E$ can be identified by a subset $mathcal F subset mathbb R^2 times 4$ with $mathcal F = X subset mathbb R^2 times 4: A-BX text is stable$.(see definition of stable matrix.) Now by Lyapunov matrix theory, $X in mathcal F$ if and only if there exists some positive definite matrix $P > 0$, such that $(A-BX) P + P(A-BX)^T < 0$ ($< 0$ means negative definite.) A change of variable $Y=XP$ yields
beginalign
labeleq:1
tag$dagger$
AP + PA^T - BY - Y^TB^T < 0.
endalign
Observe the solution set $(P, Y)$ of $dagger$ is a convex set and thus connected. So $mathcal F$ is a continuous image under the map $(P, Y) mapsto YP^-1$.
This method does not reveal too much of set structure which I think should be very nice. Hope someone can give a more transparent argument.
edited Mar 21 at 16:55
answered Feb 14 at 17:39
user1101010user1101010
9011830
9011830
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%2f3109731%2fis-this-subset-of-m-4-mathbb-r-connected%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