Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.3, p. 40 — KS1 ≥ S2, strictly when the P_k are not all equal

Proved
RegAggregation.Posterior.KS1_ge_S2

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

cauchy-schwarzforecast-aggregationinequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K∈NK\in\mathbb NK∈N, μ0∈R\mu_0\in\mathbb Rμ0​∈R and P∈RK\mathbf P\in\mathbb R^KP∈RK. Let

S1=∑k=1K(Pk−μ0)2,S2=∑i,k(Pk−μ0)(Pi−μ0).S_1 = \sum_{k=1}^K (P_k-\mu_0)^2,\qquad S_2 = \sum_{i,k}(P_k-\mu_0)(P_i-\mu_0).S1​=k=1∑K​(Pk​−μ0​)2,S2​=i,k∑​(Pk​−μ0​)(Pi​−μ0​).

Then KS1≥S2K S_1 \ge S_2KS1​≥S2​. If, moreover, Pi≠PkP_i\neq P_kPi​=Pk​ for some i≠ki\neq ki=k, then KS1>S2K S_1 > S_2KS1​>S2​.

In the proof of Theorem 3.3 (iii), this is what makes the scale of the inverse gamma integral in λ2\lambda_2λ2​ strictly positive when the forecasters disagree.

Formalization Note The page writes the upper limit of the sum in S1S_1S1​ as NNN; it is the number KKK of forecasters.

Preamble
import Mathlib
import Definitions.Def_RegAggregation_Posterior_Model
Formal statement
namespace RegAggregation.Posterior

theorem KS1_ge_S2 (K : ℕ) (μ0 : ℝ) (P : Fin K → ℝ) :
    S2 μ0 P ≤ (K : ℝ) * S1 μ0 P ∧
    ((∃ i k, i ≠ k ∧ P i ≠ P k) → S2 μ0 P < (K : ℝ) * S1 μ0 P) := by sorry

end RegAggregation.Posterior
Source
Satopää, Regularized Aggregation of One-off Probability Predictions, SSRN working paper 3769945 (version of 2021-08-10; published in Operations Research 2022), p. 40, proof of Theorem 3.3 (iii)
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 19, 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