Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 3.7 — sensitivity of reciprocal products

Proved
CountingLLL.DetCount.claim_3_7

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximate-countingconstraint-satisfactionlovasz-local-lemmap2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0<t<10<t<10<t<1 and ℓ≥1\ell\ge1ℓ≥1, and let (xi)i∈[ℓ],(yi)i∈[ℓ]∈[−t,t]ℓ(x_i)_{i\in[\ell]},(y_i)_{i\in[\ell]}\in[-t,t]^\ell(xi​)i∈[ℓ]​,(yi​)i∈[ℓ]​∈[−t,t]ℓ. Then

∣∏i=1ℓ11−xi−∏i=1ℓ11−yi∣≤ℓ(1−t)ℓ+1⋅max⁡1≤i≤ℓ∣xi−yi∣.\Big|\prod_{i=1}^{\ell}\frac{1}{1-x_i}-\prod_{i=1}^{\ell}\frac{1}{1-y_i}\Big|\le\frac{\ell}{(1-t)^{\ell+1}}\cdot\max_{1\le i\le\ell}|x_i-y_i|.​i=1∏ℓ​1−xi​1​−i=1∏ℓ​1−yi​1​​≤(1−t)ℓ+1ℓ​⋅1≤i≤ℓmax​∣xi​−yi​∣.

This elementary estimate converts errors in the recursive marginals into errors in the expansion (14).

Differences from the source:

  • encoding: indices 1 ≤ i ≤ ℓ → indices in Fin ℓ (0-based); reason: relabelling
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace CountingLLL.DetCount

/-- Claim 3.7: for `0 < t < 1`, `ℓ ≥ 1` and `x, y ∈ [−t, t]^ℓ`,
`|∏_{i=1}^ℓ 1/(1 − x_i) − ∏_{i=1}^ℓ 1/(1 − y_i)| ≤ ℓ/(1 − t)^{ℓ+1} · max_i |x_i − y_i|`. -/
theorem claim_3_7 (t : ℝ) (ht₀ : 0 < t) (ht₁ : t < 1) (ℓ : ℕ) (hℓ : 1 ≤ ℓ)
    (x y : Fin ℓ → ℝ) (hx : ∀ i, x i ∈ Set.Icc (-t) t) (hy : ∀ i, y i ∈ Set.Icc (-t) t) :
    |∏ i, 1 / (1 - x i) - ∏ i, 1 / (1 - y i)| ≤
      (ℓ : ℝ) / (1 - t) ^ (ℓ + 1) *
        (Finset.univ : Finset (Fin ℓ)).sup' (Finset.univ_nonempty_iff.mpr ⟨⟨0, hℓ⟩⟩)
          (fun i => |x i - y i|) := by sorry

end CountingLLL.DetCount
Source
Hongyang Liu, Chunyang Wang, Yitong Yin, Yiyao Zhang, Can Zhou, A Counting and Sampling Lovász Local Lemma, STOC 2027 submission #442 (October 2026), Claim 3.7, equation (17), PDF p. 11 (printed p. 10); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/442.pdf
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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