AFTD Auto-Formalizing Theoretical Domains

spi_accept_congr

lemmaverified

Acceptance probability and accepted value of player i depend only on player i's own scheme.

Statement

lemma spi_accept_congr {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ φ' : Fin N → Fin K → Fin S → ℝ)
    (T : ℝ) (i : Fin N) (h : φ i = φ' i) :
    spi_accept_prob x w φ T i = spi_accept_prob x w φ' T i ∧
      spi_accept_value x w φ T i = spi_accept_value x w φ' T i
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 5
  • spi_signal_massProbability of signal s of player i in the prophet search game with strategic reward signaling: sum over support points k of w_ik phi_ik(s).
  • spi_signal_valueReward-weighted probability of signal s of player i: probability of s times the searcher's posterior mean reward given s.
  • spi_acceptedThe signals of player i on which the static-threshold searcher with threshold T stops: those with posterior mean at least T.
  • spi_accept_probProbability that the searcher accepts player i when she reaches it.
  • spi_accept_valueExpected reward collected from player i on the event that it is reached and accepted.
Used by 1
  • spi_reach_prob_updateA unilateral deviation of player i does not change the probability that the search reaches i.

Lean source view module on GitHub

/-- Acceptance probability and accepted value of player `i` only depend on player `i`'s own scheme. -/lemma spi_accept_congr {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ φ' : Fin N → Fin K → Fin S → ℝ)    (T : ℝ) (i : Fin N) (h : φ i = φ' i) :    spi_accept_prob x w φ T i = spi_accept_prob x w φ' T i ∧      spi_accept_value x w φ T i = spi_accept_value x w φ' T i := by  simp only [spi_accept_prob, spi_accept_value, spi_accepted, spi_signal_mass, spi_signal_value, h]  exact ⟨rfl, rfl⟩
See it in the graphDiscuss this resultChallenge it