Documentation

TauCeti.GroupTheory.SpecificGroups.CFSG.Assembly.GraphTwisted

The candidate groups of the ordinary and graph-twisted Lie-type families #

Thirteen of the seventeen Lie-type constructors take an ordinary Steinberg endomorphism, the field Frobenius composed with a graph automorphism, and TauCeti.GraphTwistedIndex is exactly the subtype of those thirteen. Each of them already has its own carrier, numbered simple root subgroups, Steinberg endomorphism and candidate group, built family by family on the carrier assigned to it:

ConstructorsFamily API
A, twistedATauCeti.TypeALieIndex, on the special linear carrier
BTauCeti.TypeBLieIndex, on the full-weight type-B spin carrier
CTauCeti.TypeCLieIndex, on the standard symplectic carrier
DTauCeti.TypeDLieIndex, on the full-weight type-D spin carrier
twistedDTauCeti.TypeTwistedDLieIndex, on the same spin carrier
trialityD4TauCeti.TypeTrialityD4LieIndex, on the tripled D₄ carrier
E6TauCeti.TypeE6LieIndex, on the 27-dimensional minuscule carrier
twistedE6TauCeti.TypeTwistedE6LieIndex, on the doubled minuscule carrier
E7TauCeti.TypeE7LieIndex, on the 56-dimensional minuscule carrier
E8, F4, G2TauCeti.UnimodularExceptionalIndex, on the Geck carrier

This file joins them into one construction on TauCeti.GraphTwistedIndex, by cases on the constructor: the ambient group TauCeti.GraphTwistedIndex.AmbientGroup, its numbered simple root subgroups, its q-power Frobenius, the Steinberg endomorphism, its fixed points, and the candidate group TauCeti.GraphTwistedIndex.Group, the derived subgroup of the fixed points modulo its centre. Each branch is the family construction, with no new carrier or map; the branch equations TauCeti.GraphTwistedIndex.steinberg_A and its twelve siblings, and likewise for the simple root subgroups and the Frobenius, say which one. The four Suzuki--Ree and Tits constructors are not indices of the subtype, and their branches are closed by that hypothesis rather than by a chosen value.

Beside the q-power Frobenius the assembly carries the prime-field Frobenius TauCeti.GraphTwistedIndex.primeFrobenius, the p-power map for p the defining characteristic, of which the q-power map is the e-th power, for e the field exponent the index records. The two agree on an index of prime field order.

The two factors of the Steinberg endomorphism are assembled separately as well: its Frobenius factor is TauCeti.GraphTwistedIndex.frobenius and its graph factor is TauCeti.GraphTwistedIndex.graphAut, the automorphism of the ambient group realizing the diagram permutation the index carries, the identity on the nine untwisted families. They recompose by TauCeti.GraphTwistedIndex.steinberg_eq_graphAut_comp_frobenius, in either order since they commute.

What the assembly buys is a single statement of the pinned equations for all thirteen families, TauCeti.GraphTwistedIndex.frobenius_simpleRootSubgroup and TauCeti.GraphTwistedIndex.steinberg_simpleRootSubgroup:

Frob_q (x_i(u)) = x_i(u ^ q),        F (x_i(u)) = x_{σ i}(u ^ q),

where σ is TauCeti.GraphTwistedIndex.diagramPerm, the identity on the nine untwisted families, and q is the field order the index records. On those nine families the Steinberg endomorphism is the Frobenius itself, TauCeti.GraphTwistedIndex.steinberg_eq_frobenius: the A, B, C and D family APIs name their Frobenius separately and the assembly takes it, while the E₆, E₇, E₈, F₄ and G₂ family APIs name only the Steinberg endomorphism, which is the Frobenius, and the assembly takes that. On the four graph-twisted families the Steinberg endomorphism is the graph automorphism composed with the Frobenius, and the Frobenius is the right-hand factor of that composite.

Every carrier used here is an explicit one, and none is identified with the pinned simply connected group scheme of its diagram; the constructions transfer to that pinned group only along such an identification, once one is proved. Nothing here asserts that a candidate group is finite, perfect or simple.

Main definitions #

Main results #

References #

The ambient group of an ordinary or graph-twisted index: the group of algebraic-closure-valued points of the explicit carrier assigned to its family. It is generally infinite, and it is not identified with the points of the pinned simply connected group scheme of the diagram. The two families on a type-D diagram other than ³D₄(q) share the spin carrier of TauCeti.TypeDDiagramLieIndex, while ³D₄(q) runs on the tripled carrier that carries triality.

Equations
Instances For

    The positive simple root subgroup at the Bourbaki-numbered node i, as a homomorphism from the additive group of the algebraic closure. On each constructor it is the simple root subgroup of the family's carrier, by simpleRootSubgroup_A and its siblings.

    Equations
    Instances For

      The q-power Frobenius endomorphism of an ordinary or graph-twisted index, for q the field order the index records. On each constructor it is the Frobenius of the family, by frobenius_A and its siblings: the family's own frobenius where the family API names one (A, twistedA, B, C, D, twistedD, twistedE6, trialityD4), and the family's Steinberg endomorphism on E6, E7, E8, F4 and G2, where that endomorphism is the Frobenius itself. On the nine untwisted families it agrees with steinberg, by steinberg_eq_frobenius; on the four graph-twisted ones it is the Frobenius factor of the family's Steinberg composite. Its action on the simple root subgroups is frobenius_simpleRootSubgroup.

      Equations
      Instances For

        The prime-field Frobenius endomorphism of an ordinary or graph-twisted index, the p-power map for p the defining characteristic. On each constructor it is the prime-field Frobenius of the family, by primeFrobenius_A and its siblings. The q-power Frobenius is its e-th power, for e the field exponent the index records, by frobenius_eq_primeFrobenius_pow, so the two agree on an index of prime field order. Its action on the simple root subgroups is primeFrobenius_simpleRootSubgroup.

        Equations
        Instances For

          The Steinberg endomorphism of an ordinary or graph-twisted index: the q-power Frobenius on the nine untwisted families, and the graph automorphism of the family composed with it on ²Aₙ(q), ²Dₙ(q), ²E₆(q) and ³D₄(q). On each constructor it is the Steinberg endomorphism of the family, by steinberg_A and its siblings; its action on the simple root subgroups is steinberg_simpleRootSubgroup.

          Equations
          Instances For

            The branch equations #

            On each of the thirteen constructors the Steinberg endomorphism, the simple root subgroups and the Frobenius are those of the family API the constructor belongs to.

            On Aₙ(q) the Steinberg endomorphism is that of the family.

            On Aₙ(q) the simple root subgroups are those of the family.

            On Aₙ(q) the Frobenius is that of the family.

            On ²Aₙ(q) the Steinberg endomorphism is that of the family.

            On Bₙ(q) the Steinberg endomorphism is that of the family.

            On Bₙ(q) the Frobenius is that of the family.

            On Cₙ(q) the Steinberg endomorphism is that of the family.

            On Cₙ(q) the Frobenius is that of the family.

            On Dₙ(q) the Steinberg endomorphism is that of the family.

            On Dₙ(q) the simple root subgroups are those of the family.

            On Dₙ(q) the Frobenius is that of the family.

            On ²Dₙ(q) the Steinberg endomorphism is that of the family.

            On E₆(q) the Steinberg endomorphism is that of the family.

            On E₆(q) the Frobenius is the Steinberg endomorphism of the family, that family being untwisted.

            On E₇(q) the Steinberg endomorphism is that of the family.

            On E₇(q) the Frobenius is the Steinberg endomorphism of the family, that family being untwisted.

            On E₈(q) the Steinberg endomorphism is that of the family.

            On E₈(q) the Frobenius is the Steinberg endomorphism of the family, that family being untwisted.

            On F₄(q) the Steinberg endomorphism is that of the family.

            On F₄(q) the Frobenius is the Steinberg endomorphism of the family, that family being untwisted.

            On G₂(q) the Steinberg endomorphism is that of the family.

            On G₂(q) the Frobenius is the Steinberg endomorphism of the family, that family being untwisted.

            On Aₙ(q) the prime-field Frobenius is that of the family.

            On Bₙ(q) the prime-field Frobenius is that of the family.

            On Cₙ(q) the prime-field Frobenius is that of the family.

            On Dₙ(q) the prime-field Frobenius is that of the family.

            On E₈(q) the prime-field Frobenius is that of the Geck carrier family.

            On F₄(q) the prime-field Frobenius is that of the Geck carrier family.

            On G₂(q) the prime-field Frobenius is that of the Geck carrier family.

            The pinned equations #

            @[simp]

            The Frobenius has the pinned action on every simple root subgroup. It sends x_i(u) to x_i(u ^ q), where q is the field order the index records. This is the defining equation of the q-power Frobenius, now stated once for all thirteen families.

            @[simp]

            The prime-field Frobenius has the pinned action on every simple root subgroup. It sends x_i(u) to x_i(u ^ p), where p is the defining characteristic. This is the defining equation of the prime-field Frobenius, stated once for all thirteen families.

            The q-power Frobenius is the e-th power of the prime-field Frobenius, for e the field exponent the index records, stated once for all thirteen families. On an index of prime field order the exponent is one and the two maps agree.

            @[simp]

            The Steinberg endomorphism has the pinned action on every simple root subgroup. It sends x_i(u) to x_{σ i}(u ^ q), where σ is the diagram permutation of the index, the identity on the nine untwisted families, and q is its recorded field order. This is the defining equation of an ordinary or graph-twisted Steinberg endomorphism, now stated once for all thirteen families.

            On an untwisted index the Steinberg endomorphism is the Frobenius. The hypothesis d.twistOrder = 1 picks out the nine untwisted families, on which the diagram permutation is trivial; on the four graph-twisted families the two maps differ by the graph automorphism, the family relations TauCeti.TypeALieIndex.steinberg_eq_graphAut_comp_frobenius, TauCeti.TypeTwistedDLieIndex.steinberg_def, TauCeti.TypeTwistedE6LieIndex.steinberg_def and TauCeti.TypeTrialityD4LieIndex.steinberg_def.

            The graph automorphism factor #

            The Steinberg endomorphism assembled above factors as γ ∘ Frob_q, and its Frobenius factor is frobenius. This section assembles the remaining factor, the automorphism γ of the ambient group realizing the diagram permutation the index carries, together with the three equations that make it that factor rather than an unrelated automorphism.

            The graph automorphism of an ordinary or graph-twisted index: the automorphism of the ambient group realizing the diagram permutation TauCeti.GraphTwistedIndex.diagramPerm the index carries. On the four graph-twisted constructors it is the graph automorphism of the family, by graphAut_twistedA and its siblings; on the nine untwisted constructors, whose diagram permutation is trivial, it is the identity automorphism. Its action on the simple root subgroups is graphAut_simpleRootSubgroup, and it is the left-hand factor of the Steinberg endomorphism, by steinberg_eq_graphAut_comp_frobenius.

            Equations
            Instances For

              The branch equations of the graph automorphism #

              On each of the thirteen constructors the graph automorphism is that of the family the constructor belongs to, or the identity automorphism where the family API names none.

              On Aₙ(q) the graph automorphism is that of the type-A family, which is trivial there.

              On ²Aₙ(q) the graph automorphism is that of the type-A family, signed reverse inverse transpose.

              On Bₙ(q) the graph automorphism is the identity, the Bₙ diagram having no automorphism: its two root lengths are not exchanged by any permutation of the nodes preserving the Cartan matrix.

              On Cₙ(q) the graph automorphism is the identity, the Cₙ diagram having no automorphism.

              On Dₙ(q) the graph automorphism is the identity: the fork exchange of the Dₙ diagram is the twist of ²Dₙ(q), and the untwisted family does not use it.

              On ²Dₙ(q) the graph automorphism is that of the family, the fork exchange of the spin carrier.

              On E₆(q) the graph automorphism is the identity: the E₆ diagram symmetry is the twist of ²E₆(q), and the untwisted family does not use it.

              On E₇(q) the graph automorphism is the identity, the E₇ diagram having no automorphism.

              On E₈(q) the graph automorphism is the identity, the E₈ diagram having no automorphism.

              On F₄(q) the graph automorphism is the identity: the length-exchanging symmetry of the F₄ diagram is not a diagram automorphism, and this family is untwisted.

              On G₂(q) the graph automorphism is the identity: the length-exchanging symmetry of the G₂ diagram is not a diagram automorphism, and this family is untwisted.

              On ²E₆(q) the graph automorphism is that of the family, the exchange of the two minuscule summands of the doubled carrier.

              On ³D₄(q) the graph automorphism is that of the family, triality on the tripled carrier.

              The pinned equations of the graph automorphism #

              On an untwisted index the graph automorphism is the identity. The hypothesis d.twistOrder = 1 picks out the nine untwisted families, whose diagram permutation is trivial and whose Steinberg endomorphism is the Frobenius outright; on the four graph-twisted families the twist order is two or three.

              @[simp]

              The graph automorphism has the pinned action on every simple root subgroup. It sends x_i(u) to x_{σ i}(u), where σ is the diagram permutation of the index, the identity on the nine untwisted families. The parameter is carried across unchanged, with neither a field power nor a sign; on a general root the equation would acquire a sign forced by the Chevalley structure constants.

              The twist order of the index annihilates its graph automorphism, so γ = 1 on the nine untwisted families, γ ^ 2 = 1 on ²Aₙ(q), ²Dₙ(q) and ²E₆(q), and γ ^ 3 = 1 on ³D₄(q). This matches TauCeti.GraphTwistedIndex.diagramPerm_pow_twistOrder on the diagram permutation that γ realizes.

              The graph automorphism commutes with the Frobenius, as an identity of endomorphisms: γ ∘ Frob_q = Frob_q ∘ γ. This is what makes the order of composition immaterial in steinberg_eq_graphAut_comp_frobenius, and on the graph-twisted families it is the relation that lets a power of the Steinberg endomorphism be computed factor by factor.

              The Steinberg endomorphism is the graph automorphism composed with the Frobenius, uniformly in the thirteen ordinary and graph-twisted families. On the nine untwisted ones the graph factor is trivial and the composite is the Frobenius itself, which is TauCeti.GraphTwistedIndex.steinberg_eq_frobenius.

              The Steinberg endomorphism may equally be read with its Frobenius factor last, the two factors commuting.

              @[reducible, inline]

              The fixed subgroup of the Steinberg endomorphism of an ordinary or graph-twisted index.

              Equations
              Instances For
                @[reducible, inline]

                The finite-simple-group candidate attached to an ordinary or graph-twisted index: the derived subgroup of the fixed points of its Steinberg endomorphism, modulo the centre of that derived subgroup. On each constructor it is the candidate group of the family, the Steinberg endomorphisms agreeing by steinberg_A and its siblings. No finiteness or simplicity assertion is part of this definition, nor any identification of the carrier with the pinned simply connected group scheme of the diagram.

                Equations
                Instances For