Alphabeta Math
Session-authored (Fable 5 assisted)
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.

25 results · all verified · 13 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 12 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Modes of Convergence Egorov and Lusin

1 · Prerequisites

2 · Summary

This page fixes the core dictionary of measure-theoretic convergence modes used later in the library: almost-everywhere convergence, convergence in measure, almost uniform convergence, and convergence in L1. It then proves the exact finite-measure bridges among them, culminating in Riesz's subsequence theorem, Egorov's theorem, Lusin's theorem, and the finite-measure form of Vitali's convergence theorem.

The page is deliberately honest about where extra hypotheses are spent. Finite total measure is what turns almost-everywhere convergence into convergence in measure and what makes Egorov work; uniform integrability is what recovers L1 from convergence in measure; tightness is what restores that recovery on sigma-finite spaces. The false statements and the closing implication-table remark point every failed arrow to a concrete witness on the companion examples page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Convergence almost everywhere relative to a measure

Definition

Let (X,A,μ) be a measure space and let fn,f:XR be measurable. The sequence (fn) converges to f μ-almost everywhere when there is a measurable μ-null set N such that for every xXN the real sequence (fn(x)) converges to f(x).

Equivalently, (fn) converges to f μ-almost everywhere when the pointwise convergence statement fn(x)f(x) holds μ-almost everywhere in the sense of Measure-null sets and almost-everywhere statements relative to a measure.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-28Open item page →

Convergence in measure

Definition

Let (X,A,μ) be a measure space and let fn,f:XR be measurable. The sequence (fn) converges to f in measure when for every real ε>0,

μ({xX:fn(x)f(x)>ε})0.

Thus convergence in measure asks only that, for each fixed threshold ε, the measure of the bad set {fnf>ε} vanish as n.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-28Open item page →

Cauchy sequences in measure

Definition

Let (X,A,μ) be a measure space and let fn:XR be measurable for every nN. The sequence (fn) is Cauchy in measure when for every real ε>0, μ({xX:fn(x)fm(x)>ε})0 as m,n.

Equivalently: for every ε>0 and every η>0 there is NN such that m,nNμ({fnfm>ε})<η.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Almost uniform convergence

Definition

Let (X,A,μ) be a measure space and let fn,f:XR be measurable. The sequence (fn) converges to f almost uniformly when for every real ε>0 there is a measurable set EA with μ(E)<ε such that (fn) converges uniformly to f on XE.

In expanded quantifiers, this means that for every ε>0 there is a measurable E with μ(E)<ε such that (η>0)(NN)(nN)(xXE)fn(x)f(x)<η.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-28Open item page →

Convergence in L^1(mu)

Definition

Let (X,A,μ) be a measure space and let fn,fL1(μ) (The class L1(μ) of integrable functions). The sequence (fn) converges to f in L1(μ) when

fnfdμ0.

On this page L1(μ) is still the class of integrable representatives rather than the quotient by almost-everywhere equality, so the expression above is read on the functions themselves.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Convergence in measure determines the limit almost everywhere

Statement

Let (X,A,μ) be a measure space and let fn,f,g:XR be measurable. If fnf in measure and fng in measure, then f=g μ-almost everywhere.

Facts & Assumptions

Given: A measure space (X,A,μ), measurable functions fn,f,g:XR, and convergence in measure of (fn) to both f and g.

[L1]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L2]

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)

[L3]

For measurable (Ek) one has μ(kEk)k=0μ(Ek), and in particular μ(E0E1)μ(E0)+μ(E1). (Finite and countable subadditivity of measures)

Proof

technique · direct
1.1

For m1 put Em:={fg>1/m}, and for nN put An,m:={fnf>1/(2m)} and Bn,m:={fng>1/(2m)}. If xEm and xAn,mBn,m, then f(x)g(x)f(x)fn(x)+fn(x)g(x)1/m, a contradiction. So EmAn,mBn,m for every n,m. [given, L1, algebra] 2.1 Fix m1 and let η>0. By [L1] choose n so large that μ(An,m)<η/2 and μ(Bn,m)<η/2. Then step 1.1 and [L3] give μ(Em)μ(An,m)+μ(Bn,m)<η. Since η was arbitrary, μ(Em)=0. [step 1.1, L1, L3] 3.1 If f(x)g(x), then f(x)g(x)>1/m for some m1, so {fg}=m=1Em. Step 2.1 makes every Em null, hence [L3] gives μ({fg})=0. By [L2], f=g μ-almost everywhere. ∎

step 2.1L2L3
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Convergence in L^1(mu) implies convergence in measure

Statement

Let (X,A,μ) be a measure space and let fn,f:XR be measurable with fn,fL1(μ). If fnf in L1(μ), then fnf in measure.

Facts & Assumptions

Given: A measure space (X,A,μ), measurable real-valued integrable functions fn,fL1(μ), and convergence of (fn) to f in L1(μ).

[L1]

Convergence in L1(μ) means fnfdμ0. (Convergence in L^1(mu))

[L2]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L3]

For a nonnegative measurable function h and a real t>0, μ({ht})t1hdμ. (Chebyshev-Markov inequality for the integral)

Proof

technique · direct
1.1

Fix ε>0. Applying [L3] to h:=fnf and t:=ε gives μ({fnfε})ε1fnfdμ for every n.

L1L3algebra
2.1

By [L1], the right-hand side in step 1.1 tends to 0 as n. Hence μ({fnf>ε})0 for every ε>0, which is exactly [L2].

step 1.1L1L2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: convergence in L^1(mu) forces almost-everywhere convergence

Statement refuted

convergence in L1(μ) forces almost-everywhere convergence.

Facts & Assumptions

Given: Lebesgue measure on [0,1] and the dyadic typewriter sequence fn defined by f0:=0 and f2k+j:=χIk,jfor k0, 0j<2k, where Ik,j=[j2k,(j+1)2k) for j<2k1 and Ik,2k1=[12k,1].

[L1]

Convergence in L1(μ) means fnfdμ0. (Convergence in L^1(mu))

[L2]

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

Refutation

technique · direct
1.1

If 2kn<2k+1, then fn is the indicator of an interval of length 2k, so 01fndλ=2k0. Thus fn0 in L1([0,1]) by [L1].

givenL1algebra
1.2

Fix x[0,1]. For each k1 there is exactly one jk{0,,2k1} with xIk,jk, so f2k+jk(x)=1. Because the same generation contains other dyadic intervals as well, there are also infinitely many indices n with fn(x)=0. So (fn(x)) does not converge for any x[0,1].

given
2.1

Step 1.1 gives convergence in L1, while step 1.2 shows failure of pointwise convergence at every point and hence failure of [L2]. This refutes the claim.

step 1.1step 1.2L2
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Almost uniform convergence implies almost-everywhere convergence and convergence in measure

Statement

Let (X,A,μ) be a measure space and let fn,f:XR be measurable. If fnf almost uniformly, then fnf μ-almost everywhere and fnf in measure.

Facts & Assumptions

Given: A measure space (X,A,μ), measurable functions fn,f:XR, and almost-uniform convergence of (fn) to f.

[L1]

Almost-uniform convergence means that for every ε>0 there is a measurable E with μ(E)<ε such that fnf uniformly on XE. (Almost uniform convergence)

[L2]

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

[L3]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L4]

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

Proof

technique · direct
1.1

For each m1, [L1] gives a measurable set Em with μ(Em)<1/m such that fnf uniformly on XEm. Let N:=m=1Em. Since NEm for every m, [L4] gives μ(N)1/m for every m, hence μ(N)=0. If xXN, then xEm for some m, and uniform convergence on XEm implies fn(x)f(x). Therefore fnf almost everywhere by [L2].

L1L2L4
1.2

Fix ε>0 and η>0. By [L1] choose a measurable set E with μ(E)<η such that fnf uniformly on XE. Then there is N such that for nN and xXE one has fn(x)f(x)ε, so {fnf>ε}E. Hence μ({fnf>ε})μ(E)<η for nN. Since η was arbitrary, [L3] follows.

L1L3L4
2.1

Steps 1.1 and 1.2 prove the two asserted conclusions.

step 1.1step 1.2
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

On a finite measure space, almost-everywhere convergence implies convergence in measure

Statement

Let (X,A,μ) be a measure space with μ(X)<+, and let fn,f:XR be measurable. If fnf μ-almost everywhere, then fnf in measure.

Facts & Assumptions

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

[L1]

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

[L2]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L3]

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

[L4]

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

Proof

technique · direct
1.1

Fix ε>0, and let N be a measurable null set outside which fn(x)f(x). For r0 put Er:=nr{fnf>ε}. Then (Er) is a decreasing sequence of measurable sets, each contained in X, and r=0ErN because outside N only finitely many indices can satisfy fn(x)f(x)>ε.

givenL1
2.1

Because μ(X)<+, [L3] applies to (Er). The intersection in step 1.1 is null, so μ(Er)μ ⁣(r=0Er)=0. For each r one has {frf>ε}Er, hence by [L4] μ({frf>ε})μ(Er)0. This is exactly [L2].

step 1.1L2L3L4
3.1

Since ε>0 was arbitrary, the sequence converges in measure.

step 2.1L2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: almost-everywhere convergence implies convergence in measure on every measure space

Statement refuted

almost-everywhere convergence implies convergence in measure on every measure space.

Facts & Assumptions

Given: Lebesgue measure on R and the sequence fn:=χ[n,n+1].

[L1]

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

[L2]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

Refutation

technique · direct
1.1

Fix xR. If n>x+1, then x[n,n+1], so fn(x)=0. Thus fn(x)0 for every xR, hence almost everywhere by [L1].

givenL1
1.2

For every n one has {fn0>1/2}=[n,n+1], whose Lebesgue measure is 1. So the bad-set measures do not tend to 0, and [L2] fails.

givenL2
2.1

This single sequence satisfies the premise and violates the conclusion, so the claim is false.

step 1.1step 1.2
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

On a finite measure space, the truncated L^1 metric metrises convergence in measure

Statement

Let (X,A,μ) be a measure space with μ(X)<+. For measurable f,g:XR, define d(f,g):=min{fg,1}dμ.

Then:

  1. d(f,g)=0 exactly when f=g μ-almost everywhere, so d descends to a metric on almost-everywhere equivalence classes of measurable functions.
  2. For a sequence (fn) of measurable functions and a measurable f, d(fn,f)0 if and only if fnf in measure.

Facts & Assumptions

Given: A finite measure space (X,A,μ) and measurable functions f,g,h,fn:XR.

[L1]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L2]

For a measurable set E and a nonnegative measurable function u, Eudμ=uχEdμ. (Integral over a measurable subset)

[L3]

The nonnegative integral is monotone and homogeneous. (Monotonicity and nonnegative homogeneity of the nonnegative integral)

[L4]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere. (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere)

Proof

technique · direct
1.1

One has d(f,f)=0 and d(f,g)=d(g,f) by the pointwise identities min{ff,1}=0 and min{fg,1}=min{gf,1}. Also fhfg+gh implies min{fh,1}min{fg,1}+min{gh,1}, so [L3] gives d(f,h)d(f,g)+d(g,h).

L3algebra
1.2

Suppose d(fn,f)0. Fix ε>0 and put An:={fnf>ε}. On An one has min{fnf,1}min{ε,1}, so min{ε,1}μ(An)d(fn,f). Hence μ(An)0, which is exactly [L1].

L1L2L3algebra
1.3

Conversely, assume fnf in measure. Let ε(0,1) and put An:={fnf>ε}. Then d(fn,f)XAnεdμ+An1dμεμ(X)+μ(An). By [L1], μ(An)0, so lim supnd(fn,f)εμ(X). Since ε(0,1) was arbitrary and μ(X)<+, it follows that d(fn,f)0.

L1L2L3algebra
1.4

If d(f,g)=0, then [L4] applied to min{fg,1} shows min{fg,1}=0 almost everywhere, which is equivalent to f=g almost everywhere. Conversely, if f=g almost everywhere, then [L4] gives d(f,g)=0.

L4
2.1

Let [f] denote the almost-everywhere class of f. If ff and gg, then step 1.4 gives d(f,f)=d(g,g)=0, so step 1.1 yields d(f,g)d(f,f)+d(f,g)+d(g,g)=d(f,g). The same argument with the pairs reversed gives d(f,g)d(f,g), so d(f,g)=d(f,g). Thus the value d([f],[g]) is well defined and step 1.1 makes it a metric on the quotient.

step 1.1step 1.4algebra
3.1

Step 2.1 identifies the quotient metric, and steps 1.2 and 1.3 prove that its convergence is exactly convergence in measure. So the truncated distance metrises convergence in measure on finite measure spaces.

step 1.2step 1.3step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Riesz's subsequence theorem for convergence in measure

Statement

Let (X,A,μ) be a measure space and let fn,f:XR be measurable. If fnf in measure, then there is a strictly increasing sequence (nk)k0 of natural numbers such that fnkf μ-almost everywhere.

The construction below uses the least admissible index at each stage, so no choice principle is spent.

Facts & Assumptions

Given: A measure space (X,A,μ), measurable functions fn,f:XR, and convergence in measure of (fn) to f.

[L1]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L2]

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

[L3]

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

[L4]

If (Er) is a decreasing sequence of measurable sets and one Er0 has finite measure, then μ(rEr)=infrμ(Er). (Continuity from above when one set has finite measure)

Proof

technique · direct
1.1

For each k0, [L1] applied with ε:=2(k+1) yields an index after which μ({fnf>2(k+1)})<2(k+1). Define n0 to be the least admissible index for k=0, and recursively define nk+1 to be the least admissible index larger than nk. Then (nk)k0 is strictly increasing and μ({fnkf>2(k+1)})<2(k+1)(k0).

L1choose
2.1

Put Ak:={fnkf>2(k+1)} and Er:=krAk. Then (Er) is a decreasing sequence of measurable sets, and step 1.1 together with [L3] gives μ(Er)k=rμ(Ak)k=r2(k+1)=2r. In particular μ(E0)1<+.

step 1.1L3algebra
3.1

Let N:=r=0Er. By [L4] and step 2.1, μ(N)=limrμ(Er)=0. If xXN, then xEr for some r, hence xAk for every kr. Therefore fnk(x)f(x)2(k+1) for all kr, so fnk(x)f(x). By [L2], fnkf almost everywhere.

step 2.1L2L4
4.1

The subsequence constructed in step 1.1 has the required almost-everywhere limit.

step 3.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Convergence in L^1(mu) has an almost-everywhere convergent subsequence

Statement

Let (X,A,μ) be a measure space and let fn,f:XR be measurable with fn,fL1(μ). If fnf in L1(μ), then some subsequence of (fn) converges to f μ-almost everywhere.

Facts & Assumptions

Given: A measure space (X,A,μ), measurable real-valued integrable functions fn,fL1(μ), and convergence of (fn) to f in L1(μ).

[L1]

Convergence in L1(μ) implies convergence in measure. (Convergence in L^1(mu) implies convergence in measure)

[L2]

Convergence in measure has a subsequence converging almost everywhere to the same limit. (Riesz's subsequence theorem for convergence in measure)

Proof

technique · direct
1.1

By [L1], the sequence (fn) converges to f in measure.

L1
2.1

Apply [L2] to step 1.1. The resulting subsequence converges to f almost everywhere.

step 1.1L2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

FALSE: convergence in measure implies almost-everywhere convergence

Statement refuted

convergence in measure implies almost-everywhere convergence.

Facts & Assumptions

Given: Lebesgue measure on [0,1] and the dyadic typewriter sequence fn defined by f0:=0 and f2k+j:=χIk,jfor k0, 0j<2k, where Ik,j=[j2k,(j+1)2k) for j<2k1 and Ik,2k1=[12k,1].

[L1]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L2]

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

Refutation

technique · direct
1.1

If 2kn<2k+1, then fn is the indicator of an interval of length 2k. Hence for every ε(0,1), λ({fn0>ε})=2k0, so fn0 in measure by [L1].

givenL1algebra
2.1

Fix x[0,1]. In each dyadic generation there is exactly one interval containing x, so fn(x)=1 infinitely often; the same generation also contains intervals missing x, so fn(x)=0 infinitely often. Therefore (fn(x)) has no limit for any x[0,1], and [L2] fails.

step 1.1L2
3.1

This refutes the claim.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Cauchy sequences in measure converge in measure

Statement

Let (X,A,μ) be a measure space and let fn:XR be measurable. If (fn) is Cauchy in measure, then there is a measurable f:XR such that fnf in measure.

Facts & Assumptions

Given: A measure space (X,A,μ) and a measurable sequence fn:XR that is Cauchy in measure.

[L1]

Cauchy in measure means that for every real ε>0 and every η>0 there is N such that m,nNμ({fnfm>ε})<η. (Cauchy sequences in measure)

[L2]

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

[L3]

If (Er) is a decreasing sequence of measurable sets and one Er0 has finite measure, then μ(rEr)=infrμ(Er). (Continuity from above when one set has finite measure)

[L4]

A uniformly Cauchy sequence of real-valued functions on a set converges uniformly to some real-valued function on that set. (A sequence of real-valued functions converges uniformly if and only if it is uniformly Cauchy)

[L5]

For a measurable set E, the indicator 1E is measurable. (An indicator function is measurable exactly when its set is measurable)

[L6]

Products of measurable real-valued functions are measurable. (Arithmetic and lattice operations preserve measurability whenever they are defined)

[L8]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

Proof

technique · direct
1.1

For each k0, [L1] with ε=η=2(k+1) gives an index Nk such that m,nNkμ({fnfm>2(k+1)})<2(k+1). Choose a strictly increasing sequence (nk)k0 with nkNk for every k. Then nnkμ({fnfnk>2(k+1)})<2(k+1).

L1choose
2.1

For k0 put Ak:={fnk+1fnk>2(k+1)}, Er:=krAk, and Gr:=XEr. Step 1.1 gives μ(Ak)<2(k+1), so μ(Er)k=r2(k+1)=2r. Thus μ(E0)1<+, the sets Er decrease with r, and [L3] gives μ ⁣(r=0Er)=0. Call this null set N.

step 1.1L2L3algebra
3.1

Fix r0. If xGr and m>r, then xAj for every jr, so fnj+1(x)fnj(x)2(j+1) for j=,,m1. Therefore fnm(x)fn(x)j=m12(j+1)2. Hence the tail (fnkGr)kr is uniformly Cauchy on Gr, so [L4] gives a function gr:GrR with fnkGrgr uniformly on Gr.

step 2.1L4algebra
4.1

By [L5], 1Gr is measurable. Since each fnk is measurable, [L6] makes uk,r:=fnk1Gr measurable on X. For xGr one has uk,r(x)=fnk(x)gr(x), while for xGr all uk,r(x)=0. So [L7] gives a measurable function hr:XR such that hr=gr on Gr and hr=0 on Er. The sets Gr increase and cover XN, and on overlaps the limits agree, so (hr(x))r0 stabilizes for every x. Define f(x):=limrhr(x). By [L7] again, f is measurable.

step 3.1L5L6L7construct
5.1

Fix k0 and nnk. If xGk, then step 4.1 makes f(x)=gk(x), so letting m in step 3.1 with =k gives fnk(x)f(x)2k. Hence on Gk, fn(x)f(x)fn(x)fnk(x)+2k. Therefore {fnf>32(k+1)}{fnfnk>2(k+1)}Ek. Step 1.1 makes the first set have measure below 2(k+1), and step 2.1 gives μ(Ek)2k. So μ({fnf>32(k+1)})<32(k+1)(nnk).

step 1.1step 2.1step 3.1step 4.1algebra
6.1

Given ε,η>0, choose k with 32(k+1)<min{ε,η}. Then for nnk, μ({fnf>ε})μ({fnf>32(k+1)})<η. This is exactly [L8].

step 5.1L8choose
7.1

The measurable function f from step 4.1 is the limit of (fn) in measure.

step 4.1step 6.1L8
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Egorov's theorem

Statement

Let (X,A,μ) be a measure space with μ(X)<+, and let fn,f:XR be measurable. If fnf μ-almost everywhere, then fnf 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:XR such that fnf 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 fnf uniformly on XE. (Almost uniform convergence)

[L3]

If (En) is a decreasing sequence of measurable sets and one En0 has finite measure, then μ(nEn)=infnμ(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 AB are measurable, then μ(A)μ(B). (Measures are monotone)

Proof

technique · direct
1.1

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

L1L3L5choose
2.1

Put E:=m=1Ek(m),m. Then [L4] and step 1.1 give μ(E)m=1μ(Ek(m),m)<m=1ε2m=ε. If xXE, then for every m1 and every jk(m) one has fj(x)f(x)1/m. Hence for any η>0 one may choose m with 1/m<η and then jk(m) gives fj(x)f(x)<η. So fnf uniformly on XE.

step 1.1L4algebra
3.1

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

step 2.1L2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: Egorov's theorem holds on every measure space

Statement refuted

Egorov's theorem holds on every measure space.

Facts & Assumptions

Given: Lebesgue measure on R and the sequence fn:=χ[n,n+1].

[L2]

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

Refutation

technique · direct
1.1

For each fixed xR one has fn(x)=0 for all n>x+1, so fn(x)0 pointwise on R.

given
2.1

Let ER be measurable with λ(E)<+. If [n,n+1]E for infinitely many n, then λ(E)1=+, impossible. Hence infinitely many indices n satisfy [n,n+1]⊈E, so for each such n there is xn[n,n+1]E with fn(xn)=1. Therefore supxREfn(x)01 for infinitely many n, and the convergence cannot be uniform on RE. Thus [L2] fails.

step 1.1L2algebra
3.1

So pointwise almost-everywhere convergence does not force almost-uniform convergence on this infinite-measure space. The claim is false.

step 1.1step 2.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

On a finite measure space, convergence in measure has an almost-uniformly convergent subsequence

Statement

Let (X,A,μ) be a measure space with μ(X)<+, and let fn,f:XR be measurable. If fnf in measure, then some subsequence of (fn) converges to f almost uniformly.

Facts & Assumptions

Given: A finite measure space (X,A,μ) and measurable functions fn,f:XR such that fnf in measure.

[L1]

Convergence in measure has a subsequence converging almost everywhere to the same limit. (Riesz's subsequence theorem for convergence in measure)

[L2]

On a finite measure space, almost-everywhere convergence implies almost-uniform convergence. (Egorov's theorem)

Proof

technique · direct
1.1

By [L1], there is a subsequence (fnk) converging to f almost everywhere.

L1
2.1

Apply [L2] to the subsequence from step 1.1. It converges to f almost uniformly.

step 1.1L2
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Assuming countable choice, simple functions are continuous on a large closed core

Statement

Assume the Axiom of Countable Choice.

Let n1, let ERn be Lebesgue measurable with λn(E)<+, and let s:ER be a simple measurable function. Then for every ε>0 there is a closed set FE such that λn(EF)<ε and sF is continuous.

Facts & Assumptions

Given: The Axiom of Countable Choice, a Lebesgue measurable set ERn of finite measure, a simple measurable function s:ER, and a real ε>0.

[L1]

If the distinct values of s are c1,,cm and Ej:=s1({cj}), then the sets Ej are measurable, pairwise disjoint, their union is E, and s=j=1mcj1Ej. (A simple function and its canonical representation)

[L2]

Assuming countable choice, every Lebesgue measurable subset of Rn has compact subsets of arbitrarily close measure from inside. (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets)

[L3]

For measurable (Ak) one has μ(kAk)k=0μ(Ak). (Finite and countable subadditivity of measures)

Proof

technique · direct
1.1

Let c1,,cm be the distinct values of s, and let Ej:=s1({cj}). By [L1], the sets Ej are measurable, pairwise disjoint, and cover E. For each j choose a compact set KjEj with λn(EjKj)<ε/m. This is possible by [L2].

L1L2choose
2.1

Put F:=j=1mKj. Each Kj is closed in Rn, so the finite union F is closed and lies in E. Also EF=j=1m(EjKj), so [L3] and step 1.1 give λn(EF)j=1mλn(EjKj)<ε.

step 1.1L3algebra
3.1

Fix xF. By step 1.1, x lies in exactly one Kj. In the subspace F, the set Kj=FijKi is open because the other Ki are closed and finite in number. On that neighbourhood Kj, the restriction sF is constant with value cj. So sF is locally constant at every point of F, hence continuous.

step 1.1step 2.1
4.1

The closed set F from step 2.1 has λn(EF)<ε, and step 3.1 makes sF continuous.

step 2.1step 3.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Assuming countable choice, simple approximants to a measurable function can be made uniformly convergent on a large closed set

Statement

Assume the Axiom of Countable Choice.

Let n1, let ERn be Lebesgue measurable with λn(E)<+, and let f:ER be bounded and measurable. Then for every ε>0 there are a closed set FE and simple functions sm:ER such that

  1. λn(EF)<ε;
  2. each restriction smF is continuous;
  3. smf uniformly on F.

Facts & Assumptions

Given: The Axiom of Countable Choice, a bounded measurable function f:ER on a finite Lebesgue-measure set ERn, and a real ε>0.

[L1]

Every measurable function admits simple approximations sm with smf for every m and sm(x)f(x) for every x. (Every measurable function admits simple approximations dominated by its absolute value)

[L2]

On a finite measure space, almost-everywhere convergence implies almost-uniform convergence. (Egorov's theorem)

[L3]

Assuming countable choice, every Lebesgue measurable subset of Rn has compact subsets of arbitrarily close measure from inside. (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets)

[L4]

Every simple measurable function on a finite-measure Lebesgue set is continuous on a large closed core. (Assuming countable choice, simple functions are continuous on a large closed core)

[L5]

For measurable (Ak) one has μ(kAk)k=0μ(Ak). (Finite and countable subadditivity of measures)

Proof

technique · direct
1.1

By [L1], choose simple functions sm:ER with smf and sm(x)f(x) for every xE. Since λn(E)<+, [L2] gives a measurable set GE with λn(EG)<ε/2 such that smf uniformly on G.

L1L2choose
1.2

By [L3], choose a compact set KG with λn(GK)<ε/4. For each m1, apply [L4] to sm with tolerance ε2m3, obtaining a closed set FmE such that λn(EFm)<ε2m3 and smFm is continuous.

L3L4choose
2.1

Put F:=Km=1Fm. Then F is closed, FKGE, and EF(EG)(GK)m=1(EFm). So [L5] together with steps 1.1 and 1.2 gives λn(EF)<ε2+ε4+m=1ε2m3<ε. Because FG, the convergence smf remains uniform on F. And because FFm, each smF is continuous as a restriction of smFm.

step 1.1step 1.2L5algebra
3.1

The closed set F and the simple approximants sm satisfy all three assertions.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Assuming countable choice, Lusin's theorem on finite-measure subsets of R^n

Statement

Assume the Axiom of Countable Choice.

Let n1, let ERn be Lebesgue measurable with λn(E)<+, and let f:ER be measurable. Then for every ε>0 there exist a real M>0 and a closed set FEf1([M,M]) such that λn(EF)<ε and fF is continuous. In particular, fF is bounded.

Facts & Assumptions

Given: The Axiom of Countable Choice, a measurable function f:ER on a Lebesgue measurable set ERn with λn(E)<+, and a real ε>0.

[L1]

Measurability means preimages of Borel sets are measurable. (A measurable function between measurable spaces)

[L2]

Measures are continuous from below on increasing measurable sets. (Continuity from below for measures)

[L3]

Assuming countable choice, for bounded measurable functions on finite-measure Lebesgue sets there is a large closed set on which simple approximants are continuous and converge uniformly to the function. (Assuming countable choice, simple approximants to a measurable function can be made uniformly convergent on a large closed set)

[L5]

For measurable (Ak) one has μ(kAk)k=0μ(Ak). (Finite and countable subadditivity of measures)

Proof

technique · direct
1.1

For m1, put Em:=Ef1([m,m]). Because [m,m] is a Borel subset of R, [L1] makes every Em measurable. The sets Em increase with m, and their union is all of E because f is real-valued. So [L2] gives λn(E)=supm1λn(Em). Choose M1 with λn(EEM)<ε/2.

L1L2choose
2.1

On EM one has fM, so fEM is bounded. Apply [L3] to the bounded measurable function fEM with tolerance ε/2. This gives a closed set FEM and simple functions sm:EMR such that λn(EMF)<ε/2, each smF is continuous, and smfEM uniformly on F. By [L4], fF is continuous.

step 1.1L3L4
3.1

Because FEME, one has EF=(EEM)(EMF). Hence [L5] together with steps 1.1 and 2.1 gives λn(EF)<ε/2+ε/2=ε. The set F also lies in Ef1([M,M]) by step 1.1.

step 1.1step 2.1L5algebra
4.1

The set F and the bound M satisfy the theorem.

step 2.1step 3.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Assuming countable choice and dependent choice, a measurable function on a finite-measure subset of R^n agrees there, off a small set, with a continuous function on R^n

Statement

Assume the Axiom of Countable Choice and the Axiom of Dependent Choice. Let n1, let ERn be Lebesgue measurable with λn(E)<+, and let f:ER be measurable. Then for every ε>0 there are a continuous function g:RnR and a closed set FE such that λn(EF)<εandg(x)=f(x) for every xF.

In particular, λn({xE:g(x)f(x)})<ε.

Facts & Assumptions

Given: The Axiom of Countable Choice, dependent choice, a measurable function f:ER on a finite-measure Lebesgue set ERn, and a real ε>0.

[L1]

Assuming countable choice, Lusin's theorem gives a real M>0 and a closed set FEf1([M,M]) such that λn(EF)<ε and fF is continuous. (Assuming countable choice, Lusin's theorem on finite-measure subsets of R^n)

[L2]

Assuming dependent choice, every continuous map from a closed subspace of a normal space into a closed interval [a,b] extends continuously to the whole space. (Tietze's extension theorem, under dependent choice: a continuous map from a closed subspace of a normal space into [a,b] extends continuously to the whole space, and this property characterises normality)

Proof

technique · direct
1.1

By [L1], choose M>0 and a closed set FEf1([M,M]) with λn(EF)<ε such that fF:F[M,M] is continuous.

L1choose
2.1

By [L3], Rn is a metric space, so [L4] makes it normal. Apply [L2] to the closed subspace FRn and to the interval [M,M]. This gives a continuous function g:Rn[M,M] with gF=fF.

step 1.1L2L3L4
3.1

Since g=f on F, one has {xE:g(x)f(x)}EF. Therefore λn({xE:g(x)f(x)})<ε. The function g and the closed set F satisfy the corollary.

step 1.1step 2.1algebra
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Assuming countable choice, on a bounded measurable set, Lusin's closed core can be chosen compact

Statement

Assume the Axiom of Countable Choice.

Let n1, let ERn be Lebesgue measurable with λn(E)<+, and suppose E is bounded. Let f:ER be measurable. Then for every ε>0 there is a compact set KE such that λn(EK)<ε and fK is continuous.

Facts & Assumptions

Given: The Axiom of Countable Choice, a bounded Lebesgue measurable set ERn of finite measure, a measurable function f:ER, and a real ε>0.

[L1]

Assuming countable choice, Lusin's theorem gives a closed set FE with λn(EF)<ε such that fF is continuous. (Assuming countable choice, Lusin's theorem on finite-measure subsets of R^n)

Proof

technique · direct
1.1

By [L1], choose a closed set FE with λn(EF)<ε such that fF is continuous.

L1choose
2.1

Because FE and E is bounded, the set F is bounded. Since F is also closed in Rn, [L2] makes F compact.

step 1.1L2
3.1

Taking K:=F proves the claim.

step 2.1
False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

FALSE: assuming countable choice, Lusin's theorem says measurable functions are continuous off a null set

Statement refuted

Assume the Axiom of Countable Choice.

Lusin's theorem says measurable functions are continuous off a null set.

Facts & Assumptions

Given: The Axiom of Countable Choice and the Dirichlet function D:=1Q[0,1]:[0,1]R.

[L1]

Assuming countable choice, Lusin's theorem provides large closed sets on which a measurable real-valued function is continuous. (Assuming countable choice, Lusin's theorem on finite-measure subsets of R^n)

[L2]

Refutation

technique · direct
1.1

The function D is measurable and, by [L1], for every ε>0 there is a closed set F[0,1] with λ([0,1]F)<ε such that DF is continuous.

L1
1.2

Fix x[0,1]. By [L2], every neighbourhood of x contains both a rational point q and an irrational point u. Then D(q)=1 and D(u)=0, so D is not continuous at x. Thus D is nowhere continuous on [0,1].

L2
2.1

Step 1.1 is exactly Lusin's conclusion, while step 1.2 shows that no null set deletion can make D continuous at the remaining points as a function on [0,1]. So the stated reading of Lusin's theorem is false.

step 1.1step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-28Open item page →

A uniformly integrable family

Definition

Let (X,A,μ) be a measure space. A family FL1(μ) of integrable real-valued functions is uniformly integrable when supfF{f>M}fdμ0as M.

Equivalently, for every ε>0 there is M>0 such that fF{f>M}fdμ<ε.

This page adopts the tail-integral definition. On finite measure spaces it is equivalent to L1-boundedness plus uniform absolute continuity, proved later on this page.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

On a finite measure space, uniform integrability is equivalent to L^1-boundedness plus uniform absolute continuity

Statement

Let (X,A,μ) be a measure space with μ(X)<+, and let FL1(μ) be a family of integrable real-valued functions. Then the following are equivalent:

  1. F is uniformly integrable;
  2. supfFfdμ<+ and for every ε>0 there is δ>0 such that μ(E)<δsupfFEfdμ<ε.

Facts & Assumptions

Given: A finite measure space (X,A,μ) and a family FL1(μ).

[L1]

Uniform integrability means that for every ε>0 there is M>0 such that fF{f>M}fdμ<ε. (A uniformly integrable family)

Proof

technique · direct
1.1

Assume F is uniformly integrable. Applying [L1] with ε:=1 gives M>0 such that {f>M}fdμ<1 for every fF. Then fdμ{fM}fdμ+{f>M}fdμMμ(X)+1, so F is L1-bounded.

L1algebra
1.2

Conversely, assume F is L1-bounded by some constant C, and assume the stated uniform absolute continuity. Let ε>0, and choose δ>0 such that μ(E)<δsupfFEfdμ<ε. Choose M>C/δ. For fF, put Ef:={f>M}. Then Mμ(Ef)fdμC, so μ(Ef)<δ and hence {f>M}fdμ=Effdμ<ε. Since this bound is uniform in f, [L1] holds.

L1algebra
2.1

Still under step 1.1, let ε>0. Use [L1] with ε/2 to choose M>0 such that {f>M}fdμ<ε/2 for every fF, and put δ:=ε/(2M+1). If μ(E)<δ, then for every fF, EfdμE{fM}fdμ+{f>M}fdμMμ(E)+ε/2<ε. So F has the stated uniform absolute continuity.

step 1.1L1algebra
3.1

Steps 1.1 and 2.1 prove that uniform integrability implies clause 2, and step 1.2 proves the converse implication.

step 1.1step 2.1step 1.2
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Dominated families are uniformly integrable

Statement

Let (X,A,μ) be a measure space. If FL1(μ) and there is a nonnegative function gL1(μ) such that fg almost everywhere for every fF, then F is uniformly integrable.

Facts & Assumptions

Given: A measure space (X,A,μ), a family FL1(μ), and a nonnegative integrable function g with fg almost everywhere for every fF.

[L1]

If gL1(μ) and ε>0, then there is δ>0 such that μ(E)<δEgdμ<ε. (Absolute continuity of the integral)

[L2]

If h:X[0,+] is measurable and t>0, then μ({ht})t1hdμ. (Chebyshev-Markov inequality for the integral)

[L3]

If two integrable functions are equal almost everywhere, then their integrals over every measurable set agree. (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree)

[L4]

For a measurable set E and a nonnegative measurable function u, Eudμ=uχEdμ. (Integral over a measurable subset)

Proof

technique · direct
1.1

Let ε>0. Use [L1] for g to choose δ>0 such that μ(E)<δ implies Egdμ<ε. Since gL1(μ), choose M>δ1gdμ. Then [L2] applied to h:=g gives μ({gM})M1gdμ<δ, and so [L1] yields {gM}gdμ<ε.

L1L2choosealgebra
2.1

Fix fF, and choose a measurable null set Nf such that fg on XNf. Put uf:=fχXNf. Then uf is integrable, uf=f almost everywhere, and ufχ{f>M}gχ{gM} pointwise. Therefore [L3], [L4], and [L5] give {f>M}fdμ={f>M}ufdμ{gM}gdμ<ε. Since the same M works for every fF, this is exactly uniform integrability.

step 1.1L3L4L5construct
3.1

The family F is uniformly integrable.

step 2.1L1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: uniform integrability implies domination by one integrable function

Statement refuted

uniform integrability implies domination by one integrable function.

Facts & Assumptions

Given: On [0,1] with Lebesgue measure, the pairwise disjoint intervals Ik:=[ak,ak+12k2), where ak:=j=1k112j2, and the functions fk:=kχIk.

[L1]

Uniform integrability means that for every ε>0 there is M>0 such that {fk>M}fkdμ<ε for every k. (A uniformly integrable family)

Refutation

technique · direct
1.1

The intervals Ik are pairwise disjoint and lie in [0,1] because k=112k2<1. Also fkdλ=kλ(Ik)=12k.

L1algebra
2.1

If M>0 and kM, then {fk>M}=; if k>M, then {fk>M}=Ik and {fk>M}fkdλ=12k12M+2. Therefore the family (fk) is uniformly integrable by [L1].

step 1.1L1algebra
2.2

If an integrable function g satisfied gfk almost everywhere for every k, then ggk almost everywhere on Ik. Since the intervals are pairwise disjoint, gdλk=1Ikgdλk=1kλ(Ik)=k=112k=+, contradicting integrability of g. Hence no single integrable majorant exists.

step 1.1algebra
3.1

This uniformly integrable family is not dominated by any integrable function, so the claim is false.

step 2.1step 2.2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-28Open item page →

A tight family of integrable functions

Definition

Let (X,A,μ) be a measure space. A family FL1(μ) of integrable real-valued functions is tight when for every ε>0 there is a measurable set EA with μ(E)<+ such that

supfFXEfdμ<ε.

On a finite measure space every family is automatically tight by taking E=X, so tightness matters only on infinite spaces.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Vitali convergence theorem on finite and sigma-finite measure spaces

Statement

Let (X,A,μ) be a measure space, let fn:XR be measurable with fnL1(μ) for every n, and let f:XR be measurable.

  1. If μ(X)<+, then fnf in L1(μ) if and only if fnf in measure and the family {fn:nN} is uniformly integrable.
  2. If μ is sigma-finite and fnf in measure, and the family {fn:nN} is uniformly integrable and tight, then fL1(μ) and fnf in L1(μ).

Facts & Assumptions

Given: Integrable real-valued functions fnL1(μ) and a measurable f:XR.

[L1]

Convergence in measure means that for every real ε>0, μ({fnf>ε})0. (Convergence in measure)

[L2]

Convergence in L1(μ) means fnfdμ0. (Convergence in L^1(mu))

[L3]

On a finite measure space, uniform integrability is equivalent to L1-boundedness plus uniform absolute continuity. (On a finite measure space, uniform integrability is equivalent to L^1-boundedness plus uniform absolute continuity)

[L4]

Convergence in L1(μ) implies convergence in measure. (Convergence in L^1(mu) implies convergence in measure)

[L5]

Convergence in measure has a subsequence converging almost everywhere. (Riesz's subsequence theorem for convergence in measure)

[L6]

If gL1(μ) and ε>0, then there is δ>0 such that μ(E)<δEgdμ<ε. (Absolute continuity of the integral)

[L7]

For nonnegative measurable functions un, lim infnundμlim infnundμ. (Fatou's lemma)

[L8]

A family is tight when for every ε>0 there is a measurable set E of finite measure such that supnXEfndμ<ε. (A tight family of integrable functions)

Proof

technique · direct
1.1

Assume μ(X)<+ and fnf in L1(μ). By [L4], the sequence converges to f in measure. To prove uniform integrability, it suffices by [L3] to show L1-boundedness and uniform absolute continuity. For L1-boundedness, choose N so that fnfdμ<1 for nN. Then fndμfdμ+1 for nN, and the finitely many initial terms may be absorbed into one larger bound.

L2L3L4algebra
1.2

Still on a finite measure space, assume fnf in measure and the family {fn} is uniformly integrable. By [L3], the family is L1-bounded and uniformly absolutely continuous on small sets. By [L5], some subsequence fnk converges to f almost everywhere. Fatou's lemma [L7] then gives fdμlim infkfnkdμ<+, so fL1(μ).

L3L5L7algebra
2.1

Still under step 1.1, let ε>0. Choose N so that fnfdμ<ε/2 for nN. Apply [L6] to f and to the finitely many functions f0,,fN1, and let δ be the minimum of the resulting positive numbers. Then μ(E)<δ implies Efndμ<ε for every n<N, while for nN one has EfndμEfdμ+fnfdμ<ε. So [L3] yields uniform integrability.

L2L3L6choosealgebra
2.2

Let ε>0. Choose δ>0 such that μ(E)<δ implies both supnEfndμ<ε/3 and Efdμ<ε/3; the first uses step 1.2 together with [L3], and the second uses [L6]. Choose η>0 with ημ(X)<ε/3. Since fnf in measure, there is N such that μ(Bn)<δ for nN, where Bn:={fnf>η}. Then for nN, fnfdμBnfndμ+Bnfdμ+XBnηdμ<ε. So fnf in L1(μ).

step 1.2L1L2L3L6choosealgebra
3.1

Assume now that μ is sigma-finite, that fnf in measure, and that the family {fn} is uniformly integrable and tight. Let ε>0. By [L8], choose a measurable set E with μ(E)<+ and supnXEfndμ<ε/4. Because fnf in measure on X, the restricted sequence converges in measure on E as well, and uniform integrability persists on E. Therefore step 2.2 applied on the finite measure space E gives fEL1(μ) and Efnfdμ0. By [L5], after passing to a subsequence if necessary we may assume fnkf almost everywhere on X. Applying [L7] to the nonnegative functions fnk1XE gives XEfdμlim infkXEfnkdμε/4. Hence fL1(μ). For all large n one has Efnfdμ<ε/2, and then fnfdμEfnfdμ+XEfndμ+XEfdμ<ε. So fnf in L1(μ).

step 2.2L5L7L8choosealgebra
4.1

Step 1.1 proves the forward finite implication, steps 1.2 and 2.2 prove the reverse finite implication, and step 3.1 proves the sigma-finite tight form.

step 1.1step 2.1step 1.2step 2.2step 3.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Dominated convergence is a Vitali corollary

Statement

Let (X,A,μ) be a sigma-finite measure space. Let fn:XR be measurable, let gL1(μ) be nonnegative, and suppose fng almost everywhere for every n and fnf almost everywhere. Then fL1(μ) and fnf in L1(μ).

Facts & Assumptions

Given: A sigma-finite measure space (X,A,μ), measurable functions fn,f:XR, and a nonnegative integrable function g with fng almost everywhere and fnf almost everywhere.

[L1]

A dominated family is uniformly integrable. (Dominated families are uniformly integrable)

[L2]

On a sigma-finite measure space, convergence in measure together with uniform integrability and tightness implies convergence in L1. (Vitali convergence theorem on finite and sigma-finite measure spaces)

[L3]

On a finite measure space, almost-everywhere convergence implies convergence in measure. (On a finite measure space, almost-everywhere convergence implies convergence in measure)

[L4]

If h:X[0,+] is measurable and t>0, then μ({ht})t1hdμ. (Chebyshev-Markov inequality for the integral)

[L5]

For an increasing sequence of nonnegative measurable functions, the integrals increase to the integral of the limit. (Monotone convergence for the integral)

[L6]

If two integrable functions are equal almost everywhere, then their integrals over every measurable set agree. (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree)

[L7]

Sigma-finiteness means that X=mXm for some measurable sets Xm of finite measure. (Finite, sigma-finite, and semifinite measures)

[L8]

For a measurable set E and a nonnegative measurable function u, Eudμ=uχEdμ. (Integral over a measurable subset)

[L10]

Countable unions of null sets are null. (Finite and countable subadditivity of measures)

Proof

technique · direct
1.1

Let N be a null set outside which fn(x)f(x), and for each nN let Nn be a null set outside which fng. Put N:=Nn=0Nn. By [L10], the set N is null. On XN one has fn(x)f(x) for every x and fn(x)g(x) for every n, so also f(x)g(x) there.

L10construct
1.2

By [L1], the family {fn:nN} is uniformly integrable.

L1
2.1

By [L7], choose measurable sets Ym of finite measure with X=mYm, and put Xm:=j=0mYj. Then Xm is measurable of finite measure, XmX, and hence gχXmg. Fact [L5] gives Xmgdμgdμ, so XXmgdμ0. Fix ε>0 and choose m with XXmgdμ<ε. For each n, put un,m:=fnχ(XXm)N. Then un,m=fnχXXm almost everywhere and un,mgχXXm pointwise, so [L6], [L8], and [L9] give XXmfndμ=XXmun,mdμXXmgdμ<ε. So the family {fn} is tight.

step 1.1L5L6L7L8L9algebra
2.2

Let ε,η>0. Choose m so that XXmgdμ<εη/8. On the finite measure space Xm, step 1.1 and [L3] make fnf in measure. Define hn:=fnfχ(XXm)N. Then {hn>ε}={fnf>ε}((XXm)N), and hn2gχXXm pointwise. Since N is null, μ({fnf>ε}(XXm))=μ({hn>ε}). Therefore [L4], [L8], and [L9] give μ({fnf>ε}(XXm))ε1XXmhndμ2εXXmgdμ<η/4. Combining this with convergence in measure on Xm shows fnf in measure on all of X.

step 1.1L3L4L8L9choosealgebra
3.1

Step 1.2 gives uniform integrability, step 2.1 gives tightness, and step 2.2 gives convergence in measure. Applying [L2] yields fL1(μ) and fnf in L1(μ).

step 1.2step 2.1step 2.2L2
RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-08-28Open item page →

Implication table for the main modes of convergence on a finite measure space

On a finite measure space, the page establishes the following implication picture for the four main convergence modes it develops.

fromtostatusreason or witness
almost uniformalmost everywhereprovedAlmost uniform convergence implies almost-everywhere convergence and convergence in measure
almost uniformin measureprovedAlmost uniform convergence implies almost-everywhere convergence and convergence in measure
almost everywherein measureprovedOn a finite measure space, almost-everywhere convergence implies convergence in measure
in L1in measureprovedConvergence in L^1(mu) implies convergence in measure
in measure + uniform integrabilityin L1provedVitali convergence theorem on finite and sigma-finite measure spaces
in measurealmost everywherefalsethe typewriter sequence on [0,1]
in L1almost everywherefalsethe same typewriter sequence
in measurein L1falsethe spikes f0=0 and fn=nχ(0,1/n) for n1
almost everywherein L1falsethe same spike sequence

Two companion observations matter just as much as the table.

The companion examples page still spells out the same concrete witnesses: the typewriter sequence, the translated unit intervals on R, the spike family f0=0, fn=nχ(0,1/n) for n1, the explicit Egorov core for xk, the Dirichlet-function Lusin core, and the uniformly integrable but non-dominated disjoint-spike family.

5 · Examples, counterexamples and false statements

None yet.

Sources