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 closure of the unit sphere is the closed unit ball
Statement
Assume HB. In an infinite-dimensional real or complex normed space , the weak closure of is .
Facts & Assumptions
A weak neighborhood contains finitely many coordinate disk conditions (Basic weak neighborhoods).
Under HB, norm-closed convex sets are weakly closed (Norm closed convex iff weakly closed).
A continuous real function on a closed bounded interval takes every value between its endpoint values, choice-free (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Proof
Given: HB and infinite-dimensional .
The ball is convex by the triangle inequality and norm closed because . Thus is weakly closed and contains , giving .
Fix and a weak neighborhood of containing the conditions , . There is a nonzero with all : choose independent vectors in by finite induction; their images in are dependent, so a nonzero linear combination of the original vectors lies in the common kernel. This also covers .
If , the point itself works. If , put . The real function on satisfies , , and . The intermediate value theorem gives with . Then has for every , so lies in the given neighborhood. Every neighborhood of every meets , proving and equality.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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)