The BCW coloring step: one random petal yields many disjoint petals
ProvedErdos20.disjoint_of_bernoulli_hittingLet be a finite ground set, let be a finite family of nonempty subsets of , and let be an integer. Include each element of independently in a random set with probability . If
then there is a subfamily with
This is the expectation-based coloring step in the Bell–Chueluecha–Warnke sunflower argument. It isolates the conversion from a single random-set containment estimate to several disjoint members. No spread or uniform-rank assumption is needed at this stage. Nonempty members are required so that members selected in different color classes are distinct.
Formalization Note. Sampling uses Mathlib's product Bernoulli measure on the entire finite ground type. The parameter is supplied as an element of the unit interval with its value explicitly specified.
import Mathlib.Algebra.Order.BigOperators.Group.Finset import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Data.Fintype.Pi import Mathlib.Data.Finset.Card import Mathlib.Tactic.Choose import Mathlib.Tactic.Linarith import Mathlib.Probability.Distributions.SetBernoulli import Mathlib.Probability.Distributions.Uniform import Mathlib.Tactic.NormNum set_option autoImplicit false
namespace Erdos20
theorem disjoint_of_bernoulli_hitting {α : Type*} [Fintype α] [DecidableEq α]
(F : Finset (Finset α)) (hF : ∀ A ∈ F, A.Nonempty)
(k : ℕ) (hk : 0 < k) (p : unitInterval)
(hp : (p : ℝ) = (2 * (k : ℝ))⁻¹)
(hhit : (1 / 2 : ℝ) ≤
(ProbabilityTheory.setBernoulli (Set.univ : Set α) p).real
{W | ∃ A ∈ F, (A : Set α) ⊆ W}) :
∃ H ⊆ F, H.card = k ∧ ∀ A ∈ H, ∀ B ∈ H, A ≠ B → Disjoint A B := by sorry
end Erdos20