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

For 1<p<∞, the same representation theorem holds on arbitrary measure spaces

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Let (X,A,μ) be any measure space, let 1<p<∞, and let q be conjugate to p. For every bounded linear functional Λ:Lp(μ)→R there exists a unique g∈Lq(μ) such that Λ([f])=∫fg dμ([f]∈Lp(μ)). Moreover, ∥Λ∥=∥g∥q.

Facts & Assumptions

Given: The Axiom of Countable Choice, a measure space (X,A,μ), an exponent 1<p<∞, its conjugate exponent q, and a bounded linear functional Λ on Lp(μ).

[L0]

Countable Choice is assumed (The Axiom of Countable Choice (ACω)).

[L2]

Every Lr(μ) class with 1≤r<∞ has sigma-finite essential support (For 1≤p<∞, every Lp(μ) class has a sigma-finite essential support).

[L3]

For u∈Lq(μ), the pairing functional has norm ∥u∥q (The functional Λg has norm ∥g∥q; for q=∞ assume μ is semifinite).

Proof

technique · Represent the restriction of the functional on each sigma-finite measurable subset, choose a countable near-maximizing family of such subsets, and prove that their union already captures every local representative
1.1L1givenchooseconstruct

Let S be the family of sigma-finite measurable subsets of X. For each E∈S, define the restricted functional ΛE([u]):=Λ([u~]) on Lp(μ∣E), where u~ is extended by 0 outside E. By [L1], there is a unique gE∈Lq(μ∣E) such that ΛE([u])=∫EugE dμ([u]∈Lp(μ∣E)), and ∥gE∥q=∥ΛE∥≤∥Λ∥.

2.1L0L1step 1.1chooseconstruct

The empty set lies in S and has ∣g∅∥q=0, so the bounded set below is nonempty. Put s:=sup⁡{ ∥gE∥qq:E∈S }≤∥Λ∥q. For each n≥1, the definition of the supremum makes the family {E∈S:∥gE∥qq>s−2−n} nonempty. By [L0], choose one En from each family. Because each En is sigma-finite, the family of sequences (En,k)k≥1 of measurable finite-measure subsets of En whose union is En is nonempty. Using [L0] again, choose one such sequence for every n. Let Z:=⋃n=1∞En. The doubly indexed family (En,k)n,k≥1 has union Z, and a diagonal enumeration of it proves that Z is sigma-finite. By [L1], there is a unique gZ∈Lq(μ∣Z) representing ΛZ. Since En⊆Z and both gZ∣En and gEn represent ΛEn, uniqueness in [L1] gives gZ=gEn almost everywhere on En. Therefore ∥gZ∥qq≥∥gEn∥qq>s−2−n(n≥1). Since Z∈S, the definition of s also gives ∥gZ∥qq≤s, and hence ∥gZ∥qq=s.

3.1L1step 2.1constructalgebra

Let g be the zero extension of a measurable representative of gZ from Z to X. Since q<∞, step 2.1 gives ∫X∣g∣q dμ=∫Z∣gZ∣q dμ=s<∞, so g∈Lq(μ) and ∥g∥qq=s. Now let E∈S. Then Z∪E is sigma-finite, so [L1] supplies gZ∪E. Uniqueness on Z and on E gives gZ∪E=gZ a.e. on Z,gZ∪E=gE a.e. on E. Therefore ∥gZ∪E∥qq=∫Z∣gZ∣q dμ+∫E∖Z∣gE∣q dμ. The left side is at most s by definition of s, while the first term is s by step 2.1. Hence ∫E∖Z∣gE∣q dμ=0, so gE=0 almost everywhere on E∖Z and gE=g almost everywhere on E∩Z.

4.1L2step 1.1step 3.1givenchoose

Let [f]∈Lp(μ). By [L2], choose a sigma-finite measurable set S⊆X such that f=0 almost everywhere on X∖S. Applying step 1.1 to S gives gS∈Lq(μ∣S) with Λ([f])=ΛS([f∣S])=∫SfgS dμ. Step 3.1 gives gS=g almost everywhere on S, so Λ([f])=∫Sfg dμ=∫Xfg dμ. Thus g represents Λ on all of Lp(μ).

5.1L1L2L3step 3.1step 4.1givenchoose∎

If h∈Lq(μ) also represents Λ, then h−g∈Lq(μ) and q<∞. By [L2], choose a sigma-finite measurable set S such that h−g=0 almost everywhere on X∖S. The restrictions of h and g to S represent the same bounded functional on the sigma-finite space S, so [L1] gives h=g almost everywhere on S. Together with the choice of S, this proves h=g almost everywhere on X. Finally [L3] gives ∥Λ∥=∥g∥q. So the representing class is unique and has the correct norm.

Depends on

Used by

Dependency tree · two levels

26 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