AFTD Auto-Formalizing Theoretical Domains

canonical_partition_function_pos

theoremverified

For any nonempty finite configuration space Ω, Hamiltonian H : Ω → ℝ, and inverse temperature β, the canonical partition function is strictly positive.

Statement

theorem canonical_partition_function_pos {Ω : Type*} [Fintype Ω] [Nonempty Ω] (H : Ω → ℝ) (β : ℝ) :
    0 < canonicalPartitionFunction H β
Source
Friedli & Velenik, Statistical Mechanics of Lattice Systems (2017), Section 1.2
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • canonicalPartitionFunctionThe canonical partition function Z(β) of a system with finite configuration space Ω and Hamiltonian H : Ω → ℝ at inverse temperature β is…
Used by 1
  • boltzmann_distribution_sum_eq_oneFor any nonempty finite configuration space Ω, Hamiltonian H : Ω → ℝ, and inverse temperature β, the sum of the Boltzmann distribution…

Read back from the Lean

For any finite, nonempty type Ω, any function H : Ω → ℝ, and any real number β, the canonical partition function canonicalPartitionFunction H β is strictly positive (greater than 0).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

By definition, the canonical partition function is the sum of Boltzmann weights exp(-β * H(ω)) over all configurations ω in the finite space Ω. Because Ω is nonempty, there is at least one state ω₀. Since the exponential function is strictly positive everywhere, every summand is non-negative and the summand at ω₀ is strictly positive, which implies that the total sum is strictly positive.

  1. The goal reduces to showing that ∑ ω : Ω, exp(-β * H ω) > 0.

    Unfolding the definition of the canonical partition function canonicalPartitionFunction expresses it as the sum of Boltzmann factors exp(-β * H ω) over all configurations in Ω.

    line 4

      unfold canonicalPartitionFunction
  2. There exists a configuration ω₀ ∈ Ω.

    Since the configuration space Ω is assumed to be nonempty, we can choose an element ω₀ ∈ Ω to serve as a witness.

    line 5

      obtain ⟨ω₀⟩ := (inferInstance : Nonempty Ω)
  3. The canonical partition function is strictly positive.

    A finite sum is strictly positive if every term is non-negative and at least one term is strictly positive (Finset.sum_pos'). Since the real exponential is everywhere positive (Real.exp_pos), every summand exp(-β * H ω) is non-negative, and the summand evaluated at ω₀ (which belongs to the universe of states by Finset.mem_univ) is strictly positive.

    line 6

    uses Finset.sum_pos', Real.exp_pos, Finset.mem_univ

      exact Finset.sum_pos' (fun ω _ => (Real.exp_pos _).le) ⟨ω₀, Finset.mem_univ ω₀, Real.exp_pos _⟩
Finset.sum_pos'
A finite sum of elements in an ordered cancellative additive monoid is strictly positive if all summands are non-negative and at least one summand is strictly positive.
Real.exp_pos
For every real number x, the exponential exp(x) is strictly positive.
Finset.mem_univ
Every element of a finite type belongs to the universal finset containing all terms of that type.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The canonical partition function of a nonempty finite system is strictly positive. -/theorem canonical_partition_function_pos {Ω : Type*} [Fintype Ω] [Nonempty Ω] (H : Ω → ℝ) (β : ℝ) :    0 < canonicalPartitionFunction H β := by  unfold canonicalPartitionFunction  obtain ⟨ω₀⟩ := (inferInstance : Nonempty Ω)  exact Finset.sum_pos' (fun ω _ => (Real.exp_pos _).le) ⟨ω₀, Finset.mem_univ ω₀, Real.exp_pos _⟩
See it in the graphDiscuss this resultChallenge it