Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Exact all-preparations coarse Markov criterion

Statement

Assume the Axiom of Choice The Axiom of Choice and the finite rate chain of Finite reversible stochastic rate model with transition semigroup supplied by Nonexplosive finite continuous-time chain and reversible spectral gap. Let C={C1,…,Ck} be a partition of E, meaning k≥1, each Ci is nonempty, the blocks are pairwise disjoint, and their union is E. For a∈Ci and j≠i, set q(a,Cj):=∑b∈Cjwab. The projected process Xˉt=i when Xt∈Ci has one time-homogeneous Markov generator valid for every initial microscopic probability law if and only if q(a,Cj) is independent of a∈Ci for every i and j≠i. Under this condition, the coarse generator has off-diagonal entries qˉij=q(a,Cj) for any a∈Ci and diagonal entries qˉii=−∑j≠iqˉij. Its stationary weights πˉi=∑a∈Ciπa satisfy detailed balance.

Facts & Assumptions

Given: The Axiom of Choice, a finite rate model, and its nonexplosive Markov semigroup.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function.

[F1]

Finite reversible stochastic rate model: Qab=wab for a≠b, Qaa=−∑b≠awab, and πawab=πbwba.

[F2]

Nonexplosive finite continuous-time chain and reversible spectral gap: the chain is nonexplosive and has transition semigroup Pt=etQ with forward equation p′=pQ.

Proof

Given: [A1], [F1]–[F2], and the partition C.

1.1F1F2constructalgebra

Let H be the subspace of functions on E that are constant on each block. For f(a)=fˉi when a∈Ci, (Qf)(a)=∑j≠iq(a,Cj)(fˉj−fˉi) for a∈Ci. If the block-rate sums are constant within each Ci, this value is independent of the chosen a∈Ci. Thus Q maps H into itself, and its restriction is the matrix Qˉ in the Statement. Every power Qn preserves H, so the matrix series Pt=etQ does too; for any block Cj, Pt1Cj is constant on each block and defines Pˉt=etQˉ.

2.1A1F1F2step 1.1algebra

Conditional on the full microscopic history through time t, the Markov property gives Pr⁡(Xˉt+s=j∣FtX)=(Ps1Cj)(Xt)=(Pˉs)Xˉt,j. The right side depends only on the current block. Taking conditional expectation with respect to the coarser history proves that Xˉ is a time-homogeneous Markov chain for every microscopic initial law. Moreover, πˉiqˉij=∑a∈Ci∑b∈Cjπawab=∑a∈Ci∑b∈Cjπbwba=πˉjqˉji, so its stationary block weights satisfy detailed balance.

3.1A1F1F2algebra∎

Conversely, assume one time-homogeneous block generator applies for every microscopic initial law. Start once from a point mass at a∈Ci and once at a′∈Ci. For j≠i, the finite matrix expansion ehQ=I+hQ+O(h2) gives Pr⁡a(Xˉh=j)=hq(a,Cj)+O(h2) and Pr⁡a′(Xˉh=j)=hq(a′,Cj)+O(h2). Both probabilities must use the same coarse transition entry from block i to block j. Divide by h>0 and let h↓0; then q(a,Cj)=q(a′,Cj). This holds for each block pair, proving necessity and the equivalence.

Depends on

Dependency tree · 2 levels

Sources