Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Uniform boundedness principle

Statement

Assume DC. Let X be a Banach space, Y a normed space, and let F be a family of bounded linear operators X→Y (A bounded linear operator between normed spaces). If sup⁡T∈F∥Tx∥<∞ for every x∈X, then sup⁡T∈F∥T∥<∞, where the norm is The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

Facts & Assumptions

Given: DC, X,Y,F as in the statement, and pointwise boundedness.

Proof

technique · direct
1.1given

Put En={x:sup⁡T∈F∥Tx∥≤n}. Each En is closed (an intersection of inverse images of closed balls), and pointwise boundedness gives X=⋃n≥1En.

3.1step 2.1

For ∥h∥<r, both x0 and x0+h lie in that ball, so ∥Th∥≤∥T(x0+h)∥+∥Tx0∥≤2N for every T.

4.1step 3.1algebra∎

Rescaling a nonzero x to h=rx/(2∥x∥) yields ∥Tx∥≤4N∥x∥/r; the same is clear for x=0. Thus ∥T∥≤4N/r for every T.

Depends on

Used by

Dependency tree · two levels

10 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