Documentation

Determinize.Proof.Symbolic.TraceSamples

Trace laws at E-affinity sites #

The concrete steps of source and target at a sampleE site (concrete_sampleE, concrete_target_sampleE) and the unfolding of actualTraceLaw and targetTraceLaw there: the source extends its history by the draw, the target steps to the mean.

theorem Determinize.Proof.StepTraces.concrete_sampleE {n : ℕ} {ty : Spec.Paper.Ty} (laws : Paper.PrimitiveLaws) (expression : Paper.Symbolic.AffineExpr n) (typed : Paper.Symbolic.AffineExpr.WellTyped [] expression ty) (op : Spec.Paper.Op) (affine : List (Paper.Symbolic.Affine n)) (general : List ℝ) (continuation : Paper.Symbolic.AffineExpr (n + 1)) (actionEq : expression.symbolicReduce = Paper.Symbolic.AffineExpr.SymbolicAction.sampleE op affine general continuation) (environment : Paper.Env n) :
Spec.Paper.reduce (Paper.Symbolic.AffineExpr.realize environment expression) = Spec.Paper.Action.sample (Spec.Paper.DistributionAction.sample Spec.Paper.Affinity.E, op) ((laws.kernel op) (fun (i : Fin (Spec.Paper.affineArity op)) => (affine.getD ↑i (0, fun (x : Fin n) => 0)).eval environment, fun (i : Fin (Spec.Paper.generalArity op)) => general.getD (↑i) 0)) fun (value : ℝ) => Paper.Symbolic.AffineExpr.realize (Paper.Env.cons value environment) continuation
theorem Determinize.Proof.StepTraces.concrete_target_sampleE {n : ℕ} {ty : Spec.Paper.Ty} (expression : Paper.Symbolic.AffineExpr n) (typed : Paper.Symbolic.AffineExpr.WellTyped [] expression ty) (op : Spec.Paper.Op) (affine : List (Paper.Symbolic.Affine n)) (general : List ℝ) (continuation : Paper.Symbolic.AffineExpr (n + 1)) (actionEq : expression.symbolicReduce = Paper.Symbolic.AffineExpr.SymbolicAction.sampleE op affine general continuation) (mean : Paper.Env n) (paramsDomain : Spec.Paper.InDomain op (fun (i : Fin (Spec.Paper.affineArity op)) => (affine.getD ↑i (0, fun (x : Fin n) => 0)).eval mean, fun (i : Fin (Spec.Paper.generalArity op)) => general.getD (↑i) 0)) :
theorem Determinize.Proof.StepTraces.history_bind_snoc {β : Type u_1} [MeasurableSpace β] {n : ℕ} (laws : Paper.PrimitiveLaws) (history : Paper.Symbolic.SampleEnv laws n) (op : Spec.Paper.Op) (affine : Fin (Spec.Paper.affineArity op) → Paper.Symbolic.Affine n) (general : Fin (Spec.Paper.generalArity op) → ℝ) (family : Paper.Env (n + 1) → MeasureTheory.Measure β) (measurable : Measurable family) :
(Paper.Symbolic.SampleEnv.actualMeasure laws (history.snoc op affine general)).bind family = (Paper.Symbolic.SampleEnv.actualMeasure laws history).bind fun (env : Paper.Env n) => ((laws.kernel op) (fun (i : Fin (Spec.Paper.affineArity op)) => (affine i).eval env, general)).bind fun (value : ℝ) => family (Paper.Env.cons value env)
theorem Determinize.Proof.StepTraces.actualTraceLaw_sampleE {n : ℕ} {ty : Spec.Paper.Ty} (depth : ℕ) (history : Paper.Symbolic.SampleEnv Paper.primitiveLaws n) (expression : Paper.Symbolic.AffineExpr n) (typed : Paper.Symbolic.AffineExpr.WellTyped [] expression ty) (notValue : expression.isValue ≠ true) (op : Spec.Paper.Op) (affine : List (Paper.Symbolic.Affine n)) (general : List ℝ) (continuation : Paper.Symbolic.AffineExpr (n + 1)) (actionEq : expression.symbolicReduce = Paper.Symbolic.AffineExpr.SymbolicAction.sampleE op affine general continuation) :
actualTraceLaw (depth + 1) history expression = MeasureTheory.Measure.map (prepend none) (actualTraceLaw depth (history.snoc op (fun (i : Fin (Spec.Paper.affineArity op)) => affine.getD ↑i (0, fun (x : Fin n) => 0)) fun (i : Fin (Spec.Paper.generalArity op)) => general.getD (↑i) 0) continuation)
theorem Determinize.Proof.StepTraces.targetTraceLaw_sampleE {n : ℕ} {ty : Spec.Paper.Ty} (depth : ℕ) (history : Paper.Symbolic.SampleEnv Paper.primitiveLaws n) (safe : Paper.Symbolic.SampleEnv.DomainSafe Paper.primitiveLaws history) (expression : Paper.Symbolic.AffineExpr n) (typed : Paper.Symbolic.AffineExpr.WellTyped [] expression ty) (notValue : expression.isValue ≠ true) (op : Spec.Paper.Op) (affine : List (Paper.Symbolic.Affine n)) (general : List ℝ) (continuation : Paper.Symbolic.AffineExpr (n + 1)) (actionEq : expression.symbolicReduce = Paper.Symbolic.AffineExpr.SymbolicAction.sampleE op affine general continuation) (extendedSafe : Paper.Symbolic.SampleEnv.DomainSafe Paper.primitiveLaws (history.snoc op (fun (i : Fin (Spec.Paper.affineArity op)) => affine.getD ↑i (0, fun (x : Fin n) => 0)) fun (i : Fin (Spec.Paper.generalArity op)) => general.getD (↑i) 0)) :
targetTraceLaw (depth + 1) history expression = MeasureTheory.Measure.map (prepend none) (targetTraceLaw depth (history.snoc op (fun (i : Fin (Spec.Paper.affineArity op)) => affine.getD ↑i (0, fun (x : Fin n) => 0)) fun (i : Fin (Spec.Paper.generalArity op)) => general.getD (↑i) 0) continuation)