Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)
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.

For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function

Statement

Let (X,A,μ) be a measure space, let f:X→C be measurable, and let 0<p<∞. Then ∫X∣f∣p dμ=p∫0∞tp−1μ({∣f∣>t}) dt=p∫0∞tp−1Af(t) dt, where either side may be +∞.

Facts & Assumptions

Given: A measurable function f:X→C and a real number 0<p<∞.

[L1]

The distribution function is Af(t)=μ({∣f∣>t}). (The distribution function of absolute value)

[L2]

The derivative of tp is ptp−1 on (0,∞). Thus the fundamental theorem of calculus gives ∫εaptp−1 dt=ap−εp for 0<ε<a. (Continuity and derivatives of positive-base real powers, The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a))

[L3]

Every nonnegative measurable function admits increasing simple approximations. (Every nonnegative measurable function admits an explicit increasing sequence of simple approximations)

[L4]

Monotone convergence passes increasing limits through the integral. (Monotone convergence for the integral)

Proof

technique · direct
1.1L2L4

Fix a≥0. If a=0, both integrals below are zero. If a>0, apply [L2] on [ε,a] and let ε↓0. Since p>0, εp→0; monotone convergence for the nonnegative integrand gives ap=∫0aptp−1 dt=∫0∞ptp−11{t<a} dt. This argument also covers 0<p<1, when tp−1 is unbounded at zero.

2.1step 1.1algebra

Let s=∑j=1maj1Ej be a nonnegative simple function, with the sets Ej pairwise disjoint and the coefficients aj≥0. Then ∫Xsp dμ=∑j=1majpμ(Ej). Using step 1.1 for each coefficient and exchanging the resulting finite sum with the real integral gives ∫Xsp dμ=p∫0∞tp−1μ({s>t}) dt.

3.1L1L3L4step 2.1∎

By [L3], choose simple functions sn↑∣f∣. Then snp↑∣f∣p, and for each t≥0 one has 1{sn>t}↑1{∣f∣>t}, hence μ({sn>t})↑μ({∣f∣>t})=Af(t) by [L1]. Applying [L4] first on X and then on (0,∞) to the identities from step 2.1 yields ∫X∣f∣p dμ=p∫0∞tp−1μ({∣f∣>t}) dt=p∫0∞tp−1Af(t) dt.

Depends on

Used by

Dependency tree · two levels

36 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