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-star compactness of polar sets
Statement
Assume the ultrafilter lemma. Let be a real or complex normed space and let be a norm-neighborhood of . Then its absolute polar
is weak-star compact. Neither convexity nor balancedness of is required.
Facts & Assumptions
Given: The ultrafilter lemma, a real or complex normed space , and a norm-neighborhood of zero.
Under the ultrafilter lemma the closed dual unit ball is weak-star compact, without completeness of the predual (Banach–Alaoglu).
Finite evaluation sets form a weak-star neighborhood basis, and scalar multiplication is continuous in the weak-star topology (Basic weak star neighborhoods).
The absolute polar is (Absolute polar in a normed dual pair).
Proof
Choose with and put . Then . If and , then , whence . Thus and .
The polar is weak-star closed. Indeed, if , some satisfies ; the basic neighborhood misses by the reverse triangle inequality.
The map is a weak-star homeomorphism with inverse , by continuity of scalar multiplication. It carries onto , so the latter is compact by [F1]. The ultrafilter lemma enters only through [F1].
By steps 1.1 and 1.2, is a closed subset of the compact space in step 1.3. Adding its open complement to any open cover of gives an open cover of that compact space, so deleting the complement from a finite subcover proves that is compact. For this says that a singleton is compact.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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)