Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, pairwise form, p. 13 — the w-biased experiment beats the n-biased one iff p > p̂

Proved
ExpBias.OwnBias.proposition_1_pairwise

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

biased-experimentexperimentationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-of-information

Assume the standing assumptions. Comparing only the two biased experiments σw={1,λ}\sigma_w=\{1,\lambda\}σw​={1,λ} and σn={λ,1}\sigma_n=\{\lambda,1\}σn​={λ,1}, each valued at the firm's best signal-contingent decision rule,

p>p^  ⟹  value(σn)<value(σw),p<p^  ⟹  value(σw)<value(σn).p>\hat p\implies \mathrm{value}(\sigma_n)<\mathrm{value}(\sigma_w),\qquad p<\hat p\implies \mathrm{value}(\sigma_w)<\mathrm{value}(\sigma_n).p>p^​⟹value(σn​)<value(σw​),p<p^​⟹value(σw​)<value(σn​).

This is the choice "between the w-biased and n-biased experiment" that Proposition 1 describes: a firm that would exploit without experimenting prefers the experiment whose only decisive signal is bad news. The goal of the mission strengthens it to optimality over the whole experiment set.

Formalization Note. The inequalities are strict; strictness uses 0<p<10<p<10<p<1 and λ>0\lambda>0λ>0 (that is, Λ>1\Lambda>1Λ>1).

Preamble
import Mathlib
import Definitions.Def_ExpBias_OwnBias_Model
Formal statement
namespace ExpBias.OwnBias

theorem proposition_1_pairwise (P : Params) (hP : P.Standing) :
    (pHat P < P.p → value P (nBiased P) < value P (wBiased P)) ∧
    (P.p < pHat P → value P (wBiased P) < value P (nBiased P)) := by sorry

end ExpBias.OwnBias
Source
Gans, A Synthetic Model of Disruption and Experimentation, NBER Working Paper 29091 (July 2021), p. 13 (PDF 14), §2.2, Proposition 1 and the paragraph after it; proof on p. 31 (PDF 32)
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