AFTD Auto-Formalizing Theoretical Domains

additive_noise_success_prob

def

The 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 distribution q on ℤ is the sum over integers s of p(g(s)) * q(s - g(s)).

Statement

noncomputable def additive_noise_success_prob (m : ℕ) (p : Fin m → ℝ) (q : ℤ → ℝ) (g : ℤ → Fin m) : ℝ
Defined in
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
none listed
Used by 3

Read back from the Lean

The definition additive_noise_success_prob takes: 1. a natural number m : ℕ, 2. a function p : Fin m → ℝ, 3. a function q : ℤ → ℝ, and 4. a decoding function g : ℤ → Fin m, and defines a real number given by the infinite sum (tsum, ∑') over all integers s : ℤ of p (g s) * q (s - (g s : ℤ)), where g s ∈ Fin m is coerced to ℤ via its underlying natural number value.

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

/-- Average one-guess success probability of a decision rule under additive noise. -/
noncomputable def additive_noise_success_prob (m : ℕ) (p : Fin m → ℝ) (q : ℤ → ℝ) (g : ℤ → Fin m) : ℝ := ∑' s : ℤ, p (g s) * q (s - g s)
See it in the graphDiscuss this resultChallenge it