Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

Right shift powers converge in wot not sot

Example

On real or complex ℓ2 indexed by k≥0, let R(x0,x1,…)=(0,x0,x1,…). Then Rn→0 in WOT but not in SOT.

Facts & Assumptions

[F1]

SOT tests pointwise norm convergence; WOT tests each bounded scalar functional on each fixed vector (Strong and weak operator topologies).

[F2]

Sequence norms use square sums (ℓp is the Lp space of counting measure). Finite real Cauchy–Schwarz bounds sums of products of nonnegative coordinate moduli (The Cauchy-Schwarz inequality for finite sums).

Verification

Given: the right shift R and a bounded scalar-linear F on ℓ2.

1.1givenF2F3

Put bk=F(ek) and test F on v=∑k<Nb‾kek. By F3, BN=F(v)=∑k<N∣bk∣2≤∥F∥BN, giving BN≤∥F∥2, also when BN=0. Thus b∈ℓ2. Truncations converge in the square-sum norm, so F(x)=lim⁡N∑k<Nxkbk=∑kxkbk, with absolute convergence: F2 bounds every finite sum ∑k<N∣xkbk∣ by ∥x∥2∥b∥2, and the nonnegative partial sums converge to their finite supremum. The same finite inequality applied to tails gives the infinite tail bound used below.

2.1step 1.1F1F2

Consequently F(Rnx)=∑k≥0xkbk+n and ∣F(Rnx)∣≤∥x∥2(∑j≥n∣bj∣2)1/2→0. This proves WOT convergence. But ∥Rnx∥22=∑k∣xk∣2=∥x∥22, so at x=e0 the norms remain one. Thus SOT convergence to zero fails. □

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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