Documentation

Determinize.Proof.Semantics.Internal

Semantic objects used by the proof #

This module defines the measurable skeleton representation, symbolic sample histories, certified one-step kernel, and exact-depth output semantics. The operational reducer and operation-domain safety are reviewer-facing definitions in Spec.Semantics.

Interpret one reduction action as a measure of successor expressions.

Equations
Instances For

    The measurable transition used by the proof's expression kernels.

    Equations
    Instances For
      def Determinize.Spec.Paper.Expr.realArity {Literal : Type} :
      Expr Literal → ℕ
      Equations
      Instances For
        @[reducible, inline]

        An affine expression in the ordered E samples.

        Equations
        Instances For
          def Determinize.Proof.Paper.Symbolic.Affine.eval {sampleCount : ℕ} (expression : Affine sampleCount) (environment : Env sampleCount) :
          Equations
          • expression.eval environment = expression.1 + ∑ i : Fin sampleCount, expression.2 i * environment i
          Instances For

            The linear structure of affine expressions: negation, sum and scaling are pointwise; the newest sample is prepended with Fin.cons and dropped with Fin.tail.

            Equations
            • expression.neg = (-expression.1, fun (index : Fin n) => -expression.2 index)
            Instances For
              Equations
              • left.add right = (left.1 + right.1, fun (index : Fin n) => left.2 index + right.2 index)
              Instances For
                def Determinize.Proof.Paper.Symbolic.Affine.smul {n : ℕ} (scalar : ℝ) (expression : Affine n) :
                Equations
                Instances For

                  The same expression over one more sample, which it does not use.

                  Equations
                  Instances For

                    Drop the coefficient of the newest sample.

                    Equations
                    Instances For
                      @[simp]
                      theorem Determinize.Proof.Paper.Symbolic.Affine.eval_neg {n : ℕ} (expression : Affine n) (environment : Env n) :
                      expression.neg.eval environment = -expression.eval environment
                      @[simp]
                      theorem Determinize.Proof.Paper.Symbolic.Affine.eval_add {n : ℕ} (left right : Affine n) (environment : Env n) :
                      (left.add right).eval environment = left.eval environment + right.eval environment
                      theorem Determinize.Proof.Paper.Symbolic.Affine.eval_smul {n : ℕ} (scalar : ℝ) (expression : Affine n) (environment : Env n) :
                      (smul scalar expression).eval environment = scalar * expression.eval environment
                      @[simp]
                      theorem Determinize.Proof.Paper.Symbolic.Affine.eval_weaken {n : ℕ} (expression : Affine n) (head : ℝ) (environment : Env n) :
                      expression.weaken.eval (Env.cons head environment) = expression.eval environment
                      @[simp]
                      theorem Determinize.Proof.Paper.Symbolic.Affine.eval_fresh (n : ℕ) (head : ℝ) (environment : Env n) :
                      (fresh n).eval (Env.cons head environment) = head

                      Ordered symbolic E-sample environment from the paper.

                      Instances For

                        Every recorded primitive call is in-domain almost surely under its prefix law.

                        Equations
                        Instances For

                          Measurability and subprobability laws for the specified pointwise reduction.

                          Instances For
                            Equations
                            • One or more equations did not get rendered due to their size.
                            Instances For

                              The paper's big-step meaning is the pointwise limit of absorbing value mass.

                              Equations
                              Instances For