Section 6.3 · PDF pages 313–314
From pointwise estimates to an eventual family estimate
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
6.3 From pointwise estimates to an eventual family estimate
Lemma 6.84 (Numerical domination by the family cost). Assume (133)–(156), log x ≥1, C_{0} ≥1, n, t ≤ x^{C0}, and v_{ℓ}(N) = v_{ℓ}(Q_{S}). For A, B ≥0 set
Selectable PDF notation • transcription unchecked
C = 18AC_{0} + 2B(3C_{0} + 9) + 5C_{0} + 1.Then
AfmHs + Bf^{2}t^{2}V L_{0} ≤Cfmb log x + Cx^{C}Λ^{2}. (158)
Proof. Put j = v_{ℓ}(Q_{S}). Since 2^{j}≤ℓ^{j}≤Q_{S} ≤n^{2}≤x^{2C0}, taking logarithms and using log 2 > 2/3 gives j ≤3C_{0} log x. The same inequality holds for s = max(1, j), since C_{0} log x ≥1. Thus
AfmHs ≤18AC_{0}fmb log x ≤Cfmb log x.
For the second summand use H ≤6b and log b = Λ:
_{ℓ} log(12b) log (2H) ≤ ≤2Λ + 6. log 2
Here log 12 ≤3 and log 2 ≥1/2 suffice. Hence L_{0} ≤3C_{0} log x + 2Λ + 7. Since log x ≤x, Λ ≥1, and x ≥1, this is at most (3C_{0} + 9)xΛ.
The rank inequalities give f ≤t ≤x^{C0} and V ≤2t ≤2x^{C0}. Therefore
Selectable PDF notation • transcription unchecked
Bf^{2}t^{2}V L_{0} ≤2B(3C_{0} + 9)x^{5C0+1}Λ
≤Cx^{C}Λ^{2}.The last step uses all three separate inequalities 2B(3C_{0} + 9) ≤C, 5C_{0} + 1 ≤C, and Λ ≥1. All factors are nonnegative, so adding the two estimates proves (158).
An admissible family consists, for every x > x_{1}, of a set J_{x} of hosts and size data with the same ε, together with compatible parameter choices. Its fixed size bounds give constants C_{0} ≥1 and x_{par} such that
for every x ≥x_{par}, x > x_{1}, j ∈J_{x}, n_{j}, t_{j} ≤x^{C0}. (159)
There is no dependence of C_{0}, x_{par} on the local representation, its coefficient comparison models, or π. For the particular family definition in the source this follows already from n_{j} ≤x^{2+8ε+ε/100} and t_{j} ≤x^{Ct+ε/100}, where C_{t} is fixed in the family: choose C_{0} at least 1 and both exponents. The source uses a stronger family parameter theorem which bounds further quantities simultaneously; those further bounds are not needed in (158).
Proposition 6.85 (The uniform two-prime family bound). Suppose that for every host and every compatible setup the comparison data of Input 6.1 and Lemma 6.81 exist at ℓ = 2 and at ℓ = 3 outside the small-prime set, and that (154) holds. Then, for every admissible family, there are C ≥0 and x_{∗} such that, for every x ≥ x_{∗} with x > x_{1}, every j ∈ J_{x}, every compatible choice of integral Galois representation and comparison models, every such local index a, and every π ∈Z_{a}^{good},
c_{a,π} ≤s_{a,π} + W_{ℓ}+ H_{ℓ}+ ℓ^{−2}+ Cfmb log x + Cx^{C}Λ^{2}. (160)
One can take
C = 288005C_{0} + 540001, x_{∗}= max(3, x_{par}),
where C_{0}, x_{par} are as in (159).
Proof. Choose C_{0}, x_{par} for the whole family first. For x ≥x_{∗} we have log x ≥1. At 2, coprimality of Q_{S} to qd gives v_{2}(N) = v_{2}(Q_{S}). At 3 the required exponent equality follows from N = Q_{S}qd and 3 ̸= q, d. Thus Lemma 6.84 applies to both local estimates with the same A = 6000 and B = 30000. Its prescribed constant is
Selectable PDF notation • transcription unchecked
108000C_{0} + 60000(3C_{0} + 9) + 5C_{0} + 1 = 288005C_{0} + 540001.Use Lemma 6.81 to bound the local congruence colength and then substitute (158). This proves (160). None of these choices used the index j, the local data or the good eigencharacter. This proves the claimed order of quantifiers.
The proposition is conditional exactly on the stated comparison and realization assertions. Its conclusion does not assert one common C for all admissible families. It asserts that every family has one C which works simultaneously for all its hosts and all compatible local choices.