constant_decision_rule_success_prob
lemmaverified
For any secret distribution p on Fin m and probability distribution q on ℤ with sum 1, the constant decision rule guessing x₀ for all observations s achieves average success probability p(x₀).
Statement
lemma constant_decision_rule_success_prob (m : ℕ) (p : Fin m → ℝ) (q : ℤ → ℝ) (hq_sum : HasSum q 1) (x₀ : Fin m) : additive_noise_success_prob m p q (fun _ => x₀) = p x₀
- Source
- arXiv:2611.16066 Proposition 3.1 proof -- Optimal Additive Integer Masks for One-Guess Vulnerability under an Absolute-Moment Budget
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- additive_noise_success_probThe average one-guess success probability of a decision rule g : ℤ → Fin m for a secret with prior p on Fin m under additive noise with…
- Used by 1
- additive_noise_map_rule_and_bayes_vulnerabilityFor a secret with distribution p on Fin m and independent additive noise Y with distribution q on ℤ, the optimal average one-guess success…
Read back from the Lean
For any natural number $m$, function $p : \text{Fin } m \to \mathbb{R}$, function $q : \mathbb{Z} \to \mathbb{R}$, and proof $hq\_sum$ that $q$ has sum $1$ (i.e., $\sum_{z : \mathbb{Z}} q(z)$ converges unconditionally to $1$), and for any $x_0 : \text{Fin } m$, the success probability of the constant decision rule $s \mapsto x_0$ under additive noise (given by additive_noise_success_prob m p q (fun _ => x₀)) equals $p(x_0)$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The constant decision rule guessing x₀ achieves success probability p(x₀). -/ lemma constant_decision_rule_success_prob (m : ℕ) (p : Fin m → ℝ) (q : ℤ → ℝ) (hq_sum : HasSum q 1) (x₀ : Fin m) : additive_noise_success_prob m p q (fun _ => x₀) = p x₀ := by unfold additive_noise_success_prob simp only have hqshift : HasSum (fun s : ℤ => q (s - ((x₀ : ℕ) : ℤ))) 1 := by have h := (Equiv.hasSum_iff (f := q) (a := 1) (e := Equiv.subRight (((x₀ : ℕ) : ℤ)))).2 hq_sum convert h using 1 · ext s simp [Equiv.subRight_apply] rw [tsum_mul_left, hqshift.tsum_eq, mul_one]