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.
A disconnected detailed-balance chain does not converge to the full reference law
An exact three-state finite-rate calculation showing why the connectedness condition in the convergence theorem is needed; not empirical data.
Example
Let , with second and all other off-diagonal rates zero. Let and .
Facts & Assumptions
Given: The finite detailed-balance rate model.
Finite detailed-balance rate and transition models: satisfies detailed balance; the rate graph has one edge and isolated state .
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.
The third probability is constant and . The difference satisfies with , so , , and .
Hence . The relative entropy tends to , confirming that detailed balance without connectedness does not force convergence to the full reference law.