Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck 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.

Reverse Fatou's lemma under an integrable majorant

Statement

Let (fn) be nonnegative measurable functions and let g be a nonnegative measurable function with ∫g dμ<+∞ and fn≤g for every n. Then lim sup⁡n→∞∫fn dμ≤∫lim sup⁡n→∞fn dμ.

Facts & Assumptions

Given: Nonnegative measurable functions fn dominated by a nonnegative measurable function g with finite integral.

[L1]

Fatou's lemma applies to every sequence of nonnegative measurable functions (Fatou's lemma).

[L2]

The nonnegative integral is additive (Additivity of the nonnegative Lebesgue integral).

[L4]

Truncations of nonnegative measurable functions and pointwise limsups of measurable sequences are measurable (Closure properties of measurable functions used by the integral).

[L5]

Monotone convergence holds for the nonnegative integral (Monotone convergence for the integral).

Proof

technique · direct
1.1L4givenconstruct

For each m≥1, put gm:=g∧m and un,m:=fn∧m. Then gm and un,m are measurable, 0≤un,m≤gm≤m, and gm−un,m is a nonnegative measurable function.

2.1step 1.1L1L2L3L4algebra

Apply [L1] to the sequence gm−un,m. Since gm is finite-valued, lim inf⁡n(gm−un,m)=gm−lim sup⁡nun,m, ∫(gm−un,m) dμ=∫gm dμ−∫un,m dμ, and ∫(gm−lim sup⁡nun,m) dμ=∫gm dμ−∫lim sup⁡nun,m dμ. Rearranging Fatou's inequality therefore gives lim sup⁡n∫un,m dμ≤∫lim sup⁡nun,m dμ≤∫lim sup⁡nfn dμ.

3.1step 2.1L2L3algebra

Since 0≤fn−un,m≤g−gm, [L2] and [L3] give ∫fn dμ=∫un,m dμ+∫(fn−un,m) dμ≤∫un,m dμ+∫(g−gm) dμ. Taking lim sup⁡n and using step 2.1 yields lim sup⁡n∫fn dμ≤∫lim sup⁡nfn dμ+∫(g−gm) dμ.

4.1step 3.1L2L5algebra∎

Because gm↑g, [L5] gives ∫gm dμ↑∫g dμ. Applying [L2] to g=(g−gm)+gm shows ∫(g−gm) dμ=∫g dμ−∫gm dμ⟶0. Letting m→∞ in step 3.1 proves lim sup⁡n∫fn dμ≤∫lim sup⁡nfn dμ.

Depends on

Used by

Dependency tree · two levels

16 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