IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-1617-0_9.html
   My bibliography  Save this book chapter

Stochastic Processes

In: Many Valued Topology and its Applications

Author

Listed:
  • Ulrich Höhle

    (Bergische Universität, Fachbereich Mathematik)

Abstract

Let X be a non empty set, and ℝ X be the set of all real valued functions defined on X. For every x ∈ X let Π{x} : ℝ X ↦ ℝ{x} = ℝ be the canonical projection onto the xth coordinate. The standard σ-algebra of subsets of ℝ X is the coarsest σ-algebra M0(X) such that all projections Π{x} are Borel measurable. It is well known that a stochastic process with parameter set X is nothing but a probability measure defined on M0(X) . If (X, ϱ) is an ordinary metric space, then the set UC(X) of all uniformly continuous, real valued functions is not necessarily a measurable subset of ℝ X — i.e. in general the set UC(X) is not an element of M0(X) . Hence the characterization of those stochastic processes having uniformly continuous trajectories is a well known non trivial problem. The aim of this chapter is to look at this problem from the view point of many valued topology. We will give a topological characterization of stochastic processes with uniformly continuous trajectories which is based on many valued continuity. In Section 8.4 we will extend this result to countable inductive limits E of separable Fréchet spaces and show that a stochastic process π with parameter set E has continuous linear trajectories iff the induced random function Θ>π associated with π is linear and B(ℝE)-valued continuous where B(ℝE) denotes the probability σ-algebra determined by the probability space (ℝ E , M0(E, π). Finally, in Subsection 8.4.1 we explain the role of Minlos’ Theorem in the range of Boolean valued topologies.

Suggested Citation

  • Ulrich Höhle, 2001. "Stochastic Processes," Springer Books, in: Many Valued Topology and its Applications, chapter 0, pages 279-315, Springer.
  • Handle: RePEc:spr:sprchp:978-1-4615-1617-0_9
    DOI: 10.1007/978-1-4615-1617-0_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-1-4615-1617-0_9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.