Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Coordinate functionals on sequence spaces

Example

Let K=R or C. For every n0, the coordinate functional πn:xxn has norm one on both c0(K) and 1(K). Under their sequence-dual identifications it is represented by en.

Facts & Assumptions

Given: The spaces, maps, scalar field, and hypotheses in the statement above. All duals consist of linear functionals over the ambient field; evaluation has no conjugation.

[F1]

From The continuous dual of c0 is ell-one, with its stated hypotheses: Let K=R or C. With coordinates starting at zero, the map 1(K)c0(K),afa,fa(x)=n=0anxn is a linear isometric bijection. The pairing is bilinear, including over C.

[F2]

From The complex continuous dual of ell-one is ell-infinity, with its stated hypotheses: For complex sequence spaces, with indices starting at zero, (C)1(C),bhb,hb(a)=n=0bnan is a complex-linear isometric bijection. There is no conjugation in this pairing.

[F3]

From Counting measure specializes the representation theorem to p and q, with its stated hypotheses: Let 1p< and let q be conjugate to p. Every bounded linear functional Λ:pR is of the form Λ(a)=n=0anbn for a unique sequence bq. Moreover, Λ=bq.

Verification

1.1

The pairing for c0 assigns to en1 the functional xxn. The complex 1 dual formula does the same for en, and the real counting-measure theorem at p=1 gives the real counterpart.

F1F2F3
2.1

On c0, xnx; on 1, xnx1. Thus each norm is at most one. In both spaces en=1 and πn(en)=1, proving equality. This works at index zero as well as every later index; the zero input gives zero.

step 1.1

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