Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Weakly convergent sequences are norm bounded

Statement

Assume HB (The real dominated-extension principle as an additional hypothesis over ZF) and the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Every weakly convergent sequence in a real or complex normed space is norm bounded. If X is Banach, every weak-star convergent sequence in X is norm bounded; this second assertion needs only Countable Choice.

Facts & Assumptions

[F1]

Weak convergence means convergence under each bounded scalar-linear functional (Weak convergence of nets and sequences).

[F2]

Under HB the canonical map JX(x)(f)=f(x) satisfies JXx=x (Relative Hahn–Banach makes the canonical bidual map an isometry).

[F3]

If the target is Banach, its bounded-operator space from any normed domain is Banach (If (Y) is Banach then (\mathcal B(X,Y)) is Banach).

[F4]

Under Countable Choice, a pointwise bounded sequence of bounded operators on a Banach domain has uniformly bounded operator norms (Sequential uniform boundedness under countable choice).

Proof

Given: the stated axioms and a weakly convergent sequence xnx in X; for the second assertion, a Banach X and a weak-star convergent sequence fnf in X.

1.1

For every gX, the scalar sequence g(xn) converges to g(x), hence is bounded: a tail has modulus at most g(x)+1, and finitely many preceding moduli have a finite maximum. The maps JXxn:XK are therefore pointwise bounded bounded linear maps. Their domain X=B(X,K) is Banach since K is complete.

givenF1F2F3
2.1

Sequential uniform boundedness applied to these maps gives supnJXxn<. The HB isometry makes this supnxn<. Countable Choice is used exactly in F4; HB is used only in F2, and completeness of X was not required.

step 1.1F4F2
3.1

For the second assertion, each scalar sequence fn(y) converges for fixed yX, so the same finite-head/tail estimate from step 1.1 gives pointwise boundedness. Apply F4 directly on the assumed Banach domain X to obtain supnfn<. No bidual norming or HB is used in this case. If either domain is zero, all its operator norms are zero, so the same conclusions hold.

step 2.1step 1.1F4given

Depends on

Used by

Dependency tree · two levels

32 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