Study guide

6.12 Probability Concepts, Common Distributions, and the Central Limit Theorem

ASQ Certified Six Sigma Black Belt CSSBB

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & CSSBB Exam Strategy

1.1 CSSBB Exam Format, Scoring, and Testing Windows 1.2 Eligibility, Project Affidavits, Application, and Recertification 1.3 Open-Book Strategy, Reference Materials, and a 16-Week Study Plan

2 Chapter 2: Organization-Wide Planning and Deployment

2.1 Fundamentals of Six Sigma and Lean Methodologies 2.2 Selecting the Right Methodology: DMAIC, DFSS, and Lean 2.3 Business Systems, Processes, and Stakeholder Relationships 2.4 Strategic Planning and Deployment of Six Sigma Initiatives 2.5 Six Sigma Roles and Responsibilities 2.6 Organizational Barriers and Common Causes of Six Sigma Failure 2.7 Change Management: Stakeholder Analysis, Readiness, and Communication

3 Chapter 3: Organizational Process Management and Measures

3.1 Impact of Six Sigma Projects on Customers, Suppliers, and Stakeholders 3.2 Benchmarking Types and Performance Goal Setting 3.3 Performance Measures: Balanced Scorecard, KPIs, KBIs, OKRs, and Line of Sight 3.4 Leading and Lagging Indicators and Performance Dashboards 3.5 Financial Measures: Revenue Growth, Margin, NPV, ROI, and Cost-Benefit Analysis 3.6 Cost of Poor Quality and Hard versus Soft Savings

4 Chapter 4: Team Management

4.1 Team Types and Constraints 4.2 Team Roles, Responsibilities, and Member Selection 4.3 Team Success Factors and Ground Rules 4.4 Motivational Techniques and Overcoming Demotivators 4.5 Stages of Team Development and Conflict Resolution 4.6 Team Communication Plans 4.7 Team Leadership Models: Direct, Coach, Support, and Delegate 4.8 Group Behaviors, Conflict Resolution, and Meeting Management 4.9 Facilitation Techniques and Team Decision-Making Methods 4.10 Team Training: Needs Assessment, Delivery, and Evaluation

5 Chapter 5: Define Phase

5.1 Customer Identification and Segmentation 5.2 Customer Data Collection: Methods, Validity, and Reliability 5.3 Customer Requirements: CTX, CTQ Trees, and Operational Definitions 5.4 The Kano Model and Quality Function Deployment 5.5 SIPOC and Process Mapping 5.6 Business Case Justification 5.7 The Project Charter and the Problem Statement 5.8 Project Scope and Boundaries 5.9 SMART Goals and Project Performance Measurements 5.10 Project Charter Reviews and Toll-Gate Governance 5.11 Project Management Tools: Gantt Charts, Toll-Gate Reviews, WBS, and RACI 5.12 Analytical Tools Used Throughout the DMAIC Cycle

6 Chapter 6: Measure Phase

6.1 Process Flow Metrics and the Hidden Factory 6.2 Process Analysis Tools and Value Stream Mapping 6.3 Types of Data and Measurement Scales 6.4 Sampling Concepts, Methods, and Sample Size for Estimation 6.5 Data Collection Plans and Common Pitfalls 6.6 Gage R&R for Variable Measurement Systems 6.7 Attribute Agreement Analysis and Audit MSA 6.8 Measurement Systems Across the Organization, and Metrology 6.9 Population Parameters, Sample Statistics, and Valid Statistical Conclusions 6.10 Descriptive Statistics: Central Tendency, Dispersion, and Shape 6.11 Graphical Methods for Exploratory Data Analysis 6.12 Probability Concepts, Common Distributions, and the Central Limit Theorem 6.13 Additional Distributions: Hypergeometric, Exponential, Lognormal, Weibull, and Bivariate 6.14 Process Capability and Performance Indices 6.15 Capability Studies, Attributes Capability, Yield Metrics, and Long-Term Capability

7 Chapter 7: Analyze Phase

7.1 The Correlation Coefficient, Its Confidence Interval, and Causation 7.2 Linear Regression and Residual Analysis 7.3 Multivariate Tools: Factor Analysis, Discriminant Analysis, and MANOVA 7.4 Hypothesis Testing Terminology, Errors, and Single-Sample Tests 7.5 Statistical Versus Practical Significance 7.6 Sample Size for Hypothesis Tests 7.7 Point Estimates, Confidence, Prediction, and Tolerance Intervals 7.8 Tests for Means, Variances, and Proportions 7.9 Analysis of Variance 7.10 Chi-Square Goodness-of-Fit and Tests of Independence 7.11 Types of Risk and Failure Mode and Effects Analysis 7.12 Gap Analysis and Root Cause Analysis 7.13 Waste Analysis: The Seven Classic Wastes and Resource Under-Utilization

8 Chapter 8: Improve Phase

8.1 Design of Experiments: Objectives, Terminology, and Effects 8.2 DOE Design Principles: Randomization, Blocking, Replication, and Resolution 8.3 Planning and Evaluating Designed Experiments 8.4 One-Factor Experiments: Completely Randomized, Randomized Block, and Latin Square Designs 8.5 Full Factorial Experiments and Design Selection 8.6 Two-Level Fractional Factorial Experiments and Confounding 8.7 Response Surface Methodology and Optimization 8.8 Waste Elimination: Pull Systems, Kanban, 5S, and Poka-Yoke 8.9 Cycle-Time Reduction: Continuous Flow, SMED, and Heijunka 8.10 Kaizen, Kaizen Blitz, Theory of Constraints, and OEE 8.11 Implementation Planning, Piloting, and Solution Selection

9 Chapter 9: Control Phase

9.1 SPC Objectives, Variable Selection, and Rational Subgrouping 9.2 Control Charts for Variables Data 9.3 Control Charts for Attributes Data 9.4 Short-Run SPC and Moving Average Charts 9.5 Control Chart Analysis: Common Cause, Special Cause, and Run Rules 9.6 Total Productive Maintenance and Visual Controls 9.7 Measurement System Reanalysis 9.8 Control Plan Development and Process Owner Handoff 9.9 Lessons Learned, Documentation, and Training for Sustainment 9.10 Ongoing Evaluation of the Improved Process

10 Chapter 10: Design for Six Sigma (DFSS)

10.1 DFSS Frameworks: DMADV, DMADOV, and Design Transfer 10.2 Design for X (DFX) 10.3 Robust Design, Parameter Design, and Verification 10.4 Tolerance Design and Statistical Tolerancing

6.12 Probability Concepts, Common Distributions, and the Central Limit Theorem

Key Takeaways Explain This Topic AI

Binomial distributions model binary discrete events with constant probability p over n independent trials, yielding mean mu = np and variance sigma^2 = np(1-p).

Poisson distributions model count data of rare events over a continuous unit of space or time, where mean and variance are equal (mu = sigma^2 = lambda).

The Weibull distribution shape parameter beta indicates failure mode: beta < 1 represents infant mortality, beta = 1 indicates random/constant failures (exponential), and beta > 1 represents wear-out failures.

The Central Limit Theorem (CLT) establishes that for any population with mean mu and variance sigma^2, the distribution of sample means X-bar approaches N(mu, sigma^2/n) as n >= 30.

The Standard Error of the Mean (SE = sigma / sqrt(n)) quantifies the sampling variability of the mean and shrinks inversely with the square root of sample size.

Last updated: August 2026

Understanding probability distributions and sampling distributions is essential for statistical modeling in Six Sigma DMAIC projects. Probability distributions provide the mathematical models required to model process variation, compute defect probabilities, and build hypothesis tests.

Continuous Probability Distributions

Continuous distributions model quantitative measurements that can take any real value along a continuous scale.

1. Normal (Gaussian) Distribution

The foundational distribution of parametric statistics, characterized by a symmetric bell curve defined by mean μ \mu μ and variance σ 2 \sigma^2 σ 2 : f ( x ) = 1 σ 2 π exp ⁡ ( − ( x − μ ) 2 2 σ 2 ) f(x) = \frac{1}{\sigma \sqrt{2\pi}} \exp \left( -\frac{(x - \mu)^2}{2\sigma^2} \right) f ( x ) = σ 2 π ​ 1 ​ exp ( − 2 σ 2 ( x − μ ) 2 ​ )

Empirical Rule (68-95-99.7 Rule) :

μ ± 1 σ \mu \pm 1\sigma μ ± 1 σ encompasses 68.27 % 68.27\% 68.27% of process data.

μ ± 2 σ \mu \pm 2\sigma μ ± 2 σ encompasses 95.45 % 95.45\% 95.45% of process data.

μ ± 3 σ \mu \pm 3\sigma μ ± 3 σ encompasses 99.73 % 99.73\% 99.73% of process data.

2. Standard Normal Distribution ( Z Z Z )

A Normal distribution with μ = 0 \mu = 0 μ = 0 and σ = 1 \sigma = 1 σ = 1 . Any normal variable X X X is transformed to Z Z Z via: Z = X − μ σ Z = \frac{X - \mu}{\sigma} Z = σ X − μ ​

3. Exponential Distribution

Models time between independent random events (e.g., equipment mean time between failures - MTBF) with failure rate λ \lambda λ : f ( t ) = λ e − λ t ( t ≥ 0 ) f(t) = \lambda e^{-\lambda t} \quad (t \ge 0) f ( t ) = λ e − λ t ( t ≥ 0 )

Discrete Probability Distributions

Discrete distributions model countable operational events and attributes.

1. Binomial Distribution

Models the count of successes x x x in n n n independent Bernoulli trials with constant success probability p p p : P ( X = x ) = ( n x ) p x ( 1 − p ) n − x P(X = x) = \binom{n}{x} p^x (1 - p)^{n - x} P ( X = x ) = ( x n ​ ) p x ( 1 − p ) n − x

Mean : μ = n p \mu = np μ = n p ; Variance : σ 2 = n p ( 1 − p ) \sigma^2 = np(1-p) σ 2 = n p ( 1 − p ) .

Six Sigma Application : Baseline probability model for p p p -charts and n p np n p -charts (defective units).

2. Poisson Distribution

Models the count of rare events x x x occurring within a fixed interval of time or space at constant average rate λ \lambda λ : P ( X = x ) = e − λ λ x x ! P(X = x) = \frac{e^{-\lambda} \lambda^x}{x!} P ( X = x ) = x ! e − λ λ x ​

Mean : μ = λ \mu = \lambda μ = λ ; Variance : σ 2 = λ \sigma^2 = \lambda σ 2 = λ .

Six Sigma Application : Baseline probability model for c c c -charts and u u u -charts (defect counts).

The Central Limit Theorem (CLT)

The Central Limit Theorem is the mathematical foundation of statistical sampling.

Mathematical Statement of CLT

Regardless of the underlying population distribution shape (whether skewed, uniform, or bimodal), as sample size n n n increases ( n ≥ 30 n \ge 30 n ≥ 30 ), the sampling distribution of the sample mean X ˉ \bar{X} X ˉ approaches a Standard Normal distribution : X ˉ ∼ N ( μ , σ 2 n ) \bar{X} \sim N \left( \mu, \, \frac{\sigma^2}{n} \right) X ˉ ∼ N ( μ , n σ 2 ​ )

  • Standard Error of the Mean SE ( X ˉ ) = σ n \text{SE}(\bar{X}) = \frac{\sigma}{\sqrt{n}} SE ( X ˉ ) = n ​ σ ​
  • Operational Implications for Black Belts

Allows Black Belts to use normal-theory hypothesis tests ( Z Z Z -tests, t t t -tests) on sample averages even when raw individual process data is non-normal.

Explains why control charts for sample means ( X ˉ \bar{X} X ˉ ) exhibit smooth normal control limits.

Worked Central Limit Theorem Numerical Example

A high-volume order processing system has an underlying lead time distribution that is heavily right-skewed with a population mean μ = 14.0 hours \mu = 14.0\text{ hours} μ = 14.0 hours and standard deviation σ = 6.0 hours \sigma = 6.0\text{ hours} σ = 6.0 hours . A Black Belt audits a random sample of n = 36 n = 36 n = 36 orders.

What is the mean and standard error of the sample average X ˉ \bar{X} X ˉ ? μ X ˉ = μ = 14.0 hours \mu_{\bar{X}} = \mu = 14.0\text{ hours} μ X ˉ ​ = μ = 14.0 hours SE ( X ˉ ) = σ n = 6.0 36 = 6.0 6 = 1.0 hour \text{SE}(\bar{X}) = \frac{\sigma}{\sqrt{n}} = \frac{6.0}{\sqrt{36}} = \frac{6.0}{6} = 1.0\text{ hour} SE ( X ˉ ) = n ​ σ ​ = 36 ​ 6.0 ​ = 6 6.0 ​ = 1.0 hour

What is the probability that the sample average lead time X ˉ \bar{X} X ˉ exceeds 16.0 hours 16.0\text{ hours} 16.0 hours ?

Transform sample average to Z Z Z -score: Z = X ˉ − μ X ˉ SE ( X ˉ ) = 16.0 − 14.0 1.0 = + 2.00 Z = \frac{\bar{X} - \mu_{\bar{X}}}{\text{SE}(\bar{X})} = \frac{16.0 - 14.0}{1.0} = +2.00 Z = SE ( X ˉ ) X ˉ − μ X ˉ ​ ​ = 1.0 16.0 − 14.0 ​ = + 2.00

From standard normal tables, P ( Z > 2.00 ) = 1 − Φ ( 2.00 ) = 1 − 0.9772 = 0.0228 P(Z > 2.00) = 1 - \Phi(2.00) = 1 - 0.9772 = 0.0228 P ( Z > 2.00 ) = 1 − Φ ( 2.00 ) = 1 − 0.9772 = 0.0228 ( 2.28 % 2.28\% 2.28% ).

Conclusion : Although individual order lead times are heavily non-normal, the sample average of 36 orders follows a Normal distribution per the Central Limit Theorem, allowing precise probability calculations.

  • Basic Probability Concepts
  • The Body of Knowledge requires Black Belts to describe and interpret independence, mutually exclusive
  • events, the addition and multiplication rules, conditional probability, complementary probability, and

joint occurrence.

Definitions and rules

  • Concept Definition Rule
  • Complement The event does not occur P ( A ′ ) = 1 − P ( A ) P(A') = 1 - P(A) P ( A ′ ) = 1 − P ( A )
  • Mutually exclusive Both events cannot occur together P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0

Independent One event's occurrence does not change the other's probability P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A)P(B) P ( A ∩ B ) = P ( A ) P ( B )

Addition (general) Probability that A or B occurs P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )

Addition (mutually exclusive) P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )

Multiplication (general) Probability that A and B both occur P ( A ∩ B ) = P ( A ) P ( B ∣ A ) P(A \cap B) = P(A)P(B \mid A) P ( A ∩ B ) = P ( A ) P ( B ∣ A )

Multiplication (independent) P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A)P(B) P ( A ∩ B ) = P ( A ) P ( B )

Conditional Probability of A given that B occurred P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A \mid B) = \dfrac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ​

Mutually exclusive is not the same as independent , and confusing the two is the single most common

error on this topic. Two mutually exclusive events with non-zero probabilities are in fact strongly dependent : knowing that one occurred tells you with certainty that the other did not. Events cannot be

both mutually exclusive and independent unless one of them has probability zero.

Worked examples

Complement. A process has a first-pass yield of 0.94. The probability a unit requires rework is 1 − 0.94 = 0.06 1 - 0.94 = 0.06 1 − 0.94 = 0.06 .

Independent multiplication. Three independent operations have first-pass yields of 0.98, 0.95, and

0.99. The probability a unit passes all three untouched is 0.98 × 0.95 × 0.99 = 0.9217 0.98 \times 0.95 \times 0.99 = 0.9217 0.98 × 0.95 × 0.99 = 0.9217 . This is exactly the rolled throughput yield calculation, and it

depends on the independence assumption -- if a single upstream condition causes failures at more than one

station, the true RTY is different.

General addition. In a month, 12% of orders are late, 7% are incomplete, and 3% are both. The

probability an order has at least one problem is 0.12 + 0.07 − 0.03 = 0.16 0.12 + 0.07 - 0.03 = 0.16 0.12 + 0.07 − 0.03 = 0.16 . Failing to subtract the joint term double-counts the 3% and would give 0.19.

Conditional. Using the same figures, given that an order is late, the probability it is also

incomplete is P ( incomplete ∣ late ) = 0.03 / 0.12 = 0.25 P(\text{incomplete} \mid \text{late}) = 0.03/0.12 = 0.25 P ( incomplete ∣ late ) = 0.03/0.12 = 0.25 . Compare this with the

unconditional 7%: lateness and incompleteness are clearly not independent , which is itself a

diagnostic finding suggesting a common cause.

Dependent multiplication. A lot of 20 contains 3 defectives. Drawing two units without replacement,

the probability both are defective is 3 20 × 2 19 = 6 380 = 0.0158 \frac{3}{20} \times \frac{2}{19} = \frac{6}{380} = 0.0158 20 3 ​ × 19 2 ​ = 380 6 ​ = 0.0158 . The second factor changes because the first

draw altered the population -- this is the hypergeometric situation, and treating it as ( 3 / 20 ) 2 = 0.0225 (3/20)^2 = 0.0225 ( 3/20 ) 2 = 0.0225 overstates it by 42%.

  • Why it matters in practice
  • Independence underpins RTY, control chart run rules, and every t and F test. Correlated
  • observations -- consecutive units from the same setup, repeated measures on the same part -- violate it

and make significance tests overstate the evidence.

Conditional probability is the language of detection. In FMEA terms, the escape probability is P ( defect occurs ) × P ( not detected ∣ defect occurs ) P(\text{defect occurs}) \times P(\text{not detected} \mid \text{defect occurs}) P ( defect occurs ) × P ( not detected ∣ defect occurs ) , and treating those

two as independent when the same condition drives both understates the risk.

The complement rule is the fastest route to "at least one" problems. The probability of at least one

defect in n n n independent units is 1 − ( 1 − p ) n 1 - (1-p)^n 1 − ( 1 − p ) n , which is far easier than summing the individual cases.

Loading diagram... Taxonomy of Key Probability Distributions