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

Minkowski's inequality for integrals, including p=

Statement

Let (X,A,μ) be a measure space.

  1. If 1p< and f,gLp(μ), then f+gpfp+gp.
  2. If f,gL(μ), then f+gf+g.

Facts & Assumptions

Given: A measure space and functions f,g in the spaces named in the relevant clause of the Statement.

[L1]

Holder's inequality for integrals is available (Holder's inequality for integrals, including the endpoint cases).

[L3]

If hL(μ), then hh almost everywhere (The essential supremum is attained as the least essential bound).

[L4]

The nonnegative integral is monotone and homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[L5]

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

[L6]

Holder's inequality for finite sums gives, for nonnegative reals a,b, a+b21/q(ap+bp)1/p when q=p/(p1) (Holder's inequality for finite sums and conjugate real exponents).

Proof

technique · For $1 < p < infinity$, first use the two-term finite Holder inequality to show $|f + g|^p$ is integrable, then apply the standard Holder step to $|f + g| |f + g|^{p - 1}$. The cases $p = 1$ and $p = \infty$ are handled directly from subadditivity of absolute value and the essential-supremum bound
1.1

If p=1, then f+gf+g pointwise, so [L4, L5, given] f+g1=f+gdμfdμ+gdμ=f1+g1.

1.2

Assume 1<p< and let q:=p/(p1). Then [L1, L2, L4, L5, L6, given, algebra] f+gpdμ2p1(fpdμ+gpdμ)<. Indeed, [L6] applied pointwise to the two-term families (f(x),g(x)) and (1,1) gives f(x)+g(x)21/q(f(x)p+g(x)p)1/p, so f+gp(f+g)p2p1(fp+gp) pointwise. Thus f+gLp(μ). Put C:=f+gp. If C=0, the claim is immediate. Otherwise f+gp=f+gf+gp1ff+gp1+gf+gp1. Because (p1)q=p, the function f+gp1 lies in Lq(μ) and has q-norm Cp1. Integrating and applying [L1] with conjugate exponents p and q to each term yields Cpfp(f+g(p1)qdμ)1/q+gp(f+g(p1)qdμ)1/q. Since (p1)q=p, this becomes Cp(fp+gp)Cp1. If C>0, divide by Cp1 to obtain the claim.

1.3

For p=, let M:=f and N:=g. Then [L2, L3, given] f+gf+gM+N. Indeed, outside the union of the two null exceptional sets supplied by [L3], one has fM and gN. Therefore f+gM+N.

2.1

Steps 1.1, 1.2, and 1.3 prove the p=1, 1<p<, and p= cases.

step 1.1step 1.2step 1.3

Depends on

Used by

Dependency tree · two levels

28 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