Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

avram_chat24_count_nonneg_tsum_core

Proved
avram_chat24_count_nonneg_tsum_core

by WillR · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

candidate-decomposition

Automatically extracted helper theorem avram_chat24_count_nonneg_tsum_core from oversized parent candidate 23595c476759eba9b7fdd6476c4a3aa224484b9b77d504c5143dfc6275ebde11.

Preamble
import Mathlib
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy
import Definitions.Def_AvramDividend_Classical_DividendStrategy
set_option pp.explicit true
set_option pp.fullNames true
set_option pp.universes true
open MeasureTheory Set Filter AvramDividend.Classical
open scoped NNReal ENNReal Topology
Formal statement
noncomputable section
theorem avram_chat24_count_nonneg_tsum_core
    {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α]
    (g : α → ℝ) (hg0 : ∀ x, 0 ≤ g x) (hg : Summable g) :
    Integrable g Measure.count ∧ (∫ x, g x ∂Measure.count) = ∑' x, g x := by sorry
end
Source
candidate-decomposition:ceff8522-80f3-4b18-bd1f-7f8919134883:23595c476759eba9b7fdd6476c4a3aa224484b9b77d504c5143dfc6275ebde11

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