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 compact does not imply weak-star sequentially compact
Statement
Assume the ultrafilter lemma. The weak-star compact closed unit ball of need not be weak-star sequentially compact.
Facts & Assumptions
Given: The ultrafilter lemma and the real or complex Banach space .
Under the ultrafilter lemma every closed dual unit ball is weak-star compact (Banach–Alaoglu).
Weak-star convergence of a sequence means convergence of its evaluations at every predual vector (Weak star convergence).
The elements of are bounded scalar sequences with the supremum norm (The sequence spaces c_0 and ell-infinity).
Proof
For each define by . Then and equality holds at the th coordinate vector, so .
Consider any subsequence , with the indices strictly increasing. Define by and off the range of . This is well defined because the indices are distinct and has by [F3].
Its evaluations are , which do not converge in or . By [F2], the chosen subsequence is not weak-star convergent. Since the subsequence was arbitrary, has no weak-star convergent subsequence.
Nevertheless [F1] makes the closed unit ball containing this sequence weak-star compact under the ultrafilter lemma. It is therefore a compact space with a sequence having no convergent subsequence, as claimed.
Depends on
Used by
Nothing in the library uses this result yet.
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 (standard reference, not scraped)