Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Σ-algebra
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
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!
===Sub σ-algebras=== In much of probability, especially when [[conditional expectation]] is involved, one is concerned with sets that represent only part of all the possible information that can be observed. This partial information can be characterized with a smaller σ-algebra which is a subset of the principal σ-algebra; it consists of the collection of subsets relevant only to and determined only by the partial information. Formally, if <math>\Sigma, \Sigma'</math> are σ-algebras on <math>X</math>, then <math>\Sigma'</math> is a sub σ-algebra of <math>\Sigma</math> if <math>\Sigma' \subseteq \Sigma</math>. The [[Bernoulli process]] provides a simple example. This consists of a sequence of random coin flips, coming up Heads (<math>H</math>) or Tails (<math>T</math>), of unbounded length. The [[sample space]] Ω consists of all possible infinite sequences of <math>H</math> or <math>T:</math> <math display=block>\Omega = \{H, T\}^\infty = \{(x_1, x_2, x_3, \dots) : x_i \in \{H, T\}, i \geq 1\}.</math> The full sigma algebra can be generated from an ascending sequence of subalgebras, by considering the information that might be obtained after observing some or all of the first <math>n</math> coin flips. This sequence of subalgebras is given by <math display=block> \mathcal{G}_n = \{A \times \{ \Omega \} : A \subseteq \{H, T\}^n\} </math> Each of these is finer than the last, and so can be ordered as a [[Filtration (probability theory)|filtration]] <math display=block>\mathcal{G}_0 \subseteq \mathcal{G}_1 \subseteq \mathcal{G}_2 \subseteq \cdots \subseteq \mathcal{G}_\infty</math> The first subalgebra <math>\mathcal{G}_0 = \{\varnothing, \Omega\}</math> is the trivial algebra: it has only two elements in it, the empty set and the total space. The second subalgebra <math>\mathcal{G}_1</math> has four elements: the two in <math>\mathcal{G}_0</math> plus two more: sequences that start with <math>H</math> and sequences that start with <math>T</math>. Each subalgebra is finer than the last. The <math>n</math>'th subalgebra contains <math>2^{n+1}</math> elements: it divides the total space <math>\Omega</math> into all of the possible sequences that might have been observed after <math>n</math> flips, including the possible non-observation of some of the flips. The limiting algebra <math>\mathcal{G}_\infty</math> is the smallest σ-algebra containing all the others. It is the algebra generated by the [[product topology]] or [[weak topology]] on the product space <math>\{H,T\}^\infty.</math>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Σ-algebra
(section)
Add topic