Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
โŒ•
Log in
โ† Formalpedia

Poisson piece laws and independent superposition space

Definition
KLSModular_LevyStochCalc_Poisson_PoissonSuperposition

by Lazyfill ยท Oct 25, 2026 ยท Mathlib 0df444a (Lean v4.33.1)

functional-inequalitiesklskls-conjecturekls-modularlog-concavemodule-contextvendored-levystochcalc

Vendored from the LevyStochCalc library (https://github.com/cgarryZA/LevyStochCalc), commit 984dbf0b790031eac05d56fe5a84b65e15e1e932. PieceSpace ๐“ง is ULift โ„• ร— (โ„• โ†’ ๐“ง), containing a Poisson count and a sequence of marks. pieceLaw r ฯ is the product of the pushforward of Poisson(r) to ULift โ„• and the infinite product of the mark measure ฯ\rhoฯ; if ฯ\rhoฯ is a probability measure, this is a probability measure. For a countable index type ฮน\iotaฮน, superLaw r ฯ is the infinite product of these independent piece laws, and is again a probability measure when every ฯp\rho_pฯpโ€‹ is.

Original module imports

import LevyStochCalc.Poisson.PoissonSplitting
import LevyStochCalc.Probability.IndepGrouping
import Mathlib.Probability.Independence.CharacteristicFunction

Original declaration excerpt

Shown in the original module context.

abbrev PieceSpace (๐“ง : Type u) : Type u := ULift.{u} โ„• ร— (โ„• โ†’ ๐“ง)

Module navigation

Direct project imports: LevyStochCalc/Poisson/PoissonSplitting, LevyStochCalc/Probability/IndepGrouping.

Project result: The KLS conjecture.

Original module ยท LevyStochCalc.Poisson.PoissonSuperposition ยท Frozen source 408915f.

Definition code
import Definitions.Def_KLSModular_LevyStochCalc_Poisson_PoissonSplitting
import Definitions.Def_KLSModular_LevyStochCalc_Probability_IndepGrouping
import Mathlib.Probability.Independence.CharacteristicFunction

/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
-- Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (upstream path LevyStochCalc/Poisson/PoissonSuperposition.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory Complex Filter Function Topology
open scoped NNReal ENNReal
namespace LevyStochCalc
namespace Poisson
universe u
section Piece
variable {๐“ง : Type u} [MeasurableSpace ๐“ง]
/-- The coordinates of one Poisson piece: a count and a sequence of marks. -/
abbrev PieceSpace (๐“ง : Type u) : Type u := ULift.{u} โ„• ร— (โ„• โ†’ ๐“ง)
/-- The law of one piece: a Poisson count independent of a sequence of iid marks. -/
noncomputable def pieceLaw (r : โ„โ‰ฅ0) (ฯ : Measure ๐“ง) : Measure (PieceSpace ๐“ง) :=
  (Po(r).map ULift.up).prod (Measure.infinitePi fun _ : โ„• => ฯ)
instance (r : โ„โ‰ฅ0) (ฯ : Measure ๐“ง) [IsProbabilityMeasure ฯ] :
    IsProbabilityMeasure (pieceLaw r ฯ) := by
  haveI : IsProbabilityMeasure (Po(r).map ULift.up) :=
    Measure.isProbabilityMeasure_map measurable_up.aemeasurable
  unfold pieceLaw
  infer_instance
variable {ฮน : Type*} (r : ฮน โ†’ โ„โ‰ฅ0) (ฯ : ฮน โ†’ Measure ๐“ง) [โˆ€ p, IsProbabilityMeasure (ฯ p)]
/-- The law of the superposition sample space: independent pieces. -/
noncomputable def superLaw : Measure (ฮน โ†’ PieceSpace ๐“ง) :=
  Measure.infinitePi fun p => pieceLaw (r p) (ฯ p)
instance : IsProbabilityMeasure (superLaw r ฯ) := by
  unfold superLaw
  infer_instance
variable {r ฯ}
variable (r ฯ)
variable {r ฯ}
variable (r ฯ)
variable [Countable ฮน]
end Piece
end Poisson
end LevyStochCalc
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Poisson/PoissonSuperposition.lean#L33-L76 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Poisson.PoissonSuperposition`, definition bundle `KLSModular_LevyStochCalc_Poisson_PoissonSuperposition`; the repository is private at upload time). Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (Apache-2.0; upstream copyright notice retained in the Lean text).

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