Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Finite reversible stochastic rate model

Definition

Assume the Axiom of Choice The Axiom of Choice. A finite reversible stochastic rate model consists of an integer r≥2, the finite state set E={1,…,r}, real energy parameters ea∈R, an inverse-energy parameter β>0, and finite transition rates wab≥0 for distinct a,b∈E. When physical units are assigned, ea is measured in joules, β in joules−1, and wab in seconds−1; this mathematical definition does not assert a physical realization. Define

Z:=∑a∈Ee−βea,πa:=Z−1e−βea.

Then Z is finite and positive, and π is a strictly positive probability vector. Require wab>0 exactly when wba>0, require the undirected graph with edge {a,b} whenever wab>0 to be connected, and impose detailed balance πawab=πbwba. Define the row generator Q by Qab=wab for a≠b and Qaa=−qa, where qa:=∑b≠awab. Since r≥2 and the graph is connected, every qa>0. Thus (Qf)a=∑b≠awab(fb−fa) for a column observable f, and a row probability vector evolves by p′=pQ.

For any observable f:E→R, write π(f):=∑a∈Eπafa. For f,g:E→R, define ⟨f,g⟩π:=∑a∈Eπafaga. Since E is finite and every πa>0, all real functions on E belong to this finite-dimensional real inner-product space, denoted L2(E,π); equality in it is pointwise equality.

The associated jump-chain construction waits an exponential time of rate qa in state a and then selects state b≠a with probability wab/qa, using fresh independent random choices at successive jumps. Here an exponential time of rate q>0 has survival probability Pr⁡(τ>t)=e−qt for t≥0. The Ionescu–Tulcea construction Ionescu-Tulcea construction of a Markov chain supplies the countable random sequence under the stated Choice assumption. The theorem on this page proves nonexplosion, identifies the transition semigroup, and establishes the positive reversible spectral gap. This is a finite mathematical rate model, not a derivation of rates from Hamiltonian mechanics.

Depends on

Dependency tree · 2 levels

Sources