Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, pp. 33–34 (PDF 34–35) — at q = 0 the law is g0(0) = 1, gn(0) = 0, and the best response is π̄(0) = 1

Proved
OpaqueQueue.Equilibrium.best_response_at_zero

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

best-responsep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rational-inattention

Under the standing assumptions, take q=0q=0q=0. Then πn(0)=0\pi_n(0)=0πn​(0)=0 for all nnn, so the steady-state law (21) is the point mass at the empty system:

g0(0)=1,gn(0)=0  (n≥1),g_0(0)=1,\qquad g_n(0)=0\ \ (n\ge1),g0​(0)=1,gn​(0)=0  (n≥1),

and the customer's problem (9) under this prior has the unique solution πˉ(0)=1\bar\pi(0)=1πˉ(0)=1: a customer who is certain the system is empty joins with certainty.

This is the left endpoint of the fixed-point argument: the best response at q=0q=0q=0 lies strictly above qqq.

Formalization Note The page computes πˉ(0)\bar\pi(0)πˉ(0) through the consistency map (22); the formalization states it for the maximizer of (9), which is the best response used in the rest of the proof. Uniqueness of the maximizer at q=0q = 0q=0 uses v0>0v_0>0v0​>0, i.e. R>pR>pR>p.

Preamble
import Mathlib
import Definitions.Def_OpaqueQueue_Equilibrium_Model
Formal statement
namespace OpaqueQueue.Equilibrium
theorem best_response_at_zero (P : Params) (hS : P.Standing) : stat P 0 0 = 1 ∧ (∀ n : ℕ, 1 ≤ n → stat P 0 n = 0) ∧ ∀ x : ℝ, IsOptimal P (stat P 0) x ↔ x = 1 := by sorry
end OpaqueQueue.Equilibrium
Source
Canyakmaz & Boyacı, Opaque Queues: Service Systems with Rationally Inattentive Customers, ESMT Working Paper 18-04 (September 24, 2018), pp. 33–34 (PDF 34–35), proof of Theorem 1, Existence
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