How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Almost every point is a Lebesgue point of a locally integrable function
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
Let . Then the Lebesgue set of the class of has full Lebesgue measure.
Equivalently, for almost every ,
Facts & Assumptions
Given: The Axiom of Countable Choice and a locally integrable function on .
A point belongs to the Lebesgue set exactly when the averaged oscillation above tends to . (Lebesgue points and the Lebesgue set of an class)
A property holds almost everywhere when its exceptional set is contained in a measurable null set. (Measure-null sets and almost-everywhere statements relative to a measure)
The rationals are countably infinite, and the product of two at most countable sets is at most countable. ( is countably infinite, A product of two at most countable sets is at most countable)
Rationals are dense in the reals. (The rationals embed densely in the reals)
Under Countable Choice, is a complete measure on the Lebesgue sigma-algebra of (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume). Countable subadditivity gives for every sequence of measurable -null sets (Finite and countable subadditivity of measures).
If , then for almost every . (Lebesgue differentiation theorem on )
Proof
Let [L3, L5, L6, given, construct] By [L3], is countable. For each , the function is locally integrable, so [L6] and [L2] give a measurable -null set containing all exceptions such that for every . Put By [L5], is null.
Fix and let . By density [L4], choose [step 1.1, L4, algebra] with . Then for every , Taking and using step 1.1 gives Since is arbitrary, the limit is .
Step 2.1 holds for every , and is null. By [L1] and [L2], [L1, L2, step 1.1, step 2.1] the Lebesgue set of the class of has full measure.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Lebesgue points and the Lebesgue set of an $L^1_{loc}$ class
- Measure-null sets and almost-everywhere statements relative to a measure
- The rationals embed densely in the reals
- Assuming countable choice, $\mathcal{L}(\mathbb{R}^n)$ is a sigma-algebra containing every elementary set and $\lambda_n$ is a complete measure extending elementary volume
- Finite and countable subadditivity of measures
- A product of two at most countable sets is at most countable
- $\mathbb{Q}$ is countably infinite
- Lebesgue differentiation theorem on $\mathbb{R}^n$
Used by
- Piecewise-affine approximation of a measurable coefficient Example
- A finite interior ball chain propagates weak Harnack bounds Lemma
- Calderón–Zygmund decomposition at height λ Lemma
- Carleson signed tree weak one one estimate Lemma
- John-Nirenberg stopping cubes have geometric decay Lemma
- Moser iteration for positive supersolutions: negative-power and logarithmic comparison Lemma
- The fundamental lemma of the calculus of variations Lemma
- Abel means converge in Lᵖ, uniformly, and at Lebesgue points Theorem
- De Giorgi-Nash interior Holder regularity for divergence-form equations Theorem
- Differentiation holds along families shrinking nicely Theorem
- Fejer means converge at Lebesgue points Theorem
- L1 Fourier inversion with an integrable transform Theorem
- Lebesgue density theorem Theorem
- The measurable Riemann mapping theorem on the sphere Theorem
Dependency tree · two levels
58 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, 2nd ed., Theorem 3.20 (standard reference, not scraped)
- Walter Rudin, Real and Complex Analysis, 3rd ed., Theorem 7.7 (standard reference, not scraped)