Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Bernoulli process
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Borel algebra=== Consider the [[countably infinite]] [[direct product]] of copies of <math>2=\{H,T\}</math>. It is common to examine either the one-sided set <math>\Omega=2^\mathbb{N}=\{H,T\}^\mathbb{N}</math> or the two-sided set <math>\Omega=2^\mathbb{Z}</math>. There is a natural [[topology]] on this space, called the [[product topology]]. The sets in this topology are finite sequences of coin flips, that is, finite-length [[string (computer science)|strings]] of ''H'' and ''T'' (''H'' stands for heads and ''T'' stands for tails), with the rest of (infinitely long) sequence taken as "don't care". These sets of finite sequences are referred to as [[cylinder set]]s in the product topology. The set of all such strings forms a [[sigma algebra]], specifically, a [[Borel algebra]]. This algebra is then commonly written as <math>(\Omega, \mathcal{B})</math> where the elements of <math>\mathcal{B}</math> are the finite-length sequences of coin flips (the cylinder sets).
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)