Alphabeta Math
PostulateStatement: AI-adaptedProof: Not applicablePipeline-generated‡ sources checked 2026-10-15
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite-protocol unattainability on a declared zero-temperature boundary

Physical scope

A model-specific full family of admitted finite-duration cooling protocols for a nonempty positive-temperature domain and an explicitly represented nonempty zero-temperature boundary; the postulate is substantive only when positive-start protocols are admitted and the family is not defined to exclude the boundary by construction. No universal statement about all possible controls, dynamics, or materials is made.

Postulate

For a declared material constitution c, let Dc,+⊆Dc be its designated equilibrium states with finite positive absolute temperature, and require Dc,+≠∅ for a nonvacuous application. Let D0 be a separately declared nonempty set of zero-temperature boundary preparations, disjoint from Dc,+, and let D‾c:=Dc,+⊔D0,T‾c:D‾c→[0,∞) extend the thermodynamic temperature from Entropic temperature, pressure, and molar chemical potentials by T‾c∣Dc,+=Tc and T‾c(y)=0 for y∈D0.

Let Uc be the model-declared set of cooling controls, and let C⊆D‾c×D‾c×Uc×(0,∞) be the model's full declared family of admitted cooling operation records. Each record γ=(x−,x+,u,τ) has initial-endpoint map i(γ)=x−, final-endpoint map f(γ)=x+, control u∈Uc, and finite positive duration τ(γ)=τ seconds. Its positive-temperature portions obey the process conventions of Thermodynamic process records and transfer conventions, while the model separately declares how a boundary endpoint in D0 is represented. Define two records to be compatible exactly when f(γ)=i(γ′). A finite protocol is a tuple (γ1,…,γm) for m∈N, m≥1 (The natural numbers N (von Neumann)), with each successive pair compatible; its initial and final endpoints are i(γ1) and f(γm), and its duration is ∑j=1mτ(γj). Let PC be the set of all such finite protocols and let PC+:={p∈PC:i(p)∈Dc,+}. For each p=(γ1,…,γm), define i(p):=i(γ1), f(p):=f(γm), and τ(p):=∑j=1mτ(γj)<∞. For a nonvacuous application, require PC+≠∅ and declare C as the full operation family rather than defining it to exclude boundary endpoints. Define Reach⁡C:={(i(p),f(p)):p∈PC}⊆D‾c×D‾c.

The adopted operational unattainability postulate is Reach⁡C∩(Dc,+×D0)=∅. This is a separate physical assumption from the Nernst heat-theorem postulate; neither is deduced here from the first or second law. If Dc,+, D0, or PC+ is empty, or if no boundary endpoint is available in the declared operation-record space because the model defines every operation to stay in Dc,+, the assertion is absent or vacuous and is not evidence for unattainability. The postulate does not remove the need to state the actual state space, controls, and admitted operations.

Source scope

Masanes and Oppenheim, Introduction, formulate unattainability in terms of finitely many operations in finite time. The reachability notation above is this framework's explicit formulation of that operational principle. Their quantum cooling bounds require additional dynamical, bath, and work-resource assumptions, listed in their Fundamental Assumptions; those bounds are not a derivation of the postulate for the arbitrary declared operation family here. Tong §4.5 and Arovas §2.6.2 provide context for the distinct entropy form of the third law, not this operational exclusion.

Depends on

Dependency tree · 2 levels

Sources