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
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
Hunter observes in the comments that this follows from the solution to [447], which implies .
True ↔ ∃ c, 0 < c ∧ Asymptotics.IsEquivalent Filter.atTop (fun n => ↑(Erdos1023.F n)) fun n => c * 2 ^ n / ↑n ^ (1 / 2)