The bounding number (𝔟), the dominating number (𝔡), the covering numbers, and the additivity numbers
The bounding number (𝔟), the dominating number (𝔡), the covering numbers, and the additivity numbers belong to the field of cardinal characteristics of the continuum, a branch of set theory that investigates the fine internal structure of the real numbers and other infinite collections. Rather than measuring the size of the continuum itself, these invariants quantify how large certain families of sets or functions must be in order to satisfy particular combinatorial properties. While the continuum has cardinality (2^{\aleph_0}), the cardinal characteristics reveal that many different notions of "largeness" exist within the continuum, each capturing a distinct aspect of infinite combinatorial behavior. Consequently, these invariants form an intricate network of cardinal parameters whose relationships illuminate the rich internal geometry of infinite sets.
The bounding number, denoted 𝔟, measures how many functions from the natural numbers to the natural numbers are required before one obtains a family that is unbounded with respect to eventual domination. Given two functions (f, g : \omega \rightarrow \omega), one says that g eventually dominates f if there exists some natural number beyond which (g(n)) is always at least as large as (f(n)). A family of functions is unbounded if no single function eventually dominates every member of that family. The cardinal 𝔟 is therefore defined as the smallest cardinality of such an unbounded family. Intuitively, it measures the minimum amount of independent growth required before no single function can eventually overtake them all.
Closely related is the dominating number, denoted 𝔡. Whereas 𝔟 asks for the smallest unbounded family, 𝔡 asks for the smallest family that dominates every function from the natural numbers to the natural numbers. Every function must eventually be bounded above by at least one member of a dominating family. Thus, 𝔡 measures the minimum number of functions needed to collectively outgrow every possible function. Since every dominating family is automatically unbounded, the inequality
𝔟 ≤ 𝔡
always holds. However, the two cardinals need not be equal. One of the remarkable discoveries of forcing theory is that models of set theory exist in which 𝔟 and 𝔡 differ, demonstrating that these two notions of combinatorial largeness are genuinely distinct.
The covering numbers describe how many sets of a particular type are required to cover another set. Among the most important is cov(ℳ), the covering number of the ideal of meager sets. A meager set is, informally, one that is topologically "small" or negligible. The cardinal cov(ℳ) is the smallest number of meager sets whose union equals the entire real line. Likewise, cov(𝒩) measures the smallest number of Lebesgue measure-zero sets required to cover the real numbers. These covering numbers therefore quantify how many individually small sets must be combined before they collectively become large enough to encompass an entire continuum-sized space.
Complementing the covering numbers are the additivity numbers, which measure when repeated unions of small sets cease to remain small. For an ideal 𝓘, the additivity number add(𝓘) is the smallest cardinality of a family of sets belonging to 𝓘 whose union no longer belongs to 𝓘. Thus add(ℳ) is the least number of meager sets whose union is not meager, while add(𝒩) is the least number of null sets whose union has positive measure. Additivity therefore identifies the threshold at which repeated combinations of negligible objects collectively become significant, providing a natural counterpart to the covering numbers.
These cardinal characteristics are connected by numerous inequalities that together form one of the central frameworks of infinitary combinatorics. Among the most celebrated is Cichoń's Diagram, which organizes ten fundamental cardinal characteristics—including additivity, covering, uniformity, and cofinality numbers for both the meager and null ideals together with 𝔟 and 𝔡—into a network of provable inequalities. The diagram demonstrates that many of these cardinals are constrained relative to one another while still permitting considerable independence. Through forcing, mathematicians have constructed models in which many of these cardinal characteristics assume distinct values, revealing an extraordinary diversity within the continuum itself.
One of the most surprising features of these invariants is that their exact values cannot generally be determined within the standard axioms of Zermelo–Fraenkel set theory together with the Axiom of Choice (ZFC). In one model of set theory several of these cardinals may all coincide with ℵ₁, while in another they may separate into many distinct cardinalities below the continuum. This flexibility reflects the independence phenomena discovered through forcing and demonstrates that the continuum possesses a far richer internal structure than is visible from its cardinality alone. The continuum is therefore not characterized merely by its overall size but by an intricate landscape of independent combinatorial parameters.
These cardinal characteristics also play important roles throughout topology, real analysis, measure theory, descriptive set theory, Boolean algebras, and forcing theory. Questions concerning the existence of special subsets of the real numbers, the behavior of infinite products, the structure of ultrafilters, and the interaction between category and measure frequently depend upon relationships among 𝔟, 𝔡, the covering numbers, and the additivity numbers. Consequently, these invariants have become indispensable tools for understanding the fine structure of infinite mathematical objects beyond what ordinary cardinal arithmetic can reveal.
Ultimately, the bounding number, dominating number, covering numbers, and additivity numbers demonstrate that infinite cardinality possesses layers of internal complexity extending far beyond simple measurements of size. Rather than asking only how many elements a set contains, these cardinal characteristics investigate how infinite families interact through domination, covering, accumulation, and union. They reveal that the continuum is governed by an intricate hierarchy of combinatorial principles, each capturing a different manifestation of infinitary behavior. As a result, the study of cardinal characteristics has become one of the most sophisticated branches of modern set theory, exposing the remarkable structural richness hidden within the infinite landscape of the real numbers.