Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 X be a real or complex normed space. Let I be a nonempty directed preorder and (xi)iI a net in X (Directed preorders and nets). For xX, write xix and say the net converges weakly to x when it converges to x in σ(X,X) (Weak topology on a normed space, Convergence and cluster points of a net in a topological space). Equivalently,

fX ε>0 i0I ii0:f(xi)f(x)<ε.

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 x. 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 I. This proves the equivalence without a choice axiom.

A weakly convergent sequence is this definition with I=N 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 X; 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

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