Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 11: ∣Cov[ηi,ηj]∣≤α(1−α)t−1|\mathrm{Cov}[\eta_i,\eta_j]|\le\frac{\alpha(1-\alpha)}{t-1}∣Cov[ηi​,ηj​]∣≤t−1α(1−α)​

Proved
FranklKupavskii2022.EMC.indicator_covariance_bound

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentration-inequalitieskneser-graphsp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let m,l,tm,l,tm,l,t be integers with m≥tlm\ge tlm≥tl, let G⊆([m]l)\mathcal G\subseteq\binom{[m]}{l}G⊆(l[m]​), α=∣G∣/(ml)\alpha=|\mathcal G|/\binom mlα=∣G∣/(lm​), and let B=(B1,…,Bt)\mathcal B=(B_1,\dots,B_t)B=(B1​,…,Bt​) be a uniformly random ttt-matching of lll-sets in [m][m][m]. With ηi=1[Bi∈G]\eta_i=\mathbf 1[B_i\in\mathcal G]ηi​=1[Bi​∈G], for any i≠ji\ne ji=j in [t][t][t]

∣Cov[ηi,ηj]∣≤α(1−α)t−1.\big|\mathrm{Cov}[\eta_i,\eta_j]\big|\le\frac{\alpha(1-\alpha)}{t-1}.​Cov[ηi​,ηj​]​≤t−1α(1−α)​.

The bound comes from the spectrum of the Kneser graph and gives Var[η]≤2tα(1−α)\mathrm{Var}[\eta]\le2t\alpha(1-\alpha)Var[η]≤2tα(1−α), the Chebyshev-type concentration of Lemma 10.

Preamble
import Mathlib
import Definitions.Def_FranklKupavskii2022_EMC_tMatchings
Formal statement
namespace FranklKupavskii2022.EMC

/-- Proposition 11 (Frankl–Kupavskii, arXiv:1806.08855v3, p. 6): in the setting of Lemma 10
(`m ≥ tl`, `G ⊂ \binom{[m]}{l}`, `α := |G|/\binom{m}{l}`, `B` a uniformly random `t`-matching of
`l`-sets, `η_i` the indicator that the `i`-th set of `B` lies in `G`), for any `i, j ∈ [t]` with
`i ≠ j` we have `|Cov[η_i, η_j]| ≤ \frac{α(1−α)}{t−1}`.

**Formalization Note.** Positions are `Fin t`; `i ≠ j` forces `t ≥ 2`, so `t − 1 > 0` in `ℝ`. The
covariance is taken under the uniform distribution on `tMatchings m l t` (ordered `t`-tuples of
pairwise disjoint `l`-subsets of `[m]`), which is nonempty because `t * l ≤ m`. -/
theorem indicator_covariance_bound (m l t : ℕ) (hm : t * l ≤ m) (G : Finset (Finset ℕ))
    (hG : G ⊆ (Finset.Icc 1 m).powersetCard l) (i j : Fin t) (hij : i ≠ j) :
    |cov m l t (etaI G i) (etaI G j)| ≤
      density m l G * (1 - density m l G) / ((t : ℝ) - 1) := by sorry

end FranklKupavskii2022.EMC
Source
Frankl–Kupavskii, The Erdős Matching Conjecture and concentration inequalities, arXiv:1806.08855v3, Proposition 11, p. 6 (setting of Lemma 10)
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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