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

Moore spaces are subparacompact

Statement

In ZFC every Moore space is subparacompact: every open cover of the space has a refinement that is a countable union of discrete families of closed sets and covers the space (Moore spaces and developments, Discrete families and σ-locally-finite and σ-discrete bases).

The single use of choice is the well-ordering of the given open cover, which is why the statement is formulated in ZFC rather than ZF (The Axiom of Choice).

Facts & Assumptions

Given: A Moore space X, a decreasing development (Gn)nN of X, and an open cover U of X together with a well-ordering <W of the set U itself.

[F1]

A Moore space is regular T1 and developable, and a development may be assumed decreasing: every member of Gm is contained in a member of Gn when nm (Moore spaces and developments).

[F2]

A development's stars form a local base: for x and open Dx there is n with St(x,Gn)D; each St(x,Gn) is open and contains x (Moore spaces and developments, Refinements, locally finite families, point-finite families, and star refinements).

[F3]

A family is discrete when every point has a neighbourhood meeting at most one member (Discrete families and σ-locally-finite and σ-discrete bases), and a countable union of discrete families is what the conclusion asks for.

[L1]

Well-ordering principle: since W well-orders U, every nonempty subfamily of U has a W-least element, and "the W-least U with a property" is a definable description (The Axiom of Choice).

[L2]

Point z lies in F exactly when every neighbourhood of z meets F; consequently an open set disjoint from F is disjoint from F (A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set).

Proof

technique · direct
1.1

Fix (Gn), U and <W. For nN and UU put F(U,n):={xX:xU, xV for every V<WU, St(x,Gn)U}.

givenF1L1
2.1

Every F(U,n) is contained in U, and UU,nF(U,n)=X: given x, let U be the <W-least cover member containing x, which exists by [L1], and choose n with St(x,Gn)U by [F2]; then xF(U,n).

step 1.1F2L1
2.2

Every F(U,n) is closed. Let zF(U,n) and let GGn contain z. By [L2] and openness of G there is yGF(U,n); then GSt(y,Gn)U. Thus every member of Gn containing z lies in U, so St(z,Gn)U and in particular zU. If V<WU, then VF(U,n)= by definition, and openness of V with [L2] gives zV. Hence zF(U,n) by step 1.1.

step 1.1F2L2
2.3

For fixed n the family {F(U,n):UU} is discrete. Let xX, let V be the <W-least cover member containing x, and choose kn with St(x,Gk)V. Suppose ySt(x,Gk)F(U,n). Some GGk contains x,y; as Gk refines Gn, some HGn contains G. Hence xSt(y,Gn)U, so minimality gives either V=U or V<WU. But yV, and the second alternative contradicts the defining exclusion in F(U,n). Therefore U=V, and the open neighbourhood St(x,Gk) meets at most the one family member F(V,n).

step 1.1F1F2F3L1
3.1

The family n{F(U,n):UU} is a countable union of discrete families of closed sets (steps 2.2 and 2.3), covers X (step 2.1), and refines U because F(U,n)U. Hence X is subparacompact.

step 2.1step 2.2step 2.3

Remarks

  • Where the choice is spent. The development is a single given sequence and the sets F(U,n) are defined by a formula, but the well-ordering W of the cover is an application of the well-ordering principle and is used in step 2.1 to select the least cover member containing a point. Without it the same construction is not available, which is why the item is stated over ZFC.

  • Discreteness, not just local finiteness. The argument produces, for each n, one open neighbourhood of each point meeting at most one member, which is discreteness and not merely local finiteness; no local-finiteness closure lemma is needed, because closedness of each F(U,n) is proved directly in step 2.2.

Depends on

Used by

Nothing in the library uses this result yet.

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