Theorem 2, p. 14 — outside option priced out: markup m*_1 for product 1, one markup m on 2..n′, nominal utility u_0 on n′+1..n (value at the closure point m*_1); unimodal in m
DisprovedThresholdMNL.Pricing.theorem_2Work in the TMNL model with , and products labelled so that (). Fix and the ordered assortment . Let be the set of prices at which every product of is in the consideration set, and let be the optimal value of problem (4),
Suppose that the outside option is not included in the consideration set at the optimal prices, in the sense that is also the supremum of over the prices at which the outside option is not considered. Set
For and a real , let be the prices giving product the markup (so ), products the common markup , and products the nominal utility . Write for the profit at with the outside option excluded. Then:
- (a) if (only product is offered), ;
- (b) there are and such that and every product of has nominal utility in at ; moreover, if , the profit is strictly unimodal: strictly increasing on and strictly decreasing on for some .
Since exactly at , the outside option sits on the boundary of the consideration set there; the paper's prices (and tail nominal utilities ) approach , and their profits approach . This is the outside-excluded case of the quasi-same-markup/same-utility policy of Theorem 4.
Formalization Note The standing assumptions of §3 (p. 12) are hypotheses: , , the labelling; because with is named. Optimal values are least upper bounds (IsLUB) with the explicit value . In Lean is pbar n' m: index gets price , indices get , the other indices get ; is exclProfit (ordAssort N n). The paper's product is the index .
Differences from the source:
- reading: "the outside option is not included in the consideration set at the optimal prices for the offer set " → , the supremum of (4) over , equals the supremum over the part of where the outside option is not considered; reason: on that part the optimum is never attained (it requires strictly), so "at the optimal prices" can only refer to the supremum.
- reading: "markup , an arbitrarily small positive number", and in (b) tail nominal utility "equal to " → the closure point , markup and tail utility exactly , with value given by the continuous outside-excluded profit formula of OS p. 2 and the closure condition ; reason: no price with fixed is optimal; the supremum is the limit as , which is the value at the closure point.
- reading: "the profit function is strictly unimodal in " → for , strictly increasing on and strictly decreasing on ; reason: the standard meaning; for there is no common-markup group and no .
- reading: "(a) It is optimal to offer only product 1 at markup " → if then ; reason: (a) is the case of the theorem, whose value is read through the closure point as above.
- encoding: products →
Fin Nwith product at index ; via "for all " instead of a max; reason: Lean convention, same instances.
import Mathlib import Definitions.Def_ThresholdMNL_Pricing_Model
namespace ThresholdMNL.Pricing
/-- Theorem 2 (p. 14): if the optimal value `V` of problem (4) on `S_n` is the value over the
feasible prices at which the outside option is not considered, then it is the value of the
outside-excluded profit at the closure point where product 1 has markup
`m*_1 = (α̂_1 − u_0 − Δ)/β`, products `2, …, n'` a common markup `m`, and products `n' + 1, …, n`
nominal utility `u_0`; (a) for `n = 1` the value is `m*_1`; the profit is strictly unimodal in `m`. -/
theorem theorem_2 {N : ℕ} (α c : Fin N → ℝ) (β u0 Δ : ℝ)
(hβ : 0 < β) (hΔ : 0 ≤ Δ) (hord : Antitone fun i : Fin N => α i - β * c i)
(n : ℕ) (hn : 1 ≤ n) (hnN : n ≤ N) (V : ℝ)
(hV : IsLUB {x | ∃ p : Fin N → ℝ,
(∀ i ∈ ordAssort N n, InCons (ordAssort N n) α β u0 Δ p i) ∧
x = profit (ordAssort N n) α c β u0 Δ p} V)
(hexcl : IsLUB {x | ∃ p : Fin N → ℝ,
(∀ i ∈ ordAssort N n, InCons (ordAssort N n) α β u0 Δ p i) ∧
¬ OutsideInCons (ordAssort N n) α β u0 Δ p ∧
x = profit (ordAssort N n) α c β u0 Δ p} V) :
let i₁ : Fin N := ⟨0, by omega⟩
let m₁ : ℝ := (α i₁ - β * c i₁ - u0 - Δ) / β
let pbar : ℕ → ℝ → Fin N → ℝ := fun n' m i =>
if i.val = 0 then c i + m₁ else if i.val < n' then c i + m else (α i - u0) / β
(n = 1 → V = m₁) ∧
∃ (n' : ℕ) (m : ℝ), 1 ≤ n' ∧ n' ≤ n ∧
V = exclProfit (ordAssort N n) α c β (pbar n' m) ∧
(∀ i ∈ ordAssort N n,
u0 ≤ nomUtil α β (pbar n' m) i ∧ nomUtil α β (pbar n' m) i ≤ u0 + Δ) ∧
(2 ≤ n' → ∃ m₀ : ℝ,
StrictMonoOn (fun m' => exclProfit (ordAssort N n) α c β (pbar n' m')) (Set.Iic m₀) ∧
StrictAntiOn (fun m' => exclProfit (ordAssort N n) α c β (pbar n' m')) (Set.Ici m₀)) := by sorry
end ThresholdMNL.Pricing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.