Worked solution: Tao's proof of the Erdős discrepancy problem via logarithmically averaged correlations (2015)
Applying the logarithmically averaged correlation estimate to correlated with its own shift, Tao shows that the boundedness hypothesis from step 4 is only consistent with being pretentious. Concretely, this means: with high probability, there is some period (bounded in terms of the assumed constant ) and some real number such that agrees, on average over primes, with the specific function for a Dirichlet character of that period.
This is a remarkably strong conclusion: an assumption that started as a vague statement about boundedness of averages has been distilled down to "this random function is, in disguise, one of the very specific near-counterexample functions from the second step".
Combining the shifted second-moment bound from step 4 with Theorem 1.10 (step 5–6), Tao shows in Section 4 of his paper ("A generalised Borwein–Choi–Coons analysis") that, with probability , there exists a Dirichlet character of period and a real number such that ; this says precisely that 's values at primes agree, in an averaged sense, with those of . A careful further argument (Lemma 4.1, using the Vinogradov–Korobov zero-free region for Dirichlet -functions to rule out two very different candidate values of both fitting well) additionally pins down to be small, , and unique up to this error.
Writing for an explicit completely multiplicative agreeing with off the primes dividing , the bound above translates into : the "error" factor is itself forced to pretend to be the constant function .
What remains is to show that a genuine -valued (or unit-circle-valued) completely multiplicative function that pretends this strongly to a twisted Dirichlet character cannot, after all, have bounded second moment — exactly reversing the near-counterexample from the second step.