Documentation

LeanPool.MarkoffModP.BGS.HasseWeil.FinitePlaceNormalizationTransport

Transporting normalization ideals to finite places #

The project's finite places are height-one prime ideals in RatFuncFiniteIntegralClosure S T. Constant-extension arguments naturally produce another normalization model together with an equivalence over S[X]. This file transports height-one ideals, residue fields, residue degrees, and contractions across such an equivalence.

There is one typeclass subtlety. A canonical embedding RatFunc S → T induces an S[X]-algebra structure on T, while a geometric construction may already carry a propositionally equal polynomial algebra structure. The algebra-map bridge below turns a pointwise compatibility theorem into an equivalence with RatFuncFiniteIntegralClosure S T; it does not assume the two structures are definitionally equal.

Residue fields at corresponding height-one ideals are equivalent over the common coefficient ring.

Equations
Instances For

    Corresponding residue fields have the same degree over the common coefficient field.

    @[simp]

    Transport by an equivalence over the base ring preserves the prime ideal below a height-one ideal.

    The same contraction result when the equivalence is over a smaller coefficient ring and compatibility with the base algebra maps is supplied separately.

    @[reducible]
    noncomputable def BGS.HasseWeil.ratFuncInducedPolynomialAlgebra (S : Type u_5) (T : Type u_6) [Field S] [Field T] [Algebra (RatFunc S) T] :

    The polynomial algebra structure on T induced by its RatFunc S-algebra structure.

    Equations
    Instances For

      Pointwise compatibility of polynomial algebra maps identifies a chosen S[X]-algebra structure with the structure induced from RatFunc S.

      Equality of the ambient polynomial algebra structures identifies their integral closures, one of which is the project's rational-function model.

      Equations
      Instances For

        A polynomial restriction formula for RatFunc S → T gives the normalization equivalence needed by the finite-place model.

        Equations
        Instances For

          Compose a geometric normalization equivalence with the polynomial algebra bridge, landing in RatFuncFiniteIntegralClosure S T.

          Equations
          Instances For
            @[instance_reducible]
            noncomputable def BGS.HasseWeil.finitePlacePolynomialTopAlgebra (S : Type u_5) (T : Type u_6) [Field S] [Field T] [Algebra (RatFunc S) T] :

            The algebra structure from S[X] to T used in the finite place normalization transport construction.

            Equations
            Instances For
              @[instance_reducible]
              noncomputable def BGS.HasseWeil.finitePlaceSourceConstantAlgebra (S : Type u_5) (A : Type u_7) [Field S] [CommRing A] [Algebra (Polynomial S) A] :

              The algebra structure from S to A used in the finite place normalization transport construction.

              Equations
              Instances For
                @[instance_reducible]

                The algebra structure from S to (RatFuncFiniteIntegralClosure S T) used in the finite place normalization transport construction.

                Equations
                Instances For