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

Null Sets and Almost Everywhere

Research Depth 78 in the knowledge graph ☐ I know this ☆ Set as goal
18topics build on this
365prerequisites beneath it
See this on the map →
Measurable Sets and σ-Algebra PropertiesMeasure Spaces→→Dominated Convergence TheoremRadon-Nikodym Theorem+1 more
measure-theory null-sets

Core Idea

A set has measure zero (is null) if μ(A) = 0. A property holds almost everywhere (a.e.) if the set where it fails is null. This allows us to ignore 'small' sets and treat functions differing on a null set as equivalent.

How It's Best Learned

Observe that single points in ℝ have Lebesgue measure zero, as do all countable sets. See how Lp spaces identify functions equal almost everywhere.

Common Misconceptions

Null sets are not necessarily empty; the Cantor set has measure zero but is uncountable. 'Almost every' quantification must be formalized via measures, not classical logic.

Explainer

From your prerequisite, you know that a measure space is a triple (X, Σ, μ) where Σ is a σ-algebra of measurable sets and μ assigns non-negative sizes to those sets. A null set is simply a measurable set A ∈ Σ with μ(A) = 0. The name suggests these sets are "negligible" or "invisible" to the measure, and that intuition is exactly right: a null set contributes nothing to any integral and can be safely ignored in most analytic arguments.

The key example to anchor this is Lebesgue measure on ℝ. A single point {x₀} has Lebesgue measure zero, as does any finite collection of points, and by countable additivity, any countable set — including all the rational numbers ℚ, which are dense in ℝ but form a measure-zero set. This already shows that "measure zero" does not mean "sparse" in the topological sense: ℚ is dense yet negligible. More dramatically, the Cantor set is an uncountable subset of [0,1] with Lebesgue measure zero. Null sets can be large from a cardinality perspective while remaining invisible to integration.

The phrase almost everywhere (a.e.) means "at every point except possibly a null set." If a property P(x) holds a.e., then {x : P(x) fails} is a null set. For example, we say two functions f and g are equal almost everywhere (f = g a.e.) if {x : f(x) ≠ g(x)} has measure zero. This is the key equivalence relation underlying Lᵖ spaces: in L²([0, 1]), the functions f(x) = 0 and g(x) = 𝟏_{x=1/2}(x) (which differs from zero only at one point) are identified because they differ only on a null set.

The practical power of the almost-everywhere concept is that it allows you to ignore countably many exceptional points — discontinuities, singularities, individual bad values — without affecting integrals or limiting arguments. When you prove that a sequence of functions converges, saying it converges a.e. is often the strongest natural statement you can make. The big convergence theorems you will see next — such as the Dominated Convergence Theorem — operate in this language: hypotheses and conclusions are stated a.e., which is exactly the right granularity for Lebesgue integration.

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 → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Cardinality and Countability → Sigma-Algebras and Measurable Sets → Measurable Sets and σ-Algebra Properties → Measure Spaces → Null Sets and Almost Everywhere

Longest path: 79 steps · 365 total prerequisite topics

Prerequisites (2)

Leads To (3)