Section 3.11 · PDF pages 28–34
The character-supply construction
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
3.11 The character-supply construction
We next give the construction that supplies the hosts just used. The arithmetic window in Definition 8.1 and the analytic estimates for auxiliary quadratic twists have different quantifiers. The following formulation keeps both visible. For a character ξ modulo M, set
Selectable PDF notation • transcription unchecked
(_{a})i (_{a})_{j}
ξ_{q,d}^{i,j}(a) = ξ(a)_{qd} , i, j ∈{0, 1}.Here induction to a primitive character χ means equality on all integers coprime to 2Mqd. Write
Selectable PDF notation • transcription unchecked
( 1 )
ZB(χ, Q) : L(s, χ) ̸= 0 ℜs > 1 − , |ℑs| ≤Q .
Selectable PDF notation • transcription unchecked
400
The assertion PairGood(M, ϵ, Y, X; q, d) means the following three conditions. First q, d satisfy the window-pair conditions of Definition 8.1 at Y , and (M, qd) = 1. Second, for every character ξ modulo M, every (i, j) ̸= (0, 0), every primitive character χ inducing ξ_{q,d}^{i,j} on these coprime integers, and every Y ≤y ≤X,
Selectable PDF notation • transcription unchecked
||||L^{′} |||||𝒢_{χ}(y)| ≤y^{1/2+ϵ/2}, (1, χ) ≤4 log y. (33)
Selectable PDF notation • transcription unchecked
L
Third, for every real primitive ρ of conductor dividing 8M, every nonzero pair (i, j), and every primitive χ inducing ρ^{i,j}_{q,d},
Selectable PDF notation • transcription unchecked
(
ZB χ, 8M exp(Y^{ϵ/5}) exp(Y^{ϵ/5} log^{2}Y )^{j})
holds. The nonzero quadratic twists in this definition are nonprincipal in the application below; thus the loga-rithmic derivative in (33) is an ordinary finite value. The source’s induction predicate includes primitiveness, so this formulation has not discarded any induced characters. We denote by PairEx the assertion
Selectable PDF notation • transcription unchecked
∀M ≥1 ∀0 < ϵ < 1/52 ∀A ≥1 ∃Y_{1} ∀Y ≥Y_{1} ∃q, d :_{(34)}PairGood(M, ϵ, Y, Y^{A}; q, d).
This is a substantive auxiliary analytic input. Its proof must establish the simultaneous bounds for all the characters just listed, not only a choice of q, d having the congruences. The definitions here are those of CharacterBoxes/PairGood.lean:9--30.
Lemma 3.15 (Rescaling the arithmetic windows). Fix a primitive ψ, 0 < ϵ < 1/52, and c ≥1. Assume VWinAt(ψ, 401) and (34). There is J ≥1, fixed before the lower endpoint, such that for every y there is Z ≥y with the following property. For every x ∈[Z, Z^{3/2}] there are Y, q, d, e for which
x^{1/J} ≤Y ≤x, PairGood(N_{ψ}, ϵ, Y, x; q, d),
Selectable PDF notation • transcription unchecked
( x^{2+8ϵ}≤)c 2^{e}≤2x^{2+8ϵ}, (35)𝒱 E, ⌊x^{400}⌋, exp(x^{ϵ}/2) for every ψ-field E at e, q, d.
The last notation is the arithmetic estimate of Definition 8.1, with all its coefficient-data and finite-prime-set quantifiers.
Proof. Choose a function e(t) on t ≥1 such that
Selectable PDF notation • transcription unchecked
_{t}2+8ϵ_{≤2}e(t)_{≤2t}2+8ϵ_{.}For example, take the least integer with the first inequality; the preceding power of 2 gives the second. Extend it arbitrarily to t < 1. Apply the arithmetic-window hypothesis to this one function. It supplies J ≥1 and X_{0}. Apply PairEx with (M, A) = (N_{ψ}, J), obtaining Y_{1}. Put
Selectable PDF notation • transcription unchecked
k = c^{1/(2+8ϵ)}≥1.For a prescribed y, choose
M_{0} ≥ max(1, y, Y_{1}, k^{3}, k^{400}), X ≥ max(X_{0}, M_{0}^{J}).
Thus Y_{0} = X^{1/J} ≥ M_{0}. Choose q, d from PairEx at Y_{0}; its upper endpoint is Y_{0}^{J} = X. The arithmetic-window assertion, applied to this same pair, gives
Selectable PDF notation • transcription unchecked
W ≥Y_{0}, W^{2}≤X,and the required 𝒱-estimate at every t ∈[W, W^{2}], with rank cutoff ⌊t^{401}⌋.
Set Z = kW. Then Z ≥y. Since W ≥k^{3},
Selectable PDF notation • transcription unchecked
(kW)^{3/2}≤W^{2}.For x ∈[Z, Z^{3/2}], put t = x/k. We have
Selectable PDF notation • transcription unchecked
W ≤t ≤x ≤W^{2}≤X.Take Y = Y_{0} and e = e(t). The inequalities x ≤ X and Y_{0} ≤ W ≤ x give x^{1/J} ≤ Y ≤ x. The PairGood-assertion remains true after decreasing its upper endpoint from X to x. Multiplication of the page inequalities by c = k^{2+8ϵ} gives the two bounds for c2^{e}.
It remains to check both changes in the arithmetic estimate. Since t ≥W ≥k^{400},
Selectable PDF notation • transcription unchecked
_{x}400_{= k}400_{t}400_{≤t}401_{.}Consequently ⌊x^{400}⌋≤⌊t^{401}⌋. Also t ≤ x gives exp(t^{ϵ}/2) ≤ exp(x^{ϵ}/2). The assertion 𝒱(E, r, B) is monotone when r decreases and B increases: its individual finiteness conditions are restricted to fewer indices, and its sums lose only nonnegative terms. These two comparisons prove (35). In particular the same chosen q, d work throughout the new window; no new application of the arithmetic hypothesis is made at an individual x. This is the proof of CharacterBoxes/WinPairs.lean:5--81.
The rank parameters in the construction are natural numbers n, m, k, t, with m, k even and t odd, satis-fying
Selectable PDF notation • transcription unchecked
2 ≤m, m + 3 ≤k, k + m + 4 ≤t, 3m < t, m ≤2n ≤k, m^{2}≤k + m(t + 1).The frame has order n, f = 2n, and r = k + m −1. At the scale (x, ϵ), put
Selectable PDF notation • transcription unchecked
⌈_{10r}(_{f}2_{(k −1)}3_{L}2)⌉
L = x^{ϵ}, δ = x^{−ϵ/8}, T_{x} = ⌈x^{377}⌉, W_{R} = 8_{8} f +_{m} .The condition RankVal(x, ϵ; R) is
Selectable PDF notation • transcription unchecked
x^{2+8ϵ}≤n ≤2x^{2+8ϵ},^{√}xδ ≤m ≤2^{√}xδ,_{(36)}
x^{9/2+10ϵ}≤k ≤2x^{9/2+10ϵ}, r + t = 8fr + 4 + T_{x}W_{R}.This is a relation on ranks already satisfying the preceding integer constraints, not an assertion that arbitrary four integers satisfy them.
Lemma 3.16 (The cutoff 400). If 0 < ϵ < 1/52, x ≥2^{100}, and (36) holds, then t ≤x^{400}.
Proof. Write Y = x^{1/100}≥2. The rank bounds, and 0 < ϵ < 1/52, imply
Selectable PDF notation • transcription unchecked
n ≤2Y^{216}, f ≤4Y^{216}, k ≤2Y^{470}, m ≥Y^{49}, L^{2}≤Y^{4}.For example 2 + 8ϵ + ϵ/100 ≤ 216/100 and 9/2 + 10ϵ ≤ 470/100. The estimate for m follows from xδ = x^{1−ϵ/8} ≥x^{98/100}. Since m + 3 ≤k, also r ≤2k ≤4Y^{470}. All quantities being nonnegative, and m > 0, we get
Selectable PDF notation • transcription unchecked
f^{2}(k −1)^{3}L^{2}_{≤} (4Y^{ 216})^{2}(2Y^{ 470})^{3}Y^{ 4}_{= 128Y1797.}
m Y^{49}Hence the parenthesis defining W_{R} is at most 132Y^{1797}. Using ⌈a⌉< a + 1 for a ≥0, we obtain
Selectable PDF notation • transcription unchecked
W_{R} ≤5288Y^{2267}, T_{x} ≤2Y^{37700}.The final equality in (36) therefore yields
Selectable PDF notation • transcription unchecked
t ≤8fr + 4 + T_{x}W_{R}
≤128Y^{686}+ 4 + 10576Y^{39967}
≤10708Y^{39967}≤Y^{40000}= x^{400}.The last comparison uses Y^{33}≥2^{33}> 10708. These explicit estimates are the entire argument of CharacterBoxes/EventuallyRankLeRpowOfLtOneDivFiftytwo.lean:5--126; they explain the slack between the exponents 377, 400 and 401.
Lemma 3.17 (Constructing ranks over a fixed frame). For x ≥16, 0 < ϵ < 1/52, and a frame of order x^{2+8ϵ}≤n ≤2x^{2+8ϵ}, there are ranks over that same frame satisfying (36).
Selectable PDF notation • transcription unchecked
√
Proof. For A ≥ 2, the even integer 2⌈A/2⌉ lies in [A, 2A]. Apply this first to A = xδ and then to B = x^{9/2+10ϵ}, obtaining m, k. Here 2 ≤A ≤x, while
Selectable PDF notation • transcription unchecked
x^{2}≤n ≤2x^{3}, x^{4}≤B.Since x ≥16, these inequalities imply
Selectable PDF notation • transcription unchecked
m ≥2, m + 3 ≤k, m ≤2n ≤k.
Put r = k + m −1, f = 2n, and define W_{R}, T_{x} as above. Set
Selectable PDF notation • transcription unchecked
t = 8fr + 4 + T_{x}W_{R} −r.This is positive, because fr ≥r. As k, m are even, r is odd; since W_{R} is a multiple of 8, t is odd. We also have f ≥m ≥2, whence
Selectable PDF notation • transcription unchecked
t ≥(8f −1)r + 4 ≥15r + 4.
As r = k + m −1 ≥ m + 1, this proves k + m + 4 = r + 5 ≤ t, 3m < t, and m ≤ t + 1. The last inequality gives m^{2}≤m(t + 1) ≤k + m(t + 1). Thus these integers satisfy every rank constraint, and the definition of t gives the final identity in (36). The chosen intervals for m, k give its remaining inequalities. No change of frame or of its distinguished cyclic subgroup has occurred. This is the construction in Proofs/GlobalInterpolation/ExistsRanksRankValFrame.lean:10--99.
Lemma 3.18 (Which characters the pair bounds control). Let a host have modulus Qqd, with N_{ψ} | Q, and assume every prime divisor of Q divides 2N_{ψ}. Suppose its characters trivial on A_{0} have the description
Selectable PDF notation • transcription unchecked
(_{a})i (_{a})_{j}
χ_{θ}(a) = ξ(a)_{qd} ((a, Qqd) = 1), θ(ι_{d}) = (−1)^{j}, (37)where ξ ∈⟨ψ⟩ and i, j ∈{0, 1}. If PairGood(N_{ψ}, ϵ, Y, x; q, d), then every bounded host character in (32) has
|𝒢_{χ}(x)| ≤x^{1/2+ϵ}, |L^{′}(1, χ)/L(1, χ)| ≤4 log x.
Proof. A bounded host character belongs either to X_{+} and is not kept, or to X_{−}. Both sets consist of characters trivial on A_{0}, so (37) applies. If i = j = 0 and θ ∈X_{+}, its primitive character is the primitive character inducing ξ, which belongs to the cyclic kept level. This contradicts its not being kept. If θ ∈X_{−}, the same choice would give both θ(ι_{d}) = 1 and θ(ι_{d}) = −1. Thus (i, j) ̸= (0, 0).
An integer coprime to 2N_{ψ}qd is coprime to Qqd: otherwise a common prime factor in Q would divide 2N_{ψ}. Consequently the host’s primitive character and the twist agree on every integer needed in the induction predicate for PairGood. Apply (33) with y = x. Since x ≥1, its exponent 1/2 + ϵ/2 can be increased to 1/2 + ϵ. This gives both conclusions and proves, in ordinary character notation, CharacterBoxes/BoundedTw.lean:5--56.
We record explicitly the finite group behind the ψ-field. Write M = N_{ψ}, B = (ℤ/M)^{×}/ ker ψ, and
Selectable PDF notation • transcription unchecked
H_{e} = (ℤ/2^{e+2})^{×}/{1, −1}.For e ≥1, H_{e} is cyclic of order 2^{e}. Indeed v_{2}(5^{2j}−1) = j + 2, by induction: the initial case is 5 −1 = 4, and each subsequent squaring multiplies by a number congruent to 2 modulo 4. Thus 5 has order 2^{e} modulo 2^{e+2}. Its powers are 1 modulo 4, so their negatives are distinct; the 2^{e+1} residues ±5^{j} exhaust the units, proving the assertion after quotienting by sign. Let Q_{e} be the least divisor of lcm(2^{e+2}, M) divisible by 2^{e+2} through which the quotient map to B factors. Such a divisor exists, by taking the lcm itself. Denote the resulting surjection by ξ_{e} : (ℤ/Q_{e})^{×}−→B, and let
η_{e}(a) = ([a]_{He}, ξ_{e}(a)), A_{e} = im η_{e} ⊂H_{e} × B.
This minimum and this image, rather than an independently chosen group of the same cardinality, are used in the source.
Lemma 3.19 (The finite group and its twists). There are integers c ≥1, e_{1} such that
Selectable PDF notation • transcription unchecked
|A_{e}| = c2^{e} (e ≥e_{1}), c ≤|B|.For primitive ψ, in fact Q_{e} = lcm(2^{e+2}, M). For primes q, d coprime to M, with q ≡3 (mod 8), d ≡7 (mod 16), define
Selectable PDF notation • transcription unchecked
r_{e} : (ℤ/Q_{e}qd)^{×}−→{((1, −)1}^{2}(× A)_{e}, (( )))
a −−→^{a}_{q} ,^{a}_{d} , η_{e}(a) η_{e}^{a}_{q} .^{(38)}It is surjective, and its kernel is exactly
Selectable PDF notation • transcription unchecked
(a) (a)
a ≡±1 (mod 2^{e+2}), ψ(a) = 1, = = 1. (39)
Selectable PDF notation • transcription unchecked
q d
The projection A_{e} →B has cyclic kernel A_{0}. Every character of {1, −1}^{2}× A_{e} trivial on A_{0} has the twist description (37). The quotient A_{e}/A_{0} has order |B|, independently of e.
Proof. First prove M | Q_{e}. If a is a unit modulo M whose reduction modulo gcd(Q_{e}, M) is 1, the Chinese remainder theorem supplies an integer z congruent to a modulo M and to 1 modulo Q_{e}. It is a unit modulo both moduli, hence modulo their lcm. The factorization through Q_{e} gives ψ(z) = 1. Thus ψ is trivial on the kernel of reduction to gcd(Q_{e}, M), and factors through that divisor of M. Primitiveness implies M ≤ gcd(Q_{e}, M); hence M | Q_{e}. Together with the defining divisibilities of Q_{e}, this proves the stated equality.
The projection A_{e} →H_{e} is onto: reduction of units from the lcm onto 2^{e+2}, followed by the quotient map, is onto. Its kernel is isomorphic, by second projection, to
C_{e} = ξ_{e}(ker[(ℤ/Q_{e})^{×}→H_{e}]) ⊂B.
Accordingly |A_{e}| = 2^{e}|C_{e}|. Reduction from Q_{e+1} to Q_{e} carries an integer congruent to 1 or −1 modulo 2^{e+3} to an integer congruent to the same sign modulo 2^{e+2}, and does not change its class in B. Lifting a unit from Q_{e+1} to the corresponding lcm therefore shows C_{e+1} ⊂C_{e}. The positive integers |C_{e}| decrease and are bounded below by 1. Choose an index where their minimum is attained. They are constant thereafter, equal to some 1 ≤c ≤|B|. This proves the order formula.
The two quadratic characters modulo q, d are each onto {1, −1}. Since Q_{e}, q, d are pairwise coprime, the Chinese remainder theorem prescribes these two values and the residue modulo Q_{e} independently. Multipli-cation of the A_{e}-coordinate by η_{e}((a/q)) is an invertible change of coordinates once the first sign is fixed; thus r_{e} is onto. If both signs are 1, the remaining coordinate is η_{e}(a). Its being 1 means precisely a ≡±1 (mod 2^{e+2}) and ψ(a) = 1. This proves (39).
The first projection is injective on the kernel of A_{e} →B, since an element with both coordinates 1 is the identity. A subgroup of the cyclic group H_{e} is cyclic, so this kernel is A_{0} = ⟨a_{0}⟩ for a suitable a_{0}. The projection to B is onto, giving A_{e}/A_{0} ≃B and the quotient-order assertion.
Now let θ be trivial on A_{0}. Its restriction to A_{e} descends to a character of B. Since B = (ℤ/M)^{×}/ ker ψ, its characters are exactly the powers of ψ: indeed ψ identifies B with a finite cyclic subgroup of ℂ^{×}, and a character of a cyclic group is determined by a root of unity of that group’s order. In the A_{e}-coordinate write this restriction as ξ. The restriction of θ to each sign factor is either trivial or the sign, because its value at −1 squares to 1. Applying θ to (38), and absorbing the factor θ(η_{e}((a/q))) into the first sign character, gives ξ(a)(a/q)^{i}(a/d)^{j}. On the distinguished d-sign element the value is (−1)^{j}, as claimed. These are the image, kernel and character arguments in CharacterBoxes/OrdAny.lean:6--107, KerChiAny.lean:6--140 and TwistAny.lean:6--167.
The field used subsequently is the fixed field of ker r_{e} in ℚ(ζ_{Qeqd}). Equation (39) identifies it with the ψ-field in Definition 8.1; in particular the arithmetic estimate applies to this field, not to an unrelated field with the same degree. Its Galois group is the displayed sign product with A_{e}. Since (−1/q) = (−1/d) = −1 and the third coordinate of r_{e}(−1) is η_{e}(−1)^{2}= 1, complex conjugation has the required two negative signs and trivial A_{e}-part. The characters in the cyclic kept level lift to X_{+}: their lift is
Selectable PDF notation • transcription unchecked
(σ_{q}, σ_{d}, a) −−→ξ(a η_{e}(σ_{q})), ξ ∈B.̂Substitution in (38) cancels the two copies of η_{e}(σ_{q}), and gives ξ(ainteger). This verifies the kept primitive-character identification used by Lemma 3.18.
Lemma 3.20 (The field rows and the different ideal). Fix ψ. After increasing the integer e_{1} in Lemma 3.19, the following holds for e ≥e_{1}. Suppose q, d are as in that lemma, q ̸= 3, q | d + 1, b ≥4M, and
Selectable PDF notation • transcription unchecked
(−d)
= 1 for every odd prime p ≤b.
Selectable PDF notation • transcription unchecked
p √
Let E be its fixed field and K = ℚ( −d) inside E. Then, writing n = |A_{e}|, o = |B|, and Ψ = Gal(E/K), we have
Q_{e} ≤n^{2}, o^{64}≤2^{e}, 4p ≤b (p | Q_{e}, p odd prime).
The q-sign character is the action on an element s_{q} ∈ E with s^{2}_{q} = −q; the analogous d-sign character
Selectable PDF notation • transcription unchecked
√
is the action on −d. Each prime divisor of Q_{e} is detected by nontrivial inertia in the host. There is an integral ideal 𝔟 of E such that
Selectable PDF notation • transcription unchecked
𝔇_{E/K} = 𝔟 𝔟, 𝔟 + 𝔟 = 𝒪_{E}, σ𝔟 = 𝔟 (σ ∈Ψ). (40)Consequently every prescribed choice of the auxiliary primes, ideal, finite sets and word parameters in the host definition can be realized over this same field and frame, once q, d > 4tr + 1; the realization does not change those choices.
Proof. Increase e_{1} so that e_{1} ≥2, 4M, 64o. Since a < 2^{a} for natural a, we have 4M ≤2^{e}, and
Selectable PDF notation • transcription unchecked
Q_{e} ≤4M2^{e}≤2^{2e}≤n^{2}, o^{64}≤(2^{o})^{64}≤2^{e}.An odd prime divisor of Q_{e} divides M. It is at most M, proving its stated bound and the needed quadratic splitting condition there.
The usual quadratic Gauss element
Selectable PDF notation • transcription unchecked
∑ (a)
τ_{p} = ζ_{p}^{a} (p = q or d)
Selectable PDF notation • transcription unchecked
a mod p^{p}has τ_{p}^{2} = −p, since p ≡ 3 (mod 4). Here the Gauss identity follows by the finite Fourier calculation τ_{p} = (−1/p)τ_{p}, τ_{p}τ_{p} = p; in the latter calculation the substitution a = tb, b ̸= 0, gives
Selectable PDF notation • transcription unchecked
|τ_{p}|^{2}= ∑ (^{ t}) ∑ζ_{p}^{(t−1)b}= (p −1) −∑(^{ t})= p.
t mod p^{p} b̸=0 t̸=1^{p}The last step uses the zero sum of a nontrivial character. An automorphism ζ_{p} →→ζ_{p}^{u} sends τ_{p} to (u/p)τ_{p}, by the substitution a →→u^{−1}a. Thus both Gauss elements are fixed by ker r_{e} and belong to E, with the required sign actions. In particular the kernel of the d-sign is exactly Gal(E/K).
We check the exactness assertion at l | Q_{e}. If 2^{e+2} | Q_{e}/l, triviality of η_{e} on all units congruent to 1 modulo Q_{e}/l would make the quotient to B factor through Q_{e}/l. This smaller divisor would satisfy the defining property of Q_{e}, a contradiction. If that tower divisibility fails, then l = 2 and Q_{e} = 2^{e+2}c_{0} with c_{0} odd. The unit 1 + Q_{e}/2 is 1 modulo Q_{e}/2, but is neither 1 nor −1 modulo 2^{e+2}. The first equality would force 2^{e+2} | Q_{e}/2; the second would force 4 | Q_{e}/2 + 2, although 4 | Q_{e}/2. Both are impossible. Its H_{e}-image is therefore nontrivial. Using the Chinese remainder theorem to set the q, d coordinates equal to 1 proves the exactness in the full host modulus as well.
We next prove (40), including the invariance needed to attach the chosen data. The only rational primes that can support 𝔇_{E/K} divide Q_{e}q. Indeed a cyclotomic extension is unramified outside its modulus, and the inertia at d, after restriction to E, is contained in {1, ι_{d}}, where ι_{d} is the negative d-sign and has other
coordinates 1. Its intersection with Ψ is trivial. Thus the relative inertia over K is trivial at d also. The inertia criterion for the different now gives the asserted support: in a finite Galois extension of number fields the inertia order is the ramification index, and a prime divides the different precisely when it is ramified (the residue extensions are finite fields and hence separable).
Every rational prime dividing Q_{e}q splits in K. For odd primes dividing Q_{e} this was assumed; for q, −d ≡1 (mod q_{√}) proves it. For 2, the condition d ≡7 (mod 16) gives the splitting directly. More explicitly 𝒪_{K} = ℤ[(1 + −d)/2]; its defining polynomial is T^{2}−T + (d + 1)/4 and has distinct roots modulo 2. At an odd prime not dividing d, the same polynomial splits with distinct roots exactly when (−d/p) = 1. Factoring this quadratic modulo the prime gives the two distinct prime ideals of 𝒪_{K}. Complex conjugation exchanges them. Thus if 𝔓 divides 𝔇_{E/K}, its contractions
Selectable PDF notation • transcription unchecked
𝔭 = 𝔓 ∩𝒪_{K}, 𝔭 = 𝔓 ∩𝒪_{K}are distinct.
The relative different is invariant under every σ ∈ Gal(E/ℚ). To see this without assuming that σ fixes K pointwise, use its inverse trace dual
𝔇_{E}^{−1}_{/K}= {y ∈E : Tr_{E/K}(y𝒪_{E}) ⊂𝒪_{K}}.
The extension is abelian, so σ commutes with every K-automorphism of E. Consequently it commutes with their sum, the relative trace, and preserves integrality. For y in the displayed dual and a ∈𝒪_{E}, apply this observation to yσ^{−1}(a). It proves σy belongs to the same dual. Apply the argument to σ^{−1} for equality, and invert the fractional ideals to obtain invariance of the different.
Choose a total ordering of the prime ideals of 𝒪_{K}, once and for all. In the unique prime-ideal factoriza-tion of 𝔇_{E/K}, retain a factor 𝔓^{a𝔓} exactly when 𝔭 < 𝔭, and let 𝔟 be their product. Conjugation interchanges the retained and discarded prime powers, with their multiplicities, by the proved invariance of the different. It follows that 𝔇_{E/K} = 𝔟𝔟. No prime divides both factors, since that would require both opposite strict in-equalities. In a Dedekind domain this proves their sum is the unit ideal. Finally σ ∈Ψ leaves the contraction of each prime ideal to K unchanged and preserves the different. It therefore permutes the retained prime powers and fixes 𝔟. This is exactly the contraction-order selection and factorization argument of InertiaGaloisSymmetry/KcDiff.lean:75--182, with invariance proved as in KcDiffSmulMem.lean:45--132._{√}
Selectable PDF notation • transcription unchecked
√
To realize a prescribed choice datum, choose a complex embedding of E. Its value on −d is ±i d; composing with conjugation if needed selects the positive choice, so the required CM type is nonempty. Use s_{q} above, this embedding, and 𝔟 as the extra field data. All remaining fields of the host are precisely the prescribed datum. The row conditions checked at the beginning, the two inequalities q, d > 4tr + 1, and (40) verify every extra condition on these choices. In particular no prime or finite set is chosen anew. This is CoprimeRanks/SecondSetNoRelation.lean:87--104; it explains the universal quantifier over choice data in the source’s admission predicate.