Sure, I can try to prove this theorem for you.
First, let's define some terms for clarity.
- A metric space (X,d) is a set X with a function d that assigns a non-negative real number to each pair of points in X, satisfying the following properties:
- d(x,y) = 0 if and only if x = y
- d(x,y) = d(y,x) for all x,y in X
- d(x,y) + d(y,z) >= d(x,z) for all x,y,z in X (triangle inequality)
- For a point x in X and a real number r > 0, the ball B(x,r) is the set of all points y in X such that d(x,y) < r. This is also known as an open ball.
- The closure of a set A, denoted cl(A), is the set of all points x in X such that every open ball containing x also contains a point in A.
Now, let's prove the theorem.
Given that 0 < \delta < \epsilon and x \in X, we want to show that cl(B(x,\delta)) \subset B(x,\epsilon).
First, let y be an arbitrary point in cl(B(x,\delta)). This means that every open ball containing y also contains a point in B(x,\delta).
Since y is in cl(B(x,\delta)), there exists a sequence of points in B(x,\delta) that converges to y. This sequence can be written as {y_n} where d(y_n,y) < \delta for all n.
Since d(y_n,y) < \delta, we can also say that d(x,y_n) < d(x,y) + d(y,y_n) < \delta + d(y,y_n) for all n.
Now, since the sequence {y_n} converges to y, we know that d(y_n,y) < \epsilon for all n > N for some N.
Combining these two inequalities, we get d(x,y_n) < \delta + \epsilon for all n > N.
Since \delta < \epsilon, this means that d(x,y_n) < \epsilon for all n > N.
Therefore, y_n is in B(x,\epsilon) for all n > N, which means that y is in the closure of B(x,\epsilon).