Past future probability, disintegrated over the past
ProvedMarkovChainCLT.chainMeasure_past_inter_futureLet be a Markov kernel, an initial distribution, and the resulting law on path space. Fix and measurable sets and . Then
What it is. This is the joint law of a past event and a future event, disintegrated over the past. By the identification of the two -algebras of the coordinate process, every event in has the form and every event in has the form , so the left-hand side is the completely general "past future" probability appearing in the definition of the mixing coefficients , , .
Why the right-hand side is the useful form. It exhibits the joint probability as an average, over the past, of the conditional probability of the future — and that conditional probability is written explicitly as , a quantity depending on the past only through the single state . Comparing it with the stationary value and applying the total-variation bound for -valued integrands converts a rate directly into , uniformly in the split point . Everything after this point is arithmetic of averages: no measure-theoretic or Markov input remains.
Proof. Disintegrate over its first coordinates, writing it as composed with the marginal , and expand the resulting bind. It then suffices to evaluate on the intersection, for each .
Two facts do this. First, reproduces its own initial segment: pushing it forward along gives , i.e. the Dirac mass at . Hence the past event has -measure — it is deterministic given the conditioning, which is why it becomes an indicator and the integral restricts to . When its complement is null, so the intersection has the same measure as the future event alone; when the intersection is null.
Second, on the future event, the conditional restart theorem gives , which is exactly the inner integrand.
import Definitions.Def_MarkovChainPathMeasure import Definitions.Def_MarkovIterKernel open Filter Finset Function MeasurableEquiv MeasurableSpace MeasureTheory Preorder ProbabilityTheory open scoped ENNReal NNReal Topology open MarkovChainCLT
theorem MarkovChainCLT.chainMeasure_past_inter_future {X : Type*} [MeasurableSpace X]
(P : Kernel X X) [IsMarkovKernel P]
(lam : Measure X) [IsProbabilityMeasure lam] (k n : ℕ)
(A₀ : Set (Π _i : Finset.Iic k, X)) (hA₀ : MeasurableSet A₀)
(B₀ : Set (ℕ → X)) (hB₀ : MeasurableSet B₀) :
(chainMeasure P lam) ((frestrictLe (π := fun _ : ℕ => X) k ⁻¹' A₀)
∩ ((fun ω : ℕ → X => fun l => ω (k + n + l)) ⁻¹' B₀))
= ∫⁻ u in A₀, ((BanditAlgorithm.markovChainKernel P)
∘ₘ (iterKernel P n (u ⟨k, Finset.mem_Iic.2 le_rfl⟩))) B₀
∂((chainMeasure P lam).map (frestrictLe (π := fun _ : ℕ => X) k)) := by sorry