Theorem 1(b), p. 12 — H(z) = sup_r H(r; z) is finite and has a unique fixed point; strictly decreasing (added hypothesis S ≠ ∅)
ProvedCrossSell.Pricing.H_fixed_pointConsider the sequential multinomial logit model with main offer set , secondary sets (), utilities and costs , and finitely many secondary products. For a secondary price vector and let
and . Then:
- for every , the set is bounded above, so is a finite real number;
- the equation has exactly one real solution;
- if , then is strictly decreasing in .
This is the fixed-point part of Theorem 1(b) together with the theorem's final sentence. The unique fixed point is the quantity that Theorem 1(b) identifies with the optimal total profit; its existence and uniqueness make the scalar search (e.g. bisection) the paper describes well defined.
Formalization Note. The paper's is a real supremum here, and clause 1 asserts its finiteness. Clause 3 carries the hypothesis , which the page does not state: for , is constant in , so the printed claim fails in that degenerate case. Clauses 1 and 2 hold for every , including .
import Mathlib import Definitions.Def_CrossSell_Pricing_Model
namespace CrossSell.Pricing
theorem H_fixed_point {ι κ : Type*} [Fintype κ] (S : Finset ι) (T : Option ι → Finset κ)
(u c : ι → ℝ) (s : κ → ℝ) (v : Option ι → κ → ℝ) :
(∀ z : ℝ, BddAbove (Set.range fun r : κ → ℝ => Hr S T u c s v r z)) ∧
(∃! z : ℝ, z = Hmax S T u c s v z) ∧
(S.Nonempty → StrictAnti (Hmax S T u c s v)) := by sorry
end CrossSell.Pricing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.