Symmetric-part contraction criterion 2026-10-14
For , differentiation gives . A uniform negative-definiteness bound with yields exponential contraction by direct integration of this differential inequality. This is a sufficient criterion for asymptotic stability, stronger than requiring all eigenvalues of to have negative real parts. A merely semidefinite symmetric part needs additional analysis.
Symmetric positive-definite matrix 2026-10-14
A real symmetric matrix is positive definite when its quadratic form is positive on every nonzero vector. By the spectral theorem, this is equivalent to all its eigenvalues being positive. It has a unique symmetric positive-definite square root.
With equally many initially pure habitats of each allele, symmetry preserves . The heterogeneous equilibrium exists for . Its full-system eigenvalues are in the mean-frequency direction and in the antisymmetric direction, so it attracts general nearby perturbations only for . Exact symmetry can preserve both alleles beyond this robust range; at stronger migration it approaches the unstable uniform midpoint.
For circular reduced deflection , a displacement perpendicular to the radial direction is multiplied by . Vanishing of this eigenvalue gives a tangential gravitational-lensing critical curve. Its source position is , so its caustic is the origin in the circular model. Near it, images are stretched tangentially into arcs or an Einstein ring.
With , the one-loop renormalization-group beta function is . For and , its two nonnegative renormalization-group fixed points are zero and . Differentiating the beta function gives the displayed thermal eigenvalues, so the nonzero point has correlation-length critical exponent to leading order. At the zero eigenvalue requires nonlinear analysis: is marginally relevant for , but the perturbative spin-wave theory has a line of fixed points and omits vortices.
A discrete renormalization group with length factor and positive relevant thermal multiplier sends to and the correlation length to . Combining this with gives the displayed correlation-length critical exponent. The corresponding scaling dimension is . Relevance of discrete multipliers is determined by magnitude relative to one, unlike the sign criterion for continuous-flow eigenvalues.
The scalar Wilson-Fisher fixed point is attractive within its critical surface, but has a relevant thermal direction. With , , and , its one-loop equations are and . Their stability matrix at and has the displayed eigenvalues. Thus an unrestricted claim of infrared attraction is false: the bare mass must be tuned to the critical surface.
A real orthogonal matrix of size three with has an eigenvector of eigenvalue . Its orthogonal complement is invariant, and the restriction there is an orientation-preserving plane rotation. Thus is a rotation about the axis composed with a reflection across the plane perpendicular to . Writing the plane angle as , . A pure plane reflection is the case ; if , it cannot be a pure plane reflection.
Three-mode porous magnetoconvection 2026-10-14
A Galerkin method using one convective streamfunction mode and two Cartesian magnetic flux function modes yields the displayed system. With , use and , time , and . The origin's planar trace is and determinant ; the third eigenvalue is . The stationary threshold is , and the oscillatory threshold is when . They meet in a symmetric double-zero point at . Higher spatial harmonics generated by the quadratic terms are discarded, so this is a projected approximation rather than an exact invariant subspace of the original equations.
Three-qubit bit-flip syndrome table 2026-10-14
Measure the commuting stabilizer generators and in that order. Use error syndrome bit for eigenvalue and bit for eigenvalue . For the Pauli X gate on physical qubit , every row holds for arbitrary normalized . This ordered parity-check convention follows [ref]
https://www.preskill.caltech.edu/ph229/notes/chap7.pdf. Preskill, §7.1
:| Error | State before recovery | eigenvalues | Error syndrome | Recovery |
|---|---|---|---|---|
Each pair of computational basis words within a row has the same two parities. Consequently the projective measurement reveals the row without distinguishing its two amplitudes. For example, becomes under . Both checks give with probability one, and applying restores both coefficients exactly, including the relative phase .
One implementation uses two quantum ancillas initialized to . Two controlled-NOT gates from data qubits 1 and 2 to the first quantum ancilla write their parity; two more from data qubits 2 and 3 to the second quantum ancilla write the other parity. Measuring only the quantum ancillas in the computational basis gives . Measuring the individual data qubits instead would reveal the encoded computational basis value and destroy the unknown quantum superposition. The existing coherent syndrome extraction for the three-qubit repetition code uses the alternative ordered checks , so its bit labels differ from this table.
The recovery also handles coherent errors. Put . Their images of the code are mutually orthogonal, giving , the Knill--Laflamme condition for this family. For any linear combination , its component in sector is . Measuring that error syndrome has probability on the normalized erroneous state, and recovery returns . More generally one recovery quantum channel corrects every noise quantum channel whose Kraus operators belong to this span. The assumption concerns the whole jointly correctable family; it does not extend to the span of arbitrary single-site Pauli errors. [ref]
https://www.preskill.caltech.edu/ph229/notes/chap7.pdf. Preskill, §7.2: correction of an error span
.A fully computed coherent example is the unitary operator . At it givesThe error syndromes and occur with probabilities and , independently of . Doing nothing for and applying for restores the same logical qubit in both branches; the scalar in the second branch is an irrelevant global phase. This is an example of linearity of coherent quantum error correction, rather than an assumption that the original error was a classical random bit flip.
The weighted strain density in Ornstein-Uhlenbeck multiplicative amplification evolves under . Setting eliminates its first derivative. Shifting and scaling to gives . The quantum harmonic oscillator levels yield the displayed eigenvalues. Its ground state is the dominant positive mode; higher sign-changing modes may occur in a transient expansion.
Toral automorphism 2026-10-14
An integer matrix with determinant induces an invertible transformation of the real torus, preserving normalized Haar measure. It is a mixing measure-preserving transformation exactly when none of its eigenvalues is a root of unity. Indeed Fourier frequencies evolve by : a nonzero integer frequency cannot revisit a fixed frequency unless some power has eigenvalue one. Conversely a root of unity gives a nonzero integer vector fixed by a power of , and its nonconstant character obstructs mixing.
Trace-determinant stability criterion Created 2026-09-24 Updated 2026-10-14
For a real Jacobian matrix , both eigenvalue have negative real part exactly whenThe linearization stability theorem then makes a hyperbolic equilibrium locally asymptotically stable.
Trace distance Created 2026-09-24 Updated 2026-10-14
How different can two preparations look to someone who can perform any measurement in quantum mechanics? The trace distance answers this question for density operators on the same finite-dimensional vector space:Here is the absolute value of an operator, and is its trace norm. Because is Hermitian, its trace norm is the sum of the absolute values of its eigenvalues; it is not the sum of the absolute values of its matrix entries. The factor givesThe trace distance is a metric: it is symmetric, vanishes exactly when , and obeys the triangle inequality. Identical preparations have trace distance zero; preparations with orthogonal occupied eigenspaces have trace distance one and can be identified perfectly in a single measurement in quantum mechanics.
Operationally, the trace distance is the largest total variation distance between the outcome probability distributions obtainable by a POVM. Equivalently, the variational characterization of trace distance says it is the largest possible probability gap for one event in a binary measurement in quantum mechanics. For one copy of either known preparation, each chosen with prior probability , the Holevo–Helstrom theorem givesThus trace distance zero leaves only guessing, while trace distance one permits perfect quantum state discrimination. The optimum ranges over measurements; different measurement bases can expose different amounts of distinguishability. [ref]
https://cs.uwaterloo.ca/~watrous/TQI/TQI.3.pdf. Watrous, The Theory of Quantum Information, §3.1, Theorem 3.4 and Proposition 3.5
For a worked example with commuting density operators, take a qubit withTheir difference has eigenvalues , so . Measuring in the computational basis produces outcome probability distributions and , whose total variation distance is also . Guessing on outcome zero and on outcome one succeeds with probability . A projective measurement in the Hadamard basis instead produces for both preparations and gives no discrimination advantage.
The trace-distance contraction under quantum channels ensures that a common quantum channel, including the partial trace, cannot increase the trace distance. This makes trace distance a useful error measure: if , every event in every measurement in quantum mechanics has a probability gap at most . Losing access to a subsystem can hide distinguishability, but cannot create more of it.
Trace distance between qubit states 2026-10-14
For qubit density operators, the trace distance has a particularly simple geometry. Write their Bloch vectors as in the Bloch ball:where is the identity operator and denotes the Pauli matrices. This Bloch vector representation includes both pure states on the Bloch sphere and mixed states in the interior of the Bloch ball. [ref]
The Pauli matrix multiplication law gives . Hence the two eigenvalues of are , and their absolute sum givesThe trace distance is half the straight-line Euclidean distance between the Bloch vectors, not the angular or surface distance along the Bloch sphere. Opposite Bloch vectors have trace distance one; the centre is at trace distance from every pure state.
For the pure states and , the Bloch vectors are and . Their straight-line separation is , soThese Bloch vectors are perpendicular, but the pure states are not orthogonal: . The Helstrom measurement for the zero and plus states measures along the difference direction , rather than along either input Bloch vector.
Trace distance is half a Bloch-vector chord, and the optimal zero-versus-plus measurement follows the difference direction
. Details. Trace distance for qubit dephasing 2026-10-14
For the pure qubit , subtracting the output of dephasing channel leaves a Hermitian matrix with zero diagonal and off-diagonal modulus . Its two eigenvalues are that number and its negative, giving the displayed trace distance. For real , this is .
Traceless second-rank tensor 2026-10-05
A second-rank Cartesian tensor is traceless when the contraction vanishes. For a symmetric second-rank tensor, this is equivalent to its eigenvalues summing to zero. The orientational nematic order parameter is both symmetric and traceless, excluding an isotropic scalar contribution.

