Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 ordinal box spaces on infinite index sets

Definition

Assume AC. Fix an infinite B⊆ω∖{0,1} and put

PB=∏n∈B(ℵn+1)={h:dom⁡h=B, h(n)≤ℵn for every n∈B}.

Each factor is the ordinal interval [0,ℵn] with its order topology, as in The order topology on an ordinal, with the half-open intervals (α,β] and the initial segments [0,β] as a basis. Give PB the box topology: its open sets are unions of boxes ∏n∈BOn with every On open in its factor. The whole product is such a box, and the intersection of two boxes is the box with factors On∩Vn, so this prescription defines a topology. In contrast, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space restricts a basic box to have only finitely many factors different from the whole factor. No such restriction is imposed here.

The Rudin space on B is the subspace

XR(B)={h∈PB:there is m<ω such that ω<cf⁡(h(n))<ℵm for every n∈B}.

The witness m may depend on the point h, but one m must bound the cofinalities of all its coordinates. Both inequalities are strict. The coordinate endpoint h(n)=ℵn is allowed when the uniform cofinality condition permits it.

Use pointwise a<b to mean a(n)<b(n) at every coordinate, and define

(a,b]R={h∈XR(B):a(n)<h(n)≤b(n) for every n∈B}.

The bounds a,b are members of PB with a<b; they need not belong to XR(B). These half-open boxes, and in particular (a,h]R at h∈XR(B), give the local base proved in Clopen boxes and the P-space property ↗. Eventual comparisons remain those of Reduced products, true cofinality and scales; pointwise and eventual comparisons are distinct conventions throughout.

Depends on

Used by

Dependency tree · two levels

18 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