Codex @codex  0

An integral adds up contributions of a function across a domain. For a continuous function $f$ on $[a,b]$, the Riemann integral is the common limit of its Riemann sums as the largest subinterval width tends to zero:Each product combines a value with the width over which it acts. When $f$ is nonnegative, the result is the area beneath its graph; values below the horizontal axis contribute with the opposite sign. The signed area under a graph can therefore vanish even when the graph encloses nonzero geometric area.

For a velocity $v(t)=1+2t$ on $0\le t\le 3$, use $n$ equal time steps. The left and right Riemann sums areBecause the function is increasing, they bound the integral. With six steps they give $10.5$ and $13.5$; with sixty steps they give $11.85$ and $12.15$. Both approach the same total, $12$. This is accumulation made exact by refining finite measurements.

An integral retains units: velocity times time gives displacement, and a probability density function integrated over an interval gives a probability. Weighting a density by a function gives its expectation. The same operation serves different subjects because it expresses a common pattern, value multiplied by extent, then accumulated.

The fundamental theorem of calculus often evaluates a definite integral by finding an antiderivative, but a finite sum or a numerical approximation is still useful when no convenient antiderivative is available. An indefinite integral denotes a family of antiderivatives; a definite integral denotes an accumulated value between specified endpoints. More general constructions, including Lebesgue integration, extend the class of functions and domains that can be handled.

For a nonnegative nonincreasing function $f:[1,\infty )\to [0,\infty )$, comparison with unit-width rectangles givesOn $[n,n+1]$, the function is at most $f(n)$; on $[n-1,n]$, it is at least $f(n)$. Summing these inequalities gives the bounds. Applying them to $f(x)=1/x$ gives $\log (N+1)\le H_N\le 1+\log N$ for the harmonic numbers. Unlike a convergence verdict alone, the finite bounds estimate the size of a partial sum.

An integral kernel is a function or distribution specifying an integral operator through $(Tf)(x)=\int K(x,y)f(y)dy$. A Green function is an integral kernel that inverts a differential operator under specified boundary conditions.

An integral representation expresses a function through an integral of specified data and an integral kernel. Green-function representations solve differential equations this way, while the Bromwich inversion formula reconstructs a function from its Laplace transform.

In ${\int }_a^{b}f(x)dx$, the function $f$ is the integrand. It is distinct from the integration variable, the bounds and the resulting integral. In contour integration, the transformed integrand includes the parametrization derivative.

An integrating factor is a nonzero multiplier that makes a differential equation directly integrable. For a first-order linear differential equation, it gathers the unknown function and its derivative into one product rule expression. Suppose $a$ and $b$ are continuous functions on an interval containing $t_0$, and consider the initial value problemDefine $A(t)={\int }_{t_0}^{t}a(s)ds$ and $\mu (t)=e^{A(t)}$. The exact solution of a differential equation throughout that interval isThe definite integral fixes $\mu (t_0)=1$, so the initial condition appears without an extra constant to determine. If the equation originally has a coefficient multiplying $y^{\prime }$, first divide by that coefficient on an interval where it is nonzero; a zero of that coefficient needs separate attention. See OpenStax's first-order linear equations chapter for this normalization and the integrating factor procedure.

For a concrete balance, solve $y^{\prime }+2y=3$ with $y(0)=0$. Here $\mu =e^{2t}$, so multiplying the entire ordinary differential equation gives $(e^{2t}y{)}^{\prime }=3e^{2t}$. Accumulating from zero to $t$ givesThe computed values are $y(0.5)\approx 0.94818$, $y(1)\approx 1.29700$ and $y(2)\approx 1.47253$. Its derivative is $3e^{-2t}$, which verifies $y^{\prime }+2y=3$ exactly. Interpreting $3$ as a steady input and $2y$ as proportional removal explains the shape: initially all input increases $y$, then removal catches up. The constant particular solution $y_p=3/2$ balances input and removal, and the homogeneous solution $y_h=-\frac{3}{2}{e}^{-2t}$ is the transient response that corrects it to the initial condition. Because this autonomous differential equation has a time-independent right-hand side, $3/2$ is also an equilibrium point.

The first panel adds the particular solution and homogeneous solution; the second shows the same balance in rates, $3=y^{\prime }+2y$. This links the algebra to a physical accounting rule. Newton's law of cooling has this form with $a=k$ and $b=k{T}_a$, while an electrical circuit can have a varying input. In both cases the integrating factor systematically handles the input rather than requiring a guess for a particular solution.

Variable coefficients work just as directly. For $y^{\prime }+2ty=t$, $y(0)=0$, the integrating factor is $e^{t^2}$, andThus $y(0.5)\approx 0.11060$, $y(1)\approx 0.31606$ and $y(2)\approx 0.49084$. The derivative $y^{\prime }=t{e}^{-t^2}$ verifies $y^{\prime }+2ty=t$, including at zero, where both coefficient and input vanish. No division by $t$ is necessary. The general solution is $y=1/2+C{e}^{-t^2}$: $1/2$ is a constant particular solution, and $C{e}^{-t^2}$ solves the associated homogeneous linear differential equation. Although this special forcing term admits a constant trajectory, this is a nonautonomous differential equation: it depends explicitly on time. Merely setting its right-hand side to zero at one instant would not establish a constant solution of a differential equation; at $t=0$ every state has zero slope.

The direction field shows the selected trajectory leaving its initially horizontal tangent line. For $t\ge 0$, the difference between any two solutions of a differential equation is multiplied by $e^{-t^2}$, rather than $e^{-2t}$ in the constant-rate example. This dependence on elapsed history is clearer if the exact formula is rewritten asFor $t\ge t_0$, each contribution from the input at $s$ is weighted by the accumulated coefficient between $s$ and $t$. The homogeneous solution remembers the initial condition; the particular solution given by the second term accumulates the forcing term with zero initial value. This decomposition differs from choosing a constant particular solution, but gives the same total. Initial-data memory tends to zero when ${\int }_{t_0}^{t}a\to +\infty$; a negative accumulated coefficient instead amplifies it. The reciprocal relation between integrating factor and homogeneous solution is developed in MIT's notes on solutions to linear first-order equations.

Why does the trick work? The fundamental theorem of calculus and chain rule give ${\mu }^{\prime }=a\mu$. Consequently the product rule givesIntegrating this identity and dividing by the positive exponential function $\mu$ produces the stated formula. Any nonzero constant multiple of $\mu$ works equally well; normalization is a convenience. This is the beauty of the method: a sum involving an unknown function becomes one exact derivative, leaving only an integral of known functions. See Oregon State's product-rule derivation. The related integrating factor for a differential one-form extends the idea of making an expression exact beyond this linear setting.

Three explicit functions separate the hypotheses from the conclusion. These are original mathematical illustrations, not measured data.

The polynomial function $h(x)=x^3-x=x(x-1)(x+1)$ is a continuous function on $[-3/2,3/2]$, with $h(-3/2)=-15/8$ and $h(3/2)=15/8$. The intermediate value theorem guarantees at least one zero of a function in the interior, while the polynomial factorization displays three: $-1,0,1$. Thus strict opposite signs do not establish uniqueness.

The everywhere-defined functionhas $j(-1)=-1$ and $j(1)=1$, yet no zero of a function. Its jump discontinuity at zero is exactly where the continuity hypothesis fails. A drawn vertical connector would be misleading: the function graph contains neither the intermediate heights nor a zero of a function at that jump. Even continuity only on the interior is insufficient: setting $q(x)=-1$ for $0\le x<1$ and $q(1)=1$ gives opposite endpoint signs on $[0,1]$ with no zero of a function, because the left one-sided limit at $1$ is not $q(1)$.

The polynomial function $t(x)=x^2$ on $[-1,1]$ is a continuous function, and $t(-1)=t(1)=1$, yet $t(0)=0$. Its root of a polynomial at zero has multiplicity of a root two. The function graph touches its horizontal tangent line there and stays positive on both sides: existence of a zero of a function does not require a sign change. More generally, near a real root of a polynomial $r$, a polynomial factorization $p(x)=(x-r{)}^{2m}u(x)$ with $m\ge 1$ and $u(r)\ne 0$ has the same sign on both sides sufficiently close to $r$, since the continuous function $u$ retains its sign. The intermediate value theorem does not rule out values outside the range between endpoint outputs.^[ref]

An interpolant is a function satisfying the prescribed sample conditions $g(x_i)=y_i$. It agrees with the data exactly, but need not agree with an unknown underlying function between samples. The polynomial interpolation example shows that a family or a polynomial degree restriction can supply uniqueness; the McShane extension theorem shows a useful nonunique alternative.

Interpolation constructs a function agreeing exactly with prescribed values at sample points. The resulting function is an interpolant. Choosing a family determines how missing values are filled: polynomial interpolation selects a polynomial, while linear interpolation joins adjacent samples by straight segments. The McShane extension theorem instead permits any Lipschitz function with a specified bound and provides envelopes controlling all allowed choices.

Interval arithmetic calculates with closed intervals that contain the possible values of a quantity. If all we know is $x\in X=[a,b]$, an interval enclosure for a function $f$ must contain $f(x)$ for every allowed $x$. The result says what is guaranteed, including uncertainty in the input and, with outward rounding, roundoff error in the calculation. A wide answer can still be correct; a narrow answer is useful only if it contains every possible value.

The attraction is that a finite calculation can make a statement about infinitely many real numbers at once. An interval enclosure can certify that a function stays positive throughout a whole closed interval, or bound its maximum for mathematical optimization. For example, on $X=[0,1]$, the actual image of a function for $f(x)=x(1-x)$ is $[0,1/4]$, but direct interval arithmetic gives the wider $[0,1]$. Interval subdivision and the interval square range improve this answer in different ways.

Historically, Ramon E. Moore's 1962 Stanford dissertation studied interval arithmetic and automatic error analysis in digital computing; his book Interval Analysis followed in 1966. Eldon Hansen's account documents earlier reports as well: these dates describe important steps in developing and disseminating the subject, rather than a claim of sole invention in a particular year.^[ref] Moore, R. Baker Kearfott and Michael J. Cloud later wrote Introduction to Interval Analysis (2009).^[ref]

Interval bisection solves a target equation $f(x)=t$ by repeatedly halving a closed interval known to contain a solution. It is the bisection method applied to $g(x)=f(x)-t$, so the target becomes a zero of a function. This reduction from an equation to root finding is described in Demanet's notes.^[ref] Here the emphasis is on a continuous strictly increasing function: the target identifies one input, making interval bisection a way to evaluate its inverse function without an explicit inverse formula.

Let $f:[a_0,b_0]\to \mathbb{R}$ be a continuous function, with $a_0<b_0$ and $f(a_0)\le t\le f(b_0)$. The intermediate value theorem guarantees existence; a strictly increasing function also guarantees uniqueness. Check endpoint equality first. Otherwise, for the current root bracket $[a_k,b_k]$, evaluate its midpoint $m_k=(a_k+b_k)/2$. If $f(m_k)<t$, retain $[m_k,b_k]$; if $f(m_k)>t$, retain $[a_k,m_k]$; if $f(m_k)=t$, return that exact solution. These comparisons preserve the target bracket. General bisection method needs continuity and opposite signs of $g$ at the endpoints, without requiring monotonicity or a unique zero of a function; see limitations of bisection.

An original dimensionless polynomial example isHere $f(0)=0<10<30=f(3)$ and the derivative $f^{\prime }(x)=3x^2+1>0$, so there is exactly one solution. In fact $x_{\ast }=2$; knowing this lets us check the computed absolute error independently of the guarantee. The first four halvings give the following exact rational numbers:

The beauty of interval bisection is that the enclosure itself supplies the certificate: one comparison removes half the possible inputs, regardless of the steepness of the function graph. In exact arithmetic, after $k$ completed halvings without exact termination, the width and the bisection error bound for the new midpoint areThe reported midpoint after update four is $m_4=63/32$, rather than the last tested point $m_3=33/16$. Its certified absolute error is at most $3/32$, and its actual absolute error is $1/32$. For a requested position tolerance $10^{-3}$, the bisection stopping criterion requires eleven halvings: ten give $3/2048>10^{-3}$, while eleven giveThe actual absolute error is $1/4096$. The new midpoint need not be evaluated to obtain this certificate.

The signed output residual is $r=f(m)-t$; the position approximation error is $m-x_{\ast }$. They answer different questions: how close is the output to the target, and how close is the input to the solution? Driscoll and Braun explain why a small residual needs information about the derivative to imply small position error.^[ref] For this particular polynomial, direct factorization givesThus at $m_4=63/32$ the residual is $-13121/32768\approx -0.400421$, despite position absolute error $1/32=0.03125$. If a differentiable function satisfies $0<\ell \le f^{\prime }(x)\le L$ throughout the bracket, the mean value theorem gives the rigorous conversionOur example permits $\ell =1$ and $L=28$ on $[0,3]$. Strict increase alone supplies no positive lower derivative bound: $f(x)=x^3$ is strictly increasing but $f^{\prime }(0)=0$. A small residual alone is therefore not a universal position certificate; even the target equation $10^{-6}(x-2)=0$ has residual $10^{-6}$ at $x=3$, a full unit from its solution.

The guarantees require continuity and correct evaluations, not just narrowing endpoints. For the strictly increasing function $h(x)=x$ when $x<0$ and $h(x)=x+1$ when $x\ge 0$, the target $1/2$ lies between $h(-1)$ and $h(1)$ but is never attained: a jump discontinuity defeats the existence argument. With floating-point arithmetic or an approximate evaluation, an incorrect comparison can discard the true solution. A certified interval enclosure of $f(m)$ wholly below or above $t$ certifies the corresponding decision; an enclosure containing $t$ is inconclusive, rather than proof of equality. If rounding makes the midpoint equal an endpoint, report the precision limit; see bisection stopping criterion for the rounded position bound. Both figures are exact mathematical examples, not measured data.

The interval dependency problem is the loss of relationships between repeated occurrences of the same input. For $X=[0,1]$, interval subtraction gives $X-X=[-1,1]$: it permits $u-v$ with independent choices $u,v\in X$. But the function $x\mapsto x-x$ has actual image of a function $\{0\}=[0,0]$. Giving both operands the name $X$ does not tell an interval arithmetic calculation to enforce $u=v$.

For the polynomial $f(x)=x(1-x)$ on $X=[0,1]$, the natural interval extension isThis allows the impossible combination $x=1$ in the first factor and $x=0$ in the second, producing the spurious upper bound $1$. In the actual function, both occurrences use the same $x$. Completing the square gives $x(1-x)=1/4-(x-1/2{)}^2$, which lies between $0$ and $1/4$ on $[0,1]$; every value between these bounds occurs, by continuity and the intermediate value theorem. The maximum $1/4$ occurs at $x=1/2$, while either endpoint gives the minimum $0$.