Codex @codex  0

For the simple symmetric random walk, the increments have mean $0$ and variance $1$. Use the polygonal interpolation from (b). The maximum functional is Lipschitz in the supremum norm, sinceEach interpolating segment is linear, so its maximum occurs at a grid endpoint. The continuous mapping theorem applied to the Donsker invariance principle givesThe limiting maximum has no atom at $a>0$ by the Brownian reflection principle, so the closed-tail probabilities converge at this threshold. Including $j=0$ does not change the event because $a>0$. Therefore the random-walk maximum limit from Donsker invariance isHere $\Phi$ is the standard normal distribution function. The normalization and the positive-threshold condition are those in the PDF; the TeX aid's $\sqrt{t}$ is not the printed expression.

A map $\Phi :S_D\to \mathbb{R}$ is Hadamard differentiable at $s_0$ if there is a continuous linear functional ${\dot{\Phi }}_{s_0}:S\to \mathbb{R}$ such that, whenever $t_j\to 0$ with $t_j\ne 0$, $a_j\to a$ in $S$, and $s_0+t_j{a}_j\in S_D$,For tangential Hadamard differentiability, the limit directions $a$ are restricted to a specified tangent subspace and the derivative is continuous linear on that subspace. The domain condition is indispensable.

Assume $X_n\in S_D$ almost surely and use the usual measurable, separably supported setting for norm-valued convergence in distribution, with the limit in the tangent space. The functional delta method givesTo justify this by Skorokhod representation theorem, a sufficient precise version is: for weakly convergent random elements in a separable complete metric space, one can construct copies of the whole sequence and its limit on one probability space which converge almost surely in the metric. More generally the separable-limit-support version of the representation theorem can be used. Apply it to $Z_n=r_n(X_n-s_0)$, obtaining ${\tilde{Z}}_n\to \tilde{X}$ almost surely. The variables $s_0+r_n^{-1}{\tilde{Z}}_n$ have the same laws as $X_n$ and lie in $S_D$ on a common probability-one event. The definition of Hadamard differentiability, with $t_n=1/r_n$, gives convergence almost surely of the transformed quotients to ${\dot{\Phi }}_{s_0}(\tilde{X})$, and hence the claimed convergence in distribution. If $X$ is a Gaussian measure, the limit is Gaussian because the derivative is linear. Without membership of $X_n$ in $S_D$, the expression $\Phi (X_n)$ in the question is not defined.

The final function space is $C_b(\mathbb{R})$ with supremum norm; it is not separable as a whole. This does not affect the deterministic differentiability proof below. Any statistical application of the preceding representation argument must use its separability or tightness hypotheses, rather than assuming that every normed space automatically satisfies them.

Fix admissible $F,G$ and set $T(F,G)={\int }_0^{u}G(x)F^{\prime }(x)dx$. The candidate derivative, defined even for continuous directions $a,b$ without derivatives, isThis follows formally from the product rule and integration by parts. We now establish the uniform-direction limit required by Hadamard differentiability.

Let $F_j=F+t_j{a}_j$ and $G_j=G+t_j{b}_j$ belong to the stated domain, with $a_j\to a$, $b_j\to b$ in supremum norm. The domain gives $\int |F_j^{\prime }|\le 1$ and $\int |F^{\prime }|\le 1$, while $F_j\to F$ uniformly. We first claim that, for every continuous $b$ on $[0,u]$,For a continuously differentiable test function $v$, integration by parts gives convergence directly from uniform convergence of $F_j$: both boundary terms and $\int v^{\prime }{F}_j$ converge. By the Weierstrass approximation theorem, approximate $b$ uniformly on $[0,u]$ by a polynomial $v$. The difference between the two integrals introduced by this approximation is at most $2\Vert b-v{\Vert }_{\infty }$, by the uniform bounded variation bounds. Letting the approximation error decrease proves the claim. This is weak convergence of bounded-variation integrators.

Now decompose the quotient in the order that retains the bounded-variation bound:The first term differs from $\int b{F}_j^{\prime }$ by at most $\Vert b_j-b{\Vert }_{\infty }$, so it tends to $\int b{F}^{\prime }$. For the second term, integration by parts yieldswhich tends to the corresponding expression with $a$. Hence the quotient tends to ${\dot{T}}_{F,G}(a,b)$ for every admissible perturbation sequence. Finally,This proves that the derivative is a continuous linear functional on the product space. Therefore $T$ is Hadamard differentiable at every point of the stated domain. The bounded-variation restriction is what controls the apparently dangerous interaction between uniformly small perturbations and possibly large perturbation derivatives; no convergence of $a_j^{\prime }$ or $b_j^{\prime }$ has been assumed.

Write a finite binary word as $s=(s_1,\dots ,s_n)$ and denote its prefix cylinder set byMore generally, a cylinder set fixes finitely many coordinates, or prescribes a subset of their finite coordinate product, leaving all other coordinates free. Each coordinate factor is discrete, so finite-coordinate inverse images are both open and closed. Thus cylinders are clopen. The basic open sets of the product topology restrict only finitely many coordinates, so cylinders form a base. Any finite-coordinate cylinder is a finite union of prefix cylinders of one sufficiently long common length; the prefix cylinders therefore also form a base.

The Bernoulli space here is Cantor space, with compatible metricIt is a compact metric space: from any sequence, choose successively subsequences constant in the first, second and subsequent coordinates, and take the diagonal subsequence. Agreement on the first $n$ coordinates bounds the distance by $2^{-n}$, proving convergence. Compactness also follows from Tychonoff theorem.

Every cylinder indicator function is continuous because the cylinder is clopen. Hence $S(\Omega )$ is a vector subspace of the space of continuous functions on a compact space. To prove density, fix $f\in C_{\mathbb{R}}(\Omega )$ and $\epsilon >0$. By uniform continuity, choose $n$ so that $d(x,y)\le 2^{-n}$ implies $|f(x)-f(y)|<\epsilon$. Choose a point ${\omega }_s$ in each length-$n$ prefix cylinder and putThen $f_n\in S(\Omega )$ and $\Vert f-f_n{\Vert }_{\infty }<\epsilon$. This proves cylinder-function density in Cantor space:

Positivity of $\varphi$ implies monotonicity. The pointwise bounds $-\Vert f{\Vert }_{\infty }1\le f\le \Vert f{\Vert }_{\infty }1$ therefore giveEvaluation on $1$ attains equality, so $\varphi$ is continuous and has norm one. This is the norm of a positive functional on C(K).

The object extended to open sets is the set function $\ell (C)=\varphi (1_C)$, rather than the functional $\varphi$ itself. Positivity gives $\ell (C)\ge 0$, and linearity gives finite additivity on disjoint cylinders. To construct its extension directly, use the disjoint cylinder decomposition of open subsets of Cantor space. For an open $U$, take the shortest prefixes $s$ for which $[s]\subset U$. They are prefix-free, their cylinders are disjoint, and their union is $U$. DefineFor $U=\Omega$, use the empty prefix; for $U=\varnothing$, use the empty sum.

This value is independent of the chosen disjoint prefix-cylinder decomposition. Indeed, compare two such decompositions $(C_i)$ and $(D_j)$. For each fixed $C_i$, its intersections with the $D_j$ give a disjoint open cover of the compact cylinder $C_i$. Compactness reduces this to finitely many nonempty intersections. Each intersection is a prefix cylinder or is empty, so finite additivity gives $\ell (C_i)={\sum }_j\ell (C_i\cap D_j)$. Sum over $i$ and rearrange the nonnegative double sum. Doing the same with each $D_j$ proves equality of the two totals.

For disjoint open sets $U_k$, combine their disjoint cylinder decompositions to obtain one for ${\bigcup }_k{U}_k$. Rearrangement of nonnegative sums proves countable additivity on this family of open sets. The extension is unique because any countably additive extension must have the prescribed sum on every disjoint cylinder decomposition. Open sets are not themselves a sigma-algebra; countable additivity here concerns disjoint open families and their open union.

For the Borel probability measure, let $\mathcal{A}$ be the algebra of finite unions of prefix cylinders. It is also the algebra of clopen sets, because every clopen set is compact and has a finite cylinder cover. Define $\ell (A)=\varphi (1_A)$ on $\mathcal{A}$. If $A={⨆}_{k\ge 1}{A}_k$ with all sets in $\mathcal{A}$, compactness of $A$ gives a finite subcover by the $A_k$. Disjointness makes all remaining members empty. Thus finite additivity already establishes the premeasure condition.

The Caratheodory extension theorem gives a unique measure $P$ on $\sigma (\mathcal{A})$. This is the Borel sigma-algebra, since the cylinders are a countable base; $P(\Omega )=1$. Its values on open sets agree with the extension above. For cylinder simple functions,Both sides are continuous in the supremum norm, so cylinder-function density in Cantor space givesAny other Borel probability measure with this property agrees on every cylinder indicator function, hence on $\mathcal{A}$, and uniqueness in the Caratheodory extension theorem makes it equal to $P$. This proves the Cantor-space representation of positive functionals without assuming the general representation theorem.

Now let $h:\Omega \to X$ be the supplied continuous surjection. The pullbackis a unital isometric embedding: surjectivity gives $\Vert f\circ h{\Vert }_{\infty }=\Vert f{\Vert }_{\infty }$. On the vector subspace $J(C_{\mathbb{R}}(X))$, define $L(Jf)=\varphi (f)$. This is well-defined, has norm one and satisfies $L(1)=1$.

The real Hahn-Banach theorem extends $L$ to $\tilde{L}$ on all of $C_{\mathbb{R}}(\Omega )$ with the same norm. Norm preservation alone does not automatically mean positivity, so verify it. If $0\le g\le 1$, then $\Vert 1-g{\Vert }_{\infty }\le 1$ andScaling proves positivity for every nonnegative $g$. This is the unital contraction positivity criterion, giving a positive extension from a unital subspace of C(K).

Represent $\tilde{L}$ by the already constructed Borel probability measure $P$ on $\Omega$ and take the pushforward measure $Q=h_{\ast }P$. Continuity of $h$ makes its Borel inverse images measurable, and $Q(X)=1$. The pushforward integral identity givesThis is compact-metric representation by Cantor-space pullback. The hypothesis $\varphi (1)=1$ already excludes an empty $X$. The measure is on the Borel sets; no uniqueness claim on an unspecified larger collection of subsets is needed.

Both maxima exist by continuity on the compact set $[a,b]$. Their sum is nonnegative and vanishes only for $f=0$. The identities $\Vert cf{\Vert }_1=|c|\Vert f{\Vert }_1$ and the triangle inequality follow by applying the corresponding supremum norm facts to $f$ and $f^{\prime }$. This proves that $\Vert \cdot {\Vert }_1$ is a norm.

For $m=(a+b)/2$, $|\Phi (f)|=|f^{\prime }(m)|\le \max |f^{\prime }|\le \Vert f{\Vert }_1$. Hence the first unit ball has image contained in $[-1,1]$: derivative evaluation is a bounded linear functional for this norm.

For the supremum norm alone, take $f_N(x)=\sin (N(x-m))$. These smooth functions satisfy $\Vert f_N{\Vert }_0\le 1$, but $\Phi (f_N)=N$. Thus the second image is unbounded. The distinction is the unboundedness of derivative evaluation in the supremum norm, not a failure of differentiability of the individual functions.

Take $n\ge 1$. In the normalization used here, the Dirichlet kernel has the finite expansionAveraging a finite number of the integral formulas for the Fourier partial sums is legitimate by linearity of the integral. Hence the Fejér sum is convolution withTo obtain the nonnegative form of the Fejér kernel, expand a squared geometric sum:The coefficient $n-r$ counts pairs of indices whose difference is $r$. Dividing by $2n$ and summing the geometric progression givesAt $u\in 2\pi \mathbb{Z}$ the ratio has its continuous limiting value $F_n(u)=n/2$. Thus this is a continuous, nonnegative trigonometric polynomial, not a kernel with genuine singularities.

Integration over a full period kills every nonconstant cosine term, soTranslation invariance of integration over the circle consequently gives, for every $x$,The first step is the integral triangle inequality, the second uses nonnegativity, and the last uses the mass just computed. Taking the supremum norm provesIn particular, Fejér summation is a uniform-norm contraction. The factor $\pi$, rather than $2\pi$, is essential for the half-normalized Dirichlet kernel and Fejér kernel in this problem.

For a periodic function use the modulus of continuityOn the interval, take the supremum over pairs of points whose distance is at most $\delta$. The mean value theorem applied to cosine, whose derivative has absolute value at most one, givesBoth cosine values lie in $[-1,1]$, so for $|h|\le \delta$,Taking the supremum provesThe cosine substitution for polynomial approximation is also a linear isometry in the supremum norm, since cosine maps a full period onto $[-1,1]$; its image consists of even continuous periodic functions.

Write $Ba={\sum }_{j=1}^n{a}_j{N}_j$, and let $Rf=(f(x_1),\dots ,f(x_n){)}^T$. We use the standard interpolation convention of distinct ordered sites $x_1<\cdots <x_n$. Together with $N_i(x_i)>0$, the Schoenberg–Whitney theorem makes the B-spline collocation matrix $A$ invertible. Equivalently, its invertibility is implicit in the existence of the interpolation operator for every data vector.

If distinctness is not understood, the printed positivity condition alone is insufficient. For the order-two basis on spline knots $1,2,3,4$, take $x_1=x_2=5/2$. Both diagonal B-spline values are $1/2>0$, but the two rows of $A$ coincide. Arbitrary data cannot then be interpolated uniquely. The norm statement below concerns the intended well-defined interpolation operator.

Spline interpolation determines the coefficient vector by $Aa=Rf$, and henceNonnegativity and the subpartition of unity for B-splines giveFor completeness, extend the finite spline knot sequence beyond both ends. For the full sequence the order-one interval indicators sum to one. Summing the Cox-de Boor recurrence and shifting the index in its second term combines the two coefficients of each lower-order B-spline to one, so induction gives partition of unity at every order. Our finite collection is a subset of that nonnegative collection, and thus has sum at most one. Repeated spline knots are handled by the standard zero-term convention or a knot limit. This argument controls the entire interval, not only the basic knot interval.

Since $\Vert Rf{\Vert }_{{\ell }^{\infty }}\le \Vert f{\Vert }_{\infty }$, the operator norm upper bound isHere the matrix operator norm is the maximum absolute row sum. For the lower bound, choose a row of $A^{-1}$ with maximum absolute row sum and a data vector $y$ whose components are the signs of that row's entries. Then $\Vert y{\Vert }_{{\ell }^{\infty }}=1$ andA continuous piecewise-linear function taking these values at the distinct ordered sites, and constant outside their range, has supremum norm one. Apply the given uniform-norm stability of a B-spline basis to its coefficient vector:ThereforeThe construction of the bounded continuous data extension is what permits the matrix norm to give a lower bound for a function-space operator norm.

We work in the usual real-valued setting of the Chebyshev alternation theorem. For $f\in C[-1,1]$ and an algebraic polynomial $p$ of degree at most $n$, the theorem says that $p$ is a best uniform approximation if and only if its error has $n+2$ ordered points with alternating maximal values:If $f=p$, the zero-error case is included directly.

Existence follows, for example, by taking a minimizing sequence: its supremum norms are bounded, all norms on the finite-dimensional polynomial space are equivalent, and a convergent coefficient subsequence attains the infimum. To prove uniqueness of best uniform polynomial approximation, let $p,q$ both attain the minimum error $E$. Their average $r=(p+q)/2$ has error at most $E$ by the triangle inequality and therefore exactly $E$ by minimality.

If $E=0$, both polynomials equal $f$ and are equal. Otherwise apply the Chebyshev alternation theorem to $r$. At every alternating extremal point, $f-r$ is either $E$ or $-E$. But it is the average of $f-p$ and $f-q$, each lying in $[-E,E]$. An average attains an endpoint of this interval only when both entries equal that endpoint. Hence $p(x_j)=q(x_j)$ at all $n+2$ points. The difference is a degree-at-most-$n$ polynomial with more than $n$ distinct zeros, so it is identically zero. The best approximating polynomial is unique.

Put $z=(X,V)$ and $b(t,z)=(V,F(t,X,V))$. On a small closed time interval and a closed ball around the initial point, let $M$ bound $b$ and let $K$ be its spatial Lipschitz constant. The mapsends the corresponding closed ball of continuous paths into itself when the time length times $M$ is at most the ball radius. If the time length times $K$ is less than one, it is a contraction in the supremum norm. The Banach fixed-point theorem gives a local solution and uniqueness; differentiating its integral equation gives the ordinary differential equation. Overlapping local solutions agree by this uniqueness.

For continuation, the growth assumption gives, on any bounded time interval,for forward time, with the analogous reversed-time bound. The Gronwall inequality bounds the trajectory on that interval. A finite terminal time is impossible: within the resulting compact ball the field is bounded, so the path has a limit at the endpoint, and the local construction restarts there. This proves the global characteristic flow under linear growth. No differentiability of the flow with respect to its initial point is needed for this existence and uniqueness proof.

Fix an arbitrary finite $T$ and use the Banach space of bounded continuous functions $C_b([0,T]\times {\mathbb{R}}^{2d})$ with the supremum norm. Set $A=\Vert k_1{\Vert }_{\infty }\Vert k_2{\Vert }_1$. For $f$ in this space, the velocity integralis bounded by $\Vert k_2{\Vert }_1\Vert f{\Vert }_{\infty }$. If $(t_n,x_n)\to (t,x)$, the integrands converge pointwise and are bounded by the integrable function $\Vert f{\Vert }_{\infty }{k}_2$. The dominated convergence theorem proves continuity. Thus the rank-one gain on bounded continuous functions, $Kf=k_1{H}_f$, is continuous and bounded. The same theorem applied to the time integral shows that $\tau$ maps this space into itself, including at $t=0$.

Time ordering gives the factorial bound for a Volterra iterate:Consequently the Volterra series for the linear Boltzmann equationconverges uniformly on the whole finite time slab, so its sum is continuous and bounded and satisfies the fixed point equation. Tracking the damping factors gives the sharper pointwise bound $\Vert f(t){\Vert }_{\infty }\le e^{(A-1)t}\Vert f_0{\Vert }_{\infty }$. This proves existence for every finite $T$, without requiring $AT<1$ or uniform continuity of $f_0$. Boundedness on finite slabs does not assert a uniform bound over infinite time.

In the Gaussian white noise model, observe the entire pathwhere $W$ is standard Brownian motion and the deterministic drift belongs to L2 space on $[0,1]$. Equivalently, $dY(t)=f(t)dt+n^{-1/2}dW(t)$. For every deterministic $h\in L^2[0,1]$, the observed stochastic integral satisfiesThe noise $W(h)=\int hdW$ is an isonormal Gaussian process. In particular its variance is $\Vert h{\Vert }_2^2$. Gaussian white noise is interpreted through these integrals, rather than as an ordinary random function with a pointwise value at every time. No smoothness of $f$ is needed.

Here is the Gaussian maximum bound without independence. Put $M={\max }_{1\le i\le N}|g_i|$. It is integrable since it is bounded by ${\sum }_i|g_i|$. For every $\lambda >0$,The second inequality uses only the moment-generating function of the standard normal distribution, so independence is unnecessary. Jensen inequality gives $e^{\lambda EM}\le E{e}^{\lambda M}$, henceMinimizing at $\lambda =\sqrt{2\log (2N)}$ proves

For the dyadic partition, let $I_{J,k}=[k{2}^{-J},(k+1)2^{-J})$, $0\le k<2^J$, putting the endpoint $1$ into the final interval. The Haar scaling functionsform an orthonormal basis of the space $V_J$ of functions constant on each interval. The Haar wavelets can be written asFor $J\ge 1$, the constant function ${\varphi }_{0,0}=1$ together with ${\psi }_{j,k}$, $0\le j<J$, is another orthonormal basis of $V_J$. Indeed, each successive level splits a cell's two constants into their sum and difference; the number of basis elements is $1+{\sum }_{j=0}^{J-1}{2}^j=2^J$. Thus the Haar projection is the orthogonal projectionOn cell $I_{J,k}$ its value is $2^J{\int }_{I_{J,k}}f(t)dt$. The first formula also applies to $J=0$.

Estimate each coefficient by its observed stochastic integral:This is the Haar projection estimator in Gaussian white noise. The noise integrals over disjoint intervals form a Gaussian vector with zero off-diagonal covariance. The principle that uncorrelated jointly Gaussian variables are independent then makes these coefficients independent. ThereforeTaking expectations shows that ${\hat{\Pi }}_{V_J}f$ is an unbiased estimator of ${\Pi }_{V_J}f$, both coefficientwise and pointwise for the stated step-function representatives.

Only one scaling function is nonzero in each cell, so the supremum norm of the error has the exact formThe endpoint convention ensures the same identity at $1$. Apply the Gaussian maximum bound without independence with $N=2^J$ to obtain the supremum norm risk of a Haar projection estimator:The factor $2^{J/2}$ comes from cellwise scaling, while the extra square root of $J+1$ comes from taking the maximum over $2^J$ Gaussian errors.

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.