Lemma 1

Let (X,d) be a metric space, and let E X. Then

(a) x B(x,r)r > 0

(b) Int (A) A

(c)

  • (i) Int (E) Ext (E) =
  • (ii) Int (E) ∂E =
  • (iii) Ext (E) ∂E =

(iv) Int (E) Ext (E) ∂E = X

(d) ∂E = (XE)

(e) Int (XE) = XĒ

Answers

(a) Obviously true since d(x,x) = 0 < r

(b) Let x Int (E) then we know r > 0 such that B(x,r) E, but from (a) we know x B(x,r) and hence x E. Therefore Int (E) E.

(c) (i) Assume that the intersection is not empty and let x Int (E) E (by (b)) and x Ext (E). Then by definition r > 0 such that B(x,r) E and r > 0 such that B (x,r) E = . However, x B (x,r) and x E, a contradiction. Thus Int (E) Ext (E) =

(ii), (iii), and (iv) are all true by definition.

(d)

x ∂E xInt (E), and xExt (E) r > 0B(x,r) E and B(x,r)E r > 0y such that y B(x,r) and y E. And z such that z B(x,r) and zE r > 0z B(x,r) and z XE. And y B(x,r) and yXE r > 0B(x,r) (XE), and B(x,r)XE x (XE)

Hence, ∂E = (XE).

(e) First note that XĒ = X(Int (E) ∂E) = Ext (E) (by definition, and Lemma (c:iv)).

Let x Int (XE) then r > 0 such that B(x,r) Int (XE) XE.

Now we will show that x Ext (E) by showing that r > 0 such that B (x,r) E = .

Let r = r. Then if y B (x,r) = B(x,r) XE we get that yE. Hence B (x,r) E = . Thus y Ext (E). Hence, Int (XE) Ext (E). Let x Ext (E). Then r > 0 such that B(x,r) E = . But since x B(x,r) we must have that xE. Thus x XE. Hence Ext (E) Int (XE).

Thus Ext (E) = Int (XE), but as we noted earlier: XĒ = X(Int (E) ∂E) = Ext (E).

Therefore we have Int (XE) = XĒ.

User profile picture
2021-12-10 20:22
Comments