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 spaces are collectionwise normal

Statement

Assume AC. For every infinite Bω{0,1}, XR(B) is Hausdorff and collectionwise normal: for every indexed discrete family (Fj)jJ of closed subsets there are pairwise disjoint open sets (Uj)jJ with FjUj. Here indexed discreteness means each point has a neighborhood meeting at most one indexed member. In particular XR(B) is normal. Empty members may receive empty neighborhoods.

Facts & Assumptions

Given: The Rudin space X=XR(B), ambient space Y=YB, and AC.

[F1]

Relative half-open boxes are clopen and give the local bases at Rudin and ambient points (Clopen boxes and the P-space property).

[F2]

Every open cover of Y has a partition refinement into nonempty open boxes (Disjoint box refinements in the ambient Rudin space).

[F3]

The ambient closures of an indexed discrete family of closed subsets of X form an indexed discrete family in Y (Discrete Rudin families have discrete ambient closures).

[A1]

AC is assumed, as required for the ambient refinement and closure-transfer constructions (The Axiom of Choice).

Proof

1.1

If h,kX are distinct, choose a coordinate n at which they differ, interchanging their names so h(n)<k(n). Set a(n)=h(n) and a(i)=0 for in. Every point-coordinate is positive, so a<k. The clopen box V=(a,k]X contains k and excludes h, since membership would require h(n)>a(n)=h(n). Its open complement contains h and is disjoint from V. Thus X is Hausdorff.

F1
1.2

Let (Fj)jJ be an indexed discrete closed family in X and put Cj=FjY. By F3 and A1, each point of Y has an open neighborhood meeting at most one Cj. Let O be the set of all open subsets of Y with that property. It is an open cover by the preceding existence statement. F2 and A1 give a partition V of Y into nonempty open boxes refining O. Every cell meets at most one indexed Cj, since it is contained in a member of O.

F2F3A1
2.1

For each jJ define Vj={VV:VCj} and Uj=VjX. Each Vj is open in Y, so Uj is open in its subspace X. If pFj, the unique partition cell through p meets Cj because FjCj, and therefore pUj. If pVjVl, two partition cells assigned to j and l contain p. They are the same cell by disjointness of the partition. Step 1.2 then gives j=l. Thus the Vj, and consequently the Uj, are pairwise disjoint. For Fj=, also Cj=, so the displayed union gives Uj=. An empty index set produces the empty family.

step 1.2
3.1

Steps 1.1 and 2.1 give Hausdorffness and the stated collectionwise separation property. If A,D are disjoint closed subsets of X, their two-member indexed family is discrete: at a point of A the open complement of D meets at most A, at a point of D use the complement of A, and elsewhere the intersection of both complements meets neither. Applying step 2.1 gives disjoint open neighborhoods of A,D. Together with Hausdorffness this proves normality. QED.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

15 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