Want site search autocompletion? See here Encountering 429 Too Many Requests errors when browsing the site? See here
The following is used in the Fixed Point Lemma (5.1.1):
Writing the n {\displaystyle n} -strategy as
we have
But ϕ j ∗ n ( P ≤ n − 1 , V ) = V ( ϕ j ) {\displaystyle \phi _{j}^{*n}(\mathbb {P} _{\leq n-1},\mathbb {V} )=\mathbb {V} (\phi _{j})} so the two sums cancel to obtain 0 {\displaystyle 0} .