Construct a sequence of continuous functions $f_n$ on $[0,infty)$ such that $f_n leq f_{n+1}$ and $f_n to 1$.












1












$begingroup$


I need to construct a sequence of continuous functions $f_n$ on $[0,infty)$ such that $f_n leq f_{n+1}$ for each $n$ and $f_n to 1$ pointwisely not uniformly.



I have been trying for 2 hours, the condition that $f_n to 1$ is easy and being continuous is also easy, but the condition that $f_n leq f_{n+1}$ is rather difficult for me. I can only construct decreasing ones.



Can anyone help with this?






calculus real-analysis analysis







share|cite|improve this question









$endgroup$








  • 3




    $begingroup$
    I'd recommend a variant of $arctan nx$.
    $endgroup$
    – Gerry Myerson
    Nov 30 '18 at 11:39






  • 2




    $begingroup$
    @GerryMyerson well $tanh(nx)$ requires even less effort :D
    $endgroup$
    – მამუკა ჯიბლაძე
    Nov 30 '18 at 12:01






  • 2




    $begingroup$
    if $f_nto 1$ point wise and not uniformly but $f_n$ are decreasing, you can use $2-f_n$ instead.
    $endgroup$
    – Calvin Khor
    Nov 30 '18 at 12:29










  • $begingroup$
    What about $f_n=1$ for all $n$?
    $endgroup$
    – dan_fulea
    Nov 30 '18 at 20:04










  • $begingroup$
    @dan_fulea, your example converges uniformly
    $endgroup$
    – bbw
    Nov 30 '18 at 21:18
















1












$begingroup$


I need to construct a sequence of continuous functions $f_n$ on $[0,infty)$ such that $f_n leq f_{n+1}$ for each $n$ and $f_n to 1$ pointwisely not uniformly.



I have been trying for 2 hours, the condition that $f_n to 1$ is easy and being continuous is also easy, but the condition that $f_n leq f_{n+1}$ is rather difficult for me. I can only construct decreasing ones.



Can anyone help with this?






calculus real-analysis analysis







share|cite|improve this question









$endgroup$








  • 3




    $begingroup$
    I'd recommend a variant of $arctan nx$.
    $endgroup$
    – Gerry Myerson
    Nov 30 '18 at 11:39






  • 2




    $begingroup$
    @GerryMyerson well $tanh(nx)$ requires even less effort :D
    $endgroup$
    – მამუკა ჯიბლაძე
    Nov 30 '18 at 12:01






  • 2




    $begingroup$
    if $f_nto 1$ point wise and not uniformly but $f_n$ are decreasing, you can use $2-f_n$ instead.
    $endgroup$
    – Calvin Khor
    Nov 30 '18 at 12:29










  • $begingroup$
    What about $f_n=1$ for all $n$?
    $endgroup$
    – dan_fulea
    Nov 30 '18 at 20:04










  • $begingroup$
    @dan_fulea, your example converges uniformly
    $endgroup$
    – bbw
    Nov 30 '18 at 21:18














1












1








1





$begingroup$


I need to construct a sequence of continuous functions $f_n$ on $[0,infty)$ such that $f_n leq f_{n+1}$ for each $n$ and $f_n to 1$ pointwisely not uniformly.



I have been trying for 2 hours, the condition that $f_n to 1$ is easy and being continuous is also easy, but the condition that $f_n leq f_{n+1}$ is rather difficult for me. I can only construct decreasing ones.



Can anyone help with this?






calculus real-analysis analysis







share|cite|improve this question









$endgroup$




I need to construct a sequence of continuous functions $f_n$ on $[0,infty)$ such that $f_n leq f_{n+1}$ for each $n$ and $f_n to 1$ pointwisely not uniformly.



I have been trying for 2 hours, the condition that $f_n to 1$ is easy and being continuous is also easy, but the condition that $f_n leq f_{n+1}$ is rather difficult for me. I can only construct decreasing ones.



Can anyone help with this?






calculus real-analysis analysis




calculus real-analysis analysis






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 30 '18 at 11:33









bbwbbw

50038




50038








  • 3




    $begingroup$
    I'd recommend a variant of $arctan nx$.
    $endgroup$
    – Gerry Myerson
    Nov 30 '18 at 11:39






  • 2




    $begingroup$
    @GerryMyerson well $tanh(nx)$ requires even less effort :D
    $endgroup$
    – მამუკა ჯიბლაძე
    Nov 30 '18 at 12:01






  • 2




    $begingroup$
    if $f_nto 1$ point wise and not uniformly but $f_n$ are decreasing, you can use $2-f_n$ instead.
    $endgroup$
    – Calvin Khor
    Nov 30 '18 at 12:29










  • $begingroup$
    What about $f_n=1$ for all $n$?
    $endgroup$
    – dan_fulea
    Nov 30 '18 at 20:04










  • $begingroup$
    @dan_fulea, your example converges uniformly
    $endgroup$
    – bbw
    Nov 30 '18 at 21:18














  • 3




    $begingroup$
    I'd recommend a variant of $arctan nx$.
    $endgroup$
    – Gerry Myerson
    Nov 30 '18 at 11:39






  • 2




    $begingroup$
    @GerryMyerson well $tanh(nx)$ requires even less effort :D
    $endgroup$
    – მამუკა ჯიბლაძე
    Nov 30 '18 at 12:01






  • 2




    $begingroup$
    if $f_nto 1$ point wise and not uniformly but $f_n$ are decreasing, you can use $2-f_n$ instead.
    $endgroup$
    – Calvin Khor
    Nov 30 '18 at 12:29










  • $begingroup$
    What about $f_n=1$ for all $n$?
    $endgroup$
    – dan_fulea
    Nov 30 '18 at 20:04










  • $begingroup$
    @dan_fulea, your example converges uniformly
    $endgroup$
    – bbw
    Nov 30 '18 at 21:18








3




3




$begingroup$
I'd recommend a variant of $arctan nx$.
$endgroup$
– Gerry Myerson
Nov 30 '18 at 11:39




$begingroup$
I'd recommend a variant of $arctan nx$.
$endgroup$
– Gerry Myerson
Nov 30 '18 at 11:39




2




2




$begingroup$
@GerryMyerson well $tanh(nx)$ requires even less effort :D
$endgroup$
– მამუკა ჯიბლაძე
Nov 30 '18 at 12:01




$begingroup$
@GerryMyerson well $tanh(nx)$ requires even less effort :D
$endgroup$
– მამუკა ჯიბლაძე
Nov 30 '18 at 12:01




2




2




$begingroup$
if $f_nto 1$ point wise and not uniformly but $f_n$ are decreasing, you can use $2-f_n$ instead.
$endgroup$
– Calvin Khor
Nov 30 '18 at 12:29




$begingroup$
if $f_nto 1$ point wise and not uniformly but $f_n$ are decreasing, you can use $2-f_n$ instead.
$endgroup$
– Calvin Khor
Nov 30 '18 at 12:29












$begingroup$
What about $f_n=1$ for all $n$?
$endgroup$
– dan_fulea
Nov 30 '18 at 20:04




$begingroup$
What about $f_n=1$ for all $n$?
$endgroup$
– dan_fulea
Nov 30 '18 at 20:04












$begingroup$
@dan_fulea, your example converges uniformly
$endgroup$
– bbw
Nov 30 '18 at 21:18




$begingroup$
@dan_fulea, your example converges uniformly
$endgroup$
– bbw
Nov 30 '18 at 21:18










2 Answers
2






active

oldest

votes


















3












$begingroup$

You may take $f_n$ to be $1$ on $[0,n]$, decrease linearly from $1$ to $0$ on $[n,n-1]$, and be $0$ on $[n+1, +infty[$. The formula is



$$f_n(x) = begin{cases}
1 & text{if } x le n\
1 - (x-n) & text{if } n < x le n+1 \
0 & text{if } n+1 < x\
end{cases}$$



The sequence $(f_n)_{n ge 0}$ is increasing, and converges point wise $f_n to 1$, but not uniformly (what is $|f_{n}-1|_{infty}$ ?).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Oh right ! Thanks for spotting my mistake !
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:10



















1












$begingroup$

Let $$f_n(x)=begin{cases}cos {pi xover 2n}&,quad 0le xle n\0& ,quad x>nend{cases}$$and you're done.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:19













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%2f3019986%2fconstruct-a-sequence-of-continuous-functions-f-n-on-0-infty-such-that-f%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









3












$begingroup$

You may take $f_n$ to be $1$ on $[0,n]$, decrease linearly from $1$ to $0$ on $[n,n-1]$, and be $0$ on $[n+1, +infty[$. The formula is



$$f_n(x) = begin{cases}
1 & text{if } x le n\
1 - (x-n) & text{if } n < x le n+1 \
0 & text{if } n+1 < x\
end{cases}$$



The sequence $(f_n)_{n ge 0}$ is increasing, and converges point wise $f_n to 1$, but not uniformly (what is $|f_{n}-1|_{infty}$ ?).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Oh right ! Thanks for spotting my mistake !
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:10
















3












$begingroup$

You may take $f_n$ to be $1$ on $[0,n]$, decrease linearly from $1$ to $0$ on $[n,n-1]$, and be $0$ on $[n+1, +infty[$. The formula is



$$f_n(x) = begin{cases}
1 & text{if } x le n\
1 - (x-n) & text{if } n < x le n+1 \
0 & text{if } n+1 < x\
end{cases}$$



The sequence $(f_n)_{n ge 0}$ is increasing, and converges point wise $f_n to 1$, but not uniformly (what is $|f_{n}-1|_{infty}$ ?).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Oh right ! Thanks for spotting my mistake !
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:10














3












3








3





$begingroup$

You may take $f_n$ to be $1$ on $[0,n]$, decrease linearly from $1$ to $0$ on $[n,n-1]$, and be $0$ on $[n+1, +infty[$. The formula is



$$f_n(x) = begin{cases}
1 & text{if } x le n\
1 - (x-n) & text{if } n < x le n+1 \
0 & text{if } n+1 < x\
end{cases}$$



The sequence $(f_n)_{n ge 0}$ is increasing, and converges point wise $f_n to 1$, but not uniformly (what is $|f_{n}-1|_{infty}$ ?).






share|cite|improve this answer











$endgroup$



You may take $f_n$ to be $1$ on $[0,n]$, decrease linearly from $1$ to $0$ on $[n,n-1]$, and be $0$ on $[n+1, +infty[$. The formula is



$$f_n(x) = begin{cases}
1 & text{if } x le n\
1 - (x-n) & text{if } n < x le n+1 \
0 & text{if } n+1 < x\
end{cases}$$



The sequence $(f_n)_{n ge 0}$ is increasing, and converges point wise $f_n to 1$, but not uniformly (what is $|f_{n}-1|_{infty}$ ?).







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 30 '18 at 12:19

























answered Nov 30 '18 at 12:02









Joel CohenJoel Cohen

7,32412137




7,32412137












  • $begingroup$
    Oh right ! Thanks for spotting my mistake !
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:10


















  • $begingroup$
    Oh right ! Thanks for spotting my mistake !
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:10
















$begingroup$
Oh right ! Thanks for spotting my mistake !
$endgroup$
– Joel Cohen
Nov 30 '18 at 12:10




$begingroup$
Oh right ! Thanks for spotting my mistake !
$endgroup$
– Joel Cohen
Nov 30 '18 at 12:10











1












$begingroup$

Let $$f_n(x)=begin{cases}cos {pi xover 2n}&,quad 0le xle n\0& ,quad x>nend{cases}$$and you're done.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:19


















1












$begingroup$

Let $$f_n(x)=begin{cases}cos {pi xover 2n}&,quad 0le xle n\0& ,quad x>nend{cases}$$and you're done.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:19
















1












1








1





$begingroup$

Let $$f_n(x)=begin{cases}cos {pi xover 2n}&,quad 0le xle n\0& ,quad x>nend{cases}$$and you're done.






share|cite|improve this answer











$endgroup$



Let $$f_n(x)=begin{cases}cos {pi xover 2n}&,quad 0le xle n\0& ,quad x>nend{cases}$$and you're done.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 30 '18 at 11:47

























answered Nov 30 '18 at 11:40









Mostafa AyazMostafa Ayaz

15.6k3939




15.6k3939












  • $begingroup$
    Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:19




















  • $begingroup$
    Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
    $endgroup$
    – Joel Cohen
    Nov 30 '18 at 12:19


















$begingroup$
Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
$endgroup$
– Joel Cohen
Nov 30 '18 at 12:19






$begingroup$
Nice idea ! I think it would also work by replacing $x mapsto cos(pi x /2)$ with any continuous function $f : [0,1] to [0,1]$ that decreases from $1$ do $0$ (you may for example take $1-frac{x}{n}$ on $[0,n]$)
$endgroup$
– Joel Cohen
Nov 30 '18 at 12:19




















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%2f3019986%2fconstruct-a-sequence-of-continuous-functions-f-n-on-0-infty-such-that-f%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

Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

Image
2 2 I have a Zotero bibliography in Overleaf. I use biblatex . usepackage[backend=biber,citestyle=authoryear]{biblatex} addbibresource{zoteroALH.bib} Bibliography entries look like: @book{de_saint-gervais_uniformization_2016, title = {Uniformization of {Riemann} {Surfaces}}, isbn = {978-3-03719-145-3}, url = {https://www.ems-ph.org/books/book.php?proj_nr=198&srch=series%7Chem}, urldate = {2019-02-03}, author = {de Saint-Gervais, Paul Henri}, year = {2016}, doi = {10.4171/145} } In the bibliography down the paper the reference shows like this: There is the DOI, great, but also the URL which is unnecessary when the DOI is there. How can I remove the URL when the DOI is present? biblatex bibliographies overleaf zote
Read more

ComboBox Display Member on multiple fields

Image
2 I'm trying to set the .DisplayMember property of a ComboBox in C#, but I want to bind it to multiple columns in the .DataSouce . My SQL looks like this: SELECT PersNbr, PersFirstName, PersMiddleName, PersLastName FROM Pers WHERE PersNbr = :persNbr; I'm saving this query in a DataTable so each column selected has it's own column in the Datatable . I want to make the .DisplayMember a combination of PersFirstName + PersMiddleName + PersLastName so their full name appears like this: comboBox.DisplayMemeber = "PersFirstName" + "PersMiddleName" + "PersLastName" I know I can just to this on the query: SELECT PersNbr, (PersFirstName || PersMiddleName || PersLastName) PersName and then just do this: comboBox.DisplayMember = "PersName"; but I
Read more

Is it possible to collect Nectar points via Trainline?

Image
2 Since I am not eligible for any Railcard, the only available discount/bonus scheme is Nectar Card for me. GWR, SWR, LNER and Virgin Trains allow to collect Nectar points and I have already linked a card to my GWR account. A friend suggested me to use Trainline App, because it can search for bus tickets either. I had a look at the application, but could not see any option for Nectar. Is there a way to collect Nectar points when I buy tickets via Trainline? uk trains loyalty-programs trainline share | improve this question asked Dec 2 '18 at 15:50 ahmedus 3,224 5 19 49
Read more