Appendix, proof of Theorem 1(a), p. 18 — an additive index is the sum of its values on the one-user problems
ProvedMusicStreaming.Axioms.additive_decompositionLet be an index satisfying additivity. Then for every problem and every artist ,
where is the problem with the single user and that user's profile .
This reduces any additive index to its values on one-user problems, which is the first step of the "only if" direction of Theorem 1(a).
Formalization Note Only additivity is assumed; on the empty problem both sides are (additivity applied to gives ). Artists are indexed (index is the paper's artist ). Users are named by natural numbers, and a problem is a finitely supported table whose support is the user set ; so every user in has played some artist (, the paper's standing assumption, p. 19), streams are natural numbers, and the problem with and is with column erased.
import Mathlib import Definitions.Def_MusicStreaming_Axioms_Setting
namespace MusicStreaming.Axioms
theorem additive_decomposition {n : ℕ} (I : Index n) (hA : Additivity I) :
∀ (t : Problem n) (i : Fin n), I t i = ∑ j ∈ t.support, I (Finsupp.single j (t j)) i := by sorry
end MusicStreaming.Axioms
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.