Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 — constructed prices satisfy both clauses of (3)

Proved
ContiguousCake597.Approximate.lemma_8

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

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

Let GGG be any nonempty directed graph with every indegree at most two, and use its constructed cake on [0,L][0,L][0,L]. Let TTT be any complete η\etaη-envy-free allocation with real cuts θ\thetaθ and arbitrary assignment permutation σ\sigmaσ, where R=32(s+1)R=32(s+1)R=32(s+1), N=32(s+1)2N=32(s+1)^2N=32(s+1)2, B=40NB=40NB=40N, L=NBL=NBL=NB and η=1/(100N2)\eta=1/(100N^2)η=1/(100N2) for the number sss of graph vertices. Let ℓj=θj−θj−1\ell_j=\theta_j-\theta_{j-1}ℓj​=θj​−θj−1​ and zv=min⁡{1,max⁡{0,θvR−vRB+13/2}}z_v=\min\{1,\max\{0,\theta_{vR}-vRB+13/2\}\}zv​=min{1,max{0,θvR​−vRB+13/2}}. For the disjoint constructed sets SvS_vSv​, put qj=ℓj+zvq_j=\ell_j+z_vqj​=ℓj​+zv​ when j∈Svj\in S_vj∈Sv​ and qj=ℓjq_j=\ell_jqj​=ℓj​ otherwise. With UiU_iUi​ the constructed interval valuation and π\piπ the constructed single-cycle successor, both assertions of equation (3) hold:

Ui(Pj)−Ui(Pi)≤qj−qifor all i,j,U_i(P_j)-U_i(P_i)\le q_j-q_i\quad\text{for all }i,j,Ui​(Pj​)−Ui​(Pi​)≤qj​−qi​for all i,j, Ui(Pπ(i))−Ui(Pi)=qπ(i)−qifor all i.U_i(P_{\pi(i)})-U_i(P_i)=q_{\pi(i)}-q_i\quad\text{for all }i.Ui​(Pπ(i)​)−Ui​(Pi​)=qπ(i)​−qi​for all i.

The prices and successor cycle are the explicit construction. Neither localization nor these inequalities are hypotheses. The equality is needed to connect approximate envy-freeness to the standalone price-range lemma.

Differences from the source:

  • encoding: the pieces satisfy (3) with these prices → both displayed clauses of (3), with the defined prices substituted; reason: expands the source cross-reference, preserving its universal inequality and exact equality
Preamble
import Definitions.Def_ContiguousCake597_Approximate_Analysis
Formal statement
namespace ContiguousCake597.Approximate

/-- Lemma 8, printed p.10 (PDF 11), with BOTH clauses of Eq. (3)
printed p.9 (PDF 10). Localization is a consequence, never a hypothesis. -/
theorem lemma_8 (G : HZTractability.ThrGraph) (hn : 1 ≤ G.n)
    (hdeg : ∀ v, G.indeg v ≤ 2) (T : Allocation ℝ (N G))
    (hT : AnalyticAnswer G T) :
    (∀ i j : Fin (N G),
      pieceValue G T i j - pieceValue G T i i ≤ price G T j - price G T i) ∧
    (∀ i : Fin (N G),
      pieceValue G T i (pi G i) - pieceValue G T i i =
        price G T (pi G i) - price G T i) := by sorry

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