Nonnegative deficit of an intersecting six-cover (Erdős 624)
ProvedErdos624.six_cover_nonneg_deficitcombinatoricserdos-problems
Let be a finite set with , and let be a family of exactly six nonempty subsets of . Suppose that no two distinct members of are disjoint, and that every with contains some member of . (When , these are the -faces of .) Write . Then for every , and , with equality if and only if for every . Equivalently, the deficit is nonnegative, and vanishes precisely on exact -regular sixes.
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.
Preamble
import Mathlib open Finset Function
Formal statement
namespace Erdos624
theorem six_cover_nonneg_deficit {U : Type*} [DecidableEq U]
(Z : Finset U) (S : Finset (Finset U))
(hZ : 2 ≤ #Z)
(hS : #S = 6)
(hsub : ∀ A ∈ S, A ⊆ Z)
(hne : ∀ A ∈ S, A.Nonempty)
(hnd : ∀ A ∈ S, ∀ B ∈ S, A ≠ B → ¬ Disjoint A B)
(hcov : ∀ Y ⊆ Z, #Y = #Z - 2 → ∃ A ∈ S, A ⊆ Y) :
(∀ z ∈ Z, #{A ∈ S | z ∈ A} ≤ 3) ∧
∑ A ∈ S, #A ≤ 3 * #Z ∧
(∑ A ∈ S, #A = 3 * #Z ↔ ∀ z ∈ Z, #{A ∈ S | z ∈ A} = 3) := 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.