For ordered states $q_1<\cdots <q_N$, in the moving frame $\theta =sZ+\xi$ the first and last exponents in the finite-exponential Cole-Hopf solution have the same leading coefficient. Each interior state's coefficient is smaller by $(q_j-q_1)(q_N-q_j)/(4ϵ)>0$. Thus the large-$Z$ moving-frame profile is the two-state shock between the extremes. At fixed $\theta$, the endpoint of largest absolute value dominates; equal opposite extremes leave a stationary shock.

For the local convex action defining the linear workload rate for a local convex action, continuity and the contraction principle for large deviations give workload rate functions. The pointwise bound ${\bar{q}}_B\le q$ makes ${\bar{J}}_B(x)\ge {\inf }_{y\ge x}J(y)=J(x)$ on nonnegative workloads. Constant-rate burst paths produce the reverse bound for x at most B. Values outside the buffer interval are impossible. This statement concerns the rate at the workload value, rather than equality of exact finite-buffer and infinite-buffer stationary distributions.

Use the clipped Lindley recursion $q_{t+1}=\min (B,\max (0,q_t+x_t-C))$ and the weighted cumulative-input topology for a slotted queue. If cumulative past input $S_x(T)\le \lambda T$ eventually with $\lambda <C$, choose a finite $T$ so $S_x(T)-CT<-B$. Starting with a full buffer at time $-T$, the queue must hit zero before the present, since otherwise its final workload is at most $B+S_x(T)-CT<0$. Monotonicity couples all initial workloads by that zero, establishing a finite memory horizon. The same horizon works for sufficiently close input $y$. Since $|x_{-k}-y_{-k}|\le (2k-1)\Vert x-y\Vert$ and clipping is Lipschitz continuous with constant one, the two finite recursions started empty differ by at most ${\sum }_{k=1}^T(2k-1)\Vert x-y\Vert =T^2\Vert x-y\Vert$.

For a complete separated multiplicatively filtered ring with nonnegative integer valuations, a domain associated graded ring makes the original ring a domain: the leading symbols of two nonzero elements have nonzero product. If the graded ring is left Noetherian, lift finitely many homogeneous generators of the graded ideal of a left ideal. Successively cancelling leading terms leaves remainders of increasing valuation. Completeness makes the coefficient series converge, expressing every ideal element as a finite sum of the chosen generators with completed coefficients. The right-handed argument is identical. Completeness is necessary for this infinite cancellation proof.

For an exhaustive nonnegative increasing multiplicative filtration, each left ideal $I$ induces a homogeneous ideal $\mathrm{gr}I$ in the associated graded ring. If that graded ring is a left Noetherian ring, lift a finite homogeneous generating set of $\mathrm{gr}I$ to elements of $I$. For any element of $I$, subtract a combination of these lifts with the same leading symbol; the remainder has strictly lower degree. Induction on the nonnegative degree proves the lifts generate $I$. There is no completion hypothesis because the cancellation terminates in finitely many steps. The analogous result holds for right ideals.

A filtration of a ring is an exhaustive increasing family of additive subgroups $(F_{i}R{)}_{i\in \mathbb{Z}}$, with $1\in F_{0}R$ and the displayed multiplicativity condition. Its associated graded ring is ${⨁}_i{F}_{i}R/F_{i-1}R$. It differs from a probabilistic filtration, which is a nested family of sigma-algebras.

In a filtered colimit in a category of sets, any finite zigzag of generating identifications can be moved to one common stage. The filtered category conditions supply common objects and equalize the finitely many competing arrows. Consequently finitely many representatives and finitely many equalities can be realized simultaneously at one stage. This is the elementwise reason filtered colimits commute with finite limits in sets.

For a diagram of abelian groups indexed by a nonempty directed poset, take the set colimit as classes $[i,x]$, where $[i,x]=[j,y]$ when their images agree at some common later index. Define $[i,x]+[j,y]=[k,D_{ik}x+D_{jk}y]$ at any common upper bound $k$. Directedness and functoriality prove independence of choices. Negation is $-[i,x]=[i,-x]$ and zero is the class of any zero. This is the unique group structure making the canonical maps homomorphisms, and every compatible group cocone factors by a unique homomorphism. Hence the forgetful functor creates these colimits, even when transition maps are not injective.

The transfer function is the filter generating function evaluated on the unit circle, with a sign convention matching the Fourier representation. Filtering a sinusoid of angular frequency $\lambda$ multiplies its complex amplitude by $H_A(\lambda )$. Its modulus is the filter gain; filtering a weakly stationary process multiplies its time-series spectral density by $|H_A(\lambda ){|}^2$. Using the opposite Fourier sign conjugates the response for real coefficients and leaves that squared modulus unchanged.

For standard unknotted spheres contained in four-balls in $X$ and $Y$, the standard fiber-reversing gluing gives the displayed connected sum. The complement of an unknotted $S^2\times D^2$ in $S^4$ is $S^1\times D^3$, and its double is $S^1\times S^3$. The portions of $X$ and $Y$ outside the four-balls remain as connected summands. Taking both ambient manifolds to be the Complex projective plane gives a smooth fiber sum with no symplectic form, by the symplectic connected-sum obstruction.

For a surjective morphism of irreducible varieties, choose an affine neighborhood of the target point and a finite Noether normalization to affine space of target dimension $r$. On an affine source neighborhood the composite fibre is cut out by $r$ functions, so repeated principal hypersurface dimension lemma gives dimension at least source dimension minus $r$ on every component. The normalization fibre is finite. The original fibre is therefore an open-and-closed union of components of that composite fibre, proving the bound without assuming target smoothness. For a reducible source the bound must instead be applied using the dimension of each source component.

For a dominant morphism of algebraic varieties between irreducible varieties, there is a nonempty Zariski-open subset of the target over which every fibre is nonempty and every irreducible component has the displayed dimension. Apply Noether normalization to affine source charts over the target function field and clear denominators on the target to get a generic upper bound. Combine it with the closed-fibre lower bound in the fiber dimension theorem.

For an irreducible source, regard the morphism of algebraic varieties as dominant onto the closure of its image, with generic point $\eta$. The fiber dimension theorem gives the displayed formula. A proper morphism has closed image, so the closure can then be omitted.

Gupta-Bleuler quantization keeps Lorentz covariance by first quantizing all four photon polarizations in an indefinite inner-product space. The condition $({\partial }_{\mu }{A}^{\mu }{)}^{(+)}|\mathrm{phys}⟩=0$, followed by quotienting null states, leaves the two transverse physical polarizations.

The antisymmetric exchange statistics of identical fermions. Interchanging two one-particle labels reverses the total state, and fermionic creation operators anticommute. Occupation of a one-particle mode is therefore zero or one, giving the Pauli exclusion principle; thermal equilibrium leads to the Fermi-Dirac distribution. Color, flavor, spin and orbital factors must together have the required antisymmetry, even if one factor is symmetric.

At the normalized quadratic fixed point $g$, one expanding eigenvalue $\delta >1$ of $D\mathcal{T}(g)$ and a contracting complement give a stable manifold of finite codimension one. A generic one-parameter family crosses that manifold transversely at its cascade accumulation. Its unstable coordinate is initially proportional to parameter distance and multiplies by $\delta$ per renormalization, yielding $s_{\infty }-s_n\sim C{\delta }^{-n}$. Stable components disappear, while the fixed point's orientation-reversing scale $a$ yields signed spatial ratios $a^{-1}=-\alpha$.

// Target: dynamical-systems.bigb

Suppose $g(x)=1+c{x}^d+O(x^{d+2})$, with even $d$ and $c<0$. Expanding the period-doubling renormalization operator exactly at zero gives $a^{d-1}{g}^{\prime }(1)=1$. Approximating globally by $1+c{x}^d$ gives $c\approx a-1$ and $g^{\prime }(1)\approx dc$, hence $d(a-1)a^{d-1}\approx 1$. For $d=2$, $a\approx (1-\sqrt{3})/2$, $g(x)\approx 1-(1+\sqrt{3})x^2/2$ and $\alpha \approx 1+\sqrt{3}$. The coefficient relation is a polynomial-truncation approximation, not an exact identity for the full analytic fixed point.

// Target: numerical-analysis.bigb

An approximate analytic fixed point of the period-doubling renormalization operator can be certified by a frozen Newton correction for a fixed-point equation. A coefficient Banach space, rigorous residual and derivative bounds, and an a posteriori contraction ball give existence and local uniqueness in the full function space. Interval arithmetic controls finite computations; analytic estimates control the infinite coefficient tail.

// Target: dynamical-systems.bigb

A hidden unit transforms input information before the final output rather than directly representing a supplied target. Nonlinear hidden features can make a classification linearly separable in feature space even when it is not separable in the original input coordinates.

Let $S$ be the number of active inputs. Four hidden units $h_m=H(S-m+1/2)$, $m=1,2,3,4$, detect successively larger counts. A binary threshold unit with weights $(1,-1,1,-1)$ on these features and threshold $1/2$ returns one precisely for $S=1,3$. Each hidden input weight is one. This computes parity with a single hidden layer, but representability does not guarantee easy learning by backpropagation.