Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — lower bounds for both constrained optimal values

Disproved
FreemiumActions.Threshold.lemma_2

by Shuze Chen · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programmingoperations-researchp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let N≥0N\ge0N≥0 and E={0,…,N}E=\{0,\ldots,N\}E={0,…,N}. The publisher chooses a deterministic stationary policy y:E→{0,1}y:E\to\{0,1\}y:E→{0,1}. At each level the player probabilities satisfy pM+pI+pQ=qM+qQ=1p_M+p_I+p_Q=q_M+q_Q=1pM​+pI​+pQ​=qM​+qQ​=1, with all probabilities and α\alphaα in [0,1][0,1][0,1]. Removing the offer gives qM=pM+αpIq_M=p_M+\alpha p_IqM​=pM​+αpI​ and qQ=pQ+(1−α)pIq_Q=p_Q+(1-\alpha)p_IqQ​=pQ​+(1−α)pI​. Conditional on action a∈{M,I}a\in\{M,I\}a∈{M,I} the player advances one level with constant probability τa∈[0,1]\tau_a\in[0,1]τa​∈[0,1] or stays, and stays at level NNN if already there; quitting is absorbing. Assume pM,qM,αp_M,q_M,\alphapM​,qM​,α are nondecreasing, pQ,qQ,pIp_Q,q_Q,p_IpQ​,qQ​,pI​ nonincreasing, both quitting probabilities strictly positive, τI<τM\tau_I<\tau_MτI​<τM​, and 0≤μI<μM0\le\mu_I<\mu_M0≤μI​<μM​. The immediate revenues are r(e,1)=pM(e)μM+pI(e)μIr(e,1)=p_M(e)\mu_M+p_I(e)\mu_Ir(e,1)=pM​(e)μM​+pI​(e)μI​ and r(e,0)=qM(e)μMr(e,0)=q_M(e)\mu_Mr(e,0)=qM​(e)μM​, with zero revenue after quitting. Let ny(e,j)=∑t≥0(Syt)e,jn_y(e,j)=\sum_{t\ge0}(S_y^t)_{e,j}ny​(e,j)=∑t≥0​(Syt​)e,j​ and Wy(e)=∑jny(e,j)r(j,y(j))W_y(e)=\sum_j n_y(e,j)r(j,y(j))Wy​(e)=∑j​ny​(e,j)r(j,y(j)). These are Assumptions 1–4 with the standing probability and revenue conventions.

For every engagement level 1≤e≤N1\le e\le N1≤e≤N, the optimal values constrained to action 000 or 111 at every visit to eee satisfy both inequalities

W(e,y=0)≥qM(e)μM1−qM(e),W(e,y=1)≥pM(e)μM+pI(e)μI1−pM(e)−pI(e).W(e,y=0)\ge\frac{q_M(e)\mu_M}{1-q_M(e)},\qquad W(e,y=1)\ge\frac{p_M(e)\mu_M+p_I(e)\mu_I}{1-p_M(e)-p_I(e)}.W(e,y=0)≥1−qM​(e)qM​(e)μM​​,W(e,y=1)≥1−pM​(e)−pI​(e)pM​(e)μM​+pI​(e)μI​​.

Both denominators are strictly positive quitting probabilities. Choices away from eee remain optimized over all stationary policies.

Differences from the source:

  • encoding: engagement levels 0 through N, quit state −1 and controls 0 or 1 → Fin (N+1), Option with none for quitting, and Bool controls; reason: order-preserving state labels and true = offer; N=0 is retained
  • reading: increase, decrease and increasing in Assumption 3 → weak monotonicity, with quitting positivity and tauM > tauI still strict; reason: the appendix uses nondecreasing and nonincreasing comparisons
  • encoding: earns revenue, with muI < muM in Assumption 4 → 0 ≤ muI < muM; reason: makes the model’s implicit nonnegative-revenue convention explicit without normalizing either revenue
  • encoding: real expected infinite-horizon total reward and visit counts → nonnegative infinite sums in ENNReal; policy values are finite sums of visits times rewards; reason: positive quitting on the finite state set makes these values finite; no truncation, discount or conversion of an infinite value to zero is used
  • encoding: maximum over all stationary policies → indexed supremum over the finite nonempty set of all Bool-valued stationary policies; reason: a finite nonempty set of values has an attained maximum
  • reading: prose defines constrained stationary values while the second line of (27) uses the unconstrained continuation value in a self-loop → constrain the stationary action on every visit to e; reason: matches the prose on p. 17 and the resolved self-loop formulas in the proof on p. 32; it is not a one-step deviation
Preamble
import Definitions.Def_FreemiumActions_Threshold_Values
Formal statement
namespace FreemiumActions.Threshold

theorem lemma_2 {N : ℕ} (d : Data N) (h : Assumptions14 d)
    (e : Level N) (he : 1 ≤ e.val) :
    ENNReal.ofReal (d.qM e * d.muM / (1 - d.qM e)) ≤ constrainedValue d e false ∧
    ENNReal.ofReal ((d.pM e * d.muM + d.pI e * d.muI) /
      (1 - d.pM e - d.pI e)) ≤ constrainedValue d e true := by sorry

end FreemiumActions.Threshold
Source
Sheng, Ryan and Nagarajan, Incentivized actions in freemium games, supplied source.pdf dated October 8, 2016, A.4, Lemma 2, p. 32 (PDF p. 32), under Theorem 1’s Assumptions 1–4; catalog DOI 10.1287/msom.2020.0925.
Human review
  • Endorsed by Community (Bot) · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 29, 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