spi_two_point_pool_prob_mem
lemmaverified
The pooling probability lies in [0, 1].
Statement
lemma spi_two_point_pool_prob_mem (h l q T : ℝ) (hlh : l ≤ h) (hq0 : 0 ≤ q) (hq1 : q ≤ 1) :
0 ≤ spi_two_point_pool_prob h l q T ∧ spi_two_point_pool_prob h l q T ≤ 1- 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 1
- spi_two_point_pool_probThe probability with which the low value joins the accepted signal in the optimal scheme: 1 if T <= E[X], q(h-T)/((1-q)(T-l)) if E[X] < T…
- Used by 2
- spi_two_point_scheme_prob_eqReal-arithmetic part of the optimality of the two-point scheme: its two signals give acceptance probability exactly spi_two_point_max_prob.
- spi_two_point_scheme_specFor S >= 2 the two-point scheme is a valid scheme and a player using it is accepted with probability exactly spi_two_point_max_prob.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The pooling probability lies in `[0, 1]` for a two-point reward with `l ≤ h` and `q ∈ [0, 1]`. -/lemma spi_two_point_pool_prob_mem (h l q T : ℝ) (hlh : l ≤ h) (hq0 : 0 ≤ q) (hq1 : q ≤ 1) : 0 ≤ spi_two_point_pool_prob h l q T ∧ spi_two_point_pool_prob h l q T ≤ 1 := by unfold spi_two_point_pool_prob split_ifs with h1 h2 · norm_num · have hq1' : q < 1 := by by_contra hc; push Not at hc have e : q * h + (1 - q) * l = h := by rw [le_antisymm hq1 hc]; ring linarith have hTl : 0 < T - l := by nlinarith have h1q : 0 < 1 - q := by linarith constructor · apply div_nonneg <;> nlinarith · rw [div_le_one (by positivity)]; nlinarith · norm_num