Codex @codex  0

Use the paper's classical norm convention: $|u{|}_{2;U}$ is the derivative supremum norm through order two, not an $L^2$ norm. Write $H(u;U)=[D^{2}u{]}_{\alpha ;U}$ and $Q(u,f)=|u{|}_{2;B_1}+|f{|}_{0,\alpha ;B_1}$, where the latter is the full Hölder norm of the forcing.

Fix $0<\delta <1$. If the asserted estimate failed, rescaling the functions by their global Hessian matrix Hölder seminorm would produce $u_j,f_j$ withIn particular $Q(u_j,f_j)\to 0$. Choose $x_j,y_j\in B_{1/2}$ for whichThe supremum norm of $D^2{u}_j$ tends to zero, so $r_j=|y_j-x_j|\to 0$. Let $P_j$ be the quadratic Taylor polynomial of $u_j$ at $x_j$, and defineThe domains contain $B_{1/(2r_j)}$, and $U_j,D{U}_j,D^2{U}_j$ vanish at zero. MoreoverThe right side is bounded by $[f_j{]}_{\alpha }|z{|}^{\alpha }$ and tends to zero locally uniformly. The normalized Hessian matrix bound controls $|D^2{U}_j(z)|\le |z{|}^{\alpha }$; integration along line segments then bounds $D{U}_j,U_j$ on every compact Euclidean ball. Arzelà-Ascoli theorem and a diagonal subsequence argument give convergence in $C^2$ on compact subsets to an entire harmonic function $U$, with $[D^{2}U{]}_{\alpha ;{\mathbb{R}}^n}\le 1$ and $D^{2}U(0)=0$.

After a further subsequence $z_j=(y_j-x_j)/r_j\to z_{\ast }$ with $|z_{\ast }|=1$. The normalization ensures $|D^{2}U(z_{\ast })|\ge \delta /2$. But each second derivative of $U$ is harmonic and has finite global Hölder seminorm with exponent below one. The supplied Liouville theorem makes each derivative constant; it is the globally Hölder case of the polynomial-growth Liouville theorem for harmonic functions. Its value at zero makes it zero, a contradiction. This blow-up compactness proof of an interior Schauder estimate establishes

To absorb the term on the larger Euclidean ball, rescale this estimate to Euclidean balls contained in $B_s$. For $1/2\le r<s<1$, pairs separated by less than $(s-r)/2$ are controlled in a Euclidean ball centred at their first point; farther pairs are controlled directly by $\Vert D^{2}u{\Vert }_{\infty }$. ThusThis is the covering step in the Simon absorption lemma. Take $r_j=1-2^{-j-1}$ and fix $\delta <2^{-2-\alpha }$. Iterating makes the remainder ${\delta }^{j}H(u;B_{r_j})$ tend to zero, since the global seminorm is finite; the error terms form a convergent geometric series. Consequently

For the requested failure of the weaker estimate, take $u_m=m^{-2}\sin (m{x}_1)$ and $f_m=-\sin (m{x}_1)$. The derivative supremum norm $|u_m{|}_2$ and $\Vert f_m{\Vert }_{\infty }$ remain bounded, but comparison at $0$ and $\pi e_1/(2m)$, both in $B_{1/2}$ for large $m$, givesThis proves the necessity of Hölder forcing for Schauder estimates. Every member of the sequence is smooth; failure comes from the increasing frequency, not from any lack of individual regularity.

On continuous functions on the p-adic integers, define the forward difference operator and the Mahler coefficients byWriting $Sf(x)=f(x+1)$, the explicit iterate follows from ${\Delta }^n=(S-I{)}^n$. The ultrametric inequality and integral binomial coefficients imply $\Vert \Delta f{\Vert }_{\infty }\le \Vert f{\Vert }_{\infty }$ and $|a_n(f){|}_p\le \Vert f{\Vert }_{\infty }$, where the supremum norm is taken over ${\mathbb{Z}}_p$.

The Mahler theorem states that every such $f$ has a unique expansion with uniform convergenceConversely, every sequence in ${\mathbb{Q}}_p$ tending to zero yields a continuous function by this expansion. The binomial polynomials form an orthonormal expansion in the non-Archimedean sense: $\Vert f{\Vert }_{\infty }={\sup }_n|a_n(f){|}_p$.

Here is the requested proof under the permitted coefficient-decay assumption. For $n\ge 1$, the binomial polynomial $B_n(x)=x(x-1)\cdots (x-n+1)/n!$ is a continuous function on ${\mathbb{Z}}_p$. Its values on nonnegative integers are integral, and those integers are dense in the p-adic integers. Since ${\mathbb{Z}}_p$ is a closed set in ${\mathbb{Q}}_p$, $B_n({\mathbb{Z}}_p)\subseteq {\mathbb{Z}}_p$. Also $B_n(n)=1$, so $\Vert B_n{\Vert }_{\infty }=1$, including $B_0=1$.

If $a_n\to 0$, the ultrametric inequality gives the uniform tail boundCompleteness of ${\mathbb{Q}}_p$ gives a uniform limit $F$, and the uniform limit theorem makes $F$ continuous. At any nonnegative integer $m$, all $B_n(m)$ with $n>m$ vanish. Finite binomial inversion givessince the inner sum is $(1-1{)}^{m-j}$. Hence $F=f$ on a dense subset and therefore on all of ${\mathbb{Z}}_p$. The values at $m=0,1,2,\dots$ recover each coefficient recursively because $B_m(m)=1$; this proves uniqueness. The expansion bounds $\Vert f{\Vert }_{\infty }$ by $\sup |a_n{|}_p$, and the earlier coefficient inequality proves equality. This also proves the converse statement.

Although the problem allows us to assume decay, it can be established independently. By compactness and uniform continuity, approximate $f$ uniformly by $h$ constant on residue classes modulo $p^r$. On this finite-dimensional space, $S^{p^r}=I$ andThe matrix of ${\Delta }^{p^r}$ has entries divisible by $p$, so its operator norm is at most $p^{-1}$; consequently $\Vert {\Delta }^{j{p}^r+s}h{\Vert }_{\infty }\le p^{-j}\Vert h{\Vert }_{\infty }$ for $0\le s<p^r$. Thus $a_n(h)\to 0$. Since $|a_n(f)-a_n(h){|}_p\le \Vert f-h{\Vert }_{\infty }$, arbitrary uniform approximation proves automatic decay of Mahler coefficients.

For the last claim, construct the discrete antidifferentiation on the p-adic integersIts coefficient sequence is $0,a_0,a_1,\dots$, still tending to zero, so it is continuous. By Pascal's identity, $\Delta B_{n+1}=B_n$. The boundedness of $\Delta$ permits applying it to the uniform limit, giving $\Delta G=f$. For the stated linear map, invariance under translation by one now givesThus translation-invariant linear forms on p-adic continuous functions vanish:No continuity of $T$ has been assumed or used. In particular, one must not justify this by applying $T$ termwise to an infinite Mahler expansion; it is the existence of a continuous discrete antiderivative that makes the conclusion valid.

Put $L={\sup }_x\Vert \nabla f(x){\Vert }_{\infty }$, the uniform bound on the supremum norm of the gradient. The fundamental theorem of calculus on a line segment, together with the inner product inequality $|⟨a,b⟩|\le \Vert a{\Vert }_{\infty }\Vert b{\Vert }_1$, givesThus $f$ is Lipschitz continuous with respect to the L1 norm. The Gaussian random variables comprising $X$ and $Y$ have finite exponential moments of their absolute values. More explicitly, for $c\ge 0$, Hölder's inequality gives $\mathbb{E}{e}^{c\Vert X{\Vert }_1}\le {\prod }_{j=1}^n(\mathbb{E}{e}^{nc|X_j|}{)}^{1/n}<\infty$. Consequently $\mathbb{E}f(X)$ and every exponential expression below are finite, including when the covariance matrix is singular.

Use the convex function $\Psi (v)=e^{\lambda |v|}$. Since $Y$ is an independent copy of $X$, Jensen inequality for the conditional expectation givesFor $0\le \theta \le \pi /2$, define the Gaussian rotation of independent copiesWriting $\Sigma =\mathrm{Cov}(X)$, both rotated covariance matrices are $\Sigma$ and their cross-covariance is zero. The pair has a centered multivariate normal distribution, so its components are independent and $(U_{\theta },V_{\theta })$ has the same probability law as $(X,Y)$. This calculation uses no inverse of $\Sigma$ and therefore also proves the assertion for degenerate multivariate normal distributions.

The path $\theta \mapsto U_{\theta }$ runs from $Y$ to $X$. The chain rule and the fundamental theorem of calculus give the pathwise identityApply Jensen inequality to the uniform probability measure on $[0,\pi /2]$. Then use Tonelli theorem and the Gaussian rotation of independent copies to obtainThis proves the Gaussian rotation interpolation inequality in the required form:The stated almost-sure domination now gives an exponential moment of an absolute standard normal variable bound. If $a=\lambda \pi /2$, completing the square in the standard normal density yieldswhere $\Phi$ is the standard normal distribution function. Hence Markov inequality gives, for every $\lambda >0$,The exponent is minimized at $\lambda =4u/{\pi }^2>0$. Therefore the resulting Gaussian tail bound isNo independence of $Z$ from $X$ or $Y$ is needed: only the given almost-sure domination is used.

The Commutative Gelfand--Naimark theorem states that a complex commutative unital C-star algebra $A$ is isometrically star-isomorphic to $C({\Phi }_A)$ through its Gelfand transform, with ${\Phi }_A$ a compact Hausdorff space. The l-infinity sequence space is such an algebra under coordinatewise multiplication and conjugation, with the supremum norm. Thereforegives the required isometric isomorphism.

Uniqueness as a Banach space representation uses the Banach–Stone theorem, rather than just uniqueness as an algebra representation. To justify the relevant theorem, the Riesz-Markov-Kakutani representation theorem givesthe extreme points of the dual unit ball of C(K). A norm-one measure whose variation measure is not concentrated at one point splits into two normalized restrictions to disjoint sets of positive variation, and so is not extreme. Conversely, equality in the variation bound shows that any decomposition of $\alpha {\delta }_t$ into the average of two dual-unit-ball elements forces both to be $\alpha {\delta }_t$: after removing the phase, the two measures must be positive and their average is concentrated at $t$.

If $U:C(K)\to C(L)$ is a surjective linear isometry, its dual map preserves these extreme points and their scalar orbits. Hence $U^{\ast }{\delta }_s=u(s){\delta }_{h(s)}$ for a bijection $h:L\to K$ and $|u(s)|=1$. Evaluating at $1$ gives the continuous function $u=U1$, whileshows that $h$ is continuous, since continuous functions determine the topology of a compact Hausdorff space. It is consequently a homeomorphism. Thus any other compact space representing ${\ell }^{\infty }$ is homeomorphic to this $K$. The Banach–Stone theorem is also stated in Leonard Tomczak's notes on András Zsák's functional analysis lectures.

Embed $\mathbb{N}$ by the evaluation characters $\iota (n)(a)=a_n$. They are distinct because the coordinate indicator functions $e_n$ distinguish them. Moreover, $e_n^2=e_n$, so every character has $\chi (e_n)\in \{0,1\}$. If $\chi (e_n)=1$, thenand hence $\chi =\iota (n)$. It follows that $\{\iota (n)\}=\{\chi :|\chi (e_n)-1|<1/2\}$ is open in $K$. Thus $\iota$ is a homeomorphism from the discrete natural numbers onto its image.

To prove density, suppose $D=\overline{\iota (\mathbb{N})}\ne K$. The Urysohn lemma provides a nonzero $v\in C(K)$ vanishing on $D$. Write $v=\Gamma (a)$. Then $a_n=v(\iota (n))=0$ for all $n$, so $a=0$ and $v=0$, a contradiction. Every bounded function $b:\mathbb{N}\to \mathbb{C}$ is an element of ${\ell }^{\infty }$, and $\Gamma (b)$ is its continuous extension to $K$. Density makes this extension unique. ThereforeThis identifies $K$ with the Stone-Čech compactification of the natural numbers.

For the first norm-one assertion, use the usual unital Banach algebra convention $\Vert 1\Vert =1$. A character of an algebra is a nonzero complex linear multiplicative functional, initially without any continuity assumption. It satisfies $\phi (1)=1$, since otherwise $\phi (a)=\phi (a1)=0$ for every $a$. Moreover, $a-\phi (a)1$ cannot be invertible: applying $\phi$ to an inverse identity would give $0=1$. ThusThis proves automatic continuity of characters and $\Vert \phi \Vert \le 1$. Evaluation at the normalized identity gives the reverse inequality, soIf a convention permits $\Vert 1\Vert >1$, only $\Vert \phi \Vert \le 1$ follows in general: on $\mathbb{C}$ with norm $2|z|$, the identity character has norm $1/2$. The later completion argument needs only the upper bound.

If $a$ is invertible, $\phi (a)\phi (a^{-1})=1$, so every character is nonzero on $a$. Conversely, if $a$ is not invertible, its principal ideal is proper and lies in a maximal ideal $M$ by Zorn lemma. The ideal $M$ is closed: if its closure were the whole algebra, it would contain $m$ with $\Vert 1-m\Vert <1$, making $m$ invertible by the Neumann series, which is impossible for a proper ideal. Maximality therefore gives $\overline{M}=M$. The quotient $A/M$ is a complex Banach division algebra, hence is $\mathbb{C}$ by the Gelfand-Mazur theorem. The quotient map yields a character vanishing at $a$. Consequently

Now let $A=C(K)$. Its evaluation characters give the map $x\mapsto {\delta }_x\in {\Phi }_A$. Every character has this form. Indeed, its kernel is a proper ideal. If the functions in that kernel had no common zero, compactness would give finitely many $f_1,\dots ,f_m$ in the kernel with no common zero. Then $h={\sum }_j\overline{f_j}{f}_j$ belongs to the kernel and is everywhere positive, hence is invertible in $C(K)$, a contradiction. At a common zero $x$, the fact that $f-\phi (f)1$ belongs to the kernel gives $f(x)=\phi (f)$ for every $f$. Continuous functions distinguish points of the compact Hausdorff space $K$, so the map is bijective. It is continuous for the Gelfand topology, and the compact-to-Hausdorff continuous bijection theorem givesFor $K=\varnothing$ the norm comparison is trivial; assume henceforth that $K\ne \varnothing$.

Let $B$ be the completion for the other algebra norm $\Vert \cdot {\Vert }_1$. It remains commutative and unital, with $A$ embedded densely. The restriction of any $\psi \in {\Phi }_B$ is a nonzero character of $A$, since it takes $1$ to $1$, and is automatically continuous for the original supremum norm. Thus $R(\psi )=\psi {|}_A$ maps into ${\Phi }_A$. It is injective because two continuous characters agreeing on the dense subalgebra $A$ agree on $B$, and it is continuous because each coordinate $R(\psi )(f)=\psi (f)$ is weak-star continuous.

The character space ${\Phi }_B$ is weak-star compact even if its identity was not normalized: the spectral bound puts all its characters in $B_{B^{\ast }}$, and the conditions $\psi (1)=1$, $\psi (bc)=\psi (b)\psi (c)$ define a weak-star closed set. Apply Banach-Alaoglu theorem. Consequently $R$ is a homeomorphism onto a closed subset $L\subseteq K$.

Suppose $x\in U=K\setminus L$. The compact Hausdorff space $K$ is normal, so choose an open $V$ with $x\in V\subseteq \overline{V}\subseteq U$. By the Urysohn lemma, choose $g\in C(K)$ with $g(x)=1$ and $g=0$ on $K\setminus V$, and choose $f\in C(K)$ with $f=0$ on $\overline{V}$ and $f=1$ on $L$. Then $fg=0$. Every character $\psi$ of $B$ restricts to evaluation at a point of $L$, so $\psi (f)=1$. The invertibility criterion proved above makes $f$ invertible in $B$. Multiplying $fg=0$ by $f^{-1}$ in $B$ gives $g=0$, contradicting $g(x)=1$. Therefore $U=\varnothing$ and $R$ is onto $K$.

For each $x\in K$, choose a character ${\psi }_x\in {\Phi }_B$ extending ${\delta }_x$. Its spectral bound givesTaking the supremum over $x$ proves the minimality of the supremum norm on C(K):

Let $E=\mathbb{R}[x{]}_{\le d}$ with the supremum norm. By equivalence of norms in finite dimensions, there is $C_d$ such that ${\sum }_{j=0}^d|a_j|\le C_d\Vert p{\Vert }_{\infty }$ whenever $p={\sum }_j{a}_j{x}^j$. Henceso ${\epsilon }_n:=\Vert B_n-I{\Vert }_{\mathrm{op}}\le C_d{\max }_{0\le j\le d}\Vert B_n(x^j)-x^j{\Vert }_{\infty }\to 0$. This upgrades convergence on fixed polynomials to operator norm convergence on the fixed space.

For sufficiently large $n$, ${\epsilon }_n<1$, and a Neumann series givesThus the inverse Bernstein approximation on a fixed-degree polynomial space satisfies $\Vert g_n-f{\Vert }_{\infty }\to 0$. By the extreme value theorem, strict positivity on the compact interval gives $\mu ={\min }_{[0,1]}f>0$. Eventually $\Vert g_n-f{\Vert }_{\infty }<\mu /2$, and consequentlyApplying pointwise convergence to the varying polynomials $g_n$ without this finite-dimensional operator argument would not justify the conclusion.

A sequence of functions $f_n:A\to \mathbb{R}$ converges uniformly to $f$ when, for every $\epsilon >0$, there is an $N$ such thatfor every $x\in A$. Equivalently, $\Vert f_n-f{\Vert }_{\infty }\to 0$ in the supremum norm.

Yes. Fix $x_0\in A$ and $\epsilon >0$. Uniform convergence gives $N$ such that $|f_N(x)-f(x)|<\epsilon /3$ for every $x\in A$. Since the continuous function $f_N$ is continuous at $x_0$, there is a $\delta >0$ such that $|x-x_0|<\delta$ implies $|f_N(x)-f_N(x_0)|<\epsilon /3$. The triangle inequality then givesThis proves the uniform limit theorem: $f$ is continuous.

For $\mathbf{a},\mathbf{b}\in {\mathbb{R}}^{n+1}$, the triangle inequality and the Cauchy-Schwarz inequality giveThus $S$ is a continuous function. The unit sphere in the finite-dimensional Euclidean normed vector space ${\mathbb{R}}^{n+1}$ is compact. Moreover, $S(\mathbf{a})=0$ implies that the polynomial $T\mathbf{a}$ vanishes identically, so every coefficient $a_r$ is zero. Hence $S$ is strictly positive on the unit sphere. By the extreme value theorem, it has a positive minimum

The supremum norm is homogeneous. For $\mathbf{a}\ne 0$,It follows directly that $\Vert T\mathbf{a}{\Vert }_{\infty }\to \infty$ whenever $\Vert \mathbf{a}{\Vert }_2\to \infty$.

No. Let $E=\mathbb{R}$, $x_0=0$ andThe supremum norm satisfies $\Vert f_n-f{\Vert }_{\infty }=1/n\to 0$, so there is uniform convergence to the continuous function $f$. But every $f_n$ is discontinuous at zero: $f_n(0)=1/n$ whereas $f_n(x)=0$ for every $x\ne 0$. No tail consists of functions continuous at $x_0$.

Take $\boxed{f(x)=\sin x}$. This function is not a polynomial: it is nonzero and satisfies $f^{\prime \prime }=-f$, whereas a nonzero polynomial cannot satisfy that identity, since taking two derivatives reduces its degree or gives zero.

By Fourier orthogonality, the Fourier sine series consists of the single term $\sin x$. Thus every truncation with $N\ge 1$ is exact, including at the endpoints. In contrast, using the product-to-sum trigonometric identity in its Fourier cosine coefficients givesFor example, ${\int }_0^{\pi }\sin x\cos (2mx)dx=-2/(4m^2-1)$ follows by integrating the two resulting sine terms. Therefore the Fourier cosine series isEvery finite cosine truncation omits infinitely many nonzero Fourier coefficients, so Parseval's identity gives it strictly positive squared L2 norm error. The one-term sine representation has zero error in both the L2 norm and the supremum norm, proving the requested advantage.

The sequence of functions $(f_n)$ converges uniformly to $f$ on $E$ ifThe same $N$ must work for every $x$. Equivalently, the supremum norm of $f_n-f$ tends to zero. This is stronger than pointwise convergence, where $N$ may depend on $x$.

One form of Schauder's theorem says that if $M$ is a nonempty closed bounded convex subset of a Banach space and $T:M\to M$ is continuous with relatively compact image, then $T$ has a fixed point.

For a Schauder solution of a small Hammerstein integral equation, take $X=C([0,1])$ with the supremum norm and $M=\{u:\Vert u{\Vert }_{\infty }\le R\}$. This set is nonempty, closed, bounded and convex. PutBoth maxima are finite by continuity on compact sets. Define $(T_{\mu }u)(x)=\mu {\int }_0^{1}G(x,y)f(y,u(y))dy$. Continuity and uniform continuity of the kernel give $T_{\mu }u\in X$, and for $0<\mu \le {\mu }_0$,so it is a self-map. This choice of ${\mu }_0$ also handles the case when either maximum is zero without division by zero.

If $u_n\to u$ uniformly in $M$, uniform continuity of $f$ on $[0,1]\times [-R,R]$ makes $f(\cdot ,u_n(\cdot ))\to f(\cdot ,u(\cdot ))$ uniformly. The integral estimate then proves continuity of $T_{\mu }$ in the supremum norm. Moreoverwhich tends to zero with $|x-x^{\prime }|$ uniformly in $u\in M$. Thus the image is uniformly bounded and equicontinuous. Arzelà-Ascoli states that such a family on a compact interval has compact closure in the supremum norm. Hence $T_{\mu }(M)$ is relatively compact, and Schauder gives a fixed point for each $\mu$ in the specified interval. Therefore a continuous solution with supremum norm at most $R$ exists. The argument imposes no Lipschitz hypothesis on $f$ and makes no uniqueness assertion.

The space $C([a,b])$ with the supremum norm is a Banach space. Continuity of the kernel makes $K$ a bounded linear operator. Induction on $n$ givesso $A^{n}y-A^{n}z=K^n(y-z)$. The ordered integration region gives the factorial bound for a Volterra iterate:For completeness, if this holds at $n$, then integrating $M{M}^n(s-a{)}^n/n!$ from $a$ to $t$ gives the bound at $n+1$; the initial case is the defining integral. Thusand ${\sum }_{n\ge 1}{\alpha }_n=e^{M(b-a)}-1<\infty$. Part (b) now gives uniform convergence of every iteration sequence to the unique fixed point. Since $y=Ay$ is precisely the Volterra integral equation, this is its unique continuous solution. No restriction $M(b-a)<1$ is needed: the factorial controls all iterates on the whole finite interval.

The answers areWrite $M_n(f,g)={\sup }_{0\le t\le n}|f(t)-g(t)|$. The given metric describes locally uniform convergence: $d(f_j,f)\to 0$ if and only if $M_n(f_j,f)\to 0$ for every fixed $n$. Indeed,so convergence in $d$ forces $M_n\to 0$. Conversely, split the defining series at $N$: its tail is at most ${\sum }_{n>N}{2}^{-n}=2^{-N}$, and its finitely many initial terms tend to zero.

If $(f_j)$ is a Cauchy sequence in $d$, the same single-term estimate makes it a Cauchy sequence in the supremum norm on every $[0,n]$. The completeness of the continuous-map space in the uniform metric gives a continuous function $F_n$ on $[0,n]$ with $f_j\to F_n$ uniformly there. Uniqueness of the limit of a sequence gives $F_{n+1}{|}_{[0,n]}=F_n$, so these functions define a single continuous function $f$ on $[0,\infty )$. The preceding finite-head and tail argument proves $d(f_j,f)\to 0$. Thus the space is complete.

The constant functions $f_j(t)=j$ have $d(f_j,f_k)=1$ whenever $j\ne k$. They have no convergent subsequence, so the space is not sequentially compact.

For fixed $f,g$, set $\gamma (s)=(1-s)f+sg$. On $[0,n]$,as $s^{\prime }\to s$. The equivalence with locally uniform convergence proves that $\gamma$ is a continuous path for $d$. Hence the space is path-connected and connected.

For $0\le t\le 1$, the triangle inequality givesTaking the supremum proves $\boxed{d(p_n,p)\le \rho (p_n,p)}$. Hence convergence for $\rho$ implies convergence for $d$.

The converse is false. For $n\ge 1$, take $q_n(t)=(1-t{)}^n/n$ and $p=0$. Its supremum norm is $d(q_n,0)=1/n\to 0$, whereas the binomial theorem givesThe alternating coefficients cancel on $[0,1]$; the polynomial coefficient sum norm measures their absolute values before any cancellation.

The space of polynomials is not complete for the supremum norm metric $d$. ConsiderThe geometric series has sum $F(t)=1/(1-t/2)$, and for $0\le t\le 1$ its tail satisfiesThus $(p_n)$ converges uniformly to $F$ and is a Cauchy sequence for $d$.

There is no polynomial $p$ agreeing with $F$ on $[0,1]$: otherwise the polynomial $(1-t/2)p(t)-1$ would vanish at infinitely many points and therefore be the zero polynomial. Evaluating this identity at $t=2$ gives $-1=0$. By uniqueness of the uniform limit, $(p_n)$ has no limit in $X$. This proves the claimed failure of completeness.

Solutions to all six questions of the University of Oxford Part A metric space and complex analysis paper, sat on 12 June 2023. Source: released examination PDF, compilation pages 65–68; paper pages 1–4. The solutions retain the paper's labels. In 2(b)(i), the printed zero case $m\ne 0$ is inconsistent with its one case; the solution explicitly uses the intended $m\ne n$. The extra closing parenthesis in the printed definition of the supremum norm metric has no mathematical effect.

Yes. Let $(x^{(k)}{)}_{k\ge 1}$ be any sequence in $A$, where $x^{(k)}=(x_m^{(k)}{)}_{m\ge 1}$. At coordinate $m$, the values lie in the compact interval $[-1/m,1/m]$. By part (a)(ii) we can successively extract a convergent subsequence for coordinate one, a further one for coordinate two, and so on. Taking the diagonal indices gives a single subsequence $(x^{(k_j)})$ for whichThe closed interval bound passes to the limit, so $|x_m|\le 1/m$. Hence $x_m\to 0$ and $x=(x_m)\in A$.

Coordinate convergence alone would not imply supremum norm convergence. Here the common tail bound supplies the missing estimate. Given $ϵ>0$, choose $M$ with $2/(M+1)<ϵ$. For $m>M$,For the finitely many $m\le M$, coordinate convergence makes all differences less than $ϵ$ once $j$ is large. Therefore $d(x^{(k_j)},x)<ϵ$, andThis is an instance of compactness from uniformly vanishing sequence tails. The common $1/m$ bound is exactly what the coordinate vectors in part (i) lack.

The source prints $m\ne 0$ in the zero case. Since the coordinates are indexed by positive integers, that overlaps its $m=n$ case and does not define a sequence. We use the intended coordinate vectors, with $e_m^{(n)}=1$ for $m=n$ and $e_m^{(n)}=0$ for $m\ne n$.

Every $e^{(n)}$ belongs to $X$, because its entries are bounded by one and its coordinate sequence eventually vanishes. If $n\ne k$, their supremum norm distance isIndeed, the difference is $1$ at coordinate $n$, $-1$ at coordinate $k$, and zero elsewhere. No subsequence is a Cauchy sequence, since arbitrarily late distinct terms remain distance one apart. Every convergent sequence is a Cauchy sequence, so no convergent subsequence exists. Therefore $\boxed{X\text{ is not sequentially compact}}$.

Let $a^{(m)}=(1,1/2,\dots ,1/m,0,0,\dots )$. Each has finite support, and in the supremum norm metric it converges to $a=(1,1/2,1/3,\dots )$, because $d(a^{(m)},a)=1/(m+1)$.

The limit is bounded but does not have finite support. Thus the finite-support subspace is not closed in $X$, and by part (a)(iii) it is not complete. Equivalently, the displayed sequence is Cauchy in that subspace but has no limit there.