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 star to weak star continuous
Statement
Assume HB (The real dominated-extension principle as an additional hypothesis over ZF). For normed real or complex spaces , a bounded scalar-linear has weak-star continuous transpose , . Conversely every bounded weak-star continuous scalar-linear is for a unique bounded scalar-linear . No completeness or reflexivity is required. The forward implication is choice-free.
Facts & Assumptions
Under HB every weak-star continuous scalar-linear functional on is evaluation at a unique point of (Continuous dual of a weak star topology).
Under HB the norm is recovered as the supremum of absolute values under dual unit-ball functionals, which separate points (Relative dual norming, point separation, and recovery of the norm).
Proof
Given: the spaces and the maps of the respective assertions; HB for the converse.
For bounded , . Thus and is bounded and scalar-linear. For every , the composite of with evaluation at is evaluation at . Its inverse scalar-open sets are weak-star open by the defining evaluation topology in F1. Thus is weak-star continuous.
For the converse, fix . The map is weak-star continuous and scalar-linear, since is and evaluation at is. F1 gives a unique point with for all . Unique specification defines on all without choosing from a family of non-singleton sets. For scalars , evaluation gives for every . Point separation makes .
By F2 and boundedness of , . Hence is bounded, and its defining identity says . Any other preadjoint has the same evaluations at each and therefore equals by point separation. Zero spaces and satisfy the same formulas, with .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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)