Section 6.4 · PDF pages 315–317
Period rationality and the remaining division bounds
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
6.4 Period rationality and the remaining division bounds
The remainder argument uses the same selected realization as the arithmetic comparison. Its rationality statements cannot be obtained by replacing that realization by an unrelated one with the same ranks. We spell out the two linear arguments used to transport its columns.
Lemma 6.86 (Descent through the canonical period section). Let K ↪→ ℂ be a number-field embedding σ, let W be a finite-dimensional K-space, and let j : W →W_{ℂ} be its scalar-extension map. Let V_{0} be a finite-dimensional complex Hermitian space, ι : V_{0} →W_{ℂ} a surjection and U = ker ι. Write sec : W_{ℂ} → U^{⊥}⊂V_{0} for the inverse of ι|_{U}⊥. Suppose e : K^{d}≃W, p : K^{n}→K^{d} is surjective, the vectors a(F) ∈V_{0}, F ∈K^{n}, span V_{0} over ℂ, and
Selectable PDF notation • transcription unchecked
ι(a(F)) = j(e(pF)).
If a complex linear period functional L : V_{0} →ℂ and a K-linear functional β : K^{d}→K satisfy
Selectable PDF notation • transcription unchecked
L(a(F)) = σ(β(pF)) (F ∈K^{n}),then
L(sec(j(e(y)))) = σ(β(y)) (y ∈K^{d}).
In particular the transported period pairing takes its values in the specified embedded field σ(K).
Proof. Define a complex linear functional Λ on W_{ℂ} by extending the K-linear functional βe^{−1} in a K-basis of W. Thus Λ(j(e(y))) = σ(β(y)). The two complex linear functionals L and Λι agree on all a(F) by the displayed identities, and hence agree on their complex span V_{0}.
For the concrete section calculation, choose F with pF = y and put a(F) = u + q by orthogonal projection to U ⊕U^{⊥}. Then ι(u) = 0 and ι(q) = j(e(y)), so q = sec(j(e(y))). Evaluating L = Λι at q gives the claimed value. This also shows why it is necessary to identify the kernel and the canonical section: the calculation is unaffected by the component u precisely because the descended functional vanishes on that kernel.
Here is the image computation used to verify the span premise. If p and c are commuting idempotents on a finite-dimensional K-space, the operator induced by c on im p has image im(pc). One inclusion follows from p(cv) = cv for pv = v, and the other from pcw = c(pw). It fixes im(pc) pointwise. Choosing bases for these two images and extending scalars shows that the corresponding complex operator has image the complex span of the rational good-image basis. This proves the image and span assertions for the level and good idempotents in the selected column realization. The other premise in the lemma is the actual period factorization: in the source its scalar factor at the base level is 1, so the period on these generators equals the embedded algebraic column pairing β(pF). Applying the lemma to every row parameter and period functional, and transporting by the selected rational identifications of the row and column spaces, proves rationality of their pairing. This use requires that period factorization for the same chosen realization.
Lemma 6.87 (The full lattice obtained from the selected local lattices). Let K be a number field and W a finite-dimensional K-space. Fix a full O_{K}-lattice L_{0}. At each finite prime v let L_{v} be a full O_{K,v}-lattice in W, with L_{v} = (L_{0})_{v} except at finitely many primes. Then
L = {w ∈W : w ∈L_{v} for every v}
is finite over O_{K} and spans W over K. An invertible K-linear map carries it to a finite full lattice.
Proof. For each exceptional prime choose a sufficiently large denominator which bounds L_{v} on both sides by scalar multiples of (L_{0})_{v}. Choose one nonzero integer a whose valuations at these finitely many primes exceed all those requirements. At every other prime the same two inclusions hold automatically. Thus
Selectable PDF notation • transcription unchecked
aL_{0} ⊂L ⊂a^{−1}L_{0}.For the upper inclusion, use that an element of K integral at every finite prime belongs to O_{K}, in coordinates of a fractional-ideal decomposition of L_{0}. Equivalently this is the characterization of a fractional ideal by its prime valuations. The module on the right is finite and O_{K} is Noetherian, so its submodule L is finite. The module on the left spans W, since a ̸= 0, giving fullness. The image of a finite generating set generates the transported lattice, and invertibility transports its K-span onto W.
In the column construction each local lattice is the image of the prescribed algebraic lattice under an invertible matrix ι_{v}. Their types equal the base type except on the finite twisting support. The lemma therefore applies to the glued row lattice. The selected linear isomorphism to the remainder space sends that lattice to the source’s remainder lattice, so the latter is finite and spans the entire remainder space. No dimension comparison alone would prove this lattice assertion.
Lemma 6.88 (Transport and absorption of the sharp functional bound). Fix one selected primitive realization. Suppose its remainder lattice is identified isometrically with the abstract remainder lattice, and its positive period weights κ agree under the specified embedding bijection. Write λ_{0} = log |G|. If its passage inequality is
µ_{max}(R) ≤x^{C}b − mean(log κ) + 14λ_{0},
then the same realization satisfies
µ_{max}(R) + mean(log κ) ≤x^{max(C,1)+1}b
provided x ≥ 56, b ≥ 1 and λ_{0} ≤ 4b. These assertions are uniform in all selected indices once their displayed premises hold uniformly.
Proof. The isometry identifies every rational subspace with its image, preserves its integral lattice and metric, and hence preserves its degree and slope. Taking the supremum of the slopes gives the same maximal slope on both sides. The identified weights give equal sums of their logarithms; the embedding bijection gives the same normalizing cardinality, so the means agree too. Transport the passage inequality by these two equalities and add the common mean to obtain
µ_{max}(R) + mean(log κ) ≤x^{C}b + 56b.
Put d = max(C, 1). Since x ≥ 56 > 1, we have x^{C} ≤ x^{d} and x^{d}(x −1) ≥ x(x −1) ≥ 56. Thus x^{C}+ 56 ≤x^{d+1}, and multiplication by b ≥0 proves the assertion.
For a family take the maximum of the finitely many thresholds for the row bounds, primitive realization, dimension-size estimate, passage construction, the original family domain and the number 56. This threshold is chosen for the family before its index is chosen. Every input then refers to the same selected realization at that index; the displayed calculation introduces no further choice of realization.
The final remainder assertion has four components: a frame-number bound, eventual rationality of the period pairing, eventual fullness of the remainder lattice, and eventual nonnegativity of ℒ_{a} = log(a rd(E)). The last follows from a ≥ 1 and rd(E) ≥ 1. The two middle components follow from the preceding descent and lattice lemmas once the selected primitive period factorization and local lattice identifications are supplied. The sharp functional lemma transports the passage inequality needed for the first component, preserving that same witness.
The frame-number conclusion additionally uses the local-level rank and commensurability assertions, the slope comparison, the two-plane complement condition and the gauge-form bound, all for this family. They must be combined with the just-proved sharp functional estimate and the base-level maximal-slope bound. This is a separate quantitative implication; the period rationality proof does not establish it. The precise missing input is the source’s passage inequality and its slope-to-frame-number implication for the selected primitive realization, together with the existence of that realization. Intersections of their eventual thresholds preserve the simultaneous choice; independent existence assertions would not suffice.