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.
Egorov's theorem
Statement
Let be a measure space with , and let be measurable. If -almost everywhere, then almost uniformly.
The finite-measure hypothesis is used exactly at the continuity-from-above step below.
Facts & Assumptions
Given: A finite measure space and measurable functions such that almost everywhere.
Almost-everywhere convergence means pointwise convergence off a measurable null set. (Convergence almost everywhere relative to a measure)
Almost-uniform convergence means that for every there is a measurable with such that uniformly on . (Almost uniform convergence)
If is a decreasing sequence of measurable sets and one has finite measure, then . (Continuity from above when one set has finite measure)
For measurable one has . (Finite and countable subadditivity of measures)
If are measurable, then . (Measures are monotone)
Proof
Let , and let be a measurable null set outside which . For put For fixed the sets decrease with , each lies in , and because outside only finitely many satisfy . Therefore [L3] and [L5] give So for each there is a least index with .
Put . Then [L4] and step 1.1 give If , then for every and every one has . Hence for any one may choose with and then gives . So uniformly on .
Since was arbitrary, step 2.1 is exactly [L2]. Therefore almost uniformly.
Depends on
Used by
- On a finite measure space, convergence in measure has an almost-uniformly convergent subsequence Corollary
- Egorov for xᵏ on the unit interval Example
- Assuming countable choice, simple approximants to a measurable function can be made uniformly convergent on a large closed set Lemma
- Implication table for the main modes of convergence on a finite measure space Remark
Dependency tree · two levels
14 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, 2nd ed., Theorem 2.33 (standard reference, not scraped)