On a proof about rational functions and connected components
up vote
1
down vote
favorite
I'm trying to follow a demonstration of the following:
Here $Q$ is a complex function and $S^1$ is the unitary circle.
Let $S = Q^{-1}([-1,1])$ where $Q(z)$ is a rational function of degree at most $2n$ such that $Q(S^1) subset mathbb{R}$. If $S cap S^1$ has at least $2n$ connected components then $S$ is the union of $2n$ subintervals of $S^1$.
The autor start saying that $Q$ and $Q'$ has degree at most $2n$ and since $Q(S^1) subset mathbb{R}$ that must exist at least one zero of $Q'(z)$ in each component of $S^1 - S$, then that is no zero of $Q'(z)$ in $S$, which implies that each connected component of $S cap S^1$ is mapped diffeomorphically onto [-1,1].
I'm really not familiar with the tool he used here (I'm not even know what kind of theorem he uses on these affirmations), can someone clarify that for me?
general-topology complex-analysis differential-topology
add a comment |
up vote
1
down vote
favorite
I'm trying to follow a demonstration of the following:
Here $Q$ is a complex function and $S^1$ is the unitary circle.
Let $S = Q^{-1}([-1,1])$ where $Q(z)$ is a rational function of degree at most $2n$ such that $Q(S^1) subset mathbb{R}$. If $S cap S^1$ has at least $2n$ connected components then $S$ is the union of $2n$ subintervals of $S^1$.
The autor start saying that $Q$ and $Q'$ has degree at most $2n$ and since $Q(S^1) subset mathbb{R}$ that must exist at least one zero of $Q'(z)$ in each component of $S^1 - S$, then that is no zero of $Q'(z)$ in $S$, which implies that each connected component of $S cap S^1$ is mapped diffeomorphically onto [-1,1].
I'm really not familiar with the tool he used here (I'm not even know what kind of theorem he uses on these affirmations), can someone clarify that for me?
general-topology complex-analysis differential-topology
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I'm trying to follow a demonstration of the following:
Here $Q$ is a complex function and $S^1$ is the unitary circle.
Let $S = Q^{-1}([-1,1])$ where $Q(z)$ is a rational function of degree at most $2n$ such that $Q(S^1) subset mathbb{R}$. If $S cap S^1$ has at least $2n$ connected components then $S$ is the union of $2n$ subintervals of $S^1$.
The autor start saying that $Q$ and $Q'$ has degree at most $2n$ and since $Q(S^1) subset mathbb{R}$ that must exist at least one zero of $Q'(z)$ in each component of $S^1 - S$, then that is no zero of $Q'(z)$ in $S$, which implies that each connected component of $S cap S^1$ is mapped diffeomorphically onto [-1,1].
I'm really not familiar with the tool he used here (I'm not even know what kind of theorem he uses on these affirmations), can someone clarify that for me?
general-topology complex-analysis differential-topology
I'm trying to follow a demonstration of the following:
Here $Q$ is a complex function and $S^1$ is the unitary circle.
Let $S = Q^{-1}([-1,1])$ where $Q(z)$ is a rational function of degree at most $2n$ such that $Q(S^1) subset mathbb{R}$. If $S cap S^1$ has at least $2n$ connected components then $S$ is the union of $2n$ subintervals of $S^1$.
The autor start saying that $Q$ and $Q'$ has degree at most $2n$ and since $Q(S^1) subset mathbb{R}$ that must exist at least one zero of $Q'(z)$ in each component of $S^1 - S$, then that is no zero of $Q'(z)$ in $S$, which implies that each connected component of $S cap S^1$ is mapped diffeomorphically onto [-1,1].
I'm really not familiar with the tool he used here (I'm not even know what kind of theorem he uses on these affirmations), can someone clarify that for me?
general-topology complex-analysis differential-topology
general-topology complex-analysis differential-topology
edited Nov 24 at 1:27
asked Nov 6 at 23:50
Lucas Resende
1266
1266
add a comment |
add a comment |
active
oldest
votes
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',
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%2f2987883%2fon-a-proof-about-rational-functions-and-connected-components%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f2987883%2fon-a-proof-about-rational-functions-and-connected-components%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