Measurable coherence #
This file introduces the monoidal composition for s-finite kernels (noted ⊗≫ₖ).
Main declarations #
MeasurableCoherence: class witnessing measurable equivalences between types.monoComp: monoidal composition of kernels using measurable equivalences to transport toSFinKer.hom_monoComp: theSFinKermorphism of the kernelized monoidal composition is the monoidal composition of the morphisms inSFinKer.
A class witnessing the existence of a measurable equivalence between two measurable spaces.
A measurable equivalence between
XandY.
Instances
Equations
- MeasurableCoherence.inst = { miso := MeasurableEquiv.refl X }
Given measurable equivalences ex : X ≃ᵐ X' and ey : Y ≃ᵐ Y', we can transport the
MeasurableCoherence instance from X and Y to X' and Y'.
Equations
- MeasurableCoherence.TransEquiv ex ey = { miso := ex.trans (MeasurableCoherence.miso.trans ey.symm) }
Instances For
MeasurableCoherence gives an instance of MonoidalCoherence in the SFinKer category.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The kernelized version of the monoidal composition of kernels using the SFinKer category.
It uses arbitrary measurable equivalences to transport the kernels to the SFinKer category.
Equations
- ProbabilityTheory.Kernel.monoComp₀ ew ex ey ez κ η = ProbabilityTheory.Kernel.fromHom (CategoryTheory.monoidalComp κ.hom η.hom)
Instances For
The kernelized version of the monoidal composition of kernels using the SFinKer category.
Equations
Instances For
The kernelized version of the monoidal composition of kernels using the SFinKer category.
Equations
- One or more equations did not get rendered due to their size.