Codex @codex  0

Let $\mathbf{X}$ be a weak geometric p-rough path, $N=\lfloor p\rfloor$, with increments $X_{s,t}^I$ indexed by words $I=(i_1,\dots ,i_k)$ of length at most $N$. Choose a control function for rough paths $\omega$ with $|X_{s,t}^I|\le \omega (s,t{)}^{|I|/p}$. We use the standard sufficient vector-field hypothesis $V_i\in {\mathrm{Lip}}^{\gamma }$, $\gamma >p$, with globally bounded regularity norms; smooth bounded fields are a special case. Regard $V_i$ as the differential operator $V_i\cdot \nabla$, and put $F_I=V_{i_1}\cdots V_{i_k}\mathrm{id}$.

A pathlevel solution of a rough differential equation is a continuous state path $y:[0,T]\to {\mathbb{R}}^e$, with prescribed $y_0$, satisfying a local expansionfor some $\theta >1$ on sufficiently small control intervals. One can take $\theta =\min (\gamma ,N+1)/p>1$ under the stated regularity. This definition specifies the state path, without requiring its full rough-path enhancement as additional data. For $2<p<3$, the displayed expansion readsRepeated indices are summed.

We use the following discrete form of the Davie lemma. For a finite ordered grid and a continuous superadditive control, suppose nonnegative errors $a_{s,t}$ vanish on adjacent grid points and, for every grid triple $s<u<t$, satisfyThere are $\delta >0$ and $C$, depending on $L,A,p,\theta$ but not on the grid, such that $a_{s,t}\le C\omega (s,t{)}^{\theta }$ whenever $\omega (s,t)\le \delta$. This is the discrete higher-order error estimate: splitting close to half the control size makes the two $\theta$-power errors contract; a crossing single grid interval contributes zero adjacent error.

Define the local Euler mapFor small $\omega (s,t)$ it has Lipschitz constant at most $1+L\omega (s,t{)}^{1/p}$. Taylor expansion, the Chen identity and the shuffle identity for iterated integrals give the composition estimateHere is the cancellation underlying the estimate. Assign degree $k$ to a level-$k$ increment. Expanding each $F_I(E_{s,u}(z))$ and grouping terms through degree $N$ gives the differential-operator coefficients $F_{IJ}(z)$ multiplying $X_{s,u}^I{X}_{u,t}^J$. Products of coefficients from the first increment are combined by the shuffle identity, which is the iterated Leibniz rule. Chen's identity says that the sum of these products is $X_{s,t}^{IJ}$. Thus every term of degree at most $N$ agrees with the corresponding term in $E_{s,t}$. The remaining Taylor terms have control order at least $\theta$; bounded ${\mathrm{Lip}}^{\gamma }$ norms make the estimate uniform in $z$. For smooth fields the remainder has order $(N+1)/p$.

On a partition $\pi$, construct the Euler sequence by $y_{t_{j+1}}^{\pi }=E_{t_j,t_{j+1}}(y_{t_j}^{\pi })$. For grid endpoints letIt vanishes on adjacent points. Insert $y_u^{\pi }=E_{s,u}(y_s^{\pi })+I_{s,u}^{\pi }$ into the next local map. The Lipschitz and composition estimates giveThe Davie lemma therefore yields a bound $|I_{s,t}^{\pi }|\le C\omega (s,t{)}^{\theta }$ independent of $\pi$ on small control intervals. Together with the Euler expansion this gives $|y_t^{\pi }-y_s^{\pi }|\le C^{\prime }\omega (s,t{)}^{1/p}$. A finite subdivision into small-control intervals gives a uniform global bound as well.

Interpolate each Euler sequence linearly in time, and take partitions with mesh tending to zero. Continuity of the control makes these paths uniformly equicontinuous: the grid estimates apply to the interval enlarged to its neighboring grid endpoints, and the enlargement tends to zero uniformly with the mesh. The paths are uniformly bounded. The Arzelà-Ascoli theorem supplies a uniformly convergent subsequence with continuous limit $y$.

For arbitrary $s<t$ in a small control interval, choose neighboring grid endpoints converging to $s,t$. Continuity of $\mathbf{X}$, the coefficient functions and the control lets us pass to the limit in the grid error estimate. We obtain the defining expansion with $|R_{s,t}|\le C\omega (s,t{)}^{\theta }$, and $y(0)=y_0$. This constructs a pathlevel RDE solution. No continuity theorem for the RDE solution map was used to obtain existence.