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

The operator norm is a norm on the space of bounded linear operators

Statement

Let X and Y be normed spaces over the same scalar field. On the vector space B(X,Y) of bounded linear operators, the operator norm of The operator norm as the least bound and as the unit-sphere or unit-ball supremum is a norm.

Facts & Assumptions

Given: Bounded linear operators S,T∈B(X,Y), a scalar λ, and a vector x∈X.

[L1]

The operator norm is the supremum of ∥Tx∥ over the unit ball of X, and it satisfies ∥Tx∥≤∥T∥ ∥x∥ for every x∈X (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[L2]

B(X,Y) is the space of bounded linear operators, with pointwise addition and scalar multiplication (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators).

Proof

technique · direct
1.1L1algebra

By [L1], ∥T∥≥0 for every T∈B(X,Y). If ∥T∥=0, then ∥Tx∥≤0 for every x with ∥x∥≤1, so Tx=0 there. If x≠0, apply this to u:=x/∥x∥ to get Tu=0, hence Tx=∥x∥Tu=0. Thus ∥T∥=0 implies T=0.

1.2L1

Conversely, if T=0 then ∥Tx∥=0 for every x in the unit ball, so the supremum in [L1] is 0. This proves definiteness.

1.3L1L2algebra

For every x with ∥x∥≤1, [L2] and [L1] give ∥(λT)x∥=∣λ∣ ∥Tx∥≤∣λ∣ ∥T∥. Taking the supremum over the unit ball yields ∥λT∥≤∣λ∣ ∥T∥. The reverse inequality is immediate when λ=0, and for λ≠0 the same estimate applied to T=λ−1(λT) gives ∥T∥≤∣λ∣−1∥λT∥. Hence ∥λT∥=∣λ∣ ∥T∥.

1.4L1L2algebra

For every x with ∥x∥≤1, [L2] and [L1] give ∥(S+T)x∥≤∥Sx∥+∥Tx∥≤∥S∥+∥T∥. Taking the supremum over the unit ball gives ∥S+T∥≤∥S∥+∥T∥.

2.1step 1.1step 1.2step 1.3step 1.4∎

Steps 1.1, 1.2, 1.3, and 1.4 are the norm axioms, so the operator norm is a norm on B(X,Y).

Depends on

Used by

Dependency tree · two levels

5 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