Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Growing-core / prescribed-star integral obstruction with k≥16(t+1)2k\ge 16(t+1)^2k≥16(t+1)2 (Erdős 624 auxiliary)

Proved
Erdos624.growing_core_obstruction

by Ethan Cheung · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricserdos-problems

Let t≥2t\ge 2t≥2 and k≥16(t+1)2k\ge 16(t+1)^2k≥16(t+1)2, and let UUU be a finite set with ∣U∣=2k|U|=2^k∣U∣=2k. For every B⊆UB\subseteq UB⊆U with ∣B∣=k−t|B|=k-t∣B∣=k−t, there exist maps

g0,g1:P(U)→Ug_0,g_1:\mathcal P(U)\to Ug0​,g1​:P(U)→U

such that

Ig0(Y)∪Ig1(Y)=UI_{g_0}(Y)\cup I_{g_1}(Y)=UIg0​​(Y)∪Ig1​​(Y)=U

for every Y∈(Uk)Y\in\binom{U}{k}Y∈(kU​) with B⊆YB\subseteq YB⊆Y, where Ig(Y)={g(A):A⊆Y}I_g(Y)=\{g(A):A\subseteq Y\}Ig​(Y)={g(A):A⊆Y}.

Context: Erdős Problem 624 asks whether H(n)−log⁡2n→∞H(n)-\log_2 n\to\inftyH(n)−log2​n→∞. This theorem does NOT settle Problem 624 / PAIR; it only proves a prescribed-star covering obstruction (two maps can jointly cover every kkk-set through a fixed (k−t)(k-t)(k−t)-core, even for ttt growing like k\sqrt{k}k​). The corrected capacity threshold used in the proof is At=[t(t+1)]2t+3⋅24t(t+1)A_t=[t(t+1)]^{2t+3}\cdot 2^{4t(t+1)}At​=[t(t+1)]2t+3⋅24t(t+1).

Formalization Note. Pure Mathlib statement: U is an arbitrary Fintype with Fintype.card U = 2 ^ k; maps are Finset U → U. No dependence on the Erdős 624 definitions module.

Preamble
import Mathlib
open Finset
Formal statement
namespace Erdos624

/-- Growing-core / prescribed-star integral obstruction (Sol (1)+(2)).
For `t ≥ 2` and `k ≥ 16(t+1)^2`, every `(k−t)`-set `B ⊆ U` (`|U|=2^k`) admits maps
`g₀,g₁` covering `U` on every `k`-set in the star of `B`.
Does **not** settle PAIR / #624. -/
theorem growing_core_obstruction
    {U : Type*} [Fintype U] [DecidableEq U]
    {t k : ℕ} (ht : 2 ≤ t) (hk : t ≤ k) (hkk : 16 * (t + 1) ^ 2 ≤ k)
    (hU : Fintype.card U = 2 ^ k)
    (B : Finset U) (hB : #B = k - t) :
    ∃ (g0 g1 : Finset U → U),
      ∀ Y : Finset U, #Y = k → B ⊆ Y →
        (Y.powerset.image g0 ∪ Y.powerset.image g1) = (univ : Finset U) := by sorry

end Erdos624
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); growing-core / prescribed-star obstruction (A5) derived from GPT 6.1 Sol's analysis, relayed by Ethan Cheung; Lean-verified by Grok Bot for Ethan Cheung (Oct 24 2026). Corrected At=[t(t+1)]2t+3⋅24t(t+1)A_t=[t(t+1)]^{2t+3}\cdot 2^{4t(t+1)}At​=[t(t+1)]2t+3⋅24t(t+1) (Sol writeup had the 222-power in the denominator).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me