Conditioned Alon bound: Alon-type loss on every star of -sets through a small core (Erdős 624)
ProvedErdos624.conditioned_alonLet be a finite set with elements. For a map and write . For let be the set of -subsets .
Theorem. Let , with , and let be arbitrary. Then
So on average over the -sets containing any prescribed core of size at most , every map misses at least points. With this is the earlier robust_alon_sum; the conditioned version is strictly stronger and does not follow from the unconditioned average. 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.
import Mathlib import Definitions.Def_Erdos624_defs open Finset
namespace Erdos624
theorem conditioned_alon {U : Type*} [Fintype U] [DecidableEq U] (k : ℕ) (hk : 3 ≤ k)
(hU : Fintype.card U = 2 ^ k) (B : Finset U) (hB : #B ≤ k - 2) (g : Finset U → U) :
2 ^ k * #((powersetCard k (univ : Finset U)).filter (fun Y => B ⊆ Y)) ≤
32 * ∑ Y ∈ (powersetCard k (univ : Finset U)).filter (fun Y => B ⊆ Y),
(2 ^ k - #(Y.powerset.image g)) := by sorry
end Erdos624