I'm not really sure I understand what the question is?
note: I think your author is abusing language here. The array entries (at least using matrix terminology) are better described as anti-diagonals.
Suppose you have and ##m## x ##n## array. You can sum its entries any way you want: by row, by column, by diagonal or by anti-diagonal, or some more exotic approach -- it doesn't matter as long as you include every number once in your sum, and no numbers twice.
Why? We're dealing with scalars in ##\mathbb R## (and possibly ##\mathbb C##) here, and scalar addition commutes in ##\mathbb R##. It could be instructive to write out the indexing of the sums for these 4 different cases.
Some care is needed when ##\infty## is involved, but you've passed the absolute convergence test based on line 2 of your picture. With absolute convergence out of the way
So the question is either just about indexing or commutativity of addition in reals? Or something else?