Equations
- One or more equations did not get rendered due to their size.
Instances For
def
Determinize.Proof.FiniteModel.FiniteLawMatches
(op : Spec.Paper.Op)
(kind : Spec.Paper.DistributionAction)
(arguments : List ℚ)
(outcomes : List (ℚ × ℚ))
:
Exact probabilities and the entire paper sampling law, not just its mean.
Equations
- One or more equations did not get rendered due to their size.
Instances For
theorem
Determinize.Proof.FiniteModel.finiteLawMatches_bernoulli_sample
{affinity : Spec.Paper.Affinity}
(p : ℚ)
(nonnegative : 0 ≤ p)
(bounded : p ≤ 1)
:
FiniteLawMatches Spec.Paper.Op.bernoulli (Spec.Paper.DistributionAction.sample affinity) [p] [(1 - p, 0), (p, 1)]
theorem
Determinize.Proof.FiniteModel.finiteLawMatches_bernoulli_mean
(p : ℚ)
(nonnegative : 0 ≤ p)
(bounded : p ≤ 1)
:
theorem
Determinize.Proof.FiniteModel.realListValue?_fold
(p : List ℚ)
:
Spec.Paper.realListValue?
(List.foldr Spec.Paper.Expr.cons Spec.Paper.Expr.nil
(List.map (fun (q : ℚ) => Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction ↑q) p)) = some (List.map Rat.cast p)
theorem
Determinize.Proof.FiniteModel.isValue_list_fold
(p : List ℚ)
:
(List.foldr Spec.Paper.Expr.cons Spec.Paper.Expr.nil
(List.map (fun (q : ℚ) => Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction ↑q) p)).isValue = true
theorem
Determinize.Proof.FiniteModel.finiteLawMatches_discrete_sample
(affinity : Spec.Paper.Affinity)
(p : List ℚ)
(d : Checking.FiniteDistribution)
(completed : d.probabilities = p ++ [1 - p.sum])
:
FiniteLawMatches (Spec.Paper.Op.discrete p.length) (Spec.Paper.DistributionAction.sample affinity) p
(List.map
(fun (x : ℚ × ℕ) =>
match x with
| (p, i) => (p, ↑i))
d.probabilities.zipIdx)
theorem
Determinize.Proof.FiniteModel.finiteLawMatches_discrete_mean
(p : List ℚ)
(d : Checking.FiniteDistribution)
(completed : d.probabilities = p ++ [1 - p.sum])
:
theorem
Determinize.Proof.FiniteModel.remainderDistribution_probabilities
(p : List ℚ)
(d : Checking.FiniteDistribution)
(checked : Checking.remainderDistribution p = Except.ok d)
:
theorem
Determinize.Proof.FiniteModel.finiteLawMatches_beta_mean
(a b : ℚ)
(ha : 0 < a)
(hb : 0 < b)
:
theorem
Determinize.Proof.FiniteModel.finiteLawMatches_gamma_mean
(a b : ℚ)
(ha : 0 < a)
(hb : 0 < b)
:
theorem
Determinize.Proof.FiniteModel.finiteLaw_sound
(op : Spec.Paper.Op)
(kind : Spec.Paper.DistributionAction)
(arguments : List ℚ)
(outcomes : List (ℚ × ℚ))
(success : Finite.finiteLaw op kind arguments = Except.ok outcomes)
:
FiniteLawMatches op kind arguments outcomes
Successful executable finite laws preserve exact mass and the complete real sampling measure. Unsupported or invalid calls cannot satisfy the premise.
theorem
Determinize.Proof.FiniteModel.isProbabilityMeasure_outcomeMeasure
(op : Spec.Paper.Op)
(kind : Spec.Paper.DistributionAction)
(arguments : List ℚ)
(outcomes : List (ℚ × ℚ))
(success : Finite.finiteLaw op kind arguments = Except.ok outcomes)
:
MeasureTheory.IsProbabilityMeasure (outcomeMeasure outcomes)
theorem
Determinize.Proof.FiniteModel.isValue_primitiveExpr
(site : Spec.Paper.DistributionAction × Spec.Paper.Op)
(arguments : List Spec.Paper.Expr)
:
theorem
Determinize.Proof.FiniteModel.reduce_stackExpr_primitiveExpr
(site : Spec.Paper.DistributionAction × Spec.Paper.Op)
(arguments : List ℚ)
(outcomes : List (ℚ × ℚ))
(success : Finite.finiteLaw site.2 site.1 arguments = Except.ok outcomes)
(stack : List Finite.Frame)
(shape : ∀ frame ∈ stack, FrameShape frame)
:
Spec.Paper.reduce
(stackExpr stack
(primitiveExpr site
(List.map (fun (q : ℚ) => Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction ↑q) arguments))) = Spec.Paper.Action.sample site (outcomeMeasure outcomes) fun (x : ℝ) =>
stackExpr stack (Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction x)
theorem
Determinize.Proof.FiniteModel.step_deliver_draw
(site : Spec.Paper.DistributionAction × Spec.Paper.Op)
(arguments : List ℚ)
(x : ℚ)
(environment : List Finite.Value)
(stack : List Finite.Frame)
(outcomes : List (ℚ × ℚ))
(success : Finite.finiteLaw site.2 site.1 (arguments ++ [x]) = Except.ok outcomes)
:
Finite.step (Finite.State.deliver (Finite.Value.number x) (Finite.Frame.draw site [] environment arguments :: stack)) = Except.ok
(Finite.Step.next (Finite.Evidence.sample site (arguments ++ [x]))
(List.map
(fun (x : ℚ × ℚ) =>
match x with
| (p, y) => (p, Finite.State.deliver (Finite.Value.number y) stack))
outcomes))
theorem
Determinize.Proof.FiniteModel.reduce_stateExpr_draw
(site : Spec.Paper.DistributionAction × Spec.Paper.Op)
(arguments : List ℚ)
(x : ℚ)
(environment : List Finite.Value)
(stack : List Finite.Frame)
(outcomes : List (ℚ × ℚ))
(success : Finite.finiteLaw site.2 site.1 (arguments ++ [x]) = Except.ok outcomes)
(shape : ∀ frame ∈ stack, FrameShape frame)
:
Spec.Paper.reduce
(stateExpr
(Finite.State.deliver (Finite.Value.number x) (Finite.Frame.draw site [] environment arguments :: stack))) = Spec.Paper.Action.sample site (outcomeMeasure outcomes) fun (y : ℝ) =>
stackExpr stack (Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction y)
theorem
Determinize.Proof.FiniteModel.valueExpr_probabilities
(value : Finite.Value)
(p : List ℚ)
(read : value.probabilities? = some p)
:
valueExpr value = List.foldr Spec.Paper.Expr.cons Spec.Paper.Expr.nil
(List.map (fun (q : ℚ) => Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction ↑q) p)
theorem
Determinize.Proof.FiniteModel.reduce_stateExpr_discrete
(kind : Spec.Paper.DistributionAction)
(value : Finite.Value)
(p : List ℚ)
(read : value.probabilities? = some p)
(stack : List Finite.Frame)
(outcomes : List (ℚ × ℚ))
(success : Finite.finiteLaw (Spec.Paper.Op.discrete p.length) kind p = Except.ok outcomes)
(shape : ∀ frame ∈ stack, FrameShape frame)
:
Spec.Paper.reduce (stateExpr (Finite.State.deliver value (Finite.Frame.discrete kind :: stack))) = Spec.Paper.Action.sample (kind, Spec.Paper.Op.discrete p.length) (outcomeMeasure outcomes) fun (y : ℝ) =>
stackExpr stack (Spec.Paper.Expr.real ℝ Spec.Paper.DistributionAction y)