A multiplicative two-variable function is a ratio of a positive function of one variable
ProvedSecondLawThermo.exists_temperature_scale_of_mulThroughout, is a type of empirical temperatures carrying a linear order ( means the reservoir at is colder than the one at ), and a cycle is a finitely supported function : for each reservoir temperature , the number is the net heat absorbed by the device from the reservoir at in one complete cycle (negative when heat is rejected to it), and only finitely many reservoirs are touched. The work delivered in the cycle is
which is the first law for a device returning to its initial state. A set of cycles stands for the physically realizable ones; it is assumed to be a convex cone: , (run two devices side by side), and for (scale a device). A cycle is reversible when and . A cycle operates between and when for every . A Carnot engine between a hot reservoir and a cold reservoir is a reversible cycle operating between and with , and . The efficiency relative to the hot reservoir is .
Statement. Let be linearly ordered and let be positive on ordered pairs, for , and multiplicative in the sense that
Then for every and every there is a function with everywhere, , and
This is the step by which the article converts the composition law for the reversible heat ratio into a temperature scale, with the triple point of water and : "Therefore, if thermodynamic temperature is defined by then the function , viewed as a function of thermodynamic temperatures, is simply ."
Formalization Note The statement is purely about the functional equation, with no thermodynamic content; the reference temperature need not be extremal, so the scale is built from below and from above it.
import Definitions.Def_SecondLawThermo_Defs import Mathlib
namespace SecondLawThermo
theorem exists_temperature_scale_of_mul {Θ : Type*} [LinearOrder Θ] (f : Θ → Θ → ℝ)
(hf_pos : ∀ h k : Θ, k < h → 0 < f h k)
(hf_mul : ∀ T₁ T₂ T₃ : Θ, T₃ < T₂ → T₂ < T₁ → f T₁ T₃ = f T₁ T₂ * f T₂ T₃)
(T₀ : Θ) (a : ℝ) (ha : 0 < a) :
∃ T : Θ → ℝ, (∀ t, 0 < T t) ∧ T T₀ = a ∧ ∀ h k : Θ, k < h → f h k = T k / T h := by sorry
end SecondLawThermoRead-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 a linearly ordered type and an arbitrary function of two arguments. Assume:
- whenever ;
- whenever and .
Let and with . Then there exists such that for every , , and for all .
Nothing is assumed, and nothing is asserted, about the values for ; those values are unconstrained and the conclusion does not mention them. The existence claim gives some such ; it does not claim uniqueness, nor monotonicity of . If has one element the conclusion reduces to the existence of a positive number at .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.