Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
You're perfectly right, weak-mixing is the good working hypothesis. As for more expedient ways to prove that $f=0$ a.e.: For integers $n$ and $p$, $f_{n+p} \leq f_n S^n (f_p)$ so that when $p \rightarrow \infty$ and considering that $f_n \leq f_1$, the inequality $f \leq f_1 S^n (f)$ holds for all $n$. Taking averages and integrals, one finds that $\int f \leq 1/n \sum_{k=0}^n \int f_1 S^k (f) \rightarrow \int f_1 \int f$ so that $\int f \leq \int f_1 \int f$ which proves that $f=0$ almost everywhere. But this does not help for the convergence of $\sum f_n$ unless I am missing something?