A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Confidence Intervals (Rigorous Theory)

Research Depth 111 in the knowledge graph ☐ I know this ☆ Set as goal
725prerequisites beneath it
See this on the map →
Asymptotic Normality of the MLE→
confidence-intervals coverage inversion

Core Idea

A confidence interval [L(X), U(X)] has level 1-α if P(θ ∈ [L,U]) = 1-α for all θ (exact) or approximately (asymptotic). Intervals are constructed by inverting hypothesis tests or using pivotal quantities. Asymptotic CIs rely on the CLT and estimator asymptotics. Confidence is frequentist; different from Bayesian credible intervals.

Explainer

From the asymptotic normality of the MLE, you know that under regularity conditions √n(θ̂ - θ) →_d N(0, I(θ)-1), where I(θ) is the Fisher information. This gives the building block for interval estimation: an approximate normal pivot. A confidence interval [L(X), U(X)] is not a fixed interval with a probability attached to it — it is a random interval, a function of the data X, defined so that the probability of covering the true θ meets a specified level.

The formal definition makes the frequentist interpretation precise. We say [L(X), U(X)] has coverage probability 1-α if P_θ(θ ∈ [L(X), U(X)]) = 1-α for all θ in the parameter space. The subscript θ means: we are computing probability over the distribution of X when θ is the true parameter. In repeated sampling — draw a new dataset, compute a new interval, repeat — exactly 100(1-α)% of those intervals contain the true θ. No single computed interval carries a probability: once data is observed, L and U are fixed numbers and θ is a fixed (unknown) number. Either θ is in [L, U] or it is not. The 1-α confidence level describes the procedure's long-run performance, not any individual interval's uncertainty.

There are two standard constructions. The pivotal quantity approach finds a function Q(X, θ) whose distribution does not depend on θ, then inverts its probability statement into an interval. For example, if Q = (X̄ - μ)/(s/√n) ~ t_{n-1}, then P(-t_{α/2} ≤ Q ≤ t_{α/2}) = 1-α rearranges to P(X̄ - t_{α/2}·s/√n ≤ μ ≤ X̄ + t_{α/2}·s/√n) = 1-α. The test inversion approach is equivalent in theory: the 1-α confidence set for θ is exactly the set of parameter values θ₀ that would not be rejected by a level-α test at the observed data. These two constructions produce the same intervals and illuminate their connection to hypothesis testing.

The Bayesian credible interval looks superficially similar but is philosophically distinct. It treats θ as a random variable with a prior distribution, and gives P(θ ∈ interval | data) = 1-α using the posterior distribution. A 95% credible interval means exactly what naive intuition expects — 95% posterior probability — while a 95% confidence interval means long-run coverage. In practice the intervals often have similar numerical endpoints, especially in large samples or with diffuse priors. But they answer different questions: the frequentist confidence interval makes a claim about the procedure; the Bayesian credible interval makes a claim about the current posterior state of belief.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Fundamental Theorem of Calculus Part 1 → Fundamental Theorem of Calculus Part 2 → U-Substitution → Partial Fraction Decomposition for Integration → Improper Integrals - Convergence → Integral Test → P-Series → Comparison Test → Limit Comparison Test → Series Convergence Test Strategy → Power Series → Radius and Interval of Convergence → Taylor Series → Moment Generating Functions → Characteristic Functions → Convergence in Distribution → Stationary Distributions → Convergence of Markov Chains → Convergence in Probability → Almost Sure Convergence → Relationships Between Modes of Convergence → Weak Law of Large Numbers → Strong Law of Large Numbers → Central Limit Theorem (Rigorous via Characteristic Functions) → Maximum Likelihood Estimation (Theory) → Asymptotic Normality of the MLE → Confidence Intervals (Rigorous Theory)

Longest path: 112 steps · 725 total prerequisite topics

Prerequisites (1)

Leads To (0)

No topics depend on this one yet.