Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Large-deviation variational mechanics and ensemble inequivalence

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite-alphabet mean-field probability ensembles

Definition

Let A be a finite nonempty alphabet, let p=(p(a))a∈A be a probability vector with p(a)>0 for every a, and write Δ(A):={q∈[0,1]A:∑a∈Aq(a)=1} with the metric d1(q,r):=∑a∈A∣q(a)−r(a)∣ and its induced topology, called the ℓ1 topology. This is a metric: symmetry, nonnegativity and separation follow coordinatewise, and the triangle inequality follows by summing ∣q(a)−s(a)∣≤∣q(a)−r(a)∣+∣r(a)−s(a)∣. For each integer n≥1, the configuration space is Ωn:=An with the full power-set σ-algebra. Its reference probability is the product law p⊗n, which gives the word xn=(x1,…,xn) mass ∏i=1np(xi). By The finite product law has iid coordinate maps, this mass assignment is normalized and is a probability law; explicitly, ∑xn∈An∏i=1np(xi)=∏i=1n∑a∈Ap(a)=1. The empirical macrostate is the probability vector Ln(xn)(a):=1n#{i∈{1,…,n}:xi=a},a∈A. Thus Ln is the empirical type defined by the finite-alphabet supplier.

For a continuous function h:Δ(A)→R and a real parameter β, define the finite canonical normalizer and word law by Zn,β:=∑xn∈Ωnp⊗n(xn)e−nβh(Ln(xn)),pn,β(xn):=p⊗n(xn)e−nβh(Ln(xn))Zn,β. The normalizer is finite and positive because the sum is finite and every summand is finite and positive. The canonical macrostate law is the probability measure on Borel subsets B⊆Δ(A) that assigns mass pn,β({xn∈Ωn:Ln(xn)∈B}).

For a real-valued function f on a nonempty set S, define argmin⁡x∈Sf(x):={x∈S:f(x)=inf⁡y∈Sf(y)} and argmax⁡x∈Sf(x):={x∈S:f(x)=sup⁡y∈Sf(y)}; either set is empty if the corresponding extremum is not attained. For q∈Δ(A), set D(q∥p):=∑a:q(a)>0q(a)ln⁡q(a)p(a), omitting zero-mass terms, as in the finite relative-entropy convention. For u∈h(Δ(A)), define the constrained cost, entropy, canonical variational set, and constrained variational set by d(u):=inf⁡q∈Δ(A):h(q)=uD(q∥p),s(u):=−d(u), Mβ:=argmin⁡q∈Δ(A)[D(q∥p)+βh(q)],Mu:=argmin⁡q∈Δ(A):h(q)=uD(q∥p). For A⊆Ωn and an event E⊆Ωn with p⊗n(E)>0, define the conditional probability by p⊗n(A∣E):=p⊗n(A∩E)/p⊗n(E). For δ>0, the microcanonical shell event is En,δ,u:={xn:∣h(Ln(xn))−u∣<δ}. Whenever p⊗n(En,δ,u)>0, its microcanonical shell law is the conditional probability p⊗n( ⋅∣En,δ,u).

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Compact-space Laplace principle and exponential tilting

Statement

Let (K,dK) be a nonempty compact metric space and let (μn)n≥1 be Borel probability measures on K. Let I:K→[0,+∞] be lower semicontinuous, meaning that {x∈K:I(x)>a} is open for every real a, and not identically +∞. Assume the speed-n large-deviation bounds lim inf⁡n→∞1nln⁡μn(G)≥−inf⁡x∈GI(x)for every open G⊆K, lim sup⁡n→∞1nln⁡μn(C)≤−inf⁡x∈CI(x)for every closed C⊆K, with inf⁡∅=+∞ and ln⁡0=−∞. Let F:K→R be continuous and put Zn:=∫KenF(x) dμn(x),c:=sup⁡x∈K(F(x)−I(x)). For Borel B⊆K, define the normalized exponential tilt νnF(B):=Zn−1∫BenF(x) dμn(x). Here a good rate function is a lower semicontinuous map J:K→[0,+∞] whose sublevel sets {x:J(x)≤a} are compact for every real a. Then Zn is finite and positive, lim⁡n→∞1nln⁡Zn=c, and (νnF) satisfies a speed-n large-deviation principle with the good rate function IF(x):=I(x)−F(x)+c. Its zero set is precisely argmax⁡x∈K(F(x)−I(x)):={x∈K:F(x)−I(x)=c}, with F(x)−(+∞):=−∞.

Facts & Assumptions

Given: The compact metric space, measures, rate function, LDP bounds, and continuous tilt in the Statement.

[A1]

The LDP hypothesis is the open-set lower bound and closed-set upper bound written in the Statement, at speed n.

[A2]

K is nonempty compact metric, I is lower semicontinuous in the superlevel-set sense defined in the Statement with at least one finite value, and F is continuous. Here compactness means that every cover of K by sets open in its metric topology has a finite subcover. For an extended-real function f, upper semicontinuity means that {x:f(x)<a} is open for every real a.

Proof

1.1A2choose

For each integer m≥1, put Um:={x∈K:∣F(x)∣<m}. These sets are open by continuity of F: if x∈Um, continuity gives a neighborhood on which ∣F(y)−F(x)∣<m−∣F(x)∣, hence ∣F(y)∣<m. They cover K because every real ∣F(x)∣ is less than some positive integer. By the finite-open-cover meaning of compactness in [A2], finitely many Um1,…,Umk cover K, with k≥1 since K is nonempty. Let M:=max⁡{m1,…,mk}; then −M<F(x)<M for every x∈K. Thus F is bounded above and below. This uses the explicitly defined cover and a maximum of finitely many integers, without any simultaneous choice of pointwise neighborhoods. Since I is not identically +∞, choose x0∈K with I(x0)<+∞. Therefore F(x0)−I(x0)≤c≤sup⁡KF<+∞, so c is finite. The integrand enF is bounded above and bounded below by the positive constant eninf⁡KF, and μn is a probability measure, hence 0<Zn<+∞ and νnF is a probability measure.

1.2A1A2algebra

Let G⊆K be open, let x∈G with I(x)<+∞, and let ε>0. Continuity of F gives an open neighborhood U with x∈U⊆G and F(y)>F(x)−ε for every y∈U. Hence ∫GenF dμn≥en(F(x)−ε)μn(U). By [A1], the logarithm of this integral divided by n has liminf at least F(x)−ε−inf⁡UI≥F(x)−ε−I(x). Taking the supremum over finite-rate x∈G and then ε↓0 proves the open-set integral lower bound lim inf⁡nn−1ln⁡∫GenF dμn≥sup⁡x∈G(F(x)−I(x)).

1.3A1A2choosealgebra

Let C⊆K be closed and put cC:=sup⁡x∈C(F(x)−I(x)), with sup⁡∅=−∞. If C=∅, its integral is zero and the required bound is immediate. Since F is bounded and I≥0, either cC is finite or cC=−∞. Suppose first that cC is finite, and fix ε>0. For each x∈C with I(x)<+∞, lower semicontinuity of I and continuity of F give an open neighborhood Vx on which F≤F(x)+ε and I≥I(x)−ε. Choose a ball Ux centered at x with U‾x⊆Vx. For each x∈C with I(x)=+∞, choose M>sup⁡KF−cC+1; lower semicontinuity gives an open neighborhood Vx on which I>M, and choose such a ball Ux. Take the family of all centered balls satisfying these conditions; it covers C. A closed subset C of compact K is compact: adjoining K∖C to any relative open cover of C gives an open cover of K. Thus finitely many admissible balls suffice, and only finitely many centers and neighborhood witnesses are selected. Put Cj:=C∩U‾xj for the resulting centers. Each Cj is closed. At a finite-rate center, sup⁡CjF−inf⁡CjI≤F(xj)−I(xj)+2ε≤cC+2ε; at an infinite-rate center, sup⁡CjF−inf⁡CjI≤sup⁡KF−M<cC−1. The integral over C is bounded by the finite sum ∑jensup⁡CjFμn(Cj). Applying [A1] to each closed Cj and using that a finite sum has logarithmic limsup no greater than its largest summand gives lim sup⁡n1nln⁡∫CenF dμn≤cC+2ε. Letting ε↓0 proves the localized bound in this case. If cC=−∞, every point of C has infinite I. For any real M, lower semicontinuity gives, at each x∈C, an open neighborhood Vx with I>M; take all centered balls with closures in such neighborhoods and then a finite subcover of C. The corresponding closed pieces Cj then satisfy sup⁡CjF−inf⁡CjI≤sup⁡KF−M. The same finite-sum and LDP argument gives a logarithmic limsup at most sup⁡KF−M. Since M is arbitrary, this limsup is −∞=cC. Thus in all cases lim sup⁡n1nln⁡∫CenF dμn≤sup⁡x∈C(F(x)−I(x)).

2.1A2step 1.1step 1.2step 1.3algebra

Taking G=K in step 1.2 and C=K in step 1.3 gives lim inf⁡nn−1ln⁡Zn≥c and lim sup⁡nn−1ln⁡Zn≤c, proving the log-Laplace limit. The function IF=I−F+c is lower semicontinuous, is nonnegative by the definition of c, and has compact sublevel sets because those sets are closed in compact K. To prove attainment, set f:=F−I, which is upper semicontinuous and bounded above by sup⁡KF. For every integer k≥1, the set Ak:={x∈K:f(x)≥c−1/k} is closed and nonempty by the definition of c; these sets are nested. Compactness gives ⋂k≥1Ak≠∅: otherwise their open complements would cover K, and a finite subcover would contradict that a nested finite intersection is nonempty. Every point of this intersection has f(x)≥c−1/k for all k, hence f(x)≥c and therefore f(x)=c. Equality IF(x)=0 holds exactly when F(x)−I(x)=c, so its nonempty zero set is precisely the stated maximizing set.

3.1step 1.2step 2.1algebra

For open G⊆K, apply the open-set integral lower bound from step 1.2 and subtract the log-normalizer limit in step 2.1. Since sup⁡G(F−I)−c=−inf⁡GIF, this is the LDP lower bound for νnF.

4.1step 1.3step 2.1algebra∎

For closed C⊆K, apply the closed-set integral upper bound from step 1.3 and subtract the log-normalizer limit in step 2.1. Since sup⁡C(F−I)−c=−inf⁡CIF, this is the LDP upper bound for νnF.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite-alphabet mean-field ensembles and upper supporting lines

Statement

Let A be finite and nonempty, let p(a)>0 for every a∈A, and let h:Δ(A)→R be continuous, where Δ(A) is the probability simplex with its ℓ1 topology. Let Ln be the empirical probability vector of an n-word drawn from p⊗n, and use D(q∥p)=∑a:q(a)>0q(a)ln⁡(q(a)/p(a)) with zero-mass terms omitted. For β∈R, the canonical word law weights xn proportionally to p⊗n(xn)e−nβh(Ln(xn)).

The canonical macrostate law of Ln satisfies a speed-n large-deviation principle with rate Rβ(q)=D(q∥p)+βh(q)−mβ,mβ:=min⁡r∈Δ(A)[D(r∥p)+βh(r)]. Thus its canonical equilibrium macrostate set is Mβ=argmin⁡q∈Δ(A)[D(q∥p)+βh(q)].

For u∈h(Δ(A)), let d(u):=min⁡h(q)=uD(q∥p), s(u):=−d(u), and Mu:=argmin⁡h(q)=uD(q∥p). If there is a sequence δj↓0 for which inf⁡∣h(q)−u∣<δjD(q∥p)=inf⁡∣h(q)−u∣≤δjD(q∥p)for every j, then the iterated microcanonical shell limit exists and is lim⁡j→∞lim⁡n→∞1nln⁡p⊗n ⁣(∣h(Ln)−u∣<δj)=s(u). In the same iterated limit, for every open neighborhood U of Mu, lim⁡j→∞lim sup⁡n→∞p⊗n ⁣(Ln∉U∣∣h(Ln)−u∣<δj)=0. Finally, h(Mβ)=argmax⁡v∈h(Δ(A))[s(v)−βv], and a macrostate q is canonical at β exactly when q∈Mh(q) and h(q) maximizes s(v)−βv. Equivalently, u is a canonical energy at β exactly when v↦s(u)+β(v−u) is an upper supporting affine function for s on the whole energy range. An energy with no upper supporting line for any slope is not realized by a canonical ensemble.

Statement references

Facts & Assumptions

Given: A finite nonempty alphabet, a full-support reference probability p, a continuous energy-density map h, the finite product laws, and β∈R.

[F1]

Finite-alphabet mean-field probability ensembles: Δ(A) is the ℓ1 probability simplex, Ln is the empirical type under p⊗n, D(q∥p) has the finite full-support convention in the Statement, the canonical word law is the normalized weight p⊗ne−nβh(Ln), and the shell event is ∣h(Ln)−u∣<δ.

[F2]

Finite-alphabet Sanov bounds on the support simplex: if S=supp⁡(p) and Δ(S) is its support simplex, the empirical type laws under p⊗n satisfy the open-set lower and closed-set upper large-deviation bounds at speed n with rate D(q∥p); because p has full support, S=A.

[F3]

Compact-space Laplace principle and exponential tilting: for a speed-n LDP with rate I on a compact metric space and continuous F, n−1ln⁡∫enF dμn→sup⁡(F−I), and the normalized exponential tilt has rate I−F+sup⁡(F−I).

[F4]

Finite relative entropy is continuous on a simplex with positive reference law: for a finite alphabet and a full-support reference p, q↦D(q∥p) is finite and continuous on the whole simplex, including its boundary.

[F5]

Nonnegativity and equality for finite classical relative entropy: for probability vectors q,p on a finite set, D(q∥p)≥0, with equality exactly when q=p.

[F8]

Proof

1.1F1F2F3F4F5F6F7F8algebra

Enumerate A={a1,…,ad}, with d≥1, and identify RA with Euclidean Rd. Write ∥x∥1:=∑i=1d∣xi∣ and ∥x∥2:=(∑i=1dxi2)1/2; the declared ℓ1 topology on the simplex is the topology from ∥⋅∥1. The simplex is closed because it is the intersection of the closed coordinate constraints 0≤q(ai)≤1 and the closed affine constraint ∑iq(ai)=1; these are closed since coordinate maps and their finite sum are continuous. It is bounded because ∥q∥22=∑iq(ai)2≤∑iq(ai)=1. By [F6] it is compact in the Euclidean topology. For every x∈Rd, ∥x∥2≤∥x∥1 because (∑i∣xi∣)2≥∑ixi2, and ∥x∥1≤d∥x∥2 because ∑i∣xi∣≤dmax⁡i∣xi∣≤d∥x∥2. These inequalities show that the Euclidean and ℓ1 metrics have the same open sets, so the simplex is compact in its declared topology. By continuity of h and D, each fiber h−1({u}) and each sublevel set {q:D(q∥p)≤r} is closed in the simplex and hence compact by [F7]. The continuous-image and extreme-value conclusions in [F8] therefore apply to these sets. In particular, [F4] makes q↦D(q∥p)+βh(q) continuous on the compact simplex, so it attains a finite minimum mβ. The rate D is nonnegative by [F5]. The empirical macrostate law under p⊗n has rate D(q∥p) by [F2]. For every Borel B⊆Δ(A), the canonical macrostate probability is exactly pn,β(Ln∈B)=∫Be−nβh(q) dμn(q)∫Δ(A)e−nβh(q) dμn(q), where μn is the base law of Ln; this follows by summing the word weights in [F1] over the fiber Ln−1(B). Thus it is the tilt in [F3] with F=−βh, and its rate is D+βh−mβ. Its zero set is Mβ. Let U be any open neighborhood of Mβ and put C:=Δ(A)∖U. If C=∅, the probability of the complement is zero. Otherwise C is a nonempty closed subset of the compact simplex, hence compact by [F7]. The continuous rate is positive at every point of C because its zero set is Mβ⊂U; by [F8] it attains a strictly positive minimum on C, and the LDP upper bound makes the canonical macrostate probability of that complement exponentially small.

1.2F1algebra

Let q∈Mβ and put u=h(q). If r∈Hu, then D(r)+βu≥D(q)+βu, so q∈Mu and D(q)=d(u). For any v in the energy range, minimizing over Hv gives d(v)+βv≥d(u)+βu, equivalently s(v)−βv≤s(u)−βu. Thus u maximizes the stated entropy-minus-energy expression.

2.1F1F2F4F7F8givenalgebra

The fiber Hu:={q∈Δ(A):h(q)=u} is nonempty and closed, hence compact by step 1.1 and [F7], because u is in the range of continuous h. By [F4] and [F8], D attains its finite minimum d(u) on Hu, so Mu is nonempty. For fixed δ>0, put Bδ:={q:∣h(q)−u∣<δ}; it is open and contains Hu. By [F2], −inf⁡BδD≤lim inf⁡n1nln⁡p⊗n(Ln∈Bδ)≤lim sup⁡n1nln⁡p⊗n(Ln∈Bδ)≤−inf⁡B‾δD. For each matching radius δj in the Statement the two infima agree, so the inner limit exists and equals their negative common value. The lower bound is finite because Bδj contains a finite-rate point of Hu; hence the conditioning event has positive probability for all sufficiently large n.

3.1F1F4F7F8step 2.1algebra

Write dδ:=inf⁡B‾δD for any δ>0; since Hu⊆B‾δ, dδ≤d(u). Fix ε>0 and let Kε:={q∈Δ(A):D(q∥p)≤d(u)−ε}. By [F4], this set is closed and hence compact by [F7]; it is disjoint from Hu by the definition of d(u). Thus its compact image h(Kε) does not contain u by [F8]. If it is nonempty, the continuous function v↦∣v−u∣ on that compact image attains a positive minimum by [F8]; continuity follows from ∣∣v−u∣−∣w−u∣∣≤∣v−w∣. Therefore the image is separated from u; if it is empty the conclusion is immediate. For every sufficiently small δ, the closed shell B‾δ misses Kε, so dδ≥d(u)−ε. Together with dδ≤d(u), this proves dδ→d(u) as δ↓0, in particular along the matching sequence δj. Step 2.1 now gives the iterated shell limit −d(u)=s(u).

4.1F1F2F4F7F8step 2.1step 3.1algebra

Let U be an open neighborhood of Mu and put C:=Δ(A)∖U, which is closed and hence compact by step 1.1 and [F7]. If C∩Hu=∅, then h(C) is compact by [F8] and does not contain u; if C is nonempty, the continuous function v↦∣v−u∣ attains a positive minimum there by [F8], using ∣∣v−u∣−∣w−u∣∣≤∣v−w∣. Thus sufficiently small shells miss C; this is also immediate when C=∅. Otherwise, C∩Hu is a nonempty closed subset of the compact simplex and is compact by [F7]. Continuity of D and [F8] give dC:=min⁡C∩HuD>d(u), since C contains no constrained minimizer. Choose 0<η<dC−d(u) and set K:={q∈C:D(q∥p)≤d(u)+η}; it is closed and hence compact by [F4] and [F7], and it is disjoint from Hu. Therefore h(K) is compact by [F8] and does not contain u. If empty it is already separated from u; otherwise, the continuous distance function v↦∣v−u∣ attains a positive minimum there by [F8], so h(K) is separated from u. Hence for all sufficiently small δ, inf⁡C∩B‾δD≥d(u)+η. For every sufficiently small matching radius δj, we also have dδj<d(u)+η/2. The LDP upper bound [F2] on the closed set C∩Bδj‾⊆C∩B‾δj bounds the numerator's logarithmic limsup exponent by −d(u)−η. By step 2.1 the denominator's logarithmic limit exponent is −dδj, so subtracting gives a conditional logarithmic limsup at most dδj−d(u)−η<−η/2. Thus for every sufficiently large j the conditional probability tends to zero exponentially as n→∞, which gives the asserted iterated concentration limit.

5.1F1step 1.2algebra∎

Conversely, let u maximize s(v)−βv and let q∈Mu. For any r∈Δ(A), put v=h(r). Then D(r)+βv≥d(v)+βv≥d(u)+βu=D(q)+βu, so q∈Mβ. This proves both the equality of energy sets and the macrostate criterion. Rearranging s(v)−βv≤s(u)−βu gives exactly s(v)≤s(u)+β(v−u); hence the criterion is the stated upper-supporting-line condition, with no formal inverse-transform assumption.

Remarks

For a probability law ρ on a measurable space and a bounded measurable G, write TG(ρ) for the normalized exponential tilt TG(ρ)(B):=∫BeG dρ/∫eG dρ. Let Ωn=An with its discrete σ-algebra, and let P(X) denote Borel probability measures on X. Since h is continuous on compact Δ(A), the indicated tilts are finite and positive. The square records that tilting word probabilities by a weight depending only on the empirical macrostate commutes with pushing the law forward by Ln:

P(¬n)P(¢(A))P(¬n)P(¢(A))(Ln)¤T¡n¯h±LnT¡n¯h(Ln)¤

For an arbitrary probability law ρ on the finite space Ωn and every Borel B⊆Δ(A), the two routes assign B the same mass: ∑xn:Ln(xn)∈Bρ({xn})e−nβh(Ln(xn))∑xn∈Ωnρ({xn})e−nβh(Ln(xn))=∑q∈Ln(Ωn)∩B(Ln)∗ρ({q})e−nβh(q)∑q∈Ln(Ωn)(Ln)∗ρ({q})e−nβh(q). The equality follows by grouping the finite word sums into the fibers of Ln. In particular, setting ρ=p⊗n gives the word-law identity used in step 1.1. The diagram summarizes the identity and is not used as a proof.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Curie–Weiss magnetization bifurcation at the mean-field critical point

Statement

This is a dimensionless mathematical model: J, β, h, and Φβ are dimensionless, so βJ is dimensionless. The labels “coupling” and “inverse-temperature parameter” are conventional names here and do not assign physical units.

Let A={−1,+1} with uniform reference law p(±1)=1/2. For q∈Δ(A) define its magnetization m(q):=q(+1)−q(−1)∈[−1,1] and the mean-field energy density h(q):=−Jm(q)2/2, where J>0. For inverse-temperature parameter β≥0, the canonical macrostate variational objective from the finite-alphabet model is Φβ(m):=1+m2ln⁡(1+m)+1−m2ln⁡(1−m)−βJm22,−1≤m≤1, where 0ln⁡0:=0. This objective has the unique global minimizer m=0 when βJ≤1. When βJ>1, its global minimizers are exactly m=±mβ, where mβ∈(0,1) is the unique positive solution of m=tanh⁡(βJm),tanh⁡x:=exp⁡(2x)−1exp⁡(2x)+1.

Statement references

Facts & Assumptions

Given: The spin alphabet, uniform reference law, coupling J>0, and parameter β≥0 in the Statement.

[F1]

Finite-alphabet mean-field probability ensembles: for a full-support finite reference law, a continuous h, and β, the canonical variational objective at q is D(q∥p)+βh(q); D(q∥p) is the finite relative-entropy sum with zero-mass terms omitted.

[F2]

Finite-alphabet mean-field ensembles and upper supporting lines: canonical equilibrium macrostates are exactly the global minimizers of D(q∥p)+βh(q).

[F3]

The natural logarithm as the inverse of the exponential function and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡ is the inverse of exp⁡ on positive reals, is continuous and strictly increasing, is onto R, and satisfies ln⁡1=0.

[F5]

The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c): differentiable real functions compose with derivative (f∘g)′(c)=f′(g(c))g′(c) under the stated domain and limit-point hypotheses.

[F8]

Finite relative entropy is continuous on a simplex with positive reference law: for a finite alphabet and full-support reference law, q↦D(q∥p) is finite and continuous on the entire simplex, including its boundary; its proof establishes lim⁡t↓0tln⁡t=0.

Proof

1.1F1F8givenalgebra

Write q(+1)=(1+m)/2 and q(−1)=(1−m)/2. Substituting into [F1] with p(+1)=p(−1)=1/2 gives D(q∥p)=1+m2ln⁡(1+m)+1−m2ln⁡(1−m), with the zero-mass endpoint term omitted. Since q depends continuously on m∈[−1,1] and [F8] makes D(q∥p) continuous on the whole simplex, adding βh(q)=−βJm2/2 shows that Φβ is continuous on [−1,1]; [F8] supplies the boundary limit tln⁡t→0 behind the convention 0ln⁡0=0. The formula is even in m.

1.2F3F4F5F6algebra

For ∣m∣<1 define a(m):=atanh⁡(m):=12ln⁡1+m1−m. By [F3]–[F5] and direct differentiation, a′(m)=11−m2,Φβ′(m)=a(m)−βJm. For 0<m<1 put g(m):=a(m)/m and define r:[0,1)→R by r(m):=m/(1−m2)−a(m). Then g′(m)=r(m)/m2, r(0)=0, and r′(m)=2m2/(1−m2)2>0 for 0<m<1. The mean value theorem [F6] applies to r on [0,m] because r is continuous there and differentiable on (0,m); it gives r(m)>0, hence g′(m)>0.

2.1F3F6step 1.2algebra

The same theorem [F6] applied to a on [0,m] gives g(m)=a′(cm) for some cm∈(0,m); as m↓0, cm↓0 and a′(cm)→1, so lim⁡m↓0g(m)=1. As m↑1, (1+m)/(1−m)→+∞, and the increasing onto logarithm [F3] gives a(m)→+∞, hence g(m)→+∞. Thus g is continuous, strictly increasing from limiting value 1 to +∞ on (0,1).

3.1F6step 2.1algebracases

If βJ≤1, then for 0<m<1, Φβ′(m)=m(g(m)−βJ)>0 by step 2.1. The mean value theorem [F6] on each subinterval of [0,1] makes Φβ strictly increasing there; continuity includes the endpoint m=1. Evenness then shows Φβ(m)>Φβ(0) for every m≠0, so 0 is the unique global minimizer.

3.2F6F7step 1.2step 2.1algebra

If βJ>1, the limits in step 2.1 give a,b with 0<a<b<1, g(a)<βJ<g(b). Continuity of g on [a,b] and the intermediate value theorem [F7] give an mβ∈(a,b) with g(mβ)=βJ; strict increase of g makes it unique on (0,1). The derivative formula in step 1.2 is negative for 0<m<mβ and positive for mβ<m<1. By [F6], Φβ strictly decreases on [0,mβ] and strictly increases on [mβ,1], including the endpoint by continuity. Evenness proves that the only global minimizers on [−1,1] are ±mβ; in particular the stationary point m=0 is not a minimizer.

4.1F2F3step 2.1step 3.1step 3.2algebra∎

The equation g(mβ)=βJ is atanh⁡(mβ)=βJmβ. If r=(1+mβ)/(1−mβ), then exp⁡(2atanh⁡(mβ))=exp⁡(ln⁡r)=r by [F3], so the stated formula for tanh⁡ gives tanh⁡(atanh⁡(mβ))=(r−1)/(r+1)=mβ. Hence mβ=tanh⁡(βJmβ). Conversely, any m∈(0,1) solving this fixed-point equation yields exp⁡(2βJm)=(1+m)/(1−m) by rearrangement of the stated tanh⁡ formula; applying ln⁡ and [F3] gives g(m)=βJ. Strict increase of g therefore proves uniqueness of the positive fixed point. By [F2], the global minimizers just classified are exactly the canonical equilibrium magnetizations.

5 · Examples, experiments and counterexamples

None yet.

Sources