Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-27
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.

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

Statement

Let (X,A) be a measurable space and let fn:XR be measurable for every nN. Then the functions

supnfn,infnfn,lim supnfn,lim infnfn

are measurable. The set

{x:limnfn(x) exists in R}

is measurable. In particular, if fnf pointwise, then f is measurable.

Facts & Assumptions

Given: A measurable space (X,A) and measurable functions fn:XR for nN.

[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 supnfn(x)=infnsupknfk(x),lim infnfn(x)=supninfknfk(x),

Proof

technique · direct
1.1

Let s(x):=supnfn(x) and i(x):=infnfn(x). Then for every real [L1, given] a,

{s>a}=n{fn>a},{i>a}=qQ,q>a n{fn>q}.

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

2.1

For each n, the tail functions [step 1.1, L2] sn(x):=supknfk(x) and in(x):=infknfk(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 supnfn and lim infnfn.

step 1.1L2
3.1

Let u:=lim supnfn and v:=lim infnfn. The equality set [step 2.1, L1, L2] {u=v} is measurable because

{u=v}=qQ(({u>q}{v>q})({uq}{vq})).

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.1

If fnf pointwise, then [L2] gives [step 2.1, step 3.1, L2] f=lim supnfn=lim infnfn. Since step 2.1 has already proved that both limiting functions are measurable, f is measurable.

step 2.1step 3.1L2

Depends on

Used by

Dependency tree · two levels

27 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