Holder-Continuous Rough Paths by Fourier Normal Ordering

We construct in this article an explicit geometric rough path over arbitrary d-dimensional paths with finite 1/alpha-variation for any alpha is an element of (0, 1). The method may be coined as 'Fourier normal ordering', since it consists in a regularization obtained after permuting the order of integration in iterated integrals so that innermost integrals have highest Fourier frequencies. In doing so, there appear non-trivial tree combinatorics, which are best understood by using the structure of the Hopf algebra of decorated rooted trees (in connection with the Chen or multiplicative property) and of the Hopf shuffle algebra (in connection with the shuffle or geometric property). Holder continuity is proved by using Besov norms. The method is well-suited in particular in view of applications to probability theory (see the companion article [34] for the construction of a rough path over multidimensional fractional Brownian motion with Hurst index alpha < 1/4, or [35] for a short survey in that case).