Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2 — λO(δ)\lambda^O(\delta)λO(δ) and λU(δ)\lambda^U(\delta)λU(δ) have a unique crossing point λ^\hat\lambdaλ^

Proved
QueueSignal.unique_crossing

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

game-theoryp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1queueingsignaling-gamesstrategic-customers

Let μ,θ>0\mu,\theta>0μ,θ>0, VH>VL>θ/μV_H>V_L>\theta/\muVH​>VL​>θ/μ, 0<δ<10<\delta<10<δ<1, and fix a belief d∈[0,1]d\in[0,1]d∈[0,1]. Regard the effective arrival rates λO(d)\lambda^O(d)λO(d) of (1) and λU(d)\lambda^U(d)λU(d) of (3) as functions of the potential arrival rate λ>0\lambda>0λ>0. Then there is exactly one λ^>0\hat\lambda>0λ^>0 with

λO(d)∣λ=λ^=λU(d)∣λ=λ^,\lambda^O(d)\big|_{\lambda=\hat\lambda}=\lambda^U(d)\big|_{\lambda=\hat\lambda},λO(d)​λ=λ^​=λU(d)​λ=λ^​,

and moreover λO(d)<λU(d)\lambda^O(d)<\lambda^U(d)λO(d)<λU(d) for 0<λ<λ^0<\lambda<\hat\lambda0<λ<λ^, while λO(d)>λU(d)\lambda^O(d)>\lambda^U(d)λO(d)>λU(d) for λ>λ^\lambda>\hat\lambdaλ>λ^.

At d=δd=\deltad=δ this is the crossing point λ^\hat\lambdaλ^ of Proposition 1: below it a server facing customers who hold the prior belief prefers to conceal its queue, above it to reveal it.

Formalization Note The crossing point is asserted to exist and be unique among positive λ\lambdaλ; it is not a parameter.

Differences from the source:

  • generalization: the unique crossing point of λ^O(δ) and λ^U(δ) (at the prior δ) → the same for every belief d ∈ [0, 1]; reason: d = δ is the source's statement
  • generalization: "unique crossing point" → existence and uniqueness of the crossing, plus λ^O < λ^U on (0, λ̂) and λ^O > λ^U on (λ̂, ∞); reason: the sign clauses are what "crossing" means and what p.549 uses ("the server prefers to conceal the queue if λ^U(δ) > λ^O(δ) and to reveal it otherwise"); dropping them gives the printed statement
  • encoding: n(δ^R) = ⌊[δ^R V_H + (1 − δ^R)V_L]µ/θ⌋ − 1 used as a summation bound → computed in ℤ and converted with Int.toNat; reason: under V_L > θ/µ and a belief in [0, 1] it is ≥ 0, so the conversion changes no instance
Preamble
import Mathlib
import Definitions.Def_QueueSignal_SignalingGame
import Definitions.Def_QueueSignal_QueueModel
Formal statement
namespace QueueSignal

/-- **The unique crossing point `λ̂`** (Guo, Haviv, Luo, Wang, *Signaling Service Quality Through Queue Disclosure*, MSOM 25(2) (2023),
doi:10.1287/msom.2022.1170, §4.2, p.549, PDF p.8: "We denote the unique
crossing point of `λ^O(δ)` and `λ^U(δ)` as `λ̂`").

For every belief `d ∈ [0, 1]` (in particular the prior `δ`), the functions `λ ↦ λ^O(λ, d)` and
`λ ↦ λ^U(λ, d)` on `(0, ∞)` cross exactly once, at some `λ̂ > 0`; below `λ̂` concealing gives the
larger effective arrival rate (`λ^O < λ^U`), above it revealing does (`λ^O > λ^U`). -/
theorem unique_crossing (P : Params) (hP : P.Valid) (d : ℝ) (hd0 : 0 ≤ d) (hd1 : d ≤ 1) :
    ∃ lhat : ℝ, 0 < lhat ∧ lamO P lhat d = lamU P lhat d ∧
      (∀ lam : ℝ, 0 < lam → lamO P lam d = lamU P lam d → lam = lhat) ∧
      (∀ lam : ℝ, 0 < lam → lam < lhat → lamO P lam d < lamU P lam d) ∧
      (∀ lam : ℝ, lhat < lam → lamU P lam d < lamO P lam d) := by sorry

end QueueSignal
Source
Guo, Haviv, Luo, Wang, Signaling Service Quality Through Queue Disclosure, MSOM 25(2) (2023), doi:10.1287/msom.2022.1170, §4.2, paragraph before Proposition 1, p.549
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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