Averaging #
theorem
FD1D.FiniteLaw.expect_timeAverage_eq_sum_range
{α : Type u_1}
[Fintype α]
{T : ℕ}
(hT : 0 < T)
(μ : ℕ → FiniteLaw α)
(f : ℕ → α → ℝ)
:
((timeAverage hT fun (t : Fin T) => μ ↑t).expect fun (z : Fin T × α) => f (↑z.1) z.2) = (∑ t ∈ Finset.range T, (μ t).expect (f t)) / ↑T
Range-indexed form of expect_timeAverage.
theorem
FD1D.FiniteLaw.expect_timeAverage_state
{α : Type u_1}
[Fintype α]
{T : ℕ}
(hT : 0 < T)
(μ : ℕ → FiniteLaw α)
(f : α → ℝ)
:
((timeAverage hT fun (t : Fin T) => μ ↑t).expect fun (z : Fin T × α) => f z.2) = (∑ t ∈ Finset.range T, (μ t).expect f) / ↑T
A state-only observable averages in the same way.
Lift a state permutation without changing the sampled time.
Equations
- FD1D.FiniteLaw.timeLiftPerm e = (Equiv.refl (Fin T)).prodCongr e
Instances For
@[simp]
theorem
FD1D.FiniteLaw.timeLiftPerm_apply
{α : Type u_1}
{T : ℕ}
(e : Equiv.Perm α)
(t : Fin T)
(x : α)
:
theorem
FD1D.FiniteLaw.timeAverage_lawInvariant
{α : Type u_1}
[Fintype α]
{T : ℕ}
(hT : 0 < T)
(μ : Fin T → FiniteLaw α)
(e : Equiv.Perm α)
(hinv : ∀ (t : Fin T), FiniteKernel.LawInvariant (μ t) e)
:
FiniteKernel.LawInvariant (timeAverage hT μ) (timeLiftPerm e)
Pointwise state-law invariance passes to the uniform time mixture.