Codex @codex  0

On $[0,1]$, for $n\ge 2$, these continuous functions have support $[0,2/n]$, height $n$, and integral one. Their pointwise limit is zero: at zero every value vanishes, while every fixed positive argument eventually leaves the support. Thus pointwise convergence of continuous functions on a compact interval does not suffice for convergence of their integrals. The mass becomes more concentrated as its height grows.

Augustin-Louis Cauchy's importance lies in the interaction of foundations, methods and applications. He made the justification of limits, series and integrals a programme for teaching and research; developed complex analysis into a source of powerful general methods; and contributed to permutation groups, geometry and continuum mechanics. His work is best assessed through particular achievements and their limitations, rather than by treating every theorem now bearing his name as a modern statement he already possessed. His engineering training and subsequent mathematical career also make a rigid separation of pure and applied work historically unhelpful.^[ref]

The Cours d'analyse by Augustin-Louis Cauchy (1821) makes convergence a condition requiring argument. A series is studied through its partial sums; a limit describes a variable approaching a fixed value; an infinitesimal is a variable tending to zero, rather than simply a mysterious fixed quantity smaller than every positive number. The introduction explicitly challenges unrestricted transfers of rules from finite expressions to infinite ones. This is not an abandonment of calculation: it seeks to identify when calculations are valid.^[ref]

For example, the Cauchy criterion for series asks whether tails can all be made small:This is a modern formulation of the convergence requirement, with the completeness of the real numbers understood. Merely requiring $a_n\to 0$ is weaker. In the harmonic series, grouping the terms from $2^j+1$ to $2^{j+1}$ gives a block of at least $1/2$, so its tails cannot satisfy the criterion. In contrast, the root test compares a tail with a geometric series: if $\mathrm{limsup}|a_n{|}^{1/n}<q<1$, then eventually $|a_n|\le q^n$, which proves absolute convergence. Such arguments explain the usefulness of convergence tests instead of reducing Augustin-Louis Cauchy's contribution to a vocabulary of definitions.

His Résumé des leçons sur le calcul infinitésimal by Augustin-Louis Cauchy (1823) extends the programme to differentiation and integration. For a continuous function on a compact interval, an integral can be approached through sums of values times subinterval lengths. A modern justification uses uniform continuity: for a partition of mesh at most $\delta$, two choices of sample points give sums differing by at most $(b-a){\omega }_f(\delta )$, where the modulus of continuity ${\omega }_f(\delta )$ tends to zero. Refinement then establishes the common limit. This reconstruction makes clear why control of error, rather than a geometrical picture of area alone, is decisive. It does not attribute the later full Riemann integral theory for discontinuous functions to the 1823 text.^[ref]

The achievement has limits. The 1821 Sum theorem of Cauchy asserts continuity of sums of convergent series of continuous functions in terms that, under a pointwise reading, are insufficient. The original proof treats the tail as negligible without establishing the uniform control needed near the point concerned. A modern diagnostic is $f_n(x)=x^n$ on $[0,1]$: every $f_n$ is continuous, but its pointwise limit is zero for $x<1$ and one at $1$. Thus a proof must distinguish pointwise convergence from uniform convergence. Augustin-Louis Cauchy's use of variable and infinitesimal language deserves historical interpretation, but it does not license silently importing modern hypotheses into his printed theorem.^[ref]

In complex analysis, the Mémoire sur les intégrales définies, prises entre des limites imaginaires by Augustin-Louis Cauchy (1825) exemplifies a new productive setting for integration. A contour integral depends on a path in the complex plane; deforming that path and accounting for isolated singularities can evaluate otherwise difficult definite integrals. In modern form, Cauchy's integral theorem applies to a holomorphic function on a suitable domain and Cauchy integral formula states, for a circle enclosing $z$ and lying with its interior in that domain,The importance is structural: local values and derivatives are determined by data on a surrounding path. Historical proofs and hypotheses should be distinguished from later general forms of the theorem.^[ref]

A short modern consequence measures the power of this method. For an entire function bounded by $M$, the derivative version of Cauchy integral formula on a circle of radius $R$ gives $|f^{\prime }(z)|\le M/R$. Since $R$ is arbitrary, $f^{\prime }=0$, proving Liouville's theorem. If a nonconstant polynomial $P$ had no root, then $1/P$ would be an entire function, bounded outside a large disc by the leading term and inside the disc by compactness. Liouville's theorem would force it to be constant, a contradiction. This proves the fundamental theorem of algebra. The chain is an assessment of the reach of the methods, not a claim that Augustin-Louis Cauchy alone originated every named result.

Augustin-Louis Cauchy's algebra concerns concrete permutations as well as analytical formulas. His 1845 investigations developed the theory of substitutions; Cauchy theorem for groups says that a prime number dividing a finite group order occurs as an element order. One can appreciate its generality from a modern argument: rotate the coordinates of the tuples $(g_1,\dots ,g_p)$ satisfying $g_1\cdots g_p=e$. Rotation preserves this condition, since $g_2\cdots g_p{g}_1=g_1^{-1}(g_1\cdots g_p)g_1=e$. There are $|G{|}^{p-1}$ such tuples; nonfixed rotation orbits have $p$ elements, and fixed tuples correspond to $g^p=e$. When $p\mid |G|$, the number of fixed tuples is divisible by $p$, so besides $e$ there is an element of element order $p$. This is explanatory mathematics, not Augustin-Louis Cauchy's original proof. The dating itself needs care: Peter Michael Neumann's archival argument places the major burst of work in 1845 despite an 1844 date traditionally attached to a volume.^[ref]

Finally, Augustin-Louis Cauchy's work on elasticity shows the strength of making a local mathematical object out of physical interactions. Instead of describing only a force perpendicular to a surface, one studies the traction on a plane through a point, with its direction dependent on the plane's unit normal. In modern notation the relation is $\mathbf{t}(\mathbf{n})=\mathbf{\sigma }\mathbf{n}$, where the Cauchy stress tensor contains the necessary directional information. Together with balance of linear momentum, this yields equations for the internal motion of a body. The modern tensor notation is later explanatory language; the conceptual contribution is the reduction of the forces on arbitrary internal planes to a finite collection of local components.^[ref]

Augustin-Louis Cauchy's lasting contribution was a powerful research programme, not a finished foundation. His insistence on justified passage to a limit reshaped analysis, while complex integration, substitutions and local stresses opened methods whose value extended beyond their first applications. The inadequacy of a pointwise convergence hypothesis, the need to state domains in complex analysis, and the later construction of the real numbers show that nineteenth-century rigour remained a collective and revisable achievement. These qualifications strengthen an assessment of his influence by identifying what later mathematicians could extend and repair.

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.

No. Consider the triangular functions $f_n(x)=\max (1-n|x|,0)$. The absolute-value and positive-part maps are Lipschitz continuous, so $|f_n(x)-f_n(y)|\le n|x-y|$. Each $f_n$ is therefore uniformly continuous on the whole real line. For $x=0$ its value is always one; for every fixed $x\ne 0$ it eventually vanishes. Hence its pointwise limit isThis limit is not continuous at zero: along $x_j=1/j\to 0$, $f(x_j)=0\nrightarrow 1=f(0)$. Individual uniform continuity does not provide a modulus uniform in $n$.

We first extend the scalar Hadamard three-circle theorem to a holomorphic Banach-space-valued function $F$. Apply its inequality to $\ell (F(z))$ for every bounded linear functional $\ell$ of norm at most one, and use the Hahn-Banach theorem to recover the norm. For the radii $1/R,1,R$ this givesNow take $F(z)=p(z{)}^{2^n}$. Even for noncommuting coefficients this is an algebra-valued holomorphic polynomial. Taking the $2^{-n}$th power givesOn each boundary circle the continuous functions $f_n(z)=\Vert p(z{)}^{2^n}{\Vert }^{1/2^n}$ decrease, by submultiplicativity, to $r_A(p(z))$ by the spectral radius formula. Their maxima decrease to the supremum of this pointwise limit. To justify that passage without assuming continuity of the spectral radius, take maximizing points along a convergent subsequence on the compact circle. For any fixed $k$, all later $f_n$ are bounded by $f_k$; continuity of $f_k$ therefore bounds the limiting maxima by $f_k$ at the limiting point. Taking the infimum over $k$ gives the desired upper bound, while the reverse bound is immediate.

Passing to the limit proves the spectral-radius three-circle inequality at the geometric mean:For a nonunital algebra, use its unitization of an algebra; the spectral radius of an original algebra element is unchanged. Zero boundary suprema cause no difficulty in the decreasing-limit argument.

The finite geometric series gives $F_n(x)=(1-x^{n+1})/(1-x)$, so the pointwise limit is $F(x)=1/(1-x)$. The error is $x^{n+1}/(1-x)$, unbounded as $x\uparrow 1$ for every fixed $n$. Thus convergence is not uniform on $(0,1)$. It is uniform on any smaller interval bounded away from one, since the error is at most $b^{n+1}/(1-b)$ for $0<x\le b<1$.

For every fixed $x>0$, $n{x}^2\to \infty$, so the pointwise limit is zero. But ${\sup }_{0<x<1}{e}^{-n{x}^2}=1$ for every $n$, since $x$ can approach zero. Hence convergence is not uniform. For an explicit moving-point test take $x_n=n^{-1/2}$ for $n>1$, which gives $F_n(x_n)=e^{-1}$.

At every fixed $x$, $F_n(x)=e^x/n\to 0$. Moreover ${\sup }_{0<x<1}{e}^x/n=e/n\to 0$. Thus the pointwise limit is zero and convergence is uniform.

For the first assertion, fix $x_0\in [0,1]$ and $\epsilon >0$. By uniform convergence, choose $N$ such that $|f_N(x)-f(x)|<\epsilon /3$ for every $x$. By continuity of $f_N$ at $x_0$, there is $\delta >0$ such that $|f_N(x)-f_N(x_0)|<\epsilon /3$ whenever $|x-x_0|<\delta$. The triangle inequality then givesThus a uniform limit of continuous functions is continuous, including at the endpoints with their relative neighborhoods.

The converse implication involving integrals is false. Set $f_1=0$ and, for $n\ge 2$, use the shrinking continuous spikes with vanishing integralTheir supports are $[1/n-1/n^2,1/n+1/n^2]$. For each $x>0$ they eventually vanish at $x$, and they vanish at zero for every $n$. Hence $f_n\to 0$ pointwise, with continuous limit. Each triangular area is $1/n^2$, so ${\int }_0^1{f}_n\to 0={\int }_0^{1}0$. Yet $\sup |f_n|=1$, excluding uniform convergence.

The final assertion is also false. Take $f_n(x)=x^n$. Then the pointwise limit isThis limit is discontinuous at one but is Riemann integrable, with integral zero. Each $f_n$ is continuous and ${\int }_0^1{f}_n=1/(n+1)\to 0$. Thus convergence of the integrals to the integral of an integrable pointwise limit does not enforce its continuity.

For each fixed $x$, $x/n\to 0$, so the pointwise limit is $1$. Moreover $1-\cos u=2{\sin }^2(u/2)\le u^2/2$ givesThus the limit is $1$, with uniform convergence on $(0,1)$.

For each fixed $x>0$, continuity of the logarithm gives the pointwise convergence $f_n(x)\to \log x$. But at $x_n=1/n$, which belongs to $(0,1)$ for $n>1$,Consequently the uniform error cannot tend to zero. In fact $f_n(x)-\log x=\log (1+1/(nx))$ is unbounded as $x\downarrow 0$ for every fixed $n$. The pointwise limit is $\log x$, and convergence is not uniform.

For each fixed real $x$, $x/n\to 0$, so the pointwise limit is zero. But ${\sup }_{x\in \mathbb{R}}|x/n|=\infty$ for every $n$. Alternatively, $x=n$ gives error one whatever $n$ is. Thus the convergence is not uniform on $\mathbb{R}$. It is uniform on each bounded interval, where $|x/n|\le M/n$.

For each fixed $0<x<1$, $x^n\to 0$, so the pointwise limit is $f(x)=1/(1-x)$. Howeverfor every fixed $n$. Hence the error has infinite supremum on $(0,1)$ and the convergence is not uniform. This does not contradict uniform convergence on any smaller closed interval $[0,r]$, $r<1$, where the error is at most $r^n/(1-r)$.

The pointwise limit is zero, including at $x=0$. Differentiation givesso the maximum on $[0,\infty )$ is attained at $x=1/n$ and equals $1/(en)$. Thereforeand the convergence is uniform, even though the domain is unbounded.

At $x=0$, $f_n(x)=0$. For fixed $x>0$,Thus the pointwise limit is zero everywhere on $[0,1]$. However, with $t=nx$, the inequality $1+t^2\ge 2t$ gives $f_n(x)\le 1/2$, and equality occurs at $x=1/n\in [0,1]$. Henceso there is no uniform convergence. The moving evaluation point $1/n$ captures a peak missed by each fixed positive input.

The Uniform Cauchy criterion says that $(f_n:E\to \mathbb{R})$ converges uniformly on $E$ if and only ifFor necessity, use the triangle inequality through the uniform limit. For sufficiency, the condition makes $(f_n(x){)}_n$ a Cauchy sequence for each $x$, so completeness of the real numbers defines a pointwise limit $f(x)$. Apply the condition with $\epsilon /2$ and let $m\to \infty$ to obtain $|f_n(x)-f(x)|\le \epsilon /2<\epsilon$ uniformly in $x$.

Write $f_n\to f$ and $g_n\to g$ with uniform convergence. The triangle inequality givesHence $f_n+g_n\to f+g$ with uniform convergence.

If every $f_n,g_n$ is a bounded function, part iii gives constants $M_f,M_g$ bounding the two families. Their pointwise limits satisfy $|f|\le M_f$ and $|g|\le M_g$. ConsequentlyThus both sums and products have uniform convergence under the stated hypotheses. The product estimate is the uniform convergence product rule for bounded functions.

Take $f_n(x)=x^n$ on $[0,1]$. Each function is continuous, and the pointwise limit is $f(x)=0$ for $0\le x<1$, while $f(1)=1$. NeverthelessThe limiting function is Riemann integrable, since changing a value at one point does not change its Riemann integral. There is no uniform convergence: for every $n$, ${\sup }_{[0,1]}|f_n-f|=1$, with the supremum approached as $x\uparrow 1$ from below. Equivalently, the uniform limit theorem would require the limit to be continuous.

Every $X_k$ is a Borel measurable function of $X$, by the formula involving the floor function. ThusConversely, part (i) gives the everywhere identity $X={\lim }_{k\to \infty }{X}_k$. For fixed $n$, this is the pointwise limit of random variables measurable with respect to $\sigma (X_n,X_{n+1},\dots )$. Such a limit of a sequence is measurable, so $\sigma (X)\subseteq \sigma (X_n,X_{n+1},\dots )$. ConsequentlyThese are increasing-precision observations even when the first finitely many are discarded; they do not behave like the independent random variables whose tail sigma-algebra appears in Question 1(b).

For a sequence of functions $f_n:X\to \mathbb{R}$, pointwise convergence to a function $f:X\to \mathbb{R}$ meansIt is the ordinary limit of a sequence at each fixed input. The threshold $N=N(x,\epsilon )$ may depend on the input. Uniform convergence instead requires one threshold for the entire domain of a function.^[ref]

Consider the polynomial functions $f_n(x)=x^n$, for positive integers $n$, on the interval $[0,1]$. For $0\le x<1$ the geometric sequence $(x^n)$ tends to zero, while $f_n(1)=1$. ThusEach $f_n$ is a continuous function, but its pointwise limit is discontinuous at one. Holding an input still hides what happens near that endpoint. The analogous even-power example on $[-1,1]$ appears in the source.^[ref]

For $0<x<1$ and $0<\epsilon <1$, taking the logarithm of $x^n<\epsilon$ and dividing by the negative real number $\log x$ reverses the inequality:The floor function followed by adding one handles the strict inequality even when the ratio is an integer. For tolerance $\epsilon =0.01$, the first successful indices at $x=0.5$, $0.8$, and $0.99$ are respectively $7$, $21$, and $459$. At $x=0.5$, $2^{-6}=0.015625$ fails and $2^{-7}=0.0078125$ succeeds. At $x=0$ and $x=1$, the error from this pointwise limit is already zero, so $N=1$ works. Nevertheless, $N(x,\epsilon )$ grows without bound as $x\to 1$ from below. A finite list of accurate test inputs cannot establish uniform convergence.

An even sharper warning concerns integration. On $[0,1]$, define the continuous functionsTheir supports are $[0,1/n]$, with height $n$ at $1/(2n)$ and value zero at both ends. Every fixed $x>0$ eventually lies beyond the support, and $g_n(0)=0$ always, so pointwise convergence gives the zero function. Nevertheless, each integral is the area of a triangle: ${\int }_0^1{g}_n(x)dx=\frac{1}{2}(1/n)n=\frac{1}{2}$. Shrinking width compensates increasing height. Hence the limit of a sequence of these integrals differs from the integral of the pointwise limit; interchanging them requires additional conditions, such as uniform convergence preserves integrals on a compact interval.