A system is controlled by a control variable. The control variable could be of finite or infinite dimensions. The roughness of control variable has determine the complexity of the system.The control variable could be very rough.

The It\^o functional I is continuous in the topology of uniform convergence in the case of the control variable is one dimensional,but only continuous in the uniform topology in the special case when the vector field commute. The It\^o functional is defined as

,

,

.

But the It\^o map I is continuous in the topology of convergence in the metric of $latex p$-variation of rough paths even in the vector case.

The classical ODE theory collapse when the path is very rough. The reason is very simple: the differential in the usual sense does not make sense. However, the classical ODE theory can be built by using the increment process of the path to construct approximate solutions, and one may take the limit to obtain the solution without first identifying the differential $latex dX_t$. Therefore, one may regard the whole collection as the ‘differential’ of if the path is of finite variation. However, if $latex t \to X_t$ is very rough, then the increment process is not enough to capture the differential , one needs the higher terms.

The fundamental idea is that the full differential of is the collection of all iterated path integrals, namely

Suppose is a continuous path in, for example, a finite-dimensional vector space such that one is able to solve a differential equation , and therefore we at least hope to define the path integral $latex\int\alpha(X)dX$, for any smooth one-form , and so especially the iterated path integrals

If is a path with finite variation then the first-order iterated path integral is nothing more than its increment process and the higher-order integrals can be obtained from

,

where the limit runs over all finite partition of [s,t] as the mesh size tends to zero. This means that the increment process determines all higher-order iterated path integrals, and hence the integrals of one-forms against the path . This explains why one only need in the classical smoothy-controlled ODE.

The advantage of using tensor product is that one can easily express a basic requirement for any reasonable integration theory. That is the additive property of integrals over different intervals. More precisely, one could set

and regard it as an element in the tensor algebra . Then the additive property exactly means that

The above identity is called Chen’s identity. However, it makes analysis hard if one is working with an infinite sequence , though i is not impossible.

The bounded variation of , that is

yields that the higher-order integrals are determined uniquely by , but those paths in which we are interested rarely satisfy the BV condition. For example, the brownian motion paths does not satisfy the BV condition even for , but they do satisfy the following weaker condition:

for any .

Therefore, if is a such a non-smooth path which satisfies the above condition and if we are able to define its iterated path integrals , then it is reasonable to expect these iterated path integrals to satisfying the scaling control:

.

A rough path, roughly speaking, is such a continuous path for which we have an integration theory, and therefore from which a sequence of iterated path integrals may be constructed.

Given a Banach space with norm together with a sequence of tensor norms on the algebraic tensor products satisfying the following compatibility condition:

For each , define the following (truncated) tensor algebra

: .

Its multiplication (also called the tensor product) is the usual multiplication as polynomials, except that the higher-order terms are omitted. In other words, if are two vectors in , then

,

where its th component is $latex\zeta^k =\sum_{j=0}^{k}\xi^j\otimes\eta^{k-j},\quad k=0,1,\cdots n$. Then norm on is defined by

,

though different, but equivalent. For , ,

Use to denote the simplex .

A control is then a continuous, super-additive function on $\delta$ with values in $latex[0,\infty)$ such that . Therefore,

.

**Definition 1** A continuous map from the simplex into a truncated tensor algebra ,and written as

,

is called a multiplicative functional of degree n if (for all ) and , where the tensor product is taken in .

The Chen’s identity represents a basic requirement on any ‘continuous path’ in which has an integration theory. It is equivalent to the additive property of integrals over different intervals. However, Chen’s identity is purely algebraic. If we have an analytic condition would be nice.

**Definition 2** Let be a constant. We say that a map

possesses finite -variation if , for some control .

**Lemma 1 **For ,let

. Then ,where . Let .

Lemma 1 implies that . Applying the maximum principle to , and using the fact that , we may conclude that

. Hence,

. by the fact that ,

we have (**Binomial inequality**)

.

**Definition 3** A multiplicative functional with finite -variation in is called a **rough path** (of roughness p). We say that a rough path in is controlled by if

.

The set of all rough paths with roughness in will be denoted by . *Hence, any rough path with roughness in has a unique, canonical extension to a multiplicative functional in with finite-variation. *

**Almost rough path**

**Definition 4** Let be a constant. A function is called an almost rough path (of roughness p) if it is of finite -variation, and, for some control and some constant , , for all and . Rough path can be established based on almost rough path as shown in Theorem 3.2.1 in Lyons.

**Definition 5** A function is said to have finite total -variation if , where runs over all finite divisions of [0,T] and, denote continuous function from the simplex into the truncated tensor algebra ,with an appropriate norm and with .

The variation metric on is defined by .

A rough path is called a smooth rough path if is a continuous path with finite variation and is the th iterated path integral of the path over the interval [s,t] (for ),that is

.

**Definition 6 **Geometric rough paths with roughness are the rough paths in the closure of smooth rough paths under -variation distance (or, equivalently, under -variation topology). Thus, a rough path is a geometric rough path if there is a sequence of smooth rough paths in such that

.

## Leave a comment

Comments feed for this article