Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Conditioned Alon bound: Alon-type loss on every star of kkk-sets through a small core (Erdős 624)

Proved
Erdos624.conditioned_alon

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

combinatoricserdos-problems

Let UUU be a finite set with n=2kn=2^kn=2k elements. For a map g:P(U)→Ug:\mathcal P(U)\to Ug:P(U)→U and Y⊆UY\subseteq UY⊆U write Ig(Y)={g(A):A⊆Y}I_g(Y)=\{g(A):A\subseteq Y\}Ig​(Y)={g(A):A⊆Y}. For B⊆UB\subseteq UB⊆U let KB\mathcal K_BKB​ be the set of kkk-subsets Y⊇BY\supseteq BY⊇B.

Theorem. Let k≥3k\ge3k≥3, B⊆UB\subseteq UB⊆U with ∣B∣≤k−2|B|\le k-2∣B∣≤k−2, and let g:P(U)→Ug:\mathcal P(U)\to Ug:P(U)→U be arbitrary. Then

n ∣KB∣  ≤  32∑Y∈KB(n−∣Ig(Y)∣).n\,|\mathcal K_B|\;\le\;32\sum_{Y\in\mathcal K_B}\bigl(n-|I_g(Y)|\bigr).n∣KB​∣≤32Y∈KB​∑​(n−∣Ig​(Y)∣).

So on average over the kkk-sets containing any prescribed core of size at most k−2k-2k−2, every map misses at least n/32n/32n/32 points. With B=∅B=\emptysetB=∅ 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 H(n)−log⁡2n→∞H(n)-\log_2 n\to\inftyH(n)−log2​n→∞, where H(n)H(n)H(n) is the least mmm such that some f:P(X)→Xf:\mathcal P(X)\to Xf:P(X)→X (∣X∣=n|X|=n∣X∣=n) satisfies f[P(Y)]=Xf[\mathcal P(Y)]=Xf[P(Y)]=X for all ∣Y∣≥m|Y|\ge m∣Y∣≥m. By an earlier track-amplification result it would suffice to show that, for large kkk, any two maps P(U)→U\mathcal P(U)\to UP(U)→U with ∣U∣=2k|U|=2^k∣U∣=2k have a common hole: a kkk-set YYY and a point uuu missed by both maps on P(Y)\mathcal P(Y)P(Y). These results do not settle Problem 624.

Formalization Note. Counting form with natural numbers (truncated subtraction is harmless since ∣Ig(Y)∣≤n|I_g(Y)|\le n∣Ig​(Y)∣≤n); UUU 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 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
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); formal strengthening of Alon's bound (privately communicated, cited on erdosproblems.com/624); conditioned form 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)

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