ΘρϵηΠατπ

Metric
A metric on a set X is a function d:X×X0 such that:
  • d(x,y)=0 iff x=y
  • d(x,y)=d(y,x)
  • The triangle inequality holds:
  • d(x,z)d(x,y)+d(y,z)
Ball in a Metric
Suppose that d is a metric then we define the ball of radius r>0 around a point pX B(p,r)={xX:d(p,x)<r}

Before looking further lets see some examples of metrics

The Set of Open Balls Is a Basis
Suppose that X is a set, and d a metric on that set, then the collection d={Bd(x,ϵ):xX,ϵ0} is a basis for X
TODO: Add the proof here.
Balls in a Metric Are Open
TODO: Add the content for the proposition here.
TODO: Add the proof here.
Metric Topology Induced by a Metric d
Suppose that d is a metric on a set X, then the metric topology induced by d is the topology generated by d (the open balls basis)
All Metric Topologies Are T2
Suppose that X is a metric topology induced by the metric d and that x1,x2X then if we consider r=d(x1,x2)2 then we know that B(x1,r)B(x2,r)= for if it was not then there is a point p in their intersection such that d(x1,p)<r and that d(x2,p)<r. But then also by the triangle inequality we have that d(x1,x2)d(x1,p)+d(p,x2) so that d(x1,x2)d(x1,p)d(p,x2) but then d(x1,x2)d(x1,p)>2rr=r so we conclude d(p,x2)r which is a contradiction, so the intersection must be empty.

Note that this shows that the metric topologies are a subset of the T2 topologies, since we know not every topology is T2, then we know that not every topology is metrizable.

Sequential Closure
Suppose that X is a topological space and AX then we define the sequential closure of A as seq_cl(A)={xX:(xn):1A s.t. xnx}
Zero Is Part of the Closure of Positive Sequences in the Box Topology, but Not in the Sequential Closure
Let X= in the box topology, and suppose that A is the set of all positive sequences, then consider the zero sequence 0=(0,0,0,) then
  • 0cl(A)
  • 0seq_cl(A)

We show that 0cl(A) so let B be a basis element in the box topology, therefore B=(ai,bi) where ai<0<bi then the sequence p=(b12,b22,b32,)BA, so that 0cl(A) as needed.

Now for the sake of contradiction suppose that 0seq_cl(A) in othere words there exists a sequence (xn):1A which is a sequence of positive sequences such that xn0. Now we will construct a specific neighborhood U of 0, it is form (ai,bi) where b1=(x1)1 which is the first element of the first sequence of positive sequences that converge to 0, with this idea it's true that x1U as the first coordinate has (x1)1(a1,b1) as it is a little too large (and in order to be in the product you must be in each). Moving in this manner we make it so that bi=(xi)i so that xiU but at the same time 0U so it's not true that all but finitely many of the elements of the sequence (xn) belong to U, specifically none of them are!

The Sequential Closure Is a Subset of the Closure
seq_cl(A)cl(A)
Suppose that xseq_cl(A) then there is some sequenence (xn):1A such that xnx, so that given any neighborhood U of x all but finitely many of the xn's are contained in U so that UA so that xcl(A).
The Sequential Closure Is the Same as the Closure in a Metrizable Space
If X is metrizable and AX then seq_cl(A)=cl(A)

We already know that one of the inclusions hold so we work on the other, to that end let xcl(A) and pick any d that induces the topology of X. Then for any n1 then Bd(x,1n) is an open neighborhood of x so we know Bd(x,1n)A so let xn be in that intersection and we'll prove that xnx which would show that xseq_cl(A).

So let U be a neihborhood of x then U is a union of balls from the metric d in other words there exists some pX and r>0 such that xB(p,r)U but since balls are open then there exists some δ>0 such that xB(x,δ)B(p,r)U, the reason for considering this centered ball around x is that now we know that by using N=1δ then for any nN we have that 1n<δ and therefore since xnB(x,1n)B(x,δ)U so that all but finitely many elements of (xn) are in U as needed.

A Topological Space Is Metrizable
If X is a topological space then X is said to be metrizable if there exists a metric d which induces the topology of X
The Max of Two Metrics Is a Metric
Suppose that d1,d2 are metrics on X then d=max(d1,d2) is also a metric

Firstly note that for any x,yX we have that d1(x,y)d(x,y) and also d2(x,y)d(x,y) therefore since d1,d2 both map into 0 so does d.

If x=y then d1(x,y)=d2(x,y)=0 so that d(x,y)=max(0,0)=0, for the other direction we work with the contraposive so assume that xy and then we'll prove that d(x,y)0 but note that d1(x,y)>0 and same with d2(x,y)>0 because they are metrics, and therefore the max of the two is also >0 so we are done.

Note d(x,y)=max(d1(x,y),d2(x,y))=max(d1(y,x),d2(y,x))=d(y,x)

Now suppose that x,y,zX then d(x,z) is either equal to d1(x,z) or d2(x,z) suppose the latter, then d(x,z)=d1(x,z)d1(x,y)+d1(y,z)=d(x,y)+d(y,z) and in the other case it works for d2 by the same argument.

The Product of Two Metrizable Spaces Is Metrizable
As per title.

Let X,Y be metrizable spaces, with metrics given by d,d respectively, and we define the following metric: c(x×y,w×z)=max(d(x,w),d(y,z)) we know that c is a metric and so now we'll show that it induces the product topology of X×Y. Formally we are going to prove that the topology induced by c equals the product topology by comparing basis elements

Let x×y and let Bd(x,r1)×Bd(y,r2) be a basis element from the product space X×Y and take r=:min(r1,r2) and we claim that x×yBc(x×y,r)Bd(x,r1)×Bd(y,r2) while that seems a bit intimidating its really just unrolling the definitions, for the inclusion suppose a point p×qBc(x×y,r) which means that c(x×y,p×q)r expanding out more definitions that is max(d(x,p),d(y,q))=c(x×y,p×q)min(r1,r2) Now be sure to note that d(x,p) is smaller than or equal to the leftmost thing there are that r1 is greater than or equal to rightmost thing there. Now we want to show that p×qBd(x,r1)×Bd(y,r2) which is to say that pBd(x,r1) which means d(x,p)<r1 but this is true from what we just noted, symmetrically we also get that qBd(y,r2) showing the inclusion true.

Let x×y so consider a basis element of the induced topology of c it is of the form Bc(x×y,r) and we claim that x×yBd(x,r)×Bd(y,r)Bc(x×y,r) to see why this holds, note that if p×qBd(x,r)×Bd(y,r) then we know that d(x,p)<r and that d(y,q)<r so that c(x×y,p×q)=max(d(x,p),d(y,q))<r so p×qBc(x×y,r) as needed, therefore the two topologies are equal.

× in the Dictionary Order Topology Is Metrizable
As per title.
We know also since d and are both metrizable then so is their product
The Metric Is Continuous in Its Metric Space
Let X be a metric space with metric d then d is continuous
Suppose that a<b and we'll prove that U=d1((a,b))X is open, so let x×yU and consider r=d(x,y)(a,b) which is a long way of saying a<r<b, where we can now find some ϵ0 such that a<r2ϵ and r+2ϵ<b, while it's not necessarily obvious why we've done this we claim that Bd(x,ϵ)×Bd(x,ϵ) is a neighborhood of x×y contained in U, to see why consider a point w×zBd(x,ϵ)×Bd(x,ϵ) so that we know that d(x,w)<ϵ and that d(y,z)<ϵ so that d w,z \le d \left( w, x \right) + d \left( x, y \right) + d \left( y, z \right) = \epsilon + r + \epsilon = r + 2 \epsilon \lt b ParseError: Can't use function '&#x27; in math mode at position 3: d \̲(̲ w, z ParseError: Expected 'EOF', got '&' at position 1: &̲#x27; in math m… \le d … in order to match with our other ineqality we can use a similar idea: d(x,y)d(x,w)+d(w,z)+d(z,y) and then isolate for the guy we care about d(x,y)d(x,w)d(z,y)d(z,w) but the left hand side is greater than r2ϵ and so is also greater than a having the net result that a<d(w,z) so all in all we know that d(w,z)(a,b) so we can conclude that w×zd1((a,b))=U and so we've proven that our open set has the property Bd(x,ϵ)×Bd(x,ϵ)U so that d is continuous.
The Metric Topology Is the Coarsest Topology Such That the Metric Is Continuous
Suppose that X is a metric space for d and X is a topology where d is continuous then we have XX
We start with a basis element from X which is some Bd(x,ϵ) where xX and ϵ0, now since d:X×X was assumed continuous, then we know that it is continuous in each variable separately which we noted in class, so that the map g(y)=d(x,y) is a continuous one, but then we can look at the ball again, so that Bd(x,ϵ)={y:d(x,y)<ϵ}=g1((ϵ,ϵ)) showing that Bd(x,ϵ) is an open set in X so since all basis elements are open in X we have that XX as needed.
Bounded Metric on R
Suppose that d is a metric on then it's bounded counterpart is d(x,y)=min(|xy|,1)
Discrete Metric
d(x,y)={0,x=y1,xy
Uniform Metric
Given an index set J, and given points 𝐱=(xα)αJ and 𝐲=(yα)αJ of J, let us define a metric ρ on J by the equation ρ(𝐱,𝐲)=sup{d(xα,yα)|αJ} where d is the bounded metric on
Uniform Topology
The uniform topology is the one induced by the uniform metric
Closure of in in the Uniform Topology
The closure of in in the uniform topology is equal to all sequences that converge to 0.

Let (xn)() we will prove that (xn) must converge to 0. If we take any ϵ(0,1) and consider the open neighborhood containing x which is B _ \bar \rho \left( x, \epsilon \right) ParseError: Got function '\bar' with no arguments as subscript at position 5: B _ \̲b̲a̲r̲ ̲\rho \left( x, … then we know that there is some y \in B _ \bar \rho \left( x, \epsilon \right) \cap \mathbb{ R } ^ \infty ParseError: Got function '\bar' with no arguments as subscript at position 12: y \in B _ \̲b̲a̲r̲ ̲\rho \left( x, … where yx, recall that since y: it eventually becomes zero, specifically there is some J such that for all jJ we have that yj=0 but then we know that: sup{min(|xnyn|,1):n1}<ϵ So for any jJ we have that |xj0|=|xj|<ϵ, since ϵ was arbitrary we've shown that x converges to 0.

Now suppose that x is a sequence of numbers that converge to 0, we will now show that x() so let ϵ(0,1) and we consider the basis element Bρ(x,ϵ). But since x0 then we know there is some N such that for all iN we have xi<ϵ now let's construct y wherein we have 0<|x1y1|<ϵ (so that yx) then yi=xi for 1<i<N and then for any iN set yi=0 (also note that for this i we know that |xi|<ϵ. Also the sup over i[1,,N1] is equal to epsilon by our construction (coming from the first term, the rest being zeros), so we have that : sup{min(|xnyn|,1):n1}<ϵ which is to say that yBρ(x,ϵ) so that it intersects in a place other than x so that x() as needed.

Infinite Product of Intervals in the Uniform Topology
Suppose we are in the context of the uniform topology, making the following definition for any x and r(0,1) we define U(x,r)=k(xkr,xk+r) then
  • U(x,r)Br(x)
  • U(x,r) is not open
  • Br(x)=s<rU(x,s)

To prove the first one we leverage the main mechanic of the supremum, so suppose we had a sequence rnr such that ri<r for any i1 then by constructing yn=xn+rn then its true that yU(x,r) because in each component we have that yn(xnr,xn+r) since rn<r, but then note that |xiyi|=|ri| and so in the supremum as this converges to r then we must have that ρ(x,y)=ϵ (it could not be less than it, or else it would not even be an upper bound). So we have yBρ(x,ϵ), therefore they are not equal.

We will show that U(x,r) is not open by finding a point in it such that you can not find a basis element containing it which is contained in U(x,r), to do this we use the same construction of y for which we knew that yU(x,r). So suppose that there was some Bρ(x,δ) where δ0 that was contained within U(x,r), but now since rnr then there exists some N such that for any nN, we have |rrn|<δ2, now we construct an element z as follows, we let zi=yi for whenever we have i<N and xi=xn+r whenever iN with this construction we can show that zBρ(y,δ) to do this we note that d(zi,yi)=0 whenever i<N and that d(zi,yi)=min(|xi+r(xi+rn)|,1)=|rrn|<δ2 so that δ2 is an upper bound of all these distances so that the supremum over all of them is at most δ2 therefore we have that ρ(y,z)<δ so indeed zBρ(y,δ), but we also note that zU(x,r) the reason why is that for any jN then we know that zj=xj+r and thus zj(xjr,xj+r) so that zU(x,r). Thus in total what we've shown is that there is a point inside of U(x,r) such that you cannot fit a basis element around and still be contained in U(x,r), therefore U(x,r) is not an open set.

We start with a point on the left, that is yBρ(x,r) in that case we know that t:=supi1{d(xi,yi)}<ϵ then if we consider any m such that t<m<r then we can be sure that yU(x,m), this is true because the sup of all distances is upper bounded by m meaning that in each component we know that |xjyj|<m, so that yj(xjm,xj+m). Now taking a point from the right, and calling it y again, that is ys<rU(x,s) then by definition there is some s<r such that yU(x,s) in other words for each i1 we have that yi(xis,xi+s) so that d(x,y)s<r so that yBρ(x,r)