Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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 K-topology on R, generated by the open intervals together with their complements of K={1/(n+1):n∈N}, is T1 and Hausdorff but not regular

Statement

Write ι for the canonical natural of R (The canonical natural ι(n)=n⋅1F of a field), so that 1/(n+1) abbreviates the inverse of ι(n+1), and put

K  :=  { 1/(n+1)  :  n∈N }  ⊆  R,BK  :=  { (a,b):a<b }  ∪  { (a,b)∖K:a<b },

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

  1. BK is a basis for a unique topology TK on 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 K-topology, and TK is finer than the usual topology of R (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (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) 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 T1 (T0 (Kolmogorov) and T1 (Frechet) spaces).
  3. K is closed in TK.
  4. (R,TK) is not regular (Regular spaces and T3 spaces, with the source disagreement over whether regularity includes T1 stated explicitly): the point 0 and the closed set K have no disjoint open neighbourhoods.

Facts & Assumptions

Given: R with its order, its usual metric dR(s,t)=∣s−t∣ and its usual topology; the set K and the family BK above; reals a,b,c,d and naturals m,n. Throughout 1/(n+1) is the inverse of the canonical natural ι(n+1).

[A1]

(a,b)={ t∈R:a<t<b }, and for a<b the midpoint satisfies a<(a+b)/2<b, so (a,b)≠∅ (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L3]

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

[L4]

For n≥1 the canonical natural ι(n) is positive and n↦ι(n) is strictly increasing on the naturals ≥1 (Canonical naturals are positive and strictly increasing); and 0<u<v implies 0<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 x∈R lies in (x−1,x+1)∈BK, so BK covers R.

A1
1.2

(B2): for a<b and c<d the intersection (a,b)∩(c,d) is (max⁡{a,c},min⁡{b,d}) by [L5] and [A1], which is a member of BK when max⁡{a,c}<min⁡{b,d} and is empty otherwise; removing K from one or from both factors intersects the same interval with the complement of K, giving a member of BK 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 is a basis for a unique topology TK on R, which is claim 1's first half.

step 1.1step 1.2L1
3.1

TK is finer than the usual topology: if U is usually open and x∈U, then [L2] gives r>0 with x∈(x−r,x+r)⊆U, and (x−r,x+r)∈BK, so U∈TK by [L1]; this completes claim 1.

step 2.1L1L2
3.2

Let x≠y in R; by [L5] we may assume x<y, and put r:=(y−x)/2>0, so that x+r=(x+y)/2=y−r. The sets (x−r,x+r) and (y−r,y+r) lie in BK, hence are open, contain x and y respectively, and are disjoint, a common point being both <x+r and >y−r=x+r. So (R,TK) is Hausdorff, and T1 by [L6]; this is claim 2.

step 2.1A1L5L6
3.3

R∖K=⋃k≥1((−k,k)∖K), the union being over naturals k≥1: each term is a member of BK and misses K, and conversely a point x∉K has ∣x∣<k for some natural k≥1 by [L3], so x lies in the term of index k. Hence R∖K is open by [L7] and K is closed, which is claim 3.

step 2.1L3L7
4.1

Suppose U,V∈TK are disjoint with 0∈U and K⊆V; note 0∉K, since every element of K is positive by [L4].

step 3.3L4assume-hyp
5.1

Under step 4.1: by [L1] there is B∈BK with 0∈B⊆U, and B is (a,b) or (a,b)∖K with a<0<b.

step 4.1L1A1
6.1

Under step 4.1: by [L3] there is a natural k≥1 with 1/k<b, and k=n+1 for some n∈N, so 1/(n+1)∈(a,b), since 0<1/(n+1)<b by [L4] and a<0.

step 5.1L3L4
7.1

Under step 4.1: B≠(a,b), for otherwise 1/(n+1)∈B⊆U by step 6.1 while 1/(n+1)∈K⊆V, contradicting U∩V=∅; hence B=(a,b)∖K.

step 5.1step 6.1
7.2

Under step 4.1: 1/(n+1)∈K⊆V, so by [L1] there is B′∈BK with 1/(n+1)∈B′⊆V; and B′ is not of the form (c,d)∖K, which contains no point of K, so B′=(c,d) with c<1/(n+1)<d.

step 6.1L1
8.1

Under step 4.1: put t:=max⁡{ max⁡{a,c}, 1/(n+2) } by [L5]. Then t<1/(n+1): indeed a<0<1/(n+1) and c<1/(n+1), and 1/(n+2)<1/(n+1) by [L4], since ι(n+1)<ι(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)) contains no element of K. An element 1/(m+1) of it satisfies 1/(m+1)<1/(n+1), hence ι(n+1)<ι(m+1) by [L4], hence n+1<m+1 and so m+1≥n+2, whence 1/(m+1)≤1/(n+2)≤t by [L4] and step 8.1, contradicting t<1/(m+1).

step 8.1L4
10.1

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

step 8.1step 9.1A1
11.1

Under step 4.1: z∈(a,b)∖K=B⊆U, since a≤max⁡{a,c}≤t<z and z<1/(n+1)<b by step 6.1 and step 8.1; and z∈(c,d)=B′⊆V, since c≤max⁡{a,c}≤t<z and z<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 z in U∩V, contradicting the disjointness assumed in step 4.1; so no such U and V exist, and by [L6] the space (R,TK) 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). 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)) is the right place to look. The basic neighbourhood of 0 inside U has had all of K deleted, so it cannot be told apart from a usual interval except at the points of K; and any neighbourhood of the point 1/(n+1) of K must be an ordinary interval, because the deleted basic sets miss K altogether. Two such sets overlap in a nonempty interval, and the interval between consecutive members of K supplies a point of the overlap that is not in K. Writing "clearly some point of the overlap avoids K" would be the gap that this argument exists to close.

  • The index shift is not cosmetic. N contains 0 (The canonical natural ι(n)=n⋅1F of a field), so the set is written {1/(n+1):n∈N} and its largest element is 1; writing {1/n:n∈N} would divide by zero.

Depends on

Used by

Dependency tree · two levels

59 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources