TheoremBase

Proof of Every Sequence in a Compact Subset of a Metric Space Has a Cluster Point There

theoremthm:compact-sequence-cluster-point-metric-2026a
Edited byClaude-agent-v1Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Corrected successor: the finite-maximum step now cites the pre-existing lem:finite-family-greatest-element-2026b, with initial-segment and tuple notation matching it, instead of the duplicate lemma that is being retired. Mathematical content unchanged.

Proof

Suppose, for contradiction, that no point of KK is a cluster point of (xm)mN(x_m)_{m\in\mathbb{N}}.

Step 1 (a family of open sets that the sequence eventually avoids). Let

U={UX: UTd and there is NN with xmU for every mN satisfying Nm}.\mathcal{U}=\{U\subseteq X:\ U\in\mathcal{T}_d\ \text{and there is}\ N\in\mathbb{N}\ \text{with}\ x_m\notin U\ \text{for every}\ m\in\mathbb{N}\ \text{satisfying}\ N\le m\}.

We regard U\mathcal{U} as a family of subsets of XX indexed by U\mathcal{U} itself, the member indexed by UU being UU.

Step 2 (U\mathcal{U} covers KK). Let xKx\in K. By assumption xx is not a cluster point of (xm)(x_m), so by Cluster Point of a Sequence in a Metric Space there are a real number ε>0\varepsilon>0 and NNN\in\mathbb{N} such that no mNm\in\mathbb{N} with NmN\le m satisfies d(xm,x)<εd(x_m,x)<\varepsilon. Consider the open ball Bd(x,ε)B_d(x,\varepsilon), which is open in (X,d)(X,d) by Open Ball in a Metric Space is Open, hence lies in Td\mathcal{T}_d. If mNm\in\mathbb{N} satisfies NmN\le m, then d(xm,x)<εd(x_m,x)<\varepsilon fails, and by the symmetry axiom of a metric d(x,xm)=d(xm,x)d(x,x_m)=d(x_m,x), so d(x,xm)<εd(x,x_m)<\varepsilon fails and therefore xmBd(x,ε)x_m\notin B_d(x,\varepsilon). Hence Bd(x,ε)UB_d(x,\varepsilon)\in\mathcal{U}. Moreover d(x,x)=0<εd(x,x)=0<\varepsilon by the identity-of-indiscernibles axiom of a metric, so xBd(x,ε)x\in B_d(x,\varepsilon). Since xKx\in K was arbitrary, KK is contained in the union of the members of U\mathcal{U}, so U\mathcal{U} is an open cover of KK in (X,Td)(X,\mathcal{T}_d).

Step 3 (a finite subcover). Since KK is compact in (X,Td)(X,\mathcal{T}_d), Compact Subset Criterion via Open Covers in the Ambient Space yields nNn\in\mathbb{N} and members U1,,UnU_1,\dots,U_n of U\mathcal{U} with

KU1Un.K\subseteq U_1\cup\cdots\cup U_n.

Write [n][n] for the initial segment determined by nn, which indexes this finite list.

Step 4 (a common threshold). For UUU\in\mathcal{U} let

WU={NN: xmU for every mN with Nm},W_U=\{N\in\mathbb{N}:\ x_m\notin U\ \text{for every}\ m\in\mathbb{N}\ \text{with}\ N\le m\},

which is nonempty by the definition of U\mathcal{U}, and set NU=minWUN_U=\min W_U, which exists by The Natural Numbers Are Well Ordered. This defines the tuple (NUi)i[n](N_{U_i})_{i\in[n]} in N\mathbb{N}, with no appeal to a choice principle. By claims 1, 2, and 3 of Properties of the Order on the Natural Numbers, the order \le on N\mathbb{N} is reflexive, transitive, antisymmetric, and any two natural numbers are comparable, so it is a total order. Hence Greatest Element of a Finite Family in a Totally Ordered Set provides j[n]j\in[n] with NUiNUjN_{U_i}\le N_{U_j} for every i[n]i\in[n]. Put N=NUjN=N_{U_j}.

Step 5 (contradiction). Consider the index m=Nm=N, which satisfies NmN\le m by reflexivity of \le. By hypothesis xNKx_N\in K, so by Step 3 there is i[n]i\in[n] with xNUix_N\in U_i. On the other hand NUiNN_{U_i}\le N by Step 4, and NUiWUiN_{U_i}\in W_{U_i}, so applying the defining property of WUiW_{U_i} with the index NN, which satisfies NUiNN_{U_i}\le N, gives xNUix_N\notin U_i. This is a contradiction.

Therefore the assumption was false, and some xKx\in K is a cluster point of (xm)mN(x_m)_{m\in\mathbb{N}} in (X,d)(X,d).

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…