>>692 補足

・いま、n列を単純化して2列で考える
・その話は、>>414-415のAlexander Pruss本人のBlogが見つかった
　から始っている
　つまり Alexander Prussご本人が
　Example:
　I am going to uniformly randomly choose a positive integer (using a countably infinite fair lottery, assuming for the sake of argument such is possible). For each positive integer n, you have a game available to you: the game is one you win if n is no less than the number I am going to pick. You despair: there is no way for you to have any chance to win, because whatever positive integer n you choose, I am infinitely more likely to get a number bigger than n than a number less than or equal to n, so the chance of you winning is zero or infinitesimal regardless which game you pick.
　But then you have a brilliant idea. If instead of you choosing a specific number, you independently uniformly choose a positive integer n, the probability of you winning will be at least 1/2 by symmetry.
　Thus a situation with two independent countably infinite fair lotteries and a symmetry constraint that probabilities don’t change when you swap the lotteries with each other violates independence conglomerability.
　と書かれている通りです
・そして 延々 >>670まで論じてきた通りで
　2列で決定番号 (d1,d2) としたときに
　”1/2 by symmetry”が
　Prussの筆滑りです
・2列”1/2 by symmetry”が言えないから
　n列でもダメ（>>670の通り）