Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Nonnegative frequency and severity masses yield nonnegative aggregate mass

Proved
ActuarialValuation.compoundPoissonAggregatePMF_nonneg

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

actuarial-scienceaggregate-claimsformal-verification

Poisson weights are nonnegative at every claim count for a nonnegative rate. Repeated finite convolution of nonnegative claim-severity masses remains nonnegative. Their finite weighted mixture therefore yields no negative aggregate-loss probability coefficient.

Mathematical statement

λ≥0, f≥0⟹gs≥0\lambda\ge0,\ f\ge0\Longrightarrow g_s\ge0λ≥0, f≥0⟹gs​≥0
Preamble
import Mathlib
import Definitions.Def_actuarial_compoundPoissonAggregatePMF
import Definitions.Def_actuarial_compoundPoissonCountWeight
import Definitions.Def_actuarial_compoundPoissonSeverityPower
Formal statement
namespace ActuarialValuation

theorem compoundPoissonAggregatePMF_nonneg (rate : ℝ) (f : ℕ → ℝ) (s : ℕ)
  (hr : 0 ≤ rate) (hf : ∀ k, 0 ≤ f k) :
  0 ≤ compoundPoissonAggregatePMF rate f s := by sorry

end ActuarialValuation
Source
Harry H Panjer (1981), Recursive Evaluation of a Family of Compound Distributions, ASTIN Bulletin 12(1), 22–26, https://doi.org/10.1017/S0515036100006796; positive integer severity, compound Poisson specialisation
Read-back

What the Lean code literally says, in plain math · gpt-6

Independent mathematical reading. A nonnegative rate makes all Poisson weights nonnegative, and a nonnegative severity array stays nonnegative under each finite convolution power. Every finite term in the mixture for the requested aggregate s is consequently nonnegative. The formal claim is only coefficient nonnegativity, not total normalisation of an unbounded infinite aggregate distribution.

Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by WillR · 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me