Axiomatic Approach to Probability
Last Updated :
20 Jun, 2025
Hearing the word "probability" brings up ideas related to uncertainty or randomness. Although the concept of probability can be hard to describe formally, it helps us analyze how likely it is that a certain event will happen. This analysis helps us understand and describe many phenomena we see in real life. Even seemingly random processes can be explained and predicted using probability models. That's why probability forms the foundation for many artificial intelligence algorithms we use today. Before diving into the formal laws of probability, let's look at some basic terminology.
Events and Sample Space
In probability, we conduct experiments. These experiments are random, which means we cannot predict the outcomes of the same. All these outcomes constitute the sample space. Let us consider the experiment of tossing a coin two times. This experiment has four possible outcomes:
Sample space = { HH , TT , HT , T H }
- Random Experiment: A random experiment is an experiment in which outcomes are random and thus cannot be predicted with certainty.
- Sample Space: Sample space is the set of all possible outcomes associated with a random experiment. It is denoted using the symbol S.
- Event: An event is the set of outcomes from the total possible number of outcomes; thus, it is also called a subset of the sample space.
Let's measure the probability of getting two heads in the above experiment. Then the probability of this outcome is defined as,
P = \dfrac{\text{Number of favourable Outcomes}}{\text{Total number of possible outcomes}}
For this case, a favorable outcome is HH, and the total number of possible outcomes is four.
So, the event can be defined as getting two heads: Probability(Getting two heads) = \frac{1}{4}
Different Probability Approaches
The previous formula for calculating the probabilities assumes that all the outcomes are equally likely. For example, in the tossing of a fair coin. The outcomes head and tails are equally likely. So this cannot be generalized to every experiment. Initially, there were two schools of thought in probability:
- Classical Probability
- Frequentist Probability
Classical Probability
This approach assumes that all the outcomes are equally likely. If our event can happen in “n” ways out of a total of “N” ways. Then the probability can be given by,
P(event) = \frac{n}{N}
Frequentist Probability
This is a more general approach to calculating the probability. It does not make the assumption that all the outcomes are equally likely. When outcomes are not equally likely, we repeat the experiment many times, let's say M. Then, observe how many times that particular event occurred, let' say m. Then, calculate the empirical estimate of the probability. So, use the relation,
P(event) =\lim_{M \to \infty} \frac{m}{M}
Both of these approaches fail to generalize well and stand up to mathematical rigor.
The axiomatic approach to probability takes the approach of considering probability as a function associated with any event.
Axiomatic Approach
Perform a random experiment whose sample space is S, and P is the probability of the occurrence of any random event. This model assumes that P should be a real-valued function with a range between 0 and 1. The domain of this function is defined to be the power set of the sample space. If all these conditions are satisfied, then the function should satisfy the following axioms:
Axiom 1: For any given event X, the probability of that event must be greater than or equal to 0. Thus,
0 ≤ P(X)
Axiom 2: We know that the sample space S of the experiment is the set of all the outcomes. This means that the probability of any one outcome happening is 100 percent i.e P(S) = 1. Intuitively this means that whenever this experiment is performed, the probability of getting some outcome is 100 percent.
P(S) = 1
Axiom 3: For the experiments where we have two outcomes A and B. If A and B are mutually exclusive,
P(A ∪ B) = P(A) + P(B) and P(A ∩ B) = 0
Here, ∪ stands for union, ∩ stands for the intersection of two sets. This can be understood as if saying, “If A and B are mutually exclusive outcomes, the probability that either one of these events will happen is the probability of A happening plus the probability of B happening”.
These axioms are also called Kolmogorov's three axioms. The third axiom can also be extended to several outcomes, given that all are mutually exclusive.
Let's say the experiment has A1, A2, A3, and ... An. All these events are mutually exclusive. In this case, the three axioms become:
Axiom 1: 0 ≤ P(Ai) ≤ 1 for all i = 1,2,3,... n.
Axiom 2: P(A1) + P(A2) + P(A3) +.... = 1
Axiom 3: P(A1 ∪ A2∪ A3 ....) = P(A1) + P(A2) + P(A3) ....
Let's look at some sample problems based on these concepts.
Sample Problems on Axiomatic Approach to Probability
Question 1: Find out the sample space “S” for a random experiment involving the tossing of three coins.
Solution.
We know that tossing a coin gives us either Heads or Tails. Tossing three coins will give us either triplets of either heads or tails. So, the possible outcomes can be,
HHH, HHT, HTH, HTT, ....
All these outcomes will constitute the sample space.
S = {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT}
Question 2: Find out the probability of getting a number 3 when a die is tossed.
Answer:
We know that possible outcomes when a die is tossed are,
{1, 2, 3, 4, 5 and 6}
We want to calculate the probability for getting a number 3.
Number of favorable outcomes = 1
Total Number of outcomes = 6.
So, the probability of getting a number 3, P(3) = \frac{\text{Number of favourable Outcomes}}{\text{Total number of possible outcomes}}
P(3) =\frac{1}{6}
Question 3: Let's say a class is choosing their class captain through a random draw. The class has 30% Indian students, 50% American students, and 20% Chinese students. Calculate the probability that the chosen captain will be an Indian.
Answer:
Let's define an event A: Chosen captain is Indian. We know that there are only 30% Indian students in class.
Measure of favorable outcome = 0.3
Total Number of outcomes = 1
So, P(A) = \frac{\text{Number of favourable Outcomes}}{\text{Total number of possible outcomes}}
P(A) =\frac{0.3}{1}
P(A) = 0.3
So, there is a 30% probability that an Indian student will be chosen as class captain.
Question 4: Find out the probability of getting an even number when a die is tossed.
Answer:
We know that possible outcomes when a die is tossed are,
{1, 2, 3, 4, 5 and 6}
We want to calculate the probability for getting an even number. Even number are {2,4,6}
Number of favorable outcomes = 3
Total Number of outcomes = 6.
So, the probability of getting an even number, P(Even) = \frac{\text{Number of favourable Outcomes}}{\text{Total number of possible outcomes}}
P(Even) =\frac{3}{6}
⇒ P(Even) = \frac{1}{2}
Question 5: Let's say we have an urn with 5 red balls and 3 black balls. We want to draw balls from this bag. Find out the probability of picking a red ball.
Answer:
Let's define the experiment as “Drawing a ball from the bag”. Now it is required to calculate the probability for getting a red ball.
Number of favorable outcomes = 5
Total Number of outcomes = 8.
So, P(red) = \frac{5}{8}
Question 6: For the above experiment, verify that the probability of getting a red ball and the probability of getting a black ball follow the axioms of probability mentioned above.
Answer:
Let's define two events,
R = Red ball is picked
B = Black Ball is picked
Calculate the probability for getting a red ball in the previous example,
P(R) = \frac{5}{8}
Similarly,
P(B) = \frac{3}{8}
Now notice that both P(R) and P(B) lie between 0 and 1. So they satisfy axiom 1. Let's verify it for second axiom.
P(R) + P(B)
⇒P(R) + P(B) =\frac{5}{8} + \frac{3}{8}
⇒ P(R) + P(B) = 1
Thus second axiom is also satisfied.
We know that both of these events are mutually exclusive.
So, P(R ∪ B) = P(Getting either a Red Ball or Black Ball)
⇒ P(R ∪ B) = P(R) + P(B)
⇒ P(R ∪ B) =\frac{5}{8} + \frac{3}{8}
⇒ P(R ∪ B) = 1
Thus, all three of these axioms are satisfied. Thus, above experiment follows the axioms of the probability.
Practice Problems on Axiomatic Approach to Probability
Question 1: For two events A and B, find the probability that exactly one of the two events occurs.
Question 2: A box contains 3 red and 4 blue socks. Find the probability of choosing two socks of the same colour.
Question 3: Alice has five toys, which are identical, and one of them is underweight. Her sister, Sesa, chooses one of these toys at random. Find the probability for Sesa to choose an underweight toy?
Question 4: Aliya selects three cards at random from a pack of 52 cards. Find the probability of drawing:
- 3 spade cards.
- One spade and two knave cards
- one spade, one knave, and one heart card.
Question 5: For three events A, B, and C, show that
- P (at least two of A, B, C occur) = P(A∩B) + P(B∩C) + P(C∩A) − 2P(A∩B∩C)
- P (exactly two of A, B, C occur) = P(A∩B) + P(B∩C) + P(C∩A) − 3P(A∩B∩C)
- P (exactly one of A, B, C occurs) = P(A) + P(B) + P(C) − 2P(A∩B) − 2P(B∩C) − 2P(C∩A) + 3P(A∩B∩C)
Question 6: In a bag of 10 balls, 4 are blue and 6 are green. What is the probability of drawing a green ball?
Question 7: A deck of cards contains 52 cards, 26 of which are red and 26 are black. What is the probability of drawing a red card?
Question 8: In a group of 50 students, 30 students like basketball, 20 like football, and 10 like both basketball and football. What is the probability that a randomly selected student likes either basketball or football (or both)?
➣ Related Articles:
Conclusion
The axiomatic approach to probability, introduced by Andrey Kolmogorov, provides a robust and formal framework for understanding and analyzing random events. By defining probability through a set of fundamental axioms—non-negativity, normalization, and additivity—this approach ensures consistency and clarity in the study of probability. These axioms allow for the development of various probability properties and theorems, making the axiomatic approach a cornerstone of modern probability theory. It has wide applications in fields ranging from mathematics and statistics to physics, engineering, and artificial intelligence, helping to model and predict outcomes in uncertain situations.
Similar Reads
Discrete Mathematics Tutorial Discrete Mathematics is a branch of mathematics that is concerned with "discrete" mathematical structures instead of "continuous". Discrete mathematical structures include objects with distinct values like graphs, integers, logic-based statements, etc. In this tutorial, we have covered all the topic
3 min read
Mathematical Logic
Propositional LogicLogic is the basis of all mathematical reasoning and all automated reasoning. The rules of logic specify the meaning of mathematical statements. These rules help us understand and reason with statements such as -\exists~x~such~that~x~\neq~a^2~+~b^2,~where~\:x,~a,~b\in~ZWhich in Simple English means
10 min read
Discrete Mathematics - Applications of Propositional LogicA proposition is an assertion, statement, or declarative sentence that can either be true or false but not both. For example, the sentence "Ram went to school." can either be true or false, but the case of both happening is not possible. So we can say, the sentence "Ram went to school." is a proposi
11 min read
Propositional EquivalencesPropositional equivalences are fundamental concepts in logic that allow us to simplify and manipulate logical statements. Understanding these equivalences is crucial in computer science, engineering, and mathematics, as they are used to design circuits, optimize algorithms, and prove theorems. This
7 min read
Predicates and QuantifiersPredicates and Quantifiers are fundamental concepts in mathematical logic, essential for expressing statements and reasoning about the properties of objects within a domain. These concepts are widely used in computer science, engineering, and mathematics to formulate precise and logical statements.
6 min read
Mathematics | Some Theorems on Nested QuantifiersQuantifiers are expressions that indicate the scope of the term to which they are attached, they are predicates. A predicate is a property the subject of the statement can have. For example, in the statement "the sum of x and y is greater than 5", the predicate 'Q' is- sum is greater than 5, and the
6 min read
Rules of InferenceRules of Inference: Rules of inference are logical tools used to derive conclusions from premises. They form the foundation of logical reasoning, allowing us to build arguments, prove theorems, and solve problems in mathematics, computer science, and philosophy. Understanding these rules is crucial
9 min read
Mathematics | Introduction to ProofsMathematical proof is an argument we give logically to validate a mathematical statement. To validate a statement, we consider two things: A statement and Logical operators. A statement is either true or false but not both. Logical operators are AND, OR, NOT, If then, and If and only if. Coupled wit
7 min read
Sets and Relations
Set TheorySet theory is a branch of mathematics that deals with collections of objects, called sets. A set is simply a collection of distinct elements, such as numbers, letters, or even everyday objects, that share a common property or rule.Example of SetsSome examples of sets include:A set of fruits: {apple,
3 min read
Types Of SetsIn mathematics, a set is defined as a well-defined collection of distinct elements that share a common property. These elementsâ like numbers, letters, or even other sets are listed in curly brackets "{ }" and represented by capital letters. For example, a set can include days of the week. The diffe
13 min read
Irreflexive Relation on a SetA relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. To learn more about relations refer to the article on "Relation and their types". What is Irreflexive Relation? A relation R on a set A is called irre
6 min read
Check Reflexive Relation on SetA relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. To learn more about relations refer to the article on "Relation and their types".What is a Reflexive Relation?A relation R on a set A is called reflex
7 min read
Check Transitive Relation on a SetA relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. To learn more about relations refer to the article on "Relation and their types".What is a Transitive Relation?A relation R on a set A is called trans
9 min read
Set OperationsA set is simply a collection of distinct objects. These objects can be numbers, letters, or even peopleâanything! We denote a set using curly brackets.For example: A = {1, 2, 3}Set Operations can be defined as the operations performed on two or more sets to obtain a single set containing a combinati
10 min read
Types of FunctionsFunctions are defined as the relations which give a particular output for a particular input value. A function has a domain and codomain (range). f(x) usually denotes a function where x is the input of the function. In general, a function is written as y = f(x).A function is a relation between two s
15 min read
Mathematics | Sequence, Series and SummationsSequences, series, and summations are fundamental concepts of mathematical analysis and it has practical applications in science, engineering, and finance.Table of ContentWhat is Sequence?Theorems on SequencesProperties of SequencesWhat is Series?Properties of SeriesTheorems on SeriesSummation Defin
8 min read
Representation of Relation in Graphs and MatricesUnderstanding how to represent relations in graphs and matrices is fundamental in engineering mathematics. These representations are not only crucial for theoretical understanding but also have significant practical applications in various fields of engineering, computer science, and data analysis.
8 min read
Relations in MathematicsRelation in Mathematics is defined as the relationship between two sets. If we are given two sets set A and set B and set A has a relation with set B then each value of set A is related to a value of set B through some unique relation. Here, set A is called the domain of the relation, and set B is c
9 min read
Closure of RelationsClosure of Relations: In mathematics, especially in the context of set theory and algebra, the closure of relations is a crucial concept. It involves extending a given relation to include additional elements based on specific properties, such as reflexivity, symmetry, and transitivity. Understanding
6 min read
Mathematical Induction
Boolean Algebra
Ordered Sets & Lattices
Probability Theory
Graph Theory
Graph and its representationsA Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any two nodes in the graph. More formally a Graph is composed of a set of vertices( V ) and a set of edges( E ). The graph is den
12 min read
Mathematics | Graph Theory Basics - Set 1A Graph is just a way to show connections between things. It is set of edges and vertices where each edge is associated with unordered pair of vertices. Graph is a data structure that is defined by two components :Node or Vertex: It is a point or joint between two lines like people, cities, or websi
5 min read
Types of Graphs with ExamplesA graph is a mathematical structure that represents relationships between objects by connecting a set of points. It is used to establish a pairwise relationship between elements in a given set. graphs are widely used in discrete mathematics, computer science, and network theory to represent relation
9 min read
Walks, Trails, Paths, Cycles and Circuits in GraphWalks, trails, paths, cycles, and circuits in a graph are sequences of vertices and edges with different properties. Some allow repetition of vertices and edges, while others do not. In this article, we will explore these concepts with examples.What is Walk?A walk in a graph is a sequence of vertice
6 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to allGiven a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read
Primâs Algorithm for Minimum Spanning Tree (MST)Primâs algorithm is a Greedy algorithm like Kruskal's algorithm. This algorithm always starts with a single node and moves through several adjacent nodes, in order to explore all of the connected edges along the way.The algorithm starts with an empty spanning tree. The idea is to maintain two sets o
15+ min read
Kruskalâs Minimum Spanning Tree (MST) AlgorithmA minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, and undirected graph is a spanning tree (no cycles and connects all vertices) that has minimum weight. The weight of a spanning tree is the sum of all edges in the tree. In Kruskal's algorithm, we sort all edges
9 min read
Check whether a given graph is Bipartite or notGiven a graph with V vertices numbered from 0 to V-1 and a list of edges, determine whether the graph is bipartite or not.Note: A bipartite graph is a type of graph where the set of vertices can be divided into two disjoint sets, say U and V, such that every edge connects a vertex in U to a vertex i
8 min read
Eulerian path and circuit for undirected graphGiven an undirected connected graph with v nodes, and e edges, with adjacency list adj. We need to write a function that returns 2 if the graph contains an eulerian circuit or cycle, else if the graph contains an eulerian path, returns 1, otherwise, returns 0.A graph is said to be Eulerian if it con
9 min read
Special Graph
Group Theory
Mathematics | Graph Theory Basics - Set 1A Graph is just a way to show connections between things. It is set of edges and vertices where each edge is associated with unordered pair of vertices. Graph is a data structure that is defined by two components :Node or Vertex: It is a point or joint between two lines like people, cities, or websi
5 min read
Homomorphism & Isomorphism of GroupWe can say that  "o" is the binary operation on set G if: G is a non-empty set & G * G = { (a,b) : a , bâ G } and o : G * G --> G. Here, aob denotes the image of ordered pair (a,b) under the function/operation o.Example - "+" is called a binary operation on G (any non-empty set ) if & onl
7 min read
Group Isomorphisms and AutomorphismsIn the study of algebraic structures, group isomorphisms and automorphisms play a fundamental role. By defining internal symmetries inside a group (automorphisms) and when two groups have the same structure (isomorphisms), these ideas aid in our understanding of the structure and symmetry of groups.
7 min read
Group in Maths: Group TheoryGroup theory is one of the most important branches of abstract algebra which is concerned with the concept of the group. A group consists of a set equipped with a binary operation that satisfies four key properties: specifically, it includes property of closure, associativity, the existence of an id
13 min read