Alphabeta Math
TheoremStatement: 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.

Rudin ZFC Dowker space and its size

Statement

Assume AC. For every infinite B⊆ω∖{0,1}, XR(B) is a Dowker space constructed in ZFC, and

∣XR(B)∣=ℵωℵ0.

Here Dowker means T1, normal and not countably paracompact, and the power is cardinal exponentiation. The result assumes neither CH nor a value for the continuum.

Facts & Assumptions

Given: The stated infinite B and AC. Put X=XR(B) and Q=∏n∈Bℵn.

[F1]

XR(B) is Hausdorff and collectionwise normal, hence normal (Rudin spaces are collectionwise normal).

[F2]

Its decreasing closed initial-top slices have empty intersection, but every sequence of their open neighborhoods has nonempty intersection (Rudin shrinking obstruction).

[F3]

In a normal space, countable paracompactness is equivalent to existence, for every decreasing closed sequence with empty intersection, of open expansions with empty intersection (Increasing-cover and decreasing-closed-set criteria, (iv)).

[F4]

A T1 normal space which is not countably paracompact is a Dowker space (Countable paracompactness and Dowker spaces).

[F8]

The ordinal product α⋅β is the order type of β copies of α laid end to end, whose underlying set is α×β (α⋅β is the order type of α×β ordered by last differences, that is β copies of α).

[F9]

The product of two nonzero infinite-cardinal-bounded sets has size at most their largest infinite cardinal bound (Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0).

[F11]

XR(B) lies in the inclusive-top product PB and consists of its points with uncountable coordinate cofinalities uniformly below a finite aleph (Rudin ordinal box spaces on infinite index sets).

[A1]

AC is assumed for the cited topological results and for cardinal comparison of the function sets (The Axiom of Choice).

Proof

1.1F1F2F3F4A1

By F1 and A1, X is Hausdorff and normal. It is T1: for distinct p,q, disjoint neighborhoods supplied by Hausdorffness give a neighborhood of q excluding p, so X∖{p} is open as the union of such neighborhoods. If X were countably paracompact, F3 would give open expansions with empty intersection for the decreasing closed sequence in F2. F2 rules out precisely those expansions. Hence X is not countably paracompact, and F4 makes it a Dowker space.

1.2F5F6F11A1

For each n∈B define an injection en:[0,ℵn]⟶ℵn by en(ℵn)=0, en(r)=r+1 for finite r, and en(α)=α for ω≤α<ℵn. The three image parts are respectively zero, the positive finite ordinals, and the infinite ordinals below ℵn; they are disjoint and the maps on them are injective. Thus h↦(n↦en(h(n))) injects the inclusive-top product PB, and hence X by F11, into Q. F5, F6 and A1 give ∣X∣≤ℵωℵ0.

1.3F7F8F9F10

For n∈B and α<ℵn set dn(α)=ω1⋅(α+1), with ordinal multiplication. By F8 its cardinality is that of ω1×(α+1). Since n≥2, both factors have cardinality at most μ=max⁡(ℵ1,∣α+1∣)<ℵn. F9 bounds the product size by μ; its ordinal order type is therefore below the initial ordinal ℵn. These values are strictly increasing with α: if α<β, the first α+1 blocks form a proper initial segment of the β+1 blocks in F8, so their order type is strictly smaller. Each value has cofinality exactly ω1. Its last block has order type ω1 and is cofinal, giving the upper bound. For a set of size less than ω1, its points in that block are bounded there by F7 and F10; a later point in the last block bounds the whole set, since all preceding blocks lie below it. This proves the lower bound on cofinality. At α=0 the value is ω1, so the same proof includes zero.

2.1step 1.1step 1.2step 1.3F5F6F11A1

Define D:Q⟶PB by D(q)(n)=dn(q(n)). Step 1.3 shows that every coordinate is below its factor top and has cofinality ω1. Hence F11 gives D(q)∈X, with the strict uniform cofinality bound ℵ2. If q≠q′, they differ at some coordinate n; injectivity of dn then gives D(q)≠D(q′). Thus D is injective, and F5, F6 and A1 give ℵωℵ0≤∣X∣. Combined with step 1.2 this proves equality. Step 1.1 proves the Dowker assertion. All constructions used only ZFC and the stated infinite-coordinate hypotheses. QED.

Depends on

Used by

Dependency tree · two levels

54 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