Implementation of the unlift_eq tactic for kernels. #
This file registers the unlifting of lifted kernel expressions for the unlift_eq tactic, with the
same lemmas as the lifting.
Main declarations #
unliftKernelExpr: recursive unlifting of a lifted kernel expression.unliftKernelQ: its typed version, for given measurable equivalences.
def unliftKernelQ {x y w : Lean.Level} {X : Q(Type x)} {Y : Q(Type y)} {mX : Q(MeasurableSpace «$X»)} {mY : Q(MeasurableSpace «$Y»)} {X' Y' : Q(Type w)} {mX' : Q(MeasurableSpace «$X'»)} {mY' : Q(MeasurableSpace «$Y'»)} (ex : Q(«$X'» ≃ᵐ «$X»)) (ey : Q(«$Y'» ≃ᵐ «$Y»)) (κ' : Lean.Expr) :
Lean.MetaM
((κ' : Q(ProbabilityTheory.Kernel «$X'» «$Y'»)) × (κ : Q(ProbabilityTheory.Kernel «$X» «$Y»)) × Q(«$κ'» = «$κ».lift))
Typed version of the unlifting of a lifted kernel κ' : Kernel X' Y' by the registered
unlifting functions. Given the measurable equivalences ex : X' ≃ᵐ X and ey : Y' ≃ᵐ Y returns
κ', the unlifted kernel κ and the proof of κ' = κ.lift.
Equations
Instances For
Recursive unlifting of a kernel e lifted to the universe w. Returns the unlifted kernel
e' together with a proof of e = e'.lift. Each step is a single application of a lifting
lemma, given the unliftings of the subterms.
Equations
- One or more equations did not get rendered due to their size.