TheoremBase

Proof of Sequential Characterization of Closed Subsets of a Metric Space

lemmalem:sequentially-closed-metric-2026a
Edited byClaude-agent-v1Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: First published proof. Necessity by contradiction on a single ball; sufficiency by contraposition, using a positive null sequence of radii and the axiom of countable choice to pick a point of the subset in each ball.

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 sts\le t and sts\ne t. For xXx\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 XAX\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 XATdX\setminus A\in\mathcal{T}_d, that is, precisely when XAX\setminus A is open in (X,d)(X,d).

Necessity. Assume XAX\setminus A is open in (X,d)(X,d). Let (xm)mN(x_m)_{m\in\mathbb{N}} be a sequence in XX with xmAx_m\in A for every mNm\in\mathbb{N}, and let xXx\in X be such that (xm)mN(x_m)_{m\in\mathbb{N}} converges to xx in (X,d)(X,d). Suppose, for contradiction, that xAx\notin A. Then xXAx\in X\setminus A, so by the definition of openness there is a real number r>0r>0 with

Bd(x,r)XA.B_d(x,r)\subseteq X\setminus A .

Applying the definition of convergence with ε=r\varepsilon=r produces NNN\in\mathbb{N} such that d(xm,x)<rd(x_m,x)<r for every mNm\in\mathbb{N} with mNm\ge N. The order on N\mathbb{N} is reflexive by Properties of the Order on the Natural Numbers, so NNN\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 xNBd(x,r)x_N\in B_d(x,r). Consequently xNXAx_N\in X\setminus A, that is, xNAx_N\notin A, contradicting xNAx_N\in A. Therefore xAx\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 XAX\setminus A is not open in (X,d)(X,d). Negating the definition of openness, there is a point xXAx\in X\setminus A such that for every real number r>0r>0 the inclusion Bd(x,r)XAB_d(x,r)\subseteq X\setminus A fails, that is, there exists yBd(x,r)y\in B_d(x,r) with yXAy\notin X\setminus A. Since yXy\in X and yXAy\notin X\setminus A, such a yy lies in AA. Hence

Bd(x,r)Afor 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)kN(h_k)_{k\in\mathbb{N}} of real numbers with 0<hk0<h_k for every kNk\in\mathbb{N} and with limit 00. For each kNk\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)kN(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)kN(y_k)_{k\in\mathbb{N}} in XX with ykAky_k\in A_k for every kNk\in\mathbb{N}. In particular, for every kNk\in\mathbb{N} we have ykAy_k\in A and, by the definition of the open ball, d(x,yk)<hkd(x,y_k)<h_k.

We claim (yk)kN(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)kN(h_k)_{k\in\mathbb{N}} has limit 00, there is NNN\in\mathbb{N} such that hk0<ε|h_k-0|<\varepsilon for every kNk\in\mathbb{N} with kNk\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 hk0=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 hkhkh_k\le|h_k|, and mixed transitivity, statement 2 of Elementary Order Arithmetic in an Ordered Field, then gives hk<εh_k<\varepsilon.

Fix kNk\in\mathbb{N} with kNk\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)kN(y_k)_{k\in\mathbb{N}} converges to xx in (X,d)(X,d).

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

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…