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.

Strong and weak operator topologies

Definition

Let X,Y be normed spaces over the same field K{R,C}. On B(X,Y), the bounded scalar-linear operators of The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators, define:

  • The strong operator topology (SOT) is the initial topology of all maps TTx to normed Y, for xX.
  • The weak operator topology (WOT) is the initial topology of all scalar maps Tf(Tx), for xX and fY.

These topologies exist by The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology. Equivalently WOT is initial for TTx with the weak topology on Y from Weak topology on a normed space. At T, basic neighborhoods impose finitely many inequalities (ST)xj<ε for SOT, or fj((ST)xj)<ε for WOT, with ε>0. Empty lists give the whole operator space.

For a net of bounded operators with specified limit TB(X,Y), SOT convergence means (TiT)x0 for every fixed x, and WOT convergence means f(Tix)f(Tx) for every fixed x,f. Both equivalences follow by testing one coordinate and then using a common upper bound for the finitely many eventual indices in a basic neighborhood. No uniformity in x is part of either definition. These are choice-free constructions, also when one space is zero and the operator space is a singleton.

Depends on

Used by

Dependency tree · two levels

13 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