Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-24 (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.

The Lp distance for 0<p<1 is a complete translation-invariant metric

Statement

Assume the Axiom of Choice. Let 0<p<1 and let Lp(μ) denote the set of almost-everywhere classes of functions in Lp(μ). Define

dp([f],[g]):=∫∣f−g∣p dμ.

Then dp is a translation-invariant metric on Lp(μ), and (Lp(μ),dp) is complete.

Facts & Assumptions

Given: The Axiom of Choice, a measure space (X,A,μ) and an exponent 0<p<1.

[A1]

The countable instance of the Axiom of Choice selects representatives of a countable sequence of nonempty almost-everywhere equivalence classes (The Axiom of Choice).

[L1]

The class notation Lp(μ) means almost-everywhere equivalence classes of Lp(μ) representatives (The space Lp(μ) as the quotient by null functions).

[L3]
[L4]
[L5]

Sums, scalar multiples, absolute values, and pointwise limits of measurable functions are measurable (Closure properties of measurable functions used by the integral).

[L6]

Countable unions of measurable null sets are measurable and null (Finite and countable subadditivity of measures).

[L7]

For 0<p<1 and nonnegative reals a,b, (a+b)p≤ap+bp. Indeed, if a+b=0 the claim is trivial. Otherwise set s:=a+b>0, u:=a/s, and v:=b/s. Then u,v∈[0,1] and u+v=1. If 0<u≤1, then log⁡u≤0, so plog⁡u≥log⁡u because 0<p<1; strict increase of the exponential and the definition of real power therefore give up≥u. The same holds for v. Hence ap+bp=sp(up+vp)≥sp(u+v)=sp=(a+b)p. (Real powers for positive bases, with the zero-base positive-exponent convention, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential function is strictly increasing) [given]

Proof

technique · Because $(a+b)^p\le a^p+b^p$ for $0<p<1$, $d_p([f],[g])=\int|f-g|^p\,d\mu$ defines a metric on quotient classes and is translation invariant. Completeness follows by repeating the Riesz-Fischer telescoping argument without taking $p$-th roots
1.1L1L5L6L7

If f∼f′ and g∼g′, then f−f′ and g−g′ vanish almost everywhere. Outside the union of those two null sets, one has f−g=f′−g′, so ∣f−g∣p=∣f′−g′∣p almost everywhere. Hence dp([f],[g]) is well defined. The same union-of-null-sets argument shows that addition and scalar multiplication descend to the quotient classes, and the inequality in [L7] shows that Lp(μ) is closed under those operations.

1.2L7L2L4

Symmetry of dp is immediate. If dp([f],[g])=0, then ∫∣f−g∣p dμ=0, so f=g almost everywhere and hence [f]=[g]. For the triangle inequality, the pointwise inequality from [L7] gives [L2, L4, L7] ∣f−h∣p=∣(f−g)+(g−h)∣p≤∣f−g∣p+∣g−h∣p, and integrating yields dp([f],[h])≤dp([f],[g])+dp([g],[h]). Thus [L2] makes dp a metric.

1.3L3L5givenchooseA1

Let (un) be Cauchy in dp. Choose by least indices a subsequence (unk) with [L3, L5, given, choose] dp(unk+1,unk)<2−k. By [A1], choose a sequence of representatives fk of unk and define hk:=∣fk+1−fk∣p,gm:=∑j<mhj. Each hk is measurable and integrable, and [L3] gives a measurable pointwise limit g:=∑j=0∞hj with ∫g dμ=lim⁡m→∞∫gm dμ≤∑j=0∞2−j<∞. Hence g<∞ almost everywhere. This is the only use of Choice in the argument.

2.1step 1.1

Translation invariance is pointwise: [step 1.1] dp([f]+[u],[g]+[u])=∫∣(f+u)−(g+u)∣p dμ=dp([f],[g]).

2.2step 1.3L3L7L5

Put E:={x:g(x)=∞}, a measurable null set by step 1.3. Fix x∉E. Then ∑j∣fj+1(x)−fj(x)∣p<∞, so the terms tend to 0. Thus ∣fj+1(x)−fj(x)∣≤1 for all large j, and then [step 1.3, L3, L7] ∣fj+1(x)−fj(x)∣≤∣fj+1(x)−fj(x)∣p=hj(x). So the real series ∑j∣fj+1(x)−fj(x)∣ converges by comparison with ∑jhj(x), which makes (fk(x)) converge to some real value f(x). Define f=0 on E. The measurable functions equal to fk on X∖E and zero on E converge pointwise to f, so [L3] and [L5] make f measurable. Moreover, ∣f∣p≤∣f0∣p+g on X∖E by [L7], and f=0 on E. Since f0∈Lp(μ) and g is integrable, f∈Lp(μ), so [f] is a valid element of Lp(μ). Also ∣f(x)−fk(x)∣p≤(∑j≥k∣fj+1(x)−fj(x)∣)p≤∑j≥khj(x). Integrating and using monotone convergence on the tails yields dp(unk,[f])≤∑j≥kdp(unj+1,unj)≤∑j≥k2−j→0.

3.1step 1.2step 2.2

Because (un) is Cauchy, given ε>0 choose K with dp(un,um)<ε/2 for m,n≥K, then choose k with nk≥K and dp(unk,[f])<ε/2 from step 2.2. The triangle inequality from step 1.2 gives dp(un,[f])<ε for all n≥K. Hence (Lp(μ),dp) is complete.

4.1step 1.2step 2.1step 3.1∎

Steps 1.2 and 2.1 prove that dp is a translation-invariant metric, and step 3.1 proves completeness.

Depends on

Used by

Dependency tree · two levels

65 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