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.

Reflexive spaces have the Radon--Nikodym property

Statement

Assume the Axiom of Choice. Every real or complex reflexive Banach space has the Radon--Nikodym property.

Facts & Assumptions

[A1]

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

[L1]

AC implies Countable Choice and proves the real dominated Hahn--Banach principle; the complex norm-preserving extension theorem supplies the complex instances (AC supplies the countable and dependent choices used in Banach integration, Hahn-Banach dominated extension theorem for real vector spaces, A bounded complex linear functional on a subspace of a complex normed space extends with the same norm).

[L2]

Under relative Hahn--Banach, closed subspaces of reflexive Banach spaces are reflexive (Closed subspaces of reflexive spaces are reflexive) and the canonical map into the bidual is an isometry (Relative Hahn–Banach makes the canonical bidual map an isometry).

[L3]

Under AC, a norm-separable dual Banach space has RNP (Separable dual spaces have the Radon--Nikodym property), and RNP is invariant under Banach space isomorphism (RNP is invariant under Banach-space isomorphism).

[L4]

Under AC, a Banach space has RNP exactly when all its closed separable subspaces have RNP (RNP is separably determined).

[L5]

Reflexivity is surjectivity of the canonical evaluation map (Reflexivity is surjectivity of the canonical map), while separability means the existence of an at most countable norm-dense subset (Separability: the existence of an at most countable dense subset).

Proof

technique · direct

Given: AC and a reflexive Banach space X.

1.1

Discharge the choice hypotheses of the reflexivity suppliers. By [L1], AC supplies Countable Choice and every instance of the relative Hahn--Banach principle used below.

givenA1L1
2.1

Reduce to one closed separable subspace. Let YX be an arbitrary closed separable linear subspace. By [L2], Y is a reflexive Banach space. Thus its canonical map JY:YY is onto by [L5] and is an isometry by [L2].

givenL2L4step 1.1
3.1

Exhibit the bidual as a separable dual space. Choose an at most countable norm-dense subset DY. The image JY[D] is at most countable and is dense in Y: if Φ=JYy and dD approximates y, then ΦJYd=yd. Hence Y=(Y) is a norm-separable dual Banach space. Moreover JY is a bounded linear bijection with bounded inverse, indeed an isometry.

L2L5step 2.1
4.1

Transfer RNP from the bidual back to the subspace. The separable-dual theorem [L3] gives RNP to Y. Isomorphism invariance along JY then gives RNP to Y.

A1L3step 3.1
5.1

Apply separable determination. The closed separable subspace Y was arbitrary, so every closed separable subspace of X has RNP. The reverse implication in [L4] therefore gives RNP to X.

A1L4step 2.1step 4.1
6.1

Record the scope and degenerate cases. [A1, step 1.1, step 3.1, step 5.1] If X={0}, its sole closed subspace, bidual, vector measures, and densities are zero, so the same proof applies. A zero subspace has the singleton dense set and its canonical map is the zero bijection. The argument works in both scalar fields because [L2] and [L3] do. AC is used exactly to supply relative Hahn--Banach and Countable Choice in steps 1.1--3.1 and through the two RNP suppliers [L3]--[L4]. No dual-reflexivity theorem or unstated canonical-map isometry is used.

A1step 1.1step 3.1step 5.1

Depends on

Used by

Dependency tree · two levels

50 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