Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonnegative deficit of an intersecting six-cover (Erdős 624)

Proved
Erdos624.six_cover_nonneg_deficit

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

combinatoricserdos-problems

Let ZZZ be a finite set with ∣Z∣≥2|Z|\ge 2∣Z∣≥2, and let SSS be a family of exactly six nonempty subsets of ZZZ. Suppose that no two distinct members of SSS are disjoint, and that every Y⊆ZY\subseteq ZY⊆Z with ∣Y∣=∣Z∣−2|Y|=|Z|-2∣Y∣=∣Z∣−2 contains some member of SSS. (When ∣Z∣=k+2|Z|=k+2∣Z∣=k+2, these YYY are the kkk-faces of ZZZ.) Write d(z)=#{A∈S:z∈A}d(z)=\#\{A\in S:z\in A\}d(z)=#{A∈S:z∈A}. Then d(z)≤3d(z)\le 3d(z)≤3 for every z∈Zz\in Zz∈Z, and ∑A∈S∣A∣≤3∣Z∣\sum_{A\in S}|A|\le 3|Z|∑A∈S​∣A∣≤3∣Z∣, with equality if and only if d(z)=3d(z)=3d(z)=3 for every z∈Zz\in Zz∈Z. Equivalently, the deficit Δ(S)=3∣Z∣−∑A∈S∣A∣=∑z∈Z(3−d(z))\Delta(S)=3|Z|-\sum_{A\in S}|A|=\sum_{z\in Z}(3-d(z))Δ(S)=3∣Z∣−∑A∈S​∣A∣=∑z∈Z​(3−d(z)) is nonnegative, and vanishes precisely on exact 333-regular sixes.

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 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.

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