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.
Countability Axioms and Cardinal Functions: Examples and Counterexamples
1 · Prerequisites
- Cardinal Arithmetic, Cofinality and the Alephs
- Cardinal Arithmetic, Cofinality and the Alephs — Examples
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Hereditary and Productive Behaviour of the Separation Axioms
- Limits of Real Functions
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Under choice, for the usual real line, under the raw convention
Example
Specializing is a countable dense subset of , and rational open boxes form a countable basis to , rational-endpoint intervals and the rational points give countable bases and dense sets for the usual real line. The inequalities and then give countable upper bounds for all five functions (Under choice, and ). No finite family can be a basis or a local base, and finite covers or cellular families have arbitrarily large finite witnesses. Thus the five raw functions are all .
Under choice, for an infinite discrete space of cardinality , while
Example
For an infinite discrete of cardinality , singletons force every basis, dense set, singleton cover, and cellular family to have size . At a point, is a one-member local base. Hence and .
For the lower-limit line, and under choice
Example
Assume Choice and let be the lower-limit line. At , the intervals form a countable local base. No finite family is a local base: the intersection of finitely many neighbourhoods is still a neighbourhood and contains some , whereas cannot contain any member of a finite local base contained in that intersection. Hence .
The rationals are countable and meet every nonempty half-open interval, so ; no finite set is dense, since a short half-open interval can avoid it. The published lower-limit-line lemma gives Lindelöfness, while the cover has no finite subcover, so . Density bounds cellularity above, and the disjoint family bounds it below, giving .
All half-open intervals form a basis of cardinality at most . Conversely, well order any basis and assign to each its first member with ; if , then cannot contain , so . Thus .
Assuming choice, the lower-limit plane is first countable, separable, and ccc, but not second countable or Lindelöf
Example
Let be the lower-limit line. Under Choice, the countable-product theorem makes first countable, and the rational grid is a countable dense subset; hence is separable and therefore ccc. The antidiagonal is an uncountable closed discrete subspace, as proved in Refuted: separability is hereditary and Assuming countable choice, refuted: Lindelöfness is productive. If were second countable, hereditary second countability would make the discrete space second countable, which is impossible because every basis of a discrete space contains all its singletons. The explicit open cover in Assuming countable choice, refuted: Lindelöfness is productive shows directly that is not Lindelöf.
The one-point compactification of the discrete real line is compact and Lindelöf but is neither first countable nor separable
Example
Give the discrete topology and form . The one-point compactification theorem makes compact, hence Lindelöf, and every point of remains isolated.
A neighbourhood of has finite complement in , since compact subsets of a discrete space are finite. If were a countable local base at , put . For every , the neighbourhood would contain some , so . Each finite subset of has a canonical increasing enumeration; these enumerations and countability of make the displayed union countable, contradicting uncountability of . Thus is not first countable. Finally every dense subset must meet the open singleton for every , so it contains all of and cannot be countable; hence is not separable.
Assuming countable choice, is first countable and countably compact but is not separable or Lindelöf
Example
Assume countable choice. Successor ordinals and are isolated. If is a nonzero limit, enumerate the at most countable ordinal and take the successive finite suprema of that enumeration; the result is a countable cofinal sequence, and the corresponding final intervals form a local base at . Thus is first countable. The published ordinal theorem makes it countably compact.
Every at most countable subset is bounded by some , so the nonempty open tail above misses ; hence is not separable. The open initial segments cover , but any at most countable subfamily has bounded union and therefore fails to cover. Thus is not Lindelöf.
Under choice, a concrete ccc nonseparable Cantor cube indexed above
Example
Let . Cantor's theorem gives . Under choice, Under choice, every Cantor cube satisfies ccc makes ccc and Under choice, if , then the Cantor cube is not separable makes it nonseparable.
Assuming choice, a separable space with a nonseparable subspace: the lower-limit plane and its antidiagonal
Statement refuted
Separability is hereditary.
Facts & Assumptions
Given: The lower-limit plane and its antidiagonal .
The lower-limit plane is separable, and its antidiagonal is an uncountable discrete subspace (Assuming choice, the lower-limit plane is first countable, separable, and ccc, but not second countable or Lindelöf).
The false statement being exhibited asserts that every subspace of a separable space is separable (Refuted: separability is hereditary).
Counterexample
By [L1], the space is separable.
By [L1], the subspace is uncountable and discrete, so it has no at most countable dense subset.
Thus is a separable space with the nonseparable subspace , contradicting the assertion recalled in [L2].
Assuming choice, a Lindelöf space whose square is not Lindelöf: the lower-limit line
Statement refuted
Assuming countable choice, Lindelöfness is productive.
Facts & Assumptions
Given: The lower-limit line and its square .
The lower-limit line has Lindelöf degree , hence is Lindelöf (For the lower-limit line, and under choice).
The lower-limit plane is not Lindelöf (Assuming choice, the lower-limit plane is first countable, separable, and ccc, but not second countable or Lindelöf).
The false statement being exhibited asserts that products of Lindelöf spaces are Lindelöf (Assuming countable choice, refuted: Lindelöfness is productive).
Counterexample
The factor is Lindelöf by [L1].
Its square is not Lindelöf by [L2].
Hence the product fails the conclusion while each displayed factor satisfies the hypothesis, refuting the assertion in [L3].
Sources
Standard references
Recommended treatments; not extraction sources.
- D. H. Fremlin, Measure Theory, Chapter 5A
- Separable space (Wikipedia)
- Cardinal function (Wikipedia)
- UCR General Topology Notes
- Lower limit topology (Wikipedia)
- Sorgenfrey plane (Wikipedia)
- Fort space (Wikipedia)
- Alexandroff extension (Wikipedia)
- First uncountable ordinal (Wikipedia)
- Order topology (Wikipedia)
- Cantor cube (Wikipedia)