1 Definition and basic concepts
An event is a collection of possible outcomes from a random experiment. In probability theory, it serves as the basic object to which a probability can be assigned. Events may describe a single outcome, several outcomes, or all outcomes of interest in a given situation. Because they are defined as sets, they can be analyzed using set operations such as union, intersection, and complement.
1.1 Random experiments and sample spaces
A random experiment is a repeatable process whose exact result is not known in advance. Examples include tossing a coin, rolling dice, drawing a card, or observing the next customer arrival in a queue. The set of all possible outcomes is called the sample space. It provides the universe within which events are defined.
1.2 Outcomes and events
An outcome is one specific result of a random experiment. An event is a subset of the sample space, meaning it may contain one outcome or many. When the experiment is performed, the event is said to occur if the actual outcome belongs to that subset.
1.2.1 Simple events
A simple event contains exactly one outcome. For example, in a single die roll, the event of obtaining a 4 is a simple event. Simple events are often used as building blocks for more complex descriptions.
1.2.2 Compound events
A compound event contains two or more outcomes. For instance, rolling an even number on a die corresponds to the outcomes 2, 4, and 6. Such events are useful when the interest lies in a category rather than a single result.
1.3 Event notation and set representation
Events are commonly represented by capital letters such as A, B, or C. If an event A consists of certain outcomes, it may be written as a set enclosed in braces. Set notation makes it possible to state relationships precisely and to apply algebraic rules to probability problems.
2 Types of events
Events are classified according to how they relate to the sample space and to one another. These classifications help describe whether an event can happen, must happen, or share outcomes with another event.
2.1 Elementary event
An elementary event is another term for a simple event containing a single outcome. It represents the most detailed possible description of a result in the sample space.
2.2 Sure event
A sure event is an event that always occurs. It is equal to the entire sample space, since at least one outcome from the experiment must happen. Its probability is 1 in standard probability models.
2.3 Impossible event
An impossible event contains no outcomes at all. It is represented by the empty set. Since it cannot occur, its probability is 0.
2.4 Complementary events
Two events are complementary when one event occurs exactly when the other does not. The complement of an event A consists of all outcomes in the sample space that are not in A. Together, an event and its complement account for every possible outcome.
2.5 Mutually exclusive events
Mutually exclusive events cannot occur at the same time in a single trial. They have no outcomes in common. For example, in one die roll, the events “roll a 2” and “roll a 5” are mutually exclusive.
2.6 Exhaustive events
A collection of events is exhaustive if at least one of them must occur. Their combined outcomes cover the whole sample space. Exhaustive events are often used to partition a problem into several complete cases.
3 Operations on events
Set operations allow events to be combined or compared in systematic ways. These operations are central to expressing complex probabilistic statements.
3.1 Union of events
The union of two events consists of all outcomes that belong to either event, or to both. It is often used to describe situations where one condition or another is acceptable. In probability notation, the union is frequently written as A ∪ B.
3.2 Intersection of events
The intersection of two events contains only the outcomes shared by both. It describes cases in which two conditions happen together. The intersection is written as A ∩ B.
3.3 Difference of events
The difference of two events includes outcomes in the first event that are not in the second. It captures results that satisfy one condition while excluding another. This operation is written as A \ B or A minus B.
3.4 Complement of an event
The complement of an event includes all outcomes outside that event but still within the sample space. It is a key tool for evaluating probabilities indirectly, especially when the event itself is difficult to count. The complement of A is commonly written as Aᶜ or A'.
3.4.1 De Morgan's laws
De Morgan's laws describe how complements interact with unions and intersections. The complement of a union equals the intersection of the complements, and the complement of an intersection equals the union of the complements. These rules are widely used to simplify event expressions.
4 Probability of events
Probability measures the likelihood that an event will occur. Once events are defined, probabilities assign numerical values to them according to a chosen model or method.
4.1 Assigning probability to an event
A probability is a number between 0 and 1. A value near 0 indicates that an event is unlikely, while a value near 1 indicates that it is likely. The exact assignment depends on the structure of the experiment and the assumptions being made.
4.2 Equally likely outcomes
When all outcomes in a sample space are considered equally likely, each outcome receives the same probability. This assumption simplifies many basic calculations, especially in games of chance such as coins, dice, and cards.
4.3 Classical probability
Classical probability is based on counting favorable outcomes and dividing by the total number of equally likely outcomes. It is one of the oldest and most intuitive approaches to probability. This method works well when the sample space is finite and symmetric.
4.4 Empirical probability
Empirical probability is estimated from observed data or repeated trials. It is defined as the relative frequency with which an event occurs. This approach is important when theoretical symmetry is unavailable or when real measurements are needed.
4.5 Axiomatic probability
Axiomatic probability defines probability through a set of formal rules. These rules ensure consistency across all events in a probability space. This framework supports modern probability theory and underlies many advanced applications.
5 Relationships between events
Events may be related through dependence, condition, or overlap. Understanding these relationships is essential for calculating probabilities in multi-step situations.
5.1 Independent events
Two events are independent if the occurrence of one does not change the probability of the other. Independence is a fundamental idea in models where separate trials do not influence each other. Coin tosses in a fair setting are a common example.
5.2 Dependent events
Events are dependent when the occurrence of one affects the likelihood of the other. Many real situations involve dependence, such as drawing cards without replacement. In such cases, probabilities must be adjusted to reflect the changed conditions.
5.3 Conditional events
A conditional event is considered under the assumption that another event has already occurred. Conditional probability measures the chance of one event given knowledge of another. This concept is central to sequential reasoning and updating beliefs.
5.4 Compatible and incompatible events
Compatible events can occur together, so their intersection is not empty. Incompatible events cannot occur simultaneously, making them mutually exclusive in many contexts. The distinction helps determine whether joint occurrence is possible.
6 Event spaces and sigma-algebras
In more advanced probability theory, not every subset of outcomes is automatically treated as an event. Formal structures are used to specify which collections of outcomes are allowed.
6.1 Event space
An event space is the collection of subsets from the sample space that are permitted as events. It organizes the sets on which probabilities may be defined. This structure becomes especially important when the sample space is large or continuous.
6.2 Sigma-algebra
A sigma-algebra is a family of subsets closed under complements and countable unions. It ensures that common event operations produce valid events within the same system. Sigma-algebras are central in rigorous probability and measure theory.
6.3 Measurable events
Measurable events are events that belong to the chosen sigma-algebra and therefore can be assigned a probability. The term emphasizes that a probability measure is defined only on allowable sets. This concept prevents inconsistencies in complex spaces.
7 Examples and applications
Events appear throughout probability problems and real-world modeling. They provide the language for describing outcomes and translating uncertainty into quantitative terms.
7.1 Coin tosses
In a coin toss, the sample space usually contains heads and tails. Events may describe a single result, a sequence of results, or a pattern such as two heads in a row. This simple setting is often used to introduce probability concepts.
7.2 Dice rolls
Dice provide a standard example of finite sample spaces with several possible outcomes. Events can be defined by exact values, ranges, or properties such as oddness or divisibility. Dice problems are widely used to illustrate counting methods and event combinations.
7.3 Card games
Card games offer richer event structures because outcomes can involve suit, rank, color, or hand composition. Events may describe drawing an ace, forming a pair, or obtaining a flush. These examples show how probability adapts to larger and more intricate sample spaces.
7.4 Statistics and random processes
In statistics, events describe observed data patterns and outcomes of sampling procedures. In random processes, they may refer to future states, arrivals, or transitions over time. Both areas rely on event-based reasoning to model uncertainty.
7.5 Risk analysis and modeling
Events are used to represent occurrences such as equipment failure, delay, or demand exceeding supply. Probability models built from events help estimate risk and compare alternative decisions. This use of events is common in engineering, finance, and planning.
</INTERNAL_LINK_CANDIDATES> Random experiment (a repeatable chance process) Sample space (the set of all possible outcomes) Outcome (a single result of an experiment) Simple event (an event containing one outcome) Compound event (an event containing multiple outcomes) Set notation (symbolic representation of sets and events) Complement (the outcomes not in a given event) Mutually exclusive events (events that cannot occur together) Exhaustive events (events whose combined outcomes cover the sample space) Union (the event that at least one of several events occurs) Intersection (the outcomes shared by events) Difference of sets (outcomes in one event but not another) De Morgan's laws (rules relating complements to unions and intersections) Equally likely outcomes (outcomes with the same chance) Classical probability (probability by counting favorable and total outcomes) Empirical probability (probability estimated from observed frequencies) Axiomatic probability (probability defined by formal axioms) Conditional probability (probability given that another event occurred) Independent events (events whose probabilities do not affect each other) Sigma-algebra (a collection of sets closed under probability operations)