Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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 KK-topology on R\mathbb{R}, generated by the open intervals together with their complements of K={1/(n+1):nN}K = \{1/(n+1) : n \in \mathbb{N}\}, is T1T_1 and Hausdorff but not regular

Statement

Write ι\iota for the canonical natural of R\mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), so that 1/(n+1)1/(n+1) abbreviates the inverse of ι(n+1)\iota(n+1), and put

K  :=  {1/(n+1)  :  nN}    R,BK  :=  {(a,b):a<b}    {(a,b)K:a<b},K \;:=\; \{\, 1/(n+1) \;:\; n \in \mathbb{N} \,\} \;\subseteq\; \mathbb{R}, \qquad \mathcal{B}_K \;:=\; \{\, (a,b) : a < b \,\} \;\cup\; \{\, (a,b) \setminus K : a < b \,\},

the bounded open intervals of R\mathbb{R} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) together with those same intervals with KK removed. Then:

  1. BK\mathcal{B}_K is a basis for a unique topology TK\mathcal{T}_K on R\mathbb{R} (A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis), the KK-topology, and TK\mathcal{T}_K is finer than the usual topology of R\mathbb{R} (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).
  2. (R,TK)(\mathbb{R}, \mathcal{T}_K) is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) and T1T_1 (T0T_0 (Kolmogorov) and T1T_1 (Frechet) spaces).
  3. KK is closed in TK\mathcal{T}_K.
  4. (R,TK)(\mathbb{R}, \mathcal{T}_K) is not regular (Regular spaces and T3T_3 spaces, with the source disagreement over whether regularity includes T1T_1 stated explicitly): the point 00 and the closed set KK have no disjoint open neighbourhoods.

Facts & Assumptions

Given: R\mathbb{R} with its order, its usual metric dR(s,t)=std_{\mathbb{R}}(s,t) = |s-t| and its usual topology; the set KK and the family BK\mathcal{B}_K above; reals a,b,c,da,b,c,d and naturals m,nm,n. Throughout 1/(n+1)1/(n+1) is the inverse of the canonical natural ι(n+1)\iota(n+1).

[A1]

(a,b)={tR:a<t<b}(a,b) = \{\, t \in \mathbb{R} : a < t < b \,\}, and for a<ba < b the midpoint satisfies a<(a+b)/2<ba < (a+b)/2 < b, so (a,b)(a,b) \ne \varnothing (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L3]

For every real ε>0\varepsilon > 0 there is a natural k1k \ge 1 with 1/k<ε1/k < \varepsilon; every nonzero natural is a successor; and for every real xx there is a natural k1k \ge 1 with x<kx < k (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every nonzero natural number is a successor, Every complete ordered field is Archimedean).

[L4]

For n1n \ge 1 the canonical natural ι(n)\iota(n) is positive and nι(n)n \mapsto \iota(n) is strictly increasing on the naturals 1\ge 1 (Canonical naturals are positive and strictly increasing); and 0<u<v0 < u < v implies 0<1/v<1/u0 < 1/v < 1/u (Inverses of positives are positive, and reciprocation reverses order).

[L5]

A two-element set of reals has a maximum and a minimum, each of which is one of the two elements (Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum).

[L7]

A set is closed exactly when its complement is open, and an arbitrary union of open sets is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

(B1): every xRx \in \mathbb{R} lies in (x1,x+1)BK(x-1, x+1) \in \mathcal{B}_K, so BK\mathcal{B}_K covers R\mathbb{R}.

A1
1.2

(B2): for a<ba < b and c<dc < d the intersection (a,b)(c,d)(a,b) \cap (c,d) is (max{a,c},min{b,d})(\max\{a,c\}, \min\{b,d\}) by [L5] and [A1], which is a member of BK\mathcal{B}_K when max{a,c}<min{b,d}\max\{a,c\} < \min\{b,d\} and is empty otherwise; removing KK from one or from both factors intersects the same interval with the complement of KK, giving a member of BK\mathcal{B}_K or the empty set; and in the empty case (B2) is vacuous.

A1L5
2.1

By steps 1.1 and 1.2 and [L1] the family BK\mathcal{B}_K is a basis for a unique topology TK\mathcal{T}_K on R\mathbb{R}, which is claim 1's first half.

step 1.1step 1.2L1
3.1

TK\mathcal{T}_K is finer than the usual topology: if UU is usually open and xUx \in U, then [L2] gives r>0r > 0 with x(xr,x+r)Ux \in (x-r,x+r) \subseteq U, and (xr,x+r)BK(x-r,x+r) \in \mathcal{B}_K, so UTKU \in \mathcal{T}_K by [L1]; this completes claim 1.

step 2.1L1L2
3.2

Let xyx \ne y in R\mathbb{R}; by [L5] we may assume x<yx < y, and put r:=(yx)/2>0r := (y-x)/2 > 0, so that x+r=(x+y)/2=yrx + r = (x+y)/2 = y - r. The sets (xr,x+r)(x-r,x+r) and (yr,y+r)(y-r,y+r) lie in BK\mathcal{B}_K, hence are open, contain xx and yy respectively, and are disjoint, a common point being both <x+r< x+r and >yr=x+r> y-r = x+r. So (R,TK)(\mathbb{R},\mathcal{T}_K) is Hausdorff, and T1T_1 by [L6]; this is claim 2.

step 2.1A1L5L6
3.3

RK=k1((k,k)K)\mathbb{R} \setminus K = \bigcup_{k \ge 1} \big( (-k, k) \setminus K \big), the union being over naturals k1k \ge 1: each term is a member of BK\mathcal{B}_K and misses KK, and conversely a point xKx \notin K has x<k|x| < k for some natural k1k \ge 1 by [L3], so xx lies in the term of index kk. Hence RK\mathbb{R} \setminus K is open by [L7] and KK is closed, which is claim 3.

step 2.1L3L7
4.1

Suppose U,VTKU, V \in \mathcal{T}_K are disjoint with 0U0 \in U and KVK \subseteq V; note 0K0 \notin K, since every element of KK is positive by [L4].

step 3.3L4assume-hyp
5.1

Under step 4.1: by [L1] there is BBKB \in \mathcal{B}_K with 0BU0 \in B \subseteq U, and BB is (a,b)(a,b) or (a,b)K(a,b) \setminus K with a<0<ba < 0 < b.

step 4.1L1A1
6.1

Under step 4.1: by [L3] there is a natural k1k \ge 1 with 1/k<b1/k < b, and k=n+1k = n+1 for some nNn \in \mathbb{N}, so 1/(n+1)(a,b)1/(n+1) \in (a,b), since 0<1/(n+1)<b0 < 1/(n+1) < b by [L4] and a<0a < 0.

step 5.1L3L4
7.1

Under step 4.1: B(a,b)B \ne (a,b), for otherwise 1/(n+1)BU1/(n+1) \in B \subseteq U by step 6.1 while 1/(n+1)KV1/(n+1) \in K \subseteq V, contradicting UV=U \cap V = \varnothing; hence B=(a,b)KB = (a,b) \setminus K.

step 5.1step 6.1
7.2

Under step 4.1: 1/(n+1)KV1/(n+1) \in K \subseteq V, so by [L1] there is BBKB' \in \mathcal{B}_K with 1/(n+1)BV1/(n+1) \in B' \subseteq V; and BB' is not of the form (c,d)K(c,d) \setminus K, which contains no point of KK, so B=(c,d)B' = (c,d) with c<1/(n+1)<dc < 1/(n+1) < d.

step 6.1L1
8.1

Under step 4.1: put t:=max{max{a,c}, 1/(n+2)}t := \max\{\, \max\{a,c\},\ 1/(n+2) \,\} by [L5]. Then t<1/(n+1)t < 1/(n+1): indeed a<0<1/(n+1)a < 0 < 1/(n+1) and c<1/(n+1)c < 1/(n+1), and 1/(n+2)<1/(n+1)1/(n+2) < 1/(n+1) by [L4], since ι(n+1)<ι(n+2)\iota(n+1) < \iota(n+2) and both are positive.

step 6.1step 7.1step 7.2L4L5
9.1

Under step 4.1: the interval (t, 1/(n+1))(t,\ 1/(n+1)) contains no element of KK. An element 1/(m+1)1/(m+1) of it satisfies 1/(m+1)<1/(n+1)1/(m+1) < 1/(n+1), hence ι(n+1)<ι(m+1)\iota(n+1) < \iota(m+1) by [L4], hence n+1<m+1n + 1 < m + 1 and so m+1n+2m + 1 \ge n + 2, whence 1/(m+1)1/(n+2)t1/(m+1) \le 1/(n+2) \le t by [L4] and step 8.1, contradicting t<1/(m+1)t < 1/(m+1).

step 8.1L4
10.1

Under step 4.1: put z:=(t+1/(n+1))/2z := (t + 1/(n+1))/2, so t<z<1/(n+1)t < z < 1/(n+1) by [A1] and step 8.1, and zKz \notin K by step 9.1.

step 8.1step 9.1A1
11.1

Under step 4.1: z(a,b)K=BUz \in (a,b) \setminus K = B \subseteq U, since amax{a,c}t<za \le \max\{a,c\} \le t < z and z<1/(n+1)<bz < 1/(n+1) < b by step 6.1 and step 8.1; and z(c,d)=BVz \in (c,d) = B' \subseteq V, since cmax{a,c}t<zc \le \max\{a,c\} \le t < z and z<1/(n+1)<dz < 1/(n+1) < d by step 7.2.

step 6.1step 7.1step 7.2step 8.1step 10.1L5
12.1

Step 11.1 puts zz in UVU \cap V, contradicting the disjointness assumed in step 4.1; so no such UU and VV exist, and by [L6] the space (R,TK)(\mathbb{R},\mathcal{T}_K) is not regular, which is claim 4.

step 4.1step 11.1L6

Remarks

  • One pair suffices, and only one pair is claimed. Regularity is a statement about every point and every closed set missing it, so a single pair that cannot be separated refutes it; the pair exhibited is (0,K)(0, K). Nothing above asserts that the space is regular at any other pair, and nothing needs it: what the lemma is for is the refutation of "Hausdorff implies regular", and that needs exactly one failure.

  • Why the gap (t,1/(n+1))(t, 1/(n+1)) is the right place to look. The basic neighbourhood of 00 inside UU has had all of KK deleted, so it cannot be told apart from a usual interval except at the points of KK; and any neighbourhood of the point 1/(n+1)1/(n+1) of KK must be an ordinary interval, because the deleted basic sets miss KK altogether. Two such sets overlap in a nonempty interval, and the interval between consecutive members of KK supplies a point of the overlap that is not in KK. Writing "clearly some point of the overlap avoids KK" would be the gap that this argument exists to close.

  • The index shift is not cosmetic. N\mathbb{N} contains 00 (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), so the set is written {1/(n+1):nN}\{1/(n+1) : n \in \mathbb{N}\} and its largest element is 11; writing {1/n:nN}\{1/n : n \in \mathbb{N}\} would divide by zero.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 92 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