Store a Pauli group element with binary exponents $a_j,b_j$ and a phase exponent $s$ modulo four. This ordered $XZ$ convention uses $2n+2$ bits for $n$ qubits. Since $XZ=-iY$, phase factors are essential when converting to Hermitian Pauli operators and evaluating measurement probabilities.

A graph ray is an infinite sequence $v_0,v_1,\dots$ of distinct graph vertices with an edge between consecutive graph vertices. Every infinite connected locally finite graph contains a graph ray from each graph vertex, by the König infinity lemma applied to its finite self-avoiding graph paths. An open graph ray witnesses an infinite percolation cluster.

Paths are edge-disjoint when no graph edge occurs in two of them. They may share internal vertices. If $r$ edge-disjoint client-to-server paths exist, fewer than $r$ failed links cannot destroy them all. For simultaneous link and node failures one instead needs internally vertex-disjoint paths, since one shared internal node could destroy several edge-disjoint paths at once.

This two-sided ideal is spanned by paths of positive length; its $m$th power is spanned by paths of length at least $m$. The quotient is a product of copies of the ground field indexed by vertices. For a finite acyclic quiver, the ideal is nilpotent and equals the Jacobson radical. A loop shows that the equality can fail in general.

For a quiver with finitely many vertices, send a representation of a quiver $(X_i,f_{\rho })$ to ${⨁}_i{X}_i$. Vertex idempotents act as projections, and paths act as composites of the arrow maps. Conversely, a unital module $M$ gives vertex spaces $e_{i}M$ and arrow maps $x\mapsto \rho x$. Compatible vertex maps are exactly module homomorphisms. These constructions give inverse equivalences of categories.

The vertex projective module of a path algebra $P(i)=kQ{e}_i$ has at vertex $j$ the span of paths from $i$ to $j$. Each arrow appends itself to such paths. It is a projective module because it is a summand of the free module $kQ$. Its endomorphism ring is $(e_{i}kQ{e}_i{)}^{\mathrm{op}}$, acting by right multiplication. The closed-path corner of a path algebra is a domain, so this ring has no nontrivial idempotents and $P(i)$ is indecomposable. Directed cycles may make these projectives infinite-dimensional.

Closed paths at vertex $i$ form a basis of $e_{i}kQ{e}_i$. For nonzero finite linear combinations $f,g$, take their largest path lengths $a,b$. In the length-$a+b$ part of $fg$, a concatenated path has a unique cut into lengths $a,b$. Thus a product of nonzero top-degree coefficients cannot cancel, and $fg\ne 0$. The corner is a noncommutative domain and has no idempotents except zero and its identity $e_i$. This argument works with oriented cycles and proves indecomposability of the vertex projective module of a path algebra without falsely assuming that its endomorphism ring is local.

The horizontally integrated plume concentration is the integral of a local concentration $C$ across the plume. It measures scalar amount per unit vertical length and unit span, and its vertical integral is total scalar amount per unit span. Unlike a local concentration, its dimensions include one horizontal length. It must be distinguished from horizontally averaged plume concentration when a plume's width varies with height.

Consider an overdamped particle obeying linear drag in a translating potential energy profile: $\zeta \dot{x}=F(x-vt)$, where $\zeta >0$, $v>0$ and $F(y)=-U^{\prime }(y)$. Assume a finite passing trajectory starts and ends at equal values of $U$.

With $y=x-vt$, the chain rule givesIntegrating between the equal-potential endpoints yieldsThe net displacement is therefore forward, even though the instantaneous force changes sign across a well. The result follows from dissipation and the endpoint condition; compact support of the force alone does not imply equal endpoint potentials.

Writing $u=F/\zeta$ and using $\int udy=0$ gives the equivalent passing-regime identityFor $\Vert u{\Vert }_{\infty }<v$, expanding the denominator gives $\Delta x=v^{-2}\int u^{2}dy+O(v^{-3})$.

For a passing optical trap on a circle of circumference $L$ with nonoverlapping support, a particle that is stationary between encounters receives displacement $\Delta x$ in each encounter. The trap revolution frequency $f_T$ and particle revolution frequency obey $L{f}_p=\Delta x(f_T-f_p)$. This corrects the naive independent-kick estimate when the particle motion changes the encounter rate.

A partition relation whose colored subsets are infinite. For countably infinite arity, choosing representatives modulo finite symmetric difference and coloring its parity shows $\kappa \nrightarrow (\omega {)}_2^{\omega }$ for every infinite cardinal $\kappa$.

The relation $\lambda \to (\lambda {)}_{\beta }^{<\omega }$ requires a subset of size $\lambda$ homogeneous at each finite arity. The constant color may depend on the arity.

Let $R$ be the actual largest pairwise separation of positive masses in their centre of mass frame. The pairwise moment-of-inertia identity gives $m_{(1)}{m}_{(2)}{R}^2/(2M)\le I\le R^2{\sum }_{j<k}{m}_j{m}_k/(2M)$. Consequently the scalar inertia is comparable to $R^2$, independently of configuration.

A primitive recursive pairing function is a pairing function whose encoding function and both coordinate functions of its inverse function are primitive recursive functions. Thus the bijection can be used in either direction inside a construction by primitive recursion and function composition in recursion theory. A decoder that is merely a computable function would not establish this stronger closure property. Sutner's definition of a primitive recursive pairing system explicitly includes the decoding functions; his more general systems need only be injective, whereas a pairing function here is a bijection.^[ref]

The Cantor pairing function is a primitive recursive pairing function. For its encoding, construct the triangular numbers directly by primitive recursion:Since addition is primitive recursive, so are $T$ and $\pi$ by primitive recursion and function composition in recursion theory. This establishes the claim without treating division by two as an unexplained primitive operation.

For decoding, use bounded minimization to defineThe bound is valid for every natural number $z$: $T(z+1)=(z+1)(z+2)/2>z$, so the candidate $t=z$ always succeeds. The search includes zero; when $z=0$, it immediately returns $s(0)=0$. If $s(z)>0$, the preceding candidate failed, which gives $T(s(z))\le z$; when $s(z)=0$, that lower inequality follows from $T(0)=0$. Thus this search finds exactly the diagonal in the Cantor pairing function inverse, withThe comparison is primitive recursive, and bounded minimization of a primitive recursive predicate is primitive recursive. Therefore $s$ is a primitive recursive function. Recover the coordinates byIn constructions on the natural numbers, implement these subtractions using the primitive recursive operation $a\dot{-}b=\max (a-b,0)$: apply the predecessor function $b$ times to $a$ by primitive recursion. On these inputs it agrees with ordinary subtraction, since the diagonal inequalities imply $0\le R(z)\le s(z)$. Consequently $L$ and $R$ are primitive recursive functions, and $\pi (L(z),R(z))=z$. Zimmermann proves the relevant closure under bounded minimization and the primitive recursive character of the Cantor encoding and coordinate decoding; his convention adds the first coordinate, so its coordinates are exchanged relative to $\pi$ here.^[ref]

For a worked bounded minimization, take $z=18$. Candidates $t=0,1,2,3,4$ give $T(t+1)=1,3,6,10,15$, none exceeding $18$. Candidate $t=5$ gives $T(6)=21>18$, so $s(18)=5$, $R(18)=3$, and $L(18)=2$. The search bound was $18$; it terminates much earlier in this example. The bound proves membership in the primitive recursive functions; it is not a claim that scanning all candidates is the fastest implementation.

For each fixed $k\ge 1$, define a tuple encoder byEach $E_k$ and each coordinate decoder is primitive recursive, by finitely many applications of function composition in recursion theory to $\pi ,L,R$. For the three-entry tuple encoded as $257$, applying $R$ returns $4$, applying $L$ returns $18$, and then $L(18)=2$, $R(18)=3$. The tuple length remains part of the agreed convention, as explained for a general pairing function.

This makes primitive recursive pairing functions useful for encoding several evolving values as one state in primitive recursion. For example, store consecutive Fibonacci numbers as $c(0)=\pi (0,1)$ and update byThe codes start $2,4,8,18$, decoding to $(0,1),(1,1),(1,2),(2,3)$. Every step uses primitive recursive encoding, decoding and addition; a single numerical state therefore carries the two values needed for the next step. This is also the reason a suitable Gödel numbering should permit sufficiently simple decoding: representation should preserve the class of functions being studied.

A 3-adic number belongs to the completion of $\mathbb{Q}$ for the p-adic absolute value with prime three. Its nonzero elements have the form $3^{k}u$, with $k\in \mathbb{Z}$ and $u\in {\mathbb{Z}}_3^{\times }$. The cube-class group of the 3-adic numbers is generated by the classes of $3$ and $4$.

For a homogeneous phase function, let $q=|{\nabla }_x\Phi {|}^2+|\theta {|}^2|{\nabla }_{\theta }\Phi {|}^2$ and $L=(iq{)}^{-1}({\nabla }_x\Phi \cdot {\nabla }_x+|\theta {|}^2{\nabla }_{\theta }\Phi \cdot {\nabla }_{\theta })$. Then $L{e}^{i\Phi }=e^{i\Phi }$. The formal transpose of a differential operator $L^t$ lowers the symbol class order by one: the $x$ coefficients have order $-1$, while the order-zero frequency coefficients accompany a frequency derivative.

For an amplitude of symbol order $N$ in $k$ frequency variables, applying a phase integration operator $r>N+k$ times makes the pairing with a test function absolutely integrable. Derivatives of a large-frequency cutoff are supported where $|\theta |\asymp R$ and give an error bounded by $C{R}^{N-r+k}$ times finitely many test derivatives. That error tends to zero, making the resulting distribution independent of the cutoff and of the admissible number of integrations.

For the trigonometric polynomial $F(t)={\sum }_{k=1}^N{b}_{k}e(kt)$, orthogonality of complex exponentials givesIndeed, expand each square and use ${\int }_0^{1}e(jt)dt=0$ for every nonzero integer $j$, and one for $j=0$.

In odd dimension, the map $A\mapsto (\det A)A$ is a surjective group homomorphism from the orthogonal group to the special orthogonal group, with kernel of a group homomorphism $\{I,-I\}$. Scalar matrices commute, and $\det [(\det A)A]=(\det A{)}^{2m+2}=1$. Together with the determinant sign, it identifies $O(2m+1)$ with the direct product of groups $SO(2m+1)\times C_2$. In even dimension, scalar multiplication by $\det A$ does not repair the determinant, so this construction does not give the same splitting.

If a finite planar point set has at most $Kn$ ordinary lines, its points can be covered by $O(K+1)$ possibly reducible cubics. The Euler defect identity for a projective line arrangement gives $O(Kn)$ bad edges in the dual. Bounded-radius propagation of edge defects and averaging select one dual line with $O(K+1)$ unsafe edges. Cubic propagation along a triangular strip covers each safe run; each exceptional intersection vertex represents a primal line, covered by a degenerate cubic containing a line. A dual line with very few intersection vertices instead yields a direct covering by few primal lines.