Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 (first sentence) — no online algorithm beats expected approximation factor 26/27 on the 6-cycle

Proved
OnlineStochMatching.Hardness.theorem_3_single_cycle

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

bipartite-matchinglower-boundonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the 6-cycle instance: advertisers {a,b,c}\{a, b, c\}{a,b,c}, impression types {x,y,z}\{x, y, z\}{x,y,z}, edges {(x,a),(y,a),(y,b),(z,b),(z,c),(x,c)}\{(x,a),(y,a),(y,b),(z,b),(z,c),(x,c)\}{(x,a),(y,a),(y,b),(z,b),(z,c),(x,c)}, the uniform distribution on the three types, and n=3n = 3n=3 arrivals. For every randomized online algorithm, the expected approximation factor satisfies

E ⁣[ALGOPT]≤2627,\mathbb E\!\left[\frac{\mathrm{ALG}}{\mathrm{OPT}}\right] \le \frac{26}{27},E[OPTALG​]≤2726​,

where the expectation is over the algorithm's randomness and the three i.i.d. uniform arrivals.

This is the first sentence of Theorem 3: there is an instance of the online stochastic matching problem on which no algorithm can achieve an expected approximation factor better than 26/2726/2726/27. It shows that, unlike the offline problem, the online i.i.d. problem has no algorithm with expected factor arbitrarily close to 111 on every instance.

Formalization Note A randomized online algorithm is a probability distribution P on deterministic online algorithms (see the model definition); the bound holds for every such P. On this instance every arrival has an adjacent advertiser, so OPT≥1\mathrm{OPT} \ge 1OPT≥1 on every arrival sequence and the ratio is never 0/00/00/0.

Preamble
import Mathlib
import Definitions.Def_OnlineStochMatching_Hardness_Model
import Definitions.Def_OnlineStochMatching_Hardness_SixCycle
Formal statement
namespace OnlineStochMatching.Hardness

/-- Theorem 3, first sentence (p. 4): on the 6-cycle instance (three advertisers, three
impression types, uniform arrivals, `n = 3`), every randomized online algorithm has expected
approximation factor `E[ALG/OPT]` at most `26/27`. -/
theorem theorem_3_single_cycle (P : PMF (OnlineAlg Adv Imp 3)) :
    randExpectedRatio cycleEdge P ≤ 26 / 27 := by sorry

end OnlineStochMatching.Hardness
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 4, Theorem 3 (first sentence) and the 6-cycle instance of Section 3
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