IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v36y2023i1d10.1007_s10959-022-01161-5.html
   My bibliography  Save this article

A Strong Version of the Skorohod Representation Theorem

Author

Listed:
  • Luca Pratelli

    (Accademia Navale)

  • Pietro Rigo

    (Università di Bologna)

Abstract

For each $$n\ge 0$$ n ≥ 0 , let $$\mu _n$$ μ n be a tight probability measure on the Borel $$\sigma $$ σ -field of a metric space S. Let $$(T,{\mathcal {C}})$$ ( T , C ) be a measurable space such that the diagonal $$\bigl \{(t,t):t\in T\bigr \}$$ { ( t , t ) : t ∈ T } belongs to $${\mathcal {C}}\otimes {\mathcal {C}}$$ C ⊗ C . Fix a measurable function $$g:S\rightarrow T$$ g : S → T and suppose $$\mu _n=\mu _0$$ μ n = μ 0 on $$g^{-1}({\mathcal {C}})$$ g - 1 ( C ) for all $$n\ge 0$$ n ≥ 0 . Necessary and sufficient conditions for the existence of S-valued random variables $$X_n$$ X n , defined on the same probability space and satisfying $$\begin{aligned} X_n\overset{\text {a.s.}}{\longrightarrow }X_0,\quad X_n\sim \mu _n\,\text { and } \,g(X_n)=g(X_0)\,\text { for all }n\ge 0, \end{aligned}$$ X n ⟶ a.s. X 0 , X n ∼ μ n and g ( X n ) = g ( X 0 ) for all n ≥ 0 , are given. Such conditions are then applied to several examples. The tightness condition on $$\mu _0$$ μ 0 can be dropped at the price of some assumptions on S and g.

Suggested Citation

  • Luca Pratelli & Pietro Rigo, 2023. "A Strong Version of the Skorohod Representation Theorem," Journal of Theoretical Probability, Springer, vol. 36(1), pages 372-389, March.
  • Handle: RePEc:spr:jotpro:v:36:y:2023:i:1:d:10.1007_s10959-022-01161-5
    DOI: 10.1007/s10959-022-01161-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-022-01161-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10959-022-01161-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Huy N. Chau & Mikl'os R'asonyi, 2016. "Skorohod's representation theorem and optimal strategies for markets with frictions," Papers 1606.07311, arXiv.org, revised Apr 2017.
    2. Crimaldi, Irene & Pratelli, Luca, 2005. "Two inequalities for conditional expectations and convergence results for filters," Statistics & Probability Letters, Elsevier, vol. 74(2), pages 151-162, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Patrizia Berti & Luca Pratelli & Pietro Rigo, 2021. "A Central Limit Theorem for Predictive Distributions," Mathematics, MDPI, vol. 9(24), pages 1-11, December.
    2. Huy N. Chau & Miklos Rasonyi, 2019. "Behavioural investors in conic market models," Papers 1903.08156, arXiv.org.
    3. Camargo, Braz, 2014. "Learning in society," Games and Economic Behavior, Elsevier, vol. 87(C), pages 381-396.
    4. Pooya Molavi & Ceyhun Eksin & Alejandro Ribeiro & Ali Jadbabaie, 2016. "Learning to Coordinate in Social Networks," Operations Research, INFORMS, vol. 64(3), pages 605-621, June.
    5. Erhan Bayraktar & Leonid Dolinskyi & Yan Dolinsky, 2020. "Extended weak convergence and utility maximisation with proportional transaction costs," Finance and Stochastics, Springer, vol. 24(4), pages 1013-1034, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:36:y:2023:i:1:d:10.1007_s10959-022-01161-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.