Alphabeta Math
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.

✓ 11 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 11 also cleared it.

Topology of R: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

An explicit open subset of R written as the disjoint union of its component intervals

Example

Take

U  :=  (−1,0)  ∪  (0,1)  ∪  (2,∞).

This is an open subset of R, and its order components in the sense of Every open subset of R is a countable disjoint union of open intervals, namely its order components are exactly the three intervals (−1,0), (0,1) and (2,∞): they are pairwise disjoint, their union is U, and there are three of them, a finite and hence at most countable family. The example is chosen so that one component is unbounded and two are bounded, and so that the two bounded ones are separated by a single missing point, 0, rather than by a gap of positive length.

Facts & Assumptions

Given: The set U:=(−1,0)∪(0,1)∪(2,∞), together with the order-convex hull H(x,y)={ z:x≤z≤y or y≤z≤x } and the relation x∼y  ⟺  H(x,y)⊆U on U, both as in Every open subset of R is a countable disjoint union of open intervals, namely its order components. Write A:=(−1,0), B:=(0,1) and C:=(2,∞).

[L1]

For an open U, the relation ∼ is an equivalence relation on U, its classes are the order components, and they are nonempty pairwise disjoint open intervals whose union is U, forming an at most countable family (Every open subset of R is a countable disjoint union of open intervals, namely its order components).

[L3]

Each of the nine interval forms is order-convex (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

U is open: A, B and C are open sets by [L2], and their union is open by [L2].

L2
1.2

A, B and C are pairwise disjoint with union U: an element of A is negative, an element of B lies strictly between 0 and 1, and an element of C exceeds 2, so no two of the three share a point, and the union is U by definition.

givenL3
2.1

Any two points of the same one of A, B, C are equivalent: if x,y∈A then H(x,y)⊆A⊆U because A is order-convex by [L3], so x∼y; the same argument applies inside B and inside C.

step 1.2L1L3
2.2

No two points of different ones of A, B, C are equivalent: for x∈A and y∈B, or for x∈A and y∈C, one has x<0<y, so 0∈H(x,y) while 0∉U; for x∈B and y∈C one has x<2<y, so 2∈H(x,y) while 2∉U. In each case H(x,y)⊈U and x≁y.

step 1.2L1
3.1

Every point of U lies in exactly one of A, B, C by step 1.2, and by steps 2.1 and 2.2 its equivalence class is precisely that one of the three; so the order components of U are exactly A, B and C, three pairwise disjoint nonempty open intervals with union U, which is the decomposition promised by [L1].

step 1.2step 2.1step 2.2L1∎

Remarks

  • The count is the number of components, not the number of points. There are three components here, while each of them is an uncountable set (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable). The at most countable family of Every open subset of R is a countable disjoint union of open intervals, namely its order components is a family of intervals, and a finite family is one instance of it.

  • What keeps two components apart may be a single missing point. A and B are kept apart by 0∉U alone, and no gap of positive length is required, although B and C happen to have one. This is why the components are defined by an equivalence relation on U and not by measuring distances between the pieces.

  • Reading the decomposition off the formula is legitimate here only because the three pieces were checked to be the classes. A presentation of an open set as a union of open intervals is not automatically its decomposition into components: (0,2)=(0,1)∪(0,2) writes an open set as a union of open intervals that are neither disjoint nor components.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

Q has closure R, empty interior, and boundary R

Example

Write QR for the copy of Q inside R (The rationals embed densely in the reals). Then

QR‾=R,(QR)∘=∅,∂QR=R,

with closure, interior and boundary as in Interior, closure, boundary and exterior of a subset of R. So the rationals are as large as possible for the closure operator and as small as possible for the interior operator at once, and their boundary is everything.

Facts & Assumptions

Given: The copy QR of Q in R and the set X:=R∖QR of irrationals.

[L1]

Interior, closure and boundary: ∂A=A‾∖A∘, and x∈A∘ exactly when some Nε(x) is contained in A (Interior, closure, boundary and exterior of a subset of R).

[L2]

Both QR and X are dense in R, that is, each has closure R (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

Verification

technique · direct
1.1

QR‾=R: this is the density of QR in [L2].

L2
1.2

(QR)∘=∅: suppose x were in the interior; by [L1] there would be a real ε>0 with Nε(x)⊆QR. But X‾=R by [L2], so x∈X‾ and every neighbourhood of x meets X by [L3]; a point of Nε(x)∩X then lies in QR and in its complement at once, which is impossible.

L1L2L3L4
1.3

By [L1] the boundary is ∂QR=QR‾∖(QR)∘.

L1
2.1

Substituting steps 1.1 and 1.2 into step 1.3 gives ∂QR=R∖∅=R, so all three assertions hold.

step 1.1step 1.2step 1.3L1∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

{1/k:k≥1}∪{0} is compact while {1/k:k≥1} is not closed

Example

Put

B  :=  { 1/k:k∈N, k≥1 }andA  :=  B∪{0}.

The index runs over k≥1 because 1/0 is undefined. Then A is compact (A subset of R is compact if and only if it is closed and bounded) and B is not closed (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen). The single point 0 is the whole difference: it is a limit point of B (Limit point, isolated point, adherent point, derived set, and dense subset of R) that B omits, and adjoining it turns a non-closed bounded set into a compact one.

Facts & Assumptions

Given: The sets B:={ 1/k:k≥1 } and A:=B∪{0}, where 1/k denotes the inverse of the canonical natural k⋅1R, defined and positive for k≥1.

[L1]
[L3]

U is open when each of its points has a neighbourhood inside it, and S is closed when R∖S is open; Nε(x)={ y:∣y−x∣<ε } (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

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

[L5]

Canonical naturals are positive and increasing for k≥1, with 1⋅1R=1; reciprocation of positives is positive and reverses the order, so 1≤m≤n gives 0<1/n≤1/m≤1 (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L6]

Every nonempty subset of N has a least element (The well-ordering principle).

[L7]

Every nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L8]

Absolute value: ∣z∣=z for z≥0 and ∣z∣=−z for z<0; the order is total and transitive (Basic properties of the absolute value, Ordered field, Complete ordered field (least-upper-bound property)).

Verification

technique · direct
1.1

Every element of A lies in [0,1], and 0 and 1 belong to A: indeed 1=1/1∈B, and 0<1/k≤1 for every k≥1 by [L5]. In particular A is bounded.

L1L5
1.2

0 is a limit point of B and 0∉B: given a real ε>0, [L4] supplies n≥1 with 1/n<ε, and 1/n∈B with 1/n≠0, so 1/n lies in the punctured neighbourhood of 0 of radius ε and meets B; and 0∉B because every 1/k is positive by [L5].

L2L4L5
2.1

Let x∈R∖A with x<0 or x>1. Put ε:=−x in the first case and ε:=x−1 in the second; then ε>0, and y∈Nε(x) gives y<x+ε=0 in the first case and y>x−ε=1 in the second, so y∉A by step 1.1. Hence Nε(x)∩A=∅.

step 1.1L3L8
2.2

Let x∈R∖A with 0≤x≤1. Then x≠0 and x≠1 by step 1.1, so 0<x<1. The set { k∈N:k≥1 and 1/k<x } is nonempty by [L4], so it has a least element k0 by [L6], and k0≠1 since 1/1=1>x; hence k0≥2 and k0−1≥1. By minimality 1/(k0−1)<x fails, so x≤1/(k0−1), and x≠1/(k0−1) because x∉A, so x<1/(k0−1). Put ε:=min⁡{ x−1/k0, 1/(k0−1)−x }>0 by [L7]. Then Nε(x)∩A=∅: an element of A is 0 or 1/m with m≥1; for 0 one has ∣0−x∣=x>ε since ε≤x−1/k0<x; for m≥k0 one has 1/m≤1/k0≤x−ε by [L5]; and for 1≤m≤k0−1 one has 1/m≥1/(k0−1)≥x+ε by [L5]. In each case the element is at distance at least ε from x.

step 1.1L3L4L5L6L7L8
2.3

B is not closed: by step 1.2 the point 0 is a limit point of B that does not lie in B, so B does not contain all its limit points and [L2] denies that it is closed.

step 1.2L2
3.1

A is closed: every x∈R∖A falls under step 2.1 or step 2.2 by totality of the order, and in either case some Nε(x) misses A, so R∖A is open. With the boundedness of step 1.1 and [L1], A is compact.

step 1.1step 2.1step 2.2L1L3L8
4.1

So A={ 1/k:k≥1 }∪{0} is compact by step 3.1 while B={ 1/k:k≥1 } is not closed by step 2.3, hence not compact by [L1].

step 2.3step 3.1L1∎

Remarks

  • B is bounded and not compact, and it fails to be closed by a single point. Adjoining 0 is what the verification above shows to be enough: A=B∪{0} is closed. The same computation, run at a point x∉A lying between two consecutive reciprocals, is the one that isolates each 1/k from the rest of B.

  • A is compact and has an isolated point. Every 1/k is isolated in A, so A is not perfect (Perfect subset of R: closed with no isolated points); compactness and perfectness are independent properties, and this is a compact set that is countable, which is possible exactly because it is not perfect (Every nonempty perfect subset of R is uncountable).

  • The index range matters. The set is indexed from k=1; 1/0 does not exist. Since N contains 0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), a set written {1/k:k∈N} without a restriction would be ill formed, and the same care is needed at the threshold K=n−1 used in the convergence arguments on the parent page.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

Every nondegenerate closed interval is perfect, giving a second proof that it is uncountable

Example

Let a,b∈R with a<b. Then the closed interval E:=[a,b] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) is perfect (Perfect subset of R: closed with no isolated points), and therefore uncountable by Every nonempty perfect subset of R is uncountable.

This is a second proof of the uncountability of a nondegenerate interval. The first, Every nondegenerate interval of R is uncountable, runs a trisection argument directly against an assumed enumeration; the route here checks two purely local properties, closedness and the absence of isolated points, and lets the perfect-set theorem do the counting.

Facts & Assumptions

Given: Reals a<b and the interval E:=[a,b]={ x:a≤x≤b }.

[L1]

A set is perfect when it is closed and no point of it is isolated in it; x∈P is isolated in P when some Nε(x) meets P only in x (Perfect subset of R: closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of R).

[L4]

Every nonempty perfect subset of R is uncountable (Every nonempty perfect subset of R is uncountable).

[L5]

For a<b the intervals [a,b] and (a,b) are uncountable (Every nondegenerate interval of R is uncountable).

[L6]

Every nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L7]

Ordered-field arithmetic: 0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0; adding a constant and multiplying by a positive preserve inequalities; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Verification

technique · direct
1.1

E is closed by [L2], and nonempty since a∈E.

L2
1.2

No point of E is isolated in E: let x∈E and let ε>0 be real. If x<b, put t:=min⁡{ε, b−x}⋅2−1, which is positive by [L6] and [L7], and y:=x+t; then y>x, and y≤x+(b−x)⋅2−1<b by [L7], while y>x≥a, so y∈E with y≠x and ∣y−x∣=t≤ε⋅2−1<ε. If x=b, then x>a; put t:=min⁡{ε, b−a}⋅2−1>0 and y:=x−t; then y<x≤b, and y≥b−(b−a)⋅2−1>a by [L7], so y∈E with y≠x and ∣y−x∣=t<ε. In both cases Nε(x) contains a point of E other than x, so no ε isolates x.

L1L3L6L7
2.1

By steps 1.1 and 1.2 the set E is closed with no isolated points, that is, perfect, and it is nonempty.

step 1.1step 1.2L1
3.1

By [L4] the nonempty perfect set E is uncountable, which reproves for [a,b] the first claim of [L5] along an independent route.

step 1.1step 2.1L4L5∎

Remarks

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

⋂k(−1/k,1/k)={0} is not open

Statement refuted

Refuted claim: an arbitrary intersection of open subsets of R is open (FALSE: an arbitrary intersection of open subsets of R is open, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

The witness is Uk:=(−1/k, 1/k) for k≥1: each Uk is a nonempty open interval, the family is nested, and

⋂k≥1(−1k, 1k)  =  {0},

which is not open. The index runs over k≥1 because 1/0 is undefined; read as a family indexed by N it is j↦(−1/(j+1), 1/(j+1)). The refutation is carried out in full in FALSE: an arbitrary intersection of open subsets of R is open and is recorded here as the named counterexample. The comparison worth keeping in view is the finite case: any finite subfamily of {Uk} has intersection the smallest of its members, which is open.

Facts & Assumptions

Given: For each natural k≥1 the interval Uk:=(−1/k, 1/k), where 1/k is the inverse of the canonical natural k⋅1R.

[A1]

The refuted claim: for every family of open subsets of R, the intersection is open.

[L1]

Each Uk is open, the intersection of the family is {0}, and {0} is not open (FALSE: an arbitrary intersection of open subsets of R is open).

[L2]

U is open when every point of it has a neighbourhood inside it, and each interval (a,b) is an open set; Nε(x)={ y:∣y−x∣<ε } (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of R: the nine order-convex forms, nondegeneracy, and length, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

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

[L4]

Canonical naturals are positive for k≥1 and their inverses are positive (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order); ∣z∣≥0 with ∣z∣=0 only for z=0, and ∣z∣<c exactly when −c<z<c for c>0 (Basic properties of the absolute value); 0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0 (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Counterexample

technique · direct
1.1

Each Uk is a nonempty open subset of R, being the interval (−1/k,1/k) with 1/k>0, so the family { Uk:k≥1 } is an instance of the claim [A1], which asserts that its intersection is open.

A1L1L2L4
1.2

0∈Uk for every k≥1, since ∣0∣=0<1/k by [L4].

L1L4
2.1

If x≠0 then ∣x∣>0 by [L4], so [L3] supplies a natural n≥1 with 1/n<∣x∣, and x∈Un would give ∣x∣<1/n, which trichotomy forbids; hence x∉Un. With step 1.2 this gives ⋂k≥1Uk={0}.

step 1.2L3L4
3.1

The singleton {0} is not open, since for every real ε>0 the point ε⋅2−1 lies in Nε(0) and differs from 0 by [L4]. So the family of step 1.1 consists of open sets and its intersection, computed in step 2.1, is not open: the claim [A1] is refuted.

step 1.1step 2.1A1L1L2L4∎

Remarks

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

[0,1) is neither open nor closed in R

Statement refuted

Refuted claim: every subset of R is open or closed (FALSE: every subset of R is either open or closed, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

The witness is the half-open interval E:=[0,1) (Intervals of R: the nine order-convex forms, nondegeneracy, and length). It fails openness at its left endpoint 0, which belongs to E while every neighbourhood of 0 reaches below 0, and it fails closedness at 1, which does not belong to E while every neighbourhood of 1 reaches into E. The refutation is carried out in full in FALSE: every subset of R is either open or closed and is recorded here as the named counterexample.

Facts & Assumptions

Given: The interval E:=[0,1)={ x∈R:0≤x<1 } (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A1]

The refuted claim: every subset of R is open or closed.

[L1]
[L2]

U is open when every x∈U admits ε>0 with Nε(x)⊆U; F is closed when R∖F is open; Nε(x)={ y:∣y−x∣<ε } (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

Every nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L4]

Absolute value: ∣z∣=z for z≥0 and ∣z∣=−z for z<0 (Basic properties of the absolute value); 0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0; adding a constant preserves an inequality and the order is total (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Counterexample

technique · direct
1.1

0∈E and 1∉E, so E is a legitimate instance of the claim [A1] and 1∈R∖E.

A1L4
1.2

E is not open: for a real ε>0 the point y:=−(ε⋅2−1) satisfies ∣y−0∣=ε⋅2−1<ε by [L4], so y∈Nε(0), while y<0 puts y outside E. Hence no neighbourhood of the point 0 of E is contained in E.

L1L2L4
1.3

E is not closed: for a real ε>0 put t:=min⁡{ε,1}⋅2−1, positive by [L3] and [L4], and y:=1−t; then t≤1⋅2−1 gives y≥1−1⋅2−1>0, and t>0 gives y<1, so y∈E; and ∣y−1∣=t≤ε⋅2−1<ε, so y∈Nε(1). Hence no neighbourhood of the point 1 of R∖E is contained in R∖E, so R∖E is not open.

L1L2L3L4
2.1

By steps 1.2 and 1.3 the set E is neither open nor closed, so the claim [A1] fails at E and is refuted.

step 1.1step 1.2step 1.3A1L1L2∎

Remarks

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

The cover {(1/k,1)} of (0,1) has no finite subcover, so (0,1) is not compact

Statement refuted

Refuted claim: the bounded interval (0,1) is compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset); equivalently, boundedness on its own is enough for compactness.

The witness is the family

U  :=  { Vk:k≥1 },Vk:=(1/k, 1),

of open subsets of R. The index runs over k≥1 because 1/0 is undefined, and the first member is degenerate: V1=(1,1)=∅, which is harmless, since a cover may contain empty members. The family covers (0,1) and no finite subfamily does.

Facts & Assumptions

Given: For each natural k≥1 the interval Vk:=(1/k, 1), where 1/k is the inverse of the canonical natural k⋅1R, and the family U:={ Vk:k≥1 }.

[A1]

The refuted claim: (0,1) is compact.

[L1]

An open cover of S is a family of open subsets of R whose union contains S; S is compact when every open cover has a finite subfamily, empty or of the form {U0,…,Up}, whose union contains S (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset).

[L3]

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

[L4]

Canonical naturals are positive and increasing for k≥1, with 1⋅1R=1; reciprocation of positives is positive and reverses the order, so 1≤m≤n gives 0<1/n≤1/m≤1 (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L5]

Every nonempty finite set of reals has a maximum and a minimum, each one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L6]

Absolute value and ordered-field arithmetic: ∣z∣=z for z≥0; 0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0; the order is total and transitive (Basic properties of the absolute value, The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L7]

A subset of R is compact exactly when it is closed and bounded (A subset of R is compact if and only if it is closed and bounded).

Counterexample

technique · direct
1.1

Each Vk is an open subset of R by [L2], and U covers (0,1): given x with 0<x<1, [L3] supplies a natural n≥1 with 1/n<x, so x∈Vn. Hence U is an open cover of (0,1).

L1L2L3L4
1.2

(0,1) is nonempty, since 1⋅2−1 satisfies 0<1⋅2−1<1 by [L6].

L6
1.3

(0,1) is not closed: 0∉(0,1), and for a real ε>0 the point t:=min⁡{ε,1}⋅2−1 is positive, satisfies t≤1⋅2−1<1 and ∣t−0∣=t≤ε⋅2−1<ε by [L5] and [L6], so t∈Nε(0)∩(0,1); hence no neighbourhood of 0 lies in the complement of (0,1) and that complement is not open.

L2L5L6
2.1

No finite subfamily of U covers (0,1): the empty subfamily fails by step 1.2, and a nonempty finite subfamily is {Vk0,…,Vkp} with each ki≥1; put K:=max⁡{k0,…,kp} by [L5], one of the ki, so K≥1. Since ki≤K gives 1/K≤1/ki by [L4], each Vki is contained in VK=(1/K,1), so the union of the subfamily lies in VK. The point z:=1/(K+1) satisfies 0<z≤1⋅2−1<1 by [L4] and [L6], since K+1≥2, so z∈(0,1); and z≤1/K by [L4], so 1/K<z fails and z∉VK. Thus z is uncovered.

step 1.2L1L4L5L6
3.1

The family U is therefore an open cover of (0,1) with no finite subcover, so (0,1) is not compact and the claim [A1] is refuted. This is consistent with [L7]: (0,1) is bounded but not closed by step 1.3, so [L7] predicts exactly this failure.

step 1.1step 1.3step 2.1A1L1L7∎

Remarks

  • The cover creeps up on the missing endpoint. Every member of U stops short of 0, and the whole family reaches every point of (0,1) only because the reciprocals 1/k get arbitrarily small (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε). A finite subfamily stops at the largest of its indices K and therefore misses every point of (0,1) that is at most 1/K.

  • The empty member is not a defect. V1=(1,1) is empty because 1/1=1; a family of open sets is a cover as long as its union contains the set, and an empty member contributes nothing either way. Writing the family from k=2 instead would change nothing in the argument.

  • The closed interval behaves differently, and that is the whole point. [0,1] is compact by Heine-Borel by bisection: every closed bounded interval [a,b] is compact, and the analogous family {(1/k,1)} is not even a cover of it, since it misses both 0 and 1. The endpoint that the cover above exploits is 0, which (0,1) omits and [0,1] contains.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

{q∈Q:q≥0, q2<2} is closed and bounded in Q and is not compact

Statement refuted

Refuted claim: in every ordered field a closed bounded set is compact, so the completeness hypothesis of the Heine-Borel characterisation is unnecessary (FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness).

The witness is the ordered field Q (The rationals as equivalence classes of pairs of integers, The rationals form a totally ordered field) together with

S  :=  { q∈Q:q≥0 and q2<2 }.

The set S is bounded, is closed in Q, and is not compact in Q, all with respect to the vocabulary of Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset transposed from R to Q exactly as set out in FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness, where the refutation is carried out in full. This item records the witness and says what makes it work.

Facts & Assumptions

Given: The ordered field Q and the set S:={ q∈Q:q≥0 and q2<2 }, with "open in Q", "closed in Q", "bounded" and "compact in Q" as defined in FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness.

[A1]

The refuted claim: in every ordered field a closed bounded set is compact.

[L1]

S is nonempty and bounded, has no greatest element, is closed in Q, and the family { { y∈Q:y<r }:r∈S } is a cover of S by sets open in Q with no finite subfamily covering S (FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness).

[L3]

No rational number squares to 2 (FALSE: some rational number squares to 2).

[L4]

Squaring is strictly monotone on the nonnegatives of an ordered field (Squaring is monotone on the nonnegatives).

Counterexample

technique · direct
1.1

Q is an ordered field by [L2], so it is a legitimate instance of the claim [A1].

A1L2
1.2

S is bounded and closed in Q by [L1]; the closedness rests on the fact that no rational squares to 2 ([L3]), which is what makes the complement of S split into the rationals below 0 and those whose square exceeds 2, and on the monotonicity of squaring ([L4]), which is what makes each of those two pieces open in Q.

L1L2L3L4
1.3

S is not compact in Q: the cover exhibited in [L1] consists of sets open in Q, covers S because S has no greatest element, and admits no finite subfamily covering S, since the largest index of such a subfamily is itself a member of S that the subfamily leaves uncovered.

L1L2
2.1

So the ordered field Q carries a bounded set that is closed in Q and not compact in Q, and the claim [A1] is refuted.

step 1.1step 1.2step 1.3A1L1∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

Q∩[0,2] is bounded and disconnected, so being an interval of Q is not enough

Statement refuted

Refuted claim: the set E:=QR∩[0,2] of rationals between 0 and 2 is connected (Separated sets, disconnection, and connected subset of R), where QR is the copy of Q inside R (The rationals embed densely in the reals).

E is bounded, and it contains every rational lying between its two endpoints, so it is order-convex as a subset of the ordered field Q: it is an interval of that field. As a subset of R it is nevertheless disconnected, split at the irrational point 2. So the equivalence of A subset of R is connected if and only if it is order-convex, that is, an interval genuinely uses the completeness of R, and "is an interval of the order it carries from Q" is not enough to make a set connected.

Facts & Assumptions

Given: The copy QR of Q in R, the set E:=QR∩[0,2], and the real r with r≥0 and r2=2.

[A1]

The refuted claim: E is connected.

[L1]

Separated sets, disconnection and connectedness (Separated sets, disconnection, and connected subset of R).

[L3]

Each of (−∞,c] and [c,∞) is a closed set and each of (−∞,c) and (c,∞) is an open set (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L4]

In a complete ordered field every a≥0 has a unique s≥0 with s2=a (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

[L5]

No rational squares to 2 (FALSE: some rational number squares to 2); the map q↦q^ is an injective embedding of ordered fields, so it preserves sums, products and the order (The rationals embed densely in the reals, The rationals as equivalence classes of pairs of integers).

[L6]

Squaring is strictly monotone on the nonnegatives: 0≤a<b gives a2<b2 (Squaring is monotone on the nonnegatives); 0<1 and the order is total and transitive (The multiplicative identity is positive, Ordered field, Complete ordered field (least-upper-bound property)).

[L7]

A set is bounded when it has an upper and a lower bound (Lower bound, bounded below, bounded set).

Counterexample

technique · direct
1.1

By [L4] there is a unique real r≥0 with r2=2, and 0<r<2: indeed r≠0 since 02=0≠2, while r≥2 would give r2≥4>2 by [L6].

L4L6
1.2

r∉QR: if r=q^ for a rational q, then q2^=q^⋅q^=r2=2=2^ by [L5], and injectivity of the embedding gives q2=2 in Q, contradicting [L5].

L5
1.3

E is bounded, since 0≤y≤2 for every y∈E by the definition of E.

givenL7
2.1

Put A:=E∩(−∞,r) and B:=E∩(r,∞). Then A∪B=E, because every y∈E satisfies y≠r by step 1.2 and hence y<r or y>r; and both are nonempty, since 0∈A and 2∈B by step 1.1, both being rationals in [0,2].

step 1.1step 1.2L3L5L6
3.1

A and B are separated: (−∞,r] is closed and contains A, so A‾⊆(−∞,r] by [L2] and hence A‾∩B⊆(−∞,r]∩(r,∞)=∅; symmetrically B‾⊆[r,∞) and A∩B‾=∅. Hence (A,B) is a disconnection of E and E is disconnected, so the claim [A1] is refuted.

step 2.1A1L1L2L3∎

Remarks

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

{0}∪[1,2] is closed, has an isolated point, and is not perfect

Statement refuted

Refuted claim: every closed subset of R is perfect (Perfect subset of R: closed with no isolated points).

The witness is E:={0}∪[1,2]. It is closed, being a union of two closed sets (Arbitrary unions and finite intersections of open subsets of R are open, and dually for closed sets), and 0 is an isolated point of it (Limit point, isolated point, adherent point, derived set, and dense subset of R), so the second clause of the definition of a perfect set fails while the first holds.

Facts & Assumptions

Given: The set E:={0}∪[1,2], where {0}=[0,0] and [1,2] are closed bounded intervals (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A1]

The refuted claim: every closed subset of R is perfect.

[L1]

A set is perfect when it is closed and no point of it is isolated in it; x∈P is isolated in P when some Nε(x) satisfies Nε(x)∩P={x} (Perfect subset of R: closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of R).

[L3]

Nε(x)={ y:∣y−x∣<ε }, and ∣y∣=y for y≥0 (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Basic properties of the absolute value).

[L4]

0<1, so 2:=1+1>0 and 0<1⋅2−1<1; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Counterexample

technique · direct
1.1

E is closed: {0}=[0,0] and [1,2] are closed sets by [L2], and their union is closed by [L2]. So E is a legitimate instance of the claim [A1].

A1L2
1.2

0 is an isolated point of E: certainly 0∈E; put ε:=1⋅2−1, which is positive and <1 by [L4]. An element y of E is 0 or lies in [1,2], and in the second case ∣y−0∣=y≥1>ε by [L3] and [L4], so y∉Nε(0). Hence Nε(0)∩E={0}.

L1L3L4
2.1

By step 1.2 the closed set E of step 1.1 has an isolated point, so it is not perfect by [L1], and the claim [A1] is refuted.

step 1.1step 1.2A1L1∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26Open item page →

Z is closed and not compact, and (0,1) is bounded and not compact: neither hypothesis of Heine-Borel can be dropped

Statement refuted

Refuted claims: (i) every closed subset of R is compact; (ii) every bounded subset of R is compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset).

Both are refuted, so neither hypothesis of A subset of R is compact if and only if it is closed and bounded can be dropped. The witness for (i) is the set Z of integers of R, which is closed and unbounded; the witness for (ii) is the interval (0,1), which is bounded and not closed.

What Z means here. Write Z  :=  { n⋅1R:n∈N }∪{ −(n⋅1R):n∈N },0⋅1R:=0, the set of canonical integers of R. By The unique embedding of ℚ into an ordered field this is exactly the image of the integers (The integers as equivalence classes of pairs of naturals) under the unique field homomorphism Q→R, which sends n to n⋅1R and −n to −(n⋅1R); as is standard we write Z for it. Nothing below uses that identification: every step is carried out with the displayed description.

Facts & Assumptions

Given: The set Z of canonical integers of R as displayed above, and the interval (0,1).

[A1]

The refuted claims: (i) every closed subset of R is compact; (ii) every bounded subset of R is compact.

[L2]

Canonical naturals: n⋅1R>0 for n≥1, the map n↦n⋅1R is strictly increasing on {1,2,… } with 1⋅1R=1, and (m+n)⋅1R=m⋅1R+n⋅1R for m,n≥1 (Canonical naturals are positive and strictly increasing).

[L3]

Archimedean property: for every x∈R there is a natural n≥1 with x<n⋅1R (Every complete ordered field is Archimedean).

[L4]

U is open when each of its points has a neighbourhood inside it; F is closed when R∖F is open; Nε(x)={ y:∣y−x∣<ε }; each interval (a,b) is an open set (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L5]

A set is bounded when it has a lower and an upper bound (Lower bound, bounded below, bounded set).

[L6]

Triangle inequality: ∣p+q∣≤∣p∣+∣q∣ (The triangle inequality); ∣z∣=z for z≥0 and ∣z∣=−z for z<0, and ∣−z∣=∣z∣ (Basic properties of the absolute value).

[L7]

Every nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L8]

0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0; adding a constant preserves an inequality and the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Counterexample

technique · direct
1.1

Distinct elements of Z differ by at least 1 in absolute value. For m,n∈N with m<n: if m=0 then n⋅1R−0=n⋅1R≥1 by [L2], since n≥1 and the map is increasing with value 1 at 1; and if m≥1 then m+(n−m)=n with n−m≥1 gives n⋅1R−m⋅1R=(n−m)⋅1R≥1 by [L2]. The same computation after negation covers two distinct elements of the form −(n⋅1R), using ∣−z∣=∣z∣ from [L6]. Finally, for distinct n⋅1R and −(m⋅1R) at least one of n,m is ≥1, so their difference n⋅1R+m⋅1R is a sum of two nonnegative terms one of which is ≥1, hence is ≥1.

givenL2L6L8
1.2

Z is not bounded: given any x∈R, [L3] supplies a natural n≥1 with x<n⋅1R, and n⋅1R∈Z, so no x is an upper bound of Z and Z has no upper bound at all.

givenL3L5
1.3

(0,1) is bounded, since 0≤y≤1 for every y∈(0,1), and it is not closed: 0∉(0,1), while for every real ε>0 the point t:=min⁡{ε,1}⋅2−1 satisfies 0<t<1 and ∣t−0∣=t≤ε⋅2−1<ε by [L7] and [L8], so t∈Nε(0)∩(0,1) and no neighbourhood of 0 lies in the complement of (0,1).

L4L5L6L7L8
2.1

Z is closed: let x∈R∖Z. The neighbourhood N1⋅2−1(x) contains at most one element of Z, since two distinct elements z,z′ of it would satisfy ∣z−z′∣=∣(z−x)+(x−z′)∣≤∣z−x∣+∣x−z′∣<1⋅2−1+1⋅2−1=1 by [L6], contradicting step 1.1. If it contains none, then N1⋅2−1(x)∩Z=∅. If it contains exactly one element z, then z≠x because x∉Z, so ∣x−z∣>0, and ε:=min⁡{ 1⋅2−1, ∣x−z∣ } is positive by [L7]; then Nε(x)⊆N1⋅2−1(x), so any element of Z in Nε(x) must be z, whereas ∣z−x∣≥ε excludes z. In both cases some neighbourhood of x misses Z, so R∖Z is open.

step 1.1L4L6L7L8
3.1

By step 2.1 the set Z is closed and by step 1.2 it is not bounded, so [L1] denies that it is compact, refuting claim (i) of [A1]; and by step 1.3 the set (0,1) is bounded and not closed, so [L1] denies that it is compact, refuting claim (ii). Neither hypothesis of [L1] is therefore removable.

step 1.2step 1.3step 2.1A1L1∎

Remarks

Sources