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 1p<, and let F:X×YC be measurable with

YF(,y)Lp(X)dν(y)<.

Then the function

H(x):=YF(x,y)dν(y)

belongs to Lp(X) and

HLp(X)YF(,y)Lp(X)dν(y).

Facts & Assumptions

Given: Sigma-finite measure spaces, an exponent 1p<, 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.1

If p=1, then Tonelli directly gives [L2, given, algebra] HL1(X)=XYF(x,y)dν(y)dμ(x)=YF(,y)L1(X)dν(y).

L2givenalgebra
1.2

Assume 1<p< and let q be conjugate to p. Put [L2, L3, given, algebra] M:=YF(,y)Lp(X)dν(y). For every nonnegative gLq(X) with gq1, XH(x)g(x)dμ(x)=Y(XF(x,y)g(x)dμ(x))dν(y) by [L2], and then [L3] yields XF(x,y)g(x)dμ(x)F(,y)pgqF(,y)p. Hence XHgdμYF(,y)pdν(y)=M.

L2L3givenalgebra
1.3

Choose measurable sets X1X2 with [given, construct] μ(Xm)< and mXm=X, and define Hm:=min(H,m)1Xm. Then 0HmH pointwise, and each Hm lies in Lp(X) because Hmm1Xm.

givenconstruct
2.1

Applying [L1] to each nonnegative Hm and using 0HmH with [L1, step 1.2, step 1.3] step 1.2 gives HmpM for every m.

L1step 1.2step 1.3
3.1

By [L4], XHm(x)pdμ(x)XH(x)pdμ(x). Since Hmpdμ=HmppMp for every m, the limit is finite and satisfies HppMp. Hence HLp(X) and HpM=YF(,y)Lp(X)dν(y). Together with step 1.1, this proves the theorem for all 1p<.

L4step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

25 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