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

Convergence in Lp implies convergence in measure

Statement

Let 1≤p≤∞, let un,u∈Lp(μ), and choose measurable representatives fn,f. If ∥un−u∥p→0, then fn→f in measure.

Facts & Assumptions

Given: Representatives fn,f of classes un,u∈Lp(μ) with ∥un−u∥p→0.

[L1]

Convergence in measure means the bad-set measures μ({∣fn−f∣>ε}) tend to 0 for every ε>0 (Convergence in measure).

[L3]

Chebyshev-Markov gives μ({h≥t})≤t−1∫h dμ for nonnegative measurable h (Chebyshev-Markov inequality for the integral).

[L4]

If ∥g∥∞<∞, then ∣g∣≤∥g∥∞ almost everywhere (The essential supremum is attained as the least essential bound).

Proof

technique · For $1 \le p < infinity$, apply Chebyshev-Markov to $|f_n-f|^p$. For $p = infinity$, the essential-supremum bound makes the bad set null for all large $n$
1.1L3L2givenalgebra

Assume 1≤p<∞ and fix ε>0. Apply [L3] to [L2, L3, given, algebra] h:=∣fn−f∣p and t:=εp: μ({∣fn−f∣>ε})=μ({∣fn−f∣p>εp})≤ε−p∫∣fn−f∣p dμ=ε−p∥un−u∥pp. By [L2], the right-hand side tends to 0.

1.2L2L4given

Assume p=∞ and fix ε>0. Because ∥un−u∥∞→0, [L2, L4, given] for all large n one has ∥un−u∥∞<ε. Then [L4] gives ∣fn−f∣≤ε almost everywhere, so μ({∣fn−f∣>ε})=0. Hence the bad-set measures are eventually 0.

2.1step 1.1step 1.2L1∎

Step 1.1 proves the finite-p case and step 1.2 proves the [step 1.1, step 1.2, L1] p=∞ case, so [L1] gives convergence in measure.

Depends on

Used by

Dependency tree · two levels

18 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