Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Quasi-static adiabatic work through a reference state gives −WA→B=U(B)−U(A)-W_{A\to B}=U(B)-U(A)−WA→B​=U(B)−U(A)

Proved
FirstLawThermo.quasiStatic_adiabatic_work_eq_neg_deltaU

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

first-lawinternal-energythermodynamics

Let σ\sigmaσ be a set of states of a closed system and let WA→BW_{A\to B}WA→B​ denote the quasi-static adiabatic work done by the system in going from state AAA to state BBB. Fix a reference state OOO and a function U:σ→RU:\sigma\to\mathbb RU:σ→R. Assume

  1. formula (1): WA→O=−WO→AW_{A\to O}=-W_{O\to A}WA→O​=−WO→A​ for every state AAA;
  2. the work from AAA to BBB may be computed along a path through OOO: WA→B=WA→O+WO→BW_{A\to B}=W_{A\to O}+W_{O\to B}WA→B​=WA→O​+WO→B​ for all A,BA,BA,B;
  3. U(A)=U(O)−WO→AU(A)=U(O)-W_{O\to A}U(A)=U(O)−WO→A​ for every state AAA.

Then for all states A,BA,BA,B,

−WA→B=U(B)−U(A).-W_{A\to B}=U(B)-U(A).−WA→B​=U(B)−U(A).

This is the article's chain of equalities showing that quasi-static adiabatic work between any two states is a difference of values of the internal energy.

Formalization Note The quasi-static adiabatic work is modelled as a real-valued function of the pair of states, so its independence of the path is built into the representation.

Preamble
import Definitions.Def_FirstLawThermo_Defs
import Mathlib

open FirstLawThermo
Formal statement
theorem FirstLawThermo.quasiStatic_adiabatic_work_eq_neg_deltaU {σ : Type*}
    (W : σ → σ → ℝ) (U : σ → ℝ) (O : σ)
    (hrev : ∀ A : σ, W A O = -W O A)
    (hpath : ∀ A B : σ, W A B = W A O + W O B)
    (hU : ∀ A : σ, U A = U O - W O A) :
    ∀ A B : σ, -W A B = U B - U A := by sorry
Source
Wikipedia, "First law of thermodynamics", revision oldid=1366986255, https://en.wikipedia.org/w/index.php?title=First_law_of_thermodynamics&oldid=1366986255; Section "Evidence for the first law of thermodynamics for closed systems", subsection "Adiabatic processes": formula (1) WA→Oadiabatic, quasi-static=−WO→Aadiabatic, quasi-staticW^{\text{adiabatic, quasi-static}}_{A\to O}=-W^{\text{adiabatic, quasi-static}}_{O\to A}WA→Oadiabatic, quasi-static​=−WO→Aadiabatic, quasi-static​, the definition U(A)=U(O)−WO→AadiabaticU(A)=U(O)-W^{\text{adiabatic}}_{O\to A}U(A)=U(O)−WO→Aadiabatic​, and the displayed chain −WA→B=−WA→O−WO→B=WO→A−WO→B=−U(A)+U(B)=ΔU-W_{A\to B}=-W_{A\to O}-W_{O\to B}=W_{O\to A}-W_{O\to B}=-U(A)+U(B)=\Delta U−WA→B​=−WA→O​−WO→B​=WO→A​−WO→B​=−U(A)+U(B)=ΔU.
Read-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.

For an arbitrary type σ\sigmaσ (possibly empty), an arbitrary function W:σ×σ→RW:\sigma\times\sigma\to\mathbb RW:σ×σ→R (written WA→BW_{A\to B}WA→B​), an arbitrary function U:σ→RU:\sigma\to\mathbb RU:σ→R and a point O∈σO\in\sigmaO∈σ, assume

  1. WA→O=−WO→AW_{A\to O}=-W_{O\to A}WA→O​=−WO→A​ for every A∈σA\in\sigmaA∈σ;
  2. WA→B=WA→O+WO→BW_{A\to B}=W_{A\to O}+W_{O\to B}WA→B​=WA→O​+WO→B​ for all A,B∈σA,B\in\sigmaA,B∈σ;
  3. U(A)=U(O)−WO→AU(A)=U(O)-W_{O\to A}U(A)=U(O)−WO→A​ for every A∈σA\in\sigmaA∈σ.

Then for all A,B∈σA,B\in\sigmaA,B∈σ,

−WA→B=U(B)−U(A).-W_{A\to B}=U(B)-U(A).−WA→B​=U(B)−U(A).

No notion of "process", "adiabatic" or "quasi-static" appears in the statement. WWW is just a two-argument real function. Hypothesis 1 at A=OA=OA=O forces WO→O=0W_{O\to O}=0WO→O​=0, and hypothesis 3 at A=OA=OA=O is then automatic. The hypotheses are satisfiable, e.g. by W≡0W\equiv 0W≡0 and UUU constant.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me