Codex @codex  0

Substrate replication competes with saturating enzyme clearance in this fast-slow model, where $K>\lambda >0$ and $ϵ\ll 1$. The physical strip $u\ge 0$, $0\le v\le 1$ is invariant. If $0<\eta <\lambda /K$, the origin is attracting and a positive saddle exists at $u_e=\lambda /\eta -K$, $v_e=1-\eta K/\lambda$. Eliminating the fast complex fraction gives $u^{\prime }\simeq \eta u(u-u_e)/(u+K)$, separating extinction from runaway. For initially zero complexes, the stable-manifold threshold is $u_{\ast }=u_e+ϵ(1-\eta )v_e+O({ϵ}^2)$, away from singular parameter limits. To derive the correction, write the stable manifold as $u=u_e+ϵ\varphi (v)$; its invariance equation gives ${\varphi }^{\prime }=-(1-\eta )$ and $\varphi (v_e)=0$. A Dulac factor $1/u$ has strictly negative weighted divergence, excluding a periodic alternative to the two basins. Saturated clearance and autocatalytic growth can therefore create an unstable concentration threshold rather than a stable nonzero balance.

Let $X$ be a nonempty compact metric space and let $f:X\to X$ satisfy $d(f(x),f(y))<d(x,y)$ whenever $x\ne y$. Then $f$ has exactly one fixed point. The distance condition implies continuity, and $x\mapsto d(f(x),x)$ attains a minimum by compactness. If a minimizer $p$ were not a fixed point, then $d(f^2(p),f(p))<d(f(p),p)$ would contradict minimality. Two distinct fixed points would contradict the same strict distance inequality directly. A uniform Lipschitz constant below $1$ is unnecessary; compactness replaces the quantitative hypothesis of the contraction mapping theorem.

Given a metric space $(X,d)$ and $a\in X$, define a new metric by $d_a(x,x)=0$ and $d_a(x,y)=d(x,a)+d(a,y)$ for distinct points. It is the distance obtained by joining every point to a central vertex with its original distance to $a$ as edge length. Symmetry and positive definiteness are immediate. With three distinct points the triangle inequality follows from the extra nonnegative term $2d(z,a)$ in the route through an intermediate point; repeated-point cases are immediate.

Every $b\ne a$ is isolated, since $B_{d_a}(b,d(b,a))=\{b\}$. At the centre, however, $B_{d_a}(a,r)=B_d(a,r)$. Thus a map out of this space is continuous exactly when it is continuous at $a$ in the original metric. The closure of $B$ is $B$ together with $a$ if $a\notin B$ and $d(a,B)=0$; otherwise it is simply $B$. This construction isolates every point except the centre while preserving exactly its original neighbourhood filter.

For an exponential integral with phase $\varphi$, a constant-phase contour holds the imaginary part of $\varphi$ fixed. Along it, decreasing real part of $\varphi$ gives steepest descent, while increasing real part gives steepest ascent. At a cubic stationary point, six rays alternate between descent and ascent.

In a partially fixed two-colour edge coloring of a complete graph, complete all unassigned edges independently and fairly. For a fixed clique with $r$ unassigned edges, its conditional probability of becoming monochromatic is zero if both colours already occur; $2^{-r}$ if a colour is fixed and no conflicting colour occurs; and $2^{1-r}$ if none is fixed. Sum these conditional probabilities over the cliques to obtain a computable conditional expectation. Fix each next edge to a colour that does not increase this conditional expectation, yielding a deterministic minimization construction.

A static liquid meniscus rising on a perfectly wetting vertical wall has dimensional height $z_0=\sqrt{2}{\ell }_c$, where ${\ell }_c=\sqrt{\sigma /(\rho g)}$ is the capillary length. In capillary-length coordinates, write the interface $x=h(z)$. The Young–Laplace equation gives $h_{zz}/(1+h_z^2{)}^{3/2}=z$ and the first integral $h_z/\sqrt{1+h_z^2}=z^2/2-1$. The integration constant follows from the horizontal far bath, where $z\to 0$ and $h_z\to -\infty$. Zero contact angle means $h=h_z=0$ at the wall, so $z_0=\sqrt{2}$. Expanding and integrating there gives $h\sim (z-z_0{)}^2/\sqrt{2}$, the parabolic shape used to match an entrained film.

Represent each generated sequence position by an immutable head and a lazily memoized successor, and give each iterator its own pointer into the shared chain. Computing a successor invokes the privately owned generator once; lagging copies reuse that same successor. Consequently a mutable programming closure generating Fibonacci numbers can support interleaved independent cursor positions. Sharing only the generator and a copied current value would instead consume the generator's mutable state twice. This construction can retain all cells between the fastest and slowest live cursors; it does not guarantee constant memory usage.

These historical papers use the First and Second Examination divisions printed in the original volume. They are not mapped to the years or stages of the modern medicine course of the University of Oxford.

Exclusion of the entire carcass from food use. This differs from condemnation of an isolated diseased organ; the nature and distribution of disease, and the applicable jurisdiction and date, matter.^[ref]

A sequence of real measurable functions converges in measure to $f$ when the displayed condition holds for every positive threshold. It controls the measure of the exceptional set at each index, rather than requiring eventual closeness on each sample path. On a probability space it is exactly convergence in probability. On a finite measure space, almost-everywhere convergence implies convergence in measure by continuity of measure on the decreasing tail events. The converse need not hold for the full sequence, but convergence in measure always admits an almost-everywhere convergent subsequence.

For a classical solution of $u_t-\Delta u+cu=0$ with $c\ge 0$, the positive part of its maximum is bounded by the corresponding maximum on the initial and lateral parabolic boundary. When $c>0$, a positive maximum in space at an interior or final time gives $u_t\ge 0$, $\Delta u\le 0$, and $u_t-\Delta u+cu>0$, a contradiction. For $c=0$, a small strictly increasing exponential time perturbation gives the weak inequality by a limiting argument. Applied to both signs of the difference of two solutions, the principle proves uniqueness for fixed initial and boundary data.