SearcharxivSearch

arXiv · 2205.00582

A Transfer Principle for Branched Rough Paths

Abstract

A branched rough path $X$ consists of a rough integral calculus for $X \colon [0, T] \to \mathbb R^d$ which may fail to satisfy integration by parts. Using Kelly's bracket extension [Kel12], we define a notion of pushforward of branched rough paths through smooth maps, which leads naturally to a definition of branched rough path on a smooth manifold. Once a covariant derivative is fixed, we are able to give a canonical, coordinate-free definition of integral against such rough paths. After characterising quasi-geometric rough paths in terms of their bracket extension, we use the same framework to define manifold-valued rough differential equations (RDEs) driven by quasi-geometric rough paths. These results extend previous work on $3 > p$-rough paths [ABCRF22], itself a generalisation of the Ito calculus on manifolds developed by Meyer and Emery [Mey81, E89, E90], to the setting of non-geometric rough calculus of arbitrarily low regularity.

Explore related subjects

Keep this discovery

BibTeXRIS

Emilio Ferrucci. 2022-05-01. A Transfer Principle for Branched Rough Paths. https://arxiv.org/abs/2205.00582

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA