Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 41 (PDF 42) — for c_ad < min{p², p(1−p)}: (1−p)²/2 < c^max_click(c_ad, p) < (1−p)/2

Proved
TargetGranularity.SdVsMd.lemma_6

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1targeted-advertisingthreshold-inequality

Let 0<p<10<p<10<p<1 and 0<cad<min⁡{p2,p(1−p)}0<c_{ad}<\min\{p^2,p(1-p)\}0<cad​<min{p2,p(1−p)}, and let cclickmax(cad,p)c^{max}_{click}(c_{ad},p)cclickmax​(cad​,p) be the threshold of Equation (7). Then

(1−p)22<cclickmax(cad,p)<1−p2.\frac{(1-p)^2}{2}<c^{max}_{click}(c_{ad},p)<\frac{1-p}{2}.2(1−p)2​<cclickmax​(cad​,p)<21−p​.

In this range Equation (7) is in its third case, cad2−3cad(1−p)p+3(1−p)2p26p(p(1−p)(1+p)−cad)\frac{c_{ad}^2-3c_{ad}(1-p)p+3(1-p)^2p^2}{6p(p(1-p)(1+p)-c_{ad})}6p(p(1−p)(1+p)−cad​)cad2​−3cad​(1−p)p+3(1−p)2p2​. The lemma places the md existence threshold inside the interval of click costs on which Lemma 4 controls the sd profit, which is how Lemmas 4 and 5 combine into Proposition 3.

Formalization Note cad>0c_{ad}>0cad​>0 is the model's standing assumption (p. 10). All denominators of the third case are positive in this range.

Preamble
import Mathlib
import Definitions.Def_TargetGranularity_SdVsMd_Model
Formal statement
namespace TargetGranularity.SdVsMd

/-- Lemma 6, p. 41: for `0 < c_ad < min{p², p(1 − p)}`,
`(1 − p)²/2 < c^max_click(c_ad, p) < (1 − p)/2`. -/
theorem lemma_6 (p cad : ℝ) (hp0 : 0 < p) (hp1 : p < 1) (hcad : 0 < cad)
    (hcadp2 : cad < p ^ 2) (hcadp1 : cad < p * (1 - p)) :
    (1 - p) ^ 2 / 2 < cmaxClick cad p ∧ cmaxClick cad p < (1 - p) / 2 := by sorry

end TargetGranularity.SdVsMd
Source
Despotakis & Yu, Multidimensional Targeting and Consumer Response, SSRN 3900394 (version of October 11, 2022), p. 41 (PDF 42), Lemma 6
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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