Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1 — the optimal choice probability in closed form

Proved
HumanMachine.Alone.theorem_1

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

information-theoryoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rational-inattention

For every information cost λ>0\lambda>0λ>0, let μ‾=1/(e1/λ+1)\underline\mu=1/(e^{1/\lambda}+1)μ​=1/(e1/λ+1) and μ‾=e1/λ/(e1/λ+1)\overline\mu=e^{1/\lambda}/(e^{1/\lambda}+1)μ​=e1/λ/(e1/λ+1). For every prior 0<μ<10<\mu<10<μ<1, every strategy that maximizes expected accuracy less entropy cost has the unconditional probability p⋆p^\starp⋆ of choosing the good-state action given by

p⋆(μ)={0,μ≤μ‾,μ1−e−1/λ−1−μe1/λ−1,μ‾<μ<μ‾,1,μ≥μ‾.p^\star(\mu)=\begin{cases} 0,&\mu\le\underline\mu,\\ \dfrac{\mu}{1-e^{-1/\lambda}}-\dfrac{1-\mu}{e^{1/\lambda}-1},&\underline\mu<\mu<\overline\mu,\\ 1,&\mu\ge\overline\mu. \end{cases}p⋆(μ)=⎩⎨⎧​0,1−e−1/λμ​−e1/λ−11−μ​,1,​μ≤μ​,μ​<μ<μ​,μ≥μ​.​

The thresholds satisfy μ‾<1/2<μ‾\underline\mu<1/2<\overline\muμ​<1/2<μ​. For fixed λ\lambdaλ, the optimal probability is non-decreasing in μ\muμ on (0,1)(0,1)(0,1). As λ\lambdaλ increases over positive values, μ‾\underline\muμ​ increases strictly and μ‾\overline\muμ​ decreases strictly.

This is the baseline choice rule used in the paper's later machine-input comparisons.

Formalization Note Optimality is over every pair of conditional choice probabilities in [0,1]2[0,1]^2[0,1]2, using the paper's §4 reduction of problem (2). The closed-form function is only the right-hand side of the theorem, not the definition of an optimal probability. The printed wording “that solves (4), (5) and (6)” is read in the context of the optimal decision problem; those equations alone also admit endpoint solutions.

Preamble
import Mathlib
import Definitions.Def_HumanMachine_Alone_model
Formal statement
namespace HumanMachine.Alone

theorem theorem_1 :
    (∀ lam : ℝ, 0 < lam →
      (∀ mu : ℝ, mu ∈ Set.Ioo (0 : ℝ) 1 →
        ∀ pg pb : ℝ, IsOptimal lam mu pg pb → choiceProb mu pg pb = pClosed lam mu) ∧
      muLow lam < (1 / 2 : ℝ) ∧ (1 / 2 : ℝ) < muHigh lam ∧
      MonotoneOn (pClosed lam) (Set.Ioo (0 : ℝ) 1)) ∧
    StrictMonoOn muLow (Set.Ioi (0 : ℝ)) ∧
    StrictAntiOn muHigh (Set.Ioi (0 : ℝ)) := by sorry

end HumanMachine.Alone
Source
Boyacı, Canyakmaz & de Véricourt, Human and Machine: The Impact of Machine Input on Decision-Making Under Cognitive Limitations, ESMT Working Paper 20-02 (Nov. 30, 2020), p. 12 (PDF p. 13), Theorem 1, equation (11), and p. 32 (PDF p. 33), proof.
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me