Erdős problem 1023
Let be the maximal size of a family of subsets of such that no set in this family is the union of other members of the family. Is it true that there is a constant such that
Sources
FormalConjectures/ErdosProblems/
1023.lean
Retained formal statement
Erdős and Kleitman proved in unpublished work that ([Er71] has an exponent of , but this is presumably a typo.)
(fun n => ↑(Erdos1023.F n)) =Θ[Filter.atTop] fun n => 2 ^ n / ↑n ^ (1 / 2)SolvedStatement only, no proof