Alphabeta Math
Pipeline-generated
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 and Weak Star Topologies — Examples

1 · Prerequisites

2 · Summary

These examples separate nearby convergence notions by explicit calculations. Coordinate vectors in ell-p for finite p greater than one are weakly null, while summation detects their failure at p equal to one. The specified predual changes weak-star convergence: coordinate vectors distinguish it from weak convergence on the dual of c0.

The square-root coordinate set has a weak closure point that no sequence in the set approaches weakly. Shift powers distinguish weak operator, strong operator and operator norm convergence. Finally, finite-support coordinate maps expose the completeness hypothesis in uniform boundedness, and a net carrying its own witness point converges weakly while its norms tend to infinity. The latter construction requires no neighborhood-indexed choice function.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Coordinate vectors converge weakly to zero in ell p

Example

In real or complex p, 1<p<, the coordinate vectors en converge weakly to zero, although enp=1.

Facts & Assumptions

[F1]

Put q=p/(p1), so 1/p+1/q=1 (Conjugate exponents, including the endpoint conventions). The sequence norm is xp=(kxkp)1/p (p is the Lp space of counting measure); for complex sequences apply this to their real nonnegative moduli.

[F3]

Weak convergence tests every bounded scalar-linear functional (Weak convergence of nets and sequences).

Verification

Given: 1<p< and a bounded scalar-linear F on p.

1.1

Put bk=F(ek). For a finite initial segment let vk=bkbkq2 if bk0, and vk=0 if bk=0; set other coordinates zero. For real scalars conjugation fixes bk. Then bkvk=bkq and vkp=bk(q1)p=bkq. If AN=k<Nbkq, linearity and boundedness give AN=F(v)FAN1/p. If AN=0 there is nothing to divide; otherwise AN1/qF.

givenF1F2algebra
2.1

The nondecreasing partial sums AN are bounded by Fq, so their nonnegative series converges and bk0. Indeed infinitely many bkε>0 would make arbitrarily large finite sums exceed that bound. For completeness finite Hölder bounds k<Nxkbkxpbq, so the coefficient pairing is absolutely convergent, consistently over both fields. In particular F(en)=bn0 for every F, giving weak convergence. Directly enp=(1p)1/p=1, so there is no norm convergence to zero.

step 1.1F1F2F3
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Coordinate vectors do not converge weakly to zero in ell one

Statement refuted

The coordinate vectors of real or complex 1 converge weakly to zero. In fact they have no weak limit.

Facts & Assumptions

[F1]

The 1 norm is the sum of absolute values (p is the Lp space of counting measure), applied to real moduli in the complex case.

[F2]

Weak convergence requires convergence of every bounded scalar-linear functional (Weak convergence of nets and sequences).

Counterexample

Given: en with value one at coordinate n and zero elsewhere in 1.

1.1

Define F(x)=k=0xk. Absolute convergence gives a scalar sum, linearity by limits of finite sums, and F(x)kxk=x1. Thus F(1), but F(en)=1 for every n, whereas F(0)=0. Therefore en cannot converge weakly to zero.

givenF1F2
2.1

More generally coordinate evaluation Pk(x)=xk is bounded since xkx1. If enx, then xk=limnPk(en)=0 for each fixed k, so x=0, already excluded by step 1.1. Thus there is no weak limit.

step 1.1F1F2
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Coordinate evaluations converge weak star to zero in ell one star

Example

For real or complex scalars, the coordinate functionals En(x)=xn on 1 are weak-star null and satisfy En=1. Under (1)=, these are the coordinate unit sequences.

Facts & Assumptions

[F1]

The complex identification is the bilinear isometry b(xkbkxk) (The complex continuous dual of ell-one is ell-infinity).

[F2]

The sequence norm is kxk (p is the Lp space of counting measure).

[F3]

Weak-star convergence means convergence on each fixed primal vector (Weak star convergence).

Verification

Given: the coordinate functionals on real or complex 1.

1.1

The complex coefficient identification is F1. For real scalars, a bounded sequence b defines hb(x)=kbkxk with hb(x)bx1. Conversely if h is bounded, bk=h(ek) satisfies bkh; finite truncations of x converge in norm because their error is the absolute series tail, so h(x)=kbkxk. Testing ek gives hbsupkbk, proving isometry and uniqueness. Thus the identification holds over either field.

givenF1F2
2.1

For every x1, convergence of kxk forces xn0. Hence En(x)0 for each fixed x, proving weak-star convergence. The inequality En(x)x1 and equality En(en)=1 give En=1 exactly.

step 1.1F2F3
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Weak star and weak topologies on a dual can differ

Statement refuted

The weak and weak-star topologies on a normed dual always coincide. They differ on 1=c0 over either the real or complex scalars.

Facts & Assumptions

[F1]

The dual of c0 is isometrically 1 under the bilinear pairing a(x)=kakxk (The continuous dual of c0 is ell-one).

[F2]

Weak-star convergence tests vectors of the specified predual (Weak star convergence), whereas weak convergence tests all bounded functionals on the space in question (Weak convergence of nets and sequences).

Counterexample

Given: en1=c0, the coordinate unit sequences.

1.1

For every xc0, en(x)=xn0 by the definition of c0. Hence en converges to zero for σ(1,c0).

givenF1F2
2.1

The scalar-linear map H(a)=kak on 1 is well-defined by absolute convergence and satisfies H(a)a1. Thus it is a weakly continuous functional on 1, but H(en)=1 for all n. The sequence is not weakly null. Equal topologies would have the same convergent sequences and limits, so the weak and the specified weak-star topologies differ.

step 1.1F2algebra
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Weak closure can exceed sequential weak closure

Statement refuted

Weak closure always consists of limits of sequences from the set. Assume HB (The real dominated-extension principle as an additional hypothesis over ZF) and Countable Choice (The Axiom of Countable Choice (ACω)). In real 2 the set A={nen:n1} is sequentially weakly closed, but 0AwA.

Facts & Assumptions

[F1]

The 2 norm is the square-sum norm (p is the Lp space of counting measure); the pair (2,2) is conjugate (Conjugate exponents, including the endpoint conventions) and finite Hölder gives Cauchy–Schwarz (Holder's inequality for finite sums and conjugate real exponents).

[F2]

Finite functional disks form weak neighborhoods (Basic weak neighborhoods).

[F3]

Under HB and Countable Choice weakly convergent sequences are norm bounded (Weakly convergent sequences are norm bounded); under HB the weak topology is Hausdorff (Weak topology is hausdorff).

Counterexample

Given: the set A above, with strictly positive indices.

1.1

For a bounded real functional F, put bn=F(en). Test F on vN=n=1Nbnen. Then BN=n=1Nbn2=F(vN)FBN, so BNF2, including BN=0. Thus (bn) is square summable. Finite Hölder and passage to increasing finite sums show nxnbnx2b2, consistent with these tests.

givenF1
2.1

Fix a basic weak neighborhood of zero given by F1,,Fm and ε>0. If it missed A, then for each n1 some j would have nFj(en)ε. Therefore jFj(en)2ε2/n. Summing over n contradicts the finite sum of square-summability bounds from step 1.1: the harmonic partial sums are unbounded since each block 2rn<2r+1 contributes at least 1/2. For m=0 the neighborhood is the whole space and already meets A. Thus every weak zero-neighborhood meets A, so 0Aw, while every member of A has norm n>0.

step 1.1F2algebra
3.1

If a sequence in A converges weakly, F3 bounds its norms by some finite C. Its indices therefore satisfy nC2, so its range lies in a finite subset of A. A finite set is closed in a Hausdorff space: each singleton is closed because every other point has a disjoint neighborhood, and finite unions are closed. The weak limit lies in this finite set, hence in A. Thus A is sequentially weakly closed but not weakly closed.

step 2.1F3
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Right shift powers converge in wot not sot

Example

On real or complex 2 indexed by k0, let R(x0,x1,)=(0,x0,x1,). Then Rn0 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.1

Put bk=F(ek) and test F on v=k<Nbkek. By F3, BN=F(v)=k<Nbk2FBN, giving BNF2, also when BN=0. Thus b2. Truncations converge in the square-sum norm, so F(x)=limNk<Nxkbk=kxkbk, with absolute convergence: F2 bounds every finite sum k<Nxkbk by x2b2, and the nonnegative partial sums converge to their finite supremum. The same finite inequality applied to tails gives the infinite tail bound used below.

givenF2F3
2.1

Consequently F(Rnx)=k0xkbk+n and F(Rnx)x2(jnbj2)1/20. This proves WOT convergence. But Rnx22=kxk2=x22, so at x=e0 the norms remain one. Thus SOT convergence to zero fails.

step 1.1F1F2
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Left shift powers converge in sot not operator norm

Example

On real or complex 2 indexed by k0, let L(x0,x1,)=(x1,x2,). Then Ln0 in SOT, while Ln=1 for every n0.

Facts & Assumptions

[F1]

SOT is convergence in norm on each fixed vector (Strong and weak operator topologies).

[F2]

The operator norm is the supremum of image norms on the unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Verification

Given: 2={x:k0xk2<} with square-sum norm and the left shift L.

1.1

The shift and its powers are scalar-linear and Lnx22=k0xk+n2=jnxj2x22. These tails tend to zero for every fixed x by convergence of its nonnegative series. Therefore each Ln is bounded and Ln0 in SOT.

givenF1
2.1

Step 1.1 gives Ln1. But Lnen=e0 and both coordinate vectors have norm one, so F2 gives Ln1. Thus the operator norms remain exactly one and cannot converge to zero. The witness varies with n, which is compatible with convergence on every fixed vector.

step 1.1F2
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Pointwise boundedness without a uniform bound on an incomplete domain

Statement refuted

Pointwise bounded sequences of bounded scalar-linear maps on an arbitrary normed domain have uniformly bounded norms. Completeness cannot be omitted, even when the sequence is pointwise eventually zero.

Facts & Assumptions

[F2]

Weak-star convergence in a dual means convergence on each fixed primal vector, with a limit in that dual (Weak star convergence).

Counterexample

Given: X=c00, the real or complex finitely supported sequences indexed by k1, with norm x=supkxk. Put T0=0 and Tn(x)=nxn for n1.

1.1

For n1, the map Tn is scalar-linear and Tn(x)nx, with equality at the unit vector en. Thus Tn=n for n1, while T0=0. For any fixed finitely supported x, Tn(x)=0 past its last nonzero index; hence the sequence (Tn)nN is pointwise bounded and even converges weak-star to the zero functional in X.

givenF1F2
2.1

To check incompleteness, let ak(m)=1/k for 1km and zero otherwise. For m>r, a(m)a(r)=1/(r+1), so these form a Cauchy sequence. A norm limit would have coordinate 1/k for each fixed k, since coordinate evaluation has norm at most one. That sequence is not finitely supported, so no limit exists in X. The pointwise convergence in step 1.1 therefore gives no uniform norm bound on this incomplete domain.

step 1.1givenalgebra
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

A weakly convergent net need not be eventually norm bounded

Statement refuted

Every weakly convergent net is eventually norm bounded. In every infinite-dimensional real or complex normed space there is a weakly null net whose norms tend to infinity, without any choice axiom.

Facts & Assumptions

[F1]

Finite-coordinate weak neighborhoods are a zero-neighborhood base (Basic weak neighborhoods).

[F2]

Every weak zero-neighborhood in infinite dimension is norm unbounded (Weak and norm topologies agree iff finite dimensional).

[F3]

Nets use nonempty directed preorders and weak convergence is neighborhood convergence (Weak convergence of nets and sequences).

Counterexample

Given: an infinite-dimensional normed space X.

1.1

Let D consist of all triples (U,n,x) where U is a weak zero-neighborhood, n1 an integer, xU, and xn. Define (U,n,x)(V,m,y) if VU and mn. This is reflexive and transitive. It is nonempty by F2. For two triples, UV is a weak zero-neighborhood and hence contains some z with zmax(n,m). The triple (UV,max(n,m),z) is a common upper bound. Thus D is directed; antisymmetry is unnecessary.

givenF1F2F3
2.1

Define the net by a(U,n,x)=x, the point already carried in the index. For a weak zero-neighborhood W, F2 gives at least one index (W,1,z). Every later index has neighborhood contained in W, so its carried point lies in W. Hence ad0. For any real R>0, take an integer n>R and any index with integer coordinate n, whose existence follows from F2. Every later index has carried-point norm at least n>R. Thus ad, and no tail is bounded. No choice function assigning one point to every neighborhood was used: all admissible points are included in the index set.

step 1.1F2F3

Sources