Spin-one maximum-projection eigenvector Created 2026-10-20 Updated 2026-10-25
In the ordered z-projection basis , the normalized eigenvector of with eigenvalue is the displayed vector. It follows by a y-axis rotation of the maximum-weight state, or direct solution of the tridiagonal eigenvalue equation. Squaring its entries gives the three z-projection measurement probabilities.
Spin-one reversal under quadratic anisotropy Created 2026-10-20 Updated 2026-11-05
For a spin-one Hamiltonian , Cartesian basis energies are , and zero along the basis labels. The state combines the latter two basis vectors equally. Their relative phase produces the displayed spin-reversal probability. Complete reversal occurs at odd multiples of if ; when it vanishes those two components remain degenerate. Individual matrix signs depend on basis conventions, while the commutators and physical probability must remain consistent.
Prepare the spin coherent state and evolve with Hamiltonian operator for time . In the descending- basis of the spin-one angular momentum matrices, the initial vector is and the evolved vector is , where . The orthonormal basis has vectors , and . Taking their inner products with the evolved vector gives probability amplitudes , and . Their squared moduli give the Born rule probabilities in the title. At integer half-turns , the outcome is deterministically .
Spin uncertainty state dependence Created 2026-10-14 Updated 2026-10-20
For a qubit, use the dimensionless Pauli matrices as observables , . Their Pauli matrix multiplication law givesThese observables have eigenvalues ; the physical spin components are , where is the reduced Planck constant, so their standard deviations acquire a factor .
In the computational basis, prepare , an eigenstate of with eigenvalue . Direct multiplication givesBoth Pauli measurements return and with equal probabilities, and the Robertson uncertainty principle is saturated: .
Instead prepare . Now the expectation values are , , so , . The Pauli measurement of is certain, and both sides of the bound vanish. The commutator is still nonzero as an operator: noncommuting observables do not guarantee a positive lower bound independent of the quantum state. This example is useful for distinguishing the algebra of the observables from the expectation values in a particular preparation.
Pauli standard deviations, their product, and the Robertson bound in two preparations: the same noncommuting observables give bounds of one and zero
. Details. Splitting probability Created 2026-09-28 Updated 2026-11-05
A Splitting probability is the Probability that a stochastic process reaches one target before competing targets. For a diffusion it is harmonic for the Kolmogorov backward equation, with boundary values one on the selected target and zero on the others.
Sprinkling coupling for Bernoulli percolation Created 2026-10-03 Updated 2026-11-05
For , first sample Bernoulli percolation at parameter , then independently open each remaining closed coordinate with probability . Every coordinate is then open with probability , so the union has the parameter- law. This coupling separates existing -clusters from the additional sprinkled connections between them.
Squared-amplitude diagram Created 2026-10-05 Updated 2026-11-05
A squared-amplitude diagram consists of an amplitude graph and its complex-conjugate graph, with matching external states. Summing an external fermion spin sews the associated spinor indices using a fermion spin sum. The resulting closed spinor chains become gamma-matrix traces. This notation represents probabilities and must be distinguished from adding another physical interaction loop to the amplitude.
Squared discrepancy of a digit frequency Created 2026-10-20 Updated 2026-11-05
If independent trials give a specified digit with probability , its observed fraction is with binomial count . Since and , the mean squared discrepancy is the displayed inverse-sample-size law. Dividing by converts it to a relative squared discrepancy without changing the log-log slope. Nested prefixes are correlated; a single deterministic expansion's plotted discrepancies do not prove that its digits are independent or normally distributed in the number-theoretic sense.
Squared-population near-invariant for stochastic attrition Created 2026-10-14 Updated 2026-11-05
In the jump chain of the symmetric stochastic attrition process, the two possible increments of are and . Their mean is the displayed quantity, bounded by one in absolute value. Subtracting these conditional means produces a martingale. If both initial populations are at most , it has at most nonzero increments, each bounded by . Thus Azuma-Hoeffding inequality controls changes of order with exponentially small probability of order .
Squared quantum fidelity 2026-10-14
This is the square of the unsquared quantum fidelity, another common convention for fidelity of quantum states. If one state is the normalized pure state , thenBy the Born rule, the squared quantum fidelity here is the probability that a measurement in quantum mechanics with acceptance orthogonal projector accepts . For two pure states it is : the comparison of with has acceptance probability and unsquared quantum fidelity .
For two general mixed states, neither quantum fidelity nor squared quantum fidelity is a probability that the states are equal. Equality of two specified density operators is a definite mathematical condition. The measurement characterization of quantum fidelity instead describes overlap between outcome probability distributions. The ensemble average used in reliable quantum source compression is normally the average squared quantum fidelity with the emitted pure state; the convention must be stated when comparing formulas.
Square-lattice one-arm lower bound from disjoint occurrence Created 2026-10-14 Updated 2026-11-05
At density , planar duality gives crossing probability for the -by- lattice rectangle. A self-avoiding left-right crossing passes through one of its middle-column vertices. At that vertex its two halves are disjoint edge witnesses for two copies of the radius- connection event. The BK inequality and the union bound give , proving the estimate.
Square-root bound for increasing events 2026-10-07
For two increasing events of equal probability under a product measure, positive association of their complements gives . Hence . For equal-probability increasing events, the same reasoning gives .
Square-root trick for positively associated events Created 2026-10-05 Updated 2026-11-05
If increasing events have a common probability, applying the Harris-FKG inequality to their decreasing complements gives .
Squeezed-vacuum photon-number moments 2026-10-20
Here . The pair moment is . These expressions follow from the single-mode Bogoliubov transformation or by differentiating the even-occupation probability generating function .
Squeeze rejection sampling 2026-10-25
A lower envelope can save evaluations of an expensive unnormalized target in rejection sampling. Draw with probability density function and an independent uniform distribution value . Accept immediately if . Otherwise draw a fresh independent uniform distribution value and accept ifFor a fixed proposal, writing , and gives total acceptance probability . If , the first stage accepts with probability one and the residual test is skipped. Thus the accepted probability density function is , and the overall acceptance probability is . The probability of avoiding a target evaluation on one proposal is .
Stag hunt Created 2026-10-31 Updated 2026-11-05
The stag hunt is a coordination game with a mutually beneficial risky action and a safer action. A representative two-player payoff matrix isBoth mutual stag and mutual hare are Nash equilibria: neither player can improve by deviating alone. Mutual stag improves both players' payoffs relative to mutual hare, but choosing stag against an uncertain partner can be risky. If the partner chooses stag with probability , stag yields while hare yields three, so stag is a best response exactly when . The example separates mutual gain from assurance that the other player will cooperate.
Standardization of a normal random variable Created 2026-09-24 Updated 2026-10-14
If with , then has the standard normal distribution. The change-of-variables formula for a probability density gives , the standard normal density. Thus standardization of a normal random variable removes both parameters without changing the probabilities of corresponding events.
Standard normal distribution Created 2026-09-24 Updated 2026-10-14
The standard normal distribution is : the normal distribution with mean zero, variance one and standard deviation one. Its standard normal density integrates to one; its standard normal distribution function records the area accumulated from to a threshold. The distinction matters: , , and for a standard normal random variable .
For a toy measurement , leave the measurement unit unspecified. The standardization of a normal random variable converts into standard scores . Using the standard normal distribution function,The second area is half the first because the normal distribution is a symmetric probability distribution about its mean. The numerical heights differ: , yet the corresponding shaded areas are equal because in the change of variables.
Standard normal distribution function Created 2026-09-24 Updated 2026-10-14
The standard normal distribution function is the cumulative distribution function of a standard normal random variable :Here is the standard normal density and is the error function. The symmetric probability distribution gives and , while differentiation gives . For with , standardization of a normal random variable gives ; subtracting two values calculates an interval probability.
Stationarity equations 2026-10-25
For a discrete-time Markov chain with transition matrix , these equations, together with and , say that is a stationary distribution. Incoming probability mass equals the current mass at each state. They are global balance equations and do not require detailed balance.

