An abelian quotient is a quotient group $G/N$ that is an abelian group. It exists only for a normal subgroup $N$, and it is abelian exactly when $N$ contains the commutator subgroup. Thus every abelian quotient factors through the abelianization $G/[G,G]$.

A finite quotient is the image of a group under a surjective group homomorphism to a finite group. A group has no nontrivial finite quotients exactly when every homomorphism from it to a finite group is trivial. This property does not prohibit finite or finite-quotient-bearing subgroups.

Its path algebra is $k[t]$. Finite-dimensional representations are vector spaces with a single endomorphism. Thus oriented cycles can give an infinite-dimensional algebra even when the representations studied are finite-dimensional.

Poisson arrivals of rate $\lambda$ and $s$ independent exponential servers of rate $\mu$ give a birth-death chain with departure rate $\mu \min (n,s)$. The process is positive recurrent for $\lambda <s\mu$, null recurrent at equality, and transient above capacity.

In equilibrium, a queue is quasireversible when its present state is independent of subsequent arrival times and preceding departure times, for each customer class. For an M-M-s queue, detailed balance and time reversal of a continuous-time Markov chain show that past departures become future arrivals generated independently of the present state. This backward independence is useful in tandem calculations where downstream occupancy is determined by earlier departures.

For a $C^1$ flux $F$ and a weak solution of $\mathrm{div}F(Du)=0$, discrete integration by parts and the fundamental theorem of calculus along a line segment show that $w_h={\delta }_{\ell ,-h}u$ solves $\mathrm{div}(A_{h}D{w}_h)=0$, with $p_{-}=Du(x-h{e}_{\ell })$ and $p_{+}=Du(x)$. Coercive quadratic-form bounds and operator norm bounds for $DF$ on all segments between these gradients pass to $A_h$. This produces a divergence-form elliptic operator without initially assuming second partial derivatives of $u$.

For equal-depth layers coupled by an interface,The Laplacian terms are relative vorticity; the streamfunction differences encode opposite layer-thickness changes. Each material derivative follows that layer's own velocity. The sum has a barotropic mode without interface displacement, while the difference contains a baroclinic mode.

For a semiprime $N=pq$ with distinct known primes, this quantum state is uniform over the reduced residue classes. With $n$ binary digits in $N$, its fraction among all $2^n$ computational labels is $a=(p-1)(q-1)/2^n\ge 1/4$. An ancilla qubit whose one probability is $1/(4a)$ dilutes the joint good probability to exactly $1/4$. A reversible range-and-greatest common divisor predicate marks the good labels with ancilla qubit one, and a single exact amplitude amplification iteration produces $|{\xi }_N⟩|1⟩$. Known prime factors provide the cardinality; the membership test itself needs only $N$. Polynomial gate complexity presumes ideal one-qubit rotations at the specified amplitudes.

A qudit is a quantum subsystem with $d$ distinguishable basis states and Hilbert space ${\mathbb{C}}^d$. A qubit is the special case $d=2$. Tensor products of qudits give a natural setting for local Hamiltonians and finite-dimensional quantum circuits.

Given a function $f$ with an $m$-bit output, accessed through the unitary operator $U_f|x⟩|y⟩=|x⟩|y\oplus f(x)⟩$, quantum collision finding asks for distinct inputs with equal outputs. Here $\oplus$ is bitwise exclusive or on the $m$-bit answer quantum register. The distinctness requirement excludes the uninformative pair $(x,x)$. For a two-to-one function on $N$ inputs, Grover search algorithm methods yield a cube-root quantum query complexity, despite a square-root cost for finding a partner of just one preselected input.

Let a Hermitian operator $A$ have dyadic eigenvalues ${\lambda }_j=c_j/2^t$ in $[0,1)$ for known $t$, with controlled access to the unitary operator $U=e^{2\pi iA}$. This interval ensures that different eigenvalues have different eigenphases; exact representability alone would not exclude phase aliasing, as $0$ and $1$ both give phase zero. Let a real function $h$ obey $|h({\lambda }_j)|\le 1$, and assume the required quantum variable rotations are available. Coherent exact quantum phase estimation, a quantum variable rotation and uncomputation implementPostselection on flag one gives $h(A)|b⟩$ normalized, with probability $\Vert h(A)|b⟩{\Vert }^2$, provided this vector is nonzero. Erasing the eigenvalue label by uncomputation is essential to preserve coherence between different eigenvectors. On this dyadic spectrum, $U^{2^t}=I$ gives $U^{-1}=U^{2^t-1}$, so reversing the phase-estimation gates is possible using forward controlled-$U$ calls. The choice $h(\lambda )=\lambda$ multiplies by $A$; a scaled reciprocal gives the different filter used in the HHL algorithm.

Choose eigenphase representatives $0\le {\varphi }_j<1$ for a unitary operator $U$ and a positive integer $M$. Its positive-phase fractional power acts on each eigenstate by $e^{2\pi i{\varphi }_j/M}$. This branch uses arguments in $[0,2\pi )$ and can differ from the usual complex principal branch using $(-\pi ,\pi ]$. For exactly dyadic phases, exact quantum phase estimation stores each label in a coherent phase register; bitwise phase gates multiply it by the required phase, and inverse phase estimation removes the labels. Keeping the phase register unmeasured preserves arbitrary eigenstate superpositions and resets the ancilla qubits. With only controlled-$U$ and controlled-$U^{-1}$ primitives, the direct method uses $2(2^n-1)$ oracle calls for $n$ exact phase bits.

In quantum order finding, a phase $s/r$ produces amplitude $Q^{-1}{\sum }_{x=0}^{Q-1}{e}^{2\pi ix(s/r-j/Q)}$ after an inverse quantum Fourier transform. Its nearest grid point has probability at least $4/{\pi }^2$, by bounding the sine ratio of this finite geometric Fourier amplitude. The initial modular orbit state is an equal-weight superposition of the $r$ phase eigenstates, so the phase label is uniform.

Discarding a subsystem cannot decrease unsquared quantum fidelity: $F({\rho }_A,{\sigma }_A)\ge F({\rho }_{AB},{\sigma }_{AB})$. Maximizing purifications of the joint states are also candidates for purifications of the marginals, with the discarded subsystem included in the reference. Uhlmann's theorem then proves the inequality. Information loss makes the two states at least as similar.

In the unsquared convention, $F({\sum }_x{p}_x{\rho }_x,{\sum }_x{p}_x{\sigma }_x)\ge {\sum }_x{p}_{x}F({\rho }_x,{\sigma }_x)$. Use Uhlmann's theorem to choose component purifications with nonnegative maximizing overlaps, and then construct matching flagged purifications of a quantum ensemble. Their overlap is the weighted sum on the right; the fidelity of the mixtures maximizes over all such overlaps.

Replace the derivative in the Dirac action by the gauge covariant derivative $D_{\mu }={\partial }_{\mu }+iq{A}_{\mu }$. The interaction is then $-q{A}_{\mu }\bar{\Psi }{\gamma }^{\mu }\Psi$. With $\Psi \mapsto e^{-iq\alpha }\Psi$ and $A_{\mu }\mapsto A_{\mu }+{\partial }_{\mu }\alpha$, the covariant derivative transforms in the same way as the spinor, proving local gauge invariance.

In the large-color limit of QCD with $g_s^2{N}_c$ fixed, baryon masses scale as $N_c$ while meson masses remain of order one. A Skyrme model action with coefficients of order $N_c$ has soliton mass and rotational moment of inertia of order $N_c$, and rotor splittings of order $1/N_c$. This motivates a semiclassical mesonic description of baryons; it does not uniquely determine every term in a finite-color effective theory.

For $k$ equiprobable quantum code states decoded by a POVM $\{E_m\}$, testing whether the classical message label agrees with the decoded output gives a joint binary POVM with $F_0={\sum }_m|m⟩⟨m|\otimes E_m$. Its acceptance probability is the decoding success $1-ϵ$ on the joint classical-quantum state and $1/k$ on the product of its marginals. Applying quantum relative entropy monotonicity to this test gives the one-shot classical-quantum coding converse.

For an odd prime $p$, the least quadratic nonresidue $n(p)$ is the smallest positive integer whose nonzero residue class is a quadratic nonresidue modulo $p$.

Two square matrices $A,C$ are congruent when $C=P^{T}AP$ for an invertible matrix $P$. This is the transformation of the matrix of a bilinear form under change of basis, and also transforms a quadratic form under an invertible linear map on its coordinates. The matrices need not be symmetric. It differs from matrix similarity, which uses $P^{-1}AP$ for a linear operator. For real symmetric matrices, completing the square diagonalizes the corresponding quadratic form by matrix congruence.