How to drive our families mad
Abstract
Given a family F of pairwise almost disjoint sets on a countable set S, we study maximal almost disjoint (mad) families F+ extending F. We define a+(F) to be the minimal possible cardinality of F+ F for such F+, and a+()=\a+(F): |F| ≤ \. We show that all infinite cardinal less than or equal to the continuum continuum can be represented as a+(F) for some almost disjoint F and that the inequalities 1=a<a+(1)=c and a=a+(1)<c are both consistent. We also give a several constructions of mad families with some additional properties.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.