Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 complete domain is necessary for sequential uniform boundedness

Statement refuted

Every pointwise bounded sequence of bounded linear operators between normed spaces has uniformly bounded operator norms, even when the domain is not assumed complete.

Facts & Assumptions

Given: K{R,C} and N={0,1,}. We construct the domain and operators below in ZF, without choice.

[F1]

c0(K) is the normed space of bounded null sequences with coordinatewise operations and supremum norm (The sequence spaces c_0 and ell-infinity).

[F2]

A linear subspace carries the restriction of the ambient norm (Normed subspace).

[F3]

The real field has the least-upper-bound property and is a complete ordered field (The Cauchy-sequence reals have the least-upper-bound property).

[F4]

A finite set admits a bijection from a von Neumann natural m={0,,m1} (Finite, countably infinite, countable, uncountable); a subset of a finite set is finite (A subset of a finite set is finite, with BA, and equality holds if and only if B=A, clause 1).

[F5]

The natural order is defined additively and has trichotomy (Order on the natural numbers, Trichotomy of the order on N).

[F6]

The zero base and successor implication prove a property for every natural (The principle of mathematical induction).

[F8]

A bound TxCx makes a linear map bounded (A bounded linear operator between normed spaces), and its operator norm is the unit-ball supremum (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F9]

The naturals are cofinal in a complete ordered field, and their positive reciprocals get below every positive bound (Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[F10]

Banach means that every norm-Cauchy sequence converges in the space (Banach space).

Counterexample

1.1

Define c00={xc0:MN jM, xj=0}. Its zero vector has cutoff M=0. If x,y have cutoffs M,N and a,bK, then ax+by vanishes for jM+N, since M+NM,N. It is therefore a vector subspace of c0, normed by the inherited supremum norm. The same argument is valid over C, using the modulus convention.

F1F2F5F7givenalgebra
2.1

This is exactly the finite-support space. If x has cutoff M, its support {j:xj0} is a subset of the finite natural M, hence finite. Conversely, every finite support F has a bijection f:mF. We prove the range of every map f:mN has a natural upper bound by induction on m. At m=0, use bound 0. At m=r+1, the restriction to r has a bound L by the induction hypothesis; choose the larger of L and f(r) by trichotomy. This bounds the old values and the one new value at r, hence the whole range. Induction gives a bound L for F, so xj=0 for jL+1. A scalar sequence with finite support is bounded as well: successively taking the maximum of 0 and the finitely many xf(i) gives a real bound, and the cutoff makes it null. Thus this converse applies to arbitrary finite-support scalar sequences, not only those already presented in c0.

F1F4F5F6step 1.1
2.2

For each n0 define Tn:c00K by Tnx=nxn. For scalars a,b, Tn(ax+by)=n(axn+byn)=aTnx+bTny. Also Tnx=nxnnx, so Tn is bounded and its unit-ball supremum is at most n. For n1, let en have coordinate 1 at n and zero elsewhere. It belongs to c00, has norm 1, and Tnen=n, giving Tn=n. At n=0, T0=0 and its norm is zero; at n=1, T1e1=1.

F3F7F8step 1.1algebra
3.1

For x with cutoff M, Tnx=0 when nM. For n<M, TnxnxMx. Thus Mx=Mx bounds the entire orbit, also when M=0 and x=0. On the other hand, given any real C, Archimedean cofinality gives n>C, and Tn=n>C. The sequence is pointwise bounded but its operator norms are unbounded.

F3F9step 1.1step 2.2algebra
3.2

For N0, let zj(N)=1/(j+1) if jN and zj(N)=0 otherwise. Its support is {0,,N}, so it lies in c00. For M>N, the difference has nonzero coordinates precisely N<jM, where its magnitude is 1/(j+1)1/(N+2). Equality is attained at j=N+1. Hence z(M)z(N)=1/(N+2); for M=N it is zero. Given ε>0, take K1 with 1/K<ε using the reciprocal property in the real field. For any M,NK, symmetry and the displayed formula bound the distance by 1/(K+2)<ε. Thus this sequence is norm-Cauchy.

F1F3F9step 2.1algebra
4.1

If it had norm limit zc00, then for each fixed j and every Nj, zj1/(j+1)=zjzj(N)zz(N)0. A constant nonnegative real bounded by a null sequence is zero: if positive, eventually that upper bound is smaller than half the constant. Therefore zj=1/(j+1)0 for every j. This contradicts the cutoff of z established in step 1.1. The Cauchy sequence has no limit in c00, so the domain is not Banach. Together with step 3.1 this exhibits exactly the failure when completeness of the domain is omitted.

F10step 1.1step 3.1step 3.2algebra

Remarks

The witness Tnx=nxn and its verification are library-generated as specified by the design. MIT 18.102 notes, printed pp.5–6, Definition 14 and the discussion following Theorem 16 provide the completeness and sequence-space setting, not attribution of this exact counterexample. All operators, vectors, and finite-support bounds above are explicit; the example makes no claim about failure of a choice principle.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

57 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