Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

The complete-metric Baire principle over ZF

Definition

Work in ZF. Let (X,d) be a metric space. Closure, interior and density are as in Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, with all complements relative to X. Families indexed by ω are functions, as in An indexed family (Ai)i∈I is a function with domain I; {Ai:i∈I} is its range, and their unions and intersections are those of ⋃i∈IAi:=⋃{Ai:i∈I}, and ⋂i∈IAi:=⋂{Ai:i∈I} for I≠∅.

A set N⊆X is nowhere dense if int⁡X(N‾)=∅. A set M⊆X is meagre if there exists a sequence (Nn)n∈ω of nowhere dense subsets of X such that M⊆⋃n∈ωNn. A set C⊆X is comeagre if X∖C is meagre.

The space is Baire if, for every sequence (Un)n∈ω of open dense subsets of X, the intersection ⋂n∈ωUn is dense in X. The complete-metric Baire principle (CM-Baire) asserts that every complete metric space, in the sense of Complete metric space: every Cauchy sequence converges in the space, is Baire.

This includes the empty space: its only subset is open and dense, its ω-indexed intersection is empty and dense in that space, and there are no Cauchy sequences into it. The empty set is meagre in every space, witnessed by Nn=∅ for every n.

Remarks

A witness is an actual sequence of nowhere dense sets. These definitions do not assert that a countable union of sets merely known to be meagre is meagre: choosing one decomposition for each such set would require a separate argument. Miller, Definitions 4.2–4.4, p.8, motivates the convention; Karagila's warning after Theorem 16, p.10, identifies the decomposition-selection issue. We use containment in a union, so meagre subsets need not themselves be closed-set unions.

Depends on

Used by

Dependency tree · two levels

19 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