MODULE III: SET THEORY AND PROBABILITY

Module Architectural Focus: This module delivers a rigorous mathematical exposition of Set Theory and Probability Theory as foundational cornerstones for modern commercial decision analysis. Commencing with set notation, algebra of sets, Venn diagrams, and the Principle of Inclusion-Exclusion, the module develops combinatorial mathematics (Permutations and Combinations) for sample space construction. It then investigates the four historical paradigms of probability (Classical, Empirical, Subjective, and Kolmogorov's Axiomatic System), establishes the fundamental theorems of Total and Compound Probability, examines Conditional Probability and Statistical Independence, and concludes with an in-depth treatment of Bayes' Theorem (Inverse Probability) and its applications in managerial forecasting, credit assessment, and industrial quality control.

1. SET THEORY: FOUNDATIONS & NOTATIONAL ARCHITECTURE

Modern mathematical probability is constructed upon the structural language of Set Theory, originally formulated by Georg Cantor. In commercial contexts, sets provide an unambiguous framework for classifying consumers, financial transactions, inventory units, and operational states.

Mathematical Definition of a Set

A set is a well-defined collection of distinct objects, termed elements or members. "Well-defined" signifies that given any conceivable entity, an objective rule determines whether that entity belongs to the set ((x in A)) or does not belong to the set ((x otin A)).

Methods of Set Specification

• Roster / Tabular Form: Elements are explicitly enumerated within curly braces: (A = {2, 4, 6, 8}).
• Set-Builder / Rule Form: Elements are stated via a governing defining property:

A = {x : x is an even natural number \leq 8}

Taxonomy of Sets in Quantitative Analysis

Set Classification	Mathematical Definition	Business / Operational Illustration
1. Null / Empty Set ((emptyset))	A set containing zero elements: (\|emptyset\| = 0). Denoted (emptyset) or ({}).	The set of retail transactions in a bank with negative cash deposit amounts.
2. Universal Set ((U) or (Omega))	The comprehensive set containing all conceivable objects under consideration.	The master database containing all active credit cardholders of a financial institution.
3. Finite vs. Infinite Set	A set whose elements can be counted and terminate, versus non-terminating elements.	• Finite: The set of employees in an enterprise ((N = 450)). • Infinite: The set of real-number exchange rate fluctuations over continuous time.
4. Subset & Proper Subset	(A subseteq B) if (orall x in A implies x in B). Proper subset ((A subset B)) if (A subseteq B) and (A eq B).	The set of delinquent loan accounts ((D)) is a proper subset of all issued credit facilities ((L)).
5. Power Set ((mathcal{P}(A)))	The set of all possible subsets of (A). If (\|A\| = n), then (\|mathcal{P}(A)\| = 2^n).	If a software suite has 3 modules, there are (2^3 = 8) distinct packaging options available to customers.
6. Disjoint / Mutually Exclusive	Two sets with no common elements: (A cap B = emptyset).	The set of salaried permanent employees and the set of third-party contract workers.

2. SET ALGEBRA, OPERATIONS & VENN DIAGRAMS

Operations on sets allow analytical combining, filtering, and partitioning of complex business data:

1. Union ((A cup B))

The set of all elements belonging to (A), or to (B), or to both:

A \cup B = {x : x \in A or x \in B}

In probability, this corresponds to the occurrence of at least one of the events.

2. Intersection ((A cap B))

The set of all elements belonging simultaneously to both (A) and (B):

A \cap B = {x : x \in A and x \in B}

In probability, this corresponds to the joint occurrence of both events.

3. Difference ((A - B))

The set of elements belonging strictly to (A) but not belonging to (B):

A - B = {x : x \in A and x \in / B} = A \cap B^{'}

Signifies customers using Service (A) exclusively, avoiding Service (B).

4. Complement ((A') or (A^c))

The set of all elements in universal set (U) that do not belong to (A):

A^{'} = {x : x \in U and x \in / A} = U - A

Represents non-occurrence of the event (A).

+-----------------------------------------------------------------------------------+ | ASCII VENN DIAGRAM ARCHITECTURE | +-----------------------------------------------------------------------------------+ | | | UNIVERSAL SET (U) | | +-----------------------------------------------------------------------------+ | | | | | | | SET A SET B | | | | /--------- /--------- | | | | / / | | | | / ONLY A INTER- / ONLY B | | | | | (A - B) | SECTION | (B - A) | | | | | | | (A ∩ B) | | | | | | / / | | | | / / | | | | ---------/ ---------/ | | | | | | | | NEITHER A NOR B: (A ∪ B)' = A' ∩ B' | | | +-----------------------------------------------------------------------------+ | +-----------------------------------------------------------------------------------+

Fundamental Laws of Set Algebra

Set operations conform to precise algebraic identities that mirror probability calculations:

Algebraic Law	Union Formulation	Intersection Formulation
1. Idempotent Laws	(A cup A = A)	(A cap A = A)
2. Commutative Laws	(A cup B = B cup A)	(A cap B = B cap A)
3. Associative Laws	((A cup B) cup C = A cup (B cup C))	((A cap B) cap C = A cap (B cap C))
4. Distributive Laws	(A cup (B cap C) = (A cup B) cap (A cup C))	(A cap (B cup C) = (A cap B) cup (A cap C))
5. Identity Laws	(A cup emptyset = A, A cup U = U)	(A cap U = A, A cap emptyset = emptyset)
6. Complement Laws	(A cup A' = U, (A')' = A)	(A cap A' = emptyset, U' = emptyset, emptyset' = U)
7. De Morgan's Laws	((A cup B)' = A' cap B')	((A cap B)' = A' cup B')

The Principle of Inclusion-Exclusion (Cardinality Formula)

Two-Set Cardinality:

n(A cup B) = n(A) + n(B) - n(A cap B) ]
Three-Set Cardinality:
[ n(A cup B cup C) = n(A) + n(B) + n(C) - [n(A cap B) + n(B cap C) + n(A cap C)] + n(A cap B cap C) ]
Cardinality of Exactly One Set Occurring (Among Two Sets):
[ n(A Delta B) = n(A - B) + n(B - A) = n(A cup B) - n(A cap B) = n(A) + n(B) - 2n(A cap B) ]

3. PRINCIPLES OF COUNTING: PERMUTATIONS & COMBINATIONS

Calculating probabilities in complex sample spaces requires systematic enumeration without tedious listing. Combinatorics provides the quantitative tools for computing total and favorable outcomes.

Fundamental Principle of Multiplication

If an operation can be performed in (m) distinct ways, and following its completion a second operation can be performed in (n) distinct ways, the two operations in sequence can be performed in exactly: [ m × n text{ ways}

Fundamental Principle of Addition

If two operations are mutually exclusive such that the first can be performed in (m) ways and the second in (n) ways, then either the first or the second operation can be performed in:

m + n ways

Permutations vs. Combinations

Dimension	Permutations ((^nP_r))	Combinations ((^nC_r))
Concept	Arrangement: An ordered grouping where the sequence of selection matters critically.	Selection: An unordered grouping where order of selection is entirely irrelevant.
Mathematical Formula	$^{n} P_{r} = \frac{n !}{( n - r )!}$	$^{n} C_{r} = \frac{n !}{r ! ( n - r )!} = \frac{^{n} P _{r}}{r !}$
Permutations with Repetition	Arranging (n) items where (p) are of one kind, (q) of another: $\frac{n !}{p ! \cdot q !}$ .	Selection with replacement: (^{n+r-1}C_r).
Key Properties	(^nP_0 = 1, ^nP_n = n!, ^nP_1 = n).	(^nC_r = ^nC_{n-r}, ^nC_0 = ^nC_n = 1, ^nC_r + ^nC_{r-1} = ^{n+1}C_r).
Business Example	Assigning 3 distinct executive offices (CEO, CFO, COO) among 10 candidates: (^{10}P_3 = 720).	Selecting a 3-member risk committee from 10 board directors: (^{10}C_3 = 120).

4. FOUNDATIONAL CONCEPTS & TERMINOLOGY OF PROBABILITY

Probability theory formalizes the quantitative measurement of uncertainty. Essential terminology includes:

1. Random Experiment

An experiment or operational process whose outcome cannot be predicted with absolute certainty in advance, but whose set of all possible outcomes is fully known prior to execution.

2. Sample Space ((S)) & Points

The universal set containing every conceivable elementary outcome of a random experiment. Each individual outcome is termed a sample point ((omega in S)).

3. Events (Simple vs. Compound)

Any subset of the sample space ((A subseteq S)). An event containing exactly one sample point is an elementary (simple) event; an event comprising two or more sample points is a compound event.

4. Mutually Exclusive Events

Events that cannot occur simultaneously in a single trial ((A cap B = emptyset)). The occurrence of one event automatically precludes the occurrence of the other.

5. Exhaustive Events

A set of events whose union constitutes the entire sample space ((igcup A_i = S)). At least one of the events must inevitably occur during any experimental trial.

6. Independent Events

Events where the occurrence or non-occurrence of one event has zero mathematical influence on the probability of occurrence of the other: (P(A | B) = P(A)).

5. FOUR HISTORICAL SCHOOLS OF PROBABILITY

The interpretation of probability has evolved across four distinct conceptual frameworks:

Probability School	Defining Mathematical Characterization	Operational Merits & Theoretical Limitations
1. Classical / A Priori (Laplace)	If an experiment produces (n) mutually exclusive, exhaustive, and equally likely outcomes, and (m) of them are favorable to event (A): $P (A) = \frac{m}{n} = \frac{Favorable Outcomes}{Total Outcomes}$	• Merit: Mathematically elegant and calculable prior to conducting any experiment. • Limitation: Suffers from circular reasoning (defines probability via "equally likely"); fails when outcomes are infinite or asymmetric.
2. Empirical / Relative Frequency (Von Mises)	Probability is the limiting relative frequency of an event as trials approach infinity: $P (A) = N \to \infty lim \frac{f}{N}$ where (f) is observed occurrences over (N) repeated identical trials.	• Merit: Grounded in empirical reality; handles complex physical and mortality data. • Limitation: Requires identical conditions repeatable to infinity; impossible for unique one-off business investments.
3. Subjective / Personalistic (Savage, De Finetti)	Probability is a quantifiable measure of personal degree of belief in the truth of a proposition, calibrated against the willingness to accept wagers.	• Merit: Applicable to non-repeatable strategic business decisions (e.g., probability of a corporate merger succeeding). • Limitation: Inherently subjective; two rational decision-makers may assign divergent probabilities to identical scenarios.
4. Modern Axiomatic (Kolmogorov, 1933)	Defined strictly as a real-valued set function (P: mathcal{F} → [0, 1]) conforming to three core axioms: 1. Non-negativity: (P(A) ≥ 0, orall A in mathcal{F}). 2. Certainty: (P(S) = 1.0). 3. Countable Additivity: If (A_1, A_2, dots) are mutually disjoint, (P(igcup A_i) = ∑ P(A_i)).	• Merit: Mathematically rigorous; avoids philosophical controversies; forms the universal foundation of modern stochastic mathematics. • Limitation: Does not dictate how to compute numerical probabilities for specific physical events without empirical/classical inputs.

6. FUNDAMENTAL THEOREMS: TOTAL & COMPOUND PROBABILITY

Theorem of Total Probability (Addition Rules)

Rule 1: For Mutually Exclusive Events
If events (A) and (B) cannot occur together ((A cap B = emptyset)):

P(A cup B) = P(A) + P(B)

Rule 2: General Addition Rule (Non-Mutually Exclusive Events)
For any two arbitrary events (A) and (B): [

P(A cup B) = P(A) + P(B) - P(A cap B)

Rule 3: Extension to Three Non-Disjoint Events
[

P(A cup B cup C) = P(A) + P(B) + P(C) - [P(A cap B) + P(B cap C) + P(A cap C)] + P(A cap B cap C)

Rule 4: Boole's Inequality
For any sequence of events: (P≤ft(bigcup_{i=1}^n A_iright) ≤ ∑_{i=1}^n P(A_i)).

Conditional Probability & Compound Probability (Multiplication Rules)

Mathematical Definition of Conditional Probability:
The probability of event (A) occurring given that event (B) has already occurred with certainty ((P(B) > 0)): [ P(A | B) = (P(A cap B)) / (P(B))

Similarly, (P(B | A) = (P(A cap B)) / (P(A))) for (P(A) > 0).

Multiplication Theorem (Dependent Events):

P(A cap B) = P(B) cdot P(A mid B) = P(A) cdot P(B mid A)

For three dependent events: [

P(A cap B cap C) = P(A) cdot P(B mid A) cdot P(C mid A cap B)

Multiplication Theorem for Statistically Independent Events:
Events (A) and (B) are statistically independent if and only if: [

P(A cap B) = P(A) cdot P(B)

In this case, (P(A | B) = P(A)) and (P(B | A) = P(B)).

7. BAYES' THEOREM & INVERSE PROBABILITY

Formulated by the Reverend Thomas Bayes (published posthumously in 1763), Bayes' Theorem is a cornerstone of modern statistical inference and Bayesian data science. It enables the systematic revision of prior beliefs or subjective probability estimates in light of newly acquired sample evidence.

Mathematical Architecture of Bayes' Theorem

INVERSE PROBABILITY

Let (B_1, B_2, dots, B_k) constitute a set of mutually exclusive and exhaustive events (a complete partition of sample space (S)) with known non-zero prior probabilities (P(B_i)). Let (A) be any arbitrary event with (P(A) > 0), for which the conditional likelihoods (P(A | B_i)) are known.

Total Probability Rule (Marginal Probability of Evidence (A)):
[ P(A) = ∑_{j=1}^k P(B_j) · P(A | B_j)

Bayes' Master Inversion Formula (Posterior Probability):

P (B_{i} ∣ A) = \frac{P ( B _{i} ) \cdot P ( A ∣ B _{i} )}{\sum _{j = 1}^{k} P ( B _{j} ) \cdot P ( A ∣ B _{j} )} = \frac{Prior Probability \times Likelihood}{Total Marginal Probability of Evidence}

Component	Notation	Statistical & Business Role
Prior Probability	(P(B_i))	Initial assessment of the likelihood of cause or state of nature (B_i) before observing sample data.
Likelihood (Conditional)	(P(A \| B_i))	The conditional probability of observing evidence (A) given that cause (B_i) actually exists.
Joint Probability	(P(B_i cap A) = P(B_i) · P(A \| B_i))	The simultaneous probability of both cause (B_i) occurring and evidence (A) being observed.
Posterior Probability	(P(B_i \| A))	The revised, updated probability of cause (B_i) after taking concrete empirical evidence (A) into account.

8. STEP-BY-STEP SOLVED NUMERICAL ILLUSTRATIONS

ILLUSTRATION 1: Advanced Set Theory & Market Research Consumer Survey
A regional consumer FMCG marketing agency surveyed 1,000 households regarding their regular purchase of three competing organic soap brands: Brand A, Brand B, and Brand C. The empirical survey data yielded the following disclosures:
• 400 households purchased Brand A.
• 350 households purchased Brand B.
• 300 households purchased Brand C.
• 150 households purchased both Brand A and Brand B.
• 120 households purchased both Brand B and Brand C.
• 100 households purchased both Brand A and Brand C.
• 50 households purchased all three brands simultaneously.

Required:
1. Determine how many households purchased at least one of the three brands.
2. Determine how many households purchased none of the three brands.
3. Determine how many households purchased only Brand A.
4. Determine how many households purchased exactly one brand.
5. Determine how many households purchased exactly two brands.

Solution & Step-by-Step Working Notes:

Let (n(U) = 1,000), (n(A) = 400), (n(B) = 350), (n(C) = 300).
(n(A cap B) = 150), (n(B cap C) = 120), (n(A cap C) = 100), (n(A cap B cap C) = 50).

1. Households purchasing at least one brand ((n(A cup B cup C))):
Applying the Principle of Inclusion-Exclusion:

3. Households purchasing only Brand A:

n (Only C) = n (C) - n (A \cap C) - n (B \cap C) + n (A \cap B \cap C) = 300 - 100 - 120 + 50 = 130 households

Households purchasing exactly one brand:

n (Exactly One) = n (Only A) + n (Only B) + n (Only C) = 200 + 130 + 130 = 460 households

5. Households purchasing exactly two brands:

n (Only A \cap B) n (Only B \cap C) n (Only A \cap C) n (Exactly Two) = n (A \cap B) - n (A \cap B \cap C) = 150 - 50 = 100 = n (B \cap C) - n (A \cap B \cap C) = 120 - 50 = 70 = n (A \cap C) - n (A \cap B \cap C) = 100 - 50 = 50 = 100 + 70 + 50 = 220 households

] Verification: Total at least one = (Exactly 1) + (Exactly 2) + (All 3) = (460 + 220 + 50 = 730). Perfect consistency!

ILLUSTRATION 2: Combinatorial Probability in Corporate Governance
The board of directors of a commercial bank must form a special 5-member Audit & Risk Oversight Committee selected randomly from a pool consisting of 6 Chartered Accountants (CAs) and 4 Financial Analysts (FAs).

Required: Compute the exact probability that the constituted committee will contain:
1. Exactly 3 Chartered Accountants and 2 Financial Analysts.
2. At least 4 Chartered Accountants.
3. A majority of Financial Analysts (i.e., at least 3 FAs).
4. At least one Financial Analyst.

Solution & Step-by-Step Working Notes:

Total candidates in pool = (6 + 4 = 10). Committee size = 5.
Total number of unrestricted elementary combinations in sample space (S): [ n(S) = ^{10}C_5 = (10!) / (5! · 5!) = (10 × 9 × 8 × 7 × 6) / (5 × 4 × 3 × 2 × 1) = 252 text{ ways}

Case 1: Exactly 3 CAs and 2 FAs:
Number of favorable selections = $^{6} C_{3} \times^{4} C_{2}$ .

^{6} C_{3} = \frac{6 \times 5 \times 4}{3 \times 2 \times 1} = 20,^{4} C_{2} = \frac{4 \times 3}{2 \times 1} = 6

n (E_{1}) = 20 \times 6 = 120 ⟹ P (E_{1}) = \frac{120}{252} = \frac{10}{21} \approx 0.4762 (47.62%)

Case 2: At least 4 Chartered Accountants:
This encompasses two mutually exclusive possibilities: (4 CAs and 1 FA) OR (5 CAs and 0 FAs).

n (E_{2}) = (^{6} C_{4} \times^{4} C_{1}) + (^{6} C_{5} \times^{4} C_{0})

^{6} C_{4} =^{6} C_{2} = 15,^{4} C_{1} = 4 ⟹ 15 \times 4 = 60

^{6} C_{5} = 6,^{4} C_{0} = 1 ⟹ 6 \times 1 = 6

n (E_{2}) = 60 + 6 = 66 ⟹ P (E_{2}) = \frac{66}{252} = \frac{11}{42} \approx 0.2619 (26.19%)

Case 3: Majority of Financial Analysts (at least 3 FAs):
This requires: (3 FAs and 2 CAs) OR (4 FAs and 1 CA). Note that 5 FAs cannot be chosen since only 4 exist.

n (E_{3}) = (^{4} C_{3} \times^{6} C_{2}) + (^{4} C_{4} \times^{6} C_{1}) = (4 \times 15) + (1 \times 6) = 60 + 6 = 66

P (E_{3}) = \frac{66}{252} = \frac{11}{42} \approx 0.2619 (26.19%)

Case 4: At least one Financial Analyst:
Using the complementary probability principle:

P (At least 1 FA) = 1 - P (Zero FAs, i.e., All 5 CAs)

P (All 5 CAs) = \frac{^{6} C _{5} \times ^{4} C _{0}}{252} = \frac{6 \times 1}{252} = \frac{6}{252} = \frac{1}{42}

P (At least 1 FA) = 1 - \frac{1}{42} = \frac{41}{42} \approx 0.9762 (97.62%)

ILLUSTRATION 3: Addition & Multiplication Theorems in Operational Risk
A multinational cloud computing infrastructure company operates two geographically independent backup power turbine systems: Generator Unit A and Generator Unit B. Historical reliability logs indicate that:
• The probability that Generator A fails during an unscheduled grid blackout is (P(A) = 0.08).
• The probability that Generator B fails during the blackout is (P(B) = 0.05).
• Because both units are linked to an emergency synchronization valve, the probability of joint simultaneous failure is (P(A cap B) = 0.02).

Required: Compute the probability that:
1. At least one generator fails during a grid blackout.
2. Both generators function successfully without failure.
3. Exactly one generator fails.
4. Generator B fails given that Generator A has already failed.
5. Determine whether the failures of Generator A and Generator B are statistically independent.

Solution & Step-by-Step Working Notes:

1. Probability that at least one generator fails ((P(A cup B))):

P (A \cup B) = P (A) + P (B) - P (A \cap B) = 0.08 + 0.05 - 0.02 = 0.11 (11.0%)] < / p >< p >< s t r o n g > 2. P r o babi l i t y t ha t b o t h g e n er a t or s f u n c t i o n s u ccess f u l l y ((P (A^{'} \cap B^{'}))) :< / s t r o n g >< b r > B y D e M or g a n^{'} s L a w : (P (A^{'} \cap B^{'}) = P ((A \cup B)^{'}) = 1 - P (A \cup B) = 1 - 0.11 = 0.89 (89.0%)) . < / p >< p >< s t r o n g > 3. P r o babi l i t y t ha t e x a c tl y o n e g e n er a t or f ai l s :< / s t r o n g > [P (Exactly One) = P (A \cup B) - P (A \cap B) = 0.11 - 0.02 = 0.09 (9.0%)

Alternatively: (P(A cap B') + P(A' cap B) = [P(A) - P(A cap B)] + [P(B) - P(A cap B)] = (0.08 - 0.02) + (0.05 - 0.02) = 0.06 + 0.03 = 0.09).

4. Probability that Generator B fails given Generator A has failed ((P(B | A))):

P (B ∣ A) = \frac{P ( A \cap B )}{P ( A )} = \frac{0.02}{0.08} = 0.25 (25.0%)

5. Test of Statistical Independence:
For independence, (P(A cap B)) must equal (P(A) × P(B)).
Here, (P(A) × P(B) = 0.08 × 0.05 = 0.004).
However, actual (P(A cap B) = 0.02 eq 0.004).
Furthermore, (P(B | A) = 0.25 eq P(B) = 0.05).
Conclusion: The failure events are statistically dependent. The failure of Unit A dramatically amplifies the risk of Unit B failing from 5% to 25%.

ILLUSTRATION 4: Bayes' Theorem in Industrial Quality Assurance
A high-precision semiconductor assembly facility manufactures automotive microchips across three automated fabrication lines: Machine Line 1, Machine Line 2, and Machine Line 3. Plant operational audit data reveal:
• Machine Line 1 manufactures 50% of the total microchip output.
• Machine Line 2 manufactures 30% of the total output.
• Machine Line 3 manufactures 20% of the total output.
• Historical defective manufacturing rates are: Machine 1 = 2%, Machine 2 = 3%, and Machine 3 = 5%.

At the final packaging depot, a quality inspector draws a single microchip at random and upon precision testing finds it to be defective.

Required:
1. Calculate the overall (marginal) probability of selecting a defective microchip from the aggregate output.
2. Given that the microchip is defective, calculate the posterior probability that it originated from: (a) Machine Line 1, (b) Machine Line 2, and (c) Machine Line 3.
3. Which machine line is most likely to be the source of the defective microchip?

Solution & Step-by-Step Working Notes:

Let (B_1, B_2, B_3) denote the events that a randomly selected chip was produced by Machine 1, 2, and 3 respectively.
Let (D) denote the event that the microchip is defective.

Prior Probabilities:
(P(B_1) = 0.50, P(B_2) = 0.30, P(B_3) = 0.20).
Check: (∑ P(B_i) = 0.50 + 0.30 + 0.20 = 1.0).

Conditional Likelihoods:
(P(D | B_1) = 0.02, P(D | B_2) = 0.03, P(D | B_3) = 0.05).

Machine Line ((B_i))	Prior Probability (P(B_i))	Conditional Likelihood (P(D \| B_i))	Joint Probability (P(B_i cap D) = P(B_i)P(D\|B_i))	Posterior Probability (P(B_i \| D) = (P(B_i cap D)) / (P(D)))
Line 1 ((B_1))	0.50	0.02	$0.50 \times 0.02 = 0.010$	((0.010) / (0.029) = (10) / (29) ≈ mathbf{0.3448} (34.48%))
Line 2 ((B_2))	0.30	0.03	$0.30 \times 0.03 = 0.009$	((0.009) / (0.029) = (9) / (29) ≈ mathbf{0.3103} (31.03%))
Line 3 ((B_3))	0.20	0.05	$0.20 \times 0.05 = 0.010$	((0.010) / (0.029) = (10) / (29) ≈ mathbf{0.3448} (34.48%))
Total	1.00	-	(P(D) = 0.029)	1.0000 (100%)

1. Overall Marginal Defect Rate ((P(D))):

P (D) = i = 1 \sum 3 P (B_{i}) \cdot P (D ∣ B_{i}) = 0.010 + 0.009 + 0.010 = 0.029 (2.90%)

2. Posterior Probabilities:
• Probability defective chip was from Line 1: (P(B_1 | D) = (0.010) / (0.029) = mathbf{34.48%}).
• Probability defective chip was from Line 2: (P(B_2 | D) = (0.009) / (0.029) = mathbf{31.03%}).
• Probability defective chip was from Line 3: (P(B_3 | D) = (0.010) / (0.029) = mathbf{34.48%}).

3. Managerial Diagnosis:
Even though Machine Line 3 has the highest single failure rate (5%), Machine Line 1 produces 2.5 times the volume of Line 3. Consequently, Machine Line 1 and Machine Line 3 are equally likely (34.48% each) to be the root origin of the defective microchip.

9. COMPREHENSIVE SELF-ASSESSMENT MODULE

SECTION A: CONCEPTUAL & QUANTITATIVE MCQS

Select the most appropriate option. Full solution key with mathematical rationale follows.

1. If a set (A) contains (n) distinct elements, the total number of non-empty proper subsets of (A) is:
(a) (2^n) (b) (2^n - 1) (c) (2^n - 2) (d) (n^2 - 1)

3. If events (A) and (B) are mutually exclusive with (P(A) = 0.35) and (P(B) = 0.45), then (P(A cap B)) is equal to:
(a) 0.1575 (b) 0.80 (c) 0.0 (d) 0.10

4. In how many distinct ways can a committee of 4 persons be formed from a group of 8 chartered accountants?
(a) 32 (b) 1,680 (c) 70 (d) 24

5. If (P(A) = 0.60), (P(B) = 0.40), and (A) and (B) are statistically independent events, then (P(A cup B)) is:
(a) 1.00 (b) 0.76 (c) 0.24 (d) 0.84

6. The conditional probability (P(A | B)) is when:
(a) (P(A) = 0) (b) (P(B) = 0) (c) (P(A cap B) = 0) (d) (P(A cup B) = 1)

7. If an event (A) is certain to happen, its mathematical probability (P(A)) is:
(a) $\infty$ (b) 0.50 (c) 1.0 (d) 100

8. In Bayes' Theorem, the probability (P(B_i | A)) calculated after observing empirical sample data is formally known as:
(a) Prior Probability (b) Likelihood (c) Posterior Probability (d) Joint Probability

9. Two cards are drawn successively without replacement from a standard well-shuffled pack of 52 playing cards. The probability that both cards are Aces is:
(a) $\frac{1}{169}$ (b) $\frac{1}{221}$ (c) $\frac{4}{221}$ (d) $\frac{1}{13}$

10. If (A subset B), then which of the following statements is always mathematically true?
(a) (P(A) > P(B)) (b) (P(A cap B) = P(B)) (c) (P(A) ≤ P(B)) (d) (P(A | B) = 1)

Answers & Conceptual Rationale for Section A:
1. (c) (2^n - 2): Total subsets is (2^n). Excluding the empty set ((emptyset)) and the set itself ((A)) leaves (2^n - 2) non-empty proper subsets.
2. (b) (A' cup B'): By De Morgan's second law of set algebra.
3. (c) 0.0: Mutually exclusive events cannot co-occur; their intersection is the null set, hence (P(A cap B) = 0).
4. (c) 70:

^{8} C_{4} = \frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1} = 70

.
5. (b) 0.76: For independent events, (P(A cap B) = P(A) × P(B) = 0.60 × 0.40 = 0.24). Thus (P(A cup B) = 0.60 + 0.40 - 0.24 = 0.76).
6. (b) (P(B) = 0): (P(A | B) = (P(A cap B)) / (P(B))). Division by zero is .
7. (c) 1.0: Kolmogorov's Second Axiom specifies (P(S) = 1.0).
8. (c) Posterior Probability: Probabilities computed after observing empirical findings are posterior probabilities.
9. (b) $\frac{1}{221}$ : (P

Ace_{1}

= (4) / (52) = (1) / (13)). (P

Ace_{2} ∣ Ace_{1}

= (3) / (51) = (1) / (17)). Joint probability =

\frac{1}{13} \times \frac{1}{17} = \frac{1}{221}

.
10. (c) (P(A) ≤ P(B)): By monotonicity property of probability measures, if (A subseteq B), then (P(A) ≤ P(B)).

SECTION B: ANALYTICAL & THEORETICAL ESSAY QUESTIONS

State and prove De Morgan's Laws of Set Algebra. Demonstrate how De Morgan's laws are translated into probability statements regarding the non-occurrence of events.
Contrast the Classical and Axiomatic approaches to probability. Explain why modern mathematicians adopt Kolmogorov's axiomatic formulation over the classical Laplace definition.
Differentiate between Mutually Exclusive Events and Statistically Independent Events. Can two non-impossible events be simultaneously mutually exclusive and statistically independent? Prove your assertion mathematically.
State and derive the Theorem of Total Probability and Bayes' Theorem. Discuss three tangible commercial scenarios where Bayes' theorem drives managerial decision-making under uncertainty.
Explain the Principle of Inclusion-Exclusion. Provide the algebraic expansion for three non-disjoint sets and illustrate its application using a Venn diagram.

SECTION C: ADVANCED QUANTITATIVE PROBLEMS

Problem 1: Complex Combinatorics and Probability Distribution
A high-technology venture capital fund receives 12 business proposals for seed funding, consisting of 5 Artificial Intelligence (AI) startups, 4 Fintech startups, and 3 Green Energy startups. The investment committee decides to shortlist 4 proposals at random for pitch presentations.

Required:
1. What is the total number of sample outcomes for selecting 4 proposals?
2. Find the probability that exactly 2 AI startups and 2 Fintech startups are selected.
3. Find the probability that at least one Green Energy startup is included in the shortlist.
4. Find the probability that all 4 selected startups belong to the same sector.
5. Find the probability that the shortlist contains at least one startup from each of the three sectors.

Problem 2: Bayes' Theorem in Financial Fraud Detection
A commercial retail banking institution employs an automated machine learning algorithm to flag fraudulent credit card transactions. Comprehensive transaction historical logs reveal:
• 1% of all credit card transactions conducted on the bank's network are genuinely fraudulent ((B_1)), while 99% are legitimate ((B_2)).
• If a transaction is fraudulent, the algorithm correctly flags it as suspicious with probability 0.95 (True Positive Rate).
• If a transaction is legitimate, the algorithm incorrectly flags it as suspicious with probability 0.04 (False Positive Rate).

Required:
1. Formulate the prior probabilities and conditional likelihoods.
2. Compute the overall probability that a randomly chosen transaction is flagged as suspicious by the algorithm.
3. If a customer's transaction is suddenly flagged as suspicious, calculate the posterior probability that the transaction is genuinely fraudulent.
4. Comment on why this posterior probability is surprisingly low despite the algorithm's high 95% detection sensitivity.

MODULE III: SET THEORY AND PROBABILITY

1. SET THEORY: FOUNDATIONS & NOTATIONAL ARCHITECTURE

Mathematical Definition of a Set

Methods of Set Specification

Taxonomy of Sets in Quantitative Analysis

2. SET ALGEBRA, OPERATIONS & VENN DIAGRAMS

1. Union ((A cup B))

2. Intersection ((A cap B))

3. Difference ((A - B))

4. Complement ((A') or (A^c))

Fundamental Laws of Set Algebra

The Principle of Inclusion-Exclusion (Cardinality Formula)

3. PRINCIPLES OF COUNTING: PERMUTATIONS & COMBINATIONS

Fundamental Principle of Multiplication

Fundamental Principle of Addition

Permutations vs. Combinations

4. FOUNDATIONAL CONCEPTS & TERMINOLOGY OF PROBABILITY

1. Random Experiment

2. Sample Space ((S)) & Points

3. Events (Simple vs. Compound)

4. Mutually Exclusive Events

5. Exhaustive Events

6. Independent Events

5. FOUR HISTORICAL SCHOOLS OF PROBABILITY

6. FUNDAMENTAL THEOREMS: TOTAL & COMPOUND PROBABILITY

Theorem of Total Probability (Addition Rules)

Conditional Probability & Compound Probability (Multiplication Rules)

7. BAYES' THEOREM & INVERSE PROBABILITY

Mathematical Architecture of Bayes' Theorem

8. STEP-BY-STEP SOLVED NUMERICAL ILLUSTRATIONS

9. COMPREHENSIVE SELF-ASSESSMENT MODULE

Finished reading Module 3?