LeanMachineLearning

ProbabilityTheory.Kernel.parallelComp_lift🔗

Lemma

No docstring.

🔗theorem
ProbabilityTheory.Kernel.parallelComp_lift.{x, y, z, w, t} {X : Type x}
  [MeasurableSpace X] {Y : Type y} [MeasurableSpace Y] {X' : Type w}
  [MeasurableSpace X'] {Y' : Type w} [MeasurableSpace Y'] (ex : X' ≃ᵐ X)
  (ey : Y' ≃ᵐ Y) {Z : Type z} [MeasurableSpace Z] {T : Type t}
  [MeasurableSpace T] {Z' : Type w} [MeasurableSpace Z'] {T' : Type w}
  [MeasurableSpace T'] (ez : Z' ≃ᵐ Z) (et : T' ≃ᵐ T) (κ : Kernel X Y)
  (η : Kernel Z T) :
  parallelComp (lift κ) (lift η) = lift (parallelComp κ η)
ProbabilityTheory.Kernel.parallelComp_lift.{x,
    y, z, w, t}
  {X : Type x} [MeasurableSpace X]
  {Y : Type y} [MeasurableSpace Y]
  {X' : Type w} [MeasurableSpace X']
  {Y' : Type w} [MeasurableSpace Y']
  (ex : X' ≃ᵐ X) (ey : Y' ≃ᵐ Y)
  {Z : Type z} [MeasurableSpace Z]
  {T : Type t} [MeasurableSpace T]
  {Z' : Type w} [MeasurableSpace Z']
  {T' : Type w} [MeasurableSpace T']
  (ez : Z' ≃ᵐ Z) (et : T' ≃ᵐ T)
  (κ : Kernel X Y) (η : Kernel Z T) :
  parallelComp (lift κ) (lift η) =
    lift (parallelComp κ η)

Code

lemma parallelComp_lift (κ : Kernel X Y) (η : Kernel Z T) :
    κ.lift (ex := ex) (ey := ey) ∥ₖ η.lift (ex := ez) (ey := et) =
      lift (ex := ex.prodCongr ez) (ey := ey.prodCongr et) (κ ∥ₖ η)
Proof
by
  by_cases hκ : IsSFiniteKernel <| lift (ex := ex) (ey := ey) κ
  swap
  · simp only [hκ, not_false_eq_true, parallelComp_of_not_isSFiniteKernel_left,
    (isSFinite_lift ex ey κ).not.mpr hκ]
    simp [lift]
  by_cases hη : IsSFiniteKernel <| lift (ex := ez) (ey := et) η
  swap
  · simp only [hη, not_false_eq_true, parallelComp_of_not_isSFiniteKernel_right,
    (isSFinite_lift ez et η).not.mpr hη]
    simp [lift]
  simp only [lift]
  replace hκ := (isSFinite_lift ex ey κ).mpr hκ
  replace hη := (isSFinite_lift ez et η).mpr hη
  rw [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, 14 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.