Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

The layer-cake identity for integrable functions

Statement

Assume the Axiom of Countable Choice. Let (X,A,μ) be any measure space, and let f,g∈L1(X) be nonnegative integrable functions with fixed pointwise nonnegative measurable representatives. For t>0 put Et:={x∈X:f(x)≥t} and Et′:={x∈X:g(x)≥t}, and let dt denote Lebesgue measure on the level parameter. Then ∥f−g∥1=∫0∞μ(Et△Et′) dt, and in particular ∥f∥1=∫0∞μ(Et) dt. No σ-finiteness of μ is required: both integrands are supported on S:={x:f(x)+g(x)>0}, which is σ-finite.

Facts & Assumptions

Given: The Axiom of Countable Choice, a measure space (X,A,μ), and nonnegative L1 classes with the fixed representatives in the statement.

[A1]

The Axiom of Countable Choice is the assumption used to construct the library's Lebesgue measure on R (The Axiom of Countable Choice (ACω)).

[F1]

L1(μ) is a real vector space, its quotient L1(μ) uses almost-everywhere classes, and its norm is the integral of the absolute value (The function space Lp(μ) for 0<p<∞, The space Lp(μ) as the quotient by null functions, Lp and L∞ are vector spaces for p≥1).

[F2]

For a nonnegative measurable h and a>0, μ({h≥a})≤a−1∫h dμ (Chebyshev-Markov inequality for the integral).

[F5]

Product-measurable rectangles, countable unions and intersections are measurable; product measure is defined for σ-finite measure spaces and Tonelli's theorem interchanges the integrals of a nonnegative product-measurable function on such a product (Sigma-algebras, A measurable function between measurable spaces, The Borel sigma-algebra of a topological space, Intervals of R: the nine order-convex forms, nondegeneracy, and length, The product measure of two sigma-finite measure spaces, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

Proof

technique · direct
1.1F1F2F4

Put h:=f+g and S:={x:h(x)>0}. By [F1], h∈L1(μ) and ∫h dμ<∞. For each n≥1, Sn:={x:h(x)≥1/n} is measurable and [F2] gives μ(Sn)≤n∫h dμ<∞. The sets Sn cover S: if h(x)>0, [F4] gives n with 1/n<h(x). Thus S is σ-finite with its restricted measure, and f=g=0 on X∖S.

1.2F3F4F5algebra

For f, define Af:={(x,t)∈S×R:0<t≤f(x)}. Countability of Q>0 and [F5] make Af=⋂m≥1⋃q∈Q>0((S∩{x:f(x)>q})×(0,q+1/m]) product-measurable. Indeed, if 0<t≤f(x), density of Q supplies for each fixed m a rational q with max⁡(0,t−1/m)<q<f(x), so t≤q+1/m. Conversely, membership in every union gives f(x)>t−1/m for each m; if f(x)<t, [F4] gives m with 1/m<t−f(x), a contradiction. Define Ag in the same way and put D:=Af△Ag. For each t>0, its section is Et△Et′, while for each x∈S its section is (0,f(x)]△(0,g(x)], whose Lebesgue measure is ∣f(x)−g(x)∣ by [F3].

2.1A1F1F3F5step 1.1step 1.2

The restricted measure μ∣S is σ-finite by step 1.1, and λ is σ-finite by [F3], so [F5] applies to 1D on their product. Since D⊆S×(0,∞) and f=g=0 off S, Tonelli gives ∥f−g∥1=∫S∣f−g∣ dμ=∫S∫R1D(x,t) dλ(t) dμ(x)=∫R∫S1D(x,t) dμ(x) dλ(t)=∫0∞μ(Et△Et′) dt.

3.1step 2.1∎

Taking g=0 in step 2.1 gives ∥f∥1=∫0∞μ(Et) dt. The only choice assumption used is [A1]; the reduction from X to S and the countable product-measurability description are explicit.

Depends on

Used by

Dependency tree · two levels

123 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