Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9.1 — P(χ(G(n,p),m)∈[a−k,a])≥1−2e−t2/8−P(sup⁡cardF≤tmχ(G(n,p),F)>k)P(\chi(G(n,p),m)\in[a-k,a])\ge1-2e^{-t^2/8}-P(\sup_{\mathrm{card}F\le t\sqrt m}\chi(G(n,p),F)>k)P(χ(G(n,p),m)∈[a−k,a])≥1−2e−t2/8−P(supcardF≤tm​​χ(G(n,p),F)>k)

Proved
TalagrandConc.Chromatic.theorem_9_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

chromatic-numberconcentration-of-measurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1probabilityrandom-graphs

Let G(n,p)G(n,p)G(n,p) be the random graph on V={1,…,n}V=\{1,\dots,n\}V={1,…,n} in which each of the possible edges (i,j)(i,j)(i,j), i<ji<ji<j, is present with probability ppp, 0<p<10<p<10<p<1, independently of the others. For A⊆VA\subseteq VA⊆V let χ(G,A)\chi(G,A)χ(G,A) be the chromatic number of the subgraph induced on AAA, and χ(G,m)=inf⁡{χ(G,A); card⁡A=m}\chi(G,m)=\inf\{\chi(G,A);\ \operatorname{card}A=m\}χ(G,m)=inf{χ(G,A); cardA=m}.

Let m≤nm\le nm≤n and kkk be natural numbers and t>0t>0t>0. Then there exists an integer aaa such that

P(χ(G(n,p),m)∈[a−k,a]) ≥ 1−2e−t2/8−P(sup⁡{χ(G(n,p),F); F⊂V, card⁡F≤tm}>k).P\big(\chi(G(n,p),m)\in[a-k,a]\big)\ \ge\ 1-2e^{-t^2/8}-P\big(\sup\{\chi(G(n,p),F);\ F\subset V,\ \operatorname{card}F\le t\sqrt m\}>k\big).P(χ(G(n,p),m)∈[a−k,a]) ≥ 1−2e−t2/8−P(sup{χ(G(n,p),F); F⊂V, cardF≤tm​}>k).

The theorem says that χ(G(n,p),m)\chi(G(n,p),m)χ(G(n,p),m) is concentrated on an interval of k+1k+1k+1 consecutive integers, up to an error 2e−t2/82e^{-t^2/8}2e−t2/8 plus the probability that some set of at most tmt\sqrt mtm​ vertices already needs more than kkk colours. The last term vanishes when k>tmk>t\sqrt mk>tm​, and remains small for smaller kkk when p=n−αp=n^{-\alpha}p=n−α.

Formalization Note G(n,p)G(n,p)G(n,p) is realised as the graph G(x)G(x)G(x) of a configuration x∈{0,1}E0x\in\{0,1\}^{E_0}x∈{0,1}E0​ under the product of Bernoulli(ppp) laws. The hypothesis m≤nm\le nm≤n is implicit on the page (χ(G,m)\chi(G,m)χ(G,m) is an infimum over mmm-subsets of VVV); without it χ(G,m)=+∞\chi(G,m)=+\inftyχ(G,m)=+∞ and the statement fails. The integer aaa may depend on n,p,m,k,tn,p,m,k,tn,p,m,k,t. Probabilities are real numbers (Measure.real), so the right-hand side may be negative, as on the page.

Preamble
import Mathlib
import Definitions.Def_TalagrandConc_Chromatic_Basic

open MeasureTheory
open scoped Classical
Formal statement
namespace TalagrandConc.Chromatic

theorem theorem_9_1 (n m k : ℕ) (p t : ℝ) (hp0 : 0 < p) (hp1 : p < 1) (ht : 0 < t)
    (hm : m ≤ n) :
    ∃ a : ℤ,
      1 - 2 * Real.exp (-t ^ 2 / 8)
          - (gnp n p).real {x | (k : ℕ∞) < localSup (graphOf x) (t * Real.sqrt m)}
        ≤ (gnp n p).real {x | (((a - k : ℤ)) : WithTop ℤ) ≤ chiMZ (graphOf x) m ∧
            chiMZ (graphOf x) m ≤ (a : WithTop ℤ)} := by sorry

end TalagrandConc.Chromatic
Source
Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Publ. Math. IHÉS 81 (1995), p. 163, Theorem 9.1, Eq. (9.1)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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