Proposition 2, p. 14 — a nonempty nest of an optimal assortment earns R_i(S_i*) ≥ Z*
ProvedNestedLogitVariants.Competitive.proposition_2Assume and for every nest , and . Let be an optimal solution to the assortment problem (2), with optimal expected revenue . If the assortment offered in nest is nonempty, then the expected revenue obtained from nest , conditional on a customer choosing it, is at least the optimal expected revenue:
The proposition says that a nest worth offering anything in must earn at least the overall optimum; it is used, together with Lemma 3, to show that low-revenue products are never needed in an optimal assortment.
Formalization Note The standing assumptions of §3 (p. 13), and for every nest, are hypotheses, together with those of §1 and the disclosed pins of the model definition (, , , revenues ordered within each nest). The positivity is the section's own "without loss of generality" assumption (p. 14), stated as a hypothesis here because the argument uses it.
import Mathlib import Definitions.Def_NestedLogitVariants_Competitive_Model
namespace NestedLogitVariants.Competitive
/-- Proposition 2, p. 14: if `(S*_1, …, S*_m)` is an optimal solution to problem (2) and
`S*_i ≠ ∅`, then `R_i(S*_i) ≥ Z*`. -/
theorem proposition_2 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n) (hI : I.Standing)
(hγ : ∀ i, I.γ i ≤ 1) (hfc : ∀ i, I.vnp i = 0) (hv0 : 0 < I.v0)
(Sstar : ι → Finset (Fin n)) (hopt : IsOptimal I Sstar)
(i : ι) (hne : (Sstar i).Nonempty) :
revenue I Sstar ≤ R I i (Sstar i) := by sorry
end NestedLogitVariants.Competitive
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.