A.6, p. 53 — the optimal x̂ of (4) over the powers-of-δ candidates is nonnegative
ProvedNestedLogitVariants.PowersDelta.xh_nonnegThroughout, 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
This is the first step of the proof of Theorem 12: it lets the factor multiply in an inequality without reversing it.
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. 53: "By using the same argument at the beginning of the proof of Theorem 10, it
follows that x̂ ≥ 0." Here `(x̂, ŷ)` is an optimal solution of (4) over the candidate collections
`{Ŝ_il : l = l^L_i, …, l^U_i} ∪ {∅}`. -/
theorem xh_nonneg {ι : 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) :
0 ≤ xh := by sorry
end NestedLogitVariants.PowersDelta
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.