Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-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.

Add, cov, non and cof for null and meagre ideals

Definition

Work in ZFC. Let R carry its usual topology and its Lebesgue measure λ (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Lebesgue measurable sets, the family L(Rn), and the restricted set function λn), and let a subset of R be meagre when it is a union of a sequence of nowhere dense sets (Nowhere dense, meagre, residual, and comeagre subsets of a topological space; this is the same class as the one of Nowhere dense, meager (first category), residual, and second category subsets of R, which requires the displayed union to equal the set, because subsets of nowhere dense sets are nowhere dense). The two families of the title are

N:={E⊆R: E is Lebesgue measurable and λ(E)=0},M:={E⊆R: E is meagre},

the Lebesgue-null ideal and the meagre ideal on the real line (Measure-null sets and almost-everywhere statements relative to a measure). Since (R,L(R),λ) is complete (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume), a set belongs to N exactly when it is contained in a Lebesgue-null measurable set, so the measurability clause in the definition of N is not an extra restriction on the members.

The four invariants. Let X be a set and let I be a family of subsets of X (in the applications below I is N or M and X=R). Define

  • the additivity add⁡(I):=min⁡{∣A∣:A⊆I and ⋃A∉I};
  • the covering number cov⁡(I):=min⁡{∣A∣:A⊆I and ⋃A=X};
  • the non number non⁡(I):=min⁡{∣Y∣:Y⊆X and Y∉I};
  • the cofinality cof⁡(I):=min⁡{∣A∣:A⊆I and ∀B∈I ∃A∈A (B⊆A)}.

The family A in the last clause is an inclusion-cofinal subfamily of I; "I-cover" is the reading of the second clause when I is an ideal of subsets of X.

The four minima exist and are attained for each of N and M, with X=R. For the two "family" numbers one exhibits a single family: the family of singletons S:={{x}:x∈R}, indexed by R, is a subfamily both of N and of M. Each singleton is null, indeed has λ({x})=0 (Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0, where the Axiom of Countable Choice The Axiom of Countable Choice (ACω) supplies the measure theory), and each singleton is meagre: R∖{x} is open, because for y≠x the neighbourhood Nδ(y) with δ=∣y−x∣/2>0 contains no z with z=x, since z=x would give ∣z−y∣=∣x−y∣=2δ≮δ (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Ordered field); so {x} is closed, it has empty interior, since Nε(x)⊆{x} would put x+ε/2≠x into {x}, and therefore {x} is nowhere dense (Interior, closure, boundary and exterior of a subset of R), hence meagre, its union with the constant sequence of empty sets being {x} itself. Since ⋃S=R, the families of candidates for add⁡ and for cov⁡ are nonempty and contain the cardinality ∣S∣. For the remaining two numbers a single set suffices: R itself is neither null nor meagre, because λ(R)=+∞≠0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume) and no meagre subset of R exhausts R (Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets), so R witnesses Y⊆X, Y∉N and Y∉M; and I itself is an inclusion-cofinal subfamily of I, since B⊆B for B∈I.

Each of the four candidate collections is therefore a nonempty set of ordinals, so each has a least element: cardinalities are available, and are cardinals, because the Axiom of Choice well-orders every set (The Axiom of Choice, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used), and the candidate collection is the image under Z↦∣Z∣ of a subset of the power set of I or of X, hence a set by Replacement. The minimum is attained: there is a subfamily of I of size add⁡(I) whose union is not in I, a subfamily of I of size cov⁡(I) with union X, a set Y⊆X of size non⁡(I) with Y∉I, and an inclusion-cofinal subfamily of I of size cof⁡(I). All four numbers are cardinals (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used), and no further property is built into the definition: the elementary inequalities among the eight numbers, and their comparison with ℵ1 and c=2ℵ0, are proved in Elementary bounds on ideal cardinal invariants (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations).

Conventions. Bartoszyński's list of cardinal invariants of an ideal J of subsets of a set X is exactly the four displayed clauses: he writes add⁡(J)=min⁡{∣A∣:A⊆J and ⋃A∉J}, cov⁡(J)=min⁡{∣A∣:A⊆J and ⋃A=X}, non⁡(J)=min⁡{∣Y∣:Y⊆X and Y∉J} and cof⁡(J)=min⁡{∣A∣:A⊆J and ∀B∈J ∃A∈A (B⊆A)}. The eight numbers of this page are the values of the four functions at I=N and I=M, read as add⁡(N), cov⁡(N), non⁡(N), cof⁡(N), add⁡(M), cov⁡(M), non⁡(M) and cof⁡(M). It is part of the definition that these are evaluated on the real line, with Lebesgue measure and the usual topology; N and M are proper (that is, R∉I) and, under the Axiom of Countable Choice, σ-ideals, by Null sets are closed under countable unions and, in a complete space, under arbitrary subsets and The meagre subsets of a topological space form a sigma-ideal, but neither closure property is used in the definition.

Choice accounting. The minima use AC via A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, exactly as the sibling definitions of p, t, b, d, s and r do. The null side uses ACω through the cited suppliers (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0); the meagre side uses no choice principle to speak of meagreness or in the two facts needed above — the two elementary computations for {x} and the Baire fact for R (Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets).

Remarks

The four numbers were introduced by the descriptive-set-theory school in the context of an ideal of subsets of a Polish space, and Bartoszyński's chapter opens with precisely this list; the transfer of the definitions between the real line and Cantor space 2ω is developed below, together with the comparison of the eight values on the two spaces (Transfer of null and meagre invariants between Cantor space and the line), and the Cichoń diagram collecting the inequalities among them is The ZFC inequalities of Cichoń's diagram.

The names are mnemonics rather than descriptions of the definitions: the "additivity" is the least size of a subfamily whose union escapes the ideal, not the additivity of a measure-like functional; the "covering number" counts covers by ideal members rather than general covers; "non" counts the least size of a set not in the ideal; and the "cofinality" is computed in the inclusion order of the ideal, not in the order of the underlying set. The clause "⋃A∉I" in the definition of add⁡ excludes the empty family when ∅∈I. The equation ⋃A=X excludes the empty family when X≠∅; if X=∅, the empty family instead witnesses cov⁡(I)=0. Here X=R≠∅ and both ideals contain ∅, so the empty subfamily is never a candidate for either additivity or covering.

Depends on

Used by

Dependency tree · two levels

74 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