Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

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.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources