Theorem 2, p. 14 — the core of the streaming game is
ProvedMusicStreaming.Core.theorem_2Let be a set of artists and a streaming problem: is the number of times user played artist , and every user played some artist. Let be the list of user , and let
be the streaming game, whose core is . Let be the set of vectors where each is nonnegative, vanishes outside and sums to . Then
In words: an allocation of the platform's revenue (each user paying ) 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 , so every user in has a nonempty list (the paper's standing assumption) and . 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 ); no hypothesis is added.
import Mathlib import Definitions.Def_Supermodularity_Cooperative_Core import Definitions.Def_MusicStreaming_Core_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.