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 \to Y$ (A bounded linear operator between normed spaces). If $\sup_{T \in F} ∥ T x ∥ < \infty$ for every $x \in X$ , then $\sup_{T \in F} ∥ T ∥ < \infty$ , 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.1

Put $E_{n} = {x : \sup_{T \in F} ∥ T x ∥ \leq n}$ . Each $E_{n}$ is closed (an intersection of inverse images of closed balls), and pointwise boundedness gives $X = ⋃_{n \geq 1} E_{n}$ .

given

2.1

By Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior, some $E_{N}$ contains a ball $B (x_{0}, r)$ .

step 1.1

3.1

For $∥ h ∥ < r$ , both $x_{0}$ and $x_{0} + h$ lie in that ball, so $∥ T h ∥ \leq ∥ T (x_{0} + h) ∥ + ∥ T x_{0} ∥ \leq 2 N$ for every $T$ .

step 2.1

4.1

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

step 3.1algebra∎

Depends on

Used by

Dependency tree · two levels

9 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

Buhler--Salamon, Functional Analysis, Theorem 2.1 (standard reference, not scraped)