Documentation

LeanPool.AnomalousDiffusion.AVenhance.Infra.Section4.ThetaCommutator

First-order transport commutator identities for smooth Euclidean fields.

The scalar transport term associated with a vector field and a scalar function.

Equations
Instances For
    theorem AVenhance.Infra.Section4.classicalProduct_firstDerivative (f g : Homogenization.Vec 2 → ℝ) (hf : ContDiff ℝ (↑⊤) f) (hg : ContDiff ℝ (↑⊤) g) (i : Fin 2) (x : Homogenization.Vec 2) :
    spaceGrad (fun (y : Homogenization.Vec 2) => f y * g y) x i = f x * spaceGrad g x i + spaceGrad f x i * g x

    Coordinate derivative of a product of two smooth scalar functions.

    theorem AVenhance.Infra.Section4.classicalSpaceGrad_sub (f g : Homogenization.Vec 2 → ℝ) (hf : ContDiff ℝ (↑⊤) f) (hg : ContDiff ℝ (↑⊤) g) (i : Fin 2) (x : Homogenization.Vec 2) :
    spaceGrad (fun (y : Homogenization.Vec 2) => f y - g y) x i = spaceGrad f x i - spaceGrad g x i

    Coordinate derivative commutes with subtraction for smooth scalar functions.

    An ordered word of coordinate derivatives applied to a scalar function.

    Equations
    Instances For

      Coordinate directions of a spatial derivative word indexed by its length.

      Equations
      Instances For

        The ordered-word convention agrees with iterated Fréchet differentiation on the corresponding ordered coordinate directions.

        The ordered derivative identification with the tuple written using List.get, for hypotheses quantified over all coordinate tuples.

        Negation passes through an ordered word of spatial derivatives.

        Coordinate bounds for all order-n Fréchet derivatives immediately give the same bound for each ordered coordinate word.

        theorem AVenhance.Infra.Section4.classicalSpaceGrad_commute (f : Homogenization.Vec 2 → ℝ) (hf : ContDiff ℝ (↑⊤) f) (i j : Fin 2) (x : Homogenization.Vec 2) :
        spaceGrad (fun (y : Homogenization.Vec 2) => spaceGrad f y j) x i = spaceGrad (fun (y : Homogenization.Vec 2) => spaceGrad f y i) x j

        Smooth mixed coordinate derivatives commute.

        Smooth ordered coordinate derivatives depend only on the multiset of directions. This lets a one-derivative Leibniz split be identified with one coordinate of the gradient of the complementary word.

        A coordinate derivative can be moved through an arbitrary ordered word of smooth coordinate derivatives.

        theorem AVenhance.Infra.Section4.classicalSpaceGrad_add (f g : Homogenization.Vec 2 → ℝ) (hf : ContDiff ℝ (↑⊤) f) (hg : ContDiff ℝ (↑⊤) g) (i : Fin 2) (x : Homogenization.Vec 2) :
        spaceGrad (fun (y : Homogenization.Vec 2) => f y + g y) x i = spaceGrad f x i + spaceGrad g x i

        Coordinate derivative of a sum of smooth scalar functions.

        theorem AVenhance.Infra.Section4.classicalSpaceGrad_listSum (L : List (Homogenization.Vec 2 → ℝ)) (hL : ∀ f ∈ L, ContDiff ℝ (↑⊤) f) (i : Fin 2) (x : Homogenization.Vec 2) :
        spaceGrad L.sum x i = (List.map (fun (f : Homogenization.Vec 2 → ℝ) => spaceGrad f x i) L).sum

        All ways of distributing an ordered derivative word between two factors.

        Equations
        Instances For

          The product term attached to one split of a derivative word.

          Equations
          Instances For

            Leibniz expansion of an ordered word of coordinate derivatives.

            Equations
            Instances For

              The derivative splits with at least one derivative assigned to the first factor.

              Equations
              Instances For

                Every Leibniz split preserves the complete ordered derivative word up to permutation.

                The same shuffle invariant holds after the zero-derivative-on-drift term is removed from the transport commutator.

                The order-n derivative in a split with one derivative on the stream potential is itself a coordinate of the gradient of the complementary order-n-1 derivative.

                Specialization of the coordinate estimate to a commutator split with one derivative on its first factor.

                The full Leibniz split list contains choose n q occurrences with exactly q derivatives on its first factor, including multiplicities for repeated coordinate directions.

                The transport commutator split list has the same binomial multiplicities, with the zero-derivative-on-drift split removed.

                The finite Leibniz sum over splits with a nonempty first derivative word.

                Equations
                Instances For
                  theorem AVenhance.Infra.Section4.ThetaCommutator.classicalListSum_map_add {α : Type} (L : List α) (f g : α → ℝ) :
                  (List.map (fun (a : α) => f a + g a) L).sum = (List.map f L).sum + (List.map g L).sum

                  An arbitrary ordered coordinate derivative of a product is the finite Leibniz sum over all ways to distribute its derivative word between the factors.

                  The order-s transport commutator is precisely the Leibniz sum over splits that differentiate the drift at least once.

                  theorem AVenhance.Infra.Section4.ThetaCommutator.classicalWordDerivative_finSum (w : List (Fin 2)) (f : Fin 2 → Homogenization.Vec 2 → ℝ) (hf : ∀ (j : Fin 2), ContDiff ℝ (↑⊤) (f j)) :
                  (classicalWordDerivative w fun (x : Homogenization.Vec 2) => ∑ j : Fin 2, f j x) = fun (x : Homogenization.Vec 2) => ∑ j : Fin 2, classicalWordDerivative w (f j) x

                  Arbitrary ordered derivatives of the transport term are given by the finite Leibniz sum over the drift components and all derivative splits.

                  The arbitrary order transport commutator is the sum of exactly the Leibniz terms in which a derivative lands on the drift, written as the full product expansion with its principal term removed componentwise.

                  After cancelling the principal transport derivative, the order-s commutator is the finite sum of the Leibniz terms that differentiate a drift component.

                  theorem AVenhance.Infra.Section4.ThetaCommutator.classicalList_sum_mono {α : Type} (L : List α) (f g : α → ℝ) (h : ∀ a ∈ L, f a ≤ g a) :