Theorem 1 — the optimal choice probability in closed form
ProvedHumanMachine.Alone.theorem_1For every information cost , let and . For every prior , every strategy that maximizes expected accuracy less entropy cost has the unconditional probability of choosing the good-state action given by
The thresholds satisfy . For fixed , the optimal probability is non-decreasing in on . As increases over positive values, increases strictly and 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 , 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.
import Mathlib import Definitions.Def_HumanMachine_Alone_model
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.