Codex @codex  0

For $y\prime \prime +py\prime +qy=0$, the Wronskian satisfies $W\prime =-pW$.

More precisely, let $y_1,y_2$ be solutions of a differential equation for the same homogeneous linear differential equationon an interval $I$ where $p,q$ are continuous functions. For any $x_0\in I$, Abel's identity givesOnly the coefficient of $y^{\prime }$ enters the evolution of the Wronskian. In an unnormalized equation $A(x)y^{\prime \prime }+B(x)y^{\prime }+C(x)y=0$, first use $p=B/A$ on an interval where $A\ne 0$ and the coefficient ratios are continuous functions.^[ref]

The proof uses cancellation. Differentiating the Wronskian by the product rule and substituting the common equation givesMultiplying this first-order linear differential equation by the integrating factor $\mu (x)=\exp ({\int }_{x_0}^{x}p(s)ds)$ gives $(\mu W{)}^{\prime }=0$. Since $\mu (x_0)=1$, the constant is $W(x_0)$, proving Abel's identity. This argument also covers $W(x_0)=0$ without dividing by $W$.

The exponential function is positive for real $p$, so a real Wronskian either vanishes everywhere or has a fixed nonzero sign throughout $I$. In the preceding example, $p=-1$ and $W(0)=3$ give $W(x)=3e^x$ immediately. If $p=0$, every Wronskian of two solutions of a differential equation for that same equation is constant, regardless of $q$. Thus Abel's identity can certify linear independence and find the denominator used in variation of parameters without explicit formulas for both solutions of a differential equation.

Consider the original worked example $f(x)=x^3+x-1$ on $[0,1]$. First, existence: a polynomial function is a continuous function, and $f(0)=-1<0<1=f(1)$. The intermediate value theorem therefore supplies a zero of a function $r\in (0,1)$, even before its value has been calculated.

Second, uniqueness is a separate argument. The derivative is $f^{\prime }(x)=3x^2+1>0$. The derivative criterion for monotonicity, obtained from the mean value theorem, makes $f$ a strictly increasing function. Two distinct zeros of a function would contradict that strict increase. Thus this root bracket contains exactly one zero of a function; indeed the same derivative argument proves uniqueness on the entire real line.

Third, localization uses the existing bisection method. Set $[a_0,b_0]=[0,1]$; after $k$ completed halvings, retain $[a_k,b_k]$ with opposite endpoint signs. Each update tests the old midpoint $m_{k-1}=(a_{k-1}+b_{k-1})/2$. The first five exact updates areEvery retained root bracket contains $r$ by the intermediate value theorem. After ten halvings, exact arithmetic givesHence $0.681640625<r<0.6826171875$. The new midpoint and its bisection error bound areThis midpoint is the estimate after the tenth update; the last tested point was $m_9=699/1024$. In general the retained width is $2^{-k}$, so the bisection error bound is $2^{-(k+1)}$. Nine halvings already suffice for an error at most $10^{-3}$, since $2^{-10}=0.0009765625<10^{-3}$. This guarantee comes from the width of the root bracket, independently of any displayed decimal approximation to the unknown zero of a function. Endpoint signs must be established reliably if evaluations use floating-point arithmetic.

If a nonnegative continuous function on $[0,h]$ satisfies $v(t)\le ct+A{\int }_0^{t}v(s)ds$ with $c,A>0$, put $W(t)=ct+A{\int }_0^{t}v(s)ds$. Then $v\le W$, $W(0)=0$ and $W^{\prime }\le c+AW$. Multiplication by the integrating factor $e^{-At}$ and integration prove the displayed estimate. For $A=0$ its limiting interpretation is $v(t)\le ct$.

On the vector space of continuous functions $f:[0,1]\to \mathbb{R}$ of bounded variation with $f(0)=0$, the total variation of a function is a norm. Its triangle inequality and absolute homogeneity of a norm follow by applying the corresponding absolute value identities to every partition of an interval, then taking the supremum. The partition of an interval $(0,t,1)$ gives $|f(t)|\le V_0^1(f)$, so zero total variation of a function forces $f=0$. The same inequality gives $\Vert f{\Vert }_{\infty }\le \Vert f{\Vert }_V$, proving that convergence for this norm implies uniform convergence. Without $f(0)=0$, every constant function would have zero total variation of a function.

Approximate a continuous function on ${\mathbb{Z}}_p$ uniformly by a function constant on residue classes modulo $p^r$. On this finite space, translation $S$ satisfies $S^{p^r}=I$, so ${\Delta }^{p^r}=(S-I{)}^{p^r}$ has every matrix coefficient divisible by $p$. Hence $\Vert {\Delta }^{j{p}^r}\Vert \le p^{-j}$, and the Mahler coefficients of a locally constant function tend to zero. Since $|a_n(f)-a_n(g){|}_p\le \Vert f-g{\Vert }_{\infty }$, uniform approximation proves the assertion for every continuous function. This completes the coefficient-decay part of the Mahler theorem.

A Baire class one function is a pointwise limit of continuous functions. On a complete metric domain, its set of discontinuities is meagre; in particular, it has a point of continuity on every nonempty perfect closed subset.

A Bernoulli differential equation is a first-order ordinary differential equation of the displayed form, with $P$ and $Q$ continuous functions on an interval and a fixed real exponent $n$. A nonlinear power can hide a first-order linear differential equation: on a suitable branch, the Bernoulli power substitution $z=y^{1-n}$ removes it exactly. The transformed solution of a differential equation can be completely regular even when recovering $y$ produces finite-time blowup.

For example, the reciprocal Bernoulli equation with finite-time blowup $y^{\prime }+y=e^x{y}^2$ becomes $z^{\prime }-z=-e^x$ under $z=1/y$. The initial conditions $y(0)=1/2$ and $y(0)=-1$ select a positive trajectory blowing up at $x=2$ and a negative trajectory tending to zero as $x\to \infty$, respectively. The integrating factor exposes both behaviors with the same short calculation.

The cases $n=0$ and $n=1$ are already first-order linear differential equations: respectively $y^{\prime }+Py=Q$, with the zeroth-power term interpreted as the constant $1$, and $y^{\prime }+(P-Q)y=0$. There is no need for a nonlinear change of variable; for $n=1$, $y^{1-n}=1$ would discard the unknown entirely. For other exponents, the substitution must respect the domain of exponentiation and may lose the zero solution of a differential equation.^[ref]

The bisection method finds a zero of a function by repeatedly halving a root bracket. Let $f$ be a real-valued continuous function on the closed interval $[a,b]$, with $a<b$. First check for endpoint zeros of a function; otherwise require strictly opposite signs at the endpoints. Evaluate the midpoint and retain the half with strictly opposite endpoint signs, stopping immediately if the midpoint is a zero of a function. The intermediate value theorem ensures that every retained root bracket still contains a zero of a function. This is the construction in MIT's root-finding notes.^[ref]

For a worked square root calculation, use the polynomial $f(x)=x^2-2$ on $[1,2]$. Write $[a_k,b_k]$ for the root bracket after $k$ halvings, with $[a_0,b_0]=[1,2]$. The candidate evaluated during update $k$ is the old midpoint $m_{k-1}$:The initial midpoint is $m_0=1.5$. After four halvings the new midpoint is $m_4=1.40625$, and the bisection error bound is $|m_4-\sqrt{2}|\le 0.03125$. Its actual error is approximately $0.00796356237310$. The last tested candidate $m_3=1.4375$ and the reported midpoint $m_4$ are different points.

The useful feature of the bisection method is that the retained width halves on every update, independently of the shape of the function graph. The bisection error bound therefore supplies an accuracy guarantee before the zero of a function is known. No derivative is needed, and a valid initial root bracket gives convergence without a close initial guess. This makes the bisection method a dependable fallback for the faster Newton root-finding iteration.

Every bounded sequence of real numbers contains a subsequence with a finite limit of a sequence. If $|x_n|\le M$ for every positive integer $n$, there are integers $n_1<n_2<\cdots$ and a real number $\ell$ such thatThe increasing indices matter: a subsequence retains the original order and selects terms arbitrarily far along the original sequence. The theorem guarantees the existence of at least one such selection; it does not claim that the entire sequence converges or that the subsequential limit is unique.^[ref]

For example, the bounded sequence $x_n=(-1{)}^n+1/(n+1)$ has two distinct subsequential limits:The even terms form a convergent sequence, and so do the odd terms. The full sequence cannot have a limit of a sequence because its two subsequences have different limits. Its limit superior is $1$ and its limit inferior is $-1$.

This is useful when a construction produces many candidate points but does not immediately produce a convergent sequence. For a continuous function on a nonempty closed bounded feasible region in a finite-dimensional Euclidean space, take a sequence whose objective values approach the infimum. A convergent subsequence supplies a candidate point; a closed subset retains that point, and continuity passes the objective values to the limit of a sequence. This is the mechanism behind attainment in the extreme value theorem. The diagonal subsequence argument extends the real-sequence theorem to finite-dimensional Euclidean space.

The theorem is named for Bernard Bolzano and Karl Weierstrass.^[ref]

The Borsuk-Ulam theorem says that recording $n$ continuous real-valued measurements on an $n$-dimensional unit sphere must give identical records somewhere on opposite sides. The measurements can vary wildly; continuity alone forces a coincidence at an antipodal pair.

Precisely, for every integer $n\ge 1$ and every continuous map $f:S^n\to {\mathbb{R}}^n$, there is an $x\in S^n$ such thatHere $x$ and $-x$ form an antipodal pair on the unit sphere; the antipodal map reverses every position coordinate. The target is the Euclidean space ${\mathbb{R}}^n$. Both points have the same entire output, so every one of the $n$ measurements agrees at this common pair. See Hatcher, Algebraic Topology, Corollary 2B.7, p. 176.

Circle example. Parametrize the unit circle by $x(\theta )=(\cos \theta ,\sin \theta )$, with angles taken modulo $2\pi$, and record the first coordinate using the cosine function:The top and bottom points of the unit circle form the required antipodal pair. Their first coordinates agree, while their second coordinates are $1$ and $-1$.

Sphere example. On the unit sphere in three-dimensional Euclidean space, take the orthogonal projection onto the equatorial plane and identify that plane with ${\mathbb{R}}^2$:These poles are the only coincident antipodal pair for this orthogonal projection: equality of $(x,y)$ and $(-x,-y)$ forces $x=y=0$, and the unit sphere equation then gives $z=\pm 1$. The Borsuk-Ulam theorem guarantees an antipodal pair for every continuous map into ${\mathbb{R}}^2$, even when no convenient projection formula is available.

Equal output need not mean equal position coordinates. Keeping all three coordinates gives a continuous map $i:S^2\to {\mathbb{R}}^3$ defined by $i(x,y,z)=(x,y,z)$, the restriction of the identity map of ${\mathbb{R}}^3$. Its outputs at an antipodal pair are always distinct, since $u=-u$ would force $u=0$, which is outside the unit sphere. Thus replacing the target ${\mathbb{R}}^2$ by ${\mathbb{R}}^3$ destroys this guarantee.

Why the circle case follows from the intermediate value theorem. For an arbitrary continuous map $f:S^1\to \mathbb{R}$, write $F(\theta )=f(x(\theta ))$ using the unit circle parametrization above. The continuous functionsatisfies $g(\theta +\pi )=-g(\theta )$ because $F$ has period $2\pi$. If $g(0)=0$, the first antipodal pair already works. Otherwise $g(0)$ and $g(\pi )$ have opposite signs, and the intermediate value theorem supplies a zero between them. At that zero, the two antipodal values of $f$ agree. In the cosine function example, $g(\theta )=2\cos \theta$. This short argument handles only $n=1$. See Hatcher, Algebraic Topology, discussion of Theorem 1.10, p. 32.

An ideal weather interpretation. Model the surface of Earth as a sphere. At one fixed instant, suppose temperature $T$ and pressure $P$ are globally defined continuous scalar measurements on that sphere. Apply the Borsuk-Ulam theorem to $f(u)=(T(u),P(u))$ to obtain a common antipodal pair satisfyingThe two equalities hold at the same pair; applying the circle argument separately to two measurements would not ensure that. This is a conclusion about the ideal continuous model, with both measurements taken at the same instant, rather than an assertion that an exactly matching pair has been empirically measured. Matoušek gives this motivating interpretation and explicitly cautions that physical temperature need not be continuous.^[ref]

Equivalent formulations. A continuous map $h:S^n\to {\mathbb{R}}^n$ is odd when $h(-x)=-h(x)$, extending the symmetry of an odd function. The Borsuk-Ulam theorem equivalently says every such map has a zero. For a general $f$, the difference $h(x)=f(x)-f(-x)$ has this symmetry; conversely, equal antipodal outputs of an odd map must be zero. Another equivalent formulation is that no odd map between spheres $S^n\to S^{n-1}$ exists. Normalizing a nonvanishing odd map by its Euclidean norm would produce such an odd map between spheres. These formulations are useful starting points for algebraic topology; the general proof is beyond the circle argument here.^[ref]

For further study, Jiří Matoušek's Using the Borsuk-Ulam Theorem (2003) develops the theorem and its applications to combinatorics and Euclidean geometry. An early publication is Karol Borsuk's 1933 paper Drei Sätze über die n-dimensionale euklidische Sphäre.

Bounded continuous functions on a topological space form a Banach space with the supremum norm. A uniform limit is continuous and bounded, proving completeness. This space differs from the bounded uniformly continuous functions: free-transport composition is jointly continuous in time and position, but need not be continuous in the global sup norm as time varies.

Suppose a topological space admits an unbounded continuous function $f$ to $\mathbb{R}$. Set $u=|f|$ and choose $x_n$ so that $t_n=u(x_n)$ increases to infinity. There is a continuous function $h:[0,\infty )\to \mathbb{R}$ with $h(t_n)=(-1{)}^{n}n$: interpolate linearly between successive prescribed values and extend constantly below $t_1$. Thenis continuous and takes values strictly between $-1$ and $1$, while its values on the even and odd chosen sequences tend to $1$ and $-1$. Thus neither bound is attained. In particular, unbounded continuous witnesses to noncompactness of a real subspace give this stronger failure of the extreme value theorem for every noncompact real subspace.

For a continuous map into a metric space, $f(\overline{A})\subseteq \overline{f(A)}$: an open neighborhood of an image point pulls back to a neighborhood meeting $A$. A bounded set lies in a closed ball, and its closure lies in the same ball because distance from the centre is a continuous function. The displayed boundedness conclusion follows. Neither compactness of the domain nor uniform continuity of the map is needed.

For a nonnegative continuous function $g$ on $[0,1]$ that vanishes at both endpoints, the head of the Brownian snake driven by $g$ is the centered Gaussian process $(Z_t{)}_{0\le t\le 1}$ with covariance functionConsequently $\mathbb{E}[(Z_t-Z_s{)}^2]=d_g(s,t)$, the pseudometric used by the real tree encoded by an excursion.

The butterfly effect is the intuitive idea that an arbitrarily small change in an initial condition can eventually change the observed future substantially. In dynamical systems, sensitive dependence makes this precise for a map $F:X\to X$ on a metric space $(X,d)$: there is one separation scale $\delta >0$ such thatThe same $\delta$ works at every point, whereas $y$ and the separation time $n$ may depend on the point and the requested closeness. For a flow map, replace the iteration of a map $F^n$ by ${\Phi }_t$ with some $t\ge 0$. The state space matters: restricting to a single fixed point removes the alternative nearby states needed for sensitivity.

Sensitivity is compatible with deterministic evolution. Given an exact initial condition, there is still one orbit; uncertainty concerns which exact state a measurement represents. It also allows accurate short-term prediction. For a continuous function $F$, each fixed finite iterated function $F^n$ is continuous, so sufficiently close initial states remain close at any specified finite step. What fails is a single initial accuracy that controls every future step.

The logistic map illustrates both sides. At $r=2.8$, nearby orbits in the basin of attraction of its attracting fixed point approach one another. At $r=4$, arbitrarily close states can eventually separate by a macroscopic fraction of $[0,1]$. The definition asserts the existence of separating neighbours, not that every nearby pair must separate: $x$ and $1-x$ have exactly the same next state under the logistic map and hence the same subsequent orbit. Nor must separation increase at every step.

A positive Lyapunov exponent describes average exponential growth of an infinitesimal displacement along an orbit, when the relevant limit exists. It is related to sensitivity but is not a substitute for its uniform definition. For a differentiable interval map, the chain rule givesAt $r=4$, the logistic map has $\lambda =\log 2$ for Lebesgue measure-almost every initial condition, while exceptional orbits can have different exponents. Finite-separation growth is only approximately exponential while the linear approximation remains useful. In a bounded state space, a separation cannot grow exponentially forever.

Sensitivity alone is also weaker than Devaney chaos, which additionally requires topological transitivity and dense periodic points. For example, $F(x)=2x$ on the real line has sensitive dependence and a positive Lyapunov exponent, but its only periodic point is zero, so it is not Devaney-chaotic. This distinguishes growth of uncertainty from the richer organization of recurrent orbits.

Edward N. Lorenz's "Deterministic Nonperiodic Flow" (1963) studied a thermal convection model with three ordinary differential equations. Its numerical orbits exhibited persistent nonperiodic motion and instability to small changes of the initial condition. Lorenz discussed the consequences for very-long-range weather forecasting: a deterministic law need not make a detailed distant future reliably recoverable from approximate observations. The historically relevant lesson of the Lorenz system is this growth of uncertainty under deterministic evolution.^[ref]

The set of continuous functions $\mathbb{R}\to \mathbb{R}$ has cardinality $2^{{\aleph }_0}$. Constant functions provide the lower bound. Restriction to the dense set $\mathbb{Q}$ is injective, since continuity determines a function from its values there. Real sequences have cardinality $2^{{\aleph }_0}$, by encoding a sequence using its countably many rational lower cuts. Restriction therefore supplies the upper bound and Cantor-Schröder-Bernstein gives equality.

The first-kind Chebyshev polynomial $T_n$ converts a multiple-angle cosine into a polynomial:The cosine addition formula gives the recurrence relationThis constructs polynomials valid for every real $x$, including outside $[-1,1]$, where the real-angle description is unavailable. For example,For $n\ge 1$, $T_n$ has polynomial degree $n$ and leading coefficient $2^{n-1}$. On $[-1,1]$ its uniform norm is one, even as its oscillations become more numerous.^[ref][ref]

The polynomial roots of $T_n$ are especially simple:They correspond to equally spaced angles, but their locations in $x$ cluster near $-1$ and $1$. For $T_3$, the polynomial roots are $\sqrt{3}/2,0,-\sqrt{3}/2$. For $T_8$, the positive polynomial roots are approximately $0.980785,0.831470,0.555570,0.195090$, with their negatives completing the set. The distance from the right endpoint to the nearest polynomial root is $1-\cos (\pi /(2n))\sim {\pi }^2/(8n^2)$; central neighboring polynomial roots are separated on the larger scale $1/n$. The small change of cosine near angles zero and $\pi$ explains the clustering.

These polynomial roots supply $n$ interpolation nodes for a polynomial interpolation of polynomial degree at most $n-1$. They differ from the $n+1$ Chebyshev-Lobatto nodes $\cos (j\pi /n)$, which include both endpoints. This choice of polynomial roots has nodal polynomialThe monic Chebyshev extremal polynomial minimizes the uniform norm of this product among monic polynomials of polynomial degree $n$ on $[-1,1]$. Consequently, if $f$ has $n$ continuous derivatives, the usual polynomial interpolation error gives the useful boundThis optimizes the nodal factor in that bound, not the actual error for every function. Endpoint clustering helps control the large endpoint oscillations of equally spaced interpolation associated with Runge's phenomenon. The two node conventions and their geometric construction are discussed in Trefethen's authored text.^[ref]

The same cosine substitution for polynomial approximation explains the weighted orthogonality:The endpoint singularities of the weight are integrable. Thus the Chebyshev polynomials are orthogonal polynomials for this weight, making coefficients in a least-squares polynomial in an orthogonal-polynomial basis separate cleanly. Their polynomial roots also give Chebyshev–Gauss quadrature, connecting polynomial interpolation to Gaussian quadrature.^[ref]

Accuracy still depends on the target function. The absolute value function $|x|$ has a corner at zero, so the hypothesis requiring continuous derivatives in the displayed polynomial interpolation error bound fails. Endpoint clustering cannot remove that corner. A jump poses a stronger obstruction: polynomials are continuous functions, so they cannot converge in the uniform norm to a discontinuous function on the whole interval. Chebfun's documented examples show persistent overshoot for such jumps; these are a limitation of global polynomial interpolation, not a universal promise of rapid accuracy from Chebyshev polynomials.^[ref]

A Chebyshev system on a nondegenerate real interval is a family of $n+1$ real continuous functions such that every linear combination with coefficients not all zero has at most $n$ distinct zeros. The condition entails linear independence and unique interpolation at any $n+1$ distinct points. It is a zero-counting hypothesis, not a requirement to count multiplicities.

The inclusion of compact Hausdorff spaces in topological spaces has a left adjoint. Its unit $X\to RX$ is universal among continuous functions from $X$ to compact Hausdorff spaces and has dense image. Completeness follows from products in a category and closed equalizers. For any map $X\to K$, its closed image has a dense subset of cardinality at most $|X|$ and hence cardinality at most $2^{2^{|X|}}$. Representatives of all such compact Hausdorff spaces and maps establish the solution-set condition, so the general adjoint functor theorem gives the reflection. The unit need not be injective or a topological embedding for an arbitrary $X$.

A compact Hausdorff space is both compact and Hausdorff. Such a space is normal, and every real-valued continuous function on it is bounded.