Alphabeta Math
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.

✓ 18 results · all verified · 5 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 13 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Measurable Functions and Simple Approximation

1 · Prerequisites

2 · Summary

Measurability is fixed first as a relation between two sigma-algebras, with the extended real line carrying its Borel sigma-algebra and real Euclidean targets carrying the usual Borel structure. From that point the page proves the three practical criteria used everywhere later: generators suffice, threshold sets suffice, and sequential suprema, infima, limsup, liminf, and pointwise limits preserve measurability.

The second half turns those abstract criteria into the approximation machinery used by integration. Nonnegative measurable functions admit explicit increasing simple approximants, general measurable functions admit dominated simple approximants, completion-measurable functions have base-measurable representatives, and the Doob-Dynkin lemma identifies exactly what it means for a function to be measurable with respect to the sigma-algebra generated by another one.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Measurability is relative to sigma-algebras on both domain and codomain

In a measurable space Measurable spaces and measurable sets, the word measurable never belongs to a function by itself. It belongs to a function together with a source sigma-algebra and a target sigma-algebra. On this page the target on R or R‾ is always the Borel sigma-algebra, not the Lebesgue sigma-algebra.

That convention is load-bearing. A Lebesgue measurable function on Rn means

f:(Rn,L(Rn))→(Rm,B(Rm)),

not a map into (Rm,L(Rm)). The distinction is exactly what makes the later counterexample g \circ f with g merely Lebesgue measurable possible.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

The Borel sigma-algebra on the extended real line

Definition

The extended real line is

R‾:=R∪{−∞,+∞}

with the total order extending the usual order on R and satisfying −∞<x<+∞ for every real x (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined).

Its Borel sigma-algebra is the Borel sigma-algebra of that ordered topological line in the sense of The Borel sigma-algebra of a topological space. On this page it is denoted B(R‾) and is generated by the rays

{ (a,+∞]:a∈R }.

In particular, {+∞} and {−∞} are Borel sets.

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

A measurable function between measurable spaces

Definition

Let (X,A) and (Y,B) be measurable spaces (Measurable spaces and measurable sets). A function f:X→Y is measurable when

f−1(B)∈Afor every B∈B.

Equivalently, the family

Cf:={ B⊆Y:f−1(B)∈A }

is a sigma-algebra on Y containing B.

PropositionStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

An indicator function is measurable exactly when its set is measurable

Statement

Let (X,A) be a measurable space and let E⊆X. The indicator function

1E(x):={1,x∈E,0,x∉E

is measurable as a map X→R if and only if E∈A.

Facts & Assumptions

Given: A measurable space (X,A), a subset E⊆X, and the indicator function 1E.

[L1]

A function is measurable exactly when the preimage of every measurable set in the codomain is measurable in the domain. (A measurable function between measurable spaces)

Proof

technique · direct
1.1givenL1

If E∈A, then the preimage of any Borel set B⊆R under 1E is one of ∅, X, E, or X∖E, because 1E takes only the values 0 and 1. Each of those sets lies in A, so 1E is measurable by [L1].

1.2givenL1

If 1E is measurable, then E=1E−1((1/2,∞)). The interval (1/2,∞) is Borel, so [L1] gives E∈A.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the equivalence.

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

Borel measurable and Lebesgue measurable functions on Rn

Definition

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), so Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume makes L(Rn) a sigma-algebra. Let n,m∈N with n,m≥1.

When m=1, these are the corresponding notions for real-valued functions.

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

The positive and negative parts of a function

Definition

Let f:X→R‾ with R‾ as in The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined. Its positive part and negative part are

f+:=max⁡{f,0},f−:=max⁡{−f,0}.

Pointwise, both functions take values in [0,+∞], and one has

f=f+−f−,∣f∣=f++f−.

At each point at least one of f+ and f− is zero.

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

A simple function and its canonical representation

Definition

Let (X,A) be a measurable space. A function s:X→R is simple when it is measurable and its range is finite.

If the distinct values taken by s are c1,…,cm, define

Ej:=s−1({cj})(1≤j≤m).

Then the measurable sets E1,…,Em are pairwise disjoint, their union is X, and

s=∑j=1mcj1Ej.

This expression is the canonical representation of s: the coefficients are the distinct values of s, and the sets are its level sets.

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

The sigma-algebra generated by a function

Definition

Let f:X→Y be a function and assume the target Y carries a Borel sigma-algebra B(Y).

The sigma-algebra generated by f is

σ(f):={ f−1(B):B∈B(Y) }.

Because preimages preserve complements and countable unions, this is a sigma-algebra on X. It is the smallest sigma-algebra on X that makes f measurable.

RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-08-27Open item page →

The convention 0⋅∞=0 is used only for pointwise products of measurable functions

On this page the symbol fg for two R‾-valued measurable functions is a pointwise definition, not a limit rule. At points where one factor is 0 and the other is infinite, we set

0⋅(+∞)=0⋅(−∞)=0.

This convention exists only so that decompositions such as f=f+−f− and the measurable-product theorem stay pointwise total on the extended reals. It does not contradict Null times divergent has no rule: xk=1/k with yk=ck gives product limit c, and with yk=k2 gives divergence, because that counterexample concerns limits of ordinary real products, not the value of a pointwise formula.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

A generating family on the codomain suffices to test measurability

Statement

Let (X,A) and (Y,B) be measurable spaces, let G⊆P(Y) generate B, and let f:X→Y be a function. If

f−1(G)∈Afor every G∈G,

then f is measurable as a map (X,A)→(Y,B).

Facts & Assumptions

Given: Measurable spaces (X,A) and (Y,B), a function f:X→Y, and a generating family G for B.

[L1]

A function is measurable exactly when the preimage of every measurable set in the codomain is measurable in the domain. (A measurable function between measurable spaces)

Proof

technique · direct
1.1L1algebra

Let

C:={ B⊆Y:f−1(B)∈A }.

Preimages preserve complements and countable unions, so C is a sigma-algebra on Y. [L1, algebra]

2.1givenstep 1.1

By hypothesis, every member of G lies in C. Since [given, step 1.1] B is the sigma-algebra generated by G, one has B⊆C.

3.1step 2.1L1∎

Therefore f−1(B)∈A for every B∈B, and [step 2.1, L1] [L1] says exactly that f is measurable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Threshold characterisations of real-valued and extended-real-valued measurability

Statement

Let (X,A) be a measurable space and let f:X→R‾. The following are equivalent:

  1. f is measurable;
  2. {x:f(x)>a}∈A for every real a;
  3. {x:f(x)≥a}∈A for every real a;
  4. {x:f(x)<a}∈A for every real a;
  5. {x:f(x)≤a}∈A for every real a.

Moreover, in any one of conditions 2 through 5 it is enough to test only rational thresholds a∈Q.

Facts & Assumptions

Given: A measurable space (X,A) and a function f:X→R‾.

[L1]

The Borel sigma-algebra on R‾ is generated by the rays (a,+∞] with a∈R. (The Borel sigma-algebra on the extended real line)

[L2]

A generating family on the codomain suffices to test measurability. (A generating family on the codomain suffices to test measurability)

[L3]

Between any two distinct real numbers there lies a rational number. (The rationals embed densely in the reals)

Proof

technique · direct
1.1L1L2

By [L1], the threshold set {x:f(x)>a} is the preimage [L1, L2] f−1((a,+∞]). Therefore [L2] gives the equivalence of condition 1 and condition 2.

1.2

Suppose the sets {f>q} are measurable for every rational q. For a [L3, algebra] real a,

{f≤a}=X∖{f>a},{f<a}=X∖{f≥a}.

So conditions 2 and 5 are equivalent, and conditions 3 and 4 are equivalent. [step 1.1, algebra]

2.1step 1.1algebra

For every real a,

{f≥a}=⋂n=1∞{f>a−1/n},{f>a}=⋃n=1∞{f≥a+1/n},

so conditions 2 and 3 are equivalent. Combining this with steps 1.1 and 1.2 shows that conditions 1 through 5 are all equivalent. [step 1.1, step 1.2, algebra]

2.2step 1.1algebra

For every real a,

{f>a}=⋃q∈Q, q>a{f>q}.

Indeed, f(x)>q>a implies f(x)>a, and if f(x)>a then [L3] gives a rational q with a<q<f(x) unless f(x)=+∞, in which case any rational q>a works. Thus the real-threshold version of condition 2 follows from the rational one. The converse is immediate, so in condition 2 it is enough to test only rational thresholds. [L3, algebra]

3.1step 2.1step 2.2step 1.2∎

The equivalences from steps 2.1 and 2.2 transfer the rational-threshold [step 2.1, step 2.2, step 1.2] reduction of step 1.2 to conditions 3 through 5. Therefore in any one of conditions 2 through 5 it is enough to test only rational thresholds.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Continuous functions on Euclidean spaces are Borel measurable

Statement

Assume the Axiom of Countable Choice. Let n,m≥1. Every continuous map f:Rn→Rm is Borel measurable in the sense of Borel measurable and Lebesgue measurable functions on Rn.

Facts & Assumptions

Given: The Axiom of Countable Choice, natural numbers n,m≥1, and a continuous function f:Rn→Rm.

[L1]

A continuous map has Borel preimages of Borel sets. (A continuous map has Borel preimages of Borel sets)

Proof

technique · direct
1.1L1

Let B⊆Rm be Borel. By [L1], the preimage [L1] f−1(B) is a Borel subset of Rn.

2.1step 1.1∎

By the definition of Borel measurability on Euclidean spaces, step 1.1 says [step 1.1] exactly that f is Borel measurable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Every monotone real function is Borel measurable

Facts & Assumptions

Given: A monotone function f:R→R.

[L1]

A real-valued function is measurable exactly when all of its threshold sets {x:f(x)>a} are measurable. (Threshold characterisations of real-valued and extended-real-valued measurability)

Proof

technique · direct
1.1given

Suppose first that f is increasing. For each real a, the threshold set [given] Ea:={x:f(x)>a} is upward closed: if x∈Ea and y>x, then f(y)≥f(x)>a, so y∈Ea. Therefore Ea is one of the four Borel sets ∅, R, (c,∞), or [c,∞) for some real c.

2.1step 1.1L1algebra∎

Every set named in step 1.1 is Borel, so [L1] gives that every increasing [step 1.1, L1, algebra] real function is measurable. If f is decreasing, then −f is increasing and hence measurable by the first half, and therefore f is measurable as well.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

A map into Rn is measurable exactly when its coordinates are measurable

Statement

Let n≥1, let (X,A) be a measurable space, and let f=(f1,…,fn):X→Rn. Then f is measurable if and only if each coordinate function fj:X→R is measurable.

Facts & Assumptions

Given: A natural number n≥1, a measurable space (X,A), and a function f=(f1,…,fn):X→Rn.

[L2]

A generating family on the codomain suffices to test measurability. (A generating family on the codomain suffices to test measurability)

[L3]

Real-valued measurability is equivalent to threshold measurability. (Threshold characterisations of real-valued and extended-real-valued measurability)

Proof

technique · direct
1.1L3given

Suppose f is measurable. Fix j and a real a. Then

{x:fj(x)>a}=f−1 ⁣(Rj−1×(a,∞)×Rn−j).

The displayed strip is open, hence Borel in Rn, so the preimage is measurable. By [L3], each coordinate fj is measurable. [L3, given]

1.2

Conversely, suppose every coordinate fj is measurable. Let [L1, L3, algebra] B=∏j=1n(aj,bj) be a rational open box. Then

f−1(B)=⋂j=1n{x:aj<fj(x)<bj},

and each factor on the right is measurable by [L3]. Therefore f−1(B)∈A for every rational open box B. [L1, L3, algebra]

2.1step 1.1step 1.2L1L2∎

By [L1] and [L2], step 1.2 implies that f is measurable. Together with [step 1.1, step 1.2, L1, L2] step 1.1, this proves the equivalence.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

Composition with a Borel measurable outer map preserves measurability

Statement

Let (X,A), (Y,B), and (Z,C) be measurable spaces. If f:(X,A)→(Y,B) is measurable and g:(Y,B)→(Z,C) is measurable, then g∘f:(X,A)→(Z,C) is measurable.

In particular, if f is measurable and g is a Borel measurable function on its codomain, then g∘f is measurable.

Facts & Assumptions

Given: Measurable spaces (X,A), (Y,B), (Z,C), a measurable map f:X→Y, and a measurable map g:Y→Z.

[L1]

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

Proof

technique · direct
1.1givenL1

Let C∈C. Since g is measurable, [L1] gives [given, L1] g−1(C)∈B.

2.1step 1.1L1

Since f is measurable, [L1] applied again gives

(g∘f)−1(C)=f−1(g−1(C))∈A.

So g∘f is measurable. [step 1.1, L1] ∎

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Arithmetic and lattice operations preserve measurability whenever they are defined

Statement

Let (X,A) be a measurable space and let f,g:X→R‾ be measurable. Then:

  1. cf is measurable for every real scalar c;
  2. max⁡(f,g), min⁡(f,g), ∣f∣, f+, and f− are measurable;
  3. if f+g is pointwise defined, then f+g is measurable;
  4. with the convention of The convention 0⋅∞=0 is used only for pointwise products of measurable functions, the pointwise product fg is measurable.

Facts & Assumptions

Given: A measurable space (X,A) and measurable functions f,g:X→R‾.

[L1]

Extended-real measurability is equivalent to measurability of the threshold sets {h>a}. (Threshold characterisations of real-valued and extended-real-valued measurability)

[L2]

The positive and negative parts are h+=max⁡(h,0) and h−=max⁡(−h,0). (The positive and negative parts of a function)

[A1]

In this proof, the pointwise product uses the page convention 0⋅(+∞)=0⋅(−∞)=0.

Proof

technique · direct
1.1givenL1

Scalar multiples are measurable. If c>0, then {cf>a}={f>a/c}; if c<0, then {cf>a}={f<a/c}; and if c=0, the function is constant. So [L1] gives measurability of cf, and in particular of −f.

2.1step 1.1L1L2

The threshold identities [step 1.1, L1, L2] {max⁡(f,g)>a}={f>a}∪{g>a},{min⁡(f,g)>a}={f>a}∩{g>a} show via [L1] that max⁡(f,g) and min⁡(f,g) are measurable. By [L2], this proves measurability of f+ and f−; replacing g by −f also gives ∣f∣=max⁡(f,−f). [step 1.1, L1, L2].

3.1step 2.1L1

Assume f+g is pointwise defined. For every real a, [step 2.1, L1] {f+g>a}=⋃q∈Q({f>q}∩{g>a−q}). The inclusion from right to left is immediate. For the converse, if f(x)+g(x)>a then either f(x)=+∞, in which case any rational q>a−g(x) works, or f(x) is finite and one may choose a rational q with a−g(x)<q<f(x). Thus [L1] gives measurability of f+g. [step 2.1, L1].

4.1step 3.1L1A1

Suppose first that u,v:X→[0,+∞] are nonnegative and measurable. [step 3.1, L1, A1] If a<0, then {uv>a}=X. If a≥0, then {uv>a}=⋃q∈Q, q>0({u>q}∩{v>a/q}). Again the inclusion from right to left is immediate. For the converse, if u(x)v(x)>a, choose a rational q with 0<q<u(x) and a/q<v(x); this is possible because either u(x) is finite positive and the rationals are dense, or u(x)=+∞, in which case any sufficiently large positive rational works. Hence nonnegative products are measurable by [L1]. [step 3.1, L1, A1].

5.1step 2.1step 3.1step 4.1L2A1

For general measurable f and g, step 2.1 gives measurable nonnegative [step 2.1, step 3.1, step 4.1, L2, A1] functions f+,f−,g+,g−. By step 4.1 the four products f+g+,f−g−,f+g−,f−g+ are measurable. Put h+:=f+g++f−g−,h−:=f+g−+f−g+. At each point, at least one of h+ and h− is zero, because at least one of f+,f− and at least one of g+,g− is zero. So the difference h+−h− is pointwise defined without the forbidden ∞−∞ form, and step 3.1 makes it measurable. By the usual sign decomposition, h+−h−=fg, with the convention [A1] at the 0⋅∞ points. [step 2.1, step 3.1, step 4.1, L2, A1].

6.1step 1.1step 2.1step 3.1step 4.1step 5.1∎

Steps 1.1 through 5.1 prove all four claims. [step 1.1, step 2.1, step 3.1, step 4.1, step 5.1].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable

Statement

Let (X,A) be a measurable space and let fn:X→R‾ be measurable for every n∈N. Then the functions

sup⁡nfn,inf⁡nfn,lim sup⁡nfn,lim inf⁡nfn

are measurable. The set

{ x:lim⁡nfn(x) exists in R‾ }

is measurable. In particular, if fn→f pointwise, then f is measurable.

Facts & Assumptions

Given: A measurable space (X,A) and measurable functions fn:X→R‾ for n∈N.

[L1]

Threshold measurability characterizes extended-real measurability. (Threshold characterisations of real-valued and extended-real-valued measurability)

[L2]

For each x, the limsup and liminf of the sequence (fn(x)) satisfy

lim sup⁡nfn(x)=inf⁡nsup⁡k≥nfk(x),lim inf⁡nfn(x)=sup⁡ninf⁡k≥nfk(x),

Proof

technique · direct
1.1

Let s(x):=sup⁡nfn(x) and i(x):=inf⁡nfn(x). Then for every real [L1, given] a,

{s>a}=⋃n{fn>a},{i>a}=⋃q∈Q, q>a ⋂n{fn>q}.

Since each threshold set on the right is measurable, [L1] gives measurability of s and i. [L1, given]

2.1step 1.1L2

For each n, the tail functions [step 1.1, L2] sn(x):=sup⁡k≥nfk(x) and in(x):=inf⁡k≥nfk(x) are measurable by step 1.1. Applying step 1.1 again to the sequences (sn) and (in) and then using [L2] yields measurability of lim sup⁡nfn and lim inf⁡nfn.

3.1

Let u:=lim sup⁡nfn and v:=lim inf⁡nfn. The equality set [step 2.1, L1, L2] {u=v} is measurable because

{u=v}=⋂q∈Q(({u>q}∩{v>q})∪({u≤q}∩{v≤q})).

If u(x)<v(x) or v(x)<u(x), a rational strictly between them separates the two sides; if u(x)=v(x), every rational lies on the same side of both values. So [L2] makes the pointwise-convergence set measurable. [step 2.1, L1, L2]

4.1step 2.1step 3.1L2∎

If fn→f pointwise, then [L2] gives [step 2.1, step 3.1, L2] f=lim sup⁡nfn=lim inf⁡nfn. Since step 2.1 has already proved that both limiting functions are measurable, f is measurable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

Every nonnegative measurable function admits an explicit increasing sequence of simple approximations

Statement

Let (X,A) be a measurable space and let f:X→[0,+∞] be measurable. For k∈N define

sk:=∑j=0k2k−1j2−k 1{j2−k≤f<(j+1)2−k}+k 1{f≥k}.

Then each sk is a simple measurable function,

0≤sk≤sk+1≤f,

and sk(x)→f(x) for every x∈X. If E⊆X is a set on which f≤M<+∞, then sk→f uniformly on E.

Facts & Assumptions

Given: A measurable space (X,A), a measurable function f:X→[0,+∞], and the dyadic truncations sk displayed above.

[L1]

Threshold measurability characterizes measurable R‾-valued functions. (Threshold characterisations of real-valued and extended-real-valued measurability)

[L2]

A measurable real-valued function with finite range is simple, and its canonical representation is the sum over its level sets. (A simple function and its canonical representation)

Proof

technique · direct
1.1L1L2

For fixed k, each set [L1, L2] {j2−k≤f<(j+1)2−k} and {f≥k} is measurable by [L1]. Hence sk is a measurable real-valued function. Its values belong to the finite set {0,2−k,2⋅2−k,…,(k2k−1)2−k,k}, so [L2] makes sk a simple function.

1.2givenalgebra

Fix x∈X. If f(x)≥k, then sk(x)=k≤f(x) and also [given, algebra] sk+1(x)≥k=sk(x). If f(x)<k, choose j with j2−k≤f(x)<(j+1)2−k. Then sk(x)=j2−k≤f(x) and f(x)−sk(x)<2−k. At the finer scale 2−k−1, the same point lies in one of the two adjacent dyadic cells over that coarse cell, so sk+1(x) is either j2−k or j2−k+2−k−1. Thus sk(x)≤sk+1(x)≤f(x).

2.1step 1.2

The inequalities of step 1.2 hold for every x, so [step 1.2] 0≤sk≤sk+1≤f. If f(x)<+∞, then for all k>f(x) the second case of step 1.2 applies and gives 0≤f(x)−sk(x)<2−k, hence sk(x)→f(x). If f(x)=+∞, then sk(x)=k for every k, so sk(x)→+∞=f(x).

3.1

If f≤M<+∞ on a set E, then for every k>M the second case of [step 1.2, step 2.1] step 1.2 applies to every x∈E and gives 0≤f(x)−sk(x)<2−k. Therefore

sup⁡x∈E∣f(x)−sk(x)∣≤2−k,

so sk→f uniformly on E. [step 1.2, step 2.1] ∎

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Every measurable function admits simple approximations dominated by its absolute value

Statement

Let (X,A) be a measurable space and let f:X→R‾ be measurable. Then there is a sequence of simple functions sk:X→R such that

∣sk∣≤∣f∣for every k,

and sk(x)→f(x) for every x∈X.

Facts & Assumptions

Given: A measurable function f:X→R‾.

[L1]

The positive and negative parts satisfy f=f+−f−, ∣f∣=f++f−, and at each point at least one of f+,f− is zero. (The positive and negative parts of a function)

[L2]

The arithmetic-and-lattice theorem makes f+ and f− measurable. (Arithmetic and lattice operations preserve measurability whenever they are defined)

[L3]

Every nonnegative measurable function admits an increasing sequence of simple approximations. (Every nonnegative measurable function admits an explicit increasing sequence of simple approximations)

Proof

technique · direct
1.1L2L1L3

By [L2], the functions f+ and f− are measurable and nonnegative. Applying [L1, L2, L3] [L3] to them gives simple functions uk↑f+ and vk↑f−. [L1, L2, L3].

2.1step 1.1L1∎

Put sk:=uk−vk. Because uk and vk are simple, sk is a [step 1.1, L1] simple real-valued function. At each point, [L1] makes at least one of uk and vk equal to 0, so ∣sk∣=uk+vk≤f++f−=∣f∣. Also sk→f+−f−=f pointwise because uk→f+ and vk→f−. [step 1.1, L1].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

On a complete measure space, equality almost everywhere preserves measurability

Statement

Let (X,A,μ) be a complete measure space, let f:X→R‾ be measurable, and let g:X→R‾ satisfy g=f almost everywhere. Then g is measurable.

Facts & Assumptions

Given: A complete measure space (X,A,μ), a measurable function f:X→R‾, a function g:X→R‾, and a measurable null set N such that f=g on X∖N.

[L1]

In a complete measure space, every subset of a measurable null set is measurable and null. (Null sets are closed under countable unions and, in a complete space, under arbitrary subsets)

[L2]

Threshold measurability characterizes measurable R‾-valued functions. (Threshold characterisations of real-valued and extended-real-valued measurability)

Proof

technique · direct
1.1givenalgebra

Fix a real a. On X∖N, the equality g=f gives

{g>a}∩(X∖N)={f>a}∩(X∖N).

Therefore

{g>a}=({f>a}∩(X∖N))∪({g>a}∩N).

[given, algebra]

2.1step 1.1L1L2

The set {f>a} is measurable by [L2]. The set {g>a}∩N is a [step 1.1, L1, L2] subset of the measurable null set N, so [L1] makes it measurable. Hence {g>a} is measurable for every real a.

3.1step 2.1L2∎

By [L2], step 2.1 proves that g is measurable.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra

Statement

Assume the Axiom of Countable Choice. Let (X,A0,μ) be a measure space and let (X,A0‾,μ‾) be its completion. If f:X→R‾ is measurable with respect to A0‾, then there is an A0-measurable function g:X→R‾ such that f=g almost everywhere.

Facts & Assumptions

Given: The Axiom of Countable Choice, a measure space (X,A0,μ), its completion (X,A0‾,μ‾), and an A0‾-measurable function f:X→R‾.

[L1]

Every measurable function admits simple approximations dominated by its absolute value. (Every measurable function admits simple approximations dominated by its absolute value)

[L2]

A completed measurable set has the form A∪N with A∈A0 and N contained in a measurable null set. (The completion domain and proposed completed set function of a measure space)

[L3]

Assuming Countable Choice, the completion is a complete measure space extending the original measure, and countable unions of completed null sets are completed null sets. (Assuming countable choice, every measure space has a unique complete extension to its completion, Null sets are closed under countable unions and, in a complete space, under arbitrary subsets)

[L4]

Pointwise limsup of a sequence of measurable functions is measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)

Proof

technique · direct
1.1L1choose

By [L1], choose simple A0‾-measurable functions [L1, choose] sk:X→R with ∣sk∣≤∣f∣ and sk(x)→f(x) for every x∈X. Write the canonical representation of sk as sk=∑j=1mkck,j 1Ek,j, where the Ek,j are pairwise disjoint completed measurable level sets.

1.2L2L3choose

For each pair (k,j), apply [L2] to Ek,j and choose [L2, L3, choose] Ak,j∈A0 together with a completed null set Nk,j such that Ek,j=Ak,j∪Mk,j with Mk,j⊆Nk,j. Because Ak,j⊆Ek,j, the sets Ak,j remain pairwise disjoint. Define tk:=∑j=1mkck,j 1Ak,j. Then each tk is A0-measurable and simple. Let N:=⋃k,jNk,j. By [L3], N is a completed measurable null set, and for every x∉N one has tk(x)=sk(x) for all k.

2.1step 1.1step 1.2L4

Define [step 1.1, step 1.2, L4] g:=lim sup⁡k→∞tk. By [L4], the function g is A0-measurable. If x∉N, then step 1.2 gives tk(x)=sk(x) for every k, and step 1.1 gives sk(x)→f(x), so g(x)=lim sup⁡ktk(x)=lim⁡ksk(x)=f(x). Hence g=f on X∖N.

3.1step 2.1L3∎

The null set N is measurable in the completion by [L3], so step 2.1 says [step 2.1, L3] exactly that f=g almost everywhere. Since g is A0-measurable, it is the required base-measurable representative.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

Doob-Dynkin factorization through the sigma-algebra generated by a function

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let f:X→R and g:X→R‾. Then g is σ(f)-measurable if and only if there is a Borel measurable function h:R→R‾ such that

g=h∘f.

Facts & Assumptions

Given: ACω and functions f:X→R and g:X→R‾.

[L1]

The sigma-algebra generated by f is σ(f)={f−1(B):B∈B(R)}. (The sigma-algebra generated by a function)

[L2]

Threshold measurability characterizes R‾-valued measurability. (Threshold characterisations of real-valued and extended-real-valued measurability)

[L3]

Q is countable (Q is countably infinite), so The Axiom of Countable Choice (ACω) selects one Borel lift for each rational threshold in step 1.2.

Proof

technique · direct
1.1L1given

If g=h∘f for Borel h, then for each Borel C⊆R‾, g−1(C)=f−1(h−1(C))∈σ(f) by [L1].

1.2L1L2L3choosealgebra

Conversely suppose g is σ(f)-measurable. For every rational q, [L1] and [L2] say that the family of Borel A⊆R with f−1(A)={g≤q} is nonempty. By [L3], Q is countable; apply the stated ACω to choose one Aq for every q. Define Bq=⋂r∈Q, r>qAr. These sets are Borel and increasing in q, and f−1(Bq)=⋂r>q{g≤r}={g≤q}, including when g takes an infinite value.

2.1step 1.2algebra

The family also satisfies Bq=⋂r∈Q, r>qBr. Indeed the right side expands to the intersection of all As with rational s>r>q; every rational s>q has a rational r strictly between q and s, and every s>r>q also has s>q. Thus the two collections of As have the same intersection.

3.1L2step 1.2step 2.1

For y∈R put h(y)=inf⁡{q∈Q:y∈Bq} in R‾, with empty infimum +∞. For rational q, monotonicity and step 2.1 give {h≤q}=⋂r∈Q, r>qBr=Bq: if the infimum is at most q, some index below each r>q belongs to the defining set, and conversely membership in every Br forces the infimum at most q. The threshold criterion [L2] therefore makes h Borel measurable.

4.1L2step 1.1step 1.2step 3.1∎

For every x∈X and rational q, steps 1.2 and 3.1 give h(f(x))≤q exactly when g(x)≤q. Rational thresholds distinguish all points of R‾, including both infinities, hence h(f(x))=g(x). Together with step 1.1 this proves the equivalence.

5 · Examples, counterexamples and false statements

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-27Open item page →

FALSE: if every level set of a real-valued function is measurable, then the function is measurable

Statement

False claim. If every level set {x:f(x)=a} of a real-valued function is measurable, then the function itself is measurable.

Facts & Assumptions

Given: The Axiom of Choice, the Lebesgue measurable-space structure on [0,1], and a Vitali set V⊆[0,1].

[L2]

Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable. (Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable)

Refutation

technique · direct
1.1givenL1

Define f:[0,1]→R by [given, L1] f(x)=x for x∉V and f(x)=x+2 for x∈V. Every level set of f is empty, a singleton, or a two-point set, hence measurable.

2.1step 1.1L2∎

The set f−1([2,3]) is exactly V, because on [0,1]∖V the [step 1.1, L2] values lie in [0,1] and on V they lie in [2,3]. By [L2], the set V is not measurable, so f is not measurable.

False statementConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

FALSE: if the absolute value is measurable, then the function is measurable

Statement

False claim. If ∣f∣ is measurable, then f is measurable.

Facts & Assumptions

Given: The Axiom of Choice, the Lebesgue measurable-space structure on [0,1], and a Vitali set V⊆[0,1].

[L1]

Assuming the Axiom of Choice, Vitali sets exist. (Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists)

[L2]

Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable. (Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable)

Refutation

technique · direct
1.1givenL1

By [L1], choose a Vitali set V⊆[0,1]. Define f:[0,1]→R by f(x)=1 for x∈V and f(x)=−1 for x∈[0,1]∖V. Then ∣f∣ is the constant function 1, hence measurable.

2.1step 1.1L2∎

The inverse image f−1((0,∞))={x:f(x)>0}=V is not Lebesgue measurable by [L2]. Since (0,∞) is open, f is not measurable even though ∣f∣ is.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-27Open item page →

FALSE: the supremum of an arbitrary family of measurable functions is always measurable

Statement

False claim. The pointwise supremum of an arbitrary family of measurable functions is measurable. The correct theorem on this page is only the sequential version.

Facts & Assumptions

Given: The Axiom of Choice, the Lebesgue measurable-space structure on [0,1], a Vitali set V⊆[0,1], and the family {1{t}:t∈V} of indicator functions on [0,1].

[L2]

The indicator of a measurable set is measurable. (An indicator function is measurable exactly when its set is measurable)

Refutation

technique · direct
1.1givenL2

Each singleton {t} is measurable, so [L2] makes every [given, L2] 1{t} measurable.

2.1step 1.1L1L2

The pointwise supremum of the family is

sup⁡t∈V1{t}=1V.

Since V is not measurable by [L1], the function 1V is not measurable. So an uncountable supremum of measurable functions can fail to be measurable. [step 1.1, L1, L2] ∎

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-27Open item page →

FALSE: equality almost everywhere with a measurable function implies measurability

Statement

False claim. If g equals a measurable function almost everywhere, then g is measurable. This fails on incomplete measure spaces.

Facts & Assumptions

Given: The Axiom of Choice and the Borel measure space (R,B(R),λ∣B(R)), the Cantor set C, and the homeomorphism ψ(x)=x+c(x) from [0,1] onto [0,2].

[L1]

The set K=ψ[C] is compact and has Lebesgue measure 1, so it has positive outer measure; every positive-outer-measure subset of R contains a nonmeasurable subset. (The homeomorphism x↦x+c(x) sends the Cantor set onto a compact set of Lebesgue measure 1, Every subset of R of positive Lebesgue outer measure contains a nonmeasurable subset)

[L3]

The map ψ is a homeomorphism from [0,1] onto [0,2]. (The map x↦x+c(x) is a homeomorphism from [0,1] onto [0,2])

Refutation

technique · direct
1.1L1L2L3choose

By [L1], choose a nonmeasurable subset N⊆K, and put [L1, L2, L3, choose] E:=ψ−1[N]⊆C. Since E⊆C and C is Lebesgue null, [L2] makes E Lebesgue measurable. If E were Borel, then continuity of ψ−1∣K from [L3] would make N Borel in the subspace K, hence Lebesgue measurable, which contradicts the choice of N. So E is Lebesgue measurable but not Borel.

2.1

Let f=0 and g=1E on R. The function f is Borel [step 1.1, L2] measurable, and g=f on R∖C, so g=f almost everywhere with respect to λ∣B(R) because C is a measurable null set by [L2]. But

g−1((1/2,∞))=E,

and E is not Borel by step 1.1, so g is not measurable on this incomplete measure space. [step 1.1, L2] ∎

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-27Open item page →

FALSE: composing a Lebesgue measurable function with a continuous map preserves measurability

Statement

False claim. Let X,Y⊆R carry their trace Lebesgue sigma-algebras. If f:X→Y is continuous and g:Y→R is Lebesgue measurable, then g∘f is Lebesgue measurable.

Facts & Assumptions

Given: The Axiom of Choice, the Cantor set C, the homeomorphism ψ(x)=x+c(x) from [0,1] onto [0,2], and K:=ψ[C].

[L2]

The indicator of a measurable set is measurable. (An indicator function is measurable exactly when its set is measurable)

Refutation

technique · direct
1.1

Choose a nonmeasurable N⊆K by [L1], put [L1, L2, choose] E:=ψ−1[N]⊆C, let g:=1E:[0,1]→R, and let f:=ψ−1:[0,2]→[0,1]. Completeness makes E Lebesgue measurable in R, hence measurable in the trace sigma-algebra on [0,1], so [L2] makes g measurable, while [L1] makes f continuous.

2.1step 1.1L1

But

(g∘f)−1((1/2,∞))=f−1[E]=N,

which does not lie in the trace sigma-algebra L(R)∣[0,2], even though g is measurable and f is continuous. [step 1.1, L1] ∎

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

FALSE: a pointwise limit of continuous functions is continuous almost everywhere

Statement

False claim. A pointwise limit of continuous functions on R is continuous almost everywhere.

Facts & Assumptions

Given: The fat Cantor set S⊆[0,1].

[L1]

The fat Cantor set is closed, nowhere dense, and not Lebesgue null. (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero)

Refutation

technique · direct
1.1

By [L2], there is a continuous function u:R→R with [L2, choose] S={x:u(x)=0}. Put f0:=f1, and for n≥1 define

fn(x):=11+n u(x)2.

Each fn is continuous, because it is built from u by continuous algebraic operations and the denominator is everywhere positive. [L2, choose]

2.1step 1.1L1∎

If x∈S, then u(x)=0 and fn(x)=1 for every n. If x∉S, [step 1.1, L1] then u(x)2>0, so 1+n u(x)2→+∞ and fn(x)→0. Thus the pointwise limit is 1S. Since S is closed and has empty interior by [L1], every point of S is a boundary point of S, and the indicator 1S is discontinuous at every such point. Because S is not Lebesgue null by [L1], the discontinuity set has positive measure.

Sources