Alphabeta Math
TheoremStatement: 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.

Invariant initial law makes a Markov chain stationary

Statement

Assume AC (The Axiom of Choice). Let K be a probability kernel on a measurable space (E,E), let π be an invariant probability for K (Invariant and stationary distribution for a Markov kernel), and let X be a K-chain with initial law π (Initial distribution of a Markov chain). Then every finite-dimensional law of X is invariant under every nonnegative integer time shift: for every r≥1, every 0≤n1<⋯<nr and every m≥0,

L(Xm+n1,…,Xm+nr)=L(Xn1,…,Xnr).

Equivalently, the canonical path law PX:=L((Xn)n≥0) on (EN0,E⊗N0) is invariant under the left shift θ(z)n=zn+1.

Facts & Assumptions

Given: AC, a probability kernel K on (E,E), an invariant probability π for K, and a K-chain X with initial law π.

[A1]

Every family of nonempty sets has a choice function; AC is assumed and is used exactly through the finite-dimensional-law supplier [F3] below. (The Axiom of Choice)

[F1]

π is invariant for K when (πK)(A)=∫EK(x,A) π(dx)=π(A) for every A∈E, so πK=π as measures. (Invariant and stationary distribution for a Markov kernel)

[F2]

The initial law of X is π=L(X0), that is, P(X0∈A)=π(A) for all A∈E. (Initial distribution of a Markov chain)

[F3]

Assume Choice. For a K-chain with initial law μ, times 0≤n0<⋯<nr and bounded measurable real f0,…,fr, E∏j=0rfj(Xnj)=∫Eμ(dx)∫EKn0(x,dx0)f0(x0)∏j=1r∫EKnj−nj−1(xj−1,dxj)fj(xj), the n0=0 factor being evaluation at x; taking indicators fj=1Aj gives the joint probability of the cylinder {Xnj∈Aj, 0≤j≤r}. (Finite-dimensional laws of a Markov chain)

[F4]

K0 is the identity kernel and Kn+1=KnK in chronological composition; each Kn is a probability kernel and products of copies of K are unambiguous by associativity. (Iterated transition kernels)

[F5]

If a lambda-system D on X contains a pi-system P, then σX(P)⊆D; in particular two probability measures that agree on a pi-system generating the whole sigma-algebra agree on that sigma-algebra. (Dynkin's pi-lambda theorem)

[F6]

The law of the process (Xn)n≥0 is the pushforward of P under the coordinate map, a probability measure on the product space with its product sigma-algebra; its finite-dimensional distributions are the pushforward laws of the tuples (Xn1,…,Xnr). (Stochastic processes and their finite-dimensional distributions)

Proof

Given: AC, a probability kernel K on (E,E), an invariant probability π with πK=π, and a K-chain X with initial law π.

Proof technique: first show πKm=π by induction, then compare the iterated-integral formulas for shifted and unshifted cylinder probabilities, and extend cylinder invariance to the product sigma-algebra by Dynkin's theorem.

1.1F1F4given

For every m≥0 one has πKm=π as probability measures: for m=0 this is πK0=πI=π, and if πKm=π then associativity of iterated kernel composition gives πKm+1=(πKm)K=πK=π by [F1].

1.2F5F6given

For fixed m the family Dm:={B∈E⊗N0:PX(θ−mB)=PX(B)} is a lambda-system: it contains EN0, and θ−m(Bc)=(θ−mB)c together with θ−m(⋃lBl)=⋃lθ−mBl for pairwise disjoint families give closure under complements and disjoint countable unions by additivity of the probability measure PX of [F6].

2.1F2F3F4step 1.1given

Fix m≥0, times 0≤n0<⋯<nr and bounded measurable f0,…,fr. [F3] applied to the shifted tuple (m+n0,…,m+nr), whose successive gaps are again n1−n0,…,nr−nr−1, expresses E∏j=0rfj(Xm+nj) as ∫Eπ(dx)∫EKm+n0(x,dx0)f0(x0)∏j=1r∫EKnj−nj−1(xj−1,dxj)fj(xj), while [F3] applied to (n0,…,nr) gives the same expression with Kn0 in place of Km+n0; associativity [F4] gives Km+n0=KmKn0, so step 1.1 gives πKm+n0=(πKm)Kn0=πKn0, the two outermost integrals over π coincide, and all remaining factors are identical.

3.1F3F5step 2.1given

Taking fj=1Aj in step 2.1 shows P(Xm+nj∈Aj, 0≤j≤r)=P(Xnj∈Aj, 0≤j≤r) for all measurable A0,…,Ar; measurable rectangles form a pi-system generating E⊗(r+1), and by [F5] two probability measures agreeing on it agree on the whole product sigma-algebra, so L(Xm+n0,…,Xm+nr)=L(Xn0,…,Xnr), which is the asserted shift invariance of every finite-dimensional law.

4.1F6step 3.1given

Let PX:=L((Xn)n≥0) be the canonical path law on (EN0,E⊗N0) [F6], and fix m≥0; for the cylinder C={z:znj∈Aj, 0≤j≤r} one has θ−mC={z:(zm+nj)j∈∏jAj}, so step 3.1 gives PX(θ−mC)=P(Xm+nj∈Aj for all j)=P(Xnj∈Aj for all j)=PX(C).

5.1F5step 4.1step 1.2given

By step 4.1 the family Dm contains every finite-dimensional cylinder, and cylinders form a pi-system generating E⊗N0, so [F5] gives Dm=E⊗N0; hence PX(θ−mB)=PX(B) for every measurable B, and for m=1 the left shift preserves the canonical path law.

6.1A1F3step 1.1step 3.1step 5.1given∎

Boundary and axiom cases: if E is a singleton the canonical path law is the point mass at the constant path and every shift preserves it; if r=1 and m=0 the identities in steps 2.1–3.1 are trivial; the equivalence between the finite-dimensional and canonical formulations is proved in both directions, steps 1.1–3.1 giving the finite-dimensional statement and steps 4.1–5.1 the path-space statement; and AC [A1] enters exactly through the finite-dimensional-law supplier [F3], whose statement itself assumes Choice, while the induction, the rectangle comparison and the lambda-system computation are ordinary measure-theoretic algebra.

Depends on

Used by

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.

Sources