Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Uniqueness of the stationary law for an irreducible positive-recurrent chain

Statement

Assume AC (The Axiom of Choice). Let p be an irreducible positive-recurrent transition matrix on a nonempty countable state space E. Then p has exactly one invariant probability distribution π (Positive recurrence and stationary probability for irreducible countable chains). In particular

π(x)=1ExTx+(x∈E),

by Kac return-time formula for a state.

Facts & Assumptions

Given: AC, an irreducible positive-recurrent transition matrix p on a nonempty countable state space E.

[A1]

Every family of nonempty sets has a choice function; AC is assumed and is used through the chain-law suppliers [F1] and [F2]. (The Axiom of Choice)

[F1]

Assume AC. For an irreducible countable chain, some state positive recurrent, every state positive recurrent, and existence of an invariant probability are equivalent; if b is positive recurrent then μb/EbTb+ is an invariant probability. (Positive recurrence and stationary probability for irreducible countable chains)

[F2]

Assume AC. For an irreducible countable chain with invariant probability π and any state b: π(b)>0 and EbTb+=1/π(b). (Kac return-time formula for a state)

[F3]

Every measure on an at most countable discrete space is determined by its singleton masses: μ(E′)=∑x∈E′μ({x}) for every E′⊆E. (Every measure on a countable discrete space is its weighted sum of Dirac measures)

Proof

Given: AC, an irreducible positive-recurrent p on nonempty countable E.

Proof technique: existence from the positive-recurrence equivalence, then compare two invariant probabilities through the statewise Kac identity.

1.1F1given

Existence: since p is irreducible and positive recurrent, [F1] supplies an invariant probability π for p.

1.2F2given

Uniqueness: let π and ρ be invariant probabilities. Fix x∈E; the Kac identity [F2] applied to π gives π(x)=1/ExTx+, and applied to ρ gives ρ(x)=1/ExTx+, the denominator being the same positive finite number because ExTx+ depends only on the chain and the state. Hence π(x)=ρ(x) for every x∈E.

2.1F3step 1.2given

Two probability measures on the countable discrete space E with equal singleton masses are equal: by [F3] both assign to every E′⊆E the value ∑x∈E′π({x}), the same series. Hence π=ρ, and the invariant probability is unique.

3.1step 1.1step 1.2step 2.1given

Combining steps 1.1 and 2.1, p has exactly one invariant probability, and step 1.2 exhibits it as π(x)=1/ExTx+.

4.1A1F1F2F3step 2.1given∎

Boundary and axiom cases: aperiodicity is never used, so the corollary covers periodic positive-recurrent chains; a reducible chain may have many invariant probabilities, such as the identity matrix on two states where every mixture of the two absorbing laws is invariant, and the irreducibility hypothesis is used in [F1] and in the positivity statement of [F2]; a null-recurrent chain has no invariant probability at all by [F1], so uniqueness is then vacuous rather than false; an empty state space carries no probability law; the equality π=ρ is checked at every singleton, which is exactly the determined family of [F3]; and AC [A1] enters only through the chain-law suppliers of [F1] and [F2].

Depends on

Used by

Dependency tree · two levels

17 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