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 convergence of nets and sequences
Definition
Let be a real or complex normed space. Let be a nonempty directed preorder and a net in (Directed preorders and nets). For , write and say the net converges weakly to when it converges to in (Weak topology on a normed space, Convergence and cluster points of a net in a topological space). Equivalently,
Indeed, topological convergence implies each of these eventual conditions because the inverse disk is a neighborhood. Conversely, a neighborhood contains a finite intersection of inverse scalar neighborhoods containing . Coordinate convergence gives an eventual index for each of the finitely many conditions; directedness gives a common upper bound for them, after which the whole intersection contains the net. For the empty intersection use any index of the nonempty . This proves the equivalence without a choice axiom.
A weakly convergent sequence is this definition with in its usual order. A constant net converges weakly to its value, including in the zero space. The specified limit must be a point of ; without a separation hypothesis uniqueness is not part of the definition. Weak closure continues to mean topological closure, not merely the set of limits of sequences.
Depends on
Used by
- Weak convergence implies lower semicontinuity of the norm Corollary
- A weakly convergent net need not be eventually norm bounded Counterexample
- Coordinate vectors do not converge weakly to zero in ell one Counterexample
- Weak star and weak topologies on a dual can differ Counterexample
- Coordinate vectors converge weakly to zero in ell p Example
- Transpose is weak to weak continuous Theorem
- Weakly convergent sequences are norm bounded Theorem
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 (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)