Theorem 2 — existence of an optimal forward threshold policy
DisprovedFreemiumActions.Threshold.theorem_2Let and . The publisher chooses a deterministic stationary policy . At each level the player probabilities satisfy , with all probabilities and in . Removing the offer gives and . Conditional on action the player advances one level with constant probability or stays, and stays at level if already there; quitting is absorbing. Assume are nondecreasing, nonincreasing, both quitting probabilities strictly positive, , and . The immediate revenues are and , with zero revenue after quitting. Let and . These are Assumptions 1–4 with the standing probability and revenue conventions.
Assume further , the adjacent-pair inequalities for , and precisely the printed Assumption 7:
The source asserts that there exist one stationary policy and a cutoff such that
The same policy works for every starting level, against every stationary competitor. No uniqueness or tie-breaking is asserted. The printed Assumption 7 excludes ; the resulting counterexample is retained in the source findings rather than repaired in this target.
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
- reading: Assumption 6 says all e in E although e+1 is undefined at N → all adjacent pairs e,f in E with f=e+1; reason: states precisely the domain where the printed expression is defined
- encoding: threshold cutoff e* from −1 through N → initial-segment length k in Fin (N+2), offering exactly when e<k; reason: k=e*+1 preserves both boundary policies and both sides of the cutoff
import Definitions.Def_FreemiumActions_Threshold_ThresholdPolicy
namespace FreemiumActions.Threshold
theorem theorem_2 {N : ℕ} (d : Data N) (h : Assumptions17 d) :
∃ y : Policy N, IsOptimal d y ∧ IsThreshold y := by sorry
end FreemiumActions.Threshold
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.