Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 21 — the minimum posterior equals 1/(1 + ((1+ζ)/(1−ζ))^{|N¹ − N⁰|})

Proved
FastCLO.LowerBound.posterior_identity

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

bayes-risklower-boundsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0≤ζ<10 \le \zeta < 10≤ζ<1 and let N0,N1∈NN^0, N^1 \in \mathbb NN0,N1∈N. Then

min⁡{(1+ζ2)N1(1−ζ2)N0, (1+ζ2)N0(1−ζ2)N1}(1+ζ2)N1(1−ζ2)N0+(1+ζ2)N0(1−ζ2)N1=11+(1+ζ1−ζ)∣N1−N0∣.\frac{\min\Big\{\big(\tfrac{1+\zeta}{2}\big)^{N^1}\big(\tfrac{1-\zeta}{2}\big)^{N^0},\ \big(\tfrac{1+\zeta}{2}\big)^{N^0}\big(\tfrac{1-\zeta}{2}\big)^{N^1}\Big\}}{\big(\tfrac{1+\zeta}{2}\big)^{N^1}\big(\tfrac{1-\zeta}{2}\big)^{N^0} + \big(\tfrac{1+\zeta}{2}\big)^{N^0}\big(\tfrac{1-\zeta}{2}\big)^{N^1}} = \frac{1}{1 + \big(\tfrac{1+\zeta}{1-\zeta}\big)^{|N^1 - N^0|}}.(21+ζ​)N1(21−ζ​)N0+(21+ζ​)N0(21−ζ​)N1min{(21+ζ​)N1(21−ζ​)N0, (21+ζ​)N0(21−ζ​)N1}​=1+(1−ζ1+ζ​)∣N1−N0∣1​.

In the lower-bound construction the left side is the minimum of the posterior probabilities of bi=1b_i = 1bi​=1 and bi=0b_i = 0bi​=0 given the data, where Ni1N^1_iNi1​ and Ni0N^0_iNi0​ count the observations at xix_ixi​ with each of the two possible cost vectors. The identity shows that this posterior depends on the data only through ∣Ni1−Ni0∣|N^1_i - N^0_i|∣Ni1​−Ni0​∣.

Formalization Note This is the second equality of the page's display. The hypothesis ζ<1\zeta < 1ζ<1 keeps 1−ζ≠01 - \zeta \ne 01−ζ=0; the proof uses ζ≤1/2\zeta \le 1/2ζ≤1/2.

Preamble
import Mathlib
Formal statement
namespace FastCLO.LowerBound

/-- The posterior identity (Hu, Kallus, Mao, arXiv:2011.03030v3, proof of Theorem 3, p. 21, the
display after "Hence,"): with `a = (1+ζ)/2`, `c = (1−ζ)/2` and counts `N⁰, N¹`,
`min{a^{N¹}c^{N⁰}, a^{N⁰}c^{N¹}} / (a^{N¹}c^{N⁰} + a^{N⁰}c^{N¹}) = 1 / (1 + ((1+ζ)/(1−ζ))^{|N¹ − N⁰|})`.

Formalization Note: this is the second equality of the display (the first identifies the left side
with the minimum posterior probability). `ζ < 1` keeps `1 − ζ ≠ 0`; the proof uses `ζ ≤ 1/2`. -/
theorem posterior_identity (ζ : ℝ) (h0 : 0 ≤ ζ) (h1 : ζ < 1) (N0 N1 : ℕ) :
    min (((1 + ζ) / 2) ^ N1 * ((1 - ζ) / 2) ^ N0) (((1 + ζ) / 2) ^ N0 * ((1 - ζ) / 2) ^ N1) /
        (((1 + ζ) / 2) ^ N1 * ((1 - ζ) / 2) ^ N0 + ((1 + ζ) / 2) ^ N0 * ((1 - ζ) / 2) ^ N1) =
      1 / (1 + ((1 + ζ) / (1 - ζ)) ^ (Int.natAbs ((N1 : ℤ) - N0))) := by sorry

end FastCLO.LowerBound
Source
Hu, Kallus, Mao, Fast Rates for Contextual Linear Optimization, arXiv:2011.03030v3, proof of Theorem 3 (A.2), p. 21, the display after "Hence,"
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me