Truncation error Created 2026-09-29 Updated 2026-10-14
Truncation error is introduced by replacing an exact operation with a finite approximation. It remains even when all arithmetic is exact. For , the forward finite difference for its derivative at givesThus the truncation error is exactly : gives and gives . In finite precision, however, the numerator subtracts nearly equal values, and their roundoff error can be amplified by division by . For smooth data with bounded evaluation errors of scale , a typical bound has competing terms . Smaller reduces the first term and increases the second; with fixed positive constants the balancing scale is . This is why blindly refining a finite difference eventually stops improving it.
Let a portfolio hold in a risk-free asset with net return and in an asset returning or , with probabilities and . Assume , , , and . Its state wealths are and . The expected utility has strictly negative second derivative. Setting its first derivative to zero gives the displayed unconstrained root; the derivative at is negative, so only the lower constraint can bind. Thus the displayed formula is the unique optimum. All equity is optimal exactly when . The positivity of both state wealths is part of the logarithmic utility domain.
A proper Riemann integral on a compact interval requires a bounded integrand, but a derivative can be unbounded. For away from zero and , the difference quotient gives , whereas for . At , this derivative is and is unbounded. The fundamental theorem of calculus version that integrates a derivative therefore needs an explicit integrability hypothesis.
On a nondegenerate interval, point evaluation of the derivative is unbounded for the supremum norm on smooth functions. The functions have supremum norm at most one but . Adding the supremum norm of the derivative makes this evaluation a bounded linear functional.
Uniform analyticity under polynomial coordinate changes Created 2026-10-05 Updated 2026-10-06
Suppose a family of polynomial coordinate maps has a fixed bound on its degrees and coefficients depending continuously on a compact parameter set, and sends a fixed real compact set into a compact subset of the domain of a real analytic function. A common complex neighborhood can then be chosen so the compositions are holomorphic and uniformly bounded there. The multivariable Cauchy estimate gives uniform factorial derivative bounds. For the change , the coefficient pullback uses its inverse: .
Uniform Cauchy radius for polynomial forcing 2026-10-05
For a linear real analytic non-characteristic Cauchy problem for a partial differential equation with zero data, the local real analytic radius may be chosen uniformly over polynomial forcing terms. Fix an analyticity exponent . Each polynomial, including a polynomial obtained by a polynomial coordinate change, satisfies the corresponding factorial derivative bound with some finite prefactor, uniformly over a compact parameter range. Divide the forcing by that prefactor to put all such data in one fixed majorant class. The Cauchy-Kovalevskaya theorem supplies a common radius, and linearity rescales the solution back without shrinking it. This argument does not bound the amplitudes of the resulting solutions uniformly.
If Riemann integrable functions converge by uniform convergence to , then is Riemann integrable andThis concerns one fixed compact interval, with finite length.[ref]
Here is a proof outline that also establishes Riemann integrability of the uniform limit. Assume , and put and . One bounded and finite show that is a bounded function. For any partition of an interval , its upper Darboux sum and lower Darboux sum satisfyGiven , choose with , then a partition of an interval with . The displayed gap is below , proving Riemann integrability. Finally, and monotonicity of the Riemann integral give the stated error estimate. When , every integral is zero.
For the polynomial functions on , direct integration and the uniform bound giveAt , the exact integral is approximately , while the general error bound is approximately . The bound certifies the result without an exact antiderivative. On , these same integrals still tend to zero, although there is no uniform convergence: sufficient conditions need not be necessary. On an unbounded interval, even uniform convergence can fail to control total area, as uniformly vanishing functions can retain a nonzero integral shows.
Uniform convergence alone also fails to preserve derivatives: converges uniformly to zero on , while . The small amplitude does not control the slopes of the sine oscillations.
Uniform derivative convergence with an anchored value Created 2026-10-07 Updated 2026-10-14
Let be continuously differentiable functions on an interval . If by uniform convergence on and at one fixed , then converge locally uniformly to a continuously differentiable function with . If is bounded, the convergence is uniform on all of .[ref]
6.2 Interchange of limits. Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl, §6.2.3, Theorem 6.2.10 and the unbounded-interval observation following its proof
The anchor fixes the additive constant that a derivative cannot see. By the fundamental theorem of calculus, defineThe uniform limit theorem makes a continuous function, so the fundamental theorem of calculus gives . The displayed estimate proves uniform convergence wherever has a common finite bound, and therefore proves locally uniform convergence on any interval.
For example, on take . Its derivative is , with supremum error from , and . The reconstructed uniform limit is ; the exact supremum error is , equal to the bound above. Without an anchor, the constant functions have zero derivatives but no finite pointwise limit. On the real line, has convergent anchored values and uniformly convergent derivatives, but its supremum error from zero is infinite. The bounded-distance condition has a real role.
Uniformly convex scalar flux Created 2026-10-06 Updated 2026-10-14
In the common PDE convention, a uniformly convex scalar flux is a flux satisfying throughout the specified state interval, with one constant . Equivalently, is a convex function. This guarantees strict inequality below nontrivial chords and strict ordering of the two endpoint derivatives around the chord slope. On the whole real line it is incompatible with a globally bounded first derivative.
Uniform order statistic Created 2026-09-28 Updated 2026-10-14
For independent and identically distributed random variables with the continuous uniform distribution on , the th order statistic has Beta distributionIts probability density function, mean, and variance areThe probability density function is zero outside ; values assigned to its endpoints do not change any probability. Peter Kempthorne's MIT lecture notes derive the uniform order statistic law and these moments. [ref]
https://ocw.mit.edu/courses/18-443-statistics-for-applications-spring-2015/06daf6d78e7eb0465d6bb53e8f96b2ff_MIT18_443S15_LEC11.pdf. Peter Kempthorne, MIT 18.443, Lecture 11, slides 12–14
.For , the minimum, sample median, and sample maximum correspond to . Their probability density functions are , , and , respectively. The sample median therefore has Beta distribution , mean , and variance . Its cumulative distribution function isFor instance, . The mean of the minimum is , and the mean of the sample maximum is . The fixed observed sample median in the order statistic example is one possible outcome; is the average over repeated statistical samples from this uniform distribution.
Each curve has area one. The extreme order statistics favor the ends, while the sample median favors the center. The endpoint density height is legitimate: the probability density function gives area per unit length, rather than point probability. In particular, a continuous uniform distribution has zero probability of producing an endpoint.
For a short proof, the binomial distribution counting identity under order statistic gives . Taking its derivative cancels consecutive terms, leaving the displayed probability density function. Recognize its normalizing factorial coefficient as that of the Beta distribution, then substitute , into the Beta distribution mean and variance formulas. Although the original observations are independent, their order statistics generally are dependent; see the positive covariance of two uniform order statistics.
Utility conjugate 2026-10-07
For an increasing concave utility on positive wealth, its utility conjugate uses the indicated supremum and is a convex function of the positive price variable. If on positive , extended by infinity elsewhere, then . Under the Inada conditions its optimizer is the inverse marginal utility, and its derivative is the negative of that optimizer. The sign convention is part of the definition.
Van der Waals isotherm 2026-10-14
A Van der Waals isotherm is the pressure–particle volume curve at a fixed temperature. Put , , and , using the Van der Waals critical point values below. Then the existing Van der Waals law of corresponding states becomesAll curves in the figure are calculations in this reduced model.
Van der Waals isotherms below, at and above the Van der Waals critical point
. The dashed subcritical homogeneous continuation contains an unstable red segment. The green Maxwell construction plateau describes equilibrium phase coexistence; the two shaded areas are equal. Curves are model calculations, not carbon dioxide measurements. Details.For a uniform thermodynamic phase, the isothermal compressibility isThus the upward-sloping portion of a subcritical Van der Waals isotherm has : compression would reduce pressure, allowing a density disturbance to grow. It is mechanically unstable. The spinodal points bound that portion; setting the derivative to zero gives their curve . Negative slope alone guarantees only local mechanical stability: portions between the spinodal and the phase coexistence endpoints have metastability. Equilibrium replaces the entire interval between those endpoints, including these metastable portions, by a Maxwell construction plateau.[ref]
Statistical Physics by David Tong. §5.1, equation 5.3 and §5.1.1, Maxwell Construction and Meta-Stable States: unstable middle branch and coexistence versus spinodal
Vanishing moments and Fourier zeros 2026-10-14
Use the Fourier transform convention . If and for are integrable functions, moment differentiation of the Fourier transform yields a Fourier transform andThe dominated convergence theorem justifies these derivatives. Under these assumptions, vanishing moments are equivalent to vanishing derivatives through order at zero. For this gives a Peano zero ; for it gives . It does not by itself justify a th derivative or an estimate.
If also , subtract the degree- Taylor polynomial of inside the integral. Its Taylor remainder gives the stronger boundFor an integrable function with compact support, every weighted integral exists and its Fourier transform extends to an entire function. The language “zero of order at least ” is then literal analytic function terminology. If the next integral is nonzero, the order is exactly . The smooth-mask vanishing-moment criterion relates these cancellations to a refinement mask under its additional hypotheses.[ref]
Wavelet Bases. Wavelet Bases, §7.2.1, printed p. 206, Theorem 7.4 and proof of (i) ⇔ (ii): decay assumptions and differentiation of the Fourier transform

