Documentation

LeanMachineLearning.Tactic.KernelHom.Kernel.Hom

Kernel morphisms #

This file defines the transformation between categorical morphisms in SFinKer and kernel objects.

Main declarations #

noncomputable def ProbabilityTheory.Kernel.fromHom {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] {SX SY : SFinKer} {ex : SX.carrier ≃ᵐ X} {ey : SY.carrier ≃ᵐ Y} (κ : SX ⟶ SY) :
Kernel X Y

Transform a morphism in SFinKer into a kernel.

Equations
Instances For
    instance ProbabilityTheory.Kernel.instIsSFiniteKernelFromHom {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] {SX SY : SFinKer} {ex : SX.carrier ≃ᵐ X} {ey : SY.carrier ≃ᵐ Y} {κ : SX ⟶ SY} :
    noncomputable def ProbabilityTheory.Kernel.hom {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] {SX SY : SFinKer} {ex : SX.carrier ≃ᵐ X} {ey : SY.carrier ≃ᵐ Y} (κ : Kernel X Y) [IsSFiniteKernel κ] :
    SX ⟶ SY

    Transform a kernel into a morphism in SFinKer.

    Equations
    Instances For
      theorem ProbabilityTheory.Kernel.hom_apply {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] {SX SY : SFinKer} {ex : SX.carrier ≃ᵐ X} {ey : SY.carrier ≃ᵐ Y} (κ : Kernel X Y) [IsSFiniteKernel κ] (a : SX.carrier) :
      κ.hom.hom a = (κ.map ⇑ey.symm) (ex a)
      theorem ProbabilityTheory.Kernel.hom_apply' {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] {SX SY : SFinKer} {ex : SX.carrier ≃ᵐ X} {ey : SY.carrier ≃ᵐ Y} (κ : Kernel X Y) [IsSFiniteKernel κ] (a : SX.carrier) {s : Set SY.carrier} (hs : MeasurableSet s) :
      (κ.hom.hom a) s = (κ (ex a)) (⇑ey '' s)
      theorem ProbabilityTheory.Kernel.hom_congr {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] (SX SY : SFinKer) (ex : SX.carrier ≃ᵐ X) (ey : SY.carrier ≃ᵐ Y) (κ η : Kernel X Y) [IsSFiniteKernel κ] [IsSFiniteKernel η] :
      κ = η ↔ κ.hom = η.hom
      theorem ProbabilityTheory.Kernel.comp_hom {X : Type u_1} {Y : Type u_2} {Z : Type u_4} [MeasurableSpace X] [MeasurableSpace Y] [MeasurableSpace Z] (SX SY SZ : SFinKer) (ex : SX.carrier ≃ᵐ X) (ey : SY.carrier ≃ᵐ Y) (ez : SZ.carrier ≃ᵐ Z) (η : Kernel X Y) (κ : Kernel Z X) [IsSFiniteKernel η] [IsSFiniteKernel κ] :
      theorem ProbabilityTheory.Kernel.parallelComp_hom {X : Type u_1} {Y : Type u_2} {T : Type u_3} {Z : Type u_4} [MeasurableSpace X] [MeasurableSpace Y] [MeasurableSpace T] [MeasurableSpace Z] (SX SY SZ ST : SFinKer) (ex : SX.carrier ≃ᵐ X) (ey : SY.carrier ≃ᵐ Y) (ez : SZ.carrier ≃ᵐ Z) (et : ST.carrier ≃ᵐ T) (κ : Kernel X Y) (η : Kernel Z T) [IsSFiniteKernel η] [IsSFiniteKernel κ] :
      theorem ProbabilityTheory.Kernel.braiding_hom {X : Type u_1} {Y : Type u_2} [MeasurableSpace X] [MeasurableSpace Y] (SX SY : SFinKer) (ex : SX.carrier ≃ᵐ X) (ey : SY.carrier ≃ᵐ Y) :
      (β_ SX SY).hom = (swap X Y).hom
      theorem ProbabilityTheory.Kernel.associator_hom {X : Type u_1} {Y : Type u_2} {Z : Type u_4} [MeasurableSpace X] [MeasurableSpace Y] [MeasurableSpace Z] (SX SY SZ : SFinKer) (ex : SX.carrier ≃ᵐ X) (ey : SY.carrier ≃ᵐ Y) (ez : SZ.carrier ≃ᵐ Z) {X₀ : Type u_5} {Y₀ : Type u_6} {Z₀ : Type u_7} [MeasurableSpace X₀] [MeasurableSpace Y₀] [MeasurableSpace Z₀] (ex₀ : X ≃ᵐ X₀) (ey₀ : Y ≃ᵐ Y₀) (ez₀ : Z ≃ᵐ Z₀) :
      theorem ProbabilityTheory.Kernel.associator_inv {X : Type u_1} {Y : Type u_2} {Z : Type u_4} [MeasurableSpace X] [MeasurableSpace Y] [MeasurableSpace Z] (SX SY SZ : SFinKer) (ex : SX.carrier ≃ᵐ X) (ey : SY.carrier ≃ᵐ Y) (ez : SZ.carrier ≃ᵐ Z) {X₀ : Type u_5} {Y₀ : Type u_6} {Z₀ : Type u_7} [MeasurableSpace X₀] [MeasurableSpace Y₀] [MeasurableSpace Z₀] (ex₀ : X ≃ᵐ X₀) (ey₀ : Y ≃ᵐ Y₀) (ez₀ : Z ≃ᵐ Z₀) :