Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Chapter 5 Breaking the Ceiling: Lattice Slopes, Bost’s Inequality, and Integral Gluing

Pay freight separately for each character, and inflation eats your margin at two-thirds; glue an integral structure across the whole family along nearly orthogonal axes, and the last one-sixth cliff collapses down to one-half.

At the end of Chapter 4 we hit an honest mathematical wall: push a single-character iterated theta-lift chain as hard as you want, and the budget stalls at .

If you follow analytic number theory, the number probably rings a familiar bell—time and again across prime gaps, zero-density theorems, and convex bounds, single-variable arguments stall around or . Here the reason is pure bookkeeping. Each theta lift buys you one extra layer of divisibility from formal degrees and lattice counts, but simultaneously raises the level, norm, and covolume cost of the space. Run the balance sheet for a single Hecke character, and gains minus costs top out right at .

To crack past down to , the proof makes two decisive moves: first measure every lift’s exact cost with lattice slopes, then glue an integral structure across a whole family of Hecke characters so their costs share the load along nearly orthogonal directions.

5.1 The Roof Over a Lattice: Harder–Narasimhan Slopes

Do not let terms like “Harder–Narasimhan filtration” and “Bost’s slope inequality” push you off balance. Underneath, they are a piece of elementary geometry about roofs and short vectors.

Picture an integer lattice inside a Euclidean space as a warehouse full of grid points:

  • its dimension is the rank ;
  • the volume of one fundamental box is its covolume : packed lattices have tiny covolumes, sparse lattices have huge ones.

To turn multiplication of volumes into addition, define the degree and slope of any nonzero sublattice by

Hold onto one crystal-clear picture: a sublattice with densely packed points has tiny covolume, large degree, and a steep positive slope . The supremum of slopes over all nonzero sublattices is the maximal slope .

Try a four-step example with real numbers! Take a rank- lattice containing a nested chain of saturated sublattices at coordinates:

  • : segment slope (one tight short vector!);
  • : segment slope ;
  • : segment slope ;
  • : segment slope .

Plot those five points in order and look at the polygon: the slopes step strictly downward, forming an arched concave roof! Even though the whole lattice has average slope , its steepest first rafter pushes —and that steep slope forces a short nonzero lattice vector to exist!

Left: single-character stalling at vs. glued-family descent to (MODEL); Right: exact Harder–Narasimhan concave slope polygon. On the left, the magenta curve shows naive single-character lifting flattening against the ceiling, while the cyan glued curve breaks through toward the green line. On the right, exact computed points trace the concave roof, with the steepest first segment highlighted in amber against the dashed average slope .

All four pillars of this lattice-slope geometry are proved from scratch inside ExistsSaturatedSlopeEqMuMax.lean:

Theorem 5.1 (Boundedness of slopes and upper bound by )LEAN ✓

For any discrete submodule (lattice) in a finite-dimensional real inner product space , the set of slopes is bounded above, and every nonzero sublattice satisfies

Proof

Using the Gram-determinant projection bound gramDetLe, every nonzero sublattice has covolume bounded uniformly away from zero by the minimal norm in , bounding from above; the supremum inequality follows directly. The full proof is checked by the Lean kernel.

Theorem 5.2 (Minkowski short-vector theorem)LEAN ✓

For every nonzero discrete lattice in a finite-dimensional real inner product space, there exists a nonzero vector satisfying

Proof

Identifies covol(L) with Mathlib’s measure-theoretic ZLattice.covolume (covolEqCovolume) and applies Minkowski’s convex-body theorem on a cube scaled to radius , converting norm to Euclidean norm via the factor . The full proof is checked by the Lean kernel.

Theorem 5.3 (Additivity of rank and degree for saturated sublattices)LEAN ✓

Let be a discrete lattice and a saturated sublattice (), with orthogonal quotient lattice projected onto . Then is discrete, and

Proof

Extending a -basis of the saturated sublattice to a -basis of puts the Gram matrix in block-triangular orthogonal form, giving ; taking negative logarithms yields degree additivity. The full proof is checked by the Lean kernel.

Theorem 5.4 (Minimal nonzero vector bounds the maximal slope)LEAN ✓

Let be a nonzero discrete lattice. If every nonzero vector satisfies , then

Proof

Apply Theorem 5.2 to any nonzero sublattice to obtain ; taking logarithms and the supremum over with yields the bound. The full proof is checked by the Lean kernel.

See the two-way duality between slopes and vectors? Bost’s slope inequality (SlopeInequality in LatticeSlopes/Statement.lean) applies the exact same roof picture across any injective integer-linear map with operator norm bound :

If your integral structure has no hidden ultra-steep sublattice spikes, the arithmetic height along the entire lift chain stays strictly under control!

Interactive Harder–Narasimhan concave roof: Upper concave hull through comparing the steepest first rafter (amber) against the dashed mean slope . In the full lab, dragging below snaps the first roof chord cleanly to .

5.2 Vaulting : Gluing an Integral Structure Across Hecke Characters

Now return to the crucial question: if one Hecke character alone stalls at , what cost does “gluing across Hecke characters” save?

Think of shipping groceries from stalls at a market. If each stall forces you to rent a separate shipping crate, freight costs scale by and choke your budget right at . But if you find a common integral gcd lattice holding all deliveries inside a single compact matrix—and check that the columns corresponding to different characters are almost orthogonal—then there is no collinear collapse, the Gram determinant stays cleanly near the product of column lengths, and the shared structure spreads the cost across the entire family!

In the architecture of the proof (Steps 15–16 of the author’s summary), that gluing works as a two-punch combination:

  1. Assemble a shared integral structure across Hecke characters (an extra averaging / “gcd” over characters), backed by a relative trace formula via automorphy on a sixfold cover of and Cauchy–Schwarz against the norm of a projected Poincaré series.
  2. Prove approximate orthogonality of the columns of that glued integral matrix. With no collapsed directions, the maximal slope stays tame, driving the threshold abscissa cleanly past all the way down into !

One thin stick snaps two-thirds of the way across the river; weave nearly orthogonal vectors into a single integral lattice, and the bridge holds all the way to one-half.

Yet two final pockets of resistance still lurk along the road to every Dirichlet character: accidental arithmetic-progression resonances inside the Iwasawa tower levels, and stubborn Galois cohomology classes that refuse to vanish by twisting alone.

In the next chapter, we bring in Behrend’s high-dimensional integer sphere shell and a strong weakening of Vandiver’s conjecture to close the net once and for all.

The full theta-chain and lattice-slope lab: Switch between the mirror-chain budget and the interactive Harder–Narasimhan roof, adjust depth ratio , character gluing, and first-rafter degree , and verify how orthogonal gluing pulls the threshold below .