91Ó°ÊÓ

Probability measure is a fundamental concept in probability theory. It provides a way to measure the likelihood of different outcomes in a probabilistic system. It is defined on a probability space, which is comprised of three parts:

• Sample Space (\(\Omega\)
• Event Space (\(\mathcal{F}\)
• Probability Measure (\(P\)

A probability measure assigns probabilities to events, which are subsets of the sample space. These probabilities must satisfy certain properties:

• The probability of the entire sample space is 1 (\(P(\Omega) = 1\))
• The probability of any event is non-negative (\(P(A) \geq 0\)
• The probability of the union of mutually exclusive events is the sum of their individual probabilities (\(P(A \cup B) = P(A) + P(B)\) if A and B are disjoint)

In simple terms, a probability measure helps us understand and quantify uncertainty by providing a systematic way to assign probabilities to events.

In probability and statistics, a sub sigma-algebra refines our ability to consider partial information. Think of a sigma-algebra (\(\mathcal{F}\)) as a collection of all events that can be measured or observed within a probability space. It acts as a mathematical framework for including events based on certain rules. A sub sigma-algebra (\(\mathcal{G}\)) is a subset of this larger sigma-algebra, where it still adheres to the properties of a sigma-algebra:

• It contains the empty set (\(\emptyset\)) and the entire space (\(\Omega\))
• If an event is in \(\mathcal{G}\), its complement must also be in \(\mathcal{G}\)
• If a sequence of events is in \(\mathcal{G}\), the countable union of these events is in \(\mathcal{G}\)

In essence, a sub sigma-algebra allows us to look at less information or fewer events than the full sigma-algebra, giving us focus on a smaller set of events. This concept is especially useful in conditional expectation, where we wish to consider expectation with respect to limited information or certain subsets of the event space.

Random variables are a core notion in probability theory, representing quantities that can vary randomly. They map outcomes from a sample space (\(\Omega\)) to real numbers, providing a numerical representation of probabilities. There are two main types of random variables:

• Discrete Random Variables: These take on a countable number of distinct values. Think of rolling a die.
• Continuous Random Variables: These can assume any value over a continuous range. Consider the exact height of students in a class.

Random variables allow us to quantify and analyze random processes mathematically. They come paired with probability distributions, which give the probabilities of different outcomes.For example, the normal distribution is one such distribution that is particularly common with continuous random variables.

• The mean (\(\mu\)): Expected value of the distribution.
• The variance (\(\sigma^2\)
): Measure of how much the values are spread out.

Understanding random variables is crucial as they enable us to apply mathematical techniques to analyze random phenomena and make predictions about future outcomes.

Expectation, often denoted as \(E[\cdot]\), is the average or mean value of a random variable. It is a foundational concept in probability theory used for predicting the expected outcome of a random event.Here are some key properties of expectation:

• Linearity: \(E[aX + bY] = aE[X] + bE[Y]\)
, where a and b are constants and X, Y are random variables.
• Monotonicity: If \(X \leq Y\) then \(E[X] \leq E[Y]\)
.
• Non-negativity: If X is a non-negative random variable, \(E[X] \geq 0\)
  

Conditional expectation extends the idea of expectation by considering it with respect to a sub sigma-algebra (\(\mathcal{G}\)). It provides the average expected outcome given some known information, such as in a filtration process. Conditional expectation is especially useful in financial mathematics and statistics, providing insights into future expectations based on past data.