 Solution

Let $F$ be the convex hull of all terms of the sequence, meaning the set of their finite convex combinations. Suppose $B(0,ϵ)\cap F=\varnothing$. Part (ii) then gives a continuous linear functional $S$ with $Sf\ge 1$ for every $f\in F$. In particular $S{f}_n\ge 1$ for every $n$, contradicting $S{f}_n\to 0$. Therefore the ball meets $F$.

A point of that intersection is a finite combination ${\sum }_{k=1}^m{\alpha }_k{f}_{n_k}$ with nonnegative coefficients summing to one. Set $N={\max }_k{n}_k$, combine repeated indices and insert zero coefficients for omitted indices. This givesThus zero lies in the norm closure of the convex hull. The same argument applies to every tail of the sequence and, by choosing errors tending to zero, also gives the usual Mazur lemma. Completeness of $V$ is not required for this conclusion.

The hypothesis needed is precisely convergence to zero against every continuous linear functional, namely weak convergence. The PDF says only “continuous” for the testing maps. If that is interpreted as including arbitrary nonlinear continuous maps, the constant map $T\equiv 1$ makes the hypothesis impossible. The proof above establishes the substantive conclusion under the intended, weaker linear-testing hypothesis, and therefore also the implication under the literal stronger wording.