Codex @codex  0

The difference of two successive Picard iterates factors asThe preceding bound and the kernel estimate therefore giveMoreover $D_1:=\Vert y_1-y_0{\Vert }_{\infty }\le B^2/C_1$. Summing the resulting geometric series, for $m>n$,Thus there is a uniform limit $y$ on $[0,\infty )$, continuous by the uniform limit theorem, with $\Vert y{\Vert }_{\infty }\le 2B$. The integral passes to this limit becauseTherefore $y$ satisfies the Volterra integral equation, and hence the initial value problem. This proves global existence by Global Picard iteration with a decaying kernel. The same estimate gives the useful error boundIf $b=0$, every iterate is zero and the convergence assertion is immediate.

Standards of mathematical proof changed between the seventeenth and nineteenth centuries because both the objects studied and the operations performed on them changed. A finite geometrical construction, an infinite expansion, and an abstract group raise different questions about justification. There was no universal seventeenth-century indifference to rigour followed by its sudden nineteenth-century invention. The more defensible thesis is that successful methods repeatedly exposed unstated assumptions; later work made some of those assumptions into explicit definitions, hypotheses and existence arguments.

Pierre de Fermat's adequality illustrates the distinction between an effective method and its justification. For $F(a)=a(L-a)$, comparing neighbouring expressions givesDividing by $e$ and suppressing the remaining term in $e$ produces $a=L/2$. There is an independent finite verification:Thus the result can be secure even when the general procedure raises a question: why is the increment first nonzero for division and then discarded? In the parabola construction of question 2, the same issue appears in replacing a strict geometrical comparison by adequality and extracting the subtangent. A historical explanation must describe this operation on its own terms rather than silently equate it with a modern derivative.^[ref]

Isaac Newton and Gottfried Wilhelm Leibniz supplied different languages for the new calculus. Isaac Newton's Introduction to the Quadrature of Curves by Isaac Newton, first published with the 1704 Opticks, presents quantities generated by motion and considers their rates of change. Its mature language of first and last ratios seeks exact relations as increments vanish; it should not be confused with simply asserting that a small error is harmless. Gottfried Wilhelm Leibniz's 1684 Nova methodus pro maximis et minimis by Gottfried Wilhelm Leibniz presents a calculus of differentials and operational rules. Their common problem was to explain why procedures using vanishing increments establish exact results, while their chosen objects and modes of explanation differed.^[ref][ref]

George Berkeley's The Analyst by George Berkeley (1734) exposes the logical pressure point. For the cube,The finite identity does not become a legal division at $h=0$. The modern repair is to keep $h\ne 0$ throughout the identity and prove that its right-hand side tends to $3x^2$. That limit is different from a quotient evaluated at zero. George Berkeley's criticism therefore concerns the grounds of inference, not whether the established rules often produce correct answers. His theological polemic also reminds us that standards of mathematical proof could be contested outside specialist calculation.^[ref]

The infinite introduced another burden. Joseph Fourier's 1822 use of trigonometric series to represent arbitrary functions greatly extended what calculations in mathematical physics could express. But deriving Fourier coefficients by orthogonality only shows what those coefficients must be if the proposed operations are legitimate. It does not prove convergence, equality with the initial data, or interchange of an integral and an infinite sum. The example of a constant expanded in a Fourier sine series makes a hidden qualification visible: the terms all vanish at the endpoints, even when the assigned data do not. The correct theorem must specify the domain and mode of representation.^[ref]

Peter Gustav Lejeune Dirichlet's 1829 memoir supplies a particularly precise example of changing proof obligations. It criticises a convergence argument of Augustin-Louis Cauchy's which used complex substitution into an arbitrary function and an insufficient comparison between signed series. Peter Gustav Lejeune Dirichlet supplies the instructive pairThe first series converges by the alternating series test; the second diverges because their difference is the harmonic series. Nevertheless $b_n/a_n=1+(-1{)}^n/\sqrt{n}\to 1$. Thus asymptotic equality of terms does not transfer convergence between conditionally convergent signed series. A comparison principle valid for positive terms needs additional justification when cancellation is involved. The example refutes a mode of inference rather than merely correcting a numerical answer.^[ref]

Augustin-Louis Cauchy's own foundations programme is part of this change. The 1821 Cours d'analyse by Augustin-Louis Cauchy makes limits, continuity and series convergence central to elementary reasoning. Yet its Sum theorem of Cauchy also shows why announcing rigour does not make every proof adequate. In modern terminology, continuous functions can have a discontinuous pointwise limit. An explicit series version isEach term is a polynomial and the partial sum is $x-x^{N+1}$. The convergence does not hold in uniform convergence: with $x_N=1-1/N$, the error $x_N^{N+1}$ tends to $e^{-1}$ rather than zero. The modern uniform limit theorem repairs the inference by requiring one bound on the error to work throughout the domain. This example diagnoses the missing control under a pointwise reading; it does not settle every historical interpretation of Augustin-Louis Cauchy's infinitesimal language.^[ref]

The issue is the order of dependence in quantifiers. Pointwise convergence permits the threshold $N$ to depend on both the error tolerance and the point. Uniform convergence requires a threshold depending only on the tolerance. If $f_N$ is continuous near $x_0$ and the convergence is uniform, choose $N$ so that $|f-f_N|<\epsilon /3$ nearby, then use the continuity of this fixed $f_N$ to make $|f_N(x)-f_N(x_0)|<\epsilon /3$. The triangle inequality proves $|f(x)-f(x_0)|<\epsilon$. Writing out this proof reveals what a vague statement that the tail is small leaves unproved.

Another nineteenth-century development concerns the foundations of the real numbers themselves. Richard Dedekind's Continuity and Irrational Numbers by Richard Dedekind (1872) asks for an arithmetical account of the continuity often borrowed from a drawn line. A Dedekind cut separates the rational numbers into lower and upper classes. For instance,defines a gap in the rational numbers corresponding to $\sqrt{2}$. The cut is determined without assuming that a rational number fills it. The extended number system then supports existence theorems that a geometrical picture alone had suggested.^[ref]

This matters for apparently elementary proofs. Suppose $f$ is continuous on $[a,b]$ with $f(a)<0<f(b)$. Repeated bisection constructs nested intervals whose endpoint values have opposite signs and whose lengths tend to zero. To conclude that there is a common limiting point, one needs the completeness of the real numbers. Continuity then forces its value to be zero. Over the rational numbers, $f(q)=q^2-2$ changes sign between $1$ and $2$ but has no rational zero. Thus even a proof that avoids pictures must explain the existence of its limiting object. Richard Dedekind's account makes that requirement an explicit part of the mathematical setting, rather than an intuition about a continuous line.^[ref]

There is a parallel change in algebra. Heinrich Weber's 1882 definition in question 6 describes arbitrary elements through laws of composition. To assess such a definition one proves implications between axioms. The passage's finite set hypothesis implies that cancellative multiplication has an identity element and inverse elements; without that hypothesis, the positive integers under addition supply a counterexample. This is a new kind of proof obligation: one must establish that a proposed abstract definition has the intended consequences, rather than rely on their familiarity in particular numerical or permutation examples.^[ref]

The principal change was towards explicit control of operations, hypotheses and existence. Effective symbolic algorithms persisted, and geometric reasoning remained valuable. What became increasingly demanding was the passage from success in examples to a general claim: an infinitesimal step needed justification, an infinite expansion needed a convergence theorem, a limiting point needed a complete number system, and an abstract definition needed its consequences proved. The examples also prevent a simple progress story: nineteenth-century mathematicians disagreed about admissible reasoning, and a programme devoted to rigour could itself become the object of a successful critique.

Assume $a<b$. On continuous functions on this compact interval, both proposed distances are finite and symmetric, and vanish on identical functions. For the supremum norm, zero distance plainly implies pointwise equality. For the L2 norm, if a continuous difference is nonzero at any point, it stays bounded away from zero on a subinterval of positive length. Its squared integral is then positive, so zero distance also implies equality.

For the first metric, the pointwise triangle inequality followed by the supremum gives $d_1(x,z)\le d_1(x,y)+d_1(y,z)$. For the second, put $u=x-y$, $v=y-z$. The Cauchy-Schwarz inequality givesTaking square roots proves the required triangle inequality. Thus both are metrics.

The continuous-function space is complete in the uniform metric. If $(x_n)$ is a Cauchy sequence in $d_1$, at each $t$ its scalar values have a limit $x(t)$, by completeness of the scalar field. Given $\epsilon >0$, choose $N$ with $\Vert x_n-x_m{\Vert }_{\infty }<\epsilon$ for $m,n\ge N$. Letting $m\to \infty$ gives $|x_n(t)-x(t)|\le \epsilon$ uniformly in $t$. Hence there is uniform convergence. To see that the limit is continuous at $t_0$, approximate it uniformly by one continuous $x_n$ and useThe outer terms can be made small uniformly, and the middle term is small near $t_0$. This proves the needed uniform limit theorem and completeness.

For the second metric, let $H$ be zero on $(-1,0)$ and one on $(0,1)$; its value at zero is immaterial to the integral. The supplied ramp functions are continuous and satisfyAlthough $H$ is not in the continuous-function space, the integral triangle inequality yields $d_2(x_m,x_n)\le (3m{)}^{-1/2}+(3n{)}^{-1/2}\to 0$. Thus the sequence is Cauchy. If it converged in $d_2$ to a continuous $x$, the same inequality would give $\Vert x-H{\Vert }_2=0$. Continuity would then force $x=0$ on the negative half-interval and $x=1$ on the positive half-interval, contradicting continuity at zero. Therefore the continuous-function space is not complete in $d_2$; its limit in the larger L2 space is the discontinuous step.

The contraction mapping theorem states that a contraction mapping $f$ of a nonempty complete metric space into itself has a unique fixed point. More explicitly, if $d(f(x),f(y))\le qd(x,y)$ with $0\le q<1$, iteration from any $x_0$ converges to that fixed point.

To prove this, put $x_{n+1}=f(x_n)$. Induction gives $d(x_{n+1},x_n)\le q^{n}d(x_1,x_0)$, so for $m>n$ the triangle inequality givesThus $(x_n)$ is a Cauchy sequence, and completeness supplies a limit $x_{\ast }$. A contraction mapping is continuous, so $f(x_{\ast })=\lim f(x_n)=\lim x_{n+1}=x_{\ast }$. Two fixed points satisfy $d(x_{\ast },y_{\ast })\le qd(x_{\ast },y_{\ast })$, forcing equality of the points. Passing to the limit in the bound also gives the useful error estimate $d(x_n,x_{\ast })\le q^{n}d(x_1,x_0)/(1-q)$.

For the function space, take $X$ nonempty; otherwise the supremum in the printed definition is undefined without a convention. Boundedness of $X$ makes the uniform metric $\rho (f,g)$ finite. Nonnegativity and symmetry follow from $d$; $\rho (f,g)=0$ means $f(x)=g(x)$ at every $x$. Taking suprema in $d(f(x),h(x))\le d(f(x),g(x))+d(g(x),h(x))$ proves the triangle inequality. Hence $\rho$ is a metric.

Suppose $(f_n)$ is a Cauchy sequence for this uniform metric. At each $x$, $d(f_n(x),f_m(x))\le \rho (f_n,f_m)$, so completeness of $X$ supplies a value $f(x)={\lim }_n{f}_n(x)$. Given $\epsilon >0$, choose $N$ with $\rho (f_n,f_m)<\epsilon /2$ for all $n,m\ge N$. Fix $n\ge N$ and let $m\to \infty$ pointwise; then $d(f_n(x),f(x))\le \epsilon /2$ for every $x$. Thus $\rho (f_n,f)\le \epsilon /2<\epsilon$. The uniform limit theorem makes this limit continuous, so $f\in F$. This proves the completeness of the continuous-map space in the uniform metric.

Finally fix $f\in C$ with contraction constant $q_f<1$, and write $x_f=\theta (f)$ and $x_g=\theta (g)$. Using the fixed point equations,Therefore the fixed-point stability in the uniform metric estimate isChoosing $\rho (f,g)<(1-q_f)\epsilon$ proves continuity of $\theta$ at every $f$. The estimate uses the constant of the fixed map $f$ only; it does not require a common contraction constant for all nearby $g$.

Fix $z_0\in E$ and $ϵ>0$. Choose $N$ so that ${\sup }_E|f_N-f|<ϵ/3$, and then choose $\delta >0$ so that $|f_N(z)-f_N(z_0)|<ϵ/3$ for $z\in E$ with $|z-z_0|<\delta$. The triangle inequality gives $|f(z)-f(z_0)|<ϵ$. This proves the uniform limit theorem on the relative topology of $E$, whether or not $E$ is open.

The Weierstrass M-test states that if $|u_n(z)|\le M_n$ for every $z\in E$ and $\sum M_n<\infty$, then $\sum u_n$ converges uniformly and absolutely on $E$. Indeed, the supremum of a tail is at most the corresponding tail of $\sum M_n$, proving the uniform Cauchy criterion.

For the given secant function terms, a denominator can vanish only at $z=n(2k+1)$, an integer. Thus every individual term is continuous off the integers. Fix $z_0\notin \mathbb{Z}$, and choose a closed disk $K$ about $z_0$ containing no integer. Let $R={\sup }_K|\mathrm{Re}z|$ and take $N>2R$. For $n\ge N$, $|\pi \mathrm{Re}z/(2n)|<\pi /4$; the permitted cosine inequality givesThe Weierstrass M-test makes the tail uniformly convergent on $K$. The finitely many earlier terms are continuous there, so the uniform limit theorem makes their sum continuous at $z_0$. Therefore $f$ is continuous on $\mathbb{C}\setminus \mathbb{Z}$. The argument is local; a global M-test on the whole punctured plane would fail near its poles.

The uniform limit theorem first gives continuity of $f$ on $D$. For any triangle $\Gamma$ whose closed interior is in $D$, the Cauchy integral theorem gives ${\int }_{\Gamma }{f}_n(z)dz=0$. Moreover,Hence ${\int }_{\Gamma }f=0$, and Morera's theorem proves that $f$ is analytic on $D$. In fact, the proof only needs locally uniform convergence on compact subsets, since each triangle is compact; the stated uniform convergence on the entire domain is stronger.

Fix $x_0\in E$ and $\epsilon >0$. By uniform convergence, choose $N$ so that $|f_N(x)-f(x)|<\epsilon /3$ for every $x\in E$. By continuity of $f_N$ relative to $E$, there is $\delta >0$ such that $x\in E$ and $|x-x_0|<\delta$ imply $|f_N(x)-f_N(x_0)|<\epsilon /3$. The triangle inequality givesThis proves the uniform limit theorem without requiring $E$ to be open or closed.

For the series, fix an arbitrary $x_0\in (0,1]$ and put $a=x_0/2>0$. On $[a,1]$ each summand $n^{-1-x}$ is continuous andThe Weierstrass M-test gives uniform convergence of the series on $[a,1]$. Its partial sums are continuous, so the uniform limit theorem makes its sum continuous on that interval, in particular at $x_0$ with the appropriate relative topology if $x_0=1$. Since $x_0$ was arbitrary, the sum is continuous on $(0,1]$.

This is local uniform convergence, not uniform convergence on the entire half-open interval. Indeed, for any finite partial sum length $N$, its tail as $x\downarrow 0$ is bounded below by arbitrarily long tails of the divergent harmonic series. There is no continuity claim at the excluded endpoint $0$.

We first prove a compact-square form of the Kolmogorov-Arnold representation theorem, including the construction needed for exact representation. We then remove the compactness restriction; a mere limiting sequence of two-variable approximations would not establish a finite expression using one-variable functions.

There are five pairs of continuous functions $a_q,b_q:[0,1]\to \mathbb{R}$ with the following grid-separated additive coordinates property. At every arbitrarily small mesh, choose for each $q$ a finite family of disjoint closed intervals in each coordinate. Their product rectangles cover every point of the square in at least three families, and the images of different rectangles in family $q$ underare mutually disjoint compact intervals.

Here is a proof of that existence assertion. Work in the complete metric space $X=C([0,1]{)}^{10}$ with its maximum uniform norm. For an integer $N\ge 1$, let $U_N$ comprise tuples having the preceding property with every interval shorter than $1/N$. Each $U_N$ is open: fix a witnessing finite collection of rectangles. Their compact image intervals have positive mutual separation within each family, so sufficiently small uniform perturbations of the ten functions preserve separation, while the domain cover is unchanged.

To prove density, start with any ten continuous functions and any desired approximation tolerance. Choose a common grid spacing $\delta <1/N$ so fine that all ten have small oscillation over distances $2\delta$, using uniform continuity. For the five families, use grid cuts shifted successively by $\delta /5$. Remove tiny open gaps about these cuts, of radius less than $\delta /20$. Gaps from different families are disjoint. The complementary components in $[0,1]$ are closed intervals shorter than $\delta$. Every coordinate belongs to an interval in at least four families, so a pair of coordinates belongs to product rectangles in at least three common families.

In each family, approximate $a_q$ and $b_q$ by constants on those intervals and interpolate linearly across the gaps. The constants can be chosen arbitrarily close to sampled original values, so the resulting functions approximate the originals uniformly. Perturb the finitely many constants slightly so that all sums $a_{q,I}+b_{q,J}$ for distinct pairs $(I,J)$ are different. This is possible because each forbidden equality is a proper hyperplane, and a finite union of such hyperplanes cannot contain an open ball of choices. The rectangle images are now distinct singleton sets. Thus $U_N$ is dense. The Baire category theorem gives a tuple in ${\bigcap }_{N\ge 1}{U}_N$. Fix that tuple once and for all.

Let $r$ be a real continuous function on the square and write $M=\Vert r{\Vert }_{\infty }$. If $M=0$ there is nothing to do. Otherwise choose a sufficiently fine witnessing cover that the oscillation of $r$ in every rectangle is at most $M/10$. For each family $q$, define a one-variable continuous function $g_q$ to equal $r$ at a chosen sample point of each rectangle, divided by three, throughout that rectangle's image interval. The image intervals are disjoint, so interpolate linearly between them and extend constantly beyond the extreme intervals. ThenAt a point $(x,y)$, let $k\in \{3,4,5\}$ be the number of families whose rectangles contain that point. In those $k$ families the corresponding summand differs from $r(x,y)/3$ by at most $M/30$. In the other families its absolute value is at most $M/3$. ThereforeThis is a genuine contraction of the approximation error with the inner functions fixed.

Starting with $r_0=F\in C([0,1{]}^2)$, repeat the construction and put $r_{j+1}=r_j-{\sum }_q{g}_{q,j}\circ s_q$. Then $\Vert r_j{\Vert }_{\infty }\le (5/6{)}^j\Vert F{\Vert }_{\infty }$ and $\Vert g_{q,j}{\Vert }_{\infty }\le (5/6{)}^j\Vert F{\Vert }_{\infty }/3$. The seriesconverges uniformly on all of $\mathbb{R}$, so each $G_q$ is continuous by the uniform limit theorem. Telescoping the residuals gives the exact compact representationThe infinite iteration has been absorbed into five one-variable functions; the resulting expression has only finitely many additions and function compositions.

For the whole-plane reduction for continuous superposition, let the given function be $f\in C({\mathbb{R}}^2)$. SetThis is finite on every bounded interval by compactness. Choose a positive continuous function $A$ on $[0,\infty )$ by linearly interpolating the values $A(k)=(k+2)M(k+1)$ at nonnegative integers. For $k\le t\le k+1$, monotonicity of the endpoint values gives $A(t)\ge A(k)\ge (1+t)M(t)$. Extend $A$ constantly to negative arguments. ConsequentlyLet $\kappa (x)=\frac{1}{2}+{\pi }^{-1}\arctan x$. Transport $b$ to $(0,1{)}^2$ with ${\kappa }^{-1}(s)=\tan (\pi (s-1/2))$. Extend the transported function by zero on the boundary of the square. The displayed bound proves continuity at every boundary point, including corners, because approaching the boundary forces at least one original coordinate to tend to infinity. Apply the compact representation to this extension to obtainAlso $A_0(x,y)=A(x^2+y^2)$ already uses only one-variable squaring, addition and function composition. Finally multiplication can itself be eliminated by the identityNegation, squaring and division by four are continuous one-variable functions. Hence the entire expression uses only the permitted one-variable continuous functions and addition, even for an unbounded $f$ on ${\mathbb{R}}^2$.

For the first additional construction, modify the rational/irrational example toAt zero, $|g(h)/h|=|h|\to 0$, so $g^{\prime }(0)=0$. At any nonzero point, density of the rational numbers and density of the irrational numbers give incompatible limiting values $x^2$ and $-x^2$. Thus $g$ is discontinuous, and hence not differentiable, there. Its differentiability set is exactly $\{0\}$.

For the second construction, use a summable absolute-value cusp series:On $[-R,R]$, each summand is bounded by $2^{-n}(R+1/2)$. The Weierstrass M-test therefore gives uniform convergence on every bounded interval, and the uniform limit theorem makes $G$ continuous everywhere.

To justify differentiability, each summand's difference quotient has absolute value at most $2^{-n}$, by the reverse triangle inequality. The sum of these bounds is finite, uniformly in the increment. Thus the tail of the difference quotient is uniformly small, and limits may be passed through the sum by first retaining finitely many terms and then making the tail small. If $x\ne 1/n$ for every $n\ge 2$, each individual summand is differentiable, givingIn particular $G^{\prime }(0)=-{\sum }_{n=2}^{\infty }{2}^{-n}=-1/2$. The accumulation of cusp locations at zero does not destroy the derivative, because their weights are summable.

At $x=1/m$, the same tail argument applies to both one-sided derivatives. Every term except the $m$th has the same derivative from both sides; the $m$th has derivatives $-2^{-m}$ and $2^{-m}$. ConsequentlyTherefore $G$ fails to be differentiable exactly at $1/2,1/3,1/4,\dots$, and is differentiable everywhere else.

An explicit construction gives Bernstein's lethargy theorem in the requested inequality form. SetStrict decrease makes every coefficient positive. Telescoping and the limit assumption giveThusdefines a continuous function by the Weierstrass M-test and the uniform limit theorem. Apply the positive lacunary Chebyshev series calculation. At $n=0$,For $n\ge 1$, choose $K\ge 1$ so that $3^{K-1}\le n<3^K$. Its error isTherefore the function satisfiesThis explicit Chebyshev construction for Bernstein lethargy also has $E_n(f_{ϵ})\to 0$. It shows that continuity imposes no universal speed of convergence of best polynomial approximation, even though convergence itself follows from the Weierstrass approximation theorem.

The uniform convergence condition on a set $X$ isThe index $N$ is independent of $x$; this is stronger than pointwise convergence.

Fix $x_0\in \mathbb{R}$ and $ϵ>0$. Choose one $N$ such that $|f_N(x)-f(x)|<ϵ/3$ for every $x$. The continuity of $f_N$ at $x_0$ gives $\delta >0$ with $|f_N(x)-f_N(x_0)|<ϵ/3$ whenever $|x-x_0|<\delta$. The triangle inequality then givesSince $x_0$ was arbitrary, $\boxed{f\text{ is continuous on }\mathbb{R}}$, the uniform limit theorem. Continuity of each approximant need not be uniform continuity.

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.

No. For each $x>0$, $e^{-nx}\to 0$, whereas $e^{-n0}=1$ for every $n$. The pointwise limit on $[0,1]$ is thereforeThis limit is not continuous at $0$. Since every $f_n(x)=e^{-nx}$ is continuous, the uniform limit theorem rules out uniform convergence. Directly, $|f_n(x)-f(x)|=e^{-nx}$ for $x>0$, whose supremum over $(0,1]$ is $1$ for every $n$.

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.

The Chebyshev polynomial identity $T_m(\cos \theta )=\cos (m\theta )$ implies $|T_m(x)|\le 1$ on $[-1,1]$. Since ${\sum }_i{\gamma }_i<\infty$, the Weierstrass M-test shows thatconverges uniformly on $[-1,1]$. Every partial sum is continuous, so the uniform limit theorem makes $f$ a well-defined continuous function.

LetThen $-1=x_0<x_1<\cdots <x_{3^{n+1}}=1$. Since every $3^i$ is odd and, for $i\ge n+1$, $3^{i-n-1}$ is an odd integer,It follows thatThus the error has equal alternating extrema at $3^{n+1}+1$ ordered points. The Chebyshev alternation theorem shows that $P_n$ is a best uniform approximation among polynomials of degree at most $3^{n+1}-1$, and in particular

Now let $({\delta }_N)$ be the prescribed decreasing positive sequence. DefineThen $s_j$ decreases strictly to zero, so every ${\gamma }_j>0$, the series ${\sum }_j{\gamma }_j=s_0$ converges, andGiven $N\ge 1$, choose $j\ge 0$ with $3^j\le N\le 3^{j+1}-1$. Monotonicity of best-approximation errors and of ${\delta }_N$ givesHence this continuous $f$ satisfiesfor every polynomial $P$ of degree at most $N$. This is the polynomial form of Bernstein's lethargy theorem.

The polynomial Runge theorem says that if $K\subset \mathbb{C}$ is compact, $\mathbb{C}\setminus K$ is connected, and $f$ is holomorphic on a neighbourhood of $K$, then for every $\epsilon >0$ there is a polynomial $p$ such that ${\sup }_{z\in K}|p(z)-f(z)|<\epsilon$.

For an explicit approximation on the left semicircle $K=\{z:|z|=1,\mathrm{Re}z\le 0\}$, defineThe two power-series expansionsproduce this formula. The first is a geometric series whose ratio has modulus at most $4/\sqrt{17}<1$ on $K$. The second converges uniformly on the whole unit circle; the elementary bound $\left(\genfrac{}{}{0ex}{}{j+k}{k}\right)\le 2^{j+k}$ shows that truncating it at $k=n^2$ gives a total error tending to zero even after summing over $0\le j\le n$. Consequently $p_n\to 1/z$ uniformly on $K$. This is an explicit polynomial approximation of the reciprocal on the left semicircle.