Abstract
Existence and uniqueness for rough flows, transport and continuity equations driven by general geometric rough paths are established.
1 Introduction
We consider the transport equation, here posed (w.l.o.g.) as terminal value problem. This is,
for fixed \(T>0\), with vector fields \(f = (f_1,\ldots ,f_d)\) driven by a \(\mathcal {C}^1\)driving signal \(W=(W^1,\ldots ,W^d)\). The canonical pairing of \(Du =D_x u = (\partial _{x^1}u,\ldots ,\partial _{x^n}u)\) with a vector field is indicated by a dot, and we already used the operator / vector notation
By the methods of characteristics, the unique (classical) \(\mathcal {C}^{1, 1}\) transport solution \(u:[0, T] \times {{\mathbb {R}}}^n \rightarrow {{\mathbb {R}}}\), is given explicitly by
provided \(g \in \mathcal {C}^1\) and the vector fields \(f_1, \ldots , f_d\) are nice enough (\(\mathcal {C}^1_b\) will do) to ensure a \(\mathcal {C}^1\) solution flow for the ODE
In turn, solving this ODE with random initial data induces a natural evolution of measures, given by the continuity  or forward equation
Wellposedness of the “trinity” transport/flow/continuity will depend on the regularity of the data. For \(W \in \mathcal {C}^1\) we have an effective vector field
which is continuous in \(t \in [0,T]\) and inherits the regularity of f. In particular, \(f \in \mathcal {C}^1\) will be sufficient for a \(\mathcal {C}^{1,1}\)flow. In a landmark paper, DiPerna–Lions [9] and then Ambrsosio [1], showed that the transport problem (weak solutions) is wellposed under bounds on \({{\,\mathrm{div}\,}}b\) (rather than \(D_x b\)) which in turn leads to a generalized flow. Another fundamental direction may be called regularisation by noise, based on the observation that generically \({\dot{X}} = f_0(X) + (noise)\) is much better behaved than the noisefree problem, see e.g. [2, 4, 6, 10, 12, 21].
Our work is not concerning with DiPernaLions type analysis, nor regularisation by noise. In fact, our driving vector fields will be very smooth, to compensate for the the irregularity of the noise, which we here assumed to be very rough (This tradeoff is typical in rough paths and regularity structures.)
Specifically, we continue a programme started independently by Bailleul–Gubinelli [3] (see also [8]) and Diehl et al. [7] and take W as a rough path, henceforth called \({\mathbf{W}}\). As in these works, we are interested in an intrinsic notion of solution (Rough path stability of transport problems was already noted in [5]). The contribution of this article is a treatment of rough noise of arbitrarily low regularity. Based on a suitable definition of solution, carefully introduced below, we can show
Theorem 1.1
Assume \({\mathbf{W}}\) is a weakly geometric rough path of Hölder regularity with exponent \(\gamma \in (0,1]\). Assume f has \(2\lfloor \gamma ^{1}\rfloor +1\) bounded derivatives. Then there is a unique spatially regular (resp. measurevalued) solution to the rough transport (resp. continuity) equation with regular terminal data (resp. measurevalued initial data).
This should be compared with [3, 7], which both treat the “level2 case”, with Hölder noise of exponent \(\gamma > 1/3\). Treating the general case, i.e. with arbitrarily small Hölder exponent, requires us in particular to fully quantify the interaction of iterated integrals, themselves constrained by shufflerelations, and the controlled structure of the PDE problem at hand. In fact, the shuffle relations will be seen crucial to preserve the hyperbolic nature of the rough transport equation. This is different for (ordinary) rough differential equations where the shuffle relations can be discarded at the price of working with branched (think: Itôtype) rough paths. For what it’s worth, our arguments restricted to the (wellknown) level2case still contain some worthwhile simplifications with regard to the existing literature, e.g. by avoiding the analysis of an adjoint equation [7] and showing uniqueness for weak solutions of the continuity equations via a small class of test functions. On our way we also (have to) prove some facts on (controlled) geometric rough paths of independent interest, not (or only in the branched setting [16, 18]) available in the literature.
Relation to existing works: Unlike the case of rough transport equation, when it comes to stochastic constructions it is impossible to mention all related works stretching over more than four decades, from e.g. Funaki [13], Ogawa [23] to recent works such as [24] with fractional noise and Russo–Valois integration.
The many benefits of a robust theory of stochastic partial differential equations, by combining a deterministic RPDE theory with Brownian and more general noise, are now well documented and need not be repeated in detail. Let us still recall one example of interest: multidimensional fractional Brownian motion admits a canonical geometric rough path lift (see e.g. [11]) \(1/4 < \alpha<\) H, which constitutes an admissible rough noise for our rough transport and continuity equations. Various authors (see for example Unterberger [26], Nualart and Tindel [22], etc.) have constructed “renormalised” canonical fractional Brownian rough paths for any \(H>0\), fully covered by Theorem 1.1.
1.1 Notations
We fix once and for all a time \(T>0\). In what follows we abbreviate estimates of the form \( (a)  (b)  \lesssim ts^\gamma \) by writing \((a) \underset{\gamma }{=} (b)\). Given \(\gamma \in (0,1)\) we denote by \(\mathcal {C}^\gamma \) the classical Hölder space, i.e. consisting of functions \(f:[0,T]\rightarrow {\mathbb {R}}\) such that
Throughout the paper we say geometric rough path, when we really mean weakly geometric rough path (since we only work with this type of rough path, the difference [14] will not matter to us).
2 Rough paths
We start by reviewing the definition of geometric rough paths of roughness \(\gamma \in (0,1)\) and controlled rough paths. We will do so in a Hopfalgebraic language following [18], but before we will introduce some basic concepts.
A word of length \(p\ge 1\) over the alphabet \(\{1,\ldots ,d\}\) is a tuple \(w=(i_1,\ldots ,i_p)\in \{1,\ldots ,d\}^p\), and we set \(w:=p\). We denote by \(\varepsilon \) the empty word, which is by convention the unique word with zero length. Given two nonempty words \(v=(i_1,\ldots ,i_p)\) and \(w=(i_{p+1},\ldots ,i_{p+q})\), we denote by \(vw:=(i_1,\ldots ,i_p,i_{p+1},\ldots ,i_{p+q})\) their concatenation. By definition \(\varepsilon w=w\varepsilon =w\). We observe that in any case \(vw=v+w\). The concatenation product is associative but not commutative.
The symmetric group \({\mathbb {S}}_p\) acts on words of length p by permutation of its entries, that is, \(\sigma .w:=(i_{\sigma (1)},\ldots ,i_{\sigma (p)})\). Given two integers \(p,q\ge 1\), a (p, q)shuffle is a permutation \(\sigma \in {\mathbb {S}}_{p+q}\) such that
We denote by \({{\,\mathrm{Sh}\,}}(p,q)\) the set of all (p, q)shuffles.
2.1 The shuffle algebra
The shuffle product was introduced by Ree [25] to study the combinatorial properties of iterated integrals, following K.T. Chen’s work. Let \(d\ge 1\) be fixed, and consider the tensor algebra H over \({{\mathbb {R}}}^d\), which is defined to be the direct sum
A linear basis for H is given by pure tensors \(e_{i_1}\otimes \cdots \otimes e_{i_p}\), \(p\ge 1\) where \(\{e_1,\ldots ,e_d\}\) is a basis of \({{\mathbb {R}}}^d\), and the additional element \(\mathbf {1}\) which generates \((\mathbb {R}^d)^{\otimes 0}:={{\mathbb {R}}}\mathbf {1}\). In order to ease the notation we denote, for a word \(w=(i_1,\ldots ,i_p)\), \(e_w:=e_{i_1}\otimes e_{i_2}\otimes \cdots \otimes e_{i_p}\). By definition, the set \(\{e_w:w=p\}\) is a linear basis for \(({{\mathbb {R}}}^d)^{\otimes p}\) for any \(p\ge 0\).
The space H is endowed with a product , called the shuffle product, defined on pure tensors as
There is also another operation, called the deconcatenation coproduct \(\Delta :H\rightarrow H\otimes H\), defined by
The shuffle product and the deconcatenation coproduct satisfy a compatibility relation (which will not play any role in the sequel), turning the tripe into a graded connected bialgebra. This implies the existence of a linear map \(S:H\rightarrow H\), called the antipode, turning into a Hopf algebra. In our particular setting, S can be explicitly computed on basis elements by \(S(e_{i_1\cdots i_p})=(1)^pe_{i_p\cdots i_1}\).
The coproduct endows the dual space \(H^*\) with an algebra structure via the convolution product given, for \(g,h\in H^*\), by
On pure tensor this yields
A character is a linear map \(g\in H^*\) such that for all \(x,y\in H\). It is a standard result (see e.g. [20]) that the collection of all characters on H forms a group G under the convolution product whose identity is the function \(\mathbf {1}^*\in H^*\), defined by \(\mathbf {1}^*(e_b)=0\) for every word b and \(\mathbf {1}^*(\mathbf {1})=1\). The inverse of an element \(g\in G\) can be computed by using the antipode: \(g^{1}=g\circ S\).
Given \(N\ge 0\), we consider the stepN truncated tensor algebra
Definition 2.1
A stepN truncated character is a linear map \(g\in H_N^*\) such that
for all \(x\in ({{\mathbb {R}}}^d)^{\otimes p}\) and \(y\in ({{\mathbb {R}}}^d)^{\otimes q}\) with \(p+q\le N\).
It is not hard to show that the set \(G^{(N)}\) of all stepN truncated characters is also a group under the convolution product, whose identity is again \(\mathbf {1}^*\). Denoting by \(e_1^*,\ldots ,e^*_d\) the basis of \({{\mathbb {R}}}^d\) dual to \(\{e_1,\ldots ,e_d\}\), we introduce the dual basis \((e_a^*)\) of \(H_N^*\) in the canonical way, that is, for a word w we denote by \(e_w^*\) the unique linear map on \(H_N\) such that
The convolution product of two of these basis elements can be explicitly computed. Indeed, by definition
which is nonzero if and only if \(w=uv\), in which case \(\langle e_u^*\star e_v^*,e_w\rangle =1\). Therefore \(e_u^*\star e_v^*=e_{uv}^*\). For this reason this product is also known as the concatenation product.
2.2 Geometric rough paths
We now recall the notion of geometric rough paths. The group \(G^{(N)}\) can be endowed with a subadditive homogeneous norm \(\Vert \cdot \Vert _N:G^{(N)}\rightarrow {{\mathbb {R}}}_+\), see [19] for further details. This allows us to define a left invariant metric on \(G^{(N)}\) by setting
Definition 2.2
Let \({N_{\gamma }}:=\lfloor \gamma ^{1}\rfloor \) denote the integer part of \(\gamma ^{1}\). A geometric rough path of regularity \(\gamma \) is a \(\gamma \)Hölder path \({\mathbf{W}}:[0,T]\rightarrow (G^{(N_\gamma )},d_N)\). The set of all geometric rough paths of regularity \(\gamma \) will be denoted by \(\mathscr {C}^\gamma \).
By definition of the increments \({\mathbf{W}}_{st}:={\mathbf{W}}_s^{1}\star {\mathbf{W}}_t\) satisfy the socalled Chen’s relations
for all \(0\le s,u,t\le T\). Moreover, by construction of the homogeneous norm \(\Vert \cdot \Vert _{N}\), for any word w such that \(w\le N_{\gamma }\) one has
2.3 Controlled rough paths and rough integrals
One of the main goals of rough paths theory is to give meaning to solutions of controlled equations of the form
for some collection of sufficiently regular vector fields \(f_1,\ldots , f_d\) on \({{\mathbb {R}}}^n\) and where the driving signals \(W^1,\ldots , W^d\) are very irregular. The general philosophy is that if the smoothness of the vector fields compensates the lack of regularity of the driving signals, then we can still have existence of solutions given that we reinterpret the equation in the appropriate sense. The central ingredient for proving this kind of results is the notion of controlled rough path which we now recall.
Definition 2.3
[11, 16] Let \({\mathbf{W}}\in \mathscr {C}^{\gamma }\) and \(1\le N\le N_{\gamma }+1\). A rough path controlled by \({\mathbf{W}}\) is a path \({\mathbf{X}}:[0,T]\rightarrow H_{N1}\) if for any word w such that \(\vert w\vert \le N1\) the path \(t\mapsto \langle e_w^*,{\mathbf{X}}_t\rangle \in \mathcal {C}^\gamma \) and
for all \(s<t\). We denote by \(\mathscr {D}^{N\gamma }_{{\mathbf{W}}}\) the (vector) space of paths \({\mathbf{X}}\) satisfying (2.6).
We say that a path \(X:[0,T]\rightarrow {{\mathbb {R}}}\) is controlled by \({\mathbf{W}}\) if there exists a controlled path \({\mathbf{X}}\in \mathscr {D}^{N\gamma }_{{\mathbf{W}}}\) such that \(\langle \mathbf {1}^*,{\mathbf{X}}_t\rangle =X_t\); we call \({\mathbf{X}}\) a controlled rough path above (the controlled path) X.
Remark 2.4
The definition in [11] seems more restrictive in that one always take \(N=N_\gamma \), which is the minimal value of N required for rough integration. The case \(N=N_\gamma +1\) is convenient to keep track of the additional information obtained by rough integration, see Remark 2.7.
Remark 2.5
Alternatively, by writing \({\mathbf{X}}\) and \({\mathbf{W}}\) as the sums
the condition in Eq. (2.6) can be explicitly written
for any word w.
By construction of the vector space \(\mathscr {D}^{N\gamma }_{{\mathbf{W}}}\), the quantity
is finite for any \({\mathbf{X}}\in \mathscr {D}^{N\gamma }_{{\mathbf{W}}}\). We can easily show that \( \Vert \cdot \Vert _{{\mathbf{W}};N\gamma } \) is a seminorm, and \(\mathscr {D}^{N\gamma }_{{\mathbf{W}}}\) becomes a Banach space under the norm
We extend the notion of controlled rough path above a vectorvalued path \(X:[0,T]\rightarrow \mathbb {R}^n\). In this case, the path \({\mathbf{X}}\) takes values in \((H_{N1})^n\), that is, each component path \(\langle e_w^*,{\mathbf{X}}\rangle \) is a vector of \({{\mathbb {R}}}^n\), which we denote by
Then we require the bound in Eq. (2.6) to hold componentwise, or equivalently, we can replace the absolute value of the lefthand side by any norm on \({{\mathbb {R}}}^n\). We denote this space by \((\mathscr {D}^{N\gamma }_{{\mathbf{W}}})^{n}\).
Using the higherorder information contained in the controlled rough path \(\mathbf {X}\in \mathscr {D}^{N\gamma }_{{\mathbf{W}}}\), we recall the rigorous notion of rough integral of \({\mathbf{X}}\) against \({\mathbf{W}}\). For its proof see [11].
Theorem 2.6
Let \({\mathbf{W}}\in \mathscr {C}^{\gamma }\) and \({\mathbf{X}}\in \mathscr {D}^{N_{\gamma }\gamma }_{{\mathbf{W}}}\). For every \(i\in \{1,\ldots ,d\}\) there exists a unique real valued path in \(\mathcal {C}^{\gamma }\)
where \(\pi \) is a sequence of partitions of [0, t] whose mesh \(\pi \) converges to 0. We call it the rough integral of X with respect to \(W^i\). Moreover one has the estimate
for any \(s<t\). Introducing the function \(\int _0^{\cdot }{\mathbf{X}}_u\,\mathrm d{\mathbf{W}}^i_u:[0,T]\rightarrow H_{N_{\gamma }}\) given by
and zero elsewhere, one has \(\int _0^{\cdot }{\mathbf{X}}_u\,\mathrm d{\mathbf{W}}^i_u\in \mathscr {D}^{(N_{\gamma }+1)\gamma }_{{\mathbf{W}}}\).
Remark 2.7
Differently from the general definition of the \(\mathscr {D}^{N\gamma }_{{\mathbf{W}}}\) spaces, in order to define the rough integral it is necessary to start from a controlled rough path \({\mathbf{X}}\in \mathscr {D}^{N_{\gamma }\gamma }_{{\mathbf{W}}}\). The operation of integration on controlled rough path comes also with some quantitative bounds. Looking at the definition, it is also possible to prove there exists a constant \(C(T, \gamma , {\mathbf{W}})>0\) depending on T, \(\gamma \), \({\mathbf{W}}\) such that
Therefore the application \({\mathbf{X}}\mapsto \int {\mathbf{X}}\,\mathrm d{\mathbf{W}}^i\) is a continuous linear map.
The second operation we introduce is the composition of a controlled rough path and a smooth function. Given a smooth function \(\phi :{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}\), its kth derivative at \(x\in {{\mathbb {R}}}^n\) is the multilinear map \(D^k\phi (x):({{\mathbb {R}}}^n)^{\otimes k}\rightarrow {{\mathbb {R}}}\) such that for \(v^1,\ldots ,v^k\in {{\mathbb {R}}}^n\),
To ease notation we define
for a word \(\alpha =(\alpha _1,\ldots ,\alpha _k)\in \{1,\ldots ,n\}^k\); of course, such \(\alpha \) induces a multiindex \(i=(i_1,\ldots ,i_n)\in {\mathbb {N}}^n\), where \(i_j\) counts the number of entries of \(\alpha \) that equal j.
We note that \(D^k\phi (x)\) is symmetric, meaning that for any permutation \(\sigma \in {\mathbb {S}}_k\) we have that \(D^k\phi (x)(v^1,\ldots ,v^k)=D^k\phi (x)(v^{\sigma (1)},\ldots ,v^{\sigma (k)}).\)
Remark 2.8
Observe that we also use the notion of word in this case, albeit with a different alphabet. In order to avoid confusion we reserve latin letters such as u, v, w, etc for words on the alphabet \(\{1,\ldots ,d\}\), introduced in the beginning of Sect. 2, and greek letters such as \(\alpha ,\beta \), etc for words on the alphabet \(\{1,\ldots ,n\}\) as above.
With these notations, Taylor’s theorem states that if \(\phi :{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^m\) is of class \(\mathcal {C}^{r+1}({{\mathbb {R}}}^n, {{\mathbb {R}}}^m)\) then for any \(j=1,\ldots ,m\) one has the identity
In what follows, for any finite number of words \(u_1,\ldots ,u_k\) we introduce the set
Since the shuffle product is commutative, for any permutation \(\sigma \in {\mathbb {S}}_k\) we have that
Thanks to this notation, we can prove Faà di Bruno’s formula (see also [17]). We denote by \({\mathcal {P}}(m)\) the collection of all partitions of \(\{1,\ldots ,m\}\). Given \(\pi =\{B_1,\ldots ,B_p\}\in {\mathcal {P}}(m)\), we let \(\#\pi :=p\) denote the number of its blocks, and for each block we denote by B its cardinality.
Lemma 2.9
For any couple of functions \(g:{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^n\) and \(f:{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}\) sufficiently smooth and every \(m\ge 1\), letting \(h:=f\circ g\) one has the identity
where \(v_B:=(v_{i_1},\ldots ,v_{i_q})\) for \(B=\{i_1,\ldots ,i_q\}\).
In particular, for any word \(\alpha =(\alpha _1,\ldots ,\alpha _m)\) we have
Proof
We proceed by induction on m. For \(m=1\) the formula reads
which is the usual chain rule. Suppose the formula holds for some \(m\ge 1\). Then, applying the chain rule to each of the terms we get
where the last identity follows from the fact that every partition \(\pi '\in {\mathcal {P}}(m+1)\) can be obtained by either appending \(m+1\) to one of the blocks of some partition \(\pi \in {\mathcal {P}}(m)\) or by adding the singleton block \(\{m+1\}\) to it.
Given a word \(\alpha =(\alpha _1,\ldots ,\alpha _m)\), we evaluate the previous formula in the canonical basis vectors \(v_1=e_{\alpha _1},\ldots ,v_m=e_{\alpha _m}\) to obtain
where \(\alpha _{B}=(\alpha _{i_1},\ldots ,\alpha _{i_q})\) if \(B=\{i_1,\ldots ,i_p\}\). It is now clear that for any choice of \(\pi \in {\mathcal {P}}(m)\) the words \(\alpha _{B_1},\ldots ,\alpha _{B_k}\) satisfy \(\alpha \in {{\,\mathrm{Sh}\,}}(\alpha _{B_1},\ldots ,\alpha _{B_k})\). Conversely, if \(\alpha \in {{\,\mathrm{Sh}\,}}(\beta _1,\ldots ,\beta _k)\), there is a partition \(\pi =\{B_1,\ldots ,B_k\}\) with \(B_j=\) is such that \(\beta _j=\alpha _{B_j}\). Moreover, for any choice of such a partition, any of the k! permutations of its blocks result in the same evaluation by symmetry of the differential. Thus
\(\square \)
Remark 2.10
This result should be wellknown to experts, yet the closest reference we found in the literature [17] only covers the scalar case (and does not immediately yield the multivariate case).
Using a similar technique we show a version of this identity for controlled rough paths.
Theorem 2.11
Let \({\mathbf{W}}\in \mathscr {C}^\gamma \), \(1\le N\le N_\gamma +1\), \({\mathbf{X}}\in (\mathscr {D}_{{\mathbf{W}}}^{N\gamma })^n\), and \(\phi \in C^{N}({{\mathbb {R}}}^n, {{\mathbb {R}}}^m)\) and set \(X_t:=\langle \mathbf {1},{\mathbf{X}}_t\rangle \). We introduce the path \({\varvec{\Phi }}({\mathbf{X}}):[0,T]\rightarrow (H_{N1})^m\) defined by \(\langle \mathbf {1}^*,{\varvec{\Phi }}({\mathbf{X}})_t\rangle _j= \phi ^j(X_t)\) and for any \(j=1,\ldots ,m\), and any nonempty word w by the identity
Then \({\varvec{\Phi }}({\mathbf{X}})\) is also a controlled rough path belonging to \((\mathscr {D}_{{\mathbf{W}}}^{N\gamma })^m\).
Remark 2.12
A similar statement in the setting of branched rough paths [16, Lemma 8.4] is known and somewhat easier due to the absence of shuffle relations.
Before going into the proof, we introduce some more notation. If \({\mathbf{X}}\) is a controlled path, \(L\in {\mathcal {L}}( ({{\mathbb {R}}}^n)^{\otimes k},{{\mathbb {R}}}^m)\), \(t\ge 0\) and \(w_1,\ldots ,w_k\) are words, we let
Proof
It is sufficient to prove the result when \(m=1\). We first prove the result for the case of \(\langle \mathbf {1}^*,{\varvec{\Phi }}({\mathbf{X}})_t\rangle =\phi (X_t)\). By Taylor expanding \(\phi \) up to order N around \(X_s\) we get that
Since \({\mathbf{X}}\in \left( \mathscr {D}_{{\mathbf{W}}}^{N\gamma } \right) ^n\), according to Remark 2.5, we have
Plugging this estimate into the above equation and using the character property of \({\mathbf{W}}_{st}\) in (2.2) we obtain
so the desired estimate follows.
Now we show the bound (2.6) for all words \(w\ne \mathbf {1}\). By fixing an integer \(1\le k\le \vert w \vert \) and words \(u_1,\ldots ,u_k\) such that \(w\in {{\,\mathrm{Sh}\,}}(u_1,\ldots ,u_k)\) we consider the term
Again, since \({\mathbf{X}}\) is controlled by \({\mathbf{W}}\), plugging the estimate in Remark 2.5 into (2.16) and using the multilinearity of the derivative we obtain
Performing a Taylor expansion of \(D^k\phi \) up to order \(Nw\) between \(X_t\) and \(X_s\), we obtain
Combining the estimates (2.17) and (2.18) with (2.15) into the definition of \(\langle e_w^*,{\varvec{\Phi }}({\mathbf{X}})_t\rangle \), we obtain the identity
Since the derivative \(D^{k+m}\phi (X_s)\) is symmetric we can replace it with
Replacing this expression in the righthand side of (2.19), it is now an easy but tedious exercise to verify the resulting expression is equal to the sum
Thereby proving the result. \(\square \)
Remark 2.13
A similar proof gives quantitative bounds on the application \({\mathbf{X}}\rightarrow {\varvec{\Phi }}({\mathbf{X}})\). Indeed for any \(\phi \in \mathcal {C}^{N}_b({{\mathbb {R}}}^n, {{\mathbb {R}}}^m)\) it is possible to prove that this application is locally Lipschitz on \(\mathscr {D}^{N\gamma }_{{\mathbf{W}}}\).
3 Rough differential equations
Now we come to the definition of solution of the RDE
We assume that the vector fields \(f_1,\ldots ,f_d\) are of class at least \(\mathcal {C}^{N_\gamma }\), so that by Theorem 2.11 the composition \(f_i(X_t)\) can be lifted to a controlled path \({\mathbf{F}}_i:\left( \mathscr {D}^{N_{\gamma }\gamma }_{{\mathbf{W}}} \right) ^n\rightarrow \left( \mathscr {D}^{N_{\gamma }\gamma }_{{\mathbf{W}}} \right) ^n\).
Definition 3.1
A path \(X:[0,T]\rightarrow {{\mathbb {R}}}^n\) is a solution of (3.1) if there exists a controlled path \({\mathbf{X}}\in \left( \mathscr {D}^{N_{\gamma }\gamma }_{{\mathbf{W}}} \right) ^n\) satisfying \(\langle \mathbf {1}^*, {\mathbf{X}}_t\rangle = X_t\) such that
for all \(s,t\in [0,T]\).
Remark 3.2
We stress that (3.2) is an equation in \(\mathscr {D}^{N_\gamma \gamma }_{{\mathbf{W}}}\), which in fact implies that \(\langle e_w^*,{\mathbf{X}}_t\rangle =F_w(X_t)\) for all words w with \(w\le N_\gamma 1\).
Remark 3.3
If \({\mathbf{X}}\in \mathscr {D}^{N_\gamma \gamma }_{{\mathbf{W}}}\) satisfies Eq. (3.2), it can also be regarded as an element of \(\mathscr {D}^{(N_\gamma +1)\gamma }_{{\mathbf{W}}}\), by Eq. (2.8). Therefore we freely treat solutions to RDEs as elements of either of these spaces.
By solving a fixed point equation on \(\left( \mathscr {D}_{{\mathbf{W}}}^{N_\gamma \gamma } \right) ^n\) (see e.g. [11]) of the form
with (see Proposition 3.4 for the definition of the functions \(F_w:{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^n\))
one can prove that there exists a unique global solution of (3.2) if the vector fields are of class \(\mathcal {C}^{N_\gamma +1}_b\). We recall this interesting expansion of the solution.
Proposition 3.4
(Davie’s expansion) A path \(X:[0,T]\rightarrow {{\mathbb {R}}}^n\) is the unique rough path solution to Eq. (2.5) in the sense of Definition 3.1 if and only if
and the coefficients of its lift \({\mathbf{X}}\in (\mathscr {D}_{{\mathbf{W}}}^{N_\gamma +1})^n\) are given by \(\langle e_w^*,{\mathbf{X}}_t\rangle =F_w(X_t)\) where the functions \(F_w:{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^n\) are recursively defined by by \(F_{\varepsilon }:={\mathrm {id}}\) and
Remark 3.5
By Eq. (2.7) this results actually implies the chain of estimates, for all words \(w\le N_{\gamma }\),
Proof of Proposition 3.4
Suppose that \({\mathbf{X}}\) is a rough solution to Eq. (2.5) in the sense of Definition 3.1. We define the functions \(F_w:{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^n\) recursively by \(F_i(x):=f_i(x)\) and
Now it is an easy but tedious verification to show that these functions satisfy \(F_{iw}(x)=DF_w(x)f_i(x)\); this identity essentially amounts to a reiterated use of the Leibniz rule. The form of the coefficients of \({\mathbf{X}}\) is shown by induction, it being clear for a single letter \(i=1,\ldots ,d\). If w is any word with \(0\le w\le N1\) and \(i\in \{1,\ldots ,d\}\) by definition
where, in the second identity we have used Eq. (2.10). By Theorem 2.11, the last coefficient equals
by the induction hypothesis. Then we obtain Eq. (3.3) from Definition 2.3 and Remark 2.5.
Conversely, suppose that X admits the local expansion in Eq. (3.3) and that the path \({\mathbf{X}}\) satisfies \(\langle e_w^*,{\mathbf{X}}_t\rangle =F_w(X_t)\) for all words w with \(w\le N\). First we show that X is controlled by \({\mathbf{W}}\) with coefficients given by \({\mathbf{X}}\). For this we have to Taylor expand the difference \(F_w(X_t)F_w(X_s)\) and collect terms as in the proof of Theorem 2.11. Then, by Eq. (2.10) it is not difficult to see that in fact
so that Definition 3.1 is satisfied. \(\square \)
3.1 Differentiability of the flow
It is a standard result in classical ODE theory that given a regular enough vector field V, the equation \(\dot{X}=V(X)\) induces a smooth flow on \({{\mathbb {R}}}^d\). Indeed, if we let \(X^x_t\) denote the unique solution of this equation such that \(X_0^x=x\), then the map \((t,x)\mapsto X_t^x\) is a flow, in the sense that \((t,X^x_s)\mapsto X^x_{t+s}\) and the mapping \(x\mapsto X_t^x\) is a diffeomorphism for each fixed t. More precesily, if V is of class \(\mathcal {C}^k\), then the application \(x\mapsto X_t^x\) is also of class \(\mathcal {C}^k\).
Now we show that a similar statement is true in the case of RDEs. The statement is the following
Theorem 3.6
Let \(f_1,\ldots ,f_d\) be a family of class \(\mathcal {C}^{N_\gamma +1+k}_b\) vector fields in \({{\mathbb {R}}}^d\) for some integer \(k\ge 0\), and \({\mathbf{W}}\in \mathscr {C}^\gamma \). Then

1.
the RDE
$$\begin{aligned} \mathrm dX_t=\sum _{i=1}^df_i(X_t)\,\mathrm d{\mathbf{W}}^i_t,\quad X_s=x \end{aligned}$$has a unique solution \({\mathbf{X}}^{s,x}\in \mathscr {D}^{(N_\gamma +1)\gamma }_{{\mathbf{W}}}\),

2.
the induced flow \(x\mapsto X^{s,x}_t\) is a class \(\mathcal {C}^{k+1}\) diffeomorphism for each fixed \(s<t\), and

3.
the partial derivatives satisfy the system of RDEs
$$\begin{aligned} \mathrm d\partial ^\alpha X_t^{s,x}=\sum _{i=1}^d\sum _{k=1}^{\alpha }\frac{1}{k!}\sum _{\alpha \in {\text {Sh}}(\beta _1,\ldots ,\beta _k)}D^kf_i(X^{s,x}_t)(\partial ^{\beta _1}X^{s,x}_t,\ldots ,\partial ^{\beta _k}X^{s,x}_t)\,\mathrm d{\mathbf{W}}^i_t \end{aligned}$$(3.6)with initial conditions \(X^{s,x}_s=x\), \(\partial ^i X^{s,x}_s=e_i\) and \(\partial ^\alpha X^{s,x}_s=0\) for all words with \(\alpha \ge 2\).
Proof
Points (1) and (2) are standard results in rough paths as found e.g. in Chapter 11 in [15]. For the algebraic identity in (3), it suffices to show the results in the case W is smooth. Indeed, by standard arguments \({\mathbf{W}}\in \mathscr {C}^\gamma \) can be approximated uniformly with uniform \(\gamma \)Hölder rough path bound, and hence in \(\mathscr {C}^{\gamma \eta }\) for any \(\eta >0\), while on the other hand the particular structure (cf. Chapter 11 in [15]) of the system of (rough) differential equations guarantees uniqueness and global existence so that the limiting argument is justified.
It remains to show point (3) for \({\mathbf{W}}\) smooth. We note that the integral representation of the solution
holds. By Lemma 2.9, for any \(\alpha =(\alpha _1,\ldots ,\alpha _m)\) and \(s<u<t\), we have
which is the smooth version of Eq. (3.6). \(\square \)
We aim now to obtain a Davietype expansion of the partial derivatives \(\partial ^\alpha X^{s,x}\) by making use of point 3. above. We observe that the above system of equations has the form
with initial conditions \(X^{s,x}_s=x\), \(DX^{s,x}_s=I\), \(D^2X^{s,x}_s=D^3X^{s,x}_s=\cdots =0\), where the inhomogeneity \((\ldots )\) is not important to spell out.
The expansion is clear only for the first equation; it is just Eq. (3.3). We would like to use Proposition 3.4 to obtain an expansion of the second equation but the problem is that the vector field driving the equation depends on time, so the result does not directly apply. For the third and subsequent equations the problem is not only that but also they are nonhomogeneous.
To solve this problem we extend our state space \({{\mathbb {R}}}^n\) to (the still finitedimensional space)
and define the vector fields (we give a more precise definition below in Eq. (3.8)) \({\mathfrak {f}}_i:{\mathfrak {S}}_k\rightarrow {\mathfrak {S}}_k\) by
where \({\mathfrak {x}}=(x,y_1,y_2,\ldots ,y_{k1})\in {\mathfrak {S}}_k\). The previous proposition shows that if
then
This transformation turns the system of nonautonomous nonhomogeneous RDEs into a single autonomous homogeneous RDE in \({\mathfrak {S}}_k\).
Corollary 3.7
For any word \(\alpha \), the partial derivatives of the solution flow \(X^{s,x}\) have the following Davie expansion: for any \(p=1,\ldots ,k1\),
In particular, for a word \(\alpha \in \{1,\ldots ,n\}^p\) we have that
Proof
The hypotheses on the vector fields \(f_1,\ldots ,f_d\) imply that \({\mathfrak {f}}_1,\ldots ,{\mathfrak {f}}_d\) are of class \(\mathcal {C}^{N_\gamma +1}_b\) on \({\mathfrak {S}}_k\), so this equation has a unique solution. Applying Proposition 3.4 in this extended space we obtain, for \(s<t\), the expansion
In order to deduce the result, we need to show that \({\mathfrak {F}}_w({\mathfrak {x}})_p=D^pF_w(x)\) for all words w and \(p=0,1,\ldots ,k1\). We do this by induction on the length of w. If \(w=i\) is a single letter, the pth component, \(p=0,1,\ldots ,k1\), of the vector field \({\mathfrak {f}}_i\) is given by \({\mathfrak {f}}_i(x)_0=f_i(x)\) and
where the inner sum is over the set of indices \((r_1,\ldots ,r_j)\) such that \(r_1+\cdots +r_j=pj+1\) and \(r_1+2r_2+\cdots +jr_j=p\). For our particular initial condition, \(y_j=0\) for \(j=2,3,\ldots ,k1\) the formula simplifies to
since the only term left in (3.8) is the one with \(j=1\), \(r_1=p\).
We continue by induction on the length of the word. We compute the pth derivative of \(x\mapsto F_{iw}(x)=DF_w(x)f_i(x)\) by recognizing that \(F_{iw}=\varphi _1\circ \varphi _2\) with \(\varphi _1(x,h)=DF_w(x)h\) and \(\varphi _2(x)=(x,f_i(x))\). A quick check gives that the higher order derivatives of \(\varphi _1\) and \(\varphi _2\) are given by
where \({\hat{u}}_j=v_j\). Thus, using Lemma 2.9 we get that
Now we have three cases, depending on the number of blocks of the partition in the above summation:

1.
\(q=p\): there is a single partition with p blocks, and each block is a singleton. In this case the term equals
$$\begin{aligned} D^{p+1}F_w(x)(h_1,\ldots ,h_p,f_i(x))+\sum _{j=1}^pD^pF_w(x)(h_1,\ldots ,Df_i(x)h_j,\ldots ,h_p). \end{aligned}$$ 
2.
\(q=1\): there is a single partition with one block, namely \(\pi =\{1,\ldots ,p\}\). In this case the term equals
$$\begin{aligned} DF_w(x)[D^pf_j(x)(h_1,\ldots ,h_p)]. \end{aligned}$$ 
3.
\(1<q<p\): there is at least one block of size greater than one, which means that the first term in the expression for \(D^m\varphi _1\) vanishes since at least one of \(u_1,\ldots ,u_m\) vanishes. For the rest of the terms, the exact result depends on whether there is a block with exactly one block or not: if all blocks have more than one block then the whole expression vanishes; otherwise, we obtain one term for each of the blocks having size exactly one, and it is of the form
$$\begin{aligned} D^{\#\pi }F_w(x)(h_{B},D^{\#pB}f_i(x)h_{\pi {\setminus } B}). \end{aligned}$$
In either case, using the induction hypothesis it is possible to show that each of the terms appearing are of the form \(\partial _r{\mathfrak {F}}_w({\mathfrak {x}})_p{\mathfrak {f}}_i({\mathfrak {x}})_r\), which then means that \(D^pF_{iw}(x)=[D{\mathfrak {F}}_w({\mathfrak {x}}){\mathfrak {f}}_i({\mathfrak {x}})]_p\) as desired. For example, the term
corresponds to
and so on.
\(\square \)
In particular for the first derivative, the first few terms of the expansion read
3.2 Itô’s formula for RDEs
The last ingredient to add in the study of the rough transport equation is to write down a change of variable formula for a solution of Eq. (2.5) for some sufficiently smooth vector field \(f=(f_1,\ldots ,f_d)\). By analogy with terminology of stochastic calculus we call it an “Itô formula”. For any \(i=1,\ldots ,n\) we denote by \(\Gamma _i\) the differential operator \(f_i(x)\cdot D_x\) and for any nonempty word \(w=i_1\ldots i_m\) we use the shorthand notation
Moreover we adopt the convention \(\Gamma _{\varepsilon }={{\text {id}}}\).
Lemma 3.8
Let \(f_1,\ldots ,f_d\in \mathcal {C}^{N_\gamma +1}({{\mathbb {R}}}^n; {{\mathbb {R}}}^n)\) be vector fields on \({{\mathbb {R}}}^n\). If \(\phi :{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}\) is a smooth function and w is a nonempty word, then
Proof
Before commencing we introduce some notation. If \(\phi :{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}\) and \(g_1,\ldots ,g_k:{{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^n\) are smooth functions, we define
where the righthand side was defined in Eq. (2.11). The Leibniz rule then gives that for any \(h\in {{\mathbb {R}}}^n\) we have
We now prove the result by induction on the word’s length \(\vert w \vert \). If \(w=i\) is a single letter then \(\Gamma _i\phi (x)=f_i(x)\cdot \nabla \phi (x)=D\phi (x)f_i(x)\) which is exactly Eq. (3.9). Supposing the identity true for any word \(w'\) such that \(\vert w'\vert \le \vert w\vert \), we prove it for jw where \(j\in \{1,\ldots ,d\}\). By induction one has
By the above form of Leibniz rule, with \(g_i=F_{u_i}\) and \(h=f_j(x)\), and noticing that by definition
we obtain that
Summing this expression over words \(u_1,\ldots ,u_k\), we can rewrite it as
the factor \(1/(k+1)\) is introduced because of the symmetry of \(D^{k+1}\phi (x)\). Summing finally over k, we can express the final expression as
Since the letter j may appear as a single word or concatenated at the right with some word, we finally identify the whole expression above with
\(\square \)
Now we show a formula for the composition of the solution to the RDE (2.5) and a sufficiently smooth function.
Theorem 3.9
(Itô formula for RDEs) Let \(f_i\in \mathcal {C}^{N_\gamma +1}\) and let \({\mathbf{X}}\in \mathscr {D}^{(N_\gamma +1)\gamma }_{{\mathbf{W}}}\) be the unique solution of Eq. (2.5) and \(X_t=\langle \mathbf {1}^*,{\mathbf{X}}_t\rangle \). Then for any real valued function \(\phi \in \mathcal {C}^{N_{\gamma }+1}_b({{\mathbb {R}}}^n)\) one has the identity
More generally, one has the following estimates at the level of controlled rough paths
where \(\Gamma _i{\varvec{\Phi }}({\mathbf{X}})\) is the controlled lift of composition of \({\mathbf{X}}\) with the function \(\Gamma _i\phi \in \mathcal {C}^{N_\gamma }\) and any nonempty word such that \(\vert w\vert \le N_{\gamma }\).
Proof of Theorem 3.9
The theorem is obtained by comparing the coefficients of the controlled rough paths \( {\varvec{\Phi }}({\mathbf{X}})_t\) and \(\int _0^t(\Gamma _i{\varvec{\Phi }})(X_r)\,\mathrm d{\mathbf{W}}^i_r\) for every \(i=1,\ldots ,d\). Using Lemma 3.8 and Proposition 3.4, for every nonempty word a one has
Using the same identities we also deduce for any word w,
Since \(\sum _{i=1}^n\int _0^t(\Gamma _i{\varvec{\Phi }})({\mathbf{X}})_r\,\mathrm d{\mathbf{W}}^i_r \) and \({\varvec{\Phi }}(\mathbf {X})_t\) belong both to \(\mathscr {D}_{{\mathbf{W}}}^{(N_{\gamma }+1)\gamma }\) for any word w one has both
and
The identities (3.12) and (3.13) imply that the righthand sides of the above estimates are the same quantities. Thus we obtain Eq. (3.11) by simply subtracting one side from the other. In case \(w=\mathbf {1}\) one has
Since \((N_{\gamma }+1)\gamma >1\) and the right hand side is the increment of a path, one has the identity (3.10). \(\square \)
Using the identities (3.12) we can rewrite the Itô formula using only the operators \(\Gamma _w\).
Corollary 3.10
(ItôDavie formula for RDEs) Let \(X:[0,T]\rightarrow {{\mathbb {R}}}^n\) be the unique solution of Eq. (2.5). Then for any real valued function \(\phi \in \mathcal {C}^{N_{\gamma }+1}_b({{\mathbb {R}}}^n)\) and any word w one has the estimate
4 Rough transport and continuity
4.1 Rough transport equation
We now consider the rough transport equation
where we recall the differential operator \(\Gamma _i:=f_i\cdot D_x\) for some vector fields \(f_1,\ldots ,f_d\) on \({{\mathbb {R}}}^n\).
We now prepare the definition of a regular solution to the rough transport equation. Since we are in the fortunate position to have an explicit solution candidate we derive a graded set of rough path estimates that provide a natural generalisation of the classical transport differential equation.
Definition 4.1
Let \(\gamma \in (0,1)\), \(\mathbf {W}\in \mathscr {C}^{\gamma }\) a weaklygeometric rough path of roughness \(\gamma \) and \(g\in \mathcal {C}^{N_\gamma +1}\). A \(\mathcal {C}^{\gamma ,N_\gamma +1}\)function \(u:[0,T]\times {{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}\) such that \(u(T, \cdot )= g(\cdot )\) is said to be a regular solution to the rough transport Eq. (4.1) if one has the estimates
for every \(s<t\in [0,T]\), uniformly on compact sets in x and any word w.
Remark 4.2
Since each application of the vector fields \(\Gamma _{i_1\ldots i_n}\) amounts to take n derivatives, these estimates have the interpretation that time regularity of \(\Gamma _{i_1\ldots i_n}u\), can be traded against space regularity in a controlled sense.
Theorem 4.3
Let \(f \in \mathcal {C}^{2N_\gamma +1}_b\), \(g\in \mathcal {C}^{N_\gamma +1}\) and consider the rough solution \(X^{s,x}\) to Eq. (2.5). Then \(u(s, x):=g(X^{s,x}_T)\) is a solution to the rough transport equation in the sense of Definition 4.1.
Proof
We first note that by Theorem 3.6 the map \((s,x)\mapsto X^{s,x}_T\) belongs to \(\mathcal {C}^{\gamma ,N_\gamma +1}\). Since \(g\in \mathcal {C}^{N_\gamma +1}\) then \(u(s,x)= g(X^{s,x}_T)\in \mathcal {C}^{\gamma ,N_\gamma +1}\). Let us show that u is a solution by proving the estimates given in Definition 4.1 for some fixed times \(s< t < T\) and x in compact set. By uniqueness of the RDE flow one has \(X^{s, x}_T = X^{t, y}_T \) where \(y = X^{s,x}_t\). Thus we deduce from the definition of u the identity
Let \({\mathbf{X}}\) denote the controlled rough path such that \(X^{s,x}_t=\langle \mathbf {1}^*,{\mathbf{X}}_t\rangle \). Since \(g\in \mathcal {C}_b^{N_{\gamma }+1}\), we can apply the rough Itô formula in Eq. (3.14) to the function \(x\rightarrow u_t(x)\) obtaining
obtaining (4.2) for the case of \(w=\varepsilon \). To show the estimates on \(\Gamma _{i_1\ldots i_l}u_s\), we apply Lemma 3.8 to the function \(x\mapsto u_s(x)\)
Using again the identity (4.3), for any word \(\alpha \) we apply Eq. (2.13) obtaining
Since the vector field \(f\in C_b^{2N_{\gamma }+1}\) and every \(\beta _i\) such that \( \alpha \in {\text {Sh}}(\beta _1,\dotsc ,\beta _l)\) satisfies \(\vert \beta _i \vert \le \vert a\vert \) we can apply Definition 3.7 to get
Plugging these estimates in \(D^lu_t(X^{s,x}_t)\) and one has
Plugging this expression into (4.4) we obtain
Rearranging the sums and applying the definition of the functions \(F_w\) we obtain the identity
Therefore the righthand side of (4.6) becomes
We perform now a Taylor expansion of \(D^lu_t(X^{s,x}_t)\) up to order \( N \vert w \vert \) between \(X_t^{s,x}\) and x, yielding for any words \(u'_1,\ldots , u'_k\)
Plugging now the Davie expansion (3.3) truncated at order \(N_{\gamma }\vert w\vert \) into (4.7) we have the following estimate
Using the symmetry of \(D^{l+m}u_t(x)\), we deduce
Replacing this expression in the righthand side of (4.9), we can easily verify that the resulting expression is equal to the sum
Thereby proving the result. \(\square \)
We can now show that solutions in the sense of Definition 4.1 are unique.
Theorem 4.4
Let \(f_i \in \mathcal {C}^{2N_{\gamma }+1}_b\) with associated differential operators \(\Gamma _i\), and \({\mathbf{W}}\in \mathscr {C}^\gamma \). Given regular terminal data \(g \in \mathcal {C}^{N_{\gamma }+1}\), there exists a unique regular solution to the rough transport equation (4.1).
Proof
Existence is clear, since Proposition 4.3 exactly says that \((t, x) \mapsto g (X^{t, x}_T)\) gives a regular solution. Let now u be any solution to the rough transport equation. We show that, whenever \(X=X^{\bar{s}, \bar{y}}\) for every \(\bar{s}, \bar{y} \) one has the estimate
Since \((N_{\gamma }+1) \gamma > 1\) this entails that \(t \mapsto u (t, X_t)\) is constant, and so we recover the uniqueness from the identities
To prove (4.10) we show that for every \(k = 0,\ldots , N_{\gamma }\) and any choice of indexes \(i_1,\ldots , i_k \) (if \(k=0\) we do not consider indexes) one has the estimates
Let us prove this estimate by reverse induction on the indices length. The case when the indices \(i_1\ldots i_{N_{\gamma }}\) have length \(N_{\gamma }\) comes easily from the algebraic manipulation
Using the defining property of a solution in the estimates (4.2), the first difference on the righthand side is of order \(\gamma \). Moreover by hypothesis on u one has \(\Gamma _{i_1\ldots i_{N_{\gamma }}}u_s (\cdot )\in C^1\), always uniformly in \(s \in [0, T]\), therefore the second difference is also of order \(\gamma \), as required. Supposing the estimate true for every indices of length k we will prove it on every indices \(i_1\ldots i_{k1} \) of length \(k1\) . By repeating the same procedure as before we obtain
Using the definition of a solution, the first difference on the righthand side satisfies
On the other hand, using Lemma 3.8 two times we write \(\Gamma _{i_1\ldots i_{k1}} u_s(X_t)= \langle e^*_{i_1\cdots i_{k1}}, \mathbf {U}_s(\mathbf {X})_t\rangle \) so that the second difference can be replaced by the usual remainder
Combining the two estimates we obtain
Since the terms in the sum involve the increment \( \Gamma _{\sigma } u_t (X_t) \Gamma _{\sigma } u_s (X_s)\) where \(\sigma \) has length bigger or equal than k we apply the recursive hypothesis obtaining that each term satisfies
and the multiplication with \(\langle \mathbf {W}_{st},w \rangle \) gives the desired estimate. \(\square \)
4.2 Continuity equation and analytically weak formulation
Given a finite measure \(\rho \in \mathcal {M} ({{\mathbb {R}}}^n)\) and a continuous bounded function \(\phi \in C_b ({{\mathbb {R}}}^n)\), we write \(\rho (\phi ) = \int \phi (x) \rho (dx)\) for the natural pairing. We are interested in measurevalued (forward) solutions to the continuity equation
when \({\mathbf{W}}\) is again a weakly geometric rough path. As before we use the notation \(\Gamma _i = f_i (x) \cdot D_x\), whose formal adjoint is \(\Gamma _i^\star = {{\,\mathrm{div}\,}}_x (f_i{\cdot })\).
Definition 4.5
Let \(\gamma \in (0,1)\), \(\mathbf {W}\in \mathscr {C}_g^{\gamma }\) and \(\mu \in \mathcal {M} ({{\mathbb {R}}}^n)\). Any function \(\rho :[0,T]\rightarrow \mathcal {M} ({{\mathbb {R}}}^n)\) such that \(\rho _0= \mu \) is called a weak or measurevalued solution to the rough continuity equation
if for every \(\phi \) bounded in \(\mathcal {C}^{{N_{\gamma }}+1}_b\) and any word w with \(w\le N_\gamma \) one has the estimates
for every \(s<t\in [0,T]\) and uniformly in \(\phi \).
Theorem 4.6
Let \(f \in \mathcal {C}^{2{N_{\gamma }}+1}_b\) and \({\mathbf{W}}\in \mathscr {C}_g^\gamma \). Given initial data \(\mu \in \mathcal {M} ({{\mathbb {R}}}^n)\), there exists a unique solution to the measurevalued rough continuity equation, explicitly given for \(\phi \in \mathcal {C}_b^{{N_{\gamma }}+1}\) by
where \( X^{0, x}\) is the unique solution of the RDE \(\mathrm dX_t = \sum _{i=1}^d f_i(X_t)\,\mathrm d{\mathbf{W}}^i_t\) such that \(X^{0,x}_0=x\).
Proof
(Existence) Using the composition of the controlled rough path \(\mathbf {X}^{0,x}\) with \(\phi \in \mathcal {C}^{{N_{\gamma }}+1}_b\) and the shorthand notation \(X^{0,x}_t=X_t\) we can write
This showing the existence when \(\mu = \delta _x\) thanks to Proposition 4.3. Since we are dealing with bounded vector fields, all these estimates are uniform in \(X_0 = x\). Thus we can integrate both sides with respect to the measure \(\mu \), obtaining the existence.
(Uniqueness) To prove the uniqueness, we will show that for any \(0<t\le T\), any function \(g \in \mathcal {C}^{{N_{\gamma }}+1}_b\) and any solution \(u:[0,t]\times {{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}\) of the RPDE
the function \(r\in [0,t] \mapsto \alpha (r):=\rho _r (u_r)\) is constant. This property implies that for any function \(g \in \mathcal {C}^{{N_{\gamma }}+1}_b\) and \(t>0\) one has the identity
which uniquely determines the measure \(\rho _t\) for any \(0<t\le T\). Since the parameter T was also arbitrary it is not restrictive to prove the result when \(t=T\). Then \(\alpha \) is constant if and only if one has the estimate
Writing \(u_{s,r} = u_r  u_s\) and similarly for \(\rho \) one has
By construction of regular solution with \(\phi = u_r\in \mathcal {C}^{{N_{\gamma }}+1}_b\) the first summand expands as
On the other hand, we expand the second summand on the righthand using the very definition of regular backward RPDE obtaining
where the remainder is uniform on x. By integrating this estimate on \(\rho _s\), we obtain
Combining the two estimates (4.15) and (4.14) we obtain (4.13) and the theorem is proven. \(\square \)
References
Ambrosio, L.: Transport equation and Cauchy problem for bv vector fields. Invent. Math. 158(2), 227–260 (2004)
Beck, L., Flandoli, F., Gubinelli, M., Maurelli, M.: Stochastic ODEs and stochastic linear PDEs with critical drift: regularity, duality and uniqueness. Electron. J. Probab. 24, 72 (2019) (Paper no. 136)
Bailleul, I., Gubinelli, M.: Unbounded rough drivers. Ann. Faculté Sci. Toulous. Math. 26(4), 795–830 (2017)
Catellier, R.: Rough linear transport equation with an irregular drift. Stoch. Partial Differ. Equations Anal. Comput. 4(3), 477–534 (2016)
Caruana, M., Friz, P.: Partial differential equations driven by rough paths. J. Differ. Equations 247(1), 140–173 (2009)
Catellier, R., Gubinelli, M.: Averaging along irregular curves and regularisation of ODEs. Stoch. Process. Appl. 126(8), 2323–2366 (2016)
Diehl, J., Friz, P., Stannat, W.: Stochastic partial differential equations: a rough paths view on weak solutions via Feynman–Kac. Ann. Fac. Sci. Toulous. Math. 26(4), 911–947 (2017)
Deya, A., Gubinelli, M., Hofmanová, M., Tindel, S.: A priori estimates for rough PDEs with application to rough conservation laws. J. Funct. Anal. 276(12), 3577–3645 (2019)
Ronald, J.: DiPerna and PierreLouis Lions, ordinary differential equations, transport theory and Sobolev spaces. Invent. Math. 98(3), 511–547 (1989)
Flandoli, F., Gubinelli, M., Priola, E.: Wellposedness of the transport equation by stochastic perturbation. Invent. Math. 180(1), 1–53 (2009)
Peter, K.: Friz and Martin Hairer. A course on rough paths. Springer, New York (2014)
Flandoli, F., Olivera, C.: Wellposedness of the vector advection equations by stochastic perturbation. J. Evol. Equations 18(2), 277–301 (2018)
Funaki, T.: Construction of a solution of random transport equation with boundary condition. J. Math. Soc. Jpn. 31(4), 719–744 (1979)
Peter, K.: Friz and Nicolas Victoir, A note on the notion of geometric rough paths. Probab. Theory Relat. Fields 136(3), 395–416 (2006)
Peter, K.: Friz and Nicolas Victoir, Multidimensional stochastic processes as rough paths, Cambridge Studies in Advanced Mathematics, vol. 120. Cambridge University Press, Cambridge (2010)
Gubinelli, M.: Ramification of rough paths. J. Differ. Equations 248(4), 693–721 (2010)
Hardy, M.: Combinatorics of partial derivatives. Electron. J. Combin. 13(1), 1–13 (2006) (Research Paper)
Hairer, M., Kelly, D.: Geometric versus nongeometric rough paths. Ann. l’Institut Henri Poincaré Prob. et Stat. 51(1), 207–251 (2015)
Lyons, T., Victoir, N.: An extension theorem to rough paths. Ann. Inst. H. Poincaré Anal. Non Linéaire 24(5), 835–847 (2007)
Manchon, D.: Hopf algebras in renormalisation, Handbook of algebra. Vol. 5, Handb. Algebr., vol. 5, pp. 365–427. Elsevier/NorthHolland, Amsterdam (2008)
Maurelli, M.: Wiener chaos and uniqueness for stochastic transport equation. C. R. Math. 349(11), 669–672 (2011)
Nualart, D., Tindel, S.: A construction of the rough path above fractional Brownian motion using Volterra’s representation. Ann. Probab. 39(3), 1061–1096 (2011)
Ogawa, S.: A partial differential equation with the white noise as a coefficient. Probab. Theory Relat. Fields 28(1), 53–71 (1973)
Olivera, C., Tudor, C.A.: The density of the solution to the stochastic transport equation with fractional noise. J. Math. Anal. Appl. 431(1), 57–72 (2015)
Ree, R.: Lie elements and an algebra associated with shuffles. Ann. Math. 68(2), 210–220 (1958)
Unterberger, J.: A renormalized rough path over fractional Brownian motion. Commun. Math. Phys. 320(3), 603–636 (2013)
Acknowledgements
CB has received funding from DFG research unit FOR2402, ADj and NT have received funding from Excellence Cluster MATH+ (AA4 and EF1, respectively). PKF has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 683164).
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is part of the section “Theory of PDEs” edited by Eduardo Teixeira.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Bellingeri, C., Djurdjevac, A., Friz, P.K. et al. Transport and continuity equations with (very) rough noise. Partial Differ. Equ. Appl. 2, 49 (2021). https://doi.org/10.1007/s4298502100101y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s4298502100101y
Keywords
 Rough transport equation
 Rough continuity equation
 First order rough partial differential equations
Mathematics Subject Classifications
 35R60
 60L20
 60L50
 60H15