Rank-deficiency labelling lemma with R=2^55, k₀=16 (Erdős 624 auxiliary)
ProvedErdos624.rank_deficiency_labellingcombinatoricserdos-problemslinear-algebra
For every integer and every labelling on a finite set with ,
where is the finite subset-sum image (equivalently the underlying set of ). Equivalently, a positive-density fraction of the -subsets satisfy .
Context: Erdős Problem 624 asks whether , where is the least such that some () satisfies for all . This lemma does NOT settle Problem 624 / PAIR; it only proves the rank-deficiency counting bound with explicit constants and .
Formalization Note. Pure Mathlib statement: U is an arbitrary Fintype with Fintype.card U = 2 ^ k; 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)