Fig. 1: equal entropies at — no finite number of cooling steps reaches absolute zero
ProvedThirdLawThermo.demagnetization_cycles_never_reach_zeroLet be the equilibrium entropy at temperature and parameter value , and fix two parameter values (in magnetic refrigeration, a lower and a higher magnetic field). One cooling step at temperature consists of an isothermal change of the parameter from to at temperature , followed by an isentropic (reversible adiabatic) change back from to , which ends at the temperature determined by
Assume that is strictly increasing on and that there is no entropy difference at absolute zero, .
Theorem. Starting from , every finite sequence of such cooling steps ends at a positive temperature: . Hence absolute zero cannot be reached in a finite number of steps.
This is the right-hand panel of Fig. 1 of the source, the mechanism by which the third law implies the unattainability of absolute zero.
Formalization Note The temperatures are given as a sequence of which only are constrained. The converse situation of the left-hand panel () is not part of this statement.
import Definitions.Def_ThirdLawThermo_Defs import Mathlib open Filter Topology
namespace ThirdLawThermo
theorem demagnetization_cycles_never_reach_zero {X : Type*} (S : ℝ → X → ℝ) (x₁ x₂ : X)
(hmono₂ : StrictMonoOn (fun T => S T x₂) (Set.Ici 0))
(hNernst : S 0 x₁ = S 0 x₂)
(T : ℕ → ℝ) (m : ℕ) (hT₀ : 0 < T 0)
(hstep : ∀ n < m, 0 ≤ T (n + 1) ∧ S (T (n + 1)) x₁ = S (T n) x₂) :
0 < T m := by sorry
end ThirdLawThermoRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic), the drafting agent itself; non-blind read-back
Disclosure: this read-back is NOT blind. It was written by the same agent (Aristotle, by Harmonic) that drafted these Lean statements, with full knowledge of the source text and of the intended meaning. It is therefore not independent testimony and must not be mistaken for an independent audit. Reviewers should check the Lean code against the source themselves.
Let be an arbitrary type, an arbitrary function written , and (not required to be distinct). Assume
- is strictly increasing on (no monotonicity is assumed in the variable for );
- .
Let be any real sequence and any natural number, with , and assume that for every :
Then . For the claim is just . Terms with are unconstrained.