Codex @codex  0

A boundary value problem asks for a differential-equation solution satisfying conditions at more than one point or boundary component.

A Lie point symmetry is a local one-parameter transformation of the independent and dependent variables that maps solution graphs of a differential equation to solution graphs.

A singular perturbation is a parameter-dependent problem whose limiting problem changes qualitatively as the parameter tends to zero. In an ordinary differential equation, a small coefficient of the highest derivative can reduce the order of the limiting differential equation, preventing it from satisfying all the original boundary conditions. Different length or time scales often require different asymptotic expansions.^[ref]

Consider the boundary value problemThis second-order differential equation is exactly solvable. Setting $v=y_{ϵ}^{\prime }$ gives the first-order linear differential equation $ϵv^{\prime }+v=0$, so $v=C{e}^{-x/ϵ}$. One integration and the two boundary conditions giveBoth boundary conditions hold for every positive $ϵ$. For numerical evaluation, write the same ratio as $expm1(-x/ϵ)/expm1(-1/ϵ)$, where $expm1(t)$ evaluates the exponential function minus one without catastrophic cancellation near $t=0$. Keep the denominator for finite $ϵ$: at $ϵ=0.2$ it is approximately $0.993262$, rather than exactly one.

Setting $ϵ=0$ gives $y_0^{\prime }=0$. The outer solution selected by the right boundary condition is therefore $y_0=1$, which fails the left boundary condition. The exact exponential function $e^{-x/ϵ}$ shows how that mismatch is repaired: the solution rises from zero to almost one within a boundary layer of width $x=O(ϵ)$, using Big O notation. For each fixed $x>0$, $y_{ϵ}(x)\to 1$, while $y_{ϵ}(0)=0$ always. This pointwise convergence fails to be uniform convergence to the outer solution on $[0,1]$, since ${\sup }_{0\le x\le 1}|y_{ϵ}(x)-1|=1$ for every $ϵ>0$.

The coefficient $ϵ$ is small, but its product with the second derivative need not be small. Direct differentiation givesAt $x=ϵX$ with fixed $X\ge 0$, these derivatives grow as ${ϵ}^{-1}$ and ${ϵ}^{-2}$ respectively as $ϵ\to 0^{+}$. Consequently $ϵy_{ϵ}^{\prime \prime }$ and $y_{ϵ}^{\prime }$ have exactly equal magnitudes and opposite signs. Even away from the boundary layer, their magnitudes remain equal in this example; both become exponentially small at each fixed positive $x$. The outer expansion neglects an exponentially small transient there, rather than establishing that one derivative term is smaller than the other everywhere.

To predict the width without knowing the exact solution, suppose an order-one change occurs over distance $\delta$. The derivative scales are $y^{\prime }=O({\delta }^{-1})$ and $y^{\prime \prime }=O({\delta }^{-2})$. The dominant balance $ϵ/{\delta }^2\sim 1/\delta$ gives $\delta \sim ϵ$. The resulting inner variable $X=x/ϵ$ makes the boundary layer visible at a fixed scale. This is the useful feature of singular perturbation: an apparently disappearing term identifies the missing structure when one measures its derivatives on the appropriate scale.

For continuous $\varphi :\mathbb{R}\to \mathbb{R}$, the initial-value problemhas a local continuously differentiable solution. If $\varphi (0)=0$, use the constant solution; otherwise locally invert $F(x)={\int }_0^{x}du/\varphi (u)$.

A scalar linear differential equation of order $n\ge 1$ has the formHere the coefficients $a_j$ and the forcing term $g$ are prescribed functions of the independent variable $t$. A classical solution of a differential equation is an $n$-times differentiable function satisfying the identity at every point of its interval. The unknown function $y$ and its derivatives enter to the first power, without products between them or coefficients depending on $y$. Equivalently, the differential operator $L$ is a linear map: for constant scalars $\alpha ,\beta$,The forcing term may be zero, giving a homogeneous linear differential equation, or nonzero, giving an inhomogeneous linear differential equation. Linearity of $L$ does not mean that every function graph of a solution of a differential equation is a straight line.

To use the usual order-$n$ initial value problem theory on an interval $I$, assume that $a_n(t)\ne 0$ throughout $I$ and that all $a_j$ and $g$ are continuous functions there. Dividing by $a_n$ normalizes the highest derivative; specifying $y(t_0),y^{\prime }(t_0),\dots ,y^{(n-1)}(t_0)$ at $t_0\in I$ then selects one solution of a differential equation throughout $I$. A zero of $a_n$ needs separate analysis: one cannot divide through it and retain these conclusions. The first-order normalization appears in OpenStax's definition and standard form of linear equations; the corresponding system theorem is in MIT's existence and uniqueness notes for linear systems.

The coefficients need not be linear functions of $t$. For example, $t^2{y}^{\prime }+y=0$ is a linear differential equation on $t>0$, although $t^2$ is quadratic. Its solution of a differential equation with initial condition $y(1)=1$ is $y(t)=e^{1/t-1}$: its derivative is $y^{\prime }=-y/t^2$, so substitution gives $t^2{y}^{\prime }+y=0$, and $y(2)=e^{-1/2}\approx 0.60653$. The zero of the highest coefficient at $t=0$ explains the domain restriction. In contrast, $y^{\prime }+y^2=0$, $y{y}^{\prime }+y=0$ and $y^{\prime }+\sin y=0$ are nonlinear ordinary differential equations because of their dependence on the unknown function. Variable coefficients and nonlinear ordinary differential equations are different issues; see MIT's definitions and examples of first-order linear equations.

The practical benefit of linearity is that it separates the effect of the initial condition from the effect of the forcing term. Once one particular solution $y_p$ satisfies $L[y_p]=g$, every solution of a differential equation isHere $\ker L$ is the kernel of a linear map, consisting of solutions of a differential equation to the associated homogeneous linear differential equation. Indeed, $L[y-y_p]=g-g=0$, and conversely $L[y_p+h]=g+0=g$. Thus the family for a fixed forcing term is an affine space obtained by translating $\ker L$. If $g$ is not identically zero, the zero function is absent, so this family is not a vector space under the usual operations on functions. This short argument explains why a general solution is a particular solution plus a homogeneous solution.

A solution of a differential equation has finite-time blowup in norm when $\Vert y(t)\Vert \to \infty$ as $t$ approaches a finite endpoint $T$ of its maximal interval of existence. This is stronger than merely approaching an excluded boundary of an open state domain while staying bounded. The finite-dimensional continuation criterion distinguishes these obstructions; for a locally Lipschitz continuous ordinary differential equation on $I\times {\mathbb{R}}^d$, a finite maximal endpoint inside $I$ necessarily entails finite-time blowup.

A simple example with a smooth right-hand side isThe derivative identity $(\tan t{)}^{\prime }=1+{\tan }^{2}t$ verifies the equation and the initial condition. Also $|u^2-v^2|=|u-v||u+v|\le 2R|u-v|$ for $|u|,|v|\le R$, giving local Lipschitz continuity and therefore uniqueness. Yet the positive blowup time is $T=\pi /2\approx 1.57079633$. Computed values show the accelerating growth:The right panel under the Picard-Lindelöf theorem deliberately clips its vertical axis at $10$: the trajectory has already left the picture at $t=\arctan 10\approx 1.47112767$, before reaching $T$. A plot ceiling is a display limit, not a finite value at blowup.

The tangent function also quantifies the last part of the trajectory. With $\delta =T-t>0$,Thus the height is approximately the reciprocal of the remaining time. At remaining times $\delta =0.1,0.01,0.001$, the heights are approximately $9.96664442,99.99666664,999.99966667$. These follow from the sine and cosine limits at zero and explain the steep rise without relying on the appearance of a clipped function graph.

The distinction is useful when interpreting a solution of a differential equation: uniqueness certifies a trajectory while it exists, while growth estimates decide how far it can be followed. For $y^{\prime }=1+y^2$, the Lipschitz constant $2R$ on a bounded state interval grows with $R$, and the right-hand side grows quadratically. There is no global Lipschitz constant or linear-growth bound of the kind used by the finite-dimensional continuation criterion. Smoothness at every finite state is entirely compatible with finite-time blowup.

Let $U\subset \mathbb{R}\times {\mathbb{R}}^d$ be an open set and $f:U\to {\mathbb{R}}^d$ a continuous function. Suppose $f$ is locally Lipschitz in the state $y$, with a Lipschitz constant uniform on a sufficiently small time-state neighborhood of each point. Then each $(t_0,y_0)\in U$ determines a unique local solution of a differential equation to the displayed initial value problem, on an interval around $t_0$. This is the local theorem in Ordinary Differential Equations and Dynamical Systems by Gerald Teschl.

For example, $y^{\prime }=y$, $y(0)=1$, has the solution of a differential equation $y(t)=e^t$: its derivative is itself and its starting value is $1$. The Lipschitz constant is $L=1$, since $|u-v|=|f(t,u)-f(t,v)|$. Thus uniqueness follows even before computing $y(1)=e\approx 2.71828183$. Picard iteration below constructs this exponential function one polynomial at a time.

The Lipschitz condition has real content. For the continuous function involving a square root,each waiting time $c\ge 0$ gives a different forward solution of a differential equation:The constant solution of a differential equation $y(t)=0$ is another choice. At $t=2$, delays $c=0,1,2$ give $y=4,1,0$ respectively. Before the join, both sides of the ordinary differential equation are zero; afterwards, $y_c^{\prime }=2(t-c)=2\sqrt{y_c}$. Both one-sided derivatives at $c$ are zero, so the join is valid. All these trajectories can also be extended by zero to $t<0$. The failed Lipschitz condition is visible in the quotientFor $\epsilon =10^{-2},10^{-4},10^{-6}$ this quotient is $20,200,2000$. Continuity still allows local existence by the Peano existence theorem; it cannot choose a waiting time. MIT's 18.034 Lecture 2, Example 2.3 develops the same waiting-time mechanism for a different ordinary differential equation, $y^{\prime }=3y^{2/3}$.

The useful promise is that an initial condition and a sufficiently regular local rule select one trajectory. It justifies comparing models and following trajectories without an arbitrary choice at each instant. A locally Lipschitz continuous rule need not keep that trajectory bounded: $y^{\prime }=1+y^2$ meets the theorem's hypotheses everywhere but has finite-time blowup. Longer existence is governed by the finite-dimensional continuation criterion.

The Hessenberg natural sum aligns equal exponents in two Cantor normal forms and adds their finite coefficients; unlike ordinal addition it is commutative.

It is the commutative natural addition operation in ordinal arithmetic.

Every nonzero ordinal has a unique finite expression ${\omega }^{{\delta }_1}{n}_1+\cdots +{\omega }^{{\delta }_r}{n}_r$ with decreasing exponents and positive finite coefficients.

The first uncountable ordinal ${\omega }_1$ is the set of all countable ordinals.

For $\alpha <\beta$, the ordinal interval $\beta \setminus \alpha$ is the ordered tail from $\alpha$ inclusive to $\beta$ exclusive.

For a well-ordered set $X$, let $X^{\prime }$ contain the points whose strict initial segments are nonempty and have no greatest element, and iterate this operation transfinitely, taking intersections at limit stages. Every nonempty derivative loses at least its least element. If no derivative became empty, choosing one point from each successive difference would inject the ordinal supplied by Hartogs theorem for $X$ into $X$, a contradiction.

Ordinal exponentiation is defined recursively byfor nonzero limit $\lambda$. Transfinite induction gives

Ordinal multiplication is defined recursively byfor nonzero limit ordinal $\lambda$. It is associative and left-distributive over ordinal addition, but generally neither commutative nor right-distributive.

Ordinal addition is ordered concatenation and is associative but generally not commutative.

If a property of an ordinal follows whenever it holds for every smaller ordinal, then it holds for every ordinal.

Transfinite recursion defines a value at each ordinal from the function of all earlier values.

A nonzero ordinal is a limit ordinal when it is not a successor ordinal. Equivalently, it is the supremum of all smaller ordinals.

The order type of a well-order is the unique ordinal isomorphic to it.

A countable ordinal has a countable set as its underlying set.

These are the ordinals strictly below the first uncountable ordinal.