An event is a measurable set in a probability space: a question with a yes-or-no answer for each outcome. On Ω={1,…,6}2, the event that the sum is at least nine consists of ten ordered pairs. Its probability is therefore 10/36=5/18 under independent uniform dice. Saying that an event occurred means the actual outcome belongs to that set.
For events An in a probability space, the infinitely-often event isIts complement of an event is ⋃m≥1⋂n≥mAnc: after some outcome-dependent index, no more events occur.[ref]
limsupn→∞An=⋂m=1∞⋃n=m∞An={ω:for every m there is n≥m with ω∈An}.
Probability: Theory and Examples (fifth edition) by Rick Durrett. §2.3 opening definition and infinitely-often notation, printed pp. 67–68
Deleting finitely many events leaves the limsup of events unchanged. It is therefore a tail event of the sequence of indicator random variables 1An, whether or not those random variables are independent. For independent events, the Kolmogorov zero-one law restricts its probability to zero or one; the Borel-Cantelli lemmas determine which alternative holds from the series of probabilities. Also 1An→0 precisely when only finitely many events occur, connecting the First Borel-Cantelli lemma to almost sure convergence and the existing complete convergence criterion.
Let (an) be a nondecreasing real sequence tending to +∞, and let (xn) be any real sequence. The running maximum exceeds an infinitely often exactly when xn>an infinitely often. Applying this pathwise to random variables gives the displayed event equality, without any independence assumption.
One implication follows from xn≤maxk≤nxk. For the other, if xn≤an from some N onwards, every later value with N≤k≤n satisfies xk≤ak≤an. The finite prefix also lies below an for all sufficiently large n, because an→∞. Therefore the entire running maximum eventually stays below the threshold.
Divergence of the thresholds prevents one large early observation from creating infinitely many crossings. Monotonicity ensures that a later running-maximum crossing is controlled by the corresponding earlier individual threshold. These two conditions explain why the resulting event belongs to the tail sigma-algebra when the thresholds are deterministic.
For any sequence of events, its limsup of events satisfiesSet CN=⋃n≥NAn. These are decreasing events with intersection limsupnAn. Continuity of probability from above givesThis is also the bounded-indicator form of the reversed Fatou lemma. The inequality can be strict: independent fair-coin head events each have probability 1/2, while their limsup of events has probability 1 by the Second Borel-Cantelli lemma.
P(limsupnAn)≥limsupnP(An).
P(limsupnAn)=limNP(CN)≥limNsupn≥NP(An).
The complement of an event A is Ac=Ω∖A: it occurs exactly when A does not. Since A and Ac are disjoint events with union Ω, finite additivity gives P(Ac)=1−P(A). For a die roll, the complement of an even result is an odd result. Under conditioning on an event B with positive probability, the same rule is P(Ac∣B)=1−P(A∣B); the complement is still relative to the original sample space.
Two events are disjoint when they cannot both occur. For a finite family of pairwise disjoint events, the probability of their union is the sum of their probabilities, so that sum is at most one. This condition differs from the condition defining independent events.
Ancestors (6)
Incoming links (296)
- Almost sure equality
- Almost-sure limit of independent random variables is constant
- A shared coin prevents a zero-one conclusion
- Bayes' theorem
- Before-after control-impact design
- Bernoulli-Laplace diffusion model
- Bernoulli thinning
- Bond percolation
- Boolean operations on events
- Boole's inequality
- Borel-Cantelli first lemma
- Borel-Cantelli lemmas
- Borel-Cantelli second lemma
- Bounded-increment martingale convergence-or-oscillation dichotomy
- Bufferless queue output
- Càdlàg modification
- Càdlàg versions are indistinguishable
- Cantelli inequality
- Chain rule for probabilities
- Collision probability of two independent categorical draws
- Compensator of a counting process
- Complement of an event
- Complement rule of probability
- Conditional Borel-Cantelli lemma
- Conditional concentration at a large-deviation threshold
- Conditional distribution
- Conditional expectation
- Conditional probability
- Conditioning on a sum can create dependence
- Confidence interval for an inverse rate
- Constant random variable
- Contiguity of probability measures
- Continuity correction
- Continuity of probability
- Continuous modification
- Convergence in probability implies convergence in distribution
- Countable sets have zero probability under a density
- Counting process
- Counting-process intensity
- Counting-process intensity in survival analysis
- Coupling characterization of total variation distance
- Cyclic imitation chain
- Cylinder sigma-algebra
- Decreasing event
- Delta method for Bernoulli odds
- De Morgan's laws
- Diffusion approximation of a birth-death process
- Discounted gambler's ruin hitting probability
- Discrete mathematics, probability and continuous mathematics examination paper by the University of Oxford (2013)
- Discrete random variable
- Discrete uniform distribution
- Disjoint events
- Distribution functions of independent minima and maxima
- Dvoretzky-Kiefer-Wolfowitz inequality
- Dyadic conditional averages recover integrable functions
- Elementary outcome
- Empirical distribution process
- Empirical likelihood with mixed censoring
- Entropy functional
- Equality in Boole's inequality
- Equilibrium delay of an Erlang renewal process
- Event
- Events determined by a random variable
- Exceedance equivalence for increasing thresholds
- Expected value of a capped nonnegative random variable
- Extreme value theory
- Failure probabilities for two independent lifetimes
- Failure-probability budget
- Finite-prefix invariance of tail events
- First ascent in independent continuous observations
- Fixed-level versus simultaneous Brownian passage-time equality
- FKG inequality
- Fractional-power offspring generating function
- Fréchet inequalities
- Galton-Watson extinction fixed point
- Gamma distribution
- Geometric count under Bernoulli thinning
- Geometric distribution
- Geometric success deadline
- Geometric tail bound from a uniform escape probability
- Group sequential design
- Half-normal distribution
- Hoeffding confidence interval
- Hoeffding sample size for Bernoulli frequencies
- Immigration fraction among upward steps
- Inclusion-exclusion principle for probabilities
- Independence extended from generating pi-systems
- Independent events
- Independent permissive gates in an ion channel
- Independent random variables
- Independent transversal
- Indicator random variable
- Infinitely many heads as a tail event
- Invariant sigma-algebra of an exchangeable sequence
- Irreducibility and recurrence pass between a CTMC and its jump chain
- Kolmogorov axioms
- Kolmogorov's zero–one law
- Large deviations of a scaled geometric random variable
- Last-exit decomposition for a transient random walk
- Law of total expectation
- Law of total probability
- Lévy maximal inequality
- Limsup of events
- Linearity of expectation
- Local lemma Ramsey lower bound
- Logarithmic probabilities of open sets for a continuous rate function
- Lower-tail concentration for a weakly self-bounding function
- Markov chain return bridge
- Martingale compound Poisson process
- Maximum-likelihood fitted probability
- Maximum occupation is not a hitting probability
- Measure space
- Memorylessness of the geometric distribution
- Moderate deviation scales of a clipped Poisson aggregate
- Modification of a stochastic process
- Moment equations of a linear birth-death process
- Monotonicity bound for a mixed-censoring likelihood
- Mutation count on a neutral coalescent tree
- Negative binomial stopping argument
- Odds
- Ordered-state visit times in a reversible chain
- Origin in a triangle of three radial random points
- Overlap in the union bound
- Overlapping moving sum need not be Markov
- Pairwise independence does not imply joint independence
- Pairwise independent events
- Pairwise independent random variables
- Parity construction of pairwise independent bits
- Partition of a sample space
- Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2011 / B / 4 / a / Solution
- Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2011 / B / 5 / a / Solution
- Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2011 / B / 5 / b / Solution
- Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2011 / B / 5 / c / Solution
- Past exam of the martingales and financial mathematics course of the University of Oxford / 2009 / A / 1 / b / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2001 / ia / Paper 4 / 6E / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / ia / Paper 2 / 12F / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / ia / Paper 2 / 3F / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / ia / Paper 2 / 9F / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / ia / Paper 2 / 9F / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 29 / 1 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 32 / 1 / a / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 32 / 1 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / ia / Paper 2 / 10F / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / ia / Paper 2 / 12F / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 11 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 11 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 11 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 11 / 5 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 2 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 2 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 3 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 4 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 4 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 5 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 34 / 6 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 109 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 2 / a / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 4 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 4 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 5 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 6 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 6 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 201 / 6 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 201 / 3 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 201 / 4 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 201 / 4 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 201 / 5 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 201 / 5 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 202 / 5 / a / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 201 / 1 / a / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics III / 4 / a / i / Solution
- Past exam of the mathematics course of the University of Oxford / 2017 / Prelims / Mathematics III / 5 / a / ii / Solution
- Past exam of the mathematics course of the University of Oxford / 2017 / Prelims / Mathematics III / 5 / a / i / Solution
- Past exam of the mathematics course of the University of Oxford / 2023 / Prelims / Mathematics III / 4 / a / iii / Solution
- Past exam of the mathematics course of the University of Oxford / 2023 / Prelims / Mathematics III / 6 / a / iii / Solution
- Past exam of the mathematics course of the University of Oxford / Undated / Prelims / Mathematics III resit / 4 / b / iv / Solution
- Past exam of the mathematics course of the University of Oxford / Undated / Prelims / Mathematics III resit / 5 / c / iii / Solution
- Past exam of the mathematics course of the University of Oxford / Undated / Prelims / Mathematics III resit / 6 / b / Solution
- Past exam of the mathematics course of the University of Oxford / Undated / Prelims / Mathematics III resit / 7 / b / iv / Solution
- Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge / 2007 / Paper 2 / Section B / 3 / a / Solution
- Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge / 2012 / Paper 2 / 7 / Solution
- Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge / 2025 / Paper 2 / 10 / b / Solution
- Past exam of the MSc in advanced computer science course of the University of Oxford / 2021 / Bayesian statistical probabilistic programming / 3 / b / Solution
- Past exam of the physics 1 paper of the University of Oxford / 2022 / 7 / b / Solution
- Past exam of the probability course of the University of Oxford / 2014 / 1 / a / iii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 1 / b / ii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 1 / b / i / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 2 / b / iii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 2 / b / ii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 2 / b / i / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 2 / b / iv / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 2 / c / ii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2021 / 3 / b / ii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2023 / 1 / b / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2023 / 1 / d / iii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2023 / 1 / d / ii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2023 / 2 / c / iii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2023 / 3 / a / iii / Solution
- Past exam of the probability, measure and martingales course of the University of Oxford / 2023 / 3 / a / i / Solution
- Past exam of the statistics course of the University of Oxford / 2017 / 1 / a / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 5 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 5 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 5 / b / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 7 / b / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 8 / c / v / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 9 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Discrete mathematics, continuous mathematics and probability / 7 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability / 7 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability / 7 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability (resit) / 7 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability (resit) / 7 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Discrete mathematics, continuous mathematics and probability / 8 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 8 / a / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 8 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 8 / c / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 8 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 9 / b / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 9 / b / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 9 / b / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 7 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 7 / b / iv / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 7 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 8 / a / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 9 / b / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 9 / b / iv / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics and probability resit / 7 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics and probability resit / 7 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics and probability resit / 8 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Discrete mathematics, probability and continuous mathematics / 7 / a / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Discrete mathematics, probability and continuous mathematics / 8 / a / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Discrete mathematics, probability and continuous mathematics / 9 / a / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Discrete mathematics, probability and continuous mathematics / 9 / b / iii / Solution
- Percolation critical probability
- Percolation probability
- Percolation theory
- Permanent as probability of distinct independent choices
- Pi-lambda theorem
- Pinsker's inequality
- Poisson time-change representation of a Markov chain
- Positive association of two events
- Positive difference of independent exponential waiting times
- Power of a two-sample rare-event comparison
- Predictable compensator of a jump measure
- Probability
- Probability inequality
- Probability mass function
- Probability measure
- Probability model
- Probability space
- Probability theory
- Queue (queueing theory)
- Random variable
- Rare-event collaboration size at half power
- Relative risk from group compositions
- Renewal process
- Residual service time
- Reverse Fatou inequality for events
- Robert Kass
- Sample quantile
- Sample space
- Second-moment bound for positivity
- Serial reaction dwell-time density
- Shared-uniform counterexample to the second Borel-Cantelli lemma
- Sigma-algebra of a finite-valued random vector
- Simultaneous empirical distribution confidence band
- Square of a standard Laplace variable
- Standardization of a normal random variable
- Stationary jump traffic at a single contact
- Stochasticity
- Success-count and waiting-time duality
- Success-failure stopping identity
- Summable and harmonic event probabilities
- Tail event
- Tail measurability of limits of sample averages
- Tail probability
- Tail sigma-algebra
- Tail-sum formula
- Talagrand concentration inequality for certifiable functions
- Telegraph process
- Threshold stopping of an independent Gaussian series
- Tie probability for independent binomial counts
- Total variation distance
- Total variation distance and hypothesis testing
- Total variation distance on a finite set
- Total variation distance under a measurable map
- Transition-completion time in a Markov chain
- Truncated distribution
- Two-toss sample space
- Uniform convergence on compacts in probability under an absolutely continuous measure change
- Uniform integrability of conditional expectations
- Usual conditions for a filtration
- Waiting-time distribution
- Wald's equation
- Zero-event binomial upper confidence bound
- Zero-truncated claim-count distribution
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.