Skip to content

Section 4.1 · PDF pages 63–66

The integer bound and the case-I count

The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.

4.1 The integer bound and the case-I count

The following argument isolates the precise arithmetic assertion needed from the unitary rank-three con-struction. It is useful to do so before discussing its publication inputs: the integer produced there must be independent of the coefficient prime. A separate integer for each prime would not give the estimate below.

Write v_{ℓ}(e, ψ) ≥0 for the normalized finite length denoted Vn in the source, and write λ_{ℓ}(e, ψ) for its length before conversion to a real number. The assertion λ_{ℓ}(e, ψ) < ∞ is retained separately, so no value assigned to an infinite length enters an inequality. For G_{N} = (ℤ/Nℤ)^{×} and H ≤G_{N}, put

Selectable PDF notation • transcription unchecked
×

𝒪_{ℓ}(H) = {ψ : G_{N} −→ℚ_{ℓ} : ker ψ = H},

with values restricted to the coefficient ring in use when necessary. These sets are finite. A nonempty such set has cyclic quotient G_{N}/H, because a finite subgroup of a field’s multiplicative group is cyclic.

Input 4.2 (The common integer congruence bound). For each number field K, there are natural numbers c_{5}, A with the following property. For e ≥1, N > 0, H ≤G_{N}, and a prime r ∤30N| disc K|, there is an integer b_{r} ̸= 0 such that

Selectable PDF notation • transcription unchecked
(

log |b_{r}| ≤c_{5}φ([G_{N} : H]) N(e + 1))^{A} log r. (76)

If ℓ̸= r and the orbit 𝒪_{ℓ}(H) contains an admissible character, then every character in that orbit has finite length and ∑

v_{ℓ}(e, ψ) ≤2 ord_{ℓ}(b_{r}). (77)

Selectable PDF notation • transcription unchecked
ψ∈𝒪_{ℓ}(H)

The integer b_{r} works for every coefficient prime and coefficient ring simultaneously.

Here admissibility is the source’s explicit predicate GD. Its conditions are: ℓ is odd, e ≥1, N is even, ℓ∤ ord ψ, the part of ψ on the ℓ-primary component of G_{N} has square one, and ψ(−1) = (−1)^{e}; K is imaginary quadratic, ℓ∤| disc K|h_{K}, gcd(N, | disc K|) = 1, and ℓ−1 ∤2e. There is also the required independence condition on the quadratic character of K: the intersection of the kernels of the mod-ℓ cyclotomic character and the prime-to-ℓ, off-ℓ part ψ^{(ℓ)} of ψ is not contained in G_{K} ⊂G_{ℚ}. In the source, ψ^{(ℓ)} is chiP: first remove the ℓ-power-order part of ψ, then divide by its restriction to the ℓ-primary component of G_{N}. The twists and the kernel condition are part of the input; an estimate for arbitrary characters is not being assumed.

Lemma 4.3 (Two auxiliary primes remove their exceptions). Assume Input 4.2. Let r ̸= r^{′} be primes prime to 30N| disc K|, and let L be any finite set of coefficient primes for which 𝒪_{ℓ}(H) contains an admissible character. Then all its orbit lengths are finite and

Selectable PDF notation • transcription unchecked
∑ ∑ (

log ℓ v_{ℓ}(e, ψ) ≤2c_{5}φ([G_{N} : H]) N(e + 1))^{A}(log r + log r^{′}). (78)

Selectable PDF notation • transcription unchecked
ℓ∈L ψ∈𝒪_{ℓ}(H)

Proof. If L is empty the assertions are immediate. Otherwise its admissible character gives e ≥1, so obtain the two nonzero integers b_{r}, b_{r}′ from the input. For ℓ̸= r use b_{r}; for ℓ= r use b_{r}′, which is allowed because r ̸= r^{′}. In either case all lengths are finite and the orbit sum is at most 2 ord_{ℓ}(b_{r}) + 2 ord_{ℓ}(b_{r}′).

For every nonzero integer b the pairwise coprime prime powers ℓ^{ordℓb}, ℓ∈L, have product dividing |b|. Their product is positive, so taking logarithms gives

Selectable PDF notation • transcription unchecked
∑

log ℓ ord_{ℓ}b ≤ log |b|.

Selectable PDF notation • transcription unchecked
ℓ∈L

Multiply the preceding orbit inequalities by log ℓ≥0, sum them, and apply this divisor inequality to the two integers. The result is at most 2 log |b_{r}| + 2 log |b_{r}′|. Substitution of (76) is exactly (78).

[Lean: U3.corGK, Development/AutomorphicArithmetic/AutomorphicVarieties/UnitaryThreeGroups/CorGSumLog.lean, 6–73; the integer input is PropGK, Development/AutomorphicArithmetic/AutomorphicVarieties/UnitaryThreeGroups/KatoUse.lean, 36–52.]

Lemma 4.4 (Counting the distinct kernels). If G is a finite abelian group and T is a finite set of subgroups with cyclic quotients, then ∑

Selectable PDF notation • transcription unchecked
φ([G : H]) ≤|G|.
H∈T

Proof. For a cyclic quotient G/H of order m, its faithful complex characters are specified by the primitive mth roots assigned to a generator. There are φ(m) of them. Composing with the quotient map gives distinct characters of G whose kernel is exactly H. Characters obtained from different H have different kernels, so the resulting sets are disjoint. They lie in the character group of G. To count that group, write G as a product of finite cyclic groups: a character is specified independently by a root of unity of the appropriate order on each cyclic generator. Their number is the product of the cyclic orders, namely |G|. Counting the disjoint subsets proves the inequality.

[Lean: orbSum, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/OrbSum.lean, 8–58.]

Lemma 4.5 (Case-I host characters are admissible). Let h be a host for χ, with h.Big(t), and let 0 < e < t. If ℓ is odd and in case I, every ψ ∈ X_{h}(ℓ, e) satisfies the admissibility conditions of Input 4.2 for K =

Selectable PDF notation • transcription unchecked
ℚ(^{√}−p_{K}).

Proof. Put o = ord χ, m = cond χ, and h_{K} = | Cl(K)|. The exceptional set in the host is {3} together with the odd prime divisors of omp_{K}h_{K}p_{1}. Case I says ℓ is outside this set and ℓ−1 ∤2e. Consequently ℓ≥5, ℓ∤o, m, p_{K}, h_{K}. The large-host requirement places h.q_{1}, h.d above m, o, p_{K}, h_{K}, p_{1}. Both are primes. The definition N = lcm(2^{a+2}, m)h.q_{1}h.d therefore gives p_{K} ∤N, because p_{K} is odd, prime to m, and different from the last two factors. It also gives N even.

The host subgroup H_{h} is the intersection of the inverse images of {±1} on the 2^{a+2} factor, ker χ on the conductor factor, and the square subgroups on h.q_{1}, h.d. These conditions give [G_{N} : H_{h}] | 2^{a+2}o: the first factor has index dividing 2^{a}, the conductor condition has index o, and each of the last two square conditions has index two. Indices of intersections divide the product of the indices, and inverse images can only decrease an index. A host character is trivial on H_{h}, so its order divides this index. Thus ℓ∤ ord ψ.

Since ℓ∤m and ℓ is odd, the ℓ-primary component of G_{N} is trivial unless ℓ= h.q_{1} or ℓ= h.d. In those two cases its square subgroup lies in H_{h}. The restriction of ψ to that component therefore has square one; in the trivial-component case it is already one. The remaining parity condition ψ(−1) = (−1)^{e} is part of the definition of X_{h}(ℓ, e).

The chosen prime satisfies p_{K} ≡3 (mod 4) and p_{K} ≥7. The integral basis 1, (1 +^{√}−p_{K})/2 gives disc K = −p_{K}; in particular K is imaginary quadratic. The exclusions above prove ℓ ∤ | disc K|h_{K} and gcd(N, | disc K|) = 1.

It remains to check the quadratic independence condition. At p_{K}, the local polynomial X^{2}+ p_{K} is Eisenstein, so K/ℚ is ramified there. Hence inertia at p_{K} has an element acting nontrivially on K. That inertia acts trivially on the mod-ℓ cyclotomic character and on ψ^{(ℓ)}: the first factors through ℚ(µ_{ℓ}), the second through ℚ(µ_{N}), and both extensions are unramified at p_{K}. For completeness, the prime-to-p_{K} roots of unity are unramified because X^{M} −1 and its derivative MX^{M−1} have no common root modulo p_{K} when p_{K} ∤ M; the associated finite etale extensions of the local integer ring are unramified. Thus this inertia element belongs to the intersection of the two kernels and does not belong to G_{K}. The required noncontainment follows. All admissibility clauses have now been checked.

[Lean: gdOfHost, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/GdOfHost.lean, 37–94. The exclusions are bchiFacts, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/BchiFacts.lean, 7–116; the prime-to-order and quadratic component assertions are cases, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/Cases.lean, 8–42.]

Proposition 4.6 (The uniform case-I bound). Input 4.2 implies the source’s CountI. More explicitly, for each fixed primitive character χ, there are an exponent C and two primes r_{1}, r_{2}, depending only on χ, such that, for every permitted host h with underlying character χ, r_{i} < h.q_{1}, h.d, every t with h.Big(t), and 0 < e < t, one has ∑

Selectable PDF notation • transcription unchecked
∑

log ℓ v_{ℓ}(e, ψ) ≤(Nt)^{C} (79)

Selectable PDF notation • transcription unchecked
ℓ∈L ψ∈X_{h}(ℓ,e)

for every finite set L of odd primes in case I. Every length on the left is finite. Here N = h.N and X_{h}(ℓ, e) is the host’s character set with parity ψ(−1) = (−1)^{e}.

Proof. Let p_{K} be the prime fixed by χ, and put K = ℚ(^{√}−p_{K}). The source chooses p_{K} ≡ 3 (mod 4), p_{K} ≥7, prime to the conductor m of χ; hence disc K = −p_{K}. Take c_{5}, A from the integer input for this fixed field. Choose distinct primes

Selectable PDF notation • transcription unchecked
r_{1} ≥30mp_{K} + 1, r_{2} ≥r_{1} + 1.

The choice of primes above any prescribed bound follows from Euclid’s argument: a prime divisor of one plus the product of all smaller primes is absent from that finite list. Choose k so that

2c_{5}(log r_{1} + log r_{2}) ≤16^{k}, C = k + 1 + A.

This choice depends on χ alone.

The host modulus satisfies 16 | N and its prime divisors are exactly 2, the prime divisors of m, h.q_{1} and h.d. If a prime r ≥30mp_{K} + 1 smaller than both h.q_{1}, h.d divided 30Np_{K}, it would divide 30, m or p_{K}, or equal one of those two larger primes. Each possibility contradicts the displayed size or strict inequalities. Thus r_{1}, r_{2} are prime to 30Np_{K}, as required by Lemma 4.3.

Let T be the finite set of kernels of all characters in X_{h}(ℓ, e) for ℓ∈L. For each H ∈T restrict L to the primes whose host set contains a character with kernel H. Lemma 4.5 makes that character admissible for the fixed K. Apply Lemma 4.3 to this restricted set. It gives finite lengths for the whole kernel orbit, and hence for every character of the original host sets. Partition each host character set by its kernel. Its part for H is contained in 𝒪_{ℓ}(H); enlarging the inner sum is allowed because v_{ℓ} ≥0. Interchanging the resulting finite sums yields

Selectable PDF notation • transcription unchecked
∑ ∑ ( )A∑

log ℓ v_{ℓ}(e, ψ) ≤2c_{5}(log r_{1} + log r_{2}) N(e + 1) φ([G_{N} : H])

Selectable PDF notation • transcription unchecked
ℓ∈L ψ∈X_{h}(ℓ,e) H∈T
( )A

≤2c_{5}(log r_{1} + log r_{2})N N(e + 1) .

The second inequality is Lemma 4.4, followed by |G_{N}| = φ(N) ≤N.

Finally, N ≥16 and e + 1 ≤t, so

Selectable PDF notation • transcription unchecked
( )A

2c_{5}(log r_{1} + log r_{2})N N(e + 1) ≤N^{k}N(Nt)^{A} ≤(Nt)^{k+1+A}.

This is (79), with the declared uniform exponent.

[Lean: U3.countI, Development/AutomorphicArithmetic/AutomorphicVarieties/UnitaryThreeGroups/CountI.lean, 11–150; the modulus facts are hostIndex, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/HostIndex.lean, 67–141. The case-I admissibility conversion is gdOfHost, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/GdOfHost.lean, 37–94.]

Input 4.2 is discharged unconditionally from the shared patching package h_{H} : HypothesesH' (Theo-rem 4.50) in Subsection 4.12 (Theorem 4.62), upgrading Proposition 4.6 to an unconditional proof of CountI via count_i_of_printed_bound_k_kato_automorphy.