Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Limiting derivative and concentration

Statement

For the lattice models of Finite-range lattice log-partition limit, write pL(γ)=L−dlog⁡ZL(γ) and let p(γ)=lim⁡LpL(γ) on an open interval J⊆(0,∞). At finite L, use the canonical law Pγ,L(s):=e−γHL(s)/ZL(γ) and its finite expectation Eγ,L. If p is differentiable at β∈J, then Eβ,L[HL]/Ld→e:=−p′(β). For every ε>0 there are c>0 and L0 such that for L≥L0, Pβ,L(∣HL/Ld−e∣≥ε)≤2e−cLd. No energy-density limit is asserted at a nondifferentiability point.

Facts & Assumptions

Given: As stated in the item.

[A1]

J⊆(0,∞) is open; the finite-volume canonical laws use Pγ,L(s)=e−γHL(s)/ZL(γ); pL(γ)→p(γ) for each γ∈J; and p is differentiable at the specified β∈J.

[F1]

Finite-range lattice log-partition limit: pL(γ) converges to finite p(γ) for every γ∈J.

[F2]

Finite probability spaces, outcome weights, events, and event probabilities and Expectation of a real random variable on a finite probability space: the finite-volume canonical weights define probabilities and expectations as finite sums.

[F3]

Variance, standard deviation, and covariance on a finite probability space: variance is a nonnegative centered second moment.

[F4]

The real exponential function and the number e by a power series, The exponential function is smooth and (exp⁡)′=exp⁡, The natural logarithm as the inverse of the exponential function, and The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: the exponential is smooth, its derivative is itself, its values are positive by the logarithm inverse convention, and log⁡ differentiates as 1/x on positive values. The series definition gives exp⁡(0)=1.

[F5]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): if f is continuous on [a,b] and differentiable on (a,b), with a<b, then f(b)−f(a)=f′(c)(b−a) for some c∈(a,b).

[F7]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y) and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: exp⁡(u+v)=exp⁡(u)exp⁡(v) for real u,v, and logarithms convert positive products and quotients to sums and differences.

Proof

Given: The finite-volume lattice models, their canonical probabilities, pointwise convergence pL→p on J, and differentiability of p at β.

1.1A1F2F3F4F5F6

At every γ∈J, finite differentiation gives pL′(γ)=−L−dEγ,LHL and pL′′(γ)=L−dVar⁡γ,L(HL)≥0; these derivatives are continuous since the finite partition sum is smooth and positive. Apply [F5] to pL′ on [a,b]⊂J: pL′(b)−pL′(a)=pL′′(c)(b−a)≥0, so pL′ is nondecreasing. For a<b<c in J, apply [F5] to pL on [a,b] and [b,c]. Their secant slopes are derivative values respectively below and above b, hence the left slope is no greater than the right. Rearrangement gives pL(b)≤[(c−b)pL(a)+(b−a)pL(c)]/(c−a), the convexity inequality. Passing this inequality to the pointwise limit proves convexity of p.

1.2A1F1F2F4F5F7

Fix t>0 small enough that β±t∈J. Since exp⁡′=exp⁡>0 and exp⁡(0)=1, [F5] gives exp⁡(u)≥1 for u≥0. For the upper tail, the pointwise inequality 1{HL≥Ld(e+ε)}≤et(HL−Ld(e+ε)) and finite summation give P(HL/Ld≥e+ε)≤exp⁡{Ld[pL(β−t)−pL(β)−t(e+ε)]}. Differentiability of p and e=−p′(β) imply p(β−t)=p(β)+te+o(t); choose t so ∣p(β−t)−p(β)−te∣≤tε/4 and ∣p(β+t)−p(β)+te∣≤tε/4. Thus the upper bracket's limit is at most −3tε/4. Pointwise convergence at β−t and β then makes the bracket at most −tε/2 for all sufficiently large L.

2.1A1F1F5step 1.1

For any small h>0 with β±h∈J, apply [F5] to pL on [β−h,β] and [β,β+h]. Each secant slope is a value of pL′ on its respective open interval, so the monotonicity in step 1.1 gives [pL(β)−pL(β−h)]/h≤pL′(β)≤[pL(β+h)−pL(β)]/h. Take lower and upper limits in L, use [F1], then let h↓0; differentiability of p forces pL′(β)→p′(β). The identity in step 1.1 yields the claimed mean limit.

2.2A1F1F2F4F7step 1.2

For the lower tail use 1{HL≤Ld(e−ε)}≤e−t(HL−Ld(e−ε)); its expectation is exp⁡{Ld[pL(β+t)−pL(β)+t(e−ε)]}. For the same t chosen in step 1.2, the bracket has limit at most −3tε/4; increasing L0 therefore makes this at most e−Ldtε/2. Adding both tail bounds yields the result with c=tε/2.

3.1A1step 1.2step 2.2∎

Steps 1.2–2.2 bound the two tails whose union is {∣HL/Ld−e∣≥ε}; the theorem is conditional on differentiability of p and does not assert convergence of second derivatives or equivalence for arbitrary observables.

Depends on

Dependency tree · 2 levels

Sources