Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The polyhedron P(D)P(D)P(D)

Definition
DSICCompComp_Supplement_InP

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

lp-dualitymechanism-designp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-maximization

P(D)P(D)P(D) is the set of solutions (x,p)(x, p)(x,p) satisfying the constraints of the DSIC revenue LP other than the DSIC constraints:

  1. ∑ixij(v)≤1\sum_i x_{ij}(v) \le 1∑i​xij​(v)≤1 for all items jjj and v∈supp(D)v \in \mathrm{supp}(D)v∈supp(D);
  2. xij(v)≥0x_{ij}(v) \ge 0xij​(v)≥0 for all iii, jjj and v∈supp(D)v \in \mathrm{supp}(D)v∈supp(D);
  3. xij(∅,v−i)=0x_{ij}(\varnothing, v_{-i}) = 0xij​(∅,v−i​)=0 for all iii, jjj and v−i∈supp(D−i)v_{-i} \in \mathrm{supp}(D_{-i})v−i​∈supp(D−i​);
  4. pi(∅,v−i)=0p_i(\varnothing, v_{-i}) = 0pi​(∅,v−i​)=0 for all iii and v−i∈supp(D−i)v_{-i} \in \mathrm{supp}(D_{-i})v−i​∈supp(D−i​).

Payments are unconstrained in sign. P(D)P(D)P(D) is the domain over which the partial Lagrangian is maximized.

Formalization Note v−iv_{-i}v−i​ is read off a full profile v∈supp(D)v \in \mathrm{supp}(D)v∈supp(D) whose iii-th entry is overwritten; each supp(Di)\mathrm{supp}(D_i)supp(Di​) is nonempty because fif_ifi​ sums to 111, so this ranges over exactly supp(D−i)\mathrm{supp}(D_{-i})supp(D−i​).

Definition code
import Mathlib
import Definitions.Def_DSICCompComp_Supplement_LPSolution
import Definitions.Def_DSICCompComp_Supplement_devProfile

namespace DSICCompComp

namespace Supplement

/-- Membership in the polyhedron `P(D)` of Appendix C (Ryu–Weinberg–Xue, *The DSIC Competition Complexity of Additive Buyers over Independent Items*, STOC 2027
submission, manuscript of Nov. 3, 2026, sha256 bf61bfdb…,
Appendix C, p.35 (pdf p.36)): the constraints of the DSIC revenue LP other than the DSIC
constraints, namely
1. `∑_i x_ij(v) ≤ 1` for all items `j` and `v ∈ supp(D)`;
2. `x_ij(v) ≥ 0` for all `i`, `j` and `v ∈ supp(D)`;
3. `x_ij(∅, v_{-i}) = 0` for all `i`, `j` and `v_{-i} ∈ supp(D_{-i})`;
4. `p_i(∅, v_{-i}) = 0` for all `i` and `v_{-i} ∈ supp(D_{-i})`.

**Formalization Note** `v_{-i}` is read off a full profile `v` (its `i`-th entry is overwritten by
`devProfile`); every `supp(D_i)` is nonempty since `f_i` sums to `1`, so this ranges over exactly
`supp(D_{-i})`. Payments are unconstrained in sign. -/
def InP {n m : ℕ} (E : FiniteSetting n m) (sol : LPSolution E) : Prop :=
  (∀ (v : (i : Fin n) → E.S i) (j : Fin m), ∑ i, sol.x (fun k => some (v k)) i j ≤ 1) ∧
  (∀ (v : (i : Fin n) → E.S i) (i : Fin n) (j : Fin m), 0 ≤ sol.x (fun k => some (v k)) i j) ∧
  (∀ (v : (i : Fin n) → E.S i) (i : Fin n) (j : Fin m), sol.x (devProfile E v i none) i j = 0) ∧
  (∀ (v : (i : Fin n) → E.S i) (i : Fin n), sol.p (devProfile E v i none) i = 0)

end Supplement

end DSICCompComp
Source
Ryu–Weinberg–Xue, The DSIC Competition Complexity of Additive Buyers over Independent Items, STOC 2027 submission (manuscript of Nov. 3, 2026, sha256 bf61bfdb…), Appendix C, p.35 (pdf p.36)

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