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.

Clopen boxes and the P-space property

Statement

Assume AC and fix the infinite coordinate set B of the Rudin definitions. In each of Z=YB and Z=XR(B), the boxes

(a,h]Z={xZ:a(n)<x(n)h(n) for every nB},a<h,

form a clopen local base at each hZ. More generally (a,b]Z is clopen for all a,bPB with a<b, even when bZ. Every countable intersection of open subsets of either space is open; thus both are P-spaces. The empty intersection means the whole space.

Facts & Assumptions

Given: AC and either of the spaces Z in the statement.

[F1]

The Rudin space uses the relative box topology on the ordinal product (Rudin ordinal box spaces on infinite index sets).

[F2]

The ambient space uses that same relative topology, and every point in either space has coordinate cofinalities greater than ω (The ambient Rudin box space).

[F3]

In an ordinal, initial intervals [0,β] and half-open intervals (α,β] form an open basis; at a nonzero limit point h every neighborhood contains some (a,h] with a<h (The order topology on an ordinal, with the half-open intervals (α,β] and the initial segments [0,β] as a basis).

[A1]

AC chooses members of nonempty sets of local bounds (The Axiom of Choice).

Proof

1.1

For a(n)<b(n)n, F3 makes (a(n),b(n)] open in the factor [0,n]. Its complement is [0,a(n)](b(n),n]; the first is basic open, and the second is basic open if b(n)<n and empty otherwise. Thus the coordinate interval is also closed. The box nB(a(n),b(n)] is open by the definition of the box topology. Its complement is the union over n of cylinders restricting just that coordinate to its open complement, with all other factors unrestricted, and hence is box-open. Intersecting with either Z in F1–F2 shows (a,b]Z is clopen, including the possibility it is empty. No condition on the cofinalities of a or b was used.

F1F2F3
2.1

Let hZ and let U be an open neighborhood of h. By F1–F2 choose an open factor box On with hZOnU. Each h(n) has uncountable cofinality by F2, hence is a nonzero limit ordinal. F3 supplies some a(n)<h(n) with (a(n),h(n)]On. One may take the least such ordinal separately at each coordinate, so these lower bounds form a specified aPB. Now h(a,h]ZU, and step 1.1 makes this box clopen. This proves the local-base assertion, including at coordinate tops h(n)=n.

step 1.1F1F2F3
3.1

Let (Uj)j<ω be open in Z and let hjUj. By step 2.1 each Uj has a nonempty set of lower bounds aj<h whose local boxes lie in Uj. Apply A1 to select them. Put a(n)=supj<ωaj(n). By F2 and F4 this is strictly below h(n) at every coordinate, so aPB and a<h. For x(a,h]Z, the inequalities aj(n)a(n)<x(n)h(n) place x in every (aj,h]ZUj. Thus step 1.1 gives an open neighborhood (a,h]Z of h inside the intersection. Every point in the intersection has such a neighborhood, so it is open; if jUj has no points, it is the empty open set. Finite nonempty families reduce to this case by adding whole-space terms, and the intersection of a family with no members is Z, also open. Only individual coordinate cofinalities were used, so the argument applies to both spaces without any uniform bound. QED.

step 1.1step 2.1F2F4A1

Depends on

Used by

Cited to discharge well-definedness by Rudin ordinal box spaces on infinite index sets.

Dependency tree · two levels

31 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