Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Minkowski's integral inequality

Statement

Let (X,μ) and (Y,ν) be sigma-finite measure spaces, let 1≤p<∞, and let F:X×Y→C be measurable with

∫Y∥F(⋅,y)∥Lp(X) dν(y)<∞.

Then the function H(x):=∫Y∣F(x,y)∣ dν(y) belongs to Lp(X) and

∥H∥Lp(X)≤∫Y∥F(⋅,y)∥Lp(X) dν(y).

Facts & Assumptions

Given: Sigma-finite measure spaces, an exponent 1≤p<∞, and a measurable function F satisfying the displayed integrability hypothesis.

[L2]

Tonelli applies to nonnegative measurable functions on product spaces (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[L4]

Monotone convergence is available for nonnegative measurable functions (Monotone convergence for the integral).

Proof

technique · direct
1.1L2givenalgebra

If p=1, then Tonelli directly gives [L2, given, algebra] ∥H∥L1(X)=∫X∫Y∣F(x,y)∣ dν(y) dμ(x)=∫Y∥F(⋅,y)∥L1(X) dν(y).

1.2L2L3givenalgebra

Assume 1<p<∞ and let q be conjugate to p. Put [L2, L3, given, algebra] M:=∫Y∥F(⋅,y)∥Lp(X) dν(y). For every nonnegative g∈Lq(X) with ∥g∥q≤1, ∫XH(x)g(x) dμ(x)=∫Y(∫X∣F(x,y)∣g(x) dμ(x))dν(y) by [L2], and then [L3] yields ∫X∣F(x,y)∣g(x) dμ(x)≤∥F(⋅,y)∥p∥g∥q≤∥F(⋅,y)∥p. Hence ∫XHg dμ≤∫Y∥F(⋅,y)∥p dν(y)=M.

1.3givenconstruct

Choose measurable sets X1⊆X2⊆⋯ with [given, construct] μ(Xm)<∞ and ⋃mXm=X, and define Hm:=min⁡(H,m) 1Xm. Then 0≤Hm↑H pointwise, and each Hm lies in Lp(X) because Hm≤m 1Xm.

2.1L1step 1.2step 1.3

Applying [L1] to each nonnegative Hm and using 0≤Hm≤H with [L1, step 1.2, step 1.3] step 1.2 gives ∥Hm∥p≤M for every m.

3.1L4step 1.1step 2.1∎

By [L4], ∫XHm(x)p dμ(x)↑∫XH(x)p dμ(x). Since ∫Hmp dμ=∥Hm∥pp≤Mp for every m, the limit is finite and satisfies ∥H∥pp≤Mp. Hence H∈Lp(X) and ∥H∥p≤M=∫Y∥F(⋅,y)∥Lp(X) dν(y). Together with step 1.1, this proves the theorem for all 1≤p<∞.

Depends on

Used by

Dependency tree · two levels

26 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