Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

measurableSet univ prod window

Proved
LevyStochCalc.Probability.measurableSet_univ_prod_window

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

context-reviewlevystochcalcsource-import

The source theorem LevyStochCalc.Probability.measurableSet_univ_prod_window is extracted from LevyStochCalc.Probability.MarkedPredictable. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.

Preamble
import Definitions.Def_LevyStochCalc_Probability_MarkedPredictable_F000

/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/

/-!
# The marked predictable σ-algebra

The compensated Poisson integral is defined for marked processes that are progressively
measurable, and it is the `L²` limit of left-endpoint approximants; the identification of that
limit with a pathwise integral against the random measure needs the strictly smaller predictable
class. On `Ω × ℝ × E` the marked predictable σ-algebra is generated by the rectangles
`F × (r, q] × B` with `0 ≤ r`, `F` measurable for `ℱ r` and `B` measurable with `ν B < ∞`. These
rectangles are a π-system, and a real-valued predictable marked process is progressively
measurable.
-/

open MeasureTheory ProbabilityTheory
open scoped ENNReal

namespace LevyStochCalc.Probability

universe u v w

variable {Ω : Type u} {mΩ : MeasurableSpace Ω} {E : Type v} [MeasurableSpace E]

section Deterministic

variable {ℱ : Filtration ℝ mΩ} {ν : Measure E}

Formal statement

theorem _root_.LevyStochCalc.Probability.measurableSet_univ_prod_window {T : ℝ} {A : Set E} (hA : MeasurableSet A)
    (hAν : ν A ≠ ⊤) {D : Set (ℝ × E)} (hD : MeasurableSet D) :
    MeasurableSet[markedPredictableSigma ℱ ν]
      ((Set.univ : Set Ω) ×ˢ (D ∩ Set.Ioc (0 : ℝ) T ×ˢ A)) := by sorry
Source
https://github.com/cgarryZA/LevyStochCalc

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