“…The main result of that paper showed that this condition suffices for the working of the proximal point algorithm, namely that if X is complete, (T n ) n∈N is a family of self-mappings of X with a common fixed point and (γ n ) n∈N ⊆ (0, ∞) with ∞ n=0 γ 2 n = ∞, then, assuming that (T n ) is jointly (P 2 ) with respect to (γ n ), any sequence (x n ) ⊆ X such that for all n, x n+1 = T n x n , ∆-converges (a generalization of weak convergence to arbitrary metric spaces, due to Lim [36]) to a common fixed point of the family. Moreover, in [48], the reason for the effectiveness of this sort of condition was further elucidated: Theorem 3.3 of that paper shows that a family of self-mappings is jointly firmly nonexpansive if and only if each mapping in it is nonexpansive and the family as a whole satisfies the well-known resolvent identity.…”