Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Gibbs jump commuting relative entropy production

Statement

Use the finite connected Gibbs jump model of Connected Gibbs jump generators satisfy detailed balance. For a diagonal density ρt=∑apa(t)∣a⟩⟨a∣, the populations satisfy pa′=∑b≠a(pbwba−pawab). Define the dimensionless classical relative entropy

K(p∣π):=∑a∈Epalog⁡paπa,0log⁡(0/πa):=0,

where log⁡ is the natural logarithm. For every t>0, pa(t)>0 for all a, and

ddtK(pt∣π)=−12∑a,b∈Ea≠bπawab(ua−ub)(log⁡ua−log⁡ub)≤0,ua:=pa/πa.

Equality in this derivative holds exactly when pt=π. For any initial probability vector, including one with zero entries, t↦K(pt∣π) is continuous at t=0 and nonincreasing on [0,∞). This is a finite commuting-state statement; it asserts no entropy-production theorem for noncommuting densities.

Facts & Assumptions

Given: The finite state set E, positive Gibbs weights πa, connected rates wab, and the population equation in Connected Gibbs jump generators satisfy detailed balance.

[F1]

Connected Gibbs jump generators satisfy detailed balance: πawab=πbwba, the positive-rate graph is connected, and diagonal populations obey pa′=∑b≠a(pbwba−pawab).

Proof

1.1givenF1chooseconstructalgebra

The population equation in [F1] is pt′=ptW for row probability vectors, so pt=p0etW. Let λ>max⁡ara and P:=I+W/λ. Then P is a finite stochastic matrix with Paa>0, and the matrix exponential satisfies

etW=e−λt∑n=0∞(λt)nn!Pn.

For any initial probability vector, choose a with pa(0)>0. For every b, graph connectivity gives a finite positive-rate path from a to b; the corresponding power Pn has (Pn)ab>0. Its coefficient in the series is positive for t>0, so pb(t)>0.

2.1givenF1step 1.1algebra

For t>0, put ua=pa(t)/πa>0 and, for a≠b, put cab:=πawab=cba. Differentiating K and using ∑apa′=0 gives

ddtK(pt∣π)=∑apa′log⁡ua=∑a≠bcab(ub−ua)log⁡ua.

Pairing the (a,b) and (b,a) terms yields the displayed symmetric formula. Since log⁡ is increasing, each (ua−ub)(log⁡ua−log⁡ub)≥0.

3.1givenF1step 2.1algebra∎

Equality in step 2.1 forces ua=ub on every positive-rate edge. Connectedness makes all ua equal, and ∑apa=∑aπa=1 then gives ua=1, so pt=π. Conversely pt=π makes every term zero. Finally xlog⁡(x/πa)→0 as x↓0, so K(pt∣π) is continuous at t=0; applying the derivative inequality on [ε,t] and taking ε↓0 proves nonincrease from any initial probability vector.

Depends on

Dependency tree · 2 levels

Sources