Exact omission test for a seven-row window (Erdős 624)
ProvedErdos624.seven_row_omission_iffLet be a finite set with , and let be a family of exactly seven subsets of . Write and . The following are equivalent. (1) There is a member such that every with contains some member of , and every point of lies in exactly three members of . (2) for every , the set itself belongs to , and every with contains some member of . Thus the only row that can be omitted to leave a three-regular cover is the degree-four set , and then only if is one of the seven raw rows and the remaining six still cover.
Context: Erdős Problem 624 asks whether . This is an auxiliary finite combinatorial statement from GPT-6.2-Astra's 2026-11-19 analysis (relayed by Ethan Cheung). It does not settle Erdős Problem 624, PAIR, Step 17, or DENSE-P, and it does not prove a positive density of zero-deficit six-covers.
import Mathlib open Finset Function
namespace Erdos624
theorem seven_row_omission_iff {U : Type*} [DecidableEq U]
(Z : Finset U) (T : Finset (Finset U))
(hZ : 2 ≤ #Z)
(hT : #T = 7)
(hsub : ∀ A ∈ T, A ⊆ Z) :
(∃ R ∈ T,
(∀ Y ⊆ Z, #Y = #Z - 2 → ∃ A ∈ T.erase R, A ⊆ Y) ∧
(∀ z ∈ Z, #{A ∈ T.erase R | z ∈ A} = 3)) ↔
((∀ z ∈ Z, #{A ∈ T | z ∈ A} = 3 ∨ #{A ∈ T | z ∈ A} = 4) ∧
(Z.filter (fun z => #{A ∈ T | z ∈ A} = 4) ∈ T) ∧
(∀ Y ⊆ Z, #Y = #Z - 2 →
∃ A ∈ T.erase (Z.filter (fun z => #{A ∈ T | z ∈ A} = 4)), A ⊆ Y)) := by sorry
end Erdos624