Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-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.

N×{a,b}\mathbb{N} \times \{a,b\} with the indiscrete topology on the second factor is limit point compact and not countably compact, so the hypothesis that singletons are closed is not decoration

Statement refuted

Refuted: that a limit point compact space is countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets). The true statement carries a hypothesis: limit point compactness gives countable compactness when every singleton of the space is closed, and assuming countable choice (Compact implies countably compact, Lindel"of and limit point compact; countably compact together with Lindel"of implies compact; and, at the cost of countable or dependent choice, sequentially compact implies countably compact, countably compact implies limit point compact, and the converse holds when every singleton is closed, claim 4). The witness below satisfies every other part of that theorem's hypotheses and fails the singleton one, and it is not countably compact.

Witness. Let N\mathbb{N} carry the discrete topology and let D={a,b}D = \{a,b\} with aba \ne b carry the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), and give

X  :=  N×DX \;:=\; \mathbb{N} \times D

the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Then every nonempty subset of XX has a limit point in XX, so XX is limit point compact; the family {{n}×D:nN}\{\, \{n\} \times D : n \in \mathbb{N} \,\} is an at most countable open cover with no finite subcover, so XX is not countably compact; and no singleton of XX is closed.

Facts & Assumptions

Given: N\mathbb{N} with the discrete topology, D={a,b}D = \{a,b\} with the indiscrete topology, and X=N×DX = \mathbb{N} \times D with the product topology.

[L2]

Every subset of N\mathbb{N} is open, and the open subsets of DD are \varnothing and DD (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L3]

pp is a limit point of AA when every neighbourhood NN of pp satisfies N(A{p})N \cap (A \setminus \{p\}) \ne \varnothing; an open set containing pp is a neighbourhood of pp, and every neighbourhood of pp contains an open set containing pp (Interior, closure, boundary, exterior, derived set and isolated point in a topological space, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

Counterexample

technique · direct
1.1

The nonempty open subsets of XX are exactly the sets U×DU \times D with UNU \subseteq \mathbb{N} nonempty: by [L1] and [L2] every basic open set is U×=U \times \varnothing = \varnothing or U×DU \times D, and a union of sets of the second form is again of that form.

L1L2
2.1

Every nonempty AXA \subseteq X has a limit point in XX. Take (n,c)A(n,c) \in A and let p:=(n,c)p := (n,c') be the point with the same first coordinate and ccc' \ne c, which exists since DD has two elements. Every neighbourhood of pp contains an open set containing pp, hence by step 1.1 a set U×DU \times D with nUn \in U, and that set contains (n,c)(n,c), which lies in AA and differs from pp. So pp is a limit point of AA, and in particular every infinite subset of XX has one: XX is limit point compact.

L3L4step 1.1
2.2

The family {{n}×D:nN}\{\, \{n\} \times D : n \in \mathbb{N} \,\} consists of open sets by step 1.1, is at most countable, and covers XX; a finite subfamily is {n0}×D,,{nk}×D\{n_0\} \times D, \dots, \{n_k\} \times D and its union misses (m,a)(m, a) for any mm different from all the njn_j, which exists because N\mathbb{N} is not finite. So XX is not countably compact.

L4step 1.1
3.1

No singleton of XX is closed: the complement of {(n,c)}\{(n,c)\} contains (n,c)(n,c'), and by step 1.1 every open set containing (n,c)(n,c') contains {n}×D\{n\} \times D and hence (n,c)(n,c), so that complement is not open. This is the hypothesis of claim 4 of Compact implies countably compact, Lindel"of and limit point compact; countably compact together with Lindel"of implies compact; and, at the cost of countable or dependent choice, sequentially compact implies countably compact, countably compact implies limit point compact, and the converse holds when every singleton is closed, and steps 2.1 and 2.2 show that dropping it makes the implication fail.

L4step 1.1step 2.1step 2.2

Remarks

What the witness does and does not separate. It separates limit point compactness from countable compactness, and it does so for a reason that is entirely about separation of points: each point has a partner that no open set can distinguish it from, so every point of the space is a limit point of every set containing its partner. Limit point compactness is then satisfied for free.

The space is a product of two very simple spaces, and each factor contributes one half of the behaviour: the discrete factor supplies the countable open cover with no finite subcover, and the indiscrete factor supplies the partners that make every nonempty set have a limit point.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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