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.
Transpose is weak to weak continuous
Statement
Every bounded scalar-linear between real or complex normed spaces is weak-to-weak continuous. Its transpose is continuous for and . No choice principle is needed.
Facts & Assumptions
The transpose is , a bounded functional of (The transpose of a bounded operator).
Weak convergence is coordinate convergence under bounded functionals, for arbitrary nets (Weak convergence of nets and sequences).
Proof
Given: a bounded scalar-linear map .
For , and . The inverse under of a weak subbasic set is , which is weakly open in . Inverse images preserve unions and finite intersections, proving continuity of . Equivalently, F2 gives for every weakly convergent net.
Taking the supremum over in the bound of step 1.1 gives , so is bounded. Apply the step 1.1 argument to this bounded map: for every , since . Thus inverse weak subbasic sets are weakly open, proving weak-to-weak continuity of . The estimates remain valid for zero maps and zero spaces.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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)