Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Three-cell criterion for exact six-row balance and coverage (Erdős 624)

Proved
Erdos624.three_cell_six_cover_iff

by Ethan Cheung Wang · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricserdos-problems

Fix a finite set RRR with ∣R∣≥1|R|\ge 1∣R∣≥1 and a point x∉Rx\notin Rx∈/R. Let P,E:Fin 3→Finset UP,E:\mathrm{Fin}\,3\to\mathrm{Finset}\,UP,E:Fin3→FinsetU be injective, with each Pi⊆RP_i\subseteq RPi​⊆R and each Ej⊆R∪{x}E_j\subseteq R\cup\{x\}Ej​⊆R∪{x} containing xxx. For z∈Rz\in Rz∈R write I(z)={i:z∈Pi}I(z)=\{i:z\in P_i\}I(z)={i:z∈Pi​} and J(z)={j:z∈Ej}J(z)=\{j:z\in E_j\}J(z)={j:z∈Ej​}. For each index i∈{0,1,2}i\in\{0,1,2\}i∈{0,1,2} let HiH_iHi​ be the set of labels jjj for which some z∈Rz\in Rz∈R has I(z)=[3]∖{i}I(z)=[3]\setminus\{i\}I(z)=[3]∖{i} and j∈J(z)j\in J(z)j∈J(z), and let LiL_iLi​ be the set of labels jjj for which some z∈Rz\in Rz∈R has I(z)={i}I(z)=\{i\}I(z)={i} and j∉J(z)j\notin J(z)j∈/J(z). The following are equivalent. (1) No I(z)I(z)I(z) equals [3][3][3]; ∣J(z)∣=3−∣I(z)∣|J(z)|=3-|I(z)|∣J(z)∣=3−∣I(z)∣ for every z∈Rz\in Rz∈R; and Hi∩Li=∅H_i\cap L_i=\varnothingHi​∩Li​=∅ for all three iii. (2) Every point of R∪{x}R\cup\{x\}R∪{x} lies in exactly three of the six rows {P0,P1,P2,E0,E1,E2}\{P_0,P_1,P_2,E_0,E_1,E_2\}{P0​,P1​,P2​,E0​,E1​,E2​}, and every Y⊆R∪{x}Y\subseteq R\cup\{x\}Y⊆R∪{x} of cardinality ∣R∪{x}∣−2|R\cup\{x\}|-2∣R∪{x}∣−2 contains one of the six rows. When ∣R∣=k+1|R|=k+1∣R∣=k+1, this is a necessary and sufficient test for exact 333-and-333 balance and six-row coverage of the kkk-faces of the window R∪{x}R\cup\{x\}R∪{x}.

Context: Erdős Problem 624 asks whether H(n)−log⁡2n→∞H(n)-\log_2 n\to\inftyH(n)−log2​n→∞. This is an auxiliary finite combinatorial statement from Sol's 2026-11-17/18 notes (relayed by Ethan Cheung). It does not settle Erdős Problem 624, PAIR, Step 17, or DENSE-P.

Preamble
import Mathlib
open Finset Function
Formal statement
namespace Erdos624

theorem three_cell_six_cover_iff {U : Type*} [DecidableEq U]
    (R : Finset U) (x : U) (hx : x ∉ R)
    (P E : Fin 3 → Finset U)
    (hPinj : Function.Injective P) (hEinj : Function.Injective E)
    (hP : ∀ i, P i ⊆ R) (hE : ∀ i, E i ⊆ insert x R) (hxE : ∀ i, x ∈ E i)
    (hR : 1 ≤ #R) :
    ((∀ z ∈ R, (univ.filter (fun i : Fin 3 => z ∈ P i) : Finset (Fin 3)) ≠ univ) ∧
      (∀ z ∈ R, #(univ.filter (fun j : Fin 3 => z ∈ E j)) =
        3 - #(univ.filter (fun i : Fin 3 => z ∈ P i))) ∧
      (∀ i : Fin 3,
        Disjoint
          (univ.filter (fun j : Fin 3 =>
            ∃ z ∈ R, univ.filter (fun k : Fin 3 => z ∈ P k) = univ.erase i ∧
              j ∈ univ.filter (fun k : Fin 3 => z ∈ E k)))
          (univ.filter (fun j : Fin 3 =>
            ∃ z ∈ R, univ.filter (fun k : Fin 3 => z ∈ P k) = {i} ∧
              j ∉ univ.filter (fun k : Fin 3 => z ∈ E k))))) ↔
    ((∀ y ∈ insert x R,
        #{A ∈ (univ.image P ∪ univ.image E) | y ∈ A} = 3) ∧
      (∀ Y ⊆ insert x R, #Y = #(insert x R) - 2 →
        ∃ A ∈ univ.image P ∪ univ.image E, A ⊆ Y)) := by sorry

end Erdos624
Source
Erdős Problem 624 (https://www.erdosproblems.com/624); Round 19: official-def formalization of finite lemmas from GPT 6.1 Sol's analysis, relayed by Ethan Cheung (three-cell criterion in the 2026-11-18 pasted note; deficit identity in Transfer Prompt on Zero-Deficit Six-Covers, task d32c2107-b546-4015-be2e-c9c4e46ce7cd); hand-checked and Lean-verified by Grok Bot for Ethan Cheung (Nov 18 2026). Auxiliary finite results only; do NOT settle PAIR / Step 17 / DENSE-P / #624.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me