AFTD Auto-Formalizing Theoretical Domains

spi_two_point_max_low

lemmaverified

If T <= E[X], a two-point player's optimal acceptance probability is 1 and its contribution is E[X].

Statement

lemma spi_two_point_max_low (h l q T : ℝ) (hT : T ≤ q * h + (1 - q) * l) :
    spi_two_point_max_prob h l q T = 1 ∧ spi_two_point_max_value h l q T = q * h + (1 - q) * l
Source
step towards strategic_prophet_no_half_robust_static_threshold (no static threshold is 1/2-robust, open in Intrinsic Robustness of Prophet Inequality to Strategic Reward Signaling, NeurIPS 2024 (arXiv:2409.18269), Remark 4.1 and Sec. 6)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • spi_two_point_max_probProposition 3.1 for a two-point reward (h with probability q, else l): the largest acceptance probability achievable under threshold T (1…
  • spi_two_point_max_valueThe searcher's expected reward from a two-point player using an optimal scheme (E[X] if T <= E[X], T times the pooling probability if E[X]…
Used by 1
  • spx_searcher_payoff_leIn the four-player instance, for every static threshold T, every S >= 2 and every equilibrium, the searcher's expected payoff is at most…

Lean source view module on GitHub

/-- Below the mean (`T ≤ E[X]`), a two-point player is accepted surely and contributes its mean. -/lemma spi_two_point_max_low (h l q T : ℝ) (hT : T ≤ q * h + (1 - q) * l) :    spi_two_point_max_prob h l q T = 1 ∧ spi_two_point_max_value h l q T = q * h + (1 - q) * l := by  unfold spi_two_point_max_prob spi_two_point_max_value  rw [if_pos hT, if_pos hT]  exact ⟨rfl, rfl⟩
See it in the graphDiscuss this resultChallenge it