Skip to content

Continuous Random Variables: PDF, CDF, and Key Concepts Explained

Overview: Transitioning from Discrete to Continuous Random Variables

This video marks the start of a new section on continuous random variables. While many concepts (like expectation and variance) have parallels to discrete random variables, continuous variables introduce unique subtleties, particularly due to their uncountable nature. The speaker strongly recommends comparing and contrasting each new concept with its discrete counterpart. For a comprehensive look at the discrete side, see our Comprehensive Review of Discrete Probability Distributions and Expected Values.

Foundational Concepts: Sample Spaces and Sigma Algebras

  • Sample Space (Ω): For continuous random variables, the sample space must be continuous and uncountable (e.g., the height of a person, a time interval). This is a crucial difference from discrete cases where Ω is finite or countably infinite.
  • Sigma Algebra (F): When Ω is continuous, you cannot simply use the power set (all subsets) as your collection of events. Instead, you must use a sigma algebra – a specific subset of the power set that satisfies three key axioms:
    1. Ω itself must be in F.
    2. If a set A is in F, its complement (A^c) must also be in F.
    3. The countable union of sets in F must also be in F.
  • Probability Measure (P): This remains the same as before, a function from F to [0,1] with the standard Kolmogorov axioms (non-negativity, P(Ω)=1, and countable additivity for disjoint events).

Defining a Continuous Random Variable

A random variable is still a function X: Ω → R. The key difference is that for continuous variables, both the domain (Ω) and the range (the real numbers) are uncountably infinite. A discrete random variable, in contrast, has a countable range. For a refresher on core probability and statistical terminology like random variables, check out the Introduction to Probability and Statistics: Key Concepts and Terminology.

Example: Waiting for a Bus

  • Experiment: Waiting for a bus.
  • Source of Randomness: The time you arrive at the bus stop (e.g., uniformly between 7:10 and 7:30).
  • Random Variable (X): The amount of time you wait for the bus.
  • Key Insight: The probability of waiting for an exact time (e.g., exactly 4 minutes and 29 seconds) is zero. The meaningful probability is that the waiting time falls within an interval (e.g., between 4 and 5 minutes).

The Probability Density Function (PDF)

Since probabilities for exact values are zero (P(X = x) = 0), we cannot use a probability mass function (PMF). Instead, we use the probability density function (PDF), denoted as f_X(x).

  • Definition: It represents the probability of X being in a very small interval [x, x+dx] divided by the width (dx) of that interval. In essence, f_X(x) = P(x ≤ X ≤ x+dx) / dx.
  • Units: Unlike probability (which is unitless), the PDF has units (e.g., "per minute" for waiting time or "per meter" for height).
  • Properties:
    1. Non-Negative: f_X(x) ≥ 0 for all x.
    2. Total Area is 1: ∫_{-∞}^{∞} f_X(x) dx = 1. This is the continuous analog of ∑ P(X=x) = 1 for discrete variables.
    3. Not Bounded by 1: The value of the PDF can be greater than 1, unlike a probability.

The Cumulative Distribution Function (CDF)

The CDF, denoted as F_X(x), remains a fully meaningful and identical concept for continuous variables. F_X(x) = P(X ≤ x).

  • Relationship to PDF: The CDF is the integral of the PDF from negative infinity to x: F_X(x) = ∫_{-∞}^{x} f_X(t) dt.
  • Properties:
    1. F_X(-∞) = 0 and F_X(∞) = 1.
    2. It is a non-decreasing function (since P(X ≤ x1) ≤ P(X ≤ x2) when x1 ≤ x2).

Worked Examples

Example 1: Uniform Waiting Time

  • Scenario: Arrival time is uniform between 7:15 and 7:30. Bus arrives every 15 minutes.
  • Random Variable X: Waiting time, between 0 and 15 minutes.
  • PDF: The PDF is uniform (constant) over the interval [0, 15]. To find the constant, solve ∫015 c dx = 1, so c = 1/15 per minute.
  • CDF: F_X(x) = 0 for x < 0, x/15 for 0 ≤ x ≤ 15, and 1 for x > 15. The CDF increases linearly from 0 to 1.

Example 2: Linear Density Function

  • Scenario: PDF is f_X(x) = x/2 for x ∈ [0, 2] and 0 otherwise.
  • Validation: The area under f_X(x) is a triangle with base 2 and height 1, so the area (1/2 * 2 * 1) is 1. It is a valid PDF.
  • CDF: For 0 ≤ x ≤ 2, F_X(x) = ∫0x (t/2) dt = x2/4. As expected, F_X(0)=0 and F_X(2)=1.
  • Conclusion: A linear PDF results in a quadratic CDF, which is smooth and increasing. Tree diagrams are another great tool for visualizing probability; see Calculating Conditional Probabilities Using Tree Diagrams and Dice Rolls.

Keep this summary

Save it to LunaNotes and it becomes a real note in your library — editable, searchable, and ready to turn into flashcards or a diagram. Free to start.

Save to LunaNotes

Or summarise for another video.

This summary and transcript were automatically generated using AI with the Free YouTube Transcript Summary Tool by LunaNotes.

Related summaries

Comprehensive Review of Discrete Probability Distributions and Expected Values

Comprehensive Review of Discrete Probability Distributions and Expected Values

This video review explains discrete probability distributions, including how to calculate probabilities, expected values, and conditional probabilities using practical examples. It covers machine breakdown probabilities and dice game scoring to illustrate key concepts in probability theory.

Introduction to Probability and Statistics: Key Concepts and Terminology

Introduction to Probability and Statistics: Key Concepts and Terminology

In this video, Dr. Gajendra Purohit introduces the fundamentals of probability and statistics, covering essential terminology, types of events, and key concepts such as random experiments, sample space, and probability calculations. The session aims to provide a solid foundation for students preparing for advanced mathematics exams.

Introduction to Probability: Foundations for AI & Bayes' Nets

Introduction to Probability: Foundations for AI & Bayes' Nets

Learn the core concepts of probability theory essential for AI, including probability models, random variables, joint & conditional distributions, and Bayes' rule. This lecture explains why probabilistic reasoning is crucial for handling real-world uncertainty in machine learning and decision-making, with intuitive examples and games.

Probability & Statistics: The Ultimate Guide to Modeling Uncertainty (Course Intro)

Probability & Statistics: The Ultimate Guide to Modeling Uncertainty (Course Intro)

Professor Steve Brunton launches an exciting new short course on probability and statistics. This introductory overview explains why probability is a foundational tool for data science and machine learning, provides real-world examples from thermodynamics to weather, and outlines what you will learn in the first 10 hours dedicated to probability.

Partial Derivatives Explained: The Intuitive Connection to Ordinary Derivatives

Partial Derivatives Explained: The Intuitive Connection to Ordinary Derivatives

This video demystifies partial derivatives by revealing their deep connection to ordinary derivatives. Using the function f(x,y) = x²y + sin(y) as an example, you'll learn how to compute a partial derivative by treating one variable as constant, and understand the geometric intuition of a

Found this summary useful?

Take it with you. One click puts it in your own LunaNotes library.

Save to LunaNotes

Start taking better notes today with LunaNotes