On Markov Intertwining Relations and Primal Conditioning

Given an intertwining relation between two finite Markov chains, we investigate how it can be transformed by conditioning the primal Markov chain to stay in a proper subset. A natural assumption on the underlying link kernel is put forward. The three classical examples of discrete Pitman, top-to-random shuffle and absorbed birth-and-death chain intertwinings serve as illustrations.