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 , the canonical image is weak-star dense in . No compactness or completeness hypothesis is used.
Facts & Assumptions
Given: HB, a real or complex normed space , and the canonical evaluation map .
Under HB the canonical bidual map is a scalar-linear isometry: and (Relative Hahn–Banach makes the canonical bidual map an isometry).
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).
Weak-star neighborhoods are determined by finitely many evaluations (Basic weak star neighborhoods).
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
By [F1], . This is where HB supplies the norm equality needed for the stated canonical isometric embedding.
Fix and a basic weak-star neighborhood determined by and . If , it contains . Suppose , put , , and let be the Euclidean closure of in , viewed as or . The set is nonempty, closed and convex because is nonempty and convex and is real-linear.
If , [F2] gives a nonzero real-linear functional and a real with for every . Every real-linear functional on has the form : in the complex case write its coefficients on real and imaginary coordinate vectors and take .
Put . The separation inequalities give . Yet : the inequality is the norm bound, while for any rotate or change its sign so that becomes the nonnegative real , and then take the supremum. Since , one also has .
The strict inequality in step 3.1 would therefore read , which is impossible. Hence .
Because lies in the closure of , the open coordinate box meets . Thus some satisfies for every , so belongs to the chosen neighborhood.
Every basic weak-star neighborhood of every therefore meets , including the empty-test and zero-space cases handled in step 1.2. This is exactly weak-star density.
Depends on
Used by
- Goldstine finite-data approximation Corollary
- Milman–Pettis theorem Theorem
- Reflexive iff unit ball weakly compact Theorem
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
- Bühler–Salamon, Functional Analysis (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis (standard reference, not scraped)