Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — cut localization and both consequences

Proved
ContiguousCake597.Approximate.lemma_6

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. Every cut, including the endpoints, satisfies

∣θj−jB∣<7N(0≤j≤N).|\theta_j-jB|<7N\quad(0\le j\le N).∣θj​−jB∣<7N(0≤j≤N).

The core is Ij=[(j−1)B+10N,jB−10N]I_j=[(j-1)B+10N,jB-10N]Ij​=[(j−1)B+10N,jB−10N]. For player vvv, put av=vRa_v=vRav​=vR, Jv=[avB−13/2,avB−11/2]J_v=[a_vB-13/2,a_vB-11/2]Jv​=[av​B−13/2,av​B−11/2] and zv=min⁡{1,max⁡{0,θav−avB+13/2}}z_v=\min\{1,\max\{0,\theta_{a_v}-a_vB+13/2\}\}zv​=min{1,max{0,θav​​−av​B+13/2}}. Every core IjI_jIj​ is contained in spatial piece PjP_jPj​, and Pj∩Ik=∅P_j\cap I_k=\varnothingPj​∩Ik​=∅ for every k≠jk\ne jk=j. For every player vvv,

Jv⊆Pav∪Pav+1,∣Jv∩Pav∣=zv.J_v\subseteq P_{a_v}\cup P_{a_v+1},\qquad |J_v\cap P_{a_v}|=z_v.Jv​⊆Pav​​∪Pav​+1​,∣Jv​∩Pav​​∣=zv​.

The overlap length is computed exactly as the nonnegative difference between the smaller upper endpoint and larger lower endpoint. This lemma localizes spatial pieces independently of their recipients.

Differences from the source:

  • encoding: one-based pieces and interval intersection length → zero-based Fin indices for pieces and an exact endpoint-overlap formula; reason: the spatial piece with index j in Lean is the paper's piece j+1; cuts retain their numbers, including 0 and N
Preamble
import Definitions.Def_ContiguousCake597_Approximate_Analysis
Formal statement
namespace ContiguousCake597.Approximate

/-- Lemma 6, printed p.9 (PDF 10): every real-cut complete answer,
with arbitrary assignment, satisfies all localization conclusions. -/
theorem lemma_6 (G : HZTractability.ThrGraph) (hn : 1 ≤ G.n)
    (hdeg : ∀ v, G.indeg v ≤ 2) (T : Allocation ℝ (N G))
    (hT : AnalyticAnswer G T) :
    (∀ j : Fin (N G+1), |T.cuts j - (j.val : ℝ) * B G| < 7 * N G) ∧
    (∀ j : Fin (N G), core G j ⊆ T.piece j ∧
      ∀ k : Fin (N G), k ≠ j → T.piece j ∩ core G k = ∅) ∧
    (∀ v : Fin G.n,
      boundarySet G v ⊆ T.piece (specialPiece G v) ∪ T.piece (followingPiece G v) ∧
      overlap (T.cuts (specialPiece G v).castSucc) (T.cuts (specialPiece G v).succ)
        ((boundary G v).1 : ℝ) ((boundary G v).2 : ℝ) = z G T v) := by sorry

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