a) Let X=C[0,1]\mathrm{X}=\mathrm{C}[0,1]. Define d:X xx X rarrRd: X \times X \rightarrow \mathbf{R} by d(f,g)=int_(0)^(1)|f(t)-g(t)|dt,f,ginX\mathrm{d}(\mathrm{f}, \mathrm{g})=\int_0^1|\mathrm{f}(\mathrm{t})-\mathrm{g}(\mathrm{t})| \mathrm{dt}, \mathrm{f}, \mathrm{g} \in \mathrm{X} where the integral is the Riemann integral. Show that dd is a metric on XX. Find d(f,g)d(f, g) where f(x)=4xf(x)=4 x and g(x)=x^(3),x in[0,1]g(x)=x^3, x \in[0,1].
Answer:
To show that dd is a metric on XX, we need to verify the following properties for all f,g,h in Xf, g, h \in X:
Non-negativity:d(f,g) >= 0d(f, g) \geq 0
Identity of indiscernibles:d(f,g)=0d(f, g) = 0 if and only if f=gf = g
Non-negativity:
For any f,g in Xf, g \in X, the absolute value function |*||\cdot| ensures that |f(t)-g(t)| >= 0|f(t) – g(t)| \geq 0 for all t in[0,1]t \in [0, 1]. Therefore, the integral int_(0)^(1)|f(t)-g(t)|dt\int_0^1 |f(t) – g(t)| \, dt is also non-negative. Hence, d(f,g) >= 0d(f, g) \geq 0.
Identity of indiscernibles:
If f=gf = g, then f(t)-g(t)=0f(t) – g(t) = 0 for all t in[0,1]t \in [0, 1], so d(f,g)=int_(0)^(1)|f(t)-g(t)|dt=int_(0)^(1)0dt=0d(f, g) = \int_0^1 |f(t) – g(t)| \, dt = \int_0^1 0 \, dt = 0.
Conversely, if d(f,g)=0d(f, g) = 0, then int_(0)^(1)|f(t)-g(t)|dt=0\int_0^1 |f(t) – g(t)| \, dt = 0. Since the integrand is non-negative, it must be zero almost everywhere, implying that f(t)=g(t)f(t) = g(t) for almost all t in[0,1]t \in [0, 1]. Since ff and gg are continuous, they must be equal everywhere on [0,1][0, 1], so f=gf = g.
Symmetry:
By the properties of the absolute value function, |f(t)-g(t)|=|g(t)-f(t)||f(t) – g(t)| = |g(t) – f(t)| for all t in[0,1]t \in [0, 1]. Therefore, d(f,g)=int_(0)^(1)|f(t)-g(t)|dt=int_(0)^(1)|g(t)-f(t)|dt=d(g,f)d(f, g) = \int_0^1 |f(t) – g(t)| \, dt = \int_0^1 |g(t) – f(t)| \, dt = d(g, f).
Triangle inequality:
For any f,g,h in Xf, g, h \in X and for all t in[0,1]t \in [0, 1], we have |f(t)-h(t)|=|f(t)-g(t)+g(t)-h(t)| <= |f(t)-g(t)|+|g(t)-h(t)||f(t) – h(t)| = |f(t) – g(t) + g(t) – h(t)| \leq |f(t) – g(t)| + |g(t) – h(t)| by the triangle inequality for real numbers. Integrating both sides over [0,1][0, 1] gives:
b) Let ( X,d)X, d) be a metric space and a in Xa \in X be a fixed point of XX. Show that the function f_(a):X rarrRf_a: X \rightarrow \mathbf{R} given by f_(a)(x)=d(x,a)\mathrm{f}_{\mathrm{a}}(\mathrm{x})=\mathrm{d}(\mathrm{x}, \mathrm{a}) is continuous. Is it uniformly continuous? Justify you answer.
Answer:
To show that the function f_(a):X rarrRf_a: X \rightarrow \mathbf{R} given by f_(a)(x)=d(x,a)f_a(x) = d(x, a) is continuous, we need to show that for every epsilon > 0\epsilon > 0, there exists a delta > 0\delta > 0 such that for all x,y in Xx, y \in X, if d(x,y) < deltad(x, y) < \delta, then |f_(a)(x)-f_(a)(y)| < epsilon|f_a(x) – f_a(y)| < \epsilon.
Let epsilon > 0\epsilon > 0 be given. Set delta=epsilon\delta = \epsilon. Then, for any x,y in Xx, y \in X such that d(x,y) < deltad(x, y) < \delta, we have:
Now, let’s consider whether f_(a)f_a is uniformly continuous. A function is uniformly continuous if for every epsilon > 0\epsilon > 0, there exists a delta > 0\delta > 0 such that for all x,y in Xx, y \in X, if d(x,y) < deltad(x, y) < \delta, then |f_(a)(x)-f_(a)(y)| < epsilon|f_a(x) – f_a(y)| < \epsilon, where delta\delta does not depend on the choice of xx or yy.
In metric spaces, continuity and uniform continuity are not always equivalent. However, if the metric space XX is compact, then every continuous function from XX to R\mathbf{R} is uniformly continuous. This is a consequence of the Heine-Cantor theorem.
If the metric space XX is not compact, we cannot guarantee that f_(a)f_a is uniformly continuous. For example, consider the metric space (R,d)(\mathbf{R}, d) where d(x,y)=|x-y|d(x, y) = |x – y| is the standard metric on R\mathbf{R}. The function f_(a)(x)=|x-a|f_a(x) = |x – a| is continuous but not uniformly continuous on R\mathbf{R}.
In conclusion, the function f_(a)f_a is continuous, but it is not necessarily uniformly continuous unless the metric space XX has additional properties, such as compactness.