Fréchet Space (Functional Analysis) is Metric Space

Theorem
Let $\struct {\R^\omega, d}$ be the Fréchet space on $\R^\omega$.

Then $\struct {\R^\omega, d}$ is a metric space.

Proof
It is to be demonstrated that $d$ satisfies all the metric space axioms.

Recall from the definition of the Fréchet space that the distance function $d: \R^\omega \times \R^\omega \to \R$ is defined on $\R^\omega$ as:
 * $\forall x, y \in \R^\omega: \map d {x, y} = \ds \sum_{i \mathop \in \N} \dfrac {2^{-i} \size {x_i - y_i} } {1 + \size {x_i - y_i} }$

where:
 * $x := \sequence {x_i}_{i \mathop \in \N} = \tuple {x_0, x_1, x_2, \ldots}$
 * $y := \sequence {y_i}_{i \mathop \in \N} = \tuple {y_0, y_1, y_2, \ldots}$

denote arbitrary elements of $\R^\omega$.

First it is confirmed that Fréchet Product Metric is Absolutely Convergent on arbitrary $x$ and $y$, as follows.

First note that:


 * $\dfrac {\size {x_i - y_i} } {1 + \size {x_i - y_i} } = 1 - \dfrac 1 {1 + \size {x_i - y_i} }$

implies that we have:


 * $0 \le \dfrac {\size {x_i - y_i} } {1 + \size {x_i - y_i} } < 1$

By the Ratio Test we have that the series is absolutely convergent.

An important property of absolutely convergent series is that any rearrangement of the terms of the series is also convergent and equal to the original series.

This will be used in the proof of.

Proof of
So holds for $d$.

Proof of
So holds for $d$.

Proof of
Thus for such a $k \in \N$:

It has been established during the course of demonstrating compliance with (and is in any case trivially obvious) that:
 * $x_j = y_j \implies \dfrac {2^{-j} \size {x_j - x_j} } {1 + \size {x_j - x_j} } = 0$

Thus $\ds \sum_{i \mathop \in \N} \dfrac {2^{-i} \size {x_i - x_i} } {1 + \size {x_i - x_i} }$ contains at least one term:
 * $\dfrac {2^{-k} \size {x_k - x_k} } {1 + \size {x_k - x_k} } > 0$

and any number of other terms:


 * $\dfrac {2^{-j} \size {x_j - x_j} } {1 + \size {x_j - x_j} } = 0$

Hence:
 * $\ds \sum_{i \mathop \in \N} \dfrac {2^{-i} \size {x_i - x_i} } {1 + \size {x_i - x_i} } > 0$

for $x \ne y$.

So holds for $d$.

Proof of
Consider the [[Definition:Real Function|real function}}:
 * $\forall a \in \R_{\ge 0}: \map f a = \dfrac a {1 + a}$

We want to show $f$ satisfies:
 * $\map f a \le \map f {a'}$

for $a \ge 0$ and $a' \ge a$.

The first inequality follows since:
 * $\map f a = 1 - \dfrac 1 {1 + a}$

with $\dfrac 1 {1 + a}$ decreasing as $a$ increases.

We also want to show it satisfies :


 * $\map f a \le \map f {a + b} \le \map f a + \map f b$

for $a, b > 0$.

The first inequality here follows from the above inequality.

For the second inequality here we note $\dfrac {\map f a} a = \dfrac 1 {1 + a}$ gives:


 * $\dfrac {\map f a} a \ge \dfrac {\map f {a + b} } {a + b}$
 * $\dfrac {\map f b} b \ge \dfrac {\map f {a + b} } {a + b}$

for $a, b > 0$

from which we obtain $\map f a + \map f b \ge \dfrac {\map f {a + b} } {a + b} = \map f {a + b}$ (the inequality is immediately verified in cases where $a$ or $b$ is $0$).

We now use these inequalities to prove :

So holds for $d$.

Thus $d$ satisfies all the metric space axioms and so is a metric.