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 gLq(μ) such that Λ([f])=fgdμ([f]Lp(μ)). Moreover, Λ=gq.

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 1r< has sigma-finite essential support (For 1p<, every Lp(μ) class has a sigma-finite essential support).

[L3]

For uLq(μ), the pairing functional has norm uq (The functional Λg has norm gq; 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.1

Let S be the family of sigma-finite measurable subsets of X. For each ES, define the restricted functional ΛE([u]):=Λ([u~]) on Lp(μE), where u~ is extended by 0 outside E. By [L1], there is a unique gELq(μE) such that ΛE([u])=EugEdμ([u]Lp(μE)), and gEq=ΛEΛ.

L1givenchooseconstruct
2.1

The empty set lies in S and has gq=0, so the bounded set below is nonempty. Put s:=sup{gEqq:ES}Λq. For each n1, the definition of the supremum makes the family {ES:gEqq>s2n} nonempty. By [L0], choose one En from each family. Because each En is sigma-finite, the family of sequences (En,k)k1 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=1En. The doubly indexed family (En,k)n,k1 has union Z, and a diagonal enumeration of it proves that Z is sigma-finite. By [L1], there is a unique gZLq(μZ) representing ΛZ. Since EnZ and both gZEn and gEn represent ΛEn, uniqueness in [L1] gives gZ=gEn almost everywhere on En. Therefore gZqqgEnqq>s2n(n1). Since ZS, the definition of s also gives gZqqs, and hence gZqq=s.

L0L1step 1.1chooseconstruct
3.1

Let g be the zero extension of a measurable representative of gZ from Z to X. Since q<, step 2.1 gives Xgqdμ=ZgZqdμ=s<, so gLq(μ) and gqq=s. Now let ES. Then ZE is sigma-finite, so [L1] supplies gZE. Uniqueness on Z and on E gives gZE=gZ a.e. on Z,gZE=gE a.e. on E. Therefore gZEqq=ZgZqdμ+EZgEqdμ. The left side is at most s by definition of s, while the first term is s by step 2.1. Hence EZgEqdμ=0, so gE=0 almost everywhere on EZ and gE=g almost everywhere on EZ.

L1step 2.1constructalgebra
4.1

Let [f]Lp(μ). By [L2], choose a sigma-finite measurable set SX such that f=0 almost everywhere on XS. Applying step 1.1 to S gives gSLq(μS) with Λ([f])=ΛS([fS])=SfgSdμ. Step 3.1 gives gS=g almost everywhere on S, so Λ([f])=Sfgdμ=Xfgdμ. Thus g represents Λ on all of Lp(μ).

L2step 1.1step 3.1givenchoose
5.1

If hLq(μ) also represents Λ, then hgLq(μ) and q<. By [L2], choose a sigma-finite measurable set S such that hg=0 almost everywhere on XS. 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 Λ=gq. So the representing class is unique and has the correct norm.

L1L2L3step 3.1step 4.1givenchoose

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