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.
Weak topology on a normed space
Definition
Let be a normed space over or , and let be its bounded -linear dual, with the operator norm, as in The dual space X^* of a normed space and its dual norm. The weak topology is the initial topology induced by all maps , , where the scalars have their usual topology. Explicitly it is generated by the subbasis
The initial-topology construction in The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology establishes existence and says that finite intersections of these sets form a basis. The empty intersection is . This is the coarsest topology making every bounded scalar-linear functional continuous, and it is contained in the norm topology. This definition uses no choice principle and does not assert separation of points without a norming hypothesis. For it is the unique topology on that singleton.
Remarks
In the complex case functionals are complex-linear; convexity in subsequent results means convexity for real coefficients, and real-valued separation inequalities use real parts. The topology is a topology on the entire space, not a sequence-convergence prescription.
Depends on
Used by
- Strong and weak operator topologies Definition
- Weak convergence of nets and sequences Definition
- Basic weak neighborhoods Lemma
- Norm closed convex iff weakly closed Theorem
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)