Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Nowhere dense, meager (first category), residual, and second category subsets of R

Definition

Let A⊆R, with interior A∘ and closure A‾ as in Interior, closure, boundary and exterior of a subset of R.

  • A is nowhere dense when the interior of its closure is empty: (A‾)∘  =  ∅.
  • A is meager, or of the first category, when there is a sequence (An)n∈N of nowhere dense subsets of R with A  =  ⋃n∈NAn.
  • A is of the second category when it is not meager.
  • A is residual (also comeager) when R∖A is meager.

Why a sequence, and why that is the same as "an at most countable union". Sequences here are indexed by N, which contains 0. A finite family A0,…,Am of nowhere dense sets is turned into a sequence by setting An:=∅ for n>m, and ∅ is nowhere dense because ∅‾=∅ has empty interior; the empty family is handled the same way and gives A=∅. So "a union of an at most countable family of nowhere dense sets" (Finite, countably infinite, countable, uncountable) and the displayed condition define the same class, and the sequence form is used below because it carries an explicit index and needs no case split.

Nowhere dense means exactly that the complement of the closure is dense. For A⊆R,

(A‾)∘=∅⟺R∖A‾ is dense in R.

Indeed, by the pointwise description of the interior (Interior, closure, boundary and exterior of a subset of R), (A‾)∘=∅ says that no x∈R admits a real ε>0 with Nε(x)⊆A‾ (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R), that is, that every Nε(x) meets R∖A‾. By claim 1 of The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points that says precisely that every x∈R is adherent to R∖A‾, that is, R∖A‾‾=R, which is density (Limit point, isolated point, adherent point, derived set, and dense subset of R).

A closed set is nowhere dense exactly when its interior is empty, since a closed set equals its own closure (claim 4 of The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen). This is the form in which nowhere density is verified nearly every time below. (The phrase almost everywhere is avoided throughout this pair: it is a measure-theoretic term, and the only measure notion defined here is measure zero.)

Both classes are closed downwards. If B⊆A then B‾⊆A‾ and hence (B‾)∘⊆(A‾)∘ (Interior, closure, boundary and exterior of a subset of R), so a subset of a nowhere dense set is nowhere dense. If B⊆A=⋃nAn with each An nowhere dense, then B=⋃n(An∩B) and each An∩B is nowhere dense by the previous sentence, so a subset of a meager set is meager.

A union of two meager sets is meager. Let M=⋃nAn and M′=⋃nBn with all An and all Bn nowhere dense; fixing one witnessing sequence for M and one for M′ is two instantiations of an existential statement, not a choice principle. Let J:N×N→N be a bijection (N×N≈N) and define a sequence (Cj)j∈N by

CJ(m,n)  :=  {Anm=0,Bnm≠0.

This is a total definition because J is a bijection, every Cj is nowhere dense, and ⋃jCj=M∪M′, since An=CJ(0,n) and Bn=CJ(1,n) and every Cj is one of the An or one of the Bn.

Remarks

Depends on

Used by

Dependency tree · two levels

50 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