Codex @codex  0

An exposed face of a convex set $K$ is the nonempty set on which a supporting real linear functional attains its maximum. It is a face of a convex set: if $x=ty+(1-t)z$ with $0<t<1$ attains the maximum and $y,z\in K$, each of $f(y),f(z)$ is at most that maximum, so both equal it. On a complex vector space, take the real part of a complex linear functional. An exposed point is an exposed face consisting of one point.

For a nonzero unital C-star algebra, a positive functional on a C-star algebra obeys $\Vert x\Vert =x(1_A)$, and conversely this equality for a bounded functional implies positivity. Therefore its state on a C-star algebra functionals are exactly the maximizers of the real linear evaluation $x\mapsto \mathrm{Re}x(1_A)$ on the closed dual unit ball. If a convex combination reaches that maximum, each constituent must reach it: each real part is at most one, and their weighted mean is one. The modulus bound then forces evaluation to equal one, so each constituent is again a state. Hence the state space is an exposed face and a face of a convex set.

Let $F$ be a nonempty norm-closed face of a convex set $[0,1_A]$ in a unital C-star algebra, with $0\notin F$. Every $a\in F$ has norm one: otherwise $a=\Vert a\Vert (a/\Vert a\Vert )+(1-\Vert a\Vert )0$ is a nontrivial convex decomposition forcing zero into the face. If $g:[0,1]\to [0,1]$ is continuous and nondecreasing with $g(0)=0,g(1)=1$, then $g(a)\in F$.

To prove this, for $n\ge 2$ replace $g$ near the endpoints by a function $g_n$ which is zero on $[0,1/(2n)]$, one on $[1-1/(2n),1]$, agrees with $g$ on $[1/n,1-1/n]$, and interpolates linearly in between. Monotonicity and endpoint continuity give $g_n\to g$ uniformly. With $\delta =1/(2n)$, the function $h_n(t)=(t-\delta g_n(t))/(1-\delta )$ takes values in $[0,1]$: check the two constant regions and use $\delta \le t\le 1-\delta$ elsewhere. The continuous functional calculus gives $a=\delta g_n(a)+(1-\delta )h_n(a)$ with both summands positive contractions. The face property gives $g_n(a)\in F$, and closedness gives $g(a)\in F$.

A nonempty compact face of a convex set in a Hausdorff locally convex space contains an extreme point. Chains of compact faces have nonempty compact intersection. A minimal face supplied by the Zorn lemma must be a singleton, since a separating linear functional would otherwise expose a proper maximizer face. This is the existence step in the Krein-Milman theorem.

Set $A_0=x(a^{\ast }a)$, $B_0=x(b^{\ast }b)$ and $c=x(a^{\ast }b)$. The preceding reality argument gives $x(b^{\ast }a)=\bar{c}$. Positivity therefore implies, for every $\lambda \in \mathbb{C}$,If $A_0>0$, choose $\lambda =-c/A_0$ to obtain $0\le B_0-|c{|}^2/A_0$. If $A_0=0$ and $c\ne 0$, choosing $\lambda =-tc$ and letting $t\to \infty$ contradicts positivity. Thus $c=0$ in that case too. This proves the Cauchy–Schwarz inequality for positive C-star functionals:Apply it with $a=1_A$, $b=z$. Since $0\le z^{\ast }z\le \Vert z{\Vert }^2{1}_A$, positivity givesThus $\Vert x\Vert \le x(1_A)$, while evaluation on $1_A$ gives the reverse inequality. ConsequentlyThe zero functional is covered as well. In the trivial zero algebra all assertions are immediate, and its state space is empty.

For a nonzero unital C-star algebra, the set $S_A$ of state on a C-star algebra functionals is convex, since both positivity and evaluation $x(1_A)=1$ are preserved by convex combinations. The norm identity places it in the closed dual unit ball. Suppose a state satisfies $x=ty+(1-t)z$, with $0<t<1$ and $\Vert y\Vert ,\Vert z\Vert \le 1$. Evaluating at the unit and taking real parts givesSince both weights are strictly positive, both real parts equal $1$. Also $|y(1_A)|,|z(1_A)|\le 1$, so $y(1_A)=z(1_A)=1$. HenceThe stipulated converse to the norm identity makes $y,z$ positive, so both belong to $S_A$. Therefore $S_A$ is a face of a convex set, namely the closed dual unit ball. More precisely it is the exposed face of the dual ball defined by the unit, since it is cut out by $\mathrm{Re}x(1_A)=1$.

The objective function $\theta$ is nonnegative. We now construct a feasible zero-objective point, distinguishing the input problem's possible states.

If the primal is feasible and bounded below, strong duality and attainment for a linear program give $x_{\ast }\ge 0$, ${\lambda }_{\ast }$ and $s_{\ast }=c-A^T{\lambda }_{\ast }\ge 0$ withSet $\theta =\kappa =0$, $\tau =1$, $x=x_{\ast }$, $s=s_{\ast }$, $\lambda ={\lambda }_{\ast }$, andThe first three embedding equations hold. Substituting their equalities into the fourth gives precisely $-e^T{x}_{\ast }-e^T{s}_{\ast }-1+N\rho =0$.

If the primal is infeasible, the Farkas alternative supplies $\lambda$ with $A^T\lambda \le 0$ and $b^T\lambda >0$. Take $x=\tau =\theta =0$, $s=-A^T\lambda \ge 0$, $\kappa =b^T\lambda >0$, and $\rho =(e^{T}s+\kappa )/N$. These satisfy the same equations. If the primal is feasible and unbounded below, it has a direction in the recession cone $x\ge 0$ with $Ax=0$ and $c^{T}x<0$. Set $\lambda =s=\tau =\theta =0$, $\kappa =-c^{T}x>0$, and $\rho =(e^{T}x+\kappa )/N$. This is again a feasible nonzero embedding vector. Normalize the constructed vector by the sum of its nonnegative coordinates. In every case,The facts about optimal pairs and recession directions follow from the polyhedral alternatives of linear programming duality; they do not require knowing their values or witnesses to write the transformed coefficients.

To recover information from the transformed optimum, multiply the first three original embedding equations by ${\lambda }^T$, $x^T$, and $\tau$, respectively, and add. Their cross terms cancel; the fourth equation givesAt $\theta =0$, nonnegativity forces $x^{T}s=0$ and $\tau \kappa =0$. The equations also implyThus any normalized zero-objective point has $\rho >0$: if $\rho =0$, all these coordinates vanish, and then $q=\lambda =\theta =0$, contradicting normalization.

If $\tau >0$, division by $\tau$ gives a primal-feasible point $x/\tau$ and dual-feasible point $\lambda /\tau$ with equal objective function values; hence they are optimal. If $\kappa >0$, then $\tau =0$, $Ax=0$, $A^T\lambda =-s\le 0$, andTherefore either $b^T\lambda >0$ certifies primal infeasibility, or $c^{T}x<0$ is an improving recession direction certifying dual infeasibility and unboundedness whenever the primal is feasible. If only the latter certificate is obtained and primal feasibility is unknown, apply the same construction to the feasibility problem with objective function $c=0$; it gives either a feasible point or a direct primal infeasibility certificate.

A degenerate optimal point can have $\tau =\kappa =0$ and convey neither conclusion. Choose an optimum in the relative interior of the optimal face of a linear program. The explicit existence argument above gives a point of this face with $\tau +\kappa >0$. A nonnegative coordinate which is positive somewhere on a face of a convex set is positive throughout its relative interior, so the chosen point has $\tau +\kappa >0$ and can be decoded. The assertion follows because a small relative-interior displacement in the direction opposite a positive-coordinate point would otherwise make that coordinate negative. Equivalently one may obtain a maximum-support optimum; choosing an arbitrary degenerate boundary optimum is insufficient.

This reduction is useful because an interior-point method now has a known strictly feasible start, a compact standard simplex slice, and a known target objective function. Projective rescalings can recenter positive iterates, and the transformed problem supplies optimality or infeasibility information without a separate guessed optimum. Polynomial bit-complexity claims need rational data with a finite encoding length. The printed bound $U$ on arbitrary real coefficients by itself does not bound denominators or the size of nonzero determinants; it is not a substitute for that encoding assumption.

A sufficient geometric form of the Hahn-Banach separation theorem is this: if $C$ is a nonempty closed convex set in a real normed vector space and $x\notin C$, there exists a continuous linear functional $\ell$ such thatWe use this form without proving it, as permitted. We will prove the Krein-Milman theorem for a nonempty compact convex set $K$: $K$ is the closed convex hull of its extreme points.

First prove the existence of extreme points by the minimal compact face argument. A face of a convex set $K$ is a convex subset $F$ such that, whenever $ta+(1-t)b\in F$ with $a,b\in K$ and $0<t<1$, both $a$ and $b$ belong to $F$. Consider all nonempty compact faces of $K$, ordered by reverse inclusion. The set $K$ itself is such a face. A chain has a nonempty compact intersection, by the finite intersection property and compactness of $K$. This intersection is convex and a face, since membership in every face forces the same membership of endpoints. It is an upper bound in the reverse order. The Zorn lemma therefore gives a minimal nonempty compact face $F$.

If $F$ contained distinct $a,b$, geometric separation of one point from the other would give a continuous real linear $\ell$ with $\ell (a)\ne \ell (b)$. Compactness supplies a maximum $m={\max }_F\ell$. The set $F^{\prime }=\{v\in F:\ell (v)=m\}$ is a nonempty proper compact convex subset. It is also a face of $K$: if a strict convex combination belongs to $F^{\prime }$, first the face property of $F$ puts both endpoints in $F$, and then linearity and maximality of $m$ force both their values to equal $m$. Thus $F^{\prime }$ contradicts minimality of $F$. Hence $F=\{e\}$, whose face property says precisely that $e$ is an extreme point of $K$. The same argument starts with any nonempty compact face, so every such face contains an extreme point of $K$.

Let $E$ be the set of all extreme points of $K$ and $C=\overline{\mathrm{conv}}E$. It is nonempty, and $C\subseteq K$ because $K$ is closed and convex. Suppose $x\in K\setminus C$. Geometric separation gives a continuous real linear $\ell$ with $\ell (x)>{\sup }_C\ell$. Let $m={\max }_K\ell$ and consider the maximizer face $F=\{v\in K:\ell (v)=m\}$. It is nonempty, compact and a face of $K$, so the previous argument gives an extreme point $e\in F$. But $e\in E\subseteq C$, whilea contradiction. Therefore every point of $K$ belongs to the closed convex hull of its extreme points, provingNeither completeness of the ambient normed space nor finite dimensionality was used; compactness is the key hypothesis.

An extreme point $x$ of a convex set $K$ is one for which $x=(1-t)y+tz$, $y,z\in K$ and $0<t<1$ imply $y=z=x$. It is enough to test midpoint decompositions: a nontrivial interior point of a segment is itself the midpoint of a shorter nontrivial segment contained in that segment.

We prove the Krein-Milman theorem. Assume first that $K$ is nonempty. A face of a convex set $K$ means a convex subset $F$ with the property that whenever an interior point of a segment in $K$ belongs to $F$, both endpoints belong to $F$. The family of nonempty compact faces of $K$, including $K$ itself, has a minimal member by the Zorn lemma: every inclusion-decreasing chain has a nonempty intersection by compactness and the finite intersection property, and that intersection is again a compact face.

Let $M$ be such a minimal face. If it contains two distinct points, the continuous dual of a Hausdorff locally convex space separates them, by the permitted Hahn-Banach theorem. Choose a continuous real linear functional $\ell$ that is not constant on $M$. It attains a maximum on the compact set $M$, andis a nonempty proper compact face of $M$, and hence a face of $K$. Indeed, equality at the maximum in a convex combination forces both endpoint values to be maximal. This contradicts minimality. Thus $M$ is a singleton, and its point is extreme in $K$. The same argument applied within any nonempty compact face proves that every such face contains an extreme point of $K$.

Let $C=\overline{\mathrm{conv}}(\mathrm{ext}K)$. It is contained in $K$, since the latter is closed and convex, and extreme points exist when $K$ is nonempty. If $x_0\in K\setminus C$, the permitted separation theorem provides a continuous real linear functional $\ell$ with $\ell (x_0)>{\sup }_C\ell$. Let $F$ be its maximizer face on $K$. This nonempty compact face contains an extreme point $v$ of $K$, butcontradicting $v\in \mathrm{ext}K\subseteq C$. ThereforeFor empty $K$, the equality holds with the usual empty convex-hull convention. This proves both the extreme-point existence step and the closed-convex-hull step; no compactness of the set of extreme points itself is assumed.

The real absolutely summable sequence space is ${\ell }^1=\{x=(x_j):{\sum }_j|x_j|<\infty \}$ with norm $\Vert x{\Vert }_1={\sum }_j|x_j|$. The real l-infinity sequence space is ${\ell }^{\infty }=\{x=(x_j):{\sup }_j|x_j|<\infty \}$ with norm $\Vert x{\Vert }_{\infty }={\sup }_j|x_j|$. Their completeness is allowed as given; their extreme points still require proof.

For ${\ell }^1$, an interior point of the unit ball is not extreme because small opposite perturbations in one coordinate stay in the ball. At a boundary point with two nonzero coordinates $i,j$, choose $0<\epsilon <\min (|x_i|,|x_j|)$ and putThe two distinct vectors $x+z,x-z$ both have norm one and average to $x$, so $x$ is not extreme. A remaining boundary point must be $\pm e_j$. If $e_j=(y+z)/2$ with $\Vert y{\Vert }_1,\Vert z{\Vert }_1\le 1$, the $j$th coordinate forces $y_j=z_j=1$, exhausting both norm budgets and forcing all other coordinates to zero. The negative case is identical. ThusFor ${\ell }^{\infty }$, if $|x_j|<1$ in even one coordinate, small opposite changes to that coordinate give a nontrivial midpoint decomposition within the ball. If every $x_j=\pm 1$, a midpoint decomposition forces both summands to have that same value in every coordinate, so they equal $x$. HenceThese are precisely the extreme points of real sequence-space unit balls for the two spaces under consideration.

A point $x$ of a convex set $K$ is an extreme point if $x=(1-t)a+tb$ with $a,b\in K$ and $0<t<1$ forces $a=b=x$. It is enough to test midpoints: a nontrivial interior point of a segment is the midpoint of a smaller nontrivial segment.

Here is a proof of the Krein-Milman theorem. The empty-set case is immediate, so take $K\ne \varnothing$. A face of a convex set is a convex subset $F\subseteq K$ such that an interior convex combination lying in $F$ has both endpoints in $F$. Consider nonempty compact faces. They include $K$. Every inclusion chain has nonempty intersection, because its closed subsets of the compact set $K$ have the finite intersection property. The intersection remains a compact face. The Zorn lemma, ordered by reverse inclusion, therefore supplies a minimal nonempty compact face $F$.

If $F$ contains two distinct points, the Hausdorff locally convex hypotheses and the allowed separation theorem supply a continuous real linear functional $\ell$ taking different values there. Its maximizer set in $F$ is nonempty and compact. It is convex, and if a convex combination attains the maximum, both endpoint values attain it too; hence it is a face of $F$. A face of a face is a face of $K$, by applying the defining endpoint property twice. This maximizer face is proper because $\ell$ is nonconstant, contradicting minimality. Thus $F$ is a singleton, whose point is extreme in $K$. The same minimal compact face argument inside any nonempty compact face shows that each such face contains an extreme point of $K$.

Let $H=\overline{\mathrm{conv}}(\mathrm{ext}K)$. Since $K$ is compact, hence closed in the Hausdorff space, and convex, $H\subseteq K$. It is nonempty, closed and convex. If $p\in K\setminus H$, the allowed strict separation theorem supplies a continuous linear functional withThe maximizer face of $\ell$ on $K$ contains an extreme point $e$ by the preceding argument. Then $e\in H$ but $\ell (e)={\max }_K\ell \ge \ell (p)>{\sup }_H\ell$, a contradiction. ThereforeAll closures refer to the given locally convex topology, and compactness is what justified both maxima and chain intersections.

For the real l-infinity sequence space, if $|x_j|<1$ for any coordinate, choose $0<ϵ\le 1-|x_j|$. The two distinct sequences $x\pm ϵe_j$ belong to the closed unit ball and have midpoint $x$, so $x$ is not extreme. Conversely, if every $x_j$ is one or minus one, writing $x=(1-t)a+tb$ for unit-ball sequences forces $a_j=b_j=x_j$ at every coordinate, because an endpoint of $[-1,1]$ cannot be a nontrivial convex average of its points. ThusFor the space of sequences converging to zero, every unit-ball sequence has some coordinate with $|x_j|<1$, since its coordinates tend to zero. The same opposite single-coordinate perturbations still belong to $c_0$, givingThese are extreme points of real sequence-space unit balls. There is no conflict with Krein-Milman: the norm-closed unit ball of $c_0$ is not compact in the norm topology, as the coordinate vectors have mutual distance one.

First we prove the Krein-Milman theorem in the required setting. If $K$ is empty the conclusion is immediate, so assume it is nonempty. A face of a convex set is a convex subset $F$ with the property that an interior point of a segment in $K$ belongs to $F$ only if both endpoints do. Consider all nonempty weakly compact faces of $K$, ordered by reverse inclusion. A chain has a nonempty intersection by compactness and the finite intersection property; that intersection is again a compact face. The Zorn lemma gives a minimal compact face $F$.

If $F$ contained distinct points, a bounded linear functional separating them would be nonconstant on $F$. Its maximizer set is a nonempty proper compact face of $F$, hence a face of $K$, contradicting minimality. Therefore $F$ is a singleton and its member is an extreme point of $K$. The same reasoning applies to each nonempty compact face of $K$, so each such face contains an extreme point of $K$.

Let $H$ be the norm-closed convex hull of the extreme points of $K$. A weakly compact subset of a Banach space is weakly closed, hence norm closed, so $H\subseteq K$. If $x\in K\setminus H$, the Hahn-Banach separation theorem gives $\ell \in E^{\prime }$ with $\ell (x)>{\sup }_H\ell$. The maximizer face of $\ell$ on $K$ contains an extreme point $e$ of $K$. Then $\ell (e)\ge \ell (x)>{\sup }_H\ell$, contradicting $e\in H$. We concludeNorm and weak closed convex hulls coincide by the same separation theorem. The printed phrase “closed convex cover” is understood in this standard closed-convex-hull sense.

Now work in the real space of continuous functions on a compact space $C(C)$ on the Cantor set. The extreme points of a real continuous-function unit ball are exactly the continuous sign functions:If $|f(x_0)|<1$, continuity supplies a neighbourhood where $|f|\le 1-\epsilon$. The Cantor cylinder sets form a clopen base, so choose a nonempty cylinder $D$ inside that neighbourhood. Its indicator function is continuous, and $f\pm \epsilon 1_D$ are distinct members of $B$ with midpoint $f$. Hence $f$ is not extreme. Conversely, if $f$ is pointwise sign-valued and $f=(g+h)/2$ with $g,h\in B$, equality at the endpoint of the scalar interval $[-1,1]$ forces $g(x)=h(x)=f(x)$ at every point.

To prove the closed-hull assertion without assuming weak compactness, take $f\in B$ and $\epsilon >0$. A sufficiently fine finite partition of $C$ into Cantor cylinders has oscillation of $f$ less than $\epsilon$ on each cell, by uniform continuity. Choose a value $a_j\in [-1,1]$ on each cell and let $h$ be the corresponding continuous step function. Then $\Vert f-h{\Vert }_{\infty }<\epsilon$. For each sign vector $s\in \{-1,1{\}}^m$, let $e_s$ take value $s_j$ on cell $j$, and assign the weightThese weights are nonnegative, sum to one, and satisfy ${\sum }_s{w}_s{s}_j=a_j$. Thus $h={\sum }_s{w}_s{e}_s$ is a convex combination of extreme points. This is clopen sign approximation in the real Cantor unit ball, provingNevertheless $B$ is not weakly compact. The suggested functions $f_n(x)=\min (3^{n}x,1)$ lie in $B$ and converge pointwise to the function equal to zero at $0$ and one at every other point of $C$. It is discontinuous at zero, since $2\cdot 3^{-j}\in C$ tends to zero. If $B$ were weakly compact, the sequence, viewed as a net, would have a weakly convergent subnet with limit in $C(C)$. Point evaluations are bounded linear functionals, so that subnet would have the same pointwise limit; its indices are cofinal in the original sequence. The limit would therefore be the discontinuous function just described, a contradiction. This discontinuous pointwise limit obstruction to weak compactness gives the required failure of weak compactness, despite the closed-hull equality.

All vector spaces in this solution are complex, while convex combinations use real coefficients. An extreme point $x$ of a convex set $C$ is one for which $x=ty+(1-t)z$, $y,z\in C$ and $0<t<1$, forces $y=z=x$. Equivalently, $x$ is not the midpoint of two distinct points of $C$.

The Krein-Milman theorem says that every nonempty compact convex set $K$ in a Hausdorff locally convex space is the closed convex hull of its extreme points. Here is a proof. A face of a convex set $F\subseteq K$ is a convex set such that whenever an interior point of a segment in $K$ belongs to $F$, both endpoints belong to $F$. Consider nonempty compact faces, ordered by reverse inclusion. A chain has nonempty intersection by compactness and the finite intersection property; that intersection is again a compact face. The Zorn lemma therefore gives a minimal nonempty compact face $F$.

If $F$ contains distinct $x,y$, a continuous real linear functional $\ell$ on the underlying real locally convex space distinguishes them. Such a linear functional exists because the space is Hausdorff and locally convex, by the Hahn-Banach theorem. The maximizers of $\ell$ on $F$ form a nonempty proper compact face of $F$. A face of a face is a face of $K$, contradicting minimality. Therefore $F$ is a singleton, yielding an extreme point. The same argument inside any nonempty compact face of $K$ supplies an extreme point of $K$ lying in that face.

Let $D$ be the closed convex hull of the extreme points of $K$. It is a nonempty closed subset of compact $K$, hence compact. If $x_0\in K\setminus D$, the Hahn-Banach separation theorem provides a continuous real linear functional $\ell$ with $\ell (x_0)>{\sup }_D\ell$. Its maximizer set on $K$ is a nonempty compact face, which contains an extreme point $e$ of $K$. But $e\in D$ and $\ell (e)\ge \ell (x_0)>{\sup }_D\ell$, a contradiction. Thus $\boxed{K=\overline{\mathrm{co}}(\mathrm{ext}K)}$, proving Krein-Milman theorem.

For a nonempty compact Hausdorff space $K$, the extreme points of the dual unit ball of C(K) areThis is the permitted description without proof, with $C(K)$ denoting the complex space of continuous functions on a compact space equipped with the supremum norm. If $K$ is empty, $C(K)=\{0\}$ and the closed unit ball of its continuous dual space has the single extreme point $0$ instead.

The complex Banach–Stone theorem states that a surjective complex-linear isometric isomorphism of normed spaces $T:C(K)\to C(L)$ has the formwhere $u\in C(L)$ and $\phi :L\to K$ is a homeomorphism. Conversely, every such map is a surjective complex-linear isometric isomorphism of normed spaces for the supremum norm.

To prove this, suppose first that $K,L$ are nonempty. The Banach-space adjoint $T^{\ast }$ is a bijective isometric isomorphism of normed spaces on the continuous dual spaces, so it bijects their closed unit balls and preserves extreme points. The displayed extreme point description gives uniquelyUniqueness follows by evaluating at the constant function $1$, and then using that continuous functions separate points of a compact Hausdorff space. Evaluation gives the required formula for $Tf$, and $u=T1$ is continuous. Surjectivity of $T^{\ast }$ on extreme points proves surjectivity of $\phi$: the preimage of any ${\delta }_x$ is $\alpha {\delta }_y$ for some $y$. If $\phi (y_1)=\phi (y_2)$, every function in the range of $T$ has equal values at these two points after division by $u$; surjectivity of $T$ and separation of points force $y_1=y_2$. Thus $\phi$ is bijective.

For every $f\in C(K)$, $f\circ \phi =(Tf)/u$ is continuous. The evaluation map $K\to {\mathbb{C}}^{C(K)}$, $x\mapsto (f(x){)}_f$, is a continuous injection of a compact Hausdorff space into a Hausdorff product topology, hence a homeomorphism onto its image. Continuity of every coordinate $f\circ \phi$ proves continuity of $\phi$. A continuous bijection between compact Hausdorff spaces is a homeomorphism. Conversely the weighted-composition formula plainly preserves the supremum norm, and its inverse isIf one compact space is empty, a surjective isometric isomorphism of normed spaces forces the other to be empty, and the empty homeomorphism gives the corresponding trivial case. This completes Banach–Stone theorem.

Neither the space of sequences converging to zero $c_0$ nor $L^1[0,1]$ can be isometrically a continuous dual space of a Banach space. Indeed, every nonzero continuous dual space has a nonempty weak-star compact closed unit ball by Banach-Alaoglu theorem, and Krein-Milman theorem then guarantees an extreme point. A bijective linear isometry preserves extreme points of closed unit balls.

The closed unit ball of $c_0$ has no extreme points. Given $x\in c_0$ with $\Vert x{\Vert }_{\infty }\le 1$, choose $n$ with $|x_n|<1$ and $0<\epsilon <1-|x_n|$. The two distinct elements $x\pm \epsilon e_n$ remain in that closed unit ball and have midpoint $x$.

The closed unit ball of the complex Lp space $L^1[0,1]$ also has no extreme points. An element of norm less than one can be perturbed by a sufficiently small nonzero Lp space element in both directions. If $\Vert f{\Vert }_1=1$, the non-atomic measure $|f(t)|dt$ admits a measurable set $A$ of mass $1/2$; for example the continuous function $s\mapsto {\int }_0^s|f(t)|dt$ attains $1/2$. Put $h=f(1_A-1_{A^c})$. For $0<\epsilon <1$, the distinct functions $f\pm \epsilon h$ both have Lp normwith the two coefficients interchanged for the minus sign. Their midpoint is $f$. Thus neither proposed space is isometrically a Banach dual.

Finally, $[0,1]$ is a connected space, whereas $[0,1]\cup [2,3]$ is disconnected. They cannot be homeomorphic. By Banach–Stone theorem, $C[0,1]$ and $C([0,1]\cup [2,3])$ are not isometrically isomorphic as complex Banach spaces.

A pure state on a C-star algebra is an extreme point of its state space. For a nonzero unital C-star algebra, the state space is a nonempty compact convex set in the weak-star topology, so the Krein-Milman theorem guarantees pure states.

Every Positive element of a C-star algebra $a$ attains its norm at a pure state. Indeed, states satisfying $f(a)=\Vert a\Vert$ form a nonempty compact face of a convex set: the maximum property forces each term of any nontrivial convex decomposition to attain the same maximum. An extreme point of this face is an extreme point of the whole state space. The argument uses the unital compactness statement, rather than asserting compactness for a general nonunital algebra.