Abstract:
"We study different possibilities to apply the principles of rough-paths theory in a non-commutative probability setting. First, we extend previous results obtained by Capitaine, Donati-Martin and Victoir in Lyons' original formulation of rough-paths theory. Then we settle the bases of an alternative non-commutative integration procedure, in the spirit of Gubinelli's controlled paths theory, and which allows us to revisit the constructions of Biane and Speicher in the free Brownian case. New approximation results are also derived from the strategy."
René Schott
Activity 2-unit 2-update 2024. English translation
International conference "QP 34 -- Quantum Probability and Related Topics"
1. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A rough-paths type approach to non-commutative stochastic
integration
René SCHOTT
Institut Elie Cartan, Université de Lorraine, Nancy, France
0 / 23
Rough-paths and non-commutative probability
2. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Joint work with Aurélien DEYA (Institut Elie Cartan)
Journal of Functional Analysis, Vol. 265, Issue 4, 594-628,
2013.
Objective : Adapt ideas from rough paths theory in a non-
commutative probability setting.
−→ To show the exibility of the rough-paths machinery.
−→ To provide another perspective on non-commutative stochastic
calculus
1 / 23
Rough-paths and non-commutative probability
3. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Joint work with Aurélien DEYA (Institut Elie Cartan)
Journal of Functional Analysis, Vol. 265, Issue 4, 594-628,
2013.
Objective : Adapt ideas from rough paths theory in a non-
commutative probability setting.
−→ To show the exibility of the rough-paths machinery.
−→ To provide another perspective on non-commutative stochastic
calculus (Reference : Biane-Speicher (PTRF 98'))
1 / 23
Rough-paths and non-commutative probability
4. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Joint work with Aurélien DEYA (Institut Elie Cartan)
Journal of Functional Analysis, Vol. 265, Issue 4, 594-628,
2013.
Objective : Adapt ideas from rough paths theory in a non-
commutative probability setting.
−→ To show the exibility of the rough-paths machinery.
−→ To provide another perspective on non-commutative stochastic
calculus (Reference : Biane-Speicher (PTRF 98'))
(Reference : Bozejko-Kümmerer-Speicher (Com. Math. Phys.
97')).
1 / 23
Rough-paths and non-commutative probability
5. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
1 / 23
Rough-paths and non-commutative probability
6. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
1 / 23
Rough-paths and non-commutative probability
7. Classical rough paths theory [Lyons (98)]
Consider a non-dierentiable path
x : [0, T] → Rn
,
with Hölder regularity γ ∈ (0, 1) (i.e., xt − xs ≤ c |t − s|γ
).
Question : Given a smooth f : Rn
→ L(Rn
, Rn
), how can we dene
f (xt ) dxt ?
8. Classical rough paths theory [Lyons (98)]
Consider a non-dierentiable path
x : [0, T] → Rn
,
with Hölder regularity γ ∈ (0, 1) (i.e., xt − xs ≤ c |t − s|γ
).
Question : Given a smooth f : Rn
→ L(Rn
, Rn
), how can we dene
f (xt ) dxt ?
We would like this denition to be suciently extensible to cover
dierential equations
dyt = f (yt ) dxt .
9. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Rough paths theory =⇒ Give a sense to
f (xt ) dxt
when x : [0, T] → Rn
is a γ-Hölder path with γ ∈ (0, 1).
3 / 23
Rough-paths and non-commutative probability
10. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Rough paths theory =⇒ Give a sense to
f (xt ) dxt
when x : [0, T] → Rn
is a γ-Hölder path with γ ∈ (0, 1).
Application : Pathwise approach to stochastic calculus.
3 / 23
Rough-paths and non-commutative probability
11. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Rough paths theory =⇒ Give a sense to
f (xt ) dxt
when x : [0, T] → Rn
is a γ-Hölder path with γ ∈ (0, 1).
Application : Pathwise approach to stochastic calculus.
• The construction of the integral depends on γ :
γ
1
2
, γ ∈ (
1
3
,
1
2
] , γ ∈ (
1
4
,
1
3
] , . . .
3 / 23
Rough-paths and non-commutative probability
12. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Rough paths theory =⇒ Give a sense to
f (xt ) dxt
when x : [0, T] → Rn
is a γ-Hölder path with γ ∈ (0, 1).
Application : Pathwise approach to stochastic calculus.
• The construction of the integral depends on γ :
γ
1
2
, γ ∈ (
1
3
,
1
2
] , γ ∈ (
1
4
,
1
3
] , . . .
• When γ ≤ 1
2, additional assumptions on x.
3 / 23
Rough-paths and non-commutative probability
13. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
3 / 23
Rough-paths and non-commutative probability
14. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1/2 ('Young case')
Theorem (Young (1936))
If x is γ-Hölder and y is κ-Hölder with γ + κ 1, then the
Riemann sum ti ∈P[s,t]
yti
(xti +1
− xti
) converges as the mesh of
the partition P[s ,t] tends to 0. We dene
t
s
yu dxu := lim
|P[s,t]|→0
ti ∈P[s,t]
yti
(xti +1
− xti
).
4 / 23
Rough-paths and non-commutative probability
15. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1/2 ('Young case')
Theorem (Young (1936))
If x is γ-Hölder and y is κ-Hölder with γ + κ 1, then the
Riemann sum ti ∈P[s,t]
yti
(xti +1
− xti
) converges as the mesh of
the partition P[s ,t] tends to 0. We dene
t
s
yu dxu := lim
|P[s,t]|→0
ti ∈P[s,t]
yti
(xti +1
− xti
).
Application : x : [0, T] → Rn
γ-Hölder with γ 1/2.
f smooth ⇒ (t → f (xt )) γ-Hölder ⇒ f (xt ) dxt Young integral.
4 / 23
Rough-paths and non-commutative probability
16. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1/2 ('Young case')
Another way to see Young's result :
t
s
f (xu ) dxu = f (xs ) (xt − xs ) +
t
s
[f (xu ) − f (xs )] dxu .
5 / 23
Rough-paths and non-commutative probability
17. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1/2 ('Young case')
Another way to see Young's result :
t
s
f (xu ) dxu = f (xs ) (xt − xs ) +
t
s
[f (xu ) − f (xs )] dxu .
Main term :
f (xs ) (xt − xs ), with |f (xs ) (xt − xs )| ≤ c |t − s|γ
.
Residual term :
t
s
[f (xu ) − f (xs )] dxu with |
t
s
[f (xu ) − f (xs )] dxu | ≤ c |t − s|2γ
.
As 2γ 1, 'disappears in Riemann sum'.
5 / 23
Rough-paths and non-commutative probability
18. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1/2 ('Young case')
t
s
f (xu ) dxu =
ti ∈P[s,t]
ti +1
ti
f (xu ) dxu
=
ti ∈P[s,t]
f (xti
) (xti +1
− xti
) +
ti ∈P[s,t]
ti +1
ti
[f (xu ) − f (xti
)] dxu .
Main term :
f (xs ) (xt − xs ), with |f (xs ) (xt − xs )| ≤ c |t − s|γ
.
Residual term :
t
s
[f (xu ) − f (xs )] dxu with |
t
s
[f (xu ) − f (xs )] dxu | ≤ c |t − s|2γ
.
As 2γ 1, 'disappears in Riemann sum'.
5 / 23
Rough-paths and non-commutative probability
19. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
5 / 23
Rough-paths and non-commutative probability
20. Basics on classical rough paths theory Non-commutative probability theory and rough paths
If x ∈ Cγ with γ ≤ 1/2, we cannot guarantee the convergence of the
sum
ti ∈P[s,t]
f (xti
) (xti +1
− xti
).
6 / 23
Rough-paths and non-commutative probability
21. Basics on classical rough paths theory Non-commutative probability theory and rough paths
If x ∈ Cγ with γ ≤ 1/2, we cannot guarantee the convergence of the
sum
ti ∈P[s,t]
f (xti
) (xti +1
− xti
).
=⇒ We try to 'correct' the Riemann sum :
ti ∈P[s,t]
f (xti
) (xti +1
− xti
) + Cti ,ti +1
.
6 / 23
Rough-paths and non-commutative probability
22. Basics on classical rough paths theory Non-commutative probability theory and rough paths
If x ∈ Cγ with γ ≤ 1/2, we cannot guarantee the convergence of the
sum
ti ∈P[s,t]
f (xti
) (xti +1
− xti
).
=⇒ We try to 'correct' the Riemann sum :
ti ∈P[s,t]
f (xti
) (xti +1
− xti
) + Cti ,ti +1
.
To nd out a proper C, a few heuristic considerations. Suppose that
we can dene t
s
f (xu ) dxu . Then...
6 / 23
Rough-paths and non-commutative probability
23. t
s
f (xu ) dxu
= f (xs ) (xt − xs ) +
t
s
[f (xu ) − f (xs )] dxu
24. t
s
f (xu ) dxu
= f (xs ) (xt − xs ) +
t
s
[f (xu ) − f (xs )] dxu
= f (xs ) (xt − xs ) +
t
s
f (xs )(xu − xs ) dxu +
t
s
ys ,u dxu ,
where |ys ,u | = |f (xu ) − f (xs ) − f (xs )(xu − xs )| ≤ c |u − s|2γ.
25. t
s
f (xu ) dxu
= f (xs ) (xt − xs ) +
t
s
[f (xu ) − f (xs )] dxu
= f (xs ) (xt − xs ) +
t
s
f (xs )(xu − xs ) dxu +
t
s
ys ,u dxu ,
where |ys ,u | = |f (xu ) − f (xs ) − f (xs )(xu − xs )| ≤ c |u − s|2γ.
|
t
s
ys ,u dxu | ≤ c |t − s|3γ. As 3γ 1, 'disappears in Riemann sum'.
26. t
s
f (xu ) dxu
= f (xs ) (xt − xs ) +
t
s
[f (xu ) − f (xs )] dxu
= f (xs ) (xt − xs ) +
t
s
f (xs )(xu − xs ) dxu +
t
s
ys ,u dxu ,
where |ys ,u | = |f (xu ) − f (xs ) − f (xs )(xu − xs )| ≤ c |u − s|2γ.
|
t
s
ys ,u dxu | ≤ c |t − s|3γ. As 3γ 1, 'disappears in Riemann sum'.
⇒ Main term :
f (xs ) (xt − xs ) +
t
s
f (xs )(xu − xs ) dxu .
27. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition : when γ ∈ (1
3, 1
2],
t
s
f (xu ) dxu ” := ” lim
tk
f (xtk
) (xtk+1
− xtk
) + Ctk ,tk+1
where
Cs ,t :=
t
s
f (xs )(xu − xs ) dxu .
8 / 23
Rough-paths and non-commutative probability
28. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition : when γ ∈ (1
3, 1
2],
t
s
f (xu ) dxu ” := ” lim
tk
f (xtk
) (xtk+1
− xtk
) + Ctk ,tk+1
where
Cs ,t := ∂i fj (xs )
t
s
(x(i )
u − x(i )
s ) dx(j )
u .
8 / 23
Rough-paths and non-commutative probability
29. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition : when γ ∈ (1
3, 1
2],
t
s
f (xu ) dxu ” := ” lim
tk
f (xtk
) (xtk+1
− xtk
) + Ctk ,tk+1
where
Cs ,t := ∂i fj (xs )
t
s
u
s
dx(i )
v dx(j )
u .
8 / 23
Rough-paths and non-commutative probability
30. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition : when γ ∈ (1
3, 1
2],
t
s
f (xu ) dxu ” := ” lim
tk
f (xtk
) (xtk+1
− xtk
) + Ctk ,tk+1
where
Cs ,t := ∂i fj (xs )
t
s
u
s
dx(i )
v dx(j )
u .
=⇒ to dene the integral when γ ∈ (1
3, 1
2], we need to assume the
a priori existence of the Lévy area
x2,(i ,j )
s ,t
:=
t
s
u
s
dx(i )
v dx(j )
u
above x. Then everything works...
8 / 23
Rough-paths and non-commutative probability
31. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Assume that we can dene the Lévy area x2
= dxdx. Then :
9 / 23
Rough-paths and non-commutative probability
32. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Assume that we can dene the Lévy area x2
= dxdx. Then :
• We can indeed dene the integral f (xu ) dxu as
f (xu ) dxu := lim
tk
f (xtk
) (xtk+1
− xtk
) + f (xtk
) · x2
tk ,tk+1
.
9 / 23
Rough-paths and non-commutative probability
33. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Assume that we can dene the Lévy area x2
= dxdx. Then :
• We can indeed dene the integral f (xu ) dxu as
f (xu ) dxu := lim
tk
f (xtk
) (xtk+1
− xtk
) + f (xtk
) · x2
tk ,tk+1
.
• We can extend this denition to f (y) dx for a large class of paths
y, and then solve the equation
dyt = f (yt ) dxt .
9 / 23
Rough-paths and non-commutative probability
34. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Assume that we can dene the Lévy area x2
= dxdx. Then :
• We can indeed dene the integral f (xu ) dxu as
f (xu ) dxu := lim
tk
f (xtk
) (xtk+1
− xtk
) + f (xtk
) · x2
tk ,tk+1
.
• We can extend this denition to f (y) dx for a large class of paths
y, and then solve the equation
dyt = f (yt ) dxt .
• We can show that the solution y is a continuous function of
the pair (x, x2
), i.e., y = Φ(x, x2
) with Φ continuous w.r.t Hölder
topology.
9 / 23
Rough-paths and non-commutative probability
35. Basics on classical rough paths theory Non-commutative probability theory and rough paths
The procedure can be extended to any Hölder coecient γ ∈ (0, 1
3]
provided one can dene the iterated integrals of x :
dx, dxdx, dxdxdx, ...
10 / 23
Rough-paths and non-commutative probability
36. Basics on classical rough paths theory Non-commutative probability theory and rough paths
The procedure can be extended to any Hölder coecient γ ∈ (0, 1
3]
provided one can dene the iterated integrals of x :
dx, dxdx, dxdxdx, ...
It applies to stochastic processes in a pathwise way.
Y (ω) = Φ B(ω), B2
(ω) ,
where Φ is continuous and deterministic.
10 / 23
Rough-paths and non-commutative probability
37. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
10 / 23
Rough-paths and non-commutative probability
38. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Question : In the rough-paths machinery, what happens if we replace
the γ-Hölder path
x : [0, T] → Rn
with a γ-Hölder path
X : [0, T] → A,
where A is a non-commutative probability space?
11 / 23
Rough-paths and non-commutative probability
39. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
11 / 23
Rough-paths and non-commutative probability
40. Motivation : large random matrices
[Voiculescu]
Consider the sequence of random matrix-valued processes
Mn
t
:= Bn,(i ,j )
t 1≤i ,j ≤n
,
where the Bn,(i ,j )
n≥1,1≤i ,j ≤n
are independent standard Bm.
Denote Sn
t
:= 1√
2
Mn
t
+ (Mn
t
)∗ .
41. Motivation : large random matrices
[Voiculescu]
Consider the sequence of random matrix-valued processes
Mn
t
:= Bn,(i ,j )
t 1≤i ,j ≤n
,
where the Bn,(i ,j )
n≥1,1≤i ,j ≤n
are independent standard Bm.
Denote Sn
t
:= 1√
2
Mn
t
+ (Mn
t
)∗ .Then, almost surely, for all
t1, . . . , tk ,
1
n
Tr Sn
t1
· · · Sn
tk
42. Motivation : large random matrices
[Voiculescu]
Consider the sequence of random matrix-valued processes
Mn
t
:= Bn,(i ,j )
t 1≤i ,j ≤n
,
where the Bn,(i ,j )
n≥1,1≤i ,j ≤n
are independent standard Bm.
Denote Sn
t
:= 1√
2
Mn
t
+ (Mn
t
)∗ .Then, almost surely, for all
t1, . . . , tk ,
1
n
Tr Sn
t1
· · · Sn
tk
n→∞
−−−→ ϕ Xt1
· · · Xtk
,
for a certain path X : R+ → A, where (A, ϕ) is a particular non-
commutative probability space. This process is called the free
Brownian motion.
43. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Denition : A non-commutative probability space A is an algebra
of bounded operators (acting on some Hilbert space) endowed with
a trace ϕ, i.e., a linear functional ϕ : A → C such that
ϕ(1) = 1 , ϕ(XY ) = ϕ(YX) , ϕ(XX∗
) ≥ 0.
13 / 23
Rough-paths and non-commutative probability
44. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Denition : A non-commutative probability space A is an algebra
of bounded operators (acting on some Hilbert space) endowed with
a trace ϕ, i.e., a linear functional ϕ : A → C such that
ϕ(1) = 1 , ϕ(XY ) = ϕ(YX) , ϕ(XX∗
) ≥ 0.
To retain for the sequel : If X, Y ∈ A, then XY may be dierent
from YX.
13 / 23
Rough-paths and non-commutative probability
45. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Denition : A non-commutative probability space A is an algebra
of bounded operators (acting on some Hilbert space) endowed with
a trace ϕ, i.e., a linear functional ϕ : A → C such that
ϕ(1) = 1 , ϕ(XY ) = ϕ(YX) , ϕ(XX∗
) ≥ 0.
To retain for the sequel : If X, Y ∈ A, then XY may be dierent
from YX.
It is the natural framework to study the asymptotic behaviour of
large random matrices with size tending to innity.
13 / 23
Rough-paths and non-commutative probability
46. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
13 / 23
Rough-paths and non-commutative probability
47. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Question : In the rough-paths machinery, what happens if we replace
the γ-Hölder path
x : [0, T] → Rn
( xt − xs ≤ |t − s|γ
)
with a γ-Hölder path
X : [0, T] → A ( Xt − Xs A ≤ |t − s|γ
),
where A is a non-commutative probability space?
14 / 23
Rough-paths and non-commutative probability
48. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Question : In the rough-paths machinery, what happens if we replace
the γ-Hölder path
x : [0, T] → Rn
( xt − xs ≤ |t − s|γ
)
with a γ-Hölder path
X : [0, T] → A ( Xt − Xs A ≤ |t − s|γ
),
where A is a non-commutative probability space?
For instance, how can we dene
P(Xt ) · dXt
when P is a polynomial and · refers to the product in A ?
14 / 23
Rough-paths and non-commutative probability
49. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1
2 : Young theorem =⇒
P(Xt ) · dXt := lim
ti
P(Xti
) · (Xti +1
− Xti
).
15 / 23
Rough-paths and non-commutative probability
50. Basics on classical rough paths theory Non-commutative probability theory and rough paths
γ 1
2 : Young theorem =⇒
P(Xt ) · dXt := lim
ti
P(Xti
) · (Xti +1
− Xti
).
γ ∈ (1
3, 1
2] : corrected Riemann sums
P(Xt ) · dXt := lim
ti
P(Xti
) · (Xti +1
− Xti
) + Cti ,ti +1
.
Let us nd out C in this context...
15 / 23
Rough-paths and non-commutative probability
51. As in the nite-dimensional case, one has (morally)
t
s
P(Xu ) · dXu
= P(Xs ) · (Xt − Xs ) +
t
s
P(Xs )(Xu − Xs ) · dXu
+
t
s
Ys ,u · dXu ,
with t
s
Ys ,u · dXu ≤ c |t − s|3γ
.
52. As in the nite-dimensional case, one has (morally)
t
s
P(Xu ) · dXu
= P(Xs ) · (Xt − Xs ) +
t
s
P(Xs )(Xu − Xs ) · dXu
+
t
s
Ys ,u · dXu ,
with t
s
Ys ,u · dXu ≤ c |t − s|3γ
.
Since 3γ 1, main term :
P(Xs ) · (Xt − Xs ) +
t
s
P(Xs )(Xu − Xs ) · dXu .
53. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition :
P(Xt ) · dXt ” := ”
lim
tk
P(Xtk
)·(Xtk+1
−Xtk
)+
tk+1
tk
P(Xtk
)(Xu −Xtk
)·dXu .
17 / 23
Rough-paths and non-commutative probability
54. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition :
P(Xt ) · dXt ” := ”
lim
tk
P(Xtk
)·(Xtk+1
−Xtk
)+
tk+1
tk
P(Xtk
)(Xu −Xtk
)·dXu .
But : Remember that in nite dimension,
t
s
f (xs )(xu − xs ) · dxu = ∂i fj (xs )
t
s
u
s
dx(i )
v dx(j )
u .
17 / 23
Rough-paths and non-commutative probability
55. Basics on classical rough paths theory Non-commutative probability theory and rough paths
A natural denition :
P(Xt ) · dXt ” := ”
lim
tk
P(Xtk
)·(Xtk+1
−Xtk
)+
tk+1
tk
P(Xtk
)(Xu −Xtk
)·dXu .
But : Remember that in nite dimension,
t
s
f (xs )(xu − xs ) · dxu = ∂i fj (xs )
t
s
u
s
dx(i )
v dx(j )
u .
No longer possible for t
s
P(Xs )(Xu − Xs ) · dXu ...
=⇒ What can play the role of the Lévy area?
17 / 23
Rough-paths and non-commutative probability
56. Basics on classical rough paths theory Non-commutative probability theory and rough paths
For instance, when P(x) = x2,
t
s
P(Xs )(Xu − Xs ) · dXu
= Xs ·
t
s
(Xu − Xs ) · dXu +
t
s
(Xu − Xs ) · Xs · dXu
18 / 23
Rough-paths and non-commutative probability
57. Basics on classical rough paths theory Non-commutative probability theory and rough paths
For instance, when P(x) = x2,
t
s
P(Xs )(Xu − Xs ) · dXu
= Xs ·
t
s
(Xu − Xs ) · dXu +
t
s
(Xu − Xs ) · Xs · dXu
= Xs ·
t
s
u
s
dXv · dXu +
t
s
u
s
dXv · Xs · dXu .
18 / 23
Rough-paths and non-commutative probability
58. Basics on classical rough paths theory Non-commutative probability theory and rough paths
For instance, when P(x) = x2,
t
s
P(Xs )(Xu − Xs ) · dXu
= Xs ·
t
s
(Xu − Xs ) · dXu +
t
s
(Xu − Xs ) · Xs · dXu
= Xs ·
t
s
u
s
dXv · dXu +
t
s
u
s
dXv · Xs · dXu .
=⇒ For s t, we 'dene' the Lévy area X2
s ,t
as the operator on A
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A.
18 / 23
Rough-paths and non-commutative probability
59. Basics on classical rough paths theory Non-commutative probability theory and rough paths
For instance, when P(x) = x2,
t
s
P(Xs )(Xu − Xs ) · dXu
= Xs ·
t
s
(Xu − Xs ) · dXu +
t
s
(Xu − Xs ) · Xs · dXu
= Xs · X2
s ,t
[1] + X2
s ,t
[Xs ].
=⇒ For s t, we 'dene' the Lévy area X2
s ,t
as the operator on A
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A.
18 / 23
Rough-paths and non-commutative probability
60. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Assume that we can dene the Lévy area X2
in the previous sense.
19 / 23
Rough-paths and non-commutative probability
61. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Assume that we can dene the Lévy area X2
in the previous sense.
Then, for every polynomial P, we can indeed dene the integral
P(Xt ) · dXt
as the limit of corrected Riemann sums involving X and X2
.
19 / 23
Rough-paths and non-commutative probability
63. Given X2
, we can then dene :
•
P(Xt ) · dXt · Q(Xt )
for all polynomials P, Q.
64. Given X2
, we can then dene :
•
P(Xt ) · dXt · Q(Xt )
for all polynomials P, Q.
•
f (Xt ) · dXt · g(Xt )
for a large class of functions f , g : C → C (where f (Xt ), g(Xt ) are
understood in the functional calculus sense).
65. Given X2
, we can then dene :
•
P(Xt ) · dXt · Q(Xt )
for all polynomials P, Q.
•
f (Xt ) · dXt · g(Xt )
for a large class of functions f , g : C → C (where f (Xt ), g(Xt ) are
understood in the functional calculus sense).
•
f (Yt ) · dXt · g(Yt )
for a large class of processes Y : [0, T] → A.
66. Basics on classical rough paths theory Non-commutative probability theory and rough paths
With this denition in hand, we can solve the equation
dYt = f (Yt ) · dXt · g(Yt ).
21 / 23
Rough-paths and non-commutative probability
67. Basics on classical rough paths theory Non-commutative probability theory and rough paths
With this denition in hand, we can solve the equation
dYt = f (Yt ) · dXt · g(Yt ).
Continuity : Y = Φ(X, X2
), with Φ continuous.
⇒ approximation results.
21 / 23
Rough-paths and non-commutative probability
68. Basics on classical rough paths theory Non-commutative probability theory and rough paths
With this denition in hand, we can solve the equation
dYt = f (Yt ) · dXt · g(Yt ).
Continuity : Y = Φ(X, X2
), with Φ continuous.
⇒ approximation results.
Application : X free Bm ( Xt − Xs A ≤ c |t − s|1/2
)
21 / 23
Rough-paths and non-commutative probability
69. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Outline
1 Basics on classical rough paths theory
γ 1/2 ('Young case')
1
3 γ ≤ 1
2
2 Non-commutative probability theory and rough paths
Non-commutative processes
Integration
The free Bm case
21 / 23
Rough-paths and non-commutative probability
70. Let X : R+ → (A, ϕ) be a free Bm. In brief : to dene a stochastic
calculus w.r.t X, it suces to be able to give a sense to
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A. (1)
71. Let X : R+ → (A, ϕ) be a free Bm. In brief : to dene a stochastic
calculus w.r.t X, it suces to be able to give a sense to
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A. (1)
We can use the results of Biane-Speicher (PTRF 98') to dene (1)
as an 'Itô' integral, denoted by X2,Itô =⇒ the 'rough-paths' calculus
based on X2,Itô then coincides with Itô's stochastic calculus w.r.t X.
72. Let X : R+ → (A, ϕ) be a free Bm. In brief : to dene a stochastic
calculus w.r.t X, it suces to be able to give a sense to
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A. (1)
We can use the results of Biane-Speicher (PTRF 98') to dene (1)
as an 'Itô' integral, denoted by X2,Itô =⇒ the 'rough-paths' calculus
based on X2,Itô then coincides with Itô's stochastic calculus w.r.t X.
Another way to dene (1) : consider the linear interpolation Xn
of
X along tn
i
= i
n
(i = 1, . . . , n), and
X2,n
s ,t
[Y ] =
t
s
u
s
dXn
v
· Y · dXn
u
(Lebesgue integral).
73. Let X : R+ → (A, ϕ) be a free Bm. In brief : to dene a stochastic
calculus w.r.t X, it suces to be able to give a sense to
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A. (1)
We can use the results of Biane-Speicher (PTRF 98') to dene (1)
as an 'Itô' integral, denoted by X2,Itô =⇒ the 'rough-paths' calculus
based on X2,Itô then coincides with Itô's stochastic calculus w.r.t X.
Another way to dene (1) : consider the linear interpolation Xn
of
X along tn
i
= i
n
(i = 1, . . . , n), and
X2,n
s ,t
[Y ] =
t
s
u
s
dXn
v
· Y · dXn
u
(Lebesgue integral).
Then Xn
→ X and X2,n
→ X2,Strato.
74. Let X : R+ → (A, ϕ) be a free Bm. In brief : to dene a stochastic
calculus w.r.t X, it suces to be able to give a sense to
X2
s ,t
[Y ] =
t
s
u
s
dXv · Y · dXu for Y ∈ A. (1)
We can use the results of Biane-Speicher (PTRF 98') to dene (1)
as an 'Itô' integral, denoted by X2,Itô =⇒ the 'rough-paths' calculus
based on X2,Itô then coincides with Itô's stochastic calculus w.r.t X.
Another way to dene (1) : consider the linear interpolation Xn
of
X along tn
i
= i
n
(i = 1, . . . , n), and
X2,n
s ,t
[Y ] =
t
s
u
s
dXn
v
· Y · dXn
u
(Lebesgue integral).
Then Xn
→ X and X2,n
→ X2,Strato. Moreover,
X2,Strato
s ,t
[Y ] = X2,Itô
s ,t
[Y ] +
1
2
ϕ(Y ) (t − s).
75. Basics on classical rough paths theory Non-commutative probability theory and rough paths
Open questions
• Lévy area for other non-commutative γ-Hölder processes (with
γ ∈ (1
3, 1
2]) : q-Brownian motion, q ∈ (−1, 1).
• extension to non-martingale processes : q-Gaussian processes
([Bo»ejko-Kümmerer-Speicher]), ...
• smaller γ.
23 / 23
Rough-paths and non-commutative probability