Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

c0 is not reflexive

Statement

The Banach spaces c0(R) and c0(C) are not reflexive. Under the standard bilinear sequence dualities, their canonical bidual maps are the proper inclusions

c0(K)(K).

Facts & Assumptions

Given: A scalar field K{R,C}.

[F1]

The supremum-norm space c0(K) is Banach without choice (Real and complex c0 are Banach), and a Banach space is reflexive exactly when its canonical evaluation map into the bidual is onto (Reflexivity is surjectivity of the canonical map).

[F2]

Bilinear sequence pairing gives the isometric identification c0(K)=1(K). The dual of real 1 is real , and the dual of complex 1 is complex , with the same no-conjugation pairing (The continuous dual of c0 is ell-one, Counting measure specializes the representation theorem to p and q, The complex continuous dual of ell-one is ell-infinity).

[F3]

The space c0 consists exactly of the bounded scalar sequences tending to zero, while consists of all bounded scalar sequences (The sequence spaces c_0 and ell-infinity).

Proof

technique · Compute canonical evaluation under the two published sequence-duality identifications and exhibit a missing bidual element
1.1

Let T:1(K)c0(K) be the isometric bijection from [F2], so T(a)(x)=n=0anxn. Identify (1(K)) with (K) through [F2]. Both identifications use this bilinear series pairing, including over C.

F2given
2.1

For xc0 and a1, Jc0(x)(T(a))=T(a)(x)=n=0anxn. The functional on the right is represented, under the second identification in step 1.1, by the bounded sequence x itself. Hence the composite c0Jc0c0 is precisely the canonical inclusion xx.

step 1.1F2
3.1

The constant sequence 1=(1,1,) lies in , has norm one, and does not tend to zero. Thus [F3] gives 1c0, so step 2.1 exhibits a concrete member of c0 outside the range of Jc0.

step 2.1F3
4.1

The canonical map is not onto. Since c0(K) is Banach, [F1] therefore proves that it is not reflexive. The calculation covers both scalar fields, including their identical bilinear convention, and uses no choice principle.

step 2.1step 3.1F1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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