TheoremBase

Proof

Throughout, R\mathbb{R} denotes the real numbers, an ordered field with order ≀\le and additive identity 00; for real s,ts,t we write s<ts<t to mean s≀ts\le t and sβ‰ ts\ne t. For x∈Xx\in X and a real number r>0r>0, Bd(x,r)B_d(x,r) denotes the open ball in (X,d)(X,d) with center xx and radius rr, and Xβˆ–AX\setminus A denotes the complement of AA relative to XX. By the definition of a closed subset, AA is closed in (X,Td)(X,\mathcal{T}_d) precisely when Xβˆ–A∈TdX\setminus A\in\mathcal{T}_d, that is, precisely when Xβˆ–AX\setminus A is open in (X,d)(X,d).

Necessity. Assume Xβˆ–AX\setminus A is open in (X,d)(X,d). Let (xm)m∈N(x_m)_{m\in\mathbb{N}} be a sequence in XX with xm∈Ax_m\in A for every m∈Nm\in\mathbb{N}, and let x∈Xx\in X be such that (xm)m∈N(x_m)_{m\in\mathbb{N}} converges to xx in (X,d)(X,d). Suppose, for contradiction, that xβˆ‰Ax\notin A. Then x∈Xβˆ–Ax\in X\setminus A, so by the definition of openness there is a real number r>0r>0 with

Bd(x,r)βŠ†Xβˆ–A.B_d(x,r)\subseteq X\setminus A .

Applying the definition of convergence with Ξ΅=r\varepsilon=r produces N∈NN\in\mathbb{N} such that d(xm,x)<rd(x_m,x)<r for every m∈Nm\in\mathbb{N} with mβ‰₯Nm\ge N. The order on N\mathbb{N} is reflexive by Properties of the Order on the Natural Numbers, so Nβ‰₯NN\ge N and therefore d(xN,x)<rd(x_N,x)<r. Condition 3 in the definition of a metric gives d(x,xN)=d(xN,x)d(x,x_N)=d(x_N,x), hence d(x,xN)<rd(x,x_N)<r and so xN∈Bd(x,r)x_N\in B_d(x,r). Consequently xN∈Xβˆ–Ax_N\in X\setminus A, that is, xNβˆ‰Ax_N\notin A, contradicting xN∈Ax_N\in A. Therefore x∈Ax\in A, as required.

Sufficiency. We prove the contrapositive: assuming AA is not closed, we exhibit a sequence with all terms in AA that converges in (X,d)(X,d) to a point outside AA.

So assume Xβˆ–AX\setminus A is not open in (X,d)(X,d). Negating the definition of openness, there is a point x∈Xβˆ–Ax\in X\setminus A such that for every real number r>0r>0 the inclusion Bd(x,r)βŠ†Xβˆ–AB_d(x,r)\subseteq X\setminus A fails, that is, there exists y∈Bd(x,r)y\in B_d(x,r) with yβˆ‰Xβˆ–Ay\notin X\setminus A. Since y∈Xy\in X and yβˆ‰Xβˆ–Ay\notin X\setminus A, such a yy lies in AA. Hence

Bd(x,r)∩Aβ‰ βˆ…forΒ everyΒ realΒ numberΒ r>0.B_d(x,r)\cap A\ne\emptyset\qquad\text{for every real number } r>0 .

By Existence of a Sequence of Positive Real Numbers with Limit Zero there is a sequence (hk)k∈N(h_k)_{k\in\mathbb{N}} of real numbers with 0<hk0<h_k for every k∈Nk\in\mathbb{N} and with limit 00. For each k∈Nk\in\mathbb{N} put

Ak=Bd(x,hk)∩A,A_k=B_d(x,h_k)\cap A ,

which is a subset of XX, nonempty by the previous paragraph applied to r=hkr=h_k. Thus (Ak)k∈N(A_k)_{k\in\mathbb{N}} is a family of subsets of XX with every member nonempty, so Axiom of Countable Choice yields a sequence (yk)k∈N(y_k)_{k\in\mathbb{N}} in XX with yk∈Aky_k\in A_k for every k∈Nk\in\mathbb{N}. In particular, for every k∈Nk\in\mathbb{N} we have yk∈Ay_k\in A and, by the definition of the open ball, d(x,yk)<hkd(x,y_k)<h_k.

We claim (yk)k∈N(y_k)_{k\in\mathbb{N}} converges to xx in (X,d)(X,d). Let Ξ΅\varepsilon be a real number with Ξ΅>0\varepsilon>0. Since (hk)k∈N(h_k)_{k\in\mathbb{N}} has limit 00, there is N∈NN\in\mathbb{N} such that ∣hkβˆ’0∣<Ξ΅|h_k-0|<\varepsilon for every k∈Nk\in\mathbb{N} with kβ‰₯Nk\ge N, the absolute value being that of the ordered field R\mathbb{R}. By Additive Cancellation and Elementary Additive Identities in a Field we have hkβˆ’0=hkh_k-0=h_k, so ∣hk∣<Ξ΅|h_k|<\varepsilon for every such kk. Statement 3 of Properties of the Absolute Value in an Ordered Field gives hkβ‰€βˆ£hk∣h_k\le|h_k|, and mixed transitivity, statement 2 of Elementary Order Arithmetic in an Ordered Field, then gives hk<Ξ΅h_k<\varepsilon.

Fix k∈Nk\in\mathbb{N} with kβ‰₯Nk\ge N. Condition 3 in the definition of a metric gives d(yk,x)=d(x,yk)d(y_k,x)=d(x,y_k), so d(yk,x)<hkd(y_k,x)<h_k. Since hk<Ξ΅h_k<\varepsilon we have in particular hk≀Ρh_k\le\varepsilon, and mixed transitivity again gives d(yk,x)<Ξ΅d(y_k,x)<\varepsilon. As Ξ΅>0\varepsilon>0 was arbitrary, (yk)k∈N(y_k)_{k\in\mathbb{N}} converges to xx in (X,d)(X,d).

Every term of (yk)k∈N(y_k)_{k\in\mathbb{N}} lies in AA, the sequence converges to xx, and x∈Xβˆ–Ax\in X\setminus A so xβˆ‰Ax\notin A. Hence the stated sequential condition fails, which proves the contrapositive and completes the proof.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…