Alphabeta Math
CounterexampleConstruction: 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.

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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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