Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7 (ii) — the threshold τ~\tilde\tauτ~ is larger when ADX2 is less efficient (σ\sigmaσ smaller)

Proved
AdDataSharing.Topics.proposition_7_ii

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

comparative-staticsonline-advertisingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1topics-api

Throughout, α∈(0,12)\alpha\in(0,\tfrac12)α∈(0,21​), 0<w<C<M<2C0<w<C<M<2C0<w<C<M<2C, φ∈(0,1)\varphi\in(0,1)φ∈(0,1), η2>0\eta_2>0η2​>0, τ>1\tau>1τ>1 and 0≤σ<10\le\sigma<10≤σ<1 (the standing assumptions of the model). Let τ~(σ)\tilde\tau(\sigma)τ~(σ) denote the (corrected) threshold of Proposition 5,

τ~(σ)=(1+η2)−σ(1−α)w(1+η2) C+σ(1−α)1+η2,\tilde\tau(\sigma)=\frac{(1+\eta_2)-\sigma(1-\alpha)}{w(1+\eta_2)}\,C+\frac{\sigma(1-\alpha)}{1+\eta_2},τ~(σ)=w(1+η2​)(1+η2​)−σ(1−α)​C+1+η2​σ(1−α)​,

with all other parameters fixed. If 0≤σ′<σ0\le\sigma'<\sigma0≤σ′<σ, then

τ~(σ)<τ~(σ′).\tilde\tau(\sigma)<\tilde\tau(\sigma').τ~(σ)<τ~(σ′).

A less efficient rival exchange (smaller reach σ\sigmaσ of retargeting on ADX2ADX_2ADX2​) widens the range of inaccuracies τ\tauτ for which both advertisers bid on ADX1ADX_1ADX1​.

Formalization Note The paper writes "the threshold τ^\hat\tauτ^", a slip for τ~\tilde\tauτ~, and its proof differentiates the printed (6). For the corrected threshold the slope in σ\sigmaσ is (1−α)(1−C/w)/(1+η2)<0(1-\alpha)(1-C/w)/(1+\eta_2)<0(1−α)(1−C/w)/(1+η2​)<0; the statement is the strict monotonicity, not the derivative.

Preamble
import Mathlib
import Definitions.Def_AdDataSharing_Topics_Model
Formal statement
namespace AdDataSharing.Topics

theorem proposition_7_ii (P : Params) (hP : P.Standing) (σ' : ℝ) (hσ'0 : 0 ≤ σ')
    (hσ' : σ' < P.σ) :
    tauTilde P < tauTilde { P with σ := σ' } := by sorry

end AdDataSharing.Topics
Source
Johnson, Jungbauer, Preuss, Online Advertising, Data Sharing, and Consumer Control, SSRN 3898798 (Nov. 2, 2022), p. 19, Proposition 7 (ii) ("ˆτ" read as τ̃; threshold corrected); proof Appendix p. 30
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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