Lemma 8 — constructed prices satisfy both clauses of (3)
ProvedContiguousCake597.Approximate.lemma_8Let be any nonempty directed graph with every indegree at most two, and use its constructed cake on . Let be any complete -envy-free allocation with real cuts and arbitrary assignment permutation , where , , , and for the number of graph vertices. Let and . For the disjoint constructed sets , put when and otherwise. With the constructed interval valuation and the constructed single-cycle successor, both assertions of equation (3) hold:
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
import Definitions.Def_ContiguousCake597_Approximate_Analysis
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.