frankl_union_closed_quantitative
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus 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.
import Mathlib
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