LeanMachineLearning

ProbabilityTheory.Kernel.whiskerRight🔗

Lemma

No docstring.

🔗theorem
ProbabilityTheory.Kernel.whiskerRight.{u_1, u_2, u_4, u_5}
  {X : Type u_1} {Y : Type u_2} {Z : Type u_4} [MeasurableSpace X]
  [MeasurableSpace Y] [MeasurableSpace Z] (SX SY SZ : SFinKer)
  (ex : SFinKer.carrier SX ≃ᵐ X) (ey : SFinKer.carrier SY ≃ᵐ Y)
  (ez : SFinKer.carrier SZ ≃ᵐ Z) (κ : Kernel X Y) [IsSFiniteKernel κ] :
  CategoryTheory.MonoidalCategoryStruct.whiskerRight (hom κ) SZ =
    hom (parallelComp κ Kernel.id)
ProbabilityTheory.Kernel.whiskerRight.{u_1,
    u_2, u_4, u_5}
  {X : Type u_1} {Y : Type u_2}
  {Z : Type u_4} [MeasurableSpace X]
  [MeasurableSpace Y] [MeasurableSpace Z]
  (SX SY SZ : SFinKer)
  (ex : SFinKer.carrier SX ≃ᵐ X)
  (ey : SFinKer.carrier SY ≃ᵐ Y)
  (ez : SFinKer.carrier SZ ≃ᵐ Z)
  (κ : Kernel X Y) [IsSFiniteKernel κ] :
  CategoryTheory.MonoidalCategoryStruct.whiskerRight
      (hom κ) SZ =
    hom (parallelComp κ Kernel.id)

Code

lemma whiskerRight (κ : Kernel X Y) [IsSFiniteKernel κ] :
    κ.hom (ex := ex) (ey := ey) ▷ SZ =
      (κ ∥ₖ Kernel.id (α := Z)).hom (ex := ex.prodCongr ez) (ey := ey.prodCongr ez)
Proof
by
  ext _ _ hs; dsimp
  simp only [hom]
  rw [parallelComp_apply, comap_apply, map_apply, id_apply, comap_apply, map_apply,
    parallelComp_apply, id_apply]
  · simp only [Measure.prod_dirac, MeasurableEquiv.prodCongr]
    rw [Measure.map_map, Measure.map_map, Measure.map_apply, Measure.map_apply]
    · congr with y
      · simp
      · simp
    all_goals try fun_prop
    all_goals exact hs
  all_goals fun_prop

Actions: Source · Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

Dependency graph

Audit surface: 1 project declarations, 31 external constants

✓ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.