# Probability/Mathematical Review

The review of set theory contained herein adopts a naive point of view. We assume that the meaning of a set as a collection of objects is intuitively clear. A rigorous analysis of the concept belongs to the foundations of mathematics and mathematical logic. Although we shall not initiate a study of these fields, the rules we follow in dealing with sets are derived from them. A set is a collection of objects, which are the elements of the set.

If an element x belongs to a set S, we express this fact by writing $x \in S$. If x does not belong to S, we write $x \notin S$. We use the equality symbol to denote logical identity. For instance, x = y means that x and y are symbols denoting the same object. Similarly, the equation S = T states that S and T are two symbols for the same set. In particular, the sets S and T contain precisely the same elements. If x and y are different objects then we write $x \neq y$. Also, we can express the fact that S and T are different sets by writing $S \neq T$.

A set S is a subset of T if every element of S is also contained in T. We express this relation by writing $S \subset T$. Note that this definition does not require S to be different from T. In fact, S = T if and only if $S \subset T$ and $T \subset S$. If $S \subset T$ and S is different from T, then S is a proper subset of T and we write $S \subsetneq T$.

There are many ways to specify a set. If the set contains only a few elements, one can simply list the objects in the set;

$S = \{ x_1, x_2, x_3 \} .$

The content of a set can also be enumerated whenever S has a countable number of elements,

$S = \{ x_1, x_2, \ldots \} .$

Usually, the way to specify a set is to take some collection S of objects and some property that elements of S may or may not possess, and to form the set consisting of all elements of S having that property. For example, starting with the integers $\mathbb{Z}$, we can form the subset of S consisting of all even numbers

$S = \{ x \in \mathbb{Z} | x \mbox{ is an even number} \}.$

More generally, we denote the set of all elements that have a certain property P by

$S = \{ x | x \mbox{ satisfies } P \} .$

The braces are to be read as the words "the set of" whereas the symbol | stands for the words "such that."

It is convenient to introduce two special sets. The empty set, denoted by $\emptyset$, is a set that contains no elements. The universal set is the collection of all objects of interest in a particular context, and it is denoted by $\Omega$. Once a universal set $\Omega$ is specified, we need only consider sets that are subsets of $\Omega$. In the context of probability, $\Omega$ is often called the sample space.

The complement of a set S, with respect to the universal set $\Omega$, is the collection of all objects in $\Omega$ that do not belong to S,

$S^c = \{ x \in \Omega | x \notin S \}.$

We note that $\Omega^c = \emptyset$.

## Elementary Set OperationsEdit

Probability theory makes extensive use of elementary set operations. Below, we review the ideas of set theory, and establish the basic terminology and notation. Consider two sets, S and T.

The union of sets S and T is the collection of all elements that belong to S or T (or both), and it is denoted by $S \cup T$. Formally, we define the union of these two sets by

$S \cup T = \{ x | x \in S \mbox{ or } x \in T \} .$

The intersection of sets S and T is the collection of all elements that belong to S and T. It is denoted by $S \cap T$, and it can be expressed mathematically as

$S \cap T = \{ x | x \in S \mbox{ and } x \in T \} .$

When S and T have no elements in common, we write $S \cap T = \emptyset$. We also express this fact by saying that S and T are disjoint. More generally, a collection of sets is said to be disjoint if no two sets have a common element. A collection of sets is said to form a partition of S if the sets in the collection are disjoint and their union is S.

The difference of two sets, denoted by S - T, is defined as the set consisting of those elements of S that are not in T,

$S - T = \{ x | x \in S \mbox{ and } x \notin T \} .$

This set is sometimes called the complement of T relative to S, or the complement of T in S.

We have already looked at the definition of the union and the intersection of two sets. We can also form the union or the intersection of arbitrarily many sets. This is defined in the obvious way,

$\bigcup_{\alpha \in I} S_{\alpha} = \{ x | x \in S_{\alpha} \mbox{ for some } \alpha \in I \}$

$\bigcap_{\alpha \in I} S_{\alpha} = \{ x | x \in S_{\alpha} \mbox{ for all } \alpha \in I \} .$

The index set I can be finite or even infinite.

## Rules of Set TheoryEdit

Given a collection of sets, it is possible to form new ones by applying elementary set operations to them. As in algebra, one uses parentheses to indicate precedence. For instance, $R \cup (S \cap T)$ denotes the union of two sets R and $S \cap T$, while $(R \cup S) \cap T$ represents the intersection of two sets $R \cup S$ and $T$. The sets thus formed are quite different.

Sometimes different combinations of operations lead to the same set. For instance, we have the two distributive laws

$R \cap (S \cup T) = (R \cap S) \cup (R \cap T)$

$R \cup (S \cap T) = (R \cup S) \cap (R \cup T).$

Two particularly useful equivalent combinations of operations are given by De Morgan's laws, which state that

$R - (S \cup T) = (R - S) \cap (R - T)$

$R - (S \cap T) = (R - S) \cup (R - T).$

These two laws can be generalized to

$\left( \bigcup_{\alpha \in I} S_{\alpha} \right)^c = \bigcap_{\alpha \in I} S_{\alpha}^c$

$\left( \bigcap_{\alpha \in I} S_{\alpha} \right)^c = \bigcup_{\alpha \in I} S_{\alpha}^c$

when multiple sets are involved. To establish the first equality, suppose that x belongs to $\left( \bigcup_{\alpha \in I} S_{\alpha} \right)^c$. Then x is not contained in $\bigcup_{\alpha \in I} S_{\alpha}$. That is, x is not an element of $S_{\alpha}$ for any $\alpha \in I$. This implies that x belongs to $S_{\alpha}^c$ for all $\alpha \in I$, and therefore $x \in \bigcap_{\alpha \in I} S_{\alpha}^c$. We have shown that $\left( \bigcup_{\alpha \in I} S_{\alpha} \right)^c \subset \bigcap_{\alpha \in I} S_{\alpha}^c$. The converse inclusion is obtained by reversing the above argument. The second law can be obtained in a similar fashion.

## Cartesian ProductsEdit

There is yet another way to create new sets form existing ones. It involves the notion of an ordered pair of objects. Given sets S and T, the cartesian product S x T is the set of all ordered pairs (x, y) for which x is an element of S and y is an element of T,

$S \times T = \{ (x, y) | x \in S \mbox{ and } y \in T \} .$

## Summary of Probability & Set TheoryEdit

• A = P(A) ∑[0, 1]
• NOT A = P(A') = 1 – P(A)
• A OR B = P(AUB) = P(A) + P(B) – P(A∩B) = P(A) + P(B) [*if and only if A and B are mutually exclusive]
• A AND B = P(A∩B) = P(A/B)*P(B) = P(A)*P(B) [* if and only if A and B are independent]
• A GIVEN B = P(A|B) = P(A∩b)/P(B) [*conditional]

Basic Set Theory

UNION: combined area of set A and B, known as AUB. The set of all items which are members of either A or B

• Union of A and B are added together
• Some basic properties of unions:
• AUB = BUA
• AU(BUC) = (AUB)UC
• A c (AUB)
• AUA = A
• AU0 = A, where 0 = null, empty set
• A c B, if and only if AUB = B

INTERSECTION: area where both A and B overlap, known as A∩B. It represents which members the two sets A and B have in common

• If A∩B = 0, then A and B are said to be DISJOINT.
• Some basic properties of intersections:
• A∩B = B∩A
• A∩(B∩C) = (A∩B)∩C
• A∩B cA
• A∩A = A
• A∩0 = 0
• A cB, if and only if A∩B = A
• UNIVERSAL SET: space of all things possible, which contains ALL of the elements or elementary events.
• U/A is called the absolute complement of A

Complement (set): 2 sets can be subtracted. The relative complement (set theoretic difference of B and A). Denoted by B/A (or B – A) is the set of all elements which are members of B, but not members of A

Some basic properties of complements (~A, or A'):

• AUA' = U
• A∩A' = 0
• (A')' = A
• A/A = 0
• U' = 0, and 0 = U
• A/B = 'A∩B'

Summary

• Intersection (A∩B) --> AND – both events occur together at the same time
• Union (AUB) --> OR – everything about both events, A and B
• Complement (~A) --> NOT A – everything else except A (or the event in question)
• AU~A = S (sample space)
• A∩~A = 0 (impossible event)

Union and Intersection are:

Commutative:

• AUB = BUA
• A∩B = B∩A

Associative:

• AU(BUC) = (AUB)UC
• A∩(B∩C) = (A∩B)∩C

Distributive:

• AU(B∩C) = (AUB)∩(AUC)
• A∩(BUC) = (A∩B)U(A∩C)