Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 — quadratic approximation of the basic market, remainder bound 2t32t^32t3

Proved
LinearChoresCLS.theorem_5_1

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

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

Let 0<t≤10<t\le10<t≤1 and consider the basic market of Section 5 with price family pj(x)=(1+txj)/(1+txˉ)p_j(x)=(1+tx_j)/(1+t\bar x)pj​(x)=(1+txj​)/(1+txˉ), x0=0x_0=0x0​=0, and Φ0(x)=Ψ0(p(x))\Phi_0(x)=\Psi_0(p(x))Φ0​(x)=Ψ0​(p(x)). For every x∈[0,1]nx\in[0,1]^nx∈[0,1]n,

Φ0(x)=t22(n+1)∑0≤j<j′≤n(xj−xj′)2+R0(x).\Phi_0(x)=\frac{t^2}{2(n+1)}\sum_{0\le j<j'\le n}(x_j-x_{j'})^2+R_0(x).Φ0​(x)=2(n+1)t2​0≤j<j′≤n∑​(xj​−xj′​)2+R0​(x).

The remainder satisfies ∣R0(x+hej)−R0(x)∣≤2t3∣h∣|R_0(x+he_j)-R_0(x)|\le2t^3|h|∣R0​(x+hej​)−R0​(x)∣≤2t3∣h∣ for every j∈[n]j\in[n]j∈[n] and every coordinate segment from xxx to x+hejx+he_jx+hej​ in [0,1]n[0,1]^n[0,1]n; moreover, for every feasible coordinate direction v~∈{±ej}\tilde v\in\{\pm e_j\}v~∈{±ej​} at xxx, the right directional derivative R0′(x;v~)R_0'(x;\tilde v)R0′​(x;v~) exists and ∣R0′(x;v~)∣≤2t3|R_0'(x;\tilde v)|\le2t^3∣R0′​(x;v~)∣≤2t3.

The basic market contributes a quadratic term proportional to the sum of squared coordinate differences, with third-order error.

Formalization Note Φ0\Phi_0Φ0​ is the generic objective of the basic market evaluated at p(x)p(x)p(x), and R0R_0R0​ is defined by the identity (5.3), as in Appendix B; the content is in the two bounds.

Differences from the source:

  • generalization: positive rational t ∈ (0, 1] → real t ∈ (0, 1]; reason: rational t is a special case; the proof uses only 0 < t ≤ 1
  • generalization: QP dimension n ≥ 1 (A ∈ ℚ^{n×n}, [n] for positive n, p.5) → any n : ℕ; reason: at n = 0 the box is one point and every clause holds trivially; n ≥ 1 is a special case
Preamble
import Mathlib
import Definitions.Def_LinearChoresCLS_BasicMarket
import Definitions.Def_LinearChoresCLS_RightDeriv

open Finset NetworkEquilibriumCLS.LinearNash
Formal statement
namespace LinearChoresCLS

/-- **Theorem 5.1 (Quadratic approximation)** (arXiv:2611.06589, held version sha256 85d34a9e…,
p.15). For the basic market with parameter `0 < t ≤ 1` and every `x ∈ [0,1]ⁿ`,
`Φ₀(x) = (t²/(2(n+1))) ∑_{0≤j<j′≤n} (x_j − x_{j′})² + R₀(x)` (5.3). The remainder satisfies
`|R₀(x + he_j) − R₀(x)| ≤ 2t³|h|` for every `j ∈ [n]` and every coordinate segment from `x` to
`x + he_j` in `[0,1]ⁿ`; and for every feasible coordinate direction `ṽ ∈ {±e_j}` at `x` the right
directional derivative `R₀′(x; ṽ)` exists and `|R₀′(x; ṽ)| ≤ 2t³`.

**Formalization Note.** `Φ₀` is the generic logarithmic objective of `basicMarket n t` at the
price family (5.2); `x₀ = 0`. The range `t ∈ (0, 1]` is Section 5's (p.13; real instead of
rational `t`). -/
theorem theorem_5_1 {n : ℕ} (t : ℝ) (ht : 0 < t) (ht1 : t ≤ 1) :
    (∀ x : Fin n → ℝ, InCube x →
      Phi0 t x = t ^ 2 / (2 * (n + 1)) * ∑ π : Pair n, (xExt x π.1.1 - xExt x π.1.2) ^ 2 +
        R0 t x) ∧
    (∀ (x : Fin n → ℝ) (j : Fin n) (h : ℝ), InCube x → InCube (x + h • Pi.single j (1 : ℝ)) →
      |R0 t (x + h • Pi.single j (1 : ℝ)) - R0 t x| ≤ 2 * t ^ 3 * |h|) ∧
    (∀ (x : Fin n → ℝ) (j : Fin n) (s : Bool), InCube x → FeasibleCoordDir x j s →
      ∃ D : ℝ, HasRightDerivAt0 (fun h => R0 t (x + h • coordDir j s)) D ∧
        |D| ≤ 2 * t ^ 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 5.1, Eq. (5.3), p.15 (proof Appendix B, pp.45–46)
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