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

Invariant and stationary distribution for a Markov kernel

Definition

Let K be a probability kernel on a measurable space (E,E) (Measure kernel and probability kernel), and let π be a probability measure on (E,E) (Probability measures and probability spaces). The probability measure π is invariant for K, and π is a stationary distribution of K, when

(πK)(A):=∫EK(x,A) π(dx)=π(A)for every A∈E.

The set function πK is again a probability measure: for fixed A the map x↦K(x,A) is measurable and lies in [0,1], so the integral exists in [0,1]; for pairwise disjoint An∈E the identity K(x,⋃nAn)=∑nK(x,An) of the measure K(x,⋅) and the monotone convergence theorem for nonnegative functions (Monotone convergence for the integral) give σ-additivity of πK; and K(x,E)=1 for every x gives (πK)(E)=1. Thus (πK)(A)=π(A) is an identity between two probability measures evaluated at A.

A K-chain whose initial law is π is called stationary when πK=π. Stationarity of the process is a statement about all of its finite-dimensional laws and is proved, not assumed, from πK=π; see Invariant initial law makes a Markov chain stationary.

On a countable state space E with sigma-algebra 2E and transition matrix p(x,y)=K(x,{y}) (Transition matrices and n-step probabilities), a measure on E is its weighted sum of Dirac masses at singletons (Every measure on a countable discrete space is its weighted sum of Dirac measures), so invariance is equivalent to the matrix identity

π(y)=∑x∈Eπ(x) p(x,y)for every y∈E.

The definition fixes no irreducibility, aperiodicity or uniqueness hypothesis, and it selects no conditional-expectation versions; the display defines a single measure πK and asserts an identity for it. A transient, periodic or reducible chain may have several invariant probability measures or none.

Depends on

Used by

Dependency tree · two levels

22 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