Ensuring homographic sequences are well-defined
$begingroup$
Given a recursive homographic sequence
$begin{cases} a_0 in mathbb{R} text{ given} \
a_{n+1} = f(a_n) end{cases}$ where $f$ is an homographic function ($x longmapsto dfrac{ax+b}{cx+d}$), how can one determine all values of the first term $a_0$ for which the sequence is well defined.
For specific cases, $a_0$ given, one can just proceed by induction to check that for all $n$, $a_n neq dfrac{-d}{c}$.
My question is whether there is a general result regarding the well-definiteness of homographic sequences.
Thanks.
sequences-and-series recurrence-relations
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
$endgroup$
add a comment |
$begingroup$
Given a recursive homographic sequence
$begin{cases} a_0 in mathbb{R} text{ given} \
a_{n+1} = f(a_n) end{cases}$ where $f$ is an homographic function ($x longmapsto dfrac{ax+b}{cx+d}$), how can one determine all values of the first term $a_0$ for which the sequence is well defined.
For specific cases, $a_0$ given, one can just proceed by induction to check that for all $n$, $a_n neq dfrac{-d}{c}$.
My question is whether there is a general result regarding the well-definiteness of homographic sequences.
Thanks.
sequences-and-series recurrence-relations
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
$endgroup$
add a comment |
$begingroup$
Given a recursive homographic sequence
$begin{cases} a_0 in mathbb{R} text{ given} \
a_{n+1} = f(a_n) end{cases}$ where $f$ is an homographic function ($x longmapsto dfrac{ax+b}{cx+d}$), how can one determine all values of the first term $a_0$ for which the sequence is well defined.
For specific cases, $a_0$ given, one can just proceed by induction to check that for all $n$, $a_n neq dfrac{-d}{c}$.
My question is whether there is a general result regarding the well-definiteness of homographic sequences.
Thanks.
sequences-and-series recurrence-relations
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
$endgroup$
Given a recursive homographic sequence
$begin{cases} a_0 in mathbb{R} text{ given} \
a_{n+1} = f(a_n) end{cases}$ where $f$ is an homographic function ($x longmapsto dfrac{ax+b}{cx+d}$), how can one determine all values of the first term $a_0$ for which the sequence is well defined.
For specific cases, $a_0$ given, one can just proceed by induction to check that for all $n$, $a_n neq dfrac{-d}{c}$.
My question is whether there is a general result regarding the well-definiteness of homographic sequences.
Thanks.
sequences-and-series recurrence-relations
sequences-and-series recurrence-relations
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
edited Dec 10 '18 at 12:21
David G. Stork
11.3k41432
11.3k41432
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
asked Dec 10 '18 at 12:17
Oussama SarihOussama Sarih
48827
48827
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The "forbidden" values of $a_0$ are precisely those occurring in the (possibly finite) sequence ${y_n}_n$ given by
$$y_{n+1}=f^{-1}(y_n)=frac{dy_n-b}{-cy_n+a} $$
where $y_1=f^{-1}(infty)=-frac dc$
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
$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%2f3033838%2fensuring-homographic-sequences-are-well-defined%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$
The "forbidden" values of $a_0$ are precisely those occurring in the (possibly finite) sequence ${y_n}_n$ given by
$$y_{n+1}=f^{-1}(y_n)=frac{dy_n-b}{-cy_n+a} $$
where $y_1=f^{-1}(infty)=-frac dc$
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
$endgroup$
add a comment |
$begingroup$
The "forbidden" values of $a_0$ are precisely those occurring in the (possibly finite) sequence ${y_n}_n$ given by
$$y_{n+1}=f^{-1}(y_n)=frac{dy_n-b}{-cy_n+a} $$
where $y_1=f^{-1}(infty)=-frac dc$
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
$endgroup$
add a comment |
$begingroup$
The "forbidden" values of $a_0$ are precisely those occurring in the (possibly finite) sequence ${y_n}_n$ given by
$$y_{n+1}=f^{-1}(y_n)=frac{dy_n-b}{-cy_n+a} $$
where $y_1=f^{-1}(infty)=-frac dc$
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
$endgroup$
The "forbidden" values of $a_0$ are precisely those occurring in the (possibly finite) sequence ${y_n}_n$ given by
$$y_{n+1}=f^{-1}(y_n)=frac{dy_n-b}{-cy_n+a} $$
where $y_1=f^{-1}(infty)=-frac dc$
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
answered Dec 10 '18 at 19:23
Hagen von EitzenHagen von Eitzen
283k23272507
283k23272507
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%2f3033838%2fensuring-homographic-sequences-are-well-defined%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
