Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 13; Appendix, pp. 21–22 — the user-centric index satisfies reasonable lower bound and click-fraud-proofness

Proved
MusicStreaming.Axioms.userCentric_rlb_cfp

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

click-fraudp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-sharinguser-centric

The user-centric index UUU satisfies

  1. reasonable lower bound: for every problem and every set of users C⊆MC\subseteq MC⊆M, with LC=⋃j∈CLjL^C=\bigcup_{j\in C}L^jLC=⋃j∈C​Lj,
∑i∈LCRiU(N,M,t) ≥ ∣C∣;\sum_{i\in L^C}R^U_i(N,M,t)\ \ge\ |C| ;i∈LC∑​RiU​(N,M,t) ≥ ∣C∣;
  1. click-fraud-proofness: if (N,M,t)(N,M,t)(N,M,t) and (N,M,t′)(N,M,t')(N,M,t′) have the same users and tij′=tij′′t_{ij'}=t'_{ij'}tij′​=tij′′​ for all j′∈M∖{j}j'\in M\setminus\{j\}j′∈M∖{j} and all iii, then for every artist iii
∣RiU(N,M,t)−RiU(N,M,t′)∣≤1.\bigl|R^U_i(N,M,t)-R^U_i(N,M,t')\bigr|\le 1 .​RiU​(N,M,t)−RiU​(N,M,t′)​≤1.

Here RiU=Ui/∑i′Ui′⋅mR^U_i=U_i/\sum_{i'}U_{i'}\cdot mRiU​=Ui​/∑i′​Ui′​⋅m is the reward. These are the two axioms of §3 by which the paper separates the user-centric index from pro-rata.

Formalization Note "C⊂MC\subset MC⊂M" is read as C⊆MC\subseteq MC⊆M.

Preamble
import Mathlib
import Definitions.Def_MusicStreaming_Axioms_Setting
Formal statement
namespace MusicStreaming.Axioms

theorem userCentric_rlb_cfp {n : ℕ} :
    ReasonableLowerBound (userCentric (n := n)) ∧ ClickFraudProof (userCentric (n := n)) := by sorry

end MusicStreaming.Axioms
Source
Bergantiños, Moreno-Ternero, Revenue sharing at music streaming platforms, arXiv:2310.11861v1, p. 13 (claim after click-fraud-proofness) and pp. 21–22, Appendix, "Reasonable lower bound and click-fraud-proofness"
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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