p-variation

From HandWiki
Revision as of 14:28, 6 February 2024 by Gametune (talk | contribs) (over-write)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In mathematical analysis, p-variation is a collection of seminorms on functions from an ordered set to a metric space, indexed by a real number [math]\displaystyle{ p\geq 1 }[/math]. p-variation is a measure of the regularity or smoothness of a function. Specifically, if [math]\displaystyle{ f:I\to(M,d) }[/math], where [math]\displaystyle{ (M,d) }[/math] is a metric space and I a totally ordered set, its p-variation is

[math]\displaystyle{ \| f \|_{p\text{-var}} = \left(\sup_D\sum_{t_k\in D}d(f(t_k),f(t_{k-1}))^p\right)^{1/p} }[/math]

where D ranges over all finite partitions of the interval I.

The p variation of a function decreases with p. If f has finite p-variation and g is an α-Hölder continuous function, then [math]\displaystyle{ g\circ f }[/math] has finite [math]\displaystyle{ \frac{p}{\alpha} }[/math]-variation.

The case when p is one is called total variation, and functions with a finite 1-variation are called bounded variation functions.

Link with Hölder norm

One can interpret the p-variation as a parameter-independent version of the Hölder norm, which also extends to discontinuous functions.

If f is α–Hölder continuous (i.e. its α–Hölder norm is finite) then its [math]\displaystyle{ \frac1{\alpha} }[/math]-variation is finite. Specifically, on an interval [a,b], [math]\displaystyle{ \| f \|_{\frac1\alpha\text{-var}}\le \| f \|_{\alpha}(b-a)^\alpha }[/math].

Conversely, if f is continuous and has finite p-variation, there exists a reparameterisation, [math]\displaystyle{ \tau }[/math], such that [math]\displaystyle{ f\circ\tau }[/math] is [math]\displaystyle{ 1/p- }[/math]Hölder continuous.[1]

If p is less than q then the space of functions of finite p-variation on a compact set is continuously embedded with norm 1 into those of finite q-variation. I.e. [math]\displaystyle{ \|f\|_{q\text{-var}}\le \|f\|_{p\text{-var}} }[/math]. However unlike the analogous situation with Hölder spaces the embedding is not compact. For example, consider the real functions on [0,1] given by [math]\displaystyle{ f_n(x)=x^n }[/math]. They are uniformly bounded in 1-variation and converge pointwise to a discontinuous function f but this not only is not a convergence in p-variation for any p but also is not uniform convergence.

Application to Riemann–Stieltjes integration

If f and g are functions from  [ab] to ℝ with no common discontinuities and with f having finite p-variation and g having finite q-variation, with [math]\displaystyle{ \frac1p+\frac1q\gt 1 }[/math] then the Riemann–Stieltjes Integral

[math]\displaystyle{ \int_a^b f(x) \, dg(x):=\lim_{|D|\to 0}\sum_{t_k\in D}f(t_k)[g(t_{k+1})-g({t_k})] }[/math]

is well-defined. This integral is known as the Young integral because it comes from (Young 1936).[2] The value of this definite integral is bounded by the Young-Loève estimate as follows

[math]\displaystyle{ \left|\int_a^b f(x) \, dg(x)-f(\xi)[g(b)-g(a)]\right|\le C\,\|f\|_{p\text{-var}}\|\,g\|_{q\text{-var}} }[/math]

where C is a constant which only depends on p and q and ξ is any number between a and b.[3] If f and g are continuous, the indefinite integral [math]\displaystyle{ F(w)=\int_a^w f(x) \, dg(x) }[/math] is a continuous function with finite q-variation: If astb then [math]\displaystyle{ \|F\|_{q\text{-var};[s,t]} }[/math], its q-variation on [s,t], is bounded by [math]\displaystyle{ C\|g\|_{q\text{-var};[s,t]}(\|f\|_{p\text{-var};[s,t]}+\|f\|_{\infty;[s,t]})\le2C\|g\|_{q\text{-var};[s,t]}(\|f\|_{p\text{-var};[a,b]}+f(a)) }[/math] where C is a constant which only depends on p and q.[4]

Differential equations driven by signals of finite p-variation, p < 2

A function from ℝd to e × d real matrices is called an ℝe-valued one-form on ℝd.

If f is a Lipschitz continuous ℝe-valued one-form on ℝd, and X is a continuous function from the interval [ab] to ℝd with finite p-variation with p less than 2, then the integral of f on X, [math]\displaystyle{ \int_a^b f(X(t))\,dX(t) }[/math], can be calculated because each component of f(X(t)) will be a path of finite p-variation and the integral is a sum of finitely many Young integrals. It provides the solution to the equation [math]\displaystyle{ dY=f(X)\,dX }[/math] driven by the path X.

More significantly, if f is a Lipschitz continuous ℝe-valued one-form on ℝe, and X is a continuous function from the interval [ab] to ℝd with finite p-variation with p less than 2, then Young integration is enough to establish the solution of the equation [math]\displaystyle{ dY=f(Y)\,dX }[/math] driven by the path X.[5]

Differential equations driven by signals of finite p-variation, p [math]\displaystyle{ \ge }[/math] 2

The theory of rough paths generalises the Young integral and Young differential equations and makes heavy use of the concept of p-variation.

For Brownian motion

p-variation should be contrasted with the quadratic variation which is used in stochastic analysis, which takes one stochastic process to another. In particular the definition of quadratic variation looks a bit like the definition of p-variation, when p has the value 2. Quadratic variation is defined as a limit as the partition gets finer, whereas p-variation is a supremum over all partitions. Thus the quadratic variation of a process could be smaller than its 2-variation. If Wt is a standard Brownian motion on [0, T], then with probability one its p-variation is infinite for [math]\displaystyle{ p\le2 }[/math] and finite otherwise. The quadratic variation of W is [math]\displaystyle{ [W]_T=T }[/math].

Computation of p-variation for discrete time series

For a discrete time series of observations X0,...,XN it is straightforward to compute its p-variation with complexity of O(N2). Here is an example C++ code using dynamic programming:

double p_var(const std::vector<double>& X, double p) {
	if (X.size() == 0)
		return 0.0;
	std::vector<double> cum_p_var(X.size(), 0.0);   // cumulative p-variation
	for (size_t n = 1; n < X.size(); n++) {
		for (size_t k = 0; k < n; k++) {
			cum_p_var[n] = std::max(cum_p_var[n], cum_p_var[k] + std::pow(std::abs(X[n] - X[k]), p));
		}
	}
	return std::pow(cum_p_var.back(), 1./p);
}

There exist much more efficient, but also more complicated, algorithms for ℝ-valued processes[6] [7] and for processes in arbitrary metric spaces.[7]

References

  1. Ullrich, David C. (27 Feb 2018). "real analysis - Link between p-variation and Hölder norm". https://math.stackexchange.com/a/2669388/330413. 
  2. "Lecture 7. Young's integral". 25 December 2012. https://fabricebaudoin.wordpress.com/2012/12/25/lecture-7-youngs-integral/. 
  3. Friz, Peter K.; Victoir, Nicolas (2010). Multidimensional Stochastic Processes as Rough Paths: Theory and Applications (Cambridge Studies in Advanced Mathematics ed.). Cambridge University Press. 
  4. Lyons, Terry; Caruana, Michael; Levy, Thierry (2007). Differential equations driven by rough paths, vol. 1908 of Lecture Notes in Mathematics. Springer. 
  5. "Lecture 8. Young's differential equations". 26 December 2012. https://fabricebaudoin.wordpress.com/2012/12/26/lecture-8-youngs-differential-equations/. 
  6. Butkus, V.; Norvaiša, R. (2018). "Computation of p-variation". Lithuanian Mathematical Journal 58 (4): 360–378. doi:10.1007/s10986-018-9414-3. 
  7. 7.0 7.1 "P-var". 8 May 2020. https://github.com/khumarahn/p-var. 
  • Young, L.C. (1936), "An inequality of the Hölder type, connected with Stieltjes integration", Acta Mathematica 67 (1): 251–282, doi:10.1007/bf02401743 .

External links