# How many union-closed families in $\cal{P}(n)$?

A union-closed family $\cal{F} \subseteq \cal{P}([n])$ is a family such that for every $A,B \in \cal{F}$, $A \cup B \in \cal{F}$. Are there any reasonable approximations as to how many such families (of subsets of $[n]$) there are? Or more generally, suppose we take each set $A \subseteq [n]$ to our family $\cal{F}$ with probability $p$ for some $0<p<1$, what is the probability that $\cal{F}$ is union-closed?

• Following 2,4,14,122 gives oeis.org/A102897 . It is clear that the sequence satisfies $a_{n+1} \leq a_n^2$ and that this can be refined with higher order terms. Gerhard "Might Find The Terms Later" Paseman, 2017.02.16. – Gerhard Paseman Feb 16 '17 at 19:19

A dual order ideal $I$ (that is, if $F\in I$ and $G\supset F$ then $G\in I$) of the lattice $B_n$ of all subsets of $[n]$ is union-closed. The number of them is $2^{\binom{n}{\lfloor n/2\rfloor}(1+o(1))}$. See http://www.ams.org/journals/tran/1975-213-00/S0002-9947-1975-0382107-0/home.html for a somewhat stronger result. This gives a lower bound on the number of union-closed families that I suspect is not far from the truth.
• Thanks for the answer. I knew about the Dedekind numbers already, this is where I got the idea to ask the same for union-closed families, which as you say include all monotone increasing families (dual order ideals). Maybe a way to prove a similar upper bound would be to say that for a given antichain $C$, there are not so many union-closed families whose set of minimal elements is exactly $C$. Especially if $|C|$ is close to ${n \choose n/2}$, which is true for most antichains. – karpasi Feb 16 '17 at 16:36
• For each antichain $C$ there is exactly one union-closed family (aka Upset) whose collection of minimal elements is $C.$ – Aaron Meyerowitz Feb 16 '17 at 17:01
• @AaronMeyerowitz I disagree. For example, in a 3-element set, the antichain $C=\{\{a,b\},\{c\}\}$ is the collection of minimal elements of the union-closed family $\{\{a,b\},\{c\},\{a,b,c\}\}$, and also of the larger union-closed families obtained by throwing in $\{a,c\}$ or $\{b,c\}$ or both. – Andreas Blass Feb 16 '17 at 17:30
So it seems like, as expected, the number is $2^{(1+o(1)){n \choose n/2}}$. Unfortunately, the paper proving it is in russian, by V.B. Alekseev: