TOPICS
Search

Markov Order


The Markov order of a stationary probability measure mu on sequences over a finite alphabet A is the least nonnegative integer k for which the conditional distribution of the future depends only on the preceding k symbols. Here stationary means invariant under shifting the sequence. More precisely, let p(w) denote the probability of the finite word w. The law is k-step Markov if

 p(uvz)p(v)=p(uv)p(vz)
(1)

for all finite words u, v, and z such that |v|=k. This formulation includes zero-probability words. Order 0 is equivalent to the symbols being independent and identically distributed. If no such integer exists, the Markov order is infinite.

Writing A^* for the set of finite words over A, the intrinsic dimension of the law can be defined using the vector space span of the functions c_w(u)=p(uw) by

 H_p=span_R{c_w:w in A^*}, n=dim_RH_p.
(2)

Equivalently, n is the matrix rank of the infinite matrix whose (u,w) entry is p(uw). Béal et al. (2026) attribute the word-law rank criterion used in the proof to Holland (1968).

For an invariant sofic measure with minimal linear representation of dimension n and finite Markov order, Béal et al. (2026) proved

 ord(mu)<=(n; 2).
(3)

They proved that this bound is sharp even over an alphabet of size 3. The proof uses the second exterior power to reduce the assertion to uniform nilpotence in dimension n(n-1)/2. Béal et al. (2026) report that Gemini proposed an extremal-set-theory approach and GPT-6 Astra supplied the exterior-algebra argument.

An earlier authorless release, "Sharp Finite Markov Order in Intrinsic Sofic Dimension" (2026), announced the same upper bound, with sharp examples over larger alphabets. The binomial-delay precedent for deterministic local automata is due to Béal and Senellart (1998), and the pair-chain core used in that construction appears in Trahtman (1998).

That earlier release's accompanying Lean development checks the one-sided upper bound and the rational stationary examples, but does not formalize the passage to two-sided processes or the literature comparison. As of Sep. 8, 2026, no specialist review had been reported. The released source identifies the work as AI-generated and gives GPT-6 Astra as a default attribution, while noting that runtime model provenance was not retained.


See also

Conditional Probability, Independent and Identically Distributed, Markov Chain, Markov Process, Matrix Rank, Stationary Time Series

Explore with Wolfram|Alpha

References

--. "Sharp Finite Markov Order in Intrinsic Sofic Dimension." Sep. 8, 2026. https://github.com/egilburg/aimath/tree/735383665b012b5b2d30450735ed062fde7bd030/sofic_markov_order.Béal, M.-P.; Gilburg, E.; Jugé, V.; Mairesse, J.; and Perrin, D. "Sofic Measures." 19 Oct 2026. https://arxiv.org/abs/2604.11212v2.Béal, M.-P. and Senellart, J. "On the Bound of the Synchronization Delay of a Local Automaton." Theor. Comput. Sci. 205, 297-306, 1998. https://doi.org/10.1016/S0304-3975(98)80011-X.Holland, P. W. "Some Properties of an Algebraic Representation of Stochastic Processes." Ann. Math. Stat. 39, 164-170, 1968. https://doi.org/10.1214/aoms/1177698514.Trahtman, A. N. "Precise Estimation on the Order of Local Testability of a Deterministic Finite Automaton." In Automata Implementation: Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers (Ed. D. Wood and S. Yu). Lecture Notes in Computer Science, Vol. 1436. Berlin, Germany: Springer-Verlag, pp. 198-212, 1998. https://doi.org/10.1007/BFb0031393.VibeMathed. "Sharp Finite Markov Order in Intrinsic Sofic Dimension." Sep. 8, 2026. https://vibemathed.com/problem/sharp-finite-markov-order-in-intrinsic-sofic-dimension.

Cite this as:

Weisstein, Eric W. "Markov Order." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MarkovOrder.html

Subject classifications