Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Closed-class stationary laws and initial-law-dependent Cesàro weights

Statement

Let P be a finite real column-stochastic matrix, let K=PT be its row transition matrix, and let C1,…,Cs be the closed classes of the positive-transition graph defined in Finite Markov closed-class graph decomposition. Let U be the remaining transient states. Each Cj has a unique invariant probability row vector πj, extended by zero off Cj. Every invariant probability row vector for K is exactly

∑j=1sαjπj,αj≥0,∑jαj=1.

For an initial row probability u, set T=KU,U and bj(i)=∑k∈CjKik for i∈U. If U≠∅, then

αj=u(Cj)+uU(I−T)−1bj,

and if U=∅ this means αj=u(Cj). The Cesàro averages N−1∑k=0N−1uKk converge to ∑jαjπj. The weights are determined by the initial law; when there is more than one closed class, there is no single stationary vector selected by the transition matrix alone.

Facts & Assumptions

Given: A finite column-stochastic matrix P, its equivalent row transition matrix K=PT, and an initial row probability vector u.

[F1]

Finite column-stochastic matrices and probability vectors and Transition matrices and n-step probabilities: P is column-stochastic, K is row-stochastic, and row laws evolve by multiplication by K.

[F2]

Finite Markov closed-class graph decomposition defines the positive-transition graph by j→i when Pij>0; its strongly connected components partition the finite state set, and a component is closed exactly when it has no outgoing edge.

[F3]

Finite-step escape from a transient substochastic block: for some L≤∣U∣ and ε>0, TL1≤(1−ε)1 and, writing k=aL+r, ∥Tk∥∞≤(1−ε)a; hence Tk→0.

[F4]

Transient hitting, mean exit, and residual bounds: (I−T)−1=∑k≥0Tk≥0 and the first-exit probability into a class Cj from a transient state is ((I−T)−1bj)i.

[F5]

An irreducible finite class has a unique invariant vector: every closed irreducible class has one positive invariant probability, and its real invariant row vectors are exactly scalar multiples of that probability.

[F6]

Invariant and stationary distribution for a Markov kernel: invariant row probabilities are exactly the probability measures satisfying πK=π.

[F7]

Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: every bounded real sequence has a convergent subsequence.

Proof

Given: P, K, the class partition, and initial law u as in the statement.

Proof technique: use finite-step escape for transient mass, classwise uniqueness for invariant laws, and compactness of the finite probability simplex for Cesàro limits.

1.1F2F3givenconstruct

The finite graph's strongly connected components form a partition, and its component graph has no directed cycle: a cycle would make its components mutually reachable and hence one component. Following outgoing edges from any component must therefore terminate at a sink, since the component graph is finite and acyclic. A sink is exactly a closed component by [F2]. From any state outside the closed classes, follow a component path to a sink. Each component edge is realized by a positive transition, and strong connectivity supplies finite positive paths from the current state to the source of each such transition and from its endpoint to the next transition's source. Concatenating these paths gives a positive-transition path into a closed class. Before its first entry, this path stays in U because a closed class has no outgoing edge. If U is nonempty, [F3] applies to T. Writing k=aL+r as in [F3] gives ∥Tk∥∞→0, so the Neumann series N=∑k≥0Tk converges and is (I−T)−1.

1.2F2F5F6algebra

For each closed class Cj, the restriction KCj,Cj is a finite irreducible row-stochastic matrix. By [F5] it has a unique invariant probability πj. Extending πj by zero outside Cj preserves invariance because no transition leaves the class. Thus every convex combination in the statement is invariant.

1.3F2F3F5F6algebra

Let v be any invariant probability row vector and write its coordinates as (vC,vU). Since closed classes have no transitions to U, the stationary equation on the transient coordinates is vU=vUT. If U is nonempty, [F3] gives TL1≤(1−ε)1 for some ε>0, and therefore ∥vU∥1=∥vUTL∥1≤∑i∈U(vU)i∑k∈U(TL)ik≤(1−ε)∥vU∥1. Hence vU=0. Since no closed class has transitions to another closed class, the stationary equation now restricts separately to each block Cj. Thus each vCj is invariant on its class, so [F5] makes it αjπj with αj≥0; their masses sum to one. This proves the asserted full set of invariant probabilities.

1.4F1F2F4algebra

For each transient state i, the probability weight of first entering class Cj after k transient transitions is (eiTTkbj). These disjoint first-entry weights sum, by [F4], to ((I−T)−1bj)i. Initial mass already in Cj remains there, so the total class weight from u is αj=u(Cj)+uU(I−T)−1bj. Moreover ∑jbj=(I−T)1, since every transition from a transient state either remains in U or enters exactly one of the closed classes; thus ∑jαj=u(C1∪⋯∪Cs)+uU1=1. If U is empty, the same formula reduces directly to u(Cj).

1.5F1F6F7algebra

Define uˉN=N−1∑k=0N−1uKk. Every coordinate lies in [0,1]. From any subsequence, apply [F7] to its first coordinate, restrict to that subsequence, and repeat for the finitely many remaining coordinates; the final subsequence converges coordinatewise. Also uˉNK−uˉN=(uKN−u)/N, whose ℓ1 norm is at most 2/N. Hence every subsequential limit is an invariant probability.

2.1F2F3F4step 1.3step 1.4step 1.5algebra

The mass an=uKn(Cj) is nondecreasing because Cj is closed; its increment at each step is the first-entry weight from step 1.4. The partial sums of these weights tend to uU(I−T)−1bj by [F3]–[F4], and the unabsorbed transient mass tends to zero, so an→αj. For any η>0, choose N₀ so |uKⁿ(Cⱼ)−αⱼ|<η for n≥N₀; the average error is at most the finite sum of the first N₀ errors divided by N, plus η, and hence tends to at most η. Since η is arbitrary, the Cesàro class mass tends to αⱼ. Thus every subsequential limit uˉ has uˉ(Cj)=αj for each j. By step 1.3 this invariant probability must be ∑jαjπj.

3.1step 1.5step 2.1F7algebra∎

Every convergent subsequence of (uˉN) has the same limit from step 2.1. If the full sequence did not converge to that limit, there would be ε>0 and a subsequence staying at least ε away. Its finitely many bounded coordinates admit a convergent further subsequence by repeated finite applications of [F7]; step 2.1 forces that further limit to be the stated mixture, a contradiction. Thus the full Cesàro sequence converges to the initial-law-dependent mixture stated.

Depends on

Used by

Dependency tree · two levels

19 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