A.6, p. 54 — the scaled solution satisfies the constraint of (3) for the empty assortment
ProvedNestedLogitVariants.PowersDelta.empty_caseThroughout, the instance satisfies the standing assumptions of §1, there is at least one product (), satisfies (the standing assumption of §6, p. 25), and . Let be an optimal solution of problem (4) when the candidate collection of nest is , and the assortments have the two properties of p. 28: whenever problem (15) at level is feasible, is feasible for it and . Then for every nest ,
This is the second case of the proof of Theorem 12. Here and .
Formalization Note The assortments enter as an arbitrary family with the two properties of p. 28 (IsPowersFamily): the statement holds for every such family, which includes the one Proposition 15 constructs. A level with no feasible assortment imposes nothing on . Optimality of for (4) is feasibility plus minimality of among feasible points. is passed as the greatest element of , so there is at least one nest.
import Mathlib import Definitions.Def_NestedLogitVariants_PowersDelta_Levels
namespace NestedLogitVariants.PowersDelta
/-- A.6, p. 54: for the empty assortment of nest `i`,
`δ^{γ̄+1} ŷ_i ≥ V_i(∅)^{γ_i} (R_i(∅) − δ^{2γ̄+1} x̂)`. -/
theorem empty_case {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} [NeZero n] (I : Instance ι n)
(hI : I.Standing) (γbar : ℝ) (hγbar : IsGreatest (Set.range I.γ) γbar) (hγbar1 : 1 < γbar)
(δ : ℝ) (hδ : 1 < δ)
(Sh : ι → ℤ → Finset (Fin n)) (hSh : IsPowersFamily I δ Sh)
(xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (powersCandidates I δ Sh) xh yh)
(i : ι) :
nestWeight I i ∅ * (R I i ∅ - δ ^ (2 * γbar + 1) * xh) ≤ δ ^ (γbar + 1) * yh i := by sorry
end NestedLogitVariants.PowersDelta
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.