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-range lattice log-partition limit
Statement
For every fixed , the sequence of Bounded finite-range lattice model has a finite limit as . If another finite-volume energy on the same configurations satisfies for a constant independent of , define and . Then has the same limit. The result covers finite-alphabet, bounded, translation-invariant finite-range interactions on cubic boxes; it asserts no continuum-particle or long-range limit.
Facts & Assumptions
Given: As stated in the item.
The dimension, alphabet, shapes, bounded interaction functions, free-boundary energies, and are exactly as in Bounded finite-range lattice model.
Bounded finite-range lattice model: the alphabet has states per site, the (possibly empty) interaction list is finite, each term is bounded, and is the finite partition sum.
Division with remainder in : for and there are unique with and : for positive integer and integer , write with integer and remainder .
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: is increasing and converts products to sums.
Proof
Given: The bounded finite-range lattice data, , and (for the boundary comparison clause) the uniform energy bound.
Write and . Each configuration satisfies , so . Hence is bounded above and below uniformly in .
Fix an integer block length and write with using [F3]. If , then , contrary to , so . For the limiting estimate take , hence . Partition into disjoint -cubes and an outer remainder. Form by retaining only interactions whose entire support lies in one full cube and assigning zero energy to remainder sites. For a fixed shape, every eligible anchor lies in . If its support crosses an internal block seam, its coordinate normal to that seam lies in at most integer positions; the other coordinates have at most choices. If it is not in such a seam strip but the interaction is omitted, its support meets the outer remainder, so its anchor lies within layers of one of the outer faces. Counting at most internal seams and outer faces bounds the omitted anchors per shape by . Therefore .
If two energies on a finite state set differ pointwise by at most , their partition sums satisfy , so their log partition sums differ by at most using [F2]. The cut energy factorizes over the cubes and has zero-energy remainder, hence . Divide the comparison by and let with fixed; the remainder fraction tends to zero, , and the energy error has limsup at most .
It follows for every that and . Thus for every such . Letting makes the difference zero; boundedness from step 1.1 then gives a finite limit.
For , the finite-state comparison of step 2.1 gives , which tends to zero. Its limit is therefore the same.