Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Restricted path laws imply event-marginal independence equations

Proved
AvramDividend.Classical.restrictedMapLaw_event_marginal_factor

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

independencepushforward-measurerestricted-lawstrong-markov

If the pushforward law of a measurable random element Y under restriction to event A equals the event probability times the original pushforward law, then every measurable marginal set B satisfies P(A∩{Y∈B})=P(A)P(Y∈B).

Preamble
import Mathlib.MeasureTheory.Measure.Map
import Mathlib.MeasureTheory.Measure.Restrict
import Mathlib.MeasureTheory.Measure.MeasureSpace

open MeasureTheory Set
Formal statement
theorem AvramDividend.Classical.restrictedMapLaw_event_marginal_factor
    {Ω β : Type*} [MeasurableSpace Ω] [MeasurableSpace β]
    (P : Measure Ω) (Y : Ω → β) (hY : Measurable Y)
    (A : Set Ω)
    (hLaw : Measure.map Y (P.restrict A) =
      (P A) • Measure.map Y P)
    (B : Set β) (hB : MeasurableSet B) :
    P (A ∩ Y ⁻¹' B) = P A * P (Y ⁻¹' B) := by
  sorry
Source
Measure-algebra bridge from finite-stopping restricted future-path strong Markov laws (3075481a-89a4-4c24-b131-2afd90b66eea) to the event-independence criterion required by canonical joint law 61930a38-11f1-449e-bbb6-67d59c6d5ca8 and dividend split 79978d61-9d1f-4b20-b8a5-114797a8e380.

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