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.

Ensembles And Limits

1 · Prerequisites

2 · Summary

This page develops conditional mathematical identities for countable and measurable canonical laws, positive trace-class Gibbs operators, finite probability models, and finite-range lattice limits. The countable and measurable canonical differentiation results require their stated local summable or integrable moment envelopes; a lower energy bound alone does not ensure a finite countable partition sum. The finite-model partition results require no such envelopes. The operator result assumes the Axiom of Choice and a positive trace-class Gibbs operator, with a local summable moment envelope for its parameter-derivative identities.

The finite-range pressure theorem is restricted to finite alphabets, bounded translation-invariant interactions of finite range, and cubic boxes with free boundary. Boundary changes are covered only under the stated surface-order energy bound. Concentration and the limiting mean are asserted only at differentiability points. The transfer-matrix result is specific to the stated periodic two-state chain. No unrestricted ensemble-equivalence or general thermodynamic-limit claim is made.

The entropy, mutual-information, and Bose/Fermi results concern explicitly specified finite or countable probability laws; the response-covariance identity concerns the stated measurable density on a measure space. None asserts that a physical preparation or measured fluctuation has been established.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Countable canonical model

Definition

Let I be a nonempty finite or countably infinite set equipped with a specified enumeration, let Ei∈R be finite energies, let gi>0 be weights, and let J⊆R be an open parameter interval. For a nonnegative family (ai)i∈I define ∑i∈Iai:=sup⁡F⊂I, F finite∑i∈Fai, with finite sums as in Finite sums and finite products, by recursion and the supremum as in Complete ordered field (least-upper-bound property) when the finite subsums are bounded; set the value to +∞ when they are unbounded. This definition is independent of the specified enumeration. For β∈J, define the nonnegative partition sum Z(β):=∑i∈Igiexp⁡(−βEi) by this rule. The admissible parameter set is JZ:={β∈J:0<Z(β)<∞}. For β∈JZ, define pi(β):=giexp⁡(−βEi)/Z(β). A countable probability law on I means a nonnegative family with total sum 1 under the finite-subsum convention above; these weights form such a law because ∑ipi(β)=Z(β)/Z(β)=1. For any real family Xi with ∑ipi∣Xi∣<∞, define ⟨X⟩β:=∑ipiXi. If ∑i∣pilog⁡(pi/gi)∣<∞, define the reference-relative entropy Hg(p):=−∑ipilog⁡(pi/gi). When gi=1, this is the Shannon entropy with natural logarithms. A lower bound on the energies alone is not part of this definition and does not imply Z(β)<∞. For countably infinite I, any specified enumeration is used only to write a list; the nonnegative sum itself is the supremum over finite subsums above.

Scope

The sum is interpreted using the series convention of Series, partial sums, convergence and the sum, divergence, and the tail series. The model is purely mathematical; any physical interpretation of Ei, gi, or β requires separate premises.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Summable canonical differentiation

Statement

Let I,Ei,gi,J,Z be as in Countable canonical model. Suppose that for every compact interval K⊂J there is a summable sequence ai≥0 such that gi(1+∣Ei∣2)exp⁡(−βEi)≤ai for every i∈I and β∈K. Then Z is positive, finite, and C2 on J, with Z′(β)=−∑igiEiexp⁡(−βEi) and Z′′(β)=∑igiEi2exp⁡(−βEi). The probabilities pi are normalized. Define Eˉ:=⟨E⟩β and Var⁡β(E):=∑ipi(Ei−Eˉ)2. These quantities are finite and satisfy −∂βlog⁡Z=Eˉ and ∂β2log⁡Z=Var⁡β(E). Moreover Hg(p)=log⁡Z+βEˉ, and its defining series is absolutely convergent.

Facts & Assumptions

Given: As stated in the item.

[F1]

Countable canonical model: Z, pi, expectation and Hg have the definitions and domains stated there. The centered variance is defined in this item's Statement.

[F3]

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: log⁡ is defined on positive reals and (log⁡u)′=u′/u for differentiable u>0.

[A1]

For every compact K⊂J there is a nonnegative summable sequence (ai) such that gi(1+∣Ei∣2)e−βEi≤ai for all i and β∈K; the tail ∑i>Nai tends to zero.

Proof

Given: The countable canonical model and the local summable envelope in the statement.

1.1F1A1F2F5

On a compact interval K⊂J, let ZN, DN, and QN be the first N partial sums of ∑igie−βEi, −∑igiEie−βEi, and ∑igiEi2e−βEi. Since ∣Ei∣r≤1+∣Ei∣2 for r=0,1,2, each tail is bounded uniformly on K by the corresponding tail of ∑iai, which tends to zero [A1]. Thus all three sequences converge uniformly; call their limits Z,D,Q. Each finite partial sum has the displayed derivatives by the chain rule [F5] and the exponential derivative [F2]. Each partial sum is continuous, so the uniform limits are continuous by the ε/3 definition of continuity.

2.1F2F4F5step 1.1

For an interior β and sufficiently small h≠0, apply [F4] to ZN on the interval with endpoints β and β+h: its difference quotient is DN(ξN,h) for some intermediate ξN,h. Choose N=N(h) so that sup⁡K∣ZN−Z∣<h2 and sup⁡K∣DN−D∣<∣h∣. The difference quotient for Z then differs from D(β) by at most 2∣h∣+∣h∣+sup⁡∣t−β∣≤∣h∣∣D(t)−D(β)∣, which tends to zero by continuity of D. Hence Z′=D. Applying the same argument to DN and QN proves D′=Q, so the displayed derivatives hold.

3.1F1F2F3step 2.1algebra

The summands of Z are positive and at least one is present, hence 0<Z<∞ on K; summing the definition of pi gives ∑ipi=1. The envelope gives finite first and second moments, and ∑ipi(Ei−Eˉ)2≤2∑ipiEi2+2Eˉ2<∞. Differentiating log⁡Z using [F3] yields −Z′/Z=Eˉ and Z′′/Z−(Z′/Z)2=⟨E2⟩−Eˉ2=Var⁡β(E) after expanding the defining variance.

4.1F1F2F3step 3.1∎

Since pi/gi=e−βEi/Z, its logarithm is −βEi−log⁡Z. The finite first moment makes ∑ipi∣log⁡(pi/gi)∣≤∣β∣∑ipi∣Ei∣+∣log⁡Z∣∑ipi<∞; summing the identity gives Hg=βEˉ+log⁡Z.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Diagonal self-adjoint operator model

Definition

Let I be a finite or countably infinite set with a specified enumeration, let Ei∈R, and let ℓ2(I):={x:I→C:∑i∣xi∣2<∞} with inner product ⟨x,y⟩=∑ixiyi‾, linear in the first variable. Write ui for the coordinate unit vector at i. The diagonal multiplication operator HE is the linear operator with domain D(HE):={x∈ℓ2(I):∑i∣Eixi∣2<∞} and action (HEx)i:=Eixi. Completeness and linear domain of the diagonal sequence model ↗ proves completeness of the coefficient space, linearity and density of this domain, and linearity of the coordinate action before the Hilbert-space operator interpretation is used. Its domain is part of the operator data in the sense of Unbounded linear operators: domain, graph and extension.

Scope

The coefficient-space and domain construction above requires no choice assumption. Under Countable Choice (The Axiom of Countable Choice (ACω)), Diagonal multiplication is self-adjoint ↗ proves that HE equals its Hilbert-space adjoint, including equality of domains; this is the self-adjointness referred to in the title. The choice assumption belongs to the imported adjoint convention used by that lemma.

The definition introduces no claim about a physical Hamiltonian or about a trace of e−βHE.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Completeness and linear domain of the diagonal sequence model

Statement

For the finite or explicitly enumerated countable index set I of Diagonal self-adjoint operator model, the inner-product space ℓ2(I) is complete and therefore a complex Hilbert space, with inner product linear in the first variable. For any real family (Ei), the displayed domain D(HE) is a linear subspace containing every finite-support vector, is dense in ℓ2(I), and x↦(Eixi)i is a linear map from that domain into ℓ2(I). These assertions also hold for the empty finite index set.

Facts & Assumptions

Given: The coefficient space and real energies in the diagonal definition.

[F1]

Square-summable families on an arbitrary index set and the space ℓ2(I): finite-subset suprema define the square sum and its norm, and the coordinate pairing defines an inner-product space.

[F3]

Hilbert space: a complete inner-product space is a Hilbert space.

[F4]

Diagonal self-adjoint operator model: D(HE) consists of coefficient families whose energy-weighted square sum is finite.

Proof

Given: A Cauchy sequence (x(n)) in the stated coefficient norm.

1.1F1F2algebra

The sequence is norm bounded, say ∥x(n)∥≤M. For each coordinate, ∣xi(n)−xi(m)∣≤∥x(n)−x(m)∥, so [F2] gives a unique limit xi. For every finite F⊂I, passing to the limit in its finite sum gives ∑i∈F∣xi∣2≤M2. Taking the finite-subset supremum proves x∈ℓ2(I). No selection of nonunique coordinate limits is involved.

1.2F1F4algebra

If x,y∈D(HE) and a,b∈C, then for every finite F, ∑i∈F∣Ei(axi+byi)∣2≤2∣a∣2∑i∈F∣Eixi∣2+2∣b∣2∑i∈F∣Eiyi∣2. The right side is bounded independently of F, so ax+by∈D(HE); the zero vector is included. The coordinate action is linear and has square-summable output by the domain definition. Every finite-support vector belongs to this domain because each Ei is finite.

2.1F1F2F3step 1.1algebra

Given ϵ>0, choose N with ∥x(n)−x(m)∥≤ϵ for all n,m≥N. For fixed n≥N and finite F, let m→∞ to obtain ∑i∈F∣xi(n)−xi∣2≤ϵ2. Taking the supremum over F gives ∥x(n)−x∥≤ϵ. Thus the space is complete and is Hilbert by [F3].

3.1F1F4step 1.2algebra∎

For any x∈ℓ2(I) and ϵ>0, the finite-subset supremum supplies a finite F whose square sum differs from the total by less than ϵ2. For every finite G⊂I∖F, its square sum is at most that difference, by applying the total bound to F∪G. Hence the norm of the omitted tail is at most ϵ. Finite-coordinate truncations therefore approximate x and lie in D(HE) by step 1.2, proving density. If I is empty all spaces and maps are zero, and the same statements hold directly.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Diagonal multiplication is self-adjoint

Statement

Assume Countable Choice, as required by the adjoint definition Adjoint of a densely defined operator. For the diagonal model Diagonal self-adjoint operator model, the operator HE is densely defined and self-adjoint on ℓ2(I).

Facts & Assumptions

Given: As stated in the item.

[F1]

Diagonal self-adjoint operator model: HE has domain {x:∑i∣Eixi∣2<∞} and acts coordinatewise by multiplication by the real numbers Ei.

[F2]

Adjoint of a densely defined operator: the adjoint domain consists of those y for which x↦⟨HEx,y⟩ on D(HE) is represented by inner product with a vector of ℓ2(I).

[F3]

Square-summable families on an arbitrary index set and the space ℓ2(I) and Real and complex inner-product spaces and their induced length: square summability is the finite-subset sum condition, and the inner product is linear in the first argument.

[F5]

Completeness and linear domain of the diagonal sequence model: the coefficient inner-product space is Hilbert and the displayed diagonal domain is a dense linear subspace with a linear action.

[A2]

Countable Choice is assumed, as in the definition of the Hilbert-space adjoint.

Proof

Given: The diagonal operator of Diagonal self-adjoint operator model with real entries Ei.

1.1F1F3F4F5

By [F5] the ambient space is Hilbert and the operator domain and action are linear. Every finitely supported sequence belongs to D(HE). For x∈ℓ2(I), the tails of its square-sum can be made arbitrarily small, so finite-coordinate truncations converge in norm to x; finite-support vectors are therefore dense in ℓ2(I).

1.2F1F3

For x,y∈D(HE), Cauchy–Schwarz [F4] makes ∑i∣Eixiyi‾∣ finite, and reality of Ei gives ⟨HEx,y⟩=∑iEixiyi‾=⟨x,HEy⟩. Thus HE is symmetric.

2.1F1F2F5A2step 1.2∎

If y∈D(HE∗), there is z∈ℓ2(I) such that ⟨HEx,y⟩=⟨x,z⟩ for every x∈D(HE). Taking x=ui gives Eiyi‾=zi‾, hence zi=Eiyi for every i; since z∈ℓ2(I), y∈D(HE) and HE∗y=HEy. Conversely symmetry in step 1.2 shows every y∈D(HE) is in D(HE∗) with that value. Therefore D(HE∗)=D(HE) and HE∗=HE.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Measure space and integral

Definition

A measure space is a triple (X,Σ,μ) where Σ contains ∅,X and is closed under complements and countable unions (a σ-algebra) of subsets of X and μ:Σ→[0,∞] is countably additive with μ(∅)=0. A measurable function f:X→[−∞,∞] has measurable inverse images of Borel sets, where [−∞,∞] has its order topology: finite open intervals and the endpoint neighborhoods [−∞,a) and (a,∞] form a basis. Its Borel sigma-algebra is generated by these open sets. A complex-valued function is measurable exactly when its finite real and imaginary parts are measurable, equivalently for the usual Borel structure of C. Almost-everywhere assertions mean outside a measurable μ-null set; completeness of μ is not assumed. Nonnegative extended addition uses a+∞=∞+a=∞ for a∈[0,∞]; positive scalars multiply ∞ to ∞, while 0⋅∞=0. Signed expressions ∞−∞ remain undefined and are not used in signed integrals. A nonnegative simple function has the form s=∑j=1mcj1Aj with finitely many disjoint Aj∈Σ and finite cj≥0. Define cμ(A)=+∞ if c>0 and μ(A)=+∞, define 0⋅∞:=0, and define the finite sum of these extended nonnegative terms to be +∞ if any term is +∞ and otherwise the real finite sum of Finite sums and finite products, by recursion. Then ∫s dμ:=∑jcjμ(Aj); using canonical level sets {s=c} makes this value representation-independent. For measurable f≥0, define ∫f dμ:=sup⁡{∫s dμ:s is simple and 0≤s≤f}, using Complete ordered field (least-upper-bound property) for a bounded set of finite values and setting the supremum to +∞ when the values are unbounded or one is infinite. A real measurable f is integrable when ∫∣f∣ dμ<∞, and then ∫f:=∫f+−∫f−, where f+=max⁡(f,0) and f−:=max⁡(−f,0). Complex integrability and integration are defined by integrable real and imaginary parts.

Scope

The integral may equal +∞ for a nonnegative function. For an integrable signed or complex function it is finite. The measure μ is the reference measure: changing it can change an integral and any entropy defined from a density relative to it.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Monotone convergence for the measure integral

Statement

Let (X,Σ,μ) be a measure space and let fn:X→[0,∞] be measurable with fn≤fn+1 and fn→f pointwise. Then ∫fn dμ↑∫f dμ, including infinite values. Also, for measurable f,g≥0, ∫(f+g) dμ=∫f dμ+∫g dμ. For every c≥0, ∫cf dμ=c∫f dμ; the integral is also linear on real integrable functions.

Facts & Assumptions

Given: A measure space, its nonnegative integral, and a pointwise increasing measurable sequence.

[F1]

Measure space and integral: nonnegative integrals are suprema over measurable simple minorants; monotonicity follows by inclusion of the minorant sets.

[F2]

Finite sums and finite products, by recursion: finite sums of simple-function level values can be regrouped.

[F3]

Complete ordered field (least-upper-bound property): bounded nonempty subsets of R have suprema.

[A1]

Countable additivity of μ is part of the measure-space definition.

[A2]

The sequence is measurable and satisfies 0≤fn≤fn+1 and fn→f pointwise.

[F4]

Arithmetic and lattice operations preserve measurability whenever they are defined: nonnegative extended sums, positive scalar multiples and positive/negative parts are measurable under the defined extended arithmetic.

Proof

Given: A measure space and a pointwise increasing sequence 0≤fn↑f.

1.1F1A2

For every finite real a, {f>a}=⋃n{fn>a}, since the sequence increases to f. These threshold sets generate the order-topology Borel sigma-algebra in [F1], so f is measurable. The simple minorants of fn are also minorants of fn+1, so their integral suprema increase. Each is at most ∫f; hence L:=lim⁡n∫fn exists in [0,∞] and L≤∫f.

2.1F1F2F3A1A2step 1.1

Fix a nonnegative simple s≤f and 0<t<1. The measurable sets An:={fn≥ts} increase and cover {s>0}, since fn(x)→f(x)≥s(x)>ts(x) there. Write s=∑j=1mcj1Bj in disjoint level form. For each cj>0, An∩Bj↑Bj; countable additivity, applied to successive disjoint differences, gives μ(An∩Bj)↑μ(Bj). The finite-sum definition [F2] then gives ∫s1An↑∫s. As fn≥ts1An, monotonicity and homogeneity of the simple integral imply L≥t∫s. Let t↑1 and take the supremum over s≤f; [F1, F3] give L≥∫f. Together with step 1.1 this proves monotone convergence.

3.1F1F2F4A1step 2.1

For nonnegative measurable f, define sn:=2−n∑k=1n2n1{f≥k2−n}. Each sn is a finite-valued measurable simple function. Every threshold counted in sn is also counted at the even-index threshold in sn+1, so sn≤sn+1. If f(x)<∞, once n>f(x) the mesh gives 0≤f(x)−sn(x)<2−n; if f(x)=∞, then sn(x)=n. Thus sn↑f. Define tn:=2−n∑k=1n2n1{g≥k2−n}; the same threshold and mesh argument shows tn↑g. By [F4], f+g and sn+tn are measurable with the defined nonnegative extended addition. Apply the monotone-convergence conclusion of step 2.1 to sn, tn, and sn+tn. Refine their finitely many level sets to the finite partition of intersections Bj∩Ck; regrouping the resulting sums by [F2] gives ∫(sn+tn)=∫sn+∫tn. Passing to the three monotone limits proves ∫(f+g)=∫f+∫g.

4.1F1F2step 3.1∎

For c>0, simple minorants of cf are exactly c times simple minorants of f, so the supremum definition gives ∫cf=c∫f; for c=0 both sides are zero. If an integrable real function is expressed as u−v with u,v≥0 integrable, the value ∫u−∫v is independent of the expression: u−v=u′−v′ implies u+v′=u′+v, and step 3.1 equates the finite sums of integrals. The definition using positive and negative parts is one such expression, so signed integrals are linear.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Fatou's lemma

Statement

Let (X,Σ,μ) be a measure space and let fn:X→[0,∞] be measurable. Then ∫lim inf⁡n→∞fn dμ≤lim inf⁡n→∞∫fn dμ.

Facts & Assumptions

Given: As stated in the item.

[F1]

Measure space and integral: nonnegative integrals are monotone and the integral of a nonnegative measurable function is defined by simple minorants.

[F2]

Monotone convergence for the measure integral: integrals commute with increasing pointwise limits, including infinite values.

[A1]

The sequence fn is nonnegative and measurable on the stated measure space.

Proof

Given: A measure space and measurable fn≥0.

1.1F1A1

Set hk:=inf⁡n≥kfn. For each real a, {hk<a}=⋃n≥k{fn<a}, so hk is measurable by the sigma-algebra closure in [F1]. The sequence hk is increasing and its pointwise limit is lim inf⁡nfn, which is measurable since {lim⁡khk>a}=⋃k{hk>a}.

2.1F1F2step 1.1∎

For every n≥k, monotonicity gives ∫hk≤∫fn, so ∫hk≤inf⁡n≥k∫fn. Taking k→∞ and applying monotone convergence to hk yields ∫lim inf⁡fn=lim⁡k∫hk≤lim⁡kinf⁡n≥k∫fn=lim inf⁡n∫fn.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Dominated convergence for the measure integral

Statement

Let (X,Σ,μ) be a measure space and let fn:X→C be measurable with fn→f almost everywhere. Suppose g≥0 is measurable and ∫g dμ<∞, and ∣fn∣≤g almost everywhere for every n. Let f0(x) be the finite complex pointwise limit of (fn(x)) where it exists, and 0 elsewhere. Then f0 is measurable, equals f almost everywhere, is integrable, and ∫fn dμ→∫f0 dμ and ∫∣fn−f0∣ dμ→0. If the specified f is measurable, these same conclusions hold with f in place of f0. In particular this is automatic when μ is complete. On a noncomplete measure space an arbitrary almost-everywhere representative need not be measurable, so no integral of such a nonmeasurable f is asserted.

Facts & Assumptions

Given: As stated in the item.

[F1]

Measure space and integral: integrability, signed/complex integrals, and the reference-measure convention are as defined there.

[F2]

Fatou's lemma: for nonnegative measurable functions, the integral of the pointwise liminf is at most the liminf of the integrals.

[F3]

Monotone convergence for the measure integral: the nonnegative integral is additive and positively homogeneous.

[A1]

The sequence and envelope are measurable, converge almost everywhere, and are dominated almost everywhere by the nonnegative integrable function g.

Proof

Given: A measure space, almost-everywhere convergence, and an integrable dominating function g≥0.

1.1F1F4A1algebra

The set on which (fn) is Cauchy is measurable: write it as the countable intersection/union/intersection of sets {∣fn−fk∣<1/m} using [F4]. On this set the finite real and imaginary limits exist; their measurable limit functions, set to zero on its complement, define the measurable f0. The assumed almost-everywhere convergence gives f0=f outside a measurable null set. Enlarge that set by the countably many measurable domination exceptions to a measurable null set N. Set fn and f0 to zero on N, which preserves their measurability. A nonnegative measurable function supported on N has integral zero by the simple-minorant definition, so these changes preserve every defined integral. Convergence and domination now hold everywhere, and ∣f0∣≤g proves integrability. This does not redefine the potentially nonmeasurable f and then claim it was measurable.

2.1F1F2F3step 1.1

First take all functions real. The nonnegative functions fn+g converge pointwise to f0+g. Fatou gives ∫(f0+g)≤lim inf⁡n∫(fn+g)=∫g+lim inf⁡n∫fn, so ∫f0≤lim inf⁡n∫fn. Applying Fatou to g−fn≥0 gives ∫(g−f0)≤lim inf⁡n∫(g−fn)=∫g−lim sup⁡n∫fn, hence lim sup⁡n∫fn≤∫f0. Additivity of integrable signed integrals follows by writing each as a difference of its positive and negative parts and using [F3]. The inequalities imply convergence of integrals.

3.1F1F2F3step 2.1∎

For complex fn, apply step 2.1 separately to their real and imaginary parts, each dominated by g; their integral limits combine to ∫f0. To prove L1 convergence, apply Fatou to the nonnegative functions 2g−∣fn−f0∣, which converge to 2g; it gives 2∫g≤2∫g−lim sup⁡n∫∣fn−f0∣, so the latter limsup is zero. Therefore ∫∣fn−f0∣→0 as claimed.

Remarks

If f is measurable and equals f0 outside a measurable null set, their measurable difference has zero integral and zero L1 norm; hence the same limits hold for f. If the measure is complete, every subset of the exceptional null set is measurable, so every almost-everywhere representative is measurable. The completeness qualification is necessary: on a noncomplete space, a nonmeasurable subset A of a measurable null set gives f=1A and fn=g=0. All stated almost-everywhere convergence and domination conditions hold, but f has no measurable integral; the canonical representative is f0=0.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Measurable canonical normalization and identities

Statement

Let (X,Σ,μ) be a measure space, let E:X→R be measurable, and let J⊂R be open. Suppose Z(β):=∫e−βE dμ satisfies 0<Z(β)<∞ on J, and for every compact interval K⊂J there is GK∈L1(μ) with (1+∣E∣2)e−βE≤GK pointwise for every β∈K. Define pβ=e−βE/Z(β), ⟨Y⟩β:=∫Ypβ dμ for integrable Y, and Var⁡β(E):=∫(E−⟨E⟩β)2pβ dμ. Then Z∈C2(J), Z′=−∫Ee−βEdμ, Z′′=∫E2e−βEdμ, and −∂βlog⁡Z=⟨E⟩β, ∂β2log⁡Z=Var⁡β(E). The reference-relative entropy −∫pβlog⁡pβ dμ is finite and equals log⁡Z+β⟨E⟩β.

Facts & Assumptions

Given: As stated in the item.

[A1]

(X,Σ,μ), E, J, positivity/finiteness of Z, and the local integrable envelope are the hypotheses of this statement.

[F1]

Measure space and integral defines the reference measure integral, integrability, and signed/complex conventions; inclusion of simple-minorant sets gives monotonicity of the nonnegative integral. Monotone convergence for the measure integral supplies additivity and nonnegative homogeneity of that integral and linearity on real integrable functions.

[F2]

Dominated convergence for the measure integral: a measurable pointwise-limit representative of measurable functions dominated by an integrable envelope is integrable, and the limit passes through the integral. On a noncomplete measure space the named representative must be measurable; the canonical measurable representative always exists. The limits used below are measurable by [F7].

[F3]

The real exponential function and the number e by a power series defines the exponential series, and The exponential function is smooth and (exp⁡)′=exp⁡ supplies smoothness and exp⁡′=exp⁡. Positivity is supplied by The natural logarithm as the inverse of the exponential function, which identifies exp⁡:R→(0,∞) as the inverse bijection of log⁡.

Proof

Given: A measure space, a measurable real energy E, a positive finite partition function, and the compact-interval envelope.

1.1A1F1F2F3F5F6F7

For each fixed parameter, measurable energy/observable coordinates and [F7] make every finite linear combination, exponential weight, weighted first/second moment and parameter difference quotient measurable; their displayed pointwise derivative limits are the same measurable compositions. For β in the interior of a compact interval K⊂J, the difference quotient of e−βE(x) tends pointwise to −E(x)e−βE(x). The mean-value theorem [F5] bounds its absolute value, for small h, by ∣E∣e−θE for an intermediate θ∈K; this is at most GK because ∣E∣≤1+∣E∣2. Apply dominated convergence [F2] along any sequence of nonzero increments tending to zero; by [F1] the integral of the difference quotient is the difference quotient of Z. Every such sequence has the same limit, so Z′=−∫Ee−βEdμ. Applying the same argument to −Ee−βE, dominated by GK, gives Z′′=∫E2e−βEdμ; for each of the derivative kernels −Ee−γE and E2e−γE, pointwise continuity in γ and the same envelope let dominated convergence prove continuity of both derivatives.

2.1A1F1F3F4F6step 1.1

The density pβ is nonnegative and integrates to one. The envelope makes its first and second energy moments finite. Differentiating log⁡Z using [F4] gives −Z′/Z=∫Epβdμ and Z′′/Z−(Z′/Z)2=∫E2pβdμ−(∫Epβdμ)2. The latter is the variance by expanding its defining square.

3.1A1F1F3F4step 2.1∎

Since log⁡pβ=−βE−log⁡Z almost everywhere and ∫∣E∣pβdμ<∞, the bound pβ∣log⁡pβ∣≤∣β∣∣E∣pβ+∣log⁡Z∣pβ makes the entropy integrand absolutely integrable. Substitution and normalization yield −∫pβlog⁡pβdμ=β⟨E⟩β+log⁡Z. This entropy depends on the chosen reference measure μ.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite-bath canonical error bound

Statement

Let I be a finite nonempty subsystem state set, let Ei∈R satisfy ∣Ei∣≤L for L≥0, and let the dimensionless bath entropy sB be C2 on an open interval U containing [u0−L,u0+L], with ∣sB′′(u)∣≤M on that closed interval for M≥0. Use one energy unit for Ei,u0,L, so β=sB′(u0) has inverse-energy units and M has inverse-energy-squared units; δ=ML2/2 is dimensionless. Put Z:=∑j∈Ie−βEj and qi:=e−βEi/Z. Suppose the joint shell weights induce the normalized subsystem law pi:=esB(u0−Ei)/∑j∈IesB(u0−Ej). Then ∣sB(u0−Ei)−sB(u0)+βEi∣≤δ for every i, and ∑i∣pi−qi∣≤e2δ−1.

Facts & Assumptions

Given: As stated in the item.

[A1]

I is finite and nonempty; Ei∈R; L,M≥0; ∣Ei∣≤L; and sB is C2 on an open interval U containing [u0−L,u0+L] with the stated second-derivative bound. Both laws are normalized on the same state set.

[F1]

Countable canonical model: for a finite energy list and real β, qi=e−βEi/Z is the normalized canonical law.

[F2]

A uniform derivative bound gives a uniform Taylor remainder bound: a bound ∣sB′′∣≤M gives the first-order Taylor error at most M∣Ei∣2/2.

[F3]

The real exponential function and the number e by a power series, 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: exp⁡ is a positive bijection with inverse log⁡, and log⁡(xy)=log⁡x+log⁡y for positive x,y. Thus exp⁡(u+v)=exp⁡(u)exp⁡(v): both positive sides have logarithm u+v, and log⁡ is injective.

Proof

Given: The finite subsystem, the twice differentiable bath entropy with bounded second derivative, and the stated shell-weight rule.

1.1A1F2

Apply [F2] to sB at u0 with increment −Ei. It gives sB(u0−Ei)=sB(u0)−βEi+ri where ∣ri∣≤MEi2/2≤δ.

2.1F1F3step 1.1

The marginal is therefore pi=qieri/C, where C:=∑jqjerj. The bounds e−δ≤erj≤eδ and ∑jqj=1 imply e−δ≤C≤eδ, so e−2δ≤pi/qi≤e2δ.

3.1F1F3step 2.1algebra∎

For x∈[e−2δ,e2δ], ∣x−1∣≤e2δ−1. Thus ∑i∣pi−qi∣=∑iqi∣pi/qi−1∣≤(e2δ−1)∑iqi=e2δ−1. The case δ=0 is included and gives equality of the laws.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Independent subsystem bulk limit

Statement

Let Ω0 be a nonempty finite set, let E:Ω0→R, and fix β∈R. Define Z1=∑i∈Ω0e−βEi and the canonical law qi=e−βEi/Z1, and define Eˉ:=∑iqiEi. For N≥1, on Ω0N define HN(i1,…,iN)=∑k=1NEik. Give Ω0N the product probability law assigning (i1,…,iN) weight ∏k=1Nqik, and define the N-subsystem partition sum ZN:=∑(i1,…,iN)∈Ω0Ne−βHN(i1,…,iN). Then ZN=Z1N, E[HN/N]=Eˉ, and Var⁡(HN/N)=Var⁡q(E)/N. Consequently, for every ε>0, P(∣HN/N−Eˉ∣≥ε)≤Var⁡q(E)/(Nε2). If β≠0, the mathematical free-energy density −β−1N−1log⁡ZN is exactly −β−1log⁡Z1 for every N.

Facts & Assumptions

Given: The finite one-subsystem state set, energy function, canonical law, and its finite product law.

[A1]

Ω0 is a nonempty finite set, E is real-valued, β is fixed, and the N-subsystem law is the product of the one-subsystem canonical law.

[F4]

The real exponential function and the number e by a power series, The natural logarithm as the inverse of the exponential function, 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⁡(x+y)=exp⁡(x)exp⁡(y) for real x,y, the exponential has positive values as specified by the logarithm inverse convention, and logarithms convert positive products to sums.

Proof

Given: The finite one-subsystem state set, its energy function, and the product probability model.

1.1A1F1F4F5

By finite Fubini, ZN=∑(i1,…,iN)∏k=1Ne−βEik=∏k=1N∑ik∈Ω0e−βEik=Z1N. This is an exact finite identity.

1.2A1F1F2F3

Under the product law, the coordinate energies E(ik) are mutually independent and each has mean Eˉ and variance v:=Var⁡q(E). Linearity gives EHN=NEˉ; the covariance terms between distinct coordinates vanish by independence, so [F3] gives Var⁡(HN)=Nv. Dividing by N and N2 proves the mean and variance formulas.

2.1F2F3step 1.2

On the event ∣HN/N−Eˉ∣≥ε, the nonnegative random variable (HN/N−Eˉ)2 is at least ε2. Summing over that event gives ε2P(∣HN/N−Eˉ∣≥ε)≤E[(HN/N−Eˉ)2]=v/N, proving the probability bound without any independence assertion beyond the product model.

3.1A1F4F5step 1.1∎

If β≠0, substitute ZN=Z1N and apply the logarithm product law: −β−1N−1log⁡ZN=−β−1N−1Nlog⁡Z1=−β−1log⁡Z1.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

One-dimensional periodic Ising-chain limit

Statement

Fix β>0 and J,h∈R. For N≥2, let si∈{−1,1}, sN+1=s1, HN(s)=−J∑i=1Nsisi+1−h∑i=1Nsi, and ZN=∑se−βHN(s). Define cosh⁡x:=(ex+e−x)/2, sinh⁡x:=(ex−e−x)/2, and Ts,t:=eβJst+βh(s+t)/2. Then ZN=tr⁡(TN)=λ+N+λ−N, where λ±=eβJcosh⁡(βh)±e2βJsinh⁡2(βh)+e−2βJ and λ+>∣λ−∣. Therefore N−1log⁡ZN→log⁡λ+. On every compact subset of (0,∞)×R2 in (β,J,h), the limit and its derivatives of every fixed finite order converge uniformly. This is a result for the specified one-dimensional periodic two-state model only.

Facts & Assumptions

Given: The periodic two-state chain, the transfer matrix in the statement, and parameters β>0, J,h∈R.

[A1]

Spins are {−1,1}, the Hamiltonian and periodic boundary condition are as stated, and the hyperbolic functions have the exponential definitions in the Statement.

[F1]

Finite sums and finite products, by recursion and Laws of finite sums and finite products: finite configuration sums can be regrouped by their indices.

[F3]

Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a: every positive real radicand has a unique positive square root.

[F5]

The exponential dominates every fixed nonnegative integer power at +∞: for 0<ρ<1 and fixed k, NkρN→0.

Proof

Given: The finite periodic chain and its stated parameters.

1.1A1F1F2

For each configuration, the product ∏i=1NTsi,si+1 has bond contribution eβJ∑isisi+1 and field contribution eβh∑i(si+si+1)/2=eβh∑isi. These factors equal e−βHN(s). Summing over the finite spin sequences gives ZN=∑s1,…,sNTs1s2⋯TsNs1=tr⁡(TN).

1.2A1F2F3

In the ordered basis +1,−1, T=(eβJ+βhe−βJe−βJeβJ−βh). Put A=eβJcosh⁡(βh) and B=e2βJsinh⁡2(βh)+e−2βJ. The diagonal entries give tr⁡T=2A; direct multiplication gives det⁡T=e2βJ−e−2βJ. Using cosh⁡2x−sinh⁡2x=1, which follows by expanding their definitions, A2−det⁡T=e2βJsinh⁡2(βh)+e−2βJ=B2. Thus the characteristic polynomial has roots A±B=λ±. Since A,B>0, A+B>∣A−B∣, hence λ+>∣λ−∣.

2.1step 1.1step 1.2F1

For a 2×2 matrix M=(abcd), direct multiplication gives M2−(a+d)M+(ad−bc)I=0. Apply this identity to T and multiply by Tn; taking traces gives zn+2=(tr⁡T)zn+1−(det⁡T)zn, where zn=tr⁡(Tn), z0=2, and z1=λ++λ−. The sequence λ+n+λ−n has the same recurrence and initial values, so induction gives ZN=zN=λ+N+λ−N.

3.1A1F4F5step 1.2step 2.1∎

Set r=λ−/λ+. Then ZN=λ+N(1+rN) and ∣r∣<1, so 1+rN>0. Therefore N−1log⁡ZN=log⁡λ++N−1log⁡(1+rN), whose second term tends to zero. For a compact parameter set, continuity and ∣r∣<1 give 0<ρ<1 with ∣r∣≤ρ. The positive radicand in B is a smooth positive combination of exponentials; the real-power derivative in [F4] with exponent 1/2, followed inductively by chain and product rules, makes B and λ± smooth. Since λ+>0, its reciprocal and logarithm are smooth as well, by the real-power derivative with exponent −1 and the logarithm derivative in [F4]. Every fixed finite collection of derivatives of r is therefore bounded on the compact set. For a multi-index α of order at most k and N≥k, repeated product differentiation of the N factors gives at most CkNk terms; each has at least N−k undifferentiated factors r, so ∣∂α(rN)∣≤CkNkρN−k. Put u=rN. Since 1+u≥1−ρ, repeated differentiation of log⁡(1+u) gives finite sums of products of derivatives of u divided by powers of 1+u. Each term has at least one derivative factor and the product bounds yield ∣∂αlog⁡(1+u)∣≤Ck′NkρN−k after enlarging the constant. Divide by N; [F5] implies Nk−1ρN−k→0. The zero-order logarithm term also tends uniformly to zero. Hence the correction and every fixed-order derivative vanish uniformly on the compact set.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Bounded finite-range lattice model

Definition

Fix integers d≥1, L≥1, a finite alphabet A of cardinality q≥1, and a finite, possibly empty, list of interaction shapes Sa⊂Zd, each nonempty and contained in [−R,R]d for some integer R≥0. ∥Φa∥∞ is finite because its domain is finite. For each shape let Φa:ASa→R be a bounded interaction function. Set J0:=∑a∥Φa∥∞. On ΛL:={1,…,L}d, define the free-boundary energy HL(s):=∑a∑x:x+Sa⊆ΛLΦa((sx+u)u∈Sa), for configurations s∈AΛL. For β>0, define the finite partition sum ZL(β):=∑s∈AΛLe−βHL(s) and normalized log-partition density pL(β):=L−dlog⁡ZL(β).

Scope

The alphabet, interaction list, shapes and functions are mathematical data. The formula uses the same interaction function at every translated anchor. This definition includes free boundary conditions only; other boundary energies are introduced by an explicit bound in Finite-range lattice log-partition limit.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite-range lattice log-partition limit

Statement

For every fixed β>0, the sequence pL(β) of Bounded finite-range lattice model has a finite limit as L→∞. If another finite-volume energy H~L on the same configurations satisfies sup⁡s∣H~L(s)−HL(s)∣≤CbLd−1 for a constant Cb independent of L, define Z~L(β):=∑s∈AΛLe−βH~L(s) and p~L(β):=L−dlog⁡Z~L(β). Then p~L 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.

[A1]

The dimension, alphabet, shapes, bounded interaction functions, free-boundary energies, and β>0 are exactly as in Bounded finite-range lattice model.

[F1]

Bounded finite-range lattice model: the alphabet has q states per site, the (possibly empty) interaction list is finite, each term is bounded, and ZL is the finite partition sum.

[F3]

Division with remainder in Z: for a∈Z and b>0 there are unique q,r∈Z with a=qb+r and 0≤r<b: for positive integer ℓ and integer L≥0, write L=kℓ+r with integer k and remainder 0≤r<ℓ.

Proof

Given: The bounded finite-range lattice data, β>0, and (for the boundary comparison clause) the uniform CbLd−1 energy bound.

1.1A1F1F2

Write V=Ld and J0=∑a∥Φa∥∞. Each configuration satisfies ∣HL(s)∣≤J0V, so qVe−βJ0V≤ZL≤qVeβJ0V. Hence pL is bounded above and below uniformly in L.

1.2A1F1F3

Fix an integer block length ℓ>2R and write L=kℓ+r with 0≤r<ℓ using [F3]. If k<0, then L=kℓ+r≤−ℓ+r<0, contrary to L≥0, so k≥0. For the limiting estimate take L≥ℓ, hence k≥1. Partition ΛL into kd disjoint ℓ-cubes and an outer remainder. Form HL,ℓcut 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 [1−R,L+R]d. If its support crosses an internal block seam, its coordinate normal to that seam lies in at most 2R+1 integer positions; the other coordinates have at most (L+2R)d−1 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 ℓ+2R+1 layers of one of the d outer faces. Counting at most d(k−1) internal seams and d outer faces bounds the omitted anchors per shape by d(2R+1)(L/ℓ)(L+2R)d−1+d(ℓ+2R+1)(L+2R)d−1. Therefore sup⁡s∣HL(s)−HL,ℓcut(s)∣≤J0d[(2R+1)(L/ℓ)+ℓ+2R+1](L+2R)d−1.

2.1A1F1F2F3step 1.2

If two energies on a finite state set differ pointwise by at most D, their partition sums satisfy e−βDZ′≤Z≤eβDZ′, so their log partition sums differ by at most βD using [F2]. The cut energy factorizes over the cubes and has zero-energy remainder, hence ZL,ℓcut=ZℓkdqLd−kdℓd. Divide the comparison by Ld and let L→∞ with ℓ fixed; the remainder fraction tends to zero, kd/Ld→ℓ−d, and the energy error has limsup at most 2d−1βJ0d(2R+1)/ℓ.

3.1A1F1step 1.1step 2.1

It follows for every ℓ>2R that lim sup⁡LpL≤pℓ+2d−1βJ0d(2R+1)/ℓ and lim inf⁡LpL≥pℓ−2d−1βJ0d(2R+1)/ℓ. Thus 0≤lim sup⁡LpL−lim inf⁡LpL≤2dβJ0d(2R+1)/ℓ for every such ℓ. Letting ℓ→∞ makes the difference zero; boundedness from step 1.1 then gives a finite limit.

4.1A1F2step 2.1step 3.1∎

For H~L, the finite-state comparison of step 2.1 gives ∣L−dlog⁡Z~L−pL∣≤βCb/L, which tends to zero. Its limit is therefore the same.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite ground-state degeneracy entropy limit

Statement

Let I be a finite nonempty set, take the canonical model Countable canonical model on J=(0,∞), and let its energies be Ei and positive weights be gi. Write E0:=min⁡i∈IEi, let G:={i∈I:Ei=E0} have cardinality m≥1, and set W0:=∑i∈Ggi. As β→+∞, each ground-state probability tends to gi/W0 and each excited-state probability tends to zero. The Shannon entropy H(p(β)):=−∑i∈Ipi(β)log⁡pi(β) tends to −∑i∈G(gi/W0)log⁡(gi/W0). In particular, if all gi=1, the ground-state probabilities tend to 1/m and the entropy tends to log⁡m. This is a finite-model statement only.

Facts & Assumptions

Given: As stated in the item.

[A1]

I is finite and nonempty, the parameter interval is J=(0,∞), gi>0 for every i, E0=min⁡iEi, G={i:Ei=E0} is nonempty, and every gap Ei−E0 for i∉G is positive.

[F1]

Countable canonical model: finite canonical weights are pi=gie−βEi/Z with natural logarithms.

[F3]

The exponential dominates every fixed nonnegative integer power at +∞: βe−βΔ→0 for every fixed Δ>0.

Proof

Given: A finite energy list with ground energy E0, degeneracy g≥1, and positive gaps for all other states.

1.1A1F1F2

Set D(β):=W0+∑i∉Ggie−β(Ei−E0), so factoring the ground energy gives Z=e−βE0D(β). Each gap is positive, and there are finitely many, so D(β)→W0>0. Thus pi(β)=gi/D(β)→gi/W0 for i∈G, and pi(β)=gie−β(Ei−E0)/D(β)→0 for i∉G.

2.1A1F2F3step 1.1∎

For i∈G, step 1.1 and continuity of x↦−xlog⁡x on (0,∞) give −pilog⁡pi→−(gi/W0)log⁡(gi/W0). For an excited state with gap Δi>0, step 1.1 gives pi=O(e−βΔi) and log⁡pi=log⁡gi−βΔi−log⁡D(β); since D(β)→W0>0, log⁡D(β) is bounded, so ∣pilog⁡pi∣=O((1+β)e−βΔi)→0 by [F3]. There are finitely many states, hence the entropy tends to the stated ground-state entropy. If all gi=1, then W0=m and the limit is −m(1/m)log⁡(1/m)=log⁡m.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Conditional entropy of finite memory given side information

Statement

Let M and R take values in finite sets under a joint probability law p(m,r)≥0 with ∑m,rp(m,r)=1. For any finite random variable Y with law pY, define its Shannon entropy by H(Y):=−∑y:pY(y)>0pY(y)log⁡pY(y); for a pair, H(M,R) means this definition applied to its joint law. Put ar:=∑mp(m,r) and, when ar>0, q(m∣r):=p(m,r)/ar. Thus H(R)=−∑r:ar>0arlog⁡ar. Define H(M∣R):=∑r:ar>0ar[−∑m:q(m∣r)>0q(m∣r)log⁡q(m∣r)]. Then H(M,R)=H(R)+H(M∣R) and H(M∣R)≥0.

Facts & Assumptions

Given: As stated in the item.

[A1]

M,R take values in finite sets under the joint probability law p(m,r).

[F1]

Finite probability spaces, outcome weights, events, and event probabilities and Finite sums and finite products, by recursion: joint weights are nonnegative and sum to one, and all displayed sums are finite.

[F2]

Proof

Given: A finite joint probability law for M and R.

1.1A1F1F2

For every r with ar>0, the numbers q(m∣r) are nonnegative and sum to one. The joint identity p(m,r)=arq(m∣r) on positive entries gives log⁡p(m,r)=log⁡ar+log⁡q(m∣r); summing −plog⁡p over each fixed r yields −arlog⁡ar+ar[−∑m:q(m∣r)>0q(m∣r)log⁡q(m∣r)]. Terms with ar=0 have all p(m,r)=0 and contribute nothing. Summing over finite r proves the chain rule.

2.1A1F1F2step 1.1∎

For each positive conditional probability q(m∣r)≤1, [F2] gives −q(m∣r)log⁡q(m∣r)≥0. Multiplying by ar≥0 and summing proves H(M∣R)≥0.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Mutual information of finite random variables

Statement

For finite random variables M,R with joint law p(m,r) and marginals pM,pR, use the entropy definition H(Y) of Conditional entropy of finite memory given side information for Y=M,R,(M,R). Define I(M;R):=∑p(m,r)>0p(m,r)log⁡p(m,r)pM(m)pR(r). Then I(M;R)=H(M)+H(R)−H(M,R)=H(M)−H(M∣R)≥0, with equality exactly when p(m,r)=pM(m)pR(r) for every pair.

Facts & Assumptions

Given: As stated in the item.

[A1]

p(m,r) is a joint probability law on finite sets and pM,pR are its marginal laws.

[F1]

Finite probability spaces, outcome weights, events, and event probabilities and Finite sums and finite products, by recursion: the joint and marginal probabilities are finite normalized sums, and if p(m,r)>0 then both marginals are positive.

[F2]

Conditional entropy of finite memory given side information: finite Shannon entropies are defined there and satisfy H(M,R)=H(R)+H(M∣R).

Proof

Given: A finite joint law p(m,r) and its two marginals.

1.1F3F4

Define ϕ(t):=t−1−log⁡t for t>0. Its derivative is 1−1/t, nonpositive on (0,1] and nonnegative on [1,∞); the mean-value theorem [F4] gives ϕ(t)≥ϕ(1)=0, with equality only at t=1. Thus −log⁡t≥1−t, strictly unless t=1.

1.2A1F1F2F3algebra

Expanding the finite logarithmic sum gives I(M;R)=H(M)+H(R)−H(M,R); applying [F2] rewrites it as H(M)−H(M∣R).

2.1A1F1step 1.1step 1.2∎

Put q(m,r):=pM(m)pR(r). For p(m,r)>0, q(m,r)>0 by [F1], and step 1.1 with t=q/p gives plog⁡(p/q)≥p−q. Summing over the support of p yields I(M;R)≥1−∑p>0q≥0. Equality forces q=p on the support and no q-mass outside it, hence equality at every pair; conversely independence makes each positive logarithm zero.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Trace-class Gibbs normalization for a semibounded self-adjoint operator

Statement

Assume the Axiom of Choice. Let H≠{0} be a complex Hilbert space and let A be self-adjoint with regular Borel projection-valued measure E from Spectral theorem for unbounded self-adjoint operators (PVM form), with E((−∞,a))=0 for finite a∈R. For each γ>0, define the bounded Gibbs operator Kγ:=ΦE(fγ) using the bounded Borel PVM integral of Bounded borel pvm integral, where fγ(λ)=e−γλ for λ≥a and fγ(λ)=e−γa for λ<a. Fix β>0 and suppose Kβ is trace class in the sense of Trace class operator. Then Kβ is injective and has a finite or countable orthonormal basis (uj) of H with Auj=Ejuj, Ej≥a, and Kβuj=e−βEjuj. Its partition function Zβ:=Tr⁡Kβ=∑je−βEj is positive and finite, and ρβ:=Kβ/Zβ is positive with Tr⁡ρβ=1. For every B∈B(H), Tr⁡(ρβB)=∑j(e−βEj/Zβ)⟨Buj,uj⟩ absolutely. Further, let J⊂(0,∞) be open and suppose that for every compact C⊂J there is a summable family aj≥0 with (1+∣Ej∣2)e−γEj≤aj for all j and γ∈C. Then for each γ∈J, Kγ is trace class with partition function Zγ:=Tr⁡Kγ=∑je−γEj. With pj(γ):=e−γEj/Zγ, define Eˉγ:=∑jpj(γ)Ej, Var⁡γ(E):=∑jpj(γ)(Ej−Eˉγ)2, and Sγ:=−∑jpj(γ)log⁡pj(γ). These quantities are finite and satisfy −∂γlog⁡Zγ=Eˉγ, ∂γ2log⁡Zγ=Var⁡γ(E), and Sγ=log⁡Zγ+γEˉγ as in Summable canonical differentiation. Countable nonnegative sums use the finite-subsum supremum convention of Countable canonical model.

Facts & Assumptions

Given: AC, a nonzero complex Hilbert space, a self-adjoint semibounded operator, the specified Borel functional calculus, trace-class Kβ, and a bounded operator B.

[A1]

The Hilbert space is nonzero; A is self-adjoint with spectral support in [a,∞); AC is adopted; β>0; and Kβ is trace class. For the interval clause, the same list (Ej) has the local summable moment envelope stated in the theorem.

[A2]

B is a bounded operator on H.

[F1]

The Axiom of Choice and Spectral theorem for unbounded self-adjoint operators (PVM form): under AC a self-adjoint A has a regular PVM E, domain D(A)={x:∫λ2dEx<∞}, and Ax=∫λdE(λ)x.

[F2]

Bounded borel pvm integral: for bounded Borel f, K=ΦE(f) satisfies ∥Kx∥2=∫∣f∣2dEx and nonnegative f gives a positive operator.

[F3]

Spectral theorem for compact self adjoint operators and Orthonormal eigenbasis for a compact self adjoint operator: compact self-adjoint operators have finite-dimensional nonzero eigenspaces whose closed span is (ker⁡K)⊥; under AC their union has a complete orthonormal eigenbasis when ker⁡K=0.

[F4]

Trace class operator and Trace of a positive operator is the sum of its eigenvalues: positive trace-class operators are compact and their trace is the sum of their nonnegative eigenvalues with multiplicity.

[F5]

Trace is absolutely convergent and basis independent and Trace class is a two sided Banach operator ideal: the trace is basis-independent and linear in trace-class operators, and multiplying a trace-class operator by a bounded operator preserves trace class.

[F6]

Countable canonical model and Summable canonical differentiation: nonnegative countable sums are suprema of finite subsums, and the stated local moment envelope gives a finite partition sum, finite mean and variance, and the canonical derivative and entropy identities.

[F7]

Cyclicity of the trace: for trace-class S and bounded B, Tr⁡(SB)=Tr⁡(BS).

[F8]

Real and complex inner-product spaces and their induced length: the inner product is linear in the first argument and conjugate-linear in the second.

[F9]

Absolute value and singular values of a compact operator: for compact T, its positive singular values are the positive eigenvalues of the positive operator ∣T∣=(T∗T)1/2 counted with multiplicity. In particular, if T is positive then its absolute value equals T.

[F10]

Parseval equivalences for an orthonormal family: a complete orthonormal family has Parseval equality and its finite-coordinate projections converge in norm to each vector.

[F11]

The exponential is a continuous bijection from R onto (0,∞) and The exponential function is strictly increasing: the real exponential is continuous, positive, injective, and strictly increasing.

[F12]

The natural logarithm as the inverse of the exponential function: for x>0, log⁡x is the unique real y satisfying ey=x, so exp⁡(log⁡x)=x and log⁡(exp⁡y)=y.

[F13]

Integral of a simple function against a pvm, Projection valued measure, and Scalar and complex measures from a pvm: for a simple function s=∑kck1Dk in disjoint normal form, ∫s dE=∑kckE(Dk); the PVM satisfies E(B∩C)=E(B)E(C) and E(R)=I, each E(Dk) is self-adjoint with ⟨E(Dk)x,x⟩=∥E(Dk)x∥2≥0, and Ex(B)=⟨E(B)x,x⟩ is a positive countably additive measure with Ex(R)=∥x∥2.

[F14]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, so inner products are continuous under norm convergence.

[F15]

Bounded finite rank operators are compact and Norm limit of compact operators is compact: bounded finite-rank operators are compact, and under AC a norm limit of compact operators into the Hilbert space H is compact.

[F16]

Monotonicity and nonnegative homogeneity of the nonnegative integral, The nonnegative integral agrees with the simple integral on simple functions, and The integral of a nonnegative simple function: the nonnegative integral is monotone and homogeneous for positive scalars, and ∫1C dμ=μ(C) for measurable C.

Proof

Given: AC, a nonzero complex Hilbert space, self-adjoint semibounded A, its spectral PVM, a parameter β>0, and trace-class Kβ.

1.1A1F1F2F11F13F14F16

Since β>0, −βλ≤−βa for λ≥a; strict increase and positivity from [F11] show that fβ is bounded and strictly positive. Each branch is continuous and their values agree at a, so fβ is Borel. For each n, partition its bounded range into finitely many intervals of length at most 1/n and take their Borel preimages; choosing a nonnegative value in each interval gives a nonnegative real simple sn converging uniformly to fβ. By [F13], Tn:=∫sn dE is a finite real linear combination of self-adjoint projections, hence self-adjoint and has nonnegative quadratic form. By [F2], Tn→Kβ in operator norm. Therefore ⟨Kβx,y⟩=⟨x,Kβy⟩ and ⟨Kβx,x⟩≥0 by [F14] and passage to the limit, so Kβ is self-adjoint and positive. If Kβx=0, [F2] gives ∫fβ2dEx=0. For each n≥1, fβ≥1/n on Cn:={λ:fβ(λ)≥1/n}; [F16] gives 0=∫fβ2dEx≥n−2Ex(Cn), so Ex(Cn)=0. The sets Cn increase to R; set D1=C1 and Dn=Cn∖Cn−1 for n>1. They are disjoint, cover R, and satisfy Ex(Dn)≤Ex(Cn)=0. Countable additivity in [F13] gives Ex(R)=∑nEx(Dn)=0, hence ∥x∥=0 and Kβ is injective.

2.1A1F3F4step 1.1

By the trace-class definition [F4], Kβ is compact; together with step 1.1 it is compact self-adjoint and positive. Apply [F3]: its nonzero eigenspaces have finite multiplicity and span (ker⁡Kβ)⊥=H, so AC supplies a finite or countable complete orthonormal family (uj) of eigenvectors with eigenvalues κj>0. By [F4], Zβ=Tr⁡Kβ=∑jκj<∞; because H≠0 and Kβ is injective, this sum is positive.

3.1A1F1F2F3F4F11F12F13F16step 2.1

Fix j. To justify the constant shift in the calculus, choose bounded simple sn→fβ uniformly. By [F13], ∫(sn−κj) dE=∫sn dE−κjI; [F2] passes both uniform limits, so ΦE(fβ−κj)=Kβ−κjI. Applying the norm identity in [F2] to this difference and the eigenvector gives ∫∣fβ−κj∣2dEuj=∥(Kβ−κjI)uj∥2=0. For every n, [F16] shows that the set where ∣fβ−κj∣≥1/n has zero Euj-measure; their union is the complement of the level set. Hence Euj is supported on fβ−1(κj)∩[a,∞)={Ej}: injectivity of the exponential gives uniqueness, and [F12] gives Ej=−β−1log⁡κj≥a. Thus ∫λ2dEuj=Ej2<∞ and [F1] yields uj∈D(A) and Auj=Ejuj.

4.1A1F1F2F4F6F8F9F10F13F14F15step 1.1step 3.1

The spectral measure of each uj is the unit mass at Ej by step 3.1. Hence ∥(I−E({Ej}))uj∥2=Euj(R∖{Ej})=0, so E({Ej})uj=uj; for Borel D not containing Ej, E(D)uj=E(D)E({Ej})uj=E(∅)uj=0 by [F13]. For every γ>0, choose nonnegative simple sn→fγ uniformly as in step 1.1. In each disjoint normal form, [F13] then gives (∫sn dE)uj=sn(Ej)uj; the uniform-limit clause of [F2] yields Kγuj=fγ(Ej)uj=e−γEjuj. Fix γ∈J and enumerate that basis; let PN project onto its first N vectors, taking PN=I once a finite basis is exhausted. Parseval gives ∥PNx∥≤∥x∥, so KγPN is bounded and finite rank. Fix the summable envelope aj for {γ}⊂J; every finite subsum of tj:=e−γEj is at most the corresponding sum of aj, hence S:=∑jtj<∞ by the finite-subsum definition [F6]. This sum is positive because the basis is nonempty and every term is positive. For ε>0, choose a finite set F with S−ε<∑j∈Ftj; once N contains F, every finite tail subsum is at most S−∑j∈Ftj<ε, so ∑j>Ntj→0. Again by Parseval, ∥(Kγ−KγPN)x∥2=∑j>Ne−2γEj∣⟨x,uj⟩∣2≤(∑j>Ne−γEj)2∥x∥2, so KγPN converges to Kγ in operator norm. For tj=e−γEj its finite diagonal expansion is KγPNx=∑j≤Ntj⟨x,uj⟩uj; orthonormality and [F8] give ⟨KγPNx,y⟩=⟨x,KγPNy⟩ and ⟨KγPNx,x⟩=∑j≤Ntj∣⟨x,uj⟩∣2≥0. Thus each truncation is self-adjoint and positive, and [F14] plus operator-norm convergence preserves both properties. It is compact by [F15], since the truncations are bounded finite-rank operators and H is Banach. Thus Kγ is compact self-adjoint and positive. Its absolute value is Kγ, by the unique positive square-root definition in [F9]. If Kγx=λx, taking coordinates in the complete basis gives (tj−λ)⟨x,uj⟩=0 for every j; thus its eigenvalues and their multiplicities are exactly the diagonal values tj. Hence [F9] identifies its positive singular values, with multiplicity, as the list (tj). Their finite subsums are bounded by ∑jaj, so the trace-class definition [F4] applies and gives Tr⁡Kγ=∑jtj.

5.1A1F5F6step 2.1step 4.1

At the fixed β, ρβ=Kβ/Zβ is positive trace class and [F5] gives Tr⁡ρβ=Zβ−1Tr⁡Kβ=1. For each γ∈J, ργ=Kγ/Zγ likewise has trace one; its eigenvalues pj=e−γEj/Zγ form the canonical law, so [F6] gives the finite mean, variance, and identity −∑jpjlog⁡pj=log⁡Zγ+γ∑jpjEj.

6.1A1A2F3F5F7F8step 5.1∎

For bounded B, [F5] makes ρβB and Bρβ trace class and [F7] gives Tr⁡(ρβB)=Tr⁡(Bρβ). Evaluate the second trace in the complete basis (uj): Tr⁡(Bρβ)=∑j⟨Bρβuj,uj⟩=∑jpj⟨Buj,uj⟩, where [F8] and real pj justify pulling the scalar out. This series is absolutely convergent since ∣⟨Buj,uj⟩∣≤∥B∥ and ∑jpj=1.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Grand-response derivatives are covariances

Statement

Let (X,Σ,μ) be a measure space, let w:X→[0,∞) and Xa:X→R (1≤a≤r) be measurable, and let U⊆Rr be open. For θ=(θ1,…,θr), define θ⋅X(x):=∑a=1rθaXa(x). Set Z(θ):=∫wexp⁡(θ⋅X) dμ and assume 0<Z(θ)<∞ on U. Suppose for every compact K⊂U there is an integrable GK≥0 such that weθ⋅X(1+∑a∣Xa∣2)≤GK pointwise for all θ∈K. For the normalized density pθ=weθ⋅X/Z(θ), define EθY:=∫Ypθ dμ when integrable and Cov⁡θ(Xa,Xb):=Eθ[(Xa−EθXa)(Xb−EθXb)]. Then ∂alog⁡Z=EθXa and ∂bEθXa=Cov⁡θ(Xa,Xb). Thus the Hessian of log⁡Z is positive semidefinite. This is a mathematical model identity; it assumes no independence or absence of correlations.

Facts & Assumptions

Given: As stated in the item.

[A1]

(X,Σ,μ) is a measure space; w is finite-valued nonnegative measurable and each Xa is real-valued measurable; U is open, Z is positive finite, and the displayed compact-parameter envelope is integrable.

[F1]

Measure space and integral: measurable integrals and densities use the fixed reference measure μ.

[F2]

Dominated convergence for the measure integral: a measurable pointwise-limit representative of measurable functions dominated by an integrable envelope is integrable, and the limit passes through the integral. On a noncomplete measure space the named representative must be measurable; the canonical measurable representative always exists. The limits used below are measurable by [F7].

[F3]

Proof

Given: The parameterized measure model and its compact-parameter integrable envelopes.

1.1A1F1F2F3F5F6F7

For each fixed parameter, measurable energy/observable coordinates and [F7] make every finite linear combination, exponential weight, weighted first/second moment and parameter difference quotient measurable; their displayed pointwise derivative limits are the same measurable compositions. For a coordinate direction a, the difference quotient of weθ⋅X tends pointwise to wXaeθ⋅X. On a compact neighborhood K′ of θ, the mean-value theorem [F5] bounds its absolute value by w∣Xa∣eη⋅X for an intermediate parameter η∈K′, at most GK′. Dominated convergence [F2] therefore gives ∂aZ=∫wXaeθ⋅Xdμ. Applying the same argument to the first-moment numerator gives ∂b∫wXaeθ⋅Xdμ=∫wXaXbeθ⋅Xdμ; the same envelope controls this quotient because ∣XaXb∣≤1+∑c∣Xc∣2.

2.1A1F1F4step 1.1

Divide the first derivative by Z>0 and use [F4] to obtain ∂alog⁡Z=EθXa. The quotient rule for the normalized first moment gives ∂bEθXa=Eθ(XaXb)−EθXaEθXb, the covariance.

3.1A1step 2.1∎

For any v∈Rr, vT(∇2log⁡Z)v=Eθ[(v⋅X−Eθ(v⋅X))2]≥0. This proves positive semidefiniteness without any independence assumption.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Single-mode Bose and Fermi occupation fluctuations

Statement

For q∈(0,1), the bosonic geometric law on n∈N0 with weights (1−q)qn has mean q/(1−q) and variance q/(1−q)2=E[n](1+E[n]); its relative standard deviation, defined as Var⁡(n)/E[n], tends to 1 as q↑1. The fermionic two-state law on n∈{0,1} with weights 1/(1+q) and q/(1+q) has mean q/(1+q) and variance q/(1+q)2=E[n](1−E[n]). Here Bose and Fermi name these explicitly specified counting laws; no claim about a physical preparation is made.

Facts & Assumptions

Given: The geometric and two-state laws with q∈(0,1).

[A1]

The bosonic states are N0 with weights proportional to qn; the fermionic states are {0,1} with weights proportional to qn.

[F1]

Countable canonical model and Summable canonical differentiation: countable canonical weights normalize when the partition sum is finite, and under the envelope the mean and variance follow from derivatives of Z.

[F5]

The exponential dominates every fixed nonnegative integer power at +∞: nke−bn→0 for each fixed integer k and b>0.

Proof

Given: The geometric and two-state laws with q∈(0,1).

1.1A1F1F3F5algebra

Let SN=∑n=0Nqn. Multiplying this finite sum by 1−q gives (1−q)SN=1−qN+1. Since q=e−γ for γ>0, [F5] gives qN+1→0; hence Z=(1−q)−1 and the weights (1−q)qn sum to one. On a compact γ-interval [b,B]⊂(0,∞), set an=(1+n2)e−bn. Then an+1/an=e−b(1+(n+1)2)/(1+n2)→e−b<1. Choose c with e−b<c<1; for all sufficiently large n, an+1≤can, so the tail is bounded by a convergent geometric series. Thus ∑n(1+n2)e−γn≤∑nan<∞, which is the local envelope required by [F1].

1.2A1F2F3

The fermionic partition sum is 1+q; its two probabilities are 1/(1+q) and q/(1+q). Their finite weighted sums give mean q/(1+q) and variance q/(1+q)2, equal to the mean times one minus the mean.

2.1F1F3F4step 1.1

With Z(γ)=(1−e−γ)−1, [F1] gives En=−∂γlog⁡Z=q/(1−q) and Var⁡(n)=∂γ2log⁡Z=q/(1−q)2. Substitution q=e−γ and [F4] justify the parameter derivatives. Therefore Var⁡(n)/En=1/q→1 as q↑1.

3.1A1step 2.1step 1.2∎

These are calculations for the two specified probability laws only; no independence, physical preparation, or measured fluctuation claim is used.

5 · Examples, experiments and counterexamples

None yet.

Sources