LeanBridge Blueprint

4.8. Belyi maps🔗

This section lists the LMFDB definitions in the category belyi. Each definition links back to its LMFDB knowl. It also lists the knowl about the LMFDB's data on this subject that has mathematical content, from the category rcs.

Definition4.8.1
uses 1used by 0XL∃∀N

abc triple for Belyi maps. (LMFDB)

The (a,b,c) triple for a Belyi map is obtained by taking the orders of the elements in the corresponding transitive permutation triple.

Depends on: Definition 4.8.13

Definition4.8.2
uses 1used by 0XL∃∀N

Base field of a Belyi map. (LMFDB)

The base field of a Belyi map \phi:X\to\mathbb{P}^1 is the field X and \phi are defined over. (In the database, we take this base field to be the field of moduli whenever possible.)

Depends on: Definition 4.8.4

Definition4.8.3
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 4.8.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Degree of a Belyi map. (LMFDB)

The degree of a Belyi map \phi:X\to\mathbb{P}^1 is the degree of \phi as a finite map of curves.

Depends on: Definition 4.8.4

Definition4.8.4
uses 0
Used by 7
Reverse dependency previews
Preview
Definition 4.8.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Belyi map. (LMFDB)

A Belyi map over a field K of characteristic zero is a finite morphism \phi\colon X\to\mathbb{P}^1 of (smooth, projective, geometrically irreducible) curves over K that is unramified outside \{0,1,\infty\}.

Definition4.8.5
uses 1used by 1XL∃∀N

Genus of a Belyi map. (LMFDB)

The genus of a Belyi map \phi:X\to\mathbb{P}^1 is the genus of the source X.

Depends on: Definition 4.8.4

Definition4.8.6
Statement uses 2
Statement dependency previews
Preview
Definition 4.8.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Geometry type of a Belyi map. (LMFDB)

A Belyi map corresponds to a finite index subgroup of a triangle group \Delta(a,b,c). The geometry type of a Belyi map is spherical, Euclidean, or hyperbolic according to \frac{1}{a}+\frac{1}{b}+\frac{1}{c} being >1, =1, or <1, respectively.

Depends on: Definition 4.8.4 Definition 8.3.180

Definition4.8.7
Statement uses 2
Statement dependency previews
Preview
Definition 4.6.11
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.8.8
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Monodromy group of a Belyi map. (LMFDB)

The monodromy group of a Belyi map \phi \colon X \to \mathbb{P}^1 of degree d is the transitive subgroup of S_d generated by its associated transitive permutation triple \sigma. This group is the geometric monodromy group of the branched cover \phi, or equivalently it is the geometric Galois group of the corresponding extension of function fields K(X) \supseteq K(\phi) \simeq K(\mathbb{P}^1).

Depends on: Definition 4.8.3 Definition 4.6.11

Definition4.8.8
Statement uses 4
Statement dependency previews
Preview
Definition 4.8.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Belyi map label. (LMFDB)

The label of a Belyi map \phi has the form dTG-\lambda_0\_{\lambda_1}\_{\lambda_}\infty-m encoding the following data.

  • dTG is the transitive group label of the monodromy group of \phi. Here d is the degree of \phi.

  • \lambda_i are partitions of d specifying the ramification type of \phi, each written using '.' as a separator between the parts of the partition.

  • m is the Galois orbit label, a non-negative integer written in base 26 using the 26 symbols a, b, ..., z.

Depends on: Definition 4.8.3 Definition 4.8.4 Definition 4.8.7 Definition 4.8.16

Definition4.8.9
uses 1used by 0XL∃∀N

Number of Galois orbits. (LMFDB)

A passport decomposes as a disjoint union of k Galois orbits. We denote the number k by number of Galois orbits.

Depends on: Definition 4.8.12

Definition4.8.10
uses 1used by 0XL∃∀N

Orbit size. (LMFDB)

The orbit size is the number of isomorphism classes of Belyi maps contained in a given Galois orbit.

Depends on: Definition 4.8.4

Definition4.8.11
uses 1used by 0XL∃∀N

Passport size of a Belyi map. (LMFDB)

The number of isomorphism classes of Belyi maps belonging to a given passport.

Depends on: Definition 4.8.12

Definition4.8.12
uses 0
Used by 2
Reverse dependency previews
Preview
Definition 4.8.9
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Passport. (LMFDB)

A passport is the data of a transitive subgroup of the symmetric group S_d along with a triple of conjugacy classes (C_0, C_1, C_{\infty}) of S_d, (equivalently, a triple of partitions (\lambda_0, \lambda_1, \lambda_{\infty}) of d).

Tau Ceti Review: TauCeti.PassportSpec, TauCeti.PassportSpec.HasPassport, TauCeti.PassportSpec.IsAdmissible.

Lean code for Definition4.8.12●3 definitions
  • structure(4 fields)defined in TauCeti/Combinatorics/PermutationTriple/Passport/Basic.lean
    complete
    structure TauCeti.PassportSpec (n : ℕ) : Type
    structure TauCeti.PassportSpec (n : ℕ) : Type
    A passport specification in degree `n`: a reference monodromy subgroup and the ordered full
    cycle partitions at `0`, `1`, and `∞`.
    
    The subgroup is compared only up to conjugacy in `Perm (Fin n)` by `HasPassport`. 
    G : Subgroup (Equiv.Perm (Fin n))
    A reference representative for the conjugacy class of the monodromy subgroup. 
    lam0 : Multiset ℕ
    The full cycle partition at `0`. 
    lam1 : Multiset ℕ
    The full cycle partition at `1`. 
    laminf : Multiset ℕ
    The full cycle partition at `∞`. 
  • defdefined in TauCeti/Combinatorics/PermutationTriple/Passport/Basic.lean
    complete
    def TauCeti.PassportSpec.HasPassport {n : ℕ} (t : TauCeti.ConnectedTriple n)
      (P : TauCeti.PassportSpec n) : Prop
    def TauCeti.PassportSpec.HasPassport {n : ℕ}
      (t : TauCeti.ConnectedTriple n)
      (P : TauCeti.PassportSpec n) : Prop
    A connected triple has passport `P` when its monodromy subgroup is conjugate to `P.G` and
    its ordered full cycle partitions are those specified by `P`. 
  • defdefined in TauCeti/Combinatorics/PermutationTriple/Passport/Basic.lean
    complete
    def TauCeti.PassportSpec.IsAdmissible {n : ℕ} (P : TauCeti.PassportSpec n) :
      Prop
    def TauCeti.PassportSpec.IsAdmissible {n : ℕ}
      (P : TauCeti.PassportSpec n) : Prop
    A passport is admissible when its degree is nonzero, its reference subgroup is transitive,
    and its three multisets are partitions of the degree into positive parts. 
Definition4.8.13
uses 0used by 1✓L∃∀N

Transitive permutation triple. (LMFDB)

A permutation triple is a triple of permutations \sigma=(\sigma_0,\sigma_1,\sigma_{\infty}) \in S_d^3 such that \sigma_{\infty}\sigma_1\sigma_0=1. A permutation triple is transitive if the subgroup \langle \sigma \rangle is a transitive subgroup of the symmetric group S_d.

Tau Ceti Review: TauCeti.ConnectedTriple, TauCeti.PermutationTriple, TauCeti.PermutationTriple.IsConnected, TauCeti.PermutationTriple.equivOppositeConvention.

Lean code for Definition4.8.13●4 definitions
  • abbrevdefined in TauCeti/Combinatorics/PermutationTriple/IsoClass.lean
    complete
    abbrev TauCeti.ConnectedTriple (n : ℕ) : Type
    abbrev TauCeti.ConnectedTriple (n : ℕ) : Type
    A connected permutation triple of degree `n`. 
  • structure(4 fields)defined in TauCeti/Combinatorics/PermutationTriple/Basic.lean
    complete
    structure TauCeti.PermutationTriple (n : ℕ) : Type
    structure TauCeti.PermutationTriple (n : ℕ) : Type
    A permutation triple of degree `n`: three permutations of the `n` sheets, one for each of the
    three branch points, whose product in the order `σinf * σ1 * σ0` is the identity. 
    σ0 : Equiv.Perm (Fin n)
    The monodromy around the first branch point. 
    σ1 : Equiv.Perm (Fin n)
    The monodromy around the second branch point. 
    σinf : Equiv.Perm (Fin n)
    The monodromy around the third branch point. 
    product_eq_one : self.σinf * self.σ1 * self.σ0 = 1
    The three monodromies compose to the identity. 
  • defdefined in TauCeti/Combinatorics/PermutationTriple/Basic.lean
    complete
    def TauCeti.PermutationTriple.IsConnected {n : ℕ}
      (t : TauCeti.PermutationTriple n) : Prop
    def TauCeti.PermutationTriple.IsConnected
      {n : ℕ}
      (t : TauCeti.PermutationTriple n) : Prop
    A triple is connected when it has at least one sheet and its monodromy group is transitive on
    the sheets — the combinatorial form of connectedness of the associated cover. The degree
    hypothesis is not redundant: transitivity holds vacuously on `Fin 0`. 
  • defdefined in TauCeti/Combinatorics/PermutationTriple/Basic.lean
    complete
    def TauCeti.PermutationTriple.equivOppositeConvention (n : ℕ) :
      TauCeti.PermutationTriple n ≃ { p // p.1 * p.2.1 * p.2.2 = 1 }
    def TauCeti.PermutationTriple.equivOppositeConvention
      (n : ℕ) :
      TauCeti.PermutationTriple n ≃
        { p // p.1 * p.2.1 * p.2.2 = 1 }
    Componentwise inversion is a bijection from the triples of this file onto the triples for the
    opposite composition convention `σ0 * σ1 * σinf = 1`, which is the one imposed by sources that
    compose permutations from left to right.
    
    It preserves cycle types componentwise, by `Equiv.Perm.cycleType_inv`, and it preserves the
    monodromy group, by `TauCeti.PermutationTriple.closure_inv_pair_eq_monodromyGroup`;
    connectedness and the automorphism group are read off the monodromy group, by
    `TauCeti.PermutationTriple.automorphismGroup_eq_centralizer_monodromyGroup`, so they are
    preserved too. 
Definition4.8.14
Statement uses 2
Statement dependency previews
Preview
Definition 4.8.7
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Primitive Belyi map. (LMFDB)

A Belyi map is primitive if its monodromy group is primitive as a transitive subgroup of S_d.

Depends on: Definition 4.8.7 Definition 8.1.19

Definition4.8.15
uses 1used by 0XL∃∀N

Primitivization of a Belyi map. (LMFDB)

Given a Belyi map \phi the primitivization of \phi is the subcover of minimal degree with primitive monodromy group, which is unique up to isomorphism.

Depends on: Definition 4.8.7

Definition4.8.16
uses 0used by 1XL∃∀N

Ramification type. (LMFDB)

The ramification type of a Belyi map \phi \colon X \to \mathbb{P}^1 is the triple of partitions \lambda_0,\lambda_1,\lambda_{\infty} giving the ramification orders of the preimages of 0,1,\infty, respectively.

Definition4.8.17
Statement uses 5
Statement dependency previews
Preview
Definition 1.2.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Reliability of Belyi map data. (LMFDB)

To ensure that the map X \to \mathbb{P}^1 provided is indeed a Belyi map, we first verify by taking (exact) preimages that the ramification above \{0,1,\infty\} \subseteq \mathbb{P}^1 is correct (in particular, it has the correct degree). We then also verify that X has the correct genus; it follows by the Riemann-Hurwitz theorem that there can be no other ramification, so the map is indeed a Belyi map.

The permutation triple, specified by the action of monodromy on preimages of the branch points, was certified a posteriori using a rigorous algorithm involving path tracking . Even without that, the complex accuracy set in the numerical triangle group method was almost surely enough to automatically ensure this.

Once the Belyi map is verified and associated with the correct permutation triple for all Belyi maps of a given degree, base fields and Galois orbits can be read off directly. Other invariants of the map or its orbits can then be obtained from the corresponding monodromy triple by means of a short calculation.

Tau Ceti Review: TauCeti.genus, TauCeti.Place.ramificationIdx, TauCeti.Divisor.tameDifferent, TauCeti.hurwitz_genus_formula_ratFunc, TauCeti.Place.sum_ramificationIdx_mul_relativeDegree_eq_finrank_of_isSeparable.

Depends on: Definition 1.2.8 Definition 4.8.3 Definition 4.8.4 Definition 4.8.5 Definition 8.3.180

Lean code for Definition4.8.17●7 declarations
  • defdefined in TauCeti/FieldTheory/FunctionField/RiemannRoch/Genus.lean
    complete
    def TauCeti.genus.{u_1, u_2} (k : Type u_1) (F : Type u_2) [Field k]
      [Field F] [Algebra k F] : ℕ
    def TauCeti.genus.{u_1, u_2} (k : Type u_1)
      (F : Type u_2) [Field k] [Field F]
      [Algebra k F] : ℕ
    **The genus of an algebraic function field** (Stichtenoth, Definition 1.4.15):
    `g = sup {deg D + 1 - ℓ(D)}` after truncation to natural numbers.  When `IsFunctionField k F`,
    `TauCeti.Divisor.bddAbove_range_degree_sub_dim` makes this supremum finite; without that hypothesis,
    an unbounded range gives the junk value `0`.
    
    The value is truncated to `ℕ`.  Over an exact constant field this loses nothing, because `D = 0`
    already gives `deg 0 + 1 - ℓ(0) = 0`; see `TauCeti.exists_degree_add_one_sub_dim_eq_genus`.  Over a
    non-exact constant field the truncation is a junk value: for `ℝ ⊆ ℂ(x)` the true maximum is `-1`,
    because every `ℝ`-degree and every `ℝ`-dimension is twice its `ℂ`-counterpart. 
  • defdefined in TauCeti/FieldTheory/FunctionField/Place/Extension/Basic.lean
    complete
    def TauCeti.Place.ramificationIdx.{u', v, v'} {k' : Type u'} (F : Type v)
      {F' : Type v'} [Field F] [Field k'] [Field F'] [Algebra k' F']
      [Algebra F F'] (P' : TauCeti.Place k' F') : ℕ
    def TauCeti.Place.ramificationIdx.{u', v, v'}
      {k' : Type u'} (F : Type v)
      {F' : Type v'} [Field F] [Field k']
      [Field F'] [Algebra k' F']
      [Algebra F F']
      (P' : TauCeti.Place k' F') : ℕ
    **The ramification index** `e(P' ∣ P)` of a place `P'` of `F' / k'` over the place `P` of
    `F / k` it lies over: the factor by which the order function at `P'` scales the order function
    at `P` (Stichtenoth, Definition 3.1.5). 
  • defdefined in TauCeti/FieldTheory/FunctionField/Different/Tame.lean
    complete
    def TauCeti.Divisor.tameDifferent.{u, u', v, v'} {k : Type u} (k' : Type u')
      {F : Type v} (F' : Type v') [Field k] [Field k'] [Field F] [Field F']
      [Algebra k F] [Algebra F F'] [Algebra k k'] [Algebra k' F']
      [Algebra k F'] [IsScalarTower k k' F'] [IsScalarTower k F F']
      [FiniteDimensional F F'] [Algebra.IsSeparable F F']
      (hF : TauCeti.IsFunctionField k F) : TauCeti.Divisor k' F'
    def TauCeti.Divisor.tameDifferent.{u, u', v,
        v'}
      {k : Type u} (k' : Type u') {F : Type v}
      (F' : Type v') [Field k] [Field k']
      [Field F] [Field F'] [Algebra k F]
      [Algebra F F'] [Algebra k k']
      [Algebra k' F'] [Algebra k F']
      [IsScalarTower k k' F']
      [IsScalarTower k F F']
      [FiniteDimensional F F']
      [Algebra.IsSeparable F F']
      (hF : TauCeti.IsFunctionField k F) :
      TauCeti.Divisor k' F'
    **The tame different** `∑_{P'} (e(P' ∣ P) - 1) · P'` of a finite separable extension `F' / F`
    of an algebraic function field: the value the different divisor `Diff(F'/F)` would take if every
    place of `F'` were tame (Stichtenoth, Theorem 3.5.1(b)).  It is a divisor because a place with
    `e(P' ∣ P) > 1` lies in the support of the different, and it is the lower bound for the different
    in the Hurwitz genus formula (Stichtenoth, Corollary 3.5.6). 
  • theoremdefined in TauCeti/FieldTheory/FunctionField/Different/Hurwitz.lean
    complete
    theorem TauCeti.hurwitz_genus_formula_ratFunc.{u, v} {k : Type u} {F : Type v}
      [Field k] [Field F] [Algebra k F] [Algebra (RatFunc k) F]
      [IsScalarTower k (RatFunc k) F] [FiniteDimensional (RatFunc k) F]
      [Algebra.IsSeparable (RatFunc k) F] (hex : IsIntegrallyClosedIn k F) :
      2 * ↑(TauCeti.genus k F) - 2 =
        -2 * ↑(Module.finrank (RatFunc k) F) +
          TauCeti.Divisor.degree (TauCeti.Divisor.different k F ⋯)
    theorem TauCeti.hurwitz_genus_formula_ratFunc.{u,
        v}
      {k : Type u} {F : Type v} [Field k]
      [Field F] [Algebra k F]
      [Algebra (RatFunc k) F]
      [IsScalarTower k (RatFunc k) F]
      [FiniteDimensional (RatFunc k) F]
      [Algebra.IsSeparable (RatFunc k) F]
      (hex : IsIntegrallyClosedIn k F) :
      2 * ↑(TauCeti.genus k F) - 2 =
        -2 * ↑(Module.finrank (RatFunc k) F) +
          TauCeti.Divisor.degree
            (TauCeti.Divisor.different k F ⋯)
    **The Hurwitz genus formula over a rational subfield** (Stichtenoth, Corollary 3.4.14): for a
    finite separable extension `F` of the rational function field `k(x)` with exact constant field
    `k`, `2g - 2 = -2 [F : k(x)] + deg Diff(F / k(x))`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/FunctionField/BranchLocus.lean
    complete
    theorem TauCeti.two_mul_genus_sub_two_eq_iff_forall_ramificationIdx_eq_one.{u_1,
        u_2}
      {k : Type u_1} {F : Type u_2} [Field k] [CharZero k] [Field F]
      [Algebra k F] [Algebra (RatFunc k) F] [IsScalarTower k (RatFunc k) F]
      [FiniteDimensional (RatFunc k) F] (hex : IsIntegrallyClosedIn k F)
      (S : Set (TauCeti.Place k (RatFunc k)))
      [DecidablePred fun P => TauCeti.Place.restrict k (RatFunc k) P ∈ S] :
      2 * ↑(TauCeti.genus k F) - 2 =
          -2 * ↑(Module.finrank (RatFunc k) F) +
            TauCeti.Divisor.degree
              (Finsupp.filter
                (fun P => TauCeti.Place.restrict k (RatFunc k) P ∈ S)
                (TauCeti.Divisor.tameDifferent k F ⋯)) ↔
        ∀ (P : TauCeti.Place k F),
          TauCeti.Place.restrict k (RatFunc k) P ∉ S →
            TauCeti.Place.ramificationIdx (RatFunc k) P = 1
    theorem TauCeti.two_mul_genus_sub_two_eq_iff_forall_ramificationIdx_eq_one.{u_1,
        u_2}
      {k : Type u_1} {F : Type u_2} [Field k]
      [CharZero k] [Field F] [Algebra k F]
      [Algebra (RatFunc k) F]
      [IsScalarTower k (RatFunc k) F]
      [FiniteDimensional (RatFunc k) F]
      (hex : IsIntegrallyClosedIn k F)
      (S : Set (TauCeti.Place k (RatFunc k)))
      [DecidablePred fun P =>
          TauCeti.Place.restrict k (RatFunc k)
              P ∈
            S] :
      2 * ↑(TauCeti.genus k F) - 2 =
          -2 *
              ↑(Module.finrank (RatFunc k)
                  F) +
            TauCeti.Divisor.degree
              (Finsupp.filter
                (fun P =>
                  TauCeti.Place.restrict k
                      (RatFunc k) P ∈
                    S)
                (TauCeti.Divisor.tameDifferent
                  k F ⋯)) ↔
        ∀ (P : TauCeti.Place k F),
          TauCeti.Place.restrict k (RatFunc k)
                P ∉
              S →
            TauCeti.Place.ramificationIdx
                (RatFunc k) P =
              1
    **The Riemann–Hurwitz formula detects the branch locus** (LMFDB `rcs.rigor.belyi`): for a
    finite extension `F` of `k(t)` in characteristic zero with exact constant field `k` and a set `S` of
    places of `k(t)`, the genus `g` of `F` satisfies
    `2g - 2 = -2 [F : k(t)] + ∑_{P ∣ S} (e_P - 1) deg P`, the sum running over the places of `F` above
    `S`, if and only if every place of `F` that does not lie above `S` is unramified. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/FunctionField/BranchLocus.lean
    complete
    theorem TauCeti.ramificationIdx_eq_one_of_two_mul_genus_sub_two_eq.{u_1, u_2}
      {k : Type u_1} {F : Type u_2} [Field k] [CharZero k] [Field F]
      [Algebra k F] [Algebra (RatFunc k) F] [IsScalarTower k (RatFunc k) F]
      [FiniteDimensional (RatFunc k) F] (hex : IsIntegrallyClosedIn k F) :
      2 * ↑(TauCeti.genus k F) - 2 =
          -2 * ↑(Module.finrank (RatFunc k) F) +
            TauCeti.Divisor.degree
              (Finsupp.filter
                (fun P =>
                  TauCeti.Place.restrict k (RatFunc k) P ∈
                    {TauCeti.Place.adicOfIrreducible ⋯,
                      TauCeti.Place.adicOfIrreducible ⋯,
                      TauCeti.Place.infty k})
                (TauCeti.Divisor.tameDifferent k F ⋯)) →
        ∀ (P : TauCeti.Place k F),
          TauCeti.Place.restrict k (RatFunc k) P ∉
              {TauCeti.Place.adicOfIrreducible ⋯,
                TauCeti.Place.adicOfIrreducible ⋯, TauCeti.Place.infty k} →
            TauCeti.Place.ramificationIdx (RatFunc k) P = 1
    theorem TauCeti.ramificationIdx_eq_one_of_two_mul_genus_sub_two_eq.{u_1,
        u_2}
      {k : Type u_1} {F : Type u_2} [Field k]
      [CharZero k] [Field F] [Algebra k F]
      [Algebra (RatFunc k) F]
      [IsScalarTower k (RatFunc k) F]
      [FiniteDimensional (RatFunc k) F]
      (hex : IsIntegrallyClosedIn k F) :
      2 * ↑(TauCeti.genus k F) - 2 =
          -2 *
              ↑(Module.finrank (RatFunc k)
                  F) +
            TauCeti.Divisor.degree
              (Finsupp.filter
                (fun P =>
                  TauCeti.Place.restrict k
                      (RatFunc k) P ∈
                    {TauCeti.Place.adicOfIrreducible
                        ⋯,
                      TauCeti.Place.adicOfIrreducible
                        ⋯,
                      TauCeti.Place.infty k})
                (TauCeti.Divisor.tameDifferent
                  k F ⋯)) →
        ∀ (P : TauCeti.Place k F),
          TauCeti.Place.restrict k (RatFunc k)
                P ∉
              {TauCeti.Place.adicOfIrreducible
                  ⋯,
                TauCeti.Place.adicOfIrreducible
                  ⋯,
                TauCeti.Place.infty k} →
            TauCeti.Place.ramificationIdx
                (RatFunc k) P =
              1
    **A cover of the projective line with the predicted genus is a Belyi map** (LMFDB
    `rcs.rigor.belyi`): if the genus of `F` is the one that its ramification over `t = 0`, `t = 1` and
    `t = ∞` predicts by the Riemann–Hurwitz formula, then every place of `F` over another place of
    `k(t)` is unramified. 
  • theoremdefined in TauCeti/FieldTheory/FunctionField/Place/Extension/Fundamental.lean
    complete
    theorem TauCeti.Place.sum_ramificationIdx_mul_relativeDegree_eq_finrank_of_isSeparable.{u,
        u', v, v'}
      (k : Type u) {k' : Type u'} (F : Type v) {F' : Type v'} [Field k]
      [Field k'] [Field F] [Field F'] [Algebra k k'] [Algebra k F]
      [Algebra k' F'] [Algebra F F'] [Algebra k F'] [IsScalarTower k k' F']
      [IsScalarTower k F F'] [FiniteDimensional F F']
      [Algebra.IsIntegral k k'] [Algebra.IsSeparable F F']
      (P : TauCeti.Place k F) {s : Finset (TauCeti.Place k' F')}
      (hs :
        ∀ (P' : TauCeti.Place k' F'),
          P' ∈ s ↔ TauCeti.Place.restrict k F P' = P) :
      ∑ P' ∈ s,
          TauCeti.Place.ramificationIdx F P' *
            TauCeti.Place.relativeDegree k F P' =
        Module.finrank F F'
    theorem TauCeti.Place.sum_ramificationIdx_mul_relativeDegree_eq_finrank_of_isSeparable.{u,
        u', v, v'}
      (k : Type u) {k' : Type u'} (F : Type v)
      {F' : Type v'} [Field k] [Field k']
      [Field F] [Field F'] [Algebra k k']
      [Algebra k F] [Algebra k' F']
      [Algebra F F'] [Algebra k F']
      [IsScalarTower k k' F']
      [IsScalarTower k F F']
      [FiniteDimensional F F']
      [Algebra.IsIntegral k k']
      [Algebra.IsSeparable F F']
      (P : TauCeti.Place k F)
      {s : Finset (TauCeti.Place k' F')}
      (hs :
        ∀ (P' : TauCeti.Place k' F'),
          P' ∈ s ↔
            TauCeti.Place.restrict k F P' =
              P) :
      ∑ P' ∈ s,
          TauCeti.Place.ramificationIdx F P' *
            TauCeti.Place.relativeDegree k F
              P' =
        Module.finrank F F'
    **The fundamental identity** (Stichtenoth, Theorem 3.1.11) at an arbitrary place `P` of
    `F / k`, for an extension `F' / k'` whose extension of function fields `F' / F` is finite and
    **separable**: the ramification indices and relative degrees of the places of `F' / k'` lying
    over `P` satisfy `∑_{P' ∣ P} e(P' ∣ P) · f(P' ∣ P) = [F' : F]`.
    
    The finite set `s` is the fibre of `TauCeti.Place.restrict` over `P`, which is finite by
    `TauCeti.Place.finite_setOf_restrict_eq`.
    
    Separability is the hypothesis of Mathlib's finiteness theorem for integral closures, and is used
    only there. When `F / k` is an algebraic function field the identity holds for every finite
    extension; that is
    `TauCeti.Place.sum_ramificationIdx_mul_relativeDegree_eq_finrank_of_isFunctionField`.