Uniqueness of the additive sewing #
Any two additive two-parameter maps with a germ bound C·ω^θ, θ > 1,
agree (telescoping over fine partitions). Consequently the additive sewing
of RoughPaths.Sewing.sewing is unique.
theorem
RoughPaths.Sewing.pairSum_eq_of_additive
{T : Type u}
{E : Type v}
[LinearOrder T]
[AddCommMonoid E]
{I : T → T → E}
(hadd : ∀ ⦃a u b : T⦄, a ≤ u → u ≤ b → I a u + I u b = I a b)
{mid : List T}
{s t : T}
:
Pair sums of an additive two-parameter map telescope.
theorem
RoughPaths.Sewing.eq_of_additive_of_germ_bound
{T : Type u}
{E : Type v}
[LinearOrder T]
[NormedAddCommGroup E]
(ω : Control T)
(Ξ : T → T → E)
{θ : ℝ}
(hθ : 1 < θ)
{C C' : ENNReal}
(hC : C ≠ ⊤)
(hC' : C' ≠ ⊤)
(hfine : HasFinePartitions ω)
{I I' : T → T → E}
(hadd : ∀ ⦃a u b : T⦄, a ≤ u → u ≤ b → I a u + I u b = I a b)
(hadd' : ∀ ⦃a u b : T⦄, a ≤ u → u ≤ b → I' a u + I' u b = I' a b)
(hI : ∀ ⦃a b : T⦄, a ≤ b → ‖I a b - Ξ a b‖ₑ ≤ C * ω.toFun a b ^ θ)
(hI' : ∀ ⦃a b : T⦄, a ≤ b → ‖I' a b - Ξ a b‖ₑ ≤ C' * ω.toFun a b ^ θ)
{s t : T}
(hst : s ≤ t)
(hω : ω.toFun s t ≠ ⊤)
:
Uniqueness of the additive sewing: two additive maps with germ
bounds C·ω^θ, C'·ω^θ, θ > 1, agree on comparable pairs.