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.

Self adjoint norm and spectrum extrema

Statement

Assume AC. If T∈B(H) is bounded and self-adjoint on a nonzero complex Hilbert space H, then min⁡σ(T) I≤T≤max⁡σ(T) I, these bounds are sharp, and ∥T∥=max⁡{∣min⁡σ(T)∣,∣max⁡σ(T)∣}.

Facts & Assumptions

[A1]

For self-adjoint T the calculus sends z to T, and continuous composition and positivity hold: f(T) is positive whenever f≥0, and ∥f(T)∥=∥f∥∞ (Continuous functional calculus for bounded self adjoint operators, Continuous functional calculus properties).

[A2]

S≤R means ⟨(R−S)x,x⟩≥0 for every x, an order on the real vector space of bounded self-adjoint operators; S≥0 is positivity (Order on bounded self adjoint operators, Self-adjoint, positive, unitary and normal operators).

[A3]

A bounded positive operator has spectrum in [0,+∞) (Spectrum of a positive operator is nonnegative).

[A4]

The operator spectrum is the spectrum in the nonzero unital Banach algebra B(H), since invertibility there means exactly a bounded two-sided operator inverse. It is nonempty and compact, and is real for self-adjoint T (Spectrum and resolvent of a bounded operator, Bounded Hilbert operators form a C star algebra, Spectrum is nonempty compact and norm bounded, Spectrum of a self adjoint operator is real). The identity real function on this compact set attains its minimum and maximum (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism).

[A5]

Continuous functions on σ(T) satisfy the pointwise identities used below: z−m≥0 if m≤min⁡σ(T), and M−z≥0 if M≥max⁡σ(T) (Self-adjoint, positive, unitary and normal operators for the scalar-multiple convention used in the calculus).

[A6]

AC is the hypothesis of the calculus and spectral suppliers (The Axiom of Choice).

Proof

technique · direct

Given: A nonzero complex Hilbert space H and a bounded self-adjoint T∈B(H), with m:=min⁡σ(T) and M:=max⁡σ(T).

1.1A4

The spectrum is a nonempty compact subset of R, so m and M exist and σ(T)⊆[m,M].

1.2A1A5

The functions z−m and M−z are continuous and nonnegative on σ(T), so (z−m)(T)=T−mI and (M−z)(T)=MI−T are positive operators.

1.3A1

The norm identity: ∥T∥=∥z(T)∥=∥z∥∞,σ(T)=max⁡λ∈σ(T)∣λ∣=max⁡(∣m∣,∣M∣), since σ(T)⊆[m,M].

2.1step 1.2A2

Consequently mI≤T≤MI in the order of the definition, since the two differences are positive operators.

2.2step 1.1A2A3A4algebra

Sharpness of the lower bound: if cI≤T for a real c, then T−cI is positive, so its spectrum lies in [0,+∞); and σ(T−cI)=σ(T)−c, because λI−(T−cI)=(λ+c)I−T has exactly the same bounded-invertibility condition. This spectrum contains m−c, hence m−c≥0 and c≤m. If T≤dI, then dI−T is positive and σ(dI−T)=d−σ(T): λI−(dI−T)=−((d−λ)I−T) is boundedly invertible exactly when (d−λ)I−T is. Thus d−M≥0.

3.1step 2.1step 2.2

Sharpness of both bounds: mI≤T≤MI by step 2.1, and any lower bound is at most m while any upper bound is at least M by step 2.2, so m and M are the greatest lower bound and least upper bound of the quadratic form on unit vectors.

4.1step 1.3step 3.1A6∎

Therefore min⁡σ(T) I≤T≤max⁡σ(T) I with sharp bounds, and ∥T∥=max⁡{∣min⁡σ(T)∣,∣max⁡σ(T)∣}.

Depends on

Used by

Dependency tree · two levels

69 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