Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Division-free conditional estimate for the asymmetric local lemma

Proved
Erdos390.WholePaper.finiteAsymmetricLocalLemma_conditionalBound

by doctosil · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

analytic-number-theoryerdos-390erdos390-source-construction

Let (Ω,μ)(\Omega,\mu)(Ω,μ) be a probability space, III a finite index set, and AiA_iAi​ measurable events. Let Γ(i)⊂I\Gamma(i)\subset IΓ(i)⊂I and 0≤xi<10\le x_i<10≤xi​<1. Write ES=⋂j∈SAjcE_S=\bigcap_{j\in S}A_j^cES​=⋂j∈S​Ajc​. Assume μ(Ai∩ES)=μ(Ai)μ(ES)\mu(A_i\cap E_S)=\mu(A_i)\mu(E_S)μ(Ai​∩ES​)=μ(Ai​)μ(ES​) whenever i∉Si\notin Si∈/S and S∩Γ(i)=∅S\cap\Gamma(i)=\varnothingS∩Γ(i)=∅, and assume μ(Ai)≤xi∏j∈Γ(i)(1−xj)\mu(A_i)\le x_i\prod_{j\in\Gamma(i)}(1-x_j)μ(Ai​)≤xi​∏j∈Γ(i)​(1−xj​). Then for every S⊂IS\subset IS⊂I and i∉Si\notin Si∈/S,

μ(Ai∩ES)≤xiμ(ES).\mu(A_i\cap E_S)\le x_i\mu(E_S).μ(Ai​∩ES​)≤xi​μ(ES​).

The estimate avoids division, and therefore makes sense before positivity of the conditioning event has been established.

Preamble
import Mathlib
import Definitions.Def_erdos390_source_bank_interface
import Definitions.Def_erdos390_dickman_step_function
import Theorems.Thm_MediumPNT
import Definitions.Def_erdos390_analytic_foundations_001
import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_product_bound
import Theorems.Thm_Erdos390_Full_DickmanBasic_rho_pos_on_zero_five
import Theorems.Thm_Erdos390_Full_DickmanBasic_kernel_secondDerivative_first_bound
import Definitions.Def_erdos390_analytic_foundations_007

universe u_1 u_2
Formal statement
theorem Erdos390.WholePaper.finiteAsymmetricLocalLemma_conditionalBound :
∀ {I : Type u_1} {Omega : Type u_2} [Fintype.{u_1} I] [DecidableEq.{u_1 + 1} I] [inst : MeasurableSpace.{u_2} Omega]
  (mu : MeasureTheory.Measure.{u_2} Omega) [MeasureTheory.IsProbabilityMeasure.{u_2} mu] (A : I → Set.{u_2} Omega)
  (Gamma : I → Finset.{u_1} I) (x : I → Real),
  (∀ (i : I), MeasurableSet.{u_2} (A i)) →
    (∀ (i : I), And (LE.le.{0} (0 : Real) (x i)) (LT.lt.{0} (x i) (1 : Real))) →
      (∀ (i : I) (s : Finset.{u_1} I),
          i ∉ s →
            Disjoint.{u_1} s (Gamma i) →
              Eq.{1}
                (MeasureTheory.Measure.real.{u_2} mu
                  (Inter.inter.{u_2} (A i) (Erdos390.WholePaper.avoidEvents.{u_1, u_2} A s)))
                (HMul.hMul.{0, 0, 0} (MeasureTheory.Measure.real.{u_2} mu (A i))
                  (MeasureTheory.Measure.real.{u_2} mu (Erdos390.WholePaper.avoidEvents.{u_1, u_2} A s)))) →
        (∀ (i : I),
            LE.le.{0} (MeasureTheory.Measure.real.{u_2} mu (A i))
              (HMul.hMul.{0, 0, 0} (x i) (∏ j ∈ Gamma i, HSub.hSub.{0, 0, 0} (1 : Real) (x j)))) →
          ∀ (s : Finset.{u_1} I),
            ∀ i ∉ s,
              LE.le.{0}
                (MeasureTheory.Measure.real.{u_2} mu
                  (Inter.inter.{u_2} (A i) (Erdos390.WholePaper.avoidEvents.{u_1, u_2} A s)))
                (HMul.hMul.{0, 0, 0} (x i)
                  (MeasureTheory.Measure.real.{u_2} mu (Erdos390.WholePaper.avoidEvents.{u_1, u_2} A s))) := by sorry
Source
https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/lean/Erdos390/WholePaper/FiniteAsymmetricLocalLemma.lean#L74-L305

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