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.
Continuous dual of a weak star topology
Statement
Assume HB (The real dominated-extension principle as an additional hypothesis over ZF). Every weak-star continuous scalar-linear is evaluation at a unique . Existence alone is choice-free; HB is used for uniqueness.
Facts & Assumptions
Weak-star neighborhoods are finite evaluation disk intersections (Basic weak star neighborhoods).
Under HB, separates points of (Relative dual norming, point separation, and recovery of the norm).
Proof
Given: a real or complex normed space and a weak-star continuous scalar-linear ; assume HB for uniqueness.
Continuity at zero gives points and such that when for all . If all evaluations vanish, the same bound holds for every , forcing . Thus vanishes on the kernel of .
The rule is therefore well-defined and linear on . Take a finite basis of this image and extend it to a basis of , adding standard coordinate vectors successively. Extend by zero on added basis vectors. Writing its coordinate coefficients as gives . Set . Empty coordinates give and . This finite construction needs no choice axiom.
Every evaluation at a given is weak-star continuous. If give the same evaluation then for every . Under HB point separation implies . This includes the zero space and proves the asserted identification and its uniqueness.
Depends on
Used by
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)