§3, p. 15 — every product j ∈ S_i* of an optimal assortment has r_ij ≥ γ_i Z* + (1 − γ_i) R_i(S_i*)
ProvedNestedLogitVariants.Competitive.revenue_threshold_of_optimalAssume and for every nest , and . Let be an optimal solution to the assortment problem (2), with optimal expected revenue . Then every product offered in nest , , satisfies
This is the "useful implication of Proposition 2 and Lemma 3" observed after Lemma 3: if some offered product violated the threshold, it could be removed for a strictly larger revenue. It is the inequality the proof of Theorem 4 uses for the product that is exchanged.
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
/-- The observation after Lemma 3, p. 15: if `(S*_1, …, S*_m)` is optimal for problem (2),
then `r_ij ≥ γ_i Z* + (1 − γ_i) R_i(S*_i)` for every `j ∈ S*_i`. -/
theorem revenue_threshold_of_optimal {ι : 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 : ι) (j : Fin n) (hj : j ∈ Sstar i) :
I.γ i * revenue I Sstar + (1 - I.γ i) * R I i (Sstar i) ≤ I.r i j := by sorry
end NestedLogitVariants.Competitive
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.