Are a and d your cup of tea?

Abstract

We show that, consistently, every MAD family has cardinality strictly bigger than the dominating number, that is a > d, thus solving one of the oldest problems on cardinal invariants of the continuum. The method is a contribution to the theory of iterated forcing for making the continuum large.

References in corpus (2)

• On what I do not understand (and have something to say): Part I
• Covering of the null ideal may have countable cofinality

Cited by in corpus (17)

• Filter-linkedness and its effect on preservation of cardinal characteristics
• Template iterations with non-definable ccc forcing notions
• Splitting, Bounding, and Almost Disjointness can be quite Different
• Cofinality spectrum theorems in model theory, set theory and general topology
• Models of some cardinal invariants with large continuum
• Cofinitary Groups and Other Almost Disjoint Families of Reals
• Halfway New Cardinal Characteristics
• Saccharinity
• Madness in vector spaces
• The character spectrum of beta(N)
• On well-splitting posets
• Partitioning the real line into Borel sets
• Borel computation of names in template iterations
• Selective independence
• Mad families of vector subspaces and the smallest nonmeager set of reals
• Preservation properties for iterations with finite support
• Comparing the closed almost disjointness and dominating numbers