Problem of the Week #101 - May 5th, 2014

  • MHB
  • Thread starter Chris L T521
  • Start date
In summary, the conversation revolved around the topic of time management and how to effectively prioritize tasks. The speakers discussed various strategies such as creating to-do lists, setting deadlines, and delegating tasks to others. They also emphasized the importance of self-discipline and avoiding distractions in order to stay focused. Overall, the conversation emphasized the importance of efficient time management for productivity and success.
  • #1
Chris L T521
Gold Member
MHB
915
0
Here's this week's problem!

-----

Problem
: Let $X$ be a topological space and let $Y$ be a metric space. Let $f_n:X\rightarrow Y$ be a sequence of continuous functions. Let $x_n$ be a sequence of points of $X$ converging to $x$. Show that if the sequence $(f_n)$ converges uniformly to $f$, then $(f_n(x_n))$ converges to $f(x)$.

-----

Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
  • #2
This week's problem was correctly answered by Ackbach and girdav.

You can find Ackbach's solution below.

[sp]Let $\varepsilon>0$.

Assume $X$ is a topological space, and $Y$ is a metric space with metric $d$. Let $f_n:X \to Y$ be a sequence of continuous functions converging uniformly to $f$. Let $\{x_n\}$ be a sequence of points of $X$ converging to $x\in X$. We wish to show that $\{f_{n}(x_{n})\}$ converges to $f(x)$.

Since $f_n$ converges uniformly to $f$, by definition, $(\forall \varepsilon>0)(\exists N_{f}\in \mathbb{Z}^{+})$ s.t. $(\forall x\in X)$ and $(\forall n\ge N_{f})$, $d(f_{n}(x),f(x))<\dfrac{\varepsilon}{2}$.

Since the $f_n$ are continuous, for any sequence $\{y_n\}\to y$, all in $X$, it must be that $\{f_n(y_n)\}\to f_n(y)$. This latter statement means that there exists $N_{c}$ such that for all $n\ge N_{c}$, it must be that $d(f_n(x_n),f_n(x))<\dfrac{\varepsilon}{2}$.

Let $N=\max(N_f,N_c)$, and assume $n\ge N$. It follows that
$$d(f_n(x_n),f(x))\le d(f_n(x_n),f_n(x))+d(f_n(x),f(x)) \le \frac{\varepsilon}{2}+\frac{\varepsilon}{2}=\varepsilon.$$

This proves that $\{f_n(x_n)\}\to f(x)$, as required.[/sp]
 

FAQ: Problem of the Week #101 - May 5th, 2014

What is the "Problem of the Week #101 - May 5th, 2014"?

The "Problem of the Week #101 - May 5th, 2014" is a weekly challenge presented by a scientific organization or community to engage individuals in solving a specific problem or puzzle related to science and mathematics.

Who can participate in the "Problem of the Week #101 - May 5th, 2014"?

Anyone with an interest in science and mathematics can participate in the "Problem of the Week #101 - May 5th, 2014." It is open to students, professionals, and anyone who enjoys solving challenging problems.

What is the purpose of the "Problem of the Week #101 - May 5th, 2014"?

The purpose of the "Problem of the Week #101 - May 5th, 2014" is to promote critical thinking and problem-solving skills in the field of science and mathematics. It also aims to encourage collaboration and engagement within the scientific community.

How can I submit my solution to the "Problem of the Week #101 - May 5th, 2014"?

To submit your solution to the "Problem of the Week #101 - May 5th, 2014," you can follow the submission guidelines provided by the organizing organization or community. This may include submitting your solution via email, an online form, or through a designated platform.

Are there any rewards for solving the "Problem of the Week #101 - May 5th, 2014"?

The rewards for solving the "Problem of the Week #101 - May 5th, 2014" may vary depending on the organizing organization or community. Some may offer prizes or recognition, while others may simply provide the satisfaction of solving a challenging problem. It is best to check with the organizing body for any specific rewards or incentives.

Similar threads

Replies
1
Views
1K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
1
Views
1K
Back
Top