Lemma 11.24.5. (Compact diagonal for ordered row limits). Let be compact, and let be continuous. Suppose as , and as , allowing limits in . Fix any positive strictly decreasing . There are integers such that No metrizability, countable dense subset, continuity of , or uniform convergence of the rows is assumed.
Argument in the manuscript
Proof. Choose inductively so that, in addition to , For every pair in the second line, . For the first line the inductive lower bound gives wherever is finite. Where it equals , also , so the same strict inequality holds. For any one of these finitely many continuous upper bounds , the open sets increase with and cover . Compactness makes one of them equal to . Taking the largest of finitely many resulting indices imposes all the inequalities simultaneously. This constructs and proves decrease of .
Since , its limit satisfies . For each fixed , inequality (11.24.4) holds for all sufficiently large , so . Taking the infimum first in , then in , gives . Thus . The finite upper bounds were used only as constraints in the selection; their minimum is not used as an approximating function. ◻