Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 4.1, p. 16 — if pT≤pSp_T\le p_SpT​≤pS​ and gT(ωT)>gT(ωS)g_T(\omega_T)>g_T(\omega_S)gT​(ωT​)>gT​(ωS​), then qT>qSq_T>q_SqT​>qS​

Proved
EngagementOpt.Misalign.thm_4_1_step_q

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

behavioral-economicsengagementp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1recommender-systems

This is the first step of the proof of Theorem 4.1.

Let ωS=(pS,qS,vˉS)\omega_S=(p_S,q_S,\bar v_S)ωS​=(pS​,qS​,vˉS​) and ωT=(pT,qT,vˉT)\omega_T=(p_T,q_T,\bar v_T)ωT​=(pT​,qT​,vˉT​) be two points of Ω=[0,1)×[0,1)×R+\Omega=[0,1)\times[0,1)\times\mathbb R_+Ω=[0,1)×[0,1)×R+​, and let gT(ω)=11−q+p1−pg_T(\omega)=\frac1{1-q}+\frac{p}{1-p}gT​(ω)=1−q1​+1−pp​. If

pT≤pSandgT(ωT)>gT(ωS),p_T\le p_S\qquad\text{and}\qquad g_T(\omega_T)>g_T(\omega_S),pT​≤pS​andgT​(ωT​)>gT​(ωS​),

then

qT>qS.q_T>q_S.qT​>qS​.

In words: if the engagement-maximizing content is not more moreish, its higher engagement must come from a longer span. No maximizer hypothesis is needed for this step.

Preamble
import Mathlib
import Definitions.Def_EngagementOpt_Misalign_Model
Formal statement
namespace EngagementOpt.Misalign

/-- Proof of Theorem 4.1, p. 16: for `ω_S, ω_T ∈ Ω`, if `p_T ≤ p_S` and
`g_T(ω_T) > g_T(ω_S)`, then `q_T > q_S`. -/
theorem thm_4_1_step_q (ωS ωT : Params) (hS : InOmega ωS) (hT : InOmega ωT)
    (hp : ωT.p ≤ ωS.p) (hgT : gT ωS < gT ωT) :
    ωS.q < ωT.q := by sorry

end EngagementOpt.Misalign
Source
Kleinberg, Mullainathan, Raghavan, The Challenge of Understanding What Users Want, arXiv:2202.11776v3, p. 16, proof of Theorem 4.1 (first display)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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