Section 6.5 · PDF page 317
Closure under selections and the remaining arithmetic input
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
6.5 Closure under selections and the remaining arithmetic input
Lemma 6.89 (Transport to selected subclasses). Suppose a property P(ℱ) holds for every admissible family. Then it holds for every admissible family taking values in any fixed class 𝒜 of hosts, for each selected subclass of 𝒜, and for each extension for which the underlying family is still admissible. In particular the family bound just proved passes to each selected row in the host construction, with its original family constant.
Proof. For a family taking values in 𝒜, discard the additional membership assertion and apply the universal statement to the underlying admissible family. For a selected subclass or an admissible extension, apply the same operation to its underlying family. The conclusion for an individual selected row is evaluation of this family statement at that row. The resulting estimate retains the constant chosen for that family. No new supremum over families and no new analytic uniformity is introduced.
This is the mathematical content of the source’s passage from the all-family two-prime assertion to the closed assertion and then to its linked version. The local parameter input of Section 5 does not prove a new estimate in this passage: its parameter identifies the selected rows to which the already universal estimate is applied.
The next step in the endpoint is the existence of a full collection of host hypotheses. The two-prime estimate is one input to that step. The construction also requires compatible theta matching, agreement of the theta integrals, a covolume estimate, evaluation and functional grids, and simultaneous realization of all the selected rows. Their constants and selections must be compatible with the same admissible family. Neither Proposition 6.85 nor Lemma 6.89 establishes these realization assertions. In particular, proving a bound for an empty class of compatible setups would not establish their existence.