

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
does not converge uniformly to 1. 3. Let U = {x : d(x, A) < d(x, B)} and V defined anaglgously, with d the distance function defined in problem set 2 ...
Typology: Study Guides, Projects, Research
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Math 55 Problem Set 3 Neil Herriot with additions by Andrei Jorza
0 |f^ (x)^ −^ f^ (x)|^ dx^ =^
0 0 dx^ = 0. And, if^ f^6 =^ g, then F (x) = |f (x)−g(x)| is not identically zero. Hence ∃x 0 so F (x 0 ) = 2 >
0 F^ (x)^ dx^ =^
∫ (^) x 0 −δ 0 F^ (x)^ dx^ +^
∫ (^) x 0 +δ x 0 −δ F^ (x)^ dx^
∫ x^0 +δ^ F^ (x)^ dx^ ≥ x 0 +δ x 0 −δ , dx^ = 2δ >^0 0 = d 1 (f, g) =
0 |f^ (x)^ −^ g(x)|^ dx, implies^ |f^ (x)^ −^ g(x)|^ = 0 for all x, and thus f = g. (ii) d 1 (f, g) is symmetric in definition, as |f − g| = |g − f |, and thus equals d 1 (g, f ). (iii) d 1 (f, h)+d 1 (h, g) =
0 |f^ (x)−h(x)|+|h(x)−g(x)|^ dx^ ≥^
0 |f^ (x)− g(x)| dx = d 1 (f, g).
x^2 ) so that, n > N implies gn is close to, 1. Thus, {gn} converges point-wise. But, for any n, if we pick x = n to get gn = 12. This means that {gn} does not converge uniformly to 1.
Now, letting S 1 ⊂ X − B, and S 0 ⊃ A as produced by X − B and IntA with the above lemma applied twice. I inductivly create open Sk/ 2 i one level of “i” at a time. At each point if q < r, then S¯q ⊂ Sr. Sk/ 2 i^ (k odd), is generated by the above lemma between S(k−1)/ 2 i and S(k+1)/ 2 i. So of course, all the sets contain the closure of S 0 and are contained in S 1. I define f (x) = inf({ 1 } ∪ {r : x ∈ Sr}). This is set is bounded below and non empty, so the inf exists. It is clear that f (x) = 0 if x ∈ A, f (x) = 1 if x ∈ B, and has range [0, 1]. It now remains to show that f is continuous. I first show f (x) = sup({ 0 } ∪ {r : x ∈ X − S¯r}). In doing this, we only need to consider r in the sets that are terminating binary fractions, as for no other r is Sr defined and thus is it possible for r to satisfy the condition to be in the sets. If, r > f (x) then ∃r 0 , r > r 0 > f (x) with x ∈ Sr 0 ⊂ Sr ⊂ S¯r, making x 6 ∈ X − S¯r. As 0 ≤ f (x), we can upperbound the sup with f (x). And, ∀r < f (x) ≤ 1, then ∃r 0 , r < r 0 < f (x) with x 6 ∈ Sr 0 ⊃ S¯r and thus x ∈ X − S¯r. Since all binary fraction 0 < r < f (x) (it is key here that f (x) is bounded above 1 so that all of these r produce valid Sr) are in the set, and these are dense in the reals, we have f (x) as a lower bound for the sup as well. This fails if f (x) = 0, but then, the additional 0 element saves us. Regardless we have now proved the identity. Next, we show f −^1 ([0, r)) is open (r is now any real number). I claim f −^1 ([0, r)) = ∪s<rSs. If x ∈ ∪s<rSs, then ∃s < r such that x ∈ Ss and thus, f (x) = inf({ 1 } ∪ {a : x ∈ Sa}) ≤ s < r. If x 6 ∈ ∪s<rSs, then ∀s < r, x 6 ∈ Ss. Thus, if x ∈ Ss, then s ≥ r; and of course 1 ≥ r. So, f (x) = inf({ 1 } ∪ {a : x ∈ Sa}) ≥ r. So x ∈ ∪s<rSs if and only if x ∈ f −^1 ([0, r)) making the sets equal; as the union of open sets is open so is f −^1 ([0, r)). The same argument, using the sup definition of f , shows that f −^1 ((r, 1]) is open. As, f −^1 ((a, b)) = f −^1 ([0, b))∩f −^1 ((a, 1]), this set is open as well. Finally, any open set in the reals is the union of open balls (one around each point if you like), f −^1 of any open set is the union of open sets and is thus open. Thus, f is continuous as desired.