Logical measurement depth is the number of sequential measurement layers required by outcome-dependent basis choices. Depth one means all bases are fixed in advance, so the quantum measurements on distinct qubits can be simultaneous. Classical output corrections may still depend on all outcomes. This does not assert depth-one graph-state preparation or constant-depth classical processing.

For a bipartite input density operator ${\rho }_{AC}^x$ and a POVM $\{E_y\}$ on $A$, let $q(y|x)=\mathrm{Tr}[(E_y\otimes I){\rho }^x]$. For $q(y|x)>0$, the conditioned input on $C$ isIts positivity follows from the positive sandwich before the partial trace. A quantum channel on $C$ acts on these conditional density operators even if the original input is an entangled state.

A complex measure is a countably additive complex-valued set function on a sigma-algebra. Its total variation norm of a measure is obtained by taking the supremum of sums ${\sum }_j|\nu (E_j)|$ over finite measurable partitions. For finite variation and absolute continuity of measures with respect to a sigma-finite positive measure, the Radon-Nikodym theorem supplies an integrable complex density.

Measurability is the property that inverse images of measurable target sets are measurable in the source space. For a stochastic process, joint measurability in time and sample is a different condition from the separate adaptedness condition at each fixed time. The predictable sigma-algebra and progressive measurability encode particular joint measurability requirements.

The essential range of a real or complex measurable function $m$ consists of the values $z$ whose every neighborhood receives inputs of positive measure:It depends on the measure as well as the function. This definition concerns values arbitrarily near $z$, not necessarily inputs at which $m=z$ exactly. It therefore retains meaningful limiting values while ignoring values occurring only on null sets. ^[ref].

For $m(x)=x$ on $(0,1)$ with Lebesgue measure, the ordinary image of a function is $(0,1)$, but the essential range is $[0,1]$. Neither endpoint is attained, yet inputs with $|m(x)|<\epsilon$ or $|m(x)-1|<\epsilon$ have positive measure for every $\epsilon >0$. Every interior value also belongs to the essential range, although its exact fiber is a singleton of zero measure. Positive measure of a fiber is sufficient, but is not necessary, for a value to belong to the essential range.

The two-sided example $g$ from essential infimum and essential supremum illustrates what disappears. It follows $g(x)=x$ on $[0,1]$, except $g(1/4)=-3$ and $g(3/4)=4$. Its ordinary image of a function is $([0,1]\setminus \{1/4,3/4\})\cup \{-3,4\}$, whereas its essential range remains $[0,1]$. The missing ordinary values $1/4$ and $3/4$ still have arbitrarily close neighbors with positive measure; the exceptional values $-3$ and $4$ can each be isolated by a sufficiently small neighborhood whose preimage is a null set.

For the three-point example in L-infinity norm, the values are $1,3,10$. With weights $(0.5,0.5,0)$ the essential range is $\{1,3\}$; with weights $(0.499,0.5,0.001)$ it is $\{1,3,10\}$. A small but positive probability retains ten, so an essential range does not discard a value merely because it is rare. For a real function on a space of positive total measure, the essential infimum and essential supremum are the lower and upper edges of its essential range, allowing infinite bounds. The L-infinity norm instead takes the upper edge of the essential range of $|m|$.

A useful operator connection is the spectrum of a real multiplication operator: on a nonzero L2 space over a sigma-finite measure, multiplication by a real measurable function $m$ has spectrum equal to its essential range, with the natural domain when $m$ is unbounded. Outside that range, $|m-z|$ has a positive lower bound almost everywhere, so multiplication by $1/(m-z)$ gives an inverse function that is a bounded linear operator. Near an essential value, this lower bound fails. Thus discarding null sets is precisely what makes the range match an operator acting on almost everywhere equivalence classes. ^[ref].

If $f$ is continuous at an interval endpoint, differentiable in its interior, and has a finite one-sided derivative there, then its secant slope and tangent slope are arbitrarily close at some interior point. Apply the mean value theorem on a short endpoint interval; both the secant at its far endpoint and the secant at the resulting intermediate point approach the same one-sided derivative. No continuity of the derivative is required.

If two coupled processes approach each other in L2 and one family of marginals is uniformly tight, then their expectations of any bounded continuous test function approach each other. On a large compact set use uniform continuity; outside it use boundedness; control excessive coupling separation by the second-moment Markov bound. A constant expectation for one process then identifies the other limit. No global derivative or Lipschitz bound is necessary.

If $|b|\le B$, then $2(x-y)(b(x)-b(y))+(\sigma (x)-\sigma (y){)}^2\ge -4B|x-y|$. It cannot also be at most $-k|x-y{|}^2$ for every pair on the real line when $k>0$. Global strict dissipativity thus requires relaxing global boundedness of the drift; linear confining drifts give natural compatible examples.

For an eccentric inner body and circular outer perturber near the reduced $(m+n):m$ period ratio, the leading resonant argument is $\varphi =(m+n){\lambda }_{\mathrm{out}}-m{\lambda }_{\mathrm{in}}-n{\varpi }_{\mathrm{in}}$. Its disturbing function amplitude is of order $e_{\mathrm{in}}^n$. At a mean conjunction, $\varphi =n(\Lambda -{\varpi }_{\mathrm{in}})$; at actual alignment the exact expression is $(m+n)x-my$ with $x=f_{\mathrm{in}}$ and $y=M_{\mathrm{in}}(x)$.

For an unclustered population of fully covering circular disc absorbers, the inverse mean free path is proper number density times mean projected area. A comoving number density must first be multiplied by $(1+z{)}^3$. The incidence then constrains the proper radius; covering factor and multiplicity of detectable lines can change the inference.

The approximate partition function obtained by decoupling each Ising bond has this free energy. The quadratic constant compensates double counting. Its stationary condition is the self-consistency equation; away from stationarity $m$ parametrizes the assumed effective field and need not equal that distribution's mean Ising spin. It agrees at stationary points with the Bragg-Williams free energy of the Ising model, although their off-equilibrium expansions differ.

A product trial distribution with actual mean Ising spin $m$ givesIts entropy is the sum of independent-spin entropies, with $0\log 0=0$. Differentiation gives $k_{B}T\mathrm{arctanh}m=qJm+h$, the self-consistency equation. The variational mean parameter is distinct from the assumed field parameter of the Ising auxiliary mean-field free energy until the equilibrium condition is imposed.

The maximum flow problem with internal vertex capacities reduces to the usual edge-capacitated problem by splitting each constrained vertex into input and output copies. The connecting edge carries its entire through-flow. Feasible flows correspond under this construction, preserving the source-to-sink value; the Ford-Fulkerson algorithm and max-flow min-cut theorem therefore apply to the transformed network.

This maximum flow algorithm repeatedly augments along a shortest residual path found by breadth-first search. Residual distances from the source never decrease. If the same arc becomes saturated again after being restored by a reverse augmentation, the distance to its tail has increased by at least two. Thus each arc is critical only $O(|V|)$ times, yielding $O(|V||E|)$ augmentations. Each search costs $O(|E|)$, so the total time is $O(|V||E{|}^2)$. Termination with no residual source-sink path supplies a max-flow min-cut theorem certificate.

To find the smallest link failure set separating a client from every server, add a common sink with sufficiently large-capacity server arcs and give original links unit capacities in both directions. The max-flow min-cut theorem identifies the minimum failure count $\lambda$. Unit-capacity vertex splitting also charges intermediary node failures. The network tolerates fewer than $\lambda$ failures and fails for some set of $\lambda$ failures. This concerns connection to at least one server, not separate connectivity to each server.

The least size of an infinite maximal almost disjoint family on omega. Zorn lemma extends an infinite disjoint family to a maximal one; thus $\mathfrak{a}\le 2^{{\aleph }_0}$. The bounding-to-almost-disjointness inequality supplies $\mathfrak{b}\le \mathfrak{a}$.

For $f:G\to M_n(\mathbb{C})$ and a degree-$d_{\rho }$ unitary irreducible representation, the matrix Fourier block is the operator $T_{\rho }$ on $M_{n\times d_{\rho }}(\mathbb{C})$ defined in the title. Its singular values ${\lambda }_{\rho ,j}$ satisfyPointwise operator norm at most one implies $\Vert T_{\rho }{\Vert }_{\mathrm{op}}\le 1$. These blocks are operators on a matrix space, rather than simply the entrywise scalar Fourier transform on a finite group without any reshaping.

If $\Vert f(x){\Vert }_{\mathrm{op}}\le 1$ and $\Vert f{\Vert }_{U^2}^4\ge cn>0$, select the singular values ${\lambda }_p\ge \sqrt{c/2}$ of the matrix Fourier blocks. Their weighted count $m={\sum }_p{d}_{{\rho }_p}$ lies between $cn/2$ and $2n/c$. Scaling unit right singular vectors and their corresponding unit left singular vectors by $\sqrt{d_{{\rho }_p}}$ gives matrices $U(p),V(p)$ satisfying ${\mathbb{E}}_{x}f(x)U(p){\rho }_p(x{)}^{\ast }={\lambda }_{p}V(p)$ and Hilbert-Schmidt inner product orthogonality within each chosen irreducible representation. The Schur averaging of rectangular matrices then gives ${\mathbb{E}}_x\Vert UP(x{)}^{\ast }b{\Vert }_2^2=\Vert b{\Vert }_2^2$ for the concatenated $U$ and the corresponding block diagonal matrix $P(x)$.

A matrix preconditioner is an auxiliary invertible matrix whose matrix inverse is cheap to apply and whose use improves the eigenvalues of a linear system. In symmetric positive-definite matrix problems, a symmetric positive-definite matrix $M$ preserves that structure under the symmetric transformation $M^{-1/2}A{M}^{-1/2}$.

Applying $M^{-1}$ means solving $Mz=r$ for a supplied vector $r$. This notation does not require forming a general matrix inverse. A diagonal matrix gives componentwise divisions; a factored matrix gives auxiliary solves such as forward substitution and back substitution.^[ref]

Choosing $M=I$ makes the solve trivial but changes nothing; choosing $M=A$ gives the exact correction but asks us to solve the original linear system.^[ref]

When every entry of a payoff matrix $B$ is positive, its game value $v$ is positive. Setting $x=p/v$ converts the row player's probability vector and guaranteed value into the displayed linear program, whose optimum is $1/v$. Conversely normalizing a feasible $x$ gives a mixed strategy guaranteeing $1/(1^{T}x)$. The dual maximizes $1^{T}y$ under $By\le 1$, $y\ge 0$ and recovers the column strategy by normalization. Adding a constant to every payoff preserves Nash equilibria and lets this positive-payoff formulation handle general finite zero-sum games.