Summary of "STA301 Lecture 23 Short Lecture|Vu short lecture|Statistics and Probability in Urdu|Hindi Lecture 23"

STA301 — Lecture 23 (Urdu/Hindi) — Summary

The distribution function (cumulative distribution function), usually denoted by F, is defined for a random variable X by:

F(x) = P(X ≤ x)
For the discrete case, F(x) is constructed by summing the probabilities (relative frequencies) of all outcomes ≤ x.
Basic properties:
- F is non-decreasing.
- F(−∞) = 0 and F(+∞) = 1.
- Impossible events have probability 0; certain events have probability 1.

For n independent fair coin tosses, the sample space size = 2^n.
- Examples: 2 tosses → 4 outcomes; 3 tosses → 8 outcomes; 5 tosses → 32 outcomes.
For 3 tosses the sample space (sequences) is:
- HHH, HHT, HTH, THH, HTT, THT, TTH, TTT
Define X = number of heads. Possible values: 0, 1, 2, 3.
- Frequencies (counts): f(0)=1, f(1)=3, f(2)=3, f(3)=1
- Probabilities (divide by total 8): P(X=0)=1/8, P(X=1)=3/8, P(X=2)=3/8, P(X=3)=1/8
- CDF (cumulative sums): F(0)=1/8, F(1)=4/8, F(2)=7/8, F(3)=1

Frequency = raw count of outcomes giving a particular value.
Probability (relative frequency) = frequency divided by total sample size.
The CDF is built from probabilities (cumulative relative frequencies), not raw counts.

Example setup: a lot contains 80 good items and 5 defective items; draw a sample of 3 without replacement.
Let X = number of defective items in the sample. Possible x values are 0, 1, 2, 3 (as allowed by available defectives).
Use combinations to count outcomes. Total possible samples = C(85, 3).
- P(X = 0) = C(80, 3) / C(85, 3)
- P(X = 1) = [C(80, 2) * C(5, 1)] / C(85, 3)
- P(X = 2) = [C(80, 1) * C(5, 2)] / C(85, 3)
- P(X = 3) = C(5, 3) / C(85, 3)
After computing these probabilities (the PMF), build the CDF by cumulative addition:
- F(0) = P(X ≤ 0) = P(0)
- F(1) = P(X ≤ 1) = P(0) + P(1)
- etc.

Discrete expectation:
- E[X] = Σ_x x · P(X = x)
Linearity of expectation:
- E[aX + b] = a·E[X] + b
Population variance (discrete):
- Var(X) = E[(X − μ)^2] = E[X^2] − (E[X])^2
Continuous random variables:
- Expectations and variances use integrals: E[X] = ∫ x f(x) dx (over the support)
- Continuous examples (e.g., Beta distribution) are covered later.

Building the sample space for repeated binary trials (coin tosses)
- For n tosses, either list all outcomes or use the count 2^n.
- If needed, explicitly list sequences (e.g., for n=3: HHH, HHT, HTH, THH, HTT, THT, TTH, TTT).
Defining the random variable and computing the PMF (discrete)
- Define X (for example, number of heads).
- Count number of outcomes that give each possible X value: f(x).
- Compute P(X = x) = f(x) / total outcomes.
- Verify probabilities sum to 1.
Constructing the CDF (discrete)
- For each x in increasing order compute F(x) = Σ_{t ≤ x} P(X = t).
- Tabulate x, P(X=x) (PMF), and F(x) (CDF) for clarity.
Using combinations for sampling without replacement (hypergeometric)
- When selecting k items from N with K successes (defectives) and N−K failures:
  - Total samples = C(N, k).
  - Favorable count for exactly x successes = C(K, x) · C(N−K, k−x).
  - Probability: P(X = x) = [C(K, x) · C(N−K, k−x)] / C(N, k).
- Compute P(X = x) for all relevant x, then get the CDF by cumulative sums.
Computing expectation and variance
- Discrete:
  - E[X] = Σ x P(X=x)
  - Var(X) = Σ (x − μ)^2 P(X=x) = E[X^2] − (E[X])^2
- Continuous:
  - E[X] = ∫ x f(x) dx
  - Var(X) = ∫ (x − μ)^2 f(x) dx
- Use linearity (E[aX+b] = aE[X]+b) to simplify computations.

Emphasis on careful counting and correct use of combinations for sampling without replacement.
Always convert counts to probabilities before building the CDF.
Instructor encourages practice; notes that continuous-distribution topics (integration, Beta distribution) will appear later and are common on exams.
Side remarks in the video: reminders to subscribe and comment.

Lecturer (unnamed) — main speaker delivering STA301 Lecture 23.
Names mentioned in the video (not necessarily speakers): Rajendra; Bismillah Rahman Ullah Khan.
Referenced: Anand (example), Seema Bhanot (practice videos).
Video also contains background music and automated subtitles (auto-generated subtitles may contain errors).