Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 29 — with prob. 1 − δ, |log posterior odds| ≤ 15τ√(2n log(2/δ))

Proved
RobustGeneralization.BernLower.lemma29_log_odds_bound

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

bernoulli-modelconcentrationlog-oddsp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1posterior

Let θ\thetaθ be uniform on {−1,+1}\{-1,+1\}{−1,+1} and let (x1,y1),…,(xn,yn)(x_1,y_1),\dots,(x_n,y_n)(x1​,y1​),…,(xn​,yn​) be drawn independently from the one-dimensional (θ,τ)(\theta,\tau)(θ,τ)-Bernoulli model (yky_kyk​ uniform, xk=ykθx_k=y_k\thetaxk​=yk​θ with probability 12+τ\tfrac12+\tau21​+τ, else xk=−ykθx_k=-y_k\thetaxk​=−yk​θ). Suppose 0<τ≤140<\tau\le\tfrac140<τ≤41​, n≤1/τ2n\le 1/\tau^2n≤1/τ2 and δ>0\delta>0δ>0. Then, with probability at least 1−δ1-\delta1−δ over the joint draw of θ\thetaθ and the samples SSS,

log⁡Pr⁡[θ=+1∣S]Pr⁡[θ=−1∣S]∈[−15τ2nlog⁡2δ, 15τ2nlog⁡2δ].\log\frac{\Pr[\theta=+1\mid S]}{\Pr[\theta=-1\mid S]}\in\left[-15\tau\sqrt{2n\log\tfrac2\delta},\ 15\tau\sqrt{2n\log\tfrac2\delta}\right].logPr[θ=−1∣S]Pr[θ=+1∣S]​∈[−15τ2nlogδ2​​, 15τ2nlogδ2​​].

The lemma quantifies how little n≤1/τ2n\le1/\tau^2n≤1/τ2 samples reveal about a single sign θ\thetaθ: the posterior stays close to uniform. Applied to each coordinate of θ⋆\theta^\starθ⋆ it controls the posterior means in the proof of Theorem 31.

Formalization Note The probability is a finite sum of the joint weights 12∏kPθ,τ(xk,yk)\tfrac12\prod_k P_{\theta,\tau}(x_k,y_k)21​∏k​Pθ,τ​(xk​,yk​) over θ\thetaθ and SSS. The hypothesis δ>0\delta>0δ>0 is added: at δ=0\delta=0δ=0 Lean's conventions 2/0=02/0=02/0=0 and log⁡0=0\log 0=0log0=0 would collapse the interval to {0}\{0\}{0} and make the statement false. For δ≥1\delta\ge1δ≥1 the statement is trivially true, so no upper bound on δ\deltaδ is imposed.

Preamble
import Mathlib
import Definitions.Def_RobustGeneralization_BernLower_Model
Formal statement
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
Source
Schmidt, Santurkar, Tsipras, Talwar, Mądry, Adversarially Robust Generalization Requires More Data, arXiv:1804.11285v2, p. 33, Lemma 29
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me