Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge 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 isomorphic to a dual space

Statement

Assume the Axiom of Choice. Over either R or C, the Banach space c0 is not topologically isomorphic to the continuous dual of any normed space.

Facts & Assumptions

[A1]

The Axiom of Choice holds (The Axiom of Choice), hence so does Countable Choice (AC supplies the countable and dependent choices used in Banach integration).

[L1]

The finite truncations of every c0 sequence converge in the supremum norm (The sequence spaces c_0 and ell-infinity, Finite truncations approximate null and summable sequences).

[L3]

A topological isomorphism is a bounded linear bijection with bounded inverse, and RNP is invariant under such isomorphisms between Banach spaces (A topological isomorphism of normed spaces, RNP is invariant under Banach-space isomorphism).

[L4]

Under AC every norm-separable dual space has RNP (Separable dual spaces have the Radon--Nikodym property), whereas c0 fails RNP (c0 fails the Radon--Nikodym property).

Proof

technique · direct

Given: AC and K=R or C.

1.1

Exhibit a countable dense subset of c0(K). Let K0=Q in the real case and K0=Q+iQ in the complex case, and let D be the set of sequences with finite support and all coordinates in K0. For each support contained in {0,,N} its members form a finite product of a countable set; [L2], followed by the countable union over N, makes D countable. Given xc0 and ε>0, [L1] gives a finite truncation within ε/2 of x. Approximate its finitely many real coordinates, or both real and imaginary parts, by elements of Q within ε/2 in the maximum norm. The resulting member of D is within ε of x. Thus D is dense and c0 is norm separable.

givenA1L1L2construct
2.1

Transfer separability to a hypothesized dual. Suppose toward a contradiction that a topological isomorphism T:Yc0 exists for some normed space Y. Since T1 is continuous, T1(D) is countable. It is dense in Y: for a nonempty norm-open set UY, the homeomorphism T makes T(U) a nonempty open subset of c0, which meets D, and hence U meets T1(D). Therefore Y is norm separable.

L2L3step 1.1
3.1

Derive the RNP contradiction. By [L4], AC and norm separability give RNP to the dual Y. Isomorphism invariance [L3] then gives RNP to c0, contradicting the second assertion of [L4]. Hence no such Y and T exist.

A1L3L4step 2.1
4.1

Close the scalar and degenerate cases. [A1, L1, L2, L3, L4, step 1.1, step 3.1] The Gaussian-rational choice in step 1.1 handles the complex norm without restricting scalars, and the real case uses ordinary rationals. The space c0 is nonzero, so it cannot be isomorphic to the zero dual; if Y={0}, the hypothesized bijection already fails. AC is used in [L4] and supplies the countability principles invoked in step 1.1.

A1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 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