A special case of Proposition REF  was noted in some of the earliest papers on persistent homology computation [1]}, where it was leveraged to reduce the number of algebraic operations performed. The idea was adapted in [2]}, [3]}, which introduce computation with a “twist,” clearing, and compression.
