Extracting coherent sets in aperiodically driven flows from generators of Mather semigroups

The paper’s Theorem 4.2 states exactly the lower bound the model proves, and the standard proof structure in the paper (deferred to Appendix A) matches the model’s argument: discretize time, use a killed Perron–Frobenius operator, apply a one-step positivity lemma, integrate to obtain an L1 bound, and pass to continuous time using continuity of paths and closedness of the time-indexed level sets. The model correctly uses the same hypotheses as the paper (f0 ∈ D(G), zero mean, d ≤ 3 to ensure continuity), and its reasoning aligns with the paper’s setup and claims.