Three-cell criterion for exact six-row balance and coverage (Erdős 624)
ProvedErdos624.three_cell_six_cover_iffFix a finite set with and a point . Let be injective, with each and each containing . For write and . For each index let be the set of labels for which some has and , and let be the set of labels for which some has and . The following are equivalent. (1) No equals ; for every ; and for all three . (2) Every point of lies in exactly three of the six rows , and every of cardinality contains one of the six rows. When , this is a necessary and sufficient test for exact -and- balance and six-row coverage of the -faces of the window .
Context: Erdős Problem 624 asks whether . 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.
import Mathlib open Finset Function
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