Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

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.

Depends on

Dependency tree · 2 levels

Sources