For a smooth real function satisfying the displayed equation with positive integer , differentiating makes . On any compact interval, all derivatives are therefore bounded by the maximum of the bounds of . The Taylor formula with integral remainder consequently has error at most , which tends to zero uniformly for . Hence the function equals its globally convergent Taylor series. For and initial derivatives , it is .
Taylor polynomial Created 2026-09-24 Updated 2026-10-14
A Taylor polynomial replaces a function near a chosen point by a polynomial with matching derivatives. If has derivatives through order at , define
The factorial denominator makes for . This determines a unique polynomial of degree of a polynomial at most . Order zero matches the value, order one also matches the tangent line, and order two also incorporates the second derivative. Matching more local information is useful because polynomials are easy to evaluate, differentiate, and integrate. The distinction between the finite Taylor polynomial and the infinite Taylor series is developed in OpenStax, Taylor and Maclaurin series.
For a computed example, let and expand at zero. Its first three derivatives give
At , the linear approximation is and the quadratic approximation is , compared with . The quadratic correction captures the downward bending of the square root and reduces the absolute difference from about to .
Figure 1.
Matching more derivatives improves a local square-root approximation, and the third derivative supplies an error bound
. Details.
The Taylor remainder turns this convenient approximation into a controlled calculation. On , is positive and at most . The Taylor theorem with Lagrange remainder therefore gives
Consequently follows without using the displayed decimal evaluation as evidence. The Taylor polynomial and the Taylor remainder play different roles: the former supplies an answer that is easy to compute, while the latter specifies what accuracy is justified. Farther from the expansion point, the same low-degree polynomial need not remain accurate.
Taylor series Created 2026-09-24 Updated 2026-10-14
For a function with derivatives of every order at , its Taylor series is the power series
Its partial sums are Taylor polynomials. At it is called a Maclaurin series. Forming the coefficients, proving that its partial sums form a convergent sequence, and proving that their limit equals are separate tasks. A smooth function provides all the coefficients, but a real analytic function is additionally represented locally by the resulting power series.
For the exponential function, every derivative of at zero equals one, giving
Here equality holds for every real : the Taylor remainder is bounded by , which tends to zero for each fixed . At , the degree-five Taylor polynomial is , and the absolute difference from is less than . The factorial denominator eventually overwhelms every fixed power, allowing local derivative information to reconstruct this function throughout the real line.
The geometric series shows why the region of validity matters. For , the Taylor series at zero is , with radius of convergence one. For , its finite Taylor polynomial satisfies the exact identity
At and , the remainder is . At , the same degree-five polynomial has value and remainder , although the Taylor series still converges to there. Convergence of the infinite expression does not guarantee accuracy from a particular small number of terms. For , even the terms fail to tend to zero, so this power series cannot represent the function. The standard expansions and the conditions for convergent series are discussed in OpenStax, working with Taylor series.
Figure 1.
Geometric partial sums converge slowly near their convergence boundary, while a smooth flat function has an identically zero Taylor series
. Details.
A stronger caution comes from the flat function
It is a smooth function with for every , so every Taylor polynomial at zero is zero and its Taylor series converges everywhere to zero. Nevertheless . Off zero, repeated differentiation produces a polynomial in times ; the exponential decay makes each required limit at zero vanish. This explains how all the local coefficients can miss a positive function arbitrarily close to the centre. Real analyticity supplies the additional condition that rules out this behavior.
Taylor's theorem 2026-10-14
Taylor's theorem expresses a sufficiently differentiable function as a finite Taylor polynomial plus a Taylor remainder. One convenient version assumes is times continuously differentiable on the segment between and . Then
for some intermediate point , when . Thus a bound on that segment gives . The intermediate point usually need not be computed: bounding the derivative throughout the segment is enough. This is why local approximation can yield reliable numerical bounds. A finite Taylor polynomial does not require an infinite Taylor series to represent the function.
Historically, the Royal Society holds Brook Taylor's letter of 26 July 1712 to John Machin. Its catalogue connects his work on Kepler's second law with the expansion later published in the 1715 Methodus incrementorum directa et inversa. This is a documented route from an orbital calculation to a general approximation method, rather than a claim that every earlier use of such expansions began with Taylor. See Royal Society archive, letter MS/82/2.
Nonnegative tensor-product surface basis factors yield nonnegative product weights. Their two partition of unity sums multiply to one. If the factors are and , mixed derivatives through separate orders are continuous, so the resulting finite or locally finite surface representation is jointly . Control coefficients can cancel derivative jumps and yield more smoothness; inherited continuity is a guaranteed lower bound, not a claim that every surface has exactly the basis's worst regularity.
Products of two univariate bases form a surface basis. Nonnegativity, partition of unity and coordinate-wise linear precision pass to the products by multiplication of the respective univariate identities. If the factors are and , each mixed derivative through orders is the product of the corresponding derivatives, giving continuous mixed derivatives and joint regularity.
Consider a point mass of fixed mass released from rest in a stationary medium. Choose downward as positive, assume constant gravitational acceleration , neglect buoyancy, and impose linear drag with constant linear friction coefficient . Here is the signed downward velocity component; it equals speed during this descent. Newton's second law becomes
The terminal velocity balances the two forces, and the time constant controls how quickly that balance is approached:
For the illustrative parameters , and , the time constant is and the terminal velocity is downward. At , the downward velocity is and the downward acceleration is . This is a toy linear drag model, not a claim that every falling object has this resistance law.
Figure 1.
Exponential approach to terminal velocity and decay of acceleration in an illustrative linear drag model
. Details.
For a proof outline, subtract the equilibrium value: obeys . The exponential decay solution and the initial condition give ; one derivative gives the acceleration. Every time constant multiplies the remaining gap by . The exact limit is reached only as . This makes the model useful for estimating a settling duration without mistaking vanishing acceleration for vanishing velocity.
Newton already analyzed vertical motion under uniform gravity and resistance proportional to velocity in Book II, Section I, Proposition III of the Principia. His geometric construction includes a greatest downward velocity, illustrating that a limiting rate can emerge from balancing a driving force and resistance. [ref]
The Normal convergence of the Weierstrass elliptic-function series allows its derivative to be written as an absolutely locally uniformly convergent sum of inverse cubes. For a period lattice , this derivative sum is invariant under translation by any lattice vector, by reindexing. Consequently is constant; its apparent poles cancel. The Weierstrass elliptic function is even, so for a primitive lattice generator , evaluation at makes that constant zero. Applying this to two generators proves that this is a periodic function, namely . This argument avoids separating the original convergent series into two divergent inverse-square sums.
Theorema Egregium Created 2026-09-24 Updated 2026-10-14
For smooth surfaces, Gaussian curvature depends only on the first fundamental form and its first two coordinate derivatives. Consequently any smooth local isometry satisfies . The surprise is that is defined using the shape operator, which describes bending in space, yet its value can be recovered from measurements made entirely within the surface.
In his 1827 paper, Carl Friedrich Gauss expressed Gaussian curvature through the metric coefficients and their partial derivatives in Article 11, then stated its invariance under development in Article 12. Article 13 explicitly compares a plane with surfaces developable onto it, including cylindrical surfaces. The paper was presented on 8 October 1827 and printed in 1828; the Morehead–Hiltebeitel English translation appeared in 1902. [ref]
A plane and a circular cylinder can have different principal curvatures while both have . Their matching first fundamental forms exhibit the actual local isometry. In contrast, no nonempty open patch of a sphere of radius can be flattened smoothly into a plane while preserving its first fundamental form: cannot become zero. Making the patch small reduces practical distortion, but never produces an exact local isometry. This is a geometric obstruction to a perfectly distance-preserving flat map of a spherical world, independent of where one places a seam.
The following proof outline connects the two descriptions of Gaussian curvature. For a parametric surface with metric coefficients , decompose its second derivatives by the Gauss formula
Taking tangent vector inner products determines the lowered Christoffel symbols solely from the Riemannian metric:
Comparing and gives the Gauss equation
Consequently
where is the corresponding component of the intrinsic Riemann curvature tensor, with the sign convention in the displayed Gauss equation. The final expression uses only and its first two derivatives.
Thermal diffusion rate of a Fourier mode Created 2026-10-05 Updated 2026-10-14
With thermal diffusivity , a Fourier mode of angular wavenumber decays at rate . To avoid confusing this with thermal conductivity, use and angular wavenumber below: the same rate is , with units .
Consider an insulated bar with constant thermal diffusivity, no sources and no heat flux through either end or the sides. An original initial temperature profile and its exact evolution are
The cosine has zero temperature gradient at both ends, satisfying the insulated Neumann boundary conditions. Its spatial mean is zero, so conservation of energy leaves the mean temperature unchanged while the nonuniform part disappears. A short derivation substitutes into the heat equation: the second spatial derivative supplies , hence . The exponential decay time is ; doubling angular wavenumber quarters this time. If cycles-per-length spatial frequency is used instead, and the rate is .
Figure 1.
Insulated-bar Fourier mode decay: equal thermal conductivity, different heat capacities
. Original constant-property model with and . The normalized initial temperature profile is identical for both stipulated materials in thermal diffusivity. The larger volumetric heat capacity gives a smaller thermal diffusivity and four times the decay time. Profiles at and amplitude histories are analytical predictions, not measured records. Details.
For the two model materials in thermal diffusivity and , and . After , the remaining amplitude fractions are approximately and . A narrow hot-and-cold pattern disappears faster than a broad one because its temperature curvature, and hence the imbalance in conductive heat flux, is larger.