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 star convergence

Definition

Let X be a real or complex normed space and (fi)i∈I a net in X∗ indexed by a nonempty directed preorder (Directed preorders and nets). For a specified f∈X∗, write fi⇀∗f if fi converges to f in the weak-star topology. By Convergence and cluster points of a net in a topological space and Basic weak star neighborhoods, this means equivalently

∀x∈X ∀ε>0 ∃i0∈I ∀i≥i0:∣fi(x)−f(x)∣<ε.

Topological convergence implies each displayed eventual condition by taking a one-evaluation neighborhood. Conversely, for a finite-evaluation neighborhood choose the finitely many eventual indices and take a common upper bound in I; past it all inequalities hold. An empty coordinate list imposes no condition. This proves both directions without any choice axiom. For sequences take I=N.

The asserted limit belongs to the bounded dual: this definition does not identify an arbitrary pointwise limit of bounded functionals with a member of X∗. The limit, when it exists, is unique, since equality of all evaluations is equality of functions. Constant nets converge to their constant value, also when X={0}.

Depends on

Used by

Dependency tree · two levels

8 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