The Kelvin statement implies the Clausius statement
ProvedSecondLawThermo.clausius_of_kelvinThroughout, 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 a convex cone of realizable cycles admitting a Carnot engine between every pair of reservoirs at different temperatures. If the Kelvin statement holds for , then so does the Clausius statement:
This is one half of the article's claim that "the Clausius and the Kelvin statements have been shown to be equivalent": a device transferring heat from a cold to a hot reservoir with no other change can be combined with a Carnot engine so that the composite exchanges heat with one reservoir only and delivers positive work.
import Definitions.Def_SecondLawThermo_Defs import Mathlib
namespace SecondLawThermo
theorem clausius_of_kelvin {Θ : Type*} [LinearOrder Θ] (𝒞 : Set (Cycle Θ)) (h𝒞 : IsCycleCone 𝒞)
(hCarnot : CarnotEnginesExist 𝒞) (hK : KelvinStatement 𝒞) :
ClausiusStatement 𝒞 := 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 a set of finitely supported functions (each such function assigning to a temperature the number , with ). Assume:
- contains , is closed under addition, and is closed under multiplication by every real ;
- for all there exists with , for , , and ;
- for every and every with for all , one has .
Then: for all and every with for and , one has .
Both the hypothesis 3 and the conclusion are non-strict inequalities; the conclusion permits . If has at most one element the hypothesis 2 and the conclusion are both vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.