The non-triviality of the Grope filtrations of the knot and link concordance groups (Q1959750)

\textit{T. D. Cochran, K. E. Orr} and \textit{P. Teichner} defined two filtrations of the knot concordance group, the solvable filtration \(\mathcal{F}_*\) and the Grope filtration \(\mathcal{G}_*\) [Ann. Math. (2) 157, No.~2, 433--519 (2003; Zbl 1044.57001)]. (These filtrations are each indexed by \(\frac12\mathbb{Z}\).) Every section \(\mathcal{F}_n/\mathcal{F}_{n.5}\) of the solvable filtration has infinite rank [\textit{T. D. Cochran, S. Harvey} and \textit{C. Leidy}, Geom. Topol. 13, No.~3, 1419--1482 (2009; Zbl 1175.57004)]. The Grope filtration refines the solvable filtration, after a shift of indices: \(\mathcal{G}_{n+2}\leq\mathcal{F}_n\). The main result of this paper is that every section of the Grope filtration has infinite rank. As in the work of Cochran et al. [loc. cit.], the examples are constructed using surgery, in the guise of ``knot infection'' and ``Hopf surgery'', starting from the knot \(9_{46}\). The detecting invariants are generalized signatures and von Neumann \(\rho\)-invariants. In the final section the arguments are adapted to show that the subgroup of each section of the Grope filtration of the group of concordance classes of \(m\)-component string links which is represented by boundary string links is infinitely generated.