Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Event (probability theory)

From Wikipedia, the free encyclopedia
In statistics and probability theory, set of outcomes to which a probability is assigned
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Event" probability theory – news ·newspapers ·books ·scholar ·JSTOR
(January 2018) (Learn how and when to remove this message)
Part of a series onstatistics
Probability theory

Inprobability theory, anevent is asubset ofoutcomes of anexperiment (asubset of thesample space) to which a probability is assigned.[1] A single outcome may be an element of many different events,[2] and different events in an experiment are usually not equally likely, since they may include very different groups of outcomes.[3] An event consisting of only a single outcome is called anelementary event or anatomic event; that is, it is asingleton set. An event that has more than one possible outcome is called acompound event. An eventS{\displaystyle S} is said tooccur ifS{\displaystyle S} contains the outcomex{\displaystyle x} of theexperiment (or trial) (that is, ifxS{\displaystyle x\in S}).[4] The probability (with respect to someprobability measure) that an eventS{\displaystyle S} occurs is the probability thatS{\displaystyle S} contains the outcomex{\displaystyle x} of an experiment (that is, it is the probability thatxS{\displaystyle x\in S}). An event defines acomplementary event, namely the complementary set (the eventnot occurring), and together these define aBernoulli trial: did the event occur or not?

Typically, when thesample space is finite, any subset of the sample space is an event (that is, all elements of thepower set of the sample space are defined as events).[5] However, this approach does not work well in cases where the sample space isuncountably infinite. So, when defining aprobability space it is possible, and often necessary, to exclude certain subsets of the sample space from being events (see§ Events in probability spaces, below).

A simple example

[edit]

If we assemble a deck of 52playing cards with no jokers, and draw a single card from the deck, then the sample space is a 52-element set, as each card is a possible outcome. An event, however, is any subset of the sample space, including anysingleton set (anelementary event), theempty set (an impossible event, with probability zero) and the sample space itself (a certain event, with probability one). Other events areproper subsets of the sample space that contain multiple elements. So, for example, potential events include:

AnEuler diagram of an event.B{\displaystyle B} is the sample space andA{\displaystyle A} is an event.
By the ratio of their areas, the probability ofA{\displaystyle A} is approximately 0.4.
  • "Red and black at the same time without being a joker" (0 elements),
  • "The 5 of Hearts" (1 element),
  • "A King" (4 elements),
  • "A Face card" (12 elements),
  • "A Spade" (13 elements),
  • "A Face card or a red suit" (32 elements),
  • "A card" (52 elements).

Since all events are sets, they are usually written as sets (for example, {1, 2, 3}), and represented graphically usingVenn diagrams. In the situation where each outcome in the sample space Ω is equally likely, the probabilityP{\displaystyle P} of an eventA{\displaystyle A} is the followingformula:P(A)=|A||Ω| (alternatively: Pr(A)=|A||Ω|){\displaystyle \mathrm {P} (A)={\frac {|A|}{|\Omega |}}\,\ \left({\text{alternatively:}}\ \Pr(A)={\frac {|A|}{|\Omega |}}\right)}This rule can readily be applied to each of the example events above.

Events in probability spaces

[edit]

Defining all subsets of the sample space as events works well when there are only finitely many outcomes, but gives rise to problems when the sample space is infinite. For many standardprobability distributions, such as thenormal distribution, the sample space is the set of real numbers or some subset of thereal numbers. Attempts to define probabilities for all subsets of the real numbers run into difficulties when one considers'badly behaved' sets, such as those that arenonmeasurable. Hence, it is necessary to restrict attention to a more limited family of subsets. For the standard tools of probability theory, such asjoint andconditional probabilities, to work, it is necessary to use aσ-algebra, that is, a family closed under complementation and countable unions of its members. The most natural choice ofσ-algebra is theBorel measurable set derived from unions and intersections of intervals. However, the larger class ofLebesgue measurable sets proves more useful in practice.

In the generalmeasure-theoretic description ofprobability spaces, an event may be defined as an element of a selected𝜎-algebra of subsets of the sample space. Under this definition, any subset of the sample space that is not an element of the 𝜎-algebra is not an event, and does not have a probability. With a reasonable specification of the probability space, however, allevents of interest are elements of the 𝜎-algebra.

A note on notation

[edit]

Even though events are subsets of some sample spaceΩ,{\displaystyle \Omega ,} they are often written as predicates or indicators involvingrandom variables. For example, ifX{\displaystyle X} is a real-valued random variable defined on the sample spaceΩ,{\displaystyle \Omega ,} the event{ωΩu<X(ω)v}{\displaystyle \{\omega \in \Omega \mid u<X(\omega )\leq v\}\,}can be written more conveniently as, simply,u<Xv.{\displaystyle u<X\leq v\,.}This is especially common in formulas for aprobability, such asPr(u<Xv)=F(v)F(u).{\displaystyle \Pr(u<X\leq v)=F(v)-F(u)\,.}Thesetu<Xv{\displaystyle u<X\leq v} is an example of aninverse image under themappingX{\displaystyle X} becauseωX1((u,v]){\displaystyle \omega \in X^{-1}((u,v])} if and only ifu<X(ω)v.{\displaystyle u<X(\omega )\leq v.}

See also

[edit]

Notes

[edit]
  1. ^Leon-Garcia, Alberto (2008).Probability, statistics and random processes for electrical engineering. Upper Saddle River, NJ: Pearson.ISBN 9780131471221.
  2. ^Pfeiffer, Paul E. (1978).Concepts of probability theory. Dover Publications. p. 18.ISBN 978-0-486-63677-1.
  3. ^Foerster, Paul A. (2006).Algebra and trigonometry: Functions and Applications, Teacher's edition (Classics ed.). Upper Saddle River, NJ:Prentice Hall. p. 634.ISBN 0-13-165711-9.
  4. ^Dekking, Frederik Michel; Kraaikamp, Cornelis; Lopuhaä, Hendrik Paul; Ludolf Erwin, Meester (2005). Dekking, Michel (ed.).A modern introduction to probability and statistics: understanding why and how. Springer texts in statistics. London [Heidelberg]: Springer. p. 14.doi:10.1007/1-84628-168-7.ISBN 978-1-85233-896-1.
  5. ^Širjaev, Alʹbert N. (2016).Probability-1. Graduate texts in mathematics. Translated by Boas, Ralph Philip; Chibisov, Dmitry (3rd ed.). New York Heidelberg Dordrecht London: Springer.ISBN 978-0-387-72205-4.

External links

[edit]
Wikimedia Commons has media related toEvent (probability theory).
Retrieved from "https://en.wikipedia.org/w/index.php?title=Event_(probability_theory)&oldid=1269363722"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp