Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

PMEA makes normal low-character spaces collectionwise normal

Statement

Work in ZFC (The Axiom of Choice), as on this page. Under PMEA every normal space of character below c is collectionwise normal; under PMEA-σ every first countable normal space is collectionwise normal (PMEA and PMEA-sigma, Normalized families and collectionwise normality, First countable space: a countable neighbourhood base at every point).

Facts & Assumptions

Given: A normal space X; under PMEA an open neighbourhood base Ux at each x of cardinality χ(x,X)<c, and under PMEA-σ with first countability a countable open local base Ux at each x; and a discrete family F={Fi:iI} of closed subsets of X. Such open bases may be used without increasing cardinality by replacing every base member N with its interior, which is an open neighbourhood of x contained in N (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[F1]

The three-quarter separation estimate: under PMEA with nonempty downwards-directed neighbourhood families Ux of size less than c satisfying the open-refinement hypothesis of [F2], and under PMEA-σ for first countable X with countable local bases, there is xUx with UxUx and UxUy= for xFi, yFj, ij (The PMEA three-quarter separation estimate).

[F2]

A neighbourhood base at x contains, for each open Gx, a member U with xUG; so the hypothesis of [F1] is met whenever xFiG (First countable space: a countable neighbourhood base at every point, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[F3]

Collectionwise normality asks that every discrete family of closed sets be separated by pairwise disjoint open expansions (Normalized families and collectionwise normality, Discrete families and σ-locally-finite and σ-discrete bases).

Proof

technique · direct
1.1

If X= or the discrete family is empty, empty expansions suffice. Otherwise use AC to choose one local base of the stated size at each point, and replace its members by their interiors. This is an image of the original base, so its cardinality does not increase; each interior contains the point, and the image remains a local base. Fix the discrete family F and the open neighbourhood bases Ux from the Given line, with Ux<c, or with Uxω in the first countable case.

givenF2
2.1

Each Ux is nonempty, by applying its base property to X. For U,VUx, the open intersection UV contains x, so [F2] supplies WUx with WUV. This is precisely downward directedness; the original base need not be closed under finite intersections and is not enlarged. If xFiG with G open, [F2] likewise supplies a base member inside G. Apply [F1] to F and the bases Ux, obtaining UxUx with UxUy= whenever xFi, yFj, ij.

step 1.1F1F2
3.1

For each i put Gi:={Ux:xFi}. Each selected Ux belongs to the open base Ux, so Gi is open; it contains Fi because xUx, and distinct Gi,Gj are disjoint by step 2.1. Hence F is separated and X is collectionwise normal.

givenstep 2.1F3

Remarks

  • Character, not weight. The hypothesis is pointwise, so the theorem applies to every normal Moore space once PMEA-σ is available, since Moore spaces are first countable (Moore spaces and developments).

  • Fremlin's remark (b) after Theorem 8F. The proof needs only as much additivity as the size of the local bases, which is why the countably additive version suffices in the first countable case.

Depends on

Used by

Dependency tree · two levels

26 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