Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 — no online algorithm beats 26/27 on a 6-cycle, and none reaches 1 − o(1) on k disjoint 6-cycles

Proved
OnlineStochMatching.Hardness.theorem_3

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

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

This is Theorem 3 of Feldman, Mehta, Mirrokni and Muthukrishnan, in two parts.

  1. A single instance. On 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)}, uniform distribution, n=3n = 3n=3), every randomized online algorithm has
E ⁣[ALGOPT]≤2627.\mathbb E\!\left[\frac{\mathrm{ALG}}{\mathrm{OPT}}\right] \le \frac{26}{27}.E[OPTALG​]≤2726​.
  1. A family with n→∞n \to \inftyn→∞. For k≥1k \ge 1k≥1 let Γk\Gamma_kΓk​ be the instance made of kkk disjoint copies of the 6-cycle, with the uniform distribution on its 3k3k3k impression types and n=3kn = 3kn=3k arrivals. There are a constant c<1c < 1c<1 and a threshold K0K_0K0​ such that for every k≥K0k \ge K_0k≥K0​ and every randomized online algorithm on Γk\Gamma_kΓk​,
E ⁣[ALGOPT]≤c.\mathbb E\!\left[\frac{\mathrm{ALG}}{\mathrm{OPT}}\right] \le c.E[OPTALG​]≤c.

The paper writes the second part as "there exists a family of instances with n→∞n \to \inftyn→∞ for which no algorithm can achieve an expected approximation of 1−o(1)1 - o(1)1−o(1)"; part 2 is the explicit form of that statement on the paper's own family: the best achievable expected approximation factor on Γk\Gamma_kΓk​ stays below a fixed constant smaller than 111 for all large kkk, so it does not tend to 111.

The theorem shows that the expected approximation factor of online algorithms in the i.i.d. model is bounded strictly away from 111, which separates the problem from its offline version and frames the paper's positive results (1−1/e1 - 1/e1−1/e and 0.670.670.67).

Formalization Note Expectations are over the algorithm's randomness (a probability distribution on deterministic online algorithms) and the uniform i.i.d. arrivals. The constant ccc and the threshold K0K_0K0​ are chosen before kkk and before the algorithm. The paper's numerical value c≈0.9898c \approx 0.9898c≈0.9898 (Appendix B) rests on approximations and is not part of the statement. On these instances every impression type 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 (p. 4; details App. B, p. 13). (a) On the 6-cycle instance (`n = 3`), no randomized
online algorithm has expected approximation factor above `26/27`. (b) On the family of `k`
disjoint 6-cycles with uniform arrivals and `n = 3k`, there is a constant `c < 1` such that for
all large `k` no randomized online algorithm has expected approximation factor above `c`; so
the best achievable expected factor does not tend to `1` as `n → ∞`. -/
theorem theorem_3 :
    (∀ P : PMF (OnlineAlg Adv Imp 3), randExpectedRatio cycleEdge P ≤ 26 / 27) ∧
    ∃ c : ℝ, c < 1 ∧ ∃ K₀ : ℕ, ∀ k : ℕ, K₀ ≤ k →
      ∀ P : PMF (OnlineAlg (Fin k × Adv) (Fin k × Imp) (3 * k)),
        randExpectedRatio (kCycleEdge k) P ≤ c := by sorry

end OnlineStochMatching.Hardness
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 4, Theorem 3; p. 13, Appendix B
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