Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 X=(ω1,τ) 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 P0: for each ξ<ω1 and each c:Sˉξω, there exists c:ξω whose restriction to each Lα, αSˉξ, is eventually constant with value c(α). 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 X, its active indices Sˉ, lower-level ladders Lα, and AC as in the statement.

[F1]

The bounded-tail openness and closedness tests hold; intersections of distinct active ladders are bounded at either index; any two uncountable targets meet Lα cofinally at common active indices (Small Dowker ladder topology).

[A1]

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

1.1

Every singleton {x} is closed: for active αx, its intersection with Lα is empty or a singleton {x} with x<α, bounded by x+1<α since α is a limit. Every initial segment ξ<ω1 is open, since α<ξ implies Lααξ. If ξSˉ, the initial segment is also closed: for active αξ, equality α=ξ is excluded and ξ<α bounds ξLα. Points outside Sˉ are isolated, and every Wn is open because all ladders at its points lie in lower levels.

F1
1.2

If disjoint closed K0,K1 were both uncountable, F1 would give active α with both KiLα cofinal. The closedness test would force αK0K1, impossible. Consequently one member is countable and is bounded by F2, whose choice hypothesis is supplied by A1.

F1F2A1
1.3

Fix ξ<ω1 and an injective enumeration (αj)jJ of Sˉξ, where J 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 j, the finitely many intersections LαjLαk with k<j are bounded in αj by F1. Choose the least εj<αj whose initial segment contains their union, and put Tj=Lαjεj. The empty union permits ε0=0. Each Tj is a cofinal tail; for k<j, it misses Lαk and hence Tk. For c:Sˉξω, define c(γ)=c(αj) on Tj, and 0 off their disjoint union. This is a well-defined function on ξ and equals c(αj) on a tail of every Lαj. It proves almost P0, with arbitrary natural-number colors.

F1F2A1
2.1

Given disjoint closed sets, interchange their names if necessary so that K0 is bounded, by step 1.2. Choose a countable successor ordinal ξ with K0ξ; if K0=, take ξ=1. Successors are inactive, so ξ is clopen by step 1.1. Fix the disjoint tails Tj from step 1.3 for this one ξ once and for all. They give a specified extension operation cc by the formula there, valid for every later coloring on this same domain.

step 1.1step 1.2step 1.3F2
3.1

Suppose H0,H1 are disjoint closed sets with H0ξ. On Sˉξ define ci(α)=1 for αHi and 0 otherwise, and extend each by the fixed operation of step 2.1. Set Hi=HiPi, where Pi={γξH1i:ci(γ)=1 and c1i(γ)=0}. The old sets are retained and H0ξ. New points of one set avoid the other old set by definition; new points of both sets would require both c0=1,c1=0 and c1=1,c0=0. Thus H0,H1 are disjoint.

step 2.1construct
4.1

Each Hi in step 3.1 is closed. Indeed, let active αHi have LαHi cofinal. Since αHi and Hi is closed, its old intersection is bounded; hence LαPi must be cofinal. All new points lie below ξ, so αξ. Equality is impossible since ξ is inactive. Thus αSˉξHi, giving ci(α)=0. Its extension is eventually zero on Lα, whereas every point of Pi has extension value one, a contradiction. The closedness test of F1 now gives the assertion.

step 3.1F1
4.2

If active αHiξ, disjointness gives ci(α)=1 and c1i(α)=0. On a common tail of Lα the extensions therefore have these two values. Also H1iLα is bounded because H1i is closed and does not contain α. Removing this additional bounded set puts the entire remaining tail in PiHi. 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.

step 3.1F1
5.1

Start Ki0=Ki and iterate the explicit operation of step 3.1 to obtain Kin+1=(Kin). Steps 4.1 and 4.2 preserve closedness, disjointness, K0nξ, and containment of a ladder tail at each active point of Kinξ in Kin+1. 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 U0=nK0n and U1=(ω1ξ)nK1n.

step 3.1step 4.1step 4.2construct
6.1

For any active αUiξ, membership in some Kin puts a tail of Lα in Kin+1Ui. The exterior ω1ξ is open because ξ is clopen; it supplies the open-set test at the remaining points of U1. There are no points of U0 outside ξ. Thus both Ui are open. If xU0U1, it lies below ξ and in K0rK1s for some r,s. Monotonicity puts it in the disjoint pair at stage max(r,s), impossible. Each Ui contains Ki. This proves normality, including empty closed members. Separating the closed singletons of two distinct points proves Hausdorffness. QED.

step 5.1step 2.1F1F3

Depends on

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.

Sources