CM curves, the invariant derivation and divisibility
To read this chapter you need CM elliptic curves and their lattices, the Chowla-Selberg formula, and formal group laws with their invariant derivation.
The chapter CM curves, the invariant derivation and divisibility compares four steps of the timeline with the code. The code has a CM elliptic curve, a formula for the -th power of an invariant derivation, -adic bounds on derivatives of Eisenstein sums over periods, a norm bound from the Chowla-Selberg formula, and a gcd of depths. The pieces sit in different branches.
Read first
- Integers and congruences: the greatest common divisor and Bezout, for Step 8.
- Polynomials and power series. Step 2 computes with formal power series.
- Ideals and the class group. Step 6 averages over the ideal class group.
- The splitting of primes: the timeline wants inert, but in the code has ramification.
- Zeta functions of number fields covers the partial zeta function, the class number formula and the Kronecker limit formula.
- Tate's thesis and Hecke L-functions. The number of Step 7 comes from a Hecke L-value.
- Lattices and the Weierstrass function: , , the discriminant and the Eisenstein sum of Step 4.
- Reduction and minimal models and quadratic twists. Step 1 twists a curve to reach the minimal discriminant .
- Complex multiplication gives and Shimura reciprocity.
- The Chowla-Selberg formula is Step 6.
- Gross's curves are the curves of Step 1.
- The invariant derivation and the logarithm, for and a quasi-logarithm.
- Prismatic Dieudonné theory, the deepest: Step 3 uses the formula for a p-divisible group and modules over .
The new objects
- CMCurveGoodOutsidePrimeSt says: for each prime with there is an elliptic curve over with complex multiplication by the integers of , good reduction outside and minimal discriminant . It enters through published_results_eigen.
- For a lift of a formal group law, is the invariant derivation in the direction . The formula of Step 2: the constant term of is modulo , with read from the terms of a quasi-logarithm.
- JetInt says that derivatives at of an Eisenstein lattice sum for a CM field and a CM type, divided by powers of periods, have bounded -adic size.
- LatIntRam and LatIntUnr bound from below, where for a value of a lattice sum. ToricDenominator adds bounds on denominators of partial zeta values.
- BetaArch bounds the log of the norm of , read off its minimal polynomial.
- DepthOK says that a product of local test functions vanishes unless and lie in given lattices, and has period . Periods and give the period .
The path through the chapter
- Gross's curve gives the field data of the host field (Step 1).
- The formula makes a dual Frobenius nilpotent, inside the proof of a prismatic Dieudonné statement (Steps 2 and 3).
- JetInt, proved from the functional equation of partial zeta functions, gives the bounds on (Steps 4 and 5).
- Shimura reciprocity gives the conjugates of , and Chowla-Selberg averages their sizes to bound the norm (Steps 6 and 7).
- Bezout gives the gcd of depths, so the least depth divides each valid depth (Step 8). Both bounds feed the unitary hypotheses.
The source of this page. Markdown. Something is wrong? Report it.