Alphabeta Math
TheoremStatement: 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 fails the Radon--Nikodym property

Statement

Assume the Axiom of Choice. Over either R or C, the Banach space c0 does not have the Radon--Nikodym property.

Facts & Assumptions

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[L1]

The sequence space c0 has the supremum norm (The sequence spaces c_0 and ell-infinity) and is Banach over both scalar fields (Real and complex c0 are Banach).

[L2]

Every f∈c0∗ has the unique bilinear representation f(x)=∑n≥0anxn by a sequence a∈ℓ1 (The continuous dual of c0 is ell-one), whose finite truncations converge in ℓ1 (Finite truncations approximate null and summable sequences).

[L3]

A bounded set is dentable when it has slices of arbitrarily small norm diameter (Dentable bounded set and slice).

[L4]

Under AC, RNP is equivalent to dentability of every nonempty bounded closed convex set (RNP--dentability characterization).

Proof

technique · counterexample

Given: AC and the closed unit ball B of c0.

1.1givenL2L3choose

Fix an arbitrary slice and a point with positive margin. Let S=S(B,f,α) be any slice, and represent f(x)=∑nanxn by [L2]. On B one has sup⁡Re⁡f=∥f∥: the upper bound is the dual-norm inequality, and multiplying an almost norming vector by a scalar of modulus one makes its f-value real and nonnegative. By nonemptiness of the slice choose x∈S and put δ=Re⁡f(x)−(∥f∥−α)>0.

2.1L1L2step 1.1construct

Change one remote coordinate in both directions. Truncation convergence in [L2] gives an→0, so choose k with 2∣ak∣<δ. Define y,z by retaining all coordinates of x except yk=1 and zk=−1. Both sequences still tend to zero and have supremum norm at most one, so y,z∈B. Moreover

Re⁡f(y)≥Re⁡f(x)−∣ak∣ ∣1−xk∣>∥f∥−α,

and the same estimate with ∣−1−xk∣≤2 puts z in S. Thus ∥y−z∥∞=2.

3.1L1L3step 2.1

Compute every slice diameter and obtain nondentability. The triangle inequality bounds the diameter of B, and hence of S, by two; step 2.1 attains two. Therefore every slice of B has diameter exactly two. In particular no slice has diameter below one, so B is not dentable. The ball is nonempty, bounded, closed, and convex in the Banach space from [L1].

4.1A1L4step 3.1

Apply the RNP--dentability characterization. If c0 had RNP, [L4] would make its closed unit ball dentable, contradicting step 3.1. Hence c0 fails RNP over both scalar fields.

5.1A1L2L3step 2.1step 4.1∎

Record the zero-functional and endpoint cases. [A1, L2, L3, step 1.1, step 2.1, step 4.1] If f=0, the slice is all of B; take x=0 and any k, so the same y=ek, z=−ek witness diameter two. For nonzero f, the strict slice margin δ ensures both perturbed points remain inside rather than merely on its boundary. A zero coefficient ak causes no difficulty. The complex proof uses the bilinear c0--ℓ1 pairing and real parts exactly as in [L2]--[L3]; no conjugate is inserted. AC is used only through [L4].

Depends on

Used by

Dependency tree · two levels

20 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