Skip to content

Section 9.4 · PDF pages 687–691

The eventual, simultaneous statement

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

9.4 The eventual, simultaneous statement

Lemma 9.10. Let a lattice B ̸= 0 be spanned over K by a set of its own vectors whose norm at every infinite place is at most e^{Λ}, with Λ ≥ 0. Every nonzero orthogonal quotient lattice of B has normalized slope at least −2Λ. Thus its normalized minimum slope is at least −2Λ.

Source: Formalism/MeanHeightDescent/AverageDegreeBounds/SpanMuMin.lean:146--186; Formalism/HarderNarasimhan/StatementPl.lean, slope_characterization.

Proof. Project the specified vectors to any nonzero quotient by a saturated sublattice. Orthogonal projection cannot increase any place norm, and their images still span the quotient over K. Choose a basis u_{1}, . . . , u_{s} from these images. The free 𝒪_{K}-lattice they generate is contained with finite index in the quotient lattice Q. At each place the Hermitian Gram determinant of u is at most ∏_{i}‖u_{i}‖^{2} ≤e^{2sΛ} by Hadamard’s inequality. In the height normalization (335), the height of this free lattice is the product of these determinants: the dis-criminant and 2-power factors cancel those of the canonical integer-ring lattice. Therefore h(Q) ≤e^{2nKsΛ}, since passing to a containing lattice of the same rank decreases height by its positive integer index. Taking logs gives µ(Q) ≥−2Λ.

The minimum slope is the infimum of these nonzero quotient slopes, so the bound follows with its exact normalization. In the source this same minimum-slope characterization is packaged by a Harder– Narasimhan threshold sublattice: every bounded vector generates a line above the threshold; the threshold sublattice contains all those lines, has full rank because they span, and equals B because it is saturated. The normalized threshold is −2Λ. The quotient calculation above verifies explicitly the minimum-slope property consumed by the subsequent descent inequality.

Proposition 9.11. Let A ̸= 0 and B be finitely generated lattices with Gram norms. Suppose ϕ_{1}, . . . , ϕ_{n} are K-linear maps satisfying

Selectable PDF notation • transcription unchecked
ϕ∑_{j}(A) ⊆B, (∀j ϕ_{j}x = 0)=⇒x = 0,
N_{B,v}(ϕ_{j}x)^{2}≤e^{2P}N_{A,v}(x)^{2},
j
n rk B ≤(1 + η) rk A, η ≥0.

Suppose B has the bounded spanning set of Lemma 9.10, and t ≤µ(A) −2P. Then

Selectable PDF notation • transcription unchecked
t −η(|t| + 2Λ)≤µ(B). (346)

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/HtMapLeOfPoints.lean:69--143; Formalism/MeanHeightDescent/AverageDegreeBounds/DescentSlope.lean:128--178.

Proof. Put Φ(x) = (ϕ_{j}x)_{j} in the orthogonal power B^{n}. It is injective by the joint-kernel condition. Since A ̸= 0, some ϕ_{j} is nonzero on A; thus n > 0 and B ̸= 0. The power lattice has rank R = n rk B and slope µ(B): its Gram matrices are block diagonal, so its height is h(B)^{n}.

The norm hypothesis bounds the operator norm of Φ by e^{P} at every place. By Lemma 9.1, its image I has rank a = rk A > 0 and µ(I) ≥µ(A) −2P ≥t. Saturate I in B^{n} to obtain S. Its rank is still a, and its height is no larger, so µ(S) ≥µ(I). The minimum-slope bound of Lemma 9.10 also holds for B^{n}: use in one coordinate at a time the same bounded spanning vectors. The quotient Q = B^{n}/S therefore has slope at least −2Λ when its rank R −a is nonzero. If that rank is zero, its height is one and the same multiplied inequality reads 0 ≥0. Height multiplicativity for a saturated sublattice gives

Selectable PDF notation • transcription unchecked
Rµ(B) = aµ(S) + (R −a)µ(Q) ≥at −2Λ(R −a).

Here a ≤ R ≤ (1 + η)a by injectivity and the rank hypothesis. Set u = (R −a)/R, so 0 ≤ u ≤ η. After dividing the last display by R > 0 it becomes µ(B) ≥ t −u(t + 2Λ). If t + 2Λ < 0, this is at least t and implies (346) immediately. Otherwise u(t + 2Λ) ≤η(|t| + 2Λ), which proves that equation in the remaining case. This is the source’s map into the orthogonal power, minimum-slope estimate and final rank-loss calculation.

Lemma 9.12. Suppose 0 ≤b ≤E, b ≤K, |T| ≤K, C_{1} ≥0, and

Selectable PDF notation • transcription unchecked
(−T −C_{1}E −2b) −_{K}^{b}(| −T −C_{1}E −2b| + 2K)≤µ_{B},
µ_{B} −2b ≤µ_{c}.

Then −T −(2C_{1} + 9)E ≤µ_{c}. The fraction has the source’s zero-division value zero when K = 0.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/LowerBoundOfAllEstimates.lean:19--59.

Proof. If b = 0, the displayed inequalities immediately give µ_{c} ≥−T −C_{1}E, which suffices since E ≥0. Otherwise K ≥b > 0. Put u = b/K ∈[0, 1]. The triangle inequality gives

Selectable PDF notation • transcription unchecked
| −T −C_{1}E −2b| ≤|T| + C_{1}E + 2b.

Multiplying by u bounds the right side by b + C_{1}E + 2b = C_{1}E + 3b, because u|T| ≤uK = b and u ≤1. Also u(2K) = 2b. The first hypothesis consequently gives µ_{B} ≥−T −2C_{1}E −7b; the second gives µ_{c} ≥−T −2C_{1}E −9b ≥−T −(2C_{1} + 9)E. This includes K = 0, since then b = 0 already.

At a nonterminal row the source chooses a good deep cover Y . Its map condition supplies the ϕ_{j} of

Proposition 9.11 with P = b_{0}, Λ = K = PP κ and η = b_{0}/K. Its size clause gives 1 ≤b_{0} ≤E, b_{0} ≤K and |T| ≤K, so K > 0. Its rank comparison is exactly the rank hypothesis of that proposition. Its bounded generator condition supplies the required spanning set. Its flat and uniform lower bounds give

Selectable PDF notation • transcription unchecked
t = −T −(C_{F} + C_{U})E −2b_{0} ≤µ(A) −2b_{0},

where A is the negative-shift cusp lattice, nonzero by the positive-rank clause of deep goodness. Its ring comparison is µ(B) −2b_{0} ≤µ_{c}, where B is the deep type lattice. Apply Proposition 9.11 and Lemma 9.12 with C_{1} = C_{F} + C_{U}. This yields

Selectable PDF notation • transcription unchecked
−T −(2(C_{F} + C_{U}) + 9)E ≤µ_{c}.

For the terminal row use the separate low-defect bound with constant C_{D}. Taking the maximum of all ten eventual thresholds, and then the constant max{C_{D}, 2(C_{F} + C_{U}) + 9}, gives the full family lower-slope condition, with the same constant for every row. This proves the source’s low_of_cover_hypotheses implication; the existence and estimates of those deep covers are its substantive geometric premises.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/LowerBoundOfAllEstimates.lean:80--147; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LowOfCoverHypotheses.lean:19--42.

Lemma 9.13. Let K ⊆K^{′} be number fields, with K totally complex. Let N, N^{′} have Gram presentations on K- and K^{′}-vector spaces, respectively. Suppose N_{σ} = N_{σ} and a semilinear map ι takes every finite K-independent family to a K^{′}-independent family. For a nonzero finitely generated lattice L put L^{′} = 𝒪_{K}′ -span(ιL). If, for every σ^{′}: K^{′}↪→ℂ and x,

Selectable PDF notation • transcription unchecked
N_{σ}^{′}′(ιx) ≤e^{H}N_{σ}′_{|K}(x),

then µ(L) −2H ≤µ(L^{′}).

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/SlopeSqSubLeSlopeSqSpan.lean:14--79,84--154,178--340.

Proof. Choose a K-basis e_{1}, . . . , e_{r} of KL from elements of L, and put B =∑_{i}𝒪_{K}e_{i}. Then L/B is finite. Indeed finite generators of L have finitely many K-coordinates in this basis; clearing their denominators kills L/B by one nonzero integer, and a finitely generated module over the finite ring 𝒪_{K}/(m) is finite. Write I = |L/B| > 0 and d = [K^{′}: K].

Let B^{′} = ∑_{i}𝒪_{K}′ι(e_{i}). The source’s tensor-quotient comparison gives L^{′}/B^{′} ≃𝒪_{K}′ ⊗_{𝒪K} (L/B). Here is its injectivity check, which is important: the tensor map into the target is injective on the span of 1 ⊗e_{i} by independence of their images. If an arbitrary tensor is in its kernel, multiplication by the nonzero integer m puts it in that span, where it must vanish. Multiplication by m remains injective after tensoring

because 𝒪_{K}′ is flat over the Dedekind ring 𝒪_{K}. Hence the original tensor vanishes. This proves the asserted quotient identification, not merely a surjection onto that quotient.

The cardinality of this tensor quotient is I^{d}. To verify it, take a finite composition series of L/B. Flatness preserves the short exact sequences. Each simple quotient is 𝒪_{K}/𝔭; its tensor product is 𝒪_{K}′/𝔭𝒪_{K}′ and has cardinality |𝒪_{K}/𝔭|^{d}. The exponent is d because the finite projective 𝒪_{K}-module 𝒪_{K}′ has rank d; tensoring it with that residue field gives dimension d. Multiplying cardinalities along the series proves |L^{′}/B^{′}| = I^{d}, including ramified primes.

Let G_{v}, G^{′}_{w} be the Hermitian Gram matrices of e and ι(e) in the two norm systems. All are positive definite. The norm inequality extends from K-coefficient vectors to complex coefficient vectors at a fixed w. To see the needed density, choose a nonreal element in the image of K: rational combinations of it and 1 are dense in ℂ. Continuity then extends the inequality to every complex coefficient vector. Thus G_{w}^{′} ≤e^{2H}G_{w|K} as Hermitian forms. Conjugating by G^{−}_{w|}^{1/2}_{K} puts the eigenvalues in (0, e^{2H}], so

det G^{′}_{w}≤e^{2rH} det G_{w|K}.

For a basis selected from a lattice, its height and finite index give the exact slope identities

Selectable PDF notation • transcription unchecked
∑ ∑

n_{K}rµ(L) = log I − log det G_{v}, n_{K}′rµ(L^{′}) = d log I − log det G^{′}_{w}.

Selectable PDF notation • transcription unchecked
v w

These follow from the Gram volume of the free lattice B, followed by h(B) = Ih(L) and (335). Each complex embedding of K has d extensions to K^{′}. Pairing conjugates and using the stated conjugation invariance gives n_{K}′ = dn_{K} and ∑_{w} log det G_{w|K} = d ∑_{v} log det G_{v}. Insert the determinant bounds in the second slope identity. Its right side is at least dn_{K}rµ(L) −2rHn_{K}′. Division by n_{K}′r > 0 proves the assertion. These are the source’s finite-index tensor, dense-coefficient Gram and embedding-sum steps.

For the source’s core comparison, its rationality clause identifies the realized type lattice with the 𝒪_{K}′-span of the semilinear image of the original type lattice. The measure comparison has a positive scale c_{σ} at each embedding, with | log c_{σ}| ≤CE, and makes the realized norm c_{σ} times the original Petersson norm. Thus c_{σ} ≤e^{CE}. The semilinear realization preserves finite independent families, and the original norm is invariant under conjugating the embedding. The original type lattice is finitely generated as a sublattice of the integral cusp lattice. It is nonzero: otherwise its realized span would be zero and could not contain the nonzero good lattice. Lemma 9.13 therefore applies with H = CE, giving precisely µ_{c} −2CE ≤µ. Taking the maximum of the Gram, measure and rationality thresholds gives the family CoreBound' with constant 2C.

Source: Development/AbelianVarietyTheory/Proofs/DivisorProofs/CoveringLeFromMeasure.lean:23--85; Devel-opment/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/CoreLeOfGramMeasRat.lean:18--25.

Proposition 9.14. Fix an admissible source family. Suppose the full eight lift conditions hold, each with a constant and a threshold independent of its point and row, as quantified in LiftLambdaBound.lean:22--61. Then there exist C_{0} ≥0 and x_{0} such that, for every x ≥x_{0} above the family’s defining threshold, every family index, every point satisfying the source’s point conditions and RecTied, every row i, and every C ≥C_{0},

lcv(X_{W} , M) ≤ mainT(p, i) + C unitE(p). (347)

Selectable PDF notation • transcription unchecked
D

This is the family conclusion CovolumeBoundOfX. The constants may depend on the family, not on the subse-quently quantified x, index, point, row or C.

Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/CovolXOfSteps.lean:20--53.

Proof. Take the maximum of the eight thresholds and retain the constants A, B, C_{1}, C_{2} of their respective conditions. Put C_{0} = C_{1}+C_{2}+1. The exponent ε is positive. In the source this follows by choosing a family index at size zero, identifying the common exponent with that size record, and using its positive-exponent field. Thus c = ε/7 > 0.

For each real H, e^{−xc}x^{H} → 0 as x →∞: put y = x^{c} and use x^{H} = y^{H/c} and the elementary exponential domination of any fixed real power. Consequently 12e^{−xc}(x^{A}+x^{B}+C_{0}) →0. After increasing the common threshold this expression is at most one. The family’s identities for the local size and exponent identify them with x and ε at every one of its points. The defining family threshold is greater than one, so x > 0. Proposition 9.9 now applies simultaneously to all those points and rows. It proves (347) at C = C_{0}. Since E ≥ 0, increasing C only increases its right side, proving the assertion for every C ≥ C_{0} with the same x_{0}.

Finally the source applies this argument after each of the family operations quantified by its Closed pred-icate. Its conjunction operation uses exactly these finite maxima of thresholds and its implication operation applies the just-proved pointwise implication. Thus the closure quantifiers are preserved; they do not assert a single pair (C_{0}, x_{0}) uniform over unrelated families.

Remark 9.15 (Closure of all eight lift conditions in topCovolG_alt_alt). All eight lift conditions in SelfIntersectionVolumeEstimates.topCovolG_alt_alt (Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopCovolG.lean:39--59) are now proved in Section 16: the six non-deep-cover conditions (GramCondition, LiftRecursive, LiftTruncation, LiftLambdaBound, SizeCondition, and CoreBound') unconditionally (Propositions 16.17, 16.20, 16.22–16.24, Lemma 16.21, and Theorems 16.18 and 16.25), and the deep-cover conditions LiftBadSet and LiftLowBound in Subsection 16.2 (Theorems 16.31, 16.35, and 16.36) from the published geometric and Arakelov inputs documented in Sections 10–15 and Proposition 9.16.