Section 8.3 · PDF pages 472–473
Imposing finitely many conditions on one family
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
8.3 Imposing finitely many conditions on one family
Here a family at accuracy ε > 0 means the system of hosts, lattices, maps and scales used in the ana-lytic engine. Its largeness parameters have four coordinates: a real K_{pre} and three real-valued functions K, K , K of finite lists of real numbers. The order is the pointwise order. The maximum K ∨K^{′} t mid last is taken in each coordinate. For a fixed family F and a real height constant H, the largeness condition F ≽_{H} K requires its preliminary, middle and final chosen constants to dominate the respective coordinates of K. Therefore
F ≽_{H} (K ∨K^{′}) ⇐⇒ F ≽_{H} K and F ≽_{H} K^{′}. (203)
This is a finite collection of inequalities, each using max(a, b) ≤ c if and only if a ≤ c and b ≤ c. The t-coordinate does not impose an additional inequality in this particular definition; retaining it records the source’s parameter space.
For a class 𝒟 of families, call P(F, H) uniformly eventual on 𝒟 if there is ε_{0} > 0 such that, for each 0 < ε ≤ε_{0}, there is K for which
Selectable PDF notation • transcription unchecked
F ∈𝒟, F ≽_{H} K =⇒ P(F, H).The quantifier over H is universal after K has been chosen. Thus a separate K cannot be chosen for each height constant.
Lemma 8.5 (Finite conjunction). A finite conjunction of uniformly eventual conditions is uniformly eventual. A pointwise consequence of a uniformly eventual condition is uniformly eventual.
Proof. For two conditions take the minimum of their positive accuracy thresholds. At each allowed ε, take K ∨K^{′}, where K, K^{′} are their two largeness parameters. Equation (203) gives both conclusions for the same (F, H). Induction proves the finite assertion, including the empty conjunction. A pointwise implication uses the same threshold and the same K.
Source: Formalism/SharpRestriction/ParamsHeightRankConstant.lean:132--178
For clarity we spell out the precise choice principle used by the family argument. A design for a class 𝒞^{′} and constant C_{0} provides a positive threshold such that, at every smaller positive accuracy and above every largeness parameter, there exist a family F ∈𝒞^{′} and H ≥0, together with the prescribed choice condition, a uniform bound on member sizes, and a uniform factorisation bound on its lattice determinants. The last three conditions are imposed at the time F is chosen; the bounds subsequently required of F may be imposed by raising the largeness parameter before making that choice.
Proposition 8.6 (Designs satisfying every eventual requirement). Suppose designs exist in 𝒞^{′}, and every such design belongs to a class 𝒟. Suppose P_{1}, . . . , P_{r} are uniformly eventual on 𝒟. Then, at every sufficiently small positive accuracy, a single design can be chosen which satisfies every P_{j}, with the same height constant and the original choice and size conditions.
Proof. Take the minimum of the design threshold and the finitely many thresholds of Lemma 8.5. At a smaller positive accuracy choose a common largeness parameter for the conjunction P_{1} ∧· · · ∧P_{r}. Apply design existence to that parameter. The resulting family lies in 𝒟, so the eventual implication gives every P_{j}. The height constant, choice condition and size conditions are those of this one chosen design. No limit of families and no exchange of two existential quantifiers is used.
Source: Development/AutomorphicArithmetic/CharacterBoxes/DesWin.lean:11--31
The application takes C_{0} = 3, determinant exponent e_{D} = 2, and level exponent e_{L} = 0. In particular the analytic engine’s exponent 1/2 + (e_{D} + e_{L} + 7)ε is 1/2 + 9ε, independently of the family chosen at accuracy ε. To apply Proposition 8.6, the source proves nine eventual requirements: compatibility of levels; compatibility of the auxiliary divisor; irreducibility; equality of the small-level rank; the divisor-kernel bound; fullness and the rank bound; the local-to-global estimate; the near-orthogonality estimate; and the global determinant implication. The final implication then yields one family tied along all its windows. The substantive content is in these requirements, not in the finite-conjunction argument.