Review pending

Lemma 11.24.5 · Compact diagonal for ordered row limits

Lemma 11.24.5. (Compact diagonal for ordered row limits). Let QQ be compact, and let fj,k:Q→Rf_{j,k}:Q\to\mathbf R be continuous. Suppose fj,k↓ujf_{j,k}\downarrow u_j as k→∞k\to\infty, and uj↓uu_j\downarrow u as j→∞j\to\infty, allowing limits in R∪{−∞}\mathbf R\cup\{-\infty\}. Fix any positive strictly decreasing ηj→0\eta_j\to 0. There are integers mj≥jm_j\geq j such that aj=fj,mj+ηj↓uon Q.a_j=f_{j,m_j}+\eta_j\downarrow u\quad\hbox{on }Q. No metrizability, countable dense subset, continuity of uju_j, or uniform convergence of the rows is assumed.

Argument in the manuscript

Proof. Choose mjm_j inductively so that, in addition to mj≥jm_j\geq j, fj,mj+ηj≤aj−1(j>1),fj,mj≤fk,ℓ+ηj(1≤k,ℓ≤j).\begin{align} f_{j,m_j}+\eta_j&\leq a_{j-1} &&(j>1),\\ f_{j,m_j}&\leq f_{k,\ell}+\eta_j &&(1\leq k,\ell\leq j). \end{align} For every pair in the second line, uj≤uk≤fk,ℓ<fk,ℓ+ηju_j\leq u_k\leq f_{k,\ell}<f_{k,\ell}+\eta_j. For the first line the inductive lower bound aj−1≥uj−1+ηj−1a_{j-1}\geq u_{j-1}+\eta_{j-1} gives uj<aj−1−ηju_j<a_{j-1}-\eta_j wherever uj−1u_{j-1} is finite. Where it equals −∞-\infty, also uj=−∞u_j=-\infty, so the same strict inequality holds. For any one of these finitely many continuous upper bounds bb, the open sets {fj,m<b}\{f_{j,m}<b\} increase with mm and cover QQ. Compactness makes one of them equal to QQ. Taking the largest of finitely many resulting indices imposes all the inequalities simultaneously. This constructs mjm_j and proves decrease of aja_j.

Since aj≥uj≥ua_j\geq u_j\geq u, its limit aa satisfies a≥ua\geq u. For each fixed (k,ℓ)(k,\ell), inequality (11.24.4) holds for all sufficiently large jj, so a≤fk,ℓa\leq f_{k,\ell}. Taking the infimum first in ℓ\ell, then in kk, gives a≤ua\leq u. Thus a=ua=u. The finite upper bounds were used only as constraints in the selection; their minimum is not used as an approximating function. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-900249.

Proof in chapter