Codex @codex  0

Stability of a numerical method controls how perturbations in initial data, roundoff and local residuals propagate. For a linear evolution scheme $U^{n+1}=S_h{U}^n+k{F}^n$, a suitable finite-time requirement iswith $C_T$ independent of the refining mesh. The norm should approximate the norm of the continuous problem, such as an area-weighted L2 norm. The bound need not imply decay: $C_T=e^{CT}$ is appropriate when the equation itself permits finite-time growth. For a multilevel scheme the state includes all required time levels.

The error recurrence shows why stability matters. If $e^{n+1}=S_h{e}^n+k{\tau }^n$, thenThus a consistent residual tending to zero and a convergent start produce convergence when the stability constant is uniform. Tiny defects need not remain tiny without that bound. The Lax equivalence theorem makes this precise: for a well-posed linear initial value problem and a consistent linear approximation, stability is equivalent to convergence in the compatible solution norms. It is not a theorem for arbitrary nonlinear schemes, and a high formal order does not substitute for stability.

For constant coefficients on a periodic or infinite grid, von Neumann stability analysis diagonalizes spatial translations using Fourier modes. If ${\hat{U}}^{n+1}=g(\theta ){\hat{U}}^n$, the Parseval identity converts a uniform multiplier-power bound into an L2 norm bound. The contraction condition $|g(\theta )|\le 1$ is sufficient; a more general $|g(\theta )|\le 1+Ck$ also yields a finite-time bound. For the centered-space explicit heat method,so $|g|\le 1$ exactly for $0\le \mu \le 1/2$. Larger fixed Courant numbers amplify high frequencies. The Backward Euler method gives instead $g=[1+4\mu {\sin }^2(\theta /2){]}^{-1}$ and is contractive for every $\mu \ge 0$.

For $u_t=u_x$, forward time and centered space give $g=1+i\nu \sin \theta$, with $\nu =k/h$. Hence $|g{|}^2=1+{\nu }^2{\sin }^2\theta >1$ for nonzero frequencies, causing instability at a fixed nonzero Courant number. The directionally correct upwind finite difference scheme uses the neighbor at $m+1$ and hasIt is contractive exactly for $0\le \nu \le 1$. This also has a direct maximum-norm proof: the update is a convex combination of two old values. The continuum domain of dependence must fit inside the numerical one for a local explicit hyperbolic method to converge, giving the Courant–Friedrichs–Lewy condition. That necessary geometric restriction is not by itself a sufficient stability proof.

For systems and multilevel methods, each Fourier multiplier becomes a matrix. All amplification roots must obey the appropriate root bound, but their moduli alone are insufficient. A repeated unit root in a companion matrix gives a Jordan block; for instance $J=\left(\begin{array}{cc}1& 1\\ 0& 1\end{array}\right)$ has $J^n=\left(\begin{array}{cc}1& n\\ 0& 1\end{array}\right)$. Even distinct roots require control of the diagonalizing matrices uniformly in frequency and mesh. The uniform power bound from separated amplification roots supplies such control for a bounded two-root family with a positive gap. Question5 illustrates both sides: strict $0<\mu <1$ gives a uniform gap, whereas the endpoints have a double unit root and are unstable despite unit moduli.

Energy estimates are especially useful when coefficients vary or boundaries prevent Fourier diagonalization. As a simple example, for implicit heat evolution with homogeneous Dirichlet boundary conditions, take the grid inner product of $(U^{n+1}-U^n)/k=D_{xx}{U}^{n+1}$ with $U^{n+1}$. Discrete integration by parts givesThe boundary term vanishes because the boundary values are zero, proving contraction. For variable positive diffusion coefficients the corresponding flux-weighted squared differences remain nonnegative, so the argument extends without a constant-coefficient Fourier symbol. With forcing or lower-order terms, a discrete energy inequality and Gronwall inequality yield a mesh-independent finite-time bound.

A related technique is eigenvalue stability analysis of a finite difference method. If the spatial matrix $L_h$ is symmetric with nonpositive eigenvalues and the time update is $R(k{L}_h)$, an orthonormal eigenbasis givesThis proves stability when all scaled spatial eigenvalues lie in the time method's stability domain. For a nonnormal spatial or amplification matrix, the eigenvalues alone do not control powers: ill-conditioned eigenvectors or Jordan terms can cause transient growth. Direct operator-norm estimates, symmetrizers or energy estimates then provide the missing information. In particular an A-stable scalar time formula does not automatically give mesh-uniform bounds for every ill-conditioned family of spatial matrices.

Boundary conditions and starting procedures are part of the discretization. Interior Fourier analysis may fail to detect a growing boundary mode, and a multilevel method can excite a parasitic mode through a poor start. One must therefore analyze the actual finite-domain operator or include its boundary terms in an energy proof. Stability is a uniform error-propagation bound; Fourier symbols, energy identities, matrix norms and spectral analysis are complementary ways of establishing that bound.

Sparse Gaussian elimination seeks a direct solution while preserving the advantage of a small number of nonzeros. The main issue is that eliminating unknowns creates new interactions between the remaining unknowns. For a symmetric positive-definite system, simultaneous row and column permutation merely changes the elimination order, and Cholesky decomposition or LDL decomposition can proceed without pivoting. Partition one elimination step asThe remaining system has the Schur complement $C-b{b}^T/a$. It is positive-definite because, for any nonzero $z$, minimizing the positive quadratic form of $A$ over the first coordinate gives $z^T(C-b{b}^T/a)z>0$. This both justifies the next positive pivot and identifies exactly where fill can appear.

The matrix graph of a symmetric sparsity pattern has one vertex per unknown and an edge $i-j$ when $a_{ij}$ is structurally nonzero. At pivot $k$, the updatecan change an entry only when both $i$ and $j$ are current neighbors of $k$. Thus the elimination graph operation removes $k$ and makes its remaining neighbors a clique. Edges absent before this update are fill-in. The graph describes structural or generic nonzeros: special cancellations in the numerical values can reduce the actual fill, but cannot justify omitting possible entries in advance.

A useful global description is the fill-path criterion for symmetric elimination. After a set $E$ has been eliminated, remaining vertices $i,j$ are adjacent generically exactly when their original graph contains a path from $i$ to $j$ with all internal vertices in $E$. The assertion starts with the original edges when $E$ is empty. Eliminating the next vertex concatenates two earlier such paths through it; conversely, split any allowed path at the newly eliminated vertex to recover the two earlier connections. This induction explains why sparse long-range couplings may eventually become dense.

The order is decisive. For a star with four leaves, eliminating a leaf only changes the diagonal of its sole neighbor and creates no fill. Repeated leaf elimination preserves this property. Eliminating the central vertex first instead connects all four leaves, creating six edges and a dense four-variable trailing system. This occurs, for example, in a positive-definite star matrix with central diagonal $5$, leaf diagonals $2$ and edge entries $-1$; no cancellation removes the new leaf couplings.

For an arbitrary graph, an ordering creates no fill precisely when each pivot's later neighbors are already a clique, namely a perfect elimination ordering. Such an ordering exists exactly for a chordal graph. A chordless cycle of length at least four illustrates the obstruction: its first removed vertex connects its two previously nonadjacent neighbors. Eliminating in a chosen order adds chords until the completed graph is chordal. Thus sparsity of the original matrix alone does not guarantee sparse factors; the graph and its ordering matter together.

If pivot $j$ has $d_j$ later neighbors, its column contains $d_j+1$ factor entries and its symmetric outer-product update costs $O(d_j^2)$ arithmetic. The total storage is governed by ${\sum }_j(d_j+1)$ and the work by ${\sum }_j(d_j+1{)}^2$. A band ordering with matrix bandwidth $b$ gives the familiar $O(Nb)$ storage and $O(N{b}^2)$ work, but a narrow profile or graph separator can do better than a single global band. The minimum degree algorithm greedily chooses a current low-degree pivot; it often keeps immediate updates small, but it must account for previously created fill and need not minimize total fill.

Nested dissection instead finds a small vertex separator, recursively eliminates disconnected subdomains, and leaves separator variables until last. For a regular two-dimensional grid with $N$ unknowns, a separator has $O(\sqrt{N})$ vertices. Its dense final work is $O(N^{3/2})$, and recursive balanced separation givesAt each level the summed separator-square storage is $O(N)$, giving $O(N\log N)$ factor storage over the logarithmic number of levels. These estimates assume the usual geometric separator structure; they are not guarantees for every sparse graph. Independent subdomains also expose parallel work.

In a practical solver a symbolic factorization phase uses the pattern and ordering to allocate factor storage and schedule updates. For the lower-triangular factor, the elimination tree takes the parent of column $j$ to be its first later row index containing a structural nonzero. Descendant updates flow towards those later pivots, making the tree useful for dependency scheduling and the organization of the factorization. Compressed sparse storage records only entries and indices; the numerical phase then computes the values, followed by forward and backward substitution. The factors can be reused for many right-hand sides.

Finally, structural efficiency must be balanced with numerical stability. For a nonsymmetric system the pattern can be represented by a directed or bipartite graph, and elimination creates edges from incoming to outgoing neighbors. Separate row and column permutations are possible. A fill-reducing column ordering does not ensure a safe pivot: scaling and partial pivoting may be needed to prevent division by a tiny number and large growth. Such row interchanges can change the predicted fill. Positive-definite symmetric problems avoid this conflict; general sparse solvers must manage it explicitly. Graph-based ordering controls factor sparsity, while pivoting controls numerical safety; an effective sparse factorization needs both.

Use a basal resource $X_1$, herbivore $X_2$ and predator $X_3$, with positive encounter, conversion and mortality parameters:Only the resource has intrinsic positive growth; the consumers die without food. There is no resource carrying capacity, immigration or feeding on nonadjacent levels. These assumptions define the simplest food chain with Lotka-Volterra equations.

A positive equilibrium would require both $X_2=r/a_1$ and $X_2=d_3/b_2$. Hence three-level coexistence is possible only on the special balance $\kappa =b_{2}r/a_1-d_3=0$. The exact identityfollows by combining $b_{2}d\log X_1/dt$ and $a_{1}d\log X_3/dt$. It gives a useful classification rather than incorrectly postulating a generic coexistence fixed point.

If $\kappa <0$, the top predator cannot invade the underlying resource-herbivore cycle: its average per-capita growth there is $\kappa$. This extinction statement can be strengthened. The boundary equilibrium has $X_{1\ast }=d_2/b_1$, $X_{2\ast }=r/a_1$, $X_{3\ast }=0$. With weights $w_1=1$, $w_2=a_1/b_1$, $w_3=a_1{a}_2/(b_1{b}_2)$, defineDirect cancellation of paired trophic terms gives $\dot{V}=w_3\kappa X_3<0$. Its level sets bound the first two species above and away from zero and bound $X_3$. Integration and uniform continuity imply $X_3\to 0$; the limiting dynamics are the usual resource-herbivore closed orbits, not generally an attracting equilibrium.

If $\kappa =0$, there is a line of positive equilibria: $X_2=r/a_1$, $b_1{X}_1-a_2{X}_3=d_2$. Choosing any positive point on that line gives a conserved coercive version of $V$ with all three relative-entropy terms. Together with the product integral, it confines generic trajectories to closed curves, with neutral oscillations around the equilibrium line. All three can persist, but only under this finely balanced parameter condition.

If $\kappa >0$, the product identity grows without bound, so at least one of $X_1,X_3$ must become unbounded in the unregulated model. There is no bounded persistent three-species attractor. Finite-time blow-up is excluded by a weighted total-abundance bound whose encounter terms cancel and whose derivative is at most a constant times that abundance. The unbounded long-term behavior signals the missing biological resource regulation. The simplest odd chain does not generically permit bounded full coexistence; adding resource self-limitation changes this conclusion.

Use the Unscaled Papkovich–Neuber representationwith harmonic vector and scalar potentials. For a torque-driven sphere chooseIts components are harmonic for $r>a$, and both $\mathbf{x}\cdot \mathbf{\Phi }$ and $\nabla \cdot \mathbf{\Phi }$ vanish. HenceThe last equality follows from the no-slip boundary condition at $r=a$. To check that $\mathbf{G}$ is indeed the applied couple, the traction on the sphere, with $\mathbf{n}=\mathbf{x}/a$ directed into the fluid, is ${\mathbf{\sigma }}_G\mathbf{n}=-3\mu {\mathbf{\Omega }}_G\times \mathbf{n}$. Its hydrodynamic torque isHere $\int \mathbf{nn}dS=(4\pi a^2/3)I$. The applied couple balances this resisting torque. The resulting field is the rotlet of a rotating sphere in Stokes flow.

For the Lorentz reciprocal theorem for Stokes flow, let ${\mathbf{n}}_D$ point out of the fluid domain $D$ and take the same viscosity in both flows. With $\nabla \cdot {\mathbf{\sigma }}_i+{\mathbf{f}}_i=0$, the theorem isIt follows by taking the divergence of the boundary integrand: incompressibility removes pressure-work terms, the two Newtonian strain contractions are equal, and the remaining stress divergences give the displayed body-force terms. This convention matters: on the inner boundary of an exterior domain, ${\mathbf{n}}_D=-\mathbf{n}$.

A constant number star formation rate over $10\mathrm{Gyr}$ produces a uniform present-age distribution. The birth-age distribution under constant star formation therefore givesOutside this age interval the cumulative distribution function is zero or one. The census here retains stellar remnants as objects, as required by the population model.

Write $m=M/M_{\odot }$. The initial mass function is proportional to $m^{-3}$ on $m\ge 0.2$. Normalizing the tail integral gives the power-law initial-mass-function tail coordinate:For lower thresholds $X=1$. Because the birth mass and formation time have independence, the probability integral transform makes $(X,Y)$ uniform on the unit square. $X$ is an upper-tail coordinate, so larger masses have smaller $X$.

A red giant of current age $t$ lies in the stellar lifetime regions in a mass-age diagramThere are no red giants below $m=\sqrt{0.8}$ in this model. For $\sqrt{0.8}<m<1$ the upper boundary is the population's age limit, while for $m\ge 1$ both lifetime boundaries are present. A white dwarf lies above $t/\mathrm{Gyr}=10/m^2$.

In uniform probability coordinates the main-sequence boundary is $Y=20X$ and the end of the giant phase is $Y=25X$. The giant region is therefore $20X\le Y<25X$, clipped to the unit square: it is the triangle with vertices $(0,0),(1/25,1),(1/20,1)$. Its area, and hence the individual giant fraction, isThe white dwarf region $Y\ge 25X$ is the triangle with vertices $(0,0),(0,1),(1/25,1)$, givingThe remaining $97.5\%$ are on the main sequence. Boundaries have zero probability and do not affect these counts. Treating every post-giant object as a white dwarf is a stipulated toy-model assumption; real high-mass stars have other stellar remnants.

For the binary calculations, use a coeval binary population: components share their birth time even though their birth masses are independently drawn and their subsequent evolution is independent. Hence $(X_1,X_2,Y)$ is uniform in the unit cube. At a fixed age coordinate $Y=y$, a component is a giant when $y/25<X<y/20$, and a white dwarf when $0<X<y/25$. Define the conditional state fractionsComponents have conditional independence given $y$; averaging over the common age must be done after forming the conditional pair probabilities. The continuous-birth binary state fractions below are consequently volumes in this cube, not products of the marginal single-star fractions.

The additive Abelian group $G$ is divisible because it is a real vector space. Each convex subgroup $C_n$ is divisible too: for $c\ge 0$ in $C_n$ and a positive integer $m$, its unique additive quotient $c/m$ satisfies $0\le c/m\le c$, hence belongs to $C_n$. Negative elements follow by taking inverses. Thus all $C_n$ are rational vector subspaces, independently of whether the given real scalar multiplication respects the order.

Choose an ordered-group isomorphism ${\theta }_n:C_{n+1}/C_n\to \mathbb{R}$. It is rational-linear, since additive homomorphisms between divisible torsion-free groups preserve division by integers. Extend a rational basis of $C_n$ to one of $C_{n+1}$; equivalently choose a rational-linear section $s_n:\mathbb{R}\to C_{n+1}$ of ${\theta }_n$ composed with the quotient map. ThenSince $C_1=0$ and the union is $G$, each $g\in G$ has a unique expression $g={\sum }_{j=1}^N{s}_j(r_j)$ with only finitely many nonzero coefficients. Define $\Phi (g)=(r_1,r_2,\dots )$. This is an injective additive group homomorphism. If $r_N\ne 0$ is the largest active coefficient, the image of $g$ in the ordered quotient $C_{N+1}/C_N$ has sign equal to that of $r_N$. Convexity ensures that this is also the sign of $g$.

The maximum-support convention for the Hahn group $V({\mathbb{Z}}_{>0},\mathbb{R})$ uses precisely finite supports and the sign of the largest active coefficient. Hence $\Phi$ preserves and reflects the total order, and therefore preserves join and meet. This proves the finite-support Hahn embedding along a countable convex chain. In fact every finite coefficient sequence is obtained, so $\Phi$ is an ordered-group isomorphism in this convention; the requested embedding follows.