Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

State values at self-adjoint elements lie in the spectral interval

Statement

Assume the Axiom of Choice. Let A be a C*-algebra, let a=a∗∈A and let ω be a state of A (States and positive functionals on a C star algebra). Then min⁡σ(a)≤ω(a)≤max⁡σ(a), where the spectrum is computed in A if A is unital and in its minimal unitization otherwise (Minimal C star unitization).

Facts & Assumptions

Given: AC; a C*-algebra A with ambient unital C*-algebra B (B=A if A is unital, B=A+ otherwise); a self-adjoint a∈A; a state ω of A.

[F1]

Positive functionals satisfy Cauchy–Schwarz: ∣ω(b∗c)∣2≤ω(c∗c)ω(b∗b); states have norm 1, so ∣ω(x)∣≤∥x∥ and ω(x∗x)≥0 (States and positive functionals on a C star algebra).

[F2]

A has a two-sided approximate unit (uλ) of positive contractions, so uλx→x and ∥uλ∥≤1 (Positive contractive approximate units for C star algebras and ideals).

[F3]

Positivity/order and calculus: for self-adjoint x, σ(x)⊆R and ∥x∥=max⁡∣σ(x)∣; a≥0 iff σ(a)⊆[0,∞); the positive elements form a cone; 0≤x≤y implies ∥x∥≤∥y∥; the continuous calculus makes a−m1 and M1−a positive for m=min⁡σ(a), M=max⁡σ(a); the unitization is a unital C*-algebra containing A (Positive calculus and order estimates in a C star algebra, Minimal C star unitization, C star algebra).

Proof

technique · direct

Given: AC, a C*-algebra A, a self-adjoint a∈A and a state ω.

1.1F1F2

For every x∈A one has ω(x∗)=ω(x)‾. Indeed, for z∈C the element (uλ+zx)∗(uλ+zx)=uλ2+zuλx+z‾ x∗uλ+∣z∣2x∗x is positive, so P(z):=ω(uλ2)+zω(uλx)+z‾ ω(x∗uλ)+∣z∣2ω(x∗x)≥0 for all z; taking z=1 and z=i shows ω(uλx)+ω(x∗uλ)∈R and ω(uλx)−ω(x∗uλ)∈iR, hence ω(x∗uλ)=ω(uλx)‾. Since x∗uλ=(uλx)∗ and both uλx→x and x∗uλ→x∗ in norm by [F2], boundedness of ω gives the claim in the limit.

1.2F1F2

For every x∈A one has ∣ω(x)∣2≤ω(x∗x). Indeed, Cauchy–Schwarz [F1] applied to (b,c)=(uλ,x) gives ∣ω(uλx)∣2≤ω(x∗x) ω(uλ2); now ω(uλ2)≤∥uλ2∥≤1 by [F1] and [F2], and ω(uλx)→ω(x).

2.1F1F3step 1.1step 1.2

The canonical extension ω+(x+z1):=ω(x)+z is a positive linear functional on B=A+ with ω+(1)=1. Linearity and unitality are immediate. Every element of A+ is x+z1, and (x+z1)∗(x+z1)=x∗x+z‾ x+z x∗+∣z∣21, so steps 1.1 and 1.2 give ω+((x+z1)∗(x+z1))=ω(x∗x)+2Re⁡(zω(x)‾)+∣z∣2≥∣ω(x)∣2−2∣z∣ ∣ω(x)∣+∣z∣2=(∣ω(x)∣−∣z∣)2≥0; positivity extends to sums of such squares by linearity. When A is unital, the order estimate x∗x≤∥x∥21 and Cauchy--Schwarz give ∣ω(x)∣2≤ω(1)ω(x∗x)≤ω(1)2∥x∥2. Therefore 1=∥ω∥≤ω(1)≤∥ω∥∥1∥=1, so ω(1)=1. In this case take B=A and ω+=ω.

3.1F1F3step 2.1

The unital positive functional ω+ satisfies ∣ω+(x)∣2≤∥x∥2 for every x∈B: by [F3], x∗x≤∥x∗x∥1=∥x∥21 and positivity of ω+ gives ω+(x∗x)≤∥x∥2ω+(1)=∥x∥2; Cauchy–Schwarz [F1] with the unit gives ∣ω+(x)∣2≤ω+(1)ω+(x∗x)≤∥x∥2. In particular ω+ is bounded with norm 1.

3.2F3step 2.1

Write m:=min⁡σ(a) and M:=max⁡σ(a), finite real numbers by [F3]. The calculus makes a−m1 and M1−a positive elements of B, hence algebraically positive by [F3]; positivity of ω+ from step 2.1 therefore gives ω+(a−m1)=ω(a)−m≥0 and ω+(M1−a)=M−ω(a)≥0. Thus m≤ω(a)≤M, and in particular ω(a) is real.

4.1givenF2F3∎

The Axiom of Choice is inherited from the approximate-unit, calculus and unitization suppliers of [F1]–[F3]; the extension and spectral arguments add no further choice (The Axiom of Choice).

Depends on

Used by

Dependency tree · two levels

27 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