In
stochastic analysis, a rough path is a generalization of the classical notion of a smooth path. It extends calculus and
differential equation theory to handle irregular signals—paths that are too rough for traditional analysis, such as a
Wiener process
In mathematics, the Wiener process (or Brownian motion, due to its historical connection with Brownian motion, the physical process of the same name) is a real-valued continuous-time stochastic process discovered by Norbert Wiener. It is one o ...
. This makes it possible to define and solve controlled differential equations of the form
even when the driving path
lacks classical
differentiability. The theory was introduced in the 1990s by
Terry Lyons.
Rough path theory captures how
nonlinear systems
In mathematics and science, a nonlinear system (or a non-linear system) is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathem ...
interact with highly
oscillatory
Oscillation is the repetitive or periodic variation, typically in time, of some measure about a central value (often a point of equilibrium) or between two or more different states. Familiar examples of oscillation include a swinging pendulum ...
or
noisy input. It builds on the integration theory of
L. C. Young, the
geometric algebra of
Kuo-Tsai Chen, and the Lipschitz function theory of
Hassler Whitney
Hassler Whitney (March 23, 1907 – May 10, 1989) was an American mathematician. He was one of the founders of singularity theory, and did foundational work in manifolds, embeddings, immersion (mathematics), immersions, characteristic classes and, ...
, while remaining compatible with key ideas in
stochastic calculus
Stochastic calculus is a branch of mathematics that operates on stochastic processes. It allows a consistent theory of integration to be defined for integrals of stochastic processes with respect to stochastic processes. This field was created an ...
. The theory also extends
Itô's theory of stochastic differential equations far beyond the
semimartingale setting. Its definitions and uniform estimates form a robust framework that can recover classical results—such as the
Wong–Zakai theorem, the
Stroock–Varadhan support theorem, and the construction of stochastic flows—without relying on probabilistic properties like
martingales or predictability.
A central concept in the theory is the Signature of a path: a noncommutative transform that encodes the path as a sequence of iterated
integrals
In mathematics, an integral is the continuous analog of a sum, which is used to calculate areas, volumes, and their generalizations. Integration, the process of computing an integral, is one of the two fundamental operations of calculus,Int ...
. Formally, it is a
homomorphism
In algebra, a homomorphism is a morphism, structure-preserving map (mathematics), map between two algebraic structures of the same type (such as two group (mathematics), groups, two ring (mathematics), rings, or two vector spaces). The word ''homo ...
from the
monoid
In abstract algebra, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being .
Monoids are semigroups with identity ...
of paths (under concatenation) into the group-like elements of a
tensor algebra
In mathematics, the tensor algebra of a vector space ''V'', denoted ''T''(''V'') or ''T''(''V''), is the algebra over a field, algebra of tensors on ''V'' (of any rank) with multiplication being the tensor product. It is the free algebra on ''V'', ...
. The Signature is faithful—it uniquely characterizes paths up to certain negligible modifications—making it a powerful tool for representing and comparing paths. These iterated integrals play a role similar to
monomials in a
Taylor expansion
In mathematics, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor ser ...
: they provide a coordinate system that captures the essential features of a path. Just as
Taylor’s theorem allows a smooth function to be approximated locally by
polynomials
In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication and exponentiation to nonnegative int ...
, the terms of the Signature offer a structured, hierarchical summary of a path’s behavior. This enriched representation forms the basis for defining a rough path and enables analysis without directly examining its fine-scale structure.
The theory has widespread applications across mathematics and applied fields. Notably,
Martin Hairer used rough path techniques to help construct a solution theory for the
KPZ equation, and later developed the more general theory of
regularity structures, for which he was awarded the
Fields Medal
The Fields Medal is a prize awarded to two, three, or four mathematicians under 40 years of age at the International Congress of Mathematicians, International Congress of the International Mathematical Union (IMU), a meeting that takes place e ...
in 2014.
Motivation
Rough path theory aims to make sense of the controlled differential equation
:
where the control, the continuous path
taking values in a
Banach space
In mathematics, more specifically in functional analysis, a Banach space (, ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and ...
, need not be differentiable nor of bounded variation. A prevalent example of the controlled path
is the sample path of a
Wiener process
In mathematics, the Wiener process (or Brownian motion, due to its historical connection with Brownian motion, the physical process of the same name) is a real-valued continuous-time stochastic process discovered by Norbert Wiener. It is one o ...
. In this case, the aforementioned controlled differential equation can be interpreted as a
stochastic differential equation and integration against "
" can be defined in the sense of
Itô. However, Itô's calculus is defined in the sense of
and is in particular not a pathwise definition. Rough paths give an almost sure pathwise definition of stochastic differential equations. The rough path notion of solution is well-posed in the sense that if
is a sequence of smooth paths converging to
in the
-variation metric (described below), and
:
:
then
converges to
in the
-variation metric.
This continuity property and the deterministic nature of solutions makes it possible to simplify and strengthen many results in Stochastic Analysis, such as the
Freidlin-Wentzell's Large Deviation theory as well as results about stochastic flows.
In fact, rough path theory can go far beyond the scope of Itô and
Stratonovich calculus and allows to make sense of differential equations driven by non-
semimartingale paths, such as
Gaussian process
In probability theory and statistics, a Gaussian process is a stochastic process (a collection of random variables indexed by time or space), such that every finite collection of those random variables has a multivariate normal distribution. The di ...
es and
Markov process
In probability theory and statistics, a Markov chain or Markov process is a stochastic process describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, ...
es.
Definition of a rough path
Rough paths are paths taking values in the truncated free tensor algebra (more precisely: in the free nilpotent group embedded in the free tensor algebra), which this section now briefly recalls. The tensor powers of
, denoted
, are equipped with the projective norm
(see
Topological tensor product, note that rough path theory in fact works for a more general class of norms).
Let
be the truncated tensor algebra
:
where by convention
.
Let
be the simplex
.
Let
. Let
and
be continuous maps
.
Let
denote the projection of
onto
-tensors and likewise for
. The
-variation metric is defined as
:
where the supremum is taken over all finite partitions
of