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.
A weakly convergent net need not be eventually norm bounded
Statement refuted
Every weakly convergent net is eventually norm bounded. In every infinite-dimensional real or complex normed space there is a weakly null net whose norms tend to infinity, without any choice axiom.
Facts & Assumptions
Finite-coordinate weak neighborhoods are a zero-neighborhood base (Basic weak neighborhoods).
Every weak zero-neighborhood in infinite dimension is norm unbounded (Weak and norm topologies agree iff finite dimensional).
Nets use nonempty directed preorders and weak convergence is neighborhood convergence (Weak convergence of nets and sequences).
Counterexample
Given: an infinite-dimensional normed space .
Let consist of all triples where is a weak zero-neighborhood, an integer, , and . Define if and . This is reflexive and transitive. It is nonempty by F2. For two triples, is a weak zero-neighborhood and hence contains some with . The triple is a common upper bound. Thus is directed; antisymmetry is unnecessary.
Define the net by , the point already carried in the index. For a weak zero-neighborhood , F2 gives at least one index . Every later index has neighborhood contained in , so its carried point lies in . Hence . For any real , take an integer and any index with integer coordinate , whose existence follows from F2. Every later index has carried-point norm at least . Thus , and no tail is bounded. No choice function assigning one point to every neighborhood was used: all admissible points are included in the index set.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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)