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.
CH yields a normal nonmetrizable Moore space
Statement
proves that a normal nonmetrizable Moore space exists. By Metrizable spaces are collectionwise normal such a space is the CH instance of the failure of the normal Moore space conjecture.
Facts & Assumptions
Given: The continuum hypothesis (The continuum hypothesis, and what this page does not prove): every uncountable set of reals is equinumerous with ; equivalently here , i.e. in the von Neumann ordinals (Cardinal (initial ordinal) and cardinality, The natural numbers (von Neumann)).
is the least infinite cardinal and is the least uncountable cardinal; a countable ordinal is one below , and the nonzero limit ordinals below are exactly the countable ordinals of cofinality (The natural numbers (von Neumann), Cardinal (initial ordinal) and cardinality).
Clubs and stationarity in : the set of nonzero limit ordinals below contains the club of all limit ordinals and is therefore stationary (Closed unbounded subsets of ordinals, Basic stationary-set calculus).
Fleissner's construction (Fleissner's construction of a normal nonmetrizable Moore space from level data): if is an infinite cardinal, is an increasing sequence of cardinals with and for every , , is stationary, and some fixed ladders admit the separation functions for every , then a normal nonmetrizable Moore space exists (Fleissner's HYP covering interface, Moore spaces and developments).
In ZFC, for every at-most-countable set there is an index set which is either a finite initial segment of or all of , and a bijection ; choice permits these bijections to be fixed simultaneously for all (The Axiom of Choice, A function is a relation with and implying ; , the value , domain and codomain).
Proof
Work in and put , for , and is a nonzero limit ordinal. Then by [F1], and is stationary in by [F2].
The parameters of step 1.1 satisfy the numerical hypotheses of [F3]: ; for every the ordinal is a finite ordinal, hence ; and is .
Fix, for each , an increasing sequence of nonlimit ordinals cofinal in ; such a sequence exists because has cofinality , and all the sequences are chosen simultaneously by choice.
For every there is a function with whenever are in and . Indeed is at most countable, so by [F4] fix a bijection from an index set , where is either a finite initial segment of or all of , onto . For in the set is finite, because if the two increasing ladders agreed at infinitely many levels then those common values would be cofinal in both and , forcing . Recursively for , define . The set maximized over is finite (also when is finite or empty), so the recursion is well defined. If are in , then and every satisfies ; hence no coincidence level of the pair reaches . Thus is well defined by injectivity of the enumeration and has the required separation property.
Steps 2.1, 2.2 and 3.1 put exactly the hypotheses of [F3] at , and ( already) applying it yields a normal nonmetrizable Moore space.
Remarks
-
The CH instance satisfies the local HYP interface. For every one has , so the interface's clause (3b), which concerns only , is vacuous. At , the two disjoint sets and are both clubs; thus contains a club but is nevertheless nonstationary. Step 3.1 independently proves the countable ladder separation that the construction consumes, as in the source's parenthetical countable-case argument.
-
Where CH is used. Only in (step 2.1). The stationarity of and the countable ladder separation are theorems of .
Depends on
- Fleissner's HYP covering interface
- Moore spaces and developments
- Normalized families and collectionwise normality
- Metrizable spaces are collectionwise normal
- The continuum hypothesis, and what this page does not prove
- Fleissner's construction of a normal nonmetrizable Moore space from level data
- The natural numbers $\mathbb{N}$ (von Neumann)
- Cardinal (initial ordinal) and cardinality
- Closed unbounded subsets of ordinals
- Basic stationary-set calculus
- The Axiom of Choice
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
Used by
- V=L refutes the normal Moore space conjecture Corollary
- False: ZFC proves the normal Moore space conjecture False statement
Dependency tree · two levels
67 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
- William G. Fleissner, If all normal Moore spaces are metrizable, then there is an inner model with a measurable cardinal (standard reference, not scraped)