Abstract
Knight’s well-known theorem says that orthogonal continuous local martingales, when time-changed by their brackets, become independent Brownian motions (see [1], [7]–[11]). What can be said when the given local martingales are not orthogonal? The standard way to deal with this case is to orthogonalize them, for instance with the Gram–Schmidt algorithm. This is indeed what was done by Knight himself when first using his theorem (see [9], Theorem 2.2); but he was working in a particular setting (Hunt processes) and did not give explicit formulas. Other examples where this orthogonalization is used are references [3] and [12].
Keywords
- Brownian Motion
- Markov Process
- Probability Space
- Explicit Formula
- Standard Brownian Motion
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Galtchouk, L. (2003). On the reduction of a multidimensional continuous martingale to a Brownian motion. In: Azéma, J., Émery, M., Ledoux, M., Yor, M. (eds) Séminaire de Probabilités XXXVII. Lecture Notes in Mathematics, vol 1832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40004-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-40004-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20520-3
Online ISBN: 978-3-540-40004-2
eBook Packages: Springer Book Archive
