an event is a collection of sample space outcomes

In statistics and probability theory, set of outcomes to which a probability is assigned

In probability possibility, an outcome is a set of outcomes of an experiment (a subset of the sample space) to which a probability is assigned.^[1] A uniform outcome whitethorn be an element of umteen different events,^[2] and different events in an try out are usually not equally promising, since they May admit very different groups of outcomes.^[3] An event consisting of only a idiosyncratic outcome is called an elementary event Oregon an substance event; that is, information technology is a singleton plant. An event ${\displaystyle S}$ is said to go on if ${\displaystyle S}$ contains the outcome ${\displaystyle x}$ of the experiment (operating theater trial) (that is, if ${\displaystyle x\in S}$ ). The probability (with respect to some probability measure) that an event ${\displaystyle S}$ occurs is the probability that ${\displaystyle S}$ contains the issue ${\displaystyle x}$ of an experimentation (that is, IT is the probability that ${\displaystyle x\in S}$ ). An event defines a complementary outcome, videlicet the complementary set (the event not occurring), and together these delimitate a Bernoulli trial: did the result occur or not?

Typically, when the sample place is finite, any subset of the try blank space is an outcome (that is, all elements of the power fix of the sample distance are defined as events). However, this approach does not solve well in cases where the sample blank is uncountably infinite. So, when defining a probability space it is possible, and frequently necessary, to keep out 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 52 playing cards with no jokers, and draw a single identity card from the deck, then the sample space is a 52-element set, as each wit is a possible outcome. An event, however, is any subset of the sample space, including whatsoever singleton set (an elemental event), the empty set (an impossible event, with probability zero) and the sample space itself (a certain event, with probability i). Unusual events are proper subsets of the sample space that contain multiple elements. So, e.g., possible events admit:

An Euler diagram of an event. ${\displaystyle B}$ is the sample space and ${\displaystyle A}$ is an event.
By the ratio of their areas, the probability of ${\displaystyle A}$ is approximately 0.4.

• "Violent and black concurrently without being a joker" (0 elements),
• "The 5 of Hearts" (1 element),
• "A King" (4 elements),
• "A Nerve card" (12 elements),
• "A Spade" (13 elements),
• "A Court card or a red suit" (32 elements),
• "A card" (52 elements).

Since all events are sets, they are usually written as sets (for deterrent example, {1, 2, 3}), and represented graphically using Venn diagrams. In the situation where each resultant in the sample space Ω is evenly likely, the chance ${\displaystyle P}$ of an issue ${\displaystyle A}$ is the following rule :

$${\displaystyle \mathrm {P} (A)={\frac {|A|}{|\Z |}}\,\ \left({\text{or els:}}\ \Pr(A)={\frac {|A|}{|\Z |}}\right)}$$

This prevai can readily be applied to each of the example events above.

Events in chance spaces [edit]

Defining all subsets of the sampling space as events works fit when there are only finitely many outcomes, only gives rise to problems when the try out space is infinite. For many standard chance distributions, such as the Gaussian distribution, the sample distribution space is the set of real numbers or any subset of the real numbers racket. Attempts to define probabilities for all subsets of the real numbers game run into difficulties when one considers 'badly behaved' sets, such as those that are nonmeasurable. Hence, information technology is essential to restrict attention to a Sir Thomas More limited family of subsets. For the standard tools of probability theory, such as joint and conditional 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 the Borel mensurable set derived from unions and intersections of intervals. However, the larger class of Lebesgue mensurable sets proves more than functional in practice.

In the general measure-theoretic description of probability spaces, an event Crataegus laevigata be defined atomic number 3 an element of a selected 𝜎-algebra of subsets of the sample blank space. Under this definition, any subset of the sample space that is not an chemical element of the 𝜎-algebra is not an event, and does not give a probability. With a reasonable specification of the probability space, however, all events of occupy are elements of the 𝜎-algebra.

A note on notation [cut]

Even though events are subsets of few sample place ${\displaystyle \Omega ,}$ they are often holographic as predicates or indicators involving random variables. For example, if ${\displaystyle X}$ is a historical-quantitative unselected variable defined on the sample space ${\displaystyle \Omega ,}$ the event

${\displaystyle \{\Z \in \Z \mid u<X(\omega )\leq v\}\,}$

can be written more handily as, simply,

$${\displaystyle u<X\leq v\,.}$$

This is especially common in formulas for a probability, such as

Pr ( u < X ≤ v ) = F ( v ) − F ( u ) . {\displaystyle \Pr(u<X\leq v)=F(v)-F(u)\,.}

The solidification ${\displaystyle u<X\leq v}$ is an good example of an inverse image under the mapping ${\displaystyle X}$ because ${\displaystyle \omega \in X^{-1}((u,v])}$ if and but if ${\displaystyle u<X(\omega )\leq v.}$

See likewise [edit]

• Atom (measure theory)
• Complementary event – Opposite of a chance event
• Elementary event
• Independent event
• Outcome (probability)
• Pairwise independent events

Notes [edit]

1. ^ Leon-Garcia, Alberto (2008). Probability, statistics and random processes for EE. Upper Saddleback River, NJ: Pearson.
2. ^ Pfeiffer, Paul E. (1978). Concepts of probability theory. Dover Publications. p. 18. ISBN978-0-486-63677-1.
3. ^ Foerster, Paul the Apostle A. (2006). Algebra and trigonometry: Functions and applications, Instructor's edition (Classics ed.). Amphetamine Saddle River, Jersey: Prentice Antechamber. p. 634. ISBN0-13-165711-9.

Extraneous links [edit]

• "Random event", Encyclopedia of Maths, EMS Imperativeness, 2001 [1994]
• Conventional definition in the Mizar system.

an event is a collection of sample space outcomes

Source: https://en.wikipedia.org/wiki/Event_(probability_theory)

Berbagi :