The first few lectures are essentially reminders of undergraduate real analysis materials. We will cover some aspects of the theory of differential equations driven by continuous paths with bounded variation. The point is to fix some notations that will be used throughout the course and to stress the importance of the topology of convergence in 1-variation if we are interested in stability results for solutions with respect to the driving signal.
If
, we will denote by
, the set of subdivisions of the interval
, that is
can be written

Definition: A continuous path
is said to have a bounded variation on
, if the 1-variation of
on
, which is defined as
![\| x \|_{1-var; [s,t]} :=\sup_{ \Pi \in \Delta[s,t]} \sum_{k=0}^{n-1} \| x(t_{k+1}) -x(t_k) \|,](https://s0.wp.com/latex.php?latex=%5C%7C+x+%5C%7C_%7B1-var%3B+%5Bs%2Ct%5D%7D+%3A%3D%5Csup_%7B+%5CPi+%5Cin+%5CDelta%5Bs%2Ct%5D%7D+%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7C+x%28t_%7Bk%2B1%7D%29+-x%28t_k%29+%5C%7C%2C&bg=ffffff&fg=333333&s=0&c=20201002)
is finite. The space of continuous bounded variation paths
, will be denoted by
.
is not a norm, because constant functions have a zero 1-variation, but it is obviously a semi-norm. If
is continuously differentiable on
, it is easily seen (Exercise !) that
![\| x \|_{1-var, [s,t]}=\int_s^t \| x'(s) \| ds.](https://s0.wp.com/latex.php?latex=%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Ct%5D%7D%3D%5Cint_s%5Et+%5C%7C+x%27%28s%29+%5C%7C+ds.&bg=ffffff&fg=333333&s=0&c=20201002)
Proposition: Let
. The function
is additive, i.e for
,
![\| x \|_{1-var, [s,t]}+ \| x \|_{1-var, [t,u]}= \| x \|_{1-var, [s,u]},](https://s0.wp.com/latex.php?latex=%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Ct%5D%7D%2B+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bt%2Cu%5D%7D%3D+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Cu%5D%7D%2C&bg=ffffff&fg=333333&s=0&c=20201002)
and controls
in the sense that for
,
![\| x(s)-x(t) \| \le \| x \|_{1-var, [s,t]}.](https://s0.wp.com/latex.php?latex=%5C%7C+x%28s%29-x%28t%29+%5C%7C+%5Cle+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Ct%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
The function
is moreover continuous and non decreasing.
Proof: If
and
, then
. As a consequence, we obtain
![\sup_{ \Pi_1 \in \Delta[s,t]} \sum_{k=0}^{n-1} \| x(t_{k+1}) -x(t_k) \| +\sup_{ \Pi_2 \in \Delta[t,u]} \sum_{k=0}^{n-1} \| x(t_{k+1}) -x(t_k) \| \le \sup_{ \Pi \in \Delta[s,u]} \sum_{k=0}^{n-1} \| x(t_{k+1}) -x(t_k) \|,](https://s0.wp.com/latex.php?latex=%5Csup_%7B+%5CPi_1+%5Cin+%5CDelta%5Bs%2Ct%5D%7D+%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7C+x%28t_%7Bk%2B1%7D%29+-x%28t_k%29+%5C%7C+%2B%5Csup_%7B+%5CPi_2+%5Cin+%5CDelta%5Bt%2Cu%5D%7D+%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7C+x%28t_%7Bk%2B1%7D%29+-x%28t_k%29+%5C%7C+%5Cle+%5Csup_%7B+%5CPi+%5Cin+%5CDelta%5Bs%2Cu%5D%7D+%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7C+x%28t_%7Bk%2B1%7D%29+-x%28t_k%29+%5C%7C%2C&bg=ffffff&fg=333333&s=0&c=20201002)
thus
![\| x \|_{1-var, [s,t]}+ \| x \|_{1-var, [t,u]} \le \| x \|_{1-var, [s,u]}.](https://s0.wp.com/latex.php?latex=%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Ct%5D%7D%2B+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bt%2Cu%5D%7D+%5Cle+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Cu%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
Let now
:

Let
. By the triangle inequality, we have


![\le \| x \|_{1-var, [s,t]}+ \| x \|_{1-var, [t,u]}.](https://s0.wp.com/latex.php?latex=%5Cle+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Ct%5D%7D%2B+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bt%2Cu%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
Taking the
of
yields
![\| x \|_{1-var, [s,t]}+ \| x \|_{1-var, [t,u]} \ge \| x \|_{1-var, [s,u]},](https://s0.wp.com/latex.php?latex=%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Ct%5D%7D%2B+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bt%2Cu%5D%7D+%5Cge+%5C%7C+x+%5C%7C_%7B1-var%2C+%5Bs%2Cu%5D%7D%2C&bg=ffffff&fg=333333&s=0&c=20201002)
which completes the proof. The proof of the continuity and monoticity of
is let to the reader 
This control of the path by the 1-variation norm is an illustration of the notion of controlled path which is very useful in rough paths theory.
Definition: A map
is called superadditive if for all
,

If, in adition,
is continuous and
, we call
a control. We say that a path
is controlled by a control
, if there exists a constant
, such that for every
,

Obviously, Lipschitz functions have a bounded variation. The converse is of course not true:
has a bounded variation on
but is not Lipschitz. However, any continuous path with bounded variation is the reparametrization of a Lipschitz path in the following sense.
Proposition: Let
. There exist a Lipschitz function
, and a continuous and non-decreasing function
such that
.
Proof: We assume
and consider
![\phi(t)=\frac{ \| x \|_{1-var, [0,t]} }{ \| x \|_{1-var, [0,T]} }.](https://s0.wp.com/latex.php?latex=%5Cphi%28t%29%3D%5Cfrac%7B+%5C%7C+x+%5C%7C_%7B1-var%2C+%5B0%2Ct%5D%7D+%7D%7B+%5C%7C+x+%5C%7C_%7B1-var%2C+%5B0%2CT%5D%7D+%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
It is continuous and non decreasing. There exists a function
such that
because
implies
. We have then, for
,

The next result shows that the set of continuous paths with bounded variation is a Banach space.
Theorem: The space
endowed with the norm
is a Banach space.
Proof: Let
be a Cauchy sequence. It is clear that
![\| x^n -x^m \|_\infty \le \| x^n(0)-x^m(0) \|+ \| x^n-x^m \|_{1-var, [0,T]}.](https://s0.wp.com/latex.php?latex=%5C%7C+x%5En+-x%5Em+%5C%7C_%5Cinfty+%5Cle+%5C%7C+x%5En%280%29-x%5Em%280%29+%5C%7C%2B+%5C%7C+x%5En-x%5Em+%5C%7C_%7B1-var%2C+%5B0%2CT%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
Thus,
converges uniformly to a continuous path
. We need to prove that
has a bounded variation. Let

be a a subdivision of
. There is
, such that
, thus

![\le \sum_{k=0}^{n-1} \|x(t_{k+1})-x^m(t_{k+1}) \| +\sum_{k=0}^{n-1} \|x^m(t_{k})-x(t_k) \| +\| x^m \|_{1-var,[0,T]}](https://s0.wp.com/latex.php?latex=%5Cle+%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7Cx%28t_%7Bk%2B1%7D%29-x%5Em%28t_%7Bk%2B1%7D%29+%5C%7C+%2B%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7Cx%5Em%28t_%7Bk%7D%29-x%28t_k%29+%5C%7C+%2B%5C%7C+x%5Em+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D&bg=ffffff&fg=333333&s=0&c=20201002)
![\le 1+\sup_{n} \| x^n \|_{1-var,[0,T]}.](https://s0.wp.com/latex.php?latex=%5Cle+1%2B%5Csup_%7Bn%7D+%5C%7C+x%5En+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
Thus, we have
![\| x \|_{1-var,[0,T]} \le 1+\sup_{n} \| x^n \|_{1-var,[0,T]} < \infty](https://s0.wp.com/latex.php?latex=%5C%7C+x+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D+%5Cle+1%2B%5Csup_%7Bn%7D+%5C%7C+x%5En+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D+%3C+%5Cinfty+&bg=ffffff&fg=333333&s=0&c=20201002)

For approximations purposes, it is important to observe that the set of smooth paths is not dense in
for the 1-variation convergence topology. The closure of the set of smooth paths in the 1-variation norm, which shall be denoted by
is the set of absolutely continuous paths.
Proposition: Let
. Then,
if and only if there exists
such that,

Proof: First, let us assume that

for some
. Since smooth paths are dense in
, we can find a sequence
in
such that
. Define then,

We have
![\| x-x^n \|_{1-var,[0,T]}=\| y-y^n \|_1.](https://s0.wp.com/latex.php?latex=%5C%7C+x-x%5En+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D%3D%5C%7C+y-y%5En+%5C%7C_1.&bg=ffffff&fg=333333&s=0&c=20201002)
This implies that
. Conversely, if
, there exists a sequence of smooth paths
that converges in the 1-variation topology to
. Each
can be written as,

We still have
![\| x^m-x^n \|_{1-var,[0,T]}=\| y^m-y^n \|_1,](https://s0.wp.com/latex.php?latex=%5C%7C+x%5Em-x%5En+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D%3D%5C%7C+y%5Em-y%5En+%5C%7C_1%2C&bg=ffffff&fg=333333&s=0&c=20201002)
so that
converges to some
in
. It is then clear that


Exercise: Let
. Show that
is the limit in 1-variation of piecewise linear interpolations if and only if
.
Let
be a piecewise continuous path and
. It is well-known that we can integrate
against
by using the Riemann–Stieltjes integral which is a natural extension of the Riemann integral. The idea is to use the Riemann sums

where
. It is easy to prove that, when the mesh of the subdivision
goes to 0, the Riemann sums converge to a limit which is independent from the sequence of subdivisions that was chosen. The limit is then denoted
and called the Riemann-Stieltjes integral of
against
. Since
has a bounded variation, it is easy to see that, more generally,

with
would also converge to
. If

is an absolutely continuous path, then it is not difficult to prove that we have

where the integral on the right hand side is understood in Riemann’s sense.
We have



![\le \sum_{k=0}^{n-1} \| y(t_k)\| \| x \|_{1-var,[t_k,t_{k+1}]}.](https://s0.wp.com/latex.php?latex=%5Cle+%5Csum_%7Bk%3D0%7D%5E%7Bn-1%7D+%5C%7C+y%28t_k%29%5C%7C+%5C%7C+x+%5C%7C_%7B1-var%2C%5Bt_k%2Ct_%7Bk%2B1%7D%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
Thus, by taking the limit when the mesh of the subdivision goes to 0, we obtain the estimate
![\left\| \int_0^T y(t) dx(t) \right\| \le \int_0^T \| y(t) \| \| dx(t) \| \le \| y \|_{\infty, [0,T]} \| x \|_{1-var,[0,T]},](https://s0.wp.com/latex.php?latex=%5Cleft%5C%7C+%5Cint_0%5ET+y%28t%29+dx%28t%29+%5Cright%5C%7C+%5Cle+%5Cint_0%5ET+%5C%7C+y%28t%29+%5C%7C+%5C%7C+dx%28t%29+%5C%7C+%5Cle+%5C%7C+y+%5C%7C_%7B%5Cinfty%2C+%5B0%2CT%5D%7D+%5C%7C+x+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D%2C&bg=ffffff&fg=333333&s=0&c=20201002)
where
is the notation for the Riemann-Stieltjes integral of
against the bounded variation path
. We can also estimate the Riemann-Stieltjes integral in the 1-variation distance. We collect the following estimate for later use:
Proposition: Let
be a piecewise continuous path and
. We have
![\left\| \int_0^{\cdot} y'(t) dx'(t)-\int_0^{\cdot} y(t) dx(t) \right\|_{1-var,[0,T]} \le \| x \|_{1-var,[0,T]} \| y-y' \|_{\infty, [0,T]} + \| y' \|_{\infty, [0,T]} \| x -x'\|_{1-var,[0,T]}.](https://s0.wp.com/latex.php?latex=%5Cleft%5C%7C+%5Cint_0%5E%7B%5Ccdot%7D+y%27%28t%29+dx%27%28t%29-%5Cint_0%5E%7B%5Ccdot%7D+y%28t%29+dx%28t%29+%5Cright%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D+%5Cle+%5C%7C+x+%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D+%5C%7C+y-y%27+%5C%7C_%7B%5Cinfty%2C+%5B0%2CT%5D%7D+%2B+%5C%7C+y%27+%5C%7C_%7B%5Cinfty%2C+%5B0%2CT%5D%7D+%5C%7C+x+-x%27%5C%7C_%7B1-var%2C%5B0%2CT%5D%7D.&bg=ffffff&fg=333333&s=0&c=20201002)
The Riemann-Stieltjes satisfies the usual rules of calculus, for instance the integration by parts formula takes the following form
Proposition: Let
and
.

We also have the following change of variable formula:
Proposition: Let
and let
be a
map. We have

Proof: From the mean value theorem

with
. The result is then obtained by taking the limit when the mesh of the subdivision goes to 0 
We finally state a classical analysis lemma, Gronwall’s lemma, which provides a wonderful tool to estimate solutions of differential equations.
Proposition: Let
and let
be a bounded measurable function. If,

for some
, then
![\Phi(t) \le A \exp (B \| x \|_{1-var,[0,t]} )\quad 0 \le t \le T.](https://s0.wp.com/latex.php?latex=%5CPhi%28t%29+%5Cle+A+%5Cexp+%28B+%5C%7C+x+%5C%7C_%7B1-var%2C%5B0%2Ct%5D%7D+%29%5Cquad+0+%5Cle+t+%5Cle+T.&bg=ffffff&fg=333333&s=0&c=20201002)
Proof: Iterating the inequality

times, we get

where
is a remainder term that goes to 0 when
. Observing that
![\int_0^ t \int_0^{t_1} \cdots \int_0^{t_{k-1}} \| d x(t_k)\| \cdots \| dx(t_1) \|=\frac{ \| x \|^k_{1-var,[0,t]} }{k!}](https://s0.wp.com/latex.php?latex=%5Cint_0%5E+t+%5Cint_0%5E%7Bt_1%7D+%5Ccdots+%5Cint_0%5E%7Bt_%7Bk-1%7D%7D+%5C%7C+d+x%28t_k%29%5C%7C+%5Ccdots+%5C%7C+dx%28t_1%29+%5C%7C%3D%5Cfrac%7B+%5C%7C+x+%5C%7C%5Ek_%7B1-var%2C%5B0%2Ct%5D%7D+%7D%7Bk%21%7D&bg=ffffff&fg=333333&s=0&c=20201002)
and sending
to
finishes the proof 