For , Cauchy-Schwarz inequality applied to and gives the upper bound. Equal absolute coordinate values attain its factor . Expanding gives the lower bound, and a vector with only one nonzero coordinate attains its factor one. Thus both constants are optimal. These Lp norms define the same finite-dimensional topology despite having different unit balls.
An equivalence class representative is any set element belonging to that equivalence class. In the finite modulo-three example, either , or represents . Changing the equivalence class representative changes its name but preserves the equivalence class itself. Choosing gives one representative of an equivalence class from each class; the quotient set consists of the three whole sets.
Equilibrium delay of an Erlang renewal process Created 2026-10-14 Updated 2026-11-05
For inter-renewal times with an Erlang distribution of integer shape and rate , the mean is and survival function is . The equilibrium first-delay density is survival divided by the mean,
This is the equal mixture of Erlang distributions of shapes . It can be constructed by observing a Poisson clock with uniformly randomized phase modulo , whose every th event is a renewal.
Dissociation constant Created 2026-10-14 Updated 2026-11-05
A dissociation constant is an equilibrium constant for a reaction in which a combined species separates into components. For , a concentration convention writes
It has units of concentration. The dimensionless thermodynamic form instead uses thermodynamic activities, . For ideal concentration activities, , with specified standard concentration . The choice of quantity and reference is therefore part of quoting the constant.[ref]
In the simple dilute model with free held fixed, the fraction of B present as AB is . A smaller therefore means more association at the same free concentration. The inverse association constant describes the reversed reaction only when conventions, solvent conditions and temperature match. A dissociation rate is a kinetic quantity and is not specified by this equilibrium ratio alone.
Interval discrepancy 2026-10-14
Interval discrepancy measures the difference between empirical counts and the expected count for normalized Lebesgue measure. Convolving an enlarged interval indicator function with a narrow unit-integral indicator function gives a continuous majorant. Its Fourier coefficients decay as , converting the count into a constant term, finite exponential sums and a controlled absolute tail.
The sequence is equidistributed in precisely when for every nonzero integer pair . Equivalently are rationally independent. Under that condition, nonconstant character averages tend to zero by the geometric-series formula. Uniform approximation by trigonometric polynomials gives convergence for continuous functions, and continuous upper and lower bounds give convergence for rectangles. If a character is resonant, the orbit lies in its proper closed kernel and misses a positive-area rectangle, so equidistribution fails.
Entropy power inequality 2026-10-14
For independent -dimensional random vectors with densities and finite differential entropies, the entropy power inequality states
The sum's differential entropy is required to be defined; a value makes the inequality immediate. Equality for finite nondegenerate densities occurs for Gaussian distributions with proportional covariance matrices.
Logarithmic Sobolev inequality Created 2026-10-14 Updated 2026-11-05
A probability measure with a Dirichlet form satisfies a logarithmic Sobolev inequality with constant if
for every in the domain of the Dirichlet form. The entropy functional measures how far is from a constant, while the Dirichlet form measures its spatial variation. For a symmetric Markov semigroup with generator , the convention is when this expression is defined.
For standard Gaussian measure, and Gaussian integration by parts gives . The Gaussian logarithmic Sobolev inequality has optimal constant two in this convention. Rescaling the Dirichlet form rescales the constant inversely, so a numerical constant needs its energy convention. The logarithmic Sobolev inequality implies hypercontractivity and also supports concentration inequalities through the Herbst argument.[ref]
// Target: analysis.bigb
The displayed supremum norm is finite on every entire function, positive on every nonzero one by the identity theorem, and submultiplicative under pointwise multiplication. It is not complete: partial geometric sums are Cauchy on the disk but their limit there extends meromorphically with a pole at two. More generally, no complete algebra norm exists on all entire functions because the coordinate function has algebraic spectrum of an element equal to the whole complex plane.
For a bipartite pure state, the squared Schmidt coefficients are the nonzero eigenvalues of either reduced density matrix. Their sum except the largest defines . The largest eigenvalue is a convex function, since ; consequently is concave. If Alice measures locally and records outcome , Bob's conditional reductions satisfy . Concavity gives . For Bob's measurements use Alice's unchanged average reduction instead. Iteration proves average monotonicity under LOCC. For Schmidt rank at most two, is the smaller squared Schmidt coefficient. A conversion succeeding with probability therefore obeys , since failure branches contribute nonnegative amounts.
The relative entropy of entanglement is the smallest quantum relative entropy from a density operator to a separable quantum state, with the separable set specified for the relevant division into parties. Nonnegativity of quantum relative entropy implies . For a separable quantum state, choosing gives . For finite-dimensional bipartite states, compactness of the separable set and lower semicontinuity of the relative entropy give the converse. The support convention is unless .
For nonnegative with , Alice applies Kraus operators and to one half of a Bell state. Their squared effects sum to the identity, and both outcomes have probability one half. The first branch is the target; the second becomes the target after both parties apply Pauli X gates. Sending the outcome by classical communication makes this exact deterministic entanglement dilution, rather than a postselected conversion.
Exact dilution obstruction from Schmidt rank Created 2026-10-14 Updated 2026-11-05
Let three parties share the normalized quantum state
For copies, group each party's qubits together. Across any nontrivial division of these three parties, the Schmidt decomposition has one nonzero coefficient for every binary string of length , so its Schmidt rank is . Similarly, copies of the standard GHZ state have Schmidt rank across the same division.
Every recorded LOCC branch acts by a product of local Kraus operators. Schmidt-rank contraction under product operators therefore rules out an exact successful conversion when , even if success need only have nonzero probability. This is a rank obstruction for the full target, not merely a bound on its entanglement entropy.
Approximation changes the question. In the expansion of , squared coefficients have the binary-product distribution with parameter . A quantum typical subspace retains weight tending to one while using only strings, where is binary entropy. The normalized truncation approaches the full target in quantum fidelity, although its Schmidt rank can be far smaller than . Consequently, the exact finite-copy rank argument does not forbid an asymptotic entanglement dilution protocol with vanishing approximation error.
Schmidt projection entanglement concentration Created 2026-10-14 Updated 2026-10-20
For copies of a normalized pure state , regroup Alice's and Bob's tensor factors. Alice performs a projective measurement of the total number of zeroes, preserving all coherence among strings with that count. The outcome has binomial distribution
Each retained string has the same complex amplitude , so, up to a common phase, the conditional quantum state is
Its equal Schmidt coefficients make it a maximally entangled state of Schmidt rank . Alice sends the count to Bob. They can relabel the corresponding local computational basis strings with local unitary operations, and convert the resulting resource to Bell pairs. Measuring the individual bits instead would reveal the entire string and leave a product state.
Monotonicity of the explicit update requires on its invariant state interval. Convexity and a unique sonic point of a scalar flux do not remove this time-step restriction. For , linearization about a positive constant gives an upwind finite difference scheme for advection equation: , where . At Fourier frequency the multiplier is , whose modulus exceeds one when . Thus a CFL condition is essential to the claimed nonlinear stability.
For a time-independent symmetric negative semidefinite boundary matrix , the difference of two linear elasticity solutions with the same data has traction . Integration by parts conserves the displayed nonnegative energy. Zero initial data force zero velocity and then zero displacement. The matrix is the stiffness of boundary springs to a prescribed support; null directions are traction-free.
Monotonicity bound for a mixed-censoring likelihood Created 2026-10-14 Updated 2026-11-05
Suppose three exact event times coexist with a right-censored time and an interval , ordered as . Set and . Monotonicity bounds the three event masses by , and , while . Thus the mixed-censoring likelihood is bounded by the displayed expression. Equality is attained by putting all mass at . The reduced log-likelihood is strictly concave for , and its stationary equations yield , . The fitted masses are , , .
Partition the time axis into cells on which membership in each observed exact-event or censoring set is constant. Let be a cell's probability mass and indicate whether cell is permitted by observation . The empirical likelihood has the displayed form, with nonnegative masses summing to one. Columns of that agree can be combined. If column is componentwise dominated by another column , moving all mass from to cannot reduce any factor, so an unconstrained nonparametric maximum-likelihood estimator can omit column . The remaining log-likelihood is a concave function of the masses. Extra constraints can prevent a domination move; for a fixed survivor function value, split cells at the constrained time and retain the associated linear mass constraint.
Empirical distribution process Created 2026-10-14 Updated 2026-11-05
The empirical distribution process is the centred, scaled empirical distribution function of an independent sample with cumulative distribution function . Its mean is zero and its covariance is . This follows by expanding the two indicator averages: different sample indices have zero covariance, while the same index contributes the covariance of the two nested events. The scaling by keeps these covariances independent of .
This goodness-of-fit criterion integrates the squared difference between the empirical distribution function and a specified continuous null distribution. Under a fully specified null, the probability integral transform makes its law distribution-free; its limiting law is for a Brownian bridge. Parameter fitting changes that calibration.

There are unlisted articles, also show them or only show them.