/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 1183
References:
[Er78] Erdős, P., Problems and results in combinatorial analysis and combinatorial number theory. Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1978) (1978), 29-40. PDF
@[expose] public sectionopen Filter Asymptoticsnamespace Erdos1183
A family ℱ of subsets is monochromatic for the colouring c if all its members have the
same colour.
def IsMonochromatic {n : ℕ} (c : Finset (Fin n) → Bool) (ℱ : Finset (Finset (Fin n))) : Prop :=
∃ b : Bool, ∀ A ∈ ℱ, c A = b
$f(n)$: the largest $m$ such that every $2$-colouring c of the subsets of
${1,\ldots,n}$ has a monochromatic family of at least $m$ sets that is closed under unions and
intersections (IsSublattice).
The ground set is Fin n, and the subsets are Finset (Fin n), the empty set included. The set
of such $m$ contains $0$ and is bounded by $2^n$, so sSup is a true maximum. A family with
$m \geq 1$ members is nonempty.
noncomputable def f (n : ℕ) : ℕ :=
sSup {m : ℕ | ∀ c : Finset (Fin n) → Bool, ∃ ℱ : Finset (Finset (Fin n)),
m ≤ ℱ.card ∧ IsMonochromatic c ℱ ∧ IsSublattice (ℱ : Set (Finset (Fin n)))}
$F(n)$: the same as $f(n)$, except that the family is only required to be closed under
unions (SupClosed; the supremum of two finsets is their union).
noncomputable def F (n : ℕ) : ℕ :=
sSup {m : ℕ | ∀ c : Finset (Fin n) → Bool, ∃ ℱ : Finset (Finset (Fin n)),
m ≤ ℱ.card ∧ IsMonochromatic c ℱ ∧ SupClosed (ℱ : Set (Finset (Fin n)))}def erdos_1183.parts.i.answer : ℕ → ℝ := sorryLet $f(n)$ be maximal such that in any $2$-colouring of the subsets of ${1,\ldots,n}$ there is always a monochromatic family of at least $f(n)$ sets which is closed under taking unions and intersections. Estimate $f(n)$.
Let $F(n)$ be defined similarly, except that we only require the family be closed under taking unions. Estimate $F(n)$. In particular, is it true that $F(n)\geq n^{\omega(n)}$ for some $\omega(n)\to \infty$ as $n\to \infty$, and $F(n)<(1+o(1))^n$?
This is the first part, a problem of Erdős and Ulam [Er78, p. 39]. We read "estimate" as $f(n)=\Theta(\text{answer})$.
@[category research open, question value, AMS 5]
theorem erdos_1183.parts.i :
(fun n : ℕ ↦ (f n : ℝ)) =Θ[atTop] erdos_1183.parts.i.answer := ⊢ (fun n ↦ ↑(f n)) =Θ[atTop] i.answer
All goals completed! 🐙def erdos_1183.parts.ii.answer : ℕ → ℝ := sorryLet $f(n)$ be maximal such that in any $2$-colouring of the subsets of ${1,\ldots,n}$ there is always a monochromatic family of at least $f(n)$ sets which is closed under taking unions and intersections. Estimate $f(n)$.
Let $F(n)$ be defined similarly, except that we only require the family be closed under taking unions. Estimate $F(n)$. In particular, is it true that $F(n)\geq n^{\omega(n)}$ for some $\omega(n)\to \infty$ as $n\to \infty$, and $F(n)<(1+o(1))^n$?
This is the second part. We read "estimate" as $F(n)=\Theta(\text{answer})$.
@[category research open, question value, AMS 5]
theorem erdos_1183.parts.ii :
(fun n : ℕ ↦ (F n : ℝ)) =Θ[atTop] erdos_1183.parts.ii.answer := ⊢ (fun n ↦ ↑(F n)) =Θ[atTop] ii.answer
All goals completed! 🐙Let $f(n)$ be maximal such that in any $2$-colouring of the subsets of ${1,\ldots,n}$ there is always a monochromatic family of at least $f(n)$ sets which is closed under taking unions and intersections. Estimate $f(n)$.
Let $F(n)$ be defined similarly, except that we only require the family be closed under taking unions. Estimate $F(n)$. In particular, is it true that $F(n)\geq n^{\omega(n)}$ for some $\omega(n)\to \infty$ as $n\to \infty$, and $F(n)<(1+o(1))^n$?
This is the third part, the "in particular" question: both conjuncts must hold. We state it as printed in [Er78, p. 39]: $F(n) > n^c$ for every $c$ if $n > n_0(c)$, and $F(n) < (1+\varepsilon)^n$ for every $\varepsilon > 0$ if $n > n_0(\varepsilon)$.
@[category research open, question, AMS 5]
theorem erdos_1183.parts.iii :
(∀ c : ℝ, ∀ᶠ n : ℕ in atTop, (n : ℝ) ^ c < (F n : ℝ)) ∧
∀ ε : ℝ, 0 < ε → ∀ᶠ n : ℕ in atTop, (F n : ℝ) < (1 + ε) ^ n := ⊢ (∀ (c : ℝ), ∀ᶠ (n : ℕ) in atTop, ↑n ^ c < ↑(F n)) ∧ ∀ (ε : ℝ), 0 < ε → ∀ᶠ (n : ℕ) in atTop, ↑(F n) < (1 + ε) ^ n
All goals completed! 🐙It is trivial that $f(n)\geq \frac{n+1}{2}$, since there is a sequence of $n+1$ many nested subsets.
@[category textbook, AMS 5]
theorem erdos_1183.variants.f_ge (n : ℕ) : ((n : ℝ) + 1) / 2 ≤ (f n : ℝ) := n:ℕ⊢ (↑n + 1) / 2 ≤ ↑(f n)
All goals completed! 🐙end Erdos1183