Section 3.19 · PDF pages 59–61
Assembling the quantitative host
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
3.19 Assembling the quantitative host
Proposition 3.42 (Refinement of the field data). Fix 0 < ϵ < 1/52, C_{0} ≥1. There are C_{T2}, C_{8}, C_{b}, x_{0}, with C_{8} ≥C_{0}, C_{b} > 0, fixed before the following data. Suppose x_{√} ≥x_{0}, the ranks satisfy (36), and an admissible base host has field E, distinguished quadratic field K = Q( −d), modulus Q_{S}, and frame A, A_{0}. Suppose further
1 ≤J ≤C_{0}, o ≤C_{0}, Q_{S} ≤C_{0}n, 1 ≤M ≤C_{0}, Q_{S} | lcm(2^{e+2}, M),
x^{1/J} ≤Y ≤x, PairGood(M, ϵ, Y, x; q, d),
and every prime at most ⌊Y^{ϵ/5}⌋ has the splitting property in the field data of Lemma 3.20. Then the base host can be furnished with all the following choices simultaneously:
1. a first set T ⊂A with δn/2 ≤|T| ≤2δn, the shares (69), and the weighted bad bound (70);
2. a second set T_{2} and L_{w} satisfying Proposition 3.39, with its same absolute C_{T2};
3. the five level primes g_{0}, g_{1}, p, p^{′}, q_{0} of Proposition 3.41, with N = Q_{S}qd, exponent C_{8}, and disjoint sets BB(r, g_{i});
4. elements π_{i} ∈𝒪_{E} ∩K of norm g_{i} (that is, π_{i}π̄_{i} = g_{i}) with π_{i} ≡1 mod N𝒪_{E}; all five level primes split in K, and p, p^{′} split completely in E;
5. the three QDq(x, ϵ, 4) estimates, all the real and quadratic boxes of Lemma 3.33, the thin estimate (64), and |d log H| ≤x^{ϵ};
6. the unit ideal as the auxiliary ideal in K, and splitting bound ⌊Y^{ϵ/5}⌋, at least ⌊x^{ϵ/(5J)}⌋.
The constants and threshold are uniform over all the ranks, fields, M, Y, q, d, e in this statement. These are all the conditions of the source’s HostGood(s, C_{8}, 4, 1, C_{b}, H, q_{0}); no further host condition is left implicit.
Proof. We first obtain the modulus bound before making the final choices. The rank estimates imply n ≤ 2x^{9/4}. Consequently
log Q_{S} ≤ log(2C_{0}) + (9/4) log x = O_{C0}(log Y ),
since log x ≤J log Y ≤C_{0} log Y . Put z = Y^{ϵ/5}. The upper bounds on the selected primes give
log N = log Q_{S} + log q + log d ≤ log Q_{S} + z + z(log Y )^{2}≤2z(log Y )^{2}≤2x^{ϵ/5}(log x)^{2}
eventually, uniformly, because log Q_{S} +z ≤z(log Y )^{2} after increasing a threshold depending only on C_{0}, ϵ. The lower bounds on q, d, together with Y ≥x^{1/C0}, also imply d ≥100 and q, d > 4tr+1. Indeed t ≤x^{400} by Lemma 3.16, r ≤x^{5} for valid ranks, whereas log q >^{1}_{2}x^{ϵ/(5C0)}; the latter dominates 406 log x + O(1). The same argument applies to d. These are the elementary numerical and conductor steps of CharacterBoxes/PairRows.lean:323--387. They prove the full pair row, including splitting at all small primes: for odd primes the congruence d ≡−1 mod p gives (−d/p) = 1; at 2, d ≡ 7 mod 16 gives (−d/2) = 1. The same congruence modulo q gives (−d/q) = 1.
Proposition 3.41 now provides the five primes and elements π_{i} ∈𝒪_{K} of norm g_{i} (congruent to 1 mod N𝒪_{K}), with an absolute exponent C_{1}. Take C_{8} = max(C_{0}, C_{1}). This increase preserves all upper bounds because N > 1. The embedding K ↪→E sends the integral elements π_{i} of norm g_{i} to 𝒪_{E}; it preserves their norm equation and their congruence modulo N. Norming that congruence also gives g_{i} ≡1 mod N. Thus all five primes are coprime to N. As E ⊂ Q(ζ_{N}), the Frobenius of a prime congruent to 1 mod N fixes ζ_{N} and is trivial on E. These primes split completely in E, hence also in K; in particular the numbers of primes over p, p^{′} are both [E : Q]. Their original congruences modulo 15N imply the required congruences modulo lcm(15, N).
Choose T_{2}, L_{w} by Proposition 3.39. Use the unit ideal in K. It is coprime to all specified ideals, and no prime divides it. It is primitive in the required integer sense: containment in m𝒪_{K} for m ≥ 2 would force 1 = Norm(𝒪_{K}) ≥m^{2}. The assumed admissibility permits these choices to be attached to the fixed base field, without changing that field, frame or its characters. For the fields used in the final supply below, this is exactly the universal choice extension proved in Lemma 3.20; its different ideal, conjugate factor and coprimality are retained. Take the initially unused first set empty.
All prerequisites for Proposition 3.37 are now present. Apply it to choose the final first set T, replacing only that choice. The pair row makes the inert primes large enough for the bound on L_{2} proved after that proposition. Thus its weighted bad sum is exactly the one in the host’s arithmetic data, not a sum over a smaller set of primes. Changing the first set leaves the field, level primes, norm equations, different and second set unchanged.
The divisibility hypothesis on Q_{S} implies that every prime dividing it divides 2M, and Q_{odd} | M.
Lemma 3.33 therefore gives all the boxes, and Proposition 3.34 applies with B = C_{0}, using the conductor bound already proved. The primitive quadratic character of conductor d is the j = 1, i = 0 twist in the pair. Its logarithmic derivative has magnitude at most 4 log x; taking its real part gives |d log H| ≤4 log x ≤x^{ϵ} at another uniform threshold. Finally x^{ϵ/(5J)}≤Y^{ϵ/5} gives the asserted floor bound.
Choose the maximum of these finitely many thresholds. Each depends only on ϵ, C_{0}, and the fixed absolute prime-input constants. The second-set constant is fixed absolutely; the first-set constant C_{b} depends only on ϵ, C_{0}. Every listed assertion therefore holds together, with exactly the order of quantifiers claimed. This is the construction, including all arithmetic and analytic clauses, of ShortNorms/hostOfFieldOf.lean:159--256.
Theorem 3.43 (The character-supply implication). For every primitive Dirichlet character ψ satisfy-ing VWinAt(ψ, 401), the following assertion holds for every 0 < ϵ < 1/52. There exist constants C_{T2}, C_{8}, C_{b}, x_{0}, with C_{8} ≥ 1, C_{b} > 0, and a fixed J ≥ 1, together with a set W ⊂ (1, ∞) containing arbitrarily distant power windows [Z, Z^{3/2}], such that for every x ∈ W, x ≥ x_{0}, there exist ranks and a host H with:
1. all conditions of Proposition 3.42, with these same C_{T2}, C_{8}, C_{b}, c_{6} = 1 and logarithmic-derivative constant 4;
2. the prescribed cyclic kept level generated by ψ, its prescribed exceptional quadratic character, and the shares and bounded-character estimates required in Lemma 3.11;
Selectable PDF notation • transcription unchecked
√
3. the full arithmetic estimate 𝒱(E, t, b), with b = e^{xϵ} and the same rank t.
The constants are fixed before x, and the host is allowed to depend on x. This is the complete quantifier content of HostExW(3/2) in supplyChi.
Proof. Let M = N_{ψ} and o = |⟨ψ⟩|. Lemma 3.19 gives a positive integer c and an exponent threshold e_{0} for which the frame order is c2^{e} and its distinguished subgroup has index o. Corollary 3.32 and Lemma 3.15 now give one J ≥1 and a set W of the asserted power-window type, all of whose x carry the data (35). Set C_{0} = J + o + 8M. Choose the constants of Proposition 3.42 for this C_{0}, ϵ, before choosing x.
Increase x_{0} to exceed its threshold, the rank-construction and rank-cutoff thresholds,
Selectable PDF notation • transcription unchecked
(5 + 4M)^{5J/ϵ}, c2^{e0}.For any x ∈ W above this threshold, its window datum satisfies Y^{ϵ/5} ≥ 5 + 4M. In particular q ̸= 3: otherwise log q >^{1}_{2}Y^{ ϵ/5} ≥5/2 would contradict log 3 < 2. Also e ≥e_{0}; if e < e_{0}, then
Selectable PDF notation • transcription unchecked
x ≤x^{2+8ϵ}≤c2^{e}≤c2^{e0}< xwould be impossible. Thus the field construction applies at this very exponent and these same q, d.
By Lemmas 3.19 and 3.20 it gives a field with
|A| = c2^{e}, [A : A_{0}] = o, Q_{S} | lcm(2^{e+2}, M), Q_{S} ≤4M|A|,
the required kernel and character-twist formula, and universal extension of all the choice data. The splitting bound ⌊Y^{ϵ/5}⌋≥4M and the pair’s small-prime congruences verify its field hypotheses. Construct the ranks on this same frame by Lemma 3.17. Their rank value and the window datum imply
Selectable PDF notation • transcription unchecked
Q_{S} ≤4Mc2^{e}≤8Mx^{2+8ϵ}≤C_{0}n.Every input to Proposition 3.42 now holds, so take its host with first set T. Its shares, the exact kept level and exceptional character just constructed, and Lemma 3.18 give the full explicit-formula host input of
Lemma 3.11, with constant 4. The support condition for its characters follows from Q_{S} | lcm(2^{e+2}, M): every prime factor of Q_{S} divides 2M.
Finally the kernel formula identifies this host field with a ψ-field in the window datum. Its arithmetic conclusion is therefore
Selectable PDF notation • transcription unchecked
𝒱(E, ⌊x^{400}⌋, e^{xϵ/2}).Lemma 3.16 gives t ≤x^{400}, hence t ≤⌊x^{400}⌋. The estimate is monotone in that integer bound because it_{√√} quantifies over all coefficient data of rank at most the bound. Also e^{xϵ/2} = b. This proves 𝒱(E, t, b) with all its original coefficient and finite-prime-set quantifiers intact. We have retained the same W, J and constants throughout. The argument is the assembly in ShortNorms/supplyOfAdmOf.lean:13--136 and CharacterBoxes/SupplyChi.lean:8--16.