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

Counting measure specializes the representation theorem to ℓp and ℓq

Statement

Let 1≤p<∞ and let q be conjugate to p. Every bounded linear functional Λ:ℓp→R is of the form Λ(a)=∑n=0∞anbn for a unique sequence b∈ℓq. Moreover, ∥Λ∥=∥b∥ℓq.

Facts & Assumptions

Given: An exponent 1≤p<∞, its conjugate exponent q, and a bounded linear functional Λ on ℓp.

[L1]

On a sigma-finite measure space, every bounded linear functional on Lp is integration against a unique Lq function (On a sigma-finite measure space, every bounded linear functional on Lp is integration against a unique Lq function).

[L2]

On counting measure over N, the spaces Lp and ℓp coincide, the Lq density becomes a sequence, and the integral becomes the series pairing (ℓp is the Lp space of counting measure).

Proof

technique · View $\ell^p$ as $L^p$ of counting measure on $\mathbb N$, note that counting measure on $\mathbb N$ is sigma-finite by finite initial segments, and translate the representing $L^q$ function back to a sequence
1.1L2given

Counting measure on N is sigma-finite because [L2, given] N=⋃n=0∞{0,1,…,n}, and each initial segment has finite counting measure. By [L2], we may therefore regard Λ as a bounded linear functional on Lp(#).

2.1L1L2step 1.1choose∎

Applying [L1], choose g∈Lq(#) such that [L1, L2, step 1.1, choose] Λ(a)=∫ag d#(a∈ℓp). By [L2], writing bn:=g(n) turns g into a sequence b=(bn)∈ℓq, and the integral identity becomes Λ(a)=∑n=0∞anbn. The same translation in [L2] turns uniqueness and norm equality from [L1] into uniqueness of b and ∥Λ∥=∥b∥ℓq.

Depends on

Used by

Dependency tree · two levels

16 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