Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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 (X,A,μ) be a measure space with μ(X)<+∞, and let fn,f:X→R be measurable. If fn→f μ-almost everywhere, then fn→f almost uniformly.

The finite-measure hypothesis is used exactly at the continuity-from-above step below.

Facts & Assumptions

Given: A finite measure space (X,A,μ) and measurable functions fn,f:X→R such that fn→f almost everywhere.

[L1]

Almost-everywhere convergence means pointwise convergence off a measurable null set. (Convergence almost everywhere relative to a measure)

[L2]

Almost-uniform convergence means that for every ε>0 there is a measurable E with μ(E)<ε such that fn→f uniformly on X∖E. (Almost uniform convergence)

[L3]

If (En) is a decreasing sequence of measurable sets and one En0 has finite measure, then μ(⋂nEn)=inf⁡nμ(En). (Continuity from above when one set has finite measure)

[L4]

For measurable (Ek) one has μ(⋃kEk)≤∑k=0∞μ(Ek). (Finite and countable subadditivity of measures)

[L5]

If A⊆B are measurable, then μ(A)≤μ(B). (Measures are monotone)

Proof

technique · direct
1.1L1L3L5choose

Let ε>0, and let N be a measurable null set outside which fn(x)→f(x). For m,k≥1 put Ek,m:=⋃j≥k{∣fj−f∣>1/m}. For fixed m the sets Ek,m decrease with k, each lies in X, and ⋂k=1∞Ek,m⊆N because outside N only finitely many j satisfy ∣fj(x)−f(x)∣>1/m. Therefore [L3] and [L5] give μ(Ek,m)↓μ ⁣(⋂k=1∞Ek,m)=0. So for each m≥1 there is a least index k(m) with μ(Ek(m),m)<ε2−m.

2.1step 1.1L4algebra

Put E:=⋃m=1∞Ek(m),m. Then [L4] and step 1.1 give μ(E)≤∑m=1∞μ(Ek(m),m)<∑m=1∞ε2−m=ε. If x∈X∖E, then for every m≥1 and every j≥k(m) one has ∣fj(x)−f(x)∣≤1/m. Hence for any η>0 one may choose m with 1/m<η and then j≥k(m) gives ∣fj(x)−f(x)∣<η. So fn→f uniformly on X∖E.

3.1step 2.1L2∎

Since ε>0 was arbitrary, step 2.1 is exactly [L2]. Therefore fn→f almost uniformly.

Depends on

Used by

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