theorem
Determinize.Proof.FiniteModel.successorWeight_nonnegative
{α : Type}
[DecidableEq α]
(outcomes : List (ℚ × α))
(nonnegative : ∀ entry ∈ outcomes, 0 ≤ entry.1)
(state : α)
:
theorem
Determinize.Proof.FiniteModel.weightedOutput_group
{α : Type}
[DecidableEq α]
{n : ℕ}
(states : Fin n → α)
(unique : Function.Injective states)
(outcomes : List (ℚ × α))
(nonnegative : ∀ entry ∈ outcomes, 0 ≤ entry.1)
(covered : ∀ entry ∈ outcomes, 0 < entry.1 → ∃ (i : Fin n), states i = entry.2)
(output : α → MeasureTheory.Measure ℝ)
:
weightedOutput outcomes output = ∑ i : Fin n, ENNReal.ofReal ↑(successorWeight outcomes (states i)) • output (states i)
theorem
Determinize.Proof.FiniteModel.replay_machineOutput
(candidate : Finite.Candidate)
{source : Spec.Paper.Core}
{subject : Spec.FiniteModel.Subject}
(valid : candidate.ReplayValid source subject)
(fuel : ℕ)
(i : Fin candidate.states.size)
:
theorem
Determinize.Proof.FiniteModel.replay_machineOutputMeasure
(candidate : Finite.Candidate)
{source : Spec.Paper.Core}
{subject : Spec.FiniteModel.Subject}
(valid : candidate.ReplayValid source subject)
: