Source lean/Determinize/Proof/Traces/Labels.lean
import Determinize.Proof.Semantics.Measurabilityimport Determinize.Proof.Traces.Detailed/-!# Trace labels`siteOp` is the primitive a site records (a G-affinity stochastic draw, `none` otherwise)and `generationOp` reads it off a skeleton, so that whether the next step records a draw is ameasurable function of the expression; `entry` builds the recorded event.-/namespace Determinize.Proof.StepTracesopen MeasureTheory ProbabilityTheory Determinize.Spec.Paper Determinize.Proof.StepTracesopen Determinize.Proof.Papernoncomputable sectioninstance : MeasurableSpace (Option Op) := ⊤instance : MeasurableSingletonClass (Option Op) := ⟨fun _ ↦ trivial⟩/-- The primitive a site records: a general-affinity stochastic draw and nothing else. -/def siteOp : DistributionAction × Op → Option Op  | (.sample .G, op) => some op  | _ => none@[simp] theorem siteOp_determinize (kind : DistributionAction) (op : Op) :    siteOp (kind.determinize, op) = siteOp (kind, op) := by  cases kind with  | sample affinity => cases affinity <;> rfl  | mean => rfl/-- The active generation-affinity sampling site, following call-by-value evaluation order. -/def generationOp : Skeleton → Option Op  | .pair l r | .cons l r | .app l r  | .add l r | .mul l r | .div l r | .lt l r =>    if l.isValue then generationOp r else generationOp l  | .fst x | .snd x | .inl x | .inr x  | .neg x => generationOp x  | .matchSum x _ _ | .matchList x _ _ | .ite x _ _  | .letE x _ => generationOp x  | .uniform kind l r =>    if l.isValue then if r.isValue then siteOp (kind, .uniform) else generationOp r    else generationOp l  | .gaussian kind l r =>    if l.isValue then if r.isValue then siteOp (kind, .gaussian) else generationOp r    else generationOp l  | .poisson kind x => if x.isValue then siteOp (kind, .poisson) else generationOp x  | .discrete kind probabilities =>    if probabilities.isValue then      probabilities.literalListArity?.bind (fun n ↦ siteOp (kind, .discrete n))    else generationOp probabilities  | .bernoulli kind x => if x.isValue then siteOp (kind, .bernoulli) else generationOp x  | .exponential kind x =>    if x.isValue then siteOp (kind, .exponential) else generationOp x  | .beta kind l r =>    if l.isValue then if r.isValue then siteOp (kind, .beta) else generationOp r    else generationOp l  | .gamma kind l r =>    if l.isValue then if r.isValue then siteOp (kind, .gamma) else generationOp r    else generationOp l  | _ => none/-- The event recording `value` at a site labelled `op`; `none` when the site records nothing. -/def entry (op : Option Op) (value : ℝ) : Event := op.map (fun op ↦ (op, value))theorem generationEvent_eq_entry (site : DistributionAction × Op) (value : ℝ) :    generationEvent site value = entry (siteOp site) value := by  rcases site with ⟨kind, op⟩  cases kind with  | sample affinity => cases affinity <;> rfl  | mean => rfltheorem measurable_event_some : Measurable (some : Op × ℝ → Event) := by  apply measurable_comap_iff.mpr  exact measurable_inltheorem measurable_entry : Measurable (fun pair : Option Op × ℝ ↦ entry pair.1 pair.2) := by  apply measurable_from_prod_countable_right  intro op  cases op with  | none => exact measurable_const  | some op => exact measurable_event_some.comp (measurable_const.prodMk measurable_id)theorem measurable_generationEvent (site : DistributionAction × Op) :    Measurable (generationEvent site) := by  have eq : generationEvent site = entry (siteOp site) := funext (generationEvent_eq_entry site)  rw [eq]  exact measurable_entry.comp (measurable_const.prodMk measurable_id)theorem generationOp_value {skeleton : Skeleton} (value : skeleton.isValue = true) :    generationOp skeleton = none := by  fun_induction Expr.isValue skeleton <;> simp_all [generationOp]theorem reduce_site {expression : Expr} {site : DistributionAction × Op} {fiber : Measure ℝ}    {continuation : ℝ → Expr} (reduction : reduce expression = .sample site fiber continuation) :    generationOp expression.skeleton = siteOp site := by  cases expression <;> rw [reduce.eq_def] at reduction  all_goals dsimp only at reduction  all_goals repeat' first | contradiction | split at reduction  all_goals simp_all only [Expr.skeleton, generationOp, Expr.literalListArity?_skeleton,    ← realListValue?_map_length, Option.map_some, Option.bind_some,    ← isValue_eq_skeletonIsValue, ↓reduceIte]  all_goals first    | (cases reduction; rfl)    | (obtain ⟨inner, h, _⟩ := Action.wrap_eq_sample reduction       exact reduce_site h)termination_by sizeOf expressiondecreasing_by  all_goals subst_vars  all_goals simp_wf  all_goals omegaendend Determinize.Proof.StepTraces