Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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.

The Lp norm is the supremum of pairings against unit Lq functions

Statement

Let (X,A,μ) be a measure space, let 1≤p<∞, and let q be conjugate to p. Assume either 1<p<∞, or p=1 and μ is sigma-finite. Then for every f∈Lp(μ), ∥f∥p=sup⁡{ ∣∫fg dμ∣:g∈Lq(μ), ∥g∥q≤1 }.

Facts & Assumptions

Given: A measure space (X,A,μ), an exponent 1≤p<∞ with conjugate exponent q, and an element f∈Lp(μ).

[L1]

Apply Hölder's inequality to the real nonnegative functions ∣f∣ and ∣g∣, then use ∣∫fg dμ∣≤∫∣fg∣ dμ. This gives ∣∫fg dμ∣≤∥f∥p∥g∥q for complex or real functions and conjugate exponents, including p=1, q=∞ (Holder's inequality for integrals, including the endpoint cases).

Proof

technique · Hölder gives the upper bound; the conjugate phase supplies a norming function
1.1L1given

For every g∈Lq(μ) with ∥g∥q≤1, [L1] gives ∣∫fg dμ∣≤∥f∥p∥g∥q≤∥f∥p. Therefore the supremum is at most ∥f∥p.

1.2givenconstruct

If f=0, the displayed formula is immediate. Hence assume from now on f≠0. For a measurable representative u of f, define its conjugate phase by θu(x):={u(x)‾/∣u(x)∣,u(x)≠0,0,u(x)=0. Then ∣θu∣≤1 and uθu=∣u∣ pointwise.

2.1step 1.2givenchooseconstructalgebra

Assume 1<p<∞ and choose a representative u of f. Define g(x):=∣u(x)∣p−1θu(x)∥f∥pp−1. Since (p−1)q=p, ∣g∣q=∣u∣p∥f∥pp, so ∥g∥q=1. Also uθu=∣u∣ gives ∫ug dμ=1∥f∥pp−1∫∣u∣p dμ=∥f∥p. Hence the supremum is at least ∥f∥p.

2.2step 1.2givenchooseconstructalgebra

Assume p=1 and choose a representative u of f. Put g:=θu. Then g∈L∞(μ) with ∥g∥∞≤1, and ∫ug dμ=∫∣u∣ dμ=∥f∥1. So the supremum is at least ∥f∥1.

3.1step 1.1step 2.1step 2.2∎

Step 1.1 gives the upper bound, while step 2.1 or step 2.2 gives an Lq function of norm at most one attaining it. Therefore the displayed supremum equals ∥f∥p.

Depends on

Used by

Dependency tree · two levels

11 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