Uniform Convergence and the Uniform Metric

Click For Summary
SUMMARY

The discussion focuses on the concept of uniform convergence in the context of the uniform metric ρ on the space RX. It establishes that a sequence of functions (fn) converges uniformly to a function f if and only if it converges to f in the metric space (RX, ρ). The proof provided demonstrates that if (fn) converges in the metric space, then the supremum of the bounded metric ∂ converges to zero, thus satisfying the condition for uniform convergence. The discussion also clarifies the use of the TeX command \bar for typesetting metrics.

PREREQUISITES
  • Understanding of uniform convergence and its implications.
  • Familiarity with metric spaces, specifically RX and the uniform metric ρ.
  • Knowledge of bounded metrics and their definitions.
  • Proficiency in LaTeX typesetting for mathematical notation.
NEXT STEPS
  • Study the properties of uniform convergence in functional analysis.
  • Learn about the relationship between different types of convergence in metric spaces.
  • Explore the application of the supremum metric in various mathematical contexts.
  • Practice typesetting complex mathematical expressions using LaTeX.
USEFUL FOR

Mathematicians, students of analysis, and anyone studying convergence in metric spaces will benefit from this discussion.

jmjlt88
Messages
94
Reaction score
0
Let X be a set, and let fn : X---> R be a sequence of functions. Let ρ be the uniform metric on the space RX. Show that the sequence (fn) converges uniformly to the function f:X--> R if and only if the sequence (fn) converges to f as elements of the metric space (RX, ρ). [Note: the ρ's should have a bar over them.]

I have a question concerning one direction of our implication.

[My attempt at the solution.]

Since I do not know how to make a d with a bar over it, I'll use ∂ to denote the standard bounded metric relative to d.

Proof:

Assume the sequence (fn) converges to f as elements of the metric space (RX, ρ).

Then, for any ε>0, there is a positive integer N such that ρ(fn,f)<ε for all n≥N.

That is, for n ≥ N, the sup{∂(fn(x),f(x))| x in X} < ε.

If ε≤1, our metrics are the same.

Hence for ε≤1, there exisits an integer N such that for n ≥ N, the sup{∂(fn(x),f(x))| x in X} < ε.

But since ∂(fn(x),f(x)) = d(fn(x),f(x)) for n ≥ N, d(fn(x),f(x)) ≤ sup{∂(fn(x),f(x))| x in X} < ε for all n≥N and x in X, which satisfies our condition for uniform convergence.



My question is about ε. Is this the right approach?
 
Physics news on Phys.org
To display a bar, you can use the TeX command \bar. For example, to typeset [itex]\bar{\rho}[/itex], use \bar{\rho}.

Just to make sure I understand the question correctly, let me paraphrase it with proper typesetting: by standard bounded metric relative to [itex]d[/itex], you mean
[tex]\bar{d}(x,y) = \min\{d(x,y), 1\}[/tex]
and that the following definitions are in use
[tex]\rho(f,g) = \sup\{d(f(x),g(x)) : x \in X\}[/tex]
[tex]\bar{\rho}(f,g) = \sup\{\bar{d}(f(x),g(x)) : x \in X\}[/tex]
and that the goal is to show that
[tex]\bar{\rho}(f_n,f) \rightarrow 0 \implies \rho(f_n,f) \rightarrow 0[/tex]
Assuming I interpreted the question correctly, what you have done is fine for [itex]\epsilon \leq 1[/itex]. For [itex]\epsilon > 1[/itex], you can simply use the [itex]N[/itex] that works for [itex]\epsilon = 1[/itex].
 

Similar threads

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