Documentation

PolyFun.Control.Monad.Measure.Relational.Deterministic

Constructor simplification for deterministic relational semantics #

Successful deterministic constructors reduce relational judgments to their returned values. These equations let simp recognize constructors after the monad's pure has reduced.

@[simp]
theorem ExpectationWP.eRelWP_some_some {α β : Type} [MeasurableSpace α] [MeasurableSpace β] [MeasurableSingletonClass α] [MeasurableSingletonClass β] (a : α) (b : β) (g : α → β → ENNReal) :
eRelWP (some a) (some b) g = g a b

Two present optional outputs have exactly their returned post-expectation.

@[simp]
theorem ExpectationWP.relWP_some_some_iff {α β : Type} [MeasurableSpace α] [MeasurableSpace β] [MeasurableSingletonClass α] [MeasurableSingletonClass β] (a : α) (b : β) (R : α → β → Prop) :
RelWP (some a) (some b) R ↔ R a b

Two present optional outputs satisfy exactly their returned relation.

@[simp]
theorem ExpectationWP.eRelWP_ok_ok {α β : Type} [MeasurableSpace α] [MeasurableSpace β] [MeasurableSingletonClass α] [MeasurableSingletonClass β] {ε δ : Type} (a : α) (b : β) (g : α → β → ENNReal) :
eRelWP (Except.ok a) (Except.ok b) g = g a b

Two successful exceptional outputs have exactly their returned post-expectation.

@[simp]
theorem ExpectationWP.relWP_ok_ok_iff {α β : Type} [MeasurableSpace α] [MeasurableSpace β] [MeasurableSingletonClass α] [MeasurableSingletonClass β] {ε δ : Type} (a : α) (b : β) (R : α → β → Prop) :
RelWP (Except.ok a) (Except.ok b) R ↔ R a b

Two successful exceptional outputs satisfy exactly their returned relation.