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 be a real vector space, a subspace, and sublinear. Every linear satisfying extends to a linear functional on still dominated by .
Proof. Sublinearity means and for ; in particular . We begin with a construction that applies to any dominated linear functional on a subspace . Define This is finite: sublinearity and domination give where the upper bound uses . For , substituting in the infimum gives . Also by the displayed bounds. To check subadditivity, choose making the two values in the infima at within of their respective infima. Then Let decrease to zero. Thus is sublinear. Changing the variable of the infimum by an element also gives the exact translation identity
If , then . Choose and define on . The decomposition is unique, so is well defined and linear. If , positive homogeneity and the translation identity yield If , the lower bound on instead gives At , domination is the assumption on . This constructs a dominated extension to one larger subspace.
Well-order the underlying set of , using Theorem 8.5 of Hahn–Banach, Baire and the basic theorems on Banach spaces. Starting with on , 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 . It is the required functional.
Lemma 0.2 (Strict convex separation). Let be a Hausdorff locally convex real vector space. If is nonempty compact convex and is nonempty closed convex, with , then there are a continuous real linear functional and such that
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 is closed and misses , choose a continuous seminorm with Such a seminorm is obtained by rescaling and taking the maximum of the finitely many seminorms defining a neighborhood of disjoint from . The smaller neighborhoods cover . Choose a finite subcover with centers and seminorms , and put . This is a continuous seminorm.
If , choose with . Every satisfies , so Consequently the nonempty convex set satisfies for all .
Construct a real-valued function on all of by For every candidate in this infimum, the seminorm inequality gives Taking gives the upper bound. Thus For , replacing by in the infimum proves . For subadditivity, take candidates at and at . If , convexity puts in , and hence When , the same inequality follows by using in the definition of and the triangle inequality for . Choose each candidate within of its finite infimum and let decrease to zero. This proves , so is sublinear.
Apply Lemma 0.1 to the zero functional on , dominated by . Its extension satisfies . Applying this inequality to shows , so is continuous. For , the candidate with that same shows . Therefore Continuity and compactness give , attained at a point . Every then satisfies . Taking gives for all the required points.
1. Supporting affine functions
Let be a Hausdorff locally convex real vector space and a nonempty compact convex set. Write for the restrictions to of continuous real affine functions on . Such a function on has the form Here is the continuous real dual. A finite real function on is lower semicontinuous when is relatively open for every real . It is convex when It is affine when this inequality is always an equality.
Theorem 1.1 — affine supports. If is lower semicontinuous and convex, then The same supremum is obtained by requiring everywhere on .
Proof. The epigraph is closed and convex. Closedness uses both lower semicontinuity and the fact that compact is closed in .
Fix and . Geometric Hahn–Banach separates the point strictly from . Thus some continuous , scalar , and real satisfy The arbitrarily large vertical coordinates in force . If , taking contradicts (1.2). Hence . Set Taking in (1.2) gives for every , while its left inequality gives . Since can approach from below, (1.1) follows.
Theorem 1.2 — increasing approximation. If is lower semicontinuous and affine on , there is an increasing net in such that
Proof. Let be the family of continuous ambient affine functions strictly below on , ordered by their restrictions. Theorem 1.1 gives the desired pointwise supremum. We must prove that is directed.
Take . After adding a common constant to these functions and to , assume on . Put Each is compact and convex. Their convex hull is compact: it is the image of under the continuous convex-combination map.
Every point of has vertical coordinate strictly below at its horizontal coordinate. Indeed, if , then affinity gives with the same strict conclusion at the endpoints. Thus is disjoint from the closed convex epigraph .
Strict separation of a compact convex set from a disjoint closed convex set gives with Comparing with shows . Consequently satisfies Undo the common translation. Hence is directed, and the net indexed by proves (1.3).
Corollary 1.3 — uniform approximation of continuous affine functions. If is continuous and affine on , an increasing sequence in converges uniformly to .
Proof. For , the open sets cover . A finite subcover and directedness give one with everywhere. Choose such functions for , and recursively choose an upper bound in of the previous function and the newly chosen one. The resulting increasing sequence converges uniformly. This argument does not require that be metrizable.
Proposition 1.4 — an extreme minimizer. A lower semicontinuous affine real function on takes its minimum at an extreme point of .
Proof. Lower semicontinuity and compactness give a finite minimum and a nonempty compact minimizer set It is convex. If with , affinity and force . Thus is a face of . By Krein–Milman it has an extreme point, and every extreme point of a face is extreme in .
2. Approximation on a split face
A convex subset of is a face if a nontrivial convex combination in has both endpoints in . Faces are complementary split faces when every has a decomposition with unique weight and unique components having nonzero weights. Unused components at the endpoints are immaterial. The weight function is affine: combining two decompositions and normalizing the resulting and components proves this by uniqueness. It satisfies and .
Assume is lower semicontinuous. Then is closed; need not be closed.
Theorem 2.1 — supports along the face. Let be bounded and affine, with lower semicontinuous in the relative topology of . There is a net in such that The net is not asserted to be increasing.
Proof. Let be the closure of the epigraph of in . It is closed and convex. We first show that if and , then .
Choose with , and decompose as in (2.1). Lower semicontinuity of gives so . Eventually . The corresponding components converge to : because the compact set is bounded in every continuous seminorm. Boundedness of also gives Lower semicontinuity on therefore yields .
Now fix a nonempty finite set and . Let be the compact convex hull of Affinity says every point of is of the form with . The preceding paragraph shows .
Separate and strictly. The coefficient of the vertical coordinate is positive, since and . The separating hyperplane is thus the graph of a continuous ambient affine function satisfying Order the pairs by inclusion of and decreasing . These bounds prove (2.2).
Corollary 2.2 — a singleton complement. Suppose , , and the other hypotheses of Theorem 2.1 hold. There are continuous ambient affine with and scalars such that
Proof. Take from Theorem 2.1 and put , . On , . At 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 and equality at .
3. The compact space of positive functionals
Let be a C*-algebra, possibly nonunital. Write for its self-adjoint real Banach space and for the hermitian functionals. Define Give the weak* topology inherited from . It is compact and convex: the dual unit ball is compact, and positivity is the closed condition for all . It lies in the locally convex real space The continuous real linear functionals on are exactly evaluations at elements of . 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 , write State norming gives
Theorem 3.1 — continuous affine functions. Evaluation is an isometric real linear bijection
Proof. Only surjectivity remains. Corollary 1.3 uniformly approximates by restrictions of continuous ambient affine functions, hence by functions Since , uniform convergence gives . Thus converges uniformly to . Formula (3.2) makes a norm Cauchy sequence. Its limit satisfies .
Theorem 3.2 — bounded affine functions. Evaluation is an isometric real linear bijection The evaluation pairing here is between and its predual .
Proof. Evaluation gives a bounded affine function vanishing at zero. Positive normal functionals norm self-adjoint elements of , so it is isometric.
Conversely, put . For , define Affinity with makes this agree with on . It is positively homogeneous. The norm of positive functionals is additive. Hence, for positive nonzero , applying affinity to proves .
Every hermitian functional is a difference of positive ones. Set . This is well-defined: two such expressions imply , and additivity on the positive cone gives the same difference. It is real linear. The norm-additive Jordan decomposition gives Complexify this bounded real functional. Since every has the unique decomposition with hermitian , and , the extension is bounded, with bound . It therefore defines . Its real values on hermitian functionals mean . By construction ; the already established isometry gives .
In particular, a bounded affine function vanishing at zero corresponds to an element of exactly when it is continuous on .
4. States, zero, and the bidual identity
For , the faces and are complementary split faces of . Every nonzero has the unique decomposition Positivity makes a face. The norm is affine on positive functionals and at most one on , so is also a face. Its split weight is where is the identity of . The norm is weak* lower semicontinuous; alternatively, for a positive contractive approximate identity of . Thus Corollary 2.2 applies.
The extreme points of 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 exactly when it is extreme in , because any convex decomposition of a norm-one positive functional into elements of has both endpoint norms equal to one. Consequently Proposition 1.4 says that any lower semicontinuous affine function on 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 , Evaluation at is . The point masses converge weak* to zero, since each element of vanishes at infinity. Yet and . Thus is lower semicontinuous and affine, but not continuous; it corresponds to the bidual identity, which is outside . The state face is not closed. The finite sums are continuous affine functions increasing pointwise to .
5. Graded exercises with solutions
Exercise 5.1 — introductory: an affine matrix observable. Identify with positive matrices satisfying , via . For , compute the supremum of , its minimum, and one extreme minimizer. Determine the split weight and explain why it is continuous in this example.
Solution. In the eigenbasis of , Its range is : 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 , and the minimum is , attained by the pure state with density . The split weight is , a continuous affine evaluation because the identity belongs to . Thus its state face is closed here.
Exercise 5.2 — intermediate: pointwise approximation without uniform approximation. In Example 4.1 let be the indicator of . Show that pointwise, but Apply Corollary 2.2 to and explicitly give suitable . Explain why cannot be uniformly approximated by continuous affine functions on .
Solution. For each fixed , its partial sums increase to its total sum. The difference is the tail mass, at most one, and makes it one. Take They vanish at zero, lie below , and converge pointwise on the whole quasi-state space. A uniform limit of continuous functions on a topological space is continuous, whereas along the weak* convergent sequence . Hence no uniform continuous approximation exists. Theorem 3.2 identifies with ; Theorem 3.1 correctly excludes it from .
Exercise 5.3 — advanced: why convexity does not give directed supports. On , put and Show that is continuous and convex, and that everywhere. Prove that there is no affine with and . 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 , and , proving both strict inequalities.
Let and be the coordinate pure states. Their values are and . An affine common majorant would satisfy and hence . But is zero at that midpoint. This contradicts . 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 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.