Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Rank-deficiency labelling lemma with R=2^55, k₀=16 (Erdős 624 auxiliary)

Proved
Erdos624.rank_deficiency_labelling

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

combinatoricserdos-problemslinear-algebra

For every integer k≥16k\ge 16k≥16 and every labelling v:U→F2kv:U\to\mathbb F_2^kv:U→F2k​ on a finite set UUU with ∣U∣=2k|U|=2^k∣U∣=2k,

(2kk−2)  ≤  255⋅∣{W∈(Uk−2):256⋅∣Sv(W)∣≤2k}∣,\binom{2^k}{k-2} \;\le\; 2^{55}\cdot \Bigl|\bigl\{W\in\binom{U}{k-2}: 256\cdot|S_v(W)|\le 2^k\bigr\}\Bigr|,(k−22k​)≤255⋅​{W∈(k−2U​):256⋅∣Sv​(W)∣≤2k}​,

where Sv(W)={∑x∈Av(x):A⊆W}S_v(W)=\{\sum_{x\in A}v(x):A\subseteq W\}Sv​(W)={∑x∈A​v(x):A⊆W} is the finite subset-sum image (equivalently the underlying set of span⁡v(W)\operatorname{span}v(W)spanv(W)). Equivalently, a positive-density fraction of the (k−2)(k-2)(k−2)-subsets satisfy dim⁡span⁡v(W)≤k−8\dim\operatorname{span}v(W)\le k-8dimspanv(W)≤k−8.

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. This lemma does NOT settle Problem 624 / PAIR; it only proves the rank-deficiency counting bound with explicit constants R=255R=2^{55}R=255 and k0=16k_0=16k0​=16.

Formalization Note. Pure Mathlib statement: U is an arbitrary Fintype with Fintype.card U = 2 ^ k; Sv(W)S_v(W)Sv​(W) is written inline as W.powerset.image (fun A => ∑ x ∈ A, v x). No dependence on the Erdős 624 definitions module.

Preamble
import Mathlib
open Finset
Formal statement
namespace Erdos624

/-- Rank-deficiency labelling lemma: a 2^{-55} fraction of (k-2)-sets have dim ≤ k-8.
`S_v(W)` is the powerset-image of F₂ subset-sums. -/
theorem rank_deficiency_labelling {U : Type*} [Fintype U] [DecidableEq U]
    {k : ℕ} (hk : 16 ≤ k)
    (hU : Fintype.card U = 2 ^ k) (v : U → Fin k → ZMod 2) :
    Nat.choose (2 ^ k) (k - 2) ≤
      2 ^ 55 *
        #{W ∈ powersetCard (k - 2) (univ : Finset U) |
          256 * #(W.powerset.image (fun A => ∑ x ∈ A, v x)) ≤ 2 ^ k} := by sorry

end Erdos624
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); (10)/(21) of the analysis derived from GPT 6.1 Sol's analysis, 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