Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — the difference between Bayesian and DeGroot cutoffs

Proved
PostTruth.Regimes.threshold_gap

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

misinformationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1social-learning

For 1/2<p≤11/2<p\leq11/2<p≤1 and 0<q<1/20<q<1/20<q<1/2, let d=(2p−1)(1−q)/qd=(2p-1)(1-q)/qd=(2p−1)(1−q)/q be the two-narrative gap and let r~L=(1−2(1−q)(1−p))/(2q)\widetilde r_L=(1-2(1-q)(1-p))/(2q)rL​=(1−2(1−q)(1−p))/(2q) be the DeGroot cutoff when the true state is LLL. Then

d−r~L=2p(1−q)−12q,d−r~L=0  ⟺  q=q∗=2p−12p,d−r~L<0  ⟺  q>q∗.d-\widetilde r_L=\frac{2p(1-q)-1}{2q}, \qquad d-\widetilde r_L=0\iff q=q^*=\frac{2p-1}{2p}, \qquad d-\widetilde r_L<0\iff q>q^*.d−rL​=2q2p(1−q)−1​,d−rL​=0⟺q=q∗=2p2p−1​,d−rL​<0⟺q>q∗.

The right-hand expression is strictly decreasing as a function of positive qqq. This identity locates the change in the ordering of the two societies' mislearning cutoffs.

Preamble
import Mathlib
import Definitions.Def_PostTruth_Regimes_Model
Formal statement
namespace PostTruth.Regimes

/-- The displayed cutoff difference in the proof of Theorem 1, p. 20. -/
theorem threshold_gap (p q : ℝ) (hpq : Standing p q) :
    gap p q - rTilde p q = (2 * p * (1 - q) - 1) / (2 * q) ∧
    (gap p q - rTilde p q = 0 ↔ q = qStar p) ∧
    (gap p q - rTilde p q < 0 ↔ qStar p < q) ∧
    StrictAntiOn (fun t : ℝ => (2 * p * (1 - t) - 1) / (2 * t))
      (Set.Ioi 0) := by sorry

end PostTruth.Regimes
Source
Mostagir & Siderius, Learning in a Post-Truth World, SSRN working paper 3879174 (version of 2 July 2021), p. 20, proof of Theorem 1 (displayed cutoff difference); https://ssrn.com/abstract=3879174
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