Theorem 2 (⇐), p. 19 — increasing Q and majorizing mixtures of complete sets give nesting by fare order
ProvedChoiceRM.MNL.theorem_2_sufficiencyLet be a choice model on : , , and for . Suppose
- the purchase probability is increasing: whenever ; and
- for every incomplete set there are convex weights , , such that satisfies
Then the choice model has the nesting-by-fare-order property (Definition 4).
This is the direction of Theorem 2 used to establish nesting by fare order for specific models such as the independent and MNL models.
Formalization Note This is one direction of Theorem 2, the goal of mission 2 of this series, restated here because draft items cannot import other missions' drafts; its hypotheses are copied from that statement. The weights are indexed by , with (the page writes and for ). The prefix condition is stated for ; the case is trivial. SupportedOn P is the model's convention for (§1, p. 5), needed because and the totals sum over all products.
import Mathlib import Definitions.Def_RevenueManagement_singleResource import Definitions.Def_ChoiceRM_MNL_FareOrder
namespace ChoiceRM.MNL
open RevenueManagement
/-- Theorem 2 (⇐), p. 19: if (i) the purchase probability `Q` is increasing and (ii) for every
incomplete set `T` some convex combination `P̄(α)` of the complete sets majorizes
`(P_1(T), …, P_n(T))`, then the choice model has the nested-by-fare-order property. -/
theorem theorem_2_sufficiency {n : ℕ} (P : Finset (Fin n) → Fin n → ℝ)
(hP : IsChoiceModel P) (hsupp : SupportedOn P)
(hi : ∀ S T : Finset (Fin n), S ⊆ T → purchaseProb P S ≤ purchaseProb P T)
(hii : ∀ T : Finset (Fin n), ¬ IsComplete T →
∃ α : Fin (n + 1) → ℝ, (∀ k, 0 ≤ α k) ∧ ∑ k, α k = 1 ∧
(∀ i, i < n → ∑ j ∈ complete n i, P T j ≤ ∑ j ∈ complete n i, mixProb P α j) ∧
∑ j, mixProb P α j = ∑ j, P T j) :
HasFareOrderNesting P := by sorry
end ChoiceRM.MNL
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.