Skip to main content

Hypothesis Testing

  • Understand the concept of hypothesis testing.
  • Differentiate between null and alternative hypotheses.
  • Learn about significance levels, p-values, and decision rules.
  • Identify and minimize Type I and Type II errors.
  • Perform hypothesis tests and interpret results.

Definition of Hypothesis Testing

Hypothesis testing is a statistical method used to make decisions about population parameters based on sample data.

A hypothesis is an assumption that we test using statistical techniques.

Types of Hypotheses and Errors

Hypothesis testing involves two competing hypotheses:

  • Null Hypothesis (\( H_0 \)): Assumes no effect or no difference. It is what we test against.
  • Alternative Hypothesis (\( H_a \)): Represents a significant effect or difference.

There are two types of errors in hypothesis testing:

Type of Error Definition
Type I Error (False Positive) Rejecting \( H_0 \) when it is actually true.
Type II Error (False Negative) Failing to reject \( H_0 \) when \( H_a \) is true.

p-Value and Significance Level

The p-value is the probability of obtaining a result as extreme as the observed one, assuming \( H_0 \) is true.

  • If \( p \)-value \( \leq \alpha \) (significance level), reject \( H_0 \).
  • If \( p \)-value \( > \alpha \), fail to reject \( H_0 \).

Common Significance Levels:

Significance Level (\( \alpha \)) Confidence Level
0.10 90%
0.05 95%
0.01 99%

Interpretation of p-Values

The smaller the p-value, the stronger the evidence against \( H_0 \).

  • p-value \( > 0.05 \): Weak evidence against \( H_0 \), fail to reject.
  • p-value \( < 0.05 \): Moderate evidence against \( H_0 \), reject \( H_0 \).
  • p-value \( < 0.01 \): Strong evidence against \( H_0 \), reject \( H_0 \).

Steps in Hypothesis Testing

The process of hypothesis testing follows these steps:

  1. State \( H_0 \) and \( H_a \).
  2. Choose a significance level \( \alpha \).
  3. Collect and summarize data.
  4. Compute the test statistic.
  5. Find the p-value and compare it with \( \alpha \).
  6. Make a decision: Reject \( H_0 \) if \( p \leq \alpha \), otherwise fail to reject.

Visualization of Hypothesis Testing

Examples

Example 1: A factory claims that its light bulbs last 1000 hours on average. A sample of 50 bulbs has a mean lifespan of 950 hours with a standard deviation of 80 hours. Test the claim at \( \alpha = 0.05 \).

Step 1: Hypotheses

  • \( H_0: \mu = 1000 \)
  • \( H_a: \mu < 1000 \) (one-tailed test)

Step 2: Compute Test Statistic

\[ z = \frac{\bar{x} - \mu}{\sigma/\sqrt{n}} = \frac{950 - 1000}{80/\sqrt{50}} = -3.94 \]

Step 3: Decision

  • From the z-table, \( P(Z < -3.94) = 0.00004 \).
  • Since \( p < 0.05 \), reject \( H_0 \).

Exercises

  • Question 1: A coffee shop claims its coffee contains 250 mg of caffeine. A sample of 36 cups has a mean of 245 mg and a standard deviation of 15 mg. Test the claim at \( \alpha = 0.01 \).
  • Question 2: A drug manufacturer claims their medication reduces blood pressure by 10 mmHg. A study finds a mean reduction of 9.2 mmHg with a standard deviation of 2.5 mmHg in 40 patients. Test at \( \alpha = 0.05 \).
  • Question 3: A school claims students study an average of 3 hours per day. A sample of 50 students shows a mean of 2.8 hours and a standard deviation of 0.9 hours. Test at \( \alpha = 0.05 \).
  • Answer 1: \( p = 0.043 \), fail to reject \( H_0 \).
  • Answer 2: \( p = 0.067 \), fail to reject \( H_0 \).
  • Answer 3: \( p = 0.015 \), reject \( H_0 \).

This Week's Best Picks from Amazon

Please see more curated items that we picked from Amazon here .

Popular posts from this blog

LU Decomposition

LU Decomposition: A Step-by-Step Guide LU Decomposition, also known as LU Factorization, is a method of decomposing a square matrix into two triangular matrices: a lower triangular matrix L and an upper triangular matrix U . This is useful for solving linear equations, computing determinants, and inverting matrices efficiently. What is LU Decomposition? LU Decomposition expresses a matrix A as: \[ A = LU \] where: L is a lower triangular matrix with ones on the diagonal. U is an upper triangular matrix. Step-by-Step Process Consider the matrix: \[ A = \begin{bmatrix} 2 & 3 & 1 \\ 4 & 7 & 3 \\ 6 & 18 & 5 \end{bmatrix} \] Step 1: Initialize L as an Identity Matrix Start with an identity matrix for \( L \): \[ L = \begin{bmatrix} 1 & 0 & 0 \\ 0 ...

Gaussian Elimination: A Step-by-Step Guide

Gaussian Elimination: A Step-by-Step Guide Gaussian Elimination is a systematic method for solving systems of linear equations. It works by transforming a given system into an equivalent one in row echelon form using a sequence of row operations. Once in this form, the system can be solved efficiently using back-substitution . What is Gaussian Elimination? Gaussian elimination consists of two main stages: Forward Elimination: Convert the system into an upper triangular form. Back-Substitution: Solve for unknowns starting from the last equation. Definition of a Pivot A pivot is the first nonzero entry in a row when moving from left to right. Pivots are used to eliminate the elements below them, transforming the system into an upper triangular form. Step-by-Step Example Consider the system of equations: \[ \begin{aligned} 2x + 3y - z &= 5 \\ 4x + y...

Vector Spaces and Linear Transformation

Vector Spaces and Linear Transformations A vector space is a set of vectors that satisfies specific properties under vector addition and scalar multiplication. Definition of a Vector Space A set \( V \) is called a vector space over a field \( \mathbb{R} \) (real numbers) if it satisfies the following properties: Closure under addition: If \( \mathbf{u}, \mathbf{v} \in V \), then \( \mathbf{u} + \mathbf{v} \in V \). Closure under scalar multiplication: If \( \mathbf{v} \in V \) and \( c \in \mathbb{R} \), then \( c\mathbf{v} \in V \). Associativity: \( (\mathbf{u} + \mathbf{v}) + \mathbf{w} = \mathbf{u} + (\mathbf{v} + \mathbf{w}) \). Commutativity: \( \mathbf{u} + \mathbf{v} = \mathbf{v} + \mathbf{u} \). Existence of a zero vector: There exists a vector \( \mathbf{0} \) such that \( \mathbf{v} + \mathbf{0} = \mathbf{v} \). Existence of additive inverses: For eac...