Documentation

GibbsMeasure.Prereqs.Juxt

noncomputable def juxt {S : Type u_1} {E : Type u_2} (Λ : Set S) (η : SE) (ζ : ΛE) (x : S) :
E
Equations
Instances For
    @[simp]
    theorem juxt_apply_of_mem {S : Type u_1} {E : Type u_2} {Λ : Set S} {η : SE} {x : S} (hx : x Λ) (ζ : ΛE) :
    juxt Λ η ζ x = ζ x, hx
    @[simp]
    theorem juxt_apply_of_not_mem {S : Type u_1} {E : Type u_2} {Λ : Set S} {η : SE} {x : S} (h : xΛ) (ζ : ΛE) :
    juxt Λ η ζ x = η x
    theorem Measurable.juxt {S : Type u_1} {E : Type u_2} {𝓔 : MeasurableSpace E} {Λ : Set S} {η : SE} :
    theorem preimage_juxt_pi {S : Type u_1} {E : Type u_2} {Λ s : Set S} {t : SSet E} {η : SE} [DecidablePred fun (x : S) => x s] ( : η (s \ Λ).pi t) :
    juxt Λ η ⁻¹' s.pi t = Set.univ.pi fun (j : Λ) => if j s then t j else Set.univ
    theorem preimage_juxt_pi_eq_empty {S : Type u_1} {E : Type u_2} {Λ s : Set S} {t : SSet E} {η : SE} ( : η(s \ Λ).pi t) :
    juxt Λ η ⁻¹' s.pi t =
    theorem map_juxt_pi {S : Type u_1} {E : Type u_2} {𝓔 : MeasurableSpace E} {Λ s : Set S} {t : SSet E} [DecidablePred fun (x : S) => x s] (μ : MeasureTheory.Measure (ΛE)) (ht : ∀ (i : S), MeasurableSet (t i)) (hs : s.Countable) (η : SE) :
    (MeasureTheory.Measure.map (juxt Λ η) μ) (s.pi t) = ((s \ Λ).pi t).indicator (fun (x : SE) => μ (Set.univ.pi fun (j : Λ) => if j s then t j else Set.univ)) η
    theorem measurable_map_juxt_pi {S : Type u_1} {E : Type u_2} {𝓔 : MeasurableSpace E} {Λ s : Set S} {t : SSet E} (μ : MeasureTheory.Measure (ΛE)) (ht : ∀ (i : S), MeasurableSet (t i)) (hs : s.Countable) :
    Measurable fun (η : SE) => (MeasureTheory.Measure.map (juxt Λ η) μ) (s.pi t)