Growing-core / prescribed-star integral obstruction with (Erdős 624 auxiliary)
ProvedErdos624.growing_core_obstructioncombinatoricserdos-problems
Let and , and let be a finite set with . For every with , there exist maps
such that
for every with , where .
Context: Erdős Problem 624 asks whether . This theorem does NOT settle Problem 624 / PAIR; it only proves a prescribed-star covering obstruction (two maps can jointly cover every -set through a fixed -core, even for growing like ). The corrected capacity threshold used in the proof is .
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 (Sol writeup had the -power in the denominator).