Lemma C.1 — Nonnegative optimal prices (corrected: offered products)
ProvedGaoImpatientMNL.Pricing.lemma_C_1Let , let , let be common to all products, and let . Feasible sequences have pairwise disjoint assortments, allowing empty stages and omitted products. Write for the sequential revenue defined by the model, with every product price unrestricted in . For any fixed feasible and any global pricing maximizer ,
Prices of omitted products are unrestricted. This is the offered-product conclusion justified by the source argument.
Differences from the source:
- encoding: Products and stages numbered from one → Products and stages are Fin n and Fin m, numbered from zero; reason: This is a bijective reindexing; n and m are positive, and empty stages and omitted products remain feasible.
- encoding: Common price sensitivity beta → Explicit beta > 0; reason: This is the economic price-sensitivity convention used in Appendix C and the rescaling in Appendix F; intrinsic utilities and input prices remain arbitrary reals.
- correction: Every optimal price is nonnegative for all products → Every optimal offered-product price is nonnegative; reason: For n=m=1, alpha=0, beta=1, lambda=1 and S_1 empty, every price is optimal with revenue zero, including p_1=-1. Restricting only the conclusion to offered products corrects the false printed claim.
import Mathlib import Definitions.Def_GaoImpatientMNL_Pricing_Model
/- BEGIN IMPORTED LEAN FOR BLIND AUDIT
noncomputable section
namespace MultiStoreAssort.Pricing
variable {n : ℕ}
noncomputable def rev14 (a b : Fin n → ℝ) (S : Finset (Fin n)) (p : Fin n → ℝ) : ℝ :=
(∑ k ∈ S, p k * Real.exp (a k - b k * p k)) / (1 + ∑ k ∈ S, Real.exp (a k - b k * p k))
end MultiStoreAssort.Pricing
end
open scoped BigOperators
noncomputable section
namespace GaoImpatientMNL.Pricing
def Parameters {n m : ℕ} (β : ℝ) (lam : Fin m → ℝ) : Prop :=
0 < n ∧ 0 < m ∧ 0 < β ∧
(∀ k, k.val = 0 → lam k = 1) ∧ (∀ k, 0 < lam k) ∧ Antitone lam
def Feasible {n m : ℕ} (S : Fin m → Finset (Fin n)) : Prop :=
∀ k h, k ≠ h → Disjoint (S k) (S h)
def attraction {n : ℕ} (α : Fin n → ℝ) (β : ℝ) (p : Fin n → ℝ)
(s : Finset (Fin n)) : ℝ := ∑ i ∈ s, Real.exp (α i - β * p i)
def prefixWeight {n m : ℕ} (v : Fin n → ℝ) (S : Fin m → Finset (Fin n)) (k : Fin m) : ℝ :=
∑ h ∈ Finset.univ.filter (fun h => h < k), ∑ i ∈ S h, v i
def choiceFormula {n m : ℕ} (v : Fin n → ℝ) (lam : Fin m → ℝ)
(S : Fin m → Finset (Fin n)) (k : Fin m) (i : Fin n) : ℝ :=
lam k * v i / ((1 + prefixWeight v S k) * (1 + prefixWeight v S k + ∑ j ∈ S k, v j))
def revenue {n m : ℕ} (α : Fin n → ℝ) (β : ℝ) (lam : Fin m → ℝ)
(S : Fin m → Finset (Fin n)) (p : Fin n → ℝ) : ℝ :=
∑ k, (lam k * ∑ i ∈ S k, p i * Real.exp (α i - β * p i)) /
((1 + prefixWeight (fun i => Real.exp (α i - β * p i)) S k) *
(1 + prefixWeight (fun i => Real.exp (α i - β * p i)) S k + attraction α β p (S k)))
def firstSequence (n m : ℕ) : Fin m → Finset (Fin n) :=
fun k => if k.val = 0 then Finset.univ else ∅
def firstRevenue {n : ℕ} (α : Fin n → ℝ) (β : ℝ) (p : Fin n → ℝ) : ℝ :=
MultiStoreAssort.Pricing.rev14 α (fun _ => β) Finset.univ p
def jointRevenues {n m : ℕ} (α : Fin n → ℝ) (β : ℝ) (lam : Fin m → ℝ) : Set ℝ :=
{r | ∃ S : Fin m → Finset (Fin n), Feasible S ∧ ∃ p : Fin n → ℝ, r = revenue α β lam S p}
def jointValue {n m : ℕ} (α : Fin n → ℝ) (β : ℝ) (lam : Fin m → ℝ) : ℝ :=
sSup (jointRevenues α β lam)
def firstValue {n : ℕ} (α : Fin n → ℝ) (β : ℝ) : ℝ :=
sSup (Set.range (firstRevenue α β))
def IsPricingMax {n m : ℕ} (α : Fin n → ℝ) (β : ℝ) (lam : Fin m → ℝ)
(S : Fin m → Finset (Fin n)) (p : Fin n → ℝ) : Prop :=
∀ p', revenue α β lam S p' ≤ revenue α β lam S p
def MaximaExist {n m : ℕ} (α : Fin n → ℝ) (β : ℝ) (lam : Fin m → ℝ) : Prop :=
(jointRevenues α β lam).Nonempty ∧ BddAbove (jointRevenues α β lam) ∧
(Set.range (firstRevenue α β)).Nonempty ∧ BddAbove (Set.range (firstRevenue α β)) ∧
(∃ S p, Feasible S ∧ revenue α β lam S p = jointValue α β lam) ∧
(∃ p, firstRevenue α β p = firstValue α β) ∧ 0 < jointValue α β lam
end GaoImpatientMNL.Pricing
END IMPORTED LEAN FOR BLIND AUDIT -/
namespace GaoImpatientMNL.Pricing
theorem lemma_C_1 {n m : ℕ} (α : Fin n → ℝ) (β : ℝ) (lam : Fin m → ℝ)
(h : Parameters (n := n) β lam) (S : Fin m → Finset (Fin n)) (hS : Feasible S)
(p : Fin n → ℝ) (hp : IsPricingMax α β lam S p) :
∀ k, ∀ i ∈ S k, 0 ≤ p i := by sorry
end GaoImpatientMNL.Pricing
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Data. Take , , and (indices zero-based), satisfying:
- and ;
- ;
- , every , and non-increasing.
Let have pairwise disjoint stages. Let be a global maximizer over all of of
That is, for every .
Conclusion. for every stage and every .
Nothing is asserted about the prices of products lying in no stage; these do not affect . The existence of a maximizer is not asserted. If none exists, the statement is vacuous.
Degenerate cases. If all are empty, , every is a maximizer, and the conclusion is vacuous because there is no . The cases , and are excluded by hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.