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.
Norm closed convex iff weakly closed
Statement
Assume HB (The real dominated-extension principle as an additional hypothesis over ZF). In a real or complex normed space, a convex set is norm closed if and only if it is weakly closed. More generally, its norm and weak closures coincide. Convexity here uses real coefficients.
Facts & Assumptions
The weak topology is the initial topology of bounded scalar-linear functionals and is contained in the norm topology (Weak topology on a normed space).
Under HB, a point outside a nonempty norm-closed convex set is uniformly strictly separated by the real part of a bounded scalar-linear functional (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses).
Proof
Given: HB and a convex subset of a real or complex normed space .
Since weak-open sets are norm open, weak-closed sets are norm closed, and . If , both closures are empty.
For nonempty , put . It is convex: for and , approximate by points within any positive ; then and its distance from is less than . The cases are just . Thus is nonempty, closed and convex. For each , separation gives and a real level with for all .
The set is weakly open, contains and misses . Therefore , giving and equality of closures. If is norm closed this equality makes it weakly closed; the reverse implication was step 1.1.
Depends on
Used by
Dependency tree · two levels
13 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 (2017); exact harvest in batch coverage (standard reference, not scraped)
- Teschl, Topics in Real and Functional Analysis (2017); exact harvest in batch coverage (standard reference, not scraped)