Affine approximation and quasi-state spaces

GPT-6.1 Sol (OpenAI), Ultra, September–October 2026. Public domain (CC0 1.0).

A self-adjoint element of a C*-algebra is determined by its values on positive functionals. Those values form a continuous affine function on a compact convex space. Passing to the bidual allows bounded affine functions that need not be continuous. This distinction gives a way to describe intermediate classes of operators by semicontinuity.

We prove the convex approximation results needed for that description. They work in a Hausdorff locally convex real vector space, with no metrizability or separability assumption. We then identify the continuous and bounded affine functions on the quasi-state space of an arbitrary C*-algebra. A nonunital example shows why its state space alone would lose compactness.

The separation theorem needed below is proved in the next subsection. We use compactness of the dual unit ball and the complete compact-face proof of Krein–Milman, Lemma 1.1, stated there for every Hausdorff locally convex space. The bidual and its positive normal functionals are supplied by The universal enveloping von Neumann algebra, Theorem 3.3. For the norm-additive Jordan decomposition of a hermitian functional, we use the full proof in Polar decomposition and absolute value of functionals, Corollary 2.8, applied to the predual of the bidual. Positivity and state norming are covered by Representations and positive functionals. The Hahn–Banach proof below uses only the well-ordering theorem from the earlier programme; the strict separation proof works directly with continuous seminorms. Both apply without countability assumptions.

Convex separation in the topology being used

Lemma 0.1 (Algebraic Hahn–Banach). Let VV be a real vector space, D⊂VD\subset V a subspace, and p:V→Rp:V\to\mathbb R sublinear. Every linear g:D→Rg:D\to\mathbb R satisfying g≤pg\leq p extends to a linear functional on VV still dominated by pp.

Proof. Sublinearity means p(u+v)≤p(u)+p(v)p(u+v)\leq p(u)+p(v) and p(tv)=tp(v)p(tv)=tp(v) for t≥0t\geq0; in particular p(0)=0p(0)=0. We begin with a construction that applies to any dominated linear functional h:S→Rh:S\to\mathbb R on a subspace SS. Define qh(v)=inf⁡s∈S(p(v+s)−h(s))(v∈V). q_h(v)=\inf_{s\in S}\bigl(p(v+s)-h(s)\bigr) \quad(v\in V). This is finite: sublinearity and domination give h(s)≤p(s)≤p(v+s)+p(−v),−p(−v)≤qh(v)≤p(v), h(s)\leq p(s)\leq p(v+s)+p(-v), \qquad -p(-v)\leq q_h(v)\leq p(v), where the upper bound uses s=0s=0. For t>0t>0, substituting s=tus=tu in the infimum gives qh(tv)=tqh(v)q_h(tv)=tq_h(v). Also qh(0)=0q_h(0)=0 by the displayed bounds. To check subadditivity, choose s,u∈Ss,u\in S making the two values in the infima at v,wv,w within ε\varepsilon of their respective infima. Then qh(v+w)≤p(v+w+s+u)−h(s+u)≤p(v+s)−h(s)+p(w+u)−h(u)<qh(v)+qh(w)+2ε. \begin{aligned} q_h(v+w) &\leq p(v+w+s+u)-h(s+u)\\ &\leq p(v+s)-h(s)+p(w+u)-h(u)\\ &<q_h(v)+q_h(w)+2\varepsilon. \end{aligned} Let ε\varepsilon decrease to zero. Thus qhq_h is sublinear. Changing the variable of the infimum by an element s0∈Ss_0\in S also gives the exact translation identity qh(v+s0)=qh(v)+h(s0). q_h(v+s_0)=q_h(v)+h(s_0).

If v∉Sv\notin S, then 0=qh(0)≤qh(v)+qh(−v)0=q_h(0)\leq q_h(v)+q_h(-v). Choose β=12(qh(v)−qh(−v)),−qh(−v)≤β≤qh(v), \beta=\tfrac12\bigl(q_h(v)-q_h(-v)\bigr), \qquad -q_h(-v)\leq\beta\leq q_h(v), and define h1(s+tv)=h(s)+tβh_1(s+tv)=h(s)+t\beta on S+RvS+\mathbb Rv. The decomposition is unique, so h1h_1 is well defined and linear. If t>0t>0, positive homogeneity and the translation identity yield h1(s+tv)≤h(s)+tqh(v)=qh(s+tv)≤p(s+tv). h_1(s+tv)\leq h(s)+tq_h(v)=q_h(s+tv)\leq p(s+tv). If t<0t<0, the lower bound on β\beta instead gives tβ≤(−t)qh(−v),h1(s+tv)≤h(s)+(−t)qh(−v)=qh(s+tv)≤p(s+tv). t\beta\leq(-t)q_h(-v), \qquad h_1(s+tv)\leq h(s)+(-t)q_h(-v)=q_h(s+tv)\leq p(s+tv). At t=0t=0, domination is the assumption on hh. This constructs a dominated extension to one larger subspace.

Well-order the underlying set of VV, using Theorem 8.5 of Hahn–Banach, Baire and the basic theorems on Banach spaces. Starting with gg on DD, proceed along that well-order. At each successor step retain the current functional if the next vector already belongs to its domain; otherwise adjoin that vector by the construction above. At a limit step take the union of the preceding functionals. Their domains are nested subspaces and their values agree, so the union is well defined. Any two vectors in the union occur together in an earlier domain; hence the union is linear, and domination holds there for each vector. Transfinite recursion therefore gives a dominated extension whose domain contains every vector of VV. It is the required functional. □\square

Lemma 0.2 (Strict convex separation). Let EE be a Hausdorff locally convex real vector space. If C⊂EC\subset E is nonempty compact convex and D⊂ED\subset E is nonempty closed convex, with C∩D=∅C\cap D=\varnothing, then there are a continuous real linear functional ℓ\ell and d∈Rd\in\mathbb R such that ℓ(c)<d<ℓ(y)(c∈C, y∈D). \ell(c)<d<\ell(y) \quad(c\in C,\ y\in D).

Proof. In a locally convex space, neighborhoods are described by finitely many continuous seminorm inequalities, as in Section 6 of Hahn–Banach, Baire and the basic theorems on Banach spaces. Because DD is closed and misses c∈Cc\in C, choose a continuous seminorm qcq_c with c+{x:qc(x)<2}⊆E∖D. c+\{x:q_c(x)<2\}\subseteq E\setminus D. Such a seminorm is obtained by rescaling and taking the maximum of the finitely many seminorms defining a neighborhood of cc disjoint from DD. The smaller neighborhoods c+{qc<1}c+\{q_c<1\} cover CC. Choose a finite subcover with centers c1,…,cmc_1,\ldots,c_m and seminorms q1,…,qmq_1,\ldots,q_m, and put q=max⁡iqiq=\max_i q_i. This is a continuous seminorm.

If c∈Cc\in C, choose ii with qi(c−ci)<1q_i(c-c_i)<1. Every y∈Dy\in D satisfies qi(y−ci)≥2q_i(y-c_i)\geq2, so q(y−c)≥qi(y−c)≥qi(y−ci)−qi(c−ci)>1. q(y-c)\geq q_i(y-c) \geq q_i(y-c_i)-q_i(c-c_i)>1. Consequently the nonempty convex set F=D−CF=D-C satisfies q(f)≥1q(f)\geq1 for all f∈Ff\in F.

Construct a real-valued function on all of EE by b(x)=inf⁡t≥0, f∈F(q(x+tf)−t). b(x)=\inf_{t\geq0,\ f\in F}\bigl(q(x+tf)-t\bigr). For every candidate in this infimum, the seminorm inequality gives q(x+tf)−t≥tq(f)−q(x)−t≥−q(x). q(x+tf)-t\geq tq(f)-q(x)-t\geq-q(x). Taking t=0t=0 gives the upper bound. Thus −q(x)≤b(x)≤q(x),b(0)=0. -q(x)\leq b(x)\leq q(x),\qquad b(0)=0. For λ>0\lambda>0, replacing tt by λt\lambda t in the infimum proves b(λx)=λb(x)b(\lambda x)=\lambda b(x). For subadditivity, take candidates (t,f)(t,f) at xx and (s,g)(s,g) at zz. If t+s>0t+s>0, convexity puts (tf+sg)/(t+s)(tf+sg)/(t+s) in FF, and hence b(x+z)≤q(x+z+tf+sg)−(t+s)≤(q(x+tf)−t)+(q(z+sg)−s). \begin{aligned} b(x+z) &\leq q(x+z+tf+sg)-(t+s)\\ &\leq \bigl(q(x+tf)-t\bigr)+\bigl(q(z+sg)-s\bigr). \end{aligned} When t=s=0t=s=0, the same inequality follows by using t=0t=0 in the definition of b(x+z)b(x+z) and the triangle inequality for qq. Choose each candidate within ε\varepsilon of its finite infimum and let ε\varepsilon decrease to zero. This proves b(x+z)≤b(x)+b(z)b(x+z)\leq b(x)+b(z), so bb is sublinear.

Apply Lemma 0.1 to the zero functional on {0}\{0\}, dominated by bb. Its extension ℓ:E→R\ell:E\to\mathbb R satisfies ℓ(x)≤b(x)≤q(x)\ell(x)\leq b(x)\leq q(x). Applying this inequality to −x-x shows ∣ℓ(x)∣≤q(x)|\ell(x)|\leq q(x), so ℓ\ell is continuous. For f∈Ff\in F, the candidate t=1t=1 with that same ff shows b(−f)≤−1b(-f)\leq-1. Therefore ℓ(f)=−ℓ(−f)≥1,ℓ(y)−ℓ(c)≥1(y∈D, c∈C). \ell(f)=-\ell(-f)\geq1, \qquad \ell(y)-\ell(c)\geq1 \quad(y\in D,\ c\in C). Continuity and compactness give M=max⁡c∈Cℓ(c)M=\max_{c\in C}\ell(c), attained at a point c0∈Cc_0\in C. Every y∈Dy\in D then satisfies ℓ(y)≥ℓ(c0)+1=M+1\ell(y)\geq\ell(c_0)+1=M+1. Taking d=M+1/2d=M+1/2 gives ℓ(c)≤M<d<ℓ(y)\ell(c)\leq M<d<\ell(y) for all the required points. □\square

1. Supporting affine functions

Let EE be a Hausdorff locally convex real vector space and K⊂EK\subset E a nonempty compact convex set. Write Aff⁡(K;E)\operatorname{Aff}(K;E) for the restrictions to KK of continuous real affine functions on EE. Such a function on EE has the form g(x)=ℓ(x)+c,ℓ∈E′,c∈R. g(x)=\ell(x)+c,\qquad \ell\in E',\quad c\in\mathbb R. Here E′E' is the continuous real dual. A finite real function ff on KK is lower semicontinuous when {x:f(x)>r}\{x:f(x)>r\} is relatively open for every real rr. It is convex when f(tx+(1−t)y)≤tf(x)+(1−t)f(y),0≤t≤1. f(tx+(1-t)y)\le t f(x)+(1-t)f(y), \qquad 0\le t\le1. It is affine when this inequality is always an equality.

Theorem 1.1 — affine supports. If f:K→Rf:K\to\mathbb R is lower semicontinuous and convex, then f(x)=sup⁡{g(x):g∈Aff⁡(K;E), g≤f on K}.(1.1) f(x)=\sup\{g(x):g\in\operatorname{Aff}(K;E),\ g\le f\text{ on }K\}. \tag{1.1} The same supremum is obtained by requiring g<fg<f everywhere on KK.

Proof. The epigraph M={(y,t)∈E×R:y∈K, t≥f(y)} M=\{(y,t)\in E\times\mathbb R:y\in K,\ t\ge f(y)\} is closed and convex. Closedness uses both lower semicontinuity and the fact that compact KK is closed in EE.

Fix x∈Kx\in K and b<f(x)b<f(x). Geometric Hahn–Banach separates the point (x,b)(x,b) strictly from MM. Thus some continuous ℓ∈E′\ell\in E', scalar cc, and real dd satisfy ℓ(x)+cb<d<ℓ(y)+ct((y,t)∈M).(1.2) \ell(x)+cb<d<\ell(y)+ct \quad((y,t)\in M). \tag{1.2} The arbitrarily large vertical coordinates in MM force c≥0c\ge0. If c=0c=0, taking y=xy=x contradicts (1.2). Hence c>0c>0. Set g(y)=d−ℓ(y)c. g(y)=\frac{d-\ell(y)}{c}. Taking t=f(y)t=f(y) in (1.2) gives g(y)<f(y)g(y)<f(y) for every y∈Ky\in K, while its left inequality gives g(x)>bg(x)>b. Since bb can approach f(x)f(x) from below, (1.1) follows. □\square

Theorem 1.2 — increasing approximation. If ff is lower semicontinuous and affine on KK, there is an increasing net (gi)(g_i) in Aff⁡(K;E)\operatorname{Aff}(K;E) such that gi<f on K,gi(x)↑f(x)(x∈K).(1.3) g_i<f\text{ on }K,\qquad g_i(x)\uparrow f(x)\quad(x\in K). \tag{1.3}

Proof. Let II be the family of continuous ambient affine functions strictly below ff on KK, ordered by their restrictions. Theorem 1.1 gives the desired pointwise supremum. We must prove that II is directed.

Take g1,g2∈Ig_1,g_2\in I. After adding a common constant to these functions and to ff, assume g1,g2>0g_1,g_2>0 on KK. Put Cj={(y,t):y∈K, 0≤t≤gj(y)},j=1,2. C_j=\{(y,t):y\in K,\ 0\le t\le g_j(y)\},\qquad j=1,2. Each CjC_j is compact and convex. Their convex hull CC is compact: it is the image of [0,1]×C1×C2[0,1]\times C_1\times C_2 under the continuous convex-combination map.

Every point of CC has vertical coordinate strictly below ff at its horizontal coordinate. Indeed, if (y,t)=s(y1,t1)+(1−s)(y2,t2)(y,t)=s(y_1,t_1)+(1-s)(y_2,t_2), then affinity gives t≤sg1(y1)+(1−s)g2(y2)<sf(y1)+(1−s)f(y2)=f(y), t\le s g_1(y_1)+(1-s)g_2(y_2) <s f(y_1)+(1-s)f(y_2)=f(y), with the same strict conclusion at the endpoints. Thus CC is disjoint from the closed convex epigraph MM.

Strict separation of a compact convex set from a disjoint closed convex set gives ℓ,c,d\ell,c,d with ℓ(y)+ct<d((y,t)∈C),d<ℓ(y)+ct((y,t)∈M). \ell(y)+ct<d\quad((y,t)\in C),\qquad d<\ell(y)+ct\quad((y,t)\in M). Comparing (y,gj(y))∈C(y,g_j(y))\in C with (y,f(y))∈M(y,f(y))\in M shows c>0c>0. Consequently g=(d−ℓ)/cg=(d-\ell)/c satisfies g1,g2<g<fon K. g_1,g_2<g<f\quad\text{on }K. Undo the common translation. Hence II is directed, and the net indexed by II proves (1.3). □\square

Corollary 1.3 — uniform approximation of continuous affine functions. If ff is continuous and affine on KK, an increasing sequence in Aff⁡(K;E)\operatorname{Aff}(K;E) converges uniformly to ff.

Proof. For ε>0\varepsilon>0, the open sets {x:gi(x)>f(x)−ε},i∈I, \{x:g_i(x)>f(x)-\varepsilon\},\qquad i\in I, cover KK. A finite subcover and directedness give one gig_i with 0<f−gi<ε0<f-g_i<\varepsilon everywhere. Choose such functions for ε=1/n\varepsilon=1/n, and recursively choose an upper bound in II of the previous function and the newly chosen one. The resulting increasing sequence converges uniformly. This argument does not require that KK be metrizable. □\square

Proposition 1.4 — an extreme minimizer. A lower semicontinuous affine real function on KK takes its minimum at an extreme point of KK.

Proof. Lower semicontinuity and compactness give a finite minimum mm and a nonempty compact minimizer set Fm={x∈K:f(x)=m}. F_m=\{x\in K:f(x)=m\}. It is convex. If tx+(1−t)y∈Fmtx+(1-t)y\in F_m with 0<t<10<t<1, affinity and f≥mf\ge m force f(x)=f(y)=mf(x)=f(y)=m. Thus FmF_m is a face of KK. By Krein–Milman it has an extreme point, and every extreme point of a face is extreme in KK. □\square

2. Approximation on a split face

A convex subset FF of KK is a face if a nontrivial convex combination in FF has both endpoints in FF. Faces F,GF,G are complementary split faces when every x∈Kx\in K has a decomposition x=λy+(1−λ)z,y∈F,z∈G,0≤λ≤1,(2.1) x=\lambda y+(1-\lambda)z, \qquad y\in F,\quad z\in G,\quad 0\le\lambda\le1, \tag{2.1} with unique weight and unique components having nonzero weights. Unused components at the endpoints are immaterial. The weight function e(x)=λe(x)=\lambda is affine: combining two decompositions and normalizing the resulting FF and GG components proves this by uniqueness. It satisfies e∣F=1e|_F=1 and e∣G=0e|_G=0.

Assume ee is lower semicontinuous. Then G={e=0}G=\{e=0\} is closed; FF need not be closed.

Theorem 2.1 — supports along the face. Let a:K→Ra:K\to\mathbb R be bounded and affine, with a∣Fa|_F lower semicontinuous in the relative topology of FF. There is a net (bi)(b_i) in Aff⁡(K;E)\operatorname{Aff}(K;E) such that bi≤a on K,bi(y)⟶a(y)(y∈F).(2.2) b_i\le a\text{ on }K,\qquad b_i(y)\longrightarrow a(y)\quad(y\in F). \tag{2.2} The net is not asserted to be increasing.

Proof. Let MM be the closure of the epigraph of aa in E×RE\times\mathbb R. It is closed and convex. We first show that if y∈Fy\in F and (y,t)∈M(y,t)\in M, then t≥a(y)t\ge a(y).

Choose (xj,tj)→(y,t)(x_j,t_j)\to(y,t) with tj≥a(xj)t_j\ge a(x_j), and decompose xjx_j as in (2.1). Lower semicontinuity of ee gives 1=e(y)≤lim inf⁡je(xj)≤1, 1=e(y)\le\liminf_j e(x_j)\le1, so λj→1\lambda_j\to1. Eventually λj>0\lambda_j>0. The corresponding FF components yjy_j converge to yy: yj−xj=(1−λj)(yj−zj)⟶0, y_j-x_j=(1-\lambda_j)(y_j-z_j)\longrightarrow0, because the compact set K−KK-K is bounded in every continuous seminorm. Boundedness of aa also gives a(xj)−a(yj)=(1−λj)(a(zj)−a(yj))⟶0. a(x_j)-a(y_j)=(1-\lambda_j)(a(z_j)-a(y_j))\longrightarrow0. Lower semicontinuity on FF therefore yields a(y)≤lim inf⁡ja(xj)≤ta(y)\le\liminf_j a(x_j)\le t.

Now fix a nonempty finite set B⊂FB\subset F and ε>0\varepsilon>0. Let LL be the compact convex hull of {(y,a(y)−ε):y∈B}. \{(y,a(y)-\varepsilon):y\in B\}. Affinity says every point of LL is of the form (y,a(y)−ε)(y,a(y)-\varepsilon) with y∈Fy\in F. The preceding paragraph shows L∩M=∅L\cap M=\varnothing.

Separate LL and MM strictly. The coefficient of the vertical coordinate is positive, since (y,a(y)−ε)∈L(y,a(y)-\varepsilon)\in L and (y,a(y))∈M(y,a(y))\in M. The separating hyperplane is thus the graph of a continuous ambient affine function bB,εb_{B,\varepsilon} satisfying bB,ε≤a on K,a(y)−ε<bB,ε(y)(y∈B). b_{B,\varepsilon}\le a\text{ on }K,\qquad a(y)-\varepsilon<b_{B,\varepsilon}(y)\quad(y\in B). Order the pairs (B,ε)(B,\varepsilon) by inclusion of BB and decreasing ε\varepsilon. These bounds prove (2.2). □\square

Corollary 2.2 — a singleton complement. Suppose G={x0}G=\{x_0\}, a(x0)=0a(x_0)=0, and the other hypotheses of Theorem 2.1 hold. There are continuous ambient affine cic_i with ci(x0)=0c_i(x_0)=0 and scalars αi≤0\alpha_i\le0 such that ci+αie≤a on K,(ci+αie)(x)⟶a(x)(x∈K).(2.3) c_i+\alpha_i e\le a\text{ on }K, \qquad (c_i+\alpha_i e)(x)\longrightarrow a(x)\quad(x\in K). \tag{2.3}

Proof. Take bib_i from Theorem 2.1 and put αi=bi(x0)≤a(x0)=0\alpha_i=b_i(x_0)\le a(x_0)=0, ci=bi−αic_i=b_i-\alpha_i. On FF, ci+αie=bi≤ac_i+\alpha_i e=b_i\le a. At x0x_0 it is zero. Both functions in this inequality are affine, so the inequality extends to every decomposition (2.1). Pointwise convergence follows in the same way from convergence on FF and equality at x0x_0. □\square

3. The compact space of positive functionals

Let AA be a C*-algebra, possibly nonunital. Write AsaA_{\mathrm{sa}} for its self-adjoint real Banach space and Asa∗A^*_{\mathrm{sa}} for the hermitian functionals. Define Q(A)={φ∈A+∗:∥φ∥≤1},S(A)={φ∈A+∗:∥φ∥=1}.(3.1) Q(A)=\{\varphi\in A^*_+:\|\varphi\|\le1\}, \qquad S(A)=\{\varphi\in A^*_+:\|\varphi\|=1\}. \tag{3.1} Give Q(A)Q(A) the weak* topology inherited from A∗A^*. It is compact and convex: the dual unit ball is compact, and positivity is the closed condition φ(a∗a)≥0\varphi(a^*a)\ge0 for all a∈Aa\in A. It lies in the locally convex real space E=(Asa∗,σ(Asa∗,Asa)). E=(A^*_{\mathrm{sa}},\sigma(A^*_{\mathrm{sa}},A_{\mathrm{sa}})). The continuous real linear functionals on EE are exactly evaluations at elements of AsaA_{\mathrm{sa}}. Indeed, continuity at zero bounds such a functional in terms of finitely many evaluations; it vanishes on their common kernel, so it factors through their finite-dimensional range and is a real linear combination of them.

For a∈Asaa\in A_{\mathrm{sa}}, write a^(φ)=φ(a). \widehat a(\varphi)=\varphi(a). State norming gives ∥a∥=sup⁡φ∈Q(A)∣a^(φ)∣.(3.2) \|a\|=\sup_{\varphi\in Q(A)}|\widehat a(\varphi)|. \tag{3.2}

Theorem 3.1 — continuous affine functions. Evaluation is an isometric real linear bijection Asa ⟶ {f∈C(Q(A),R):f affine, f(0)=0}.(3.3) A_{\mathrm{sa}}\ \longrightarrow\ \{f\in C(Q(A),\mathbb R): f\text{ affine},\ f(0)=0\}. \tag{3.3}

Proof. Only surjectivity remains. Corollary 1.3 uniformly approximates ff by restrictions of continuous ambient affine functions, hence by functions fn(φ)=φ(an)+cn,an∈Asa. f_n(\varphi)=\varphi(a_n)+c_n, \qquad a_n\in A_{\mathrm{sa}}. Since f(0)=0f(0)=0, uniform convergence gives cn=fn(0)→0c_n=f_n(0)\to0. Thus a^n=fn−cn\widehat a_n=f_n-c_n converges uniformly to ff. Formula (3.2) makes (an)(a_n) a norm Cauchy sequence. Its limit a∈Asaa\in A_{\mathrm{sa}} satisfies a^=f\widehat a=f. □\square

Theorem 3.2 — bounded affine functions. Evaluation is an isometric real linear bijection Asa∗∗ ⟶ {f:Q(A)→R:f bounded and affine, f(0)=0}.(3.4) A^{**}_{\mathrm{sa}}\ \longrightarrow\ \{f:Q(A)\to\mathbb R:f\text{ bounded and affine},\ f(0)=0\}. \tag{3.4} The evaluation pairing here is between A∗∗A^{**} and its predual A∗A^*.

Proof. Evaluation gives a bounded affine function vanishing at zero. Positive normal functionals norm self-adjoint elements of A∗∗A^{**}, so it is isometric.

Conversely, put C=sup⁡Q(A)∣f∣C=\sup_{Q(A)}|f|. For φ∈A+∗∖{0}\varphi\in A^*_+\setminus\{0\}, define L(φ)=∥φ∥f(φ∥φ∥),L(0)=0.(3.5) L(\varphi)=\|\varphi\| f\left(\frac{\varphi}{\|\varphi\|}\right), \qquad L(0)=0. \tag{3.5} Affinity with f(0)=0f(0)=0 makes this agree with ff on Q(A)Q(A). It is positively homogeneous. The norm of positive functionals is additive. Hence, for positive nonzero φ,ψ\varphi,\psi, applying affinity to φ+ψ∥φ∥+∥ψ∥=∥φ∥∥φ∥+∥ψ∥φ∥φ∥+∥ψ∥∥φ∥+∥ψ∥ψ∥ψ∥ \frac{\varphi+\psi}{\|\varphi\|+\|\psi\|} =\frac{\|\varphi\|}{\|\varphi\|+\|\psi\|} \frac{\varphi}{\|\varphi\|} +\frac{\|\psi\|}{\|\varphi\|+\|\psi\|} \frac{\psi}{\|\psi\|} proves L(φ+ψ)=L(φ)+L(ψ)L(\varphi+\psi)=L(\varphi)+L(\psi).

Every hermitian functional is a difference of positive ones. Set L(φ−ψ)=L(φ)−L(ψ)L(\varphi-\psi)=L(\varphi)-L(\psi). This is well-defined: two such expressions imply φ+ψ′=φ′+ψ\varphi+\psi'=\varphi'+\psi, and additivity on the positive cone gives the same difference. It is real linear. The norm-additive Jordan decomposition gives ∣L(h)∣≤C(∥h+∥+∥h−∥)=C∥h∥(h∈Asa∗). |L(h)|\le C(\|h_+\|+\|h_-\|)=C\|h\| \quad(h\in A^*_{\mathrm{sa}}). Complexify this bounded real functional. Since every φ∈A∗\varphi\in A^* has the unique decomposition φ=h+ik\varphi=h+ik with hermitian h,kh,k, and ∥h∥,∥k∥≤∥φ∥\|h\|,\|k\|\le\|\varphi\|, the extension is bounded, with bound 2C2C. It therefore defines x∈A∗∗x\in A^{**}. Its real values on hermitian functionals mean x=x∗x=x^*. By construction x^=f\widehat x=f; the already established isometry gives ∥x∥=C\|x\|=C. □\square

In particular, a bounded affine function vanishing at zero corresponds to an element of AA exactly when it is continuous on Q(A)Q(A).

4. States, zero, and the bidual identity

For A≠{0}A\ne\{0\}, the faces S(A)S(A) and {0}\{0\} are complementary split faces of Q(A)Q(A). Every nonzero φ∈Q(A)\varphi\in Q(A) has the unique decomposition φ=∥φ∥φ∥φ∥+(1−∥φ∥)0.(4.1) \varphi=\|\varphi\|\frac{\varphi}{\|\varphi\|} +(1-\|\varphi\|)0. \tag{4.1} Positivity makes {0}\{0\} a face. The norm is affine on positive functionals and at most one on Q(A)Q(A), so S(A)S(A) is also a face. Its split weight is e(φ)=∥φ∥=1^(φ),(4.2) e(\varphi)=\|\varphi\|=\widehat1(\varphi), \tag{4.2} where 11 is the identity of A∗∗A^{**}. The norm is weak* lower semicontinuous; alternatively, e(φ)=sup⁡iφ(ui)e(\varphi)=\sup_i\varphi(u_i) for a positive contractive approximate identity of AA. Thus Corollary 2.2 applies.

The extreme points of Q(A)Q(A) are zero and the pure states. A nonzero functional of norm strictly less than one has the nontrivial decomposition (4.1). A state is extreme in Q(A)Q(A) exactly when it is extreme in S(A)S(A), because any convex decomposition of a norm-one positive functional into elements of Q(A)Q(A) has both endpoint norms equal to one. Consequently Proposition 1.4 says that any lower semicontinuous affine function on Q(A)Q(A) has an extreme minimizer among zero and the pure states. If its value is negative somewhere and its value at zero is zero, a pure state attains a negative minimum.

Example 4.1 — the identity seen through a nonunital algebra. For A=c0(N)A=c_0(\mathbb N), A∗=ℓ1(N),A∗∗=ℓ∞(N),Q(A)={pn≥0:∑npn≤1}. A^*=\ell^1(\mathbb N),\qquad A^{**}=\ell^\infty(\mathbb N), \qquad Q(A)=\left\{p_n\ge0:\sum_n p_n\le1\right\}. Evaluation at 1∈ℓ∞1\in\ell^\infty is e(p)=∑npne(p)=\sum_n p_n. The point masses δn\delta_n converge weak* to zero, since each element of c0c_0 vanishes at infinity. Yet e(δn)=1e(\delta_n)=1 and e(0)=0e(0)=0. Thus ee is lower semicontinuous and affine, but not continuous; it corresponds to the bidual identity, which is outside c0c_0. The state face is not closed. The finite sums ∑n=1Npn\sum_{n=1}^N p_n are continuous affine functions increasing pointwise to ee.

5. Graded exercises with solutions

Exercise 5.1 — introductory: an affine matrix observable. Identify Q(M2(C))Q(M_2(\mathbb C)) with positive matrices dd satisfying Tr⁡(d)≤1\operatorname{Tr}(d)\le1, via φd(a)=Tr⁡(da)\varphi_d(a)=\operatorname{Tr}(da). For h=diag⁡(−2,3)h=\operatorname{diag}(-2,3), compute the supremum of ∣φd(h)∣|\varphi_d(h)|, its minimum, and one extreme minimizer. Determine the split weight and explain why it is continuous in this example.

Solution. In the eigenbasis of hh, φd(h)=−2d11+3d22,d11,d22≥0,d11+d22≤1. \varphi_d(h)=-2d_{11}+3d_{22},\qquad d_{11},d_{22}\ge0,\quad d_{11}+d_{22}\le1. Its range is [−2,3][-2,3]: the inequalities follow from the trace bound, and the endpoints are attained at the two rank-one coordinate projections. The supremum of the absolute value is 3=∥h∥3=\|h\|, and the minimum is −2-2, attained by the pure state with density diag⁡(1,0)\operatorname{diag}(1,0). The split weight is Tr⁡(d)=φd(12)\operatorname{Tr}(d)=\varphi_d(1_2), a continuous affine evaluation because the identity belongs to M2M_2. Thus its state face is closed here.

Exercise 5.2 — intermediate: pointwise approximation without uniform approximation. In Example 4.1 let uN∈c0u_N\in c_0 be the indicator of {1,…,N}\{1,\dots,N\}. Show that u^N↑e\widehat u_N\uparrow e pointwise, but sup⁡p∈Q(c0)∣e(p)−u^N(p)∣=1for every N. \sup_{p\in Q(c_0)}|e(p)-\widehat u_N(p)|=1 \quad\text{for every }N. Apply Corollary 2.2 to a(p)=∑npna(p)=\sum_n p_n and explicitly give suitable cN,αNc_N,\alpha_N. Explain why ee cannot be uniformly approximated by continuous affine functions on Q(c0)Q(c_0).

Solution. For each fixed p∈ℓ+1p\in\ell^1_+, its partial sums increase to its total sum. The difference is the tail mass, at most one, and p=δN+1p=\delta_{N+1} makes it one. Take cN=u^N,αN=0. c_N=\widehat u_N,\qquad \alpha_N=0. They vanish at zero, lie below a=ea=e, and converge pointwise on the whole quasi-state space. A uniform limit of continuous functions on a topological space is continuous, whereas e(δn)=1e(\delta_n)=1 along the weak* convergent sequence δn→0\delta_n\to0. Hence no uniform continuous approximation exists. Theorem 3.2 identifies ee with 1∈ℓ∞1\in\ell^\infty; Theorem 3.1 correctly excludes it from c0c_0.

Exercise 5.3 — advanced: why convexity does not give directed supports. On Q(M2)Q(M_2), put h=diag⁡(1,−1)h=\operatorname{diag}(1,-1) and f(φ)=∣φ(h)∣,g+(φ)=φ(h)−14,g−(φ)=−φ(h)−14. f(\varphi)=|\varphi(h)|,\qquad g_+(\varphi)=\varphi(h)-\tfrac14,\qquad g_-(\varphi)=-\varphi(h)-\tfrac14. Show that ff is continuous and convex, and that g+,g−<fg_+,g_-<f everywhere. Prove that there is no affine gg with g≥g+,g−g\ge g_+,g_- and g≤fg\le f. Relate this to Theorems 1.1 and 1.2.

Solution. Absolute value is continuous and convex, so its composition with the real continuous linear evaluation has those properties. For every real tt, t−1/4<∣t∣t-1/4<|t| and −t−1/4<∣t∣-t-1/4<|t|, proving both strict inequalities.

Let φ+\varphi_+ and φ−\varphi_- be the coordinate pure states. Their hh values are 11 and −1-1. An affine common majorant would satisfy g(φ+)≥34,g(φ−)≥34, g(\varphi_+)\ge\tfrac34,\qquad g(\varphi_-)\ge\tfrac34, and hence g((φ++φ−)/2)≥3/4g((\varphi_++\varphi_-)/2)\ge3/4. But ff is zero at that midpoint. This contradicts g≤fg\le f. Thus affine minorants still give the pointwise supremum in Theorem 1.1, but they cannot be organized as the increasing family of Theorem 1.2. Affinity of ff is essential for that directedness assertion.

References

[Erdman] John M. Erdman, Functional Analysis and Operator Algebras: An Introduction, 2015, Chapter 5, “The Hahn–Banach Theorems,” Theorem HBTI. Further reading on dominated extension.

Editable source · Sources and component terms