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.
A periodic chain has Cesaro but not ordinary convergence
Example
Assume AC (The Axiom of Choice). On the two-point state space let be the deterministic alternation
with invariant probability . Then the Cesàro laws from any starting state converge,
while the ordinary-time transition probability alternates between and and therefore does not converge. The chain has period two, so it is not aperiodic, and the failure is exactly the one that aperiodicity rules out.
Facts & Assumptions
Given: AC; the state space ; the matrix with ; and .
Every family of nonempty sets has a choice function; AC is assumed and is used through the positive-recurrence supplier [F6] and the Cesàro supplier [F8]. (The Axiom of Choice)
For a countable probability kernel, and for , with and . (Transition matrices and n-step probabilities)
For , . (Matrix Chapman–Kolmogorov equations)
means for some ; states communicate when each is accessible from the other, and the chain is irreducible when every pair communicates. (Accessibility, communication, and irreducibility)
On a countable state space a probability vector is invariant exactly when for every . (Invariant and stationary distribution for a Markov kernel)
is the positive return set, and when it is nonempty is the greatest positive integer dividing every element of . (Period of a state)
Assume AC. For an irreducible countable chain, existence of an invariant probability is equivalent to positive recurrence of every state. (Positive recurrence and stationary probability for irreducible countable chains)
For an irreducible chain the state periods agree, the common value is positive and is called , and the chain is aperiodic when . (Aperiodic irreducible chain)
Assume AC. For an irreducible positive-recurrent on countable with invariant probability , for all . (Cesaro convergence for irreducible positive-recurrent chains)
Verification
Given: AC; ; the matrix , ; and .
Proof technique: compute all powers of from the two-step identity, check irreducibility and invariance, transfer to positive recurrence, read off the period, and evaluate the ordinary and Cesàro averages explicitly.
The matrix is a transition matrix: both entries of each row are or and each row sums to one. Multiplying once, , so by [F2] an induction gives and for every ; in particular for even and for odd , while for even and for odd .
The chain is irreducible: and by step 1.1, so and , and each state is accessible from itself with a zero-step path; by [F3] every pair communicates.
The law is invariant: and , which is the criterion of [F4].
Ordinary convergence fails at the level of a single transition probability: by step 1.1 the diagonal sequence equals at even and at odd , so it alternates and does not converge as ; correspondingly the laws alternate between the two point masses and and do not converge.
Positive recurrence: the chain is irreducible by step 2.1 and has the invariant probability by step 2.2, so [F6] gives that every state is positive recurrent; in particular the hypotheses of the Cesàro supplier [F8] are met.
The chain is not aperiodic: by step 1.1 the positive return set of [F5] is , whose greatest common divisor is , so ; the periods agree on the irreducible chain by [F7], so and is not aperiodic.
Cesàro convergence: step 1.1 gives for even and for odd , so for even the average is , and for odd it is ; the matrix has both rows equal to . Hence for each starting state , which is the displayed Cesàro assertion; since the chain is irreducible and positive recurrent with invariant by steps 2.1, 2.2 and 3.1, this is exactly the conclusion of the general supplier [F8].
Boundary and scope cases: the identity at is included and is consistent with , so the alternation starts with the value ; the two-state chain is the smallest deterministic cycle and the period is exactly two, so the example exhibits the necessity of aperiodicity rather than a failure of irreducibility or of existence of ; the Cesàro average equals exactly for every even and converges otherwise, so no aperiodicity is needed for the averaged statement, and the example claims no converse implication in the other direction; the state space is finite, all sums are finite, and no limit is interchanged with an infinite sum; the two hypotheses needed by [F8], irreducibility and positive recurrence, are verified at steps 2.1 and 3.1 and the invariant law at step 2.2, while the matrices themselves are determined by the fixed data; and AC [A1] is spent exactly on the general suppliers [F6] and [F8], the direct computations of steps 1.1–4.1 being choice-free.
Depends on
- The Axiom of Choice
- Transition matrices and n-step probabilities
- Matrix Chapman–Kolmogorov equations
- Accessibility, communication, and irreducibility
- Invariant and stationary distribution for a Markov kernel
- Period of a state
- Aperiodic irreducible chain
- Positive recurrence and stationary probability for irreducible countable chains
- Cesaro convergence for irreducible positive-recurrent chains
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
25 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.