import Determinize.Proof.FiniteModel.Executionimport Determinize.Proof.FiniteModel.Administrativenamespace Determinize.Proof.FiniteModelopen Spec.Paper Determinize.Finite Checking Binding MeasureTheorytheorem sameObservations_of_eq (before after : State) (equal : stateExpr before = stateExpr after) : SameObservations before after := by simp [SameObservations, equal]theorem paperStep_next (before after : State) (notValue : (stateExpr before).isValue = false) (reduction : reduce (stateExpr before) = .next (stateExpr after)) : PaperStep before [(1, after)] := by refine ⟨?_, ?_, ?_⟩ · cases h : stateExpr before <;> simp_all [Cumulative.outputMeasure, Expr.isValue] · intro fuel simp [Cumulative.outputMeasure, reduction, weightedOutput] · intro fuel simp [DomainSafeAt, notValue, reduction]theorem paperStep_sample (before : State) (site : DistributionAction × Op) (arguments : List Rat) (outcomes : List (Rat × Rat)) (stack : List Frame) (success : finiteLaw site.2 site.1 arguments = .ok outcomes) (notValue : (stateExpr before).isValue = false) (reduction : reduce (stateExpr before) = .sample site (outcomeMeasure outcomes) (fun x ↦ stackExpr stack (.real x))) : PaperStep before (outcomes.map fun (p, x) ↦ (p, .deliver (.number x) stack)) := by refine ⟨?_, ?_, ?_⟩ · cases h : stateExpr before <;> simp_all [Cumulative.outputMeasure, Expr.isValue] · intro fuel simp only [Cumulative.outputMeasure, reduction] rw [outcomeMeasure_bind _ _ (Proof.Paper.measurable_sample_cumulative fuel _ _ _ _ reduction)] simp only [weightedOutput, List.map_map, Function.comp_def, stateExpr, valueExpr] · intro fuel have mass := (isProbabilityMeasure_outcomeMeasure _ _ _ _ success).measure_univ simp only [DomainSafeAt, notValue, Bool.false_eq_true, ↓reduceIte, reduction, mass, true_and, outcomeMeasure_ae, List.mem_map] constructor · intro safety entry member positive obtain ⟨⟨p, x⟩, member, rfl⟩ := member simpa only [stateExpr, valueExpr] using safety (p, x) member positive · intro safety entry member positive simpa only [stateExpr, valueExpr] using safety (entry.1, .deliver (.number entry.2) stack) ⟨entry, member, rfl⟩ positivetheorem sameObservations_reject (environment : List Value) (stack : List Frame) : SameObservations (.eval .reject environment stack) .rejected := by have left := reduce_stackExpr_of_absorbing stack .reject rfl rfl have right := reduce_stackExpr_of_absorbing [] .reject rfl rfl have equality : stateExpr (.eval .reject environment stack) = stackExpr stack .reject := by simp [stateExpr, close, interpret, Expr.map, Expr.mapVars] refine ⟨?_, ?_⟩ · intro fuel rw [equality, Cumulative.absorbing_zero _ left.1 left.2] exact (Cumulative.absorbing_zero _ right.1 right.2 fuel).symm · intro fuel exact iff_of_true ((equality ▸ domainSafe_of_absorbing _ left.1 left.2) fuel) (domainSafe_of_absorbing _ right.1 right.2 fuel)theorem stepMeaning_returned (reward : Rat) : StepMeaning (.deliver (.number reward) []) (.returned reward) := by have realState : stateExpr (.deliver (.number reward) []) = .real (reward : ℝ) := by simp [stateExpr, stackExpr, valueExpr] constructor · intro fuel rw [realState] induction fuel with | zero => rfl | succ fuel ih => exact ih · intro fuel rw [realState] cases fuel <;> trivialtheorem stepMeaning_rejected : StepMeaning .rejected .rejected := by exact ⟨Cumulative.absorbing_zero .reject rfl rfl, domainSafe_of_absorbing .reject rfl rfl⟩end Determinize.Proof.FiniteModel