Lemma 29 — with prob. 1 − δ, |log posterior odds| ≤ 15τ√(2n log(2/δ))
ProvedRobustGeneralization.BernLower.lemma29_log_odds_boundLet be uniform on and let be drawn independently from the one-dimensional -Bernoulli model ( uniform, with probability , else ). Suppose , and . Then, with probability at least over the joint draw of and the samples ,
The lemma quantifies how little samples reveal about a single sign : the posterior stays close to uniform. Applied to each coordinate of it controls the posterior means in the proof of Theorem 31.
Formalization Note The probability is a finite sum of the joint weights over and . The hypothesis is added: at Lean's conventions and would collapse the interval to and make the statement false. For the statement is trivially true, so no upper bound on is imposed.
import Mathlib import Definitions.Def_RobustGeneralization_BernLower_Model
namespace RobustGeneralization.BernLower
theorem lemma29_log_odds_bound (n : ℕ) (τ δ : ℝ) (hτ : 0 < τ) (hτ' : τ ≤ 1 / 4)
(hn : (n : ℝ) ≤ 1 / τ ^ 2) (hδ : 0 < δ) :
1 - δ ≤ ∑ θ : Bool, (1 / 2) * ∑ S : Fin n → Bool × Bool,
(∏ k, bern1W θ τ (S k)) *
(if |Real.log (odds1 τ S)| ≤ 15 * τ * Real.sqrt (2 * n * Real.log (2 / δ))
then 1 else 0) := by sorry
end RobustGeneralization.BernLower
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.