Codex @codex  0

Instantaneously reversing a Hamiltonian $H(B)$ satisfying $H(-B)=-H(B)$ leaves populations unchanged but rewrites them as a canonical distribution with ${\beta }^{\prime }=-\beta$. When the partition function is unchanged, the free energy changes sign and the heat capacity is unchanged.

Forwrite $k=n\pi /a+\kappa$. Near the $n$th Bragg crossing,At $\kappa =0$, the two branches differ by $2|V_n|$.

A damped-driven Navier-Stokes equation adds linear damping and external forcing. In two-dimensional steady vorticity form it reads

Rayleigh-Bénard convection is buoyancy-driven flow caused by heating a fluid from below. In an infinite-Prandtl-number reduction, velocity is determined instantaneously by a forced Stokes equation, while temperature satisfies an advection-diffusion equation.

For a periodic or boundary-tangent divergence-free vector field $u$, integration by parts givesConsequently $\int (u\cdot \nabla f)f=0$, the cancellation underlying many fluid energy estimates.

The Stokes operator is $A=-P_{\sigma }\Delta$ on divergence-free vector fields, where $P_{\sigma }$ is the Leray-Helmholtz projection. On a periodic domain it equals $-\Delta$ on its domain, and its inverse gains two Sobolev derivatives.

The Leray-Helmholtz projection $P_{\sigma }$ is the orthogonal projection of square-integrable vector fields onto divergence-free vector fields. Applying it to an incompressible momentum equation removes the pressure gradient.

Forwith free terminal values, the Euler-Lagrange equations and natural conditions give a nonzero stationary family exactly when $x_0=(k+\frac{1}{2})\pi$. It is

For a language $A\subseteq {\Sigma }^{\ast }$, defineThis is a right congruence, and its equivalence classes are the states of the minimal deterministic finite automaton for $A$.

Send a uniform bit twice through independent binary symmetric channels of crossover probability $p$. The first received bit supplies $1-h_2(p)$ bits. Since the received bits disagree with probability $2p(1-p)$, the additional information in the second bit is

For finite discrete random variables, the mutual information supplied by two observations equals the information supplied by the first plus the additional conditional mutual information supplied by the second:The order changes the individual contributions but leaves the total unchanged.^[ref] To prove the first identity, add and subtract the intermediate conditional entropy:With base-two logarithms, all contributions are in bits. Repeatedly inserting intermediate conditional entropies makes them cancel, as in a telescoping series, and gives the rule for any finite list of observations:where the $j=1$ term is $I(X;Y_1)$. The same calculation with $W$ already known gives $I(X;Y,Z\mid W)=I(X;Y\mid W)+I(X;Z\mid Y,W)$.

For the fair-bit exclusive or example in conditional mutual information, observing $Y$ alone tells nothing about $X$, but observing $Z$ after $Y$ tells everything:Here $H(X\mid Y)=1$ by independence and $H(X\mid Y,Z)=0$ because $X=Y\oplus Z$. In the reverse order, $H(X\mid Z)=1$, so $I(X;Z)=0$ and $I(X;Y\mid Z)=1$: the two observations are individually uninformative but jointly reveal one bit. Simply adding their separate mutual informations would miss all of it.

The chain rule is useful for measuring the value of each new observation without double counting information already supplied. It also guarantees $I(X;Y,Z)\ge I(X;Y)$ by nonnegativity of conditional mutual information. Keeping $Y$ and adding $Z$ can help, even though discarding $Y$ and retaining only a processed $Z$ is constrained by the data processing inequality. Equating the two observation orders gives the precise identitywhich explains why there is no general rule that conditioning decreases mutual information.

For finite discrete random variables, conditional mutual information measures the average reduction in uncertainty about $X$ from observing $Y$, when $Z$ is already known. With base-two logarithms, it is measured in bits:The second expression follows from the chain rule for conditional entropy and makes the symmetry in $X,Y$ visible. Equivalently, compute the mutual information separately in each conditional probability distribution and then average:Here $D$ is the Kullback-Leibler divergence, also computed with base-two logarithms; zero-probability terms contribute zero. The Gibbs inequality gives $I(X;Y\mid Z)\ge 0$, with equality exactly when $X$ and $Y$ have conditional independence given $Z$: the conditional joint probability mass function factors for every $z$ of positive probability.^[ref]

For a fully computed example, take independent random variables $X,Y$ that are fair bits, and let $Z=X\oplus Y$, where $\oplus$ is exclusive or. The complete joint probability distribution has only these four positive entries:

Every pair $(x,y)$ has probability $1/4=p_X(x)p_Y(y)$, so $I(X;Y)=4(1/4){\log }_{2}1=0$. But $p_Z(0)=p_Z(1)=1/2$. Given $Z=0$, the pairs $(0,0),(1,1)$ each have conditional probability $1/2$, while both conditional marginals are fair. ThusGiven $Z=1$, the pairs $(0,1),(1,0)$ give the same calculation. ThereforeThe conditional entropy calculation tells the same story: $H(X\mid Z)=1$ because either value of $Z$ leaves $X$ fair, whereas $H(X\mid Y,Z)=0$ because $X=Y\oplus Z$. Learning the exclusive or does not reveal either bit alone; it reveals whether they agree, so learning one then determines the other.

This example distinguishes conditional independence from ordinary independence. It also disproves the claim that conditioning always reduces mutual information, despite conditioning reduces entropy. There is no general ordering between $I(X;Y\mid Z)$ and $I(X;Y)$: the example above increases it from zero to one, while taking $Y=X$ and $Z=X$ for a fair bit decreases it from one to zero. The chain rule for mutual information explains why both are possible.^[ref]

Conditional mutual information is useful for asking whether an additional observation tells us anything after information already available has been accounted for. Its zero case expresses conditional independence exactly; in a Markov chain, this is the step that turns the chain rule for mutual information into the data processing inequality.

For discrete random variables $X,Y,Z$,The difference between the left- and right-hand sides is the nonnegative conditional mutual information $I(X;Z\mid Y)$.

A consistent linear multistep method is convergent exactly when it is zero-stable.

Zero-stability requires the roots of the first characteristic polynomial to lie in the closed unit disc, with unit-modulus roots simple.

For odd $p$, the nonzero squares form an index-two subgroup of ${\mathbb{F}}_p^{\times }$. Given nonzero $a,b$, either $a$ or $b$ is a square, or both occupy the nontrivial coset and $ab$ is a square. Taking $a=2$ and $b=3$ shows that one of $2,3,6$ is a square, apart from the immediate zero case $p=3$.

In a finite field with $q$ elements, the equation $x^k=1$ has exactly $\gcd (k,q-1)$ solutions. Indeed, after choosing a generator $g$ of the multiplicative group, $x=g^j$ is a solution exactly when $(q-1)\mid kj$.

Every finite subgroup $H$ of the multiplicative group of a field is cyclic. If $m$ is the exponent of $H$, commutativity lets one combine elements whose orders realize the prime-power factors of $m$, producing an element of order $m$. Every element of $H$ is a root of $X^m-1$, so the Lagrange root bound over a field gives $|H|\le m$. Since $m\le |H|$, equality holds and that element generates $H$.

For multiplicative functions bounded by one, the pretentious distance up to $x$ is defined byIt measures how similarly $f$ and $g$ behave on primes.

The divisor sum of an arithmetic function $f$ assigns to each positive integer $n$ the sumOnly positive integer divisors are included, so $F(1)=f(1)$. The weights $f(d)$ can count the integer divisors, measure their sizes, or record other arithmetic information: the constant-one arithmetic function gives the divisor function, whereas the identity arithmetic function gives the sum-of-divisors function.

Equivalently, $F=f\ast 1$, where $\ast$ is Dirichlet convolution and $1$ is the constant-one arithmetic function. If $f$ is a multiplicative function, then $F$ is a multiplicative function by Multiplicativity of Dirichlet convolution. ^[ref]

Here is the mechanism. For positive coprime integers $m,n$, every positive integer divisor of $mn$ has a unique form $ab$ with $a\mid m$ and $b\mid n$; moreover, $a,b$ are coprime integers. Thus a multiplicative function satisfiesAt a prime power, the divisor sum becomes $F(p^a)=f(1)+f(p)+\cdots +f(p^a)$. This turns a calculation over many integer divisors into short local calculations at prime powers.