Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.9 — target quadratic approximation by a gadget chain, remainder bound 12wjj′t312w_{jj'}t^312wjj′​t3

Proved
LinearChoresCLS.theorem_6_9

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

choresclscompetitive-equilibriumfisher-marketp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let I=(A,c,ε)I=(A,c,\varepsilon)I=(A,c,ε) with n≥1n\ge1n≥1 and ε>0\varepsilon>0ε>0, and consider the completed market f(I)f(I)f(I) with the parameters (7.1) and (6.9). For every chain 0≤j<j′≤n0\le j<j'\le n0≤j<j′≤n and every x∈[0,1]nx\in[0,1]^nx∈[0,1]n,

−wjj′2t2(xj−xj′)2=P(j,j′)(x)+R(j,j′)(x).-\frac{w_{jj'}}2t^2(x_j-x_{j'})^2=P_{(j,j')}(x)+R_{(j,j')}(x).−2wjj′​​t2(xj​−xj′​)2=P(j,j′)​(x)+R(j,j′)​(x).

The remainder satisfies ∣R(j,j′)(x+heℓ)−R(j,j′)(x)∣≤12wjj′t3∣h∣|R_{(j,j')}(x+he_\ell)-R_{(j,j')}(x)|\le12w_{jj'}t^3|h|∣R(j,j′)​(x+heℓ​)−R(j,j′)​(x)∣≤12wjj′​t3∣h∣ for every ℓ∈[n]\ell\in[n]ℓ∈[n] and every coordinate segment from xxx to x+heℓx+he_\ellx+heℓ​ in the box; moreover, for every feasible coordinate direction v~∈{±eℓ}\tilde v\in\{\pm e_\ell\}v~∈{±eℓ​} at xxx, the right directional derivative exists and ∣R(j,j′)′(x;v~)∣≤12wjj′t3|R'_{(j,j')}(x;\tilde v)|\le12w_{jj'}t^3∣R(j,j′)′​(x;v~)∣≤12wjj′​t3.

The gadget chain realizes the negative squared difference −wjj′2t2(xj−xj′)2-\frac{w_{jj'}}2t^2(x_j-x_{j'})^2−2wjj′​​t2(xj​−xj′​)2 needed to turn the basic market's quadratic into α2x⊤Ax\frac\alpha2x^\top Ax2α​x⊤Ax.

Formalization Note P(j,j′)P_{(j,j')}P(j,j′)​ and R(j,j′)=R~+R^R_{(j,j')}=\tilde R+\hat RR(j,j′)​=R~+R^ are the paper's explicit formulas, with gadget prices from the max–min rule; x0=0x_0=0x0​=0. Ties of the max–min rule are not excluded.

Differences from the source:

  • encoding: chains 0 ≤ j < j′ ≤ n, x₀ = 0 → π : Pair n (a subtype of Fin (n+1) × Fin (n+1)), x extended by Fin.cons 0; reason: index conventions; same instances
Preamble
import Mathlib
import Definitions.Def_LinearChoresCLS_Remainders
import Definitions.Def_LinearChoresCLS_RightDeriv

open Finset NetworkEquilibriumCLS.LinearNash
Formal statement
namespace LinearChoresCLS

/-- **Theorem 6.9 (Target quadratic approximation)** (arXiv:2611.06589, held version sha256
85d34a9e…, p.24). For the completed market `f(I)` of an instance `I = (A, c, ε)` (`n ≥ 1`,
`ε > 0`, parameters (7.1) and (6.9)) and every chain `0 ≤ j < j′ ≤ n`: for every `x ∈ [0,1]ⁿ`,
`−(w_{jj′}/2) t² (x_j − x_{j′})² = P_{(j,j′)}(x) + R_{(j,j′)}(x)` (6.11); the remainder satisfies
`|R_{(j,j′)}(x + he_ℓ) − R_{(j,j′)}(x)| ≤ 12 w_{jj′} t³ |h|` for every `ℓ ∈ [n]` and every coordinate
segment from `x` to `x + he_ℓ` in the box; and for every feasible coordinate direction
`ṽ ∈ {±e_ℓ}` at `x` the right directional derivative exists and `|R′_{(j,j′)}(x; ṽ)| ≤ 12 w_{jj′} t³`.

**Formalization Note.** `x₀ = 0`; `P_{(j,j′)}` is `chainAbs` and `R_{(j,j′)} = R̃ + R̂` is
`chainRem`, both from the paper's explicit formulas, with the gadget prices given by the max–min
rule. -/
theorem theorem_6_9 {n : ℕ} (hn : 0 < n) (P : Quadratic n) (ε : ℚ) (hε : 0 < ε) (π : Pair n) :
    (∀ x : Fin n → ℝ, InCube x →
      -(pairWeight P π / 2) * tParam P ε ^ 2 * (xExt x π.1.1 - xExt x π.1.2) ^ 2 =
        chainAbs P (tParam P ε) (chainLength P ε) π x +
          chainRem P (tParam P ε) (chainLength P ε) π x) ∧
    (∀ (x : Fin n → ℝ) (ℓ : Fin n) (h : ℝ), InCube x → InCube (x + h • Pi.single ℓ (1 : ℝ)) →
      |chainRem P (tParam P ε) (chainLength P ε) π (x + h • Pi.single ℓ (1 : ℝ)) -
          chainRem P (tParam P ε) (chainLength P ε) π x| ≤
        12 * pairWeight P π * tParam P ε ^ 3 * |h|) ∧
    (∀ (x : Fin n → ℝ) (ℓ : Fin n) (s : Bool), InCube x → FeasibleCoordDir x ℓ s →
      ∃ D : ℝ, HasRightDerivAt0
          (fun h => chainRem P (tParam P ε) (chainLength P ε) π (x + h • coordDir ℓ s)) D ∧
        |D| ≤ 12 * pairWeight P π * tParam P ε ^ 3) := by sorry

end LinearChoresCLS
Source
Liu–Ma–Tao–Yang–Zheng, Competitive Equilibrium for Linear Chores is CLS-complete, arXiv:2611.06589 (held version, sha256 85d34a9e048d151ecff70a8614b9c2dd44307d5cf60faba74d14b2dd7eedc0b5), Theorem 6.9, Eq. (6.11), p.24 (proof Appendix C.1, pp.46–47)
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 9, 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