Quiz 2

Statistics I · Week 7 — Probability

897 words
4 min read
2026-08-16T00:00:00.000Z
Python Week 1: the first filter for runtime behavior
Visual companion
Python
Type and operator map

Python Week 1: the first filter for runtime behavior

View
Revision summary

What this note is really saying

Short form

sample space, union, complement, disjoint events — concepts, pattern families, and traps for Quiz 2 week 7. # Week 7 — probability > **Quiz 2 scope:** Weeks 1–8 per IITM May 2026 foundation courses.

Week 7 — probability

Quiz 2 scope: Weeks 1–8 per IITM May 2026 foundation courses. Source baseline: IITM BS admissions important-dates calendar · May 2026 cycle. Times on assessments are operational conventions — verify hall ticket.
Part of the Quiz 2 prep system%20%C2%B7%20%5BWeeks%201%E2%80%938%20index%5D(.%2Fmay-2026-stats-quiz-2-weeks-1-8-prep) · Pattern atlas · Formula chains.

Week map

Sample space → event → rules → union/complement → disjoint add

Classify → Represent → Execute → Trap-check

  • Recognize: Ask: When can you add probabilities?
  • Procedure: Often easier P(at least one) = 1 − P(none). List none case carefully.
  • Variations / traps: Watch for: Adding P when events overlap.

Formula chain (compressed)

P(E) in [0,1] → complement → union for disjoint → general addition.
  1. ProbabilityP(E) = favourable / total — equally likely outcomes
  2. ComplementP(Eᶜ) = 1 − P(E) — at least one / not E
  3. Union disjointP(A∪B)=P(A)+P(B) — mutually exclusive
  4. General unionP(A)+P(B)−P(A∩B) — overlap possible
  5. Sample spaceall outcomes sum to 1 — sanity check

Deep study

Statistics I · Week 7 — Probability axioms

Deep study for Quiz 2 week 7. Probability assigns numbers to outcomes between 0 and 1, governed by addition for disjoint events and normalization over the sample space.

Week map

Sample space → event → probability scale → axioms → equally likely outcomes → complement rule → union of disjoint events.

Probability notation

  • SSsample space → set of all possible outcomes.
  • EEevent → subset of SS.
  • P(E)P(E) → probability of event EE → number in [0,1][0, 1].
  • P(E)=favorable outcomestotal outcomesP(E) = \dfrac{\text{favorable outcomes}}{\text{total outcomes}} when outcomes equally likely and finite.
Mini-example: fair die. S={1,2,3,4,5,6}S = \{1,2,3,4,5,6\}. Event “even” ={2,4,6}= \{2,4,6\}. P(even)=3/6=1/2P(\text{even}) = 3/6 = 1/2.

Axioms (finite setting)

  1. P(E)0P(E) \geq 0 for any event EE.
  2. P(S)=1P(S) = 1.
  3. If AA and BB disjoint: P(AB)=P(A)+P(B)P(A \cup B) = P(A) + P(B).
Complement: P(Ac)=1P(A)P(A^c) = 1 - P(A) where AcA^c is “not AA.”
Mini-example: P(not even on die)=11/2=1/2P(\text{not even on die}) = 1 - 1/2 = 1/2.

General addition (not necessarily disjoint)

P(AB)=P(A)+P(B)P(AB)P(A \cup B) = P(A) + P(B) - P(A \cap B)
Subtract overlap once.

Pattern families

Easy — Equally likely counting

List SS, count favorable, divide. Use complement when “at least one” is easier.

Medium — Disjoint union

Add probabilities of mutually exclusive events. Verify they do not overlap.

Hard — Inclusion-exclusion light

Two events with overlap: add singles, subtract intersection. Translate word problem to AA, BB, ABA \cap B.

Worked mini-examples

Example 1 — Die.
P(roll 5)=1/6P(\text{roll } 5) = 1/6.
Example 2 — Complement.
Draw one card. P(not heart)=113/52=3/4P(\text{not heart}) = 1 - 13/52 = 3/4.
Example 3 — Disjoint sum.
Die: A={1,2}A = \{1,2\}, B={5,6}B = \{5,6\} disjoint. P(AB)=2/6+2/6=4/6P(A \cup B) = 2/6 + 2/6 = 4/6.
Example 4 — Inclusion-exclusion.
P(A)=0.4P(A)=0.4, P(B)=0.3P(B)=0.3, P(AB)=0.1P(A \cap B)=0.1. P(AB)=0.4+0.30.1=0.6P(A \cup B)=0.4+0.3-0.1=0.6.
Example 5 — Invalid probability check.
If P(A)=0.7P(A)=0.7 and P(B)=0.5P(B)=0.5 and they are disjoint, P(AB)=1.2P(A \cup B)=1.2 — impossible; they cannot be disjoint.

Traps

  • Probabilities outside [0,1][0,1] or sum of all outcomes not 1.
  • Adding P(A)+P(B)P(A)+P(B) when events overlap without subtracting intersection.
  • Assuming equally likely when outcomes are not (biased coin).
  • Complement of wrong event — define AcA^c clearly.
  • Confusing probability with odds.

Diagnostic (try yourself)

  1. Fair coin flipped once. What is P(heads)P(\text{heads})?
  2. Two disjoint events with P(A)=0.3P(A)=0.3, P(B)=0.45P(B)=0.45. Find P(AB)P(A \cup B).
  3. P(E)=0.82P(E) = 0.82. What is P(Ec)P(E^c)?
  4. Bag: 3 red, 5 blue balls, one draw. P(red)P(\text{red})?
  5. P(A)=0.5P(A)=0.5, P(B)=0.4P(B)=0.4, P(AB)=0.2P(A \cap B)=0.2. Find P(AB)P(A \cup B).

ChatGPT prep archive

Archived import for extra depth — complements the notes above, not official IITM material.

Core concepts

  • Sample space S: all outcomes; event: subset of S.
  • P(A): long-run proportion; 0 ≤ P ≤ 1; P(S)=1.
  • Complement: P(Aᶜ) = 1 − P(A).
  • Union: if disjoint, P(A∪B) = P(A)+P(B); else inclusion-exclusion.

Notation & vocabulary

RuleFormula
complementP(Aᶜ)=1−P(A)
disjoint unionP(A∪B)=P(A)+P(B)
general unionP(A)+P(B)−P(A∩B)

Pattern families

Easy — Complement

Often easier P(at least one) = 1 − P(none). List none case carefully.

Medium — Disjoint union

Verify events cannot both happen. Then add probabilities.

Hard — Counting probability

P(A) = (# favorable)/(# equally likely outcomes). Use perm/comb from week 6 for counts.
Drill these on the pattern atlas — filter to week 7.

Traps

  • Adding P when events overlap.
  • Probability > 1 from bad counting.
  • Assuming equally likely without justification.
  • Confusing AND with OR in wording.

Retrieval prompts

  1. When can you add probabilities?
  2. What is complement rule?
  3. Define sample space.

Practice loop

  1. Read Deep study (if present) or core concepts once.
  2. Recite the formula chain without looking.
  3. Open one easy pattern on the interactive atlas for week 7.
  4. Attempt without solutions; mark studied after an honest try.
  5. Say one trap aloud before closing the tab.
Document outline

Keep your place and jump directly to a heading.

Table of Contents
System Normal // Awaiting Context

Intelligence Hub

Navigate the knowledge graph to generate context. The Hub adapts dynamically to surface backlinks, related notes, and metadata insights.