Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

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

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) and let xXx \in X. For a natural n1n \ge 1 write 1/n1/n for the inverse of the canonical natural n1Rn \cdot 1_{\mathbb{R}}, a positive real, and put

βn:=B(x,1/n),Bx:={βn:nN, n1}.\beta_n := B\big(x, 1/n\big), \qquad \mathcal{B}_x := \{\, \beta_n : n \in \mathbb{N},\ n \ge 1 \,\}.

Then:

  1. Bx\mathcal{B}_x is at most countable (Finite, countably infinite, countable, uncountable).
  2. Every βn\beta_n is an open subset of XX containing xx.
  3. For every open UXU \subseteq X with xUx \in U there is n1n \ge 1 with βnU\beta_n \subseteq U.

The two names used in the title are introduced by this statement, not cited from elsewhere. A family of open sets each containing xx, such that every open set containing xx contains a member of the family, is a neighbourhood base at xx; a space in which every point has an at most countable neighbourhood base is first countable. Claims 1 to 3 say that Bx\mathcal{B}_x is an at most countable neighbourhood base at xx, so every metric space is first countable.

Facts & Assumptions

Given: A metric space (X,d)(X,d), a point xXx \in X, and for each natural n1n \ge 1 the ball βn=B(x,1/n)\beta_n = B(x, 1/n).

[L1]

Canonical naturals: n1R>0n \cdot 1_{\mathbb{R}} > 0 for n1n \ge 1 (Canonical naturals are positive and strictly increasing), hence n1Rn \cdot 1_{\mathbb{R}} is invertible with 1/n>01/n > 0 (Inverses of positives are positive, and reciprocation reverses order); and N\mathbb{N} contains 00, so jj+1j \mapsto j + 1 runs over exactly the naturals 1\ge 1 as jj runs over N\mathbb{N} (The natural numbers N\mathbb{N} (von Neumann)).

[L2]

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

[L3]
[L4]

Reciprocal Archimedean property: for every real r>0r > 0 there is a natural n1n \ge 1 with 1/n<r1/n < r (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean).

Proof

technique · direct
1.1

For every natural n1n \ge 1 the real 1/n1/n is defined and positive, so βn\beta_n is a legitimate ball of positive radius.

L1
1.2

Let UU be open with xUx \in U, and fix a real r>0r > 0 with B(x,r)UB(x,r) \subseteq U; then fix a natural n1n \ge 1 with 1/n<r1/n < r.

L3L4choose
2.1

Each βn\beta_n is open and contains xx, which is claim 2.

step 1.1L2
2.2

The map s:NBxs : \mathbb{N} \to \mathcal{B}_x given by s(j):=βj+1s(j) := \beta_{j+1} is well defined by step 1.1 and is surjective, because every member of Bx\mathcal{B}_x is βn\beta_n for some n1n \ge 1 and n=j+1n = j+1 for the natural jj with j+1=nj + 1 = n; moreover Bx\mathcal{B}_x is nonempty, containing β1\beta_1.

step 1.1L1
2.3

By step 1.2 and monotonicity of balls in the radius, βn=B(x,1/n)B(x,r)U\beta_n = B(x,1/n) \subseteq B(x,r) \subseteq U, which is claim 3.

step 1.2L2
3.1

By [L5] applied to the surjection of step 2.2, the nonempty set Bx\mathcal{B}_x is at most countable, which is claim 1.

step 2.2L5
4.1

Claims 1, 2 and 3 hold by steps 3.1, 2.1 and 2.3, so Bx\mathcal{B}_x is an at most countable neighbourhood base at xx and (X,d)(X,d) is first countable.

step 2.1step 2.3step 3.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 69 results over 20 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