Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Goldstine's theorem

Statement

Assume HB. For every real or complex normed space X, the canonical image JX(BX) is weak-star dense in BX. No compactness or completeness hypothesis is used.

Facts & Assumptions

Given: HB, a real or complex normed space X, and the canonical evaluation map JX:XX.

[F1]

Under HB the canonical bidual map is a scalar-linear isometry: JX(x)(f)=f(x) and JXx=x (Relative Hahn–Banach makes the canonical bidual map an isometry).

[F2]

A point outside a nonempty closed convex subset of a finite-dimensional real Euclidean space admits strict real-linear separation (A point outside a nonempty closed convex set is strictly separated from it).

[F3]

Weak-star neighborhoods are determined by finitely many evaluations (Basic weak star neighborhoods).

[F4]

HB is the real dominated-extension principle, with no topology or completeness hypothesis (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

technique · direct
1.1

By [F1], JX(BX)BX. This is where HB supplies the norm equality needed for the stated canonical isometric embedding.

F1F4
1.2

Fix xBX and a basic weak-star neighborhood determined by f1,,fmX and ε>0. If m=0, it contains JX(0). Suppose m1, put T(x)=(f1(x),,fm(x)), v=(x(f1),,x(fm)), and let C be the Euclidean closure of T(BX) in Km, viewed as Rm or R2m. The set C is nonempty, closed and convex because BX is nonempty and convex and T is real-linear.

F3given
2.1

If vC, [F2] gives a nonzero real-linear functional and a real b with (z)b<(v) for every zC. Every real-linear functional on Km has the form (z)=Rej=1mcjzj: in the complex case write its coefficients on real and imaginary coordinate vectors and take cj=ajibj.

F2step 1.2
3.1

Put f=jcjfjX. The separation inequalities give supxBXRef(x)<Rex(f). Yet supxBXRef(x)=f: the inequality is the norm bound, while for any x rotate or change its sign so that f(x) becomes the nonnegative real f(x), and then take the supremum. Since x1, one also has Rex(f)x(f)f.

step 2.1algebra
4.1

The strict inequality in step 3.1 would therefore read f<Rex(f)f, which is impossible. Hence vC.

step 3.1
5.1

Because v lies in the closure of T(BX), the open coordinate box {z:zjvj<ε, 1jm} meets T(BX). Thus some xBX satisfies JX(x)(fj)x(fj)<ε for every j, so JX(x) belongs to the chosen neighborhood.

F1step 1.2step 4.1
6.1

Every basic weak-star neighborhood of every xBX therefore meets JX(BX), including the empty-test and zero-space cases handled in step 1.2. This is exactly weak-star density.

F3step 1.1step 1.2step 5.1

Depends on

Used by

Dependency tree · two levels

14 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