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.
Stationary law of a finite birth-and-death chain
Example
Let and let be the transition matrix of a birth-and-death chain on with
all other off-diagonal entries zero and nonnegative holding probabilities (with , ). Put and for . Then
is a reversible probability distribution, hence a stationary law, for (Reversible measure and detailed balance, Detailed balance implies invariance).
Facts & Assumptions
Given: , the finite state space , and the birth-and-death transition entries with the conventions above.
A transition matrix on a countable state space has nonnegative entries and rows summing to one. (Transition matrices and n-step probabilities)
A state measure is a function with for all ; it satisfies detailed balance for when for all , and it is a reversible probability distribution when . (Reversible measure and detailed balance)
Any finite-point-mass nonnegative measure satisfying detailed balance for a countable transition matrix satisfies ; a reversible probability distribution is therefore invariant. (Detailed balance implies invariance)
Verification
Given: The birth-and-death chain on with , , nonnegative diagonal entries and zero non-adjacent off-diagonal entries.
Proof technique: verify the edgewise detailed-balance identities, normalize the resulting positive weights, and apply the general detailed-balance lemma.
The matrix is a transition matrix: its entries are nonnegative by the hypotheses, and each row sums to one, since row with has the three entries and , row has and , and row has and .
Every weight is a positive finite number: and each is a finite product of positive ratios , since all ; consequently is a finite sum of positive terms, so .
Detailed balance holds on every edge: for the recursion gives , hence .
Detailed balance holds for every pair of states: if are distinct and non-adjacent then by hypothesis, so both sides vanish; if then both sides equal ; and the remaining case is the adjacent pair of step 2.1.
Define . By step 1.2 each is a finite nonnegative number, and , so is a probability vector; moreover for all , because step 3.1 multiplies by the common positive factor . Hence is a reversible probability distribution for in the sense of [F2].
By [F3] the reversible probability distribution satisfies , so it is a stationary law for the birth-and-death chain.
Boundary and scope cases: for the state space is , the products over are empty, , and both the detailed-balance identity and stationarity are trivial, so the formula remains valid when the positivity hypotheses are vacuous; if an interior denominator vanishes, the displayed recursion is undefined. If some but all , it still gives finite nonnegative weights, with , and the same detailed-balance and normalization argument gives a stationary law, possibly with zero masses. Either missing directed edge destroys irreducibility on the full interval, but strict positivity of both directions is needed only for positive weights in step 1.2, not for the recursion identity when all denominators are positive; the holding probabilities never enter the detailed-balance identities; the finite sum is legitimately inverted, and no normalization of an infinite measure is attempted, so the countable birth-and-death case requires a separate summability hypothesis and is not claimed here; and no choice principle is used, all quantities being determined by the finite data.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Durrett, Probability: Theory and Examples, fifth edition, §5.5–5.6, birth-and-death chains (standard reference, not scraped)
- Levin–Peres–Wilmer, Markov Chains and Mixing Times, second edition, §21.3 and Appendix C.1 (standard reference, not scraped)