Documentation

RoughPaths.Branched.Planar

Planarly branched rough paths via the MKW Hopf algebra #

Planarly branched rough paths (Curry–Ebrahimi-Fard–Manchon–Munthe-Kaas, Planarly branched rough paths and rough differential equations on homogeneous spaces) are defined as Hopf rough paths over the MKW bialgebra: increments are characters of mkwBialg — equivalently, shuffle characters on ordered forests (isShuffleCharacter_iff_isCharacter) — and Chen's identity is convolution in the character monoid, i.e. the Grossman–Larson convolution dual to the Munthe-Kaas–Wright coproduct (mkwConvolution_eq_conv). The generic theory (unit path, time reparametrisation, reverse increments, coefficient Chen) comes from RoughPaths.HopfRoughPath.

At level 2 the ordered forests of order at most two are [•], [chain2] and [•,•], and the MKW coproduct on them yields the Chen relations X^{[•]}(s,u) = X^{[•]}(s,t) + X^{[•]}(t,u) and X^ω(s,u) = X^ω(s,t) + X^{[•]}(s,t)·X^{[•]}(t,u) + X^ω(t,u) for ω ∈ {[chain2], [•,•]}. The controlled-path germ Ξ = X^{[•]}·Y + X^{[chain2]}·Y' + X^{[•,•]}·Y'' therefore has defect of order ω^{3α} — with Gubinelli derivative Y' + Y'' — and sews into the planarly branched rough integral.

Planarly branched rough paths #

@[reducible, inline]
abbrev RoughPaths.PlanarBranchedRoughPath (T : Type u) (R : Type v) [CommSemiring R] :
Type (max u v)

A planarly branched rough path is a Hopf rough path over the Munthe-Kaas–Wright bialgebra: increments are shuffle characters on ordered forests and Chen's identity is Grossman–Larson convolution.

Equations
Instances For

    Increments are shuffle characters on ordered forests.

    @[simp]
    theorem RoughPaths.PlanarBranchedRoughPath.coeff_nil {T : Type u} {R : Type v} [CommSemiring R] (X : PlanarBranchedRoughPath T R) (s t : T) :
    (X.increment s t) [] = 1

    Chen's identity in MKW coefficient form.

    Chen's identity on forests of order at most two #

    For shuffle characters, the two-bullet coefficient is determined by the first level: 2·X^{[•,•]} = (X^{[•]})².

    Level-2 analytic bounds and controlled paths #

    Level-2 Hölder-type bounds for a real planarly branched rough path: order-one forests of size ω^α, order-two forests of size ω^{2α}.

    Instances For

      A path controlled by a level-2 planarly branched rough path, with one derivative slot per order-two forest; the Gubinelli derivative pairing the first level is their sum.

      Instances For

        The planarly branched Gubinelli germ #

        noncomputable def RoughPaths.planarGerm {E : Type u_1} [NormedAddCommGroup E] [NormedSpace E] {X : PlanarBranchedRoughPath } {ω : Control } {α : } (Z : PlanarControlledPath X ω α E) :
        E

        The planarly branched Gubinelli germ: one term per forest of order at most two.

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

          The algebraic defect identity from the MKW Chen relations on small forests.

          theorem RoughPaths.planarGerm_defect {E : Type u_1} [NormedAddCommGroup E] [NormedSpace E] {X : PlanarBranchedRoughPath } {ω : Control } {α : } (hX : IsLevel2PlanarBranchedRoughPath X ω α) (Z : PlanarControlledPath X ω α E) a b c : :
          a bb cplanarGerm Z a c - planarGerm Z a b - planarGerm Z b c‖ₑ (Z.Cy + 2 * Z.Cd) * ω.toFun a c ^ (3 * α)

          The analytic defect bound: order ω^{3α} with constant Cy + 2·Cd.

          Existence and uniqueness of the planarly branched rough #

          integral

          theorem RoughPaths.exists_planarBranchedRoughIntegral {E : Type u_1} [NormedAddCommGroup E] [NormedSpace E] {X : PlanarBranchedRoughPath } {ω : Control } {α : } [CompleteSpace E] (hX : IsLevel2PlanarBranchedRoughPath X ω α) (Z : PlanarControlledPath X ω α E) (hfine : Sewing.HasFinePartitions ω) ( : ∀ ⦃s t : ⦄, s tω.toFun s t ) :
          ∃ (I : E), (∀ ⦃s u t : ⦄, s uu tI s u + I u t = I s t) (∀ ⦃s t : ⦄, s tI s t - planarGerm Z s t‖ₑ Sewing.sewingConst (3 * α) * ((Z.Cy + 2 * Z.Cd) * ω.toFun s t ^ (3 * α))) ∀ ⦃s t : ⦄, s t∀ (ε : ENNReal) (mid : List ), List.IsChain (fun (a b : ) => a b (Control.constMul ((Z.Cy + 2 * Z.Cd) ^ (3 * α)⁻¹) ω).toFun a b ε) (s :: (mid ++ [t]))I s t - Sewing.pairSum (planarGerm Z) (s :: (mid ++ [t]))‖ₑ Sewing.sewingConst (3 * α) * (ε ^ (3 * α - 1) * (Control.constMul ((Z.Cy + 2 * Z.Cd) ^ (3 * α)⁻¹) ω).toFun s t)

          Existence of the planarly branched rough integral: an additive Y dX with germ estimate of order ω^{3α}, approximating compensated Riemann sums of fine partitions.

          theorem RoughPaths.planarBranchedRoughIntegral_unique {E : Type u_1} [NormedAddCommGroup E] [NormedSpace E] {X : PlanarBranchedRoughPath } {ω : Control } {α : } (hX : IsLevel2PlanarBranchedRoughPath X ω α) (Z : PlanarControlledPath X ω α E) {C C' : ENNReal} (hC : C ) (hC' : C' ) (hfine : Sewing.HasFinePartitions ω) {I I' : E} (hadd : ∀ ⦃a u b : ⦄, a uu bI a u + I u b = I a b) (hadd' : ∀ ⦃a u b : ⦄, a uu bI' a u + I' u b = I' a b) (hI : ∀ ⦃a b : ⦄, a bI a b - planarGerm Z a b‖ₑ C * ω.toFun a b ^ (3 * α)) (hI' : ∀ ⦃a b : ⦄, a bI' a b - planarGerm Z a b‖ₑ C' * ω.toFun a b ^ (3 * α)) {s t : } (hst : s t) ( : ω.toFun s t ) :
          I s t = I' s t

          Uniqueness of the planarly branched rough integral among additive maps with a germ bound of order 3α > 1.