LeanBridge Blueprint

8.3. Abstract groups🔗

This section lists the LMFDB definitions in the category group. Each definition links back to its LMFDB knowl. combin.hasse_diagram and commensurable.group also belong here, although their ids put them in another LMFDB category. It also lists the knowl about the LMFDB's data on this subject that has mathematical content, from the category portrait.

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

Hasse diagram. (LMFDB)

If (S, \leq) is a finite partially ordered set, then a Hasse diagram for S is a representation of S in the plane where

  • there is one node for each element of S

  • there is an edge connecting s_1 and s_2 if s_1 is maximal in \leq for \{s\in S \mid s < s_2\}, or vice versa

  • if s_1 is connected to s_2 by an edge and s_1 < s_2, then s_2 is higher in the plane in the sense of having a larger "y-coordinate"

Tau Ceti Review: CovBy.

Lean code for Definition8.3.1●3 declarations
  • defdefined in Mathlib/Combinatorics/SimpleGraph/Hasse.lean
    complete
    def SimpleGraph.hasse.{u_1} (α : Type u_1) [Preorder α] : SimpleGraph α
    def SimpleGraph.hasse.{u_1} (α : Type u_1)
      [Preorder α] : SimpleGraph α
    The Hasse diagram of an order as a simple graph. The graph of the covering relation. 
  • theoremdefined in Mathlib/Combinatorics/SimpleGraph/Hasse.lean
    complete
    theorem SimpleGraph.hasse_adj.{u_1} {α : Type u_1} [Preorder α] {a b : α} :
      (SimpleGraph.hasse α).Adj a b ↔ a ⋖ b ∨ b ⋖ a
    theorem SimpleGraph.hasse_adj.{u_1} {α : Type u_1}
      [Preorder α] {a b : α} :
      (SimpleGraph.hasse α).Adj a b ↔
        a ⋖ b ∨ b ⋖ a
  • defdefined in Mathlib/Order/Defs/PartialOrder.lean
    complete
    def CovBy.{u_2} {α : Type u_2} [LT α] (a b : α) : Prop
    def CovBy.{u_2} {α : Type u_2} [LT α]
      (a b : α) : Prop
    `CovBy a b` means that `b` covers `a`. This means that `a < b` and there is no element in
    between. This is denoted `a ⋖ b`. 
Definition8.3.2
uses 0used by 1✓L∃∀N

commensurable group. (LMFDB)

Two groups G and H are commensurable if their intersection G \cap H has finite index in G and in H.

Tau Ceti Review: Subgroup.Commensurable, Subgroup.IsFiniteRelIndex.

Lean code for Definition8.3.2●2 definitions
  • defdefined in Mathlib/GroupTheory/Commensurable.lean
    complete
    def Subgroup.Commensurable.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    def Subgroup.Commensurable.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    Two subgroups `H K` of `G` are commensurable if `H ⊓ K` has finite index in both `H` and `K`. 
  • class(1 method)defined in Mathlib/GroupTheory/Index.lean
    complete
    class Subgroup.IsFiniteRelIndex.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    class Subgroup.IsFiniteRelIndex.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    Typeclass for a subgroup `H` to have finite index in a subgroup `K`. 
    relIndex_ne_zero : H.relIndex K ≠ 0
Definition8.3.3
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 85
Reverse dependency previews
Preview
Definition 1.1.27
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Definition of group. (LMFDB)

A group \langle G, *\rangle is a set G with a binary operation * such that

  1. * is associative

  2. * has an identity element

  3. every element g\in G has an inverse.

Tau Ceti Review: Group.

Depends on: Definition 1.1.2 Definition 1.1.3 Definition 1.1.5 Definition 1.1.6

Lean code for Definition8.3.3●1 definition
  • class(extends 11, 16 methods)defined in Mathlib/Algebra/Group/Defs.lean
    complete
    class Group.{u_2} (G : Type u_2) : Type u_2
    class Group.{u_2} (G : Type u_2) : Type u_2
    A `Group` is a `Monoid` with an operation `⁻¹` satisfying `a⁻¹ * a = 1`.
    
    There is also a division operation `/` such that `a / b = a * b⁻¹`,
    with a default so that `a / b = a * b⁻¹` holds by definition.
    
    Use `Group.ofLeftAxioms` or `Group.ofRightAxioms` to define a group structure
    on a type with the minimum proof obligations.
    
    
    [Wikidata Q83478](https://www.wikidata.org/wiki/Q83478)
    • DivInvMonoid G
    one : G
    Inherited from
    1. DivInvMonoid
    2. Monoid
    3. One
    mul : G → G → G
    Inherited from
    1. DivInvMonoid
    2. Monoid
    3. Mul
    mul_assoc : ∀ (a b c : G), a * b * c = a * (b * c)
    Inherited from
    1. DivInvMonoid
    2. Monoid
    one_mul : ∀ (a : G), 1 * a = a
    Inherited from
    1. DivInvMonoid
    2. Monoid
    mul_one : ∀ (a : G), a * 1 = a
    Inherited from
    1. DivInvMonoid
    2. Monoid
    npow : ℕ → G → G
    Inherited from
    1. DivInvMonoid
    2. Monoid
    3. NPow
    npow_zero : ∀ (x : G), x ^ 0 = 1
    Inherited from
    1. DivInvMonoid
    2. Monoid
    npow_succ : ∀ (n : ℕ) (x : G), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. DivInvMonoid
    2. Monoid
    inv : G → G
    Inherited from
    1. DivInvMonoid
    2. Inv
    div : G → G → G
    Inherited from
    1. DivInvMonoid
    2. Div
    zpow : ℤ → G → G
    Inherited from
    1. DivInvMonoid
    2. ZPow
    div_eq_mul_inv : ∀ (a b : G), a / b = a * b⁻¹
    Inherited from
    1. DivInvMonoid
    zpow_zero' : ∀ (a : G), a ^ 0 = 1
    Inherited from
    1. DivInvMonoid
    zpow_succ' : ∀ (n : ℕ) (a : G), a ^ ↑n.succ = a ^ ↑n * a
    Inherited from
    1. DivInvMonoid
    zpow_neg' : ∀ (n : ℕ) (a : G), a ^ Int.negSucc n = (a ^ ↑n.succ)⁻¹
    Inherited from
    1. DivInvMonoid
    inv_mul_cancel : ∀ (a : G), a⁻¹ * a = 1
Definition8.3.4
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

A-group. (LMFDB)

An A-group is a group all of whose Sylow subgroups are abelian.

Every Z-group is an A-group, but the converse does not hold, as shown by these examples. Every solvable A-group is monomial.

Depends on: Definition 8.3.5 Definition 8.3.91 Definition 8.3.149 Definition 8.3.189

Lean code for Definition8.3.4●5 declarations
  • class(1 method)defined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AGroup.lean
    complete
    class IsAGroup.{u_1} (G : Type u_1) [Group G] : Prop
    class IsAGroup.{u_1} (G : Type u_1) [Group G] :
      Prop
    A group is an **A-group** (LMFDB `group.a_group`) if all of its Sylow subgroups are abelian. 
    isMulCommutative_sylow : ∀ (p : ℕ), Nat.Prime p → ∀ (P : Sylow p G), IsMulCommutative ↥↑P
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AGroup.lean
    complete
    theorem IsZGroup.isAGroup.{u_1} {G : Type u_1} [Group G] [IsZGroup G] :
      IsAGroup G
    theorem IsZGroup.isAGroup.{u_1} {G : Type u_1}
      [Group G] [IsZGroup G] : IsAGroup G
    Every Z-group is an A-group, since cyclic groups are abelian. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AGroupClosure.lean
    complete
    theorem IsKleinFour.isAGroup.{u_1} {G : Type u_1} [Group G] [IsKleinFour G] :
      IsAGroup G
    theorem IsKleinFour.isAGroup.{u_1} {G : Type u_1}
      [Group G] [IsKleinFour G] : IsAGroup G
    **The Klein four-group is an A-group** (LMFDB `group.a_group`), being abelian. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AGroupClosure.lean
    complete
    theorem not_forall_isZGroup_of_isAGroup :
      ¬∀ (G : Type) [inst : Group G] [Finite G], IsAGroup G → IsZGroup G
    theorem not_forall_isZGroup_of_isAGroup :
      ¬∀ (G : Type) [inst : Group G]
          [Finite G], IsAGroup G → IsZGroup G
    **Not every finite A-group is a Z-group** (LMFDB `group.a_group`): the Klein four-group, here
    the dihedral group `D₂` of order `4`, is an A-group but not a Z-group. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsMGroup.of_isSolvable_of_isAGroup {G : Type} [Group G] [Finite G]
      [Group.IsSolvable G] [IsAGroup G] : IsMGroup G
    theorem IsMGroup.of_isSolvable_of_isAGroup
      {G : Type} [Group G] [Finite G]
      [Group.IsSolvable G] [IsAGroup G] :
      IsMGroup G
    **Finite solvable A-groups are M-groups** (LMFDB `group.monomial`, `group.a_group`; Isaacs,
    6.23). 
Definition8.3.5
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 19
Reverse dependency previews
Preview
Definition 1.1.24
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Abelian group. (LMFDB)

A group is abelian if its operation is commutative.

Tau Ceti Review: CommGroup.

Depends on: Definition 1.1.2 Definition 1.1.4 Definition 8.3.3

Lean code for Definition8.3.5●1 definition
  • class(extends 15, 17 methods)defined in Mathlib/Algebra/Group/Defs.lean
    complete
    class CommGroup.{u_2} (G : Type u_2) : Type u_2
    class CommGroup.{u_2} (G : Type u_2) : Type u_2
    A commutative group is a group with commutative `(*)`. 
    
    [Wikidata Q181296](https://www.wikidata.org/wiki/Q181296)
    • Group G
    • CommMonoid G
    one : G
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    4. One
    mul : G → G → G
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    4. Mul
    mul_assoc : ∀ (a b c : G), a * b * c = a * (b * c)
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    one_mul : ∀ (a : G), 1 * a = a
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    mul_one : ∀ (a : G), a * 1 = a
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    npow : ℕ → G → G
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    4. NPow
    npow_zero : ∀ (x : G), x ^ 0 = 1
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    npow_succ : ∀ (n : ℕ) (x : G), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Monoid
    inv : G → G
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Inv
    div : G → G → G
    Inherited from
    1. Group
    2. DivInvMonoid
    3. Div
    zpow : ℤ → G → G
    Inherited from
    1. Group
    2. DivInvMonoid
    3. ZPow
    div_eq_mul_inv : ∀ (a b : G), a / b = a * b⁻¹
    Inherited from
    1. Group
    2. DivInvMonoid
    zpow_zero' : ∀ (a : G), a ^ 0 = 1
    Inherited from
    1. Group
    2. DivInvMonoid
    zpow_succ' : ∀ (n : ℕ) (a : G), a ^ ↑n.succ = a ^ ↑n * a
    Inherited from
    1. Group
    2. DivInvMonoid
    zpow_neg' : ∀ (n : ℕ) (a : G), a ^ Int.negSucc n = (a ^ ↑n.succ)⁻¹
    Inherited from
    1. Group
    2. DivInvMonoid
    inv_mul_cancel : ∀ (a : G), a⁻¹ * a = 1
    Inherited from
    1. Group
    mul_comm : ∀ (a b : G), a * b = b * a
    Multiplication is commutative in a commutative multiplicative magma. 
Definition8.3.6
uses 0used by 1✓L∃∀N

Abelian invariants. (LMFDB)

There are two canonical forms for an abelian group A:

  1. The Smith abelian invariants of A are the unique sequence of integers [m_1, \dots, m_k], all larger than 1, so that A \cong C_{m_1} \times \dots \times C_{m_k}, m_i \mid m_{i+1} for all i.

  2. The primary abelian invariants of A are the unique sequence of integers [q_1, \dots, q_k], all larger than 1, so that A \cong C_{q_1} \times \dots \times C_{q_k}, each q_i = p_i^{e_i} for a prime p_i and the q_i are sorted first by p_i and then in increasing order for fixed p_i.

Lean code for Definition8.3.6●5 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    def AddCommGroup.smithAbelianInvariants.{u_1} (G : Type u_1)
      [AddCommGroup G] [Finite G] : List ℕ
    def AddCommGroup.smithAbelianInvariants.{u_1}
      (G : Type u_1) [AddCommGroup G]
      [Finite G] : List ℕ
    The **Smith abelian invariants** of a finite abelian group `A` (LMFDB
    `group.abelian_invariants`), or its invariant factors: the unique list `[m₁, …, mₖ]` of integers
    larger than `1` such that `mᵢ ∣ mᵢ₊₁` for all `i` and `A ≃ C_{m₁} × ⋯ × C_{mₖ}`
    (`AddCommGroup.smithAbelianInvariants_eq_iff`). Here `C_m` is `ZMod m`; the invariants of a
    multiplicative group `G` are those of `Additive G`
    (`CommGroup.smithAbelianInvariants_additive_eq_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    theorem AddCommGroup.smithAbelianInvariants_eq_iff.{u_1} {G : Type u_1}
      [AddCommGroup G] {L : List ℕ} [Finite G] :
      AddCommGroup.smithAbelianInvariants G = L ↔
        (∀ m ∈ L, 1 < m) ∧
          List.IsChain (fun x1 x2 => x1 ∣ x2) L ∧
            Nonempty (G ≃+ ((i : Fin L.length) → ZMod L[i]))
    theorem AddCommGroup.smithAbelianInvariants_eq_iff.{u_1}
      {G : Type u_1} [AddCommGroup G]
      {L : List ℕ} [Finite G] :
      AddCommGroup.smithAbelianInvariants G =
          L ↔
        (∀ m ∈ L, 1 < m) ∧
          List.IsChain (fun x1 x2 => x1 ∣ x2)
              L ∧
            Nonempty
              (G ≃+
                ((i : Fin L.length) →
                  ZMod L[i]))
    **The Smith abelian invariants are the unique list of integers larger than `1`, each dividing
    the next, such that `A` is the product of the corresponding cyclic groups.** 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    def AddCommGroup.primaryAbelianInvariants.{u_1} (G : Type u_1)
      [AddCommGroup G] [Finite G] : List ℕ
    def AddCommGroup.primaryAbelianInvariants.{u_1}
      (G : Type u_1) [AddCommGroup G]
      [Finite G] : List ℕ
    The **primary abelian invariants** of a finite abelian group `A` (LMFDB
    `group.abelian_invariants`), or its elementary divisors: the unique list `[q₁, …, qₖ]` of prime
    powers `qᵢ = pᵢ ^ eᵢ`, sorted first by `pᵢ` and then increasingly for a fixed `pᵢ`, such that
    `A ≃ C_{q₁} × ⋯ × C_{qₖ}` (`AddCommGroup.primaryAbelianInvariants_eq_iff`). This is the primary
    decomposition of `A` (LMFDB `group.primary_decomposition`) written in the LMFDB order. Here `C_q`
    is `ZMod q`, the prime `pᵢ` is `Nat.minFac qᵢ`, and the invariants of a multiplicative group `G`
    are those of `Additive G` (`CommGroup.primaryAbelianInvariants_additive_eq_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    theorem AddCommGroup.primaryAbelianInvariants_eq_iff.{u_1} {G : Type u_1}
      [AddCommGroup G] {L : List ℕ} [Finite G] :
      AddCommGroup.primaryAbelianInvariants G = L ↔
        (∀ q ∈ L, IsPrimePow q) ∧
          List.Pairwise
              (fun a b => toLex (a.minFac, a) ≤ toLex (b.minFac, b)) L ∧
            Nonempty (G ≃+ ((i : Fin L.length) → ZMod L[i]))
    theorem AddCommGroup.primaryAbelianInvariants_eq_iff.{u_1}
      {G : Type u_1} [AddCommGroup G]
      {L : List ℕ} [Finite G] :
      AddCommGroup.primaryAbelianInvariants
            G =
          L ↔
        (∀ q ∈ L, IsPrimePow q) ∧
          List.Pairwise
              (fun a b =>
                toLex (a.minFac, a) ≤
                  toLex (b.minFac, b))
              L ∧
            Nonempty
              (G ≃+
                ((i : Fin L.length) →
                  ZMod L[i]))
    **The primary abelian invariants are the unique list of prime powers, sorted first by the prime
    and then by size, such that `A` is the product of the corresponding cyclic groups.** 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    theorem CommGroup.smithAbelianInvariants_additive_eq_iff.{u_1} {G : Type u_1}
      [CommGroup G] {L : List ℕ} [Finite G] :
      AddCommGroup.smithAbelianInvariants (Additive G) = L ↔
        (∀ m ∈ L, 1 < m) ∧
          List.IsChain (fun x1 x2 => x1 ∣ x2) L ∧
            Nonempty
              (G ≃* ((i : Fin L.length) → Multiplicative (ZMod L[i])))
    theorem CommGroup.smithAbelianInvariants_additive_eq_iff.{u_1}
      {G : Type u_1} [CommGroup G]
      {L : List ℕ} [Finite G] :
      AddCommGroup.smithAbelianInvariants
            (Additive G) =
          L ↔
        (∀ m ∈ L, 1 < m) ∧
          List.IsChain (fun x1 x2 => x1 ∣ x2)
              L ∧
            Nonempty
              (G ≃*
                ((i : Fin L.length) →
                  Multiplicative (ZMod L[i])))
    **The Smith abelian invariants of a multiplicative group `G`**, those of `Additive G`, are the
    unique list of integers larger than `1`, each dividing the next, such that `G` is the product of
    the corresponding multiplicative cyclic groups. 
Definition8.3.7
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Abelianization. (LMFDB)

The abelianization of a group G is G/G', the quotient by its commutator subgroup. The abelianization of G is the largest abelian quotient of G in the sense that any homomorphism G\to A where A is an abelian group factors as a composition of homomorphisms G\to G/G'\to A.

Depends on: Definition 8.3.5 Definition 8.3.28 Definition 8.3.118

Lean code for Definition8.3.7●2 definitions
  • defdefined in Mathlib/GroupTheory/Abelianization/Defs.lean
    complete
    def Abelianization.{u} (G : Type u) [Group G] : Type u
    def Abelianization.{u} (G : Type u)
      [Group G] : Type u
    The abelianization of G is the quotient of G by its commutator subgroup. 
  • defdefined in Mathlib/GroupTheory/Abelianization/Defs.lean
    complete
    def Abelianization.lift.{u, v} {G : Type u} [Group G] {A : Type v} [Group A]
      [IsMulCommutative A] : (G →* A) ≃ (Abelianization G →* A)
    def Abelianization.lift.{u, v} {G : Type u}
      [Group G] {A : Type v} [Group A]
      [IsMulCommutative A] :
      (G →* A) ≃ (Abelianization G →* A)
    If `f : G → A` is a group homomorphism to an abelian group, then `lift f` is the unique map
    from the abelianization of a `G` to `A` that factors through `f`. 
Definition8.3.8
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Group action. (LMFDB)

A (left) group action of a group G on a set A is a function \cdot : G\times A \to A such that <ul> <li> for all a\in A, e\cdot a = a where e is the identity element of G <li> for all g,h\in G and all a\in A, g\cdot (h\cdot a) = (gh)\cdot a. </ul>

The action is transitive if for all a,b\in A, there exists g\in G such that g\cdot a = b.

Tau Ceti Review: MulAction, MulAction.IsPretransitive.

Depends on: Definition 1.1.5 Definition 8.3.3

Lean code for Definition8.3.8●2 definitions
  • class(extends 2, 3 methods)defined in Mathlib/Algebra/Group/Action/Defs.lean
    complete
    class MulAction.{u_9, u_10} (α : Type u_9) (β : Type u_10) [Monoid α] :
      Type (max u_10 u_9)
    class MulAction.{u_9, u_10} (α : Type u_9)
      (β : Type u_10) [Monoid α] :
      Type (max u_10 u_9)
    Type class for monoid actions on types, with notation `g • p`.
    
    The `MulAction G P` typeclass says that the monoid `G` acts multiplicatively on a type `P`.
    More precisely this means that the action satisfies the two axioms `1 • p = p` and
    `(g₁ * g₂) • p = g₁ • (g₂ • p)`. A mathematician might simply say that the monoid `G`
    acts on `P`.
    
    For example, if `G` is a group and `X` is a type, if a mathematician says
    say "let `G` act on the set `X`" they will probably mean `[MulAction G X]`.
    
    
    [Wikidata Q288465](https://www.wikidata.org/wiki/Q288465)
    • SemigroupAction α β
    smul : α → β → β
    Inherited from
    1. SemigroupAction
    2. SMul
    mul_smul : ∀ (x y : α) (b : β), (x * y) • b = x • y • b
    Inherited from
    1. SemigroupAction
    one_smul : ∀ (b : β), 1 • b = b
    One is the neutral element for `•` 
  • class(1 method)defined in Mathlib/Algebra/Group/Action/Pretransitive.lean
    complete
    class MulAction.IsPretransitive.{u_5, u_6} (M : Type u_5) (α : Type u_6)
      [SMul M α] : Prop
    class MulAction.IsPretransitive.{u_5, u_6}
      (M : Type u_5) (α : Type u_6)
      [SMul M α] : Prop
    `M` acts pretransitively on `α` if for any `x y` there is `g` such that `g • x = y`.
    A transitive action should furthermore have `α` nonempty. 
    exists_smul_eq : ∀ (x y : α), ∃ g, g • x = y
    There is `g` such that `g • x = y`. 
Definition8.3.9
uses 1
Used by 4
Reverse dependency previews
Preview
Definition 8.3.10
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Affine general linear group. (LMFDB)

The general linear group \GL(n,q) acts on the vector space \F_q^n by matrix multiplication. The affine general linear group is the group \AGL(n,q) = \F_q^n \rtimes \GL(n,q). It is the group of all invertible affine transformations of \F_q^n.

Tau Ceti Review: AffineEquiv.group, GaloisField.

Depends on: Definition 8.3.58

Lean code for Definition8.3.9●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGeneralLinear.lean
    complete
    def Matrix.GeneralLinearGroup.mulVecMulAut.{u_1, u_2} (ι : Type u_1)
      (R : Type u_2) [Fintype ι] [DecidableEq ι] [CommRing R] :
      GL ι R →* MulAut (Multiplicative (ι → R))
    def Matrix.GeneralLinearGroup.mulVecMulAut.{u_1,
        u_2}
      (ι : Type u_1) (R : Type u_2)
      [Fintype ι] [DecidableEq ι]
      [CommRing R] :
      GL ι R →*
        MulAut (Multiplicative (ι → R))
    The **action of `GL(ι, R)` on `R^ι` by matrix multiplication** (LMFDB
    `group.affine_general_linear`), `v ↦ A *ᵥ v`, by automorphisms of the additive group `R^ι`, written
    multiplicatively. 
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGeneralLinear.lean
    complete
    abbrev Matrix.AffineGeneralLinearGroup.{u_1, u_2} (ι : Type u_1) (R : Type u_2)
      [Fintype ι] [DecidableEq ι] [CommRing R] :
      Type (max (max u_2 u_1) u_1 u_2)
    abbrev Matrix.AffineGeneralLinearGroup.{u_1, u_2}
      (ι : Type u_1) (R : Type u_2)
      [Fintype ι] [DecidableEq ι]
      [CommRing R] :
      Type (max (max u_2 u_1) u_1 u_2)
    The **affine general linear group** `AGL(ι, R) = R^ι ⋊ GL(ι, R)` (LMFDB
    `group.affine_general_linear`), for the action of `GL(ι, R)` on `R^ι` by matrix multiplication;
    for `R = GaloisField p r` with `r ≠ 0` and `ι = Fin n` it is `AGL(n, q)` with `q = p ^ r`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGeneralLinear.lean
    complete
    def Matrix.AffineGeneralLinearGroup.mulEquivAffineEquiv.{u_1, u_2}
      (ι : Type u_1) (R : Type u_2) [Fintype ι] [DecidableEq ι]
      [CommRing R] :
      Matrix.AffineGeneralLinearGroup ι R ≃* ((ι → R) ≃ᵃ[R] ι → R)
    def Matrix.AffineGeneralLinearGroup.mulEquivAffineEquiv.{u_1,
        u_2}
      (ι : Type u_1) (R : Type u_2)
      [Fintype ι] [DecidableEq ι]
      [CommRing R] :
      Matrix.AffineGeneralLinearGroup ι R ≃*
        ((ι → R) ≃ᵃ[R] ι → R)
    **`AGL(ι, R) = R^ι ⋊ GL(ι, R)` is the group of invertible affine transformations of `R^ι`**
    (LMFDB `group.affine_general_linear`): the isomorphism sending `(v, A)` to `x ↦ A x + v`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGeneralLinear.lean
    complete
    theorem Matrix.AffineGeneralLinearGroup.mulEquivAffineEquiv_apply.{u_1, u_2}
      (ι : Type u_1) (R : Type u_2) [Fintype ι] [DecidableEq ι] [CommRing R]
      (g : Matrix.AffineGeneralLinearGroup ι R) (x : ι → R) :
      ((Matrix.AffineGeneralLinearGroup.mulEquivAffineEquiv ι R) g) x =
        (↑g.right).mulVec x + Multiplicative.toAdd g.left
    theorem Matrix.AffineGeneralLinearGroup.mulEquivAffineEquiv_apply.{u_1,
        u_2}
      (ι : Type u_1) (R : Type u_2)
      [Fintype ι] [DecidableEq ι] [CommRing R]
      (g :
        Matrix.AffineGeneralLinearGroup ι R)
      (x : ι → R) :
      ((Matrix.AffineGeneralLinearGroup.mulEquivAffineEquiv
              ι R)
            g)
          x =
        (↑g.right).mulVec x +
          Multiplicative.toAdd g.left
  • defdefined in Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean
    complete
    def AffineEquiv.group.{u_1, u_2, u_6} {k : Type u_1} {P₁ : Type u_2}
      {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁]
      [AddTorsor V₁ P₁] : Group (P₁ ≃ᵃ[k] P₁)
    def AffineEquiv.group.{u_1, u_2, u_6}
      {k : Type u_1} {P₁ : Type u_2}
      {V₁ : Type u_6} [Ring k]
      [AddCommGroup V₁] [Module k V₁]
      [AddTorsor V₁ P₁] : Group (P₁ ≃ᵃ[k] P₁)
  • defdefined in Mathlib/FieldTheory/Finite/GaloisField.lean
    complete
    def GaloisField (p : ℕ) [Fact (Nat.Prime p)] (n : ℕ) : Type
    def GaloisField (p : ℕ) [Fact (Nat.Prime p)]
      (n : ℕ) : Type
    A finite field with `p ^ n` elements.
    Every field with the same cardinality is (non-canonically)
    isomorphic to this field. 
Definition8.3.10
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Affine linear group twisted by automorphisms. (LMFDB)

The group \AGammaL(n,q) is the semi-direct product of \AGL(n,q), the affine general linear group, with the group A of field automorphisms of \F_q/\F_p.

Similarly, the group \ASigmaL(n,q) is the semi-direct product of \ASL(n,q), the affine special linear group, with A.

Depends on: Definition 8.3.9 Definition 8.3.11

Lean code for Definition8.3.10●5 declarations
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineSemilinear.lean
    complete
    abbrev AffineEquiv.AffineGeneralSemilinearGroup.{u_3, u_4, u_5} (ι : Type u_3)
      (K : Type u_4) (F : Type u_5) [CommSemiring K] [CommRing F]
      [Algebra K F] : Type (max u_3 u_5)
    abbrev AffineEquiv.AffineGeneralSemilinearGroup.{u_3,
        u_4, u_5}
      (ι : Type u_3) (K : Type u_4)
      (F : Type u_5) [CommSemiring K]
      [CommRing F] [Algebra K F] :
      Type (max u_3 u_5)
    The **affine general semilinear group** `AΓL(F^ι) = AGL(F^ι) ⋊ Aut(F/K)` (LMFDB
    `group.affine_linear_automorphism`): the semidirect product of the affine general linear group of
    affine automorphisms of `ι → F` with the automorphisms of `F` over `K`, acting by conjugation with
    their coordinatewise action. The knowl leaves the action implicit; this is the standard one, for
    which `(f, σ)` stands for the affine semilinear map `x ↦ f (σ x)`. For `ι = Fin n`, `K = ZMod p`
    and `F = GaloisField p r` with `r ≠ 0`, it is `AΓL(n, q)` with `q = p ^ r`. 
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineSemilinear.lean
    complete
    abbrev AffineEquiv.AffineSpecialSemilinearGroup.{u_3, u_4, u_5} (ι : Type u_3)
      (K : Type u_4) (F : Type u_5) [CommSemiring K] [CommRing F]
      [Algebra K F] [Fintype ι] [DecidableEq ι] : Type (max u_3 u_5)
    abbrev AffineEquiv.AffineSpecialSemilinearGroup.{u_3,
        u_4, u_5}
      (ι : Type u_3) (K : Type u_4)
      (F : Type u_5) [CommSemiring K]
      [CommRing F] [Algebra K F] [Fintype ι]
      [DecidableEq ι] : Type (max u_3 u_5)
    The **affine special semilinear group** `AΣL(F^ι) = ASL(F^ι) ⋊ Aut(F/K)` (LMFDB
    `group.affine_linear_automorphism`): the semidirect product of the affine special linear group of
    `ι → F` with the automorphisms of `F` over `K`, acting by conjugation with their coordinatewise
    action, which preserves it. For `ι = Fin n`, `K = ZMod p` and `F = GaloisField p r` with `r ≠ 0`,
    it is `AΣL(n, q)` with `q = p ^ r`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineSemilinear.lean
    complete
    def AffineEquiv.conjAlgEquivHom.{u_3, u_4, u_5} (ι : Type u_3)
      (K : Type u_4) (F : Type u_5) [CommSemiring K] [CommRing F]
      [Algebra K F] : (F ≃ₐ[K] F) →* MulAut ((ι → F) ≃ᵃ[F] ι → F)
    def AffineEquiv.conjAlgEquivHom.{u_3, u_4,
        u_5}
      (ι : Type u_3) (K : Type u_4)
      (F : Type u_5) [CommSemiring K]
      [CommRing F] [Algebra K F] :
      (F ≃ₐ[K] F) →*
        MulAut ((ι → F) ≃ᵃ[F] ι → F)
    The action of the automorphisms of `F` over `K` on the affine group of `ι → F`, by conjugation
    with their coordinatewise action. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineSemilinear.lean
    complete
    theorem AffineEquiv.conjAlgEquiv_apply_eq_mulVec_add.{u_3, u_4, u_5}
      {ι : Type u_3} {K : Type u_4} {F : Type u_5} [CommSemiring K]
      [CommRing F] [Algebra K F] (σ : F ≃ₐ[K] F) (f : (ι → F) ≃ᵃ[F] ι → F)
      (x : ι → F) [Fintype ι] [DecidableEq ι] :
      (AffineEquiv.conjAlgEquiv σ f) x =
        ((LinearMap.toMatrix' ↑f.linear).map ⇑σ).mulVec x + fun j =>
          σ (f 0 j)
    theorem AffineEquiv.conjAlgEquiv_apply_eq_mulVec_add.{u_3,
        u_4, u_5}
      {ι : Type u_3} {K : Type u_4}
      {F : Type u_5} [CommSemiring K]
      [CommRing F] [Algebra K F]
      (σ : F ≃ₐ[K] F)
      (f : (ι → F) ≃ᵃ[F] ι → F) (x : ι → F)
      [Fintype ι] [DecidableEq ι] :
      (AffineEquiv.conjAlgEquiv σ f) x =
        ((LinearMap.toMatrix' ↑f.linear).map
                ⇑σ).mulVec
            x +
          fun j => σ (f 0 j)
    **The conjugate of `x ↦ M x + v` by `σ` is `x ↦ σ(M) x + σ(v)`**, with `σ` applied to the
    entries of `M` and `v`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineSemilinear.lean
    complete
    theorem AffineEquiv.conjAlgEquiv_mem_affineSpecialLinearGroup.{u_3, u_4, u_5}
      {ι : Type u_3} {K : Type u_4} {F : Type u_5} [CommSemiring K]
      [CommRing F] [Algebra K F] (σ : F ≃ₐ[K] F) {f : (ι → F) ≃ᵃ[F] ι → F}
      [Fintype ι] [DecidableEq ι]
      (hf : f ∈ AffineEquiv.affineSpecialLinearGroup F (ι → F)) :
      AffineEquiv.conjAlgEquiv σ f ∈
        AffineEquiv.affineSpecialLinearGroup F (ι → F)
    theorem AffineEquiv.conjAlgEquiv_mem_affineSpecialLinearGroup.{u_3,
        u_4, u_5}
      {ι : Type u_3} {K : Type u_4}
      {F : Type u_5} [CommSemiring K]
      [CommRing F] [Algebra K F]
      (σ : F ≃ₐ[K] F)
      {f : (ι → F) ≃ᵃ[F] ι → F} [Fintype ι]
      [DecidableEq ι]
      (hf :
        f ∈
          AffineEquiv.affineSpecialLinearGroup
            F (ι → F)) :
      AffineEquiv.conjAlgEquiv σ f ∈
        AffineEquiv.affineSpecialLinearGroup F
          (ι → F)
    **The action of `Aut(F/K)` on `AGL(F^ι)` preserves `ASL(F^ι)`**: `det σ(M) = σ(det M)`. 
Definition8.3.11
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.10
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Affine special linear group. (LMFDB)

The affine special linear group \ASL(n,q) is the subgroup of the affine general linear group \AGL(n,q) = \F_q^n \rtimes \GL(n,q) of all affine transformations x \mapsto Mx + v such that \det(M)=1. It is the affine analogue of the special linear group.

Tau Ceti Review: AffineEquiv.group, AffineEquiv.linearHom.

Depends on: Definition 8.3.9 Definition 8.3.155

Lean code for Definition8.3.11●5 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGroup.lean
    complete
    def AffineEquiv.affineSpecialLinearGroup.{u_3, u_4} (R : Type u_3)
      (V : Type u_4) [CommRing R] [AddCommGroup V] [Module R V] :
      Subgroup (V ≃ᵃ[R] V)
    def AffineEquiv.affineSpecialLinearGroup.{u_3,
        u_4}
      (R : Type u_3) (V : Type u_4)
      [CommRing R] [AddCommGroup V]
      [Module R V] : Subgroup (V ≃ᵃ[R] V)
    The **affine special linear group** `ASL(V)` (LMFDB `group.affine_special_linear`) of a module
    `V` over a commutative ring `R`: the subgroup of the affine general linear group `AGL(V)` of the
    affine automorphisms `x ↦ M x + v` of `V` whose linear part `M` has determinant `1`, the kernel of
    the determinant of the linear part. For `R = GaloisField p r` with `r ≠ 0` and `V = Fin n → R`, it
    is `ASL(n, q)` with `q = p ^ r`. Mathlib's determinant `LinearMap.det` is `1` on a module without a
    finite basis, so there `ASL(V)` is all of `AGL(V)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGroup.lean
    complete
    theorem AffineEquiv.mem_affineSpecialLinearGroup_iff_det.{u_1, u_3}
      {ι : Type u_1} {R : Type u_3} [Fintype ι] [DecidableEq ι] [CommRing R]
      {f : (ι → R) ≃ᵃ[R] ι → R} :
      f ∈ AffineEquiv.affineSpecialLinearGroup R (ι → R) ↔
        (LinearMap.toMatrix' ↑f.linear).det = 1
    theorem AffineEquiv.mem_affineSpecialLinearGroup_iff_det.{u_1,
        u_3}
      {ι : Type u_1} {R : Type u_3}
      [Fintype ι] [DecidableEq ι] [CommRing R]
      {f : (ι → R) ≃ᵃ[R] ι → R} :
      f ∈
          AffineEquiv.affineSpecialLinearGroup
            R (ι → R) ↔
        (LinearMap.toMatrix' ↑f.linear).det =
          1
    **The automorphism `x ↦ M x + v` of `R^ι` lies in `ASL` if and only if `det M = 1`** (LMFDB
    `group.affine_special_linear`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGroup.lean
    complete
    theorem AffineEquiv.apply_eq_mulVec_add.{u_1, u_3} {ι : Type u_1} {R : Type u_3}
      [Fintype ι] [DecidableEq ι] [CommRing R] (f : (ι → R) ≃ᵃ[R] ι → R)
      (x : ι → R) : f x = (LinearMap.toMatrix' ↑f.linear).mulVec x + f 0
    theorem AffineEquiv.apply_eq_mulVec_add.{u_1, u_3}
      {ι : Type u_1} {R : Type u_3}
      [Fintype ι] [DecidableEq ι] [CommRing R]
      (f : (ι → R) ≃ᵃ[R] ι → R) (x : ι → R) :
      f x =
        (LinearMap.toMatrix' ↑f.linear).mulVec
            x +
          f 0
    **An affine automorphism of `R^ι` is `x ↦ M x + v`**, with `M` the matrix of its linear part
    and `v` the image of `0`. 
  • defdefined in Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean
    complete
    def AffineEquiv.group.{u_1, u_2, u_6} {k : Type u_1} {P₁ : Type u_2}
      {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁]
      [AddTorsor V₁ P₁] : Group (P₁ ≃ᵃ[k] P₁)
    def AffineEquiv.group.{u_1, u_2, u_6}
      {k : Type u_1} {P₁ : Type u_2}
      {V₁ : Type u_6} [Ring k]
      [AddCommGroup V₁] [Module k V₁]
      [AddTorsor V₁ P₁] : Group (P₁ ≃ᵃ[k] P₁)
  • defdefined in Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean
    complete
    def AffineEquiv.linearHom.{u_1, u_2, u_6} {k : Type u_1} {P₁ : Type u_2}
      {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁]
      [AddTorsor V₁ P₁] : (P₁ ≃ᵃ[k] P₁) →* V₁ ≃ₗ[k] V₁
    def AffineEquiv.linearHom.{u_1, u_2, u_6}
      {k : Type u_1} {P₁ : Type u_2}
      {V₁ : Type u_6} [Ring k]
      [AddCommGroup V₁] [Module k V₁]
      [AddTorsor V₁ P₁] :
      (P₁ ≃ᵃ[k] P₁) →* V₁ ≃ₗ[k] V₁
    `AffineEquiv.linear` on automorphisms is a `MonoidHom`. 
Definition8.3.12
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Affine symplectic group. (LMFDB)

The affine symplectic group \ASp(n,q) is the subgroup of the affine general linear group \AGL(n,q) = \F_q^n \rtimes \GL(n,q) of all affine transformations x \mapsto Mx + v such that M is an element of the symplectic group \Sp(n,q).

Tau Ceti Review: Matrix.symplecticGroup, TauCeti.GLSymplectic.

Depends on: Definition 8.3.9 Definition 8.3.177

Lean code for Definition8.3.12●7 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGroup.lean
    complete
    def AffineEquiv.affineSymplecticGroup.{u_2, u_3} (l : Type u_2)
      (R : Type u_3) [Fintype l] [DecidableEq l] [CommRing R] :
      Subgroup ((l ⊕ l → R) ≃ᵃ[R] l ⊕ l → R)
    def AffineEquiv.affineSymplecticGroup.{u_2,
        u_3}
      (l : Type u_2) (R : Type u_3)
      [Fintype l] [DecidableEq l]
      [CommRing R] :
      Subgroup ((l ⊕ l → R) ≃ᵃ[R] l ⊕ l → R)
    The **affine symplectic group** `ASp(2m, R)` (LMFDB `group.affine_symplectic`) of
    `R^{2m} = R^{l ⊕ l}`, `m` the cardinality of `l`: the subgroup of the affine general linear group
    of the affine automorphisms `x ↦ M x + v` whose linear part `M` lies in the symplectic group
    `Sp(2m, R)` (Mathlib's `Matrix.symplecticGroup l R`, the matrices with `M J Mᵀ = J`, as Tau Ceti's
    subgroup `TauCeti.GLSymplectic l R` of `GL_{2m}(R)`). Mathlib's `J` is minus the LMFDB's example
    form `Ω`, and `M J Mᵀ = J` is equivalent to `Mᵀ J M = J`, so this is the LMFDB's condition
    `Mᵀ Ω M = Ω`. For `R = GaloisField p r` with `r ≠ 0` and `l = Fin m`, it is the LMFDB's
    `ASp(n, q)` with `n = 2m` and `q = p ^ r`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGroup.lean
    complete
    theorem AffineEquiv.mem_affineSymplecticGroup_iff.{u_2, u_3} {l : Type u_2}
      {R : Type u_3} [Fintype l] [DecidableEq l] [CommRing R]
      {g : (l ⊕ l → R) ≃ᵃ[R] l ⊕ l → R} :
      g ∈ AffineEquiv.affineSymplecticGroup l R ↔
        LinearMap.toMatrix' ↑g.linear ∈ Matrix.symplecticGroup l R
    theorem AffineEquiv.mem_affineSymplecticGroup_iff.{u_2,
        u_3}
      {l : Type u_2} {R : Type u_3}
      [Fintype l] [DecidableEq l] [CommRing R]
      {g : (l ⊕ l → R) ≃ᵃ[R] l ⊕ l → R} :
      g ∈
          AffineEquiv.affineSymplecticGroup l
            R ↔
        LinearMap.toMatrix' ↑g.linear ∈
          Matrix.symplecticGroup l R
    **The automorphism `x ↦ M x + v` of `R^{2m}` lies in `ASp(2m, R)` if and only if `M` lies in
    `Sp(2m, R)`** (LMFDB `group.affine_symplectic`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/AffineSpace/AffineGroup.lean
    complete
    def AffineEquiv.linearMatrixHom.{u_1, u_3} {ι : Type u_1} {R : Type u_3}
      [Fintype ι] [DecidableEq ι] [CommRing R] :
      ((ι → R) ≃ᵃ[R] ι → R) →* GL ι R
    def AffineEquiv.linearMatrixHom.{u_1, u_3}
      {ι : Type u_1} {R : Type u_3}
      [Fintype ι] [DecidableEq ι]
      [CommRing R] :
      ((ι → R) ≃ᵃ[R] ι → R) →* GL ι R
    The matrix of the linear part of an affine automorphism of `R^ι`, as a homomorphism
    `AGL(R^ι) → GL_ι(R)`. 
  • defdefined in Mathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.symplecticGroup.{u_1, u_2} (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R] [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    def Matrix.symplecticGroup.{u_1, u_2}
      (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R]
      [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    The group of symplectic matrices over a ring `R`. 
  • defdefined in TauCeti/LinearAlgebra/Matrix/GeneralLinearGroup/Symplectic/Basic.lean
    complete
    def TauCeti.GLSymplectic.{u, u_1} (l : Type u_1) [DecidableEq l] [Fintype l]
      (R : Type u) [CommRing R] : Subgroup (GL (l ⊕ l) R)
    def TauCeti.GLSymplectic.{u, u_1}
      (l : Type u_1) [DecidableEq l]
      [Fintype l] (R : Type u) [CommRing R] :
      Subgroup (GL (l ⊕ l) R)
    The **symplectic group** as a subgroup of `GL (l ⊕ l) R`: the invertible matrices whose
    underlying matrix satisfies `M J Mᵀ = J`. `TauCeti.GLSymplectic.mulEquivSymplecticGroup`
    identifies it with Mathlib's submonoid form `Matrix.symplecticGroup`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.isometryGroup.{u_1, u_4} {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {R : Type u_4} [CommRing R] (Ω : Matrix ι ι R) :
      Subgroup (GL ι R)
    def Matrix.isometryGroup.{u_1, u_4}
      {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {R : Type u_4}
      [CommRing R] (Ω : Matrix ι ι R) :
      Subgroup (GL ι R)
    The **isometry group** of a square matrix `Ω`: the invertible matrices `M` with
    `Mᵀ * Ω * M = Ω`, which preserve the bilinear form `(x, y) ↦ xᵀ Ω y`. For an invertible
    alternating `Ω` over a field it is the **symplectic group** `Sp(Ω)` (LMFDB `group.symplectic`),
    which up to conjugation in `GL` does not depend on `Ω`
    (`Matrix.exists_map_conj_isometryGroup_eq_of_isAlt`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.isometryGroupEquivSymplecticGroup.{u_1, u_3, u_4} {ι : Type u_1}
      {l : Type u_3} [Fintype ι] [DecidableEq ι] [Fintype l] [DecidableEq l]
      {F : Type u_4} [Field F] {Ω : Matrix ι ι F} (e : ι ≃ l ⊕ l)
      (hΩ : (Matrix.toBilin' Ω).IsAlt) (hΩu : IsUnit Ω) :
      ↥Ω.isometryGroup ≃* ↥(Matrix.symplecticGroup l F)
    def Matrix.isometryGroupEquivSymplecticGroup.{u_1,
        u_3, u_4}
      {ι : Type u_1} {l : Type u_3}
      [Fintype ι] [DecidableEq ι] [Fintype l]
      [DecidableEq l] {F : Type u_4} [Field F]
      {Ω : Matrix ι ι F} (e : ι ≃ l ⊕ l)
      (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω) :
      ↥Ω.isometryGroup ≃*
        ↥(Matrix.symplecticGroup l F)
    An isomorphism between the isometry group of an invertible alternating matrix and Mathlib's
    symplectic group `Matrix.symplecticGroup l F` (LMFDB `group.symplectic`), for an equivalence
    `e : ι ≃ l ⊕ l`: reindex along `e`, conjugate onto the isometry group of `J`
    (`Matrix.isometryGroupEquivOfIsAlt`), which is `TauCeti.GLSymplectic l F`, and apply Tau Ceti's
    `TauCeti.GLSymplectic.mulEquivSymplecticGroup`. 
Definition8.3.13
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.19
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.3.114
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Almost simple group. (LMFDB)

An almost simple group is a group G that lies between a non-abelian simple group S and its automorphism group Aut(S), i.e. S \subseteq G \subseteqAut(S).

Every non-abelian simple group is almost simple, but it is not implied by G being quasisimple, as shown by these examples.

Depends on: Definition 8.3.19 Definition 8.3.139

Lean code for Definition8.3.13●7 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AlmostSimple.lean
    complete
    def IsAlmostSimple.{u} (G : Type u) [Group G] : Prop
    def IsAlmostSimple.{u} (G : Type u)
      [Group G] : Prop
    A group `G` is **almost simple** (LMFDB `group.almost_simple`) if `S ≤ G ≤ Aut(S)` for a
    non-abelian simple group `S`: there is an embedding `G ↪ Aut(S)` whose image contains the inner
    automorphisms of `S`. The group `S` is taken in the universe of `G`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AlmostSimple.lean
    complete
    theorem IsSimpleGroup.isAlmostSimple.{u} {G : Type u} [Group G]
      [IsSimpleGroup G] (hG : ¬IsMulCommutative G) : IsAlmostSimple G
    theorem IsSimpleGroup.isAlmostSimple.{u}
      {G : Type u} [Group G] [IsSimpleGroup G]
      (hG : ¬IsMulCommutative G) :
      IsAlmostSimple G
    Every non-abelian simple group is almost simple, through its inner automorphisms. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem IsAlmostSimple.center_eq_bot.{u_1} {G : Type u_1} [Group G]
      (h : IsAlmostSimple G) : Subgroup.center G = ⊥
    theorem IsAlmostSimple.center_eq_bot.{u_1}
      {G : Type u_1} [Group G]
      (h : IsAlmostSimple G) :
      Subgroup.center G = ⊥
    **An almost simple group has trivial centre**: a central element acts on the simple group `S`
    by an automorphism commuting with all inner automorphisms, hence trivially, as `S` has trivial
    centre. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Matrix.SpecialLinearGroup.isQuasisimple_two_zmod_five :
      IsQuasisimple (Matrix.SpecialLinearGroup (Fin 2) (ZMod 5))
    theorem Matrix.SpecialLinearGroup.isQuasisimple_two_zmod_five :
      IsQuasisimple
        (Matrix.SpecialLinearGroup (Fin 2)
          (ZMod 5))
    **`SL(2, 5)` is quasisimple** (LMFDB `group.quasisimple`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Matrix.SpecialLinearGroup.not_isAlmostSimple_two_zmod_five :
      ¬IsAlmostSimple (Matrix.SpecialLinearGroup (Fin 2) (ZMod 5))
    theorem Matrix.SpecialLinearGroup.not_isAlmostSimple_two_zmod_five :
      ¬IsAlmostSimple
          (Matrix.SpecialLinearGroup (Fin 2)
            (ZMod 5))
    **`SL(2, 5)` is not almost simple** (LMFDB `group.quasisimple`): quasisimple groups need not
    be almost simple. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Equiv.Perm.isAlmostSimple_fin_five : IsAlmostSimple (Equiv.Perm (Fin 5))
    theorem Equiv.Perm.isAlmostSimple_fin_five :
      IsAlmostSimple (Equiv.Perm (Fin 5))
    **`S_5` is almost simple** (LMFDB `group.quasisimple`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Equiv.Perm.not_isQuasisimple_fin_five :
      ¬IsQuasisimple (Equiv.Perm (Fin 5))
    theorem Equiv.Perm.not_isQuasisimple_fin_five :
      ¬IsQuasisimple (Equiv.Perm (Fin 5))
    **`S_5` is not quasisimple** (LMFDB `group.quasisimple`): almost simple groups need not be
    quasisimple. 
Definition8.3.14
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.97
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.2.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Alternating group. (LMFDB)

The alternating group, denoted A_n is the subgroup of the symmetric group consisting of the *even* permutations. For n\ge2 it is of order \frac{n!}{2}, and is index 2 in S_n. The group is solvable for n\leq 4 and simple for n\geq 5.

Tau Ceti Review: alternatingGroup.

Depends on: Definition 8.3.97 Definition 8.3.139 Definition 8.3.149 Definition 8.3.160 Definition 8.3.166 Definition 8.3.176

Lean code for Definition8.3.14●1 definition
  • defdefined in Mathlib/GroupTheory/SpecificGroups/Alternating.lean
    complete
    def alternatingGroup.{u_1} (α : Type u_1) [Fintype α] [DecidableEq α] :
      Subgroup (Equiv.Perm α)
    def alternatingGroup.{u_1} (α : Type u_1)
      [Fintype α] [DecidableEq α] :
      Subgroup (Equiv.Perm α)
    The alternating group on a finite type, realized as a subgroup of `Equiv.Perm`.
    For $A_n$, use `alternatingGroup (Fin n)`. 
Definition8.3.15
uses 1used by 1✓L∃∀N

Ambient group. (LMFDB)

If H \subseteq G is a subgroup, we refer to G as the ambient group of H.

Tau Ceti Review: Subgroup.

Depends on: Definition 8.3.160

Lean code for Definition8.3.15●1 definition
  • structure(extends 2, 4 fields)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    structure Subgroup.{u_3} (G : Type u_3) [Group G] : Type u_3
    structure Subgroup.{u_3} (G : Type u_3) [Group G] :
      Type u_3
    A subgroup of a group `G` is a subset containing 1, closed under multiplication
    and closed under multiplicative inverse. 
    
    [Wikidata Q466109](https://www.wikidata.org/wiki/Q466109)
    • Submonoid G
    carrier : Set G
    Inherited from
    1. Submonoid
    2. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Submonoid
    2. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ self.carrier → x⁻¹ ∈ self.carrier
    `G` is closed under inverses 
Definition8.3.16
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

\phi-ratio. (LMFDB)

Given a group G and its automorphism group A, the \phi-ratio is the size of the automorphism group divided by \phi(G) where \phi represents Euler's totient function, that is |A|/\phi(G).

For cyclic groups, the size of their automorphism group is always \phi(G) and hence this ratio is 1.

Tau Ceti Review: IsCyclic.card_mulAut, MulAut, Nat.totient.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.37

Lean code for Definition8.3.16●5 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/AutPhiRatio.lean
    complete
    def Group.autPhiRatio.{u_1} (G : Type u_1) [Group G] : ℚ
    def Group.autPhiRatio.{u_1} (G : Type u_1)
      [Group G] : ℚ
    The **`φ`-ratio** (LMFDB `group.aut_phi_ratio`) of a group `G`: the order `|Aut(G)|` of its
    automorphism group divided by `φ(|G|)`, Euler's totient of the order of `G`, as a rational number.
    The LMFDB considers finite groups only; for an infinite group, `Nat.card G = 0` and `φ(0) = 0`, so
    the ratio is `0`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/AutPhiRatio.lean
    complete
    theorem IsCyclic.autPhiRatio_eq_one.{u_1} (G : Type u_1) [Group G] [Finite G]
      [IsCyclic G] : Group.autPhiRatio G = 1
    theorem IsCyclic.autPhiRatio_eq_one.{u_1}
      (G : Type u_1) [Group G] [Finite G]
      [IsCyclic G] : Group.autPhiRatio G = 1
    **The `φ`-ratio of a finite cyclic group is `1`** (LMFDB `group.aut_phi_ratio`): the
    automorphism group of a cyclic group of order `n` has order `φ(n)`. 
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Cyclic.lean
    complete
    theorem IsCyclic.card_mulAut.{u_2} (G : Type u_2) [Group G] [Finite G]
      [h : IsCyclic G] : Nat.card (MulAut G) = (Nat.card G).totient
    theorem IsCyclic.card_mulAut.{u_2} (G : Type u_2)
      [Group G] [Finite G] [h : IsCyclic G] :
      Nat.card (MulAut G) =
        (Nat.card G).totient
  • abbrevdefined in Mathlib/Algebra/Group/End.lean
    complete
    abbrev MulAut.{u_7} (M : Type u_7) [Mul M] : Type u_7
    abbrev MulAut.{u_7} (M : Type u_7) [Mul M] :
      Type u_7
    The group of multiplicative automorphisms. 
  • defdefined in Mathlib/Data/Nat/Totient.lean
    complete
    def Nat.totient (n : ℕ) : ℕ
    def Nat.totient (n : ℕ) : ℕ
    Euler's totient function. This counts the number of naturals strictly less than `n` which are
    coprime with `n`. 
Definition8.3.17
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.19
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Autjugacy class. (LMFDB)

If G is a group and x \in G, the autjugacy class of x is the orbit of x under the action of the automorphism group, namely \{\varphi(x) : \varphi \in \operatorname{Aut}(G)\}. Any autjugacy class is a disjoint union of conjugacy classes, each of the same size and order.

Tau Ceti Review: MulAction.orbit, MulAut.

Depends on: Definition 8.3.19 Definition 8.3.32 Definition 8.3.45

Lean code for Definition8.3.17●6 declarations
  • defdefined in Mathlib/GroupTheory/GroupAction/Defs.lean
    complete
    def MulAction.orbit.{u_2, u_3} (γ : Type u_2) {α : Type u_3} [SMul γ α]
      (a : α) : Set α
    def MulAction.orbit.{u_2, u_3} (γ : Type u_2)
      {α : Type u_3} [SMul γ α] (a : α) :
      Set α
    The orbit of an element under an action. 
  • abbrevdefined in Mathlib/Algebra/Group/End.lean
    complete
    abbrev MulAut.{u_7} (M : Type u_7) [Mul M] : Type u_7
    abbrev MulAut.{u_7} (M : Type u_7) [Mul M] :
      Type u_7
    The group of multiplicative automorphisms. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/AutjugacyClass.lean
    complete
    theorem MulAut.orbit_eq_iUnion_carrier.{u_1} {G : Type u_1} [Group G] (x : G) :
      MulAction.orbit (MulAut G) x =
        ⋃ c ∈ MulAction.orbit (MulAut G) (ConjClasses.mk x), c.carrier
    theorem MulAut.orbit_eq_iUnion_carrier.{u_1}
      {G : Type u_1} [Group G] (x : G) :
      MulAction.orbit (MulAut G) x =
        ⋃
          c ∈
            MulAction.orbit (MulAut G)
              (ConjClasses.mk x),
          c.carrier
    **An autjugacy class is a union of conjugacy classes** (LMFDB `group.autjugacy_class`): the
    orbit of `x` under `Aut(G)` is the union of the conjugacy classes in the orbit of the class of `x`
    under `Aut(G)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/AutjugacyClass.lean
    complete
    theorem MulAut.pairwiseDisjoint_carrier_orbit.{u_1} {G : Type u_1} [Group G]
      (x : G) :
      (MulAction.orbit (MulAut G) (ConjClasses.mk x)).PairwiseDisjoint
        ConjClasses.carrier
    theorem MulAut.pairwiseDisjoint_carrier_orbit.{u_1}
      {G : Type u_1} [Group G] (x : G) :
      (MulAction.orbit (MulAut G)
            (ConjClasses.mk
              x)).PairwiseDisjoint
        ConjClasses.carrier
    **The conjugacy classes in an autjugacy class are pairwise disjoint** (LMFDB
    `group.autjugacy_class`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/AutjugacyClass.lean
    complete
    theorem MulAut.natCard_carrier_of_mem_orbit.{u_1} {G : Type u_1} [Group G]
      (x : G) {c : ConjClasses G}
      (hc : c ∈ MulAction.orbit (MulAut G) (ConjClasses.mk x)) :
      Nat.card ↑c.carrier = Nat.card ↑(ConjClasses.mk x).carrier
    theorem MulAut.natCard_carrier_of_mem_orbit.{u_1}
      {G : Type u_1} [Group G] (x : G)
      {c : ConjClasses G}
      (hc :
        c ∈
          MulAction.orbit (MulAut G)
            (ConjClasses.mk x)) :
      Nat.card ↑c.carrier =
        Nat.card ↑(ConjClasses.mk x).carrier
    **The conjugacy classes in an autjugacy class have the same size** (LMFDB
    `group.autjugacy_class`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/AutjugacyClass.lean
    complete
    theorem MulAut.orderOf_of_mem_carrier_of_mem_orbit.{u_1} {G : Type u_1}
      [Group G] (x : G) {c : ConjClasses G}
      (hc : c ∈ MulAction.orbit (MulAut G) (ConjClasses.mk x)) {y : G}
      (hy : y ∈ c.carrier) : orderOf y = orderOf x
    theorem MulAut.orderOf_of_mem_carrier_of_mem_orbit.{u_1}
      {G : Type u_1} [Group G] (x : G)
      {c : ConjClasses G}
      (hc :
        c ∈
          MulAction.orbit (MulAut G)
            (ConjClasses.mk x))
      {y : G} (hy : y ∈ c.carrier) :
      orderOf y = orderOf x
    **The conjugacy classes in an autjugacy class have the same order** (LMFDB
    `group.autjugacy_class`): every element of every conjugacy class in the autjugacy class of `x` has
    the order of `x`. 
Definition8.3.18
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Autjugate subgroups. (LMFDB)

In analogy with conjugate subgroups, we say that two subgroups H_1 and H_2 of a group G are autjugate if there is an automorphism \phi of G so that \phi(H_1) = \phi(H_2).

Tau Ceti Review: Subgroup.pointwiseMulAction, MulAut.applyMulDistribMulAction, MulAction.orbit.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.160

Lean code for Definition8.3.18●3 definitions
  • defdefined in Mathlib/Algebra/Group/Subgroup/Pointwise.lean
    complete
    def Subgroup.pointwiseMulAction.{u_1, u_2} {α : Type u_1} {G : Type u_2}
      [Group G] [Monoid α] [MulDistribMulAction α G] :
      MulAction α (Subgroup G)
    def Subgroup.pointwiseMulAction.{u_1, u_2}
      {α : Type u_1} {G : Type u_2} [Group G]
      [Monoid α] [MulDistribMulAction α G] :
      MulAction α (Subgroup G)
    The action on a subgroup corresponding to applying the action to every element.
    
    This is available as an instance in the `Pointwise` locale. 
  • defdefined in Mathlib/Algebra/Group/Action/End.lean
    complete
    def MulAut.applyMulDistribMulAction.{u_2} {M : Type u_2} [Monoid M] :
      MulDistribMulAction (MulAut M) M
    def MulAut.applyMulDistribMulAction.{u_2}
      {M : Type u_2} [Monoid M] :
      MulDistribMulAction (MulAut M) M
    The tautological action by `MulAut M` on `M`.
    
    This generalizes `Function.End.applyMulAction`. 
  • defdefined in Mathlib/GroupTheory/GroupAction/Defs.lean
    complete
    def MulAction.orbit.{u_2, u_3} (γ : Type u_2) {α : Type u_3} [SMul γ α]
      (a : α) : Set α
    def MulAction.orbit.{u_2, u_3} (γ : Type u_2)
      {α : Type u_3} [SMul γ α] (a : α) :
      Set α
    The orbit of an element under an action. 
Definition8.3.19
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 15
Reverse dependency previews
Preview
Definition 8.3.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Automorphisms of a group. (LMFDB)

If G is a group, an automorphism of G is a group isomorphism f:G\to G.

The set of automorphisms of G, \Aut(G), is a group under composition.

Tau Ceti Review: MulAut.

Depends on: Definition 8.3.3 Definition 8.3.70

Lean code for Definition8.3.19●1 definition
  • abbrevdefined in Mathlib/Algebra/Group/End.lean
    complete
    abbrev MulAut.{u_7} (M : Type u_7) [Mul M] : Type u_7
    abbrev MulAut.{u_7} (M : Type u_7) [Mul M] :
      Type u_7
    The group of multiplicative automorphisms. 
Definition8.3.20
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 12
Reverse dependency previews
Preview
Definition 8.3.21
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Center of a group. (LMFDB)

If G is a group, the center of G is the set

Z(G) = \{g\in G\mid gh=hg \text{ for all } h\in G\}.

It is a normal subgroup of G.

Tau Ceti Review: Subgroup.center, Subgroup.mem_center_iff.

Depends on: Definition 8.3.3 Definition 8.3.167

Lean code for Definition8.3.20●2 declarations
  • defdefined in Mathlib/GroupTheory/Subgroup/Center.lean
    complete
    def Subgroup.center.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.center.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The center of a group `G` is the set of elements that commute with everything in `G` 
  • theoremdefined in Mathlib/GroupTheory/Subgroup/Center.lean
    complete
    theorem Subgroup.mem_center_iff.{u_1} {G : Type u_1} [Group G] {z : G} :
      z ∈ Subgroup.center G ↔ ∀ (g : G), g * z = z * g
    theorem Subgroup.mem_center_iff.{u_1}
      {G : Type u_1} [Group G] {z : G} :
      z ∈ Subgroup.center G ↔
        ∀ (g : G), g * z = z * g
Definition8.3.21
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Central subgroup. (LMFDB)

A subset, or subgroup, H of a group G is central if gh=hg for all g\in G and all h\in H. Equivalently, it is central if and only if it is a subset of the center of the group.

Tau Ceti Review: Subgroup.center, Subgroup.centralizer_eq_top_iff_subset.

Depends on: Definition 8.3.3 Definition 8.3.20 Definition 8.3.160

Lean code for Definition8.3.21●2 declarations
  • defdefined in Mathlib/GroupTheory/Subgroup/Center.lean
    complete
    def Subgroup.center.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.center.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The center of a group `G` is the set of elements that commute with everything in `G` 
  • theoremdefined in Mathlib/GroupTheory/Subgroup/Centralizer.lean
    complete
    theorem Subgroup.centralizer_eq_top_iff_subset.{u_1} {G : Type u_1} [Group G]
      {s : Set G} : Subgroup.centralizer s = ⊤ ↔ s ⊆ ↑(Subgroup.center G)
    theorem Subgroup.centralizer_eq_top_iff_subset.{u_1}
      {G : Type u_1} [Group G] {s : Set G} :
      Subgroup.centralizer s = ⊤ ↔
        s ⊆ ↑(Subgroup.center G)
Definition8.3.22
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Central quotient. (LMFDB)

The central quotient of a group G is G/Z(G), where Z(G) is the center of G. The central quotient is isomorphic to the group of inner automorphisms of G.

Tau Ceti Review: Subgroup.center, QuotientGroup.Quotient.group, MulAut.conj, QuotientGroup.quotientKerEquivRange.

Depends on: Definition 8.3.3 Definition 8.3.20 Definition 8.3.68

Lean code for Definition8.3.22●5 declarations
  • defdefined in Mathlib/GroupTheory/Subgroup/Center.lean
    complete
    def Subgroup.center.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.center.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The center of a group `G` is the set of elements that commute with everything in `G` 
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Defs.lean
    complete
    def QuotientGroup.Quotient.group.{u_1} {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] : Group (G ⧸ N)
    def QuotientGroup.Quotient.group.{u_1}
      {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] :
      Group (G ⧸ N)
  • defdefined in Mathlib/Algebra/Group/End.lean
    complete
    def MulAut.conj.{u_3} {G : Type u_3} [Group G] : G →* MulAut G
    def MulAut.conj.{u_3} {G : Type u_3}
      [Group G] : G →* MulAut G
    Group conjugation, `MulAut.conj g h = g * h * g⁻¹`, as a monoid homomorphism
    mapping multiplication in `G` into multiplication in the automorphism group `MulAut G`.
    See also the type `ConjAct G` for any group `G`, which has a `MulAction (ConjAct G) G` instance
    where `conj G` acts on `G` by conjugation. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Complete.lean
    complete
    theorem MulAut.ker_conj.{u_1} {G : Type u_1} [Group G] :
      MulAut.conj.ker = Subgroup.center G
    theorem MulAut.ker_conj.{u_1} {G : Type u_1}
      [Group G] :
      MulAut.conj.ker = Subgroup.center G
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Basic.lean
    complete
    def QuotientGroup.quotientKerEquivRange.{u, v} {G : Type u} [Group G]
      {H : Type v} [Group H] (φ : G →* H) : G ⧸ φ.ker ≃* ↥φ.range
    def QuotientGroup.quotientKerEquivRange.{u, v}
      {G : Type u} [Group G] {H : Type v}
      [Group H] (φ : G →* H) :
      G ⧸ φ.ker ≃* ↥φ.range
    **Noether's first isomorphism theorem** (a definition): the canonical isomorphism between
    `G/(ker φ)` to `range φ`. 
Definition8.3.23
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 8.1.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Centralizer of a subgroup. (LMFDB)

If G is a group and H is a subgroup of G, then the centralizer of H in G is

C_G(H) = \{g\in G\mid gh=hg \text{ for all } h\in H\}.

Tau Ceti Review: Subgroup.centralizer, Subgroup.mem_centralizer_iff.

Depends on: Definition 8.3.3

Lean code for Definition8.3.23●2 declarations
  • defdefined in Mathlib/GroupTheory/Subgroup/Centralizer.lean
    complete
    def Subgroup.centralizer.{u_1} {G : Type u_1} [Group G] (s : Set G) :
      Subgroup G
    def Subgroup.centralizer.{u_1} {G : Type u_1}
      [Group G] (s : Set G) : Subgroup G
    The `centralizer` of `s` is the subgroup of `g : G` commuting with every `h : s`. 
  • theoremdefined in Mathlib/GroupTheory/Subgroup/Centralizer.lean
    complete
    theorem Subgroup.mem_centralizer_iff.{u_1} {G : Type u_1} [Group G] {g : G}
      {s : Set G} : g ∈ Subgroup.centralizer s ↔ ∀ h ∈ s, h * g = g * h
    theorem Subgroup.mem_centralizer_iff.{u_1}
      {G : Type u_1} [Group G] {g : G}
      {s : Set G} :
      g ∈ Subgroup.centralizer s ↔
        ∀ h ∈ s, h * g = g * h
Definition8.3.24
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.49
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Characteristic subgroup. (LMFDB)

A subgroup H of a group G is a characteristic subgroup if \phi(H)=H for all automorphisms \phi\in \Aut(G).

Tau Ceti Review: Subgroup.Characteristic.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.160

Lean code for Definition8.3.24●1 definition
  • class(1 method)defined in Mathlib/Algebra/Group/Subgroup/Basic.lean
    complete
    class Subgroup.Characteristic.{u_1} {G : Type u_1} [Group G]
      (H : Subgroup G) : Prop
    class Subgroup.Characteristic.{u_1}
      {G : Type u_1} [Group G]
      (H : Subgroup G) : Prop
    A subgroup is characteristic if it is fixed by all automorphisms.
    Several equivalent conditions are provided by lemmas of the form `Characteristic.iff...` 
    fixed : ∀ (ϕ : G ≃* G), Subgroup.comap ϕ.toMonoidHom H = H
    `H` is fixed by all automorphisms 
Definition8.3.25
Statement uses 7
Statement dependency previews
Preview
Definition 1.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Chevalley group. (LMFDB)

The Chevalley groups are examples of groups of Lie type over finite fields. They generalise the classical linear, symplectic, orthogonal, and unitary matrix groups. In many cases, these are examples of finite simple groups.

Tau Ceti Review: Matrix.SpecialLinearGroup, Matrix.symplecticGroup, TauCeti.QuadraticMap.specialOrthogonalGroup.

Depends on: Definition 8.3.58 Definition 8.3.100 Definition 8.3.139 Definition 8.3.155 Definition 8.3.177 Definition 8.3.184 Definition 1.1.30

Lean code for Definition8.3.25●7 declarations
  • defdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    def Matrix.SpecialLinearGroup.{u, v} (n : Type u) [DecidableEq n]
      [Fintype n] (R : Type v) [CommRing R] : Type (max 0 u v)
    def Matrix.SpecialLinearGroup.{u, v}
      (n : Type u) [DecidableEq n] [Fintype n]
      (R : Type v) [CommRing R] :
      Type (max 0 u v)
    `SpecialLinearGroup n R` is the group of `n` by `n` `R`-matrices with determinant equal to 1.
    
  • defdefined in Mathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.symplecticGroup.{u_1, u_2} (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R] [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    def Matrix.symplecticGroup.{u_1, u_2}
      (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R]
      [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    The group of symplectic matrices over a ring `R`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Chevalley.lean
    complete
    abbrev QuadraticForm.chevalleyB.{u_1} (F : Type u_1) [Field F] [Invertible 2]
      (n : ℕ) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            (QuadraticForm.parabolicForm F n))
    abbrev QuadraticForm.chevalleyB.{u_1}
      (F : Type u_1) [Field F] [Invertible 2]
      (n : ℕ) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            (QuadraticForm.parabolicForm F n))
    The Chevalley group **`B(n, q) = Ω(2n + 1, q)`** (LMFDB `group.chevalley`), for `F = 𝔽_q` with
    `q` odd: the group `Ω` of the parabolic form `z² + x₁ y₁ + ⋯ + xₙ yₙ`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Chevalley.lean
    complete
    abbrev QuadraticForm.chevalleyD.{u_1} (F : Type u_1) [Field F] [Invertible 2]
      (n : ℕ) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            (QuadraticForm.hyperbolicForm F n))
    abbrev QuadraticForm.chevalleyD.{u_1}
      (F : Type u_1) [Field F] [Invertible 2]
      (n : ℕ) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            (QuadraticForm.hyperbolicForm F
              n))
    The Chevalley group **`D(n, q) = Ω⁺(2n, q)`** (LMFDB `group.chevalley`), for `F = 𝔽_q` with
    `q` odd: the group `Ω` of the hyperbolic form `x₁ y₁ + ⋯ + xₙ yₙ`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OmegaGroupCharTwo.lean
    complete
    abbrev QuadraticForm.chevalleyDOfCharTwo.{u_1} (K : Type u_1) [Field K]
      [CharP K 2] (m : ℕ) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            (QuadraticForm.hyperbolicForm K m))
    abbrev QuadraticForm.chevalleyDOfCharTwo.{u_1}
      (K : Type u_1) [Field K] [CharP K 2]
      (m : ℕ) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            (QuadraticForm.hyperbolicForm K
              m))
    The Chevalley group **`D(m, q) = Ω⁺(2m, q)`** (LMFDB `group.chevalley`), for `K = 𝔽_q` with
    `q` even: the kernel of the Dickson invariant on the special orthogonal group of the hyperbolic
    form `x₁ y₁ + ⋯ + x_m y_m`. 
  • defdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u, v, w} {R : Type u}
      {M : Type v} {N : Type w} [CommRing R] [AddCommGroup M] [Module R M]
      [AddCommMonoid N] [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u,
        v, w}
      {R : Type u} {M : Type v} {N : Type w}
      [CommRing R] [AddCommGroup M]
      [Module R M] [AddCommMonoid N]
      [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    The special orthogonal group: the orthogonal automorphisms of determinant one.
    
    The determinant is Mathlib's `LinearEquiv.det`, which is `1` by convention on a module that is not
    finite free; on such a module this subgroup is therefore all of `orthogonalGroup Q`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/ChevalleySimple.lean
    complete
    theorem Matrix.SpecialLinearGroup.isSimpleGroup_two_galoisField {k : ℕ}
      (hk : 2 ≤ k) :
      IsSimpleGroup (Matrix.SpecialLinearGroup (Fin 2) (GaloisField 2 k))
    theorem Matrix.SpecialLinearGroup.isSimpleGroup_two_galoisField
      {k : ℕ} (hk : 2 ≤ k) :
      IsSimpleGroup
        (Matrix.SpecialLinearGroup (Fin 2)
          (GaloisField 2 k))
    **The Chevalley group `A(1, 2 ^ k) = SL(2, 2 ^ k)` is simple for `k ≥ 2`** (LMFDB
    `group.chevalley`). 
Definition8.3.26
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Chief series of a group. (LMFDB)

If G is a group, the chief series of G is a normal series

\langle e\rangle=N_0 \lhd N_1 \lhd \cdots \lhd N_k=G

where each N_{i+1}/N_i is a minimal normal subgroup of G/N_i.

The factor groups N_{i+1}/N_i are each isomorphic to a product of some number of copies of a single simple group (which depends on i). These simple groups (together with their multiplicities) are the composition factors of G. While there may be many chief series for G, the set of composition factors is a well defined invariant.

Depends on: Definition 8.3.3 Definition 8.3.95 Definition 8.3.139 Definition 8.3.167

Lean code for Definition8.3.26●6 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/ChiefSeries.lean
    complete
    def Subgroup.NormalSeries.IsChief.{u_1} {G : Type u_1} [Group G]
      (s : Subgroup.NormalSeries G) : Prop
    def Subgroup.NormalSeries.IsChief.{u_1}
      {G : Type u_1} [Group G]
      (s : Subgroup.NormalSeries G) : Prop
    A **chief series** of `G` (LMFDB `group.chief_series`): a normal series
    `1 = N₀ ⊴ N₁ ⊴ ⋯ ⊴ Nₖ = G` such that each `Nᵢ₊₁ / Nᵢ` is a minimal normal subgroup of
    `G / Nᵢ`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/ChiefFactor.lean
    complete
    def Subgroup.NormalSeries.compositionFactorMultiplicity.{u_1, u_3}
      {G : Type u_1} [Group G] (s : Subgroup.NormalSeries G) (T : Type u_3)
      [Group T] : ℕ
    def Subgroup.NormalSeries.compositionFactorMultiplicity.{u_1,
        u_3}
      {G : Type u_1} [Group G]
      (s : Subgroup.NormalSeries G)
      (T : Type u_3) [Group T] : ℕ
    The **multiplicity of a group `T` among the composition factors** of `G` (LMFDB
    `group.chief_series`), read off a chief series `s`: `0` if `T` is not simple, and otherwise the sum,
    over the chief factors `Fᵢ = Nᵢ₊₁ / Nᵢ`, of the number `k` of copies of `T` with `Fᵢ ≅ T ^ k` (the
    least such `k`, and `0` when there is none). Each chief factor of a finite group is `Sᵢ ^ kᵢ` for a
    simple group `Sᵢ` (`Subgroup.NormalSeries.IsChief.exists_isSimpleGroup_mulEquiv_pi`), and for a
    finite simple `T` this multiplicity is the sum of the `kᵢ` with `Sᵢ ≅ T`
    (`Subgroup.NormalSeries.IsChief.compositionFactorMultiplicity_eq_sum`): the composition factors of
    `G` are the `Sᵢ`, with multiplicities `kᵢ`. It does not depend on the chief series
    (`Subgroup.NormalSeries.IsChief.compositionFactorMultiplicity_eq`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/ChiefFactor.lean
    complete
    theorem Subgroup.NormalSeries.IsChief.exists_isSimpleGroup_mulEquiv_pi.{u_1}
      {G : Type u_1} [Group G] [Finite G] {s : Subgroup.NormalSeries G}
      (hs : s.IsChief) (i : Fin s.length) :
      ∃ S k, IsSimpleGroup ↥S ∧ Nonempty (s.factor i ≃* (Fin k → ↥S))
    theorem Subgroup.NormalSeries.IsChief.exists_isSimpleGroup_mulEquiv_pi.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      {s : Subgroup.NormalSeries G}
      (hs : s.IsChief) (i : Fin s.length) :
      ∃ S k,
        IsSimpleGroup ↥S ∧
          Nonempty
            (s.factor i ≃* (Fin k → ↥S))
    **The chief factors of a finite group are powers of simple groups** (LMFDB
    `group.chief_series`): each factor `Nᵢ₊₁ / Nᵢ` of a chief series is isomorphic to `S ^ k` for a
    simple group `S`, being isomorphic to the minimal normal subgroup `Nᵢ₊₁ / Nᵢ` of `G / Nᵢ`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/ChiefFactor.lean
    complete
    theorem Subgroup.NormalSeries.IsChief.compositionFactorMultiplicity_eq_sum.{u_1,
        u_3, u_4}
      {G : Type u_1} [Group G] {s : Subgroup.NormalSeries G} (T : Type u_3)
      [Group T] [IsSimpleGroup T] [Finite T] (hs : s.IsChief)
      {S : Fin s.length → Type u_4} [(i : Fin s.length) → Group (S i)]
      [∀ (i : Fin s.length), IsSimpleGroup (S i)] {k : Fin s.length → ℕ}
      (e : (i : Fin s.length) → s.factor i ≃* (Fin (k i) → S i)) :
      s.compositionFactorMultiplicity T =
        ∑ i, if Nonempty (S i ≃* T) then k i else 0
    theorem Subgroup.NormalSeries.IsChief.compositionFactorMultiplicity_eq_sum.{u_1,
        u_3, u_4}
      {G : Type u_1} [Group G]
      {s : Subgroup.NormalSeries G}
      (T : Type u_3) [Group T]
      [IsSimpleGroup T] [Finite T]
      (hs : s.IsChief)
      {S : Fin s.length → Type u_4}
      [(i : Fin s.length) → Group (S i)]
      [∀ (i : Fin s.length),
          IsSimpleGroup (S i)]
      {k : Fin s.length → ℕ}
      (e :
        (i : Fin s.length) →
          s.factor i ≃* (Fin (k i) → S i)) :
      s.compositionFactorMultiplicity T =
        ∑ i,
          if Nonempty (S i ≃* T) then k i
          else 0
    **The composition factors are the simple groups of the chief factors, with multiplicities**
    (LMFDB `group.chief_series`): if the chief factors of `G` are `Fᵢ ≅ Sᵢ ^ kᵢ` with `Sᵢ` simple, then
    the multiplicity of a finite simple group `T` among the composition factors is the sum of the `kᵢ`
    with `Sᵢ ≅ T`. A power `T ^ k` is isomorphic to `Fᵢ` only for `T ≅ Sᵢ`, a simple quotient of
    `Sᵢ ^ kᵢ` being isomorphic to `Sᵢ`, and then only for `k = kᵢ`, by counting. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/ChiefFactor.lean
    complete
    theorem Subgroup.NormalSeries.IsChief.compositionFactorMultiplicity_eq.{u_1,
        u_3}
      {G : Type u_1} [Group G] {s₁ s₂ : Subgroup.NormalSeries G}
      (T : Type u_3) [Group T] (h₁ : s₁.IsChief) (h₂ : s₂.IsChief) :
      s₁.compositionFactorMultiplicity T =
        s₂.compositionFactorMultiplicity T
    theorem Subgroup.NormalSeries.IsChief.compositionFactorMultiplicity_eq.{u_1,
        u_3}
      {G : Type u_1} [Group G]
      {s₁ s₂ : Subgroup.NormalSeries G}
      (T : Type u_3) [Group T]
      (h₁ : s₁.IsChief) (h₂ : s₂.IsChief) :
      s₁.compositionFactorMultiplicity T =
        s₂.compositionFactorMultiplicity T
    **The composition factors do not depend on the chief series** (LMFDB `group.chief_series`):
    two chief series give every group the same multiplicity, their factors being isomorphic up to a
    permutation by the Jordan–Hölder theorem. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/ChiefFactor.lean
    complete
    theorem Subgroup.NormalSeries.exists_isChief.{u_1} {G : Type u_1} [Group G]
      [Finite G] : ∃ s, s.IsChief
    theorem Subgroup.NormalSeries.exists_isChief.{u_1}
      {G : Type u_1} [Group G] [Finite G] :
      ∃ s, s.IsChief
    **A finite group has a chief series** (LMFDB `group.chief_series`): a maximal chain of normal
    subgroups from `⊥` to `⊤`, which exists in the finite lattice of normal subgroups. 
Definition8.3.27
uses 1used by 0✓L∃∀N

Commutator length. (LMFDB)

The commutator subgroup is generated by commutators, but it's not necessarily the case that every element is a commutator. The commutator length of G is the minimal integer k so that every element of G' can be written as the product of k commutators.

Tau Ceti Review: commutator_eq_closure.

Depends on: Definition 8.3.28

Lean code for Definition8.3.27●6 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Commutator/Length.lean
    complete
    def commutatorLength.{u_1} (G : Type u_1) [Group G] : ℕ
    def commutatorLength.{u_1} (G : Type u_1)
      [Group G] : ℕ
    The **commutator length** (LMFDB `group.commutator_length`) of `G`, the least `k` such that
    every element of the commutator subgroup `G'` is a product of `k` commutators. Products of at most
    `k` commutators are products of exactly `k` commutators, padding with `⁅1, 1⁆ = 1`. Such a `k`
    exists for finite `G`; otherwise this is `0` by convention. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Commutator/Length.lean
    complete
    theorem exists_list_length_le_commutatorLength.{u_1} {G : Type u_1} [Group G]
      [Finite G] {g : G} (hg : g ∈ commutator G) :
      ∃ l,
        l.length ≤ commutatorLength G ∧
          (∀ x ∈ l, x ∈ commutatorSet G) ∧ l.prod = g
    theorem exists_list_length_le_commutatorLength.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      {g : G} (hg : g ∈ commutator G) :
      ∃ l,
        l.length ≤ commutatorLength G ∧
          (∀ x ∈ l, x ∈ commutatorSet G) ∧
            l.prod = g
    Every element of the commutator subgroup of a finite group is a product of at most
    `commutatorLength G` commutators. 
  • theoremdefined in Mathlib/GroupTheory/Commutator/Basic.lean
    complete
    theorem commutator_eq_closure.{u_1} (G : Type u_1) [Group G] :
      commutator G = Subgroup.closure (commutatorSet G)
    theorem commutator_eq_closure.{u_1} (G : Type u_1)
      [Group G] :
      commutator G =
        Subgroup.closure (commutatorSet G)
  • structure(2 fields)defined in LeanBridge/ForMathlib/GroupTheory/Commutator/NotCommutator.lean
    complete
    structure OuterProductGroup.{u_1, u_2} (R : Type u_1) (n : Type u_2) :
      Type (max u_1 u_2)
    structure OuterProductGroup.{u_1, u_2}
      (R : Type u_1) (n : Type u_2) :
      Type (max u_1 u_2)
    The group of pairs `(v, w)` of a vector `v : n → R` and a matrix `w : Matrix n n R` over a
    commutative ring `R`, with the product `(v, w) (v', w') = (v + v', w + w' + v v'ᵀ)`: a central
    extension of the additive group `Rⁿ` by `Mₙ(R)` whose commutators are the matrices
    `v v'ᵀ - v' vᵀ`. 
    v : n → R
    The vector component. 
    w : Matrix n n R
    The matrix component. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Commutator/NotCommutator.lean
    complete
    theorem OuterProductGroup.commutatorSet_ne_commutator.{u_1} {R : Type u_1}
      [CommRing R] [Nontrivial R] :
      commutatorSet (OuterProductGroup R (Fin 4)) ≠
        ↑(commutator (OuterProductGroup R (Fin 4)))
    theorem OuterProductGroup.commutatorSet_ne_commutator.{u_1}
      {R : Type u_1} [CommRing R]
      [Nontrivial R] :
      commutatorSet
          (OuterProductGroup R (Fin 4)) ≠
        ↑(commutator
            (OuterProductGroup R (Fin 4)))
    **Not every element of the commutator subgroup is a commutator** (LMFDB
    `group.commutator_length`): for a nontrivial commutative ring `R`, the commutators of
    `OuterProductGroup R (Fin 4)` form a proper subset of its commutator subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Commutator/NotCommutator.lean
    complete
    theorem OuterProductGroup.one_lt_commutatorLength :
      1 < commutatorLength (OuterProductGroup (ZMod 2) (Fin 4))
    theorem OuterProductGroup.one_lt_commutatorLength :
      1 <
        commutatorLength
          (OuterProductGroup (ZMod 2) (Fin 4))
    **A finite group of commutator length at least `2`** (LMFDB `group.commutator_length`): over
    `𝔽₂` the group `OuterProductGroup (ZMod 2) (Fin 4)` is finite, and its commutator subgroup has an
    element that is not a commutator. 
Definition8.3.28
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 9
Reverse dependency previews
Preview
Definition 4.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Commutator subgroup of a group. (LMFDB)

Given a group G, the commutators of G are the elements a^{-1}b^{-1}ab where a,b\in G.

The subgroup generated by all commutators of G is the commutator subgroup or derived subgroup of G, and is denoted by [G,G] or G'.

The commutator subgroup is always a normal subgroup, and the quotient group G/G', called the abelianization of G, is the largest abelian quotient of G in the sense that any homomorphism G\to A where A is an abelian group factors as a composition of homomorphisms G\to G/G'\to A.

Tau Ceti Review: commutator, commutatorSet, commutatorElement, commutator_eq_closure.

Depends on: Definition 8.3.3 Definition 8.3.5 Definition 8.3.118 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.28●4 declarations
  • defdefined in Mathlib/GroupTheory/Commutator/Basic.lean
    complete
    def commutator.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def commutator.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The commutator subgroup of a group G is the normal subgroup
    generated by the commutators `[p,q] = p * q * p⁻¹ * q⁻¹`. 
  • defdefined in Mathlib/GroupTheory/Commutator/Basic.lean
    complete
    def commutatorSet.{u_1} (G : Type u_1) [Group G] : Set G
    def commutatorSet.{u_1} (G : Type u_1)
      [Group G] : Set G
    The set of commutator elements `⁅g₁, g₂⁆` in `G`. 
  • defdefined in Mathlib/Algebra/Group/Commutator.lean
    complete
    def commutatorElement.{u_1} {G : Type u_1} [Group G] : Bracket G G
    def commutatorElement.{u_1} {G : Type u_1}
      [Group G] : Bracket G G
    The commutator of two elements `g₁` and `g₂`. This is a scoped instance in the
    `commutatorElement` namespace to avoid clashing with other brackets. 
  • theoremdefined in Mathlib/GroupTheory/Commutator/Basic.lean
    complete
    theorem commutator_eq_closure.{u_1} (G : Type u_1) [Group G] :
      commutator G = Subgroup.closure (commutatorSet G)
    theorem commutator_eq_closure.{u_1} (G : Type u_1)
      [Group G] :
      commutator G =
        Subgroup.closure (commutatorSet G)
Definition8.3.29
uses 0used by 0✓L∃∀N

Complete group. (LMFDB)

A group G is complete if one of the following equivalent conditions holds:

  • it has trivial center and every automorphism is inner,

  • the natural map from G to its inner automorphism group is an isomorphism,

  • whenever it is embedded as a normal subgroup of a larger group, it is a direct factor.

For n \ne 2, 6, the symmetric group S_n is complete.

Tau Ceti Review: MulAut.conj.

Lean code for Definition8.3.29●8 declarations
  • class(1 method)defined in LeanBridge/ForMathlib/GroupTheory/Complete.lean
    complete
    class Group.IsComplete.{u_1} (G : Type u_1) [Group G] : Prop
    class Group.IsComplete.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group `G` is **complete** (LMFDB `group.complete`) if the conjugation map
    `MulAut.conj : G →* MulAut G` is bijective, that is, if `G` has trivial centre and every
    automorphism of `G` is inner (`Group.isComplete_iff`).
    
    The knowl also lists the condition that "the natural map from `G` to its inner automorphism group
    is an isomorphism", which only says that the centre is trivial: the intended map is the one to the
    full automorphism group, as here. Its third condition, that `G` is a direct factor of every group
    containing it as a normal subgroup, follows from completeness
    (`Subgroup.isComplement'_centralizer`), and conversely implies it, a theorem of Baer
    (`Group.isComplete_iff_forall_exists_isComplement'`). 
    bijective_conj : Function.Bijective ⇑MulAut.conj
  • defdefined in Mathlib/Algebra/Group/End.lean
    complete
    def MulAut.conj.{u_3} {G : Type u_3} [Group G] : G →* MulAut G
    def MulAut.conj.{u_3} {G : Type u_3}
      [Group G] : G →* MulAut G
    Group conjugation, `MulAut.conj g h = g * h * g⁻¹`, as a monoid homomorphism
    mapping multiplication in `G` into multiplication in the automorphism group `MulAut G`.
    See also the type `ConjAct G` for any group `G`, which has a `MulAction (ConjAct G) G` instance
    where `conj G` acts on `G` by conjugation. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Complete.lean
    complete
    theorem Group.isComplete_iff.{u_1} (G : Type u_1) [Group G] :
      Group.IsComplete G ↔
        Subgroup.center G = ⊥ ∧ Function.Surjective ⇑MulAut.conj
    theorem Group.isComplete_iff.{u_1} (G : Type u_1)
      [Group G] :
      Group.IsComplete G ↔
        Subgroup.center G = ⊥ ∧
          Function.Surjective ⇑MulAut.conj
    **A group is complete if and only if its centre is trivial and all its automorphisms are
    inner.** 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/CompleteDirectFactor.lean
    complete
    theorem Group.isComplete_iff_forall_exists_isComplement'.{u} {G : Type u}
      [Group G] :
      Group.IsComplete G ↔
        ∀ (H : Type u) [inst : Group H] (f : G →* H),
          Function.Injective ⇑f →
            f.range.Normal → ∃ K, K.Normal ∧ f.range.IsComplement' K
    theorem Group.isComplete_iff_forall_exists_isComplement'.{u}
      {G : Type u} [Group G] :
      Group.IsComplete G ↔
        ∀ (H : Type u) [inst : Group H]
          (f : G →* H),
          Function.Injective ⇑f →
            f.range.Normal →
              ∃ K,
                K.Normal ∧
                  f.range.IsComplement' K
    **Baer's theorem** (LMFDB `group.complete`): a group `G` is complete if and only if it is a
    direct factor of every group `H` (of the universe of `G`) containing it as a normal subgroup, that
    is, the image of every injective homomorphism `f : G →* H` with normal image has a normal
    complement. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Complete.lean
    complete
    theorem Subgroup.isComplement'_centralizer.{u_1} {H : Type u_1} [Group H]
      (N : Subgroup H) [N.Normal] [Group.IsComplete ↥N] :
      N.IsComplement' (Subgroup.centralizer ↑N)
    theorem Subgroup.isComplement'_centralizer.{u_1}
      {H : Type u_1} [Group H]
      (N : Subgroup H) [N.Normal]
      [Group.IsComplete ↥N] :
      N.IsComplement'
        (Subgroup.centralizer ↑N)
    **A complete normal subgroup is a direct factor**: its centralizer, a normal subgroup, is a
    complement. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MulAut.lean
    complete
    theorem Equiv.Perm.isComplete.{u_1} {α : Type u_1} [DecidableEq α] [Fintype α]
      (h2 : Nat.card α ≠ 2) (h6 : Nat.card α ≠ 6) :
      Group.IsComplete (Equiv.Perm α)
    theorem Equiv.Perm.isComplete.{u_1} {α : Type u_1}
      [DecidableEq α] [Fintype α]
      (h2 : Nat.card α ≠ 2)
      (h6 : Nat.card α ≠ 6) :
      Group.IsComplete (Equiv.Perm α)
    **The symmetric group `S_n` is complete for `n ≠ 2, 6`** (LMFDB `group.complete`): its centre
    is trivial (`Equiv.Perm.center_eq_bot`, and `S_0`, `S_1` are trivial) and all its automorphisms
    are inner (`Equiv.Perm.surjective_conj_of_card_ne_six`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MulAut.lean
    complete
    theorem Equiv.Perm.surjective_conj_of_card_ne_six.{u_1} {α : Type u_1}
      [DecidableEq α] [Fintype α] (hα : Nat.card α ≠ 6) :
      Function.Surjective ⇑MulAut.conj
    theorem Equiv.Perm.surjective_conj_of_card_ne_six.{u_1}
      {α : Type u_1} [DecidableEq α]
      [Fintype α] (hα : Nat.card α ≠ 6) :
      Function.Surjective ⇑MulAut.conj
    **For `n ≠ 6`, every automorphism of `S_n` is inner** (LMFDB `group.complete`,
    `nf.sextic_twin`): it sends transpositions to transpositions (`Equiv.Perm.isSwap_mulAut_apply`), so
    it is inner (`Equiv.Perm.mem_range_conj_of_forall_isSwap`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MulAut.lean
    complete
    theorem Equiv.Perm.center_eq_bot.{u_1} {α : Type u_1} [DecidableEq α]
      [Fintype α] (hα : 3 ≤ Nat.card α) : Subgroup.center (Equiv.Perm α) = ⊥
    theorem Equiv.Perm.center_eq_bot.{u_1}
      {α : Type u_1} [DecidableEq α]
      [Fintype α] (hα : 3 ≤ Nat.card α) :
      Subgroup.center (Equiv.Perm α) = ⊥
    **For `n ≥ 3`, the centre of `S_n` is trivial**: a permutation `g` moving a point `a`
    does not commute with the transposition `(a c)` for a point `c` other than `a` and `g a`. 
Definition8.3.30
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.6.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Complex character table of a finite group. (LMFDB)

The complex character table of a finite group G is a square tabulation of the value of its irreducible complex characters, which encodes useful information about the group G in a compact way. Each row of the table is labeled by an irreducible character (given by its label) and the entries in the row are the values of that character on some representative of the corresponding conjugacy class of G given by its label on the columns.

Tau Ceti Review: TauCeti.characterTable, TauCeti.irreducibleCharacters.

Depends on: Definition 8.3.3 Definition 8.3.72 Definition 8.3.73 Definition 8.3.125

Lean code for Definition8.3.30●2 definitions
  • defdefined in TauCeti/RepresentationTheory/CharacterTable/Table.lean
    complete
    def TauCeti.characterTable.{u, v} (k : Type u) (G : Type v) [Field k]
      [Group G] [Finite G] [IsAlgClosed k] [Invertible ↑(Nat.card G)] :
      Matrix (Fin (Nat.card (ConjClasses G))) (ConjClasses G) k
    def TauCeti.characterTable.{u, v} (k : Type u)
      (G : Type v) [Field k] [Group G]
      [Finite G] [IsAlgClosed k]
      [Invertible ↑(Nat.card G)] :
      Matrix (Fin (Nat.card (ConjClasses G)))
        (ConjClasses G) k
    **The character table of `G`**: the square matrix whose `(i, C)` entry is the value of the
    `i`-th irreducible character of `G` on the conjugacy class `C`.
    
    The rows are indexed by the chosen enumeration `TauCeti.finEquivIrreducibleCharacters` of the
    irreducible characters and the columns by the conjugacy classes themselves, so the table is labelled
    on its columns and determined up to a permutation of its rows. 
  • defdefined in TauCeti/RepresentationTheory/CharacterTable/Table.lean
    complete
    def TauCeti.irreducibleCharacters.{u, v} (k : Type u) (G : Type v) [Field k]
      [Group G] : Set (G → k)
    def TauCeti.irreducibleCharacters.{u, v}
      (k : Type u) (G : Type v) [Field k]
      [Group G] : Set (G → k)
    **The irreducible characters of `G` over `k`**: the set of characters of the irreducible
    representations of `G` on the coordinate spaces `Fin n → k`.
    
    Restricting to coordinate spaces costs nothing: by `TauCeti.character_mem_irreducibleCharacters` the
    character of an irreducible representation on any finite-dimensional space belongs to this set. 
Definition8.3.31
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.32
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Computing labels of subgroups. (LMFDB)

In order to label Gassmann classes we first fix an ordering of the conjugacy classes of G. Having fixed such an ordering, it is easy to compute a unique identifier for each Gassmann class: we count the intersection of H with each G-conjugacy class. We enumerate H-conjugacy classes of elements of H in any order, then determine which G-conjugacy class they belong to, adding the size of the H-conjugacy class to a running tally of the intersection. An analogous process works for Gassman vectors up to automorphism, where we collect together G-conjugacy classes that are related by an automorphism of G.

If there are multiple subgroups up to automorphism (resp., conjugation) within a given Gassmann class, we use the subgroup lattice to further order those remaining subgroups. We first order subgroups H in the same Gassmann class using the lex ordering on the sorted list of labels of all (proper) supergroups of H. (One can and often does have Gassmann equivalent subgroups for which the lists of supergroups differ.) Note that here "supergroup" refers to inclusions in the poset of subgroups up to automorphism (resp., conjugation), meaning we consider K to be a supergroup of H if it contains any subgroup equivalent to H up to automorphism (resp., conjugation).

In these cases where two or more Gassmann equivalent subgroups have the same set of supergroups, we resort to computing permutation representation signatures. We can, in fact, compute with any supergroup K of H instead of G. This is much more efficient when the index [K:H] is much smaller than [G:H], but does require some care to account for the fact that there may be two or more G-conjugates of H contained in K that are not K-conjugate.

Depends on: Definition 8.3.32 Definition 8.3.57 Definition 8.3.108

Lean code for Definition8.3.31●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/ModularCurve/GassmannClass.lean
    complete
    def Subgroup.IsGassmannEquivalent.{u_1} {G : Type u_1} [Group G]
      (H₁ H₂ : Subgroup G) : Prop
    def Subgroup.IsGassmannEquivalent.{u_1}
      {G : Type u_1} [Group G]
      (H₁ H₂ : Subgroup G) : Prop
    Two subgroups `H₁` and `H₂` of a group `G` are **Gassmann equivalent** (LMFDB
    `group.gassmann_equivalence`) if `|C ∩ H₁| = |C ∩ H₂|` for every conjugacy class `C` of `G`. The
    LMFDB applies this to finite groups `G`; for infinite `G` the cardinalities are `Nat.card`, which is
    `0` on infinite sets. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Label/Subgroup.lean
    complete
    def Subgroup.IsAutGassmannEquivalent.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    def Subgroup.IsAutGassmannEquivalent.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    Two subgroups `H` and `K` of `G` are **Gassmann equivalent up to automorphism** (LMFDB
    `group.subgroup_label`, `group.computing_subgroup_labels`) if `|O ∩ H| = |O ∩ K|` for every orbit
    `O` of the automorphism group of `G` on `G`, a union of conjugacy classes. The letters of the part
    `a` of the LMFDB label of a subgroup identify its class for this relation among the subgroups of the
    same index. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/ModularCurve/GassmannClass.lean
    complete
    theorem Subgroup.natCard_inter_eq_sum.{u_1} {G : Type u_1} [Group G]
      {H : Subgroup G} [Finite ↥H] [Fintype (ConjClasses ↥H)]
      (C : ConjClasses G) :
      Nat.card ↑(C.carrier ∩ ↑H) =
        ∑ D with ConjClasses.map H.subtype D = C, Nat.card ↑D.carrier
    theorem Subgroup.natCard_inter_eq_sum.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} [Finite ↥H]
      [Fintype (ConjClasses ↥H)]
      (C : ConjClasses G) :
      Nat.card ↑(C.carrier ∩ ↑H) =
        ∑ D with
          ConjClasses.map H.subtype D = C,
          Nat.card ↑D.carrier
    **The LMFDB's running tally counts the elements of `H` in a conjugacy class of `G`** (LMFDB
    `group.computing_subgroup_labels`): each conjugacy class `D` of `H` lies in the conjugacy class
    `D.map H.subtype` of `G`, and the number of elements of `H` in a conjugacy class `C` of `G` is the
    sum of the sizes of the conjugacy classes of `H` lying in `C`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupClassPoset.lean
    complete
    theorem Subgroup.mk_le_mk_iff_exists_smul_le.{u_1, u_2} {A : Type u_1}
      {G : Type u_2} [Group A] [Group G] [MulDistribMulAction A G]
      {H K : Subgroup G} : ⟦H⟧ ≤ ⟦K⟧ ↔ ∃ a, a • H ≤ K
    theorem Subgroup.mk_le_mk_iff_exists_smul_le.{u_1,
        u_2}
      {A : Type u_1} {G : Type u_2} [Group A]
      [Group G] [MulDistribMulAction A G]
      {H K : Subgroup G} :
      ⟦H⟧ ≤ ⟦K⟧ ↔ ∃ a, a • H ≤ K
    **The order on the classes of subgroups**: for the order induced by inclusion on the orbits of
    `A` on the subgroups of `G`, Mathlib's preorder on a quotient, `[H] ≤ [K]` if and only if
    `a • H ≤ K` for some `a : A`, that is, for `A = ConjAct G`, a conjugate of `H` lies in `K`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GassmannSupergroups.lean
    complete
    theorem TauCeti.AffineGroup.Ioi_mk_map_inl_ne :
      Set.Ioi
          ⟦Subgroup.map
              (MonoidHom.inl (TauCeti.AffineGroup (ZMod 8))
                (Multiplicative (ZMod 2)))
              (TauCeti.affineLinearSubgroup (ZMod 8))⟧ ≠
        Set.Ioi
          ⟦Subgroup.map
              (MonoidHom.inl (TauCeti.AffineGroup (ZMod 8))
                (Multiplicative (ZMod 2)))
              TauCeti.AffineGroup.zmodEightTwistedSubgroup⟧
    theorem TauCeti.AffineGroup.Ioi_mk_map_inl_ne :
      Set.Ioi
          ⟦Subgroup.map
              (MonoidHom.inl
                (TauCeti.AffineGroup (ZMod 8))
                (Multiplicative (ZMod 2)))
              (TauCeti.affineLinearSubgroup
                (ZMod 8))⟧ ≠
        Set.Ioi
          ⟦Subgroup.map
              (MonoidHom.inl
                (TauCeti.AffineGroup (ZMod 8))
                (Multiplicative (ZMod 2)))
              TauCeti.AffineGroup.zmodEightTwistedSubgroup⟧
    **The subgroups `H₀ × 1` and `K₀ × 1` of `Hol(C₈) × C₂` have different supergroups** (LMFDB
    `group.computing_subgroup_labels`): in the poset of the conjugacy classes of subgroups, the class of
    `H₀ × C₂` lies strictly above that of `H₀ × 1` but not above that of `K₀ × 1`. So these subgroups,
    Gassmann equivalent by `TauCeti.AffineGroup.isGassmannEquivalent_map_inl`, have different lists of
    supergroups. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GassmannSupergroups.lean
    complete
    theorem Equiv.Perm.Ioi_mk_range_kleinFourOnFourHom_ne :
      Set.Ioi ⟦Equiv.Perm.kleinFourOnFourHom.range⟧ ≠
        Set.Ioi ⟦Equiv.Perm.kleinFourOnSixHom.range⟧
    theorem Equiv.Perm.Ioi_mk_range_kleinFourOnFourHom_ne :
      Set.Ioi
          ⟦Equiv.Perm.kleinFourOnFourHom.range⟧ ≠
        Set.Ioi
          ⟦Equiv.Perm.kleinFourOnSixHom.range⟧
    **The Klein four-groups `V₁` and `V₂` of `S₇` have different supergroups up to automorphism**
    (LMFDB `group.computing_subgroup_labels`): in the poset of the subgroups of `S₇` up to
    automorphism, the class of the subgroup `M` of the permutations fixing `5` and `6` lies strictly
    above that of `V₁`, which `M` contains and which has no element of order `3`, but not above that of
    `V₂`: every automorphism of `S₇` is inner, and `V₂` fixes no point other than `6`. So these
    subgroups, Gassmann equivalent up to automorphism by
    `Equiv.Perm.isAutGassmannEquivalent_range_kleinFourOnFourHom`, have different lists of
    supergroups. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GassmannSupergroups.lean
    complete
    theorem DihedralGroup.isConjugate_zpowers_sr_zero_zpowers_sr_two :
      (Subgroup.zpowers (DihedralGroup.sr 0)).IsConjugate
        (Subgroup.zpowers (DihedralGroup.sr 2))
    theorem DihedralGroup.isConjugate_zpowers_sr_zero_zpowers_sr_two :
      (Subgroup.zpowers
            (DihedralGroup.sr 0)).IsConjugate
        (Subgroup.zpowers
          (DihedralGroup.sr 2))
    **The subgroups of `D₄` generated by the reflections `s` and `sr²` are conjugate** (LMFDB
    `group.computing_subgroup_labels`), by the rotation `r`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GassmannSupergroups.lean
    complete
    theorem DihedralGroup.not_isConjugate_subgroupOf_centralizer :
      ¬((Subgroup.zpowers (DihedralGroup.sr 0)).subgroupOf
              (Subgroup.centralizer {DihedralGroup.sr 0})).IsConjugate
          ((Subgroup.zpowers (DihedralGroup.sr 2)).subgroupOf
            (Subgroup.centralizer {DihedralGroup.sr 0}))
    theorem DihedralGroup.not_isConjugate_subgroupOf_centralizer :
      ¬((Subgroup.zpowers
                  (DihedralGroup.sr
                    0)).subgroupOf
              (Subgroup.centralizer
                {DihedralGroup.sr
                    0})).IsConjugate
          ((Subgroup.zpowers
                (DihedralGroup.sr
                  2)).subgroupOf
            (Subgroup.centralizer
              {DihedralGroup.sr 0}))
    **The subgroups of `D₄` generated by `s` and `sr²` are not conjugate in the centraliser of `s`**
    (LMFDB `group.computing_subgroup_labels`): they are conjugate in `D₄` and lie in
    `K = centralizer {s}`, but conjugation by an element of `K` fixes `s`, hence the subgroup that `s`
    generates, which does not contain `sr²`. 
Definition8.3.32
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 13
Reverse dependency previews
Preview
Definition 8.1.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Conjugacy class. (LMFDB)

If G is a group and x\in G, the conjugacy class of x is the set \{gxg^{-1}\mid g\in G\}. These sets partition G, and the set of conjugacy classes is denoted by \mathrm{conj}(G).

Since conjugation by fixed g\in G is an automorphism of G, all conjugate elements have the same order in the group.

Tau Ceti Review: ConjClasses, ConjClasses.carrier, IsConj, SemiconjBy.orderOf_eq.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.45

Lean code for Definition8.3.32●5 declarations
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def conjugatesOf.{u} {α : Type u} [Monoid α] (a : α) : Set α
    def conjugatesOf.{u} {α : Type u} [Monoid α]
      (a : α) : Set α
    Given an element `a`, `conjugatesOf a` is the set of conjugates. 
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def ConjClasses.{u_1} (α : Type u_1) [Monoid α] : Type u_1
    def ConjClasses.{u_1} (α : Type u_1)
      [Monoid α] : Type u_1
    The quotient type of conjugacy classes of a group. 
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def ConjClasses.carrier.{u} {α : Type u} [Monoid α] : ConjClasses α → Set α
    def ConjClasses.carrier.{u} {α : Type u}
      [Monoid α] : ConjClasses α → Set α
    Given a conjugacy class `a`, `carrier a` is the set it represents. 
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def IsConj.{u} {α : Type u} [Monoid α] (a b : α) : Prop
    def IsConj.{u} {α : Type u} [Monoid α]
      (a b : α) : Prop
    We say that `a` is conjugate to `b` if for some unit `c` we have `c * a * c⁻¹ = b`. 
  • theoremdefined in Mathlib/GroupTheory/OrderOfElement.lean
    complete
    theorem SemiconjBy.orderOf_eq.{u_1} {G : Type u_1} [Group G] (a : G) {x y : G}
      (h : SemiconjBy a x y) : orderOf x = orderOf y
    theorem SemiconjBy.orderOf_eq.{u_1} {G : Type u_1}
      [Group G] (a : G) {x y : G}
      (h : SemiconjBy a x y) :
      orderOf x = orderOf y
Definition8.3.33
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Power classes. (LMFDB)

If G is a group, g\in G is an element of a conjugacy class P, and n is a positive integer, then nP denotes the conjugacy class of the element g^n.

Tau Ceti Review: ConjClasses.pow, ConjClasses.mk_pow.

Depends on: Definition 8.3.3 Definition 8.3.32

Lean code for Definition8.3.33●2 declarations
  • defdefined in TauCeti/Algebra/Group/Conj.lean
    complete
    def ConjClasses.pow.{u_1} {M : Type u_1} [Monoid M] (C : ConjClasses M)
      (j : ℕ) : ConjClasses M
    def ConjClasses.pow.{u_1} {M : Type u_1}
      [Monoid M] (C : ConjClasses M) (j : ℕ) :
      ConjClasses M
    **The `j`-th power of a conjugacy class.** Powering respects conjugacy (`IsConj.pow`), so it
    descends to the conjugacy classes of a monoid: `C.pow j` is the class of the `j`-th powers of the
    members of `C`. The `Pow` instance below spells it `C ^ j`, which is the form every lemma here
    is stated in. 
  • theoremdefined in TauCeti/Algebra/Group/Conj.lean
    complete
    theorem ConjClasses.mk_pow.{u_1} {M : Type u_1} [Monoid M] (a : M) (j : ℕ) :
      ConjClasses.mk a ^ j = ConjClasses.mk (a ^ j)
    theorem ConjClasses.mk_pow.{u_1} {M : Type u_1}
      [Monoid M] (a : M) (j : ℕ) :
      ConjClasses.mk a ^ j =
        ConjClasses.mk (a ^ j)
    The `j`-th power of the class of `a` is the class of `a ^ j`. 
Definition8.3.34
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.1.21
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Core of a subgroup. (LMFDB)

If H is a subgroup of a group G, then the core of H is

\bigcap_{g\in G} g^{-1} H g .

It is the largest normal subgroup of G contained in H.

Tau Ceti Review: Subgroup.normalCore.

Depends on: Definition 8.3.3 Definition 8.3.160

Lean code for Definition8.3.34●2 declarations
  • defdefined in Mathlib/Algebra/Group/Subgroup/Basic.lean
    complete
    def Subgroup.normalCore.{u_1} {G : Type u_1} [Group G] (H : Subgroup G) :
      Subgroup G
    def Subgroup.normalCore.{u_1} {G : Type u_1}
      [Group G] (H : Subgroup G) : Subgroup G
    The normal core of a subgroup `H` is the largest normal subgroup of `G` contained in `H`,
    as shown by `Subgroup.normalCore_eq_iSup`. 
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Basic.lean
    complete
    theorem Subgroup.normalCore_eq_iSup.{u_1} {G : Type u_1} [Group G]
      (H : Subgroup G) :
      H.normalCore = ⨆ N, ⨆ (_ : N.Normal), ⨆ (_ : N ≤ H), N
    theorem Subgroup.normalCore_eq_iSup.{u_1}
      {G : Type u_1} [Group G]
      (H : Subgroup G) :
      H.normalCore =
        ⨆ N,
          ⨆ (_ : N.Normal), ⨆ (_ : N ≤ H), N
Definition8.3.35
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.3.118
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Coset of a subgroup. (LMFDB)

If G is a group and H is a subgroup of G, then a left coset of H is a set

gH = \{ gh \mid h \in H\}

and similarly, a right coset of H is a set

Hg = \{ hg \mid h \in H\}.

The left cosets partition G, as do the right cosets.

Tau Ceti Review: QuotientGroup.leftRel, QuotientGroup.rightRel, QuotientGroup.eq_class_eq_leftCoset.

Depends on: Definition 8.3.3 Definition 8.3.160

Lean code for Definition8.3.35●4 declarations
  • defdefined in Mathlib/GroupTheory/Coset/Defs.lean
    complete
    def QuotientGroup.leftRel.{u_1} {α : Type u_1} [Group α] (s : Subgroup α) :
      Setoid α
    def QuotientGroup.leftRel.{u_1} {α : Type u_1}
      [Group α] (s : Subgroup α) : Setoid α
    The equivalence relation corresponding to the partition of a group by left cosets
    of a subgroup. 
  • defdefined in Mathlib/GroupTheory/Coset/Defs.lean
    complete
    def QuotientGroup.rightRel.{u_1} {α : Type u_1} [Group α] (s : Subgroup α) :
      Setoid α
    def QuotientGroup.rightRel.{u_1}
      {α : Type u_1} [Group α]
      (s : Subgroup α) : Setoid α
    The equivalence relation corresponding to the partition of a group by right cosets of a
    subgroup. 
  • theoremdefined in Mathlib/GroupTheory/Coset/Basic.lean
    complete
    theorem QuotientGroup.eq_class_eq_leftCoset.{u_1} {α : Type u_1} [Group α]
      (s : Subgroup α) (g : α) : {x | ↑x = ↑g} = g • ↑s
    theorem QuotientGroup.eq_class_eq_leftCoset.{u_1}
      {α : Type u_1} [Group α]
      (s : Subgroup α) (g : α) :
      {x | ↑x = ↑g} = g • ↑s
  • theoremdefined in Mathlib/GroupTheory/Coset/Basic.lean
    complete
    theorem QuotientGroup.rightRel_r_eq_rightCosetEquivalence.{u_1} {α : Type u_1}
      [Group α] (s : Subgroup α) :
      ⇑(QuotientGroup.rightRel s) = RightCosetEquivalence ↑s
    theorem QuotientGroup.rightRel_r_eq_rightCosetEquivalence.{u_1}
      {α : Type u_1} [Group α]
      (s : Subgroup α) :
      ⇑(QuotientGroup.rightRel s) =
        RightCosetEquivalence ↑s
Definition8.3.36
Statement uses 8
Statement dependency previews
Preview
Definition 8.3.14
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Coxeter group. (LMFDB)

A finite Coxeter group is a finite group G which has a group presentation of the form

G = \langle s_1, s_2, \dots, s_n \mid (s_i s_j)^{m_{ij}} = 1 \rangle,

where m_{ii} = 1 for all i = 1, \dots, n, and where m_{ij} = m_{ji} \geq 2 for all i \not = j. Examples of Coxeter groups include all Euclidean reflection groups (e.g. the triangle group).

Given a Coxeter group G with the above group presentation, one can define the Coxeter graph of G to be a graph with n vertices, labelled 1 to n, with an edge between vertex i and vertex j if and only if m_{ij} \geq 3. If m_{ij} \geq 4, then the edge between i and j is furthermore given a value of m_{ij}.

A finite irreducible Coxeter group is a Coxeter group whose Coxeter graph is connected.

All finite irreducible Coxeter groups have been classified - every such group lies in either one of the four families W(A_n), W(B_n), W(D_n), I_2(n), or is one of the six exceptional groups W(E_6), W(E_7), W(E_8), W(F_4), H_3, or H_4.

  • W(A_n) is isomorphic to the symmetric group S_{n+1} of order (n+1)!.

  • W(B_n) is a group of order 2^n n!, whose group structure can be written as a wreath product C_2 \wr S_n.

  • W(D_n) is a group of order 2^{n-1} n!, whose group structure can be written as C_2^{n-1} . S_n.

  • I_2(n) is isomorphic to the dihedral group D_n of order 2n.

Every finite Coxeter group is a direct product of finite irreducible Coxeter groups. In the LMFDB, we use the notation W( \_ ) to denote irreducible Coxeter groups which are also Weyl groups. This avoids a clash of notation with the alternating group A_n, the dihedral group D_n, and the Frobenius group F_n.

Depends on: Definition 8.3.14 Definition 8.3.40 Definition 8.3.41 Definition 8.3.50 Definition 8.3.97 Definition 8.3.176 Definition 8.3.180 Definition 8.3.188

Definition8.3.37
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 17
Reverse dependency previews
Preview
Definition 4.7.8
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Cyclic group. (LMFDB)

A group G is cyclic if it can be generated by one element.

Tau Ceti Review: IsCyclic.

Depends on: Definition 8.3.3 Definition 8.3.60

Lean code for Definition8.3.37●1 definition
  • class(1 method)defined in Mathlib/Algebra/Group/DivInvMonoid.lean
    complete
    class IsCyclic.{u_2} (G : Type u_2) [Pow G ℤ] : Prop
    class IsCyclic.{u_2} (G : Type u_2) [Pow G ℤ] :
      Prop
    A group is called *cyclic* if it is generated by a single element. 
    
    [Wikidata Q245462](https://www.wikidata.org/wiki/Q245462)
    exists_zpow_surjective : ∃ g, Function.Surjective fun x => g ^ x
Definition8.3.38
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.69
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Derived series of a group. (LMFDB)

The derived series of a finite group G is the chain of subgroups

G =G^{(0)}\rhd G^{(1)} \rhd G^{(2)} \rhd \cdots \rhd G^{(k)}

where G^{(i+1)} is the commutator subgroup of G^{(i)} for all i, each inclusion is proper, and G^{(k+1)}=G^{(k)}. The final index k is the derived length of G.

A group is solvable if and only if G^{(k)}=\langle e\rangle.

Depends on: Definition 8.3.3 Definition 8.3.28 Definition 8.3.113 Definition 8.3.149

Lean code for Definition8.3.38●6 declarations
  • defdefined in Mathlib/GroupTheory/Solvable.lean
    complete
    def derivedSeries.{u_1} (G : Type u_1) [Group G] : ℕ → Subgroup G
    def derivedSeries.{u_1} (G : Type u_1)
      [Group G] : ℕ → Subgroup G
    The derived series of the group `G`, obtained by starting from the subgroup `⊤` and repeatedly
    taking the commutator of the previous subgroup with itself for `n` times. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/DerivedLength.lean
    complete
    def derivedLength.{u_1} (G : Type u_1) [Group G] : ℕ
    def derivedLength.{u_1} (G : Type u_1)
      [Group G] : ℕ
    The **derived length** (LMFDB `group.derived_series`) of `G`, the least `k` such that
    `G⁽ᵏ⁺¹⁾ = G⁽ᵏ⁾` in the derived series `G = G⁽⁰⁾ ⊵ G⁽¹⁾ ⊵ ⋯`. Such a `k` exists for finite `G`;
    otherwise this is `0` by convention. For solvable `G` it is the least `k` with `G⁽ᵏ⁾ = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/DerivedLength.lean
    complete
    theorem derivedSeries_succ_derivedLength.{u_1} {G : Type u_1} [Group G]
      [Finite G] :
      derivedSeries G (derivedLength G + 1) =
        derivedSeries G (derivedLength G)
    theorem derivedSeries_succ_derivedLength.{u_1}
      {G : Type u_1} [Group G] [Finite G] :
      derivedSeries G (derivedLength G + 1) =
        derivedSeries G (derivedLength G)
    The derived series of a finite group is stationary from its derived length on. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableSeries.lean
    complete
    theorem derivedSeries_succ_lt_of_lt_derivedLength.{u_1} {G : Type u_1} [Group G]
      {i : ℕ} (hi : i < derivedLength G) :
      derivedSeries G (i + 1) < derivedSeries G i
    theorem derivedSeries_succ_lt_of_lt_derivedLength.{u_1}
      {G : Type u_1} [Group G] {i : ℕ}
      (hi : i < derivedLength G) :
      derivedSeries G (i + 1) <
        derivedSeries G i
    **The inclusions of the derived series below the derived length are proper** (LMFDB
    `group.derived_series`): `G⁽ⁱ⁺¹⁾ < G⁽ⁱ⁾` for `i < k`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableSeries.lean
    complete
    theorem Group.isSolvable_iff_derivedSeries_derivedLength_eq_bot.{u_1}
      {G : Type u_1} [Group G] :
      Group.IsSolvable G ↔ derivedSeries G (derivedLength G) = ⊥
    theorem Group.isSolvable_iff_derivedSeries_derivedLength_eq_bot.{u_1}
      {G : Type u_1} [Group G] :
      Group.IsSolvable G ↔
        derivedSeries G (derivedLength G) = ⊥
    **A group is solvable if and only if `G⁽ᵏ⁾ = 1` for its derived length `k`** (LMFDB
    `group.derived_series`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableSeries.lean
    complete
    theorem Group.exists_subnormalSeries_iff_derivedSeries_derivedLength_eq_bot.{u_1}
      {G : Type u_1} [Group G] :
      (∃ s, ∀ (i : Fin s.length), IsMulCommutative (s.factor i)) ↔
        derivedSeries G (derivedLength G) = ⊥
    theorem Group.exists_subnormalSeries_iff_derivedSeries_derivedLength_eq_bot.{u_1}
      {G : Type u_1} [Group G] :
      (∃ s,
          ∀ (i : Fin s.length),
            IsMulCommutative (s.factor i)) ↔
        derivedSeries G (derivedLength G) = ⊥
    **A group has a subnormal series with abelian factors if and only if `G⁽ᵏ⁾ = 1` for its
    derived length `k`** (LMFDB `group.derived_series`, with solvability as in LMFDB
    `group.solvable`). 
Definition8.3.39
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.40
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Dicyclic group. (LMFDB)

A dicyclic group of order 4n, denoted \mathrm{Dic}_n or Q_{4n}, is a non-split extension of a cyclic group of order 2n by a cyclic group of order 2. That is, \mathrm{Dic}_n has a subgroup of index 2 which is cyclic, but it is not a semidirect product of that subgroup and a subgroup of order 2.

The dicyclic group of order 4n can be given by generators and relations: \langle a,b \mid a^{2n}, a^n b^{-2}, bab^{-1}a\rangle.

The group \textrm{Dic}_2 is isomorphic to the quaternion group of order 8.

Tau Ceti Review: DihedralGroup, QuaternionGroup, QuaternionGroup.card, TauCeti.isCyclic_quaternionRotations, TauCeti.index_quaternionRotations.

Depends on: Definition 8.3.3 Definition 8.3.37 Definition 8.3.97 Definition 8.3.138

Lean code for Definition8.3.39●8 declarations
  • inductive(2 constructors, 1 parameter)defined in Mathlib/GroupTheory/SpecificGroups/Dihedral.lean
    complete
    inductive DihedralGroup (n : ℕ) : Type
    inductive DihedralGroup (n : ℕ) : Type
    For `n ≠ 0`, `DihedralGroup n` represents the symmetry group of the regular `n`-gon.
    `r i` represents the rotations of the `n`-gon by `2πi/n`, and `sr i` represents the reflections of
    the `n`-gon. `DihedralGroup 0` corresponds to the infinite dihedral group.
    
    DihedralGroup.r {n : ℕ} : ZMod n → DihedralGroup n
    DihedralGroup.sr {n : ℕ} : ZMod n → DihedralGroup n
  • inductive(2 constructors, 1 parameter)defined in Mathlib/GroupTheory/SpecificGroups/Quaternion.lean
    complete
    inductive QuaternionGroup (n : ℕ) : Type
    inductive QuaternionGroup (n : ℕ) : Type
    The (generalised) quaternion group `QuaternionGroup n` of order `4n`. It can be defined by the
    presentation $\langle a, x | a^{2n} = 1, x^2 = a^n, x^{-1}ax=a^{-1}\rangle$. We write `a i` for
    $a^i$ and `xa i` for $x * a^i$.
    
    QuaternionGroup.a {n : ℕ} : ZMod (2 * n) → QuaternionGroup n
    QuaternionGroup.xa {n : ℕ} :
      ZMod (2 * n) → QuaternionGroup n
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Quaternion.lean
    complete
    theorem QuaternionGroup.card {n : ℕ} [NeZero n] :
      Fintype.card (QuaternionGroup n) = 4 * n
    theorem QuaternionGroup.card {n : ℕ} [NeZero n] :
      Fintype.card (QuaternionGroup n) = 4 * n
    If `0 < n`, then `QuaternionGroup n` has `4n` elements.
    
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetacyclicPresentation.lean
    complete
    def QuaternionGroup.presentedGroupMulEquiv (n : ℕ) [NeZero n] :
      PresentedGroup (QuaternionGroup.relators n) ≃* QuaternionGroup n
    def QuaternionGroup.presentedGroupMulEquiv
      (n : ℕ) [NeZero n] :
      PresentedGroup
          (QuaternionGroup.relators n) ≃*
        QuaternionGroup n
    **The presentation `Dicₙ = ⟨a, b | a²ⁿ, aⁿ b⁻², b a b⁻¹ a⟩` of Mathlib's
    `QuaternionGroup n`** (LMFDB `group.dicyclic`, `group.generalized_quaternion`), for `n ≠ 0`: the
    isomorphism sends `a` to `a 1` and `b` to `xa 0`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    theorem QuaternionGroup.not_isComplement'_quaternionRotations {m : ℕ} [NeZero m]
      (K : Subgroup (QuaternionGroup m)) :
      ¬(TauCeti.quaternionRotations m).IsComplement' K
    theorem QuaternionGroup.not_isComplement'_quaternionRotations
      {m : ℕ} [NeZero m]
      (K : Subgroup (QuaternionGroup m)) :
      ¬(TauCeti.quaternionRotations
              m).IsComplement'
          K
    **The cyclic subgroup of index `2` of the dicyclic group `Dicₘ` has no complement** (LMFDB
    `group.dicyclic`, `group.generalized_quaternion`, `group.dihedral`), so `Dicₘ` is a non-split
    extension of `C₂ₘ` by `C₂`: an element of order `2` of a complement would lie outside the rotation
    subgroup, but every element `xa i` outside it squares to `a m ≠ 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    theorem nonempty_mulEquiv_quaternionGroup_of_forall_not_isComplement'.{u_1}
      {E : Type u_1} [Group E] {N : Subgroup E} [Finite E] [IsCyclic ↥N]
      (hN : N.index = 2) (hinv : ∀ g ∉ N, ∀ y ∈ N, g * y * g⁻¹ = y⁻¹)
      (hns : ∀ (K : Subgroup E), ¬N.IsComplement' K) {m : ℕ}
      (hm : Nat.card ↥N = 2 * m) : Nonempty (E ≃* QuaternionGroup m)
    theorem nonempty_mulEquiv_quaternionGroup_of_forall_not_isComplement'.{u_1}
      {E : Type u_1} [Group E]
      {N : Subgroup E} [Finite E]
      [IsCyclic ↥N] (hN : N.index = 2)
      (hinv :
        ∀ g ∉ N, ∀ y ∈ N, g * y * g⁻¹ = y⁻¹)
      (hns :
        ∀ (K : Subgroup E),
          ¬N.IsComplement' K)
      {m : ℕ} (hm : Nat.card ↥N = 2 * m) :
      Nonempty (E ≃* QuaternionGroup m)
    **The non-split extension of `C₂ₘ` by `C₂` acting by inversion is the dicyclic group `Dicₘ`**
    (LMFDB `group.dihedral`, `group.dicyclic`): a finite group with a cyclic subgroup `N` of order
    `2m` and index `2` with no complement, on which the elements outside `N` act by inversion, is
    isomorphic to `QuaternionGroup m`. A generator `a` of `N` and any `b ∉ N` satisfy the relations
    `a²ᵐ = 1`, `aᵐ = b²`, `b a b⁻¹ = a⁻¹` of `Dicₘ`, since `b²` is the element of order `2` of `N`. 
  • theoremdefined in TauCeti/GroupTheory/SpecificGroups/Quaternion/Basic.lean
    complete
    theorem TauCeti.isCyclic_quaternionRotations (n : ℕ) :
      IsCyclic ↥(TauCeti.quaternionRotations n)
    theorem TauCeti.isCyclic_quaternionRotations
      (n : ℕ) :
      IsCyclic
        ↥(TauCeti.quaternionRotations n)
  • theoremdefined in TauCeti/GroupTheory/SpecificGroups/Quaternion/Basic.lean
    complete
    theorem TauCeti.index_quaternionRotations (n : ℕ) :
      (TauCeti.quaternionRotations n).index = 2
    theorem TauCeti.index_quaternionRotations
      (n : ℕ) :
      (TauCeti.quaternionRotations n).index =
        2
    The quaternion rotation subgroup has index two. 
Definition8.3.40
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.39
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 8.2.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Dihedral group. (LMFDB)

The dihedral group is the set of symmetries of a regular n-gon under the operation of composition. It consists of n rotations and n reflections, has order 2n, and can be generated by one rotation of order n and one reflection of order 2.

D_n = \langle g,h \mid g^n=h^2=1, hg=g^{-1}h \rangle = \{e,g,g_2,...,g_{n-1},h,gh,...,g_{n-1}h\}.

It is the split extension C_n\rtimes C_2 with C_2 acting by -1. The non-split extension in this case is the dicyclic group.

Tau Ceti Review: DihedralGroup.

Depends on: Definition 8.3.39 Definition 8.3.97

Lean code for Definition8.3.40●6 declarations
  • inductive(2 constructors, 1 parameter)defined in Mathlib/GroupTheory/SpecificGroups/Dihedral.lean
    complete
    inductive DihedralGroup (n : ℕ) : Type
    inductive DihedralGroup (n : ℕ) : Type
    For `n ≠ 0`, `DihedralGroup n` represents the symmetry group of the regular `n`-gon.
    `r i` represents the rotations of the `n`-gon by `2πi/n`, and `sr i` represents the reflections of
    the `n`-gon. `DihedralGroup 0` corresponds to the infinite dihedral group.
    
    DihedralGroup.r {n : ℕ} : ZMod n → DihedralGroup n
    DihedralGroup.sr {n : ℕ} : ZMod n → DihedralGroup n
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/DihedralSymmetries.lean
    complete
    def regularPolygonSymmetriesMulEquiv {n : ℕ} (hn : 2 ≤ n) :
      DihedralGroup n ≃* ↥(regularPolygonSymmetries n)
    def regularPolygonSymmetriesMulEquiv {n : ℕ}
      (hn : 2 ≤ n) :
      DihedralGroup n ≃*
        ↥(regularPolygonSymmetries n)
    **The dihedral group `Dₙ` is the symmetry group of the regular `n`-gon** (LMFDB
    `group.dihedral`), for `n ≥ 2`: the rotation `r i` acts as the rotation `z ↦ e^{2πii/n} z` and the
    reflection `sr i` as the reflection `z ↦ conj (e^{2πii/n} z)`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetacyclicPresentation.lean
    complete
    def DihedralGroup.presentedGroupMulEquiv (n : ℕ) [NeZero n] :
      PresentedGroup (DihedralGroup.relators n) ≃* DihedralGroup n
    def DihedralGroup.presentedGroupMulEquiv
      (n : ℕ) [NeZero n] :
      PresentedGroup
          (DihedralGroup.relators n) ≃*
        DihedralGroup n
    **The presentation `Dₙ = ⟨g, h | gⁿ = h² = 1, hg = g⁻¹h⟩` of the dihedral group** (LMFDB
    `group.dihedral`), for `n ≠ 0`: the isomorphism sends `g` to the rotation `r 1` and `h` to the
    reflection `sr 0`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    def DihedralGroup.mulEquivSemidirectProduct (n : ℕ) [NeZero n] :
      DihedralGroup n ≃*
        Multiplicative (ZMod n) ⋊[ZMod.involutionMulAut (-1) ⋯]
          Multiplicative (ZMod 2)
    def DihedralGroup.mulEquivSemidirectProduct
      (n : ℕ) [NeZero n] :
      DihedralGroup n ≃*
        Multiplicative
            (ZMod
              n) ⋊[ZMod.involutionMulAut (-1)
            ⋯]
          Multiplicative (ZMod 2)
    **The dihedral group `Dₙ` is the split extension `Cₙ ⋊ C₂` with `C₂` acting by `-1`** (LMFDB
    `group.dihedral`), for `n ≠ 0`: the isomorphism sends the rotation `r 1` to the generator of `Cₙ`
    and the reflection `sr 0` to that of `C₂`, which acts by `x ↦ x⁻¹`
    (`DihedralGroup.involutionMulAut_neg_one_apply`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    theorem nonempty_mulEquiv_quaternionGroup_of_forall_not_isComplement'.{u_1}
      {E : Type u_1} [Group E] {N : Subgroup E} [Finite E] [IsCyclic ↥N]
      (hN : N.index = 2) (hinv : ∀ g ∉ N, ∀ y ∈ N, g * y * g⁻¹ = y⁻¹)
      (hns : ∀ (K : Subgroup E), ¬N.IsComplement' K) {m : ℕ}
      (hm : Nat.card ↥N = 2 * m) : Nonempty (E ≃* QuaternionGroup m)
    theorem nonempty_mulEquiv_quaternionGroup_of_forall_not_isComplement'.{u_1}
      {E : Type u_1} [Group E]
      {N : Subgroup E} [Finite E]
      [IsCyclic ↥N] (hN : N.index = 2)
      (hinv :
        ∀ g ∉ N, ∀ y ∈ N, g * y * g⁻¹ = y⁻¹)
      (hns :
        ∀ (K : Subgroup E),
          ¬N.IsComplement' K)
      {m : ℕ} (hm : Nat.card ↥N = 2 * m) :
      Nonempty (E ≃* QuaternionGroup m)
    **The non-split extension of `C₂ₘ` by `C₂` acting by inversion is the dicyclic group `Dicₘ`**
    (LMFDB `group.dihedral`, `group.dicyclic`): a finite group with a cyclic subgroup `N` of order
    `2m` and index `2` with no complement, on which the elements outside `N` act by inversion, is
    isomorphic to `QuaternionGroup m`. A generator `a` of `N` and any `b ∉ N` satisfy the relations
    `a²ᵐ = 1`, `aᵐ = b²`, `b a b⁻¹ = a⁻¹` of `Dicₘ`, since `b²` is the element of order `2` of `N`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    theorem QuaternionGroup.not_isComplement'_quaternionRotations {m : ℕ} [NeZero m]
      (K : Subgroup (QuaternionGroup m)) :
      ¬(TauCeti.quaternionRotations m).IsComplement' K
    theorem QuaternionGroup.not_isComplement'_quaternionRotations
      {m : ℕ} [NeZero m]
      (K : Subgroup (QuaternionGroup m)) :
      ¬(TauCeti.quaternionRotations
              m).IsComplement'
          K
    **The cyclic subgroup of index `2` of the dicyclic group `Dicₘ` has no complement** (LMFDB
    `group.dicyclic`, `group.generalized_quaternion`, `group.dihedral`), so `Dicₘ` is a non-split
    extension of `C₂ₘ` by `C₂`: an element of order `2` of a complement would lie outside the rotation
    subgroup, but every element `xa i` outside it squares to `a m ≠ 1`. 
Definition8.3.41
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.4.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Direct product of groups. (LMFDB)

Given two groups G_1 and G_2 with operations *_1 and *_2, the direct product of sets G_1\times G_2 is a group under the operation

(a_1, a_2)*(b_1, b_2) = (a_1*_1 b_1, a_2 *_2 b_2).

This has normal subgroups

H_1=\{(a,e_2) \mid a \in G_1\}\cong G_1

and

H_2=\{(e_1,a) \mid a \in G_2\}\cong G_2

such that H_1\cap H_2 = \{(e_1,e_2)\} and H_1H_2=G_1\times G_2.

Conversely, if a group G has normal subgroups H and K such that H\cap K=\{e\} and HK=G, then G\cong H\times K. We call H and K a direct factors of G in this case.

Tau Ceti Review: Prod.mk_mul_mk, Prod.mk_left_injective.

Depends on: Definition 8.3.3 Definition 8.3.167

Lean code for Definition8.3.41●5 declarations
  • theoremdefined in Mathlib/Algebra/Notation/Prod.lean
    complete
    theorem Prod.mk_mul_mk.{u_7, u_8} {M : Type u_7} {N : Type u_8} [Mul M] [Mul N]
      (a₁ a₂ : M) (b₁ b₂ : N) : (a₁, b₁) * (a₂, b₂) = (a₁ * a₂, b₁ * b₂)
    theorem Prod.mk_mul_mk.{u_7, u_8} {M : Type u_7}
      {N : Type u_8} [Mul M] [Mul N]
      (a₁ a₂ : M) (b₁ b₂ : N) :
      (a₁, b₁) * (a₂, b₂) = (a₁ * a₂, b₁ * b₂)
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/InternalDirectProduct.lean
    complete
    theorem MonoidHom.isDirectFactors_range_inl_range_inr.{u_1, u_2} (G₁ : Type u_1)
      (G₂ : Type u_2) [Group G₁] [Group G₂] :
      (MonoidHom.inl G₁ G₂).range.IsDirectFactors
        (MonoidHom.inr G₁ G₂).range
    theorem MonoidHom.isDirectFactors_range_inl_range_inr.{u_1,
        u_2}
      (G₁ : Type u_1) (G₂ : Type u_2)
      [Group G₁] [Group G₂] :
      (MonoidHom.inl G₁
              G₂).range.IsDirectFactors
        (MonoidHom.inr G₁ G₂).range
    **The factors of a direct product are direct factors** (LMFDB `group.direct_product`): the
    subgroups `H₁ = {(a, e₂)}` and `H₂ = {(e₁, a)}` of `G₁ × G₂` are normal, `H₁ ∩ H₂ = {(e₁, e₂)}`
    and `H₁H₂ = G₁ × G₂`. 
  • theoremdefined in Mathlib/Data/Prod/Basic.lean
    complete
    theorem Prod.mk_left_injective.{u_5, u_6} {α : Type u_5} {β : Type u_6}
      (b : β) : Function.Injective fun a => (a, b)
    theorem Prod.mk_left_injective.{u_5, u_6}
      {α : Type u_5} {β : Type u_6} (b : β) :
      Function.Injective fun a => (a, b)
  • structure(4 fields)defined in LeanBridge/ForMathlib/GroupTheory/InternalDirectProduct.lean
    complete
    structure Subgroup.IsDirectFactors.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    structure Subgroup.IsDirectFactors.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    Normal subgroups `H` and `K` of `G` are **direct factors** of `G` (LMFDB
    `group.direct_product`) if `H ∩ K = {e}` and `HK = G`; then `G ≅ H × K`
    (`Subgroup.IsDirectFactors.mulEquiv`). 
    normal_left : H.Normal
    The first factor is normal. 
    normal_right : K.Normal
    The second factor is normal. 
    disjoint : Disjoint H K
    The factors meet trivially, `H ∩ K = {e}`. 
    mul_eq_univ : ↑H * ↑K = Set.univ
    The factors generate the group as a product of sets, `HK = G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/InternalDirectProduct.lean
    complete
    def Subgroup.IsDirectFactors.mulEquiv.{u_1} {G : Type u_1} [Group G]
      {H K : Subgroup G} (h : H.IsDirectFactors K) : ↥H × ↥K ≃* G
    def Subgroup.IsDirectFactors.mulEquiv.{u_1}
      {G : Type u_1} [Group G]
      {H K : Subgroup G}
      (h : H.IsDirectFactors K) : ↥H × ↥K ≃* G
    The **isomorphism `H × K ≃* G`**, `(h, k) ↦ hk`, of two direct factors `H` and `K` of `G`
    (LMFDB `group.direct_product`). 
Definition8.3.42
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 8.1.16
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Divisions of a group. (LMFDB)

A division (or rational conjugacy classes) of a finite group G is an equivalence class under the following relation: x \sim y if there exist g \in G and n \in \Z relatively prime to the order of x with y = g^{-1} x^n g. It is a coarsening of conjugacy: any division is a union of conjugacy classes.

Just as values of characters are constant on conjugacy classes, values of rational characters are constant on rational conjugacy classes.

Depends on: Definition 8.3.3 Definition 8.3.32 Definition 8.3.45 Definition 8.3.125

Lean code for Definition8.3.42●6 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    def IsRationallyConj.{u_1} {G : Type u_1} [Group G] (x y : G) : Prop
    def IsRationallyConj.{u_1} {G : Type u_1}
      [Group G] (x y : G) : Prop
    Two elements `x` and `y` of `G` are **rationally conjugate** (LMFDB `group.division`) if
    `y = g⁻¹ xⁿ g` for some `g ∈ G` and some `n ∈ ℤ` coprime to the order of `x`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    theorem IsRationallyConj.equivalence.{u_1} {G : Type u_1} [Group G] :
      Equivalence IsRationallyConj
    theorem IsRationallyConj.equivalence.{u_1}
      {G : Type u_1} [Group G] :
      Equivalence IsRationallyConj
    Rational conjugacy is an equivalence relation. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    def IsRationallyConj.setoid.{u_1} (G : Type u_1) [Group G] : Setoid G
    def IsRationallyConj.setoid.{u_1}
      (G : Type u_1) [Group G] : Setoid G
    The **rational conjugacy** setoid (LMFDB `group.division`) on `G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    def RatConjClasses.{u_1} (G : Type u_1) [Group G] : Type u_1
    def RatConjClasses.{u_1} (G : Type u_1)
      [Group G] : Type u_1
    The **divisions** or **rational conjugacy classes** (LMFDB `group.division`) of `G`, the
    equivalence classes of rational conjugacy. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    theorem IsConj.isRationallyConj.{u_1} {G : Type u_1} [Group G] {x y : G}
      (h : IsConj x y) : IsRationallyConj x y
    theorem IsConj.isRationallyConj.{u_1}
      {G : Type u_1} [Group G] {x y : G}
      (h : IsConj x y) : IsRationallyConj x y
    Conjugate elements are rationally conjugate. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    theorem FDRep.IsRationalCharacter.character_eq_of_isRationallyConj {G : Type}
      [Group G] {Y : FDRep ℂ G} [Finite G] {x y : G}
      (hY : Y.IsRationalCharacter) (h : IsRationallyConj x y) :
      Y.character x = Y.character y
    theorem FDRep.IsRationalCharacter.character_eq_of_isRationallyConj
      {G : Type} [Group G] {Y : FDRep ℂ G}
      [Finite G] {x y : G}
      (hY : Y.IsRationalCharacter)
      (h : IsRationallyConj x y) :
      Y.character x = Y.character y
    **A rational character is constant on the rational conjugacy classes** (LMFDB
    `group.representation.rational_character`): a character is constant on conjugacy classes, and its
    values at `g` and at `g ^ k`, `k` prime to the order of `g`, are conjugate by an automorphism of
    `ℂ`, which fixes a rational value. 
Definition8.3.43
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Maximal division of a group. (LMFDB)

A division (or rational conjugacy classes) of a finite group G is maximal if if a representative generates a maximal cyclic subgroup of G.

Depends on: Definition 8.3.3 Definition 8.3.42

Lean code for Definition8.3.43●3 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    def RatConjClasses.IsMaximal.{u_1} {G : Type u_1} [Group G]
      (d : RatConjClasses G) : Prop
    def RatConjClasses.IsMaximal.{u_1}
      {G : Type u_1} [Group G]
      (d : RatConjClasses G) : Prop
    A division of `G` is **maximal** (LMFDB `group.division_maximal`) if a representative
    generates a maximal cyclic subgroup of `G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    def Subgroup.IsMaximalCyclic.{u_1} {G : Type u_1} [Group G]
      (H : Subgroup G) : Prop
    def Subgroup.IsMaximalCyclic.{u_1}
      {G : Type u_1} [Group G]
      (H : Subgroup G) : Prop
    A subgroup is a **maximal cyclic subgroup** of `G` if it is cyclic and not properly contained
    in a cyclic subgroup of `G`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    theorem RatConjClasses.isMaximal_mk_iff.{u_1} {G : Type u_1} [Group G] {x : G} :
      (RatConjClasses.mk x).IsMaximal ↔ (Subgroup.zpowers x).IsMaximalCyclic
    theorem RatConjClasses.isMaximal_mk_iff.{u_1}
      {G : Type u_1} [Group G] {x : G} :
      (RatConjClasses.mk x).IsMaximal ↔
        (Subgroup.zpowers x).IsMaximalCyclic
    Maximality of a division does not depend on the representative: the division of `x` is
    maximal if and only if `x` generates a maximal cyclic subgroup. 
Definition8.3.44
uses 1used by 0XL∃∀N

Small and large divisions of a group. (LMFDB)

A maximal division of a group is either small or large (and not both), according to the following process.

Consider a division consisting of n conjugacy classes, each of size m with elements of order r. If n \ge |G| / 2000 and either n \ge 20000 or n^2 \ge |G|, then the division is considered large. Otherwise, for divisions that don't meet these criteria, we compute the intersections down chains of maximal subgroups (i.e., with maximal subgroups, their maximal subgroups, etc.), greedily minimizing the intersection. If we are able to decrease the size of the intersection below a threshold then we consider the division small; if the process terminates in a step where the remaining elements do not intersect nontrivially with any of the next steps in the subgroup tree, and we're still above the threshold, then we also consider the original division large.

Depends on: Definition 8.3.43

Definition8.3.45
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 8
Reverse dependency previews
Preview
Definition 4.1.126
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Order of a group element. (LMFDB)

The order of an element g in a multiplicative group G is the least positive integer n such that g^n is the identity element of G, if such an integer exist, and is \infty otherwise. In an additive group, the order of g is the least positive integer n such that ng=0. In both cases, the order of g is also equal to the cardinality of the cyclic subgroup it generates.

Tau Ceti Review: orderOf, addOrderOf, orderOf_eq_zero_iff, Nat.card_zpowers.

Depends on: Definition 1.1.5 Definition 8.3.3 Definition 8.3.37 Definition 8.3.160

Lean code for Definition8.3.45●4 declarations
  • defdefined in Mathlib/GroupTheory/OrderOfElement.lean
    complete
    def orderOf.{u_1} {G : Type u_1} [Monoid G] (x : G) : ℕ
    def orderOf.{u_1} {G : Type u_1} [Monoid G]
      (x : G) : ℕ
    `orderOf x` is the order of the element `x`, i.e. the `n ≥ 1`, s.t. `x ^ n = 1` if it exists.
    Otherwise, i.e. if `x` is of infinite order, then `orderOf x` is `0` by convention. 
  • defdefined in Mathlib/GroupTheory/OrderOfElement.lean
    complete
    def addOrderOf.{u_1} {G : Type u_1} [AddMonoid G] (x : G) : ℕ
    def addOrderOf.{u_1} {G : Type u_1}
      [AddMonoid G] (x : G) : ℕ
    `addOrderOf a` is the order of the element `a`, i.e. the `n ≥ 1`, s.t. `n • a = 0` if it
    exists. Otherwise, i.e. if `a` is of infinite order, then `addOrderOf a` is `0` by convention. 
  • theoremdefined in Mathlib/GroupTheory/OrderOfElement.lean
    complete
    theorem orderOf_eq_zero_iff.{u_1} {G : Type u_1} [Monoid G] {x : G} :
      orderOf x = 0 ↔ ¬IsOfFinOrder x
    theorem orderOf_eq_zero_iff.{u_1} {G : Type u_1}
      [Monoid G] {x : G} :
      orderOf x = 0 ↔ ¬IsOfFinOrder x
  • theoremdefined in Mathlib/Data/ZMod/QuotientGroup.lean
    complete
    theorem Nat.card_zpowers.{u_2} {α : Type u_2} [Group α] (a : α) :
      Nat.card ↥(Subgroup.zpowers a) = orderOf a
    theorem Nat.card_zpowers.{u_2} {α : Type u_2}
      [Group α] (a : α) :
      Nat.card ↥(Subgroup.zpowers a) =
        orderOf a
    See also `Fintype.card_zpowers`. 
Definition8.3.46
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Elementary group. (LMFDB)

A finite group is p-elementary if it is the direct product of a cyclic group of order relatively prime to p and a p-group. Brauer's induction theorem states that any character of a finite group G is an integer linear combination of inductions of linear characters from elementary subgroups of G (for different primes p dividing the order of G).

Tau Ceti Review: TauCeti.IsElementary, TauCeti.IsPElementary, Subgroup.indClassFun.

Depends on: Definition 8.3.3 Definition 8.3.37 Definition 8.3.41 Definition 8.3.109 Definition 8.3.125

Lean code for Definition8.3.46●6 declarations
  • defdefined in TauCeti/GroupTheory/Elementary.lean
    complete
    def TauCeti.IsElementary.{u_1} (G : Type u_1) [Group G] : Prop
    def TauCeti.IsElementary.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group is **elementary** when it is `p`-elementary for some prime `p`. 
  • defdefined in TauCeti/GroupTheory/Elementary.lean
    complete
    def TauCeti.IsPElementary.{u_1} (p : ℕ) (G : Type u_1) [Group G] : Prop
    def TauCeti.IsPElementary.{u_1} (p : ℕ)
      (G : Type u_1) [Group G] : Prop
    A group `G` is **`p`-elementary** when it is the internal direct product of a cyclic subgroup
    of order prime to `p` and a `p`-subgroup: there are subgroups `C` and `P` of `G` with `C` cyclic of
    order prime to `p`, `P` a `p`-group, every element of `C` commuting with every element of `P`, and
    `C` a complement of `P`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/BrauerInductionLinear.lean
    complete
    theorem FDRep.character_mem_closure_indClassFun_linear_isElementary.{u}
      {k G : Type u} [Field k] [Group G] [Finite G] [CharZero k]
      [IsAlgClosed k] (V : FDRep k G) :
      V.character ∈
        AddSubgroup.closure
          {f |
            ∃ H χ,
              TauCeti.IsElementary ↥H ∧ (H.indClassFun fun h => ↑(χ h)) = f}
    theorem FDRep.character_mem_closure_indClassFun_linear_isElementary.{u}
      {k G : Type u} [Field k] [Group G]
      [Finite G] [CharZero k] [IsAlgClosed k]
      (V : FDRep k G) :
      V.character ∈
        AddSubgroup.closure
          {f |
            ∃ H χ,
              TauCeti.IsElementary ↥H ∧
                (H.indClassFun fun h =>
                    ↑(χ h)) =
                  f}
    **Brauer's induction theorem with linear characters** (LMFDB `group.elementary`): over an
    algebraically closed field of characteristic zero, every character of a finite group `G` is an
    integer linear combination of characters `Ind_H^G χ` induced from linear characters `χ : H →* kˣ`
    of elementary subgroups `H` of `G`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/BrauerInductionLinear.lean
    complete
    theorem FDRep.character_mem_closure_indClassFun_linear_isPElementary.{u}
      {k G : Type u} [Field k] [Group G] [Finite G] [CharZero k]
      [IsAlgClosed k] (V : FDRep k G) [Nontrivial G] :
      V.character ∈
        AddSubgroup.closure
          {f |
            ∃ p H χ,
              Nat.Prime p ∧
                p ∣ Nat.card G ∧
                  TauCeti.IsPElementary p ↥H ∧
                    (H.indClassFun fun h => ↑(χ h)) = f}
    theorem FDRep.character_mem_closure_indClassFun_linear_isPElementary.{u}
      {k G : Type u} [Field k] [Group G]
      [Finite G] [CharZero k] [IsAlgClosed k]
      (V : FDRep k G) [Nontrivial G] :
      V.character ∈
        AddSubgroup.closure
          {f |
            ∃ p H χ,
              Nat.Prime p ∧
                p ∣ Nat.card G ∧
                  TauCeti.IsPElementary p ↥H ∧
                    (H.indClassFun fun h =>
                        ↑(χ h)) =
                      f}
    **Brauer's induction theorem with linear characters and primes dividing `|G|`** (LMFDB
    `group.elementary`): for a nontrivial finite group `G`, the elementary subgroups in Brauer's
    theorem can be taken `p`-elementary for primes `p` dividing `|G|`, since an elementary subgroup
    that is `q`-elementary for a prime `q ∤ |G|` is cyclic, hence `p`-elementary for every `p`. 
  • defdefined in TauCeti/RepresentationTheory/Induction/ClassFunction.lean
    complete
    def Subgroup.indClassFun.{u, v} {k : Type u} {G : Type v} [Group G]
      [AddCommMonoid k] (S : Subgroup G) [S.FiniteIndex] (f : ↥S → k) :
      G → k
    def Subgroup.indClassFun.{u, v} {k : Type u}
      {G : Type v} [Group G] [AddCommMonoid k]
      (S : Subgroup G) [S.FiniteIndex]
      (f : ↥S → k) : G → k
    **The induced class function.**  For `f : S → k` and `g : G`, sum `f (t⁻¹ g t)` over those
    left coset representatives `t` of `S` in `G` with `t⁻¹ g t ∈ S`.
    
    The sum has no division by `|S|`, so the definition needs nothing of the coefficients beyond
    addition; the averaged group-sum form is `Subgroup.indClassFun_eq_natCard_inv_mul_sum`.  On a
    character it is the character of the induced representation, by
    `Subgroup.indClassFun_ofFDRep_character`.
    
    The representatives are the fixed `Quotient.out` ones, so this is a function of `f` alone; and for a
    conjugation-invariant `f` the individual summands, and hence the sum, are independent of the
    representatives chosen.  `Subgroup.indClassFunction` is the bundled form on
    `TauCeti.ClassFunction k S`, and is the canonical API. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/BrauerInductionLinear.lean
    complete
    theorem TauCeti.isPElementary_iff_exists_mulEquiv_prod.{u} {p : ℕ}
      [Fact (Nat.Prime p)] {G : Type u} [Group G] :
      TauCeti.IsPElementary p G ↔
        ∃ C P x x_1,
          IsCyclic C ∧
            (Nat.card C).Coprime p ∧ IsPGroup p P ∧ Nonempty (G ≃* C × P)
    theorem TauCeti.isPElementary_iff_exists_mulEquiv_prod.{u}
      {p : ℕ} [Fact (Nat.Prime p)]
      {G : Type u} [Group G] :
      TauCeti.IsPElementary p G ↔
        ∃ C P x x_1,
          IsCyclic C ∧
            (Nat.card C).Coprime p ∧
              IsPGroup p P ∧
                Nonempty (G ≃* C × P)
    **A group is `p`-elementary if and only if it is the direct product of a cyclic group of order
    prime to `p` and a `p`-group** (LMFDB `group.elementary`): Tau Ceti's internal decomposition gives
    direct factors `C` and `P` with `G ≃* C × P`, and conversely such a product is `p`-elementary. 
Definition8.3.47
uses 1used by 1✓L∃∀N

Exponent of a group. (LMFDB)

The exponent of a group G is the smallest positive integer n such that g^n=e for all g\in G. If no such positive integer exists, then the exponent of the group is infinite.

Tau Ceti Review: Monoid.exponent.

Depends on: Definition 8.3.3

Lean code for Definition8.3.47●2 declarations
  • defdefined in Mathlib/GroupTheory/Exponent.lean
    complete
    def Monoid.exponent.{u} (G : Type u) [Monoid G] : ℕ
    def Monoid.exponent.{u} (G : Type u)
      [Monoid G] : ℕ
    The exponent of a group is the smallest positive integer `n` such that `g ^ n = 1` for all
    `g ∈ G` if it exists, otherwise it is zero by convention. 
  • theoremdefined in Mathlib/GroupTheory/Exponent.lean
    complete
    theorem Monoid.exponent_eq_zero_iff.{u} {G : Type u} [Monoid G] :
      Monoid.exponent G = 0 ↔ ¬Monoid.ExponentExists G
    theorem Monoid.exponent_eq_zero_iff.{u}
      {G : Type u} [Monoid G] :
      Monoid.exponent G = 0 ↔
        ¬Monoid.ExponentExists G
Definition8.3.48
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Fitting subgroup of a group. (LMFDB)

The Fitting subgroup of a group G, denoted \mathrm{Fit}(G), is the largest normal subgroup of G which is nilpotent. Since the product of a collection of normal nilpotent subgroups of a group is nilpotent, the Fitting subgroup is unique.

Depends on: Definition 8.3.3 Definition 8.3.93 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.48●4 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/FittingSubgroup.lean
    complete
    def Subgroup.fittingSubgroup.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.fittingSubgroup.{u_1}
      (G : Type u_1) [Group G] : Subgroup G
    The **Fitting subgroup** `Fit(G)` of a group `G` (LMFDB `group.fitting_subgroup`): the
    supremum of the normal nilpotent subgroups of `G`. For a finite group it is nilpotent
    (`Subgroup.isNilpotent_fittingSubgroup`), so it is the largest normal nilpotent subgroup, the
    LMFDB's definition. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FittingSubgroup.lean
    complete
    theorem Subgroup.isNilpotent_fittingSubgroup.{u_1} {G : Type u_1} [Group G]
      [Finite G] : Group.IsNilpotent ↥(Subgroup.fittingSubgroup G)
    theorem Subgroup.isNilpotent_fittingSubgroup.{u_1}
      {G : Type u_1} [Group G] [Finite G] :
      Group.IsNilpotent
        ↥(Subgroup.fittingSubgroup G)
    The **Fitting subgroup of a finite group is nilpotent**, by Fitting's theorem: it is the
    largest normal nilpotent subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FittingSubgroup.lean
    complete
    theorem Subgroup.le_fittingSubgroup.{u_1} {G : Type u_1} [Group G]
      (N : Subgroup G) [N.Normal] [Group.IsNilpotent ↥N] :
      N ≤ Subgroup.fittingSubgroup G
    theorem Subgroup.le_fittingSubgroup.{u_1}
      {G : Type u_1} [Group G]
      (N : Subgroup G) [N.Normal]
      [Group.IsNilpotent ↥N] :
      N ≤ Subgroup.fittingSubgroup G
    Every normal nilpotent subgroup lies in the Fitting subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FittingSubgroup.lean
    complete
    theorem Subgroup.isNilpotent_sup.{u_1} {G : Type u_1} [Group G] [Finite G]
      {N M : Subgroup G} [N.Normal] [M.Normal] [Group.IsNilpotent ↥N]
      [Group.IsNilpotent ↥M] : Group.IsNilpotent ↥(N ⊔ M)
    theorem Subgroup.isNilpotent_sup.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      {N M : Subgroup G} [N.Normal] [M.Normal]
      [Group.IsNilpotent ↥N]
      [Group.IsNilpotent ↥M] :
      Group.IsNilpotent ↥(N ⊔ M)
    **Fitting's theorem**: the join of two normal nilpotent subgroups of a finite group is
    nilpotent. 
Definition8.3.49
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.24
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Frattini subgroup of a group. (LMFDB)

If G is a group, then the Frattini subgroup of G, denoted \Phi(G), is the intersection of all maximal subgroups of G. If there are no maximal subgroups of G, then \Phi(G)=G.

The Frattini subgroup is always a characteristic subgroup, hence a normal subgroup, of G.

Tau Ceti Review: frattini.

Depends on: Definition 8.3.24 Definition 8.3.81 Definition 8.3.167

Lean code for Definition8.3.49●1 definition
  • defdefined in Mathlib/GroupTheory/Frattini.lean
    complete
    def frattini.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def frattini.{u_1} (G : Type u_1) [Group G] :
      Subgroup G
    The Frattini subgroup of a group is the intersection of the maximal subgroups. 
Definition8.3.50
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.97
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.36
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Frobenius group. (LMFDB)

Given a prime power q, the Frobenius group F_q is the group of invertible affine transformations (x \mapsto ax + b) on \F_q. Explicitly, it is the group

F_q := \{ \varphi : \F_q \to \F_q \mid \exists a, b \in \F_q \text{ such that } a \neq 0 \text{ and } \varphi(x) = ax + b \text{ for all } x \in \F_q \}

where the usual composition of maps is the group operation. It has order q(q-1) and is a Z-group (and hence is metacyclic and solvable).

Tau Ceti Review: TauCeti.AffineGroup, TauCeti.card_affineGroup.

Depends on: Definition 8.3.97 Definition 8.3.149 Definition 8.3.189

Lean code for Definition8.3.50●8 declarations
  • abbrevdefined in TauCeti/GroupTheory/SpecificGroups/Affine/Basic.lean
    complete
    abbrev TauCeti.AffineGroup.{u_1} (F : Type u_1) [Ring F] : Type u_1
    abbrev TauCeti.AffineGroup.{u_1} (F : Type u_1)
      [Ring F] : Type u_1
    The one-dimensional affine group `F ⋊ Fˣ`, with units acting on the additive group by
    multiplication. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AffineLineGroup.lean
    complete
    theorem TauCeti.AffineGroup.mem_range_toPermHom_iff.{u_1} {F : Type u_1}
      [Field F] (σ : Equiv.Perm F) :
      σ ∈ (MulAction.toPermHom (TauCeti.AffineGroup F) F).range ↔
        ∃ a b, a ≠ 0 ∧ ∀ (x : F), σ x = a * x + b
    theorem TauCeti.AffineGroup.mem_range_toPermHom_iff.{u_1}
      {F : Type u_1} [Field F]
      (σ : Equiv.Perm F) :
      σ ∈
          (MulAction.toPermHom
              (TauCeti.AffineGroup F)
              F).range ↔
        ∃ a b,
          a ≠ 0 ∧ ∀ (x : F), σ x = a * x + b
    **The affine group of `F` acts by the maps `x ↦ a x + b` with `a ≠ 0`** (LMFDB
    `group.frobenius`): a permutation of `F` is given by an element of `TauCeti.AffineGroup F` exactly
    when it is such a map. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AffineLineGroup.lean
    complete
    def TauCeti.AffineGroup.mulEquivRangeToPermHom.{u_1} (F : Type u_1)
      [Field F] :
      TauCeti.AffineGroup F ≃*
        ↥(MulAction.toPermHom (TauCeti.AffineGroup F) F).range
    def TauCeti.AffineGroup.mulEquivRangeToPermHom.{u_1}
      (F : Type u_1) [Field F] :
      TauCeti.AffineGroup F ≃*
        ↥(MulAction.toPermHom
              (TauCeti.AffineGroup F) F).range
    The Frobenius group `F_q` as a group of maps (LMFDB `group.frobenius`): the isomorphism of the
    affine group of `F` with its image in the permutations of `F`, the action being faithful. By
    `TauCeti.AffineGroup.mem_range_toPermHom_iff` the image is the group of the maps `x ↦ a x + b`,
    `a ≠ 0`, under composition. 
  • theoremdefined in TauCeti/GroupTheory/SpecificGroups/Affine/Basic.lean
    complete
    theorem TauCeti.card_affineGroup.{u_1} (F : Type u_1) [DivisionRing F] :
      Nat.card (TauCeti.AffineGroup F) = Nat.card F * (Nat.card F - 1)
    theorem TauCeti.card_affineGroup.{u_1}
      (F : Type u_1) [DivisionRing F] :
      Nat.card (TauCeti.AffineGroup F) =
        Nat.card F * (Nat.card F - 1)
    A one-dimensional affine group has natural cardinality `|F| (|F| - 1)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AffineLineGroup.lean
    complete
    theorem TauCeti.AffineGroup.isSolvable.{u_1} (F : Type u_1) [Field F] :
      Group.IsSolvable (TauCeti.AffineGroup F)
    theorem TauCeti.AffineGroup.isSolvable.{u_1}
      (F : Type u_1) [Field F] :
      Group.IsSolvable (TauCeti.AffineGroup F)
    **The Frobenius group `F_q` is solvable** (LMFDB `group.frobenius`): it is an extension of the
    abelian group `Fˣ` by the abelian group of translations. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AffineLineGroup.lean
    complete
    theorem TauCeti.AffineGroup.isZGroup_iff.{u_1} {F : Type u_1} [Field F]
      [Finite F] : IsZGroup (TauCeti.AffineGroup F) ↔ Nat.Prime (Nat.card F)
    theorem TauCeti.AffineGroup.isZGroup_iff.{u_1}
      {F : Type u_1} [Field F] [Finite F] :
      IsZGroup (TauCeti.AffineGroup F) ↔
        Nat.Prime (Nat.card F)
    **The Frobenius group `F_q` is a Z-group if and only if `q` is prime** (LMFDB
    `group.frobenius`). For prime `q` it is an extension of the cyclic group `Fˣ` of order `q - 1` by
    the cyclic group of translations of order `q`. Otherwise the translations, isomorphic to
    `(𝔽_q, +)` of exponent `p < q`, are not cyclic, while every abelian subgroup of a Z-group is
    cyclic. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AffineLineGroup.lean
    complete
    theorem TauCeti.AffineGroup.isMetacyclic_iff.{u_1} {F : Type u_1} [Field F]
      [Finite F] :
      IsMetacyclic (TauCeti.AffineGroup F) ↔ Nat.Prime (Nat.card F)
    theorem TauCeti.AffineGroup.isMetacyclic_iff.{u_1}
      {F : Type u_1} [Field F] [Finite F] :
      IsMetacyclic (TauCeti.AffineGroup F) ↔
        Nat.Prime (Nat.card F)
    **The Frobenius group `F_q` is metacyclic if and only if `q` is prime** (LMFDB
    `group.frobenius`). For prime `q` it is a Z-group. Otherwise `q ≥ 4`, and a normal subgroup with
    cyclic quotient contains every translation, since the translation by `(a - 1) c` is the commutator
    of the multiplication by a unit `a ≠ 1` and the translation by `c`; but the translations do not
    form a cyclic group. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1} [Group G] [Finite G]
      [IsZGroup G] : IsMetacyclic G
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1}
      [Group G] [Finite G] [IsZGroup G] :
      IsMetacyclic G
    **Finite Z-groups are metacyclic** (LMFDB `group.metacyclic`): the commutator subgroup and the
    abelianization of a finite Z-group are cyclic. 
Definition8.3.51
Statement uses 2
Statement dependency previews
Preview
Definition 3.6.27
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 3.6.22
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Fuchsian group. (LMFDB)

A Fuchsian group is a discrete subgroup of \mathrm{PSL}(2,\mathbb{R}) for the natural topology induced by the topology of 2\times 2 real matrices.

We say that a Fuchsian group is of the first kind if it has finite covolume for the hyperbolic metric d\mu=dxdy/y^2, i.e.

\text{covol}(G)=\int_{\mathfrak{F}(G)}d\mu<\infty,

where \mathfrak{F}(G) is the fundamental domain of G.

Tau Ceti Review: Subgroup.IsCofinite.

Depends on: Definition 8.3.55 Definition 3.6.27

Lean code for Definition8.3.51●1 definition
  • structure(2 fields)defined in TauCeti/Analysis/Complex/Fuchsian/Covolume.lean
    complete
    structure Subgroup.IsCofinite
      (Γ : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) ℝ)) : Prop
    structure Subgroup.IsCofinite
      (Γ :
        Subgroup
          (Matrix.ProjectiveSpecialLinearGroup
            (Fin 2) ℝ)) :
      Prop
    A subgroup `Γ ≤ PSL(2, ℝ)` is **cofinite** (a lattice) when it is discrete and the quotient
    `Γ \ ℍ` has finite hyperbolic area, that is, `Γ` has finite covolume. 
    discreteTopology : DiscreteTopology ↥Γ
    covolume_ne_top : MeasureTheory.covolume (↥Γ) UpperHalfPlane MeasureTheory.volume ≠ ⊤
Definition8.3.52
uses 1used by 0✓L∃∀N

Action of \SL(2,\R) in the upper half-plane. (LMFDB)

The group \SL(2,\R) acts on the upper half-plane via <b>linear fractional transformation</b>, given by

\begin{pmatrix}a&b\\c&d \end{pmatrix}(z) = \frac{a z + b}{c z + d} .

Tau Ceti Review: UpperHalfPlane.SLAction, UpperHalfPlane.coe_specialLinearGroup_apply.

Depends on: Definition 3.6.27

Lean code for Definition8.3.52●3 declarations
  • defdefined in Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean
    complete
    def UpperHalfPlane.SLAction.{u_1} {R : Type u_1} [CommRing R]
      [Algebra R ℝ] :
      MulAction (Matrix.SpecialLinearGroup (Fin 2) R) UpperHalfPlane
    def UpperHalfPlane.SLAction.{u_1}
      {R : Type u_1} [CommRing R]
      [Algebra R ℝ] :
      MulAction
        (Matrix.SpecialLinearGroup (Fin 2) R)
        UpperHalfPlane
  • theoremdefined in Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean
    complete
    theorem UpperHalfPlane.coe_specialLinearGroup_apply.{u_1} {R : Type u_1}
      [CommRing R] [Algebra R ℝ] (g : Matrix.SpecialLinearGroup (Fin 2) R)
      (z : UpperHalfPlane) :
      ↑(g • z) =
        (↑((algebraMap R ℝ) (↑g 0 0)) * ↑z + ↑((algebraMap R ℝ) (↑g 0 1))) /
          (↑((algebraMap R ℝ) (↑g 1 0)) * ↑z + ↑((algebraMap R ℝ) (↑g 1 1)))
    theorem UpperHalfPlane.coe_specialLinearGroup_apply.{u_1}
      {R : Type u_1} [CommRing R]
      [Algebra R ℝ]
      (g :
        Matrix.SpecialLinearGroup (Fin 2) R)
      (z : UpperHalfPlane) :
      ↑(g • z) =
        (↑((algebraMap R ℝ) (↑g 0 0)) * ↑z +
            ↑((algebraMap R ℝ) (↑g 0 1))) /
          (↑((algebraMap R ℝ) (↑g 1 0)) * ↑z +
            ↑((algebraMap R ℝ) (↑g 1 1)))
  • theoremdefined in Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean
    complete
    theorem UpperHalfPlane.specialLinearGroup_apply.{u_1} {R : Type u_1}
      [CommRing R] [Algebra R ℝ] (g : Matrix.SpecialLinearGroup (Fin 2) R)
      (z : UpperHalfPlane) :
      g • z =
        {
          coe :=
            (↑((algebraMap R ℝ) (↑g 0 0)) * ↑z +
                ↑((algebraMap R ℝ) (↑g 0 1))) /
              (↑((algebraMap R ℝ) (↑g 1 0)) * ↑z +
                ↑((algebraMap R ℝ) (↑g 1 1))),
          coe_im_pos := ⋯ }
    theorem UpperHalfPlane.specialLinearGroup_apply.{u_1}
      {R : Type u_1} [CommRing R]
      [Algebra R ℝ]
      (g :
        Matrix.SpecialLinearGroup (Fin 2) R)
      (z : UpperHalfPlane) :
      g • z =
        {
          coe :=
            (↑((algebraMap R ℝ) (↑g 0 0)) *
                  ↑z +
                ↑((algebraMap R ℝ)
                    (↑g 0 1))) /
              (↑((algebraMap R ℝ) (↑g 1 0)) *
                  ↑z +
                ↑((algebraMap R ℝ) (↑g 1 1))),
          coe_im_pos := ⋯ }
Definition8.3.53
uses 1
Used by 8
Reverse dependency previews
Preview
Definition 3.1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Cusps of a subgroup of the modular group. (LMFDB)

The cusps of a subgroup \Gamma of the modular group are equivalence classes of points in \mathbb{Q}\cup\infty under the action of \Gamma by linear fractional transformation, where for

\gamma=\left(\begin{array}{ll}a&b\\c&d \end{array}\right)\in\Gamma,

we define \gamma\infty = \frac{a}{c} when c\neq 0, and \gamma\infty = \infty when c=0.

Depends on: Definition 8.3.141

Lean code for Definition8.3.53●4 declarations
  • abbrevdefined in LeanBridge/ForMathlib/NumberTheory/ModularForms/CuspClasses.lean
    complete
    abbrev Subgroup.CuspClasses
      (Γ : Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ)) : Type
    abbrev Subgroup.CuspClasses
      (Γ :
        Subgroup
          (Matrix.SpecialLinearGroup (Fin 2)
            ℤ)) :
      Type
    The **cusps** (LMFDB `group.fuchsian.cusps`) of a subgroup `Γ` of the modular group
    `SL(2, ℤ)`: the classes of the points of `ℚ ∪ {∞}`, Mathlib's `OnePoint ℚ`, under the action of `Γ`
    by linear fractional transformations (`Matrix.SpecialLinearGroup.mapGL_smul_coe`,
    `Matrix.SpecialLinearGroup.mapGL_smul_infty`), that is, the orbits of the image of `Γ` in
    `GL(2, ℚ)` acting on the projective line. Two points give the same cusp exactly when an element of
    `Γ` maps one to the other (`Subgroup.mk_eq_mk_iff_cusp`). This is meant for every subgroup, unlike
    Mathlib's `CuspOrbits`, the orbits of the fixed points of parabolic elements, which differ for
    subgroups of infinite index. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/ModularForms/CuspClasses.lean
    complete
    theorem Subgroup.mk_eq_mk_iff_cusp
      {Γ : Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ)}
      {x y : OnePoint ℚ} :
      ⟦x⟧ = ⟦y⟧ ↔ ∃ γ ∈ Γ, (Matrix.SpecialLinearGroup.mapGL ℚ) γ • y = x
    theorem Subgroup.mk_eq_mk_iff_cusp
      {Γ :
        Subgroup
          (Matrix.SpecialLinearGroup (Fin 2)
            ℤ)}
      {x y : OnePoint ℚ} :
      ⟦x⟧ = ⟦y⟧ ↔
        ∃ γ ∈ Γ,
          (Matrix.SpecialLinearGroup.mapGL ℚ)
                γ •
              y =
            x
    **Two points of `ℚ ∪ {∞}` give the same cusp of `Γ` exactly when an element of `Γ` maps one to
    the other.** 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/ModularForms/CuspClasses.lean
    complete
    theorem Matrix.SpecialLinearGroup.mapGL_smul_coe
      (γ : Matrix.SpecialLinearGroup (Fin 2) ℤ) (x : ℚ) :
      (Matrix.SpecialLinearGroup.mapGL ℚ) γ • ↑x =
        if ↑(↑γ 1 0) * x + ↑(↑γ 1 1) = 0 then OnePoint.infty
        else ↑((↑(↑γ 0 0) * x + ↑(↑γ 0 1)) / (↑(↑γ 1 0) * x + ↑(↑γ 1 1)))
    theorem Matrix.SpecialLinearGroup.mapGL_smul_coe
      (γ :
        Matrix.SpecialLinearGroup (Fin 2) ℤ)
      (x : ℚ) :
      (Matrix.SpecialLinearGroup.mapGL ℚ) γ •
          ↑x =
        if ↑(↑γ 1 0) * x + ↑(↑γ 1 1) = 0 then
          OnePoint.infty
        else
          ↑((↑(↑γ 0 0) * x + ↑(↑γ 0 1)) /
              (↑(↑γ 1 0) * x + ↑(↑γ 1 1)))
    **`SL(2, ℤ)` acts on `ℚ` by linear fractional transformations** (LMFDB `group.fuchsian.cusps`,
    `group.fuchsian.action`): `γ = (a, b; c, d)` sends `x ∈ ℚ` to `(a x + b) / (c x + d)`, or to `∞`
    when `c x + d = 0`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/ModularForms/CuspClasses.lean
    complete
    theorem Matrix.SpecialLinearGroup.mapGL_smul_infty
      (γ : Matrix.SpecialLinearGroup (Fin 2) ℤ) :
      (Matrix.SpecialLinearGroup.mapGL ℚ) γ • OnePoint.infty =
        if ↑γ 1 0 = 0 then OnePoint.infty else ↑(↑(↑γ 0 0) / ↑(↑γ 1 0))
    theorem Matrix.SpecialLinearGroup.mapGL_smul_infty
      (γ :
        Matrix.SpecialLinearGroup (Fin 2) ℤ) :
      (Matrix.SpecialLinearGroup.mapGL ℚ) γ •
          OnePoint.infty =
        if ↑γ 1 0 = 0 then OnePoint.infty
        else ↑(↑(↑γ 0 0) / ↑(↑γ 1 0))
    **`SL(2, ℤ)` acts on `∞` by `γ ∞ = a / c` for `c ≠ 0` and `γ ∞ = ∞` for `c = 0`** (LMFDB
    `group.fuchsian.cusps`), where `γ = (a, b; c, d)`. 
Definition8.3.54
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.53
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 3.1.38
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Width of a cusp. (LMFDB)

The width of the cusp \infty for the group \Gamma is the smallest number w such that T^w=\left(\begin{matrix}1&w\\0&1\end{matrix}\right)\in\Gamma. Furthermore, for a general x\in\mathbb{P}^1(\mathbb{Q}) and \gamma\in\Gamma such that \gamma\infty=x, we define the width of x for \Gamma to be the width of \infty for \gamma^{-1}\Gamma\gamma.

Note that T=\left(\begin{matrix}1&1\\0&1\end{matrix}\right) is one of the generators of the modular group \textrm{SL}_2(\mathbb{Z}).

Tau Ceti Review: TauCeti.ModularForm.cuspTranslationOrbitWidth, TauCeti.Subgroup.integerCuspWidth.

Depends on: Definition 8.3.53 Definition 8.3.141

Lean code for Definition8.3.54●2 definitions
  • defdefined in TauCeti/NumberTheory/ModularForms/Norm/Cusps.lean
    complete
    def TauCeti.ModularForm.cuspTranslationOrbitWidth
      {𝒢 : Subgroup (GL (Fin 2) ℝ)}
      (c : TauCeti.ModularForm.CuspTranslationOrbit 𝒢) : ℕ
    def TauCeti.ModularForm.cuspTranslationOrbitWidth
      {𝒢 : Subgroup (GL (Fin 2) ℝ)}
      (c :
        TauCeti.ModularForm.CuspTranslationOrbit
          𝒢) :
      ℕ
    The **width** of a cusp translation orbit of `𝒢`: the period of the `T`-action. Under
    `[𝒢.IsFiniteRelIndex 𝒮ℒ]`, `minimalPeriod_TSL_dvd_iff` and
    `cuspTranslationOrbitWidth_mk` identify it with the least `m > 0` such that
    `x⁻¹ T ^ m x ∈ 𝒢` for any representative `x` of the orbit. 
  • defdefined in TauCeti/NumberTheory/ModularForms/Cusps/Basic.lean
    complete
    def TauCeti.Subgroup.integerCuspWidth (𝒢 : Subgroup (GL (Fin 2) ℝ)) : ℕ
    def TauCeti.Subgroup.integerCuspWidth
      (𝒢 : Subgroup (GL (Fin 2) ℝ)) : ℕ
    The `MulAction.period` of the coset of `T` acting on the base coset of
    `𝒮ℒ ⧸ 𝒢 ⊓ 𝒮ℒ`. When some positive power of `T` lies in `𝒢` — in particular whenever
    `𝒢` has finite relative index in `𝒮ℒ`, see `Subgroup.integerCuspWidth_pos` — this is
    the smallest positive integer `n` such that the upper-triangular matrix `[1, n; 0, 1]`
    lies in `𝒢`; otherwise it is `0`. 
Definition8.3.55
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 3.1.71
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Fundamental domain. (LMFDB)

If G\subseteq\Gamma is a subgroup of the modular group, then a closed set F\in\mathcal{H}\cup\mathbb{Q}\cup\{\infty\} is said to be a fundamental domain for G if: <ol> <li> For any point z\in\mathcal{H} there is a g\in G such that gz\in F.</li> <li> If z\not=z'\in F are equivalent with respect to the action of G, that is, if z'=gz for some g\in G, then z and z' belong to \partial F, the boundary of F.</li> </ol>

Tau Ceti Review: ModularGroup.fd.

Depends on: Definition 8.3.141

Lean code for Definition8.3.55●4 declarations
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/ModularCurve/FundamentalDomain.lean
    complete
    structure ModularGroup.IsFundamentalDomain
      (G : Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ))
      (F : Set UpperHalfPlane.Completed) : Prop
    structure ModularGroup.IsFundamentalDomain
      (G :
        Subgroup
          (Matrix.SpecialLinearGroup (Fin 2)
            ℤ))
      (F : Set UpperHalfPlane.Completed) :
      Prop
    A set `F ⊆ ℍ* = ℍ ∪ ℚ ∪ {∞}` is a **fundamental domain** for a subgroup `G` of `SL(2, ℤ)`
    (LMFDB `group.fuchsian.fundamental_domain`) if it is closed in the completed upper half-plane
    `ℍ*`, every point of `ℍ` is moved into `F` by an element of `G`, and two distinct points of `F` that
    are `G`-equivalent both lie on the boundary of `F`
    (`ModularGroup.IsFundamentalDomain.mem_frontier` and
    `ModularGroup.IsFundamentalDomain.smul_mem_frontier`). 
    isClosed : IsClosed F
    A fundamental domain is closed. 
    exists_smul_mem : ∀ (z : UpperHalfPlane), ∃ g ∈ G, g • UpperHalfPlane.Completed.ofUpperHalfPlane z ∈ F
    Every point of `ℍ` is `G`-equivalent to a point of a fundamental domain. 
    mem_frontier : ∀ {z : UpperHalfPlane.Completed} {g : Matrix.SpecialLinearGroup (Fin 2) ℤ},
      z ∈ F → g ∈ G → g • z ∈ F → g • z ≠ z → z ∈ frontier F
    A point of a fundamental domain that is `G`-equivalent to another point of it lies on its
    boundary. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/ModularCurve/FundamentalDomain.lean
    complete
    theorem ModularGroup.isFundamentalDomain_fd :
      ModularGroup.IsFundamentalDomain ⊤
        (UpperHalfPlane.Completed.ofUpperHalfPlane '' ModularGroup.fd ∪
          {UpperHalfPlane.Completed.cusp OnePoint.infty})
    theorem ModularGroup.isFundamentalDomain_fd :
      ModularGroup.IsFundamentalDomain ⊤
        (UpperHalfPlane.Completed.ofUpperHalfPlane ''
            ModularGroup.fd ∪
          {UpperHalfPlane.Completed.cusp
              OnePoint.infty})
    **The standard domain `𝒟`, together with the cusp `∞`, is a fundamental domain for
    `SL(2, ℤ)`**: every point of `ℍ` can be moved into `𝒟`, and an element of `SL(2, ℤ)` moving a point
    of the interior `𝒟ᵒ` into `𝒟` is `±1`. 
  • defdefined in Mathlib/NumberTheory/Modular.lean
    complete
    def ModularGroup.fd : Set UpperHalfPlane
    def ModularGroup.fd : Set UpperHalfPlane
    The standard (closed) fundamental domain of the action of `SL(2,ℤ)` on `ℍ`. 
  • inductive(2 constructors)defined in LeanBridge/ForMathlib/Analysis/Complex/UpperHalfPlane/Completed.lean
    complete
    inductive UpperHalfPlane.Completed : Type
    inductive UpperHalfPlane.Completed : Type
    The **completed upper half-plane** `ℍ* = ℍ ∪ ℚ ∪ {∞}` (LMFDB `mf.upper_half_plane`): the points
    of the upper half-plane `ℍ` together with the cusps, the points of `ℚ ∪ {∞} = OnePoint ℚ`. Its
    topology (`hasBasis_nhds_infty`, `hasBasis_nhds_ratCast`, `isOpenEmbedding_ofUpperHalfPlane`) and
    its action of `SL₂(ℤ)` (`smul_ofUpperHalfPlane`, `smul_cusp`) are those of the LMFDB. 
    UpperHalfPlane.Completed.ofUpperHalfPlane
      (z : UpperHalfPlane) : UpperHalfPlane.Completed
    A point of the upper half-plane. 
    UpperHalfPlane.Completed.cusp (c : OnePoint ℚ) :
      UpperHalfPlane.Completed
    A cusp: a rational number or `∞`. 
Definition8.3.56
uses 1
Used by 13
Reverse dependency previews
Preview
Definition 1.2.24
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Absolute Galois group. (LMFDB)

The absolute Galois group of a field K is the group of all automorphisms of the algebraic closure of K that fix the field K.

Tau Ceti Review: Field.absoluteGaloisGroup.

Depends on: Definition 1.1.30

Lean code for Definition8.3.56●1 definition
  • defdefined in Mathlib/FieldTheory/AbsoluteGaloisGroup.lean
    complete
    def Field.absoluteGaloisGroup.{u_1} (K : Type u_1) [Field K] : Type u_1
    def Field.absoluteGaloisGroup.{u_1}
      (K : Type u_1) [Field K] : Type u_1
    The absolute Galois group of `K`, defined as the Galois group of the field extension `K^al/K`,
    where `K^al` is an algebraic closure of `K`. 
Definition8.3.57
Statement uses 5
Statement dependency previews
Preview
Definition 5.1.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.4.16
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Gassmann equivalence. (LMFDB)

Two subgroups H_1 and H_2 of a finite group G are Gassmann equivalent if, for every conjugacy class C of G, the sets C \cap H_1 and C \cap H_2 have the same size. An ordering of the conjugacy classes of G then induces an ordering of the Gassmann equivalence classes of subgroups of G, just by lexicographically ordering the vectors of intersection counts.

An equivalent condition is that the permutation modules \Q[H_1\backslash G] and \Q[H_2\backslash G] are isomorphic as \Q[G]-modules, which also applies to finite index subgroups H_1,H_2 of an infinite group G; see Proposition 2.6 of for other equivalent definitions.

Gassmann equivalent subgroups of Galois groups of number fields give rise to arithmetically equivalent number fields.

Depends on: Definition 8.1.8 Definition 8.3.3 Definition 8.3.32 Definition 8.3.160 Definition 5.1.6

Definition8.3.58
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.3.9
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

General linear group. (LMFDB)

The general linear group \GL(n,q) is the group of n \times n invertible matrices with entries in the field \F_q (the finite field with q elements). It has order \prod_{k=0}^{n-1} (q^n - q^k). If p is prime, then \GL(n,p) is the automorphism group of the abelian group C_p^n.

The projective general linear group \PGL(n, q) is the quotient of \GL(n, q) by its subgroup of scalar matrices.

Tau Ceti Review: Matrix.GeneralLinearGroup, GaloisField, Matrix.card_GL_field, Matrix.ProjGenLinGroup, Matrix.GeneralLinearGroup.center_eq_range_scalar.

Depends on: Definition 8.3.19 Definition 8.3.118 Definition 1.1.30

Lean code for Definition8.3.58●6 declarations
  • abbrevdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Defs.lean
    complete
    abbrev Matrix.GeneralLinearGroup.{u, v} (n : Type u) (R : Type v)
      [DecidableEq n] [Fintype n] [Semiring R] : Type (max v u)
    abbrev Matrix.GeneralLinearGroup.{u, v}
      (n : Type u) (R : Type v)
      [DecidableEq n] [Fintype n]
      [Semiring R] : Type (max v u)
    `GL n R` is the group of `n` by `n` `R`-matrices with unit determinant.
    Defined as a subtype of matrices 
  • defdefined in Mathlib/FieldTheory/Finite/GaloisField.lean
    complete
    def GaloisField (p : ℕ) [Fact (Nat.Prime p)] (n : ℕ) : Type
    def GaloisField (p : ℕ) [Fact (Nat.Prime p)]
      (n : ℕ) : Type
    A finite field with `p ^ n` elements.
    Every field with the same cardinality is (non-canonically)
    isomorphic to this field. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Card.lean
    complete
    theorem Matrix.card_GL_field.{u_1} {𝔽 : Type u_1} [Field 𝔽] [Fintype 𝔽]
      (n : ℕ) :
      Nat.card (GL (Fin n) 𝔽) =
        ∏ i, (Fintype.card 𝔽 ^ n - Fintype.card 𝔽 ^ ↑i)
    theorem Matrix.card_GL_field.{u_1} {𝔽 : Type u_1}
      [Field 𝔽] [Fintype 𝔽] (n : ℕ) :
      Nat.card (GL (Fin n) 𝔽) =
        ∏ i,
          (Fintype.card 𝔽 ^ n -
            Fintype.card 𝔽 ^ ↑i)
    The cardinal of the general linear group over a finite field. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GeneralLinearGroup/MulAut.lean
    complete
    def Matrix.GeneralLinearGroup.mulEquivMulAut.{u_1} (n : ℕ) (ι : Type u_1)
      [Fintype ι] [DecidableEq ι] :
      GL ι (ZMod n) ≃* MulAut (ι → Multiplicative (ZMod n))
    def Matrix.GeneralLinearGroup.mulEquivMulAut.{u_1}
      (n : ℕ) (ι : Type u_1) [Fintype ι]
      [DecidableEq ι] :
      GL ι (ZMod n) ≃*
        MulAut (ι → Multiplicative (ZMod n))
    **`GL(ι, ℤ/n)` is the automorphism group of `C_n^ι`** (LMFDB `group.general_linear`, where
    `n = p` is prime and `ι = Fin m`): the isomorphism `GL(ι, ℤ/n) ≃* Aut(C_n^ι)` letting an invertible
    matrix `A` act on `C_n^ι = ι → Multiplicative (ZMod n)` by `v ↦ A *ᵥ v` on exponents. 
  • defdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Projective.lean
    complete
    def Matrix.ProjGenLinGroup.{u_1, u_2} (n : Type u_1) [Fintype n]
      [DecidableEq n] (R : Type u_2) [CommRing R] :
      Type (max (max u_1 u_2) u_2 u_1)
    def Matrix.ProjGenLinGroup.{u_1, u_2}
      (n : Type u_1) [Fintype n]
      [DecidableEq n] (R : Type u_2)
      [CommRing R] :
      Type (max (max u_1 u_2) u_2 u_1)
    Projective general linear group $PGL(n, R)$
    defined as the quotient of the general linear group by its center. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Basic.lean
    complete
    theorem Matrix.GeneralLinearGroup.center_eq_range_scalar.{u_1, u_2}
      {R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n]
      [CommRing R] :
      Subgroup.center (GL n R) = (Matrix.GeneralLinearGroup.scalar n).range
    theorem Matrix.GeneralLinearGroup.center_eq_range_scalar.{u_1,
        u_2}
      {R : Type u_1} {n : Type u_2}
      [Fintype n] [DecidableEq n]
      [CommRing R] :
      Subgroup.center (GL n R) =
        (Matrix.GeneralLinearGroup.scalar
            n).range
    The center of `GL n R` is the image of `Rˣ`. 
Definition8.3.59
uses 1
Used by 4
Reverse dependency previews
Preview
Definition 8.3.82
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Generalized quaternion. (LMFDB)

The (generalized) quaternion group Q_n is a special case of a dicyclic group \text{Dic}_m when n=4m\geq 8 is a power of 2.

Tau Ceti Review: QuaternionGroup, QuaternionGroup.card, TauCeti.isCyclic_quaternionRotations, TauCeti.index_quaternionRotations.

Depends on: Definition 8.3.39

Lean code for Definition8.3.59●6 declarations
  • inductive(2 constructors, 1 parameter)defined in Mathlib/GroupTheory/SpecificGroups/Quaternion.lean
    complete
    inductive QuaternionGroup (n : ℕ) : Type
    inductive QuaternionGroup (n : ℕ) : Type
    The (generalised) quaternion group `QuaternionGroup n` of order `4n`. It can be defined by the
    presentation $\langle a, x | a^{2n} = 1, x^2 = a^n, x^{-1}ax=a^{-1}\rangle$. We write `a i` for
    $a^i$ and `xa i` for $x * a^i$.
    
    QuaternionGroup.a {n : ℕ} : ZMod (2 * n) → QuaternionGroup n
    QuaternionGroup.xa {n : ℕ} :
      ZMod (2 * n) → QuaternionGroup n
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Quaternion.lean
    complete
    theorem QuaternionGroup.card {n : ℕ} [NeZero n] :
      Fintype.card (QuaternionGroup n) = 4 * n
    theorem QuaternionGroup.card {n : ℕ} [NeZero n] :
      Fintype.card (QuaternionGroup n) = 4 * n
    If `0 < n`, then `QuaternionGroup n` has `4n` elements.
    
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetacyclicPresentation.lean
    complete
    def QuaternionGroup.presentedGroupMulEquiv (n : ℕ) [NeZero n] :
      PresentedGroup (QuaternionGroup.relators n) ≃* QuaternionGroup n
    def QuaternionGroup.presentedGroupMulEquiv
      (n : ℕ) [NeZero n] :
      PresentedGroup
          (QuaternionGroup.relators n) ≃*
        QuaternionGroup n
    **The presentation `Dicₙ = ⟨a, b | a²ⁿ, aⁿ b⁻², b a b⁻¹ a⟩` of Mathlib's
    `QuaternionGroup n`** (LMFDB `group.dicyclic`, `group.generalized_quaternion`), for `n ≠ 0`: the
    isomorphism sends `a` to `a 1` and `b` to `xa 0`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    theorem QuaternionGroup.not_isComplement'_quaternionRotations {m : ℕ} [NeZero m]
      (K : Subgroup (QuaternionGroup m)) :
      ¬(TauCeti.quaternionRotations m).IsComplement' K
    theorem QuaternionGroup.not_isComplement'_quaternionRotations
      {m : ℕ} [NeZero m]
      (K : Subgroup (QuaternionGroup m)) :
      ¬(TauCeti.quaternionRotations
              m).IsComplement'
          K
    **The cyclic subgroup of index `2` of the dicyclic group `Dicₘ` has no complement** (LMFDB
    `group.dicyclic`, `group.generalized_quaternion`, `group.dihedral`), so `Dicₘ` is a non-split
    extension of `C₂ₘ` by `C₂`: an element of order `2` of a complement would lie outside the rotation
    subgroup, but every element `xa i` outside it squares to `a m ≠ 1`. 
  • theoremdefined in TauCeti/GroupTheory/SpecificGroups/Quaternion/Basic.lean
    complete
    theorem TauCeti.isCyclic_quaternionRotations (n : ℕ) :
      IsCyclic ↥(TauCeti.quaternionRotations n)
    theorem TauCeti.isCyclic_quaternionRotations
      (n : ℕ) :
      IsCyclic
        ↥(TauCeti.quaternionRotations n)
  • theoremdefined in TauCeti/GroupTheory/SpecificGroups/Quaternion/Basic.lean
    complete
    theorem TauCeti.index_quaternionRotations (n : ℕ) :
      (TauCeti.quaternionRotations n).index = 2
    theorem TauCeti.index_quaternionRotations
      (n : ℕ) :
      (TauCeti.quaternionRotations n).index =
        2
    The quaternion rotation subgroup has index two. 
Definition8.3.60
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Generators of a group. (LMFDB)

If G is a group and S is a subset of G, then S is a set of generators if the smallest subgroup of G containing S equals G.

Equivalently, S generates G if

G=\bigcap_{S\subseteq H\leq G} H \,.

The automorphism group of G acts on such S, and we say S and S' are equivalent if they are related by this action.

Tau Ceti Review: Subgroup.closure, Subgroup.closure_le, Subgroup.mem_closure.

Depends on: Definition 8.3.3 Definition 8.3.19

Lean code for Definition8.3.60●3 declarations
  • defdefined in Mathlib/Algebra/Group/Subgroup/Lattice.lean
    complete
    def Subgroup.closure.{u_1} {G : Type u_1} [Group G] (k : Set G) : Subgroup G
    def Subgroup.closure.{u_1} {G : Type u_1}
      [Group G] (k : Set G) : Subgroup G
    The `Subgroup` generated by a set. 
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Lattice.lean
    complete
    theorem Subgroup.closure_le.{u_1} {G : Type u_1} [Group G] (K : Subgroup G)
      {k : Set G} : Subgroup.closure k ≤ K ↔ k ⊆ ↑K
    theorem Subgroup.closure_le.{u_1} {G : Type u_1}
      [Group G] (K : Subgroup G) {k : Set G} :
      Subgroup.closure k ≤ K ↔ k ⊆ ↑K
    A subgroup `K` includes `closure k` if and only if it includes `k`. 
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Lattice.lean
    complete
    theorem Subgroup.mem_closure.{u_1} {G : Type u_1} [Group G] {k : Set G}
      {x : G} : x ∈ Subgroup.closure k ↔ ∀ (K : Subgroup G), k ⊆ ↑K → x ∈ K
    theorem Subgroup.mem_closure.{u_1} {G : Type u_1}
      [Group G] {k : Set G} {x : G} :
      x ∈ Subgroup.closure k ↔
        ∀ (K : Subgroup G), k ⊆ ↑K → x ∈ K
Definition8.3.61
uses 0used by 0✓L∃∀N

Group (mathlib). (LMFDB)

A group in mathlib is defined as a monoid (which has the data of a binary operation, an identity element 1 and is associative) with an operation {}^{-1} such that a^ {-1} * a = 1.

Tau Ceti Review: Monoid.

Lean code for Definition8.3.61●1 definition
  • class(extends 6, 8 methods)defined in Mathlib/Algebra/Group/Monoid.lean
    complete
    class Monoid.{u_2} (M : Type u_2) : Type u_2
    class Monoid.{u_2} (M : Type u_2) : Type u_2
    A `Monoid` is a `Semigroup` with an element `1` such that `1 * a = a * 1 = a`. 
    • One M
    • Mul M
    • Semigroup M
    • MulOneClass M
    • NPow M
    one : M
    Inherited from
    1. One
    mul : M → M → M
    Inherited from
    1. Mul
    mul_assoc : ∀ (a b c : M), a * b * c = a * (b * c)
    Multiplication is associative 
    one_mul : ∀ (a : M), 1 * a = a
    One is a left neutral element for multiplication 
    mul_one : ∀ (a : M), a * 1 = a
    One is a right neutral element for multiplication 
    npow : ℕ → M → M
    Inherited from
    1. NPow
    npow_zero : ∀ (x : M), x ^ 0 = 1
    Raising to the power `(0 : ℕ)` gives `1`. 
    npow_succ : ∀ (n : ℕ) (x : M), x ^ (n + 1) = x ^ n * x
    Raising to the power `(n + 1 : ℕ)` behaves as expected. 
Definition8.3.62
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.24
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

group ring. (LMFDB)

If G is a group and R is a ring, the group ring is the free R-module with basis G in which multiplication is defined via the distributive law. It consists of all formal finite sums of the form \sum r_g g with g\in G and r_g\in R.

Tau Ceti Review: MonoidAlgebra.

Depends on: Definition 8.3.3 Definition 1.1.24

Lean code for Definition8.3.62●1 definition
  • structure(1 field)defined in Mathlib/Algebra/MonoidAlgebra/Defs.lean
    complete
    structure MonoidAlgebra.{u_8, u_9} (R : Type u_8) (M : Type u_9) [Semiring R] :
      Type (max u_8 u_9)
    structure MonoidAlgebra.{u_8, u_9} (R : Type u_8)
      (M : Type u_9) [Semiring R] :
      Type (max u_8 u_9)
    The monoid algebra over a semiring `R` generated by the monoid `M`.
    
    It is the type of finite formal `R`-linear combinations of terms of `M`,
    endowed with the convolution product. 
    coeff : M →₀ R
    The coefficients `M →₀ R` of an element of the monoid algebra `R[M]`. 
Definition8.3.63
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 8.2.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Haar measure of a topological group. (LMFDB)

For G a locally compact topological group, a Haar measure on G is a nonnegative, countably additive, real-valued measure on G which is invariant under left translation on G. Any such measure is also invariant under right translation on G.

A Haar measure always exists and is unique up to multiplication by a positive scalar. If G is compact, then the normalized Haar measure on G is the unique Haar measure on G under which G has total measure 1.

As a special case, if G is finite of order n, then the normalized Haar measure is the uniform measure that assigns to each element the measure 1/n.

Tau Ceti Review: MeasureTheory.Measure.IsHaarMeasure, MeasureTheory.Measure.isHaarMeasure_eq_of_isProbabilityMeasure, MeasureTheory.Measure.regular_haarMeasure, MeasureTheory.Measure.isMulLeftInvariant_eq_smul_of_regular, TauCeti.haarProb_singleton.

Depends on: Definition 8.3.3 Definition 8.3.97

Lean code for Definition8.3.63●7 declarations
  • class(extends 3, 3 methods)defined in Mathlib/MeasureTheory/Group/Measure.lean
    complete
    class MeasureTheory.Measure.IsHaarMeasure.{u_3} {G : Type u_3} [Group G]
      [TopologicalSpace G] [MeasurableSpace G]
      (μ : MeasureTheory.Measure G) : Prop
    class MeasureTheory.Measure.IsHaarMeasure.{u_3}
      {G : Type u_3} [Group G]
      [TopologicalSpace G] [MeasurableSpace G]
      (μ : MeasureTheory.Measure G) : Prop
    A measure on a group is a Haar measure if it is left-invariant, and gives finite mass to
    compact sets and positive mass to open sets.
    
    Textbooks generally require an additional regularity assumption to ensure nice behavior on
    arbitrary locally compact groups. Use `[IsHaarMeasure μ] [Regular μ]` or
    `[IsHaarMeasure μ] [InnerRegular μ]` in these situations. Note that a Haar measure in our
    sense is automatically regular and inner regular on second countable locally compact groups, as
    checked just below this definition. 
    • MeasureTheory.IsFiniteMeasureOnCompacts μ
    • μ.IsMulLeftInvariant
    • μ.IsOpenPosMeasure
    lt_top_of_isCompact : ∀ ⦃K : Set G⦄, IsCompact K → μ K < ⊤
    Inherited from
    1. MeasureTheory.IsFiniteMeasureOnCompacts
    map_mul_left_eq_self : ∀ (g : G), MeasureTheory.Measure.map (fun x => g * x) μ = μ
    Inherited from
    1. MeasureTheory.Measure.IsMulLeftInvariant
    open_pos : ∀ (U : Set G), IsOpen U → U.Nonempty → μ U ≠ 0
    Inherited from
    1. MeasureTheory.Measure.IsOpenPosMeasure
  • defdefined in Mathlib/MeasureTheory/Measure/Haar/Basic.lean
    complete
    def MeasureTheory.Measure.haarMeasure.{u_1} {G : Type u_1} [Group G]
      [TopologicalSpace G] [IsTopologicalGroup G] [MeasurableSpace G]
      [BorelSpace G] (K₀ : TopologicalSpace.PositiveCompacts G) :
      MeasureTheory.Measure G
    def MeasureTheory.Measure.haarMeasure.{u_1}
      {G : Type u_1} [Group G]
      [TopologicalSpace G]
      [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G]
      (K₀ :
        TopologicalSpace.PositiveCompacts G) :
      MeasureTheory.Measure G
    The Haar measure on the locally compact group `G`, scaled so that `haarMeasure K₀ K₀ = 1`. 
  • theoremdefined in Mathlib/MeasureTheory/Measure/Haar/Basic.lean
    complete
    theorem MeasureTheory.Measure.haarMeasure_self.{u_1} {G : Type u_1} [Group G]
      [TopologicalSpace G] [IsTopologicalGroup G] [MeasurableSpace G]
      [BorelSpace G] {K₀ : TopologicalSpace.PositiveCompacts G} :
      (MeasureTheory.Measure.haarMeasure K₀) ↑K₀ = 1
    theorem MeasureTheory.Measure.haarMeasure_self.{u_1}
      {G : Type u_1} [Group G]
      [TopologicalSpace G]
      [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G]
      {K₀ :
        TopologicalSpace.PositiveCompacts G} :
      (MeasureTheory.Measure.haarMeasure K₀)
          ↑K₀ =
        1
  • theoremdefined in Mathlib/MeasureTheory/Measure/Haar/Unique.lean
    complete
    theorem MeasureTheory.Measure.isHaarMeasure_eq_of_isProbabilityMeasure.{u_1}
      {G : Type u_1} [TopologicalSpace G] [Group G] [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G] [LocallyCompactSpace G]
      (μ' μ : MeasureTheory.Measure G)
      [MeasureTheory.IsProbabilityMeasure μ]
      [MeasureTheory.IsProbabilityMeasure μ'] [μ.IsHaarMeasure]
      [μ'.IsHaarMeasure] : μ' = μ
    theorem MeasureTheory.Measure.isHaarMeasure_eq_of_isProbabilityMeasure.{u_1}
      {G : Type u_1} [TopologicalSpace G]
      [Group G] [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G]
      [LocallyCompactSpace G]
      (μ' μ : MeasureTheory.Measure G)
      [MeasureTheory.IsProbabilityMeasure μ]
      [MeasureTheory.IsProbabilityMeasure μ']
      [μ.IsHaarMeasure] [μ'.IsHaarMeasure] :
      μ' = μ
    **Uniqueness of Haar measures**:
    Two Haar measures which are probability measures coincide. 
  • theoremdefined in Mathlib/MeasureTheory/Measure/Haar/Basic.lean
    complete
    theorem MeasureTheory.Measure.regular_haarMeasure.{u_1} {G : Type u_1} [Group G]
      [TopologicalSpace G] [IsTopologicalGroup G] [MeasurableSpace G]
      [BorelSpace G] {K₀ : TopologicalSpace.PositiveCompacts G} :
      (MeasureTheory.Measure.haarMeasure K₀).Regular
    theorem MeasureTheory.Measure.regular_haarMeasure.{u_1}
      {G : Type u_1} [Group G]
      [TopologicalSpace G]
      [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G]
      {K₀ :
        TopologicalSpace.PositiveCompacts G} :
      (MeasureTheory.Measure.haarMeasure
          K₀).Regular
    The Haar measure is regular. 
  • theoremdefined in Mathlib/MeasureTheory/Measure/Haar/Unique.lean
    complete
    theorem MeasureTheory.Measure.isMulLeftInvariant_eq_smul_of_regular.{u_1}
      {G : Type u_1} [TopologicalSpace G] [Group G] [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G] [LocallyCompactSpace G]
      (μ' μ : MeasureTheory.Measure G) [μ.IsHaarMeasure]
      [μ'.IsMulLeftInvariant] [μ.Regular] [μ'.Regular] :
      μ' = μ'.haarScalarFactor μ • μ
    theorem MeasureTheory.Measure.isMulLeftInvariant_eq_smul_of_regular.{u_1}
      {G : Type u_1} [TopologicalSpace G]
      [Group G] [IsTopologicalGroup G]
      [MeasurableSpace G] [BorelSpace G]
      [LocallyCompactSpace G]
      (μ' μ : MeasureTheory.Measure G)
      [μ.IsHaarMeasure]
      [μ'.IsMulLeftInvariant] [μ.Regular]
      [μ'.Regular] :
      μ' = μ'.haarScalarFactor μ • μ
    **Uniqueness of left-invariant measures**:
    Given two left-invariant measures which are finite
    on compacts and regular, they coincide up to a multiplicative constant. 
  • theoremdefined in TauCeti/RepresentationTheory/Compact/Finite.lean
    complete
    theorem TauCeti.haarProb_singleton.{u_1} (G : Type u_1) [Group G] [Finite G]
      [TopologicalSpace G] [DiscreteTopology G] [MeasurableSpace G]
      [BorelSpace G] (g : G) : (TauCeti.haarProb G) {g} = (↑(Nat.card G))⁻¹
    theorem TauCeti.haarProb_singleton.{u_1}
      (G : Type u_1) [Group G] [Finite G]
      [TopologicalSpace G]
      [DiscreteTopology G] [MeasurableSpace G]
      [BorelSpace G] (g : G) :
      (TauCeti.haarProb G) {g} =
        (↑(Nat.card G))⁻¹
    **The normalized Haar measure of a singleton in a finite discrete group is `|G|⁻¹`.** 
Definition8.3.64
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Hash for abstract groups. (LMFDB)

The data for abstract groups includes a hash (a 64-bit integer) which can be used to help identify groups up to isomorphism. Isomorphic groups will have equal hash values; non-isomorphic groups will usually have different hashes but collisions are possible.

  • If the group is of an order which can be identified by both Magma and Gap, we store the id number for that order as its hash.

  • Otherwise, we define two subsidiary functions: \texttt{CollapseIntList} and \texttt{EasyHash}.

  • \texttt{CollapseIntList} takes a list \texttt{L} of integers as input and produces a 64-bit integer, starting with \texttt{out} = 997\cdot\operatorname{len}(\texttt{L}) and sequentially setting \texttt{out} = \operatorname{xor}(\texttt{L}[\texttt{i}] \mod P, (1000003\cdot\texttt{out}) \mod P) for i=1, \dots, \operatorname{len}(\texttt{L}), where P = 9223372036854775783. When applied to list of lists, it is called recursively on each entry in the list.

  • \texttt{EasyHash} takes a group as input and returns the id number if both Magma and Gap can identify the group; otherwise it constructs the sorted list of triples [o,m,c] where c is the number of conjugacy classes of order o and size m, and returns the value of \texttt{CollapseIntList} applied to that list.

  • If the group is abelian, the hash value is just \texttt{CollapseIntList} applied to the Smith abelian invariants.

  • Otherwise, the hash value of G is \texttt{CollapseIntList} applied to the sorted list of pairs [\# H, \texttt{EasyHash}(H)] as H varies over G and its maximal subgroups.

As an indication of the effectiveness of this hash function, there are 10,494,213 groups of order 512 and 10,487,714 distinct hash values among them. Among the 544,831 groups currently in the LMFDB, there are 4,742 hash values that are duplicated; in 4,136 cases there are only two groups with that hash, and the largest number of groups with the same hash value is 22.

Depends on: Definition 8.3.5 Definition 8.3.6

Definition8.3.65
uses 0used by 1✓L∃∀N

Heisenberg group. (LMFDB)

Given a prime p, the Heisenberg group \He_p is the group of 3 \times 3 unitriangular matrices over the finite field \F_p. Explicitly, it is given by

\He_p := \left\{ \begin{pmatrix} 1 & a & b \\ 0 & 1 & c \\ 0 & 0 & 1 \\ \end{pmatrix} \mid a, b, c \in \F_p \right\}

with the usual matrix multiplication as the group operation. It has order p^3, and is one of only two non-abelian groups of order p^3. In particular, for an odd prime p, it is the unique non-abelian group of order p^3 and exponent p.

Tau Ceti Review: TauCeti.HeisenbergGroup.

Lean code for Definition8.3.65●8 declarations
  • structure(3 fields)defined in TauCeti/GroupTheory/SpecificGroups/Heisenberg.lean
    complete
    structure TauCeti.HeisenbergGroup.{u_1} (R : Type u_1) : Type u_1
    structure TauCeti.HeisenbergGroup.{u_1}
      (R : Type u_1) : Type u_1
    The **Heisenberg group** over a ring `R`: triples `(x, y, z)` with the
    multiplication `(x, y, z) * (x', y', z') = (x + x', y + y', z + z' + x * y')`, the group of
    unipotent upper triangular `3 × 3` matrices in the coordinates of the strictly upper triangle. 
    x : R
    The `(1, 2)` matrix entry. 
    y : R
    The `(2, 3)` matrix entry. 
    z : R
    The `(1, 3)` matrix entry. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    def TauCeti.HeisenbergGroup.mulEquivUpperUnitriangularGroup.{u_2}
      {R : Type u_2} [CommRing R] :
      TauCeti.HeisenbergGroup R ≃*
        ↥(TauCeti.upperUnitriangularGroup (Fin 3) R)
    def TauCeti.HeisenbergGroup.mulEquivUpperUnitriangularGroup.{u_2}
      {R : Type u_2} [CommRing R] :
      TauCeti.HeisenbergGroup R ≃*
        ↥(TauCeti.upperUnitriangularGroup
            (Fin 3) R)
    **The Heisenberg group is the group of `3 × 3` unitriangular matrices** (LMFDB
    `group.heisenberg`): `(x, y, z) ↦ [[1, x, z], [0, 1, y], [0, 0, 1]]` is an isomorphism onto Tau
    Ceti's `TauCeti.upperUnitriangularGroup (Fin 3) R`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.natCard_zmod (p : ℕ) :
      Nat.card (TauCeti.HeisenbergGroup (ZMod p)) = p ^ 3
    theorem TauCeti.HeisenbergGroup.natCard_zmod
      (p : ℕ) :
      Nat.card
          (TauCeti.HeisenbergGroup (ZMod p)) =
        p ^ 3
    **The Heisenberg group `He_p` has order `p³`** (LMFDB `group.heisenberg`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.not_isMulCommutative.{u_2} {R : Type u_2}
      [Ring R] [Nontrivial R] :
      ¬IsMulCommutative (TauCeti.HeisenbergGroup R)
    theorem TauCeti.HeisenbergGroup.not_isMulCommutative.{u_2}
      {R : Type u_2} [Ring R] [Nontrivial R] :
      ¬IsMulCommutative
          (TauCeti.HeisenbergGroup R)
    **The Heisenberg group is non-abelian** (LMFDB `group.heisenberg`) over a nontrivial ring:
    `(1, 0, 0) (0, 1, 0) = (1, 1, 1)` and `(0, 1, 0) (1, 0, 0) = (1, 1, 0)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.exists_forall_iff_nonempty_mulEquiv.{u} {p : ℕ}
      [hp : Fact (Nat.Prime p)] :
      ∃ K x,
        ∀ (H : Type u) [inst : Group H],
          Nat.card H = p ^ 3 ∧
              ¬IsMulCommutative H ∧
                IsEmpty (H ≃* TauCeti.HeisenbergGroup (ZMod p)) ↔
            Nonempty (H ≃* K)
    theorem TauCeti.HeisenbergGroup.exists_forall_iff_nonempty_mulEquiv.{u}
      {p : ℕ} [hp : Fact (Nat.Prime p)] :
      ∃ K x,
        ∀ (H : Type u) [inst : Group H],
          Nat.card H = p ^ 3 ∧
              ¬IsMulCommutative H ∧
                IsEmpty
                  (H ≃*
                    TauCeti.HeisenbergGroup
                      (ZMod p)) ↔
            Nonempty (H ≃* K)
    **`He_p` is one of only two non-abelian groups of order `p³`** (LMFDB `group.heisenberg`): there
    is a group `K`, the quaternion group `Q₈` for `p = 2` and the modular group `M_{p³}` for odd `p`,
    such that the non-abelian groups of order `p³` not isomorphic to `He_p` are exactly the groups
    isomorphic to `K`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.nonempty_mulEquiv_or_nonempty_mulEquiv_modularPCubedGroup.{u_1}
      {G : Type u_1} [Group G] {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hp2 : p ≠ 2) (hG : Nat.card G = p ^ 3) (hnc : ¬IsMulCommutative G) :
      Nonempty (G ≃* TauCeti.HeisenbergGroup (ZMod p)) ∨
        Nonempty (G ≃* ModularPCubedGroup p)
    theorem TauCeti.HeisenbergGroup.nonempty_mulEquiv_or_nonempty_mulEquiv_modularPCubedGroup.{u_1}
      {G : Type u_1} [Group G] {p : ℕ}
      [hp : Fact (Nat.Prime p)] (hp2 : p ≠ 2)
      (hG : Nat.card G = p ^ 3)
      (hnc : ¬IsMulCommutative G) :
      Nonempty
          (G ≃*
            TauCeti.HeisenbergGroup
              (ZMod p)) ∨
        Nonempty (G ≃* ModularPCubedGroup p)
    **The non-abelian groups of order `p³`, `p` odd** (LMFDB `group.heisenberg`): such a group is
    isomorphic to the Heisenberg group `He_p` if it has exponent `p`, and to the modular group
    `M_{p³} = C_{p²} ⋊ C_p` otherwise. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.exponent_zmod {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hp2 : p ≠ 2) : Monoid.exponent (TauCeti.HeisenbergGroup (ZMod p)) = p
    theorem TauCeti.HeisenbergGroup.exponent_zmod
      {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hp2 : p ≠ 2) :
      Monoid.exponent
          (TauCeti.HeisenbergGroup (ZMod p)) =
        p
    **The Heisenberg group `He_p` has exponent `p` for odd `p`** (LMFDB `group.heisenberg`):
    `(x, y, z) ^ p = (p x, p y, p z + (p (p - 1) / 2) x y)`, and `p` divides `p (p - 1) / 2`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.nonempty_mulEquiv_of_exponent_eq.{u_1}
      {G : Type u_1} [Group G] {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hG : Nat.card G = p ^ 3) (hnc : ¬IsMulCommutative G)
      (hexp : Monoid.exponent G = p) :
      Nonempty (G ≃* TauCeti.HeisenbergGroup (ZMod p))
    theorem TauCeti.HeisenbergGroup.nonempty_mulEquiv_of_exponent_eq.{u_1}
      {G : Type u_1} [Group G] {p : ℕ}
      [hp : Fact (Nat.Prime p)]
      (hG : Nat.card G = p ^ 3)
      (hnc : ¬IsMulCommutative G)
      (hexp : Monoid.exponent G = p) :
      Nonempty
        (G ≃*
          TauCeti.HeisenbergGroup (ZMod p))
    **`He_p` is the unique non-abelian group of order `p³` and exponent `p`** (LMFDB
    `group.heisenberg`): for non-commuting `x`, `y` with commutator `z`, the map
    `(a, b, c) ↦ zᶜ yᵇ xᵃ` is an isomorphism. With `TauCeti.HeisenbergGroup.exponent_zmod`, this
    characterises `He_p` for odd `p`; for `p = 2` a group of exponent `2` is abelian. 
Definition8.3.66
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 4.1.36
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Group homomorphism. (LMFDB)

If G and H are groups, then a group homomorphism from G to H is a function

f:G\to H

such that for all a,b\in G, f(a*b)=f(a)*f(b).

Tau Ceti Review: MonoidHom, MonoidHom.mk'.

Depends on: Definition 8.3.3

Lean code for Definition8.3.66●2 definitions
  • structure(extends 2, 3 fields)defined in Mathlib/Algebra/Group/Hom/Defs.lean
    complete
    structure MonoidHom.{u_10, u_11} (M : Type u_10) (N : Type u_11) [MulOne M]
      [MulOne N] : Type (max u_10 u_11)
    structure MonoidHom.{u_10, u_11} (M : Type u_10)
      (N : Type u_11) [MulOne M] [MulOne N] :
      Type (max u_10 u_11)
    `M →* N` is the type of functions `M → N` that preserve the `MulOne` structure.
    `MonoidHom` is used for both monoid and group homomorphisms.
    
    When possible, instead of parametrizing results over `(f : M →* N)`,
    you should parametrize over `(F : Type*) [MonoidHomClass F M N] (f : F)`.
    
    When you extend this structure, make sure to extend `MonoidHomClass`.
    
    
    [Wikidata Q868169](https://www.wikidata.org/wiki/Q868169)
    • OneHom M N
    • M →ₙ* N
    toFun : M → N
    Inherited from
    1. OneHom
    map_one' : (↑self).toFun 1 = 1
    Inherited from
    1. OneHom
    map_mul' : ∀ (x y : M), (↑self).toFun (x * y) = (↑self).toFun x * (↑self).toFun y
    The proposition that the function preserves multiplication 
  • defdefined in Mathlib/Algebra/Group/Hom/Defs.lean
    complete
    def MonoidHom.mk'.{u_4, u_7} {M : Type u_4} {G : Type u_7} [Group G]
      [MulOneClass M] (f : M → G)
      (map_mul : ∀ (a b : M), f (a * b) = f a * f b) : M →* G
    def MonoidHom.mk'.{u_4, u_7} {M : Type u_4}
      {G : Type u_7} [Group G] [MulOneClass M]
      (f : M → G)
      (map_mul :
        ∀ (a b : M), f (a * b) = f a * f b) :
      M →* G
    Makes a group homomorphism from a proof that the map preserves multiplication. 
Definition8.3.67
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Hyperelementary group. (LMFDB)

A finite group G is hyperelementary if it is an extension G \simeq C \rtimes P of a p-group P by a cyclic group C of order prime to p. Solomon's induction theorem states that the trivial character is an integer linear combination of inductions of trivial characters from hyperelementary subgroups of G (for various primes dividing the order of G).

Depends on: Definition 8.3.3 Definition 8.3.37 Definition 8.3.94 Definition 8.3.97 Definition 8.3.109 Definition 8.3.125

Definition8.3.68
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.3.22
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Inner automorphism of a group. (LMFDB)

If G is a group and g\in G, then the function \phi_g:G\to G given by conjugation by g

\phi_g(x) = gxg^{-1}

is an automorphism of G called an inner automorphism.

The set of inner automorphisms \mathrm{Inn}(G) is a subgroup of \Aut(G), and

\mathrm{Inn}(G) \cong G/Z(G)

where Z(G) is the center of G.

Tau Ceti Review: MulAut.conj, MulAut.conj_apply.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.20 Definition 8.3.160

Lean code for Definition8.3.68●2 declarations
  • defdefined in Mathlib/Algebra/Group/End.lean
    complete
    def MulAut.conj.{u_3} {G : Type u_3} [Group G] : G →* MulAut G
    def MulAut.conj.{u_3} {G : Type u_3}
      [Group G] : G →* MulAut G
    Group conjugation, `MulAut.conj g h = g * h * g⁻¹`, as a monoid homomorphism
    mapping multiplication in `G` into multiplication in the automorphism group `MulAut G`.
    See also the type `ConjAct G` for any group `G`, which has a `MulAction (ConjAct G) G` instance
    where `conj G` acts on `G` by conjugation. 
  • theoremdefined in Mathlib/Algebra/Group/End.lean
    complete
    theorem MulAut.conj_apply.{u_3} {G : Type u_3} [Group G] (g h : G) :
      (MulAut.conj g) h = g * h * g⁻¹
    theorem MulAut.conj_apply.{u_3} {G : Type u_3}
      [Group G] (g h : G) :
      (MulAut.conj g) h = g * h * g⁻¹
Definition8.3.69
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.28
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.158
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Isoclinism. (LMFDB)

For a group G and its commutator G', write \omega_G for the map G \times G \to G' defined by \omega_G(x, y) = x^{-1}y^{-1}xy, and note that \omega_G descends to a map on G / Z(G) \times G / Z(G). An isoclinism between two groups G_1 and G_2 is a pair of isomorphisms between their inner automorphism groups and their commutator subgroups

\phi : G_1 / Z(G_1) \to G_2 / Z(G_2)

\sigma : G_1' \to G_2'

so that

\sigma \circ \omega_{G_1} = \omega_{G_2} \circ (\phi \times \phi).

This is an equivalence relation on groups, and each equivalence class contains at least one stem group. Note that order is not an isoclinism invariant, but nilpotency class and solvable length are (except for the trivial group).

Depends on: Definition 8.3.28 Definition 8.3.38 Definition 8.3.68 Definition 8.3.93

Definition8.3.70
uses 1used by 1✓L∃∀N

Group isomorphism. (LMFDB)

A group isomorphism is a group homomorphism f:G\to H which is bijective.

Tau Ceti Review: MulEquiv, MulEquiv.ofBijective.

Depends on: Definition 8.3.66

Lean code for Definition8.3.70●2 definitions
  • structure(extends 2, 5 fields)defined in Mathlib/Algebra/Group/Equiv/Defs.lean
    complete
    structure MulEquiv.{u_9, u_10} (M : Type u_9) (N : Type u_10) [Mul M] [Mul N] :
      Type (max u_10 u_9)
    structure MulEquiv.{u_9, u_10} (M : Type u_9)
      (N : Type u_10) [Mul M] [Mul N] :
      Type (max u_10 u_9)
    `MulEquiv α β` is the type of an equiv `α ≃ β` which preserves multiplication. 
    • M ≃ N
    • M →ₙ* N
    toFun : M → N
    Inherited from
    1. Equiv
    invFun : N → M
    Inherited from
    1. Equiv
    left_inv : Function.LeftInverse self.invFun self.toFun
    Inherited from
    1. Equiv
    right_inv : Function.RightInverse self.invFun self.toFun
    Inherited from
    1. Equiv
    map_mul' : ∀ (x y : M), self.toFun (x * y) = self.toFun x * self.toFun y
    The proposition that the function preserves multiplication 
  • defdefined in Mathlib/Algebra/Group/Equiv/Defs.lean
    complete
    def MulEquiv.ofBijective.{u_10, u_11, u_9} {M : Type u_9} {N : Type u_10}
      {F : Type u_11} [Mul M] [Mul N] [FunLike F M N] [MulHomClass F M N]
      (f : F) (hf : Function.Bijective ⇑f) : M ≃* N
    def MulEquiv.ofBijective.{u_10, u_11, u_9}
      {M : Type u_9} {N : Type u_10}
      {F : Type u_11} [Mul M] [Mul N]
      [FunLike F M N] [MulHomClass F M N]
      (f : F) (hf : Function.Bijective ⇑f) :
      M ≃* N
    A bijective `Semigroup` homomorphism is an isomorphism 
Definition8.3.71
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Label of a group. (LMFDB)

The label for a group G has the form \mathtt{N.i}, where \mathtt{N} is the order of the group and \mathtt{i} is the small group id that distinguishes groups of the same order (as determined in GAP). If a group is not in GAP Small Groups database, we replace \mathtt{i} with an incrementing letter code, assigning labels to groups as they are added to our database.

Subgroups are labeled using the ambient group, index, and an ordering of subgroups up to automorphism and then up to conjugacy with the same invariants.

Depends on: Definition 8.3.3 Definition 8.3.97

Definition8.3.72
uses 1used by 1XL∃∀N

Label of irreducible complex characters of groups. (LMFDB)

The label of an irreducible complex character of a group has the format N.i.dcj where N.i is the label for the group, d is the dimension, c is a lower-case letter code for the rational class of this character, and j is an enumeration of characters within that rational class (j is omitted if the rational class is a singleton).

Depends on: Definition 8.3.3

Definition8.3.73
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 8.3.30
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Label of a conjugacy class. (LMFDB)

The label of a rational conjugacy class of a group G has the format NA where N is the order of elements in the conjugacy class, A is a sequence of capital letters.

The label of a complex conjugacy class of a group G has the format NAj where NA is the label of the division containing it, (so N is the order of elements in the conjugacy class), and j is an enumeration of class within that rational conjugacy class (j is omitted if there is a single class within rational conjugacy classes).

Depends on: Definition 8.3.32

Definition8.3.74
uses 1used by 1XL∃∀N

Label of rational character of a group. (LMFDB)

The label of a rational character of a group has the form N.i.oj where N.i is the label for the group, o is the order of elements in this class and j is a lower-case letter code.

Depends on: Definition 8.3.3

Definition8.3.75
Statement uses 14
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Finite Lie Group Names. (LMFDB)

We describe finite groups of Lie type as follows:

<ul> <li> \mathrm{GL}(n,q) denotes the general linear group of degree n over the finite field of order q.

<li> \mathrm{O}(n,q) denotes the general orthogonal group of degree n over the finite field of order q.

<li> \mathrm{U}(n,q) denotes the general unitary group of degree n over the finite field of order q.

<li> \mathrm{SL}(n,q) denotes the special linear group of degree n over the finite field of order q.

<li> \mathrm{Sp}(n,q) denotes the symplectic group of degree n over the finite field of order q.

<li> \mathrm{SO}(n,q) denotes the special orthogonal group of degree n over the finite field of order q.

<li> \mathrm{SU}(n,q) denotes the special unitary group of degree n over the finite field of order q.

<li> \mathrm{Spin}(n,q) denotes the spin group of degree n over the finite field of order q. It is a Lie group whose underlying manifold is the double cover of the special orthogonal group \mathrm{SO}(n,q). </ul>

<ul> <li> <b> Conformal groups: </b> <ul> <li> \mathrm{GO}(n,q) denotes the conformal orthogonal group of degree n over the finite field of order q consists of the product of the orthogonal group \mathrm{O}(n,q) with the group of dilations. \mathrm{CSO}(n,q) is defined in similar manner.

<li> \mathrm{GSp}(n,q) denotes the conformal symplectic group of degree n over the finite field of order q. It preserves the standard alternating form up to a non-zero scalar multiple.

<li> \mathrm{GU}(n,q) denotes the conformal symplectic group of degree n over the finite field of order q. It preserves the standard hermitian form up to a non-zero scalar multiple.

</ul> </ul>

<ul> <li> <b> Projective groups: </b> \mathrm{PG}(n,q) denotes the projective version of the group G(n,q), which is the quotient of G(n,q) by its center. </ul>

<ul> <li> <b> Automorphism Groups: </b> <ul> <li> \mathrm{P\Gamma L}(n,q) denotes the automorphism group of \mathrm{PGL}(n,q). <li> \mathrm{P\Sigma L}(n,q) denotes the automorphism group of \mathrm{PSL}(n,q). <li> \mathrm{P\Gamma U}(n,q) denotes the automorphism group of \mathrm{PGU}(n,q). <li> \mathrm{P\Sigma Sp}(n,q) denotes the automorphism group of \mathrm{PSp}(n,q). </ul> </ul>

<ul> <li> When the degree n is even, there are two inequivalent non-degenerate quadratic forms giving rise to two non-isomorphic orthogonal groups \mathrm{O}^{+}(n,q) and \mathrm{O}^{-}(n,q) (see this wiki page).

<br><br> H^{+}(n,q) and H^{-}(n,q) are defined similarly for H=\mathrm{GO}, \mathrm{GSO}, \mathrm{SO}, \mathrm{PSO}, \mathrm{PGO}, \mathrm{Spin}.

</ul>

<ul> <li> For n\ge 3 odd, \Omega(n,q) is the subgroup of \mathrm{SO}(n,q) such that \mathrm{P}\Omega(n,q) is simple. If q is odd, the group \Omega(n,q) is the kernel of the spinor norm map on \mathrm{SO}(n,q); if q is even, it is the kernel of the Dickson invariant.

<br><br> For n\ge 2 even and q is odd, \Omega^{+}(n,q) (resp. \Omega^{-}(n,q)) is the kernel of the spinor norm map on \mathrm{SO}^{+}(n,q) (resp. \mathrm{SO}^{-}(n,q)); if q is even, it is the kernel of the Dickson invariant.

\mathrm{P}\Omega^{+}(n,q) and \mathrm{P}\Omega^{-}(n,q) are defined in a similar manner. </ul>

<ul> <li> <b> Affine Groups: </b> <ul> <li> \mathrm{AGL}(n,q) denotes the affine general linear group of degree n over the finite field of order q. <li> \mathrm{ASL}(n,q) denotes the affine special linear group of degree n over the finite field of order q. <li> \mathrm{A\Sigma Sp}(n,q) denotes the affine special symplectic group of degree n over the finite field of order q.

<li> \mathrm{A\Gamma L}(n,q), \mathrm{A\Sigma L}(n,q) and \mathrm{ASp}(n,q) are defined in a similar manner. </ul> </ul>

<ul> <li> <b> Chevalley groups: </b> <ul> <li> \mathrm{A_n}(q) is the special linear group \mathrm{SL}(n+1,q). <li> \mathrm{B_n}(q) is the orthogonal group \Omega(2n+1,q). <li> \mathrm{C_n}(q) is the symplectic group \mathrm{Sp}(2n,q). <li> \mathrm{D_n}(q) is the orthogonal group \Omega^{+}(2n,q).

<li> \mathrm{E}(7,q), \mathrm{E}(8,q), \mathrm{F}(4,q), \mathrm{G}(2,q) are the exceptional groups. </ul> </ul>

Note that Magma uses slightly different notation. You can see the Magma documentation for more details.

Depends on: Definition 8.3.3 Definition 8.3.9 Definition 8.3.11 Definition 8.3.12 Definition 8.3.19 Definition 8.3.20 Definition 8.3.25 Definition 8.3.58 Definition 8.3.100 Definition 8.3.139 Definition 8.3.155 Definition 8.3.160 Definition 8.3.177 Definition 8.3.184

Definition8.3.76
uses 0used by 0✓L∃∀N

Linear and Projective Linear Groups. (LMFDB)

Over any field K, linear group usually refers to an algebraic group which is a (Zariski closed) subgroup of the general linear group GL(n,K) of invertible n\times n matrices with coefficients in K. Similarly, projective linear group refers to a closed subgroup of \text{PGL}(n,K)=\text{GL}(n,K)/\{\text{scalar matrices}\}, the group of linear automorphisms of the projective n-space. When K=\mathbb{F}_q is a finite field, these groups are finite, and often simple or almost simple, and so they play an important role in the classification of finite simple groups.

Tau Ceti Review: Matrix.ProjGenLinGroup, TauCeti.GeneralLinear.hopfIdealPointsSubgroup, TauCeti.ProjectiveGeneralLinear.coordinateHopfAlgebra, Matrix.GeneralLinearGroup.center_eq_range_scalar.

Lean code for Definition8.3.76●8 declarations
  • defdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Projective.lean
    complete
    def Matrix.ProjGenLinGroup.{u_1, u_2} (n : Type u_1) [Fintype n]
      [DecidableEq n] (R : Type u_2) [CommRing R] :
      Type (max (max u_1 u_2) u_2 u_1)
    def Matrix.ProjGenLinGroup.{u_1, u_2}
      (n : Type u_1) [Fintype n]
      [DecidableEq n] (R : Type u_2)
      [CommRing R] :
      Type (max (max u_1 u_2) u_2 u_1)
    Projective general linear group $PGL(n, R)$
    defined as the quotient of the general linear group by its center. 
  • defdefined in TauCeti/Algebra/AlgebraicGroup/GeneralLinear/HopfIdealPoints/Basic.lean
    complete
    def TauCeti.GeneralLinear.hopfIdealPointsSubgroup.{u, w} {R : Type u}
      [CommRing R] (n : ℕ)
      (I :
        TauCeti.HopfIdeal R
          ↑(TauCeti.GeneralLinear.coordinateHopfAlgebra R n))
      (A : Type w) [CommRing A] [Algebra R A] : Subgroup (GL (Fin n) A)
    def TauCeti.GeneralLinear.hopfIdealPointsSubgroup.{u,
        w}
      {R : Type u} [CommRing R] (n : ℕ)
      (I :
        TauCeti.HopfIdeal R
          ↑(TauCeti.GeneralLinear.coordinateHopfAlgebra
              R n))
      (A : Type w) [CommRing A]
      [Algebra R A] : Subgroup (GL (Fin n) A)
    The subgroup of `GLₙ(A)` cut out by a Hopf ideal in the general-linear coordinate Hopf
    algebra. 
  • abbrevdefined in TauCeti/Algebra/AlgebraicGroup/ProjectiveGeneralLinear/Basic.lean
    complete
    abbrev TauCeti.ProjectiveGeneralLinear.coordinateHopfAlgebra.{u} (n : ℕ)
      (R : Type u) [CommRing R] : CommHopfAlgCat R
    abbrev TauCeti.ProjectiveGeneralLinear.coordinateHopfAlgebra.{u}
      (n : ℕ) (R : Type u) [CommRing R] :
      CommHopfAlgCat R
    The coordinate Hopf algebra of `PGLₙ`, the automorphism group scheme of `Mₙ`. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Basic.lean
    complete
    theorem Matrix.GeneralLinearGroup.center_eq_range_scalar.{u_1, u_2}
      {R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n]
      [CommRing R] :
      Subgroup.center (GL n R) = (Matrix.GeneralLinearGroup.scalar n).range
    theorem Matrix.GeneralLinearGroup.center_eq_range_scalar.{u_1,
        u_2}
      {R : Type u_1} {n : Type u_2}
      [Fintype n] [DecidableEq n]
      [CommRing R] :
      Subgroup.center (GL n R) =
        (Matrix.GeneralLinearGroup.scalar
            n).range
    The center of `GL n R` is the image of `Rˣ`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Projectivization/ProjGenLinAction.lean
    complete
    def Matrix.ProjGenLinGroup.mulEquivRangeToPermHom.{u_1, u_2} (ι : Type u_1)
      (K : Type u_2) [Fintype ι] [DecidableEq ι] [Field K] :
      Matrix.ProjGenLinGroup ι K ≃*
        ↥(MulAction.toPermHom (GL ι K) (Projectivization K (ι → K))).range
    def Matrix.ProjGenLinGroup.mulEquivRangeToPermHom.{u_1,
        u_2}
      (ι : Type u_1) (K : Type u_2)
      [Fintype ι] [DecidableEq ι] [Field K] :
      Matrix.ProjGenLinGroup ι K ≃*
        ↥(MulAction.toPermHom (GL ι K)
              (Projectivization K
                (ι → K))).range
    **`PGL(n, K)` is the group of linear automorphisms of `ℙ^{n-1}(K) = ℙ(Kⁿ)`** (LMFDB
    `group.linear`): the isomorphism with the group of the permutations of `ℙ(Kⁿ)` induced by
    invertible linear maps of `Kⁿ`, through the faithful action of `PGL(n, K)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Projectivization/PSLSimple.lean
    complete
    theorem Matrix.ProjectiveSpecialLinearGroup.isSimpleGroup_fin.{u_2}
      {F : Type u_2} [Field F] {n : ℕ} (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsSimpleGroup (Matrix.ProjectiveSpecialLinearGroup (Fin n) F)
    theorem Matrix.ProjectiveSpecialLinearGroup.isSimpleGroup_fin.{u_2}
      {F : Type u_2} [Field F] {n : ℕ}
      (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsSimpleGroup
        (Matrix.ProjectiveSpecialLinearGroup
          (Fin n) F)
    **`PSL(n, F)` is simple for `n ≥ 3`, and for `n = 2` when `F` has at least `4` elements** (LMFDB
    `group.special_linear`, `group.linear`): the theorem of Jordan and Dickson, the case `n = 2` being
    Mathlib's `Matrix.ProjectiveSpecialLinearGroup.rank_two_simple`. The bound is on `Nat.card F`, so
    for `n = 2` the field is finite. Over `F = 𝔽_q` this covers every `PSL(n, q)` with `n ≥ 2` other
    than `PSL(2, 2)` and `PSL(2, 3)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GeneralLinearGroup/ProjectiveAlmostSimple.lean
    complete
    theorem Matrix.ProjGenLinGroup.isAlmostSimple_fin.{u_3} {n : ℕ} {F : Type u_3}
      [Field F] (hn : 2 ≤ n) (hF : n = 2 → 4 ≤ Nat.card F) :
      IsAlmostSimple (Matrix.ProjGenLinGroup (Fin n) F)
    theorem Matrix.ProjGenLinGroup.isAlmostSimple_fin.{u_3}
      {n : ℕ} {F : Type u_3} [Field F]
      (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsAlmostSimple
        (Matrix.ProjGenLinGroup (Fin n) F)
    **`PGL(n, F)` is almost simple for `n ≥ 3`, and for `n = 2` when `F` has at least `4`
    elements** (LMFDB `group.linear`): it lies between the simple group `PSL(n, F)` and its
    automorphism group. The bound is on `Nat.card F`, so for `n = 2` the field is finite. Over
    `F = 𝔽_q` this covers every `PGL(n, q)` with `n ≥ 2` other than `PGL(2, 2)` and `PGL(2, 3)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GeneralLinearGroup/ProjectiveAlmostSimple.lean
    complete
    theorem Matrix.ProjGenLinGroup.isSimpleGroup_fin_iff.{u_3} {n : ℕ}
      {F : Type u_3} [Field F] [Finite F] (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsSimpleGroup (Matrix.ProjGenLinGroup (Fin n) F) ↔
        (Nat.card F - 1).Coprime n
    theorem Matrix.ProjGenLinGroup.isSimpleGroup_fin_iff.{u_3}
      {n : ℕ} {F : Type u_3} [Field F]
      [Finite F] (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsSimpleGroup
          (Matrix.ProjGenLinGroup (Fin n) F) ↔
        (Nat.card F - 1).Coprime n
    **`PGL(n, q)` is simple exactly when `gcd(n, q - 1) = 1`**, for `n ≥ 3`, and for `n = 2` when
    `q ≥ 4` (LMFDB `group.linear`); it is almost simple in all these cases
    (`Matrix.ProjGenLinGroup.isAlmostSimple_fin`). 
Definition8.3.77
uses 0used by 0✓L∃∀N

Linear group twisted by automorphisms. (LMFDB)

The group \Gamma\mathrm{L} (n,q) is the semi-direct product of \GL(n,q) with the group of field automorphisms A = \Aut(\F_q / \F_p), acting \GL(n,q) entry-wise. Similarly, \Sigma \mathrm{L}(n,q) is the semi-direct product of \SL(n,q) with A.

The projective linear groups twisted by automorphisms are \PGammaL(n,q) and \PSigmaL(n,q), the quotients of \Gamma \mathrm{L}(n,q) and \Sigma \mathrm{L}(n,q), respectively, by their subgroups of scalar matrices.

Lean code for Definition8.3.77●5 definitions
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/SemilinearGroup.lean
    complete
    abbrev Matrix.GeneralSemilinearGroup.{u_1, u_2, u_3} (n : Type u_1)
      (K : Type u_2) (F : Type u_3) [Fintype n] [DecidableEq n]
      [CommSemiring K] [CommRing F] [Algebra K F] : Type (max u_3 u_1)
    abbrev Matrix.GeneralSemilinearGroup.{u_1, u_2,
        u_3}
      (n : Type u_1) (K : Type u_2)
      (F : Type u_3) [Fintype n]
      [DecidableEq n] [CommSemiring K]
      [CommRing F] [Algebra K F] :
      Type (max u_3 u_1)
    The **general semilinear group** `ΓL_n(F) = GL_n(F) ⋊ Aut(F/K)` (LMFDB
    `group.linear_automorphism`), the automorphisms of `F` over `K` acting entrywise. For `K = ZMod p`
    and `F = GaloisField p r` with `r ≠ 0`, it is `ΓL(n, q)` with `q = p ^ r`. 
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/SemilinearGroup.lean
    complete
    abbrev Matrix.SpecialSemilinearGroup.{u_1, u_2, u_3} (n : Type u_1)
      (K : Type u_2) (F : Type u_3) [Fintype n] [DecidableEq n]
      [CommSemiring K] [CommRing F] [Algebra K F] : Type (max u_3 u_1)
    abbrev Matrix.SpecialSemilinearGroup.{u_1, u_2,
        u_3}
      (n : Type u_1) (K : Type u_2)
      (F : Type u_3) [Fintype n]
      [DecidableEq n] [CommSemiring K]
      [CommRing F] [Algebra K F] :
      Type (max u_3 u_1)
    The **special semilinear group** `ΣL_n(F) = SL_n(F) ⋊ Aut(F/K)` (LMFDB
    `group.linear_automorphism`), the automorphisms of `F` over `K` acting entrywise. For `K = ZMod p`
    and `F = GaloisField p r` with `r ≠ 0`, it is `ΣL(n, q)` with `q = p ^ r`. 
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/SemilinearGroup.lean
    complete
    abbrev Matrix.ProjectiveGeneralSemilinearGroup.{u_1, u_2, u_3} (n : Type u_1)
      (K : Type u_2) (F : Type u_3) [Fintype n] [DecidableEq n]
      [CommSemiring K] [CommRing F] [Algebra K F] :
      Type (max (max u_1 u_3) u_3 u_1)
    abbrev Matrix.ProjectiveGeneralSemilinearGroup.{u_1,
        u_2, u_3}
      (n : Type u_1) (K : Type u_2)
      (F : Type u_3) [Fintype n]
      [DecidableEq n] [CommSemiring K]
      [CommRing F] [Algebra K F] :
      Type (max (max u_1 u_3) u_3 u_1)
    The **projective general semilinear group** `PΓL_n(F)` (LMFDB `group.linear_automorphism`):
    the quotient of `ΓL_n(F)` by its subgroup of scalar matrices `(λ I, 1)`, the image of the centre of
    `GL_n(F)`. For `K = ZMod p` and `F = GaloisField p r` with `r ≠ 0`, it is `PΓL(n, q)` with
    `q = p ^ r`. 
  • abbrevdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/SemilinearGroup.lean
    complete
    abbrev Matrix.ProjectiveSpecialSemilinearGroup.{u_1, u_2, u_3} (n : Type u_1)
      (K : Type u_2) (F : Type u_3) [Fintype n] [DecidableEq n]
      [CommSemiring K] [CommRing F] [Algebra K F] :
      Type (max (max u_1 u_3) u_3 u_1)
    abbrev Matrix.ProjectiveSpecialSemilinearGroup.{u_1,
        u_2, u_3}
      (n : Type u_1) (K : Type u_2)
      (F : Type u_3) [Fintype n]
      [DecidableEq n] [CommSemiring K]
      [CommRing F] [Algebra K F] :
      Type (max (max u_1 u_3) u_3 u_1)
    The **projective special semilinear group** `PΣL_n(F)` (LMFDB `group.linear_automorphism`):
    the quotient of `ΣL_n(F)` by its subgroup of scalar matrices `(λ I, 1)` with `λ ^ n = 1`, the image
    of the centre of `SL_n(F)`. For `K = ZMod p` and `F = GaloisField p r` with `r ≠ 0`, it is
    `PΣL(n, q)` with `q = p ^ r`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/SemilinearGroup.lean
    complete
    def Matrix.GeneralLinearGroup.entrywiseAut.{u_1, u_2, u_3} {n : Type u_1}
      {K : Type u_2} {F : Type u_3} [Fintype n] [DecidableEq n]
      [CommSemiring K] [CommRing F] [Algebra K F] :
      (F ≃ₐ[K] F) →* MulAut (GL n F)
    def Matrix.GeneralLinearGroup.entrywiseAut.{u_1,
        u_2, u_3}
      {n : Type u_1} {K : Type u_2}
      {F : Type u_3} [Fintype n]
      [DecidableEq n] [CommSemiring K]
      [CommRing F] [Algebra K F] :
      (F ≃ₐ[K] F) →* MulAut (GL n F)
    The entrywise action `σ • M = (σ (M i j))` of the automorphisms of `F` over `K` on `GL_n(F)`. 
Definition8.3.78
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Lower central series of a group. (LMFDB)

If G is a group, for subsets A and B let [A,B] be the subgroup generated by commutators of A and B, i.e.,

[A,B] = \langle a^{-1}b^{-1}ab\mid a\in A \text{ and } b\in B\rangle.

Further, let G^0=G and for i>0, G^i = [G,G^{i-1}]. Then, the lower central series of G is a normal series of subgroups

G \unrhd G^1 \unrhd G^2 \unrhd \cdots .

Then, G is nilpotent if and only if G^k =\langle e\rangle for some k>0.

Tau Ceti Review: Subgroup.lowerCentralSeries, Subgroup.nilpotent_iff_lowerCentralSeries.

Depends on: Definition 8.3.3 Definition 8.3.93 Definition 8.3.95 Definition 8.3.160

Lean code for Definition8.3.78●2 declarations
  • defdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    def Subgroup.lowerCentralSeries.{u_1} {G : Type u_1} [Group G]
      (S : Subgroup G) : ℕ → Subgroup G
    def Subgroup.lowerCentralSeries.{u_1}
      {G : Type u_1} [Group G]
      (S : Subgroup G) : ℕ → Subgroup G
    The lower central series of a subgroup `S` of `G`, computed in the ambient group `G`.
    This is the iterated commutator `⁅⁅⋯⁅S, S⁆, S⁆⋯, S⁆`, a subgroup of `G`. The lower central series
    of `G` itself is the case `S = ⊤`. 
  • theoremdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    theorem Subgroup.nilpotent_iff_lowerCentralSeries.{u_1} {G : Type u_1}
      [Group G] : Group.IsNilpotent G ↔ ∃ n, ⊤.lowerCentralSeries n = ⊥
    theorem Subgroup.nilpotent_iff_lowerCentralSeries.{u_1}
      {G : Type u_1} [Group G] :
      Group.IsNilpotent G ↔
        ∃ n, ⊤.lowerCentralSeries n = ⊥
    A group is nilpotent if and only if its lower central series eventually reaches
    the trivial subgroup. 
Definition8.3.79
uses 0used by 0✓L∃∀N

Matrix group. (LMFDB)

A matrix group is a subgroup of \GL_n(R) for some commutative ring R.

A given abstract group may have more than one presentation as a matrix group over different rings R.

The value z_k in a given matrix represents a primitive element of the finite field \F_{p^k} for some prime p.

Tau Ceti Review: Matrix.GeneralLinearGroup, Subgroup.

Lean code for Definition8.3.79●2 definitions
  • abbrevdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Defs.lean
    complete
    abbrev Matrix.GeneralLinearGroup.{u, v} (n : Type u) (R : Type v)
      [DecidableEq n] [Fintype n] [Semiring R] : Type (max v u)
    abbrev Matrix.GeneralLinearGroup.{u, v}
      (n : Type u) (R : Type v)
      [DecidableEq n] [Fintype n]
      [Semiring R] : Type (max v u)
    `GL n R` is the group of `n` by `n` `R`-matrices with unit determinant.
    Defined as a subtype of matrices 
  • structure(extends 2, 4 fields)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    structure Subgroup.{u_3} (G : Type u_3) [Group G] : Type u_3
    structure Subgroup.{u_3} (G : Type u_3) [Group G] :
      Type u_3
    A subgroup of a group `G` is a subset containing 1, closed under multiplication
    and closed under multiplicative inverse. 
    
    [Wikidata Q466109](https://www.wikidata.org/wiki/Q466109)
    • Submonoid G
    carrier : Set G
    Inherited from
    1. Submonoid
    2. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Submonoid
    2. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ self.carrier → x⁻¹ ∈ self.carrier
    `G` is closed under inverses 
Definition8.3.80
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Maximal quotient of a group. (LMFDB)

A maximal quotient M = G/K of a group G is a quotient of G with the property that if H \le K is normal in G then either H=K or H=1. Equivalently, K is a minimal normal subgroup of G.

Depends on: Definition 8.3.3 Definition 8.3.89 Definition 8.3.118

Lean code for Definition8.3.80●2 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/MinimalNormal.lean
    complete
    def MonoidHom.IsMaximalQuotient.{u_1, u_2} {G : Type u_1} {M : Type u_2}
      [Group G] [Group M] (f : G →* M) : Prop
    def MonoidHom.IsMaximalQuotient.{u_1, u_2}
      {G : Type u_1} {M : Type u_2} [Group G]
      [Group M] (f : G →* M) : Prop
    A surjective homomorphism `f : G →* M` is a **maximal quotient** (LMFDB
    `group.maximal_quotient`) of `G` if its kernel is a minimal normal subgroup of `G`, i.e. `M ≅ G ⧸ K`
    with `K` minimal normal. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/MinimalNormal.lean
    complete
    theorem QuotientGroup.isMaximalQuotient_mk'.{u_1} {G : Type u_1} [Group G]
      (K : Subgroup G) [K.Normal] :
      (QuotientGroup.mk' K).IsMaximalQuotient ↔ K.IsMinimalNormal
    theorem QuotientGroup.isMaximalQuotient_mk'.{u_1}
      {G : Type u_1} [Group G]
      (K : Subgroup G) [K.Normal] :
      (QuotientGroup.mk'
            K).IsMaximalQuotient ↔
        K.IsMinimalNormal
    The quotient `G ⧸ K` is a maximal quotient if and only if `K` is minimal normal. 
Definition8.3.81
uses 0
Used by 2
Reverse dependency previews
Preview
Definition 8.3.49
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Maximal subgroup of a group. (LMFDB)

If G is a group, a subgroup M is a maximal subgroup if for every subgroup H such that M\subseteq H \subseteq G, either H=M or H=G.

Tau Ceti Review: IsCoatom, IsCoatom.le_iff.

Lean code for Definition8.3.81●2 declarations
  • defdefined in Mathlib/Order/Atoms.lean
    complete
    def IsCoatom.{u_2} {α : Type u_2} [Preorder α] [OrderTop α] (a : α) : Prop
    def IsCoatom.{u_2} {α : Type u_2} [Preorder α]
      [OrderTop α] (a : α) : Prop
    A coatom of an `OrderTop` is an element with no other element between it and `⊤`,
    which is not `⊤`. 
  • theoremdefined in Mathlib/Order/Atoms.lean
    complete
    theorem IsCoatom.le_iff.{u_2} {α : Type u_2} [PartialOrder α] [OrderTop α]
      {a x : α} (h : IsCoatom a) : a ≤ x ↔ x = ⊤ ∨ x = a
    theorem IsCoatom.le_iff.{u_2} {α : Type u_2}
      [PartialOrder α] [OrderTop α] {a x : α}
      (h : IsCoatom a) : a ≤ x ↔ x = ⊤ ∨ x = a
Definition8.3.82
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Metabelian group. (LMFDB)

A finite group G is metabelian if its commutator subgroup is abelian. Equivalently, G is an extension of an abelian group by an abelian group. Metabelian groups are solvable, and they include all abelian, dihedral, quaternion, metacyclic, extra​special groups and groups of p-rank one.

Every metacylic group is metabelian, but the converse does not hold, as shown by these examples.

Depends on: Definition 8.3.5 Definition 8.3.40 Definition 8.3.59 Definition 8.3.149

Lean code for Definition8.3.82●8 declarations
  • class(1 method)defined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metabelian.lean
    complete
    class IsMetabelian.{u_1} (G : Type u_1) [Group G] : Prop
    class IsMetabelian.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group is **metabelian** (LMFDB `group.metabelian`) if its commutator subgroup is abelian. 
    isMulCommutative_commutator : IsMulCommutative ↥(commutator G)
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metabelian.lean
    complete
    theorem isMetabelian_iff_exists_normal.{u_1} (G : Type u_1) [Group G] :
      IsMetabelian G ↔
        ∃ N,
          ∃ (x : N.Normal), IsMulCommutative ↥N ∧ IsMulCommutative (G ⧸ N)
    theorem isMetabelian_iff_exists_normal.{u_1}
      (G : Type u_1) [Group G] :
      IsMetabelian G ↔
        ∃ N,
          ∃ (x : N.Normal),
            IsMulCommutative ↥N ∧
              IsMulCommutative (G ⧸ N)
    A group is metabelian if and only if it has an abelian normal subgroup with abelian quotient. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetabelianExamples.lean
    complete
    theorem IsMetacyclic.isMetabelian.{u_1} {G : Type u_1} [Group G]
      [h : IsMetacyclic G] : IsMetabelian G
    theorem IsMetacyclic.isMetabelian.{u_1}
      {G : Type u_1} [Group G]
      [h : IsMetacyclic G] : IsMetabelian G
    **Metacyclic groups are metabelian** (LMFDB `group.metabelian`): a cyclic normal subgroup with
    cyclic quotient is an abelian normal subgroup with abelian quotient. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetabelianExamples.lean
    complete
    theorem DihedralGroup.isMetabelian (n : ℕ) : IsMetabelian (DihedralGroup n)
    theorem DihedralGroup.isMetabelian (n : ℕ) :
      IsMetabelian (DihedralGroup n)
    **The dihedral groups are metabelian** (LMFDB `group.metabelian`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetabelianExamples.lean
    complete
    theorem QuaternionGroup.isMetabelian (n : ℕ) : IsMetabelian (QuaternionGroup n)
    theorem QuaternionGroup.isMetabelian (n : ℕ) :
      IsMetabelian (QuaternionGroup n)
    **The dicyclic groups are metabelian** (LMFDB `group.metabelian`), the generalised quaternion
    groups among them. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/ExtraspecialMetabelian.lean
    complete
    theorem IsExtraspecial.isMetabelian.{u_1} {p : ℕ} {G : Type u_1} [Group G]
      (h : IsExtraspecial p G) : IsMetabelian G
    theorem IsExtraspecial.isMetabelian.{u_1} {p : ℕ}
      {G : Type u_1} [Group G]
      (h : IsExtraspecial p G) :
      IsMetabelian G
    **Extraspecial groups are metabelian** (LMFDB `group.metabelian`): the commutator subgroup is
    the centre. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetabelianPRankOne.lean
    complete
    theorem IsPGroup.isMetabelian_of_pRank_le_one.{u_1} {p : ℕ} {G : Type u_1}
      [Group G] [Finite G] [Fact (Nat.Prime p)] (hG : IsPGroup p G)
      (hr : Group.pRank p G ≤ 1) : IsMetabelian G
    theorem IsPGroup.isMetabelian_of_pRank_le_one.{u_1}
      {p : ℕ} {G : Type u_1} [Group G]
      [Finite G] [Fact (Nat.Prime p)]
      (hG : IsPGroup p G)
      (hr : Group.pRank p G ≤ 1) :
      IsMetabelian G
    **`p`-groups of `p`-rank one are metabelian** (LMFDB `group.metabelian`): a finite `p`-group of
    `p`-rank at most one, that is, without an elementary abelian subgroup of order `p ^ 2`, has an
    abelian commutator subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetabelianExamples.lean
    complete
    theorem not_isMetacyclic_elementaryAbelian_two_three :
      ¬IsMetacyclic (Multiplicative (Fin 3 → ZMod 2))
    theorem not_isMetacyclic_elementaryAbelian_two_three :
      ¬IsMetacyclic
          (Multiplicative (Fin 3 → ZMod 2))
    **`C₂³` is not metacyclic** (LMFDB `group.metabelian`), although it is abelian, hence
    metabelian: the converse of `IsMetacyclic.isMetabelian` fails. 
Definition8.3.83
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.91
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Metacyclic group. (LMFDB)

A metacyclic group is an extension of a cyclic group by a cyclic group. All metacyclic groups are supersolvable and in particular monomial.

Every Z-group is metacyclic, but the converse does not hold, as shown by these examples.

Depends on: Definition 8.3.91 Definition 8.3.94 Definition 8.3.174 Definition 8.3.189

Lean code for Definition8.3.83●6 declarations
  • class(1 method)defined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    class IsMetacyclic.{u_1} (G : Type u_1) [Group G] : Prop
    class IsMetacyclic.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group `G` is **metacyclic** (LMFDB `group.metacyclic`) if it is an extension of a cyclic group
    by a cyclic group: it has a cyclic normal subgroup `N` with cyclic quotient `G ⧸ N`. 
    exists_normal : ∃ N, ∃ (x : N.Normal), IsCyclic ↥N ∧ IsCyclic (G ⧸ N)
    A metacyclic group has a cyclic normal subgroup with cyclic quotient. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsMetacyclic.isSupersolvable.{u_1} {G : Type u_1} [Group G]
      [h : IsMetacyclic G] : Group.IsSupersolvable G
    theorem IsMetacyclic.isSupersolvable.{u_1}
      {G : Type u_1} [Group G]
      [h : IsMetacyclic G] :
      Group.IsSupersolvable G
    **Metacyclic groups are supersolvable** (LMFDB `group.metacyclic`): for a cyclic normal subgroup
    `N` with cyclic quotient, `⊥ ≤ N ≤ G` is a normal series with cyclic factors. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsMetacyclic.isMGroup {G : Type} [Group G] [Finite G] [IsMetacyclic G] :
      IsMGroup G
    theorem IsMetacyclic.isMGroup {G : Type} [Group G]
      [Finite G] [IsMetacyclic G] : IsMGroup G
    **Finite metacyclic groups are M-groups** (LMFDB `group.metacyclic`), being supersolvable. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1} [Group G] [Finite G]
      [IsZGroup G] : IsMetacyclic G
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1}
      [Group G] [Finite G] [IsZGroup G] :
      IsMetacyclic G
    **Finite Z-groups are metacyclic** (LMFDB `group.metacyclic`): the commutator subgroup and the
    abelianization of a finite Z-group are cyclic. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsKleinFour.isMetacyclic.{u_1} {G : Type u_1} [Group G]
      [IsKleinFour G] : IsMetacyclic G
    theorem IsKleinFour.isMetacyclic.{u_1}
      {G : Type u_1} [Group G]
      [IsKleinFour G] : IsMetacyclic G
    **The Klein four-group is metacyclic** (LMFDB `group.metacyclic`): it is an extension of `C₂`
    by `C₂`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsKleinFour.not_isZGroup.{u_1} {G : Type u_1} [Group G]
      [IsKleinFour G] : ¬IsZGroup G
    theorem IsKleinFour.not_isZGroup.{u_1}
      {G : Type u_1} [Group G]
      [IsKleinFour G] : ¬IsZGroup G
    **The Klein four-group is not a Z-group** (LMFDB `group.metacyclic`): it is a non-cyclic
    `2`-group. So the converse of `IsZGroup.isMetacyclic` fails. 
Definition8.3.84
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.128
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Minimal degree of a complex irrep. (LMFDB)

The smallest positive integer d such that the group G admits a faithful irreducible complex representation of degree d.

Depends on: Definition 8.3.128 Definition 8.3.130

Lean code for Definition8.3.84●2 definitions
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegree.lean
    complete
    def irreducibleDegree.{u_3, u_4} (R : Type u_3) (G : Type u_4) [Field R]
      [Group G] : ℤ
    def irreducibleDegree.{u_3, u_4}
      (R : Type u_3) (G : Type u_4) [Field R]
      [Group G] : ℤ
    The **irreducible degree** `irr_R(G)` (LMFDB `group.min_faithful_linear`), the least `n` with a
    faithful irreducible matrix representation `G ↪ GL_n(R)` over a field `R`, and `-1` when there is
    no faithful irreducible representation, following the LMFDB's convention. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegree.lean
    complete
    def Matrix.GeneralLinearGroup.representation.{u_1, u_2} {R : Type u_1}
      {G : Type u_2} [CommRing R] [Group G] {n : ℕ}
      (ρ : G →* GL (Fin n) R) : Representation R G (Fin n → R)
    def Matrix.GeneralLinearGroup.representation.{u_1,
        u_2}
      {R : Type u_1} {G : Type u_2}
      [CommRing R] [Group G] {n : ℕ}
      (ρ : G →* GL (Fin n) R) :
      Representation R G (Fin n → R)
    The representation of `G` on `Rⁿ` given by a matrix representation `ρ : G →* GL_n(R)`. 
Definition8.3.85
uses 1used by 0✓L∃∀N

Minimal degree of a complex representation. (LMFDB)

The smallest positive integer d such that the group G admits a faithful complex representation of degree d.

Depends on: Definition 8.3.128

Lean code for Definition8.3.85●6 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    def minFaithfulDegree.{u_1, u_2} (R : Type u_1) (G : Type u_2) [CommRing R]
      [Group G] : ℕ
    def minFaithfulDegree.{u_1, u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] : ℕ
    The **least positive degree of a faithful matrix representation** of a group `G` over a ring
    `R` (LMFDB `group.min_complex_rep_deg` for `R = ℂ`, `group.min_rational_rep_deg` for `R = ℚ`): the
    smallest positive integer `d` such that `G` has a faithful representation `G ↪ GL_d(R)`. For a
    finite group and a nontrivial ring it is attained (`isLeast_minFaithfulDegree`), by the regular
    representation; when `G` has no faithful representation of positive degree it is `0` by
    convention. Unlike `linearDegree R G`, it is `1`, not `0`, for the trivial group. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem isLeast_minFaithfulDegree.{u_1, u_2} (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Finite G] [Nontrivial R] :
      IsLeast {n | 0 < n ∧ ∃ ρ, Function.Injective ⇑ρ}
        (minFaithfulDegree R G)
    theorem isLeast_minFaithfulDegree.{u_1, u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Finite G]
      [Nontrivial R] :
      IsLeast
        {n |
          0 < n ∧ ∃ ρ, Function.Injective ⇑ρ}
        (minFaithfulDegree R G)
    **The least positive degree of a faithful representation is attained** for a finite group
    `G` and a nontrivial ring `R`: it is the least positive `d` such that `G` has a faithful
    representation `G ↪ GL_d(R)` (LMFDB `group.min_complex_rep_deg`, `group.min_rational_rep_deg`).
    The regular representation, through permutation matrices, is faithful of degree `|G|`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem minFaithfulDegree_eq_linearDegree.{u_1, u_2} (R : Type u_1)
      (G : Type u_2) [CommRing R] [Group G] [Nontrivial G] :
      minFaithfulDegree R G = linearDegree R G
    theorem minFaithfulDegree_eq_linearDegree.{u_1,
        u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Nontrivial G] :
      minFaithfulDegree R G = linearDegree R G
    **The least positive degree of a faithful representation of a nontrivial group is its linear
    degree** `linearDegree R G`: the trivial group `GL_0(R)` receives no injective map from `G`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem minFaithfulDegree_eq_one.{u_1, u_2} (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Subsingleton G] : minFaithfulDegree R G = 1
    theorem minFaithfulDegree_eq_one.{u_1, u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G]
      [Subsingleton G] :
      minFaithfulDegree R G = 1
    **The least positive degree of a faithful representation of the trivial group is `1`**, where
    `linearDegree R G = 0` (`linearDegree_eq_zero`). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem minFaithfulDegree_eq_max_linearDegree_one.{u_1, u_2} (R : Type u_1)
      (G : Type u_2) [CommRing R] [Group G] [Finite G] [Nontrivial R] :
      minFaithfulDegree R G = max (linearDegree R G) 1
    theorem minFaithfulDegree_eq_max_linearDegree_one.{u_1,
        u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Finite G]
      [Nontrivial R] :
      minFaithfulDegree R G =
        max (linearDegree R G) 1
    **`minFaithfulDegree R G = max (linearDegree R G) 1`** for a finite group `G` and a nontrivial
    ring `R`: the two agree except for the trivial group. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegree.lean
    complete
    def linearDegree.{u_1, u_2} (R : Type u_1) (G : Type u_2) [CommRing R]
      [Group G] : ℕ
    def linearDegree.{u_1, u_2} (R : Type u_1)
      (G : Type u_2) [CommRing R] [Group G] :
      ℕ
    The **linear degree** `lin_R(G)` (LMFDB `group.min_faithful_linear`), the least `n` with a
    faithful matrix representation `G ↪ GL_n(R)`. Such an `n` exists for finite `G` and `R ≠ 0`, by the
    regular representation; otherwise this is `0` by convention. 
Definition8.3.86
Statement uses 9
Statement dependency previews
Preview
Definition 1.1.24
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Minimal faithful linear representations. (LMFDB)

A group G can always be represented as a matrix group, but the degree of the matrix group is constrained both by G and the ring R from which the matrix entries are drawn. The linear degree \operatorname{lin}_R(G) is the minimal degree n of a faithful linear representation \rho : G \hookrightarrow \GL_n(R), and the irreducible degree \operatorname{irr}_R(G) is the minimal degree n of a faithful irreducible representation \rho: G \hookrightarrow \GL_n(R). Note that, while a faithful linear representation always exists, there may be no faithful irreducible representations of G (in which case we conventionally set \operatorname{irr}_R(G) = -1).

For fields R of characteristic 0, these values can be characterized in terms of the character table of G. A character \chi of degree n is faithful if the only g \in G with \chi(g) = n is g=1. The value \operatorname{irr}_{\mathbb{C}}(G) can thus be read off of the character table, but computing \operatorname{lin}_{\mathbb{C}}(G) requires finding linear combinations of characters that are faithful.

For fields k that are not algebraically closed, summing over Galois orbits of complex characters yields characters with values in k, and the resulting characters will be faithful if and only if each of the summands is. However, the Schur index now plays a role, since multiple copies of the given k-values character may be needed in order to produce an actual representation with matrix entries in k. Both \operatorname{lin}_R(G) and \operatorname{irr}_R(G) are defined in terms of the matrix degree of a representation, which may be larger than the degree of a minimal faithful k-valued character.

Depends on: Definition 8.3.3 Definition 8.3.30 Definition 8.3.125 Definition 8.3.128 Definition 8.3.130 Definition 8.3.133 Definition 8.3.134 Definition 1.1.24 Definition 1.1.27

Definition8.3.87
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.128
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Minimal degree of a rational irrep. (LMFDB)

The smallest positive integer d such that the group G admits a faithful irreducible rational representation of degree d.

Depends on: Definition 8.3.128 Definition 8.3.130

Lean code for Definition8.3.87●2 definitions
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegree.lean
    complete
    def irreducibleDegree.{u_3, u_4} (R : Type u_3) (G : Type u_4) [Field R]
      [Group G] : ℤ
    def irreducibleDegree.{u_3, u_4}
      (R : Type u_3) (G : Type u_4) [Field R]
      [Group G] : ℤ
    The **irreducible degree** `irr_R(G)` (LMFDB `group.min_faithful_linear`), the least `n` with a
    faithful irreducible matrix representation `G ↪ GL_n(R)` over a field `R`, and `-1` when there is
    no faithful irreducible representation, following the LMFDB's convention. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegree.lean
    complete
    def Matrix.GeneralLinearGroup.representation.{u_1, u_2} {R : Type u_1}
      {G : Type u_2} [CommRing R] [Group G] {n : ℕ}
      (ρ : G →* GL (Fin n) R) : Representation R G (Fin n → R)
    def Matrix.GeneralLinearGroup.representation.{u_1,
        u_2}
      {R : Type u_1} {G : Type u_2}
      [CommRing R] [Group G] {n : ℕ}
      (ρ : G →* GL (Fin n) R) :
      Representation R G (Fin n → R)
    The representation of `G` on `Rⁿ` given by a matrix representation `ρ : G →* GL_n(R)`. 
Definition8.3.88
uses 1used by 0✓L∃∀N

Minimal degree of a rational representation. (LMFDB)

The smallest positive integer d such that the group G admits a faithful rational representation of degree d.

Depends on: Definition 8.3.128

Lean code for Definition8.3.88●6 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    def minFaithfulDegree.{u_1, u_2} (R : Type u_1) (G : Type u_2) [CommRing R]
      [Group G] : ℕ
    def minFaithfulDegree.{u_1, u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] : ℕ
    The **least positive degree of a faithful matrix representation** of a group `G` over a ring
    `R` (LMFDB `group.min_complex_rep_deg` for `R = ℂ`, `group.min_rational_rep_deg` for `R = ℚ`): the
    smallest positive integer `d` such that `G` has a faithful representation `G ↪ GL_d(R)`. For a
    finite group and a nontrivial ring it is attained (`isLeast_minFaithfulDegree`), by the regular
    representation; when `G` has no faithful representation of positive degree it is `0` by
    convention. Unlike `linearDegree R G`, it is `1`, not `0`, for the trivial group. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem isLeast_minFaithfulDegree.{u_1, u_2} (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Finite G] [Nontrivial R] :
      IsLeast {n | 0 < n ∧ ∃ ρ, Function.Injective ⇑ρ}
        (minFaithfulDegree R G)
    theorem isLeast_minFaithfulDegree.{u_1, u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Finite G]
      [Nontrivial R] :
      IsLeast
        {n |
          0 < n ∧ ∃ ρ, Function.Injective ⇑ρ}
        (minFaithfulDegree R G)
    **The least positive degree of a faithful representation is attained** for a finite group
    `G` and a nontrivial ring `R`: it is the least positive `d` such that `G` has a faithful
    representation `G ↪ GL_d(R)` (LMFDB `group.min_complex_rep_deg`, `group.min_rational_rep_deg`).
    The regular representation, through permutation matrices, is faithful of degree `|G|`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem minFaithfulDegree_eq_linearDegree.{u_1, u_2} (R : Type u_1)
      (G : Type u_2) [CommRing R] [Group G] [Nontrivial G] :
      minFaithfulDegree R G = linearDegree R G
    theorem minFaithfulDegree_eq_linearDegree.{u_1,
        u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Nontrivial G] :
      minFaithfulDegree R G = linearDegree R G
    **The least positive degree of a faithful representation of a nontrivial group is its linear
    degree** `linearDegree R G`: the trivial group `GL_0(R)` receives no injective map from `G`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem minFaithfulDegree_eq_one.{u_1, u_2} (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Subsingleton G] : minFaithfulDegree R G = 1
    theorem minFaithfulDegree_eq_one.{u_1, u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G]
      [Subsingleton G] :
      minFaithfulDegree R G = 1
    **The least positive degree of a faithful representation of the trivial group is `1`**, where
    `linearDegree R G = 0` (`linearDegree_eq_zero`). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegreePositive.lean
    complete
    theorem minFaithfulDegree_eq_max_linearDegree_one.{u_1, u_2} (R : Type u_1)
      (G : Type u_2) [CommRing R] [Group G] [Finite G] [Nontrivial R] :
      minFaithfulDegree R G = max (linearDegree R G) 1
    theorem minFaithfulDegree_eq_max_linearDegree_one.{u_1,
        u_2}
      (R : Type u_1) (G : Type u_2)
      [CommRing R] [Group G] [Finite G]
      [Nontrivial R] :
      minFaithfulDegree R G =
        max (linearDegree R G) 1
    **`minFaithfulDegree R G = max (linearDegree R G) 1`** for a finite group `G` and a nontrivial
    ring `R`: the two agree except for the trivial group. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulDegree.lean
    complete
    def linearDegree.{u_1, u_2} (R : Type u_1) (G : Type u_2) [CommRing R]
      [Group G] : ℕ
    def linearDegree.{u_1, u_2} (R : Type u_1)
      (G : Type u_2) [CommRing R] [Group G] :
      ℕ
    The **linear degree** `lin_R(G)` (LMFDB `group.min_faithful_linear`), the least `n` with a
    faithful matrix representation `G ↪ GL_n(R)`. Such an `n` exists for finite `G` and `R ≠ 0`, by the
    regular representation; otherwise this is `0` by convention. 
Definition8.3.89
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Minimal normal subgroup. (LMFDB)

A minimal normal subgroup K of a group G is a normal subgroup of G with the property that if H \le K is normal in G then either H=K or H=1. Equivalently, G / K is a maximal quotient of G.

Depends on: Definition 8.3.3 Definition 8.3.167

Lean code for Definition8.3.89●2 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/MinimalNormal.lean
    complete
    def Subgroup.IsMinimalNormal.{u_1} {G : Type u_1} [Group G]
      (K : Subgroup G) : Prop
    def Subgroup.IsMinimalNormal.{u_1}
      {G : Type u_1} [Group G]
      (K : Subgroup G) : Prop
    A subgroup `K` of `G` is a **minimal normal subgroup** (LMFDB `group.minimal_normal`) if it is
    a minimal element among the nontrivial normal subgroups of `G`. The LMFDB's wording does not
    exclude `K = 1`, but minimal normal subgroups are nontrivial by the standard convention, which we
    follow. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/MinimalNormal.lean
    complete
    theorem Subgroup.isMinimalNormal_iff.{u_1} {G : Type u_1} [Group G]
      (K : Subgroup G) :
      K.IsMinimalNormal ↔
        K.Normal ∧
          K ≠ ⊥ ∧ ∀ (H : Subgroup G), H.Normal → H ≤ K → H = ⊥ ∨ H = K
    theorem Subgroup.isMinimalNormal_iff.{u_1}
      {G : Type u_1} [Group G]
      (K : Subgroup G) :
      K.IsMinimalNormal ↔
        K.Normal ∧
          K ≠ ⊥ ∧
            ∀ (H : Subgroup G),
              H.Normal → H ≤ K → H = ⊥ ∨ H = K
    The characterisation of minimal normal subgroups in LMFDB `group.minimal_normal`. 
Definition8.3.90
uses 1used by 0✓L∃∀N

Möbius function of subgroup lattice. (LMFDB)

Given a finite group G, we define the möbius subgroup function \mu_G(H) on the lattice of subgroups of G by setting \mu_G(G) = 1 and then inductively using the relation

\mu_G(H) = -\sum_{H' > H} \mu_G(H').

Similarly, we define the möbius quotient function \nu_G(N) on the lattice of normal subgroups of G by setting \nu_G(1) = 1 and inductively using the relation

\nu_G(N) = -\sum_{N' < N} \nu_G(N').

The möbius subgroup function is used in computing the rank of G, while the möbius quotient function is used in computing the number of faithful representations of G.

Depends on: Definition 8.3.121

Lean code for Definition8.3.90●4 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupMobius.lean
    complete
    def Subgroup.mobius.{u_1} {G : Type u_1} [Group G] [Finite G]
      (H : Subgroup G) : ℤ
    def Subgroup.mobius.{u_1} {G : Type u_1}
      [Group G] [Finite G] (H : Subgroup G) :
      ℤ
    The **Möbius subgroup function** (LMFDB `group.mobius_function`) `μ_G(H)` of a finite group,
    the Möbius function `μ(H, G)` of the lattice of subgroups of `G`. It is determined by
    `μ_G(G) = 1` and `μ_G(H) = -∑_{H' > H} μ_G(H')`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupMobius.lean
    complete
    def Subgroup.normalMobius.{u_1} {G : Type u_1} [Group G] [Finite G]
      (N : { N // N.Normal }) : ℤ
    def Subgroup.normalMobius.{u_1} {G : Type u_1}
      [Group G] [Finite G]
      (N : { N // N.Normal }) : ℤ
    The **Möbius quotient function** (LMFDB `group.mobius_function`) `ν_G(N)` of a finite group,
    the Möbius function `μ(1, N)` of the lattice of normal subgroups of `G`. It is determined by
    `ν_G(1) = 1` and `ν_G(N) = -∑_{N' < N} ν_G(N')`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupMobius.lean
    complete
    theorem Subgroup.mobius_eq_neg_finsum.{u_1} {G : Type u_1} [Group G] [Finite G]
      {H : Subgroup G} (hH : H ≠ ⊤) :
      H.mobius = -∑ᶠ (K : Subgroup G) (_ : K ∈ Set.Ioi H), K.mobius
    theorem Subgroup.mobius_eq_neg_finsum.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      {H : Subgroup G} (hH : H ≠ ⊤) :
      H.mobius =
        -∑ᶠ (K : Subgroup G) (_ :
            K ∈ Set.Ioi H), K.mobius
    The recursion of LMFDB `group.mobius_function` for the Möbius subgroup function. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupMobius.lean
    complete
    theorem Subgroup.normalMobius_eq_neg_finsum.{u_1} {G : Type u_1} [Group G]
      [Finite G] {N : { N // N.Normal }} (hN : N ≠ ⟨⊥, ⋯⟩) :
      Subgroup.normalMobius N =
        -∑ᶠ (K : { N // N.Normal }) (_ : K ∈ Set.Iio N),
            Subgroup.normalMobius K
    theorem Subgroup.normalMobius_eq_neg_finsum.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      {N : { N // N.Normal }}
      (hN : N ≠ ⟨⊥, ⋯⟩) :
      Subgroup.normalMobius N =
        -∑ᶠ (K : { N // N.Normal }) (_ :
            K ∈ Set.Iio N),
            Subgroup.normalMobius K
    The recursion of LMFDB `group.mobius_function` for the Möbius quotient function. 
Definition8.3.91
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.149
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.3.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Monomial group. (LMFDB)

A group G is monomial or an M-group if every complex irreducible representation of G is induced from a 1-dimensional representation of some subgroup. Such a group is always solvable, and monomial groups include all supersolvable groups and solvable A-groups. A purely group-theoretic description of monomial groups is not known.

While every supersolvable group is monomial, the converse does not hold, as shown by these examples. Similarly, these examples show that not every solvable A-group is supersolvable. There are also examples of solvable groups that are not monomial.

Depends on: Definition 8.3.149 Definition 8.3.174

Lean code for Definition8.3.91●8 declarations
  • class(1 method)defined in LeanBridge/ForMathlib/RepresentationTheory/MGroup.lean
    complete
    class IsMGroup (G : Type) [Group G] [Finite G] : Prop
    class IsMGroup (G : Type) [Group G] [Finite G] :
      Prop
    A finite group `G` is **monomial**, or an **M-group** (LMFDB `group.monomial`), if every
    complex irreducible representation of `G` is induced from a one-dimensional representation
    `χ : H →* ℂˣ` of some subgroup `H`. 
    exists_iso_indFDRep : ∀ (W : FDRep ℂ G) [CategoryTheory.Simple W], ∃ H χ, Nonempty (W ≅ TauCeti.indFDRep (FDRep.ofLinearCharacter χ))
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSolvable.lean
    complete
    theorem IsMGroup.isSolvable {G : Type} [Group G] [Finite G] [IsMGroup G] :
      Group.IsSolvable G
    theorem IsMGroup.isSolvable {G : Type} [Group G]
      [Finite G] [IsMGroup G] :
      Group.IsSolvable G
    **Taketa's theorem: M-groups are solvable** (LMFDB `group.monomial`). If every irreducible
    complex representation of the finite group `G` is induced from a one-dimensional representation
    of a subgroup, then `G` is solvable: its `n`-th derived subgroup acts trivially on the irreducible
    representations of degree at most `n`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsMGroup.of_isSupersolvable {G : Type} [Group G] [Finite G]
      (hG : Group.IsSupersolvable G) : IsMGroup G
    theorem IsMGroup.of_isSupersolvable {G : Type}
      [Group G] [Finite G]
      (hG : Group.IsSupersolvable G) :
      IsMGroup G
    **Huppert's theorem: finite supersolvable groups are M-groups** (LMFDB `group.monomial`,
    `group.supersolvable`). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsMGroup.of_isSolvable_of_isAGroup {G : Type} [Group G] [Finite G]
      [Group.IsSolvable G] [IsAGroup G] : IsMGroup G
    theorem IsMGroup.of_isSolvable_of_isAGroup
      {G : Type} [Group G] [Finite G]
      [Group.IsSolvable G] [IsAGroup G] :
      IsMGroup G
    **Finite solvable A-groups are M-groups** (LMFDB `group.monomial`, `group.a_group`; Isaacs,
    6.23). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsMGroup.of_isSupersolvable_quotient {G : Type} [Group G] [Finite G]
      (N : Subgroup G) [N.Normal] [Group.IsSolvable ↥N] [IsAGroup ↥N]
      (hN : Group.IsSupersolvable (G ⧸ N)) : IsMGroup G
    theorem IsMGroup.of_isSupersolvable_quotient
      {G : Type} [Group G] [Finite G]
      (N : Subgroup G) [N.Normal]
      [Group.IsSolvable ↥N] [IsAGroup ↥N]
      (hN : Group.IsSupersolvable (G ⧸ N)) :
      IsMGroup G
    **A finite group with a normal solvable A-subgroup and supersolvable quotient is an M-group**
    (LMFDB `group.monomial`; Isaacs, Theorem 6.22). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupExamples.lean
    complete
    theorem not_forall_isSupersolvable_of_isMGroup :
      ¬∀ (G : Type) [inst : Group G] [inst_1 : Finite G],
          IsMGroup G → Group.IsSupersolvable G
    theorem not_forall_isSupersolvable_of_isMGroup :
      ¬∀ (G : Type) [inst : Group G]
          [inst_1 : Finite G],
          IsMGroup G → Group.IsSupersolvable G
    **Not every monomial group is supersolvable** (LMFDB `group.monomial`): the alternating group
    `A₄` is an M-group but is not supersolvable. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupExamples.lean
    complete
    theorem not_forall_isSupersolvable_of_isSolvable_of_isAGroup :
      ¬∀ (G : Type) [inst : Group G] [Finite G],
          Group.IsSolvable G → IsAGroup G → Group.IsSupersolvable G
    theorem not_forall_isSupersolvable_of_isSolvable_of_isAGroup :
      ¬∀ (G : Type) [inst : Group G]
          [Finite G],
          Group.IsSolvable G →
            IsAGroup G →
              Group.IsSupersolvable G
    **Not every solvable A-group is supersolvable** (LMFDB `group.monomial`): the alternating
    group `A₄` is a solvable A-group but is not supersolvable. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupExamples.lean
    complete
    theorem not_forall_isMGroup_of_isSolvable :
      ¬∀ (G : Type) [inst : Group G] [inst_1 : Finite G],
          Group.IsSolvable G → IsMGroup G
    theorem not_forall_isMGroup_of_isSolvable :
      ¬∀ (G : Type) [inst : Group G]
          [inst_1 : Finite G],
          Group.IsSolvable G → IsMGroup G
    **Not every solvable group is monomial** (LMFDB `group.monomial`): the group `SL₂(𝔽₃)` is
    solvable but is not an M-group. 
Definition8.3.92
Statement uses 17
Statement dependency previews
Preview
Definition 8.3.14
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Abstract group name. (LMFDB)

We describe abstract groups using standard building blocks: <ul> <li> C_n denotes the cyclic group of order n. <li> S_n denotes the symmetric group on n letters. <li> A_n denotes the alternating group on n letters. <li> D_n denotes the dihedral group of order 2n. <li> Q_n denotes the (generalized) quaternion group of order n. <li> F_q denotes the Frobenius group for a prime power q. It is the group of affine linear transformations of the finite field \mathbb{F}_q. In other words, F_q is a semidirect product \mathbb{F}_q : \mathbb{F}_q^{\times}. <li> Sporadic Groups (refer to this wikipage): <ul> <li> M_n for n=11,12, 22,23, 24 denotes the Mathieu groups <li> \Ru denotes the Rudvalis group <li> \McL denotes the McLaughlin group <li> \He denotes the Held group <li> \HS denotes the Higman–Sims group <li> J_1, J_2, J_3 denote the Janko groups <li> \Co_2 and \Co_3 denote the Conway groups </ul> <li> Here is a list of finite groups of Lie type. <li> \SD_n denotes the semidihedral group or quasidihedral group of order n=2^k. <li> \OD_n denotes the other-dihedral group (or modular maximal-cyclic group) of order n=2^k. It is the non-trivial semidirect product C_{2^{k-1}} : C_2 which is not isomorphic to either \SD_n or D_{2^{k-1}}. <li> \He_p denotes the Heisenberg group, the unique non-abelian group of order p^3 and exponent p for an odd prime p. </ul>

Groups A and B may be used to construct a larger group:

  • A\times B for the direct product of A and B.

  • A:B for the semidirect product of A and B (with normal subgroup A).

  • A.B an extension with normal subgroup A and quotient isomorphic to B.

  • A\wr B for the wreath product of A and B.

Tau Ceti Review: TauCeti.AffineGroup.

Depends on: Definition 8.3.14 Definition 8.3.37 Definition 8.3.40 Definition 8.3.41 Definition 8.3.50 Definition 8.3.59 Definition 8.3.65 Definition 8.3.75 Definition 8.3.94 Definition 8.3.97 Definition 8.3.101 Definition 8.3.137 Definition 8.3.138 Definition 8.3.157 Definition 8.3.167 Definition 8.3.176 Definition 8.3.188

Lean code for Definition8.3.92●8 declarations
  • abbrevdefined in TauCeti/GroupTheory/SpecificGroups/Affine/Basic.lean
    complete
    abbrev TauCeti.AffineGroup.{u_1} (F : Type u_1) [Ring F] : Type u_1
    abbrev TauCeti.AffineGroup.{u_1} (F : Type u_1)
      [Ring F] : Type u_1
    The one-dimensional affine group `F ⋊ Fˣ`, with units acting on the additive group by
    multiplication. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AffineLineGroup.lean
    complete
    def TauCeti.AffineGroup.mulEquivRangeToPermHom.{u_1} (F : Type u_1)
      [Field F] :
      TauCeti.AffineGroup F ≃*
        ↥(MulAction.toPermHom (TauCeti.AffineGroup F) F).range
    def TauCeti.AffineGroup.mulEquivRangeToPermHom.{u_1}
      (F : Type u_1) [Field F] :
      TauCeti.AffineGroup F ≃*
        ↥(MulAction.toPermHom
              (TauCeti.AffineGroup F) F).range
    The Frobenius group `F_q` as a group of maps (LMFDB `group.frobenius`): the isomorphism of the
    affine group of `F` with its image in the permutations of `F`, the action being faithful. By
    `TauCeti.AffineGroup.mem_range_toPermHom_iff` the image is the group of the maps `x ↦ a x + b`,
    `a ≠ 0`, under composition. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/ModularMaximalCyclic.lean
    complete
    abbrev OtherDihedralGroup (k : ℕ) [Fact (3 ≤ k)] : Type
    abbrev OtherDihedralGroup (k : ℕ)
      [Fact (3 ≤ k)] : Type
    The **other-dihedral group** `OD_{2^k}` (LMFDB `group.other_dihedral`), also called the
    modular group `M_{2^k}`: the semidirect product `C_{2^{k-1}} ⋊ C_2` in which the generator of
    `C_2` acts on `C_{2^{k-1}}` by `x ↦ x^{2^{k-2}+1}`, with presentation
    `⟨r, s | r^{2^{k-1}} = s^2 = 1, srs = r^{2^{k-2}+1}⟩`. It is defined for `k ≥ 3`; the LMFDB uses
    it for `k ≥ 4`, since `OD_8` is the dihedral group of order `8`
    (`OtherDihedralGroup.nonempty_mulEquiv_dihedralGroup`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OtherDihedralSemidirect.lean
    complete
    theorem ZMod.involutionMulAut_otherDihedralUnit_ne_one {k : ℕ} [Fact (3 ≤ k)] :
      ZMod.involutionMulAut (ZMod.otherDihedralUnit k) ⋯ ≠ 1
    theorem ZMod.involutionMulAut_otherDihedralUnit_ne_one
      {k : ℕ} [Fact (3 ≤ k)] :
      ZMod.involutionMulAut
          (ZMod.otherDihedralUnit k) ⋯ ≠
        1
    **The action of `C_2` on `C_{2^{k-1}}` that defines `OD_{2^k}` is non-trivial** (LMFDB
    `group.name`): the generator of `C_2` acts by `x ↦ x ^ (2 ^ (k - 2) + 1)`, which is not the
    identity. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OtherDihedralSemidirect.lean
    complete
    theorem SemidirectProduct.nonempty_mulEquiv_otherDihedralGroup_iff.{u_1, u_2}
      {k : ℕ} [Fact (3 ≤ k)] {N : Type u_1} {H : Type u_2} [Group N]
      [Group H] {φ : H →* MulAut N} (hk : 4 ≤ k) [IsCyclic N]
      (hN : Nat.card N = 2 ^ (k - 1)) (hH : Nat.card H = 2) (hφ : φ ≠ 1) :
      Nonempty (N ⋊[φ] H ≃* OtherDihedralGroup k) ↔
        IsEmpty (N ⋊[φ] H ≃* SemiDihedralGroup k) ∧
          IsEmpty (N ⋊[φ] H ≃* DihedralGroup (2 ^ (k - 1)))
    theorem SemidirectProduct.nonempty_mulEquiv_otherDihedralGroup_iff.{u_1,
        u_2}
      {k : ℕ} [Fact (3 ≤ k)] {N : Type u_1}
      {H : Type u_2} [Group N] [Group H]
      {φ : H →* MulAut N} (hk : 4 ≤ k)
      [IsCyclic N]
      (hN : Nat.card N = 2 ^ (k - 1))
      (hH : Nat.card H = 2) (hφ : φ ≠ 1) :
      Nonempty
          (N ⋊[φ] H ≃* OtherDihedralGroup k) ↔
        IsEmpty
            (N ⋊[φ] H ≃*
              SemiDihedralGroup k) ∧
          IsEmpty
            (N ⋊[φ] H ≃*
              DihedralGroup (2 ^ (k - 1)))
    **`OD_{2^k}` is the non-trivial semidirect product `C_{2^{k-1}} ⋊ C_2` which is isomorphic to
    neither `SD_{2^k}` nor `D_{2^{k-1}}`** (LMFDB `group.name`, `group.other_dihedral`), for `k ≥ 4`:
    a semidirect product `N ⋊[φ] H` of a cyclic group `N` of order `2 ^ (k - 1)` by a group `H` of
    order `2`, with `φ` non-trivial, is isomorphic to `OD_{2^k}` if and only if it is isomorphic to
    neither `SD_{2^k}` nor `D_{2^{k-1}}`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.natCard_zmod (p : ℕ) :
      Nat.card (TauCeti.HeisenbergGroup (ZMod p)) = p ^ 3
    theorem TauCeti.HeisenbergGroup.natCard_zmod
      (p : ℕ) :
      Nat.card
          (TauCeti.HeisenbergGroup (ZMod p)) =
        p ^ 3
    **The Heisenberg group `He_p` has order `p³`** (LMFDB `group.heisenberg`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.exponent_zmod {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hp2 : p ≠ 2) : Monoid.exponent (TauCeti.HeisenbergGroup (ZMod p)) = p
    theorem TauCeti.HeisenbergGroup.exponent_zmod
      {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hp2 : p ≠ 2) :
      Monoid.exponent
          (TauCeti.HeisenbergGroup (ZMod p)) =
        p
    **The Heisenberg group `He_p` has exponent `p` for odd `p`** (LMFDB `group.heisenberg`):
    `(x, y, z) ^ p = (p x, p y, p z + (p (p - 1) / 2) x y)`, and `p` divides `p (p - 1) / 2`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/HeisenbergClassification.lean
    complete
    theorem TauCeti.HeisenbergGroup.nonempty_mulEquiv_of_exponent_eq.{u_1}
      {G : Type u_1} [Group G] {p : ℕ} [hp : Fact (Nat.Prime p)]
      (hG : Nat.card G = p ^ 3) (hnc : ¬IsMulCommutative G)
      (hexp : Monoid.exponent G = p) :
      Nonempty (G ≃* TauCeti.HeisenbergGroup (ZMod p))
    theorem TauCeti.HeisenbergGroup.nonempty_mulEquiv_of_exponent_eq.{u_1}
      {G : Type u_1} [Group G] {p : ℕ}
      [hp : Fact (Nat.Prime p)]
      (hG : Nat.card G = p ^ 3)
      (hnc : ¬IsMulCommutative G)
      (hexp : Monoid.exponent G = p) :
      Nonempty
        (G ≃*
          TauCeti.HeisenbergGroup (ZMod p))
    **`He_p` is the unique non-abelian group of order `p³` and exponent `p`** (LMFDB
    `group.heisenberg`): for non-commuting `x`, `y` with commutator `z`, the map
    `(a, b, c) ↦ zᶜ yᵇ xᵃ` is an isomorphism. With `TauCeti.HeisenbergGroup.exponent_zmod`, this
    characterises `He_p` for odd `p`; for `p = 2` a group of exponent `2` is abelian. 
Definition8.3.93
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 8
Reverse dependency previews
Preview
Definition 8.3.48
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Nilpotent group. (LMFDB)

A finite group G is nilpotent if it is a direct product of p-groups. Equivalently, all Sylow subgroups of G are normal. Equivalently, G has a central series

\{1\}=G_0 \lhd G_1 \lhd G_2 \lhd \ldots \lhd G_k = G,

a nested sequence of normal subgroups with [G,G_{i+1}] \leq G_i.

The smallest such k is the nilpotency class of G. It is 0 for C_1, 1 for non-trivial abelian groups, and \geq 2 for all other nilpotent groups. By convention, one can define the nilpotency class of a non-nilpotent group to be -1.

Nilpotent groups are closed under subgroups and quotients (but not extensions), and are solvable, supersolvable and monomial.

Tau Ceti Review: Group.IsNilpotent, Group.nilpotencyClass.

Depends on: Definition 8.3.3 Definition 8.3.5 Definition 8.3.149

Lean code for Definition8.3.93●6 declarations
  • class(1 method)defined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    class Group.IsNilpotent.{u_2} (G : Type u_2) [Group G] : Prop
    class Group.IsNilpotent.{u_2} (G : Type u_2)
      [Group G] : Prop
    A group `G` is nilpotent if its upper central series is eventually `G`. 
    nilpotent' : ∃ n, Subgroup.upperCentralSeries G n = ⊤
  • defdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    def Group.nilpotencyClass.{u_1} (G : Type u_1) [Group G] : ℕ
    def Group.nilpotencyClass.{u_1} (G : Type u_1)
      [Group G] : ℕ
    The nilpotency class of a nilpotent group is the smallest natural `n` such that
    the `n`-th term of the upper central series is `G`. If `G` is not nilpotent then the nilpotency
    class takes the junk value 0. 
  • theoremdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    theorem Group.isNilpotent_of_finite_tfae.{u_1} {G : Type u_1} [hG : Group G]
      [Finite G] :
      [Group.IsNilpotent G, NormalizerCondition G,
          ∀ (H : Subgroup G), IsCoatom H → H.Normal,
          ∀ (p : ℕ), Fact (Nat.Prime p) → ∀ (P : Sylow p G), (↑P).Normal,
          Nonempty
            (((p : ↥(Nat.card G).primeFactors) →
                (P : Sylow (↑p) G) → ↥↑P) ≃*
              G)].TFAE
    theorem Group.isNilpotent_of_finite_tfae.{u_1}
      {G : Type u_1} [hG : Group G]
      [Finite G] :
      [Group.IsNilpotent G,
          NormalizerCondition G,
          ∀ (H : Subgroup G),
            IsCoatom H → H.Normal,
          ∀ (p : ℕ),
            Fact (Nat.Prime p) →
              ∀ (P : Sylow p G), (↑P).Normal,
          Nonempty
            (((p :
                  ↥(Nat.card
                        G).primeFactors) →
                (P : Sylow (↑p) G) → ↥↑P) ≃*
              G)].TFAE
    A finite group is nilpotent iff the normalizer condition holds, and iff all maximal groups are
    normal and iff all Sylow groups are normal and iff the group is the direct product of its Sylow
    groups. 
  • theoremdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    theorem Subgroup.least_ascending_central_series_length_eq_nilpotencyClass.{u_1}
      {G : Type u_1} [Group G] [hG : Group.IsNilpotent G] :
      Nat.find ⋯ = Group.nilpotencyClass G
    theorem Subgroup.least_ascending_central_series_length_eq_nilpotencyClass.{u_1}
      {G : Type u_1} [Group G]
      [hG : Group.IsNilpotent G] :
      Nat.find ⋯ = Group.nilpotencyClass G
    The nilpotency class of a nilpotent `G` is equal to the smallest `n` for which an ascending
    central series reaches `G` in its `n`-th term. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/NilpotentSupersolvable.lean
    complete
    theorem Group.IsNilpotent.isSupersolvable.{u_1} {G : Type u_1} [Group G]
      [Finite G] [Group.IsNilpotent G] : Group.IsSupersolvable G
    theorem Group.IsNilpotent.isSupersolvable.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      [Group.IsNilpotent G] :
      Group.IsSupersolvable G
    **A finite nilpotent group is supersolvable** (LMFDB `group.nilpotent`): it has a normal series
    `⊥ = N₀ ≤ N₁ ≤ ⋯ ≤ Nₖ = ⊤` with cyclic factors and all terms normal in `G`, obtained by adjoining
    at each step an element whose image in `G ⧸ Nᵢ` is a nontrivial central element. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/NilpotentSupersolvable.lean
    complete
    theorem Group.not_forall_isNilpotent_of_isNilpotent_quotient :
      ¬∀ (G : Type) [inst : Group G] (N : Subgroup G) [inst_1 : N.Normal],
          Group.IsNilpotent ↥N →
            Group.IsNilpotent (G ⧸ N) → Group.IsNilpotent G
    theorem Group.not_forall_isNilpotent_of_isNilpotent_quotient :
      ¬∀ (G : Type) [inst : Group G]
          (N : Subgroup G)
          [inst_1 : N.Normal],
          Group.IsNilpotent ↥N →
            Group.IsNilpotent (G ⧸ N) →
              Group.IsNilpotent G
    **Nilpotent groups are not closed under extensions** (LMFDB `group.nilpotent`): the dihedral
    group `D₃ ≅ S₃` is not nilpotent, although its normal rotation subgroup `C₃` and the quotient
    `D₃ ⧸ C₃ ≅ C₂` are. 
Definition8.3.94
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.3.67
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Split and non-split extension of groups. (LMFDB)

If G is a group with normal subgroup N and quotient Q\cong G/N, then G is a extension of Q by N, denoted N.Q. Equivalently there is a short exact sequence

1 \to N \to G \to Q \to 1.

If G has a subgroup \tilde Q\leq G such that \tilde Q\cap N=\langle e\rangle, and \tilde QN=G, then \tilde Q\cong Q and G is a semidirect product of N and \tilde Q. This is equivalent to the existence of a section of the quotient map G \to Q. In this case we say G is a split extension of Q by N.

If no such subgroup \tilde Q exists, then G is a non-split extension of Q by N.

Tau Ceti Review: GroupExtension, GroupExtension.Splitting, GroupExtension.Splitting.semidirectProductMulEquiv, Subgroup.IsComplement', SemidirectProduct.mulEquivSubgroup.

Depends on: Definition 8.3.3 Definition 8.3.118 Definition 8.3.138 Definition 8.3.167

Lean code for Definition8.3.94●9 declarations
  • structure(5 fields)defined in Mathlib/GroupTheory/GroupExtension/Defs.lean
    complete
    structure GroupExtension.{u_1, u_2, u_3} (N : Type u_1) (E : Type u_2)
      (G : Type u_3) [Group N] [Group E] [Group G] :
      Type (max (max u_1 u_2) u_3)
    structure GroupExtension.{u_1, u_2, u_3}
      (N : Type u_1) (E : Type u_2)
      (G : Type u_3) [Group N] [Group E]
      [Group G] : Type (max (max u_1 u_2) u_3)
    `GroupExtension N E G` is a short exact sequence of groups `1 → N → E → G → 1`. 
    inl : N →* E
    The inclusion homomorphism `N →* E` 
    rightHom : E →* G
    The projection homomorphism `E →* G` 
    inl_injective : Function.Injective ⇑self.inl
    The inclusion map is injective. 
    range_inl_eq_ker_rightHom : self.inl.range = self.rightHom.ker
    The range of the inclusion map is equal to the kernel of the projection map. 
    rightHom_surjective : Function.Surjective ⇑self.rightHom
    The projection map is surjective. 
  • structure(extends 4, 4 fields)defined in Mathlib/GroupTheory/GroupExtension/Defs.lean
    complete
    structure GroupExtension.Splitting.{u_1, u_2, u_3} {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E] [Group G]
      (S : GroupExtension N E G) : Type (max u_2 u_3)
    structure GroupExtension.Splitting.{u_1, u_2, u_3}
      {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E]
      [Group G] (S : GroupExtension N E G) :
      Type (max u_2 u_3)
    `Splitting` of a group extension is a section homomorphism. 
    • G →* E
    • S.Section
    toFun : G → E
    Inherited from
    1. MonoidHom
    2. OneHom
    map_one' : (↑self.toMonoidHom).toFun 1 = 1
    Inherited from
    1. MonoidHom
    2. OneHom
    map_mul' : ∀ (x y : G), (↑self.toMonoidHom).toFun (x * y) = (↑self.toMonoidHom).toFun x * (↑self.toMonoidHom).toFun y
    Inherited from
    1. MonoidHom
    rightInverse_rightHom : Function.RightInverse (↑self.toMonoidHom).toFun ⇑S.rightHom
    `Section` is a right inverse to `S.rightHom` 
  • defdefined in Mathlib/GroupTheory/GroupExtension/Basic.lean
    complete
    def GroupExtension.Splitting.semidirectProductMulEquiv.{u_1, u_2, u_3}
      {N : Type u_1} {G : Type u_2} [Group N] [Group G] {E : Type u_3}
      [Group E] {S : GroupExtension N E G} (s : S.Splitting) :
      N ⋊[s.conjAct] G ≃* E
    def GroupExtension.Splitting.semidirectProductMulEquiv.{u_1,
        u_2, u_3}
      {N : Type u_1} {G : Type u_2} [Group N]
      [Group G] {E : Type u_3} [Group E]
      {S : GroupExtension N E G}
      (s : S.Splitting) :
      N ⋊[s.conjAct] G ≃* E
    The group associated to a split extension is isomorphic to a semidirect product. 
  • abbrevdefined in Mathlib/GroupTheory/Complement.lean
    complete
    abbrev Subgroup.IsComplement'.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    abbrev Subgroup.IsComplement'.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    `H` and `K` are complements if `(*) : H × K → G` is a bijection 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    theorem nonempty_groupExtension_iff.{u_1, u_2, u_3} {N : Type u_1}
      {E : Type u_2} {G : Type u_3} [Group N] [Group E] [Group G] :
      Nonempty (GroupExtension N E G) ↔
        ∃ M, ∃ (x : M.Normal), Nonempty (↥M ≃* N) ∧ Nonempty (E ⧸ M ≃* G)
    theorem nonempty_groupExtension_iff.{u_1, u_2,
        u_3}
      {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E]
      [Group G] :
      Nonempty (GroupExtension N E G) ↔
        ∃ M,
          ∃ (x : M.Normal),
            Nonempty (↥M ≃* N) ∧
              Nonempty (E ⧸ M ≃* G)
    **An extension is a normal subgroup with its quotient** (LMFDB `group.nonsplit_product`):
    there is a short exact sequence `1 → N → E → G → 1` if and only if `E` has a normal subgroup
    isomorphic to `N` with quotient isomorphic to `G`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    theorem GroupExtension.exists_isComplement'_iff_nonempty_splitting.{u_1, u_2,
        u_3}
      {N : Type u_1} {E : Type u_2} {G : Type u_3} [Group N] [Group E]
      [Group G] (S : GroupExtension N E G) :
      (∃ K, S.inl.range.IsComplement' K) ↔ Nonempty S.Splitting
    theorem GroupExtension.exists_isComplement'_iff_nonempty_splitting.{u_1,
        u_2, u_3}
      {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E]
      [Group G] (S : GroupExtension N E G) :
      (∃ K, S.inl.range.IsComplement' K) ↔
        Nonempty S.Splitting
    **A split extension is one with a splitting** (LMFDB `group.nonsplit_product`): the image of
    `N` has a complement in `E` if and only if the projection `E → G` has a homomorphic section. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    theorem Subgroup.isComplement'_iff_disjoint_and_mul_eq_univ.{u_3} {G : Type u_3}
      [Group G] {H K : Subgroup G} :
      H.IsComplement' K ↔ Disjoint H K ∧ ↑H * ↑K = Set.univ
    theorem Subgroup.isComplement'_iff_disjoint_and_mul_eq_univ.{u_3}
      {G : Type u_3} [Group G]
      {H K : Subgroup G} :
      H.IsComplement' K ↔
        Disjoint H K ∧ ↑H * ↑K = Set.univ
    **Complements by intersection and product** (LMFDB `group.nonsplit_product`): `K` is a
    complement of `H` if and only if `H ∩ K = 1` and `HK = G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    def GroupExtension.complementMulEquiv.{u_1, u_2, u_3} {N : Type u_1}
      {E : Type u_2} {G : Type u_3} [Group N] [Group E] [Group G]
      (S : GroupExtension N E G) {K : Subgroup E}
      (hK : S.inl.range.IsComplement' K) : ↥K ≃* G
    def GroupExtension.complementMulEquiv.{u_1,
        u_2, u_3}
      {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E]
      [Group G] (S : GroupExtension N E G)
      {K : Subgroup E}
      (hK : S.inl.range.IsComplement' K) :
      ↥K ≃* G
    The **isomorphism `K ≃* G`** of a complement `K` of `N` in `E` with the quotient `G` of an
    extension `1 → N → E → G → 1` (LMFDB `group.nonsplit_product`): the restriction of the projection
    `E → G` to `K`, through Mathlib's isomorphism `E ⧸ N ≃* K` of the quotient with a complement. 
  • defdefined in Mathlib/GroupTheory/SemidirectProduct.lean
    complete
    def SemidirectProduct.mulEquivSubgroup.{u_2} {G : Type u_2} [Group G]
      {H K : Subgroup G} [H.Normal] (h : H.IsComplement' K) :
      ↥H ⋊[H.normalizerMonoidHom.comp (Subgroup.inclusion ⋯)] ↥K ≃* G
    def SemidirectProduct.mulEquivSubgroup.{u_2}
      {G : Type u_2} [Group G]
      {H K : Subgroup G} [H.Normal]
      (h : H.IsComplement' K) :
      ↥H ⋊[H.normalizerMonoidHom.comp
            (Subgroup.inclusion ⋯)]
          ↥K ≃*
        G
    The isomorphism from a semidirect product of complementary subgroups to the ambient group. 
Definition8.3.95
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 8.3.26
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Normal series of a group. (LMFDB)

If G is a group, a subnormal series for G is a chain of subgroups

\langle e\rangle =H_0 \lhd H_1 \lhd \cdots \lhd H_k=G

where each subgroup H_i is normal in H_{i+1} for all i.

A subnormal series where H_i is normal in G for all i is a normal series.

Depends on: Definition 8.3.3 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.95●5 declarations
  • structure(extends 1, 5 fields)defined in LeanBridge/ForMathlib/GroupTheory/SubnormalSeries.lean
    complete
    structure Subgroup.SubnormalSeries.{u_1} (G : Type u_1) [Group G] : Type u_1
    structure Subgroup.SubnormalSeries.{u_1}
      (G : Type u_1) [Group G] : Type u_1
    A **subnormal series** of `G` (LMFDB `group.normal_series`): a chain of subgroups
    `⊥ = H₀ ⊴ H₁ ⊴ ⋯ ⊴ Hₖ = ⊤` in which each `Hᵢ` is contained and normal in `Hᵢ₊₁`. 
    • RelSeries {p | p.1 ≤ p.2 ∧ (p.1.subgroupOf p.2).Normal}
    length : ℕ
    Inherited from
    1. RelSeries
    toFun : Fin (self.length + 1) → Subgroup G
    Inherited from
    1. RelSeries
    step : ∀ (i : Fin self.length), (self.toFun i.castSucc, self.toFun i.succ) ∈ {p | p.1 ≤ p.2 ∧ (p.1.subgroupOf p.2).Normal}
    Inherited from
    1. RelSeries
    head_eq_bot : self.head = ⊥
    A subnormal series starts at the trivial subgroup. 
    last_eq_top : self.last = ⊤
    A subnormal series ends at the whole group. 
  • structure(extends 2, 6 fields)defined in LeanBridge/ForMathlib/GroupTheory/SubnormalSeries.lean
    complete
    structure Subgroup.NormalSeries.{u_1} (G : Type u_1) [Group G] : Type u_1
    structure Subgroup.NormalSeries.{u_1} (G : Type u_1)
      [Group G] : Type u_1
    A **normal series** of `G` (LMFDB `group.normal_series`): a subnormal series all of whose
    terms are normal in `G`. 
    • Subgroup.SubnormalSeries G
    length : ℕ
    Inherited from
    1. Subgroup.SubnormalSeries
    2. RelSeries
    toFun : Fin (self.length + 1) → Subgroup G
    Inherited from
    1. Subgroup.SubnormalSeries
    2. RelSeries
    step : ∀ (i : Fin self.length), (self.toFun i.castSucc, self.toFun i.succ) ∈ {p | p.1 ≤ p.2 ∧ (p.1.subgroupOf p.2).Normal}
    Inherited from
    1. Subgroup.SubnormalSeries
    2. RelSeries
    head_eq_bot : self.head = ⊥
    Inherited from
    1. Subgroup.SubnormalSeries
    last_eq_top : self.last = ⊤
    Inherited from
    1. Subgroup.SubnormalSeries
    normal : ∀ (i : Fin (self.length + 1)), (self.toFun i).Normal
    Every term of a normal series is normal in the whole group. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubnormalSeries.lean
    complete
    theorem Subgroup.isSubnormal_iff_exists_subnormalSeries.{u_1} {G : Type u_1}
      [Group G] {H : Subgroup G} : H.IsSubnormal ↔ ∃ s i, s.toFun i = H
    theorem Subgroup.isSubnormal_iff_exists_subnormalSeries.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} :
      H.IsSubnormal ↔ ∃ s i, s.toFun i = H
    **A subgroup is subnormal if and only if it is a term of a subnormal series**: Mathlib's
    inductive predicate `Subgroup.IsSubnormal` agrees with the LMFDB's chains. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubnormalSeries.lean
    complete
    theorem Subgroup.SubnormalSeries.isSubnormal.{u_1} {G : Type u_1} [Group G]
      (s : Subgroup.SubnormalSeries G) (j : Fin (s.length + 1)) :
      (s.toFun j).IsSubnormal
    theorem Subgroup.SubnormalSeries.isSubnormal.{u_1}
      {G : Type u_1} [Group G]
      (s : Subgroup.SubnormalSeries G)
      (j : Fin (s.length + 1)) :
      (s.toFun j).IsSubnormal
    **Every term of a subnormal series is subnormal** in the sense of `Subgroup.IsSubnormal`. 
  • inductive(2 constructors, Prop, 3 parameters)defined in Mathlib/GroupTheory/IsSubnormal.lean
    complete
    inductive Subgroup.IsSubnormal.{u_1} {G : Type u_1} [Group G] : Subgroup G → Prop
    inductive Subgroup.IsSubnormal.{u_1} {G : Type u_1}
      [Group G] : Subgroup G → Prop
    A subgroup `H` of a group `G` satisfies `IsSubnormal` if
    * either `H = ⊤`;
    * or there is a subgroup `K` of `G` containing `H` and such that `H` is normal in `K` and
      `K` satisfies `IsSubnormal`.
    
    Equivalently, `H.IsSubnormal` means that there is a chain of subgroups
    `H₀ ≤ H₁ ≤ ... ≤ Hₙ` such that
    * `H = H₀`,
    * `G = Hₙ`,
    * for each `i ∈ {0, ..., n - 1}`, `Hᵢ` is a normal subgroup of `Hᵢ₊₁`.
    
    See `isSubnormal_iff` for this characterisation.
    
    Subgroup.IsSubnormal.top.{u_1} {G : Type u_1} [Group G] :
      ⊤.IsSubnormal
    The whole subgroup `G` is subnormal in itself. 
    Subgroup.IsSubnormal.step.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) (h_le : H ≤ K) (hSubn : K.IsSubnormal)
      (hN : (H.subgroupOf K).Normal) : H.IsSubnormal
    A subgroup `H` is subnormal if there is a subnormal subgroup `K` containing `H` that is
    subnormal itself and such that `H` is normal in `K`. 
Definition8.3.96
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.100
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Omega (Lie group). (LMFDB)

The groups \Omega(n,q) and \Omega^{\pm}(n,q) are subgroups of the special orthogonal groups \SO(n,q) and \SO^{\pm}(n,q). Their specific definitions depend on the properties of n and q.

When n is odd, \Omega(n,q) is a subgroup of \SO(n,q). If q is odd, \Omega(n,q) is the kernel of the spinor norm map \SO(n,q) \to (\F_q^\times)/(\F_q^\times)^2, and is an index 2 subgroup of \SO(n,q). When q is even, we define \Omega(n,q) = \SO(n,q).

When n is even, \Omega^{\pm}(n,q) is a subgroup of \SO^{\pm}(n,q). To define it, we use the quasideterminant map, sending g \in \SO(n,q) to (-1)^d, where d is the dimension of the subspace of V = \F_q^n fixed by g. Then \Omega^{\pm}(n,q) is the kernel of this map, i.e. all those g fixing an even-dimensional subspace of V.

The groups \POmega(n,q) are \POmega^{\pm}(n,q) are the quotients of \Omega(n,q) and \Omega^{\pm}(n,q), respectively, by their subgroups of scalar matrices.

(see , pages xi-xii)

Tau Ceti Review: TauCeti.QuadraticMap.specialOrthogonalGroup.

Depends on: Definition 8.3.100 Definition 8.3.156

Lean code for Definition8.3.96●8 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Chevalley.lean
    complete
    def QuadraticForm.omegaGroup.{u_1, u_2} {F : Type u_1} {V : Type u_2}
      [Field F] [AddCommGroup V] [Module F V] [Invertible 2]
      [FiniteDimensional F V] (Q : QuadraticForm F V)
      (hQ : QuadraticMap.Nondegenerate) :
      Subgroup ↥(TauCeti.QuadraticMap.specialOrthogonalGroup Q)
    def QuadraticForm.omegaGroup.{u_1, u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      [Invertible 2] [FiniteDimensional F V]
      (Q : QuadraticForm F V)
      (hQ : QuadraticMap.Nondegenerate) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            Q)
    The group **`Ω(Q)`** (LMFDB `group.chevalley`) of a nondegenerate quadratic form `Q` over a
    field in which `2` is invertible: the kernel of the spinor norm on `SO(Q)`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OmegaGroupCharTwo.lean
    complete
    def QuadraticForm.dicksonOmegaGroup.{u_1, u_2} {K : Type u_1} {V : Type u_2}
      [Field K] [CharP K 2] [AddCommGroup V] [Module K V]
      [FiniteDimensional K V] (Q : QuadraticForm K V)
      (hQ : LinearMap.ker (QuadraticMap.polarBilin Q) = ⊥) :
      Subgroup ↥(TauCeti.QuadraticMap.specialOrthogonalGroup Q)
    def QuadraticForm.dicksonOmegaGroup.{u_1, u_2}
      {K : Type u_1} {V : Type u_2} [Field K]
      [CharP K 2] [AddCommGroup V]
      [Module K V] [FiniteDimensional K V]
      (Q : QuadraticForm K V)
      (hQ :
        LinearMap.ker
            (QuadraticMap.polarBilin Q) =
          ⊥) :
      Subgroup
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            Q)
    The group **`Ω(Q)`** (LMFDB `group.omega`) of a quadratic form `Q` with nondegenerate polar
    form on a finite-dimensional vector space over a field of characteristic `2`: the kernel on
    `SO(Q)` of the Dickson invariant, or equivalently of the knowl's quasideterminant
    `g ↦ (-1) ^ dim ker (g - 1)` (`QuadraticForm.dicksonOmegaGroup_eq_comap_ker_quasideterminant`,
    `QuadraticForm.mem_dicksonOmegaGroup_iff`). Here `SO(Q) = O(Q)`
    (`QuadraticForm.specialOrthogonalGroup_eq_orthogonalGroup`). For odd `q`, `Ω` is the kernel of the
    spinor norm instead (`QuadraticForm.omegaGroup`): there the knowl's quasideterminant is the
    determinant in even dimension, trivial on `SO`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/DicksonInvariant.lean
    complete
    def QuadraticForm.quasideterminant.{u_1, u_2} {K : Type u_1} {V : Type u_2}
      [Field K] [AddCommGroup V] [Module K V] (Q : QuadraticForm K V)
      [CharP K 2] [FiniteDimensional K V]
      (hQ : LinearMap.ker (QuadraticMap.polarBilin Q) = ⊥) :
      ↥(TauCeti.QuadraticMap.orthogonalGroup Q) →* ℤˣ
    def QuadraticForm.quasideterminant.{u_1, u_2}
      {K : Type u_1} {V : Type u_2} [Field K]
      [AddCommGroup V] [Module K V]
      (Q : QuadraticForm K V) [CharP K 2]
      [FiniteDimensional K V]
      (hQ :
        LinearMap.ker
            (QuadraticMap.polarBilin Q) =
          ⊥) :
      ↥(TauCeti.QuadraticMap.orthogonalGroup
            Q) →*
        ℤˣ
    The **quasideterminant** `g ↦ (-1) ^ dim ker (g - 1)` (LMFDB `group.omega`) on the orthogonal
    group of a quadratic form `Q` with nondegenerate polar form on a finite-dimensional vector space
    over a field of characteristic `2`, `ker (g - 1)` being the fixed space of `g`: a homomorphism
    `O(Q) →* {±1}` with the same kernel as the Dickson invariant
    (`QuadraticForm.ker_quasideterminant`). 
  • defdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u, v, w} {R : Type u}
      {M : Type v} {N : Type w} [CommRing R] [AddCommGroup M] [Module R M]
      [AddCommMonoid N] [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u,
        v, w}
      {R : Type u} {M : Type v} {N : Type w}
      [CommRing R] [AddCommGroup M]
      [Module R M] [AddCommMonoid N]
      [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    The special orthogonal group: the orthogonal automorphisms of determinant one.
    
    The determinant is Mathlib's `LinearEquiv.det`, which is `1` by convention on a module that is not
    finite free; on such a module this subgroup is therefore all of `orthogonalGroup Q`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OmegaGroup.lean
    complete
    abbrev QuadraticForm.projectiveOmegaGroup.{u_1, u_2} {F : Type u_1}
      {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      (Q : QuadraticForm F V) [Invertible 2] [FiniteDimensional F V]
      (hQ : QuadraticMap.Nondegenerate) : Type u_2
    abbrev QuadraticForm.projectiveOmegaGroup.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      (Q : QuadraticForm F V) [Invertible 2]
      [FiniteDimensional F V]
      (hQ : QuadraticMap.Nondegenerate) :
      Type u_2
    The **projective group `PΩ(Q)`** (LMFDB `group.omega`) of a nondegenerate quadratic form `Q`
    over a field in which `2` is invertible: the quotient of `Ω(Q)` (`QuadraticForm.omegaGroup`, the
    kernel of the spinor norm on `SO(Q)`) by its subgroup of scalar automorphisms. For the parabolic,
    hyperbolic and elliptic forms over `𝔽_q`, `q` odd, these are `PΩ(2m + 1, q)`, `PΩ⁺(2m, q)` and
    `PΩ⁻(2m + 2, q)`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OmegaGroupCharTwo.lean
    complete
    abbrev QuadraticForm.projectiveDicksonOmegaGroup.{u_1, u_2} {K : Type u_1}
      {V : Type u_2} [Field K] [CharP K 2] [AddCommGroup V] [Module K V]
      [FiniteDimensional K V] (Q : QuadraticForm K V)
      (hQ : LinearMap.ker (QuadraticMap.polarBilin Q) = ⊥) : Type u_2
    abbrev QuadraticForm.projectiveDicksonOmegaGroup.{u_1,
        u_2}
      {K : Type u_1} {V : Type u_2} [Field K]
      [CharP K 2] [AddCommGroup V]
      [Module K V] [FiniteDimensional K V]
      (Q : QuadraticForm K V)
      (hQ :
        LinearMap.ker
            (QuadraticMap.polarBilin Q) =
          ⊥) :
      Type u_2
    The **projective group `PΩ(Q)`** (LMFDB `group.omega`) of a quadratic form `Q` with
    nondegenerate polar form over a field of characteristic `2`: the quotient of `Ω(Q)`
    (`QuadraticForm.dicksonOmegaGroup`) by its subgroup of scalar automorphisms, which is trivial
    (`QuadraticForm.scalarSubgroup_subgroupOf_dicksonOmegaGroup_eq_bot`), so that `PΩ(Q) ≅ Ω(Q)`
    (`QuadraticForm.projectiveDicksonOmegaGroupEquiv`). For the hyperbolic and elliptic forms over
    `𝔽_q`, `q` even, these are `PΩ⁺(2m, q)` and `PΩ⁻(2m + 2, q)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OmegaGroupIndex.lean
    complete
    theorem QuadraticForm.index_omegaGroup_eq_two_iff.{u_1, u_2} {F : Type u_1}
      {V : Type u_2} [Field F] [Invertible 2] [AddCommGroup V] [Module F V]
      [FiniteDimensional F V] {Q : QuadraticForm F V} [Finite F]
      (hQ : QuadraticMap.Nondegenerate) :
      (Q.omegaGroup hQ).index = 2 ↔ 2 ≤ Module.finrank F V
    theorem QuadraticForm.index_omegaGroup_eq_two_iff.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [Invertible 2] [AddCommGroup V]
      [Module F V] [FiniteDimensional F V]
      {Q : QuadraticForm F V} [Finite F]
      (hQ : QuadraticMap.Nondegenerate) :
      (Q.omegaGroup hQ).index = 2 ↔
        2 ≤ Module.finrank F V
    **`Ω(n, q)` has index `2` in `SO(n, q)` exactly when `n ≥ 2`** (LMFDB `group.omega`), for odd
    `q`: for `n ≤ 1` the group `SO(n, q)` is trivial. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/OmegaGroupIndex.lean
    complete
    theorem QuadraticForm.index_chevalleyB.{u_1} (F : Type u_1) [Field F]
      [Invertible 2] [Finite F] {m : ℕ} (hm : m ≠ 0) :
      (QuadraticForm.chevalleyB F m).index = 2
    theorem QuadraticForm.index_chevalleyB.{u_1}
      (F : Type u_1) [Field F] [Invertible 2]
      [Finite F] {m : ℕ} (hm : m ≠ 0) :
      (QuadraticForm.chevalleyB F m).index = 2
    **`Ω(2m + 1, q)` has index `2` in `SO(2m + 1, q)` for odd `q` and `m ≥ 1`** (LMFDB
    `group.omega`). 
Definition8.3.97
uses 1
Used by 25
Reverse dependency previews
Preview
Definition 4.1.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Order of a group. (LMFDB)

The order of a group is its cardinality as a set.

Tau Ceti Review: Nat.card, Cardinal.mk.

Depends on: Definition 8.3.3

Lean code for Definition8.3.97●2 definitions
  • defdefined in Mathlib/SetTheory/Cardinal/Finite.lean
    complete
    def Nat.card.{u_3} (α : Type u_3) : ℕ
    def Nat.card.{u_3} (α : Type u_3) : ℕ
    `Nat.card α` is the cardinality of `α` as a natural number.
    If `α` is infinite, `Nat.card α = 0`. 
  • defdefined in Mathlib/SetTheory/Cardinal/Defs.lean
    complete
    def Cardinal.mk.{u} : Type u → Cardinal.{u}
    def Cardinal.mk.{u} : Type u → Cardinal.{u}
    The cardinal number of a type 
Definition8.3.98
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.32
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Order of elements in a conjugacy class. (LMFDB)

All elements in a particular conjugacy class are of the same order in the group.

Tau Ceti Review: SemiconjBy.orderOf_eq, ConjClasses.

Depends on: Definition 8.3.32 Definition 8.3.45

Lean code for Definition8.3.98●3 declarations
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    theorem IsConj.orderOf_eq.{u_1} {G : Type u_1} [Group G] {x y : G}
      (h : IsConj x y) : orderOf x = orderOf y
    theorem IsConj.orderOf_eq.{u_1} {G : Type u_1}
      [Group G] {x y : G} (h : IsConj x y) :
      orderOf x = orderOf y
  • theoremdefined in Mathlib/GroupTheory/OrderOfElement.lean
    complete
    theorem SemiconjBy.orderOf_eq.{u_1} {G : Type u_1} [Group G] (a : G) {x y : G}
      (h : SemiconjBy a x y) : orderOf x = orderOf y
    theorem SemiconjBy.orderOf_eq.{u_1} {G : Type u_1}
      [Group G] (a : G) {x y : G}
      (h : SemiconjBy a x y) :
      orderOf x = orderOf y
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def ConjClasses.{u_1} (α : Type u_1) [Monoid α] : Type u_1
    def ConjClasses.{u_1} (α : Type u_1)
      [Monoid α] : Type u_1
    The quotient type of conjugacy classes of a group. 
Definition8.3.99
uses 1used by 0✓L∃∀N

Order statistics of a group. (LMFDB)

The order statistics of a group G is the multiset of orders of elements of G, with multiplicities given by the number of elements in G of that order.

For example, the Quaternion group of order 8 has order statistics \{1,2,4,4,4,4,4,4\} which we denote in searches as 1^1, 2^1, 4^6.

Depends on: Definition 8.3.45

Lean code for Definition8.3.99●2 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/OrderStatistics.lean
    complete
    def Monoid.orderStatistics.{u_1} (G : Type u_1) [Monoid G] [Fintype G] :
      Multiset ℕ
    def Monoid.orderStatistics.{u_1}
      (G : Type u_1) [Monoid G] [Fintype G] :
      Multiset ℕ
    The **order statistics** (LMFDB `group.order_stats`) of a finite group `G`: the multiset of the
    orders `orderOf g` of its elements `g`, each order counted with multiplicity the number of elements
    of that order. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/OrderStatistics.lean
    complete
    theorem Monoid.count_orderStatistics.{u_1} (G : Type u_1) [Monoid G] [Fintype G]
      (n : ℕ) :
      Multiset.count n (Monoid.orderStatistics G) = {g | orderOf g = n}.card
    theorem Monoid.count_orderStatistics.{u_1}
      (G : Type u_1) [Monoid G] [Fintype G]
      (n : ℕ) :
      Multiset.count n
          (Monoid.orderStatistics G) =
        {g | orderOf g = n}.card
Definition8.3.100
uses 0
Used by 4
Reverse dependency previews
Preview
Definition 8.3.25
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Orthogonal group. (LMFDB)

An orthogonal group over a vector space V of dimension n over a field F is a subgroup of \GL_n(F) that fixes a quadratic form Q, i.e. all those m such that Q(mx) = Q(x) for all x \in V.

Over a finite field, the orthogonal groups behave differently depending on the dimension n of V. When n is odd, there is one equivalence class of quadratic forms, and so there is a unique orthogonal group (up to isomorphism), denoted \GO(n,q). When n is even there are two equivalence classes of quadratic forms, called the + and - forms. These give rise to the orthogonal groups \GO^{+}(n,q) and \GO^{-}(n,q).

The special orthogonal groups \SO(n,q) and \SO^{\pm}(n,q) are the subgroups of \GO(n,q) and \GO^{\pm}(n,q), respectively, consisting of all matrices of determinant 1.

The projective orthogonal groups are given by the quotient of an orthogonal group by its subgroup of scalar matrices. In particular, we have

\begin{matrix} \PGO(n,q) = \GO(n,q)/\{ \pm I_n \}, & \PGO^{\pm}(n,q) = \begin{cases}\GO^{\pm}(n,q) & q \text{ even}, \\ \GO^{\pm}(n,q)/\{ \pm I_n \} & q \text{ odd}.\end{cases} \\ \\ \PSO(n,q) = \SO(n,q), & \PSO^{\pm}(n,q) = \begin{cases}\SO^{\pm}(n,q) & q \text{ even}, \\ \SO^{\pm}(n,q)/\{ \pm I_n \} & q \text{ odd}.\end{cases} \end{matrix}

(see , pages xi-xii)

Tau Ceti Review: TauCeti.QuadraticMap.orthogonalGroup, TauCeti.QuadraticMap.specialOrthogonalGroup.

Lean code for Definition8.3.100●8 declarations
  • defdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    def TauCeti.QuadraticMap.orthogonalGroup.{u, v, w} {R : Type u} {M : Type v}
      {N : Type w} [CommSemiring R] [AddCommMonoid M] [Module R M]
      [AddCommMonoid N] [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    def TauCeti.QuadraticMap.orthogonalGroup.{u,
        v, w}
      {R : Type u} {M : Type v} {N : Type w}
      [CommSemiring R] [AddCommMonoid M]
      [Module R M] [AddCommMonoid N]
      [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    The orthogonal group of a quadratic map: the linear automorphisms of `M` that preserve `Q`.
    
    Mathlib's `Matrix.orthogonalGroup n R` is a coordinate version of this for the standard form on
    `n → R`: its matrices preserve `x ↦ ∑ i, x i ^ 2`, and are all of its isometries as soon as `2` is
    not a zero divisor in `R`. `QuadraticMap.IsometryEquiv Q Q` is the same underlying set as
    `orthogonalGroup Q` (see `orthogonalGroupEquivIsometryEquiv`) but carries no group structure. 
  • defdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u, v, w} {R : Type u}
      {M : Type v} {N : Type w} [CommRing R] [AddCommGroup M] [Module R M]
      [AddCommMonoid N] [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u,
        v, w}
      {R : Type u} {M : Type v} {N : Type w}
      [CommRing R] [AddCommGroup M]
      [Module R M] [AddCommMonoid N]
      [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    The special orthogonal group: the orthogonal automorphisms of determinant one.
    
    The determinant is Mathlib's `LinearEquiv.det`, which is `1` by convention on a module that is not
    finite free; on such a module this subgroup is therefore all of `orthogonalGroup Q`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Orthogonal.lean
    complete
    abbrev QuadraticForm.projectiveOrthogonalGroup.{u_1, u_2} {F : Type u_1}
      {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      (Q : QuadraticForm F V) : Type u_2
    abbrev QuadraticForm.projectiveOrthogonalGroup.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      (Q : QuadraticForm F V) : Type u_2
    The **projective orthogonal group** `PGO(Q)` (LMFDB `group.orthogonal`): the quotient of the
    orthogonal group `O(Q)` (Tau Ceti's `TauCeti.QuadraticMap.orthogonalGroup`) by its subgroup of
    scalar automorphisms, which is `{±1}` when `Q ≠ 0`
    (`QuadraticForm.toModuleAut_mem_orthogonalGroup_iff`). 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Orthogonal.lean
    complete
    abbrev QuadraticForm.projectiveSpecialOrthogonalGroup.{u_1, u_2} {F : Type u_1}
      {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      (Q : QuadraticForm F V) : Type u_2
    abbrev QuadraticForm.projectiveSpecialOrthogonalGroup.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      (Q : QuadraticForm F V) : Type u_2
    The **projective special orthogonal group** `PSO(Q)` (LMFDB `group.orthogonal`): the quotient
    of the special orthogonal group `SO(Q)` (Tau Ceti's `TauCeti.QuadraticMap.specialOrthogonalGroup`)
    by its subgroup of scalar automorphisms. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Orthogonal.lean
    complete
    def QuadraticForm.ellipticForm.{u_1} (F : Type u_1) [Field F] (m : ℕ)
      [Finite F] : QuadraticForm F ((Fin m → F × F) × F × F)
    def QuadraticForm.ellipticForm.{u_1}
      (F : Type u_1) [Field F] (m : ℕ)
      [Finite F] :
      QuadraticForm F
        ((Fin m → F × F) × F × F)
    The **elliptic form** `x₁ y₁ + ⋯ + x_m y_m + (z² + z w + ζ w²)` on `(F × F) ^ m × (F × F)`, of
    dimension `2 m + 2` and Witt index `m`: the quadratic form of `-` type. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/FiniteFieldClassification.lean
    complete
    theorem QuadraticForm.exists_equivalent_smul_parabolicForm.{u_1, u_2}
      {F : Type u_1} {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      {Q : QuadraticForm F V} {m : ℕ} [FiniteDimensional F V] [Finite F]
      (hQ : QuadraticMap.Nondegenerate)
      (hV : Module.finrank F V = 2 * m + 1) :
      ∃ c, QuadraticMap.Equivalent (c • Q) (QuadraticForm.parabolicForm F m)
    theorem QuadraticForm.exists_equivalent_smul_parabolicForm.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      {Q : QuadraticForm F V} {m : ℕ}
      [FiniteDimensional F V] [Finite F]
      (hQ : QuadraticMap.Nondegenerate)
      (hV : Module.finrank F V = 2 * m + 1) :
      ∃ c,
        QuadraticMap.Equivalent (c • Q)
          (QuadraticForm.parabolicForm F m)
    **The nondegenerate quadratic forms of odd dimension over a finite field form one similarity
    class** (LMFDB `group.orthogonal`): a nondegenerate form of dimension `2 m + 1` over `𝔽_q` is
    isometric, after scaling by a unit, to the parabolic form `z² + x₁ y₁ + ⋯ + x_m y_m`. The form is
    the orthogonal sum of `m` hyperbolic planes, split off along isotropic vectors (which exist in
    dimension at least `3` by Chevalley–Warning), and of a line `⟨a⟩` with `a ≠ 0`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/FiniteFieldClassification.lean
    complete
    theorem QuadraticForm.equivalent_hyperbolicForm_or_equivalent_ellipticForm.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      {Q : QuadraticForm F V} {m : ℕ} [FiniteDimensional F V] [Finite F]
      (hQ : QuadraticMap.Nondegenerate)
      (hV : Module.finrank F V = 2 * m + 2) :
      QuadraticMap.Equivalent Q (QuadraticForm.hyperbolicForm F (m + 1)) ∨
        QuadraticMap.Equivalent Q (QuadraticForm.ellipticForm F m)
    theorem QuadraticForm.equivalent_hyperbolicForm_or_equivalent_ellipticForm.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      {Q : QuadraticForm F V} {m : ℕ}
      [FiniteDimensional F V] [Finite F]
      (hQ : QuadraticMap.Nondegenerate)
      (hV : Module.finrank F V = 2 * m + 2) :
      QuadraticMap.Equivalent Q
          (QuadraticForm.hyperbolicForm F
            (m + 1)) ∨
        QuadraticMap.Equivalent Q
          (QuadraticForm.ellipticForm F m)
    **The nondegenerate quadratic forms of even dimension over a finite field form two isometry
    classes** (LMFDB `group.orthogonal`): a nondegenerate form of dimension `2 m + 2` over `𝔽_q` is
    isometric to the hyperbolic form (`+` type) or to the elliptic form (`-` type), which are not
    similar (`QuadraticForm.not_equivalent_smul_hyperbolicForm_ellipticForm`). The form is the
    orthogonal sum of hyperbolic planes and of an anisotropic form of dimension `0` or `2`, and the
    anisotropic planes are all isometric (`QuadraticForm.equivalent_anisotropicPlane`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/FiniteFieldClassification.lean
    complete
    theorem QuadraticForm.not_equivalent_smul_hyperbolicForm_ellipticForm.{u_1}
      {F : Type u_1} [Field F] (c : Fˣ) (m : ℕ) [Finite F] :
      ¬QuadraticMap.Equivalent (c • QuadraticForm.hyperbolicForm F (m + 1))
          (QuadraticForm.ellipticForm F m)
    theorem QuadraticForm.not_equivalent_smul_hyperbolicForm_ellipticForm.{u_1}
      {F : Type u_1} [Field F] (c : Fˣ)
      (m : ℕ) [Finite F] :
      ¬QuadraticMap.Equivalent
          (c •
            QuadraticForm.hyperbolicForm F
              (m + 1))
          (QuadraticForm.ellipticForm F m)
    **The hyperbolic and elliptic forms are not similar** (LMFDB `group.orthogonal`): no scalar
    multiple of `x₁ y₁ + ⋯ + x_{m+1} y_{m+1}` is isometric to `x₁ y₁ + ⋯ + x_m y_m + (z² + z w + ζ w²)`.
    A similarity preserves the zeros of a form; an orthogonal sum with the plane `x y` multiplies the
    number of zeros by `q` up to a term depending only on dimensions, and `x y` has `2 q - 1` zeros
    while the anisotropic plane has one. 
Definition8.3.101
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.40
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Other-dihedral group. (LMFDB)

The other-dihedral group \OD_{2^k} is one of the four non-abelian groups of order 2^k containing a cyclic subgroup of index 2 (the other three being the dihedral group, the (generalized) quaternion group, and the semi-dihedral group). It has the group presentation:

\OD_{2^k} = \langle r,s \mid r^{2^{k-1}} = s^2 = 1,\ srs=r^{2^{k-2}+1}\rangle.

It can also be given as the semidirect product C_{2^{k-1}} \rtimes C_2 where the action of C_2 on C_{2^{k-1}} is given by x \mapsto x^{2^{k-2}+1}.

Depends on: Definition 8.3.40 Definition 8.3.59 Definition 8.3.97 Definition 8.3.137 Definition 8.3.138

Lean code for Definition8.3.101●8 declarations
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/ModularMaximalCyclic.lean
    complete
    abbrev OtherDihedralGroup (k : ℕ) [Fact (3 ≤ k)] : Type
    abbrev OtherDihedralGroup (k : ℕ)
      [Fact (3 ≤ k)] : Type
    The **other-dihedral group** `OD_{2^k}` (LMFDB `group.other_dihedral`), also called the
    modular group `M_{2^k}`: the semidirect product `C_{2^{k-1}} ⋊ C_2` in which the generator of
    `C_2` acts on `C_{2^{k-1}}` by `x ↦ x^{2^{k-2}+1}`, with presentation
    `⟨r, s | r^{2^{k-1}} = s^2 = 1, srs = r^{2^{k-2}+1}⟩`. It is defined for `k ≥ 3`; the LMFDB uses
    it for `k ≥ 4`, since `OD_8` is the dihedral group of order `8`
    (`OtherDihedralGroup.nonempty_mulEquiv_dihedralGroup`). 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetacyclicPresentation.lean
    complete
    def OtherDihedralGroup.presentedGroupMulEquiv (k : ℕ) [Fact (3 ≤ k)] :
      PresentedGroup
          (ZMod.involutionRelators (2 ^ (k - 1)) (2 ^ (k - 2) + 1)) ≃*
        OtherDihedralGroup k
    def OtherDihedralGroup.presentedGroupMulEquiv
      (k : ℕ) [Fact (3 ≤ k)] :
      PresentedGroup
          (ZMod.involutionRelators
            (2 ^ (k - 1))
            (2 ^ (k - 2) + 1)) ≃*
        OtherDihedralGroup k
    **The presentation `OD_{2^k} = ⟨r, s | r^{2^{k-1}} = s² = 1, s r s = r^{2^{k-2}+1}⟩` of the
    other-dihedral group** (LMFDB `group.other_dihedral`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem OtherDihedralGroup.index_range_inl (k : ℕ) [Fact (3 ≤ k)] :
      SemidirectProduct.inl.range.index = 2
    theorem OtherDihedralGroup.index_range_inl (k : ℕ)
      [Fact (3 ≤ k)] :
      SemidirectProduct.inl.range.index = 2
    **The image of `C_{2^{k-1}}` in `OD_{2^k}` has index `2`** (LMFDB `group.other_dihedral`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem OtherDihedralGroup.not_isMulCommutative (k : ℕ) [Fact (3 ≤ k)] :
      ¬IsMulCommutative (OtherDihedralGroup k)
    theorem OtherDihedralGroup.not_isMulCommutative
      (k : ℕ) [Fact (3 ≤ k)] :
      ¬IsMulCommutative (OtherDihedralGroup k)
    **The other-dihedral group `OD_{2^k}` is non-abelian** (LMFDB `group.other_dihedral`): the
    generator of `C_2` sends that of `C_{2^{k-1}}` to its power `2 ^ (k - 2) + 1 ≠ 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem nonempty_mulEquiv_of_isCyclic_of_index_eq_two.{u_1} {G : Type u_1}
      [Group G] {N : Subgroup G} {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k)
      (hG : Nat.card G = 2 ^ k) [IsCyclic ↥N] (hN : N.index = 2)
      (hnc : ¬IsMulCommutative G) :
      Nonempty (G ≃* DihedralGroup (2 ^ (k - 1))) ∨
        Nonempty (G ≃* QuaternionGroup (2 ^ (k - 2))) ∨
          Nonempty (G ≃* SemiDihedralGroup k) ∨
            Nonempty (G ≃* OtherDihedralGroup k)
    theorem nonempty_mulEquiv_of_isCyclic_of_index_eq_two.{u_1}
      {G : Type u_1} [Group G]
      {N : Subgroup G} {k : ℕ} [Fact (3 ≤ k)]
      (hk : 4 ≤ k) (hG : Nat.card G = 2 ^ k)
      [IsCyclic ↥N] (hN : N.index = 2)
      (hnc : ¬IsMulCommutative G) :
      Nonempty
          (G ≃* DihedralGroup (2 ^ (k - 1))) ∨
        Nonempty
            (G ≃*
              QuaternionGroup (2 ^ (k - 2))) ∨
          Nonempty
              (G ≃* SemiDihedralGroup k) ∨
            Nonempty
              (G ≃* OtherDihedralGroup k)
    **The non-abelian groups of order `2 ^ k`, `k ≥ 4`, with a cyclic subgroup of index `2`**
    (LMFDB `group.semi_dihedral`, `group.other_dihedral`): such a group is isomorphic to the dihedral
    group `D_{2^{k-1}}` of order `2 ^ k`, the generalised quaternion group `Q_{2^k}`, the semi-dihedral
    group `SD_{2^k}` or the other-dihedral group `OD_{2^k}`. For a generator `a` of the cyclic
    subgroup and `b` outside it, `b a b⁻¹ = a ^ e` with `e ≡ -1` or `2 ^ (k - 2) ± 1` modulo
    `2 ^ (k - 1)`; for `e = 2 ^ (k - 2) ± 1` the coset of `b` contains an involution, and for `e = -1`
    the group is dihedral or dicyclic according as it contains one. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem DihedralGroup.isEmpty_mulEquiv_otherDihedralGroup {k : ℕ} [Fact (3 ≤ k)]
      (hk : 4 ≤ k) :
      IsEmpty (DihedralGroup (2 ^ (k - 1)) ≃* OtherDihedralGroup k)
    theorem DihedralGroup.isEmpty_mulEquiv_otherDihedralGroup
      {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty
        (DihedralGroup (2 ^ (k - 1)) ≃*
          OtherDihedralGroup k)
    **`D_{2^{k-1}}` and `OD_{2^k}` are not isomorphic for `k ≥ 4`** (LMFDB `group.semi_dihedral`,
    `group.other_dihedral`): they have `2 ^ (k - 1) + 2` and `4` solutions of `g² = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem QuaternionGroup.isEmpty_mulEquiv_otherDihedralGroup {k : ℕ}
      [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty (QuaternionGroup (2 ^ (k - 2)) ≃* OtherDihedralGroup k)
    theorem QuaternionGroup.isEmpty_mulEquiv_otherDihedralGroup
      {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty
        (QuaternionGroup (2 ^ (k - 2)) ≃*
          OtherDihedralGroup k)
    **`Q_{2^k}` and `OD_{2^k}` are not isomorphic for `k ≥ 4`** (LMFDB `group.semi_dihedral`,
    `group.other_dihedral`): they have `2` and `4` solutions of `g² = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem SemiDihedralGroup.isEmpty_mulEquiv_otherDihedralGroup {k : ℕ}
      [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty (SemiDihedralGroup k ≃* OtherDihedralGroup k)
    theorem SemiDihedralGroup.isEmpty_mulEquiv_otherDihedralGroup
      {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty
        (SemiDihedralGroup k ≃*
          OtherDihedralGroup k)
    **`SD_{2^k}` and `OD_{2^k}` are not isomorphic for `k ≥ 4`** (LMFDB `group.semi_dihedral`,
    `group.other_dihedral`): they have `2 ^ (k - 2) + 2` and `4` solutions of `g² = 1`. 
Definition8.3.102
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Outer automorphism group. (LMFDB)

If G is a group, its inner automorphism group is a normal subgroup of the full automorphism group. Then, the outer automorphism group of G is

\mathrm{Out}(G) = \Aut(G)/\mathrm{Inn}(G).

Note that the term outer automorphism is often used to mean any automorphism of a group G which is not an inner automorphism. In this case, the nontrivial elements of the outer automorphism group are cosets of outer automorphisms.

Tau Ceti Review: MulAut.conj.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.68 Definition 8.3.167

Lean code for Definition8.3.102●4 declarations
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/OuterAutomorphism.lean
    complete
    abbrev MulAut.Out.{u_1} (G : Type u_1) [Group G] : Type u_1
    abbrev MulAut.Out.{u_1} (G : Type u_1)
      [Group G] : Type u_1
    The **outer automorphism group** `Out(G) = Aut(G) / Inn(G)` (LMFDB `group.outer_aut`): the
    automorphism group of `G` modulo the normal subgroup of inner automorphisms. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/OuterAutomorphism.lean
    complete
    def MulAut.IsOuter.{u_1} {G : Type u_1} [Group G] (σ : MulAut G) : Prop
    def MulAut.IsOuter.{u_1} {G : Type u_1}
      [Group G] (σ : MulAut G) : Prop
    An automorphism of `G` is an **outer automorphism** (LMFDB `group.outer_aut`) if it is not an
    inner automorphism. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/OuterAutomorphism.lean
    complete
    theorem MulAut.isOuter_iff_ne_one.{u_1} {G : Type u_1} [Group G]
      (σ : MulAut G) : σ.IsOuter ↔ ↑σ ≠ 1
    theorem MulAut.isOuter_iff_ne_one.{u_1}
      {G : Type u_1} [Group G]
      (σ : MulAut G) : σ.IsOuter ↔ ↑σ ≠ 1
    **An automorphism is outer exactly when its class in `Out(G)` is nontrivial.** 
  • defdefined in Mathlib/Algebra/Group/End.lean
    complete
    def MulAut.conj.{u_3} {G : Type u_3} [Group G] : G →* MulAut G
    def MulAut.conj.{u_3} {G : Type u_3}
      [Group G] : G →* MulAut G
    Group conjugation, `MulAut.conj g h = g * h * g⁻¹`, as a monoid homomorphism
    mapping multiplication in `G` into multiplication in the automorphism group `MulAut G`.
    See also the type `ConjAct G` for any group `G`, which has a `MulAction (ConjAct G) G` instance
    where `conj G` acts on `G` by conjugation. 
Definition8.3.103
uses 1used by 0✓L∃∀N

Over-subgroup. (LMFDB)

If H \subseteq G is a subgroup, an over-subgroup is a subgroup K \subseteq G with H \subseteq K. A minimal over-subgroup is an over-subgroup K \ne H that is minimal with respect to inclusion.

Tau Ceti Review: Subgroup, CovBy.

Depends on: Definition 8.3.160

Lean code for Definition8.3.103●2 definitions
  • structure(extends 2, 4 fields)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    structure Subgroup.{u_3} (G : Type u_3) [Group G] : Type u_3
    structure Subgroup.{u_3} (G : Type u_3) [Group G] :
      Type u_3
    A subgroup of a group `G` is a subset containing 1, closed under multiplication
    and closed under multiplicative inverse. 
    
    [Wikidata Q466109](https://www.wikidata.org/wiki/Q466109)
    • Submonoid G
    carrier : Set G
    Inherited from
    1. Submonoid
    2. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Submonoid
    2. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ self.carrier → x⁻¹ ∈ self.carrier
    `G` is closed under inverses 
  • defdefined in Mathlib/Order/Defs/PartialOrder.lean
    complete
    def CovBy.{u_2} {α : Type u_2} [LT α] (a b : α) : Prop
    def CovBy.{u_2} {α : Type u_2} [LT α]
      (a b : α) : Prop
    `CovBy a b` means that `b` covers `a`. This means that `a < b` and there is no element in
    between. This is denoted `a ⋖ b`. 
Definition8.3.104
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 3.5.12
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Paramodular group. (LMFDB)

The paramodular group K(N) of level N is defined as

K(N)=\left\{ \left(\begin{matrix} * & N* & * &*\\ * & * & * & */N\\ * & N* &*&*\\ N*&N*&N*&* \end{matrix}\right) : *\in{\Bbb Z}\right\}\cap \mathrm{Sp}(4, {\Bbb Q})

where \mathrm{Sp}(4, {\Bbb Q}) is the symplectic group with rational entries.

The paramodular group is defined more intrinsically as the stabilizer in \Sp(4,\Q) of \Z\oplus\Z\oplus\Z\oplus N\Z (column vectors). Thus it comprises the \Sp(4,\Q) matrices

\left(\begin{matrix} * & * & * &*/N\\ * & * & * & */N\\ * & * &*&*/N\\ N*&N*&N*&*\end{matrix}\right)

but the symplectic conditions imply that such matrices satisfy the stronger entrywise conditions shown above.

Depends on: Definition 8.3.150

Lean code for Definition8.3.104●6 declarations
  • abbrevdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/ParamodularLevelRaising.lean
    complete
    abbrev SiegelUpperHalfSpace.paramodularLevel (N : ℕ+) :
      Subgroup ↥(Matrix.symplecticGroup (Fin 2) ℚ)
    abbrev SiegelUpperHalfSpace.paramodularLevel
      (N : ℕ+) :
      Subgroup
        ↥(Matrix.symplecticGroup (Fin 2) ℚ)
    The **paramodular group** `K(N) = Γ^para(1, N)` of degree `2` and level `N` (LMFDB
    `group.paramodular`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/ParamodularPattern.lean
    complete
    theorem SiegelUpperHalfSpace.mem_heckeGammaOf_paramodularLevel_iff {N : ℕ+}
      {Y : GL (Fin 2 ⊕ Fin 2) ℚ} :
      Y ∈
          SiegelUpperHalfSpace.heckeGammaOf
            (SiegelUpperHalfSpace.paramodularLevel N) ↔
        ↑Y ∈ Matrix.symplecticGroup (Fin 2) ℚ ∧
          SiegelUpperHalfSpace.IsParamodularShape N ↑Y
    theorem SiegelUpperHalfSpace.mem_heckeGammaOf_paramodularLevel_iff
      {N : ℕ+} {Y : GL (Fin 2 ⊕ Fin 2) ℚ} :
      Y ∈
          SiegelUpperHalfSpace.heckeGammaOf
            (SiegelUpperHalfSpace.paramodularLevel
              N) ↔
        ↑Y ∈
            Matrix.symplecticGroup (Fin 2) ℚ ∧
          SiegelUpperHalfSpace.IsParamodularShape
            N ↑Y
    **The elements of `K(N)` in `GL(4, ℚ)`** are the symplectic matrices of the shape
    `[ℤ, Nℤ, ℤ, ℤ; ℤ, ℤ, ℤ, N⁻¹ℤ; ℤ, Nℤ, ℤ, ℤ; Nℤ, Nℤ, Nℤ, ℤ]`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/ParamodularStabilizer.lean
    complete
    def SymplecticGroup.paramodularLattice.{u_1} {l : Type u_1} [DecidableEq l]
      (d : l → ℕ+) : Submodule ℤ (l ⊕ l → ℚ)
    def SymplecticGroup.paramodularLattice.{u_1}
      {l : Type u_1} [DecidableEq l]
      (d : l → ℕ+) : Submodule ℤ (l ⊕ l → ℚ)
    The lattice `ℤ^g ⊕ d₁ℤ ⊕ ⋯ ⊕ d_gℤ` of column vectors in `ℚ^{2g}` (LMFDB `group.paramodular`):
    the vectors `v` with `v(e_i) ∈ ℤ` and `v(f_i) ∈ d_i ℤ`, each coordinate lying in the multiples of
    the corresponding diagonal entry of `δ = diag(1_g, d)`. It is `δ ℤ^{2g}`
    (`SymplecticGroup.mem_paramodularLattice_iff_exists`), and for the paramodular group `K(N)` of
    level `N`, of type `d = (1, N)`, it is `ℤ ⊕ ℤ ⊕ ℤ ⊕ Nℤ`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/ParamodularStabilizer.lean
    complete
    theorem SiegelUpperHalfSpace.paramodularLevel_eq_stabilizer (N : ℕ+) :
      SiegelUpperHalfSpace.paramodularLevel N =
        MulAction.stabilizer ↥(Matrix.symplecticGroup (Fin 2) ℚ)
          ↑(SymplecticGroup.paramodularLattice ![1, N])
    theorem SiegelUpperHalfSpace.paramodularLevel_eq_stabilizer
      (N : ℕ+) :
      SiegelUpperHalfSpace.paramodularLevel
          N =
        MulAction.stabilizer
          ↥(Matrix.symplecticGroup (Fin 2) ℚ)
          ↑(SymplecticGroup.paramodularLattice
              ![1, N])
    **The paramodular group `K(N)` is the stabiliser in `Sp(4, ℚ)` of the lattice
    `ℤ ⊕ ℤ ⊕ ℤ ⊕ Nℤ` of column vectors** (LMFDB `group.paramodular`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/ParamodularStabilizer.lean
    complete
    theorem SiegelUpperHalfSpace.mem_paramodularLevel_iff_isParamodularWeakShape
      {N : ℕ+} {M : ↥(Matrix.symplecticGroup (Fin 2) ℚ)} :
      M ∈ SiegelUpperHalfSpace.paramodularLevel N ↔
        SiegelUpperHalfSpace.IsParamodularWeakShape N ↑M
    theorem SiegelUpperHalfSpace.mem_paramodularLevel_iff_isParamodularWeakShape
      {N : ℕ+}
      {M :
        ↥(Matrix.symplecticGroup (Fin 2) ℚ)} :
      M ∈
          SiegelUpperHalfSpace.paramodularLevel
            N ↔
        SiegelUpperHalfSpace.IsParamodularWeakShape
          N ↑M
    **The paramodular group `K(N)` comprises the symplectic matrices of the shape
    `[ℤ, ℤ, ℤ, N⁻¹ℤ; ℤ, ℤ, ℤ, N⁻¹ℤ; ℤ, ℤ, ℤ, N⁻¹ℤ; Nℤ, Nℤ, Nℤ, ℤ]`** (LMFDB `group.paramodular`):
    these are the symplectic matrices mapping `ℤ ⊕ ℤ ⊕ ℤ ⊕ Nℤ` into itself, which then map it onto
    itself. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/ParamodularStabilizer.lean
    complete
    theorem SiegelUpperHalfSpace.isParamodularShape_of_isParamodularWeakShape
      {N : ℕ+} {M : ↥(Matrix.symplecticGroup (Fin 2) ℚ)}
      (h : SiegelUpperHalfSpace.IsParamodularWeakShape N ↑M) :
      SiegelUpperHalfSpace.IsParamodularShape N ↑M
    theorem SiegelUpperHalfSpace.isParamodularShape_of_isParamodularWeakShape
      {N : ℕ+}
      {M :
        ↥(Matrix.symplecticGroup (Fin 2) ℚ)}
      (h :
        SiegelUpperHalfSpace.IsParamodularWeakShape
          N ↑M) :
      SiegelUpperHalfSpace.IsParamodularShape
        N ↑M
    **The symplectic conditions force the stronger shape** (LMFDB `group.paramodular`): a
    symplectic matrix of the shape `[ℤ, ℤ, ℤ, N⁻¹ℤ; ℤ, ℤ, ℤ, N⁻¹ℤ; ℤ, ℤ, ℤ, N⁻¹ℤ; Nℤ, Nℤ, Nℤ, ℤ]` has
    the shape `[ℤ, Nℤ, ℤ, ℤ; ℤ, ℤ, ℤ, N⁻¹ℤ; ℤ, Nℤ, ℤ, ℤ; Nℤ, Nℤ, Nℤ, ℤ]`, lying in `K(N)`. 
Definition8.3.105
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.3.114
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Perfect groups. (LMFDB)

A group G is perfect if it is equal to its own commutator subgroup G'. Equivalently, G has no non-trivial cyclic (equivalently abelian, equivalently soluble) quotients. All non-abelian simple and quasisimple groups are perfect.

A perfect group may have cyclic composition factors, for example, \mathrm{SL}(2,5)=C_2.A_5 is perfect.

Tau Ceti Review: Group.IsPerfect.

Depends on: Definition 8.3.3 Definition 8.3.28

Lean code for Definition8.3.105●6 declarations
  • class(1 method)defined in Mathlib/GroupTheory/IsPerfect.lean
    complete
    class Group.IsPerfect.{u_1} (G : Type u_1) [Group G] : Prop
    class Group.IsPerfect.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group `G` is perfect if `G` equals its commutator subgroup `⁅G, G⁆`. 
    commutator_eq_top : commutator G = ⊤
    The commutator of the group `G` with itself is the whole group `G`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/PerfectQuotients.lean
    complete
    theorem Group.isPerfect_iff_forall_isCyclic.{u} {G : Type u} [Group G]
      [Finite G] :
      Group.IsPerfect G ↔
        ∀ (H : Type u) [inst : Group H] [IsCyclic H] (f : G →* H),
          Function.Surjective ⇑f → Subsingleton H
    theorem Group.isPerfect_iff_forall_isCyclic.{u}
      {G : Type u} [Group G] [Finite G] :
      Group.IsPerfect G ↔
        ∀ (H : Type u) [inst : Group H]
          [IsCyclic H] (f : G →* H),
          Function.Surjective ⇑f →
            Subsingleton H
    **A finite group is perfect if and only if it has no nontrivial cyclic quotient** (LMFDB
    `group.perfect`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/PerfectQuotients.lean
    complete
    theorem Group.isPerfect_iff_forall_commutative.{u} {G : Type u} [Group G] :
      Group.IsPerfect G ↔
        ∀ (H : Type u) [inst : Group H] (f : G →* H),
          Function.Surjective ⇑f →
            (∀ (a b : H), a * b = b * a) → Subsingleton H
    theorem Group.isPerfect_iff_forall_commutative.{u}
      {G : Type u} [Group G] :
      Group.IsPerfect G ↔
        ∀ (H : Type u) [inst : Group H]
          (f : G →* H),
          Function.Surjective ⇑f →
            (∀ (a b : H), a * b = b * a) →
              Subsingleton H
    **A group is perfect if and only if it has no nontrivial abelian quotient** (LMFDB
    `group.perfect`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/PerfectQuotients.lean
    complete
    theorem Group.isPerfect_iff_forall_isSolvable.{u} {G : Type u} [Group G] :
      Group.IsPerfect G ↔
        ∀ (H : Type u) [inst : Group H] [Group.IsSolvable H] (f : G →* H),
          Function.Surjective ⇑f → Subsingleton H
    theorem Group.isPerfect_iff_forall_isSolvable.{u}
      {G : Type u} [Group G] :
      Group.IsPerfect G ↔
        ∀ (H : Type u) [inst : Group H]
          [Group.IsSolvable H] (f : G →* H),
          Function.Surjective ⇑f →
            Subsingleton H
    **A group is perfect if and only if it has no nontrivial solvable quotient** (LMFDB
    `group.perfect`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/PerfectQuotients.lean
    complete
    theorem Group.isPerfect_SL_two_five :
      Group.IsPerfect (Matrix.SpecialLinearGroup (Fin 2) (ZMod 5))
    theorem Group.isPerfect_SL_two_five :
      Group.IsPerfect
        (Matrix.SpecialLinearGroup (Fin 2)
          (ZMod 5))
    **`SL(2, 5)` is perfect** (LMFDB `group.perfect`). 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/PSL2ZModFive.lean
    complete
    def Matrix.ProjectiveSpecialLinearGroup.twoZModFiveEquivAlternatingGroup :
      Matrix.ProjectiveSpecialLinearGroup (Fin 2) (ZMod 5) ≃*
        ↥(alternatingGroup (Fin 5))
    def Matrix.ProjectiveSpecialLinearGroup.twoZModFiveEquivAlternatingGroup :
      Matrix.ProjectiveSpecialLinearGroup
          (Fin 2) (ZMod 5) ≃*
        ↥(alternatingGroup (Fin 5))
    **`PSL(2, 5)` is isomorphic to the alternating group `A₅`** (LMFDB `group.perfect`), so that
    `SL(2, 5) = C₂.A₅`, the centre of `SL(2, 5)` being `{±1}`. It is the inverse of `icosahedralHom`
    followed by Tau Ceti's isomorphism `TauCeti.TriangleGroup.equivIcosahedral` of `Δ(2, 3, 5)` with
    `A₅`: it maps the classes of `!![0, -1; 1, 0]` and `!![0, -1; 1, 1]` to `(0 1)(2 3)` and
    `(0 4 2)`. 
Definition8.3.106
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Permutation degree. (LMFDB)

Given a finite group G, the minimal permutation degree of G is the minimal degree of a faithful permutation representation of G. Equivalently, it is the smallest positive integer n such that S_n has a subgroup isomorphic to G which may or may not be transitive.

Depends on: Definition 8.3.3 Definition 8.3.108

Lean code for Definition8.3.106●3 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalDegree.lean
    complete
    def Group.minPermDegree.{u_1} (G : Type u_1) [Group G] : ℕ
    def Group.minPermDegree.{u_1} (G : Type u_1)
      [Group G] : ℕ
    The **minimal permutation degree** of a finite group `G` (LMFDB `group.permutation_degree`):
    the least positive integer `n` such that `G` embeds in the symmetric group `S_n`, i.e. has a
    faithful permutation representation of degree `n`. For an infinite group there is no such `n`, and
    the value is the junk `0`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalDegree.lean
    complete
    theorem Group.exists_injective_minPermDegree.{u_1} (G : Type u_1) [Group G]
      [Finite G] : ∃ f, Function.Injective ⇑f
    theorem Group.exists_injective_minPermDegree.{u_1}
      (G : Type u_1) [Group G] [Finite G] :
      ∃ f, Function.Injective ⇑f
    **`G` embeds in `S_n` for `n` its minimal permutation degree.** 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalDegree.lean
    complete
    theorem Group.minPermDegree_le.{u_1} {G : Type u_1} [Group G] {n : ℕ}
      {f : G →* Equiv.Perm (Fin n)} (hn : 0 < n)
      (hf : Function.Injective ⇑f) : Group.minPermDegree G ≤ n
    theorem Group.minPermDegree_le.{u_1}
      {G : Type u_1} [Group G] {n : ℕ}
      {f : G →* Equiv.Perm (Fin n)}
      (hn : 0 < n)
      (hf : Function.Injective ⇑f) :
      Group.minPermDegree G ≤ n
Definition8.3.107
uses 1used by 0✓L∃∀N

permutation module. (LMFDB)

If H is a finite index subgroup of G, then G acts on the right cosets of H via Hg\overset{g'}{\mapsto}Hgg', yielding a permutation representation that sends each g\in G to the permutation of H\backslash G given by its action. This defines a homomorphism from G to the symmetric group on n=[G:H] letters.

For a commutative ring R, the action of G of H\backslash G can be extended R-linearly to an action of G on R[H\backslash G], the free R-module with basis G\backslash H, which is then a module over the group ring R[G]. The R[G]-module R[H\backslash G] is a permutation module over R.

Tau Ceti Review: Representation.ofMulAction, MulAction.toPermHom.

Depends on: Definition 8.3.62

Lean code for Definition8.3.107●2 definitions
  • defdefined in Mathlib/RepresentationTheory/Basic.lean
    complete
    def Representation.ofMulAction.{u_1, u_2, u_3} (k : Type u_1) [Semiring k]
      (G : Type u_2) [Monoid G] (H : Type u_3) [MulAction G H] :
      Representation k G (MonoidAlgebra k H)
    def Representation.ofMulAction.{u_1, u_2, u_3}
      (k : Type u_1) [Semiring k]
      (G : Type u_2) [Monoid G] (H : Type u_3)
      [MulAction G H] :
      Representation k G (MonoidAlgebra k H)
    A `G`-action on `H` induces a representation `G →* End(k[H])` in the natural way. 
  • defdefined in Mathlib/Algebra/Group/Action/End.lean
    complete
    def MulAction.toPermHom.{u_1, u_4} (G : Type u_1) (α : Type u_4) [Group G]
      [MulAction G α] : G →* Equiv.Perm α
    def MulAction.toPermHom.{u_1, u_4}
      (G : Type u_1) (α : Type u_4) [Group G]
      [MulAction G α] : G →* Equiv.Perm α
    Given an action of a group `G` on a set `α`, each `g : G` defines a permutation of `α`. 
Definition8.3.108
uses 0
Used by 4
Reverse dependency previews
Preview
Definition 5.2.41
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Permutation representation. (LMFDB)

A permutation representation of a finite group G is a homomorphism \rho : G \to S_n for some n. The integer n is the degree of \rho, and a representation is faithful if \rho is injective. The representation is transitive if the set \{1, \dots, n\} cannot be broken up into smaller orbits under the action of G, i.e. for all 1 \le i \le j \le n there is some g \in G with \rho(g)(i) = j.

Tau Ceti Review: Equiv.Perm, MulAction.IsPretransitive, Equiv.permutationRepresentation, Equiv.isPretransitive_range_permutationRepresentation_iff.

Lean code for Definition8.3.108●4 declarations
  • abbrevdefined in Mathlib/Logic/Equiv/Defs.lean
    complete
    abbrev Equiv.Perm.{u_1} (α : Sort u_1) : Sort (max 1 u_1)
    abbrev Equiv.Perm.{u_1} (α : Sort u_1) :
      Sort (max 1 u_1)
    `Perm α` is the type of bijections from `α` to itself. 
  • class(1 method)defined in Mathlib/Algebra/Group/Action/Pretransitive.lean
    complete
    class MulAction.IsPretransitive.{u_5, u_6} (M : Type u_5) (α : Type u_6)
      [SMul M α] : Prop
    class MulAction.IsPretransitive.{u_5, u_6}
      (M : Type u_5) (α : Type u_6)
      [SMul M α] : Prop
    `M` acts pretransitively on `α` if for any `x y` there is `g` such that `g • x = y`.
    A transitive action should furthermore have `α` nonempty. 
    exists_smul_eq : ∀ (x y : α), ∃ g, g • x = y
    There is `g` such that `g • x = y`. 
  • defdefined in TauCeti/Algebra/GroupAction/PermutationRepresentation.lean
    complete
    def Equiv.permutationRepresentation.{u_1, u_2} {G : Type u_1} {α : Type u_2}
      [Group G] [MulAction G α] {n : ℕ} (e : α ≃ Fin n) :
      G →* Equiv.Perm (Fin n)
    def Equiv.permutationRepresentation.{u_1, u_2}
      {G : Type u_1} {α : Type u_2} [Group G]
      [MulAction G α] {n : ℕ}
      (e : α ≃ Fin n) :
      G →* Equiv.Perm (Fin n)
    **The permutation representation of a group action, read through an enumeration `e`.** The
    action on `α` is canonical; `e` only names the points. 
  • theoremdefined in TauCeti/Algebra/GroupAction/PermutationRepresentation.lean
    complete
    theorem Equiv.isPretransitive_range_permutationRepresentation_iff.{u_1, u_2}
      {G : Type u_1} {α : Type u_2} [Group G] [MulAction G α] {n : ℕ}
      (e : α ≃ Fin n) :
      MulAction.IsPretransitive (↥e.permutationRepresentation.range)
          (Fin n) ↔
        MulAction.IsPretransitive G α
    theorem Equiv.isPretransitive_range_permutationRepresentation_iff.{u_1,
        u_2}
      {G : Type u_1} {α : Type u_2} [Group G]
      [MulAction G α] {n : ℕ}
      (e : α ≃ Fin n) :
      MulAction.IsPretransitive
          (↥e.permutationRepresentation.range)
          (Fin n) ↔
        MulAction.IsPretransitive G α
    **The representation is transitive exactly when the action is.** 
Definition8.3.109
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.46
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

p-group. (LMFDB)

A p-group is a group whose order is a power of a prime p. A result of Higman and Sims shows that the number of groups of order p^k is p^{(2/27 + o(1))k^3}, and this can be combined with a result of Pyber to show that, asymptotically, 100% of groups are p-groups.

Depends on: Definition 8.3.3 Definition 8.3.97

Definition8.3.110
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.32
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Explanation of pictures for abstract groups. (LMFDB)

Pictures for abstract groups consist of several disks arranged in concentric circles. The size, position, and brightness each encode information about the group.

Quick summary ##

  • Each disk corresponds to a conjugacy class.

  • Conjugacy classes with more elements are larger than those with fewer elements.

  • Disks are arranged according to the number of prime divisors of the order of elements in the conjugacy class. The identity is in the center.

  • Darker disks of the same hue typically have orders that are more divisible by 2 than brighter disks with the same hue.

In more detail ##

Each disk corresponds to a conjugacy class in the group. The area of the disk is directly proportional to the number of elements in the corresponding conjugacy class. All elements in the conjugacy class have the same order o, which we use to determine both the color of the disk and the location of the disk.

For the color, write the common order of a given conjugacy class as o = 2^A \times (\mathrm{odd}), where A = v_2(o). Typically, larger A corresponds to darker colors in the hue-saturation-brightness color model. The odd part \mathrm{odd} determines the hue, chosen in a way that is aesthetically pleasing.

The position of each disk is determined by the number of prime divisors (counted with multiplicity) of the order. The identity element is in the center. An annulus around the identity contains all disks with order consisting of exactly 1 prime. Within each annulus, disks are placed to fit nicely. There is usually a small gap between adjacent annuli.

Implementation ##

The algorithm to visualize abstract groups was designed and implemented by David Roe.

Tau Ceti Review: ConjClasses, Nat.ordProj_mul_ordCompl_eq_self.

Depends on: Definition 8.3.32 Definition 8.3.45

Lean code for Definition8.3.110●7 declarations
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def ConjClasses.{u_1} (α : Type u_1) [Monoid α] : Type u_1
    def ConjClasses.{u_1} (α : Type u_1)
      [Monoid α] : Type u_1
    The quotient type of conjugacy classes of a group. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Label/ConjClass.lean
    complete
    def ConjClasses.elementOrder.{u_1} {G : Type u_1} [Group G]
      (c : ConjClasses G) : ℕ
    def ConjClasses.elementOrder.{u_1}
      {G : Type u_1} [Group G]
      (c : ConjClasses G) : ℕ
    The **order of the elements** of a conjugacy class (LMFDB `group.label_conjugacy_class`), the
    `N` of its label `NAj`: conjugate elements have the same order (`IsConj.orderOf_eq`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    theorem IsConj.orderOf_eq.{u_1} {G : Type u_1} [Group G] {x y : G}
      (h : IsConj x y) : orderOf x = orderOf y
    theorem IsConj.orderOf_eq.{u_1} {G : Type u_1}
      [Group G] {x y : G} (h : IsConj x y) :
      orderOf x = orderOf y
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Label/ConjClass.lean
    complete
    theorem ConjClasses.orderOf_eq_elementOrder.{u_1} {G : Type u_1} [Group G]
      {x : G} {c : ConjClasses G} (hx : x ∈ c.carrier) :
      orderOf x = c.elementOrder
    theorem ConjClasses.orderOf_eq_elementOrder.{u_1}
      {G : Type u_1} [Group G] {x : G}
      {c : ConjClasses G}
      (hx : x ∈ c.carrier) :
      orderOf x = c.elementOrder
    **All elements of a conjugacy class have the same order** (LMFDB `group.picture_description`),
    the order `c.elementOrder` of the class. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/ConjClassElementOrder.lean
    complete
    theorem ConjClasses.odd_elementOrder_div_two_pow.{u_1} {G : Type u_1} [Group G]
      {c : ConjClasses G} [Finite G] :
      Odd (c.elementOrder / 2 ^ c.elementOrder.factorization 2)
    theorem ConjClasses.odd_elementOrder_div_two_pow.{u_1}
      {G : Type u_1} [Group G]
      {c : ConjClasses G} [Finite G] :
      Odd
        (c.elementOrder /
          2 ^ c.elementOrder.factorization 2)
    **The order of a conjugacy class is `2 ^ A` times an odd number, `A = v₂(o)`** (LMFDB
    `group.picture_description`), in a finite group: `o / 2 ^ v₂(o)` is odd, and
    `2 ^ v₂(o) * (o / 2 ^ v₂(o)) = o` is Mathlib's `Nat.ordProj_mul_ordCompl_eq_self`. 
  • theoremdefined in Mathlib/Data/Nat/Factorization/Basic.lean
    complete
    theorem Nat.ordProj_mul_ordCompl_eq_self (n p : ℕ) :
      p ^ n.factorization p * (n / p ^ n.factorization p) = n
    theorem Nat.ordProj_mul_ordCompl_eq_self
      (n p : ℕ) :
      p ^ n.factorization p *
          (n / p ^ n.factorization p) =
        n
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Label/ConjClass.lean
    complete
    theorem ConjClasses.elementOrder_eq_one_iff.{u_1} {G : Type u_1} [Group G]
      {c : ConjClasses G} : c.elementOrder = 1 ↔ c = 1
    theorem ConjClasses.elementOrder_eq_one_iff.{u_1}
      {G : Type u_1} [Group G]
      {c : ConjClasses G} :
      c.elementOrder = 1 ↔ c = 1
    **The class of the identity is the only conjugacy class of order `1`** (LMFDB
    `group.picture_description`): it is the disk at the centre of the LMFDB's picture, the only one
    whose order has no prime factor (Mathlib's
    `ArithmeticFunction.cardFactors_eq_zero_iff_eq_zero_or_one`). 
Definition8.3.111
uses 1used by 1✓L∃∀N

Presentation of a finite group. (LMFDB)

A presentation of a group G is a description of G as the quotient F/R of a free group F generated by a specified set of generators, modulo the normal subgroup R generated by a set of words in those generators. When G is abelian we instead express G as a quotient of a free abelian group F so that we can omit commutator relations.

In what follows, we denote by g^h the conjugate h^{-1}gh and by [g, h] the commutator ghg^{-1}h^{-1}.

We only give presentations for finite solvable groups, where they can take a special form. A polycyclic series is a subnormal series G = G_1 \trianglerighteq G_2 \trianglerighteq \dots \trianglerighteq G_n \trianglerighteq G_{n+1} = \{1\} so that G_i/G_{i+1} is cyclic for each i. A polycyclic sequence is a sequence of elements (g_1, \dots, g_n) of G so that G_i/G_{i+1} = \langle g_i G_{i+1}\rangle. The relative orders of a polycyclic series are the orders r_i of the cyclic quotients G_i / G_{i+1}. The polycyclic presentation associated to a polycyclic sequence has generators g_1, \dots, g_n and relations of the following shape.

  • g_i^{r_i} = \prod_{k=i+1}^n g_k^{a_{i,k}} for all i;

  • g_i^{g_j} = \prod_{k=j+1}^n g_k^{b_{i,j,k}} for j < i.

Any finite solvable group has a polycyclic presentation. When the size of G is not too large, we choose a presentation with the following properties:

  • it has a minimal number of generators;

  • among such, it has a maximal number of i so that all a_{i,k} = 0;

  • among such, it has a maximal number of commuting g_i;

  • among such, aim for an increasing sequence of relative orders;

  • among such, minimize the sum of the b_{i,j,k} for noncommuting generators g_i and g_j.

Tau Ceti Review: PresentedGroup.

Depends on: Definition 8.3.95

Lean code for Definition8.3.111●5 definitions
  • defdefined in Mathlib/GroupTheory/PresentedGroup.lean
    complete
    def PresentedGroup.{u_1} {α : Type u_1} (rels : Set (FreeGroup α)) :
      Type u_1
    def PresentedGroup.{u_1} {α : Type u_1}
      (rels : Set (FreeGroup α)) : Type u_1
    Given a set of relations, `rels`, over a type `α`, `PresentedGroup` constructs the group with
    generators `x : α` and relations `rels` as a quotient of `FreeGroup α`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/PolycyclicPresentation.lean
    complete
    def Subgroup.SubnormalSeries.IsPolycyclic.{u_1} {G : Type u_1} [Group G]
      (s : Subgroup.SubnormalSeries G) : Prop
    def Subgroup.SubnormalSeries.IsPolycyclic.{u_1}
      {G : Type u_1} [Group G]
      (s : Subgroup.SubnormalSeries G) : Prop
    A subnormal series `⊥ = H₀ ⊴ H₁ ⊴ ⋯ ⊴ Hₖ = ⊤` is **polycyclic** (LMFDB `group.presentation`),
    or a polycyclic series, if its factors `Hᵢ₊₁ / Hᵢ` are cyclic. 
  • structure(4 fields)defined in LeanBridge/ForMathlib/GroupTheory/PolycyclicPresentation.lean
    complete
    structure PolycyclicSequence.{u_1} (G : Type u_1) [Group G] : Type u_1
    structure PolycyclicSequence.{u_1} (G : Type u_1)
      [Group G] : Type u_1
    A **polycyclic sequence** of `G` (LMFDB `group.presentation`), indexed from `0`: elements
    `g_0, …, g_{n-1}` of `G` such that the subgroups `G_i = ⟨g_i, …, g_{n-1}⟩` form a subnormal series
    `G = G_0 ⊵ G_1 ⊵ ⋯ ⊵ G_n = 1`. This is a polycyclic series (`Subgroup.SubnormalSeries.IsPolycyclic`,
    `PolycyclicSequence.isPolycyclic_toSubnormalSeries`), its factors `G_i / G_{i+1}` being the cyclic
    groups generated by the `g_i G_{i+1}`; conversely, a polycyclic sequence of a polycyclic series
    `(G_i)` has `G_i = ⟨g_i, …, g_{n-1}⟩`. 
    length : ℕ
    The length `n` of the sequence. 
    toFun : Fin self.length → G
    The terms `g_0, …, g_{n-1}` of the sequence. 
    closure_range : Subgroup.closure (Set.range self.toFun) = ⊤
    The terms of a polycyclic sequence generate the group. 
    normal : ∀ (i : Fin self.length),
      ((Subgroup.closureFrom self.toFun (↑i + 1)).subgroupOf (Subgroup.closureFrom self.toFun ↑i)).Normal
    Each `G_{i+1}` is normal in `G_i`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/PolycyclicPresentation.lean
    complete
    def PolycyclicSequence.relOrder.{u_1} {G : Type u_1} [Group G]
      (s : PolycyclicSequence G) (k : Fin s.length) : ℕ
    def PolycyclicSequence.relOrder.{u_1}
      {G : Type u_1} [Group G]
      (s : PolycyclicSequence G)
      (k : Fin s.length) : ℕ
    The **relative orders** of a polycyclic sequence (LMFDB `group.presentation`): the orders
    `r_i = [G_i : G_{i+1}]` of the cyclic factors of its polycyclic series. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/PolycyclicPresentation.lean
    complete
    def PolycyclicPresentation.relators {n : ℕ} (r : Fin n → ℕ)
      (a : Fin n → Fin n → ℤ) (b : Fin n → Fin n → Fin n → ℤ) :
      Set (FreeGroup (Fin n))
    def PolycyclicPresentation.relators {n : ℕ}
      (r : Fin n → ℕ) (a : Fin n → Fin n → ℤ)
      (b : Fin n → Fin n → Fin n → ℤ) :
      Set (FreeGroup (Fin n))
    The relators of the **polycyclic presentation** (LMFDB `group.presentation`) on generators
    `x_0, …, x_{n-1}` with relative orders `r`, power exponents `a` and conjugation exponents `b`: the
    relations `x_i ^ r_i = ∏_{k > i} x_k ^ a_{i,k}` and `x_j⁻¹ x_i x_j = ∏_{k > j} x_k ^ b_{i,j,k}` for
    `j < i`, the products being taken in increasing order of `k`. For a polycyclic sequence of a
    finite group, with its relative orders, they present the group
    (`PolycyclicSequence.presentationEquiv`). 
Definition8.3.112
uses 0used by 1✓L∃∀N

Primary decomposition of abelian group. (LMFDB)

Every finite abelian group G is isomorphic to a direct product of cyclic groups of prime power order, and this decomposition is unique up to reordering. It is referred to as the primary decomposition of G.

Lean code for Definition8.3.112●5 declarations
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/PrimaryDecomposition.lean
    complete
    theorem AddCommGroup.exists_addEquiv_pi_zmod_isPrimePow.{u_3} (G : Type u_3)
      [AddCommGroup G] [Finite G] :
      ∃ ι x q,
        (∀ (i : ι), IsPrimePow (q i)) ∧
          Nonempty (G ≃+ ((i : ι) → ZMod (q i)))
    theorem AddCommGroup.exists_addEquiv_pi_zmod_isPrimePow.{u_3}
      (G : Type u_3) [AddCommGroup G]
      [Finite G] :
      ∃ ι x q,
        (∀ (i : ι), IsPrimePow (q i)) ∧
          Nonempty
            (G ≃+ ((i : ι) → ZMod (q i)))
    **Existence of the primary decomposition**: a finite abelian group is isomorphic to a finite
    product of cyclic groups of prime-power order. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/PrimaryDecomposition.lean
    complete
    theorem AddCommGroup.exists_equiv_of_addEquiv_pi_zmod.{u_1, u_2, u_3}
      {ι : Type u_1} {κ : Type u_2} [Fintype ι] [Fintype κ] {q : ι → ℕ}
      {q' : κ → ℕ} {G : Type u_3} [AddCommGroup G]
      (hq : ∀ (i : ι), IsPrimePow (q i))
      (hq' : ∀ (j : κ), IsPrimePow (q' j)) (e : G ≃+ ((i : ι) → ZMod (q i)))
      (e' : G ≃+ ((j : κ) → ZMod (q' j))) : ∃ σ, ∀ (i : ι), q' (σ i) = q i
    theorem AddCommGroup.exists_equiv_of_addEquiv_pi_zmod.{u_1,
        u_2, u_3}
      {ι : Type u_1} {κ : Type u_2}
      [Fintype ι] [Fintype κ] {q : ι → ℕ}
      {q' : κ → ℕ} {G : Type u_3}
      [AddCommGroup G]
      (hq : ∀ (i : ι), IsPrimePow (q i))
      (hq' : ∀ (j : κ), IsPrimePow (q' j))
      (e : G ≃+ ((i : ι) → ZMod (q i)))
      (e' : G ≃+ ((j : κ) → ZMod (q' j))) :
      ∃ σ, ∀ (i : ι), q' (σ i) = q i
    **Uniqueness of the primary decomposition**: two decompositions of an abelian group as finite
    products of cyclic groups of prime-power order have the same factors up to reordering. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    def AddCommGroup.primaryAbelianInvariants.{u_1} (G : Type u_1)
      [AddCommGroup G] [Finite G] : List ℕ
    def AddCommGroup.primaryAbelianInvariants.{u_1}
      (G : Type u_1) [AddCommGroup G]
      [Finite G] : List ℕ
    The **primary abelian invariants** of a finite abelian group `A` (LMFDB
    `group.abelian_invariants`), or its elementary divisors: the unique list `[q₁, …, qₖ]` of prime
    powers `qᵢ = pᵢ ^ eᵢ`, sorted first by `pᵢ` and then increasingly for a fixed `pᵢ`, such that
    `A ≃ C_{q₁} × ⋯ × C_{qₖ}` (`AddCommGroup.primaryAbelianInvariants_eq_iff`). This is the primary
    decomposition of `A` (LMFDB `group.primary_decomposition`) written in the LMFDB order. Here `C_q`
    is `ZMod q`, the prime `pᵢ` is `Nat.minFac qᵢ`, and the invariants of a multiplicative group `G`
    are those of `Additive G` (`CommGroup.primaryAbelianInvariants_additive_eq_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/FiniteAbelian/AbelianInvariants.lean
    complete
    theorem AddCommGroup.primaryAbelianInvariants_eq_iff.{u_1} {G : Type u_1}
      [AddCommGroup G] {L : List ℕ} [Finite G] :
      AddCommGroup.primaryAbelianInvariants G = L ↔
        (∀ q ∈ L, IsPrimePow q) ∧
          List.Pairwise
              (fun a b => toLex (a.minFac, a) ≤ toLex (b.minFac, b)) L ∧
            Nonempty (G ≃+ ((i : Fin L.length) → ZMod L[i]))
    theorem AddCommGroup.primaryAbelianInvariants_eq_iff.{u_1}
      {G : Type u_1} [AddCommGroup G]
      {L : List ℕ} [Finite G] :
      AddCommGroup.primaryAbelianInvariants
            G =
          L ↔
        (∀ q ∈ L, IsPrimePow q) ∧
          List.Pairwise
              (fun a b =>
                toLex (a.minFac, a) ≤
                  toLex (b.minFac, b))
              L ∧
            Nonempty
              (G ≃+
                ((i : Fin L.length) →
                  ZMod L[i]))
    **The primary abelian invariants are the unique list of prime powers, sorted first by the prime
    and then by size, such that `A` is the product of the corresponding cyclic groups.** 
  • theoremdefined in Mathlib/GroupTheory/FiniteAbelian/Basic.lean
    complete
    theorem AddCommGroup.equiv_directSum_zmod_of_finite.{u} (G : Type u)
      [AddCommGroup G] [Finite G] :
      ∃ ι x p,
        ∃ (_ : ∀ (i : ι), Nat.Prime (p i)),
          ∃ e, Nonempty (G ≃+ DirectSum ι fun i => ZMod (p i ^ e i))
    theorem AddCommGroup.equiv_directSum_zmod_of_finite.{u}
      (G : Type u) [AddCommGroup G]
      [Finite G] :
      ∃ ι x p,
        ∃ (_ : ∀ (i : ι), Nat.Prime (p i)),
          ∃ e,
            Nonempty
              (G ≃+
                DirectSum ι fun i =>
                  ZMod (p i ^ e i))
    **Structure theorem of finite abelian groups** : Any finite abelian group is a direct sum of
    some `ZMod (p i ^ e i)` for some prime powers `p i ^ e i`. 
Definition8.3.113
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Proper subgroup. (LMFDB)

A subgroup of a group G is proper if it is not equal to G.

Tau Ceti Review: Subgroup.

Depends on: Definition 8.3.3 Definition 8.3.160

Lean code for Definition8.3.113●1 definition
  • structure(extends 2, 4 fields)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    structure Subgroup.{u_3} (G : Type u_3) [Group G] : Type u_3
    structure Subgroup.{u_3} (G : Type u_3) [Group G] :
      Type u_3
    A subgroup of a group `G` is a subset containing 1, closed under multiplication
    and closed under multiplicative inverse. 
    
    [Wikidata Q466109](https://www.wikidata.org/wiki/Q466109)
    • Submonoid G
    carrier : Set G
    Inherited from
    1. Submonoid
    2. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Submonoid
    2. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ self.carrier → x⁻¹ ∈ self.carrier
    `G` is closed under inverses 
Definition8.3.114
Statement uses 18
Statement dependency previews
Preview
Definition 8.3.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Interdependencies of group properties. (LMFDB)

Certain properties of groups automatically imply other properties. We briefly explain the connections here.

A cyclic group is always abelian by the way the group operation for cyclic groups is defined. Cyclic groups are also automatically Z-groups since all their subgroups (including their Sylow subgroups) are cyclic.

Since cyclic groups are always abelian, Z-groups are by definition A-groups, and similarly metacyclic groups are metabelian as well.

An abelian group is always nilpotent since the group is its own center and thus an upper central series for the group exists. In addition, abelian groups are A-groups since all their subgroups (including their Sylow subgroups) are abelian.

Nilpotent groups that are also finite (as is the case for groups in this database) are supersolvable because the upper central series defining a nilpotent group has abelian subquotients which, in the case of finite groups, may be expanded to a chain with cyclic factors.

Supersolvable groups are monomial (see Corollary 3.5 in Chapter 2 of ).

Monomial groups are also solvable by a result of Taketa .

Since the definition of a metabelian group ensures the existence of a normal subgroup N \lhd G so that G/N is abelian, metabelian groups also satisfy the definition of solvable via the chain of subgroups \langle e\rangle \leq N \leq G.

If all the Sylow subgroups are cyclic, then the group is metacyclic. Hence Z-groups are metacyclic (see Theorem 9.4.3 in ).

Nonabelian simple groups are always perfect groups since the commutator subgroup of a group is a normal subgroup and hence must be the whole group in this case. In addition, nonabelian simple groups are also almost simple and quasi-simple.

Depends on: Definition 8.3.4 Definition 8.3.5 Definition 8.3.13 Definition 8.3.20 Definition 8.3.28 Definition 8.3.37 Definition 8.3.82 Definition 8.3.83 Definition 8.3.91 Definition 8.3.93 Definition 8.3.105 Definition 8.3.117 Definition 8.3.139 Definition 8.3.149 Definition 8.3.167 Definition 8.3.174 Definition 8.3.185 Definition 8.3.189

Lean code for Definition8.3.114●8 theorems
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AGroup.lean
    complete
    theorem IsZGroup.isAGroup.{u_1} {G : Type u_1} [Group G] [IsZGroup G] :
      IsAGroup G
    theorem IsZGroup.isAGroup.{u_1} {G : Type u_1}
      [Group G] [IsZGroup G] : IsAGroup G
    Every Z-group is an A-group, since cyclic groups are abelian. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetabelianExamples.lean
    complete
    theorem IsMetacyclic.isMetabelian.{u_1} {G : Type u_1} [Group G]
      [h : IsMetacyclic G] : IsMetabelian G
    theorem IsMetacyclic.isMetabelian.{u_1}
      {G : Type u_1} [Group G]
      [h : IsMetacyclic G] : IsMetabelian G
    **Metacyclic groups are metabelian** (LMFDB `group.metabelian`): a cyclic normal subgroup with
    cyclic quotient is an abelian normal subgroup with abelian quotient. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/NilpotentSupersolvable.lean
    complete
    theorem Group.IsNilpotent.isSupersolvable.{u_1} {G : Type u_1} [Group G]
      [Finite G] [Group.IsNilpotent G] : Group.IsSupersolvable G
    theorem Group.IsNilpotent.isSupersolvable.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      [Group.IsNilpotent G] :
      Group.IsSupersolvable G
    **A finite nilpotent group is supersolvable** (LMFDB `group.nilpotent`): it has a normal series
    `⊥ = N₀ ≤ N₁ ≤ ⋯ ≤ Nₖ = ⊤` with cyclic factors and all terms normal in `G`, obtained by adjoining
    at each step an element whose image in `G ⧸ Nᵢ` is a nontrivial central element. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsMGroup.of_isSupersolvable {G : Type} [Group G] [Finite G]
      (hG : Group.IsSupersolvable G) : IsMGroup G
    theorem IsMGroup.of_isSupersolvable {G : Type}
      [Group G] [Finite G]
      (hG : Group.IsSupersolvable G) :
      IsMGroup G
    **Huppert's theorem: finite supersolvable groups are M-groups** (LMFDB `group.monomial`,
    `group.supersolvable`). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSolvable.lean
    complete
    theorem IsMGroup.isSolvable {G : Type} [Group G] [Finite G] [IsMGroup G] :
      Group.IsSolvable G
    theorem IsMGroup.isSolvable {G : Type} [Group G]
      [Finite G] [IsMGroup G] :
      Group.IsSolvable G
    **Taketa's theorem: M-groups are solvable** (LMFDB `group.monomial`). If every irreducible
    complex representation of the finite group `G` is induced from a one-dimensional representation
    of a subgroup, then `G` is solvable: its `n`-th derived subgroup acts trivially on the irreducible
    representations of degree at most `n`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1} [Group G] [Finite G]
      [IsZGroup G] : IsMetacyclic G
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1}
      [Group G] [Finite G] [IsZGroup G] :
      IsMetacyclic G
    **Finite Z-groups are metacyclic** (LMFDB `group.metacyclic`): the commutator subgroup and the
    abelianization of a finite Z-group are cyclic. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/AlmostSimple.lean
    complete
    theorem IsSimpleGroup.isAlmostSimple.{u} {G : Type u} [Group G]
      [IsSimpleGroup G] (hG : ¬IsMulCommutative G) : IsAlmostSimple G
    theorem IsSimpleGroup.isAlmostSimple.{u}
      {G : Type u} [Group G] [IsSimpleGroup G]
      (hG : ¬IsMulCommutative G) :
      IsAlmostSimple G
    Every non-abelian simple group is almost simple, through its inner automorphisms. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Quasisimple.lean
    complete
    theorem IsSimpleGroup.isQuasisimple.{u_1} {G : Type u_1} [Group G]
      [IsSimpleGroup G] (hG : ¬IsMulCommutative G) : IsQuasisimple G
    theorem IsSimpleGroup.isQuasisimple.{u_1}
      {G : Type u_1} [Group G]
      [IsSimpleGroup G]
      (hG : ¬IsMulCommutative G) :
      IsQuasisimple G
    **Non-abelian simple groups are quasisimple** (LMFDB `group.quasisimple`). 
Definition8.3.115
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.32
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Generating deterministic sequences of pseudo-random group elements. (LMFDB)

In order to generate labels for divisions and conjugacy classes, we use a method for picking pseudo-random group elements.

We use an exponential pseudo-random number generator given by a_j = a_0\, b^j \bmod p where

\begin{aligned} a_0 &= 123 \\ b&=25096281518912105342191851917838718629 \\ p &= 340282366920938463463374607431768211297. \end{aligned}

(Here p is the largest prime less than 2^{128}.)

To produce a pseudo-random sequence of group elements we follow a standard method. Starting with k generators, g_1, \ldots, g_k we initialize the process by forming the (k+5)-tuple v with v_i=g_i (taking subscripts modulo k). We then have 20 rounds of picking distinct indices i and j and replace v_i with v_i\cdot v_j. After this initialization step, we generate the sequence by again picking random subscripts i and j according to our pseudo-random sequence of integers, replacing v_i with v_i\cdot v_j and returning the new v_i.

Depends on: Definition 8.3.32 Definition 8.3.42

Lean code for Definition8.3.115●2 theorems
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/LargestPrimeBelowTwoPow128.lean
    complete
    theorem Nat.isGreatest_prime_lt_two_pow_128 :
      IsGreatest {q | Nat.Prime q ∧ q < 2 ^ 128}
        340282366920938463463374607431768211297
    theorem Nat.isGreatest_prime_lt_two_pow_128 :
      IsGreatest
        {q | Nat.Prime q ∧ q < 2 ^ 128}
        340282366920938463463374607431768211297
    **`2 ^ 128 - 159` is the largest prime below `2 ^ 128`** (LMFDB
    `group.pseudo_random_elements`): it is prime, and each of the `158` numbers `n` between it and
    `2 ^ 128` is composite, as `2 ^ (n - 1) ≠ 1` modulo `n`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/LargestPrimeBelowTwoPow128.lean
    complete
    theorem Nat.prime_two_pow_128_sub_159 :
      Nat.Prime 340282366920938463463374607431768211297
    theorem Nat.prime_two_pow_128_sub_159 :
      Nat.Prime
        340282366920938463463374607431768211297
    **`2 ^ 128 - 159` is prime** (LMFDB `group.pseudo_random_elements`), by Lucas's test with the
    witness `5`. 
Definition8.3.116
uses 0used by 0✓L∃∀N

The projective special linear group \text{PSL}_2(\mathbb{R}) is defined as the quotient \text{PSL}_2(\mathbb{R})=\text{SL}_2(\mathbb{R})/\{\pm I\}.

Tau Ceti Review: Matrix.ProjectiveSpecialLinearGroup, Matrix.SpecialLinearGroup.mem_center_iff.

Lean code for Definition8.3.116●2 declarations
  • abbrevdefined in Mathlib/LinearAlgebra/Matrix/ProjectiveSpecialLinearGroup.lean
    complete
    abbrev Matrix.ProjectiveSpecialLinearGroup.{u, v} (n : Type u) [DecidableEq n]
      [Fintype n] (R : Type v) [CommRing R] : Type (max (max u v) v u)
    abbrev Matrix.ProjectiveSpecialLinearGroup.{u, v}
      (n : Type u) [DecidableEq n] [Fintype n]
      (R : Type v) [CommRing R] :
      Type (max (max u v) v u)
    A projective special linear group is the quotient of a special linear group by its center. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    theorem Matrix.SpecialLinearGroup.mem_center_iff.{u, v} {n : Type u}
      [DecidableEq n] [Fintype n] {R : Type v} [CommRing R]
      {A : Matrix.SpecialLinearGroup n R} :
      A ∈ Subgroup.center (Matrix.SpecialLinearGroup n R) ↔
        ∃ r, r ^ Fintype.card n = 1 ∧ (Matrix.scalar n) r = ↑A
    theorem Matrix.SpecialLinearGroup.mem_center_iff.{u,
        v}
      {n : Type u} [DecidableEq n] [Fintype n]
      {R : Type v} [CommRing R]
      {A : Matrix.SpecialLinearGroup n R} :
      A ∈
          Subgroup.center
            (Matrix.SpecialLinearGroup n R) ↔
        ∃ r,
          r ^ Fintype.card n = 1 ∧
            (Matrix.scalar n) r = ↑A
    The center of a special linear group of degree `n` is the subgroup of scalar matrices, for which
    the scalars are the `n`-th roots of unity. 
Definition8.3.117
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Quasisimple group. (LMFDB)

A quasisimple group is a perfect group that is a central extension of a simple group.

Every nonabelian simple group is quasisimple, but it is not implied by G being almost simple, as shown by these examples.

Tau Ceti Review: Group.IsPerfect, IsSimpleGroup.

Depends on: Definition 8.3.5 Definition 8.3.13 Definition 8.3.105 Definition 8.3.139

Lean code for Definition8.3.117●9 declarations
  • class(2 methods)defined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Quasisimple.lean
    complete
    class IsQuasisimple.{u_1} (G : Type u_1) [Group G] : Prop
    class IsQuasisimple.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group `G` is **quasisimple** (LMFDB `group.quasisimple`) if it is perfect and a central
    extension of a simple group: the quotient `G ⧸ A` by some subgroup `A` of the centre of `G` is
    simple. 
    isPerfect : Group.IsPerfect G
    A quasisimple group is perfect. 
    exists_le_center : ∃ A, ∃ (x : A.Normal), A ≤ Subgroup.center G ∧ IsSimpleGroup (G ⧸ A)
    A quasisimple group is a central extension of a simple group. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Quasisimple.lean
    complete
    theorem isQuasisimple_iff_isSimpleGroup_quotient_center.{u_1} {G : Type u_1}
      [Group G] :
      IsQuasisimple G ↔
        Group.IsPerfect G ∧ IsSimpleGroup (G ⧸ Subgroup.center G)
    theorem isQuasisimple_iff_isSimpleGroup_quotient_center.{u_1}
      {G : Type u_1} [Group G] :
      IsQuasisimple G ↔
        Group.IsPerfect G ∧
          IsSimpleGroup
            (G ⧸ Subgroup.center G)
    **A group is quasisimple if and only if it is perfect and its quotient by its centre is
    simple** (LMFDB `group.quasisimple`): the central subgroup with simple quotient is the centre. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Quasisimple.lean
    complete
    theorem IsSimpleGroup.isQuasisimple.{u_1} {G : Type u_1} [Group G]
      [IsSimpleGroup G] (hG : ¬IsMulCommutative G) : IsQuasisimple G
    theorem IsSimpleGroup.isQuasisimple.{u_1}
      {G : Type u_1} [Group G]
      [IsSimpleGroup G]
      (hG : ¬IsMulCommutative G) :
      IsQuasisimple G
    **Non-abelian simple groups are quasisimple** (LMFDB `group.quasisimple`). 
  • class(1 method)defined in Mathlib/GroupTheory/IsPerfect.lean
    complete
    class Group.IsPerfect.{u_1} (G : Type u_1) [Group G] : Prop
    class Group.IsPerfect.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group `G` is perfect if `G` equals its commutator subgroup `⁅G, G⁆`. 
    commutator_eq_top : commutator G = ⊤
    The commutator of the group `G` with itself is the whole group `G`. 
  • class(extends 1, 2 methods)defined in Mathlib/GroupTheory/Subgroup/Simple.lean
    complete
    class IsSimpleGroup.{u_1} (G : Type u_1) [Group G] : Prop
    class IsSimpleGroup.{u_1} (G : Type u_1)
      [Group G] : Prop
    A `Group` is simple when it has exactly two normal `Subgroup`s. 
    • Nontrivial G
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
    eq_bot_or_eq_top_of_normal : ∀ (H : Subgroup G) [H.Normal], H = ⊥ ∨ H = ⊤
    Any normal subgroup is either `⊥` or `⊤` 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Equiv.Perm.isAlmostSimple_fin_five : IsAlmostSimple (Equiv.Perm (Fin 5))
    theorem Equiv.Perm.isAlmostSimple_fin_five :
      IsAlmostSimple (Equiv.Perm (Fin 5))
    **`S_5` is almost simple** (LMFDB `group.quasisimple`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Equiv.Perm.not_isQuasisimple_fin_five :
      ¬IsQuasisimple (Equiv.Perm (Fin 5))
    theorem Equiv.Perm.not_isQuasisimple_fin_five :
      ¬IsQuasisimple (Equiv.Perm (Fin 5))
    **`S_5` is not quasisimple** (LMFDB `group.quasisimple`): almost simple groups need not be
    quasisimple. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Matrix.SpecialLinearGroup.isQuasisimple_two_zmod_five :
      IsQuasisimple (Matrix.SpecialLinearGroup (Fin 2) (ZMod 5))
    theorem Matrix.SpecialLinearGroup.isQuasisimple_two_zmod_five :
      IsQuasisimple
        (Matrix.SpecialLinearGroup (Fin 2)
          (ZMod 5))
    **`SL(2, 5)` is quasisimple** (LMFDB `group.quasisimple`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Matrix.SpecialLinearGroup.not_isAlmostSimple_two_zmod_five :
      ¬IsAlmostSimple (Matrix.SpecialLinearGroup (Fin 2) (ZMod 5))
    theorem Matrix.SpecialLinearGroup.not_isAlmostSimple_two_zmod_five :
      ¬IsAlmostSimple
          (Matrix.SpecialLinearGroup (Fin 2)
            (ZMod 5))
    **`SL(2, 5)` is not almost simple** (LMFDB `group.quasisimple`): quasisimple groups need not
    be almost simple. 
Definition8.3.118
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 10
Reverse dependency previews
Preview
Definition 8.3.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Quotient group. (LMFDB)

If G is a group and N is a normal subgroup of G, then the operation on the set of left cosets of N

(aN)*(bN) = (ab)N

is well-defined. The result is a group, called a quotient group of G by N.

Tau Ceti Review: QuotientGroup.Quotient.group, QuotientGroup.mk'.

Depends on: Definition 8.3.3 Definition 8.3.35 Definition 8.3.167

Lean code for Definition8.3.118●2 definitions
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Defs.lean
    complete
    def QuotientGroup.Quotient.group.{u_1} {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] : Group (G ⧸ N)
    def QuotientGroup.Quotient.group.{u_1}
      {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] :
      Group (G ⧸ N)
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Defs.lean
    complete
    def QuotientGroup.mk'.{u_1} {G : Type u_1} [Group G] (N : Subgroup G)
      [nN : N.Normal] : G →* G ⧸ N
    def QuotientGroup.mk'.{u_1} {G : Type u_1}
      [Group G] (N : Subgroup G)
      [nN : N.Normal] : G →* G ⧸ N
    The group homomorphism from `G` to `G/N`. 
Definition8.3.119
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.35
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Size of a quotient. (LMFDB)

The size of the quotient of a finite group by a subgroup is the number of corresponding cosets. When the subgroup is normal, this number is the order of the quotient group.

Tau Ceti Review: Subgroup.index, Subgroup.index_eq_card, QuotientGroup.Quotient.group.

Depends on: Definition 8.3.35 Definition 8.3.118

Lean code for Definition8.3.119●3 declarations
  • defdefined in Mathlib/GroupTheory/Index.lean
    complete
    def Subgroup.index.{u_1} {G : Type u_1} [Group G] (H : Subgroup G) : ℕ
    def Subgroup.index.{u_1} {G : Type u_1}
      [Group G] (H : Subgroup G) : ℕ
    The index of a subgroup as a natural number. Returns `0` if the index is infinite. 
    
    [Wikidata Q1464168](https://www.wikidata.org/wiki/Q1464168)
  • theoremdefined in Mathlib/GroupTheory/Index.lean
    complete
    theorem Subgroup.index_eq_card.{u_1} {G : Type u_1} [Group G] (H : Subgroup G) :
      H.index = Nat.card (G ⧸ H)
    theorem Subgroup.index_eq_card.{u_1}
      {G : Type u_1} [Group G]
      (H : Subgroup G) :
      H.index = Nat.card (G ⧸ H)
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Defs.lean
    complete
    def QuotientGroup.Quotient.group.{u_1} {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] : Group (G ⧸ N)
    def QuotientGroup.Quotient.group.{u_1}
      {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] :
      Group (G ⧸ N)
Definition8.3.120
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Radical of a group. (LMFDB)

If G is a group, then the radical of G is the largest normal subgroup of G which is solvable. It is the subgroup generated by all normal subgroups which are solvable.

Depends on: Definition 8.3.3 Definition 8.3.149 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.120●4 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SolvableRadical.lean
    complete
    def Subgroup.solvableRadical.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.solvableRadical.{u_1}
      (G : Type u_1) [Group G] : Subgroup G
    The **radical** (LMFDB `group.radical`), or solvable radical, of a group `G`: the subgroup
    generated by all normal solvable subgroups of `G`. For a finite group it is the largest normal
    solvable subgroup (`Subgroup.isSolvable_solvableRadical`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableRadical.lean
    complete
    theorem Subgroup.isSolvable_solvableRadical.{u_1} (G : Type u_1) [Group G]
      [Finite G] : Group.IsSolvable ↥(Subgroup.solvableRadical G)
    theorem Subgroup.isSolvable_solvableRadical.{u_1}
      (G : Type u_1) [Group G] [Finite G] :
      Group.IsSolvable
        ↥(Subgroup.solvableRadical G)
    **The radical of a finite group is solvable**, hence it is the largest normal solvable
    subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableRadical.lean
    complete
    theorem Subgroup.le_solvableRadical.{u_1} {G : Type u_1} [Group G]
      {N : Subgroup G} [N.Normal] [Group.IsSolvable ↥N] :
      N ≤ Subgroup.solvableRadical G
    theorem Subgroup.le_solvableRadical.{u_1}
      {G : Type u_1} [Group G]
      {N : Subgroup G} [N.Normal]
      [Group.IsSolvable ↥N] :
      N ≤ Subgroup.solvableRadical G
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableRadical.lean
    complete
    theorem Subgroup.isSolvable_sup.{u_1} {G : Type u_1} [Group G]
      (N M : Subgroup G) [N.Normal] [Group.IsSolvable ↥N]
      [Group.IsSolvable ↥M] : Group.IsSolvable ↥(N ⊔ M)
    theorem Subgroup.isSolvable_sup.{u_1}
      {G : Type u_1} [Group G]
      (N M : Subgroup G) [N.Normal]
      [Group.IsSolvable ↥N]
      [Group.IsSolvable ↥M] :
      Group.IsSolvable ↥(N ⊔ M)
    **The join of a normal solvable subgroup and a solvable subgroup is solvable.** 
Definition8.3.121
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.1.92
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Rank. (LMFDB)

The rank of a finite group G is the minimal number of elements required to generate it, which is often smaller than the number of generators in a polycyclic presentation. For p-groups, the rank can be computed by taking the \mathbb{F}_p-dimension of the quotient by the Frattini subgroup.

Tau Ceti Review: Group.rank, Group.rank_spec, Group.rank_le, frattini.

Depends on: Definition 8.3.3 Definition 8.3.49 Definition 8.3.60 Definition 8.3.111

Lean code for Definition8.3.121●8 declarations
  • defdefined in Mathlib/GroupTheory/Rank.lean
    complete
    def Group.rank.{u_1} (G : Type u_1) [Group G] [h : Group.FG G] : ℕ
    def Group.rank.{u_1} (G : Type u_1) [Group G]
      [h : Group.FG G] : ℕ
    The minimum number of generators of a group. 
  • theoremdefined in Mathlib/GroupTheory/Rank.lean
    complete
    theorem Group.rank_spec.{u_1} (G : Type u_1) [Group G] [h : Group.FG G] :
      ∃ S, S.card = Group.rank G ∧ Subgroup.closure ↑S = ⊤
    theorem Group.rank_spec.{u_1} (G : Type u_1)
      [Group G] [h : Group.FG G] :
      ∃ S,
        S.card = Group.rank G ∧
          Subgroup.closure ↑S = ⊤
  • theoremdefined in Mathlib/GroupTheory/Rank.lean
    complete
    theorem Group.rank_le.{u_1} {G : Type u_1} [Group G] [h : Group.FG G]
      {S : Finset G} (hS : Subgroup.closure ↑S = ⊤) : Group.rank G ≤ S.card
    theorem Group.rank_le.{u_1} {G : Type u_1}
      [Group G] [h : Group.FG G]
      {S : Finset G}
      (hS : Subgroup.closure ↑S = ⊤) :
      Group.rank G ≤ S.card
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RankFrattini.lean
    complete
    theorem PolycyclicSequence.rank_le_length.{u_1} {G : Type u_1} [Group G]
      (s : PolycyclicSequence G) [Group.FG G] : Group.rank G ≤ s.length
    theorem PolycyclicSequence.rank_le_length.{u_1}
      {G : Type u_1} [Group G]
      (s : PolycyclicSequence G)
      [Group.FG G] : Group.rank G ≤ s.length
    **The rank is at most the number of generators of a polycyclic presentation** (LMFDB
    `group.rank`): the terms of a polycyclic sequence generate the group. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RankFrattini.lean
    complete
    theorem PolycyclicSequence.rank_lt_length_perm_fin_four
      (s : PolycyclicSequence (Equiv.Perm (Fin 4))) :
      Group.rank (Equiv.Perm (Fin 4)) < s.length
    theorem PolycyclicSequence.rank_lt_length_perm_fin_four
      (s :
        PolycyclicSequence
          (Equiv.Perm (Fin 4))) :
      Group.rank (Equiv.Perm (Fin 4)) <
        s.length
    **The rank can be smaller than the number of generators of every polycyclic presentation**
    (LMFDB `group.rank`): `S₄` is generated by a `4`-cycle and a transposition, while a polycyclic
    sequence of length `n` gives `G⁽ⁿ⁾ = 1` and the second derived subgroup of `S₄` is not trivial. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/RankFrattini.lean
    complete
    abbrev IsPGroup.frattiniQuotientModule.{u_1} {G : Type u_1} [Group G] {p : ℕ}
      [Fact (Nat.Prime p)] [Finite G] (hG : IsPGroup p G) :
      Module (ZMod p) (Additive (G ⧸ frattini G))
    abbrev IsPGroup.frattiniQuotientModule.{u_1}
      {G : Type u_1} [Group G] {p : ℕ}
      [Fact (Nat.Prime p)] [Finite G]
      (hG : IsPGroup p G) :
      Module (ZMod p)
        (Additive (G ⧸ frattini G))
    The **`𝔽_p`-vector space** `G ⧸ Φ(G)` of a finite `p`-group `G` (LMFDB `group.rank`), written
    additively: the Frattini quotient is abelian and killed by `p`, an elementary abelian `p`-group. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RankFrattini.lean
    complete
    theorem IsPGroup.rank_eq_finrank_quotient_frattini.{u_1} {G : Type u_1}
      [Group G] {p : ℕ} [Fact (Nat.Prime p)] [Finite G]
      (hG : IsPGroup p G) :
      Group.rank G = Module.finrank (ZMod p) (Additive (G ⧸ frattini G))
    theorem IsPGroup.rank_eq_finrank_quotient_frattini.{u_1}
      {G : Type u_1} [Group G] {p : ℕ}
      [Fact (Nat.Prime p)] [Finite G]
      (hG : IsPGroup p G) :
      Group.rank G =
        Module.finrank (ZMod p)
          (Additive (G ⧸ frattini G))
    **Burnside's basis theorem** (LMFDB `group.rank`): the rank of a finite `p`-group `G`, the least
    number of elements generating it, is the dimension over `𝔽_p` of its Frattini quotient
    `G ⧸ Φ(G)`. 
  • defdefined in Mathlib/GroupTheory/Frattini.lean
    complete
    def frattini.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def frattini.{u_1} (G : Type u_1) [Group G] :
      Subgroup G
    The Frattini subgroup of a group is the intersection of the maximal subgroups. 
Definition8.3.122
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Rational character table of a group. (LMFDB)

The rational character table of a finite group G is a square tabulation of the values of irreducible rational characters on the rational conjugacy classes of G.

The row corresponding to each rational character is marked by its label and the columns by the labels of the corresponding rational conjugacy class.

Depends on: Definition 8.3.3 Definition 8.3.42 Definition 8.3.73 Definition 8.3.74 Definition 8.3.133

Lean code for Definition8.3.122●5 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterTable.lean
    complete
    def FDRep.rationalCharacterTable (G : Type) [Group G] :
      ↑(FDRep.irreducibleRationalCharacters G) → RatConjClasses G → ℂ
    def FDRep.rationalCharacterTable (G : Type)
      [Group G] :
      ↑(FDRep.irreducibleRationalCharacters
            G) →
        RatConjClasses G → ℂ
    The **rational character table** of `G` (LMFDB `group.rational_character_table`): the value
    of each irreducible rational character on each rational conjugacy class, evaluated at a chosen
    representative of the class. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterTable.lean
    complete
    def FDRep.irreducibleRationalCharacters (G : Type) [Group G] : Set (G → ℂ)
    def FDRep.irreducibleRationalCharacters
      (G : Type) [Group G] : Set (G → ℂ)
    The **irreducible rational characters** of `G`: the rational characters `∑ σ ∘ χ` attached to
    the irreducible complex representations of `G`, without repetition. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    def RatConjClasses.{u_1} (G : Type u_1) [Group G] : Type u_1
    def RatConjClasses.{u_1} (G : Type u_1)
      [Group G] : Type u_1
    The **divisions** or **rational conjugacy classes** (LMFDB `group.division`) of `G`, the
    equivalence classes of rational conjugacy. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    theorem FDRep.rationalCharacterTable_mk {G : Type} [Group G] [Finite G]
      (ψ : ↑(FDRep.irreducibleRationalCharacters G)) (g : G) :
      FDRep.rationalCharacterTable G ψ (RatConjClasses.mk g) = ↑ψ g
    theorem FDRep.rationalCharacterTable_mk {G : Type}
      [Group G] [Finite G]
      (ψ :
        ↑(FDRep.irreducibleRationalCharacters
            G))
      (g : G) :
      FDRep.rationalCharacterTable G ψ
          (RatConjClasses.mk g) =
        ↑ψ g
    **The entries of the rational character table do not depend on the representatives of the
    rational classes** (LMFDB `group.rational_character_table`): the entry of `ψ` at the rational class
    of `g` is `ψ(g)`, irreducible rational characters being rational characters. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    theorem FDRep.card_irreducibleRationalCharacters (G : Type) [Group G]
      [Finite G] :
      Nat.card ↑(FDRep.irreducibleRationalCharacters G) =
        Nat.card (RatConjClasses G)
    theorem FDRep.card_irreducibleRationalCharacters
      (G : Type) [Group G] [Finite G] :
      Nat.card
          ↑(FDRep.irreducibleRationalCharacters
              G) =
        Nat.card (RatConjClasses G)
    **The rational character table is square** (LMFDB `group.rational_character_table`): there
    are as many irreducible rational characters as rational conjugacy classes. Their `ℚ`-span is the
    space of rational valued functions constant on the rational classes, whose dimension is the number
    of rational classes. 
Definition8.3.123
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.37
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Rational group. (LMFDB)

A group G is rational if all of its characters are rational valued. (Equivalently every g and g^k are conjugate for k coprime to |G|.) It is an unsolved problem to determine what cyclic groups of order p can be composition factors of rational groups.

Rational groups are sometimes also known as Q-groups, though some authors reserve that term for a stronger property that every representation of G can be realized over \mathbb{Q}. (According to this terminology, Q_8 is rational but not a Q-group.)

Depends on: Definition 8.3.37 Definition 8.3.125

Lean code for Definition8.3.123●6 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacter.lean
    complete
    def Group.IsRational (G : Type) [Group G] : Prop
    def Group.IsRational (G : Type) [Group G] :
      Prop
    A group `G` is **rational** (LMFDB `group.rational_group`) if all of its complex characters
    are rational valued. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    theorem Group.isRational_iff_forall_isConj_pow {G : Type} [Group G] [Finite G] :
      Group.IsRational G ↔
        ∀ (g : G) (k : ℕ), k.Coprime (Nat.card G) → IsConj g (g ^ k)
    theorem Group.isRational_iff_forall_isConj_pow
      {G : Type} [Group G] [Finite G] :
      Group.IsRational G ↔
        ∀ (g : G) (k : ℕ),
          k.Coprime (Nat.card G) →
            IsConj g (g ^ k)
    **A finite group is rational exactly when every `g` is conjugate to `gᵏ` for every `k` prime to
    `|G|`** (LMFDB `group.rational_group`). An automorphism `σ` of `ℂ` raises the `|G|`-th roots of
    unity to a power `j` prime to `|G|`, so it sends `χ(g)` to `χ(gʲ)`, which is `χ(g)` when `g` and
    `gʲ` are conjugate; an algebraic number fixed by every automorphism of `ℂ` is rational. Conversely a
    rational character satisfies `χ(gᵏ) = χ(g)`, and the irreducible characters separate the conjugacy
    classes. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    def Group.IsQGroup (G : Type) [Group G] : Prop
    def Group.IsQGroup (G : Type) [Group G] : Prop
    A group `G` is a **ℚ-group** in the strong sense (LMFDB `group.rational_group`), the term some
    authors reserve for a property stronger than rationality: every complex representation `V` of `G`
    is realized over `ℚ`, that is `V ≅ ℂ ⊗_ℚ W` for a representation `W` of `G` over `ℚ`, here the
    bottom subfield `ℚ` of `ℂ` (LeanBridge's `FDRep.IsRealizedOver`). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    theorem Group.IsQGroup.isRational {G : Type} [Group G] (h : Group.IsQGroup G) :
      Group.IsRational G
    theorem Group.IsQGroup.isRational {G : Type}
      [Group G] (h : Group.IsQGroup G) :
      Group.IsRational G
    **A ℚ-group is rational**: the character of `ℂ ⊗_ℚ W` is that of `W`, with values in `ℚ`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    theorem QuaternionGroup.isRational_two : Group.IsRational (QuaternionGroup 2)
    theorem QuaternionGroup.isRational_two :
      Group.IsRational (QuaternionGroup 2)
    **The quaternion group `Q₈` is rational** (LMFDB `group.rational_group`): every element is
    conjugate to its inverse, and `gᵏ` is `g` or `g⁻¹` for odd `k`, the exponent being `4`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    theorem QuaternionGroup.not_isQGroup_two : ¬Group.IsQGroup (QuaternionGroup 2)
    theorem QuaternionGroup.not_isQGroup_two :
      ¬Group.IsQGroup (QuaternionGroup 2)
    **The quaternion group `Q₈` is not a ℚ-group in the strong sense** (LMFDB
    `group.rational_group`), although it is rational (`QuaternionGroup.isRational_two`): its
    two-dimensional complex representation `a 1 ↦ diag(i, -i)`, `xa 0 ↦ !![0, -1; 1, 0]` is not
    realized over `ℚ`. The matrices `A`, `B` over `ℚ` of `a 1` and `xa 0` in a realization would have
    traces `tr A = tr B = tr AB = 0` and `tr A² = tr B² = -2`, which no `2 × 2` matrices over an ordered
    field have. 
Definition8.3.124
uses 1used by 0✓L∃∀N

Center of a character. (LMFDB)

The center of the character \chi of a group G is the subgroup of G given by the set: \{g \in G : |\chi(g)|=\chi(1)\}.

Depends on: Definition 8.3.125

Lean code for Definition8.3.124●3 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterCenter.lean
    complete
    def FDRep.characterCenter.{u_1} {G : Type u_1} [Group G] [Finite G]
      (V : FDRep ℂ G) : Subgroup G
    def FDRep.characterCenter.{u_1} {G : Type u_1}
      [Group G] [Finite G] (V : FDRep ℂ G) :
      Subgroup G
    The **center** of the character `χ` of a complex representation `V` of a finite group `G`
    (LMFDB `group.representation.center`): the subgroup `Z(χ) = {g ∈ G : |χ(g)| = χ(1)}` of the
    elements acting on `V` by a scalar. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterCenter.lean
    complete
    theorem FDRep.mem_characterCenter_iff.{u_1} {G : Type u_1} [Group G] [Finite G]
      (V : FDRep ℂ G) {g : G} :
      g ∈ V.characterCenter ↔ ↑‖V.character g‖ = V.character 1
    theorem FDRep.mem_characterCenter_iff.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      (V : FDRep ℂ G) {g : G} :
      g ∈ V.characterCenter ↔
        ↑‖V.character g‖ = V.character 1
    **Membership in the center of a character**, in the knowl's form `|χ(g)| = χ(1)`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterCenter.lean
    complete
    theorem FDRep.norm_character_eq_finrank_iff.{u_1} {G : Type u_1} [Group G]
      [Finite G] (V : FDRep ℂ G) {g : G} :
      ‖V.character g‖ = ↑(Module.finrank ℂ ↑V.V) ↔
        ∃ μ, ‖μ‖ = 1 ∧ V.ρ g = μ • 1
    theorem FDRep.norm_character_eq_finrank_iff.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      (V : FDRep ℂ G) {g : G} :
      ‖V.character g‖ =
          ↑(Module.finrank ℂ ↑V.V) ↔
        ∃ μ, ‖μ‖ = 1 ∧ V.ρ g = μ • 1
    **`|χ(g)| = χ(1)` exactly when `g` acts by a scalar of absolute value `1`.** 
Definition8.3.125
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 16
Reverse dependency previews
Preview
Definition 4.6.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Character of a group representation. (LMFDB)

If G is a group and \rho:G\to \GL_n(\C) is a representation of G, then the character of \rho is the function \operatorname{Tr}\circ \rho where \operatorname{Tr} is the function which takes the trace of a square matrix. Since \operatorname{Tr}(AB) = \operatorname{Tr}(BA), the character of \rho is well defined on conjugacy classes; the values \rho(g) for g ranging over the conjugacy classees of G and \rho ranging over all irreducible characters of G constitute the character table of G.

Tau Ceti Review: FDRep.character, Representation.character.

Depends on: Definition 8.3.3 Definition 8.3.32 Definition 8.3.130

Lean code for Definition8.3.125●2 definitions
  • defdefined in Mathlib/RepresentationTheory/Character.lean
    complete
    def FDRep.character.{u, v} {k : Type u} [Field k] {G : Type v} [Monoid G]
      (V : FDRep k G) (g : G) : k
    def FDRep.character.{u, v} {k : Type u}
      [Field k] {G : Type v} [Monoid G]
      (V : FDRep k G) (g : G) : k
    The character of a representation `V : FDRep k G` is the function associating to `g : G` the
    trace of the linear map `V.ρ g`. 
  • defdefined in Mathlib/RepresentationTheory/Character.lean
    complete
    def Representation.character.{u_1, u_2, u_3} {G : Type u_1} {k : Type u_2}
      {V : Type u_3} [Monoid G] [Field k] [AddCommGroup V] [Module k V]
      (ρ : Representation k G V) (g : G) : k
    def Representation.character.{u_1, u_2, u_3}
      {G : Type u_1} {k : Type u_2}
      {V : Type u_3} [Monoid G] [Field k]
      [AddCommGroup V] [Module k V]
      (ρ : Representation k G V) (g : G) : k
    The character of a representation `ρ : Representation k G V` is the function associating to
    `g : G` the trace of the linear map `ρ g`. 
Definition8.3.126
uses 1used by 0✓L∃∀N

Degree of a character. (LMFDB)

The degree of a character \chi of a group G is the value given by \chi(1) where 1 is the trivial element of G.

Tau Ceti Review: FDRep.character, FDRep.char_one, TauCeti.characterDegree.

Depends on: Definition 8.3.125

Lean code for Definition8.3.126●3 declarations
  • defdefined in Mathlib/RepresentationTheory/Character.lean
    complete
    def FDRep.character.{u, v} {k : Type u} [Field k] {G : Type v} [Monoid G]
      (V : FDRep k G) (g : G) : k
    def FDRep.character.{u, v} {k : Type u}
      [Field k] {G : Type v} [Monoid G]
      (V : FDRep k G) (g : G) : k
    The character of a representation `V : FDRep k G` is the function associating to `g : G` the
    trace of the linear map `V.ρ g`. 
  • theoremdefined in Mathlib/RepresentationTheory/Character.lean
    complete
    theorem FDRep.char_one.{u, v} {k : Type u} [Field k] {G : Type v} [Monoid G]
      (V : FDRep k G) : V.character 1 = ↑(Module.finrank k ↑V.V)
    theorem FDRep.char_one.{u, v} {k : Type u}
      [Field k] {G : Type v} [Monoid G]
      (V : FDRep k G) :
      V.character 1 = ↑(Module.finrank k ↑V.V)
  • defdefined in TauCeti/RepresentationTheory/CharacterTable/Table.lean
    complete
    def TauCeti.characterDegree.{u, v} (k : Type u) {G : Type v} [Field k]
      [Group G] [Finite G] [IsAlgClosed k] [Invertible ↑(Nat.card G)]
      (i : Fin (Nat.card (ConjClasses G))) : ℕ
    def TauCeti.characterDegree.{u, v}
      (k : Type u) {G : Type v} [Field k]
      [Group G] [Finite G] [IsAlgClosed k]
      [Invertible ↑(Nat.card G)]
      (i : Fin (Nat.card (ConjClasses G))) : ℕ
    **The degree of the `i`-th irreducible character**, the dimension of a representation affording
    it. 
Definition8.3.127
uses 1used by 0✓L∃∀N

Conductor of the field generated by the character values. (LMFDB)

Given a complex character \chi of a group G, define \Q(\chi) to be the smallest field containing \Q and the character values of \chi. This field is abelian and hence has a conductor, a positive integer giving the minimum n so that \Q(\chi) \subseteq \Q(\zeta_n).

Tau Ceti Review: FDRep.characterField.

Depends on: Definition 8.3.125

Lean code for Definition8.3.127●8 declarations
  • defdefined in TauCeti/RepresentationTheory/CharacterTable/FieldOfValues.lean
    complete
    def FDRep.characterField.{u, v, w} {k : Type u} [Field k] {G : Type v}
      [Monoid G] (X : FDRep k G) (F : Type w) [Field F] [Algebra F k] :
      IntermediateField F k
    def FDRep.characterField.{u, v, w}
      {k : Type u} [Field k] {G : Type v}
      [Monoid G] (X : FDRep k G) (F : Type w)
      [Field F] [Algebra F k] :
      IntermediateField F k
    The intermediate field generated over `F` by the character values of `X`. This is a field
    of values, without an assertion that `X` has a model over this field. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacter.lean
    complete
    def FDRep.characterConductor {G : Type} [Group G] (X : FDRep ℂ G)
      [Finite G] : ℕ
    def FDRep.characterConductor {G : Type}
      [Group G] (X : FDRep ℂ G) [Finite G] : ℕ
    The **conductor** of a complex character `χ` of a finite group (LMFDB
    `group.representation.cyclotomic_n`): the conductor of the abelian number field `ℚ(χ)` generated by
    the values of `χ`, i.e. the least `n > 0` with `ℚ(χ) ⊆ ℚ(ζ_n)`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/AbelianConductor.lean
    complete
    def NumberField.abelianConductor.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    def NumberField.abelianConductor.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    The **conductor** of an abelian number field `K` (LMFDB `nf.conductor`): the least positive
    integer `n` such that `K` embeds in the cyclotomic field `ℚ(ζ_n)`.
    
    By the Kronecker–Weber theorem, which is not available, such an `n` exists exactly when `K` is
    abelian; when there is none the conductor takes the junk value `0`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterConductor.lean
    complete
    theorem FDRep.isAbelianGalois_characterField {G : Type} [Group G] [Finite G]
      (X : FDRep ℂ G) : IsAbelianGalois ℚ ↥(X.characterField ℚ)
    theorem FDRep.isAbelianGalois_characterField
      {G : Type} [Group G] [Finite G]
      (X : FDRep ℂ G) :
      IsAbelianGalois ℚ ↥(X.characterField ℚ)
    **The field of values of a complex character of a finite group is abelian** (LMFDB
    `group.representation.cyclotomic_n`): it embeds in a cyclotomic field
    (`FDRep.characterConductor_pos`). 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacter.lean
    complete
    theorem FDRep.characterConductor_pos {G : Type} [Group G] (X : FDRep ℂ G)
      [Finite G] : 0 < X.characterConductor
    theorem FDRep.characterConductor_pos {G : Type}
      [Group G] (X : FDRep ℂ G) [Finite G] :
      0 < X.characterConductor
    **The conductor of a complex character of a finite group is positive**: `ℚ(χ)` lies in the
    cyclotomic field `ℚ(ζ_e)` for `e` the exponent of `G`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterConductor.lean
    complete
    theorem FDRep.isLeast_characterConductor {G : Type} [Group G] [Finite G]
      (X : FDRep ℂ G) :
      IsLeast
        {n |
          0 < n ∧
            X.characterField ℚ ≤ IntermediateField.adjoin ℚ {b | b ^ n = 1}}
        X.characterConductor
    theorem FDRep.isLeast_characterConductor
      {G : Type} [Group G] [Finite G]
      (X : FDRep ℂ G) :
      IsLeast
        {n |
          0 < n ∧
            X.characterField ℚ ≤
              IntermediateField.adjoin ℚ
                {b | b ^ n = 1}}
        X.characterConductor
    **The conductor of a character is the least level of a cyclotomic field containing its values**
    (LMFDB `group.representation.cyclotomic_n`): the conductor of a complex character `χ` of a finite
    group is the least `n > 0` such that `ℚ(χ) ⊆ ℚ(ζ_n)`, where `ℚ(ζ_n)` is the subfield of `ℂ`
    generated by the `n`-th roots of unity. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterConductor.lean
    complete
    theorem FDRep.characterField_le_adjoin_nth_roots_iff {n : ℕ} {G : Type}
      [Group G] [Finite G] (X : FDRep ℂ G) (hn : 0 < n) :
      X.characterField ℚ ≤ IntermediateField.adjoin ℚ {b | b ^ n = 1} ↔
        X.characterConductor ∣ n
    theorem FDRep.characterField_le_adjoin_nth_roots_iff
      {n : ℕ} {G : Type} [Group G] [Finite G]
      (X : FDRep ℂ G) (hn : 0 < n) :
      X.characterField ℚ ≤
          IntermediateField.adjoin ℚ
            {b | b ^ n = 1} ↔
        X.characterConductor ∣ n
    **`ℚ(χ) ⊆ ℚ(ζ_n)` exactly when the conductor of `χ` divides `n`** (LMFDB
    `group.representation.cyclotomic_n`), for `n > 0`, where `ℚ(ζ_n)` is the subfield of `ℂ` generated
    by the `n`-th roots of unity. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/CharacterConductor.lean
    complete
    theorem IntermediateField.nonempty_algHom_cyclotomicField_iff_le {n : ℕ}
      {K : IntermediateField ℚ ℂ} [NeZero n] :
      Nonempty (↥K →ₐ[ℚ] CyclotomicField n ℚ) ↔
        K ≤ IntermediateField.adjoin ℚ {b | b ^ n = 1}
    theorem IntermediateField.nonempty_algHom_cyclotomicField_iff_le
      {n : ℕ} {K : IntermediateField ℚ ℂ}
      [NeZero n] :
      Nonempty
          (↥K →ₐ[ℚ] CyclotomicField n ℚ) ↔
        K ≤
          IntermediateField.adjoin ℚ
            {b | b ^ n = 1}
    **A subfield of `ℂ` embeds in the `n`-th cyclotomic field exactly when it lies in `ℚ(ζ_n)`**,
    the subfield of `ℂ` generated by the `n`-th roots of unity, which is isomorphic to
    `CyclotomicField n ℚ`: as `ℚ(ζ_n)` is a normal extension of `ℚ`, an element `x` of a subfield with
    an embedding `ψ` into `ℚ(ζ_n)` is a root of the minimal polynomial of `ψ x`, which splits in
    `ℚ(ζ_n)`. 
Definition8.3.128
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.125
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 8.3.84
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Faithful representation. (LMFDB)

A representation \rho is faithful if it is injective as a homomorphism to \GL(V). In terms of the character \chi of \rho, for representations of finite groups in characteristic 0, this will hold precisely when \chi(g) = \chi(1) implies g = 1.

Tau Ceti Review: MonoidHom.ker, MonoidHom.ker_eq_bot_iff, Representation.character, FDRep.ker_eq_bot_iff.

Depends on: Definition 8.3.125 Definition 8.3.130

Lean code for Definition8.3.128●6 declarations
  • defdefined in Mathlib/Algebra/Group/Subgroup/Ker.lean
    complete
    def MonoidHom.ker.{u_1, u_6} {G : Type u_1} [Group G] {M : Type u_6}
      [MulOneClass M] (f : G →* M) : Subgroup G
    def MonoidHom.ker.{u_1, u_6} {G : Type u_1}
      [Group G] {M : Type u_6} [MulOneClass M]
      (f : G →* M) : Subgroup G
    The multiplicative kernel of a monoid homomorphism is the subgroup of elements `x : G` such that
    `f x = 1` 
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Ker.lean
    complete
    theorem MonoidHom.ker_eq_bot_iff.{u_1, u_6} {G : Type u_1} [Group G]
      {M : Type u_6} [MulOneClass M] (f : G →* M) :
      f.ker = ⊥ ↔ Function.Injective ⇑f
    theorem MonoidHom.ker_eq_bot_iff.{u_1, u_6}
      {G : Type u_1} [Group G] {M : Type u_6}
      [MulOneClass M] (f : G →* M) :
      f.ker = ⊥ ↔ Function.Injective ⇑f
  • defdefined in Mathlib/RepresentationTheory/Character.lean
    complete
    def Representation.character.{u_1, u_2, u_3} {G : Type u_1} {k : Type u_2}
      {V : Type u_3} [Monoid G] [Field k] [AddCommGroup V] [Module k V]
      (ρ : Representation k G V) (g : G) : k
    def Representation.character.{u_1, u_2, u_3}
      {G : Type u_1} {k : Type u_2}
      {V : Type u_3} [Monoid G] [Field k]
      [AddCommGroup V] [Module k V]
      (ρ : Representation k G V) (g : G) : k
    The character of a representation `ρ : Representation k G V` is the function associating to
    `g : G` the trace of the linear map `ρ g`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulCharacter.lean
    complete
    theorem Representation.injective_iff_character_eq_character_one.{u_1, u_2, u_3}
      {k : Type u_1} {G : Type u_2} {V : Type u_3} [Field k] [CharZero k]
      [Group G] [Finite G] [AddCommGroup V] [Module k V]
      [FiniteDimensional k V] (ρ : Representation k G V) :
      Function.Injective ⇑ρ ↔
        ∀ (g : G), ρ.character g = ρ.character 1 → g = 1
    theorem Representation.injective_iff_character_eq_character_one.{u_1,
        u_2, u_3}
      {k : Type u_1} {G : Type u_2}
      {V : Type u_3} [Field k] [CharZero k]
      [Group G] [Finite G] [AddCommGroup V]
      [Module k V] [FiniteDimensional k V]
      (ρ : Representation k G V) :
      Function.Injective ⇑ρ ↔
        ∀ (g : G),
          ρ.character g = ρ.character 1 →
            g = 1
    **The character criterion for faithfulness in characteristic zero** (LMFDB
    `group.representation.faithful`): a representation `ρ` of a finite group on a finite-dimensional
    vector space over a field of characteristic `0` is faithful, that is injective, exactly when its
    character `χ` satisfies `χ(g) = χ(1) → g = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FaithfulCharacter.lean
    complete
    theorem Module.End.eq_one_of_trace_eq_finrank_of_charZero.{u_3, u_4} {n : ℕ}
      {k : Type u_3} {V : Type u_4} [Field k] [CharZero k] [AddCommGroup V]
      [Module k V] [FiniteDimensional k V] {g : Module.End k V} (hn : n ≠ 0)
      (hg : g ^ n = 1)
      (htr : (LinearMap.trace k V) g = ↑(Module.finrank k V)) : g = 1
    theorem Module.End.eq_one_of_trace_eq_finrank_of_charZero.{u_3,
        u_4}
      {n : ℕ} {k : Type u_3} {V : Type u_4}
      [Field k] [CharZero k] [AddCommGroup V]
      [Module k V] [FiniteDimensional k V]
      {g : Module.End k V} (hn : n ≠ 0)
      (hg : g ^ n = 1)
      (htr :
        (LinearMap.trace k V) g =
          ↑(Module.finrank k V)) :
      g = 1
    **An endomorphism of finite order whose trace is the dimension is the identity**, over any
    field of characteristic `0`: its matrix, mapped to the algebraic closure, is the identity there. 
  • theoremdefined in TauCeti/RepresentationTheory/CharacterTable/Kernel.lean
    complete
    theorem FDRep.ker_eq_bot_iff.{u} {G : Type u} [Group G] (V : FDRep ℂ G)
      (hG : IsMulTorsion G) :
      V.ρ.ker = ⊥ ↔ ∀ (g : G), V.character g = V.character 1 → g = 1
    theorem FDRep.ker_eq_bot_iff.{u} {G : Type u}
      [Group G] (V : FDRep ℂ G)
      (hG : IsMulTorsion G) :
      V.ρ.ker = ⊥ ↔
        ∀ (g : G),
          V.character g = V.character 1 →
            g = 1
    **A representation of a torsion group is faithful exactly when its character detects the
    identity.** 
Definition8.3.129
uses 1used by 0✓L∃∀N

Image of a representation. (LMFDB)

The image of a representation of a finite group G is the image of the defining homomorphism \rho : G \to \GL(V) for some vector space V.

Tau Ceti Review: MonoidHom.range, Representation.asGroupHom.

Depends on: Definition 8.3.130

Lean code for Definition8.3.129●2 definitions
  • defdefined in Mathlib/Algebra/Group/Subgroup/Ker.lean
    complete
    def MonoidHom.range.{u_1, u_4} {G : Type u_1} [Group G] {N : Type u_4}
      [Group N] (f : G →* N) : Subgroup N
    def MonoidHom.range.{u_1, u_4} {G : Type u_1}
      [Group G] {N : Type u_4} [Group N]
      (f : G →* N) : Subgroup N
    The range of a monoid homomorphism from a group is a subgroup. 
  • defdefined in Mathlib/RepresentationTheory/Basic.lean
    complete
    def Representation.asGroupHom.{u_1, u_2, u_3} {k : Type u_1} {G : Type u_2}
      {V : Type u_3} [CommSemiring k] [Group G] [AddCommMonoid V]
      [Module k V] (ρ : Representation k G V) : G →* (V →ₗ[k] V)ˣ
    def Representation.asGroupHom.{u_1, u_2, u_3}
      {k : Type u_1} {G : Type u_2}
      {V : Type u_3} [CommSemiring k]
      [Group G] [AddCommMonoid V] [Module k V]
      (ρ : Representation k G V) :
      G →* (V →ₗ[k] V)ˣ
    When `G` is a group, a `k`-linear representation of `G` on `V` can be thought of as
    a group homomorphism from `G` into the invertible `k`-linear endomorphisms of `V`.
    
Definition8.3.130
uses 1
Used by 8
Reverse dependency previews
Preview
Definition 4.6.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Complex irreducible representation. (LMFDB)

A representation of a finite group G is a homomorphism \rho : G \to \GL(V) for some vector space V. A representation is reducible if there is some nontrivial subspace W \subset V with \rho(g)(W) = W for all g \in G; otherwise it is irreducible. We say two representations \rho : G \to \GL(V) and \rho' : G \to \GL(V') are equivalent if there is an isomorphism \sigma : V \to V' so that \rho'(g) = \sigma^{-1} \rho(g) \sigma for all g \in G. Up to equivalence, the complex irreducible representations of a finite group G (also known as irreps) are determined by their characters, which are recorded in the character table of G.

Tau Ceti Review: Representation, Representation.IsIrreducible, FDRep, TauCeti.SimpleFDRepClasses.

Depends on: Definition 8.3.3

Lean code for Definition8.3.130●4 definitions
  • abbrevdefined in Mathlib/RepresentationTheory/Basic.lean
    complete
    abbrev Representation.{u_1, u_2, u_3} (k : Type u_1) (G : Type u_2)
      (V : Type u_3) [Semiring k] [Monoid G] [AddCommMonoid V]
      [Module k V] : Type (max u_2 u_3)
    abbrev Representation.{u_1, u_2, u_3}
      (k : Type u_1) (G : Type u_2)
      (V : Type u_3) [Semiring k] [Monoid G]
      [AddCommMonoid V] [Module k V] :
      Type (max u_2 u_3)
    A representation of `G` on the `k`-module `V` is a homomorphism `G →* (V →ₗ[k] V)`.
    
  • abbrevdefined in Mathlib/RepresentationTheory/Irreducible.lean
    complete
    abbrev Representation.IsIrreducible.{u_1, u_2, u_3} {G : Type u_1}
      {k : Type u_2} {V : Type u_3} [Monoid G] [Field k] [AddCommGroup V]
      [Module k V] (ρ : Representation k G V) : Prop
    abbrev Representation.IsIrreducible.{u_1, u_2,
        u_3}
      {G : Type u_1} {k : Type u_2}
      {V : Type u_3} [Monoid G] [Field k]
      [AddCommGroup V] [Module k V]
      (ρ : Representation k G V) : Prop
    A representation `ρ` is irreducible if it is non-trivial and has no proper non-trivial
    subrepresentations. 
  • abbrevdefined in Mathlib/RepresentationTheory/FDRep.lean
    complete
    abbrev FDRep.{u, v} (R : Type u) (G : Type v) [Ring R] [Monoid G] :
      Type (max (max (u + 1) v) u)
    abbrev FDRep.{u, v} (R : Type u) (G : Type v)
      [Ring R] [Monoid G] :
      Type (max (max (u + 1) v) u)
    The category of finitely generated `R`-linear representations of a monoid `G`.
    
    Note that `R` can be any ring,
    but the main case of interest is when `R = k` is a field and `G` is a group. 
  • defdefined in TauCeti/RepresentationTheory/Simple/Basic.lean
    complete
    def TauCeti.SimpleFDRepClasses.{u, v} (k : Type u) (G : Type v) [Ring k]
      [Monoid G] : Type (max (u + 1) v)
    def TauCeti.SimpleFDRepClasses.{u, v}
      (k : Type u) (G : Type v) [Ring k]
      [Monoid G] : Type (max (u + 1) v)
    **The isomorphism classes of simple objects of `FDRep k G`**: the skeleton of the full
    subcategory they span. 
Definition8.3.131
uses 1used by 0✓L∃∀N

Kernel of a character. (LMFDB)

The kernel of the character \chi of a group G is the subgroup of G given by the set: \ker(\chi)=\{g \in G : \chi(g)=\chi(1)\}.

Tau Ceti Review: MonoidHom.ker, FDRep.coe_ker, FDRep.mem_ker_iff_char_eq.

Depends on: Definition 8.3.125

Lean code for Definition8.3.131●3 declarations
  • defdefined in Mathlib/Algebra/Group/Subgroup/Ker.lean
    complete
    def MonoidHom.ker.{u_1, u_6} {G : Type u_1} [Group G] {M : Type u_6}
      [MulOneClass M] (f : G →* M) : Subgroup G
    def MonoidHom.ker.{u_1, u_6} {G : Type u_1}
      [Group G] {M : Type u_6} [MulOneClass M]
      (f : G →* M) : Subgroup G
    The multiplicative kernel of a monoid homomorphism is the subgroup of elements `x : G` such that
    `f x = 1` 
  • theoremdefined in TauCeti/RepresentationTheory/CharacterTable/Kernel.lean
    complete
    theorem FDRep.coe_ker.{u} {G : Type u} [Group G] (V : FDRep ℂ G)
      (hG : IsMulTorsion G) : ↑V.ρ.ker = {g | V.character g = V.character 1}
    theorem FDRep.coe_ker.{u} {G : Type u} [Group G]
      (V : FDRep ℂ G) (hG : IsMulTorsion G) :
      ↑V.ρ.ker =
        {g | V.character g = V.character 1}
    **The kernel of a finite-dimensional complex representation of a torsion group, as the set of
    elements at which the character takes its value at the identity.** 
  • theoremdefined in TauCeti/RepresentationTheory/CharacterTable/Kernel.lean
    complete
    theorem FDRep.mem_ker_iff_char_eq.{u} {G : Type u} [Group G] (V : FDRep ℂ G)
      {g : G} (hg : IsOfFinOrder g) :
      g ∈ V.ρ.ker ↔ V.character g = V.character 1
    theorem FDRep.mem_ker_iff_char_eq.{u} {G : Type u}
      [Group G] (V : FDRep ℂ G) {g : G}
      (hg : IsOfFinOrder g) :
      g ∈ V.ρ.ker ↔
        V.character g = V.character 1
    **The kernel of a finite-dimensional complex representation is read off its character**: an
    element `g` of finite order acts as the identity exactly when the character takes at `g` the value
    it takes at the identity. 
Definition8.3.132
Statement uses 2
Statement dependency previews
Preview
Definition 8.1.26
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Minimum permutation representation. (LMFDB)

The smallest permutation representation containing the given character \chi, as a transitive group.

Depends on: Definition 8.1.26 Definition 8.3.125

Definition8.3.133
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.86
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Rational character. (LMFDB)

A rational character of a finite group G is complex character taking values in \Q. Such a character can be obtained by taking the sum of Galois conjugates of an irreducible complex character, and we will refer to these as irreducible rational characters even though they are not irreducible as complex characters. The irreducible rational characters form a \Q-basis for the \Q-vector space of rational characters.

Note that the representation corresponding to a rational character may not take values in \GL_n(\Q) even though the character takes values in \Q (the difference between the field of character values and the field in which matrix entries lie is measured by the Schur index).

The value taken by a rational character is constant on each rational conjugacy classes.

Depends on: Definition 8.3.3 Definition 8.3.42 Definition 8.3.125

Lean code for Definition8.3.133●8 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacter.lean
    complete
    def FDRep.IsRationalCharacter {G : Type} [Group G] (X : FDRep ℂ G) : Prop
    def FDRep.IsRationalCharacter {G : Type}
      [Group G] (X : FDRep ℂ G) : Prop
    A complex character `χ` of `G` is a **rational character** (LMFDB
    `group.representation.rational_character`) if it takes values in `ℚ`. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacter.lean
    complete
    def FDRep.rationalCharacter {G : Type} [Group G] (X : FDRep ℂ G) : G → ℂ
    def FDRep.rationalCharacter {G : Type}
      [Group G] (X : FDRep ℂ G) : G → ℂ
    The **irreducible rational character** (LMFDB `group.representation.rational_character`)
    attached to an irreducible complex representation `X` with character `χ`: the sum of the distinct
    Galois conjugates `σ ∘ χ` of `χ`. It is a rational character (not proved here), though not an
    irreducible complex character in general. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    theorem FDRep.exists_isRationalCharacter_character_eq_rationalCharacter
      {G : Type} [Group G] (X : FDRep ℂ G) [Finite G]
      [CategoryTheory.Simple X] :
      ∃ Y, Y.IsRationalCharacter ∧ Y.character = X.rationalCharacter
    theorem FDRep.exists_isRationalCharacter_character_eq_rationalCharacter
      {G : Type} [Group G] (X : FDRep ℂ G)
      [Finite G] [CategoryTheory.Simple X] :
      ∃ Y,
        Y.IsRationalCharacter ∧
          Y.character = X.rationalCharacter
    **The irreducible rational character attached to an irreducible representation is a rational
    character** (LMFDB `group.representation.rational_character`): it is the character of the direct
    sum of representations affording the Galois conjugates of the character, and it is rational valued,
    being fixed by the automorphisms of `ℂ`. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    def FDRep.rationalCharacterSpace (G : Type) [Group G] : Submodule ℚ (G → ℂ)
    def FDRep.rationalCharacterSpace (G : Type)
      [Group G] : Submodule ℚ (G → ℂ)
    The **`ℚ`-vector space of rational characters** of `G` (LMFDB
    `group.representation.rational_character`): the `ℚ`-span of the rational characters. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    def FDRep.irreducibleRationalCharacterBasis (G : Type) [Group G]
      [Finite G] :
      Module.Basis ↑(FDRep.irreducibleRationalCharacters G) ℚ
        ↥(FDRep.rationalCharacterSpace G)
    def FDRep.irreducibleRationalCharacterBasis
      (G : Type) [Group G] [Finite G] :
      Module.Basis
        ↑(FDRep.irreducibleRationalCharacters
            G)
        ℚ ↥(FDRep.rationalCharacterSpace G)
    The **irreducible rational characters** of `G` (LMFDB
    `group.representation.rational_character`), as a `ℚ`-basis of the `ℚ`-vector space of rational
    characters. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalCharacterBasis.lean
    complete
    theorem FDRep.IsRationalCharacter.character_eq_of_isRationallyConj {G : Type}
      [Group G] {Y : FDRep ℂ G} [Finite G] {x y : G}
      (hY : Y.IsRationalCharacter) (h : IsRationallyConj x y) :
      Y.character x = Y.character y
    theorem FDRep.IsRationalCharacter.character_eq_of_isRationallyConj
      {G : Type} [Group G] {Y : FDRep ℂ G}
      [Finite G] {x y : G}
      (hY : Y.IsRationalCharacter)
      (h : IsRationallyConj x y) :
      Y.character x = Y.character y
    **A rational character is constant on the rational conjugacy classes** (LMFDB
    `group.representation.rational_character`): a character is constant on conjugacy classes, and its
    values at `g` and at `g ^ k`, `k` prime to the order of `g`, are conjugate by an automorphism of
    `ℂ`, which fixes a rational value. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    theorem QuaternionGroup.isRational_two : Group.IsRational (QuaternionGroup 2)
    theorem QuaternionGroup.isRational_two :
      Group.IsRational (QuaternionGroup 2)
    **The quaternion group `Q₈` is rational** (LMFDB `group.rational_group`): every element is
    conjugate to its inverse, and `gᵏ` is `g` or `g⁻¹` for odd `k`, the exponent being `4`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/RationalGroup.lean
    complete
    theorem QuaternionGroup.not_isQGroup_two : ¬Group.IsQGroup (QuaternionGroup 2)
    theorem QuaternionGroup.not_isQGroup_two :
      ¬Group.IsQGroup (QuaternionGroup 2)
    **The quaternion group `Q₈` is not a ℚ-group in the strong sense** (LMFDB
    `group.rational_group`), although it is rational (`QuaternionGroup.isRational_two`): its
    two-dimensional complex representation `a 1 ↦ diag(i, -i)`, `xa 0 ↦ !![0, -1; 1, 0]` is not
    realized over `ℚ`. The matrices `A`, `B` over `ℚ` of `a 1` and `xa 0` in a realization would have
    traces `tr A = tr B = tr AB = 0` and `tr A² = tr B² = -2`, which no `2 × 2` matrices over an ordered
    field have. 
Definition8.3.134
uses 0used by 1✓L∃∀N

Schur index. (LMFDB)

Given a group G, a field K \subseteq \mathbb{C} with F a subfield of K, and a character \chi of an irreducible KG-module V, define the field extension F(\chi) of F formed by adjoining to F all the values the character takes on:

F(\chi)=F\left(\chi(g) : g \in G\right).

The Schur index of \chi is the minimum of all indices [E:F(\chi)] where E varies over all field F(\chi) \subseteq E \subseteq K so that there is an EG-module W with V\cong K \otimes_E W.

Tau Ceti Review: FDRep.characterField.

Lean code for Definition8.3.134●5 declarations
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/SchurIndex.lean
    complete
    def FDRep.schurIndex.{u_1, u_2, u_3} {K : Type u_1} {G : Type u_2} [Field K]
      [Group G] (V : FDRep K G) (F : Type u_3) [Field F] [Algebra F K] : ℕ
    def FDRep.schurIndex.{u_1, u_2, u_3}
      {K : Type u_1} {G : Type u_2} [Field K]
      [Group G] (V : FDRep K G) (F : Type u_3)
      [Field F] [Algebra F K] : ℕ
    The **Schur index** over `F` of the character `χ` of a representation `V` of `G` over `K`
    (LMFDB `group.representation.schur_index`), for a subfield `F` of `K`: the least degree
    `[E : F(χ)]` of an intermediate field `F(χ) ⊆ E ⊆ K` over which `V` is realized, where
    `F(χ) = V.characterField F` is generated over `F` by the values of `χ`.
    
    The LMFDB takes `K ⊆ ℂ`, a representation that is irreducible over `K`, and the minimum over all
    such fields `E`. The minimum here runs over the fields of finite degree over `F(χ)`, which gives
    the same value whenever one of them realizes `V`; when none does, the value is `0`. In the setting
    of the LMFDB, irreducible complex representations of finite groups and `F = ℚ`, the Schur index is
    positive (`FDRep.schurIndex_pos`), so the minimum is attained
    (`FDRep.exists_relfinrank_eq_schurIndex`). 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/SchurIndex.lean
    complete
    def FDRep.IsRealizedOver.{u_1, u_2, u_3} {K : Type u_1} {G : Type u_2}
      [Field K] [Group G] (V : FDRep K G) (F : Type u_3) [Field F]
      [Algebra F K] (E : IntermediateField F K) : Prop
    def FDRep.IsRealizedOver.{u_1, u_2, u_3}
      {K : Type u_1} {G : Type u_2} [Field K]
      [Group G] (V : FDRep K G) (F : Type u_3)
      [Field F] [Algebra F K]
      (E : IntermediateField F K) : Prop
    A representation `V` of `G` over `K` is **realized over** an intermediate field `E` of `K / F`
    if it is isomorphic to the scalar extension `K ⊗_E W` of a representation `W` of `G` over `E`. 
  • defdefined in TauCeti/RepresentationTheory/CharacterTable/FieldOfValues.lean
    complete
    def FDRep.characterField.{u, v, w} {k : Type u} [Field k] {G : Type v}
      [Monoid G] (X : FDRep k G) (F : Type w) [Field F] [Algebra F k] :
      IntermediateField F k
    def FDRep.characterField.{u, v, w}
      {k : Type u} [Field k] {G : Type v}
      [Monoid G] (X : FDRep k G) (F : Type w)
      [Field F] [Algebra F k] :
      IntermediateField F k
    The intermediate field generated over `F` by the character values of `X`. This is a field
    of values, without an assertion that `X` has a model over this field. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/SchurIndex.lean
    complete
    theorem FDRep.schurIndex_pos {G : Type} [Group G] [Finite G] (V : FDRep ℂ G)
      [CategoryTheory.Simple V] : 0 < V.schurIndex ℚ
    theorem FDRep.schurIndex_pos {G : Type} [Group G]
      [Finite G] (V : FDRep ℂ G)
      [CategoryTheory.Simple V] :
      0 < V.schurIndex ℚ
    **The Schur index over `ℚ` of an irreducible complex representation of a finite group is
    positive**: by Brauer's theorem the representation is realized over the cyclotomic field `ℚ(ζₑ)`
    of the exponent `e` of `G`, which has finite degree over `ℚ(χ)`. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/SchurIndex.lean
    complete
    theorem FDRep.exists_relfinrank_eq_schurIndex.{u_1, u_2, u_3} {K : Type u_1}
      {G : Type u_2} [Field K] [Group G] {V : FDRep K G} {F : Type u_3}
      [Field F] [Algebra F K] (h : 0 < V.schurIndex F) :
      ∃ E,
        V.characterField F ≤ E ∧
          (V.characterField F).relfinrank E = V.schurIndex F ∧
            V.IsRealizedOver F E
    theorem FDRep.exists_relfinrank_eq_schurIndex.{u_1,
        u_2, u_3}
      {K : Type u_1} {G : Type u_2} [Field K]
      [Group G] {V : FDRep K G} {F : Type u_3}
      [Field F] [Algebra F K]
      (h : 0 < V.schurIndex F) :
      ∃ E,
        V.characterField F ≤ E ∧
          (V.characterField F).relfinrank E =
              V.schurIndex F ∧
            V.IsRealizedOver F E
    **A positive Schur index is attained**: it is the degree over `F(χ)` of a field
    `F(χ) ⊆ E ⊆ K` over which the representation is realized. 
Definition8.3.135
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Type of a complex group representation. (LMFDB)

Let \rho:G\to\GL_n(\C) be an irreducible complex group representation. Then \rho is one of three types:

  1. Real if \rho is conjugate to a representation G\to \GL_n(\R)

  2. Complex if some character value \textrm{Tr}(\rho(g)) is not contained in \R

  3. Quaternionic (or Symplectic) if the character values are all real but the representation is not conjugate to a real representation.

The type of the representation can be computed via its Frobenius-Schur indicator.

Tau Ceti Review: Representation.IsRealizableOverReal, Representation.frobeniusSchurIndicator_eq_one_iff_isRealizableOverReal.

Depends on: Definition 8.3.3 Definition 8.3.125

Lean code for Definition8.3.135●6 declarations
  • defdefined in TauCeti/RepresentationTheory/RealForm.lean
    complete
    def Representation.IsRealizableOverReal.{u_1, u_2} {G : Type u_1} [Monoid G]
      {V : Type u_2} [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) : Prop
    def Representation.IsRealizableOverReal.{u_1,
        u_2}
      {G : Type u_1} [Monoid G] {V : Type u_2}
      [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) : Prop
    **Realizability over `ℝ`**: `ρ` admits a real form on the carrier `Fin (finrank ℂ V) → ℝ`.
    Pinning the carrier avoids a type existential; a real form on an arbitrary carrier is
    `Representation.IsRealForm`, and every result about the indicator is proved from that more general
    notion.
    
    Pinning the carrier by the dimension costs nothing: the pinned carrier is finite-dimensional, so a
    real form on it already forces `V` to be finite-dimensional
    (`Representation.IsRealizableOverReal.finiteDimensional`), and conversely every real form on a
    finite-dimensional carrier transports to the pinned one
    (`Representation.IsRealForm.isRealizableOverReal`).  For an infinite-dimensional `V` the predicate
    is therefore simply false -- `finrank ℂ V` is then `0` and the pinned carrier is the zero space --
    and `Representation.IsRealForm` is the notion to use there. 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FrobeniusSchurType.lean
    complete
    def Representation.IsComplexType.{u_1, u_2} {G : Type u_1} {V : Type u_2}
      [Group G] [AddCommGroup V] [Module ℂ V] (ρ : Representation ℂ G V) :
      Prop
    def Representation.IsComplexType.{u_1, u_2}
      {G : Type u_1} {V : Type u_2} [Group G]
      [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) : Prop
    An irreducible complex representation `ρ` is of **complex** type (LMFDB
    `group.representation.type`) if some character value `Tr ρ(g)` is not real. For a finite group
    this is exactly when the Frobenius–Schur indicator vanishes
    (`Representation.frobeniusSchurIndicator_eq_zero_iff_isComplexType`). 
  • defdefined in LeanBridge/ForMathlib/RepresentationTheory/FrobeniusSchurType.lean
    complete
    def Representation.IsQuaternionicType.{u_1, u_2} {G : Type u_1}
      {V : Type u_2} [Group G] [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) : Prop
    def Representation.IsQuaternionicType.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G]
      [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) : Prop
    An irreducible complex representation `ρ` is of **quaternionic** (or **symplectic**) type (LMFDB
    `group.representation.type`) if its character values are all real but it is not conjugate to a
    representation by real matrices (Tau Ceti's `Representation.IsRealizableOverReal`). For a finite
    group this is exactly when the Frobenius–Schur indicator is `-1`
    (`Representation.frobeniusSchurIndicator_eq_neg_one_iff_isQuaternionicType`). 
  • theoremdefined in TauCeti/RepresentationTheory/CharacterTable/FrobeniusSchur/Realizability.lean
    complete
    theorem Representation.frobeniusSchurIndicator_eq_one_iff_isRealizableOverReal.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G] [Fintype G] [AddCommGroup V]
      [Module ℂ V] {ρ : Representation ℂ G V} [ρ.IsIrreducible] :
      TauCeti.Representation.frobeniusSchurIndicator ρ = 1 ↔
        ρ.IsRealizableOverReal
    theorem Representation.frobeniusSchurIndicator_eq_one_iff_isRealizableOverReal.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G]
      [Fintype G] [AddCommGroup V]
      [Module ℂ V] {ρ : Representation ℂ G V}
      [ρ.IsIrreducible] :
      TauCeti.Representation.frobeniusSchurIndicator
            ρ =
          1 ↔
        ρ.IsRealizableOverReal
    **The orthogonality criterion in its realizability form**: an irreducible complex
    representation of a finite group has Frobenius-Schur indicator `1` exactly when it is realizable
    over `ℝ`.  The two halves are genuinely different theorems: one direction only transports an
    invariant symmetric form along a real form, while the other has to *build* the real structure out
    of an invariant symmetric form and an invariant Hermitian one. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FrobeniusSchurType.lean
    complete
    theorem Representation.frobeniusSchurIndicator_eq_zero_iff_isComplexType.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G] [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) [Fintype G] [ρ.IsIrreducible] :
      TauCeti.Representation.frobeniusSchurIndicator ρ = 0 ↔ ρ.IsComplexType
    theorem Representation.frobeniusSchurIndicator_eq_zero_iff_isComplexType.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G]
      [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) [Fintype G]
      [ρ.IsIrreducible] :
      TauCeti.Representation.frobeniusSchurIndicator
            ρ =
          0 ↔
        ρ.IsComplexType
    **An irreducible complex representation of a finite group has Frobenius–Schur indicator `0`
    exactly when it is of complex type** (LMFDB `group.representation.type`), that is, when some
    character value is not real. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/FrobeniusSchurType.lean
    complete
    theorem Representation.frobeniusSchurIndicator_eq_neg_one_iff_isQuaternionicType.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G] [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) [Fintype G] [ρ.IsIrreducible] :
      TauCeti.Representation.frobeniusSchurIndicator ρ = -1 ↔
        ρ.IsQuaternionicType
    theorem Representation.frobeniusSchurIndicator_eq_neg_one_iff_isQuaternionicType.{u_1,
        u_2}
      {G : Type u_1} {V : Type u_2} [Group G]
      [AddCommGroup V] [Module ℂ V]
      (ρ : Representation ℂ G V) [Fintype G]
      [ρ.IsIrreducible] :
      TauCeti.Representation.frobeniusSchurIndicator
            ρ =
          -1 ↔
        ρ.IsQuaternionicType
    **An irreducible complex representation of a finite group has Frobenius–Schur indicator `-1`
    exactly when it is of quaternionic type** (LMFDB `group.representation.type`), that is, when its
    character values are real but it is not realizable over `ℝ`. 
Definition8.3.136
uses 0used by 1XL∃∀N

Schur multiplier. (LMFDB)

If G is a finite group then the Schur multiplier of G is the homology group H_2(G, \Z). It is the maximal kernel of a stem extension of G. In the data, the Schur multiplier is represented as a list of invariant factors; e.g., '[2,4,12]' corresponds to the abelian group C_2 \times C_4 \times C_{12}.

Definition8.3.137
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.40
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.92
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Semi-dihedral group. (LMFDB)

The semi-dihedral group \SD_{2^k} is one of the four non-abelian groups of order 2^k containing a cyclic subgroup of index 2 (the other three being the dihedral group, the (generalized) quaternion group, and the other-dihedral group). It has the group presentation:

\SD_{2^k} = \langle r,s\mid r^{2^{k-1}}=s^{2}=1,\ srs=r^{2^{k-2}-1} \rangle.

It can also be given as the semidirect product C_{2^{k-1}} \rtimes C_2 where the action of C_2 on C_{2^{k-1}} is given by x \mapsto x^{2^{k-2}-1}.

Depends on: Definition 8.3.40 Definition 8.3.59 Definition 8.3.97 Definition 8.3.138

Lean code for Definition8.3.137●8 declarations
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/ModularMaximalCyclic.lean
    complete
    abbrev SemiDihedralGroup (k : ℕ) [Fact (3 ≤ k)] : Type
    abbrev SemiDihedralGroup (k : ℕ) [Fact (3 ≤ k)] :
      Type
    The **semi-dihedral group** `SD_{2^k}` (LMFDB `group.semi_dihedral`), also called the
    quasidihedral group: the semidirect product `C_{2^{k-1}} ⋊ C_2` in which the generator of `C_2`
    acts on `C_{2^{k-1}}` by `x ↦ x^{2^{k-2}-1}`, with presentation
    `⟨r, s | r^{2^{k-1}} = s^2 = 1, srs = r^{2^{k-2}-1}⟩`. It is defined for `k ≥ 3`; the LMFDB uses
    it for `k ≥ 4`, since `SD_8` is abelian. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/MetacyclicPresentation.lean
    complete
    def SemiDihedralGroup.presentedGroupMulEquiv (k : ℕ) [Fact (3 ≤ k)] :
      PresentedGroup
          (ZMod.involutionRelators (2 ^ (k - 1)) (2 ^ (k - 2) - 1)) ≃*
        SemiDihedralGroup k
    def SemiDihedralGroup.presentedGroupMulEquiv
      (k : ℕ) [Fact (3 ≤ k)] :
      PresentedGroup
          (ZMod.involutionRelators
            (2 ^ (k - 1))
            (2 ^ (k - 2) - 1)) ≃*
        SemiDihedralGroup k
    **The presentation `SD_{2^k} = ⟨r, s | r^{2^{k-1}} = s² = 1, s r s = r^{2^{k-2}-1}⟩` of the
    semi-dihedral group** (LMFDB `group.semi_dihedral`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwo.lean
    complete
    theorem SemiDihedralGroup.index_range_inl (k : ℕ) [Fact (3 ≤ k)] :
      SemidirectProduct.inl.range.index = 2
    theorem SemiDihedralGroup.index_range_inl (k : ℕ)
      [Fact (3 ≤ k)] :
      SemidirectProduct.inl.range.index = 2
    **The image of `C_{2^{k-1}}` in `SD_{2^k}` has index `2`** (LMFDB `group.semi_dihedral`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem SemiDihedralGroup.not_isMulCommutative {k : ℕ} [Fact (3 ≤ k)]
      (hk : 4 ≤ k) : ¬IsMulCommutative (SemiDihedralGroup k)
    theorem SemiDihedralGroup.not_isMulCommutative
      {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      ¬IsMulCommutative (SemiDihedralGroup k)
    **The semi-dihedral group `SD_{2^k}` is non-abelian for `k ≥ 4`** (LMFDB
    `group.semi_dihedral`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem nonempty_mulEquiv_of_isCyclic_of_index_eq_two.{u_1} {G : Type u_1}
      [Group G] {N : Subgroup G} {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k)
      (hG : Nat.card G = 2 ^ k) [IsCyclic ↥N] (hN : N.index = 2)
      (hnc : ¬IsMulCommutative G) :
      Nonempty (G ≃* DihedralGroup (2 ^ (k - 1))) ∨
        Nonempty (G ≃* QuaternionGroup (2 ^ (k - 2))) ∨
          Nonempty (G ≃* SemiDihedralGroup k) ∨
            Nonempty (G ≃* OtherDihedralGroup k)
    theorem nonempty_mulEquiv_of_isCyclic_of_index_eq_two.{u_1}
      {G : Type u_1} [Group G]
      {N : Subgroup G} {k : ℕ} [Fact (3 ≤ k)]
      (hk : 4 ≤ k) (hG : Nat.card G = 2 ^ k)
      [IsCyclic ↥N] (hN : N.index = 2)
      (hnc : ¬IsMulCommutative G) :
      Nonempty
          (G ≃* DihedralGroup (2 ^ (k - 1))) ∨
        Nonempty
            (G ≃*
              QuaternionGroup (2 ^ (k - 2))) ∨
          Nonempty
              (G ≃* SemiDihedralGroup k) ∨
            Nonempty
              (G ≃* OtherDihedralGroup k)
    **The non-abelian groups of order `2 ^ k`, `k ≥ 4`, with a cyclic subgroup of index `2`**
    (LMFDB `group.semi_dihedral`, `group.other_dihedral`): such a group is isomorphic to the dihedral
    group `D_{2^{k-1}}` of order `2 ^ k`, the generalised quaternion group `Q_{2^k}`, the semi-dihedral
    group `SD_{2^k}` or the other-dihedral group `OD_{2^k}`. For a generator `a` of the cyclic
    subgroup and `b` outside it, `b a b⁻¹ = a ^ e` with `e ≡ -1` or `2 ^ (k - 2) ± 1` modulo
    `2 ^ (k - 1)`; for `e = 2 ^ (k - 2) ± 1` the coset of `b` contains an involution, and for `e = -1`
    the group is dihedral or dicyclic according as it contains one. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem DihedralGroup.isEmpty_mulEquiv_semiDihedralGroup {k : ℕ}
      [Fact (3 ≤ k)] :
      IsEmpty (DihedralGroup (2 ^ (k - 1)) ≃* SemiDihedralGroup k)
    theorem DihedralGroup.isEmpty_mulEquiv_semiDihedralGroup
      {k : ℕ} [Fact (3 ≤ k)] :
      IsEmpty
        (DihedralGroup (2 ^ (k - 1)) ≃*
          SemiDihedralGroup k)
    **`D_{2^{k-1}}` and `SD_{2^k}` are not isomorphic** (LMFDB `group.semi_dihedral`,
    `group.other_dihedral`): they have `2 ^ (k - 1) + 2` and `2 ^ (k - 2) + 2` solutions of
    `g² = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem QuaternionGroup.isEmpty_mulEquiv_semiDihedralGroup {k : ℕ}
      [Fact (3 ≤ k)] :
      IsEmpty (QuaternionGroup (2 ^ (k - 2)) ≃* SemiDihedralGroup k)
    theorem QuaternionGroup.isEmpty_mulEquiv_semiDihedralGroup
      {k : ℕ} [Fact (3 ≤ k)] :
      IsEmpty
        (QuaternionGroup (2 ^ (k - 2)) ≃*
          SemiDihedralGroup k)
    **`Q_{2^k}` and `SD_{2^k}` are not isomorphic** (LMFDB `group.semi_dihedral`,
    `group.other_dihedral`): they have `2` and `2 ^ (k - 2) + 2` solutions of `g² = 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/CyclicIndexTwoClassification.lean
    complete
    theorem SemiDihedralGroup.isEmpty_mulEquiv_otherDihedralGroup {k : ℕ}
      [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty (SemiDihedralGroup k ≃* OtherDihedralGroup k)
    theorem SemiDihedralGroup.isEmpty_mulEquiv_otherDihedralGroup
      {k : ℕ} [Fact (3 ≤ k)] (hk : 4 ≤ k) :
      IsEmpty
        (SemiDihedralGroup k ≃*
          OtherDihedralGroup k)
    **`SD_{2^k}` and `OD_{2^k}` are not isomorphic for `k ≥ 4`** (LMFDB `group.semi_dihedral`,
    `group.other_dihedral`): they have `2 ^ (k - 2) + 2` and `4` solutions of `g² = 1`. 
Definition8.3.138
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 8
Reverse dependency previews
Preview
Definition 8.3.39
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Semidirect product of groups. (LMFDB)

Suppose H and N are groups with operations *_H and *_N and \phi:H\to \Aut(N) is a homomorphism to the automorphism group of N. Then the set N\times H with the operation

(n_1, h_1)*(n_2, h_2) = (n_1*_N \phi(h_1)(n_2), h_1 *_H h_2)

is a group called a semidirect product of H and N denoted N:H or N\rtimes H. If \phi is the trivial homomorphism, then the resulting group is the direct product N\times H, so it is a trivial semidirect product.

The group N:H has subgroups

N' = \{(n,e)\mid n\in N\} \cong N

and

H' = \{(e,h) \mid h\in H\} \cong H

satisfying N'\cap H'=\{(e,e)\}, N'H'=N:H, and N' is a normal subgroup of N:H.

Conversely, if a group G has a normal subgroup N and a subgroup H such that N\cap H=\{e\} such that N\cap H=\{e\} and NH=G, then G\cong N:H for some function \phi. We call N a semidirect factor of G in this case.

The semidirect product of N and H fits into a sequence

1 \to N \to N \rtimes H \to H \to 1,

and is distinguished by the existence of a homomorphism H \to N \rtimes H with image H' that splits the projection N \rtimes H \to H. We refer to such an extension as split, in contrast to other non-split extensions.

Tau Ceti Review: SemidirectProduct, SemidirectProduct.mulEquivSubgroup, GroupExtension.Splitting, Subgroup.IsComplement'.

Depends on: Definition 8.3.3 Definition 8.3.19 Definition 8.3.41 Definition 8.3.66 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.138●5 definitions
  • structure(2 fields)defined in Mathlib/GroupTheory/SemidirectProduct.lean
    complete
    structure SemidirectProduct.{u_1, u_2} (N : Type u_1) (G : Type u_2) [Group N]
      [Group G] (φ : G →* MulAut N) : Type (max u_1 u_2)
    structure SemidirectProduct.{u_1, u_2}
      (N : Type u_1) (G : Type u_2) [Group N]
      [Group G] (φ : G →* MulAut N) :
      Type (max u_1 u_2)
    The semidirect product of groups `N` and `G`, given a map `φ` from `G` to the automorphism
    group of `N`. It is the product of sets with the group operation
    `⟨n₁, g₁⟩ * ⟨n₂, g₂⟩ = ⟨n₁ * φ g₁ n₂, g₁ * g₂⟩` 
    left : N
    The element of N 
    right : G
    The element of G 
  • defdefined in Mathlib/GroupTheory/SemidirectProduct.lean
    complete
    def SemidirectProduct.mulEquivProd.{u_1, u_2} {N : Type u_1} {G : Type u_2}
      [Group N] [Group G] : N ⋊[1] G ≃* N × G
    def SemidirectProduct.mulEquivProd.{u_1, u_2}
      {N : Type u_1} {G : Type u_2} [Group N]
      [Group G] : N ⋊[1] G ≃* N × G
    The group isomorphism between a semidirect product with respect to the trivial map
    and the product. 
  • defdefined in Mathlib/GroupTheory/SemidirectProduct.lean
    complete
    def SemidirectProduct.mulEquivSubgroup.{u_2} {G : Type u_2} [Group G]
      {H K : Subgroup G} [H.Normal] (h : H.IsComplement' K) :
      ↥H ⋊[H.normalizerMonoidHom.comp (Subgroup.inclusion ⋯)] ↥K ≃* G
    def SemidirectProduct.mulEquivSubgroup.{u_2}
      {G : Type u_2} [Group G]
      {H K : Subgroup G} [H.Normal]
      (h : H.IsComplement' K) :
      ↥H ⋊[H.normalizerMonoidHom.comp
            (Subgroup.inclusion ⋯)]
          ↥K ≃*
        G
    The isomorphism from a semidirect product of complementary subgroups to the ambient group. 
  • structure(extends 4, 4 fields)defined in Mathlib/GroupTheory/GroupExtension/Defs.lean
    complete
    structure GroupExtension.Splitting.{u_1, u_2, u_3} {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E] [Group G]
      (S : GroupExtension N E G) : Type (max u_2 u_3)
    structure GroupExtension.Splitting.{u_1, u_2, u_3}
      {N : Type u_1} {E : Type u_2}
      {G : Type u_3} [Group N] [Group E]
      [Group G] (S : GroupExtension N E G) :
      Type (max u_2 u_3)
    `Splitting` of a group extension is a section homomorphism. 
    • G →* E
    • S.Section
    toFun : G → E
    Inherited from
    1. MonoidHom
    2. OneHom
    map_one' : (↑self.toMonoidHom).toFun 1 = 1
    Inherited from
    1. MonoidHom
    2. OneHom
    map_mul' : ∀ (x y : G), (↑self.toMonoidHom).toFun (x * y) = (↑self.toMonoidHom).toFun x * (↑self.toMonoidHom).toFun y
    Inherited from
    1. MonoidHom
    rightInverse_rightHom : Function.RightInverse (↑self.toMonoidHom).toFun ⇑S.rightHom
    `Section` is a right inverse to `S.rightHom` 
  • abbrevdefined in Mathlib/GroupTheory/Complement.lean
    complete
    abbrev Subgroup.IsComplement'.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    abbrev Subgroup.IsComplement'.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    `H` and `K` are complements if `(*) : H × K → G` is a bijection 
Definition8.3.139
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 9
Reverse dependency previews
Preview
Definition 8.3.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Simple groups. (LMFDB)

A non-trivial group G is simple if its only normal subgroups are the trivial group and G itself.

Finite simple groups are building blocks for all finite groups, via extensions, and they are divided into cyclic groups of prime order and the nonabelian simple groups. For small orders, nonabelian simple groups they are all alternating or linear.

Tau Ceti Review: IsSimpleGroup.

Depends on: Definition 8.3.3 Definition 8.3.5 Definition 8.3.37 Definition 8.3.97 Definition 8.3.167

Lean code for Definition8.3.139●1 definition
  • class(extends 1, 2 methods)defined in Mathlib/GroupTheory/Subgroup/Simple.lean
    complete
    class IsSimpleGroup.{u_1} (G : Type u_1) [Group G] : Prop
    class IsSimpleGroup.{u_1} (G : Type u_1)
      [Group G] : Prop
    A `Group` is simple when it has exactly two normal `Subgroup`s. 
    • Nontrivial G
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
    eq_bot_or_eq_top_of_normal : ∀ (H : Subgroup G) [H.Normal], H = ⊥ ∨ H = ⊤
    Any normal subgroup is either `⊥` or `⊤` 
Definition8.3.140
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.20
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Size of a conjugacy class.. (LMFDB)

The size of a conjugacy class of a finite group is the cardinality of the set of elements conjugate to each other.

By the Orbit-Stabilizer Theorem, the size of a conjugacy class divides the order of the group. Since conjugacy classes partition a group, the sum of the sizes of the conjugacy classes equals the size of the group.

A conjugacy class is of size 1 if and only if the element is in the center of the group.

Tau Ceti Review: ConjClasses.carrier.

Depends on: Definition 8.3.20 Definition 8.3.32 Definition 8.3.97

Lean code for Definition8.3.140●2 declarations
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def ConjClasses.carrier.{u} {α : Type u} [Monoid α] : ConjClasses α → Set α
    def ConjClasses.carrier.{u} {α : Type u}
      [Monoid α] : ConjClasses α → Set α
    Given a conjugacy class `a`, `carrier a` is the set it represents. 
  • theoremdefined in Mathlib/GroupTheory/GroupAction/Quotient.lean
    complete
    theorem ConjClasses.card_carrier.{u_1} {G : Type u_1} [Group G] [Fintype G]
      (g : G) [Fintype ↑(ConjClasses.mk g).carrier]
      [Fintype ↥(MulAction.stabilizer (ConjAct G) g)] :
      Fintype.card ↑(ConjClasses.mk g).carrier =
        Fintype.card G / Fintype.card ↥(MulAction.stabilizer (ConjAct G) g)
    theorem ConjClasses.card_carrier.{u_1}
      {G : Type u_1} [Group G] [Fintype G]
      (g : G)
      [Fintype ↑(ConjClasses.mk g).carrier]
      [Fintype
          ↥(MulAction.stabilizer (ConjAct G)
              g)] :
      Fintype.card
          ↑(ConjClasses.mk g).carrier =
        Fintype.card G /
          Fintype.card
            ↥(MulAction.stabilizer (ConjAct G)
                g)
Definition8.3.141
uses 0
Used by 18
Reverse dependency previews
Preview
Definition 3.1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

The modular group is the group of 2\times2 matrices with integer coefficients and determinant 1; it is denoted by \mathrm{SL}(2,\mathbb{Z}) or \mathrm{SL}_2(\Z).

A standard set of generators for the modular group are the matrices:

S:=\begin{pmatrix}0&-1\\1&0\end{pmatrix}\quad\text{and}\quad T:=\begin{pmatrix}1&1\\0&1 \end{pmatrix}.

Tau Ceti Review: Matrix.SpecialLinearGroup, ModularGroup.S, ModularGroup.T, SpecialLinearGroup.SL2Z_generators.

Lean code for Definition8.3.141●4 declarations
  • defdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    def Matrix.SpecialLinearGroup.{u, v} (n : Type u) [DecidableEq n]
      [Fintype n] (R : Type v) [CommRing R] : Type (max 0 u v)
    def Matrix.SpecialLinearGroup.{u, v}
      (n : Type u) [DecidableEq n] [Fintype n]
      (R : Type v) [CommRing R] :
      Type (max 0 u v)
    `SpecialLinearGroup n R` is the group of `n` by `n` `R`-matrices with determinant equal to 1.
    
  • defdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    def ModularGroup.S : Matrix.SpecialLinearGroup (Fin 2) ℤ
    def ModularGroup.S :
      Matrix.SpecialLinearGroup (Fin 2) ℤ
    The matrix `S = [[0, -1], [1, 0]]` as an element of `SL(2, ℤ)`.
    
    This element acts naturally on the Euclidean plane as a rotation about the origin by `π / 2`.
    
    This element also acts naturally on the hyperbolic plane as rotation about `i` by `π`. It
    represents the Mobiüs transformation `z ↦ -1/z` and is an involutive elliptic isometry. 
  • defdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    def ModularGroup.T : Matrix.SpecialLinearGroup (Fin 2) ℤ
    def ModularGroup.T :
      Matrix.SpecialLinearGroup (Fin 2) ℤ
    The matrix `T = [[1, 1], [0, 1]]` as an element of `SL(2, ℤ)`. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/FixedDetMatrices.lean
    complete
    theorem SpecialLinearGroup.SL2Z_generators :
      Subgroup.closure {ModularGroup.S, ModularGroup.T} = ⊤
    theorem SpecialLinearGroup.SL2Z_generators :
      Subgroup.closure
          {ModularGroup.S, ModularGroup.T} =
        ⊤
    `SL(2, ℤ)` is generated by `S` and `T`. 
Definition8.3.142
uses 1used by 0✓L∃∀N

Fundamental domain of \SL(2,\Z). (LMFDB)

Let \mathfrak{F} be the following set:

\mathfrak{F}=\{z\in\mathcal{H} : |z|\geq1 \text{ and } |\Re(z)|\leq1/2\}\cup\{\infty\}.

Then \mathfrak{F} is a fundamental domain for the action of \Gamma on \mathcal{H}.

Tau Ceti Review: ModularGroup.fd.

Depends on: Definition 8.3.55

Lean code for Definition8.3.142●4 declarations
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/ModularCurve/FundamentalDomain.lean
    complete
    theorem ModularGroup.isFundamentalDomain_fd :
      ModularGroup.IsFundamentalDomain ⊤
        (UpperHalfPlane.Completed.ofUpperHalfPlane '' ModularGroup.fd ∪
          {UpperHalfPlane.Completed.cusp OnePoint.infty})
    theorem ModularGroup.isFundamentalDomain_fd :
      ModularGroup.IsFundamentalDomain ⊤
        (UpperHalfPlane.Completed.ofUpperHalfPlane ''
            ModularGroup.fd ∪
          {UpperHalfPlane.Completed.cusp
              OnePoint.infty})
    **The standard domain `𝒟`, together with the cusp `∞`, is a fundamental domain for
    `SL(2, ℤ)`**: every point of `ℍ` can be moved into `𝒟`, and an element of `SL(2, ℤ)` moving a point
    of the interior `𝒟ᵒ` into `𝒟` is `±1`. 
  • defdefined in Mathlib/NumberTheory/Modular.lean
    complete
    def ModularGroup.fd : Set UpperHalfPlane
    def ModularGroup.fd : Set UpperHalfPlane
    The standard (closed) fundamental domain of the action of `SL(2,ℤ)` on `ℍ`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/ModularCurve/FundamentalDomain.lean
    complete
    structure ModularGroup.IsFundamentalDomain
      (G : Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ))
      (F : Set UpperHalfPlane.Completed) : Prop
    structure ModularGroup.IsFundamentalDomain
      (G :
        Subgroup
          (Matrix.SpecialLinearGroup (Fin 2)
            ℤ))
      (F : Set UpperHalfPlane.Completed) :
      Prop
    A set `F ⊆ ℍ* = ℍ ∪ ℚ ∪ {∞}` is a **fundamental domain** for a subgroup `G` of `SL(2, ℤ)`
    (LMFDB `group.fuchsian.fundamental_domain`) if it is closed in the completed upper half-plane
    `ℍ*`, every point of `ℍ` is moved into `F` by an element of `G`, and two distinct points of `F` that
    are `G`-equivalent both lie on the boundary of `F`
    (`ModularGroup.IsFundamentalDomain.mem_frontier` and
    `ModularGroup.IsFundamentalDomain.smul_mem_frontier`). 
    isClosed : IsClosed F
    A fundamental domain is closed. 
    exists_smul_mem : ∀ (z : UpperHalfPlane), ∃ g ∈ G, g • UpperHalfPlane.Completed.ofUpperHalfPlane z ∈ F
    Every point of `ℍ` is `G`-equivalent to a point of a fundamental domain. 
    mem_frontier : ∀ {z : UpperHalfPlane.Completed} {g : Matrix.SpecialLinearGroup (Fin 2) ℤ},
      z ∈ F → g ∈ G → g • z ∈ F → g • z ≠ z → z ∈ frontier F
    A point of a fundamental domain that is `G`-equivalent to another point of it lies on its
    boundary. 
  • inductive(2 constructors)defined in LeanBridge/ForMathlib/Analysis/Complex/UpperHalfPlane/Completed.lean
    complete
    inductive UpperHalfPlane.Completed : Type
    inductive UpperHalfPlane.Completed : Type
    The **completed upper half-plane** `ℍ* = ℍ ∪ ℚ ∪ {∞}` (LMFDB `mf.upper_half_plane`): the points
    of the upper half-plane `ℍ` together with the cusps, the points of `ℚ ∪ {∞} = OnePoint ℚ`. Its
    topology (`hasBasis_nhds_infty`, `hasBasis_nhds_ratCast`, `isOpenEmbedding_ofUpperHalfPlane`) and
    its action of `SL₂(ℤ)` (`smul_ofUpperHalfPlane`, `smul_cusp`) are those of the LMFDB. 
    UpperHalfPlane.Completed.ofUpperHalfPlane
      (z : UpperHalfPlane) : UpperHalfPlane.Completed
    A point of the upper half-plane. 
    UpperHalfPlane.Completed.cusp (c : OnePoint ℚ) :
      UpperHalfPlane.Completed
    A cusp: a rational number or `∞`. 
Definition8.3.143
Statement uses 3
Statement dependency previews
Preview
Definition 1.2.51
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Genus of a subgroup of the modular group. (LMFDB)

The genus of a finite index subgroup G of the modular group is the genus of the corresponding compact Riemann surface arising from the compactification of G\backslash\mathcal{H}, which is obtained by adjoining the cusps of G.

Here \mathcal{H} denotes the complex upper halfplane on which G acts by linear fractional transformations, and G\backslash \mathcal{H} denotes the quotient of \mathcal{H} by this action (points of G\backslash\mathcal{H} correspond to G-orbits in \mathcal{H}).

Depends on: Definition 1.2.51 Definition 8.3.53 Definition 8.3.141

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

The group \Gamma_0(N) is the subgroup of \textrm{SL}(2,\mathbb{Z}) that consists of matrices whose lower-left entry is 0 modulo N. That is,

\Gamma_0(N) = \left\lbrace \left .\begin{pmatrix} a & b \\ c & d \end{pmatrix}\in \textrm{SL}(2,\mathbb{Z})\ \right|\ c\equiv 0 \bmod N \right\rbrace.

Tau Ceti Review: CongruenceSubgroup.Gamma0, CongruenceSubgroup.Gamma0_mem.

Lean code for Definition8.3.144●2 declarations
  • defdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    def CongruenceSubgroup.Gamma0 (N : ℕ) :
      Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    def CongruenceSubgroup.Gamma0 (N : ℕ) :
      Subgroup
        (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    The congruence subgroup of `SL(2, ℤ)` of matrices whose lower left-hand entry reduces to zero
    modulo `N`. 
  • theoremdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    theorem CongruenceSubgroup.Gamma0_mem {N : ℕ}
      {A : Matrix.SpecialLinearGroup (Fin 2) ℤ} :
      A ∈ CongruenceSubgroup.Gamma0 N ↔ ↑(↑A 1 0) = 0
    theorem CongruenceSubgroup.Gamma0_mem {N : ℕ}
      {A :
        Matrix.SpecialLinearGroup (Fin 2) ℤ} :
      A ∈ CongruenceSubgroup.Gamma0 N ↔
        ↑(↑A 1 0) = 0
Definition8.3.145
uses 0used by 1✓L∃∀N

The group \Gamma_1(N) is the subgroup of \textrm{SL}(2,\mathbb{Z}) defined by the congruences:

\Gamma_1(N) = \left\lbrace \left .\begin{pmatrix} a & b \\ c & d \end{pmatrix}\in \textrm{SL}(2,\mathbb{Z})\ \right| \ c\equiv 0,\ a \equiv d\equiv 1 \bmod N \right\rbrace.

Tau Ceti Review: CongruenceSubgroup.Gamma1, CongruenceSubgroup.Gamma1_mem.

Lean code for Definition8.3.145●2 declarations
  • defdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    def CongruenceSubgroup.Gamma1 (N : ℕ) :
      Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    def CongruenceSubgroup.Gamma1 (N : ℕ) :
      Subgroup
        (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    The congruence subgroup `Gamma1` of `SL(2, ℤ)` consisting of matrices
    whose bottom row is congruent to `(0,1)` modulo `N`. 
  • theoremdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    theorem CongruenceSubgroup.Gamma1_mem (N : ℕ)
      (A : Matrix.SpecialLinearGroup (Fin 2) ℤ) :
      A ∈ CongruenceSubgroup.Gamma1 N ↔
        ↑(↑A 0 0) = 1 ∧ ↑(↑A 1 1) = 1 ∧ ↑(↑A 1 0) = 0
    theorem CongruenceSubgroup.Gamma1_mem (N : ℕ)
      (A :
        Matrix.SpecialLinearGroup (Fin 2) ℤ) :
      A ∈ CongruenceSubgroup.Gamma1 N ↔
        ↑(↑A 0 0) = 1 ∧
          ↑(↑A 1 1) = 1 ∧ ↑(↑A 1 0) = 0
Definition8.3.146
uses 1used by 1✓L∃∀N

The group \Gamma(N) is the subgroup of \SL(2,\mathbb{Z}) that consists of matrices congruent to the identity matrix modulo N. That is,

\Gamma(N)=\left\{ \begin{pmatrix} a&b\\ c&d \end{pmatrix}\in\textrm{SL}(2,\mathbb{Z})\ \Bigg|\ \begin{pmatrix} a & b \\ c & d \end{pmatrix}\equiv \begin{pmatrix} 1&0\\ 0&1 \end{pmatrix} \bmod N \right\} .

Tau Ceti Review: CongruenceSubgroup.Gamma, CongruenceSubgroup.Gamma_mem.

Depends on: Definition 8.3.141

Lean code for Definition8.3.146●2 declarations
  • defdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    def CongruenceSubgroup.Gamma (N : ℕ) :
      Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    def CongruenceSubgroup.Gamma (N : ℕ) :
      Subgroup
        (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    The full level `N` congruence subgroup of `SL(2, ℤ)` of matrices that reduce to the identity
    modulo `N`. 
  • theoremdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    theorem CongruenceSubgroup.Gamma_mem {N : ℕ}
      {γ : Matrix.SpecialLinearGroup (Fin 2) ℤ} :
      γ ∈ CongruenceSubgroup.Gamma N ↔
        ↑(↑γ 0 0) = 1 ∧ ↑(↑γ 0 1) = 0 ∧ ↑(↑γ 1 0) = 0 ∧ ↑(↑γ 1 1) = 1
    theorem CongruenceSubgroup.Gamma_mem {N : ℕ}
      {γ :
        Matrix.SpecialLinearGroup (Fin 2) ℤ} :
      γ ∈ CongruenceSubgroup.Gamma N ↔
        ↑(↑γ 0 0) = 1 ∧
          ↑(↑γ 0 1) = 0 ∧
            ↑(↑γ 1 0) = 0 ∧ ↑(↑γ 1 1) = 1
Definition8.3.147
uses 0
Used by 5
Reverse dependency previews
Preview
Definition 4.6.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Labels for the small group database in GAP and Magma. (LMFDB)

The computer algebra systems GAP and Magma both include a database of small groups that includes all groups of order up to 2000, except for groups of order 1024. Groups in this database are identified by an ordered pair [n,d] where n is the order of the group and d is a positive integer that distinguishes the group from others of the same order (the value of d is the same in both GAP and Magma).

In both systems, the command "SmallGroup(n,d)" will return an explicit representation of the group in terms of generators and relations.

Magma also associates a descriptive name to each small group. For example, the command "GroupName(SmallGroup(24,3))" returns the string "SL(2,3)".

Definition8.3.148
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Socle of a group. (LMFDB)

If G is a group, the socle of G, denoted \mathrm{soc}(G), is the subgroup generated by all of the minimal normal subgroups of G.

That is, it is the join of subgroups N which are normal in G such that N\neq \langle e \rangle and if H is a normal subgroup of G with H\subseteq N, then H=N or H=\langle e \rangle. If there are no such subgroups N, then the socle of G is defined to be \langle e\rangle.

If G is a finite solvable group, then \mathrm{soc}(G) is isomorphic to a product of some number of cyclic groups of prime order.

Depends on: Definition 8.3.3 Definition 8.3.37 Definition 8.3.97 Definition 8.3.149 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.148●5 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Socle.lean
    complete
    def Subgroup.socle.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.socle.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The **socle** `soc(G)` of a group `G` (LMFDB `group.socle`): the subgroup generated by the
    minimal normal subgroups of `G` (`Subgroup.IsMinimalNormal`). It is `⊥` when there are none. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Socle.lean
    complete
    theorem Subgroup.le_socle.{u_1} {G : Type u_1} [Group G] {N : Subgroup G}
      (hN : N.IsMinimalNormal) : N ≤ Subgroup.socle G
    theorem Subgroup.le_socle.{u_1} {G : Type u_1}
      [Group G] {N : Subgroup G}
      (hN : N.IsMinimalNormal) :
      N ≤ Subgroup.socle G
  • defdefined in LeanBridge/ForMathlib/GroupTheory/MinimalNormal.lean
    complete
    def Subgroup.IsMinimalNormal.{u_1} {G : Type u_1} [Group G]
      (K : Subgroup G) : Prop
    def Subgroup.IsMinimalNormal.{u_1}
      {G : Type u_1} [Group G]
      (K : Subgroup G) : Prop
    A subgroup `K` of `G` is a **minimal normal subgroup** (LMFDB `group.minimal_normal`) if it is
    a minimal element among the nontrivial normal subgroups of `G`. The LMFDB's wording does not
    exclude `K = 1`, but minimal normal subgroups are nontrivial by the standard convention, which we
    follow. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/MinimalNormal.lean
    complete
    theorem Subgroup.isMinimalNormal_iff.{u_1} {G : Type u_1} [Group G]
      (K : Subgroup G) :
      K.IsMinimalNormal ↔
        K.Normal ∧
          K ≠ ⊥ ∧ ∀ (H : Subgroup G), H.Normal → H ≤ K → H = ⊥ ∨ H = K
    theorem Subgroup.isMinimalNormal_iff.{u_1}
      {G : Type u_1} [Group G]
      (K : Subgroup G) :
      K.IsMinimalNormal ↔
        K.Normal ∧
          K ≠ ⊥ ∧
            ∀ (H : Subgroup G),
              H.Normal → H ≤ K → H = ⊥ ∨ H = K
    The characterisation of minimal normal subgroups in LMFDB `group.minimal_normal`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SocleSolvable.lean
    complete
    theorem Subgroup.exists_mulEquiv_pi_zmod_prime_socle.{u_1} {G : Type u_1}
      [Group G] [Finite G] [Group.IsSolvable G] :
      ∃ ι x p,
        (∀ (i : ι), Nat.Prime (p i)) ∧
          Nonempty
            (↥(Subgroup.socle G) ≃* ((i : ι) → Multiplicative (ZMod (p i))))
    theorem Subgroup.exists_mulEquiv_pi_zmod_prime_socle.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      [Group.IsSolvable G] :
      ∃ ι x p,
        (∀ (i : ι), Nat.Prime (p i)) ∧
          Nonempty
            (↥(Subgroup.socle G) ≃*
              ((i : ι) →
                Multiplicative (ZMod (p i))))
    **The socle of a finite solvable group is a product of cyclic groups of prime order** (LMFDB
    `group.socle`): it is abelian, of exponent dividing the squarefree radical of `|G|`, so the
    prime-power orders of the factors of its primary decomposition are primes. 
Definition8.3.149
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 15
Reverse dependency previews
Preview
Definition 6.3.29
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Solvable group. (LMFDB)

A group G is solvable if there exists a chain of subgroups

\langle e\rangle =H_0\leq H_1 \leq H_2 \leq \cdots \leq H_n=G

such that for all i< n, H_i is a normal subgroup of H_{i+1} (i.e., it is a subnormal series) and each quotient H_{i+1}/H_i is abelian.

Tau Ceti Review: Group.IsSolvable, IsMulCommutative.

Depends on: Definition 8.3.3 Definition 8.3.5 Definition 8.3.95

Lean code for Definition8.3.149●5 declarations
  • class(1 method)defined in Mathlib/GroupTheory/Solvable.lean
    complete
    class Group.IsSolvable.{u_1} (G : Type u_1) [Group G] : Prop
    class Group.IsSolvable.{u_1} (G : Type u_1)
      [Group G] : Prop
    A group `G` is solvable if its derived series is eventually trivial. We use this definition
    because it's the most convenient one to work with. 
    solvable : ∃ n, derivedSeries G n = ⊥
    A group `G` is solvable if its derived series is eventually trivial. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SolvableSeries.lean
    complete
    theorem Group.isSolvable_iff_exists_subnormalSeries.{u_1} {G : Type u_1}
      [Group G] :
      Group.IsSolvable G ↔
        ∃ s, ∀ (i : Fin s.length), IsMulCommutative (s.factor i)
    theorem Group.isSolvable_iff_exists_subnormalSeries.{u_1}
      {G : Type u_1} [Group G] :
      Group.IsSolvable G ↔
        ∃ s,
          ∀ (i : Fin s.length),
            IsMulCommutative (s.factor i)
    **A group is solvable if and only if it has a subnormal series with abelian factors**
    (LMFDB `group.solvable`): a chain `⊥ = H₀ ⊴ H₁ ⊴ ⋯ ⊴ Hₙ = ⊤`, each `Hᵢ` normal in `Hᵢ₊₁`, with
    every quotient `Hᵢ₊₁ / Hᵢ` abelian. 
  • structure(extends 1, 5 fields)defined in LeanBridge/ForMathlib/GroupTheory/SubnormalSeries.lean
    complete
    structure Subgroup.SubnormalSeries.{u_1} (G : Type u_1) [Group G] : Type u_1
    structure Subgroup.SubnormalSeries.{u_1}
      (G : Type u_1) [Group G] : Type u_1
    A **subnormal series** of `G` (LMFDB `group.normal_series`): a chain of subgroups
    `⊥ = H₀ ⊴ H₁ ⊴ ⋯ ⊴ Hₖ = ⊤` in which each `Hᵢ` is contained and normal in `Hᵢ₊₁`. 
    • RelSeries {p | p.1 ≤ p.2 ∧ (p.1.subgroupOf p.2).Normal}
    length : ℕ
    Inherited from
    1. RelSeries
    toFun : Fin (self.length + 1) → Subgroup G
    Inherited from
    1. RelSeries
    step : ∀ (i : Fin self.length), (self.toFun i.castSucc, self.toFun i.succ) ∈ {p | p.1 ≤ p.2 ∧ (p.1.subgroupOf p.2).Normal}
    Inherited from
    1. RelSeries
    head_eq_bot : self.head = ⊥
    A subnormal series starts at the trivial subgroup. 
    last_eq_top : self.last = ⊤
    A subnormal series ends at the whole group. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/ChiefSeries.lean
    complete
    abbrev Subgroup.SubnormalSeries.factor.{u_1} {G : Type u_1} [Group G]
      (s : Subgroup.SubnormalSeries G) (i : Fin s.length) : Type u_1
    abbrev Subgroup.SubnormalSeries.factor.{u_1}
      {G : Type u_1} [Group G]
      (s : Subgroup.SubnormalSeries G)
      (i : Fin s.length) : Type u_1
    The `i`-th **factor group** `Hᵢ₊₁ / Hᵢ` of a subnormal series `(Hᵢ)` of `G`. 
  • class(1 method)defined in Mathlib/Algebra/Group/Semigroup.lean
    complete
    class IsMulCommutative.{u_2} (M : Type u_2) [Mul M] : Prop
    class IsMulCommutative.{u_2} (M : Type u_2)
      [Mul M] : Prop
    A Prop stating that the multiplication is commutative. 
    is_comm : Std.Commutative fun x1 x2 => x1 * x2
Definition8.3.150
uses 0
Used by 13
Reverse dependency previews
Preview
Definition 3.5.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Symplectic group. (LMFDB)

The real symplectic group of degree g denoted by \Sp(2g,\R) is defined as

\Sp(2g,\R) =\left\{ \gamma=\left(\begin{matrix} a & b\\ c & d\end{matrix}\right)\in\GL(2g,\R): \, \gamma^t J \gamma=J\right\},

where J=\left(\begin{matrix}0 & 1_g\\ -1_g & 0\end{matrix}\right) with 1_g is the identity matrix of size g.

By using the following two properties of the Pfaffian: \text{Pf}(\gamma^t J \gamma)=\text{Pf}(J) and \text{Pf}(\gamma^t J \gamma)=\det(\gamma)\text{Pf}(J), we see that \Sp(2g,\R) is a subgroup of \SL(2g,\R).

The integral symplectic group \Gamma_g=\Sp(2g,\Z), also called the Siegel modular group, is defined as \Gamma_g=\Sp(2g,\R)\cap{\rm M}(2g,\Z). Clearly \Gamma_1=\SL(2,\Z).

Tau Ceti Review: Matrix.symplecticGroup, SymplecticGroup.det_eq_one.

Lean code for Definition8.3.150●6 declarations
  • defdefined in Mathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.symplecticGroup.{u_1, u_2} (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R] [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    def Matrix.symplecticGroup.{u_1, u_2}
      (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R]
      [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    The group of symplectic matrices over a ring `R`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/Pfaffian.lean
    complete
    theorem Matrix.map_mem_symplecticGroup_iff.{u_1, u_2, u_3} {l : Type u_1}
      {R : Type u_2} [Fintype l] [DecidableEq l] [CommRing R]
      {A : Matrix (l ⊕ l) (l ⊕ l) R} {S : Type u_3} [CommRing S]
      {f : R →+* S} (hf : Function.Injective ⇑f) :
      A.map ⇑f ∈ Matrix.symplecticGroup l S ↔ A ∈ Matrix.symplecticGroup l R
    theorem Matrix.map_mem_symplecticGroup_iff.{u_1,
        u_2, u_3}
      {l : Type u_1} {R : Type u_2}
      [Fintype l] [DecidableEq l] [CommRing R]
      {A : Matrix (l ⊕ l) (l ⊕ l) R}
      {S : Type u_3} [CommRing S]
      {f : R →+* S}
      (hf : Function.Injective ⇑f) :
      A.map ⇑f ∈ Matrix.symplecticGroup l S ↔
        A ∈ Matrix.symplecticGroup l R
    **An injective ring homomorphism reflects symplectic matrices** (LMFDB `group.sp2gr`): `A` is
    symplectic exactly when its image under an injective `f : R →+* S` is. For `f : ℤ → ℝ`, this says
    that the integral symplectic group `Sp(2g, ℤ) = symplecticGroup l ℤ` is `Sp(2g, ℝ) ∩ M(2g, ℤ)`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/Pfaffian.lean
    complete
    def Matrix.pfaffian.{u_1, u_2} {l : Type u_1} {R : Type u_2} [Fintype l]
      [DecidableEq l] [CommRing R] (A : Matrix (l ⊕ l) (l ⊕ l) R)
      [Algebra ℚ R] : R
    def Matrix.pfaffian.{u_1, u_2} {l : Type u_1}
      {R : Type u_2} [Fintype l]
      [DecidableEq l] [CommRing R]
      (A : Matrix (l ⊕ l) (l ⊕ l) R)
      [Algebra ℚ R] : R
    The **Pfaffian** of a square matrix `A` indexed by `l ⊕ l`, over a `ℚ`-algebra, for the
    pairing of `inl i` with `inr i`: `Pf(A) = (2ᵍ g!)⁻¹ ∑ σ, sign σ ∏ i, A (σ (inl i)) (σ (inr i))`,
    where `g` is the cardinality of `l` and `σ` runs over the permutations of `l ⊕ l`. For an
    alternating matrix it is the classical `(2ᵍ g!)⁻¹ ∑_{σ ∈ S_{2g}} sign σ ∏ i, A_{σ(2i-1), σ(2i)}`
    for the ordering `inl i₁, inr i₁, inl i₂, inr i₂, …` of `l ⊕ l`; another ordering changes its sign
    only. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/Pfaffian.lean
    complete
    theorem Matrix.pfaffian_transpose_mul_mul.{u_1, u_2} {l : Type u_1}
      {R : Type u_2} [Fintype l] [DecidableEq l] [CommRing R]
      (A B : Matrix (l ⊕ l) (l ⊕ l) R) [Algebra ℚ R] :
      (B.transpose * A * B).pfaffian = B.det * A.pfaffian
    theorem Matrix.pfaffian_transpose_mul_mul.{u_1,
        u_2}
      {l : Type u_1} {R : Type u_2}
      [Fintype l] [DecidableEq l] [CommRing R]
      (A B : Matrix (l ⊕ l) (l ⊕ l) R)
      [Algebra ℚ R] :
      (B.transpose * A * B).pfaffian =
        B.det * A.pfaffian
    **The Pfaffian transforms by the determinant** (LMFDB `group.sp2gr`):
    `Pf(Bᵀ A B) = det B · Pf(A)`. 
  • theoremdefined in Mathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    theorem SymplecticGroup.det_eq_one.{u_1, u_2} {l : Type u_1} {R : Type u_2}
      [DecidableEq l] [Fintype l] [CommRing R]
      {M : Matrix (l ⊕ l) (l ⊕ l) R} (hM : M ∈ Matrix.symplecticGroup l R) :
      M.det = 1
    theorem SymplecticGroup.det_eq_one.{u_1, u_2}
      {l : Type u_1} {R : Type u_2}
      [DecidableEq l] [Fintype l] [CommRing R]
      {M : Matrix (l ⊕ l) (l ⊕ l) R}
      (hM : M ∈ Matrix.symplecticGroup l R) :
      M.det = 1
    Symplectic matrices have determinant 1.
    
    The proof strategy comes in two steps:
    1. Consider a symplectic matrix `M` over a local ring, we can construct a matrix of the
    form `fromBlocks 1 X 0 1` s.t. the upper-left block of `(fromBlocks 1 X 0 1) * M` is invertible.
    From this we can calculate the determinant.
    
    2. For a symplectic matrix `M` over general commutative ring `R`, we note that by step 1,
    `M.det - 1 = 0` in any localization at a maximal ideal in `R`. Therefore `M.det = 1` in `R`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    def SymplecticGroup.toSL.{u_2} (R : Type u_2) [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    def SymplecticGroup.toSL.{u_2} (R : Type u_2)
      [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    The isomorphism `Sp(2, R) → SL(2, R)`, reindexing `Fin 1 ⊕ Fin 1` as `Fin 2`: symplectic
    matrices have determinant `1` (`SymplecticGroup.det_eq_one`), and it is bijective
    (`SymplecticGroup.toSL_injective`, `SymplecticGroup.toSL_surjective`), a `2 × 2` matrix of
    determinant `1` being symplectic. 
Definition8.3.151
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.144
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Subgroup \Gamma_0(N) of \Sp(2g,\Z). (LMFDB)

The group \Gamma_0(N) in degree g is the subgroup of the integral symplectic group \Sp(2g,\Z), defined by

\Gamma_0(N)=\left\{ \begin{pmatrix}a&b\\c&d\end{pmatrix}\in \Sp(2g,\Z) : c \equiv 0 \bmod N \right\}.

The group \Gamma_0(N) is sometimes called the Hecke congruence subgroup of level N.

For g=1, it is the subgroup \Gamma_0(N) of \SL(2,\Z).

Depends on: Definition 8.3.144 Definition 8.3.150

Lean code for Definition8.3.151●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/CongruenceSubgroups.lean
    complete
    def SymplecticGroup.Gamma0.{u_1} (l : Type u_1) [DecidableEq l] [Fintype l]
      (N : ℕ) : Subgroup ↥(Matrix.symplecticGroup l ℤ)
    def SymplecticGroup.Gamma0.{u_1}
      (l : Type u_1) [DecidableEq l]
      [Fintype l] (N : ℕ) :
      Subgroup ↥(Matrix.symplecticGroup l ℤ)
    The **Siegel parabolic subgroup** `Γ₀(N)` (LMFDB `group.sp2gr.gamma0`, `mf.siegel.family`) of
    `Sp(2g, ℤ)`, also called the Hecke congruence subgroup: the matrices `(a, b; c, d)` with
    `c ≡ 0 (mod N)`, the preimage of the Siegel parabolic subgroup of `Sp(2g, ℤ/Nℤ)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/CongruenceSubgroups.lean
    complete
    theorem SymplecticGroup.mem_Gamma0_iff.{u_1} {l : Type u_1} [DecidableEq l]
      [Fintype l] {N : ℕ} {A : ↥(Matrix.symplecticGroup l ℤ)} :
      A ∈ SymplecticGroup.Gamma0 l N ↔
        ∀ (i j : l), ↑N ∣ ↑A (Sum.inr i) (Sum.inl j)
    theorem SymplecticGroup.mem_Gamma0_iff.{u_1}
      {l : Type u_1} [DecidableEq l]
      [Fintype l] {N : ℕ}
      {A : ↥(Matrix.symplecticGroup l ℤ)} :
      A ∈ SymplecticGroup.Gamma0 l N ↔
        ∀ (i j : l),
          ↑N ∣ ↑A (Sum.inr i) (Sum.inl j)
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    def SymplecticGroup.toSL.{u_2} (R : Type u_2) [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    def SymplecticGroup.toSL.{u_2} (R : Type u_2)
      [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    The isomorphism `Sp(2, R) → SL(2, R)`, reindexing `Fin 1 ⊕ Fin 1` as `Fin 2`: symplectic
    matrices have determinant `1` (`SymplecticGroup.det_eq_one`), and it is bijective
    (`SymplecticGroup.toSL_injective`, `SymplecticGroup.toSL_surjective`), a `2 × 2` matrix of
    determinant `1` being symplectic. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GenusOneCongruence.lean
    complete
    theorem SymplecticGroup.Gamma0_fin_one (N : ℕ) :
      SymplecticGroup.Gamma0 (Fin 1) N =
        Subgroup.comap (SymplecticGroup.toSL ℤ)
          (CongruenceSubgroup.Gamma0 N)
    theorem SymplecticGroup.Gamma0_fin_one (N : ℕ) :
      SymplecticGroup.Gamma0 (Fin 1) N =
        Subgroup.comap
          (SymplecticGroup.toSL ℤ)
          (CongruenceSubgroup.Gamma0 N)
    **For `g = 1`, `Γ₀(N)` is the subgroup `Γ₀(N)` of `SL(2, ℤ)`** (LMFDB `group.sp2gr.gamma0`,
    Mathlib's `CongruenceSubgroup.Gamma0`): it is its preimage under the isomorphism
    `Sp(2, ℤ) → SL(2, ℤ)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GenusOneCongruence.lean
    complete
    theorem SymplecticGroup.map_toSL_Gamma0 (N : ℕ) :
      Subgroup.map (SymplecticGroup.toSL ℤ)
          (SymplecticGroup.Gamma0 (Fin 1) N) =
        CongruenceSubgroup.Gamma0 N
    theorem SymplecticGroup.map_toSL_Gamma0 (N : ℕ) :
      Subgroup.map (SymplecticGroup.toSL ℤ)
          (SymplecticGroup.Gamma0 (Fin 1) N) =
        CongruenceSubgroup.Gamma0 N
    **For `g = 1`, the isomorphism `Sp(2, ℤ) → SL(2, ℤ)` maps `Γ₀(N)` onto the subgroup `Γ₀(N)` of
    `SL(2, ℤ)`** (LMFDB `group.sp2gr.gamma0`, Mathlib's `CongruenceSubgroup.Gamma0`). 
Definition8.3.152
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.145
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Subgroup Gamma1(N) of \Sp(2g,\Z). (LMFDB)

The subgroup \Gamma_1(N) of the integral symplectic group \Sp(2g,\Z) is defined by:

\Gamma_1(N)= \left\{ \begin{pmatrix} a & b \\ c & d \end{pmatrix}\in \Sp(2g,\Z)\ \vert \begin{pmatrix} a & b \\ c & d \end{pmatrix}\equiv \begin{pmatrix} 1_g & * \\ 0 & 1_g \end{pmatrix} \bmod N \right\}.

For g=1, it is the subgroup \Gamma_1(N) of \SL(2,\Z).

Tau Ceti Review: CongruenceSubgroup.Gamma1.

Depends on: Definition 8.3.145 Definition 8.3.150

Lean code for Definition8.3.152●6 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    def SymplecticGroup.Gamma1.{u_1} (l : Type u_1) [DecidableEq l] [Fintype l]
      (N : ℕ) : Subgroup ↥(Matrix.symplecticGroup l ℤ)
    def SymplecticGroup.Gamma1.{u_1}
      (l : Type u_1) [DecidableEq l]
      [Fintype l] (N : ℕ) :
      Subgroup ↥(Matrix.symplecticGroup l ℤ)
    The **congruence subgroup `Γ₁(N)`** (LMFDB `group.sp2gr.gamma1`) of `Sp(2g, ℤ)`: the matrices
    `(a, b; c, d)` congruent to `(1_g, *; 0, 1_g)` modulo `N`, that is, with `a ≡ d ≡ 1_g` and
    `c ≡ 0 (mod N)`; the preimage of the subgroup of the `(1, b; 0, 1)` of `Sp(2g, ℤ/Nℤ)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    theorem SymplecticGroup.mem_Gamma1_iff.{u_1} {l : Type u_1} [DecidableEq l]
      [Fintype l] {N : ℕ} {A : ↥(Matrix.symplecticGroup l ℤ)} :
      A ∈ SymplecticGroup.Gamma1 l N ↔
        (↑A).toBlocks₁₁.map Int.cast = 1 ∧
          (↑A).toBlocks₂₁.map Int.cast = 0 ∧
            (↑A).toBlocks₂₂.map Int.cast = 1
    theorem SymplecticGroup.mem_Gamma1_iff.{u_1}
      {l : Type u_1} [DecidableEq l]
      [Fintype l] {N : ℕ}
      {A : ↥(Matrix.symplecticGroup l ℤ)} :
      A ∈ SymplecticGroup.Gamma1 l N ↔
        (↑A).toBlocks₁₁.map Int.cast = 1 ∧
          (↑A).toBlocks₂₁.map Int.cast = 0 ∧
            (↑A).toBlocks₂₂.map Int.cast = 1
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    def SymplecticGroup.toSL.{u_2} (R : Type u_2) [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    def SymplecticGroup.toSL.{u_2} (R : Type u_2)
      [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    The isomorphism `Sp(2, R) → SL(2, R)`, reindexing `Fin 1 ⊕ Fin 1` as `Fin 2`: symplectic
    matrices have determinant `1` (`SymplecticGroup.det_eq_one`), and it is bijective
    (`SymplecticGroup.toSL_injective`, `SymplecticGroup.toSL_surjective`), a `2 × 2` matrix of
    determinant `1` being symplectic. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    theorem SymplecticGroup.Gamma1_fin_one (N : ℕ) :
      SymplecticGroup.Gamma1 (Fin 1) N =
        Subgroup.comap (SymplecticGroup.toSL ℤ)
          (CongruenceSubgroup.Gamma1 N)
    theorem SymplecticGroup.Gamma1_fin_one (N : ℕ) :
      SymplecticGroup.Gamma1 (Fin 1) N =
        Subgroup.comap
          (SymplecticGroup.toSL ℤ)
          (CongruenceSubgroup.Gamma1 N)
    **For `g = 1`, `Γ₁(N)` is the subgroup `Γ₁(N)` of `SL(2, ℤ)`** (Mathlib's
    `CongruenceSubgroup.Gamma1`): it is its preimage under the isomorphism `Sp(2, ℤ) → SL(2, ℤ)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    theorem SymplecticGroup.map_toSL_Gamma1 (N : ℕ) :
      Subgroup.map (SymplecticGroup.toSL ℤ)
          (SymplecticGroup.Gamma1 (Fin 1) N) =
        CongruenceSubgroup.Gamma1 N
    theorem SymplecticGroup.map_toSL_Gamma1 (N : ℕ) :
      Subgroup.map (SymplecticGroup.toSL ℤ)
          (SymplecticGroup.Gamma1 (Fin 1) N) =
        CongruenceSubgroup.Gamma1 N
    **For `g = 1`, the isomorphism `Sp(2, ℤ) → SL(2, ℤ)` maps `Γ₁(N)` onto the subgroup `Γ₁(N)`
    of `SL(2, ℤ)`** (Mathlib's `CongruenceSubgroup.Gamma1`). 
  • defdefined in Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean
    complete
    def CongruenceSubgroup.Gamma1 (N : ℕ) :
      Subgroup (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    def CongruenceSubgroup.Gamma1 (N : ℕ) :
      Subgroup
        (Matrix.SpecialLinearGroup (Fin 2) ℤ)
    The congruence subgroup `Gamma1` of `SL(2, ℤ)` consisting of matrices
    whose bottom row is congruent to `(0,1)` modulo `N`. 
Definition8.3.153
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.146
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Subgroup \Gamma(N) of \Sp(2g,\Z). (LMFDB)

The principal congruence subgroup of level N, \Gamma(N), of the integral symplectic group \Sp(2g,\Z) is the subgroup of \Sp(2g,\Z) that consists of matrices congruent to the identity matrix modulo N:

\Gamma(N)=\left\{ \begin{pmatrix}a&b\\c&d\end{pmatrix}\in \Sp(2g,{\Z}) : \begin{pmatrix}a&b\\c&d\end{pmatrix} \equiv \begin{pmatrix}1_g&0\\0&1_g\end{pmatrix} \bmod N \right\}

where 1_g stands for the identity matrix of size g. For g=1, it is the subgroup \Gamma(N) of \SL(2,\Z).

Depends on: Definition 8.3.146 Definition 8.3.150

Lean code for Definition8.3.153●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/CongruenceSubgroups.lean
    complete
    def SymplecticGroup.Gamma.{u_1} (l : Type u_1) [DecidableEq l] [Fintype l]
      (N : ℕ) : Subgroup ↥(Matrix.symplecticGroup l ℤ)
    def SymplecticGroup.Gamma.{u_1} (l : Type u_1)
      [DecidableEq l] [Fintype l] (N : ℕ) :
      Subgroup ↥(Matrix.symplecticGroup l ℤ)
    The **principal congruence subgroup** `Γ(N)` (LMFDB `group.sp2gr.ppal.congruence`,
    `mf.siegel.family`) of `Sp(2g, ℤ)`: the symplectic integral matrices congruent to the identity
    modulo `N`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/CongruenceSubgroups.lean
    complete
    theorem SymplecticGroup.mem_Gamma_iff.{u_1} {l : Type u_1} [DecidableEq l]
      [Fintype l] {N : ℕ} {A : ↥(Matrix.symplecticGroup l ℤ)} :
      A ∈ SymplecticGroup.Gamma l N ↔ (↑A).map Int.cast = 1
    theorem SymplecticGroup.mem_Gamma_iff.{u_1}
      {l : Type u_1} [DecidableEq l]
      [Fintype l] {N : ℕ}
      {A : ↥(Matrix.symplecticGroup l ℤ)} :
      A ∈ SymplecticGroup.Gamma l N ↔
        (↑A).map Int.cast = 1
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GammaOne.lean
    complete
    def SymplecticGroup.toSL.{u_2} (R : Type u_2) [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    def SymplecticGroup.toSL.{u_2} (R : Type u_2)
      [CommRing R] :
      ↥(Matrix.symplecticGroup (Fin 1) R) →*
        Matrix.SpecialLinearGroup (Fin 2) R
    The isomorphism `Sp(2, R) → SL(2, R)`, reindexing `Fin 1 ⊕ Fin 1` as `Fin 2`: symplectic
    matrices have determinant `1` (`SymplecticGroup.det_eq_one`), and it is bijective
    (`SymplecticGroup.toSL_injective`, `SymplecticGroup.toSL_surjective`), a `2 × 2` matrix of
    determinant `1` being symplectic. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GenusOneCongruence.lean
    complete
    theorem SymplecticGroup.Gamma_fin_one (N : ℕ) :
      SymplecticGroup.Gamma (Fin 1) N =
        Subgroup.comap (SymplecticGroup.toSL ℤ) (CongruenceSubgroup.Gamma N)
    theorem SymplecticGroup.Gamma_fin_one (N : ℕ) :
      SymplecticGroup.Gamma (Fin 1) N =
        Subgroup.comap
          (SymplecticGroup.toSL ℤ)
          (CongruenceSubgroup.Gamma N)
    **For `g = 1`, `Γ(N)` is the subgroup `Γ(N)` of `SL(2, ℤ)`** (LMFDB
    `group.sp2gr.ppal.congruence`, Mathlib's `CongruenceSubgroup.Gamma`): it is its preimage under the
    isomorphism `Sp(2, ℤ) → SL(2, ℤ)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/GenusOneCongruence.lean
    complete
    theorem SymplecticGroup.map_toSL_Gamma (N : ℕ) :
      Subgroup.map (SymplecticGroup.toSL ℤ)
          (SymplecticGroup.Gamma (Fin 1) N) =
        CongruenceSubgroup.Gamma N
    theorem SymplecticGroup.map_toSL_Gamma (N : ℕ) :
      Subgroup.map (SymplecticGroup.toSL ℤ)
          (SymplecticGroup.Gamma (Fin 1) N) =
        CongruenceSubgroup.Gamma N
    **For `g = 1`, the isomorphism `Sp(2, ℤ) → SL(2, ℤ)` maps `Γ(N)` onto the subgroup `Γ(N)` of
    `SL(2, ℤ)`** (LMFDB `group.sp2gr.ppal.congruence`, Mathlib's `CongruenceSubgroup.Gamma`). 
Definition8.3.154
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.151
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Congruence subgroup of level N of \Sp(2g,\Z). (LMFDB)

A subgroup of \Sp(2g,\Q) is called a congruence subgroup of level N if it contains the principal congruence subgroup \Gamma(N).

Examples of such subgroups are: <ul> <li> the principal congruence subgroup \Gamma(N); </li> <li> Hecke (or Siegel parabolic) subgroup \Gamma_0(N); </li> <li> the subgroup \Gamma_1(N). </li> </ul>

Depends on: Definition 8.3.151 Definition 8.3.152 Definition 8.3.153

Lean code for Definition8.3.154●3 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/Level.lean
    complete
    def SymplecticGroup.IsCongruenceOfLevel.{u_1} {l : Type u_1} [DecidableEq l]
      [Fintype l] (N : ℕ) (Γ : Subgroup ↥(Matrix.symplecticGroup l ℚ)) :
      Prop
    def SymplecticGroup.IsCongruenceOfLevel.{u_1}
      {l : Type u_1} [DecidableEq l]
      [Fintype l] (N : ℕ)
      (Γ :
        Subgroup
          ↥(Matrix.symplecticGroup l ℚ)) :
      Prop
    A subgroup `Γ` of `Sp(2g, ℚ)` is a **congruence subgroup of level `N`** (LMFDB
    `group.sp2gr.subgroup.congn`, `mf.siegel.level`) if it contains the principal congruence subgroup
    `Γ(N)`; a Siegel modular form on such a `Γ` is said to be of level `N`. The level is not unique:
    a congruence subgroup of level `N` is also one of every multiple of `N`. The LMFDB's level is
    positive: for `N = 0`, `Γ(0)` is trivial and every subgroup has level `0`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/Level.lean
    complete
    theorem SymplecticGroup.isCongruenceOfLevel_Gamma.{u_1} (l : Type u_1)
      [DecidableEq l] [Fintype l] (N : ℕ) :
      SymplecticGroup.IsCongruenceOfLevel N
        (Subgroup.map (SymplecticGroup.map (Int.castRingHom ℚ))
          (SymplecticGroup.Gamma l N))
    theorem SymplecticGroup.isCongruenceOfLevel_Gamma.{u_1}
      (l : Type u_1) [DecidableEq l]
      [Fintype l] (N : ℕ) :
      SymplecticGroup.IsCongruenceOfLevel N
        (Subgroup.map
          (SymplecticGroup.map
            (Int.castRingHom ℚ))
          (SymplecticGroup.Gamma l N))
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/AutomorphicForms/Siegel/Level.lean
    complete
    theorem SymplecticGroup.isCongruenceOfLevel_Gamma0.{u_1} (l : Type u_1)
      [DecidableEq l] [Fintype l] (N : ℕ) :
      SymplecticGroup.IsCongruenceOfLevel N
        (Subgroup.map (SymplecticGroup.map (Int.castRingHom ℚ))
          (SymplecticGroup.Gamma0 l N))
    theorem SymplecticGroup.isCongruenceOfLevel_Gamma0.{u_1}
      (l : Type u_1) [DecidableEq l]
      [Fintype l] (N : ℕ) :
      SymplecticGroup.IsCongruenceOfLevel N
        (Subgroup.map
          (SymplecticGroup.map
            (Int.castRingHom ℚ))
          (SymplecticGroup.Gamma0 l N))
    **`Γ₀(N)` is a congruence subgroup of level `N`.** 
Definition8.3.155
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.3.11
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Special linear group. (LMFDB)

The special linear group \SL(n,q) is the group of n \times n matrices with determinant 1 with entries in the field \F_q (the finite field with q elements). It has order |\GL(n, q)|/(q-1) = \frac{1}{q-1} \prod_{k=0}^{n-1} (q^n - q^k).

The projective special linear group \PSL(n, q) is the quotient of \SL(n, q) with the group of n \times n scalar matrices over \F_q with determinant 1. If either n > 2 or q > 3, then \PSL(n, q) is a simple group.

Tau Ceti Review: Matrix.SpecialLinearGroup, Matrix.card_GL_field, Matrix.ProjectiveSpecialLinearGroup, Matrix.SpecialLinearGroup.mem_center_iff, GaloisField.

Depends on: Definition 8.3.97 Definition 8.3.118 Definition 8.3.139 Definition 1.1.30

Lean code for Definition8.3.155●8 declarations
  • defdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    def Matrix.SpecialLinearGroup.{u, v} (n : Type u) [DecidableEq n]
      [Fintype n] (R : Type v) [CommRing R] : Type (max 0 u v)
    def Matrix.SpecialLinearGroup.{u, v}
      (n : Type u) [DecidableEq n] [Fintype n]
      (R : Type v) [CommRing R] :
      Type (max 0 u v)
    `SpecialLinearGroup n R` is the group of `n` by `n` `R`-matrices with determinant equal to 1.
    
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Card.lean
    complete
    theorem Matrix.card_GL_field.{u_1} {𝔽 : Type u_1} [Field 𝔽] [Fintype 𝔽]
      (n : ℕ) :
      Nat.card (GL (Fin n) 𝔽) =
        ∏ i, (Fintype.card 𝔽 ^ n - Fintype.card 𝔽 ^ ↑i)
    theorem Matrix.card_GL_field.{u_1} {𝔽 : Type u_1}
      [Field 𝔽] [Fintype 𝔽] (n : ℕ) :
      Nat.card (GL (Fin n) 𝔽) =
        ∏ i,
          (Fintype.card 𝔽 ^ n -
            Fintype.card 𝔽 ^ ↑i)
    The cardinal of the general linear group over a finite field. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Card.lean
    complete
    theorem Matrix.card_SL_field.{u_1} {𝔽 : Type u_1} [Field 𝔽] [Fintype 𝔽] (n : ℕ)
      [NeZero n] :
      Nat.card (Matrix.SpecialLinearGroup (Fin n) 𝔽) =
        (∏ i, (Fintype.card 𝔽 ^ n - Fintype.card 𝔽 ^ ↑i)) /
          (Fintype.card 𝔽 - 1)
    theorem Matrix.card_SL_field.{u_1} {𝔽 : Type u_1}
      [Field 𝔽] [Fintype 𝔽] (n : ℕ)
      [NeZero n] :
      Nat.card
          (Matrix.SpecialLinearGroup (Fin n)
            𝔽) =
        (∏ i,
            (Fintype.card 𝔽 ^ n -
              Fintype.card 𝔽 ^ ↑i)) /
          (Fintype.card 𝔽 - 1)
    The cardinal of the special linear group over a finite field. 
  • abbrevdefined in Mathlib/LinearAlgebra/Matrix/ProjectiveSpecialLinearGroup.lean
    complete
    abbrev Matrix.ProjectiveSpecialLinearGroup.{u, v} (n : Type u) [DecidableEq n]
      [Fintype n] (R : Type v) [CommRing R] : Type (max (max u v) v u)
    abbrev Matrix.ProjectiveSpecialLinearGroup.{u, v}
      (n : Type u) [DecidableEq n] [Fintype n]
      (R : Type v) [CommRing R] :
      Type (max (max u v) v u)
    A projective special linear group is the quotient of a special linear group by its center. 
  • theoremdefined in Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean
    complete
    theorem Matrix.SpecialLinearGroup.mem_center_iff.{u, v} {n : Type u}
      [DecidableEq n] [Fintype n] {R : Type v} [CommRing R]
      {A : Matrix.SpecialLinearGroup n R} :
      A ∈ Subgroup.center (Matrix.SpecialLinearGroup n R) ↔
        ∃ r, r ^ Fintype.card n = 1 ∧ (Matrix.scalar n) r = ↑A
    theorem Matrix.SpecialLinearGroup.mem_center_iff.{u,
        v}
      {n : Type u} [DecidableEq n] [Fintype n]
      {R : Type v} [CommRing R]
      {A : Matrix.SpecialLinearGroup n R} :
      A ∈
          Subgroup.center
            (Matrix.SpecialLinearGroup n R) ↔
        ∃ r,
          r ^ Fintype.card n = 1 ∧
            (Matrix.scalar n) r = ↑A
    The center of a special linear group of degree `n` is the subgroup of scalar matrices, for which
    the scalars are the `n`-th roots of unity. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Projectivization/PSLSimple.lean
    complete
    theorem Matrix.ProjectiveSpecialLinearGroup.isSimpleGroup_fin.{u_2}
      {F : Type u_2} [Field F] {n : ℕ} (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsSimpleGroup (Matrix.ProjectiveSpecialLinearGroup (Fin n) F)
    theorem Matrix.ProjectiveSpecialLinearGroup.isSimpleGroup_fin.{u_2}
      {F : Type u_2} [Field F] {n : ℕ}
      (hn : 2 ≤ n)
      (hF : n = 2 → 4 ≤ Nat.card F) :
      IsSimpleGroup
        (Matrix.ProjectiveSpecialLinearGroup
          (Fin n) F)
    **`PSL(n, F)` is simple for `n ≥ 3`, and for `n = 2` when `F` has at least `4` elements** (LMFDB
    `group.special_linear`, `group.linear`): the theorem of Jordan and Dickson, the case `n = 2` being
    Mathlib's `Matrix.ProjectiveSpecialLinearGroup.rank_two_simple`. The bound is on `Nat.card F`, so
    for `n = 2` the field is finite. Over `F = 𝔽_q` this covers every `PSL(n, q)` with `n ≥ 2` other
    than `PSL(2, 2)` and `PSL(2, 3)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Projectivization/PSLSimple.lean
    complete
    theorem Matrix.ProjectiveSpecialLinearGroup.isSimpleGroup_of_three_le_card.{u_1,
        u_2}
      {ι : Type u_1} {F : Type u_2} [Fintype ι] [DecidableEq ι] [Field F]
      (h : 3 ≤ Fintype.card ι) :
      IsSimpleGroup (Matrix.ProjectiveSpecialLinearGroup ι F)
    theorem Matrix.ProjectiveSpecialLinearGroup.isSimpleGroup_of_three_le_card.{u_1,
        u_2}
      {ι : Type u_1} {F : Type u_2}
      [Fintype ι] [DecidableEq ι] [Field F]
      (h : 3 ≤ Fintype.card ι) :
      IsSimpleGroup
        (Matrix.ProjectiveSpecialLinearGroup ι
          F)
    **`PSL(n, F)` is simple for `n ≥ 3`** (LMFDB `group.special_linear`, `group.linear`), for every
    field `F`, by Iwasawa's criterion: it is perfect, acts primitively and faithfully on `ℙ(Fⁿ)`, and
    the abelian subgroups of transvections with a given centre are conjugate and generate it. 
  • defdefined in Mathlib/FieldTheory/Finite/GaloisField.lean
    complete
    def GaloisField (p : ℕ) [Fact (Nat.Prime p)] (n : ℕ) : Type
    def GaloisField (p : ℕ) [Fact (Nat.Prime p)]
      (n : ℕ) : Type
    A finite field with `p ^ n` elements.
    Every field with the same cardinality is (non-canonically)
    isomorphic to this field. 
Definition8.3.156
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Spinor norm. (LMFDB)

The orthogonal group \GO(n,q) is the subgroup of \GL(n,q) fixing a particular quadratic form Q, and has the subgroup \SO(n,q) of all matrices with determinant 1. One can associate to Q a symmetric bilinear form f \colon V^2 \to \F_q (for V = \F_q^n) by writing f(x,y) = Q(x+y) -Q(x) - Q(y). Then the reflection in a vector v \in V such that Q(v) \neq 0 is the element of \SO(n,q) that acts on V by

x \mapsto x - \frac{f(x,v)}{Q(v)} v.

We can write any g \in \SO(n,q) as a product of reflections: g = r_1 \cdot \ldots \cdot r_n.

The spinor norm is the map \SO(n,q) \to (\F_q^\times) / (\F_q^\times)^2 that sends g to the image of Q(r_1) \cdot \ldots \cdot Q(r_n) in the quotient.

Tau Ceti Review: CliffordAlgebra.spinorNorm, TauCeti.QuadraticMap.specialOrthogonalGroup, TauCeti.QuadraticMap.orthogonalGroup, TauCeti.QuadraticMap.reflection_apply_eq_sub_div, TauCeti.QuadraticMap.reflection_mem_orthogonalGroup.

Depends on: Definition 1.1.8 Definition 8.3.100

Lean code for Definition8.3.156●8 declarations
  • defdefined in TauCeti/LinearAlgebra/CliffordAlgebra/Spin/SpinorNorm/Basic.lean
    complete
    def CliffordAlgebra.spinorNorm.{u, v} {K : Type u} {V : Type v} [Field K]
      [AddCommGroup V] [Module K V] [FiniteDimensional K V] [Invertible 2]
      (Q : QuadraticForm K V) (hQ : QuadraticMap.Nondegenerate) :
      ↥(TauCeti.QuadraticMap.specialOrthogonalGroup Q) →*
        Multiplicative (TauCeti.SquareClassGroup K)
    def CliffordAlgebra.spinorNorm.{u, v}
      {K : Type u} {V : Type v} [Field K]
      [AddCommGroup V] [Module K V]
      [FiniteDimensional K V] [Invertible 2]
      (Q : QuadraticForm K V)
      (hQ : QuadraticMap.Nondegenerate) :
      ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            Q) →*
        Multiplicative
          (TauCeti.SquareClassGroup K)
    The spinor norm on `SO(Q)`, obtained by restricting the orthogonal spinor norm. 
  • defdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u, v, w} {R : Type u}
      {M : Type v} {N : Type w} [CommRing R] [AddCommGroup M] [Module R M]
      [AddCommMonoid N] [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    def TauCeti.QuadraticMap.specialOrthogonalGroup.{u,
        v, w}
      {R : Type u} {M : Type v} {N : Type w}
      [CommRing R] [AddCommGroup M]
      [Module R M] [AddCommMonoid N]
      [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    The special orthogonal group: the orthogonal automorphisms of determinant one.
    
    The determinant is Mathlib's `LinearEquiv.det`, which is `1` by convention on a module that is not
    finite free; on such a module this subgroup is therefore all of `orthogonalGroup Q`. 
  • defdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    def TauCeti.QuadraticMap.orthogonalGroup.{u, v, w} {R : Type u} {M : Type v}
      {N : Type w} [CommSemiring R] [AddCommMonoid M] [Module R M]
      [AddCommMonoid N] [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    def TauCeti.QuadraticMap.orthogonalGroup.{u,
        v, w}
      {R : Type u} {M : Type v} {N : Type w}
      [CommSemiring R] [AddCommMonoid M]
      [Module R M] [AddCommMonoid N]
      [Module R N] (Q : QuadraticMap R M N) :
      Subgroup (M ≃ₗ[R] M)
    The orthogonal group of a quadratic map: the linear automorphisms of `M` that preserve `Q`.
    
    Mathlib's `Matrix.orthogonalGroup n R` is a coordinate version of this for the standard form on
    `n → R`: its matrices preserve `x ↦ ∑ i, x i ^ 2`, and are all of its isometries as soon as `2` is
    not a zero divisor in `R`. `QuadraticMap.IsometryEquiv Q Q` is the same underlying set as
    `orthogonalGroup Q` (see `orthogonalGroupEquivIsometryEquiv`) but carries no group structure. 
  • theoremdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    theorem TauCeti.QuadraticMap.reflection_apply_eq_sub_div.{u, v} {K : Type u}
      {V : Type v} [Field K] [AddCommGroup V] [Module K V]
      (Q : QuadraticForm K V) (v : V) [Invertible (Q v)] (x : V) :
      (TauCeti.QuadraticMap.reflection Q v) x =
        x - (QuadraticMap.polar (⇑Q) v x / Q v) • v
    theorem TauCeti.QuadraticMap.reflection_apply_eq_sub_div.{u,
        v}
      {K : Type u} {V : Type v} [Field K]
      [AddCommGroup V] [Module K V]
      (Q : QuadraticForm K V) (v : V)
      [Invertible (Q v)] (x : V) :
      (TauCeti.QuadraticMap.reflection Q v)
          x =
        x -
          (QuadraticMap.polar (⇑Q) v x /
              Q v) •
            v
    Over a field, the reflection in `v` is `x ↦ x - (polar Q v x / Q v) • v`. 
  • theoremdefined in TauCeti/LinearAlgebra/QuadraticForm/OrthogonalGroup/Basic.lean
    complete
    theorem TauCeti.QuadraticMap.reflection_mem_orthogonalGroup.{u, v} {R : Type u}
      {M : Type v} [CommRing R] [AddCommGroup M] [Module R M]
      (Q : QuadraticForm R M) (v : M) [Invertible (Q v)] :
      TauCeti.QuadraticMap.reflection Q v ∈
        TauCeti.QuadraticMap.orthogonalGroup Q
    theorem TauCeti.QuadraticMap.reflection_mem_orthogonalGroup.{u,
        v}
      {R : Type u} {M : Type v} [CommRing R]
      [AddCommGroup M] [Module R M]
      (Q : QuadraticForm R M) (v : M)
      [Invertible (Q v)] :
      TauCeti.QuadraticMap.reflection Q v ∈
        TauCeti.QuadraticMap.orthogonalGroup Q
    **Reflections are orthogonal.** These are the generators a Cartan-Dieudonné theorem writes an
    orthogonal automorphism as a product of, over a field of characteristic not two, for a nondegenerate
    form, in finite dimension; none of that is assumed here. In characteristic two `polar Q v v` is
    `2 • Q v = 0`, so `v` lies in the kernel of `polar Q v` and `reflection Q v` fixes `v` (over a
    field it is a transvection or the identity), which is why that theorem excludes characteristic
    two. They are also the image of the
    generating vectors of the Pin group under twisted conjugation. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/SpinorNormReflection.lean
    complete
    theorem TauCeti.QuadraticMap.exists_prod_ofFn_reflectionOrthogonal_eq.{u_1, u_2}
      {K : Type u_1} {V : Type u_2} [Field K] [AddCommGroup V] [Module K V]
      [FiniteDimensional K V] (Q : QuadraticForm K V) [NeZero 2]
      (hQ : QuadraticMap.Nondegenerate)
      (g : ↥(TauCeti.QuadraticMap.specialOrthogonalGroup Q)) :
      ∃ k v x,
        (List.ofFn fun i =>
              TauCeti.QuadraticMap.reflectionOrthogonal Q (v i)).prod =
          (QuadraticMap.specialOrthogonalToOrthogonal Q) g
    theorem TauCeti.QuadraticMap.exists_prod_ofFn_reflectionOrthogonal_eq.{u_1,
        u_2}
      {K : Type u_1} {V : Type u_2} [Field K]
      [AddCommGroup V] [Module K V]
      [FiniteDimensional K V]
      (Q : QuadraticForm K V) [NeZero 2]
      (hQ : QuadraticMap.Nondegenerate)
      (g :
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            Q)) :
      ∃ k v x,
        (List.ofFn fun i =>
              TauCeti.QuadraticMap.reflectionOrthogonal
                Q (v i)).prod =
          (QuadraticMap.specialOrthogonalToOrthogonal
              Q)
            g
    **Every element of the special orthogonal group is a product of reflections** in
    characteristic not `2` (LMFDB `group.spinor_norm`), `g = r_{v_1} ⋯ r_{v_k}` with `Q(v_i) ≠ 0`:
    the Cartan–Dieudonné theorem `TauCeti.QuadraticMap.exists_even_reflectionOrthogonal_list_prod_eq`,
    which moreover gives `k` even and at most `dim V`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/SpinorNormReflection.lean
    complete
    theorem CliffordAlgebra.spinorNorm_eq_squareClassHom_prod.{u_1, u_2}
      {K : Type u_1} {V : Type u_2} [Field K] [AddCommGroup V] [Module K V]
      [FiniteDimensional K V] {Q : QuadraticForm K V} [Invertible 2]
      (hQ : QuadraticMap.Nondegenerate) {k : ℕ} (v : Fin k → V)
      [(i : Fin k) → Invertible (Q (v i))]
      {g : ↥(TauCeti.QuadraticMap.specialOrthogonalGroup Q)}
      (hg :
        (List.ofFn fun i =>
              TauCeti.QuadraticMap.reflectionOrthogonal Q (v i)).prod =
          (QuadraticMap.specialOrthogonalToOrthogonal Q) g) :
      (CliffordAlgebra.spinorNorm Q hQ) g =
        TauCeti.squareClassHom (∏ i, unitOfInvertible (Q (v i)))
    theorem CliffordAlgebra.spinorNorm_eq_squareClassHom_prod.{u_1,
        u_2}
      {K : Type u_1} {V : Type u_2} [Field K]
      [AddCommGroup V] [Module K V]
      [FiniteDimensional K V]
      {Q : QuadraticForm K V} [Invertible 2]
      (hQ : QuadraticMap.Nondegenerate)
      {k : ℕ} (v : Fin k → V)
      [(i : Fin k) → Invertible (Q (v i))]
      {g :
        ↥(TauCeti.QuadraticMap.specialOrthogonalGroup
            Q)}
      (hg :
        (List.ofFn fun i =>
              TauCeti.QuadraticMap.reflectionOrthogonal
                Q (v i)).prod =
          (QuadraticMap.specialOrthogonalToOrthogonal
              Q)
            g) :
      (CliffordAlgebra.spinorNorm Q hQ) g =
        TauCeti.squareClassHom
          (∏ i, unitOfInvertible (Q (v i)))
    **The spinor norm of `g = r_{v_1} ⋯ r_{v_k}` is the square class of `Q(v_1) ⋯ Q(v_k)`**
    (LMFDB `group.spinor_norm`), for every factorisation of `g ∈ SO(Q)` into reflections: the spinor
    norm is a homomorphism sending the reflection in `v` to the class of `Q(v)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/QuadraticForm/SpinorNormReflection.lean
    complete
    theorem TauCeti.subsingleton_squareClassGroup_of_ringChar_eq_two.{u_3}
      {F : Type u_3} [Field F] [Finite F] (hF : ringChar F = 2) :
      Subsingleton (TauCeti.SquareClassGroup F)
    theorem TauCeti.subsingleton_squareClassGroup_of_ringChar_eq_two.{u_3}
      {F : Type u_3} [Field F] [Finite F]
      (hF : ringChar F = 2) :
      Subsingleton
        (TauCeti.SquareClassGroup F)
    **The square-class group of a finite field of characteristic `2` is trivial** (LMFDB
    `group.spinor_norm`): every element is a square, so the spinor norm over `𝔽_q` with `q` even takes
    values in the trivial group. 
Definition8.3.157
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.14
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Sporadic groups. (LMFDB)

By the classification of finite simple groups, we know that every finite simple group is either cyclic of prime order, an alternating group, a member of one of 16 infinite families of simple groups of Lie type, or one of 26 exceptions called sporadic groups.

The 26 sporadic groups are:

  • The Mathieu groups M_{11}, M_{12}, M_{22}, M_{23}, and M_{24}.

  • The Janko groups J_1, J_2, J_3, and J_4.

  • The Conway groups \Co_1, \Co_2, and \Co_3.

  • The Fischer groups \text{Fi}_{22}, \text{Fi}_{23}, and \text{Fi}_{24}'.

  • The Higman-Sims groups \HS.

  • The McLaughlin group \McL.

  • The Held group \He.

  • The Rudvalis group \Ru.

  • The Suzuki group \text{Suz}.

  • The O'Nan group \text{O'N}.

  • The Harada-Norton group \text{HN}.

  • The Lyons group \text{Ly}.

  • The Thompson group \text{Th}.

  • The Baby Monster group \text{B}.

  • The Fischer-Griess Monster group \text{M}.

The smallest sporadic group is the Mathieu group M_{11} of order 7920 = 2^4 \cdot 3^2 \cdot 5 \cdot 11, and the largest sporadic group is the Fischer–Griess Monster group M of order 808 017 424 794 512 875 886 459 904 961 710 757 005 754 368 000 000 000 = 2^{46} \cdot 3^{20} \cdot 5^9 \cdot 7^6 \cdot 11^2 \cdot 13^3 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 \cdot 41 \cdot 47 \cdot 59 \cdot 71.

Depends on: Definition 8.3.14 Definition 8.3.37 Definition 8.3.97 Definition 8.3.139

Definition8.3.158
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.20
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Stem extension. (LMFDB)

A short exact sequence of groups

1 \to K \to C \to G \to 1

is a stem extension if K is contained in both the center and the commutator of G (we also refer to K as a stem subgroup of C). For fixed G, the size of C is bounded. For any extension with C of maximal size, the kernel K is isomorphic to the Schur multiplier of G. In general, C is only determined up to isoclinism in such an extension, but if G is perfect then C is determined up to isomorphism.

Depends on: Definition 8.3.20 Definition 8.3.28 Definition 8.3.69 Definition 8.3.105 Definition 8.3.136

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

Stem group. (LMFDB)

A stem group is a group G whose center is contained in its commutator subgroup. Any group is isoclinic to a stem group (not necessarily unique), and the order of a stem group divides the order of every other group in its isoclinism class.

Depends on: Definition 8.3.3 Definition 8.3.20 Definition 8.3.28 Definition 8.3.69

Definition8.3.160
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 43
Reverse dependency previews
Preview
Definition 1.1.34
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Subgroup of a group. (LMFDB)

If G is a group, a subset H\subseteq G is a subgroup of G if the binary operation of G restricts to a binary operation on H, and H is a group for this induced operation.

Equivalently, the subset H must satisfy the following conditions:

  1. for all a,b\in H, a*b\in H

  2. the identity of G is an element of H

  3. for every a\in H, the inverse of a in G is also in H.

Tau Ceti Review: Subgroup.

Depends on: Definition 1.1.2 Definition 1.1.5 Definition 1.1.6 Definition 8.3.3

Lean code for Definition8.3.160●5 declarations
  • structure(extends 2, 4 fields)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    structure Subgroup.{u_3} (G : Type u_3) [Group G] : Type u_3
    structure Subgroup.{u_3} (G : Type u_3) [Group G] :
      Type u_3
    A subgroup of a group `G` is a subset containing 1, closed under multiplication
    and closed under multiplicative inverse. 
    
    [Wikidata Q466109](https://www.wikidata.org/wiki/Q466109)
    • Submonoid G
    carrier : Set G
    Inherited from
    1. Submonoid
    2. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Submonoid
    2. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ self.carrier → x⁻¹ ∈ self.carrier
    `G` is closed under inverses 
  • defdefined in LeanBridge/ForMathlib/Algebra/Group/Subgroup/InducedOperation.lean
    complete
    def Set.IsGroupForInducedMul.{u_1} {G : Type u_1} [Group G] (H : Set G) :
      Prop
    def Set.IsGroupForInducedMul.{u_1}
      {G : Type u_1} [Group G] (H : Set G) :
      Prop
    A subset `H` of a group `G` **is a group for the induced operation** (LMFDB `group.subgroup`,
    where this defines a subgroup): the operation of `G` restricts to a binary operation on `H`, that
    is `H` carries an operation agreeing with that of `G`, and `H` is a group for it. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Group/Subgroup/InducedOperation.lean
    complete
    theorem Set.isGroupForInducedMul_iff.{u_1} {G : Type u_1} [Group G]
      {H : Set G} :
      H.IsGroupForInducedMul ↔
        (∀ a ∈ H, ∀ b ∈ H, a * b ∈ H) ∧ 1 ∈ H ∧ ∀ a ∈ H, a⁻¹ ∈ H
    theorem Set.isGroupForInducedMul_iff.{u_1}
      {G : Type u_1} [Group G] {H : Set G} :
      H.IsGroupForInducedMul ↔
        (∀ a ∈ H, ∀ b ∈ H, a * b ∈ H) ∧
          1 ∈ H ∧ ∀ a ∈ H, a⁻¹ ∈ H
    **Subgroups by the induced operation and by three conditions** (LMFDB `group.subgroup`): a
    subset `H` of `G` is a group for the operation induced by `G` if and only if it is closed under the
    operation, contains the identity of `G`, and contains the inverse in `G` of each of its
    elements. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Group/Subgroup/InducedOperation.lean
    complete
    theorem Set.isGroupForInducedMul_iff_exists_subgroup.{u_1} {G : Type u_1}
      [Group G] {H : Set G} : H.IsGroupForInducedMul ↔ ∃ K, ↑K = H
    theorem Set.isGroupForInducedMul_iff_exists_subgroup.{u_1}
      {G : Type u_1} [Group G] {H : Set G} :
      H.IsGroupForInducedMul ↔ ∃ K, ↑K = H
    **A subset is a group for the induced operation if and only if it is a subgroup** (LMFDB
    `group.subgroup`): the carrier of one of Mathlib's `Subgroup`s, which are bundled with the three
    conditions of `Set.isGroupForInducedMul_iff`. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Group/Subgroup/InducedOperation.lean
    complete
    theorem Set.isGroupForInducedMul_coe.{u_1} {G : Type u_1} [Group G]
      (K : Subgroup G) : (↑K).IsGroupForInducedMul
    theorem Set.isGroupForInducedMul_coe.{u_1}
      {G : Type u_1} [Group G]
      (K : Subgroup G) :
      (↑K).IsGroupForInducedMul
    **The carrier of a subgroup is a group for the induced operation** (LMFDB
    `group.subgroup`). 
Definition8.3.161
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Centralizer of a subgroup. (LMFDB)

If H is a subgroup of a group G, then the centralizer of H is the subgroup

C_G(H) = \{ g\in G\mid gh=hg \text{ for all } h\in H\}.

Tau Ceti Review: Subgroup.centralizer.

Depends on: Definition 8.3.3 Definition 8.3.160

Lean code for Definition8.3.161●1 definition
  • defdefined in Mathlib/GroupTheory/Subgroup/Centralizer.lean
    complete
    def Subgroup.centralizer.{u_1} {G : Type u_1} [Group G] (s : Set G) :
      Subgroup G
    def Subgroup.centralizer.{u_1} {G : Type u_1}
      [Group G] (s : Set G) : Subgroup G
    The `centralizer` of `s` is the subgroup of `g : G` commuting with every `h : s`. 
Definition8.3.162
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.94
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Complement. (LMFDB)

If H \trianglelefteq G is a normal subgroup, a complement of H is a subgroup K \subseteq G with \lvert H \cap K \rvert = 1 and HK=G where

HK = \{ hk \mid h\in H \text{ and } k\in K\}.

In order for a complement to exist, the sequence

1 \to H \to G \to G/H \to 1

must split, in which case the complements are precisely the images of the possible splittings G/H \to G. All complements are isomorphic to G/H, and if K is any complement then G can be described as the internal semidirect product H \rtimes K.

Tau Ceti Review: Subgroup.IsComplement', Subgroup.IsComplement'.QuotientMulEquiv, SemidirectProduct.mulEquivSubgroup.

Depends on: Definition 8.3.94 Definition 8.3.138 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.162●6 declarations
  • abbrevdefined in Mathlib/GroupTheory/Complement.lean
    complete
    abbrev Subgroup.IsComplement'.{u_1} {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    abbrev Subgroup.IsComplement'.{u_1}
      {G : Type u_1} [Group G]
      (H K : Subgroup G) : Prop
    `H` and `K` are complements if `(*) : H × K → G` is a bijection 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    theorem Subgroup.isComplement'_iff_card_inf_eq_one_and_mul_eq_univ.{u_3}
      {G : Type u_3} [Group G] {H K : Subgroup G} :
      H.IsComplement' K ↔ Nat.card ↥(H ⊓ K) = 1 ∧ ↑H * ↑K = Set.univ
    theorem Subgroup.isComplement'_iff_card_inf_eq_one_and_mul_eq_univ.{u_3}
      {G : Type u_3} [Group G]
      {H K : Subgroup G} :
      H.IsComplement' K ↔
        Nat.card ↥(H ⊓ K) = 1 ∧
          ↑H * ↑K = Set.univ
    **A complement in the sense of the LMFDB** (`group.subgroup.complement`): `K` is a complement
    of `H` if and only if `|H ∩ K| = 1` and `HK = G`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    theorem Subgroup.isComplement'_iff_exists_splitting.{u_3} {G : Type u_3}
      [Group G] {H : Subgroup G} [H.Normal] {K : Subgroup G} :
      H.IsComplement' K ↔ ∃ s, s.range = K
    theorem Subgroup.isComplement'_iff_exists_splitting.{u_3}
      {G : Type u_3} [Group G]
      {H : Subgroup G} [H.Normal]
      {K : Subgroup G} :
      H.IsComplement' K ↔ ∃ s, s.range = K
    **The complements of a normal subgroup are the images of the splittings** (LMFDB
    `group.subgroup.complement`): `K` is a complement of a normal subgroup `H` if and only if it is the
    range of a splitting `G ⧸ H →* G` of `1 → H → G → G ⧸ H → 1`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/GroupExtension/Complement.lean
    complete
    theorem Subgroup.exists_isComplement'_iff_nonempty_splitting.{u_3}
      {G : Type u_3} [Group G] (H : Subgroup G) [H.Normal] :
      (∃ K, H.IsComplement' K) ↔ Nonempty H.groupExtension.Splitting
    theorem Subgroup.exists_isComplement'_iff_nonempty_splitting.{u_3}
      {G : Type u_3} [Group G]
      (H : Subgroup G) [H.Normal] :
      (∃ K, H.IsComplement' K) ↔
        Nonempty H.groupExtension.Splitting
    **A normal subgroup has a complement if and only if the extension splits** (LMFDB
    `group.subgroup.complement`). 
  • defdefined in Mathlib/GroupTheory/Complement.lean
    complete
    def Subgroup.IsComplement'.QuotientMulEquiv.{u_1} {G : Type u_1} [Group G]
      {H K : Subgroup G} [K.Normal] (h : H.IsComplement' K) : G ⧸ K ≃* ↥H
    def Subgroup.IsComplement'.QuotientMulEquiv.{u_1}
      {G : Type u_1} [Group G]
      {H K : Subgroup G} [K.Normal]
      (h : H.IsComplement' K) : G ⧸ K ≃* ↥H
    If `H` and `K` are complementary with `K` normal, then `G ⧸ K` is isomorphic to `H`. 
  • defdefined in Mathlib/GroupTheory/SemidirectProduct.lean
    complete
    def SemidirectProduct.mulEquivSubgroup.{u_2} {G : Type u_2} [Group G]
      {H K : Subgroup G} [H.Normal] (h : H.IsComplement' K) :
      ↥H ⋊[H.normalizerMonoidHom.comp (Subgroup.inclusion ⋯)] ↥K ≃* G
    def SemidirectProduct.mulEquivSubgroup.{u_2}
      {G : Type u_2} [Group G]
      {H K : Subgroup G} [H.Normal]
      (h : H.IsComplement' K) :
      ↥H ⋊[H.normalizerMonoidHom.comp
            (Subgroup.inclusion ⋯)]
          ↥K ≃*
        G
    The isomorphism from a semidirect product of complementary subgroups to the ambient group. 
Definition8.3.163
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Subgroup diagram. (LMFDB)

If G is a group, its subgroup diagram is the Hasse diagram for the set of subgroups of G under inclusion. Generally, subgroups of the same order are drawn at the same height in the diagram.

Tau Ceti Review: CovBy.

Depends on: Definition 8.3.1 Definition 8.3.3 Definition 8.3.97

Lean code for Definition8.3.163●2 definitions
  • defdefined in Mathlib/Combinatorics/SimpleGraph/Hasse.lean
    complete
    def SimpleGraph.hasse.{u_1} (α : Type u_1) [Preorder α] : SimpleGraph α
    def SimpleGraph.hasse.{u_1} (α : Type u_1)
      [Preorder α] : SimpleGraph α
    The Hasse diagram of an order as a simple graph. The graph of the covering relation. 
  • defdefined in Mathlib/Order/Defs/PartialOrder.lean
    complete
    def CovBy.{u_2} {α : Type u_2} [LT α] (a b : α) : Prop
    def CovBy.{u_2} {α : Type u_2} [LT α]
      (a b : α) : Prop
    `CovBy a b` means that `b` covers `a`. This means that `a < b` and there is no element in
    between. This is denoted `a ⋖ b`. 
Definition8.3.164
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Subgroup diagrams in the LMFDB. (LMFDB)

Definition 8.3.163

Subgroup diagrams in the LMFDB are different from typical subgroup diagrams in that it is the Hasse diagram on the set of conjugacy classes of subgroups ordered by inclusion. The number of subgroups in each conjugacy class is given as a left subscript if it is bigger then one. Hence, normal subgroups are those which have no left subscripts.

Each subgroup in the diagram can be dragged to make it so that one can see parts of the diagram more clearly.

Clicking on a subgroup will highlight it, and information about the subgroup will display below the diagram. Hovering the mouse over a subgroup anywhere on the page will cause all instances of that subgroup to have a highlit background throughout the page.

Tau Ceti Review: CovBy, TauCeti.mem_orbit_conjAct_iff, Subgroup.index_normalizer_eq_ncard_orbit.

Depends on: Definition 8.3.1 Definition 8.3.163 Definition 8.3.167

Lean code for Definition8.3.164●7 declarations
  • defdefined in Mathlib/Combinatorics/SimpleGraph/Hasse.lean
    complete
    def SimpleGraph.hasse.{u_1} (α : Type u_1) [Preorder α] : SimpleGraph α
    def SimpleGraph.hasse.{u_1} (α : Type u_1)
      [Preorder α] : SimpleGraph α
    The Hasse diagram of an order as a simple graph. The graph of the covering relation. 
  • defdefined in Mathlib/Order/Defs/PartialOrder.lean
    complete
    def CovBy.{u_2} {α : Type u_2} [LT α] (a b : α) : Prop
    def CovBy.{u_2} {α : Type u_2} [LT α]
      (a b : α) : Prop
    `CovBy a b` means that `b` covers `a`. This means that `a < b` and there is no element in
    between. This is denoted `a ⋖ b`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupClassPoset.lean
    complete
    abbrev Subgroup.conjClassesDiagram.{u_2} (G : Type u_2) [Group G] :
      SimpleGraph (MulAction.orbitRel.Quotient (ConjAct G) (Subgroup G))
    abbrev Subgroup.conjClassesDiagram.{u_2}
      (G : Type u_2) [Group G] :
      SimpleGraph
        (MulAction.orbitRel.Quotient
          (ConjAct G) (Subgroup G))
    The **subgroup diagram of `G` in the LMFDB** (LMFDB `group.subgroup.diagram.lmfdb`): the Hasse
    diagram of the conjugacy classes of subgroups of `G`, ordered by inclusion up to conjugacy, two
    classes being adjacent when one covers the other. The LMFDB draws it for finite groups, for which
    the order is a partial order. The diagram of LMFDB `group.subgroup.diagram` is instead the Hasse
    diagram `SimpleGraph.hasse (Subgroup G)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupClassPoset.lean
    complete
    theorem Subgroup.mk_le_mk_iff_exists_smul_le.{u_1, u_2} {A : Type u_1}
      {G : Type u_2} [Group A] [Group G] [MulDistribMulAction A G]
      {H K : Subgroup G} : ⟦H⟧ ≤ ⟦K⟧ ↔ ∃ a, a • H ≤ K
    theorem Subgroup.mk_le_mk_iff_exists_smul_le.{u_1,
        u_2}
      {A : Type u_1} {G : Type u_2} [Group A]
      [Group G] [MulDistribMulAction A G]
      {H K : Subgroup G} :
      ⟦H⟧ ≤ ⟦K⟧ ↔ ∃ a, a • H ≤ K
    **The order on the classes of subgroups**: for the order induced by inclusion on the orbits of
    `A` on the subgroups of `G`, Mathlib's preorder on a quotient, `[H] ≤ [K]` if and only if
    `a • H ≤ K` for some `a : A`, that is, for `A = ConjAct G`, a conjugate of `H` lies in `K`. 
  • theoremdefined in TauCeti/Algebra/Group/Subgroup/Conjugates.lean
    complete
    theorem TauCeti.mem_orbit_conjAct_iff.{u_1} {G : Type u_1} [Group G]
      {H H' : Subgroup G} :
      H' ∈ MulAction.orbit (ConjAct G) H ↔
        ∃ g, Subgroup.map (↑(MulAut.conj g)) H = H'
    theorem TauCeti.mem_orbit_conjAct_iff.{u_1}
      {G : Type u_1} [Group G]
      {H H' : Subgroup G} :
      H' ∈ MulAction.orbit (ConjAct G) H ↔
        ∃ g,
          Subgroup.map (↑(MulAut.conj g)) H =
            H'
    Membership in the conjugacy orbit of `H` means being obtained from `H` by conjugation. 
  • theoremdefined in TauCeti/Algebra/Group/Subgroup/Conjugates.lean
    complete
    theorem Subgroup.index_normalizer_eq_ncard_orbit.{u_1} {G : Type u_1} [Group G]
      (H : Subgroup G) :
      (Subgroup.normalizer ↑H).index = (MulAction.orbit (ConjAct G) H).ncard
    theorem Subgroup.index_normalizer_eq_ncard_orbit.{u_1}
      {G : Type u_1} [Group G]
      (H : Subgroup G) :
      (Subgroup.normalizer ↑H).index =
        (MulAction.orbit (ConjAct G) H).ncard
    The number of conjugates of a subgroup is the index of its normalizer. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupClassPoset.lean
    complete
    theorem Subgroup.normal_iff_ncard_orbit_le_one.{u_2} {G : Type u_2} [Group G]
      {H : Subgroup G} [Finite G] :
      H.Normal ↔ (MulAction.orbit (ConjAct G) H).ncard ≤ 1
    theorem Subgroup.normal_iff_ncard_orbit_le_one.{u_2}
      {G : Type u_2} [Group G]
      {H : Subgroup G} [Finite G] :
      H.Normal ↔
        (MulAction.orbit (ConjAct G)
              H).ncard ≤
          1
    **The normal subgroups are those alone in their conjugacy class** (LMFDB
    `group.subgroup.diagram.lmfdb`): in a finite group, a subgroup is normal if and only if its
    conjugacy class has at most one element, i.e. carries no left subscript in the LMFDB's diagram. 
Definition8.3.165
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Hall subgroup. (LMFDB)

If H is a subgroup of a finite group G, then H is a Hall subgroup if the order of H is relatively prime to its index.

Tau Ceti Review: Subgroup.index.

Depends on: Definition 8.3.3 Definition 8.3.97 Definition 8.3.160 Definition 8.3.166

Lean code for Definition8.3.165●2 declarations
  • defdefined in Mathlib/GroupTheory/Index.lean
    complete
    def Subgroup.index.{u_1} {G : Type u_1} [Group G] (H : Subgroup G) : ℕ
    def Subgroup.index.{u_1} {G : Type u_1}
      [Group G] (H : Subgroup G) : ℕ
    The index of a subgroup as a natural number. Returns `0` if the index is infinite. 
    
    [Wikidata Q1464168](https://www.wikidata.org/wiki/Q1464168)
  • theoremdefined in Mathlib/GroupTheory/Sylow.lean
    complete
    theorem Sylow.card_coprime_index.{u} {G : Type u} [Group G] [Finite G] {p : ℕ}
      [hp : Fact (Nat.Prime p)] (P : Sylow p G) :
      (Nat.card ↥↑P).Coprime (↑P).index
    theorem Sylow.card_coprime_index.{u} {G : Type u}
      [Group G] [Finite G] {p : ℕ}
      [hp : Fact (Nat.Prime p)]
      (P : Sylow p G) :
      (Nat.card ↥↑P).Coprime (↑P).index
    Sylow subgroups are Hall subgroups. 
Definition8.3.166
uses 1
Used by 11
Reverse dependency previews
Preview
Definition 3.1.71
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Index of a subgroup. (LMFDB)

The index of a subgroup G' of a group G, denoted [G:G'], is the order of the set of left cosets of G' in G.

Tau Ceti Review: Subgroup.index.

Depends on: Definition 8.3.35

Lean code for Definition8.3.166●1 definition
  • defdefined in Mathlib/GroupTheory/Index.lean
    complete
    def Subgroup.index.{u_1} {G : Type u_1} [Group G] (H : Subgroup G) : ℕ
    def Subgroup.index.{u_1} {G : Type u_1}
      [Group G] (H : Subgroup G) : ℕ
    The index of a subgroup as a natural number. Returns `0` if the index is infinite. 
    
    [Wikidata Q1464168](https://www.wikidata.org/wiki/Q1464168)
Definition8.3.167
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 26
Reverse dependency previews
Preview
Definition 4.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Normal subgroup of a group. (LMFDB)

If H is a subgroup of a group G, then H is normal if any of the following equivalent conditions hold:

  1. gHg^{-1}=H for all g\in G

  2. gHg^{-1}\subseteq H for all g\in G

  3. gH=Hg for all g\in G

  4. (aH)*(bH)=(ab)H is a well-defined binary operation on the set of left cosets of H

If H is a normal subgroup, we write H \lhd G, and the set of left cosets G/H form a group under the operation given in (4) above.

Tau Ceti Review: Subgroup.Normal, Subgroup.normal_iff_map_conj_eq, QuotientGroup.Quotient.group.

Depends on: Definition 1.1.2 Definition 8.3.3 Definition 8.3.35 Definition 8.3.160

Lean code for Definition8.3.167●4 declarations
  • class(1 method)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    class Subgroup.Normal.{u_1} {G : Type u_1} [Group G] (H : Subgroup G) : Prop
    class Subgroup.Normal.{u_1} {G : Type u_1}
      [Group G] (H : Subgroup G) : Prop
    A subgroup `H` is normal if whenever `n ∈ H`, then `g * n * g⁻¹ ∈ H` for every `g : G` 
    
    [Wikidata Q743179](https://www.wikidata.org/wiki/Q743179)
    conj_mem : ∀ n ∈ H, ∀ (g : G), g * n * g⁻¹ ∈ H
    `H` is closed under conjugation 
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Basic.lean
    complete
    theorem Subgroup.normal_iff_map_conj_eq.{u_1} {G : Type u_1} [Group G]
      {H : Subgroup G} :
      H.Normal ↔ ∀ (g : G), Subgroup.map (↑(MulAut.conj g)) H = H
    theorem Subgroup.normal_iff_map_conj_eq.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} :
      H.Normal ↔
        ∀ (g : G),
          Subgroup.map (↑(MulAut.conj g)) H =
            H
  • theoremdefined in Mathlib/GroupTheory/Coset/Basic.lean
    complete
    theorem normal_iff_eq_cosets.{u_1} {α : Type u_1} [Group α] (s : Subgroup α) :
      s.Normal ↔ ∀ (g : α), g • ↑s = MulOpposite.op g • ↑s
    theorem normal_iff_eq_cosets.{u_1} {α : Type u_1}
      [Group α] (s : Subgroup α) :
      s.Normal ↔
        ∀ (g : α),
          g • ↑s = MulOpposite.op g • ↑s
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Defs.lean
    complete
    def QuotientGroup.Quotient.group.{u_1} {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] : Group (G ⧸ N)
    def QuotientGroup.Quotient.group.{u_1}
      {G : Type u_1} [Group G]
      (N : Subgroup G) [nN : N.Normal] :
      Group (G ⧸ N)
Definition8.3.168
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.160
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Normal closure of a subgroup. (LMFDB)

If H is a subgroup of a group G, the normal closure of H is the smallest normal subgroup of G containing H. Alternatively, it is the subgroup generated by the set

\bigcup_{g\in G} gHg^{-1}.

Tau Ceti Review: Subgroup.normalClosure.

Depends on: Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.168●1 definition
  • defdefined in Mathlib/Algebra/Group/Subgroup/Basic.lean
    complete
    def Subgroup.normalClosure.{u_1} {G : Type u_1} [Group G] (s : Set G) :
      Subgroup G
    def Subgroup.normalClosure.{u_1}
      {G : Type u_1} [Group G] (s : Set G) :
      Subgroup G
    The normal closure of a set `s` is the subgroup closure of all the conjugates of
    elements of `s`. It is the smallest normal subgroup containing `s`. 
Definition8.3.169
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Normalizer of a subgroup. (LMFDB)

If H is a subgroup of a group G, then the normalizer of H is the subgroup

N_G(H) = \{ g\in G\mid gHg^{-1} = H\}.

Equivalently, N_G(H) is the largest subgroup of G containing H in which H is normal.

Tau Ceti Review: Subgroup.normalizer.

Depends on: Definition 8.3.3 Definition 8.3.160 Definition 8.3.167

Lean code for Definition8.3.169●1 definition
  • defdefined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    def Subgroup.normalizer.{u_1} {G : Type u_1} [Group G] (S : Set G) :
      Subgroup G
    def Subgroup.normalizer.{u_1} {G : Type u_1}
      [Group G] (S : Set G) : Subgroup G
    The `normalizer` of `S` is the subgroup of `G` whose elements satisfy `g * S * g⁻¹ = S`.
    When `S` is a subgroup, this is the largest subgroup of `G` inside which `S` is normal. 
Definition8.3.170
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.20
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Projective image of a subgroup. (LMFDB)

If H \subset G is a subgroup, the projective image of H is the image of H in the central quotient G / Z(G).

Tau Ceti Review: Subgroup.map, QuotientGroup.mk', Subgroup.center.

Depends on: Definition 8.3.20 Definition 8.3.118

Lean code for Definition8.3.170●3 definitions
  • defdefined in Mathlib/Algebra/Group/Subgroup/Map.lean
    complete
    def Subgroup.map.{u_1, u_4} {G : Type u_1} [Group G] {N : Type u_4}
      [Group N] (f : G →* N) (H : Subgroup G) : Subgroup N
    def Subgroup.map.{u_1, u_4} {G : Type u_1}
      [Group G] {N : Type u_4} [Group N]
      (f : G →* N) (H : Subgroup G) :
      Subgroup N
    The image of a subgroup along a monoid homomorphism is a subgroup. 
  • defdefined in Mathlib/GroupTheory/QuotientGroup/Defs.lean
    complete
    def QuotientGroup.mk'.{u_1} {G : Type u_1} [Group G] (N : Subgroup G)
      [nN : N.Normal] : G →* G ⧸ N
    def QuotientGroup.mk'.{u_1} {G : Type u_1}
      [Group G] (N : Subgroup G)
      [nN : N.Normal] : G →* G ⧸ N
    The group homomorphism from `G` to `G/N`. 
  • defdefined in Mathlib/GroupTheory/Subgroup/Center.lean
    complete
    def Subgroup.center.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.center.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The center of a group `G` is the set of elements that commute with everything in `G` 
Definition8.3.171
Statement uses 7
Statement dependency previews
Preview
Definition 8.3.15
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Subgroup labels. (LMFDB)

The full label of a subgroup is of the form \mathtt{N.i.m.a} or \mathtt{N.i.m.a.j}. In either case, \mathtt{N.i} is the label of the ambient group, \mathtt{m} is the index of the subgroup in the ambient group, \mathtt{a} distinguishes subgroups up to automorphism and \mathtt{j} distinguishes subgroups up to conjugacy. Both \mathtt{a} and \mathtt{j} take the form of a sequence of letters followed by an ordinal. The letters are a base 26 (a=0, z=25) encoding of the ordering up to Gassmann-equivalence, and the integer following distinguishes groups in the same Gassmann class. (For details on how we label Gassmann classes and order subgroups within a Gassmann class, see Computing labels of subgroups.) For some ambient groups, we only compute subgroups up to automorphism (in which case the first form is used, omitting the \mathtt{j}.

When the ambient group is clear from context, sometimes the short label \mathtt{m.a} or \mathtt{m.a.j} is used instead.

Depends on: Definition 8.3.15 Definition 8.3.19 Definition 8.3.31 Definition 8.3.57 Definition 8.3.71 Definition 8.3.160 Definition 8.3.166

Definition8.3.172
Statement uses 12
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Interdependencies of subgroup properties. (LMFDB)

Certain properties of subgroups automatically imply other properties. We briefly explain the connections here.

A characteristic subgroup is automatically normal, since it is stabilized by all automorphisms including the inner automorphisms.

A cyclic group is always abelian by the way the group operation for cyclic groups is defined. An abelian group is always nilpotent since the group is its own center and thus an upper central series for the group exists. Nilpotent groups are are solvable because the upper central series defining a nilpotent group has abelian subquotients.

A stem subgroup is central by definition, and any central subgroup is abelian since its elements commute with the whole group.

A Sylow subgroup is a p-group and thus nilpotent.

Tau Ceti Review: Subgroup.normal_of_characteristic, IsCyclic.isMulCommutative, CommGroup.isNilpotent, Sylow.isPGroup.

Depends on: Definition 8.3.5 Definition 8.3.19 Definition 8.3.21 Definition 8.3.24 Definition 8.3.37 Definition 8.3.68 Definition 8.3.93 Definition 8.3.149 Definition 8.3.158 Definition 8.3.167 Definition 8.3.175 Definition 8.3.185

Lean code for Definition8.3.172●8 theorems
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Basic.lean
    complete
    theorem Subgroup.normal_of_characteristic.{u_1} {G : Type u_1} [Group G]
      (H : Subgroup G) [h : H.Characteristic] : H.Normal
    theorem Subgroup.normal_of_characteristic.{u_1}
      {G : Type u_1} [Group G]
      (H : Subgroup G)
      [h : H.Characteristic] : H.Normal
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Cyclic/Basic.lean
    complete
    theorem IsCyclic.isMulCommutative.{u_1} {α : Type u_1} [Group α] [IsCyclic α] :
      IsMulCommutative α
    theorem IsCyclic.isMulCommutative.{u_1}
      {α : Type u_1} [Group α] [IsCyclic α] :
      IsMulCommutative α
  • theoremdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    theorem CommGroup.isNilpotent.{u_2} {G : Type u_2} [Group G]
      [IsMulCommutative G] : Group.IsNilpotent G
    theorem CommGroup.isNilpotent.{u_2} {G : Type u_2}
      [Group G] [IsMulCommutative G] :
      Group.IsNilpotent G
    Abelian groups are nilpotent. 
  • theoremdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    theorem IsNilpotent.to_isSolvable.{u_1} {G : Type u_1} [Group G]
      [h : Group.IsNilpotent G] : Group.IsSolvable G
    theorem IsNilpotent.to_isSolvable.{u_1}
      {G : Type u_1} [Group G]
      [h : Group.IsNilpotent G] :
      Group.IsSolvable G
    A nilpotent subgroup is solvable 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/StemExtension.lean
    complete
    theorem Subgroup.IsStem.le_center.{u_2} {E : Type u_2} [Group E]
      {K : Subgroup E} (h : K.IsStem) : K ≤ Subgroup.center E
    theorem Subgroup.IsStem.le_center.{u_2}
      {E : Type u_2} [Group E]
      {K : Subgroup E} (h : K.IsStem) :
      K ≤ Subgroup.center E
    **A stem subgroup is central** (LMFDB `group.subgroup_properties_interdependencies`), by
    definition: it lies in both the centre and the commutator subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupPropertyImplications.lean
    complete
    theorem Subgroup.isMulCommutative_of_le_center.{u_1} {G : Type u_1} [Group G]
      {H : Subgroup G} (h : H ≤ Subgroup.center G) : IsMulCommutative ↥H
    theorem Subgroup.isMulCommutative_of_le_center.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G}
      (h : H ≤ Subgroup.center G) :
      IsMulCommutative ↥H
    **A central subgroup is abelian** (LMFDB `group.subgroup_properties_interdependencies`): its
    elements commute with the whole group. 
  • theoremdefined in Mathlib/GroupTheory/Sylow.lean
    complete
    theorem Sylow.isPGroup.{u_1} {p : ℕ} {G : Type u_1} [Group G] (P : Sylow p G) :
      IsPGroup p ↥↑P
    theorem Sylow.isPGroup.{u_1} {p : ℕ}
      {G : Type u_1} [Group G]
      (P : Sylow p G) : IsPGroup p ↥↑P
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupPropertyImplications.lean
    complete
    theorem Sylow.isNilpotent.{u_1} {G : Type u_1} [Group G] [Finite G] {p : ℕ}
      [Fact (Nat.Prime p)] (P : Sylow p G) : Group.IsNilpotent ↥↑P
    theorem Sylow.isNilpotent.{u_1} {G : Type u_1}
      [Group G] [Finite G] {p : ℕ}
      [Fact (Nat.Prime p)] (P : Sylow p G) :
      Group.IsNilpotent ↥↑P
    **A Sylow subgroup of a finite group is nilpotent** (LMFDB
    `group.subgroup_properties_interdependencies`): it is a `p`-group. 
Definition8.3.173
Statement uses 8
Statement dependency previews
Preview
Definition 8.3.34
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Subgroups beyond an index bound. (LMFDB)

In cases where we do not compute the whole subgroup lattice of a group, we still attempt to compute all subgroups up to a certain index bound. However, we often still want to store the following subgroups, even if they happen to fall beyond the index bound.

  • Since Sylow subgroups are the unique subgroup of their order up to conjugacy, we can compute their labels a priori.

  • We aim to compute the lattice of normal subgroups even when we cannot find all subgroups. In this case, we can use the same scheme described above applied to the lattice or normal subgroups to obtain a label with the letter texttt{.N} appended; such labels are used for non-Sylow normal subgroups beyond the index bound.

  • We store complements of normal subgroups even beyond the index bound so that we can describe groups as semidirect products. Given a normal subgroup with label \texttt{n.i.m.a.c.N}, we label its complements \texttt{n.i.m.a.c.N1}, \texttt{n.i.m.a.c.N2}, \dots. Unfortunately, these labels are not canonical since they depend on the order that complements are produced. Also note that a subgroup can appear as a complement of multiple normal subgroups; in this case we just label it based on the first normal subgroup where it arises.

  • For non-Sylow, non-normal maximal subgroups beyond the index bound, we apply the original labeling scheme restricted to maximal subgroups, and append the letter \texttt{.M}.

  • We also keep core-free subgroups beyond the index bound rather than discarding them, since these yield transitive permutation representations. The labels here are just \texttt{n.i.m.CFk}, where \texttt{k} is a counter arbitrarily running over the core-free subgroups of a given index.

Tau Ceti Review: Equiv.permutationRepresentation.

Depends on: Definition 8.3.34 Definition 8.3.81 Definition 8.3.138 Definition 8.3.160 Definition 8.3.162 Definition 8.3.166 Definition 8.3.167 Definition 8.3.175

Lean code for Definition8.3.173●8 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupsBeyondIndexBound.lean
    complete
    def Subgroup.normalSublattice.{u_1} (G : Type u_1) [Group G] :
      Sublattice (Subgroup G)
    def Subgroup.normalSublattice.{u_1}
      (G : Type u_1) [Group G] :
      Sublattice (Subgroup G)
    The **lattice of normal subgroups** of `G` (LMFDB `group.subgroups_beyond_bound`): the normal
    subgroups are closed under `⊓` and `⊔`, so they form a sublattice of the lattice of subgroups. 
  • defdefined in TauCeti/Algebra/GroupAction/PermutationRepresentation.lean
    complete
    def Equiv.permutationRepresentation.{u_1, u_2} {G : Type u_1} {α : Type u_2}
      [Group G] [MulAction G α] {n : ℕ} (e : α ≃ Fin n) :
      G →* Equiv.Perm (Fin n)
    def Equiv.permutationRepresentation.{u_1, u_2}
      {G : Type u_1} {α : Type u_2} [Group G]
      [MulAction G α] {n : ℕ}
      (e : α ≃ Fin n) :
      G →* Equiv.Perm (Fin n)
    **The permutation representation of a group action, read through an enumeration `e`.** The
    action on `α` is canonical; `e` only names the points. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Label/Subgroup.lean
    complete
    def Subgroup.IsConjugate.{u_1} {G : Type u_1} [Group G] (H K : Subgroup G) :
      Prop
    def Subgroup.IsConjugate.{u_1} {G : Type u_1}
      [Group G] (H K : Subgroup G) : Prop
    Two subgroups `H` and `K` of `G` are **conjugate** (LMFDB `group.subgroup_label`) if
    `K = g H g⁻¹` for some `g ∈ G`. The LMFDB label `N.i.m.a.j` of a subgroup identifies its class for
    this relation. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupsBeyondIndexBound.lean
    complete
    theorem Sylow.natCard_eq_iff_isConjugate.{u_1} {G : Type u_1} [Group G]
      {H : Subgroup G} [Finite G] {p : ℕ} [Fact (Nat.Prime p)]
      (P : Sylow p G) : Nat.card ↥H = Nat.card ↥↑P ↔ (↑P).IsConjugate H
    theorem Sylow.natCard_eq_iff_isConjugate.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} [Finite G] {p : ℕ}
      [Fact (Nat.Prime p)] (P : Sylow p G) :
      Nat.card ↥H = Nat.card ↥↑P ↔
        (↑P).IsConjugate H
    **The Sylow subgroups are the unique subgroups of their order up to conjugacy** (LMFDB
    `group.subgroups_beyond_bound`): in a finite group, a subgroup has the order of a Sylow
    `p`-subgroup `P` if and only if it is conjugate to `P`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupsBeyondIndexBound.lean
    complete
    theorem Subgroup.one_lt_ncard_setOf_normal_isComplement'_kleinFour :
      1 <
        {N |
            N.Normal ∧
              N.IsComplement'
                (Subgroup.zpowers (Multiplicative.ofAdd (1, 0)))}.ncard
    theorem Subgroup.one_lt_ncard_setOf_normal_isComplement'_kleinFour :
      1 <
        {N |
            N.Normal ∧
              N.IsComplement'
                (Subgroup.zpowers
                  (Multiplicative.ofAdd
                    (1, 0)))}.ncard
    **A subgroup can be a complement of several normal subgroups** (LMFDB
    `group.subgroups_beyond_bound`): in the Klein four group `C_2 × C_2`, the subgroup generated by
    `(1, 0)` is a complement of more than one normal subgroup, namely of the subgroups generated by
    `(0, 1)` and by `(1, 1)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupsBeyondIndexBound.lean
    complete
    theorem Subgroup.faithfulSMul_quotient_iff.{u_1} {G : Type u_1} [Group G]
      {H : Subgroup G} : FaithfulSMul G (G ⧸ H) ↔ H.normalCore = ⊥
    theorem Subgroup.faithfulSMul_quotient_iff.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} :
      FaithfulSMul G (G ⧸ H) ↔
        H.normalCore = ⊥
    **`G` acts faithfully on the cosets of `H` if and only if `H` is core-free** (LMFDB
    `group.subgroups_beyond_bound`, `group.core`): the kernel of the action is the normal core of
    `H`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupsBeyondIndexBound.lean
    complete
    theorem Subgroup.injective_permutationRepresentation.{u_1} {G : Type u_1}
      [Group G] {H : Subgroup G} {n : ℕ} (hH : H.normalCore = ⊥)
      (e : G ⧸ H ≃ Fin n) : Function.Injective ⇑e.permutationRepresentation
    theorem Subgroup.injective_permutationRepresentation.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} {n : ℕ}
      (hH : H.normalCore = ⊥)
      (e : G ⧸ H ≃ Fin n) :
      Function.Injective
        ⇑e.permutationRepresentation
    **A core-free subgroup yields a faithful permutation representation** (LMFDB
    `group.subgroups_beyond_bound`, `group.permutation_representation`): if `H` has trivial normal
    core, the permutation representation `G →* S_n` of the action on the `n = [G : H]` cosets of `H`,
    through any enumeration `e` of the cosets, is injective. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SubgroupsBeyondIndexBound.lean
    complete
    theorem Subgroup.exists_permutationRepresentation_apply_eq.{u_1} {G : Type u_1}
      [Group G] {H : Subgroup G} {n : ℕ} (e : G ⧸ H ≃ Fin n) (i j : Fin n) :
      ∃ g, (e.permutationRepresentation g) i = j
    theorem Subgroup.exists_permutationRepresentation_apply_eq.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} {n : ℕ}
      (e : G ⧸ H ≃ Fin n) (i j : Fin n) :
      ∃ g,
        (e.permutationRepresentation g) i = j
    **The action on the cosets of a subgroup yields a transitive permutation representation**
    (LMFDB `group.subgroups_beyond_bound`, `group.permutation_representation`): through any
    enumeration `e` of the `n` cosets of `H`, every `i` is mapped to every `j` by some `g`. 
Definition8.3.174
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.3.83
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Supersolvable group. (LMFDB)

A group is supersolvable if there are nested normal subgroups N_i\lhd G

{1}=N_0 < N_1 < N_2 < \ldots < N_k = G

with all successive quotients N_{i+1}/N_i cyclic. It is stronger than requiring N_{i+1}/N_i to be abelian (because N_i \lhd G), so not all solvable groups are supersolvable. The smallest solvable groups that are not supersolvable are A_4, S_4, SL_2(\mathbb{F}_3) and C_2\times A_4. All supersolvable groups are monomial, and all abelian, nilpotent, metacyclic groups, Z-groups and groups of square-free order are supersolvable. Supersolvable groups are closed under subgroups and quotients (but not extensions), and a group is supersolvable if and only if each of its maximal subgroups has prime index.

While every nilpotent group is supersolvable, the converse does not hold as shown by these examples. Similarly, these examples show that not every supersolvable group is metacyclic.

Depends on: Definition 8.3.5 Definition 8.3.93 Definition 8.3.149 Definition 8.3.167

Definition8.3.175
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 5.2.64
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Sylow subgroup. (LMFDB)

If p is a prime and G is a finite group of order p^nm where p\nmid m, then a p-Sylow subgroup of G is any subgroup of order p^n.

Sylow subgroups exist for every finite group and prime p.

Tau Ceti Review: Sylow, Sylow.card_eq_multiplicity, Sylow.ofCard, Sylow.nonempty.

Depends on: Definition 8.3.3 Definition 8.3.97 Definition 8.3.160

Lean code for Definition8.3.175●4 declarations
  • structure(extends 3, 5 fields)defined in Mathlib/GroupTheory/Sylow.lean
    complete
    structure Sylow.{u_1} (p : ℕ) (G : Type u_1) [Group G] : Type u_1
    structure Sylow.{u_1} (p : ℕ) (G : Type u_1)
      [Group G] : Type u_1
    A Sylow `p`-subgroup is a maximal `p`-subgroup. 
    • Subgroup G
    carrier : Set G
    Inherited from
    1. Subgroup
    2. Submonoid
    3. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ (↑self).carrier → b ∈ (↑self).carrier → a * b ∈ (↑self).carrier
    Inherited from
    1. Subgroup
    2. Submonoid
    3. Subsemigroup
    one_mem' : 1 ∈ (↑self).carrier
    Inherited from
    1. Subgroup
    2. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ (↑self).carrier → x⁻¹ ∈ (↑self).carrier
    Inherited from
    1. Subgroup
    maximal_isPGroup : Maximal (fun x => IsPGroup p ↥x) ↑self
  • theoremdefined in Mathlib/GroupTheory/Sylow.lean
    complete
    theorem Sylow.card_eq_multiplicity.{u} {G : Type u} [Group G] [Finite G] {p : ℕ}
      [hp : Fact (Nat.Prime p)] (P : Sylow p G) :
      Nat.card ↥↑P = p ^ (Nat.card G).factorization p
    theorem Sylow.card_eq_multiplicity.{u}
      {G : Type u} [Group G] [Finite G]
      {p : ℕ} [hp : Fact (Nat.Prime p)]
      (P : Sylow p G) :
      Nat.card ↥↑P =
        p ^ (Nat.card G).factorization p
    The cardinality of a Sylow subgroup is `p ^ n`
    where `n` is the multiplicity of `p` in the group order. 
  • defdefined in Mathlib/GroupTheory/Sylow.lean
    complete
    def Sylow.ofCard.{u_1} {G : Type u_1} [Group G] [Finite G] {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup G)
      (card_eq : Nat.card ↥H = p ^ (Nat.card G).factorization p) : Sylow p G
    def Sylow.ofCard.{u_1} {G : Type u_1}
      [Group G] [Finite G] {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup G)
      (card_eq :
        Nat.card ↥H =
          p ^ (Nat.card G).factorization p) :
      Sylow p G
    A subgroup with cardinality `p ^ n` is a Sylow subgroup
    where `n` is the multiplicity of `p` in the group order. 
  • theoremdefined in Mathlib/GroupTheory/Sylow.lean
    complete
    theorem Sylow.nonempty.{u_1} {p : ℕ} {G : Type u_1} [Group G] :
      Nonempty (Sylow p G)
    theorem Sylow.nonempty.{u_1} {p : ℕ}
      {G : Type u_1} [Group G] :
      Nonempty (Sylow p G)
Definition8.3.176
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.13
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.2.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Symmetric group. (LMFDB)

The symmetric group is the group S_n of bijections from n element sets to themselves (called permutations), which is of order n!. This group is solvable for n\leq 4 and almost simple since S_n=A_n\rtimes C_2 for n\geq 5.

Tau Ceti Review: Equiv.Perm, Fintype.card_perm, Equiv.Perm.isSolvable.

Depends on: Definition 8.3.13 Definition 8.3.149

Lean code for Definition8.3.176●6 declarations
  • abbrevdefined in Mathlib/Logic/Equiv/Defs.lean
    complete
    abbrev Equiv.Perm.{u_1} (α : Sort u_1) : Sort (max 1 u_1)
    abbrev Equiv.Perm.{u_1} (α : Sort u_1) :
      Sort (max 1 u_1)
    `Perm α` is the type of bijections from `α` to itself. 
  • theoremdefined in Mathlib/Data/Fintype/Perm.lean
    complete
    theorem Fintype.card_perm.{u_1} {α : Type u_1} [DecidableEq α] [Fintype α] :
      Fintype.card (Equiv.Perm α) = (Fintype.card α).factorial
    theorem Fintype.card_perm.{u_1} {α : Type u_1}
      [DecidableEq α] [Fintype α] :
      Fintype.card (Equiv.Perm α) =
        (Fintype.card α).factorial
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Alternating/Simple.lean
    complete
    theorem Equiv.Perm.isSolvable.{u_1} {α : Type u_1} [Finite α]
      (hα : Nat.card α ≤ 4) : Group.IsSolvable (Equiv.Perm α)
    theorem Equiv.Perm.isSolvable.{u_1} {α : Type u_1}
      [Finite α] (hα : Nat.card α ≤ 4) :
      Group.IsSolvable (Equiv.Perm α)
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/QuasisimpleAlmostSimple.lean
    complete
    theorem Equiv.Perm.isAlmostSimple.{u_2} {α : Type u_2} [DecidableEq α]
      [Fintype α] (h5 : 5 ≤ Nat.card α) : IsAlmostSimple (Equiv.Perm α)
    theorem Equiv.Perm.isAlmostSimple.{u_2}
      {α : Type u_2} [DecidableEq α]
      [Fintype α] (h5 : 5 ≤ Nat.card α) :
      IsAlmostSimple (Equiv.Perm α)
    **The symmetric group `S_n` is almost simple for `n ≥ 5`** (LMFDB `group.quasisimple`,
    `group.almost_simple`): the alternating group `A_n` is a simple normal subgroup with trivial
    centraliser. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/AlternatingSemidirect.lean
    complete
    def alternatingGroup.semidirectProductMulEquiv.{u_1} {α : Type u_1}
      [DecidableEq α] [Fintype α] {a b : α} (hab : a ≠ b) :
      ↥(alternatingGroup α) ⋊[alternatingGroup.swapConjAction hab]
          Multiplicative (ZMod 2) ≃*
        Equiv.Perm α
    def alternatingGroup.semidirectProductMulEquiv.{u_1}
      {α : Type u_1} [DecidableEq α]
      [Fintype α] {a b : α} (hab : a ≠ b) :
      ↥(alternatingGroup
              α) ⋊[alternatingGroup.swapConjAction
            hab]
          Multiplicative (ZMod 2) ≃*
        Equiv.Perm α
    **The symmetric group is a semidirect product `S_n = A_n ⋊ C_2`** (LMFDB `group.symmetric`),
    for `C_2` acting on the alternating group `A_n` by conjugation by a transposition `(a b)`: the
    isomorphism sends `(x, g)` to `x (a b)ᵏ` for `g` the `k`-th power of the generator of `C_2`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/AlternatingSemidirect.lean
    complete
    theorem alternatingGroup.isComplement'_zpowers_swap.{u_1} {α : Type u_1}
      [DecidableEq α] [Fintype α] {a b : α} (hab : a ≠ b) :
      (alternatingGroup α).IsComplement' (Subgroup.zpowers (Equiv.swap a b))
    theorem alternatingGroup.isComplement'_zpowers_swap.{u_1}
      {α : Type u_1} [DecidableEq α]
      [Fintype α] {a b : α} (hab : a ≠ b) :
      (alternatingGroup α).IsComplement'
        (Subgroup.zpowers (Equiv.swap a b))
    **The subgroup generated by a transposition is a complement of the alternating group**
    (LMFDB `group.symmetric`): it has order `2`, the index of `A_n`, and meets `A_n` trivially, a
    transposition being odd. 
Definition8.3.177
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.20
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.3.12
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Symplectic group. (LMFDB)

The symplectic group \Sp(2n, q) is the group of invertible 2n \times 2n matrices M with entries in \F_q, which satisfy the condition that M^T \Omega M = \Omega, for \Omega is any fixed invertible skew-symmetric matrix over \F_q. For example, \Omega can be taken to be the block matrix

\Omega = \begin{pmatrix} 0 & I_n \\ -I_n & 0 \end{pmatrix},

where I_n is the n \times n identity matrix.

The projective symplectic group \PSp(2n, q) is the quotient of \Sp(2n, q) by the scalar matrices in \Sp(2n, q) (equivalently, \PSp(2n, q) is the quotient of \Sp(2n, q) by its center).

(see , pages x-xi)

Tau Ceti Review: Matrix.symplecticGroup, Matrix.J, Subgroup.center, TauCeti.GLSymplecticFin.mem_center_iff.

Depends on: Definition 8.3.20 Definition 8.3.118

Lean code for Definition8.3.177●12 declarations
  • defdefined in Mathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.symplecticGroup.{u_1, u_2} (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R] [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    def Matrix.symplecticGroup.{u_1, u_2}
      (l : Type u_1) (R : Type u_2)
      [DecidableEq l] [CommRing R]
      [Fintype l] :
      Submonoid (Matrix (l ⊕ l) (l ⊕ l) R)
    The group of symplectic matrices over a ring `R`. 
  • defdefined in Mathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.J.{u_1, u_2} (l : Type u_1) (R : Type u_2) [DecidableEq l]
      [CommRing R] : Matrix (l ⊕ l) (l ⊕ l) R
    def Matrix.J.{u_1, u_2} (l : Type u_1)
      (R : Type u_2) [DecidableEq l]
      [CommRing R] : Matrix (l ⊕ l) (l ⊕ l) R
    The matrix defining the canonical skew-symmetric bilinear form. 
  • defdefined in Mathlib/GroupTheory/Subgroup/Center.lean
    complete
    def Subgroup.center.{u_1} (G : Type u_1) [Group G] : Subgroup G
    def Subgroup.center.{u_1} (G : Type u_1)
      [Group G] : Subgroup G
    The center of a group `G` is the set of elements that commute with everything in `G` 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.isometryGroup.{u_1, u_4} {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {R : Type u_4} [CommRing R] (Ω : Matrix ι ι R) :
      Subgroup (GL ι R)
    def Matrix.isometryGroup.{u_1, u_4}
      {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {R : Type u_4}
      [CommRing R] (Ω : Matrix ι ι R) :
      Subgroup (GL ι R)
    The **isometry group** of a square matrix `Ω`: the invertible matrices `M` with
    `Mᵀ * Ω * M = Ω`, which preserve the bilinear form `(x, y) ↦ xᵀ Ω y`. For an invertible
    alternating `Ω` over a field it is the **symplectic group** `Sp(Ω)` (LMFDB `group.symplectic`),
    which up to conjugation in `GL` does not depend on `Ω`
    (`Matrix.exists_map_conj_isometryGroup_eq_of_isAlt`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    theorem Matrix.isAlt_toBilin'_J.{u_3, u_4} (l : Type u_3) [Fintype l]
      [DecidableEq l] (R : Type u_4) [CommRing R] :
      (Matrix.toBilin' (Matrix.J l R)).IsAlt
    theorem Matrix.isAlt_toBilin'_J.{u_3, u_4}
      (l : Type u_3) [Fintype l]
      [DecidableEq l] (R : Type u_4)
      [CommRing R] :
      (Matrix.toBilin' (Matrix.J l R)).IsAlt
    **Mathlib's matrix `J` is alternating**: `xᵀ J x = 0` for every vector `x`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    theorem Matrix.exists_transpose_mul_mul_eq_of_isAlt.{u_1, u_4} {ι : Type u_1}
      [Fintype ι] [DecidableEq ι] {F : Type u_4} [Field F]
      {Ω Ω' : Matrix ι ι F} (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω) (hΩ' : (Matrix.toBilin' Ω').IsAlt)
      (hΩ'u : IsUnit Ω') : ∃ P, (↑P).transpose * Ω * ↑P = Ω'
    theorem Matrix.exists_transpose_mul_mul_eq_of_isAlt.{u_1,
        u_4}
      {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {F : Type u_4} [Field F]
      {Ω Ω' : Matrix ι ι F}
      (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω)
      (hΩ' : (Matrix.toBilin' Ω').IsAlt)
      (hΩ'u : IsUnit Ω') :
      ∃ P, (↑P).transpose * Ω * ↑P = Ω'
    **Two invertible alternating matrices of the same size over a field are congruent**: there is
    an invertible `P` with `Pᵀ * Ω * P = Ω'`. By Tau Ceti's symplectic basis theorem, both bilinear
    forms have the matrix `J` in some bases, and `P` is the matrix of the automorphism carrying one
    basis to the other. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    theorem Matrix.exists_map_conj_isometryGroup_eq_of_isAlt.{u_1, u_4}
      {ι : Type u_1} [Fintype ι] [DecidableEq ι] {F : Type u_4} [Field F]
      {Ω Ω' : Matrix ι ι F} (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω) (hΩ' : (Matrix.toBilin' Ω').IsAlt)
      (hΩ'u : IsUnit Ω') :
      ∃ P,
        Subgroup.map (↑(MulAut.conj P)) Ω.isometryGroup = Ω'.isometryGroup
    theorem Matrix.exists_map_conj_isometryGroup_eq_of_isAlt.{u_1,
        u_4}
      {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {F : Type u_4} [Field F]
      {Ω Ω' : Matrix ι ι F}
      (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω)
      (hΩ' : (Matrix.toBilin' Ω').IsAlt)
      (hΩ'u : IsUnit Ω') :
      ∃ P,
        Subgroup.map (↑(MulAut.conj P))
            Ω.isometryGroup =
          Ω'.isometryGroup
    **The isometry groups of two invertible alternating matrices of the same size over a field are
    conjugate in `GL`**, so the symplectic group `Sp(Ω)` does not depend on the choice of `Ω` (LMFDB
    `group.symplectic`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.isometryGroupEquivOfIsAlt.{u_1, u_4} {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {F : Type u_4} [Field F] {Ω Ω' : Matrix ι ι F}
      (hΩ : (Matrix.toBilin' Ω).IsAlt) (hΩu : IsUnit Ω)
      (hΩ' : (Matrix.toBilin' Ω').IsAlt) (hΩ'u : IsUnit Ω') :
      ↥Ω.isometryGroup ≃* ↥Ω'.isometryGroup
    def Matrix.isometryGroupEquivOfIsAlt.{u_1,
        u_4}
      {ι : Type u_1} [Fintype ι]
      [DecidableEq ι] {F : Type u_4} [Field F]
      {Ω Ω' : Matrix ι ι F}
      (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω)
      (hΩ' : (Matrix.toBilin' Ω').IsAlt)
      (hΩ'u : IsUnit Ω') :
      ↥Ω.isometryGroup ≃* ↥Ω'.isometryGroup
    An isomorphism between the isometry groups of two invertible alternating matrices of the same
    size over a field (LMFDB `group.symplectic`): conjugation by an invertible matrix `P` with
    `Pᵀ * Ω * P = Ω'`, chosen by `Matrix.exists_transpose_mul_mul_eq_of_isAlt`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    theorem Matrix.isometryGroup_neg_J.{u_3, u_4} (l : Type u_3) [Fintype l]
      [DecidableEq l] (R : Type u_4) [CommRing R] :
      (-Matrix.J l R).isometryGroup = TauCeti.GLSymplectic l R
    theorem Matrix.isometryGroup_neg_J.{u_3, u_4}
      (l : Type u_3) [Fintype l]
      [DecidableEq l] (R : Type u_4)
      [CommRing R] :
      (-Matrix.J l R).isometryGroup =
        TauCeti.GLSymplectic l R
    **The isometry group of the LMFDB's example `Ω = [[0, I], [-I, 0]]`, which is `-J`, is Tau
    Ceti's `TauCeti.GLSymplectic`.** 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    theorem Matrix.exists_map_conj_map_reindexGL_isometryGroup_eq.{u_1, u_3, u_4}
      {ι : Type u_1} {l : Type u_3} [Fintype ι] [DecidableEq ι] [Fintype l]
      [DecidableEq l] {F : Type u_4} [Field F] {Ω : Matrix ι ι F}
      (e : ι ≃ l ⊕ l) (hΩ : (Matrix.toBilin' Ω).IsAlt) (hΩu : IsUnit Ω) :
      ∃ P,
        Subgroup.map (↑(MulAut.conj P))
            (Subgroup.map (↑(e.reindexGL F)) Ω.isometryGroup) =
          TauCeti.GLSymplectic l F
    theorem Matrix.exists_map_conj_map_reindexGL_isometryGroup_eq.{u_1,
        u_3, u_4}
      {ι : Type u_1} {l : Type u_3}
      [Fintype ι] [DecidableEq ι] [Fintype l]
      [DecidableEq l] {F : Type u_4} [Field F]
      {Ω : Matrix ι ι F} (e : ι ≃ l ⊕ l)
      (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω) :
      ∃ P,
        Subgroup.map (↑(MulAut.conj P))
            (Subgroup.map (↑(e.reindexGL F))
              Ω.isometryGroup) =
          TauCeti.GLSymplectic l F
    **After reindexing, the isometry group of an invertible alternating matrix is conjugate to
    Mathlib's symplectic group** (LMFDB `group.symplectic`): for an equivalence `e : ι ≃ l ⊕ l`,
    reindexing along `e` and then conjugating carry the isometry group of `Ω` onto
    `TauCeti.GLSymplectic l F`, the subgroup of `GL` of the matrices in `Matrix.symplecticGroup l F`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/SymplecticGroup.lean
    complete
    def Matrix.isometryGroupEquivSymplecticGroup.{u_1, u_3, u_4} {ι : Type u_1}
      {l : Type u_3} [Fintype ι] [DecidableEq ι] [Fintype l] [DecidableEq l]
      {F : Type u_4} [Field F] {Ω : Matrix ι ι F} (e : ι ≃ l ⊕ l)
      (hΩ : (Matrix.toBilin' Ω).IsAlt) (hΩu : IsUnit Ω) :
      ↥Ω.isometryGroup ≃* ↥(Matrix.symplecticGroup l F)
    def Matrix.isometryGroupEquivSymplecticGroup.{u_1,
        u_3, u_4}
      {ι : Type u_1} {l : Type u_3}
      [Fintype ι] [DecidableEq ι] [Fintype l]
      [DecidableEq l] {F : Type u_4} [Field F]
      {Ω : Matrix ι ι F} (e : ι ≃ l ⊕ l)
      (hΩ : (Matrix.toBilin' Ω).IsAlt)
      (hΩu : IsUnit Ω) :
      ↥Ω.isometryGroup ≃*
        ↥(Matrix.symplecticGroup l F)
    An isomorphism between the isometry group of an invertible alternating matrix and Mathlib's
    symplectic group `Matrix.symplecticGroup l F` (LMFDB `group.symplectic`), for an equivalence
    `e : ι ≃ l ⊕ l`: reindex along `e`, conjugate onto the isometry group of `J`
    (`Matrix.isometryGroupEquivOfIsAlt`), which is `TauCeti.GLSymplectic l F`, and apply Tau Ceti's
    `TauCeti.GLSymplectic.mulEquivSymplecticGroup`. 
  • theoremdefined in TauCeti/LinearAlgebra/Matrix/GeneralLinearGroup/Symplectic/Center.lean
    complete
    theorem TauCeti.GLSymplecticFin.mem_center_iff.{u_1} {R : Type u_1} [CommRing R]
      {m : ℕ} (hm : m ≠ 0) (g : ↥(TauCeti.GLSymplecticFin m R)) :
      g ∈ Subgroup.center ↥(TauCeti.GLSymplecticFin m R) ↔
        ∃ c, ↑↑g = (Matrix.scalar (Fin (m + m))) c ∧ c ^ 2 = 1
    theorem TauCeti.GLSymplecticFin.mem_center_iff.{u_1}
      {R : Type u_1} [CommRing R] {m : ℕ}
      (hm : m ≠ 0)
      (g : ↥(TauCeti.GLSymplecticFin m R)) :
      g ∈
          Subgroup.center
            ↥(TauCeti.GLSymplecticFin m R) ↔
        ∃ c,
          ↑↑g =
              (Matrix.scalar (Fin (m + m)))
                c ∧
            c ^ 2 = 1
    In positive rank the center of the symplectic group consists exactly of scalar matrices
    whose scalar squares to one. No reducedness or characteristic assumption is needed. 
Definition8.3.178
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 1.2.58
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Torsion group. (LMFDB)

A torsion group is a group in which every element has finite order.

The elements of finite order in an abelian group A form a torsion group called the torsion subgroup of A.

Tau Ceti Review: IsMulTorsion, CommGroup.torsion, AddCommGroup.torsion.

Depends on: Definition 8.3.3 Definition 8.3.5

Lean code for Definition8.3.178●3 definitions
  • defdefined in Mathlib/GroupTheory/Torsion.lean
    complete
    def IsMulTorsion.{u_1} (G : Type u_1) [Monoid G] : Prop
    def IsMulTorsion.{u_1} (G : Type u_1)
      [Monoid G] : Prop
    A predicate on a monoid saying that all elements are of finite order. 
  • defdefined in Mathlib/GroupTheory/Torsion.lean
    complete
    def CommGroup.torsion.{u_1} (G : Type u_1) [CommGroup G] : Subgroup G
    def CommGroup.torsion.{u_1} (G : Type u_1)
      [CommGroup G] : Subgroup G
    The torsion subgroup of an abelian group. 
  • defdefined in Mathlib/GroupTheory/Torsion.lean
    complete
    def AddCommGroup.torsion.{u_1} (G : Type u_1) [AddCommGroup G] :
      AddSubgroup G
    def AddCommGroup.torsion.{u_1} (G : Type u_1)
      [AddCommGroup G] : AddSubgroup G
    The torsion additive subgroup of an additive abelian group. 
Definition8.3.179
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Transitive degree. (LMFDB)

Given a finite group G, we call the minimal degree of a faithful transitive permutation representation of G the minimal transitive degree of G.

Equivalently, it is the smallest positive integer n such that S_n has a transitive subgroup isomorphic to G.

This can be computed as the minimal index of a subgroup with trivial core.

Depends on: Definition 8.3.3 Definition 8.3.34 Definition 8.3.108 Definition 8.3.160 Definition 8.3.166

Lean code for Definition8.3.179●6 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalDegree.lean
    complete
    def Group.minTransitiveDegree.{u_1} (G : Type u_1) [Group G] : ℕ
    def Group.minTransitiveDegree.{u_1}
      (G : Type u_1) [Group G] : ℕ
    The **minimal transitive degree** of a finite group `G` (LMFDB `group.transitive_degree`): the
    least positive integer `n` such that `G` embeds in the symmetric group `S_n` as a transitive
    subgroup, i.e. has a faithful transitive permutation representation of degree `n`. For an infinite
    group there is no such `n`, and the value is the junk `0`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalDegree.lean
    complete
    theorem Group.exists_injective_isTransitive_minTransitiveDegree.{u_1}
      (G : Type u_1) [Group G] [Finite G] :
      ∃ f,
        Function.Injective ⇑f ∧
          ∀ (i j : Fin (Group.minTransitiveDegree G)), ∃ g, (f g) i = j
    theorem Group.exists_injective_isTransitive_minTransitiveDegree.{u_1}
      (G : Type u_1) [Group G] [Finite G] :
      ∃ f,
        Function.Injective ⇑f ∧
          ∀
            (i j :
              Fin
                (Group.minTransitiveDegree
                  G)),
            ∃ g, (f g) i = j
    **`G` embeds in `S_n` as a transitive subgroup for `n` its minimal transitive degree.** 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalDegree.lean
    complete
    theorem Group.minTransitiveDegree_le.{u_1} {G : Type u_1} [Group G] {n : ℕ}
      {f : G →* Equiv.Perm (Fin n)} (hn : 0 < n)
      (hf : Function.Injective ⇑f)
      (ht : ∀ (i j : Fin n), ∃ g, (f g) i = j) :
      Group.minTransitiveDegree G ≤ n
    theorem Group.minTransitiveDegree_le.{u_1}
      {G : Type u_1} [Group G] {n : ℕ}
      {f : G →* Equiv.Perm (Fin n)}
      (hn : 0 < n)
      (hf : Function.Injective ⇑f)
      (ht :
        ∀ (i j : Fin n), ∃ g, (f g) i = j) :
      Group.minTransitiveDegree G ≤ n
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalTransitiveDegreeCoreFree.lean
    complete
    theorem Group.isLeast_pretransitive_minTransitiveDegree.{u_1} (G : Type u_1)
      [Group G] [Finite G] :
      IsLeast
        {n |
          0 < n ∧
            ∃ K,
              MulAction.IsPretransitive (↥K) (Fin n) ∧ Nonempty (G ≃* ↥K)}
        (Group.minTransitiveDegree G)
    theorem Group.isLeast_pretransitive_minTransitiveDegree.{u_1}
      (G : Type u_1) [Group G] [Finite G] :
      IsLeast
        {n |
          0 < n ∧
            ∃ K,
              MulAction.IsPretransitive (↥K)
                  (Fin n) ∧
                Nonempty (G ≃* ↥K)}
        (Group.minTransitiveDegree G)
    **The minimal transitive degree of `G` is the least positive `n` such that `S_n` has a
    transitive subgroup isomorphic to `G`** (LMFDB `group.transitive_degree`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalTransitiveDegreeCoreFree.lean
    complete
    theorem Group.isLeast_index_minTransitiveDegree.{u_1} (G : Type u_1) [Group G]
      [Finite G] :
      IsLeast {n | ∃ H, H.normalCore = ⊥ ∧ H.index = n}
        (Group.minTransitiveDegree G)
    theorem Group.isLeast_index_minTransitiveDegree.{u_1}
      (G : Type u_1) [Group G] [Finite G] :
      IsLeast
        {n |
          ∃ H, H.normalCore = ⊥ ∧ H.index = n}
        (Group.minTransitiveDegree G)
    **The minimal transitive degree of `G` is the least index of a subgroup of `G` with trivial
    normal core** (LMFDB `group.transitive_degree`, `group.core`): the index of a resolvent subgroup
    for the trivial normal subgroup, `Subgroup.IsResolventSubgroup.index_eq_minTransitiveDegree`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MinimalTransitiveDegreeCoreFree.lean
    complete
    theorem Group.minTransitiveDegree_congr.{u_1, u_2} {G : Type u_1}
      {G' : Type u_2} [Group G] [Group G'] (e : G ≃* G') :
      Group.minTransitiveDegree G = Group.minTransitiveDegree G'
    theorem Group.minTransitiveDegree_congr.{u_1, u_2}
      {G : Type u_1} {G' : Type u_2} [Group G]
      [Group G'] (e : G ≃* G') :
      Group.minTransitiveDegree G =
        Group.minTransitiveDegree G'
    **Isomorphic groups have the same minimal transitive degree.** 
Definition8.3.180
uses 0
Used by 3
Reverse dependency previews
Preview
Definition 4.8.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Triangle group. (LMFDB)

Given positive integers l, m, n \ge 2, the triangle group \Delta(l, m, n) is given by the presentation \langle a, b, c | a^2 = b^2 = c^2 = (ab)^l = (bc)^m = (ca)^n \rangle. It is a Coxeter group, and forms the symmetry group of a tiling of either the sphere (if \frac1l + \frac1m + \frac1n > 1), the Euclidean plane (if \frac1l + \frac1m + \frac1n = 1) or the hyperbolic plane (if \frac1l + \frac1m + \frac1n < 1) by triangles with angles \frac{\pi}l, \frac{\pi}m and \frac{\pi}n.

The Von Dyck group D(l, m, n) is the subgroup of index 2 generated by x = ab, y = bc and z = ca. It has presentation \langle x, y | x^l = y^m = (xy)^n \rangle and can be interpreted as the orientation preserving elements of the triangle group.

Definition8.3.181
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Trivial subgroup. (LMFDB)

If G is a group with identity element e, then \{e\} is a subgroup isomorphic to the trivial group. It is the trivial subgroup of G, and all other subgroups are non-trivial.

Tau Ceti Review: Subgroup.mem_bot.

Depends on: Definition 1.1.5 Definition 8.3.3 Definition 8.3.160

Lean code for Definition8.3.181●1 theorem
  • theoremdefined in Mathlib/Algebra/Group/Subgroup/Lattice.lean
    complete
    theorem Subgroup.mem_bot.{u_1} {G : Type u_1} [Group G] {x : G} : x ∈ ⊥ ↔ x = 1
    theorem Subgroup.mem_bot.{u_1} {G : Type u_1}
      [Group G] {x : G} : x ∈ ⊥ ↔ x = 1
Definition8.3.182
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Type of groups. (LMFDB)

For a finite group G, we write Type - length as follows

<ul> <li> If G is cyclic we write "Cyclic". For abelian groups that are not cyclic we write "Abelian - n", where n is the number of cyclic groups in the unique cyclic decomposition of G as C_{d_1} \times C_{d_2}\times \cdots \times C_{d_n} with d_i\mid d_{i+1} and d_i>0.</li>

<li> If G is nilpotent but not abelian then we write "Nilpotent - n", where n is the nilpotency class of G.</li>

<li> If G is solvable but not nilpotent then we write "Solvable - n", where n is the derived length of G.</li>

<li> If G is simple we write "Simple".

<li> For non-simple, non-solvable groups we write "Non-solvable - n", where n is the number of Jordan factors of G.</li> </ul>

Tau Ceti Review: Group.nilpotencyClass.

Depends on: Definition 8.3.3 Definition 8.3.5 Definition 8.3.37 Definition 8.3.38 Definition 8.3.93 Definition 8.3.149

Lean code for Definition8.3.182●8 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/TypeLength.lean
    complete
    def Group.typeLength.{u_1} (G : Type u_1) [Group G] [Finite G] :
      Group.TypeLength
    def Group.typeLength.{u_1} (G : Type u_1)
      [Group G] [Finite G] : Group.TypeLength
    The **Type - length** of a finite group `G` (LMFDB `group.type`): "Cyclic", "Abelian - n" with
    `n` the number of invariant factors, "Nilpotent - n" with `n` the nilpotency class, "Solvable - n"
    with `n` the derived length, "Simple", or "Non-solvable - n" with `n` the composition length, the
    first that applies. 
  • inductive(6 constructors)defined in LeanBridge/ForMathlib/GroupTheory/TypeLength.lean
    complete
    inductive Group.TypeLength : Type
    inductive Group.TypeLength : Type
    The **Type - length** descriptors of finite groups used by the LMFDB (LMFDB `group.type`). 
    Group.TypeLength.cyclic : Group.TypeLength
    "Cyclic". 
    Group.TypeLength.abelian (n : ℕ) : Group.TypeLength
    "Abelian - n", `n` the number of invariant factors. 
    Group.TypeLength.nilpotent (n : ℕ) : Group.TypeLength
    "Nilpotent - n", `n` the nilpotency class. 
    Group.TypeLength.solvable (n : ℕ) : Group.TypeLength
    "Solvable - n", `n` the derived length. 
    Group.TypeLength.simple : Group.TypeLength
    "Simple". 
    Group.TypeLength.nonsolvable (n : ℕ) : Group.TypeLength
    "Non-solvable - n", `n` the number of composition factors. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/TypeLength.lean
    complete
    def Group.compositionLength.{u_1} (G : Type u_1) [Group G] : ℕ
    def Group.compositionLength.{u_1}
      (G : Type u_1) [Group G] : ℕ
    The **composition length** of `G` (LMFDB `group.type`), its number of composition factors
    ("Jordan factors"): the least length of a composition series of `G`, a subnormal series with
    simple factors (`0` if there is none). 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/DerivedLength.lean
    complete
    def derivedLength.{u_1} (G : Type u_1) [Group G] : ℕ
    def derivedLength.{u_1} (G : Type u_1)
      [Group G] : ℕ
    The **derived length** (LMFDB `group.derived_series`) of `G`, the least `k` such that
    `G⁽ᵏ⁺¹⁾ = G⁽ᵏ⁾` in the derived series `G = G⁽⁰⁾ ⊵ G⁽¹⁾ ⊵ ⋯`. Such a `k` exists for finite `G`;
    otherwise this is `0` by convention. For solvable `G` it is the least `k` with `G⁽ᵏ⁾ = 1`. 
  • defdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    def Group.nilpotencyClass.{u_1} (G : Type u_1) [Group G] : ℕ
    def Group.nilpotencyClass.{u_1} (G : Type u_1)
      [Group G] : ℕ
    The nilpotency class of a nilpotent group is the smallest natural `n` such that
    the `n`-th term of the upper central series is `G`. If `G` is not nilpotent then the nilpotency
    class takes the junk value 0. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/CompositionLength.lean
    complete
    theorem Subgroup.SubnormalSeries.exists_isComposition.{u_1} {G : Type u_1}
      [Group G] [Finite G] : ∃ s, s.IsComposition
    theorem Subgroup.SubnormalSeries.exists_isComposition.{u_1}
      {G : Type u_1} [Group G] [Finite G] :
      ∃ s, s.IsComposition
    **Every finite group has a composition series** (LMFDB `group.type`), a subnormal series with
    simple factors. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/CompositionLength.lean
    complete
    theorem Group.compositionLength_eq_length.{u_1} {G : Type u_1} [Group G]
      {s : Subgroup.SubnormalSeries G} (hs : s.IsComposition) :
      Group.compositionLength G = s.length
    theorem Group.compositionLength_eq_length.{u_1}
      {G : Type u_1} [Group G]
      {s : Subgroup.SubnormalSeries G}
      (hs : s.IsComposition) :
      Group.compositionLength G = s.length
    **The composition length of a group is the length of each of its composition series**
    (LMFDB `group.type`), its number of composition factors: all composition series have the same
    length by the Jordan–Hölder theorem, and every finite group has one. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/CompositionLength.lean
    complete
    theorem Group.typeLength_eq_nonsolvable.{u_1} {G : Type u_1} [Group G]
      {s : Subgroup.SubnormalSeries G} [Finite G] (hG : ¬Group.IsSolvable G)
      (hG' : ¬IsSimpleGroup G) (hs : s.IsComposition) :
      Group.typeLength G = Group.TypeLength.nonsolvable s.length
    theorem Group.typeLength_eq_nonsolvable.{u_1}
      {G : Type u_1} [Group G]
      {s : Subgroup.SubnormalSeries G}
      [Finite G] (hG : ¬Group.IsSolvable G)
      (hG' : ¬IsSimpleGroup G)
      (hs : s.IsComposition) :
      Group.typeLength G =
        Group.TypeLength.nonsolvable s.length
    **A finite group that is neither solvable nor simple has the descriptor "Non-solvable - n"**
    (LMFDB `group.type`), `n` the length of any of its composition series, its number of composition
    factors. 
Definition8.3.183
uses 1used by 0✓L∃∀N

Under-subgroup. (LMFDB)

If H \subseteq G is a subgroup, an under-subgroup is a subgroup K \subseteq G with K \subseteq H. A maximal under-subgroup is an under-subgroup K \ne H that is maximal with respect to inclusion.

Tau Ceti Review: Subgroup, CovBy.

Depends on: Definition 8.3.160

Lean code for Definition8.3.183●2 definitions
  • structure(extends 2, 4 fields)defined in Mathlib/Algebra/Group/Subgroup/Defs.lean
    complete
    structure Subgroup.{u_3} (G : Type u_3) [Group G] : Type u_3
    structure Subgroup.{u_3} (G : Type u_3) [Group G] :
      Type u_3
    A subgroup of a group `G` is a subset containing 1, closed under multiplication
    and closed under multiplicative inverse. 
    
    [Wikidata Q466109](https://www.wikidata.org/wiki/Q466109)
    • Submonoid G
    carrier : Set G
    Inherited from
    1. Submonoid
    2. Subsemigroup
    mul_mem' : ∀ {a b : G}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Submonoid
    2. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Submonoid
    inv_mem' : ∀ {x : G}, x ∈ self.carrier → x⁻¹ ∈ self.carrier
    `G` is closed under inverses 
  • defdefined in Mathlib/Order/Defs/PartialOrder.lean
    complete
    def CovBy.{u_2} {α : Type u_2} [LT α] (a b : α) : Prop
    def CovBy.{u_2} {α : Type u_2} [LT α]
      (a b : α) : Prop
    `CovBy a b` means that `b` covers `a`. This means that `a < b` and there is no element in
    between. This is denoted `a ⋖ b`. 
Definition8.3.184
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.25
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Unitary group. (LMFDB)

The (general) unitary group \GU(n, q) is the group of n \times n unitary matrices with entries in the field \F_{q^2} (the finite field with q^2 elements). Here, a matrix is *unitary* if the inverse of M equals the conjugate transpose of M.

For matrices M over the finite field \F_{q^2}, the *conjugate* of M is defined as the matrix obtained by applying the map x \mapsto x^q (i.e. the r-th power of the Frobenius automorphism, where q = p^r) to each entry of M.

The projective (general) unitary group \PGU(n, q) is the quotient of \GU(n, q) by the scalar matrices in \GU(n, q) (equivalently, \PGU(n, q) is the quotient of \GU(n, q) by its center).

The special unitary group \SU(n, q) is the subgroup of \GU(n, q) consisting of those matrices with determinant 1.

The projective special unitary group \PSU(n, q) is the quotient of \SU(n, q) by the scalar matrices in \SU(n, q) (equivalently, \PSU(n, q) is the quotient of \SU(n, q) by its center).

(see , page x)

Depends on: Definition 8.3.20 Definition 8.3.118 Definition 8.3.160 Definition 1.1.30

Lean code for Definition8.3.184●6 declarations
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Unitary.lean
    complete
    abbrev Matrix.generalUnitaryGroup (n p r : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin n) (GaloisField p (2 * r)))
    abbrev Matrix.generalUnitaryGroup (n p r : ℕ)
      [Fact (Nat.Prime p)] :
      Subgroup
        (GL (Fin n) (GaloisField p (2 * r)))
    The **general unitary group** `GU(n, q)`, `q = p ^ r` (LMFDB `group.unitary`): the `n × n`
    matrices over `𝔽_{q²} = GaloisField p (2 r)` whose inverse is their conjugate transpose, the
    conjugate of an entry `x` being `x ^ q`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Unitary.lean
    complete
    abbrev Matrix.specialUnitaryGroupFq (n p r : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin n) (GaloisField p (2 * r)))
    abbrev Matrix.specialUnitaryGroupFq (n p r : ℕ)
      [Fact (Nat.Prime p)] :
      Subgroup
        (GL (Fin n) (GaloisField p (2 * r)))
    The **special unitary group** `SU(n, q)` (LMFDB `group.unitary`): the matrices of
    determinant `1` in `GU(n, q)`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Unitary.lean
    complete
    abbrev Matrix.projectiveGeneralUnitaryGroup (n p r : ℕ) [Fact (Nat.Prime p)] :
      Type
    abbrev Matrix.projectiveGeneralUnitaryGroup
      (n p r : ℕ) [Fact (Nat.Prime p)] : Type
    The **projective (general) unitary group** `PGU(n, q)` (LMFDB `group.unitary`): the
    quotient of `GU(n, q)` by its scalar matrices, the elements of the centre of `GL_n`. 
  • abbrevdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Unitary.lean
    complete
    abbrev Matrix.projectiveSpecialUnitaryGroup (n p r : ℕ) [Fact (Nat.Prime p)] :
      Type
    abbrev Matrix.projectiveSpecialUnitaryGroup
      (n p r : ℕ) [Fact (Nat.Prime p)] : Type
    The **projective special unitary group** `PSU(n, q)` (LMFDB `group.unitary`): the quotient
    of `SU(n, q)` by its scalar matrices. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/UnitaryCenter.lean
    complete
    theorem Matrix.center_generalUnitaryGroup {p r : ℕ} [Fact (Nat.Prime p)] (n : ℕ)
      (hr : r ≠ 0) :
      Subgroup.center ↥(Matrix.generalUnitaryGroup n p r) =
        (Subgroup.center (GL (Fin n) (GaloisField p (2 * r)))).subgroupOf
          (Matrix.generalUnitaryGroup n p r)
    theorem Matrix.center_generalUnitaryGroup
      {p r : ℕ} [Fact (Nat.Prime p)] (n : ℕ)
      (hr : r ≠ 0) :
      Subgroup.center
          ↥(Matrix.generalUnitaryGroup n p
              r) =
        (Subgroup.center
              (GL (Fin n)
                (GaloisField p
                  (2 * r)))).subgroupOf
          (Matrix.generalUnitaryGroup n p r)
    **The centre of `GU(n, q)` is its subgroup of scalar matrices** (LMFDB `group.unitary`), for
    `q = p ^ r` with `r ≠ 0`: a central element of `GU(n, q)` commutes with `SU(n, q)`, so it is
    scalar. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/UnitaryCenter.lean
    complete
    theorem Matrix.center_specialUnitaryGroupFq {p r : ℕ} [Fact (Nat.Prime p)]
      (n : ℕ) (hr : r ≠ 0) :
      Subgroup.center ↥(Matrix.specialUnitaryGroupFq n p r) =
        (Subgroup.center (GL (Fin n) (GaloisField p (2 * r)))).subgroupOf
          (Matrix.specialUnitaryGroupFq n p r)
    theorem Matrix.center_specialUnitaryGroupFq
      {p r : ℕ} [Fact (Nat.Prime p)] (n : ℕ)
      (hr : r ≠ 0) :
      Subgroup.center
          ↥(Matrix.specialUnitaryGroupFq n p
              r) =
        (Subgroup.center
              (GL (Fin n)
                (GaloisField p
                  (2 * r)))).subgroupOf
          (Matrix.specialUnitaryGroupFq n p r)
    **The centre of `SU(n, q)` is its subgroup of scalar matrices** (LMFDB `group.unitary`), for
    `q = p ^ r` with `r ≠ 0`: the elements of `SU(n, q)` that are scalar matrices. 
Definition8.3.185
Statement uses 4
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.114
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Upper central series of a group. (LMFDB)

If G is a group, then its upper central series is a normal series of subgroups

\langle e\rangle = Z_0(G) \unlhd Z_1(G) \unlhd Z_2(G) \unlhd \cdots

where Z_0(G)=\langle e\rangle and Z_i(G)/Z_{i-1}(G) is the center of G/Z_{i-1}(G), i.e., Z_i(G) is the inverse image of the center of G/Z_{i-1}(G).

Each of the subgroups Z_i(G) is characteristic. The group is nilpotent if and only if Z_i(G)=G for some i.

Tau Ceti Review: Subgroup.upperCentralSeriesStep, Group.IsNilpotent.

Depends on: Definition 8.3.3 Definition 8.3.20 Definition 8.3.93 Definition 8.3.95

Lean code for Definition8.3.185●3 definitions
  • defdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    def Subgroup.upperCentralSeries.{u_1} (G : Type u_1) [Group G] (n : ℕ) :
      Subgroup G
    def Subgroup.upperCentralSeries.{u_1}
      (G : Type u_1) [Group G] (n : ℕ) :
      Subgroup G
    `upperCentralSeries G n` is the `n`th term in the upper central series of `G`.
    
    This is the increasing chain of subgroups of `G` that starts with the trivial subgroup `⊥` of `G`
    and then continues defining `upperCentralSeries G (n + 1)` to be all the elements of `G`
    that, modulo `upperCentralSeries G n`, belong to the center of the quotient
    `G ⧸ upperCentralSeries G n`.
    
    In particular, the identities
    * `upperCentralSeries G 0 = ⊥` (`upperCentralSeries_zero`);
    * `upperCentralSeries G 1 = center G` (`upperCentralSeries_one`);
    
    hold.
    
  • defdefined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    def Subgroup.upperCentralSeriesStep.{u_1} {G : Type u_1} [Group G]
      (N : Subgroup G) [N.Normal] : Subgroup G
    def Subgroup.upperCentralSeriesStep.{u_1}
      {G : Type u_1} [Group G]
      (N : Subgroup G) [N.Normal] : Subgroup G
    If `N` is a normal subgroup of `G`, then the set `{x : G | ∀ y : G, x*y*x⁻¹*y⁻¹ ∈ N}`
    is a subgroup of `G` (because it is the preimage in `G` of the centre of the
    quotient group `G/N`.)
    
  • class(1 method)defined in Mathlib/GroupTheory/Nilpotent.lean
    complete
    class Group.IsNilpotent.{u_2} (G : Type u_2) [Group G] : Prop
    class Group.IsNilpotent.{u_2} (G : Type u_2)
      [Group G] : Prop
    A group `G` is nilpotent if its upper central series is eventually `G`. 
    nilpotent' : ∃ n, Subgroup.upperCentralSeries G n = ⊤
Definition8.3.186
uses 1used by 1✓L∃∀N

Weight function. (LMFDB)

Let G be a finite group. A weight function on G is a function w:G \to \R_{\geq 0} such that:

  1. w(g) = 0 if and only if g equals the identity element of G.

  2. w(h g h^{-1}) = w(g) for all g,h \in G, i.e. w is invariant under conjugacy.

  3. w(g^n) = w(g) for all g \in G and all natural numbers n with n \nmid \#G, i.e. w is invariant under invertible powering.

Any weight function takes constant value on each rational conjugacy class of G.

Depends on: Definition 8.3.42

Lean code for Definition8.3.186●2 declarations
  • structure(3 fields)defined in LeanBridge/ForMathlib/GroupTheory/RationalClassWeight.lean
    complete
    structure Group.IsWeightFunction.{u_1} {G : Type u_1} [Group G] (w : G → NNReal) :
      Prop
    structure Group.IsWeightFunction.{u_1}
      {G : Type u_1} [Group G]
      (w : G → NNReal) : Prop
    A function `w : G → ℝ≥0` on a finite group `G` is a **weight function** (LMFDB
    `group.weight_function`) if `w g = 0` exactly when `g = 1`, `w` is invariant under conjugation, and
    `w (g ^ n) = w g` whenever `n` is coprime to `#G`.
    
    The knowl states the last condition for `n ∤ #G`, which is not invariance under invertible powering
    as it says (it would force `w (g ^ 4) = w g` in a group of order `6`); we use the intended condition
    that `n` is coprime to `#G`, under which `g ↦ g ^ n` is a bijection. 
    eq_zero_iff : ∀ (g : G), w g = 0 ↔ g = 1
    apply_conj : ∀ (g h : G), w (h * g * h⁻¹) = w g
    apply_pow : ∀ (g : G) {n : ℕ}, n.Coprime (Nat.card G) → w (g ^ n) = w g
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalClassWeight.lean
    complete
    theorem Group.IsWeightFunction.apply_conj_pow.{u_1} {G : Type u_1} [Group G]
      {w : G → NNReal} (hw : Group.IsWeightFunction w) (g h : G) {n : ℕ}
      (hn : n.Coprime (Nat.card G)) : w (h * g ^ n * h⁻¹) = w g
    theorem Group.IsWeightFunction.apply_conj_pow.{u_1}
      {G : Type u_1} [Group G]
      {w : G → NNReal}
      (hw : Group.IsWeightFunction w)
      (g h : G) {n : ℕ}
      (hn : n.Coprime (Nat.card G)) :
      w (h * g ^ n * h⁻¹) = w g
    **A weight function is constant on rational conjugacy classes**: `w` takes the same value at
    `g` and at every conjugate of every power `g ^ n` with `n` coprime to `#G`. 
Definition8.3.187
Statement uses 5
Statement dependency previews
Preview
Definition 8.3.19
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Weyl group. (LMFDB)

The Weyl group associated to a subgroup H \subseteq G is the quotient W = N_G(H) / Z_G(H) of the normalizer of H by the centralizer of H. The terminology is taken from the theory of Lie groups, where there is a unique conjugacy class of maximal tori in a Lie group G and if T is any such maximal torus then Z_G(T) = T has finite index in N_G(T). In that context we may thus speak of the Weyl group of G.

When G is an abstract group, we must specify H as well, and the Weyl group naturally embeds into the automorphism group \Aut(H) and gives the subset of automorphisms of H that are induced by conjugation within G.

Depends on: Definition 8.3.19 Definition 8.3.23 Definition 8.3.160 Definition 8.3.166 Definition 8.3.169

Definition8.3.188
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.3.36
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Wreath product. (LMFDB)

If S\leq S_n and H are groups, the wreath product of H and S is the semidirect product H \wr S = H^n \rtimes S

where S acts on H^n via S\subseteq S_n, permuting the n copies of H.

If S is a transitive subgroup of S_n, we say that the wreath product is transitive.

Tau Ceti Review: TauCeti.PermSubgroupWreathProduct, TauCeti.PermutationWreathProduct, SemidirectProduct, mulAutArrow, MulAction.IsPretransitive.

Depends on: Definition 8.3.3 Definition 8.3.138

Lean code for Definition8.3.188●5 definitions
  • abbrevdefined in TauCeti/GroupTheory/Perm/WreathProduct/Basic.lean
    complete
    abbrev TauCeti.PermSubgroupWreathProduct.{u, v} (D : Type u) (ι : Type v)
      [Group D] (Q : Subgroup (Equiv.Perm ι)) : Type (max (max u v) v)
    abbrev TauCeti.PermSubgroupWreathProduct.{u, v}
      (D : Type u) (ι : Type v) [Group D]
      (Q : Subgroup (Equiv.Perm ι)) :
      Type (max (max u v) v)
    The permutation wreath product with top group restricted to
    `Q ≤ Equiv.Perm ι`. 
  • abbrevdefined in TauCeti/GroupTheory/Perm/WreathProduct/Basic.lean
    complete
    abbrev TauCeti.PermutationWreathProduct.{u, v, w} (D : Type u) [Group D]
      (Q : Type v) [Group Q] (X : Type w) [MulAction Q X] :
      Type (max (max u w) v)
    abbrev TauCeti.PermutationWreathProduct.{u, v, w}
      (D : Type u) [Group D] (Q : Type v)
      [Group Q] (X : Type w) [MulAction Q X] :
      Type (max (max u w) v)
    The permutation wreath product with base group `X → D` and top group `Q`, where `Q` acts on
    the base through Mathlib's `mulAutArrow`, sending `f` to `x ↦ f (q⁻¹ • x)`.
    
    Its multiplication is
    `(f, q) * (g, r) = (fun x ↦ f x * g (q⁻¹ • x), q * r)`. 
  • structure(2 fields)defined in Mathlib/GroupTheory/SemidirectProduct.lean
    complete
    structure SemidirectProduct.{u_1, u_2} (N : Type u_1) (G : Type u_2) [Group N]
      [Group G] (φ : G →* MulAut N) : Type (max u_1 u_2)
    structure SemidirectProduct.{u_1, u_2}
      (N : Type u_1) (G : Type u_2) [Group N]
      [Group G] (φ : G →* MulAut N) :
      Type (max u_1 u_2)
    The semidirect product of groups `N` and `G`, given a map `φ` from `G` to the automorphism
    group of `N`. It is the product of sets with the group operation
    `⟨n₁, g₁⟩ * ⟨n₂, g₂⟩ = ⟨n₁ * φ g₁ n₂, g₁ * g₂⟩` 
    left : N
    The element of N 
    right : G
    The element of G 
  • defdefined in Mathlib/Algebra/Group/Action/End.lean
    complete
    def mulAutArrow.{u_1, u_2, u_3} {G : Type u_1} {M : Type u_2} {A : Type u_3}
      [Group G] [MulAction G A] [Monoid M] : G →* MulAut (A → M)
    def mulAutArrow.{u_1, u_2, u_3} {G : Type u_1}
      {M : Type u_2} {A : Type u_3} [Group G]
      [MulAction G A] [Monoid M] :
      G →* MulAut (A → M)
    Given groups `G H` with `G` acting on `A`, `G` acts by
    multiplicative automorphisms on `A → H`. 
  • class(1 method)defined in Mathlib/Algebra/Group/Action/Pretransitive.lean
    complete
    class MulAction.IsPretransitive.{u_5, u_6} (M : Type u_5) (α : Type u_6)
      [SMul M α] : Prop
    class MulAction.IsPretransitive.{u_5, u_6}
      (M : Type u_5) (α : Type u_6)
      [SMul M α] : Prop
    `M` acts pretransitively on `α` if for any `x y` there is `g` such that `g • x = y`.
    A transitive action should furthermore have `α` nonempty. 
    exists_smul_eq : ∀ (x y : α), ∃ g, g • x = y
    There is `g` such that `g • x = y`. 
Definition8.3.189
Statement uses 3
Statement dependency previews
Preview
Definition 8.3.37
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.3.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Z-group. (LMFDB)

A Z-group is a (finite) group all of whose Sylow subgroups are cyclic. Such groups are metacyclic, supersolvable and monomial.

Every cyclic group is a Z-group, but the converse does not hold, as shown by these examples.

Depends on: Definition 8.3.37 Definition 8.3.91 Definition 8.3.174

Lean code for Definition8.3.189●7 declarations
  • class(1 method)defined in Mathlib/GroupTheory/SpecificGroups/ZGroup.lean
    complete
    class IsZGroup.{u_1} (G : Type u_1) [Group G] : Prop
    class IsZGroup.{u_1} (G : Type u_1) [Group G] :
      Prop
    A Z-group is a group whose Sylow subgroups are all cyclic. 
    isZGroup : ∀ (p : ℕ), Nat.Prime p → ∀ (P : Sylow p G), IsCyclic ↥↑P
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/Metacyclic.lean
    complete
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1} [Group G] [Finite G]
      [IsZGroup G] : IsMetacyclic G
    theorem IsZGroup.isMetacyclic.{u_1} {G : Type u_1}
      [Group G] [Finite G] [IsZGroup G] :
      IsMetacyclic G
    **Finite Z-groups are metacyclic** (LMFDB `group.metacyclic`): the commutator subgroup and the
    abelianization of a finite Z-group are cyclic. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SupersolvableClosure.lean
    complete
    theorem IsZGroup.isSupersolvable.{u_1} {G : Type u_1} [Group G] [Finite G]
      [IsZGroup G] : Group.IsSupersolvable G
    theorem IsZGroup.isSupersolvable.{u_1}
      {G : Type u_1} [Group G] [Finite G]
      [IsZGroup G] : Group.IsSupersolvable G
    **Finite Z-groups are supersolvable** (LMFDB `group.supersolvable`, `group.z_group`), being
    metacyclic. 
  • theoremdefined in LeanBridge/ForMathlib/RepresentationTheory/MGroupSupersolvable.lean
    complete
    theorem IsZGroup.isMGroup {G : Type} [Group G] [Finite G] [IsZGroup G] :
      IsMGroup G
    theorem IsZGroup.isMGroup {G : Type} [Group G]
      [Finite G] [IsZGroup G] : IsMGroup G
    **Finite Z-groups are M-groups** (LMFDB `group.z_group`), being supersolvable. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/SupersolvableExamples.lean
    complete
    theorem DihedralGroup.isZGroup_three : IsZGroup (DihedralGroup 3)
    theorem DihedralGroup.isZGroup_three :
      IsZGroup (DihedralGroup 3)
    **The dihedral group `D₃ ≅ S₃` is a Z-group** (LMFDB `group.z_group`): its order `6` is
    squarefree. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/SupersolvableExamples.lean
    complete
    theorem DihedralGroup.not_isCyclic_three : ¬IsCyclic (DihedralGroup 3)
    theorem DihedralGroup.not_isCyclic_three :
      ¬IsCyclic (DihedralGroup 3)
    **The dihedral group `D₃ ≅ S₃` is not cyclic** (LMFDB `group.z_group`): it is not even
    nilpotent. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/SupersolvableExamples.lean
    complete
    theorem not_forall_isCyclic_of_isZGroup :
      ¬∀ (G : Type) [inst : Group G] [Finite G], IsZGroup G → IsCyclic G
    theorem not_forall_isCyclic_of_isZGroup :
      ¬∀ (G : Type) [inst : Group G]
          [Finite G], IsZGroup G → IsCyclic G
    **Not every finite Z-group is cyclic** (LMFDB `group.z_group`): the dihedral group `D₃ ≅ S₃`
    is a Z-group but is not cyclic. 
Definition8.3.190
Statement uses 2
Statement dependency previews
Preview
Definition 8.3.32
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Explanation of pictures for abstract groups. (LMFDB)

Pictures for abstract groups consist of several disks arranged in concentric circles. The size, position, and brightness each encode information about the group.

Quick summary ##

  • Each disk corresponds to a conjugacy class.

  • Conjugacy classes with more elements are larger than those with fewer elements.

  • Disks are arranged according to the number of prime divisors of the order of elements in the conjugacy class. The identity is in the center.

  • Darker disks of the same hue typically have orders that are more divisible by 2 than brighter disks with the same hue.

In more detail ##

Each disk corresponds to a conjugacy class in the group. The area of the disk is directly proportional to the number of elements in the corresponding conjugacy class. All elements in the conjugacy class have the same order o, which we use to determine both the color of the disk and the location of the disk.

For the color, write the common order of a given conjugacy class as o = 2^A \times (\mathrm{odd}), where A = v_2(o). Typically, larger A corresponds to darker colors in the hue-saturation-brightness color model. The odd part \mathrm{odd} determines the hue, chosen in a way that is aesthetically pleasing.

The position of each disk is determined by the number of prime divisors (counted with multiplicity) of the order. The identity element is in the center. An annulus around the identity contains all disks with order consisting of exactly 1 prime. Within each annulus, disks are placed to fit nicely. There is usually a small gap between adjacent annuli.

Implementation ##

The algorithm to visualize abstract groups was designed and implemented by David Roe.

Tau Ceti Review: ConjClasses, Nat.ordProj_mul_ordCompl_eq_self.

Depends on: Definition 8.3.32 Definition 8.3.45

Lean code for Definition8.3.190●7 declarations
  • defdefined in Mathlib/Algebra/Group/Conj.lean
    complete
    def ConjClasses.{u_1} (α : Type u_1) [Monoid α] : Type u_1
    def ConjClasses.{u_1} (α : Type u_1)
      [Monoid α] : Type u_1
    The quotient type of conjugacy classes of a group. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Label/ConjClass.lean
    complete
    def ConjClasses.elementOrder.{u_1} {G : Type u_1} [Group G]
      (c : ConjClasses G) : ℕ
    def ConjClasses.elementOrder.{u_1}
      {G : Type u_1} [Group G]
      (c : ConjClasses G) : ℕ
    The **order of the elements** of a conjugacy class (LMFDB `group.label_conjugacy_class`), the
    `N` of its label `NAj`: conjugate elements have the same order (`IsConj.orderOf_eq`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/RationalConjugacy.lean
    complete
    theorem IsConj.orderOf_eq.{u_1} {G : Type u_1} [Group G] {x y : G}
      (h : IsConj x y) : orderOf x = orderOf y
    theorem IsConj.orderOf_eq.{u_1} {G : Type u_1}
      [Group G] {x y : G} (h : IsConj x y) :
      orderOf x = orderOf y
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Label/ConjClass.lean
    complete
    theorem ConjClasses.orderOf_eq_elementOrder.{u_1} {G : Type u_1} [Group G]
      {x : G} {c : ConjClasses G} (hx : x ∈ c.carrier) :
      orderOf x = c.elementOrder
    theorem ConjClasses.orderOf_eq_elementOrder.{u_1}
      {G : Type u_1} [Group G] {x : G}
      {c : ConjClasses G}
      (hx : x ∈ c.carrier) :
      orderOf x = c.elementOrder
    **All elements of a conjugacy class have the same order** (LMFDB `group.picture_description`),
    the order `c.elementOrder` of the class. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/ConjClassElementOrder.lean
    complete
    theorem ConjClasses.odd_elementOrder_div_two_pow.{u_1} {G : Type u_1} [Group G]
      {c : ConjClasses G} [Finite G] :
      Odd (c.elementOrder / 2 ^ c.elementOrder.factorization 2)
    theorem ConjClasses.odd_elementOrder_div_two_pow.{u_1}
      {G : Type u_1} [Group G]
      {c : ConjClasses G} [Finite G] :
      Odd
        (c.elementOrder /
          2 ^ c.elementOrder.factorization 2)
    **The order of a conjugacy class is `2 ^ A` times an odd number, `A = v₂(o)`** (LMFDB
    `group.picture_description`), in a finite group: `o / 2 ^ v₂(o)` is odd, and
    `2 ^ v₂(o) * (o / 2 ^ v₂(o)) = o` is Mathlib's `Nat.ordProj_mul_ordCompl_eq_self`. 
  • theoremdefined in Mathlib/Data/Nat/Factorization/Basic.lean
    complete
    theorem Nat.ordProj_mul_ordCompl_eq_self (n p : ℕ) :
      p ^ n.factorization p * (n / p ^ n.factorization p) = n
    theorem Nat.ordProj_mul_ordCompl_eq_self
      (n p : ℕ) :
      p ^ n.factorization p *
          (n / p ^ n.factorization p) =
        n
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Label/ConjClass.lean
    complete
    theorem ConjClasses.elementOrder_eq_one_iff.{u_1} {G : Type u_1} [Group G]
      {c : ConjClasses G} : c.elementOrder = 1 ↔ c = 1
    theorem ConjClasses.elementOrder_eq_one_iff.{u_1}
      {G : Type u_1} [Group G]
      {c : ConjClasses G} :
      c.elementOrder = 1 ↔ c = 1
    **The class of the identity is the only conjugacy class of order `1`** (LMFDB
    `group.picture_description`): it is the disk at the centre of the LMFDB's picture, the only one
    whose order has no prime factor (Mathlib's
    `ArithmeticFunction.cardFactors_eq_zero_iff_eq_zero_or_one`).