Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — assignment-independent price range

Proved
ContiguousCake597.Approximate.lemma_7

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

cake-cuttingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1ppad

Let N≥1N\ge1N≥1 be arbitrary. Let π\piπ and σ\sigmaσ be arbitrary permutations of [N][N][N], with π\piπ a single cycle traversing every index. Let η≥0\eta\ge0η≥0 and let q1,…,qNq_1,\ldots,q_Nq1​,…,qN​ be arbitrary real prices. If

qσ(i)≥max⁡{qi,qπ(i)}−ηfor every i,q_{\sigma(i)}\ge\max\{q_i,q_{\pi(i)}\}-\eta\quad\text{for every }i,qσ(i)​≥max{qi​,qπ(i)​}−ηfor every i,

then

max⁡jqj−min⁡jqj≤Nη.\max_jq_j-\min_jq_j\le N\eta.jmax​qj​−jmin​qj​≤Nη.

Equivalently, every ordered pair satisfies qj−qi≤Nηq_j-q_i\le N\etaqj​−qi​≤Nη. The singleton case and zero error are included; no positivity or rationality of prices is required. This is a standalone combinatorial lemma, with no cake-specific parameters or assignment restriction.

Differences from the source:

  • encoding: the finite maximum minus minimum is at most Nη → every ordered pair satisfies q_j−q_i≤Nη; reason: on a nonempty finite set the largest pairwise difference is exactly the maximum minus minimum; this avoids default extrema and includes N=1
Preamble
import Definitions.Def_ContiguousCake597_Approximate_Analysis
Formal statement
namespace ContiguousCake597.Approximate

/-- Lemma 7, printed p.9 (PDF 10). Pairwise differences are equivalent
to the finite maximum-minus-minimum bound; n=1 and eta=0 are included. -/
theorem lemma_7 (n : ℕ) (hn : 1 ≤ n) (p sigma : Equiv.Perm (Fin n))
    (hp : SingleCycle p) (e : ℝ) (he : 0 ≤ e) (q : Fin n → ℝ)
    (hq : ∀ i, max (q i) (q (p i)) - e ≤ q (sigma i)) :
    ∀ i j : Fin n, q j - q i ≤ (n : ℝ) * e := by sorry

end ContiguousCake597.Approximate
Source
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui, STOC 2027 submission #597 (October 2026), p. 9 (PDF 10), Lemma 7
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