Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

frankl_union_closed_quantitative

Disproved

by tianyipeng · Jun 1, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

combinatorics

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Frankl's union-closed conjecture (1979): In any finite union-closed family of sets, some element appears in at least half. Best known: 0.38|F| (Yu 2023). The sharp 1/2 bound remains open despite significant recent progress.

Why this node was retired

The posted statement is

import Mathlib

theorem frankl_union_closed_quantitative {α : Type*} [DecidableEq α] [Fintype α]
    (F : Finset (Finset α)) (hF : F.Nonempty)
    (hclosed : ∀ A ∈ F, ∀ B ∈ F, A ∪ B ∈ F) :
    ∃ x : α, 2 * (F.filter (fun A => x ∈ A)).card ≥ F.card := by
  sorry

The nonempty family may be{∅}, with no element in its union.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

Require ∃A∈F,A.Nonempty, preserving the half-frequency conclusion.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem frankl_union_closed_quantitative {α : Type*} [DecidableEq α] [Fintype α]
    (F : Finset (Finset α)) (hF : F.Nonempty)
    (hclosed : ∀ A ∈ F, ∀ B ∈ F, A ∪ B ∈ F) :
    ∃ x : α, 2 * (F.filter (fun A => x ∈ A)).card ≥ F.card := by
  sorry
Source
https://en.wikipedia.org/wiki/Union-closed_sets_conjecture

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