LeanMachineLearning

ProbabilityTheory.Kernel.parallelComp_hom🔗

Lemma

No docstring.

🔗theorem
ProbabilityTheory.Kernel.parallelComp_hom.{u_1, u_2, u_3, u_4, u_5}
  {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 : SFinKer.carrier SX ≃ᵐ X) (ey : SFinKer.carrier SY ≃ᵐ Y)
  (ez : SFinKer.carrier SZ ≃ᵐ Z) (et : SFinKer.carrier ST ≃ᵐ T)
  (κ : Kernel X Y) (η : Kernel Z T) [IsSFiniteKernel η]
  [IsSFiniteKernel κ] :
  CategoryTheory.MonoidalCategoryStruct.tensorHom (hom κ) (hom η) =
    hom (parallelComp κ η)
ProbabilityTheory.Kernel.parallelComp_hom.{u_1,
    u_2, u_3, u_4, u_5}
  {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 : SFinKer.carrier SX ≃ᵐ X)
  (ey : SFinKer.carrier SY ≃ᵐ Y)
  (ez : SFinKer.carrier SZ ≃ᵐ Z)
  (et : SFinKer.carrier ST ≃ᵐ T)
  (κ : Kernel X Y) (η : Kernel Z T)
  [IsSFiniteKernel η]
  [IsSFiniteKernel κ] :
  CategoryTheory.MonoidalCategoryStruct.tensorHom
      (hom κ) (hom η) =
    hom (parallelComp κ η)

Code

lemma parallelComp_hom (κ : Kernel X Y) (η : Kernel Z T) [IsSFiniteKernel η] [IsSFiniteKernel κ] :
    κ.hom (ex := ex) (ey := ey) ⊗ₘ η.hom (ex := ez) (ey := et) =
      hom (ex := ex.prodCongr ez) (ey := ey.prodCongr et) (κ ∥ₖ η)
Proof
by
  ext : 1; dsimp
  simp only [hom]
  rw [id_parallelComp_comp_parallelComp_id, comap_parallelComp_comap, map_parallelComp_map]
  · rfl
  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, 30 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.