Skip to content

Section 9.3 · PDF pages 685–687

The pointwise estimate

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

9.3 The pointwise estimate

Lemma 9.7. Let V be finite-dimensional over K. Suppose that at each infinite place there is an additive map Φ_{v} from V to a complex inner-product space, linear for either the chosen embedding or its conjugate, such that N_{v}(x) = ‖Φ_{v}(x)‖. Suppose further that it takes every finite K-linearly independent family to a complex-linearly independent family. Then the norms N_{v} have a common K-basis Gram presentation, with an invertible complex frame matrix at each place.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/CnormMapConjMulVec.lean:32--108; GlobalTheory.HSApp.hasGram_of_inner.

Proof. Choose a K-basis b = (b_{i}). At a place put w_{i} = Φ_{v}(b_{i}). Its Gram matrix G = (⟨w_{i}, w_{j}⟩) is Hermitian, and

Selectable PDF notation • transcription unchecked
‖‖‖‖‖∑ ‖‖‖‖‖2
c^{T}Gc = c_{i}w_{i} .
i

For c ̸= 0 this is positive by independence of the w_{i}. Thus G is positive definite. Positive Hermitian factorization gives G = B^{∗}B with B invertible. In particular ‖Bc‖_{2} = ‖∑_{i}c_{i}w_{i}‖; equality follows by the displayed norm-square identity and nonnegativity of both norms. These are the source’s Gram matrix, positive-definiteness and frame-factorization steps. ∑

If Φ_{v} is linear for the chosen embedding, its value on x =∑_{i}c_{i}b_{i} is _{i}σ_{v}(c_{i})w_{i}. Take Y_{v} = B. In the conjugate-linear case this sum has coefficients σ_{v}(c_{i}) instead. Entrywise conjugation preserves Euclidean norm, so ‖Bu‖_{2} = ‖Bu‖_{2}; take Y_{v} = B in that case. Both choices are invertible. Set X_{v} = Y_{v}^{−1}. Then in both cases

Selectable PDF notation • transcription unchecked
N_{v}(x) = ‖X_{v}^{−1}(σ_{v}(c_{i}))_{i}‖_{2},

which is exactly the required Gram presentation. Choosing these finite matrices separately at the places supplies the family of frames; no uniform estimate on their determinants is being claimed.

For the row norms the maps Φ_{v} in this lemma are the semilinear maps into the Hilbert spaces appearing in the real realization. The primitive-row uniformity field states the finite-family independence condition just used. An embedding representing a fixed infinite place is the chosen one or its conjugate, which is why both cases in the lemma are necessary. This is the actual proof of GlobalTheory.CovTop.GramPt.hasGram_at_alt, ThirdPlaceSeries/HasGramAt.lean:19--22, with the full path under the theta-pair-lift directory.

The nonzero good-lattice clause has a separate short proof. Its coordinates form a full lattice in K^{d} with d = D > 0. If the good lattice were zero, injectivity of the basis-coordinate map would make this coordinate lattice zero as well. Its K-span could then not be all of K^{d}, since the first coordinate vector is nonzero. This contradicts its full-lattice clause. This proves the source’s ne_bot_of_isLattice_coords at Development/AbelianVarietyTheory/Proofs/DivisorProofs/RowGoodLatticeNeBot.lean:12--27.

For a source point p and row i use the following notation, with no change of normalization:

lcv(X_{W} , M) E = unitE(p), T = mainT(p, i), V = .

Selectable PDF notation • transcription unchecked
D

Let L be the type lattice, L_{g} its good part, and M the ambient lattice. The exact definitions are in Development/AbelianVarietyTheory/Definitions/Divisors/CovolXOfCovol.lean:22--111. Write µ = µ(L), µ_{g} = µ(L_{g}) and µ_{c} for the source’s core slope. We make the eight hypotheses used in the last numerical implication explicit:

(1) The norms have positive definite Gram presentations; M is finitely generated, L ⊆ M, and L_{g} ̸= 0.

The source’s GramAt also carries its specified compatibility certificate for the realized weight space.

(2) V ≤−µ_{g} (the recursion inequality).

(3) There is an idempotent e with the Pythagorean identity of Lemma 9.2, L_{g} = L ∩ im e, L_{b} = L ∩ ker e,

and an integer g ≥1 with ge(L) ⊆L and 2 log g ≤b_{0}.

(4) rk L_{b} ≤3δ rk L, where δ = exp(−x^{ε/7}).

(5) µ_{max}(M) ≤x^{A}b_{0}.

(6) 1 ≤ b_{0} ≤ E and |T| ≤ x^{B}b_{0}. The source’s SizeAt further bounds E and the specified quotient-

weight data; these additional clauses are required by its geometric suppliers but not by this last numerical implication.

(7) µ_{c} −C_{1}E ≤µ with C_{1} ≥0.

(8) −T −C_{2}E ≤µ_{c} with C_{2} ≥0.

These are consequences of the full source predicates; we have not replaced the suppliers by weaker predicates when stating their remaining proof obligations below.

Lemma 9.8. The recursion inequality in item(2) follows from the source’s point conditions and the Gram presentation. In the source coordinates its only norm scaling is s = n^{−}_{P}^{1/2}, where n_{P} is the positive number of the specified primitive components. In particular 0 < s ≤1.

Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/RecAtOfGramAt.lean:19--50; Development/AbelianVarietyTheory/Proofs/DivisorProofs/CovolumePerRankLeNegSlopeScaled.lean:58--136.

Proof. Let b_{1}, . . . , b_{d} be the source’s basis of the good subspace. It is linearly independent in the ambient space because its inclusion is injective. The good lattice lies in its span: membership gives precisely the two conditions defining that subspace. Pull the lattice back along ϕ(c) =∑^{d}_{j=1}c_{j}b_{j} and call the resulting coordinate lattice M. The primitive-row lattice condition is exactly that M is a full lattice in K^{d}. The primitive-row dimension identities give d = D > 0. Thus no zero-dimensional division is used.

The frame/Petersson norm identity gives, at every place,

Selectable PDF notation • transcription unchecked
‖c‖_{X} = s N_{v}(ϕ(c)), s = n^{−}_{P}^{1/2}.

Here n_{P} ≥1 since the finite component set is nonempty. Hence 0 < s ≤1. Replace every frame matrix X_{v} by X_{v}^{′} = sX_{v}. Since the frame norm uses the inverse matrix, its new norm is s^{−1}‖c‖_{X} and is exactly N_{v}(ϕ(c)). Its determinants remain nonzero because s > 0. The two real realizations of M and the good

lattice then have equal norms on every element. Polarization gives equal Gram matrices, hence equal ranks and covolumes; their normalized slopes agree.

In dimension d the scaling of all place norms by s scales the realized volume by s^{2nKd}. The definition lcv(X, M) = [2/[K : ℚ]] log h_{X}(M) therefore gives

lcv(X, M) lcv(X^{′}, M) = + 2 log s = −µ(L_{g}) + 2 log s ≤−µ(L_{g}).

Selectable PDF notation • transcription unchecked
d d

The middle equality is (335) at rank d and [K : ℚ] = 2n_{K}; the final inequality uses s ≤ 1. Substitute d = D and the source’s coordinate lattice to obtain V ≤−µ_{g}. This follows the source’s rescaled-frame and isometric-transport proof, with the dimension, full-lattice and sign conditions made explicit.

Proposition 9.9. Under these hypotheses, if x > 0 and

Selectable PDF notation • transcription unchecked
12δ(x^{A}+ x^{B}+ C_{1} + C_{2} + 1)≤1, (344)

then

Selectable PDF notation • transcription unchecked
V ≤T + (C_{1} + C_{2} + 1)E. (345)

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/CovolumeFromGramAndBounds.lean:39--85; GlobalTheory.CovTop.Assembly.lcv_le.

Proof. Set a = x^{A}> 0, b = x^{B}> 0 and Q = (a+b+C_{1} +C_{2} +1)E. We have E ≥b_{0} ≥1. Thus Q ≥E, µ_{max}(M) ≤ab_{0} ≤Q and 2 log g ≤b_{0} ≤Q. The last two core inequalities give µ ≥−T −(C_{1} + C_{2})E ≥ −(b + C_{1} + C_{2})E ≥−Q. The bracket in (344) is at least one, so 0 < δ ≤1/12. The type lattice is nonzero since it contains L_{g} ̸= 0. Apply Lemma 9.2, then Lemma 9.3, with ℓ= 2 log g and m = µ_{max}(M). All rank and sign hypotheses have just been checked. We obtain µ −12δQ ≤µ_{g}. Multiplying (344) by E ≥0 gives 12δQ ≤E. Hence

Selectable PDF notation • transcription unchecked
V ≤−µ_{g} ≤−µ + E ≤T + (C_{1} + C_{2} + 1)E,

as required.