Subsequences of bounded monotonically increasing function

Click For Summary

Homework Help Overview

The discussion revolves around a sequence of monotonically increasing functions defined on the real numbers, constrained between 0 and 1. The original poster seeks to demonstrate the existence of a subsequence that converges to a defined function for every real number.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the convergence of subsequences for rational numbers and the definition of a limiting function based on the supremum of values from the sequence. There are questions about the continuity of the limiting function and the implications of discontinuities in the original function.

Discussion Status

Some participants have offered guidance on the continuity of the limiting function and the approach to constructing subsequences. There is an ongoing exploration of how to handle discontinuities and the implications for subsequence convergence.

Contextual Notes

Participants note the need to consider the continuity of the limiting function and the denseness of rational numbers in the discussion. There are also references to the constraints imposed by the nature of the functions and their boundedness.

RBG
Messages
14
Reaction score
0
Assume that ##\{f_n\}## is a sequence of monotonically increasing functions on ##\mathbb{R}## with ## 0\leq f_n(x) \leq 1 \forall x, n##. Show that there is a subsequence ##n_k## and a function ##f(x) = \underset{k\to\infty}{\lim}f_{n_k}(x)## for every ##x\in \mathbb{R}##.

(1) Show that some subsequence nk converges for all rational r. This isn't too hard.
(2) Define ##f(x) = \underset{r<x}{\sup}\{f(r)\}## where ##r## is rational and ##x## is arbitrary.
(3) Show ##f_{n_k} (x) \to f(x) \forall x## where ##f## is continuous.

This proof seems sketchy:

If ##f## is continuous then we need to show ##|f(x)-f_n(x)|<\epsilon## for any ##x,\epsilon>0## and sufficiently large ##n##. Well, ##|f(x)-f_n(x)|=|\underset{r<x}{\sup}\{f(r)\}-\underset{r<x}{\sup} \{f_n(r)\}|=|\underset{r<x}{\sup} \{f(r)-f_n(r)\}|=|\epsilon_2|## for sufficiently large ##n## by part a). Then changing the form of the epsilon's this would prove the claim.

Is this the right idea?

(4) Show that f has at most countably many discontinuities and so there. is a further subsequence nl along which fnl (x) → f(x) for every x ∈ R.

I showed that ##f## has at most countably many discontinuities, but how does this imply there is a subsequence that converges to ##f(x)## for all ##x##? Do I just "throw out" any function that "creates" a discontinuity? By this I mean, if ##f## is discontinuous at ##y## then remove all the functions in the sequence that either have values larger than ##f(y+)## at ##y## or functions with values smaller than ##f(y-)## at ##y##.
 
Physics news on Phys.org
Never mind.
 
Last edited:
RBG said:
Assume that ##\{f_n\}## is a sequence of monotonically increasing functions on ##\mathbb{R}## with ## 0\leq f_n(x) \leq 1 \forall x, n##. Show that there is a subsequence ##n_k## and a function ##f(x) = \underset{k\to\infty}{\lim}f_{n_k}(x)## for every ##x\in \mathbb{R}##.

(1) Show that some subsequence nk converges for all rational r. This isn't too hard.
(2) Define ##f(x) = \underset{r<x}{\sup}\{f(r)\}## where ##r## is rational and ##x## is arbitrary.
(3) Show ##f_{n_k} (x) \to f(x) \forall x## where ##f## is continuous.

This proof seems sketchy:

If ##f## is continuous then we need to show ##|f(x)-f_n(x)|<\epsilon## for any ##x,\epsilon>0## and sufficiently large ##n##. Well, ##|f(x)-f_n(x)|=|\underset{r<x}{\sup}\{f(r)\}-\underset{r<x}{\sup} \{f_n(r)\}|=|\underset{r<x}{\sup} \{f(r)-f_n(r)\}|=|\epsilon_2|## for sufficiently large ##n## by part a). Then changing the form of the epsilon's this would prove the claim.

Is this the right idea?
Can you explain this step:
##|f(x)-f_n(x)|=|\underset{r<x}{\sup}\{f(r)\}-\underset{r<x}{\sup} \{f_n(r)\}|##?
It looks as if you assume here that ##f_n## is continuous in ##x##, but that is not necessarily the case.
Also, you don't have to show that ##|f(x)-f_n(x)|<\epsilon## for any ##x,\epsilon>0## and sufficiently large ##n##. You have to prove that for the subsequence defined in 1): ##|f(x)-f_{n_k}(x)|<\epsilon## ...
Use that ##f## is monotonically increasing, the continuity of ##f## at ##x##, and the denseness of the rational numbers.

RBG said:
(4) Show that f has at most countably many discontinuities and so there. is a further subsequence nl along which fnl (x) → f(x) for every x ∈ R.

I showed that ##f## has at most countably many discontinuities, but how does this imply there is a subsequence that converges to ##f(x)## for all ##x##? Do I just "throw out" any function that "creates" a discontinuity? By this I mean, if ##f## is discontinuous at ##y## then remove all the functions in the sequence that either have values larger than ##f(y+)## at ##y## or functions with values smaller than ##f(y-)## at ##y##.
You can prove 4) in essentially the same way you constructed the subsequence in 1). That ##f## has at most countably many discontinuities is indeed the key.
 
Last edited:
Thank you!
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 20 ·
Replies
20
Views
3K
Replies
26
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
8
Views
2K