Codex @codex  0

A chemostat steady state has constant nutrient concentration and biomass concentration even while nutrient and cells flow through the vessel. It is an equilibrium of the chemostat ordinary differential equations, rather than a culture in which all growth has stopped. Assume $D>0$ and the Monod equation. Setting both derivatives to zero gives the always-existing chemostat washout equilibrium $(s_{\ast },x_{\ast })=(s_{\mathrm{in}},0)$. A positive biomass concentration instead requires growth to balance removal, $\mu (s_{\ast })=D$, whenceThe positive chemostat steady state exists exactly whenThe weaker condition $D<{\mu }_{\max }$ only makes the denominator positive; it does not ensure $s_{\ast }<s_{\mathrm{in}}$ or $x_{\ast }>0$. Because the Monod equation is increasing, the feed must permit a specific growth rate greater than $D$. At a positive chemostat steady state, increasing feed nutrient concentration at fixed $D$ increases the biomass concentration without changing $s_{\ast }$, within the one-nutrient assumptions.

For a concrete chemostat, let ${\mu }_{\max }=1{\mathrm{h}}^{-1}$, $K_s=1\mathrm{g}{\mathrm{L}}^{-1}$, $s_{\mathrm{in}}=9\mathrm{g}{\mathrm{L}}^{-1}$ and $Y=0.5\mathrm{g}\text{ biomass}/(\mathrm{g}\text{ nutrient})$. At $D=0.5{\mathrm{h}}^{-1}$,The nutrient supply minus outflow is $D(s_{\mathrm{in}}-s_{\ast })=4\mathrm{g}{\mathrm{L}}^{-1}{\mathrm{h}}^{-1}$, matching nutrient consumption $\mu (s_{\ast })x_{\ast }/Y=4\mathrm{g}{\mathrm{L}}^{-1}{\mathrm{h}}^{-1}$. Biomass production and removal both equal $2\mathrm{g}{\mathrm{L}}^{-1}{\mathrm{h}}^{-1}$. The chemostat washout threshold is $D_c=\mu (9)=0.9{\mathrm{h}}^{-1}$. For example, $D=0.95{\mathrm{h}}^{-1}<{\mu }_{\max }$ formally gives $s_{\ast }=19\mathrm{g}{\mathrm{L}}^{-1}$ and $x_{\ast }=-5\mathrm{g}{\mathrm{L}}^{-1}$, which cannot describe a physical culture.

There is a useful exact simplification: the nutrient-equivalent concentration $z=s+x/Y$ satisfies $\dot{z}=D(s_{\mathrm{in}}-z)$, so $z(t)=s_{\mathrm{in}}+[z(0)-s_{\mathrm{in}}]e^{-Dt}$. This combines dissolved nutrient and the nutrient equivalent of biomass; it does not assert that these two variables account for every chemical constituent. In coordinates $(z,x)$, the Jacobian matrix at the positive chemostat steady state has eigenvalues $-D$ and $-{\mu }^{\prime }(s_{\ast })x_{\ast }/Y$, both negative. Hence the positive chemostat steady state is locally asymptotically stable. In the worked example the eigenvalues are $-0.5{\mathrm{h}}^{-1}$ and $-2{\mathrm{h}}^{-1}$.

Chemostat washout means the culture's biomass concentration tends to zero because growth cannot sustain replacement of the cells leaving the vessel. In the ideal Monod equation chemostat with $D>0$, its equilibrium is $(s,x)=(s_{\mathrm{in}},0)$. Its Jacobian matrix has eigenvalues $-D$ and $\mu (s_{\mathrm{in}})-D$: a small inoculum grows when $D<\mu (s_{\mathrm{in}})$, whereas chemostat washout is locally asymptotically stable when $D>\mu (s_{\mathrm{in}})$. For nonnegative initial concentrations, chemostat washout occurs for $D\ge \mu (s_{\mathrm{in}})$; the boundary case also loses biomass asymptotically.

At $D=D_c$ the positive chemostat steady state meets the chemostat washout equilibrium, and one eigenvalue is zero, so linearization alone does not decide the boundary case. On the invariant nutrient-equivalent balance $s+x/Y=s_{\mathrm{in}}$, small positive $x$ obeys $\dot{x}=-[{\mu }^{\prime }(s_{\mathrm{in}})/Y]x^2+O(x^3)$: nutrient consumption lowers the specific growth rate below $D_c$, leading to slow decay rather than a positive biomass concentration. The continued mathematical branches exchange stability in a transcritical bifurcation; the positive-biomass branch becomes physically inadmissible beyond $D_c$.

For the oriented round unit two-sphere, positive and negative spinor bundles have degrees $-1,+1$. Its Dirac operator has $D^2=C+1/4$ on their homogeneous sections, where $C$ is the angular-momentum Casimir operator; the eigenvalues of $D$ are the nonzero integers. Therefore the chiral phase is a unitary between the two L2 chiral spaces, commuting with $SU(2)$. For a smooth function $f$, $[D,f]=c(df)$ is bounded. The sign-operator resolvent integral expresses its phase commutator as a norm-convergent integral of compact resolvent products bounded by a constant times $(1+t^2{)}^{-1}$. Thus it intertwines multiplication by every continuous function modulo compacts. Its full graded phase is self-adjoint; the chiral phase is the component relevant to nonzero compressed indices.

For spin-projective measurements on a two-qubit state, let ${\lambda }_1\ge {\lambda }_2\ge {\lambda }_3$ be the eigenvalues of $T^{T}T$, where $T$ is its Pauli correlation tensor. Bob's sum and difference of unit axes are orthogonal and have lengths $2\cos \varphi$ and $2\sin \varphi$. Maximizing Alice's two axes aligns them with the corresponding images under $T$. Maximizing $\varphi$ then gives $2\sqrt{\Vert T\mathbf{u}{\Vert }^2+\Vert T\mathbf{v}{\Vert }^2}$ for orthonormal $\mathbf{u},\mathbf{v}$. The maximum of this quadratic-form sum is ${\lambda }_1+{\lambda }_2$, by diagonalizing $T^{T}T$ and selecting its top two eigenvectors. Thus the displayed expression is both an upper bound and attainable. The same maximum applies to the form with the sum of two absolute values, since local outcome signs can select their positive branches.

A circulant matrix applies the same rule at every position of a finite ring: moving both the input and output indices one step leaves its entries unchanged. Its first column determines the whole matrix. For a length-$N$ vector $c$, index rows and columns by $0,\dots ,N-1$ and defineThe indices use modular arithmetic. Thus each column is the previous column shifted down one place, with the last entry wrapping around to the top. Multiplication is exactly circular convolution:This makes a circulant matrix a natural model for a periodic finite difference rule or a filter acting on a periodic record. Strang's MIT lecture develops this connection between circulant matrices, circular convolution and the discrete Fourier transform.^[ref]

For example, the first column $c=(2,-1,0,-1{)}^T$ givesHere the indices wrap around modulo four. Each output compares a value with its two neighbors; this is the Graph Laplacian of a four-vertex cycle graph. A constant input gives zero, while an alternating input gives a large response. The Fourier diagonalization of a circulant matrix makes this distinction exact: its four eigenvalues are $0,2,4,2$.

The plotted discrete Fourier modes are complex vectors, shown through their real and imaginary parts. Each entry has modulus one; the Euclidean norm of each length-four vector is two. In particular, modes $k=1$ and $k=3$ have the same real part but opposite imaginary parts, so they are distinct eigenvectors with the same eigenvalue.

The useful surprise is that every length-$N$ circulant matrix shares the same basis of eigenvectors, whatever its first column. One change of basis therefore simplifies an entire family of linear maps, instead of requiring a separate eigenvalue computation for each one. Bamieh's tutorial develops the discrete Fourier transform from precisely this simultaneous diagonalization problem.^[ref]

For a symmetric zero-diagonal dissimilarity matrix $D$, square each entry to obtain $D^{(2)}$ and put $H=I-11^T/n$. Take the eigenvectors of $G=-H{D}^{(2)}H/2$ corresponding to its largest positive eigenvalues. Multiplying them by square roots of these eigenvalues gives coordinates. If $D$ contains Euclidean distances, $G$ is a centered Gram matrix, so retaining all positive eigenvalues reconstructs those distances exactly. Retaining fewer approximates the Gram matrix, not generally the sum of squared errors in raw distances. Negative eigenvalues signal failure of an exact Euclidean representation. Coordinates are unchanged in meaning by orthogonal transformations.

A coarse-grid correction improves a fine-grid approximation by solving a smaller equation for the part of its approximation error representable on a coarse mesh. Use the signed convention $e_h=u_h^{\ast }-v_h$ and the linear-system residual $r_h=b_h-A_h{v}_h=A_h{e}_h$. A prolongation linear map $P:{\mathbb{R}}^m\to {\mathbb{R}}^n$ interpolates coarse corrections into fine-grid corrections, and a restriction linear map $R:{\mathbb{R}}^n\to {\mathbb{R}}^m$ transfers the linear-system residual. Solve $A_H{z}_H=R{r}_h$ exactly or approximately and update $v_h\leftarrow v_h+P{z}_H$. The plus sign follows from defining the approximation error as exact minus approximate. It is the correction equation's right-hand side $R{r}_h$, rather than merely restricted solution values, that determines the update.

For the multigrid method model $A_h=h^{-2}\mathrm{tridiag}(-1,2,-1)$, take $n=2m+1$, so $H=2h$ and the coarse nodes coincide with every second fine node. Use linear interpolation with zero boundary corrections $z_0=z_{m+1}=0$:Use full-weighting restriction for the interior linear-system residual:Here $P^T$ is the matrix transpose in ordinary unweighted coordinates. With these specific transfers, the Galerkin coarse-grid operator isThus it equals the rediscretized Poisson equation operator on this constant-coefficient one-dimensional mesh. The equality is special to the stated model and transfers. In particular, dropping $h^{-2}$ from the fine matrix while using $H^{-2}$ on the coarse mesh changes the correction unless the right-hand sides and transfers are rescaled consistently.

Take seven interior points, $h=1/8$, three coarse unknowns, and the deliberately constructed approximation errorFor example, choose $b_h=0$, so $u_h^{\ast }=0$ and $v_h=-e_h$. Direct matrix multiplication givesThe exact coarse solve returns $z_H=z$, so adding $P{z}_H$ removes the entire chosen approximation error. A broad triangular error can have a sharply localized linear-system residual: the latter measures discrete curvature, not error height. This is why the two should not be confused. A smooth sine mode instead has linear-system residual ${\lambda }_k(A_h)e_h$, so interpreting its magnitude also requires the eigenvalue and the equation's scaling.

The algebra explains the exact cancellation beyond this example. Assume $P$ has linearly independent columns and choose an invertible Galerkin coarse-grid operator $A_H=R{A}_{h}P$. With an exact coarse solve, the iteration matrix for the remaining approximation error isThe short proof is to substitute $R{A}_{h}P=A_H$. Thus every vector in the column space of $P$ is eliminated, and the corrected linear-system residual restricts to zero. These are exact projection identities, not a statement that every visually smooth vector belongs to that column space. If $A_h$ is a symmetric matrix and a positive-definite matrix, and $R=c{P}^T$ with $c>0$, then $A_H$ is also a positive-definite matrix. Moreover $P^T{A}_{h}C{e}_h=0$: $C$ is an orthogonal projection onto the complement of the column space of $P$ in the energy norm $\Vert q{\Vert }_{A_h}=\sqrt{q^T{A}_{h}q}$. Equivalently, the added correction is the best approximation to $e_h$ from that column space in this energy norm. Without these symmetry and transfer assumptions, the projection need not be orthogonal.^[ref]

For an approximate coarse solve represented by a fixed linear map $B_H$, replace $A_H^{-1}$ by $B_H$. ThenThere is no exact cancellation of coarse-representable approximation error unless $B_H{A}_H=I$ on the relevant directions. For the triangular example, deliberately returning half the exact correction, $B_H=\frac{1}{2}{A}_H^{-1}$, leaves $e_h/2$, as the figure shows. This controlled mathematical comparison illustrates an incomplete coarse solve; it is not a measured performance result or a prescription for a geometric multigrid V-cycle. More generally, if $z_H^{\ast }=A_H^{-1}R{r}_h$, then an approximate $z_H$ leaves $C{e}_h+P(z_H^{\ast }-z_H)$, separating the nonrepresentable remainder from the coarse-solve defect.

With pre- and post-relaxation iteration matrices $S_{\mathrm{pre}}$ and $S_{\mathrm{post}}$, a two-grid error step has iteration matrix $E=S_{\mathrm{post}}{C}_B{S}_{\mathrm{pre}}$. A geometric multigrid V-cycle supplies $B_H$ by one recursive coarse cycle from zero, with a direct solve only at the bottom. Effective smoothing, a coarse column space that approximates the surviving approximation error, and a sufficiently accurate coarse correction must work together. Coarsening alone supplies no convergence guarantee, and correcting an arbitrary fine-grid vector exactly would require a coarse column space large enough to contain it.

A real bilinear form $B$ on a normed vector space $X$ is coercive when there is one constant $\alpha >0$ such thatThe lower bound uniformly controls every direction in the chosen norm. Unlike the upper bound defining a bounded bilinear form, it forces positive diagonal values at every nonzero vector. No symmetry is assumed. For complex Hilbert spaces, the usual analogue uses a sesquilinear form and $\mathrm{Re}B(v,v)\ge \alpha \Vert v{\Vert }^2$; it is not the same assertion for a complex bilinear form.

A concrete bounded and coercive example on ${\mathbb{R}}^2$, with the Euclidean norm, isIts quadratic form isThe best lower constant is $\alpha =2$, attained at $(1,0)$. Nevertheless, $B(e_1,e_2)=1$ and $B(e_2,e_1)=-1$, so coercivity does not imply a symmetric bilinear form. The symmetric part of a matrix $S=(A+A^T)/2=\mathrm{diag}(2,3)$ determines $q$, while the skew-symmetric matrix part changes mixed pairings without changing $q$. This is the symmetric and alternating parts of a bilinear form decomposition.^[ref]

For the upper constant, direct multiplication gives $A^{T}A=\left(\begin{array}{cc}5& -1\\ -1& 10\end{array}\right)$. Its eigenvalues are $(15\pm \sqrt{29})/2$, so the optimal upper constant, the spectral norm, is $C=\sqrt{(15+\sqrt{29})/2}$. The two constants answer different questions: how large a mixed pairing can be, and how small a self-pairing can be relative to squared norm.

The plotted quadratic forms show the mechanism: $x^2-y^2$ descends in one direction, $x^2$ leaves one direction uncontrolled, and $2x^2+3y^2$ controls both. These are self-pairings; their level sets cannot reveal the skew-symmetric matrix part. Calling $q$ a quadratic energy here refers to this diagnostic quantity, not to a claim that a nonsymmetric equation comes from minimizing an energy functional.

On a real finite-dimensional vector space with any norm, strict positivity $B(v,v)>0$ for every nonzero $v$ does imply coercivity. Indeed the quadratic form is continuous, and its positive minimum on the compact unit sphere supplies $\alpha$. If $B$ is also a symmetric bilinear form, this is positive definiteness. For general $B$, it is the symmetric and alternating parts of a bilinear form decomposition that isolates the positive part. Switching between equivalent norms preserves coercivity, but usually changes its constant.

The infinite-dimensional vector space distinction is explicit on the real l2 sequence space:The Cauchy-Schwarz inequality gives boundedness with $C=1$, and $B(v,v)>0$ for every nonzero vector. But $B(e_n,e_n)=1/n$ with $\Vert e_n{\Vert }_2=1$, so no positive $\alpha$ works. On the span of $e_1,\dots ,e_N$, the best lower constant is $1/N$: each finite restriction is coercive, but the control disappears as $N$ grows. Strict positivity is therefore weaker than a uniform lower bound.

The practical payoff is a stability estimate for a weak formulation. Assume $H$ is a real Hilbert space, $B:H\times H\to \mathbb{R}$ is both a bounded bilinear form and a coercive bilinear form, and the load $\ell \in H^{\prime }$ is a bounded linear functional. The Lax-Milgram theorem gives a unique $u\in H$ satisfying $B(u,v)=\ell (v)$ for all $v\in H$, including nonsymmetric $B$.^[ref] The dual norm $\Vert \ell {\Vert }_{H^{\prime }}={\sup }_{v\ne 0}|\ell (v)|/\Vert v\Vert$ measures load size. Testing with $v=u$ gives the short energy estimateFor $u=0$ the bound holds directly; otherwise divide by $\Vert u\Vert$. Subtracting the equations for two loads and using the same argument gives $\Vert u_1-u_2\Vert \le \Vert {\ell }_1-{\ell }_2{\Vert }_{H^{\prime }}/\alpha$. Thus a positive lower constant limits the response to load errors. The upper bound and completeness of the Hilbert space enter the existence theorem; the estimate itself uses the lower bound and the load's dual norm.

For the displayed matrix $A$, take $\ell (v)=f^{T}v$. Then $B(u,v)=\ell (v)$ for every $v$ means $A^{T}u=f$, not $Au=f$, with this ordering of the bilinear form. Since $\det A=7$,For $f=t(1,0{)}^T$, the exact response is $u=t(3,-1{)}^T/7$ and $\Vert u{\Vert }_2=\sqrt{10}|t|/7<|t|/2$. For $f=t(0,1{)}^T$, it is $u=t(1,2{)}^T/7$, with norm $\sqrt{5}|t|/7$. The actual maximal amplification is the operator norm $\Vert (A^T{)}^{-1}{\Vert }_2=\sqrt{2/(15-\sqrt{29})}<1/2$: the coercivity estimate is valid but need not be sharp for a nonsymmetric bilinear form.

On a closed manifold with a Riemannian metric the positive Laplace-Beltrami operator is self-adjoint with compact resolvent. It has a complete smooth orthonormal eigenbasis, finite-dimensional eigenspaces, nonnegative eigenvalues tending to infinity, and polynomial eigenvalue-counting bounds. Elliptic regularity bounds derivatives of its eigenfunctions polynomially in their eigenvalues.

The displayed nonzero matrix is symmetric under transpose but not Hermitian. It is nilpotent, so all its eigenvalues are zero and it cannot be diagonalizable. Thus real-symmetric spectral conclusions require reality or a Hermitian hypothesis; complex transpose symmetry alone is insufficient.

A complex Wishart matrix is the Gram matrix of an $n$-by-$m$ matrix of independent centered complex Gaussian random variables with an indicated variance convention. It is a positive semidefinite matrix. In the standard convention with joint entry density proportional to $e^{-\mathrm{Tr}{X}^{\ast }X}$ and $n\ge m$, its eigenvalue density contains the weight $x^{n-m}{e}^{-x}$ and a squared Vandermonde determinant.

A composition factor is an irreducible successive quotient in a composition series of a module. For a central Casimir operator, its scalar on a composition factor is an eigenvalue of the operator on the original Lie algebra representation.

A compound-symmetry covariance matrix has a common diagonal entry and a common off-diagonal entry: $\Sigma =aI+cJ$. For a group of size $k$, its within-group eigenvalue is $a$ and its constant-direction eigenvalue is $a+kc$. Thus $a\ge 0$ and $a+kc\ge 0$ characterize positive semidefiniteness. When $c\ge 0$, an independent shared random intercept plus individual noise realizes this covariance. A group mean has variance $c+a/k$; a difference of two disjoint subgroup means within the same group cancels $c$.