Alphabeta Math
Pipeline-generated
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

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 β=(kBTb)−1 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

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite driven protocol and path work

Physical scope

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 m≥1 and stage energy functions Ek:Ω→R J for k=0,…,m, with the energy offsets fixed by the declared protocol model. Fix inverse temperature β>0 in joules−1. The finite partition sum and canonical probability vector at stage k are Zk=∑i∈Ωe−βEk(i) and πk(i)=e−βEk(i)/Zk. Since Ω is nonempty and finite and each energy is finite, 0<Zk<∞ and πk is a strictly positive probability vector.

A transition kernel at stage k is a matrix Kk(i,j)≥0 with ∑j∈ΩKk(i,j)=1. 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 πk(i)Kk(i,j)=πk(j)Kk(j,i) for every k,i,j. Since πk is strictly positive, Kk(i,j)>0 if and only if Kk(j,i)>0; on positive pairs this gives Kk(i,j)/Kk(j,i)=e−β(Ek(j)−Ek(i)). 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 Ek−1 to Ek while the state is still ik−1; the subsequent transition samples ik using Kk(ik−1,ik) at fixed energy Ek. A path is ω=(i0,…,im)∈Ωm+1. The initial law is a probability vector μ0:Ω→[0,1] with ∑i∈Ωμ0(i)=1. Its path probability is PF(ω)=μ0(i0)∏k=1mKk(ik−1,ik); summing over all paths gives 1 by the normalization of μ0 and the row sums of the kernels.

The quench-work sign is positive when the quench raises the energy. The fixed-stage energy increment Qin 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 W(ω)=∑k=1m[Ek(ik−1)−Ek−1(ik−1)] and Qin(ω)=∑k=1m[Ek(ik)−Ek(ik−1)], both in joules. Define Fk=−β−1log⁡Zk and ΔF=Fm−F0=−β−1log⁡(Zm/Z0). These are finite-model quantities; their physical interpretation is conditional on the adopted preparation and transition assumptions.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite detailed-balance rate and transition models

Physical scope

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 S and rates qij≥0 in seconds−1 for i≠j. Set qii=−∑j≠iqij. A row probability vector is p=(pi)i∈S with pi≥0 and ∑ipi=1; write Δ(S)={p∈[0,1]S:∑ipi=1}. A time-dependent law is a coordinatewise continuously differentiable map p:[0,∞)→Δ(S), with a right derivative at t=0, that satisfies the continuous-time master equation p˙i(t)=∑j≠i[pj(t)qji−pi(t)qij] for every t≥0. A strictly positive normalized vector π is a detailed-balance law when πiqij=πjqji for every distinct pair. Its undirected rate graph has an edge {i,j} exactly when πiqij>0; detailed balance makes this equivalent to πjqji>0.

On a finite nonempty state set S, a discrete transition kernel is a matrix K:S×S→[0,1] satisfying ∑j∈SK(i,j)=1 for every i∈S. For a strictly positive row probability vector π∈Δ(S), the kernel satisfies π-detailed balance when πiK(i,j)=πjK(j,i) for every i,j∈S. 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.

PostulateStatement: Literature-sourcedProof: Not applicable‡ sources checked 2026-10-15Open item page →

Canonical initial preparation for a finite protocol

Physical scope

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 Tb>0 kelvin and set β=(kBTb)−1 in joules−1, 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 π0(i)=e−βE0(i)/Z0; adopt that the initial microstate is drawn from this law, so μ0=π0. Here Ω is finite and nonempty and E0(i) is finite, so 0<Z0<∞ 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.

PostulateStatement: Literature-sourcedProof: Not applicable‡ sources checked 2026-10-15Open item page →

Finite bath kernels preserve the stage canonical law

Physical scope

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 k=1,…,m, the stationarity condition ∑i∈Ωπk(i)Kk(i,j)=πk(j) for every j∈Ω. This says that if the bath transition begins with law πk at fixed energy Ek, 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 πk.

PostulateStatement: Literature-sourcedProof: Not applicable‡ sources checked 2026-10-15Open item page →

Linear Ornstein-Uhlenbeck bath model

Physical scope

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 F 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 F with zero center-of-mass velocity throughout. Take F 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 rc∈R3 be the fixed trap-center position and let e∈R3 be a fixed unit vector along the modeled trap axis. For a particle position r∈R3, define the signed displacement x=⟨r−rc,e⟩ in metres; the process Xt in Ornstein–Uhlenbeck integral equation is this coordinate of the particle position at time t. Thus U(x)=kx2/2 is the harmonic potential relative to the trap center, not an absolute spatial coordinate. Using the SI conventions and exact kB of SI quantities and unit conventions, take stiffness k>0 in joules per square metre, constant mobility μ>0 in square metres per joule-second, and bath temperature Tb>0 kelvin. Adopt the one-dimensional overdamped model dXt=−γXt dt+σ dBt, interpreted through the integral equation of Ornstein–Uhlenbeck integral equation, with γ=μk in seconds−1 and σ2=2μkBTb in square metres per second. Here B 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.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite memory and retained-register reset model

Physical scope

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 M be a finite memory-state set and R a finite retained-register set. A joint preparation is a probability law p(m,r)≥0 with ∑m,rp(m,r)=1. Write ar=∑mp(m,r) and, for ar>0, q(m∣r)=p(m,r)/ar. Use the finite Shannon entropy in nats and the conditional entropy H(M∣R) exactly as defined by Conditional entropy of finite memory given side information. For a fixed target memory state m0, a reset is the endpoint map p′(m,r)=1{m=m0}ar: it places the memory at m0 while leaving the register marginal unchanged. The definition alone assigns no physical entropy, work cost, heat transfer, or implementation.

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Pathwise energy balance for a finite driven protocol

Physical scope

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 ω=(i0,…,im) of Finite driven protocol and path work, the endpoint energy change is Em(im)−E0(i0)=W(ω)+Qin(ω), 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.

[F1]

Finite driven protocol and path work: at stage k, add and subtract the pre-transition energy Ek(ik−1) between endpoint energies. The fixed-stage increment Qin 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].

1.1givenF1algebra

Insert the intermediate energies and telescope: Em(im)−E0(i0)=∑k=1m[Ek(ik)−Ek−1(ik−1)].

2.1givenF1step 1.1algebra∎

For each k, split the summand as Ek(ik−1)−Ek−1(ik−1)+Ek(ik)−Ek(ik−1). Summing the first terms gives W(ω) and the second terms give Qin(ω).

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Relative-entropy decrease and convergence for a finite detailed-balance chain

Physical scope

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 S have N≥2 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 p(0), the master equation has a unique strictly positive probability solution p(t) for all t≥0. The relative entropy D(p(t)∥π)=∑ipi(t)log⁡(pi(t)/πi) is nonincreasing, and pi(t)→πi for every state. No monotonicity of Shannon entropy −∑ipilog⁡pi is asserted.

Facts & Assumptions

Given: A finite state set of size N≥2, finite rates, a positive normalized detailed-balance vector π, and an initially strictly positive normalized vector p(0).

[F1]

Finite detailed-balance rate and transition models: qij≥0 for i≠j, qii=−∑j≠iqij, and p˙i=∑j≠i(pjqji−piqij).

[F2]

Finite detailed-balance rate and transition models: aij:=πiqij=πjqji is positive on graph edges, and the graph is connected.

[F3]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: log⁡(xy)=log⁡x+log⁡y, log⁡(1/x)=−log⁡x, and log⁡x≤0 for 0<x≤1.

[F6]

Proof

Given: [F1]--[F6] and pi(0)>0.

1.1F1F5givenalgebra

Put c=1+max⁡i∑j≠iqij and P=I+Q/c, where Q=(qij). Then P has nonnegative entries and row sums one. The series p(t)=e−ct∑n=0∞(ct)np(0)Pn/n! 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 p(0), and differentiates to p˙=pQ. Its n=0 term gives pi(t)≥e−ctpi(0)>0. For uniqueness, the difference z of two solutions satisfies z′=zQ; with C=max⁡i∑j∣qij∣ and U(t)=∫0t∥z(s)∥1ds, one has U′(t)=∥z(t)∥1≤CU(t). Thus (e−CtU(t))′≤0 and U(0)=0≤U(t) force U=0, hence z=0.

2.1F1F2F3F4F5step 1.1

With ri=pi/πi, detailed balance gives p˙i=∑j≠iaij(rj−ri). By [F4], differentiating the finite entropy sum gives D′=∑ip˙i(log⁡ri+1)=∑ip˙ilog⁡ri, since ∑ip˙i=0. Pairing the i,j terms gives D′=−∑{i,j}∈Eaij(ri−rj)(log⁡ri−log⁡rj)≤0: if ri≥rj, then log⁡ri−log⁡rj=−log⁡(rj/ri)≥0 by [F3], and the reversed order gives the same product sign. The mean value theorem [F5] on each compact time interval makes D nonincreasing.

2.2F1F2step 1.1

Set ui=ri−1, so ∑iπiui=0, and V(t)=∑iπiui2. Since u˙i=πi−1∑j≠iaij(uj−ui), differentiating and pairing the two orientations of each edge gives V′=2∑iui∑j≠iaij(uj−ui)=−2∑{i,j}∈Eaij(ui−uj)2.

3.1F2F6step 2.2algebra

Let a∗=min⁡{i,j}∈Eaij>0. 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 N−1. Telescoping and [F6] give (ui−ur)2≤(N−1)∑{j,k}∈E(uj−uk)2. The zero-mean identity gives ur=−∑iπi(ui−ur); expanding ∑iπi[(ui−ur)−∑jπj(uj−ur)]2≥0 yields ur2≤∑iπi(ui−ur)2. Since (x+y)2≤2x2+2y2 and ∑iπi=1, it follows that V≤4(N−1)∑E(ui−uj)2≤4(N−1)a∗−1∑Eaij(ui−uj)2.

4.1F5step 2.2step 3.1∎

Thus V′≤−2λV with λ=a∗/[4(N−1)]>0. By [F5], the derivative of e2λtV(t) is nonpositive and that function is nonincreasing, so V(t)≤e−2λtV(0). Since πiui(t)2≤V(t) and pi−πi=πiui, each pi(t)→πi.

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Jarzynski equality for a finite protocol with stationary kernels

Physical scope

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 EF[e−βW]=Zm/Z0=e−βΔF. This is an ensemble identity; it does not say W=ΔF on each path.

Facts & Assumptions

Given: A nonempty finite state space, finite energies Ek, β>0, a row-stochastic Kk, initial law π0, and πkKk=πk at each stage.

[F1]

Finite driven protocol and path work: the path law is π0(i0)∏kKk(ik−1,ik), and work at quench k is Ek(ik−1)−Ek−1(ik−1).

[A1]

Canonical initial preparation for a finite protocol: the initial law is π0(i)=e−βE0(i)/Z0.

[A2]

Finite bath kernels preserve the stage canonical law: ∑iπk(i)Kk(i,j)=πk(j).

[L1]

Canonical sampling assumption for finite and normalized statistical models: the current draft postulate adopts the finite microstate law Pβ(i)=e−βE(i)/Z(β) for finite nonempty Ω with 0<Z(β)<∞ and β=(kBT)−1. Only this finite branch is used; the countable and measurable branches are not invoked.

Proof

technique · induction on protocol stages

Given: [F1], [A1], [A2], [L1], with the finite partition sums and canonical laws of the protocol.

1.1F1A1L1givenbasealgebra

For k≥1 and j∈Ω, define Sk(j) by the finite sum over i0,…,ik−1∈Ω of π0(i0)∏ℓ=1kKℓ(iℓ−1,iℓ)e−βWk, with ik=j and Wk=∑ℓ=1k[Eℓ(iℓ−1)−Eℓ−1(iℓ−1)]; put S0(j)=π0(j). Partitioning this finite sum by the state i=ik−1 gives Sk(j)=∑iSk−1(i)e−β(Ek(i)−Ek−1(i))Kk(i,j). The canonical preparation gives the base S0(j)=π0(j)=(Z0/Z0)π0(j) by [A1] and the finite branch of [L1].

2.1ihstep 1.1F1

For the induction step fix k∈{1,…,m} and suppose Sk−1(i)=(Zk−1/Z0)πk−1(i) for every i.

3.1F1A2step 1.1step 2.1algebra

Substitute this hypothesis in the recurrence from step 1.1. Since πk−1(i)=e−βEk−1(i)/Zk−1, the previous-stage Boltzmann factor cancels against the quench factor, giving Sk(j)=(Zk/Z0)∑iπk(i)Kk(i,j)=(Zk/Z0)πk(j) by [A2]. This proves the induction step at each stage.

4.1F1step 1.1step 3.1algebradischarge-induction∎

The base and induction step establish Sk(j)=(Zk/Z0)πk(j) for all stages. At k=m, summing over terminal states and using normalization of πm gives EF[e−βW]=Zm/Z0. By ΔF=−β−1log⁡(Zm/Z0), this equals e−βΔF.

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Crooks path and work-distribution relation for a finite protocol

Physical scope

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, πk(i)Kk(i,j)=πk(j)Kk(j,i) for every k,i,j. For every forward path with positive probability, define its reverse probability by PR(ωR)=πm(im)∏k=1mKk(ik,ik−1). Then PR(ωR)>0 and PF(ω)/PR(ωR)=eβ(W(ω)−ΔF). Consequently, at each work value w, PF(W=w)=eβ(w−ΔF)PR(WR=−w). The reverse protocol first applies the stage-k reverse transition at fixed Ek, then reverses the quench Ek→Ek−1; its work is WR(ωR)=−W(ω).

Facts & Assumptions

Given: The finite protocol with canonical initial and terminal laws, strictly positive πk, stationary stage kernels, and the additional stagewise detailed-balance equations.

[F1]

Finite driven protocol and path work: quench k changes Ek−1 to Ek before transition Kk; W is work on the system.

[F2]

Finite detailed-balance rate and transition models: the kernel balance equation is πk(i)Kk(i,j)=πk(j)Kk(j,i).

[A1]

Canonical initial preparation for a finite protocol: the forward initial law is π0.

[A2]

Finite bath kernels preserve the stage canonical law: each Kk preserves πk.

[F3]

Pathwise energy balance for a finite driven protocol: ΔE=W+Qin with the stated signs.

Proof

Given: [F1], [F2], [A1], [A2], and [F3].

1.1F1F2A1A2

Define the reverse path law by starting with πm(im) and, in reverse order, using Kk(ik,ik−1) at fixed energy Ek before undoing that quench. By detailed balance, if Kk(ik−1,ik)>0 then Kk(ik,ik−1)>0, because πk is strictly positive. Thus positive forward paths pair with positive reverse paths.

2.1F1F2F3A1step 1.1algebra

On a paired path, divide the endpoint Gibbs weights and use detailed balance for each transition: PF(ω)/PR(ωR)=[π0(i0)/πm(im)]∏k=1m[πk(ik)/πk(ik−1)]. Substituting πk(i)=e−βEk(i)/Zk and collecting terms gives log⁡(PF/PR)=β[Em(im)−E0(i0)−Qin]+log⁡(Zm/Z0)=β(W−ΔF) by [F3].

3.1F1F3step 2.1algebra∎

The reversed quench at stage k occurs at state ik−1, so its work term is Ek−1(ik−1)−Ek(ik−1)=−[Ek(ik−1)−Ek−1(ik−1)]; summing proves WR(ωR)=−W(ω). Summing the path ratio over the finite set of paths with W=w proves the stated distribution identity.

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Thermal fluctuations in the specified linear harmonic bath model

Physical scope

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 X0∼N(0,V) independently of future Brownian increments, where V=kBTb/k. Then the conditional linear model has stationary covariance C(τ)=Ve−μk∣τ∣. With angular-frequency convention S(ω)=(2π)−1∫RC(τ)eiωτ dτ, its spectrum is S(ω)=μkBTb/(π[(μk)2+ω2]). For every averaging time T>0, Var⁡(T−1∫0TXt dt)≤2kBTb/(μk2T). 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.

[A1]

Linear Ornstein-Uhlenbeck bath model: use its supplied mechanical center-of-mass data and one constant rest boost throughout the modeled time interval; γ=μk>0, σ2=2μkBTb, and the stochastic differential is interpreted by the supplied integral equation.

[F1]

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 V=σ2/(2γ) gives stationary covariance Ve−γ∣τ∣, spectrum Vγ/[π(γ2+ω2)], and time-average variance at most 2V/(γT).

Proof

Given: The Axiom of Choice and [A1], [F1], Tb,k,μ>0, and X0∼N(0,kBTb/k) independent of future increments.

1.1A1givenalgebra

The physical postulate gives V=σ2/(2γ)=(2μkBTb)/(2μk)=kBTb/k. This has units of square metres because kBTb is joules and k is joules per square metre.

2.1F1step 1.1

The inspected mathematical supplier's stationary clause applies with this V and γ=μk, so C(τ)=Ve−μk∣τ∣ and S(ω)=Vμk/[π((μk)2+ω2)]=μkBTb/[π((μk)2+ω2)].

3.1A1F1step 1.1step 2.1∎

The same supplier's time-average bound becomes 2V/(γT)=2kBTb/(μk2T). All three formulas are conditional deductions of the adopted model; no apparatus, observed value, or measured uncertainty is asserted.

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Conditional work bound for finite memory reset

Physical scope

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 Smemory+register=kBH(M,R) in joules per kelvin at both endpoints, with kB in joules per kelvin, (ii) a single ideal reservoir remains at fixed temperature Tb>0 kelvin and receives heat Qb in joules, (iii) the memory-register endpoint energy is unchanged so the adopted first-law convention gives work on the system W=Qb in joules, and (iv) the total entropy change obeys ΔSmemory+register+Qb/Tb≥0 in joules per kelvin. Then W≥kBTbH(M∣R), with both sides in joules. Equality is not asserted without a separately specified reversible implementation.

Facts & Assumptions

Given: Finite sets M,R, a joint law, the reset map, Tb>0, work positive on the system, and heat Qb positive into the bath.

[F1]

Finite memory and retained-register reset model: the reset makes M′=m0 and preserves the register marginal ar.

[F2]

Conditional entropy of finite memory given side information: actual current carrier status is draft; its inspected statement for finite joint laws gives H(M,R)=H(R)+H(M∣R) and H(M∣R)≥0. Its proof directly expands p(m,r)=arq(m∣r) and treats zero marginals separately.

[A1]

Adopt the finite-memory entropy identification Smemory+register=kBH(M,R) at each endpoint.

[A2]

Adopt an ideal fixed-temperature bath with Tb>0 and entropy change Qb/Tb for heat delivered to it.

[A3]

Adopt unchanged endpoint energy and the convention W=Qb for work on the memory-register system and heat delivered to the bath.

[A4]

Adopt total entropy nondecrease for this reset process: ΔSmemory+register+Qb/Tb≥0.

Proof

Given: [F1], [F2], and physical assumptions [A1]--[A4].

1.1F1F2A1algebra

Initially the memory-register entropy is kB[H(R)+H(M∣R)] by [F2] and [A1]. After reset, the memory is deterministic conditional on each register value, so H(M′∣R)=0; applying the same finite entropy chain rule gives final entropy kBH(R).

2.1step 1.1A4algebra

Therefore ΔSmemory+register=−kBH(M∣R). Substitution into [A4] gives Qb≥kBTbH(M∣R) because Tb>0.

3.1A1A2A3A4step 2.1∎

By the adopted endpoint first-law convention [A3], W=Qb, so W≥kBTbH(M∣R). 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 kBTblog⁡2.

Physics theoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Mean work is at least the finite free-energy difference

Physical scope

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 EFW≥ΔF. The conclusion concerns the path ensemble only; individual paths may have W<ΔF.

Facts & Assumptions

Given: A finite-valued work random variable W under the forward path law and β>0.

[F1]

Jarzynski equality for a finite protocol with stationary kernels: EFe−βW=e−βΔF.

[F3]

Finite Jensen inequality for a convex function and nonnegative weights summing to one: for a finite probability vector (pj) and real values (xj), e∑pjxj≤∑pjexj.

[F4]

The exponential function is strictly increasing: the exponential is strictly increasing on R.

Proof

Given: [F1]--[F4].

1.1givenF1F2F3

Apply finite Jensen to the finitely many forward paths with xω=−βW(ω) and weights PF(ω). Then e−βEFW≤EFe−βW=e−βΔF.

2.1F4step 1.1algebra∎

Strict increase of the exponential yields −βEFW≤−βΔF. Since β>0, multiplying by −1/β reverses the order and gives EFW≥ΔF.

5 · Examples, experiments and counterexamples

None yet.

Sources