Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 4, (A.8) — two-buyer region as a cone section

Proved
InfFisher.Linear.S_eq_cone_inter_T

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationfair-divisionfisher-marketp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1parabolic-cone

Consider two adjacent normalized linear valuations v1(θ)=c1θ+d1v_1(\theta)=c_1\theta+d_1v1​(θ)=c1​θ+d1​ and v2(θ)=c2θ+d2v_2(\theta)=c_2\theta+d_2v2​(θ)=c2​θ+d2​ with 2≥d1≥d2≥02\ge d_1\ge d_2\ge02≥d1​≥d2​≥0. Let SSS be the region of (z,w)(z,w)(z,w) for which some a∈[0,1]a\in[0,1]a∈[0,1] satisfies z≤c1a2/2+d1az\le c_1a^2/2+d_1az≤c1​a2/2+d1​a, w≤−c2a2/2−d2aw\le-c_2a^2/2-d_2aw≤−c2​a2/2−d2​a, 0≤z≤10\le z\le10≤z≤1, −1≤w≤0-1\le w\le0−1≤w≤0, and z+w≥0z+w\ge0z+w≥0. Then

S={(z,w):0≤z≤1, −1≤w≤0, z+w≥0, ∃(s,t), s2≤t, (z,w)=G(s,t)},S=\{(z,w):0\le z\le1,\ -1\le w\le0,\ z+w\ge0,\ \exists(s,t),\ s^2\le t,\ (z,w)=G(s,t)\},S={(z,w):0≤z≤1, −1≤w≤0, z+w≥0, ∃(s,t), s2≤t, (z,w)=G(s,t)},

where G(s,t)=(d1s+c1t/2,−d2s−c2t/2)G(s,t)=(d_1s+c_1t/2,-d_2s-c_2t/2)G(s,t)=(d1​s+c1​t/2,−d2​s−c2​t/2). This is the pairwise geometric identification used to replace the breakpoint inequalities by parabolic cone constraints in Theorem 4.

Formalization Note The right side writes the paper's conv⁡(Γˉ)∩T\operatorname{conv}(\bar\Gamma)\cap Tconv(Γˉ)∩T identification as GC∩TG\mathcal C\cap TGC∩T. It includes the tied intercept case.

Preamble
import Mathlib
import Definitions.Def_InfFisher_Linear_Setting
Formal statement
namespace InfFisher.Linear

/-- Gao–Kroer, proof of Theorem 4, (A.8): the two-buyer region is a transformed parabolic cone cut by `T`. -/
theorem S_eq_cone_inter_T (c₁ d₁ c₂ d₂ : ℝ)
    (h₁ : c₁ / 2 + d₁ = 1) (h₂ : c₂ / 2 + d₂ = 1)
    (hd : d₂ ≤ d₁) (hd₁ : d₁ ≤ 2) (hd₂ : 0 ≤ d₂) :
    {q : ℝ × ℝ | ∃ a ∈ Set.Icc (0 : ℝ) 1,
      q.1 ≤ c₁ / 2 * a ^ 2 + d₁ * a ∧
      q.2 ≤ -(c₂ / 2) * a ^ 2 - d₂ * a ∧
      q.1 ∈ Set.Icc (0 : ℝ) 1 ∧
      q.2 ∈ Set.Icc (-1 : ℝ) 0 ∧ 0 ≤ q.1 + q.2} =
    {q : ℝ × ℝ |
      q.1 ∈ Set.Icc (0 : ℝ) 1 ∧
      q.2 ∈ Set.Icc (-1 : ℝ) 0 ∧ 0 ≤ q.1 + q.2 ∧
      ∃ s t : ℝ, s ^ 2 ≤ t ∧
        q = (d₁ * s + c₁ / 2 * t, -d₂ * s - c₂ / 2 * t)} := by sorry

end InfFisher.Linear
Source
Gao & Kroer, Infinite-Dimensional Fisher Markets and Tractable Fair Division, arXiv:2010.03025v5, proof of Theorem 4, (A.8), pp. a11–a12 (PDF 46–47)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me