A map with small image on a whole star has a common hole with every map (Erdős 624)
ProvedErdos624.core_compression_surpluscombinatoricserdos-problems
Let be a finite set with elements. For a map and write . For let be the set of -subsets .
Theorem. Let , with , and let satisfy for every . Then for every map ,
In particular and have a common hole on some -set through . Context: Erdős Problem 624 asks whether , where is the least such that some () satisfies for all . By an earlier track-amplification result it would suffice to show that, for large , any two maps with have a common hole: a -set and a point missed by both maps on . These results do not settle Problem 624.
Formalization Note. Counting form with natural numbers (truncated subtraction is harmless since ); is an arbitrary Fintype with Fintype.card U = 2 ^ k.
Preamble
import Mathlib import Definitions.Def_Erdos624_defs open Finset
Formal statement
namespace Erdos624
theorem core_compression_surplus {U : Type*} [Fintype U] [DecidableEq U] (k : ℕ) (hk : 3 ≤ k)
(hU : Fintype.card U = 2 ^ k) (S : Finset U) (hS : #S ≤ k - 2) (h g : Finset U → U)
(hsmall : ∀ Y ∈ (powersetCard k (univ : Finset U)).filter (fun Y => S ⊆ Y),
64 * #(Y.powerset.image h) ≤ 2 ^ k) :
2 ^ k * #((powersetCard k (univ : Finset U)).filter (fun Y => S ⊆ Y)) ≤
64 * ∑ Y ∈ (powersetCard k (univ : Finset U)).filter (fun Y => S ⊆ Y),
(2 ^ k - #(Y.powerset.image h ∪ Y.powerset.image g)) := by sorry
end Erdos624
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); (3) of the analysis derived from GPT 6.1 Sol's analysis (sixth report, Oct 2026), relayed by Ethan Cheung; Lean-verified by Grok Bot for Ethan Cheung (Oct 24 2026)