Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (25) and footnote 2, p. 34 (PDF 35) — φn(π; θ) is decreasing in n

Proved
OpaqueQueue.Equilibrium.phi_strictAnti

by mikedeng1 · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rational-inattention

Under the standing assumptions, fix x∈[0,1]x\in[0,1]x∈[0,1] and let

φn(x;θ)=evn/θ−1x evn/θ+1−x,n≥0,(25)\varphi_n(x;\theta) = \frac{e^{v_n/\theta}-1}{x\,e^{v_n/\theta}+1-x},\qquad n\ge0, \tag{25}φn​(x;θ)=xevn​/θ+1−xevn​/θ−1​,n≥0,(25)

so that ∂f(x;q)/∂x=θ∑ngn(q)φn(x;θ)\partial f(x;q)/\partial x = \theta\sum_n g_n(q)\varphi_n(x;\theta)∂f(x;q)/∂x=θ∑n​gn​(q)φn​(x;θ). Then n↦φn(x;θ)n\mapsto\varphi_n(x;\theta)n↦φn​(x;θ) is strictly decreasing.

Together with Lemma 2, this is what makes the marginal value of joining smaller under a stochastically larger queue, hence the best response decreasing.

Formalization Note The paper says "decreasing"; the strict version is stated, which holds because C>0C>0C>0 makes vnv_nvn​ strictly decreasing.

Preamble
import Mathlib
import Definitions.Def_OpaqueQueue_Equilibrium_Model
Formal statement
namespace OpaqueQueue.Equilibrium
theorem phi_strictAnti (P : Params) (hS : P.Standing) (x : ℝ) (hx : x ∈ Set.Icc (0 : ℝ) 1) : StrictAnti (phi P x) := by sorry
end OpaqueQueue.Equilibrium
Source
Canyakmaz & Boyacı, Opaque Queues: Service Systems with Rationally Inattentive Customers, ESMT Working Paper 18-04 (September 24, 2018), p. 34 (PDF 35), eq. (25), the sentence following it, and footnote 2
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me