Documentation

Atlas.Buildings.code.BNPair.SphericalCase

theorem closure_simple_eq_pair {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (s : B_idx) :

The cyclic subgroup generated by a simple reflection $s$ has exactly two elements: $\langle s \rangle = \{1, s\}$, since $s^2 = 1$.

theorem longest_isRightDescent {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (w₀ : W) (hw₀_longest : ∀ (w : W), cs.length w cs.length w₀) (s : B_idx) :
cs.IsRightDescent w₀ s

Every simple reflection $s$ is a right descent of the longest element $w_0$: $\ell(w_0 s) < \ell(w_0)$. Otherwise $w_0 s$ would be longer than $w_0$, contradicting maximality.

theorem longest_length_mul_simple {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (w₀ : W) (hw₀_longest : ∀ (w : W), cs.length w cs.length w₀) (s : B_idx) :
cs.length (w₀ * cs.simple s) = cs.length w₀ - 1

Right-multiplying the longest element $w_0$ by any simple reflection $s$ decreases length by exactly one: $\ell(w_0 s) = \ell(w_0) - 1$.

theorem longest_isLeftDescent {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (w₀ : W) (hw₀_longest : ∀ (w : W), cs.length w cs.length w₀) (s : B_idx) :
cs.IsLeftDescent w₀ s

Every simple reflection $s$ is a left descent of $w_0$: $\ell(sw_0) < \ell(w_0)$.

theorem longest_length_simple_mul {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (w₀ : W) (hw₀_longest : ∀ (w : W), cs.length w cs.length w₀) (s : B_idx) :
cs.length (cs.simple s * w₀) = cs.length w₀ - 1

Left-multiplying $w_0$ by any simple reflection $s$ decreases length by one: $\ell(s w_0) = \ell(w_0) - 1$.

theorem longest_sq_eq_one {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (w₀ : W) (hw₀_longest : ∀ (w : W), cs.length w cs.length w₀) (hw₀_unique : ∀ (w : W), (∀ (v : W), cs.length v cs.length w)w = w₀) :
w₀ ^ 2 = 1

The longest element is an involution: $w_0^2 = 1$. Since $\ell(w_0^{-1}) = \ell(w_0)$, $w_0^{-1}$ is also a maximal-length element, and uniqueness forces $w_0^{-1} = w_0$.

theorem conj_simple_from_parabolic {B_idx : Type u_1} {W : Type u_2} [Group W] {M : CoxeterMatrix B_idx} (cs : CoxeterSystem M W) (w₀ : W) (h_parabolic : ∀ (s : B_idx), ∃ (s' : B_idx), Subgroup.closure {w₀ * cs.simple s * w₀⁻¹} = Subgroup.closure {cs.simple s'}) (s : B_idx) :
∃ (s' : B_idx), w₀ * cs.simple s * w₀⁻¹ = cs.simple s'

Type-preserving involution induced by $w_0$. If $w_0$ conjugates each cyclic parabolic $\langle s \rangle$ to another cyclic parabolic $\langle s' \rangle$, then in fact $w_0 \cdot s \cdot w_0^{-1} = s'$ on the nose (not just on the closures). Eliminates the "$=1$" case using $\ell(s) = 1$.

structure SphericalBNPair (G : Type u_1) [Group G] {B_idx : Type u_2} (M : CoxeterMatrix B_idx) extends BNPair G M :
Type (max u_1 u_2)

A spherical BN-pair: a BN-pair whose Weyl group $W$ is finite. Axiomatized by existence of a longest element $w_0$ (unique, of maximal length), the fact that $w_0$ conjugates each simple reflection to another simple reflection (an involution on $S$), and structural identities relating the torus, Borel and Levi components needed for the opposite-parabolic / Levi-decomposition theory of finite Coxeter / Tits systems.

Instances For
    def SphericalBNPair.longestElement {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :

    The longest element $w_0$ of a spherical Weyl group, exposed as a definition.

    Instances For
      theorem SphericalBNPair.w₀_sq {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
      sbp.w₀ ^ 2 = 1

      $w_0$ is an involution: $w_0^2 = 1$.

      theorem SphericalBNPair.w₀_conj_simple {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) (s : B_idx) :
      ∃ (s' : B_idx), sbp.w₀ * M.toCoxeterSystem.simple s * sbp.w₀⁻¹ = M.toCoxeterSystem.simple s'

      $w_0$ permutes the simple reflections by conjugation: for each $s$ there is $s'$ with $w_0 s w_0^{-1} = s'$.

      theorem SphericalBNPair.w₀_mul_self {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
      sbp.w₀ * sbp.w₀ = 1

      Restatement of w₀_sq in product form: $w_0 \cdot w_0 = 1$.

      theorem SphericalBNPair.w₀_inv_eq {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
      sbp.w₀⁻¹ = sbp.w₀

      $w_0^{-1} = w_0$, equivalent to $w_0^2 = 1$.

      def SphericalBNPair.conjugateSetBy {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} :
      SphericalBNPair G M(g : G) → (S : Set G) → Set G

      Conjugation of a subset $S \subseteq G$ by a single element $g$: $gSg^{-1}$.

      Instances For
        noncomputable def SphericalBNPair.conjugateByWeylElt {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) (w : M.Group) (S : Set G) :
        Set G

        Conjugation of $S \subseteq G$ by a chosen $N$-lift of a Weyl element $w$.

        Instances For
          noncomputable def SphericalBNPair.oppositeBorel {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
          Set G

          The opposite Borel $B^- = n_{w_0} B n_{w_0}^{-1}$, obtained by conjugating $B$ through a chosen $N$-lift of $w_0$.

          Instances For
            noncomputable def SphericalBNPair.oppositeParabolic {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) (T : Set B_idx) :
            Set G

            The opposite parabolic $P_T^- = n_{w_0} P_T n_{w_0}^{-1}$, for $T \subseteq S$.

            Instances For
              noncomputable def SphericalBNPair.leviComponent {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
              Set G

              The Levi component $L = B \cap B^-$ of the BN-pair, the intersection of $B$ with its opposite.

              Instances For
                noncomputable def SphericalBNPair.leviComponentGeneral {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) (T : Set B_idx) :
                Set G

                The Levi component of a parabolic $L_T = P_T \cap P_T^-$, generalizing leviComponent (which is the case $T = \emptyset$).

                Instances For
                  theorem SphericalBNPair.chosen_lift_w₀_spec {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
                  sbp.π .choose = sbp.w₀

                  Specification of the noncomputably chosen $N$-lift of $w_0$: its image under $\pi$ is $w_0$.

                  theorem SphericalBNPair.longestElementAutoS {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) (s : B_idx) :
                  ∃ (s' : B_idx), sbp.w₀ * M.toCoxeterSystem.simple s * sbp.w₀⁻¹ = M.toCoxeterSystem.simple s'

                  Alias for w₀_conj_simple emphasizing that $w_0$ induces an automorphism (a permutation) of the index set $S$ of simple reflections.

                  theorem SphericalBNPair.longestElementAutoSInvolution {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
                  (∀ (s : B_idx), ∃ (s' : B_idx), sbp.w₀ * M.toCoxeterSystem.simple s * sbp.w₀⁻¹ = M.toCoxeterSystem.simple s') ∀ (s s' : B_idx), sbp.w₀ * M.toCoxeterSystem.simple s * sbp.w₀⁻¹ = M.toCoxeterSystem.simple s'sbp.w₀ * M.toCoxeterSystem.simple s' * sbp.w₀⁻¹ = M.toCoxeterSystem.simple s

                  The $w_0$-induced permutation of $S$ is an involution. Conjugation by $w_0$ maps each simple reflection to another simple reflection, and this map is its own inverse: if $w_0 s w_0^{-1} = s'$ then $w_0 s' w_0^{-1} = s$. Direct consequence of $w_0^2 = 1$.

                  theorem SphericalBNPair.leviComponent_eq {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) :
                  sbp.leviComponent = sbp.B (fun (s : G) => .choose * s * (↑.choose)⁻¹) '' sbp.B

                  Unfolding equation for leviComponent: $L = B \cap n_{w_0} B n_{w_0}^{-1}$, made explicit at the level of choose for the noncomputable $N$-lift.

                  theorem SphericalBNPair.leviComponentGeneral_eq {G : Type u_1} [Group G] {B_idx : Type u_2} {M : CoxeterMatrix B_idx} (sbp : SphericalBNPair G M) (T : Set B_idx) :
                  sbp.leviComponentGeneral T = sbp.standardParabolic T (fun (s : G) => .choose * s * (↑.choose)⁻¹) '' sbp.standardParabolic T

                  Unfolding equation for leviComponentGeneral: $L_T = P_T \cap n_{w_0} P_T n_{w_0}^{-1}$.