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
Probability space
(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!
== Non-atomic case == If {{math|1=''P''(''ω'') = 0}} for all {{math|''ω'' ∈ Ω}} (in this case, Ω must be uncountable, because otherwise {{math|1=P(Ω) = 1}} could not be satisfied), then equation ({{EquationNote|⁎}}) fails: the probability of a set is not necessarily the sum over the probabilities of its elements, as summation is only defined for countable numbers of elements. This makes the probability space theory much more technical. A formulation stronger than summation, [[measure theory]] is applicable. Initially the probabilities are ascribed to some "generator" sets (see the examples). Then a limiting procedure allows assigning probabilities to sets that are limits of sequences of generator sets, or limits of limits, and so on. All these sets are the σ-algebra <math> \mathcal{F}</math>. For technical details see [[Carathéodory's extension theorem]]. Sets belonging to <math> \mathcal{F}</math> are called [[measurable]]. In general they are much more complicated than generator sets, but much better than [[non-measurable set]]s.
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)