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 be finite and nonempty, let for every , and let be continuous, where is the probability simplex with its topology. Let be the empirical probability vector of an -word drawn from , and use with zero-mass terms omitted. For , the canonical word law weights proportionally to .
The canonical macrostate law of satisfies a speed- large-deviation principle with rate Thus its canonical equilibrium macrostate set is .
For , let , , and . If there is a sequence for which then the iterated microcanonical shell limit exists and is In the same iterated limit, for every open neighborhood of , Finally, and a macrostate is canonical at exactly when and maximizes . Equivalently, is a canonical energy at exactly when is an upper supporting affine function for on the whole energy range. An energy with no upper supporting line for any slope is not realized by a canonical ensemble.
Statement references
Finite-alphabet mean-field probability ensembles
Compact-space Laplace principle and exponential tilting
A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact
Finite-alphabet Sanov bounds on the support simplex
Finite relative entropy is continuous on a simplex with positive reference law
Nonnegativity and equality for finite classical relative entropy
Facts & Assumptions
Given: A finite nonempty alphabet, a full-support reference probability , a continuous energy-density map , the finite product laws, and .
Finite-alphabet mean-field probability ensembles: is the probability simplex, is the empirical type under , has the finite full-support convention in the Statement, the canonical word law is the normalized weight , and the shell event is .
Finite-alphabet Sanov bounds on the support simplex: if and is its support simplex, the empirical type laws under satisfy the open-set lower and closed-set upper large-deviation bounds at speed with rate ; because has full support, .
Compact-space Laplace principle and exponential tilting: for a speed- LDP with rate on a compact metric space and continuous , , and the normalized exponential tilt has rate .
Finite relative entropy is continuous on a simplex with positive reference law: for a finite alphabet and a full-support reference , is finite and continuous on the whole simplex, including its boundary.
Nonnegativity and equality for finite classical relative entropy: for probability vectors on a finite set, , with equality exactly when .
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: a closed and bounded subset of Euclidean , for , is compact.
A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact: a closed subset of a compact topological space is compact.
A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism: a continuous image of a compact space is compact, and a continuous real-valued function on a nonempty compact space attains its minimum and maximum.
Proof
Enumerate , with , and identify with Euclidean . Write and ; the declared topology on the simplex is the topology from . The simplex is closed because it is the intersection of the closed coordinate constraints and the closed affine constraint ; these are closed since coordinate maps and their finite sum are continuous. It is bounded because . By [F6] it is compact in the Euclidean topology. For every , because , and because . These inequalities show that the Euclidean and metrics have the same open sets, so the simplex is compact in its declared topology. By continuity of and , each fiber and each sublevel set 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 continuous on the compact simplex, so it attains a finite minimum . The rate is nonnegative by [F5]. The empirical macrostate law under has rate by [F2]. For every Borel , the canonical macrostate probability is exactly where is the base law of ; this follows by summing the word weights in [F1] over the fiber . Thus it is the tilt in [F3] with , and its rate is . Its zero set is . Let be any open neighborhood of and put . If , the probability of the complement is zero. Otherwise is a nonempty closed subset of the compact simplex, hence compact by [F7]. The continuous rate is positive at every point of because its zero set is ; by [F8] it attains a strictly positive minimum on , and the LDP upper bound makes the canonical macrostate probability of that complement exponentially small.
Let and put . If , then , so and . For any in the energy range, minimizing over gives , equivalently . Thus maximizes the stated entropy-minus-energy expression.
The fiber is nonempty and closed, hence compact by step 1.1 and [F7], because is in the range of continuous . By [F4] and [F8], attains its finite minimum on , so is nonempty. For fixed , put ; it is open and contains . By [F2], For each matching radius in the Statement the two infima agree, so the inner limit exists and equals their negative common value. The lower bound is finite because contains a finite-rate point of ; hence the conditioning event has positive probability for all sufficiently large .
Write for any ; since , . Fix and let . By [F4], this set is closed and hence compact by [F7]; it is disjoint from by the definition of . Thus its compact image does not contain by [F8]. If it is nonempty, the continuous function on that compact image attains a positive minimum by [F8]; continuity follows from . Therefore the image is separated from ; if it is empty the conclusion is immediate. For every sufficiently small , the closed shell misses , so . Together with , this proves as , in particular along the matching sequence . Step 2.1 now gives the iterated shell limit .
Let be an open neighborhood of and put , which is closed and hence compact by step 1.1 and [F7]. If , then is compact by [F8] and does not contain ; if is nonempty, the continuous function attains a positive minimum there by [F8], using . Thus sufficiently small shells miss ; this is also immediate when . Otherwise, is a nonempty closed subset of the compact simplex and is compact by [F7]. Continuity of and [F8] give , since contains no constrained minimizer. Choose and set ; it is closed and hence compact by [F4] and [F7], and it is disjoint from . Therefore is compact by [F8] and does not contain . If empty it is already separated from ; otherwise, the continuous distance function attains a positive minimum there by [F8], so is separated from . Hence for all sufficiently small , . For every sufficiently small matching radius , we also have . The LDP upper bound [F2] on the closed set bounds the numerator's logarithmic limsup exponent by . By step 2.1 the denominator's logarithmic limit exponent is , so subtracting gives a conditional logarithmic limsup at most . Thus for every sufficiently large the conditional probability tends to zero exponentially as , which gives the asserted iterated concentration limit.
Conversely, let maximize and let . For any , put . Then , so . This proves both the equality of energy sets and the macrostate criterion. Rearranging gives exactly ; 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 , write for the normalized exponential tilt . Let with its discrete -algebra, and let denote Borel probability measures on . Since is continuous on compact , 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 :
For an arbitrary probability law on the finite space and every Borel , the two routes assign the same mass: The equality follows by grouping the finite word sums into the fibers of . In particular, setting gives the word-law identity used in step 1.1. The diagram summarizes the identity and is not used as a proof.
Depends on
Finite-alphabet mean-field probability ensembles
Compact-space Laplace principle and exponential tilting
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact
A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
Finite-alphabet Sanov bounds on the support simplex
Finite relative entropy is continuous on a simplex with positive reference law
Nonnegativity and equality for finite classical relative entropy