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.
Small Dowker ladder normality
Statement
Assume AC and the single-ladder two-target AD hypotheses of Small Dowker ladder topology. The resulting space is normal Hausdorff. Every disjoint closed pair has an at most countable, hence bounded, member; in particular there are no two disjoint uncountable closed sets.
The ladder family is almost : for each and each , there exists whose restriction to each , , is eventually constant with value . Here eventually means outside a bounded subset of . This is proved by countable local disjointification. No MA, uniformization theorem, or nonreflection theorem is assumed.
Facts & Assumptions
Given: The space , its active indices , lower-level ladders , and AC as in the statement.
The bounded-tail openness and closedness tests hold; intersections of distinct active ladders are bounded at either index; any two uncountable targets meet cofinally at common active indices (Small Dowker ladder topology).
Every is countable and countable subsets of are bounded under countable choice ( is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF, Assuming countable choice: every at most countable subset of is bounded below , so no at most countable subset of is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable).
Normality means separation of disjoint closed sets by disjoint open sets; Hausdorffness means separation of distinct points by disjoint open sets (Normal spaces and spaces, with the source disagreement over whether normality includes stated explicitly, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).
AC supplies countable choice for F2. A single enumeration of a fixed countable ordinal may be fixed once; subsequent least bounds and explicit assignments need no further simultaneous choices (The Axiom of Choice).
Proof
Every singleton is closed: for active , its intersection with is empty or a singleton with , bounded by since is a limit. Every initial segment is open, since implies . If , the initial segment is also closed: for active , equality is excluded and bounds . Points outside are isolated, and every is open because all ladders at its points lie in lower levels.
If disjoint closed were both uncountable, F1 would give active with both cofinal. The closedness test would force , impossible. Consequently one member is countable and is bounded by F2, whose choice hypothesis is supplied by A1.
Fix and an injective enumeration of , where is a finite initial segment of or all of . Such an enumeration exists by F2; if the domain is empty use the empty list. For each , the finitely many intersections with are bounded in by F1. Choose the least whose initial segment contains their union, and put . The empty union permits . Each is a cofinal tail; for , it misses and hence . For , define on , and off their disjoint union. This is a well-defined function on and equals on a tail of every . It proves almost , with arbitrary natural-number colors.
Given disjoint closed sets, interchange their names if necessary so that is bounded, by step 1.2. Choose a countable successor ordinal with ; if , take . Successors are inactive, so is clopen by step 1.1. Fix the disjoint tails from step 1.3 for this one once and for all. They give a specified extension operation by the formula there, valid for every later coloring on this same domain.
Suppose are disjoint closed sets with . On define for and otherwise, and extend each by the fixed operation of step 2.1. Set , where . The old sets are retained and . New points of one set avoid the other old set by definition; new points of both sets would require both and . Thus are disjoint.
Each in step 3.1 is closed. Indeed, let active have cofinal. Since and is closed, its old intersection is bounded; hence must be cofinal. All new points lie below , so . Equality is impossible since is inactive. Thus , giving . Its extension is eventually zero on , whereas every point of has extension value one, a contradiction. The closedness test of F1 now gives the assertion.
If active , disjointness gives and . On a common tail of the extensions therefore have these two values. Also is bounded because is closed and does not contain . Removing this additional bounded set puts the entire remaining tail in . This explicitly checks the exclusion of the other old set, as well as the two color requirements. Inactive indices have empty ladders and need no tail assertion.
Start and iterate the explicit operation of step 3.1 to obtain . Steps 4.1 and 4.2 preserve closedness, disjointness, , and containment of a ladder tail at each active point of in . The assignment is a fixed function of a pair, so finite iteration defines each stage; equivalently its graph consists of the unique endpoints of finite sequences of iterates. No countable selection of unspecified extensions is being assumed. Put and .
For any active , membership in some puts a tail of in . The exterior is open because is clopen; it supplies the open-set test at the remaining points of . There are no points of outside . Thus both are open. If , it lies below and in for some . Monotonicity puts it in the disjoint pair at stage , impossible. Each contains . This proves normality, including empty closed members. Separating the closed singletons of two distinct points proves Hausdorffness. QED.
Depends on
- Small Dowker ladder topology
- The Axiom of Choice
- Assuming countable choice: every at most countable subset of $\omega_1$ is bounded below $\omega_1$, so no at most countable subset of $\omega_1$ is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable
- $\omega_1$ is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF
- Normal spaces and $T_4$ spaces, with the source disagreement over whether normality includes $T_1$ stated explicitly
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
Used by
Dependency tree · two levels
33 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.