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 — Examples

1 · Prerequisites

2 · Summary

These worked examples calculate a finite quench with below-free-energy work on some paths, a disconnected detailed-balance chain that fails to converge to the full reference law, and a biased bath in which Shannon entropy decreases. The Ornstein–Uhlenbeck and memory-reset examples remain calculations within their stated models. None is an experiment or an empirical measurement.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

None yet.

5 · Examples, experiments and counterexamples

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

A finite quench has a positive probability of work below delta F

Physical scope

A calculated two-state hypothetical protocol example; it is not an experiment and makes no claim about a measured system.

Example

Take Ω={a,b}, β>0, E0(a)=E0(b)=0, and E1(a)=0, E1(b)=ϵ for ϵ>0. Prepare canonically at stage zero and use the identity transition kernel after the quench.

Facts & Assumptions

Given: The finite path model and canonical protocol preparation.

[F1]

Finite driven protocol and path work: work is the energy change at the instantaneous quench and the forward path is weighted by the initial law.

[A1]

Canonical initial preparation for a finite protocol: both initial states have probability 1/2.

[F2]

Jarzynski equality for a finite protocol with stationary kernels: this model satisfies the exact finite ensemble exponential-work identity.

Verification

Given: ϵ>0 and β>0.

1.1givenF1algebra

The partition sums are Z0=2 and Z1=1+e−βϵ, so ΔF=−β−1log⁡[(1+e−βϵ)/2]. Since e−βϵ<1, the ratio lies strictly between e−βϵ and 1, hence 0<ΔF<ϵ.

2.1A1F1step 1.1

The identity kernel leaves the state unchanged, so the two work values are 0 and ϵ, each with probability 1/2. Therefore PF(W<ΔF)=1/2.

3.1F2step 1.1step 2.1algebra∎

Directly, EFe−βW=(1+e−βϵ)/2=e−βΔF, while the event in step 2.1 has positive probability. Thus the equality is an ensemble statement and does not impose W≥ΔF on every path.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

A disconnected detailed-balance chain does not converge to the full reference law

Physical scope

An exact three-state finite-rate calculation showing why the connectedness condition in the convergence theorem is needed; not empirical data.

Example

Let S={1,2,3}, with q12=q21=1 second−1 and all other off-diagonal rates zero. Let π=(1/3,1/3,1/3) and p(0)=(3/8,1/8,1/2).

Facts & Assumptions

Given: The finite detailed-balance rate model.

[F1]

Finite detailed-balance rate and transition models: π satisfies detailed balance; the rate graph has one edge {1,2} and isolated state 3.

[F2]

Relative-entropy decrease and convergence for a finite detailed-balance chain: convergence to π is proved when the full undirected rate graph is connected.

Verification

Given: The master equation on the three stated states.

1.1givenF1algebra

The third probability is constant and p1+p2=1/2. The difference d=p1−p2 satisfies d˙=−2d with d(0)=1/4, so d(t)=e−2t/4, p1(t)=1/4+e−2t/8, and p2(t)=1/4−e−2t/8.

2.1F1F2step 1.1algebra∎

Hence p(t)→(1/4,1/4,1/2)≠π. The relative entropy tends to 12log⁡(9/8)>0, confirming that detailed balance without connectedness does not force convergence to the full reference law.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Shannon entropy decreases in a biased detailed-balance bath

Physical scope

An exact two-state finite-rate calculation distinguishing Shannon entropy from relative entropy to a biased stationary law; no empirical claim.

Example

Let S={0,1}, with rates q01=1 and q10=9 seconds−1. The positive detailed-balance law is π=(0.9,0.1), and take initial law p1(0)=1/2.

Facts & Assumptions

Given: The finite detailed-balance rate model and natural-log Shannon entropy H(p)=−plog⁡p−(1−p)log⁡(1−p).

[F1]

Finite detailed-balance rate and transition models: the master equation is p˙1=(1−p1)q01−p1q10.

[F2]

Relative-entropy decrease and convergence for a finite detailed-balance chain: the theorem controls D(p∥π); it does not claim that H(p) increases.

Verification

Given: q01=1, q10=9, and p1(0)=1/2.

1.1givenF1algebra

Solving p˙1=1−10p1 gives p1(t)=0.1+0.4e−10t, which lies in (0.1,0.5) and strictly decreases for every t>0.

2.1F3step 1.1algebra

For 0<p<1/2, H′(p)=log⁡((1−p)/p)>0 by [F3]. Therefore dH(p1(t))/dt=H′(p1(t))p1′(t)<0 for every t>0. The Shannon entropy decreases while detailed balance holds.

3.1F1F2step 1.1step 2.1∎

The two-state rate graph is connected, both components of p(0) and π are positive, and detailed balance holds. Thus [F2] applies to the relative entropy D(p(t)∥π) at the same time that step 2.1 shows the Shannon entropy decreases.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

The stationary harmonic bath has a Lorentzian position spectrum

Physical scope

A calculated stationary spectrum and averaging bound in the adopted scalar harmonic Ornstein-Uhlenbeck model; in the specified common fixed Galilean rest chart with constant trap-and-bath center-of-mass velocity throughout the modeled interval; no measured spectrum is asserted.

Example

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.

Use mobility μ>0, stiffness k>0, and fixed bath temperature Tb>0. Under the adopted linear bath model, the stationary position spectrum has angular-frequency convention S(ω)=(2π)−1∫RC(τ)eiωτ dτ.

Facts & Assumptions

Given: The Axiom of Choice and the stationary Gaussian preparation of the specified linear model.

[F1]

Linear Ornstein-Uhlenbeck bath model: its supplied center-of-mass data and constant velocity select one common rest chart throughout the modeled interval; γ=μk and σ2=2μkBTb.

[F2]

Thermal fluctuations in the specified linear harmonic bath model: C(τ)=(kBTb/k)e−μk∣τ∣ and the exact model spectrum is known.

Verification

Given: The Axiom of Choice and γ=μk>0 and V=kBTb/k.

1.1F1F2algebra

Substituting V=kBTb/k and γ=μk into the exact spectrum supplied by [F2] gives S(ω)=μkBTb/(π[(μk)2+ω2]).

2.1F2step 1.1algebra∎

The same supplier bound becomes Var⁡(T−1∫0TXtdt)≤2kBTb/(μk2T), which tends to zero as T→∞. Both formulas are conditional model predictions, not measurements.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Reset bound for a biased two-state memory

Physical scope

A symbolic finite-memory calculation under the reset theorem's physical assumptions; it is not a measured reset process.

Example

Let the retained-register set be the singleton R={r0} and let the memory be a bit with probability p∈(0,1) of state 1. The register carries no information.

Facts & Assumptions

Given: A finite memory law and the endpoint assumptions of Conditional work bound for finite memory reset.

[F1]

Finite memory and retained-register reset model: ar=∑mp(m,r), q(m∣r)=p(m,r)/ar for ar>0, and H(M∣R)=∑r:ar>0ar[−∑m:q(m∣r)>0q(m∣r)log⁡q(m∣r)], with natural logarithms and entropy in nats.

[F2]

Conditional work bound for finite memory reset: W≥kBTbH(M∣R) under its stated endpoint entropy, fixed-temperature bath, unchanged endpoint energy, and total entropy nondecrease assumptions.

Verification

Given: p∈(0,1) and Tb>0.

1.1givenF1algebra

Since R={r0}, its marginal is ar0=1, and the conditional law is q(1∣r0)=p, q(0∣r0)=1−p. The entropy definition therefore gives H(M∣R)=H(M)=−plog⁡p−(1−p)log⁡(1−p).

2.1F2step 1.1algebra∎

Therefore the theorem gives W≥kBTb[−plog⁡p−(1−p)log⁡(1−p)] for this preparation. It reports no work measurement and makes no claim about an apparatus.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

A perfectly retained bit gives zero conditional entropy reset bound

Physical scope

A calculated finite correlated-memory model illustrating the theorem's retained-register condition; no measurement or reset apparatus is described.

Example

Take memory and register bits M,R∈{0,1} with joint law p(0,0)=p(1,1)=1/2 and all other probabilities zero. Retain R and reset M to 0.

Facts & Assumptions

Given: The finite joint law and the physical assumptions of Conditional work bound for finite memory reset.

[F1]

Conditional entropy of finite memory given side information: H(M,R)=H(R)+H(M∣R).

[F2]

Conditional work bound for finite memory reset: the reset work bound uses H(M∣R), not H(M).

Verification

Given: The specified perfectly correlated two-bit distribution.

1.1givenF1algebra

The memory marginal is uniform, so H(M)=log⁡2. Given either value of R, the conditional law of M is a point mass; hence each conditional entropy is zero and H(M∣R)=0.

2.1F2step 1.1algebra∎

Therefore the theorem yields only W≥0 for this reset under its stated thermodynamic assumptions, while the unconditioned memory entropy is log⁡2. It does not imply a kBTblog⁡2 lower bound for this correlated preparation.

Sources