# understanding of rough path

A rough path is defined as an ordered pair $(X, \mathbb X)$, where $X$ is a path mapping from $[0,T]$ to some Banach space $V$ and $\mathbb X:[0,T]^2 \mapsto V^2$ is another mapping for additional information on the curve $X$.

I am not quite into their motivation, although there are some discussions online. In particular, I find the following remark in the first paragraph of chapter 9 of the book (link) `Multidimensional Stochastic Processes as Rough Paths: Theory and Applications' by Friz and Victoir: Consider $X$ of finite $p$-variation with $p\ge 2$. ... the knowledge of higher indefinite iterated integrals up to order $N = [p]$ must be an apriori information, i.e. assumed to be known.

Intuitively, I thought, as long as the curve $X$ is given, all the attached information (like $\mathbb X$) shall not be apriori, i.e. one can obtain (may be hard) $\mathbb X$ from the given $X$, which is contrary to the above.

There are many discussions on the rough path theory. However, is there any explanation on the above statement in a easier way, which can be understood to a person who has knowledge of Ito stochastic analysis but none of rough path theory?

Some of the confusion may be caused by the use of the word "information". You are right that in a probabilistic context, one would typically like to build $\mathbb{X}$ as a measurable function of $X$, so in this sense $X$ would contain all the information required to build $\mathbb{X}$. The point they are making is that there is no canonical way to do this, so different constructions may produce different choices of $\mathbb{X}$. In this sense, $\mathbb{X}$ does encode some information not contained in $X$, since it indirectly tells you something about which construction you've used to produce it. For example, if $X$ is a Brownian motion, you can construct $\mathbb{X}$ either by Itô integration or by Stratonovich integration (or in some other way), and inspecting $\mathbb{X}$ would reveal information about your choice of integration.
Going back to the motivation, the aim is to use $X$ to solve differential equations of the type $$\dot Y = F_0(Y) + \sum_{i=1}^m F_i(Y) \dot X_i\;,$$ or, if you prefer, $$dY = F_0(Y)\,dt + \sum_{i=1}^m F_i(Y) \,dX_i(t)\;.$$ It turns out that the solution map $S\colon X \mapsto Y$ is simply not continuous in the $p$-variation topology as soon as $p \ge 2$. Similarly, it is not continuous in the $\alpha$-Hölder topology as soon as $\alpha < 1/2$. What this means is that for any given $X$ (even a smooth one), you can find sequences of smooth functions $X^{(n)}$ and $\bar X^{(n)}$ that both converge to $X$ in, say, the ${1\over 2}$-Hölder topology, but such that the solutions $S(X^{(n)})$ and $S(\bar X^{(n)})$ either converge to different limits, or fail to converge at all. In this sense, $X$ itself contains "not enough information", because different ways of approximating it may lead to different outcomes.
The point of rough path theory is to figure out what additional information should be added to $X$ so that continuity is restored, and this is precisely what $\mathbb{X}$ encodes. Note also that this is quite standard procedure when weak forms of convergence are involved. Think of Young measures or of varifolds: in both cases they encode some "additional information" required to apply some nonlinear transformation to an object obtained as a weak limit.