(20), Appendix A.1, Case 1.a, pp. 41–42 — the inequality with α¹_ik = R_i(N_i,k−1)/R_i(N_ik)
ProvedNestedLogitVariants.Synergistic.ineq_20Let be an optimal solution of (4) over the nested-by-revenue assortments for an instance with fully-captured nests and positive revenues. Fix a nest , an index with and , write , and
Then
The right side is the objective of (8) at the fractional nested-by-revenue vector with , , evaluated at ; (20) is the first of the two bounds combined in the proof of Theorem 7.
Formalization Note The standing assumptions are those of the model (see the Model definition) and of §4: every nest is fully captured, , and for some nest (p. 16). The positive revenues are the disclosed pin of this mission: they keep every denominator , , of (6) positive. Product of the page (indexed from ) is ⟨k - 1, _⟩ : Fin n; and are the sums over .
import Mathlib import Definitions.Def_NestedLogitVariants_Synergistic_Relaxation
namespace NestedLogitVariants.Synergistic
/-- Inequality (20), Appendix A.1, Case 1.a, pp. 41–42: for `2 ≤ k ≤ n` and `ρ ∈ [0, 1]`, with
`α¹_{ik} = R_i(N_{i,k−1}) / R_i(N_{ik})`,
`α¹_{ik} ŷ_i ≥ (q_{i,k−1} + v_{ik} ρ)^{γ_i} [(R_{i,k−1} + r_{ik} v_{ik} ρ)/(q_{i,k−1} + v_{ik} ρ) − α¹_{ik} x̂]`.
Product `k` (1-based) is `⟨k - 1, _⟩ : Fin n`. -/
theorem ineq_20 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
(hI : I.Standing) (hfc : ∀ i, I.vnp i = 0) (hsyn : ∃ i, 1 < I.γ i)
(hr : ∀ i j, 0 < I.r i j)
(xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (fun _ => {S | ∃ j ≤ n, S = nbr n j}) xh yh)
(i : ι) (k : ℕ) (hk2 : 2 ≤ k) (hkn : k ≤ n) (ρ : ℝ) (hρ : ρ ∈ Set.Icc (0 : ℝ) 1) :
(R I i (nbr n (k - 1)) / R I i (nbr n k)) * yh i ≥
(qsum I i (k - 1) + I.v i ⟨k - 1, by omega⟩ * ρ) ^ I.γ i *
((Rsum I i (k - 1) + I.r i ⟨k - 1, by omega⟩ * I.v i ⟨k - 1, by omega⟩ * ρ) / (qsum I i (k - 1) + I.v i ⟨k - 1, by omega⟩ * ρ) -
(R I i (nbr n (k - 1)) / R I i (nbr n k)) * xh) := by sorry
end NestedLogitVariants.Synergistic
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.