Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, p. 14 — the core of the streaming game is C(N,v)=A(N,M,t)C(N,v)=A(N,M,t)C(N,v)=A(N,M,t)

Proved
MusicStreaming.Core.theorem_2

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

cooperative-gamescorep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-sharingstreaming-platforms

Let N={1,…,n}N=\{1,\dots,n\}N={1,…,n} be a set of artists and (N,M,t)(N,M,t)(N,M,t) a streaming problem: tij∈Nt_{ij}\in\mathbb Ntij​∈N is the number of times user j∈Mj\in Mj∈M played artist iii, and every user played some artist. Let Lj={i∈N:tij>0}L^j=\{i\in N:t_{ij}>0\}Lj={i∈N:tij​>0} be the list of user jjj, and let

v(S)=∣{j∈M:Lj⊆S}∣(S⊆N)v(S)=\bigl|\{j\in M:L^j\subseteq S\}\bigr|\qquad(S\subseteq N)v(S)=​{j∈M:Lj⊆S}​(S⊆N)

be the streaming game, whose core is C(N,v)={x∈RN:∑i∈Nxi=v(N), ∑i∈Sxi≥v(S) for every S⊆N}C(N,v)=\{x\in\mathbb R^N:\sum_{i\in N}x_i=v(N),\ \sum_{i\in S}x_i\ge v(S)\text{ for every }S\subseteq N\}C(N,v)={x∈RN:∑i∈N​xi​=v(N), ∑i∈S​xi​≥v(S) for every S⊆N}. Let A(N,M,t)A(N,M,t)A(N,M,t) be the set of vectors x=∑j∈Mxjx=\sum_{j\in M}x^jx=∑j∈M​xj where each xj∈RNx^j\in\mathbb R^Nxj∈RN is nonnegative, vanishes outside LjL^jLj and sums to 111. Then

C(N,v)=A(N,M,t).C(N,v)=A(N,M,t).C(N,v)=A(N,M,t).

In words: an allocation of the platform's revenue m=∣M∣m=|M|m=∣M∣ (each user paying 111) is in the core exactly when it splits each user's payment, in any way, among the artists that user played. In particular the user-centric rewards always lie in the core, which is the basis of the paper's core-selection characterization of the user-centric index (Theorem 3).

Formalization Note A problem is a finitely supported map t : ℕ →₀ (Fin n → ℕ) whose support is the user set MMM, so every user in MMM has a nonempty list (the paper's standing assumption) and v(∅)=0v(\emptyset)=0v(∅)=0. Artists are Fin n. The core is the published Supermodularity.Cooperative.Core Finset.univ. The statement is a set equality for every problem, including the empty one (where both sides are {0}\{0\}{0}); no hypothesis is added.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Cooperative_Core
import Definitions.Def_MusicStreaming_Core_Setting
Formal statement
namespace MusicStreaming.Core

/-- **Theorem 2** (p. 14). For every streaming problem `t`, the core `C(N, v)` of the streaming
game `v(S) = |{j ∈ M : L^j ⊆ S}|` equals the set `A(N, M, t)` of allocations that split each
user's payment of `1` among the artists that user played. -/
theorem theorem_2 {n : ℕ} (t : MusicStreaming.Axioms.Problem n) :
    Supermodularity.Cooperative.Core Finset.univ (game t) = allocSet t := by sorry

end MusicStreaming.Core
Source
Bergantiños, Moreno-Ternero, Revenue sharing at music streaming platforms, arXiv:2310.11861v1, p. 14, Theorem 2 (proof pp. 22–23)
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