Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Numerical radius is an equivalent operator norm

Statement

Assume AC. On a complex Hilbert space, w is a norm with w(T)T2w(T) for every bounded T; if T is normal, then w(T)=T.

Facts & Assumptions

[A1]

On a nonzero space, W(T)={Tx,x:x=1} and w(T)=sup{z:zW(T)}, with 0w(T)T and W(λT)=λW(T) (Numerical range and numerical radius). On the zero space, W(0)={0} and w(0)=0 by the same convention. For every vector z, Tz,zw(T)z2: this is immediate for z=0, and otherwise follows by applying the unit-vector definition to z/z.

[A3]

TxTx and T=sup{Tx:x1}; in particular for x=y=1 one has Tx,yT (The operator norm as the least bound and as the unit-sphere or unit-ball supremum). On a nonzero domain the same supremum may be taken over x=1; on a zero domain the unit-ball supremum is 0.

[A4]

Sx,y=x,Sy, and TλI is normal whenever T is normal (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities, Self-adjoint, positive, unitary and normal operators). Indeed the adjoint of TλI is TλI, and expanding the products in both orders shows their difference is TTTT.

[A5]

For a normal operator on a nonzero complex Hilbert space, T=r(T)=max{λ:λσ(T)} (Normal operator norm equals spectral radius).

[A6]

λσ(T) exactly when TλI is not bijective with bounded inverse (Spectrum and resolvent of a bounded operator).

[A7]

(ranS)=kerS and ranS=(kerS); a Hilbert space is complete, and H=kerS(kerS) for the closed kernel (Kernel–range orthogonality for Hilbert adjoints, Hilbert space, Orthogonal decomposition by a closed subspace).

[A8]

The inner product is linear in the first and conjugate-linear in the second variable (Real and complex inner product spaces, with the inner product linear in the first argument). Its norm satisfies the parallelogram law (The parallelogram law). Complex modulus satisfies the triangle inequality (Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive, Real and imaginary parts, complex conjugation, and modulus). Polarization of the possibly non-Hermitian form Tx,y below is proved by expansion, not by applying a theorem for inner products to that form.

[A9]

AC supplies the spectral-radius hypothesis and all countable selections made here (The Axiom of Choice). The reciprocal Archimedean property gives 1/(n+1)0 (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

Proof

technique · direct

Given: AC, a complex Hilbert space H and bounded operators S,TB(H). Steps 1.1–3.2 treat H{0}; the zero space is treated explicitly in step 4.1.

1.1

For arbitrary vectors x,y the expansion of the complex sesquilinear form B(x,y):=Tx,y gives 4B(x,y)=B(x+y,x+y)B(xy,xy)+iB(x+iy,x+iy)iB(xiy,xiy).

A3A8algebra
1.2

sup{Tx,y:x1,y1}=T: the upper bound is Cauchy–Schwarz and the operator-norm bound, and taking y=Tx/Tx when Tx0 recovers Tx. The same supremum over unit x,y equals T: [A3] gives the unit-sphere formula for the operator norm on nonzero H, and the preceding choice of y works whenever Tx0; when T=0 all values are zero.

A2A3algebra
1.3

If w(T)=0 then Tx,x=0 for every x, and applying the expansion of the form (x,y)Tx,y to the zero diagonal values gives Tx,y=0 for all x,y, hence T=0.

A1A8algebra
1.4

If S is normal, then Sx=Sx for every x, because Sx2=SSx,x=SSx,x=Sx2.

A4algebra
2.1

w is a norm on B(H): homogeneity is w(λT)=λw(T) from W(λT)=λW(T), the triangle inequality follows from (S+T)x,xSx,x+Tx,xw(S)+w(T) on unit vectors, and definiteness is step 1.3.

step 1.3A1algebra
2.2

For unit vectors x,y one has Tx,y2w(T): the expansion of step 1.1 writes 4Tx,y as a signed sum of the four values Tz,z at z=x+y,xy,x+iy,xiy, so 4Tx,yzTz,zw(T)zz2, and the four squared norms sum to x+y2+xy2+x+iy2+xiy2=4(x2+y2)=8, whence 4Tx,y8w(T).

step 1.1A1A8algebra
2.3

If T is normal and λσ(T), then TλI is not bounded below: if (TλI)xcx for some c>0, its kernel would be zero and its range would be closed. To see closedness, for any point v in its range closure, AC chooses un with (TλI)unv<1/(n+1). The lower bound makes (un) Cauchy; completeness gives a limit u, and boundedness gives (TλI)u=v. Furthermore, normality gives ker(TλI)=ker(TλI)={0} by equality of the two kernel norms, so the range would be dense, hence all of H, making TλI invertible with inverse bound 1/c, contrary to λσ(T).

step 1.4A4A6A7A9algebra
3.1

Hence w(T)T and T2w(T): the first is the definition, and the second follows by taking the supremum of Tx,y2w(T) over unit x,y and using step 1.2, which identifies that supremum with T.

step 2.2step 1.2A1A8
3.2

If T is normal then σ(T)W(T): for each n the failure of a lower bound in step 2.3 gives a unit vector at tolerance 1/(n+1), and AC selects unit vectors xn with (TλI)xn<1/(n+1), and then Txn,xnλ=(TλI)xn,xn(TλI)xn0, so λw(T) for every λσ(T) and r(T)w(T).

step 2.3A1A2A9
4.1

If H={0}, its operator space consists only of 0; [A1] and [A3] give w(0)=0=0, which defines a norm on this zero vector space and proves both estimates and the normal equality there, without any spectral maximum. For H{0}, therefore w is a norm with w(T)T2w(T), and for normal T the chain T=r(T)w(T)T gives w(T)=T.

step 2.1step 3.1step 3.2A1A3A5

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