Theorem 1, p. 13 — some utility-net-cost ordered assortment S_{n*} is an optimal offer set for (3) (as a supremum)
ProvedThresholdMNL.Pricing.theorem_1Consider the TMNL joint assortment and pricing problem (3): products () with intrinsic utilities , costs , price coefficient , outside-option utility and tolerance , labelled so that , where . Let
be the optimal value of (3). Then there is such that the utility-net-cost ordered assortment reaches it:
and, whenever (3) has a maximizer (some and with ), some price vector attains .
This is the assortment half of the paper's main result (Theorem 4): only the nested sets need to be searched.
Formalization Note The theorem asserts the existence of a real that is the least upper bound of over all offer sets and price vectors, and of an for which is also the least upper bound over the prices on and, if is attained by some offer set, is attained on . The standing assumptions of §3 (p. 12) are hypotheses: , the labelling non-increasing, and (the tolerance of the model); because with must exist. The paper's product is the index .
Differences from the source:
- reading: "optimal offer set" for the "max" problem (3) → the supremum of over prices on equals the supremum of (3), and attains whenever some offer set does; reason: (3) need not have a maximizer — with , , , , , the profit is for markups and at most otherwise, so is not attained (the paper's own in Theorem 2(a)).
- encoding: products and →
Fin Nwith product at index and the indices below ; reason: Lean convention, same instances. - encoding: defined with → " for all ", outside option as the parameter , prices on all of ; reason: equivalent for the finite nonempty ; prices off enter no term.
import Mathlib import Definitions.Def_ThresholdMNL_Pricing_Model
namespace ThresholdMNL.Pricing
/-- Theorem 1 (p. 13): some utility-net-cost ordered assortment `S_{n*}` is an optimal offer set
for problem (3), "optimal" read as attaining the optimal value `V`, the least upper bound of
`R(S, p; Δ)` over all offer sets and prices; when (3) has a maximizer, `S_{n*}` carries one. -/
theorem theorem_1 {N : ℕ} (hN : 1 ≤ N) (α c : Fin N → ℝ) (β u0 Δ : ℝ)
(hβ : 0 < β) (hΔ : 0 ≤ Δ) (hord : Antitone fun i : Fin N => α i - β * c i) :
∃ V : ℝ,
IsLUB {x | ∃ (S : Finset (Fin N)) (p : Fin N → ℝ), x = profit S α c β u0 Δ p} V ∧
∃ n : ℕ, 1 ≤ n ∧ n ≤ N ∧
IsLUB {x | ∃ p : Fin N → ℝ, x = profit (ordAssort N n) α c β u0 Δ p} V ∧
((∃ (S : Finset (Fin N)) (p : Fin N → ℝ), profit S α c β u0 Δ p = V) →
∃ p : Fin N → ℝ, profit (ordAssort N n) α c β u0 Δ p = V) := by sorry
end ThresholdMNL.Pricing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.