We study the multiplicative version of the classical Furstenberg’s filtering problem, where instead of the sum one considers the product ( and are bilateral, real, finitely-valued, stationary independent processes, is taking values in ). We provide formulas for . As a consequence, we show that if and $\amalg (\cdot )<()$ cannot be filtered out from ) whenever is not bilaterally deterministic, is ergodic and first return to can take arbitrarily long with positive probability. On the other hand, if almost surely visits along an infinite arithmetic progression of a fixed difference (with possibly some more visits in between) then we can find that is not bilaterally deterministic and such that . As a consequence, a -free system is proximal if and only if there is always an entropy drop for any corresponding to a non-bilaterally deterministic process of positive entropy. These results partly settle some open problems on invariant measures for -free systems.

生成讲解博客的中文版本

生成AI智能校验的中文版本