Documentation

TauCeti.Combinatorics.PermutationTriple.BlockQuotient

Quotient triples by blocks #

Let t be a permutation triple and B a set of sheets. The monodromy group of t permutes the translates g • B of B, so after numbering those translates by Fin m the three components of t induce a triple of degree m: this is TauCeti.PermutationTriple.blockQuotient. It is always connected, since a group acts transitively on each of its orbits, and changing the numbering only relabels it.

When t is connected and B is a nonempty block of the monodromy action, the translates of B partition the sheets (MulAction.IsBlock.isBlockSystem), and sending a sheet to the number of the translate containing it is a surjection TauCeti.PermutationTriple.blockIndex from the sheets of t to those of the quotient which intertwines the three components. Geometrically, the cover described by t factors through the cover described by the quotient triple, and the fibres of the intermediate map are the blocks. The degree of the quotient times the size of B is the degree of t.

The cycle data of t refines that of the quotient. A cycle of an element g of the monodromy group goes round the cycle of g on the blocks below it a whole number of times, namely the number of its sheets lying in one block. Counting cycles, g has at most |B| times as many cycles on the sheets as on the blocks; summed over the three components this bounds the Euler characteristic of t by |B| times that of the quotient, which is the combinatorial form of the Riemann–Hurwitz inequality for the intermediate cover, and shows that passing to a quotient does not increase the genus.

Every block system of a transitive action that is stable under the group consists of the translates of any one of its blocks, so describing quotients through a single block B loses nothing.

Quotients are transitive. The blocks of the quotient by B containing the translate B itself correspond, by pulling back along the quotient map, to the blocks of t containing B, so the block systems of the quotient are exactly the block systems of t coarser than the translates of B. Taking the quotient of the quotient by a set C of its sheets is taking the quotient of t by the preimage of C, and the quotient maps compose accordingly: geometrically, a tower of intermediate covers is read off from a chain of block systems.

Main definitions #

Main results #

References #

The quotient triple #

The action of the monodromy group of t on the translates of B, with the translates numbered by e.

Equations
Instances For
    @[simp]
    theorem TauCeti.PermutationTriple.symm_blockActionHom_apply {n m : ℕ} (t : PermutationTriple n) (B : Set (Fin n)) (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (g : ↥t.monodromyGroup) (i : Fin m) :
    e.symm (((t.blockActionHom B e) g) i) = g • e.symm i

    Numbering the translates of B by e, the permutation of the numbers induced by g is the action of g on the translates.

    The quotient of a triple by the translates of B: the triple of permutations induced on the translates, numbered by e, by the three components.

    Equations
    Instances For
      @[simp]
      @[simp]
      theorem TauCeti.PermutationTriple.coe_symm_blockQuotient_σ0 {n m : ℕ} (t : PermutationTriple n) (B : Set (Fin n)) (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (i : Fin m) :
      ↑(e.symm ((t.blockQuotient B e).σ0 i)) = ⇑t.σ0 '' ↑(e.symm i)

      The first component of the quotient moves the translate numbered i by t.σ0.

      theorem TauCeti.PermutationTriple.coe_symm_blockQuotient_σ1 {n m : ℕ} (t : PermutationTriple n) (B : Set (Fin n)) (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (i : Fin m) :
      ↑(e.symm ((t.blockQuotient B e).σ1 i)) = ⇑t.σ1 '' ↑(e.symm i)

      The second component of the quotient moves the translate numbered i by t.σ1.

      theorem TauCeti.PermutationTriple.coe_symm_blockQuotient_σinf {n m : ℕ} (t : PermutationTriple n) (B : Set (Fin n)) (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (i : Fin m) :
      ↑(e.symm ((t.blockQuotient B e).σinf i)) = ⇑t.σinf '' ↑(e.symm i)

      The third component of the quotient moves the translate numbered i by t.σinf.

      The monodromy group of the quotient is the image of the monodromy group of t acting on the translates of B.

      Changing the numbering of the translates from e to e' relabels the quotient triple by the permutation e.symm.trans e' of Fin m comparing the two numberings.

      The quotient triple does not depend on the numbering of the translates, up to isomorphism.

      A quotient triple is connected: it has a sheet, the translate B itself, and the monodromy group of t acts transitively on the translates of B.

      The quotient map on sheets #

      noncomputable def TauCeti.PermutationTriple.blockIndex {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (x : Fin n) :
      Fin m

      For a triple with transitive monodromy and a nonempty block B, the number of the unique translate of B containing the sheet x.

      Equations
      Instances For
        @[simp]
        theorem TauCeti.PermutationTriple.blockIndex_eq_iff {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {x : Fin n} {i : Fin m} :
        blockIndex ht hB hBne e x = i ↔ x ∈ ↑(e.symm i)

        The sheet x is sent to i exactly when it lies in the translate numbered i.

        theorem TauCeti.PermutationTriple.mem_symm_blockIndex {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (x : Fin n) :
        x ∈ ↑(e.symm (blockIndex ht hB hBne e x))

        Every sheet lies in the translate of B whose number it is sent to.

        Every sheet of the quotient is hit: translates of a nonempty set are nonempty.

        @[simp]
        theorem TauCeti.PermutationTriple.blockIndex_smul {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (g : ↥t.monodromyGroup) (x : Fin n) :
        blockIndex ht hB hBne e (g • x) = ((t.blockActionHom B e) g) (blockIndex ht hB hBne e x)

        The quotient map is equivariant for the monodromy group, acting on the quotient through TauCeti.PermutationTriple.blockActionHom.

        @[simp]
        theorem TauCeti.PermutationTriple.blockIndex_σ0 {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (x : Fin n) :
        blockIndex ht hB hBne e (t.σ0 x) = (t.blockQuotient B e).σ0 (blockIndex ht hB hBne e x)

        The quotient map intertwines the first components.

        @[simp]
        theorem TauCeti.PermutationTriple.blockIndex_σ1 {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (x : Fin n) :
        blockIndex ht hB hBne e (t.σ1 x) = (t.blockQuotient B e).σ1 (blockIndex ht hB hBne e x)

        The quotient map intertwines the second components.

        @[simp]
        theorem TauCeti.PermutationTriple.blockIndex_σinf {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (x : Fin n) :
        blockIndex ht hB hBne e (t.σinf x) = (t.blockQuotient B e).σinf (blockIndex ht hB hBne e x)

        The quotient map intertwines the third components.

        The degree of a triple with transitive monodromy is the size of a nonempty block times the degree of the quotient by it.

        Composing quotients #

        The action of an element of the monodromy group of t on the translates of B lies in the monodromy group of the quotient.

        theorem TauCeti.PermutationTriple.preimage_blockIndex_smul {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {g : ↥t.monodromyGroup} {h : ↥(t.blockQuotient B e).monodromyGroup} (hgh : (t.blockActionHom B e) g = ↑h) (C : Set (Fin m)) :
        blockIndex ht hB hBne e ⁻¹' (h • C) = g • blockIndex ht hB hBne e ⁻¹' C

        Pulling back along the quotient map turns the translate of a set of sheets of the quotient by h into the translate of its preimage by any g acting on the translates of B as h.

        Blocks of a quotient. A set of sheets of the quotient is a block of its monodromy action exactly when its preimage under the quotient map is a block of the monodromy action of t.

        theorem TauCeti.PermutationTriple.preimage_image_blockIndex {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {D : Set (Fin n)} (hD : MulAction.IsBlock (↥t.monodromyGroup) D) (hBD : B ⊆ D) :
        blockIndex ht hB hBne e ⁻¹' blockIndex ht hB hBne e '' D = D

        Blocks containing B come from the quotient. A block of the monodromy action of t containing B is the preimage of its image under the quotient map: it is a union of translates of B.

        Block systems refine. Pulling back along the quotient map is an order isomorphism from the blocks of the monodromy action of the quotient containing the sheet that numbers the translate B itself to the blocks of the monodromy action of t containing B.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          @[simp]

          The block of t corresponding to a block of the quotient is its preimage.

          @[simp]
          theorem TauCeti.PermutationTriple.coe_preimageBlockIndexOrderIso_symm_apply {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (D : { D : Set (Fin n) // MulAction.IsBlock (↥t.monodromyGroup) D ∧ B ⊆ D }) :
          ↑((preimageBlockIndexOrderIso e ht hB hBne).symm D) = blockIndex ht hB hBne e '' ↑D

          The block of the quotient corresponding to a block of t containing B is its image.

          noncomputable def TauCeti.PermutationTriple.blockIndexOrbitEquiv {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (C : Set (Fin m)) :

          Pulling back along the quotient map identifies the translates of a set C of sheets of the quotient with the translates of its preimage.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            @[simp]
            theorem TauCeti.PermutationTriple.coe_blockIndexOrbitEquiv_apply {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (C : Set (Fin m)) (S : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) C)) :
            ↑((blockIndexOrbitEquiv e ht hB hBne C) S) = blockIndex ht hB hBne e ⁻¹' ↑S

            The translate of the preimage of C corresponding to a translate of C is its preimage.

            @[simp]
            theorem TauCeti.PermutationTriple.coe_blockIndexOrbitEquiv_symm_apply {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (C : Set (Fin m)) (T : ↑(MulAction.orbit (↥t.monodromyGroup) (blockIndex ht hB hBne e ⁻¹' C))) :
            ↑((blockIndexOrbitEquiv e ht hB hBne C).symm T) = blockIndex ht hB hBne e '' ↑T

            The translate of C corresponding to a translate of its preimage is its image.

            theorem TauCeti.PermutationTriple.blockIndexOrbitEquiv_smul {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (C : Set (Fin m)) (g : ↥t.monodromyGroup) (S : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) C)) :
            (blockIndexOrbitEquiv e ht hB hBne C) (⟨(t.blockActionHom B e) g, ⋯⟩ • S) = g • (blockIndexOrbitEquiv e ht hB hBne C) S

            The identification of translates is equivariant for the monodromy group of t, acting on the translates of C through its action on the sheets of the quotient.

            theorem TauCeti.PermutationTriple.blockActionHom_blockQuotient {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {k : ℕ} (C : Set (Fin m)) (e' : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) C) ≃ Fin k) (g : ↥t.monodromyGroup) :
            ((t.blockQuotient B e).blockActionHom C e') ⟨(t.blockActionHom B e) g, ⋯⟩ = (t.blockActionHom (blockIndex ht hB hBne e ⁻¹' C) ((blockIndexOrbitEquiv e ht hB hBne C).symm.trans e')) g

            The action on the translates of C of the quotient, through the action on the sheets of the quotient, is the action on the translates of the preimage of C, numbered compatibly.

            theorem TauCeti.PermutationTriple.blockQuotient_blockQuotient {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {k : ℕ} (C : Set (Fin m)) (e' : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) C) ≃ Fin k) :
            (t.blockQuotient B e).blockQuotient C e' = t.blockQuotient (blockIndex ht hB hBne e ⁻¹' C) ((blockIndexOrbitEquiv e ht hB hBne C).symm.trans e')

            Quotient triples compose. Taking the quotient of the quotient of t by B by a set C of its sheets gives the quotient of t by the preimage of C, for the numbering of the translates of the preimage induced by that of the translates of C.

            theorem TauCeti.PermutationTriple.equivalent_blockQuotient_blockQuotient {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {k : ℕ} (C : Set (Fin m)) (e' : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) C) ≃ Fin k) (e'' : ↑(MulAction.orbit (↥t.monodromyGroup) (blockIndex ht hB hBne e ⁻¹' C)) ≃ Fin k) :
            ((t.blockQuotient B e).blockQuotient C e').Equivalent (t.blockQuotient (blockIndex ht hB hBne e ⁻¹' C) e'')

            Up to isomorphism, the quotient of the quotient of t by B by a set C of its sheets is the quotient of t by the preimage of C, whatever the numberings of the translates.

            theorem TauCeti.PermutationTriple.equivalent_blockQuotient_image_blockIndex {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {k : ℕ} {D : Set (Fin n)} (hD : MulAction.IsBlock (↥t.monodromyGroup) D) (hBD : B ⊆ D) (e' : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) (blockIndex ht hB hBne e '' D)) ≃ Fin k) (e'' : ↑(MulAction.orbit (↥t.monodromyGroup) D) ≃ Fin k) :
            ((t.blockQuotient B e).blockQuotient (blockIndex ht hB hBne e '' D) e').Equivalent (t.blockQuotient D e'')

            Quotients by coarser blocks factor through finer ones. For a block D of the monodromy action of t containing B, the quotient of t by D is, up to isomorphism, the quotient of the quotient of t by B by the image of D.

            theorem TauCeti.PermutationTriple.blockIndex_blockIndex {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) {k : ℕ} {C : Set (Fin m)} (hC : MulAction.IsBlock (↥(t.blockQuotient B e).monodromyGroup) C) (hCne : C.Nonempty) (e' : ↑(MulAction.orbit (↥(t.blockQuotient B e).monodromyGroup) C) ≃ Fin k) (x : Fin n) :
            blockIndex ⋯ hC hCne e' (blockIndex ht hB hBne e x) = blockIndex ht ⋯ ⋯ ((blockIndexOrbitEquiv e ht hB hBne C).symm.trans e') x

            Quotient maps compose. For a nonempty block C of the monodromy action of the quotient of t by B, the quotient map of t by the preimage of C is the quotient map of t by B followed by the quotient map of the quotient by C.

            Cycle data of the quotient #

            theorem TauCeti.PermutationTriple.semiconj_blockIndex {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (g : ↥t.monodromyGroup) :
            Function.Semiconj (blockIndex ht hB hBne e) ⇑↑g ⇑((t.blockActionHom B e) g)

            The quotient map is a semiconjugacy from each element of the monodromy group to its action on the translates.

            @[simp]

            Each fibre of the quotient map is a translate of B, so it has as many sheets as B.

            theorem TauCeti.PermutationTriple.ncard_sameCycle_and_mem_mul_minimalPeriod_blockActionHom {n m : ℕ} {t : PermutationTriple n} {B : Set (Fin n)} (e : ↑(MulAction.orbit (↥t.monodromyGroup) B) ≃ Fin m) (ht : MulAction.IsPretransitive (↥t.monodromyGroup) (Fin n)) (hB : MulAction.IsBlock (↥t.monodromyGroup) B) (hBne : B.Nonempty) (g : ↥t.monodromyGroup) (x : Fin n) :
            {y : Fin n | (↑g).SameCycle x y ∧ y ∈ ↑(e.symm (blockIndex ht hB hBne e x))}.ncard * Function.minimalPeriod (⇑((t.blockActionHom B e) g)) (blockIndex ht hB hBne e x) = Function.minimalPeriod (⇑↑g) x

            Cycle lengths in a block quotient. For g in the monodromy group and a sheet x, the length of the cycle of x under g is the length of the cycle of the block of x under the quotient action of g, times the number of sheets of the cycle of x that lie in the block of x.

            An element of the monodromy group has at most |B| times as many cycles on the sheets as on the translates of B.

            The Riemann–Hurwitz inequality for a block quotient. The Euler characteristic of a triple with transitive monodromy is at most |B| times that of its quotient by a nonempty block B.

            Passing to a block quotient does not increase the genus. The quotient of a connected triple by a nonempty block has genus at most that of the triple.