Skip to content

Section 9.6 · PDF pages 692–694

Finite generation and fullness of the integral lattice

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

9.6 Finite generation and fullness of the integral lattice

Lemma 9.17 (Integral functionals force finite generation). Let K be a number field, let V be a finite-dimensional K-vector space, and let L ⊆ V be an 𝒪_{K}-submodule. Suppose that for every x ̸= 0 in V there are a number field K_{x} extending K and a K-linear map ϕ_{x} : V →K_{x} such that

Selectable PDF notation • transcription unchecked
ϕ_{x}(x) ̸= 0, ϕ_{x}(L) ⊆𝒪_{Kx}. (C.20)

Then L is finitely generated over 𝒪_{K}. The detecting field and functional may depend on x.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/FgIntOfForallIsIntegral.lean:7--51.

Proof. We prove by induction on dim_{K} W that L ∩W is a finitely generated abelian group for every K-subspace W ⊆V . The assertion is immediate for W = 0. Otherwise choose 0 ̸= x ∈W and a functional from (C.20). The kernel of its restriction to W is proper, because it does not contain x, so its dimension is smaller. The image of L ∩W is an additive subgroup of 𝒪_{Kx}. This ring is a finitely generated free abelian group, hence is noetherian as a ℤ-module; its subgroup is finitely generated. Its kernel is L ∩(W ∩ ker ϕ_{x}), which is finitely generated by induction. Lift a finite set of image generators and add a finite set of kernel generators. Every element of L ∩W subtracts an integer combination of the former to leave an element of the kernel, so this combined finite set generates it over ℤ. Taking W = V gives finite abelian generators of L. Their 𝒪_{K}-span is contained in L, and contains their ℤ-span L, so they also generate L over 𝒪_{K}. This is exactly the source’s dimension induction; no common field for all the functionals is assumed.

Lemma 9.18 (Clearing valuations from a positive power). Let R be a K-algebra. For each finite prime 𝔭 of K, let 𝒱_{𝔭} be a family of additive valuations on R extending v_{𝔭} on nonzero scalars, taking values in ℝ ∪{+∞}. Let S ⊆R have the property that for every g ∈S there is a_{g} ∈K^{×} with v(a_{g}g) ≥0 for all these valuations. If f^{k+1} ∈ span_{K} S for some integer k ≥0, then some a ∈K^{×} satisfies v(af) ≥0 for every one of the valuations.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/ExistsSmulNonnegOfPow.lean:28--59.

Proof. The set M of elements with all valuations nonnegative is an 𝒪_{K}-submodule. Each g ∈S belongs to its K-span, because g = a^{−}_{g}^{1}(a_{g}g). Thus f^{k+1} belongs to that span. Express it as a finite linear combination of members of M and clear the scalar denominators by a single nonzero t ∈𝒪_{K}. Then tf^{k+1} ∈M. Fix one valuation. If v(f) = +∞, then also v(tf) = +∞. Otherwise put b = v(f) ∈ℝ and c = v_{𝔭}(t) ≥0. We know c+(k +1)b ≥0. If b ≥0 then c+b ≥0; if b < 0 then c+b ≥c+(k +1)b ≥0. Hence v(tf) ≥0 in both cases, for the same scalar t at every prime and every valuation. Taking a = t proves the assertion.

Lemma 9.19 (A frame with uniform integral evaluations). Let K^{′} be a number field, let G_{0} be a nonzero homogeneous polynomial in finitely many entries of block matrices, and let its block sizes be fixed. Suppose that, for every integral section F of the fixed weight, its frame polynomial G_{F} has that same total degree and each coefficient [X^{µ}]G_{F} belongs to a specified fractional ideal J_{µ} of K^{′}. Then there are invertible block matrices Y_{b} over K^{′} and one N ∈K^{′×} such that

NG_{0}(Y ) ̸= 0, NG_{F} (Y ) ∈𝒪_{K}′ for every such F. (C.21)

When the frame-polynomial evaluation law identifies G_{F} (Y ) with F at the changed frame, this is a single detecting functional integral on the whole integral section lattice.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/ExistsDetNeZeroEvalFrNeZero.lean:13--44,72--125.

Proof. The polynomial ∆= ∏_{b} det(X_{b}) is nonzero, since its value at all identity matrices is 1. Thus ∆G_{0} ̸= 0. A nonzero polynomial over the infinite field K^{′} cannot vanish at every tuple: induct on its number of variables, and in the last variable avoid the finitely many roots of the resulting nonzero one-variable polynomial. Choose a tuple where ∆G_{0} is nonzero and organize it into matrices Y_{b}. Every determinant and G_{0}(Y ) is nonzero.

For each monomial µ of the fixed degree, the fractional ideal J_{µ}Y^{µ} has a nonzero integral denominator N_{µ} ∈𝒪_{K}′. There are finitely many monomials of degree at most that fixed degree, so N = ∏_{µ}N_{µ} is nonzero. For any allowed G_{F} , each term N[X^{µ}]G_{F} Y^{µ} is an algebraic integer: its factor with N_{µ} is integral by construction, and all the other N_{ν} are integral. Their finite sum NG_{F} (Y ) is integral. Nonvanishing fol-lows from N ̸= 0 and G_{0}(Y ) ̸= 0. The source changes the frame by Y_{b}^{t}, because its polynomial coordinates list a column before its row. Its frame-change evaluation law then gives exactly G_{F} (Y ), with no unrecorded transpose.

We spell out what these lemmas accomplish in the native lattice. For a fixed admissible positive weight w at row j, the ambient space V is the cusp-form space cuspW. The lattice is its intersection with all the nonnegative valuation conditions. The source’s uniformization first proves dim_{K} V < ∞. For a nonzero F ∈V it next constructs a good CM point where its frame polynomial is nonzero. At that point the integral local frame comparison puts every coefficient of every integral section into the fixed fractional ideal

J_{µ} = lineNN(T^{∨}, ℓ, µ, w.n).I. (C.22)

Lemma 9.19 then supplies a frame y and N such that F →→ N ev_{y}(F) is a K-linear functional into the CM field, nonzero on the selected F and integral on the entire lattice. Linearity follows from additivity and scalar compatibility of evaluation. Lemma 9.17 proves finite generation, even though the CM point, field and frame can vary with the detected form.

The other half of FullAt is fullness. The actual source takes

Selectable PDF notation • transcription unchecked
m = 4([E : ℚ]r) + 4 > 0

and proves that F^{m} lies in the span of its constructed bounded short sections. The product law for cusp forms verifies that this power is still a cusp section, of the correspondingly multiplied weight. Each short section has a scalar multiple with all valuations nonnegative; the construction uses the squarefree level g_{0}g_{1}, with distinct prime g_{0}, g_{1}, rather than assuming squarefreeness for an arbitrary level. Lemma 9.18 gives aF in the integral lattice for some a ̸= 0. Thus F = a^{−1}(aF) belongs to its K-span, proving fullness.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/ExistsSmulNonnegOfPow.lean:135--176.

Finally the realized row lattice is the 𝒪_{K}′-span of the image of this cusp lattice under the specified semilinear realization ι. If x_{1}, . . . , x_{h} generate the latter over 𝒪_{K}, then ι(x_{1}), . . . , ι(x_{h}) generate the former: semilinearity sends each coefficient to its integral image in 𝒪_{K}′. The row weight is positive because 3m < t in the rank data and its weight numerator is the indicated positive multiple of that rank. Consequently the preceding positive-weight argument applies at each row, and proves the actual latAll_fg_at_alt implication once its geometric realization hypotheses hold.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/RowLatticeFinitelyGenerated.lean:18--46; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LatAllFgAt.lean:15--30.

Both halves of FullAt are now proved unconditionally: finite generation (latW.FG and row_lattice_fg_of_conditions) in Lemma 16.21(b)–(c), combining Propositions 9.23, 9.47, 9.43, Corollary 9.44, Proposi-tion 9.90, and Lemmas 9.17 and 9.19, and fullness (FullLat.span_eq_top, used inside GoodWAt in Propo-sition 16.22(d)) in Corollary 15.81(c), combining Theorem 15.48, Theorem 15.55, Corollary 15.65, Theo-rem 15.72, and Theorems 15.76–15.79.