Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-02 (claude-opus-5)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A point lies in the closure of AA iff some sequence in AA converges to it, and a set is closed iff it is sequentially closed

Statement

Let (X,d)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric), let AXA \subseteq X, let xXx \in X and let FXF \subseteq X. Call FF sequentially closed when every sequence in FF that converges in XX has its limit in FF. Then:

  1. xAx \in \overline{A} (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) if and only if there is a sequence (ak)(a_k) with akAa_k \in A for every kk and akxa_k \to x in (X,d)(X,d) (Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}).
  2. FF is closed (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) if and only if FF is sequentially closed.

The Axiom of Countable Choice is used, once. The direction of claim 1 that manufactures a sequence out of adherence makes one choice per natural number, and that is exactly ACω\mathrm{AC}_\omega (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)). The converse direction, and the direction of claim 2 that goes from closed to sequentially closed, are choice free. This is flagged at the step that spends it.

Facts & Assumptions

Given: A metric space (X,d)(X,d), a subset AXA \subseteq X, a point xXx \in X, and a subset FXF \subseteq X; for nNn \in \mathbb{N} write An:=B(x,1/(n+1))AA_n := B\big(x, 1/(n+1)\big) \cap A.

[A1]

Closure: xAx \in \overline{A} means B(x,r)AB(x,r) \cap A \ne \emptyset for every real r>0r > 0 (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Open ball, closed ball and sphere in a metric space).

[A2]

Convergence in (X,d)(X,d): akxa_k \to x means that for every rational ε>0\varepsilon > 0 there is KK with d(ak,x)<εd(a_k,x) < \varepsilon for all kKk \ge K, and it is enough to produce such a KK for every REAL ε>0\varepsilon > 0, since below any positive real lies a positive rational (Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}, Limits and Cauchy sequences of reals, The rationals embed densely in the reals, Nonnegativity of a metric is a consequence of the other axioms, not an axiom); and d(u,v)=d(v,u)d(u,v) = d(v,u) for all u,vXu, v \in X, which is the symmetry axiom (M2) (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L1]

The balls B(x,1/n)B(x,1/n), n1n \ge 1, are open, contain xx, and form a neighbourhood base at xx: every open UxU \ni x contains one of them (The balls B(x,1/n)B(x, 1/n), n1n \ge 1, form a countable neighbourhood base at xx, so every metric space is first countable).

[L2]

Balls are open (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed), and B(x,s)B(x,t)B(x,s) \subseteq B(x,t) for 0<st0 < s \le t (Open ball, closed ball and sphere in a metric space).

[L3]

Canonical naturals and reciprocals: for naturals 1mp1 \le m \le p one has 0<m1Rp1R0 < m \cdot 1_{\mathbb{R}} \le p \cdot 1_{\mathbb{R}} and hence 0<1/p1/m0 < 1/p \le 1/m (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order); and N\mathbb{N} contains 00, so n+11n + 1 \ge 1 for every nNn \in \mathbb{N} (The natural numbers N\mathbb{N} (von Neumann)).

[L4]

Countable choice: for a family (An)nN(A_n)_{n \in \mathbb{N}} of nonempty sets there is a function nann \mapsto a_n with anAna_n \in A_n for every nn (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L5]

The closure is the smallest closed superset, so FF is closed if and only if F=FF = \overline{F} (The closure of a nonempty AA is {x:d(x,A)=0}\{x : d(x,A) = 0\}, equals AA together with its limit points, and is the smallest closed superset).

Proof

technique · direct
1.1

Suppose (ak)(a_k) is a sequence with akAa_k \in A for every kk and akxa_k \to x, and let r>0r > 0 be an arbitrary real; then there is KK with d(ak,x)<rd(a_k,x) < r for all kKk \ge K, so d(x,aK)=d(aK,x)<rd(x,a_K) = d(a_K,x) < r by the symmetry axiom (M2) of [A2] and hence aKB(x,r)Aa_K \in B(x,r) \cap A, and since rr was arbitrary xAx \in \overline{A}.

A1A2
1.2

Suppose xAx \in \overline{A}; then for every nNn \in \mathbb{N} the radius 1/(n+1)1/(n+1) is a positive real and An=B(x,1/(n+1))AA_n = B(x,1/(n+1)) \cap A is nonempty, so countable choice supplies a sequence (an)(a_n) with anAnAa_n \in A_n \subseteq A for every nn.

A1L3L4choose
2.1

That sequence converges to xx: given a real ε>0\varepsilon > 0, the ball B(x,ε)B(x,\varepsilon) is open and contains xx, so there is a natural N1N \ge 1 with B(x,1/N)B(x,ε)B(x,1/N) \subseteq B(x,\varepsilon); for every nNn \ge N we have n+1Nn + 1 \ge N, hence 1/(n+1)1/N1/(n+1) \le 1/N and anB(x,1/(n+1))B(x,1/N)B(x,ε)a_n \in B(x,1/(n+1)) \subseteq B(x,1/N) \subseteq B(x,\varepsilon), that is d(x,an)<εd(x,a_n) < \varepsilon.

step 1.2A2L1L2L3
2.2

If FF is closed and (ak)(a_k) is a sequence in FF converging to some xXx \in X, then xFx \in \overline{F} by step 1.1 applied with A=FA = F, and F=F\overline{F} = F because FF is closed; so xFx \in F and FF is sequentially closed.

step 1.1L5
3.1

Claim 1 holds: step 1.1 gives the implication from a convergent sequence in AA to adherence, and steps 1.2 and 2.1 give the converse by producing such a sequence.

step 1.1step 1.2step 2.1
4.1

If FF is sequentially closed, let xFx \in \overline{F}; by claim 1 there is a sequence in FF converging to xx, so xFx \in F, whence FF\overline{F} \subseteq F; the reverse inclusion always holds, so F=FF = \overline{F} and FF is closed.

step 3.1L5
5.1

Claim 2 holds by steps 2.2 and 4.1, and claim 1 by step 3.1.

step 2.2step 3.1step 4.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 98 results over 28 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources