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.
Stochastic Protocols
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Ensembles And Limits
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite Statistical Bridge
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Mixture Dynamics And Shells
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Ito Integral with Respect to Brownian Motion
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Thermodynamic Framework
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
This page defines finite driven-path and finite-rate models, adopts their preparation and bath assumptions explicitly, and proves the corresponding conditional work, fluctuation, and relaxation statements. Work is positive into the system; heat is positive into the system. The finite Jarzynski identity is an ensemble expectation, and the Crooks relation compares paired forward and reverse path laws. Mean work is bounded below by the finite free-energy difference, while individual paths can have lower work. The finite detailed-balance theorem establishes relative-entropy decrease and convergence only for a connected rate graph; it makes no claim that Shannon entropy always increases. The Ornstein–Uhlenbeck and memory-reset conclusions retain their explicit model conditions and empirical limits.
The current plan also requires the earlier page td-finite-statistical-bridge. Its current local page and batch-15 inventory include the draft postulate post-td-canonical-sampling, whose finite branch adopts the canonical law for a finite microstate set at positive temperature. The protocol-preparation postulate states the exact stage-zero instance, including and the finite positive partition sum. The bridge and its prerequisite acceptance remain pending, so conclusions that use this preparation stay conditional and the page is escalated for readiness.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Finite driven protocol and path work
A finite-microstate, finite-stage formal path model with externally changed energies and row-stochastic transitions, with a specified detailed-balanced subclass for an adopted single-equilibrium-reservoir heat interpretation; the internal-energy reading uses a common fixed chart with bulk center-of-mass dynamics suppressed, and a common rest chart requires constant center-of-mass velocity over the modeled interval; it does not assert that a material apparatus has this dynamics.
Definition
Take to be a finite nonempty microstate set as in Finite statistical microstate model: distinct elements count as distinct microstates, and the physical energy values are finite and measured in joules in the declared rest frame. For the physical internal-energy interpretation, use one declared fixed Galilean chart for every stage, with the bulk center-of-mass and separately tracked external-energy sectors suppressed from this finite protocol. The companion mechanical model supplies the center-of-mass data required by the microstate supplier; when the common chart is called a center-of-mass rest chart throughout the protocol, its center-of-mass velocity is constant over the modeled interval, and one constant boost selects that chart. This fixed-chart idealization does not infer a rest chart from the finite set or transition kernels, and does not describe an accelerating bulk body. Fix an integer and stage energy functions for , with the energy offsets fixed by the declared protocol model. Fix inverse temperature in joules. The finite partition sum and canonical probability vector at stage are and . Since is nonempty and finite and each energy is finite, and is a strictly positive probability vector.
A transition kernel at stage is a matrix with . The general class permits every such row-stochastic kernel; normalization alone imposes no thermal consistency. For the subclass interpreted as transitions due only to one equilibrium reservoir at inverse temperature , adopt the discrete detailed-balance condition for every . Since is strictly positive, if and only if ; on positive pairs this gives . In this physical subclass, also adopt that the fixed-stage energy change is entirely reservoir heat, with no untracked work, particle exchange, or intrinsic state-entropy contribution. These are model assumptions, not a deduction that an apparatus realizes this reservoir. Arbitrary row-stochastic kernels remain admissible for the formal path formulas; any other physical transfer interpretation requires a separately specified model. In the forward stage order, the energy changes instantaneously from to while the state is still ; the subsequent transition samples using at fixed energy . A path is . The initial law is a probability vector with . Its path probability is ; summing over all paths gives by the normalization of and the row sums of the kernels.
The quench-work sign is positive when the quench raises the energy. The fixed-stage energy increment is positive when the subsequent transition raises the energy; it is interpreted as heat into the system under the single-reservoir subclass assumptions just stated. On the general formal class it denotes only this energy increment. Define and , both in joules. Define and . These are finite-model quantities; their physical interpretation is conditional on the adopted preparation and transition assumptions.
Finite detailed-balance rate and transition models
Finite-state, time-homogeneous continuous-time rate models and their reversible discrete transition-kernel analogue; the definition does not assert that a physical system follows either model.
Definition
A finite rate model consists of a finite nonempty state set and rates in seconds for . Set . A row probability vector is with and ; write . A time-dependent law is a coordinatewise continuously differentiable map , with a right derivative at , that satisfies the continuous-time master equation for every . A strictly positive normalized vector is a detailed-balance law when for every distinct pair. Its undirected rate graph has an edge exactly when ; detailed balance makes this equivalent to .
On a finite nonempty state set , a discrete transition kernel is a matrix satisfying for every . For a strictly positive row probability vector , the kernel satisfies -detailed balance when for every . This identity pairs the supports of forward and reversed transitions. A rate model or a reversible kernel is a mathematical/physical model class; no observed trajectory is asserted by the definition.
Canonical initial preparation for a finite protocol
The start of the specified finite-state protocol is modeled as a canonical preparation at one positive reservoir temperature; preparation success and equilibration are not derived.
Postulate
For a protocol of Finite driven protocol and path work, fix a bath temperature kelvin and set in joules, using the exact constant and SI conventions of SI quantities and unit conventions. The finite-state clause of the adopted Canonical sampling assumption for finite and normalized statistical models then gives the stage-zero law ; adopt that the initial microstate is drawn from this law, so . Here is finite and nonempty and is finite, so as required by that clause. This is a model premise about the preparation distribution. It does not follow from the finite partition-sum definition, does not assert that an arbitrary system equilibrates in finite time, and does not report a measured preparation. The countable-state and measure-integral branches of Canonical sampling assumption for finite and normalized statistical models are not used.
Finite bath kernels preserve the stage canonical law
The transition matrices of the specified finite-state model preserve each stage's canonical probability vector; no universal Markov approximation or physical thermalization theorem is asserted.
Postulate
For the protocol in Finite driven protocol and path work, adopt, at each stage , the stationarity condition for every . This says that if the bath transition begins with law at fixed energy , it ends with the same law. It is a physical modeling assumption for this protocol family, not a consequence of the transition-kernel definition and not an assertion that the kernel mixes every initial law to .
Linear Ornstein-Uhlenbeck bath model
One-dimensional overdamped motion in a harmonic potential, with constant positive mobility and stiffness, one fixed positive bath temperature, additive Gaussian white-noise modeling, and no inertia or memory, in one fixed Galilean center-of-mass rest chart of the declared trap-and-bath body with constant center-of-mass velocity throughout the modeled interval.
Postulate
Choose a Galilean inertial chart as defined in Galilean inertial charts and the center-of-mass rest frame for the specified fixed closed trap-and-bath body, assumed to have positive total mass and the center-of-mass map required there, and supply its componentwise differentiable center-of-mass trajectory on the whole modeled time interval. Assume that its center-of-mass velocity is one constant vector on that interval, so the single constant boost of that supplier selects with zero center-of-mass velocity throughout. Take to be this common rest chart. The trap-and-bath background is held fixed in this idealization; center-of-mass recoil or accelerating-frame dynamics are not part of the scalar process. In this chart let be the fixed trap-center position and let be a fixed unit vector along the modeled trap axis. For a particle position , define the signed displacement in metres; the process in Ornstein–Uhlenbeck integral equation is this coordinate of the particle position at time . Thus is the harmonic potential relative to the trap center, not an absolute spatial coordinate. Using the SI conventions and exact of SI quantities and unit conventions, take stiffness in joules per square metre, constant mobility in square metres per joule-second, and bath temperature kelvin. Adopt the one-dimensional overdamped model , interpreted through the integral equation of Ornstein–Uhlenbeck integral equation, with in seconds and in square metres per second. Here is standard Brownian motion with its stated filtration and increment hypotheses, and the bath noise is independent of the initial preparation. This Einstein noise relation and the linear Markov model are physical assumptions. They do not follow from equilibrium thermodynamics alone and do not report a measured spectrum or calibration.
Finite memory and retained-register reset model
A finite-state memory and retained register with a specified probabilistic reset map; the definition does not assert a particular apparatus, reset dynamics, or measured work.
Definition
Let be a finite memory-state set and a finite retained-register set. A joint preparation is a probability law with . Write and, for , . Use the finite Shannon entropy in nats and the conditional entropy exactly as defined by Conditional entropy of finite memory given side information. For a fixed target memory state , a reset is the endpoint map : it places the memory at while leaving the register marginal unchanged. The definition alone assigns no physical entropy, work cost, heat transfer, or implementation.
Pathwise energy balance for a finite driven protocol
An exact energy bookkeeping identity for every path of the stated finite-state, finite-stage model; it is not a claim that all heat or work processes are represented by this model.
Statement
For every path of Finite driven protocol and path work, the endpoint energy change is , with the stated sign convention.
Facts & Assumptions
Given: A nonempty finite state set, finite stage energies, a finite path, work positive into the system, and fixed-stage energy increment positive into the system, exactly as defined in Finite driven protocol and path work.
Finite driven protocol and path work: at stage , add and subtract the pre-transition energy between endpoint energies. The fixed-stage increment is interpreted as heat only on the supplier's reservoir-consistent subclass or under a separately supplied transfer model; its formal definition applies to every path.
Proof
Given: [F1].
Insert the intermediate energies and telescope: .
For each , split the summand as . Summing the first terms gives and the second terms give .
Relative-entropy decrease and convergence for a finite detailed-balance chain
A finite, time-homogeneous continuous-time rate model satisfying detailed balance; convergence is asserted only when its positive-rate graph is connected, and no general continuum or non-Markovian relaxation theorem is claimed.
Statement
Let have states, positive detailed-balance law , and connected undirected rate graph as in Finite detailed-balance rate and transition models. For every strictly positive initial probability vector , the master equation has a unique strictly positive probability solution for all . The relative entropy is nonincreasing, and for every state. No monotonicity of Shannon entropy is asserted.
Facts & Assumptions
Given: A finite state set of size , finite rates, a positive normalized detailed-balance vector , and an initially strictly positive normalized vector .
Finite detailed-balance rate and transition models: for , , and .
Finite detailed-balance rate and transition models: is positive on graph edges, and the graph is connected.
The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , and Sums, scalar multiples, products and quotients: , , , and when : for , , and the ordinary chain and finite-product rules differentiate the entropy sum.
The exponential function is smooth and and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : differentiate and infer monotonicity on an interval from a nonpositive derivative.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the finite Cauchy--Schwarz inequality bounds a sum of at most edge increments by times their squared sum.
Proof
Given: [F1]--[F6] and .
Put and , where . Then has nonnegative entries and row sums one. The series and its differentiated series converge uniformly on bounded time intervals; its coefficients are nonnegative and sum to one, so it is a probability vector, starts at , and differentiates to . Its term gives . For uniqueness, the difference of two solutions satisfies ; with and , one has . Thus and force , hence .
With , detailed balance gives . By [F4], differentiating the finite entropy sum gives , since . Pairing the terms gives : if , then by [F3], and the reversed order gives the same product sign. The mean value theorem [F5] on each compact time interval makes nonincreasing.
Set , so , and . Since , differentiating and pairing the two orientations of each edge gives .
Let . Fix a root state and choose one simple path from it to each state; this is only a finite family of choices, obtainable successively, and each path has length at most . Telescoping and [F6] give . The zero-mean identity gives ; expanding yields . Since and , it follows that .
Thus with . By [F5], the derivative of is nonpositive and that function is nonincreasing, so . Since and , each .
Jarzynski equality for a finite protocol with stationary kernels
An exact ensemble identity for a finite state space, finite protocol, canonical initial law, and kernels preserving each stage's canonical law; no claim is made for general stochastic processes or for any individual path.
Statement
For the forward path law of Finite driven protocol and path work, under Canonical initial preparation for a finite protocol and Finite bath kernels preserve the stage canonical law, the finite expectation satisfies . This is an ensemble identity; it does not say on each path.
Facts & Assumptions
Given: A nonempty finite state space, finite energies , , a row-stochastic , initial law , and at each stage.
Finite driven protocol and path work: the path law is , and work at quench is .
Canonical initial preparation for a finite protocol: the initial law is .
Canonical sampling assumption for finite and normalized statistical models: the current draft postulate adopts the finite microstate law for finite nonempty with and . Only this finite branch is used; the countable and measurable branches are not invoked.
Proof
Given: [F1], [A1], [A2], [L1], with the finite partition sums and canonical laws of the protocol.
For and , define by the finite sum over of , with and ; put . Partitioning this finite sum by the state gives . The canonical preparation gives the base by [A1] and the finite branch of [L1].
For the induction step fix and suppose for every .
Substitute this hypothesis in the recurrence from step 1.1. Since , the previous-stage Boltzmann factor cancels against the quench factor, giving by [A2]. This proves the induction step at each stage.
The base and induction step establish for all stages. At , summing over terminal states and using normalization of gives . By , this equals .
Crooks path and work-distribution relation for a finite protocol
A path-reversal identity for a finite-state protocol whose stage kernels are reversible with respect to their positive canonical laws; it does not extend to arbitrary driven systems without matching support and reversal assumptions.
Statement
Assume the setup of Finite driven protocol and path work, the canonical initial law of Canonical initial preparation for a finite protocol, the stationarity model of Finite bath kernels preserve the stage canonical law, and, additionally, for every . For every forward path with positive probability, define its reverse probability by . Then and . Consequently, at each work value , . The reverse protocol first applies the stage- reverse transition at fixed , then reverses the quench ; its work is .
Facts & Assumptions
Given: The finite protocol with canonical initial and terminal laws, strictly positive , stationary stage kernels, and the additional stagewise detailed-balance equations.
Finite driven protocol and path work: quench changes to before transition ; is work on the system.
Finite detailed-balance rate and transition models: the kernel balance equation is .
Canonical initial preparation for a finite protocol: the forward initial law is .
Finite bath kernels preserve the stage canonical law: each preserves .
Pathwise energy balance for a finite driven protocol: with the stated signs.
Proof
Given: [F1], [F2], [A1], [A2], and [F3].
Define the reverse path law by starting with and, in reverse order, using at fixed energy before undoing that quench. By detailed balance, if then , because is strictly positive. Thus positive forward paths pair with positive reverse paths.
On a paired path, divide the endpoint Gibbs weights and use detailed balance for each transition: . Substituting and collecting terms gives by [F3].
The reversed quench at stage occurs at state , so its work term is ; summing proves . Summing the path ratio over the finite set of paths with proves the stated distribution identity.
Thermal fluctuations in the specified linear harmonic bath model
Conditional predictions of the specified one-dimensional linear Ornstein-Uhlenbeck model after stationary Gaussian preparation; in the postulate’s common fixed Galilean rest chart with constant trap-and-bath center-of-mass velocity throughout the modeled interval; not empirical claims and not general laws for arbitrary baths.
Statement
Assume the Axiom of Choice The Axiom of Choice: every family of nonempty sets has a choice function. It is inherited from the Brownian and Itô-integral suppliers used for the stationary Gaussian model.
Under Linear Ornstein-Uhlenbeck bath model, prepare independently of future Brownian increments, where . Then the conditional linear model has stationary covariance . With angular-frequency convention , its spectrum is . For every averaging time , . These are model predictions, not reported observations.
Facts & Assumptions
Given: The Axiom of Choice and the postulated harmonic potential, fixed temperature, positive mobility/stiffness, Einstein relation, and stationary Gaussian initial law.
Linear Ornstein-Uhlenbeck bath model: use its supplied mechanical center-of-mass data and one constant rest boost throughout the modeled time interval; , , and the stochastic differential is interpreted by the supplied integral equation.
Ornstein–Uhlenbeck equation, transition law, and fluctuations: actual current carrier status is draft; its inspected statement assumes the Brownian filtration and initial-data conditions of Ornstein–Uhlenbeck integral equation, and for gives stationary covariance , spectrum , and time-average variance at most .
Proof
Given: The Axiom of Choice and [A1], [F1], , and independent of future increments.
The physical postulate gives . This has units of square metres because is joules and is joules per square metre.
The inspected mathematical supplier's stationary clause applies with this and , so and .
The same supplier's time-average bound becomes . All three formulas are conditional deductions of the adopted model; no apparatus, observed value, or measured uncertainty is asserted.
Conditional work bound for finite memory reset
A conditional endpoint work bound for a finite memory reset with fixed retained-register marginal, a positive-temperature ideal bath, the stated entropy identification, and no endpoint energy change; no universal cost per bit or measured work is asserted.
Statement
For the reset model of Finite memory and retained-register reset model, use the exact SI value and conventions of SI quantities and unit conventions. Assume (i) the dimensionless Shannon entropies in nats from Conditional entropy of finite memory given side information give memory-register thermodynamic entropy in joules per kelvin at both endpoints, with in joules per kelvin, (ii) a single ideal reservoir remains at fixed temperature kelvin and receives heat in joules, (iii) the memory-register endpoint energy is unchanged so the adopted first-law convention gives work on the system in joules, and (iv) the total entropy change obeys in joules per kelvin. Then , with both sides in joules. Equality is not asserted without a separately specified reversible implementation.
Facts & Assumptions
Given: Finite sets , a joint law, the reset map, , work positive on the system, and heat positive into the bath.
Finite memory and retained-register reset model: the reset makes and preserves the register marginal .
Conditional entropy of finite memory given side information: actual current carrier status is draft; its inspected statement for finite joint laws gives and . Its proof directly expands and treats zero marginals separately.
Adopt the finite-memory entropy identification at each endpoint.
Adopt an ideal fixed-temperature bath with and entropy change for heat delivered to it.
Adopt unchanged endpoint energy and the convention for work on the memory-register system and heat delivered to the bath.
Adopt total entropy nondecrease for this reset process: .
Proof
Given: [F1], [F2], and physical assumptions [A1]--[A4].
Initially the memory-register entropy is by [F2] and [A1]. After reset, the memory is deterministic conditional on each register value, so ; applying the same finite entropy chain rule gives final entropy .
Therefore . Substitution into [A4] gives because .
By the adopted endpoint first-law convention [A3], , so . The conclusion is conditional on [A1]--[A4]; the entropy bound alone does not assert that the reset can be implemented reversibly or that every bit erasure costs .
Mean work is at least the finite free-energy difference
An inequality for the ensemble-mean work in the finite protocol under the Jarzynski model assumptions; it is not a per-path second-law inequality and is not an empirical statement.
Statement
Under the hypotheses of Jarzynski equality for a finite protocol with stationary kernels, the mean work obeys . The conclusion concerns the path ensemble only; individual paths may have .
Facts & Assumptions
Given: A finite-valued work random variable under the forward path law and .
The two-point convexity inequality for the exponential function: is convex on .
Finite Jensen inequality for a convex function and nonnegative weights summing to one: for a finite probability vector and real values , .
The exponential function is strictly increasing: the exponential is strictly increasing on .
Proof
Given: [F1]--[F4].
Apply finite Jensen to the finitely many forward paths with and weights . Then .
Strict increase of the exponential yields . Since , multiplying by reverses the order and gives .
5 · Examples, experiments and counterexamples
None yet.
Sources
- C. Jarzynski, Introduction to Nonequilibrium Statistical Physics, lecture notes, Nonequilibrium Work Relations
- U. Seifert, Stochastic thermodynamics, fluctuation theorems, and molecular machines
- C. Jarzynski, Introduction to Nonequilibrium Statistical Physics, lecture notes, Detailed Balance
- C. Jarzynski, Nonequilibrium Equality for Free Energy Differences
- C. Jarzynski, Introduction to Nonequilibrium Statistical Physics, lecture notes, Maxwell's Demon
- C. Jarzynski, Introduction to Nonequilibrium Statistical Physics, lecture notes, Relative Entropy and Relaxation to Equilibrium
- C. Crooks, Entropy production fluctuation theorem and the nonequilibrium work relation for free energy differences