Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

Every bounded linear functional on ℓ2 is summation against a unique ℓ2 sequence

Example

Every bounded linear functional Λ:ℓ2→R has a unique sequence b=(bn)∈ℓ2 such that Λ(a)=∑n=0∞anbn(a∈ℓ2), and ∥Λ∥=∥b∥ℓ2.

Facts & Assumptions

Given: A bounded linear functional Λ on ℓ2.

[L1]

The counting-measure corollary says that every bounded linear functional on ℓp is represented by a unique ℓq sequence, with equality of norms (Counting measure specializes the representation theorem to ℓp and ℓq).

[L2]

On counting measure over N, the integral pairing is exactly the series pairing for sequences (ℓp is the Lp space of counting measure).

Verification

technique · Specialize the counting-measure duality corollary to $p=q=2$ and rewrite the integral pairing as an ordinary series
1.1L1given

Apply [L1] with p=q=2. Then there is a unique sequence b∈ℓ2 such that Λ(a)=∑n=0∞anbn for every a∈ℓ2, and ∥Λ∥=∥b∥ℓ2.

2.1L2step 1.1∎

The summation formula is exactly the counting-measure integral pairing from [L2], so this is the concrete ℓ2 instance of the A-page theorem.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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