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:X→X∗∗.

[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.1F1F4

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

1.2F3given

Fix x∗∗∈BX∗∗ and a basic weak-star neighborhood determined by f1,…,fm∈X∗ and ε>0. If m=0, it contains JX(0). Suppose m≥1, 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.

2.1F2step 1.2

If v∉C, [F2] gives a nonzero real-linear functional ℓ and a real b with ℓ(z)≤b<ℓ(v) for every z∈C. Every real-linear functional on Km has the form ℓ(z)=Re⁡∑j=1mcjzj: in the complex case write its coefficients on real and imaginary coordinate vectors and take cj=aj−ibj.

3.1step 2.1algebra

Put f=∑jcjfj∈X∗. The separation inequalities give sup⁡x∈BXRe⁡f(x)<Re⁡x∗∗(f). Yet sup⁡x∈BXRe⁡f(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 ∥x∗∗∥≤1, one also has Re⁡x∗∗(f)≤∣x∗∗(f)∣≤∥f∥.

4.1step 3.1

The strict inequality in step 3.1 would therefore read ∥f∥<Re⁡x∗∗(f)≤∥f∥, which is impossible. Hence v∈C.

5.1F1step 1.2step 4.1

Because v lies in the closure of T(BX), the open coordinate box {z:∣zj−vj∣<ε, 1≤j≤m} meets T(BX). Thus some x∈BX satisfies ∣JX(x)(fj)−x∗∗(fj)∣<ε for every j, so JX(x) belongs to the chosen neighborhood.

6.1F3step 1.1step 1.2step 5.1∎

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

Depends on

Dependency tree · 2 levels

Sources