Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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 range and numerical radius

Definition

Let H be a nonzero complex Hilbert space and let TB(H) be a bounded linear operator (Hilbert space, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). The numerical range of T is the set of values of its quadratic form on the unit sphere,

W(T):={Tx,x: xH, x=1}C,

and the numerical radius of T is

w(T):=sup{z:zW(T)}.

Well-definedness. The unit sphere of a nonzero Hilbert space is nonempty, so W(T). For x=1 Cauchy–Schwarz gives Tx,xTxxT, so W(T) is a nonempty subset of the closed disc of radius T and the supremum w(T) is a real number satisfying 0w(T)T (Cauchy–Schwarz: x,yxy, with equality exactly for dependent pairs). The pairing is linear in its first variable and conjugate-linear in its second, so W(T) is the image of the unit sphere under a continuous map, but no closedness is claimed or used here.

The zero space and the zero operator. On the zero Hilbert space the unit sphere is empty; by convention W(0):={0} and w(0):=0 there, so that the numerical radius of the zero operator is 0 in every dimension. On a nonzero space the zero operator has W(0)={0} and w(0)=0 directly from the definition (Real and complex inner-product spaces and their induced length for the pairing convention, which is linear in the first variable throughout this page).

Two elementary facts used later. Since W(λT)=λW(T) for scalars λ, one has w(λT)=λw(T); and zT for every zW(T), so w(T)T always. Neither definiteness nor the triangle inequality for w is asserted at this point: they are proved on the next page, together with the equality w(T)=T for normal T.

Depends on

Used by

Dependency tree · two levels

17 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