Section 3.18 · PDF pages 57–59
Norm primes and disjoint exceptional sets
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
3.18 Norm primes and disjoint exceptional sets
The remaining prime input to the host is the following precise assertion, denoted ShortNorm. There are absolute A, c, c^{′}> 0 such that, for d ≥100 prime with d ≡3 mod 4, M ≥3, X ≥1, and
Selectable PDF notation • transcription unchecked
√ √
log(4dM^{2}) ≤c log X, e^{−clog X} ≤h ≤1,
the number of rational primes p in (X, X(1 + h)] for which
Selectable PDF notation • transcription unchecked
A^{2}_{p}+ dB_{p}^{2}= 4p, M | B_{p}, 2M | A_{p} −2 −B_{p} (A_{p}, B_{p} ∈Z) (71)is at least c^{′}hX/((4_{√}dM^{2})^{A} log X). The letter A_{√p} is an integer coefficient, distinct from the absolute exponent A. For K_{d} = Q( −d) and α = (A_{p} + B_{p} −d)/2, these conditions mean exactly_{√} α ∈𝒪_{Kd}, αᾱ = p and α ≡ 1 mod M𝒪_{Kd}. Indeed, in the integral basis 1, (1 + −d)/2, the two coordinates of α −1 are (A_{p} −B_{p} −2)/2 and B_{p}. Proposition 13.3 identifies the exact ray-family assertion sufficient for this input, and Theorem 13.16 proves it with absolute constants. We retain the input’s normalization explicitly in the following conversion.
Lemma 3.40 (Counting overlaps of the exceptional sets). For g ≥2 and a positive integer r, define
Selectable PDF notation • transcription unchecked
{BB(r, g) = {g} ∪ ℓ prime : ∃1 ≤a ≤r, g^{a}< ℓ^{4vℓ(ga−1)}}.
This set has at most 3r + 1 elements. If Y ≥2, Y ≤g_{1} ≤2Y , the number of integers g ∈[Y, 2Y ] for which BB(r, g) meets BB(r, g_{1}) is at most
Selectable PDF notation • transcription unchecked
(3r + 1){1 + 2r^{2}(Y^{3/4}+ 1)}. (72)Proof. For a fixed a, every exceptional prime divides the nonzero integer g^{a}−1. There cannot be four distinct such primes: multiplying their strict inequalities gives
Selectable PDF notation • transcription unchecked
g^{4a}<∏ℓ^{4vℓ(ga−1)}≤(g^{a}−1)^{4}< g^{4a}.
ℓThus there are at most three for each a, proving the finite bound 3r + 1.
We use the elementary bound that z^{a}= 1 has at most 2a solutions modulo a prime power ℓ^{w}, for w, a ≥1. All such solutions are units. For odd ℓ that unit group is cyclic, and the exact number is gcd(a, ℓ^{w−1}(ℓ−1)) ≤ a. Here is a direct justification of the group structure being used. A finite subgroup of the multiplicative group of a field is cyclic: its exponent is attained by an element, by combining elements of maximal prime-power orders; the polynomial T^{m}−1 has at most m roots, so that exponent equals the group order. Choose a generator modulo ℓ. Of its two lifts v, v +ℓ, one satisfies v_{ℓ}(v^{ℓ−1}−1) = 1, as their (ℓ−1)-st powers differ modulo ℓ^{2} by the nonzero multiple (ℓ−1)v^{ℓ−2}ℓ. Binomial expansion then gives v_{ℓ}(v^{(ℓ−1)ℓj}−1) = j + 1; this lift generates the units modulo every ℓ^{w}. For ℓ = 2, the description by −1, 5 in Lemma 3.33 gives C_{2} × C_{2}w−2 for w ≥3. The number of roots is gcd(a, 2) gcd(a, 2^{w−2}) ≤2a; the two smaller powers of 2 satisfy the same bound directly.
Fix ℓ, a and a nonempty collection of exceptional g ∈[Y, 2Y ]. Choose g_{0} minimizing w = v_{ℓ}(g^{a}−1). Then w ≥1, all those g solve g^{a}≡1 mod ℓ^{w}, and
Selectable PDF notation • transcription unchecked
Y ≤g_{0} ≤g_{0}^{a}< (ℓ^{w})^{4}.There are at most 2a residue classes. Each class has at most Y /ℓ^{w}+ 1 integers in an interval of length Y , because successive members are at least ℓ^{w} apart. The displayed inequality gives Y /ℓ^{w}≤Y^{3/4}. Thus there are at most 2a(Y^{3/4}+ 1) such g.
For fixed ℓ, membership ℓ∈ BB(r, g) therefore accounts for at most one integer g = ℓ, plus the sum of these bounds for 1 ≤a ≤r. It is at most 1 + 2r^{2}(Y^{3/4}+ 1). Sum this over the at most 3r + 1 elements of BB(r, g_{1}); overcounting can only increase the bound. This proves (72). These are precisely the valuation-minimum, root-fiber and union arguments of FoundationProofs/DivLeRpowThreeQuarters.lean:10--221 and its exceptional-prime and prime-power-root suppliers.
Proposition 3.41 (The full quantitative level data). There is an absolute C_{1} ≥1 such that, for each fixed 0 < ϵ < 1/52, all sufficiently large x, all valid ranks, and all integers N, d with
d ≥100 prime, d ≡3 mod 4, d | N, N > 0, log N ≤3x^{ϵ/5}(log x)^{2},
there are distinct primes g_{0}, g_{1} and distinct primes p, p^{′}, q_{0} such that, with b = e^{xϵ},
(kb)^{8}≤g_{i} ≤2(kb)^{8}, g_{i} satisfies (71) for M = N,
BB(r, g_{0}) ∩ BB(r, g_{1}) = ∅, p, p^{′}≡1 mod 15N,
q_{0} ≡1 mod N, p, p^{′}, q_{0} ≤N^{C1}, p, p^{′}̸= g_{i}.
The constant C_{1} is fixed before ϵ; the threshold is uniform over all the listed data.
Proof. Theorem 13.16 supplies ShortNorm in the exact stated normalization. We first use it with h = 1. Put t = x^{ϵ/5} and B = 4dN^{2}. Eventually (log x)^{2}≤t, so the modulus conditions give
log B = log 4 + log d + 2 log N ≤10t^{2}.
Selectable PDF notation • transcription unchecked
√
For any V > 0 with log V ≥8x^{ϵ}= 8t^{5}, this is at most c log V once t is sufficiently large. Also, uniformly over all these V ,
A log B + log log V − log c^{′}≤_{10}^{1} log V.
To verify the uniformity, put v = log V ≥8t^{5}. Then A log B/v ≤(10A/8)t^{−3}→0; the function (log v)/v decreases to zero after v = e; and | log c^{′}|/v →0. Their sum is at most 1/10 for all v above the same lower bound. Thus ShortNorm supplies at least V^{9/10} norm primes in (V, 2V ]. This is the uniform conversion of ShortNorms/normPrimesN.lean:7--157.
Take V = (kb)^{8}, so log V ≥8x^{ϵ}. Valid ranks have r ≥1 and r ≤x^{5} eventually. Hence, at a threshold depending only on ϵ,
Selectable PDF notation • transcription unchecked
20r^{3}≤20x^{15}< e^{xϵ}≤V^{3/20}.Fix any one norm prime g_{0} in this interval. The bound (72) is strictly less than V^{9/10}, because, for r, V ≥1,
Selectable PDF notation • transcription unchecked
(3r + 1){1 + 2r^{2}(V^{3/4}+ 1)} ≤20r^{3}V^{3/4}< V^{9/10}.Therefore some other norm prime g_{1} avoids its exceptional set. It is automatically distinct: BB(r, g_{0}) meets itself. This proves the two norm-prime assertions by the finite exclusion argument of ShortNorms/typePrimesN.lean:9--129.
Choose p, p^{′}, q_{0} by Lemma 3.35, noting N ≥d ≥100. Its absolute exponent is our C_{1}. For large x,
C_{1} log N ≤3C_{1}x^{ϵ/5}(log x)^{2}< x^{ϵ}.
Consequently p, p^{′}≤N^{C1} < b ≤(kb)^{8}≤g_{i}. They cannot equal either g_{i}. No new choice affects the two norm primes or the disjointness already established. This proves the full level-data assertion in ShortNorms/levelData.lean:36--78.