Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 2026-08-05 (gpt-5.6-sol-codex-subscription)
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.

Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), with open covers, subcovers, finiteness and compactness as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, and finite, at most countable and uncountable as in Finite, countably infinite, countable, uncountable.

A subset AXA \subseteq X is called countably compact, Lindelöf, sequentially compact, limit point compact or σ\sigma-compact when the subspace (A,TA)(A, \mathcal{T}_A) is (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace), exactly as for compactness. Relative compactness is the exception and is deliberately not of that form: it is a statement about AA inside XX, since A\overline{A} is computed in XX, and a set may be relatively compact in one space and not in another that contains it. Every other notion on this list is intrinsic to the subspace.

The countable covers may be listed. A nonempty at most countable family U\mathcal{U} admits a surjection NU\mathbb{N} \to \mathcal{U} (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}), so countable compactness says: for every sequence (Un)nN(U_n)_{n \in \mathbb{N}} of open sets with X=nNUnX = \bigcup_{n \in \mathbb{N}} U_n there are finitely many indices whose sets already cover XX. That surjection is produced from the countability assumption alone and no choice principle is involved; the empty family covers only the empty space, which is compact anyway.

Indexing starts at 00. A sequence here is a function on N\mathbb{N} and N\mathbb{N} contains 00 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so a subsequence is (xnj)jN(x_{n_j})_{j \in \mathbb{N}} with n0<n1<n_0 < n_1 < \cdots and njjn_j \ge j (A strictly increasing index map satisfies nkkn_k \ge k). An index range taken from a text that starts at 11 must be shifted before it is used here.

Agreement with the metric definitions. Let (X,d)(X,d) be a metric space carrying its metric topology Td\mathcal{T}_d (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Then the three notions that Countably compact, sequentially compact and limit point compact metric spaces defines metrically are the three defined above, read in (X,Td)(X, \mathcal{T}_d):

So no statement below about a metrizable space introduces a second notion, and every theorem of the metric development about these three properties may be quoted here once a metric inducing the topology is named. Lindelöfness, σ\sigma-compactness and relative compactness have no metric counterpart in this library and are defined here for the first time.

Remarks

None of the conditions listed above is compactness by definition. Countable compactness restricts the covers tested; Lindelöfness weakens the conclusion from finite to at most countable; sequential compactness speaks about sequences instead of covers; limit point compactness speaks about subsets; σ\sigma-compactness asks only that the space be assembled from at most countably many compact pieces; relative compactness is a condition on a subset of an ambient space. Which implications hold between them, and which need a choice principle, is 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; that some of them fail to be equivalent is witnessed by the false statements at the end of this page.

Why σ\sigma-compactness is not a compactness property at all. The real line is σ\sigma-compact, being the union of the compact intervals [n,n][-n, n], and it is not compact; the definition is useful precisely because it names a class of spaces built out of compact pieces without being compact. The same remark explains why a σ\sigma-compact space need not be countably compact.

Limit point compactness is sometimes called the Bolzano-Weierstrass property, and countably compact is occasionally used for what is called limit point compact here. This library uses the four names above with the meanings given, and writes the condition out whenever the risk of confusion is real.

Depends on

Used by

Dependency tree · next 3 levels

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