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.
Dual ball weak-star metrizable for a separable predual
Statement
Let be a real or complex normed space and let be a fixed dense sequence in . On every norm-bounded subset , the weak-star topology is induced by
The boundedness of is essential to this assertion; no metric on all of is claimed.
Facts & Assumptions
Given: A dense sequence in a real or complex normed space , a subset , and with for every .
The weak-star neighborhood basis consists of conditions on finitely many evaluations, and the topology is Hausdorff (Basic weak star neighborhoods).
Proof
The series defining converges because its terms lie between and . Symmetry and the triangle inequality follow from those of the absolute value and from . If , then for all ; for any , take for each the least index with . Then and . Thus . This also covers , when has at most one point.
Fix and a basic weak-star neighborhood . If , take any metric ball. Otherwise, when , choose with ; when the assertion is immediate. Put . If , then , and hence . Thus a -ball about lies in .
Conversely, given , choose so that and put . The weak-star neighborhood satisfies .
Step 2.1 makes every weak-star neighborhood contain a metric neighborhood, while step 2.2 makes every metric neighborhood contain a weak-star neighborhood. Hence the two relative topologies on agree.
Depends on
Used by
Dependency tree · two levels
2 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)