Skip to content

Section 3.10 · PDF pages 27–28

What a tied family must supply

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

3.10 What a tied family must supply

At a fixed ϵ > 0, a family has an admissible set W, an index set I_{x} at each x, and for each index a host, its finite group H_{x,i}, and a distinguished node set T_{x,i}. The node labels are injective maps from these groups into a common set of integer labels. The family specifies a common node-label set 𝒯 (x), with

𝒯 (x) = {val(t) : t ∈T_{x,i}}.

A tie at x chooses an index i_{0}, writes H = H_{x,i0}, and supplies the entire quantitative package of Proposi-tion 3.12. Its translation set is the whole group H, with translation map the identity. At each u ∈H its finite nonempty word set and slope data may come from a separately chosen family index pt(u). The tie identifies all group, size, weight, inertia and Frobenius coordinates used in the quantitative package with those of these family members. The identifications include x_{datum} = x, ϵ_{datum} = ϵ, the bounds e_{Div} ≤ e_{D}, e_{Loss} ≤ e_{L}, datum c_{HH} ≤c_{HH}, and the fixed constants K, e_{K}. All the scalar, thin and cost hypotheses displayed above are required at every u ∈H. For the nodes it requires

t ∈T ⇐⇒ val(t) ∈𝒯 (x).

For the second set it requires T_{2} = {ja_{0} : j ∈D_{2}} for some finite set of integer digits D_{2}, where A_{0} = ⟨a_{0}⟩. These conditions are the mathematical content of the tie that is used here; the geometric construction of such ties is a separate existence assertion.

Proposition 3.13 (Transfer from a tie). The tie at x gives the quantitative package at the distinguished host i_{0}, with its actual node set T_{x,i0}, required in Proposition 3.12.

Proof. First T = T_{x,i0}. Indeed t ∈ T means that val(t) is the label of a member t^{′} ∈ T_{x,i0}. Injectivity gives t = t^{′}. Conversely any such member has its label in 𝒯 (x). Next the identity translation map has image all of H, so its image contains A_{0}. Every element of T_{2} is an integer multiple of a_{0}, hence lies in A_{0}. All slope-data hypotheses, identities of the arithmetic count and main term, node-size estimates, bounds for B_{0}, N_{c}, and comparisons of constants are already among the tie conditions. Their assertions for every u ∈H imply their assertions for u ∈A_{0}. The compatible logarithmic derivative is unchanged because the identified reciprocity homomorphism is the same homomorphism used to define I_{p}, F_{p}. This verifies every required component.

Corollary 3.14 (The family window estimate). Fix ℒ, e_{D}, e_{L}, ϵ > 0 and a family. Suppose there is one constant C_{E} and a threshold such that its hosts at every index satisfy (31) and (32), together with the other explicit-formula conditions, for all sufficiently large x. Suppose fixed K, c_{HH}, e_{K}, chosen before x, give ties at every sufficiently large x ∈W. Then for every sufficiently large x ∈W,

Selectable PDF notation • transcription unchecked
_{Gℒ(x) ≤x}1/2+(e_{D}+e_{L}+7)ϵ_{.}

Proof. Choose the uniform threshold from Proposition 3.12, and enlarge it to the explicit-formula and tie thresholds. At an admissible x beyond it, choose the tie’s distinguished index i_{0}. Proposition 3.13 gives the quantitative package there; the explicit-formula bounds hold at that same index because their hypothesis holds at every index. The uniform level estimate therefore applies.

Together with Proposition 3.4, this shows exactly what is required from the family construction: for each cyclic level, fixed e_{D}, e_{L} and ϵ_{1} > 0, then for every 0 < ϵ < ϵ_{1} a family with arbitrarily distant power windows and the two eventual properties in Corollary 3.14. In particular, the arithmetic estimate at

Definition 8.1 alone does not supply the ties or the explicit-formula host bounds.