LeanBridge Blueprint

8.1. Galois groups🔗

This section lists the LMFDB definitions in the category gg. Each definition links back to its LMFDB knowl.

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

Input for arithmetically equivalent fields. (LMFDB)

Suppose a number field K has Galois closure with Galois group G, has k arithmetically equivalent fields, not including itself. The number k is an invariant of the Galois group G.

The number k has not been computed for all Galois groups. To see groups for which it has not been computed, use the value -1.

Depends on: Definition 5.1.1 Definition 5.1.6 Definition 5.1.22 Definition 5.1.23

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

Arithmetically equivalent siblings. (LMFDB)

If K is a degree n number field whose Galois closure has Galois group G\leq S_n, then K may have arithmetically equivalent fields. The number of these is a function of G.

Inside G, we have H_1, the stabilizer subgroup of 1. By the Galois correspondence, an arithmetically equivalent field corresponds to a conjugacy class of subgroups with representative H_2 such that

|H_1 \cap C| = |H_2\cap C|

for every conjugacy class C of G.

Depends on: Definition 8.1.4 Definition 8.3.160 Definition 5.1.1 Definition 5.1.6 Definition 5.1.14 Definition 5.1.23

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

Concentrated group. (LMFDB)

A transitive permutation group G is concentrated if the subgroup of G generated by all elements of minimal index is a proper subgroup of G.

Depends on: Definition 8.1.11 Definition 8.3.3 Definition 8.3.113

Lean code for Definition8.1.3●3 definitions
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.IsConcentrated.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Prop
    def Subgroup.IsConcentrated.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Prop
    A permutation group `G` is **concentrated** (LMFDB `gg.concentrated`) if it is transitive and
    the subgroup generated by its non-identity elements of minimal index (`minPermIndexElements`) is a
    proper subgroup of `G`. The identity, of index `0`, is excluded, as it must be for the notion to be
    meaningful. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.minPermIndexElements.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Set ↥G
    def Subgroup.minPermIndexElements.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Set ↥G
    The non-identity elements of `G` of least index `ind(G)`, the **elements of minimal index** of
    LMFDB `gg.concentrated`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Equiv.Perm.permIndex.{u_1} {α : Type u_1} (g : Equiv.Perm α) : ℕ
    def Equiv.Perm.permIndex.{u_1} {α : Type u_1}
      (g : Equiv.Perm α) : ℕ
    The **index** of a permutation `g` of a finite set `α` (LMFDB `gg.index`):
    `ind(g) = |α| - c(g)`, where `c(g)` is the number of orbits of `g`, the least number of
    transpositions whose product is `g` (`Equiv.Perm.isLeast_card_sub_orbitCount`). 
Definition8.1.4
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 6.2.10
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Conjugacy class. (LMFDB)

Definition 8.3.32 If G\leq S_n, then all elements in the conjugacy class of an element have the same cycle type.

Tau Ceti Review: ConjClasses, Equiv.Perm.cycleType, Equiv.Perm.cycleType_conj, Equiv.Perm.isConj_iff_cycleType_eq.

Depends on: Definition 8.3.32

Lean code for Definition8.1.4●4 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 Mathlib/GroupTheory/Perm/Cycle/Type.lean
    complete
    def Equiv.Perm.cycleType.{u_1} {α : Type u_1} [Fintype α] [DecidableEq α]
      (σ : Equiv.Perm α) : Multiset ℕ
    def Equiv.Perm.cycleType.{u_1} {α : Type u_1}
      [Fintype α] [DecidableEq α]
      (σ : Equiv.Perm α) : Multiset ℕ
    The cycle type of a permutation 
  • theoremdefined in Mathlib/GroupTheory/Perm/Cycle/Type.lean
    complete
    theorem Equiv.Perm.cycleType_conj.{u_1} {α : Type u_1} [Fintype α]
      [DecidableEq α] {σ τ : Equiv.Perm α} :
      (τ * σ * τ⁻¹).cycleType = σ.cycleType
    theorem Equiv.Perm.cycleType_conj.{u_1}
      {α : Type u_1} [Fintype α]
      [DecidableEq α] {σ τ : Equiv.Perm α} :
      (τ * σ * τ⁻¹).cycleType = σ.cycleType
  • theoremdefined in Mathlib/GroupTheory/Perm/Cycle/Type.lean
    complete
    theorem Equiv.Perm.isConj_iff_cycleType_eq.{u_1} {α : Type u_1} [Fintype α]
      [DecidableEq α] {σ τ : Equiv.Perm α} :
      IsConj σ τ ↔ σ.cycleType = τ.cycleType
    theorem Equiv.Perm.isConj_iff_cycleType_eq.{u_1}
      {α : Type u_1} [Fintype α]
      [DecidableEq α] {σ τ : Equiv.Perm α} :
      IsConj σ τ ↔ σ.cycleType = τ.cycleType
Definition8.1.5
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 5.1.31
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Degree. (LMFDB)

A Galois group of an irreducible polynomial f(x) is a transitive subgroup of S_n, well-defined up to conjugation. Its degree is n=\deg(f).

Tau Ceti Review: Polynomial.natDegree, Polynomial.Gal.galActionHom, Polynomial.card_rootSet_eq_natDegree.

Depends on: Definition 8.1.8

Lean code for Definition8.1.5●3 declarations
  • defdefined in Mathlib/Algebra/Polynomial/Degree/Defs.lean
    complete
    def Polynomial.natDegree.{u} {R : Type u} [Semiring R] (p : Polynomial R) :
      ℕ
    def Polynomial.natDegree.{u} {R : Type u}
      [Semiring R] (p : Polynomial R) : ℕ
    `natDegree p` forces `degree p` to ℕ, by defining `natDegree 0 = 0`. 
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.galActionHom.{u_1, u_2} {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    def Polynomial.Gal.galActionHom.{u_1, u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    `Polynomial.Gal.galAction` as a permutation representation 
  • theoremdefined in Mathlib/FieldTheory/Separable.lean
    complete
    theorem Polynomial.card_rootSet_eq_natDegree.{u, v} {F : Type u} [Field F]
      {K : Type v} [Field K] [Algebra F K] {p : Polynomial F}
      (hsep : p.Separable)
      (hsplit : (Polynomial.map (algebraMap F K) p).Splits) :
      Fintype.card ↑(p.rootSet K) = p.natDegree
    theorem Polynomial.card_rootSet_eq_natDegree.{u,
        v}
      {F : Type u} [Field F] {K : Type v}
      [Field K] [Algebra F K]
      {p : Polynomial F} (hsep : p.Separable)
      (hsplit :
        (Polynomial.map (algebraMap F K)
            p).Splits) :
      Fintype.card ↑(p.rootSet K) =
        p.natDegree
Definition8.1.6
uses 0used by 0✓L∃∀N

Elusive group. (LMFDB)

An elusive group is a transitive permutation group H\leq S_n with no fixed-point-free elements of prime order.

Lean code for Definition8.1.6●4 declarations
  • structure(2 fields)defined in LeanBridge/ForMathlib/GroupTheory/Perm/Elusive.lean
    complete
    structure Subgroup.IsElusive.{u_1} {α : Type u_1} (H : Subgroup (Equiv.Perm α)) :
      Prop
    structure Subgroup.IsElusive.{u_1} {α : Type u_1}
      (H : Subgroup (Equiv.Perm α)) : Prop
    A permutation group `H ≤ Sym(α)` is **elusive** (LMFDB `gg.elusive_group`) if it is transitive
    and none of its elements of prime order is a derangement, that is, fixed-point-free. 
    isPretransitive : MulAction.IsPretransitive (↥H) α
    notMem_derangements : ∀ σ ∈ H, Nat.Prime (orderOf σ) → σ ∉ derangements α
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/Elusive.lean
    complete
    theorem Subgroup.isElusive_map_permCongrHom_iff.{u_1, u_2} {α : Type u_1}
      {β : Type u_2} (H : Subgroup (Equiv.Perm α)) (e : α ≃ β) :
      (Subgroup.map e.permCongrHom.toMonoidHom H).IsElusive ↔ H.IsElusive
    theorem Subgroup.isElusive_map_permCongrHom_iff.{u_1,
        u_2}
      {α : Type u_1} {β : Type u_2}
      (H : Subgroup (Equiv.Perm α))
      (e : α ≃ β) :
      (Subgroup.map e.permCongrHom.toMonoidHom
            H).IsElusive ↔
        H.IsElusive
    **Being elusive does not depend on the numbering of the points**: transporting a permutation
    group along a bijection `α ≃ β` preserves it. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/Elusive.lean
    complete
    theorem Subgroup.isElusive_map_conj_iff.{u_1} {α : Type u_1}
      (H : Subgroup (Equiv.Perm α)) (τ : Equiv.Perm α) :
      (Subgroup.map (MulEquiv.toMonoidHom (MulAut.conj τ)) H).IsElusive ↔
        H.IsElusive
    theorem Subgroup.isElusive_map_conj_iff.{u_1}
      {α : Type u_1}
      (H : Subgroup (Equiv.Perm α))
      (τ : Equiv.Perm α) :
      (Subgroup.map
            (MulEquiv.toMonoidHom
              (MulAut.conj τ))
            H).IsElusive ↔
        H.IsElusive
    **Being elusive is invariant under conjugation in the symmetric group**, so it is a property of
    the conjugacy class of a permutation group. 
  • defdefined in Mathlib/Combinatorics/Derangements/Basic.lean
    complete
    def derangements.{u_1} (α : Type u_1) : Set (Equiv.Perm α)
    def derangements.{u_1} (α : Type u_1) :
      Set (Equiv.Perm α)
    A permutation is a derangement if it has no fixed points. 
Definition8.1.7
Statement uses 3
Statement dependency previews
Preview
Definition 5.2.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Field automorphisms associated with a Galois group. (LMFDB)

Let G be a transitive subgroup of S_n and G_1=\{\sigma\in G \subset S_n \mid \sigma(1)=1\}. The group G \subset S_n can be realized as the Galois group of a field extension L/K. Let F \subset L be the fixed field of G_1 defined by the Galois action of G, i.e., F = \{ a \in L \mid \forall g \in G_1,\, g(a) = a \}. Then, F/K is a field extension of degree n whose Galois closure is L/K.

Although F might not be Galois over K, one can consider the group \Aut(F/K).

The group \Aut(F/K) can be computed via the Galois correspondence. Group-theoretically, the order \# \Aut(F/K) equals the order of the centralizer of G in S_n.

If F/K is realized as the extension F = K[x]/(f(x)) for some polynomial f(x) \in K[x] then, the order \#\Aut(F/K) is the number of roots of f(x) in F.

Depends on: Definition 8.1.8 Definition 8.3.23 Definition 5.2.3

Lean code for Definition8.1.7●5 declarations
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/Galois/StemFieldAutomorphisms.lean
    complete
    theorem IsGalois.card_aut_fixedField_stabilizer.{u_1, u_2, u_3} {K : Type u_1}
      {L : Type u_2} [Field K] [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L] {X : Type u_3}
      [MulAction Gal(L/K) X] [MulAction.IsPretransitive Gal(L/K) X]
      (x : X) :
      Nat.card
          Gal(↥(IntermediateField.fixedField
                (MulAction.stabilizer Gal(L/K) x))/K) =
        Nat.card
          ↥(Subgroup.centralizer ↑(MulAction.toPermHom Gal(L/K) X).range)
    theorem IsGalois.card_aut_fixedField_stabilizer.{u_1,
        u_2, u_3}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L]
      {X : Type u_3} [MulAction Gal(L/K) X]
      [MulAction.IsPretransitive Gal(L/K) X]
      (x : X) :
      Nat.card
          Gal(↥(IntermediateField.fixedField
                (MulAction.stabilizer Gal(L/K)
                  x))/K) =
        Nat.card
          ↥(Subgroup.centralizer
              ↑(MulAction.toPermHom Gal(L/K)
                    X).range)
    **The automorphisms of the stem field of a transitive Galois group** (LMFDB
    `gg.field_automorphisms`): if `Gal(L/K)` acts transitively on `X`, with image `G` in `Sym(X)`, the
    fixed field `F` of the stabilizer of a point has as many automorphisms over `K` as the centralizer
    of `G` in `Sym(X)` has elements. So `#Aut(F/K)` is an invariant of the permutation group `G`. 
  • defdefined in LeanBridge/ForMathlib/FieldTheory/Galois/StemFieldAutomorphisms.lean
    complete
    def IsGalois.normalizerQuotientEquivAut.{u_1, u_2} {K : Type u_1}
      {L : Type u_2} [Field K] [Field L] [Algebra K L]
      (H : Subgroup Gal(L/K)) [FiniteDimensional K L] [IsGalois K L] :
      ↥(Subgroup.normalizer ↑H) ⧸ H.subgroupOf (Subgroup.normalizer ↑H) ≃*
        Gal(↥(IntermediateField.fixedField H)/K)
    def IsGalois.normalizerQuotientEquivAut.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      (H : Subgroup Gal(L/K))
      [FiniteDimensional K L] [IsGalois K L] :
      ↥(Subgroup.normalizer ↑H) ⧸
          H.subgroupOf
            (Subgroup.normalizer ↑H) ≃*
        Gal(↥(IntermediateField.fixedField
              H)/K)
    **The automorphisms of a fixed field** (LMFDB `gg.field_automorphisms`): for a subgroup `H` of
    the Galois group of a finite Galois extension `L/K`, restriction identifies `N(H)/H` with the group
    `Aut(L^H/K)` of automorphisms of the fixed field `L^H` over `K`: this is how the Galois
    correspondence computes `Aut(L^H/K)` when `L^H/K` is not Galois. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/Galois/StemFieldAutomorphisms.lean
    complete
    theorem Subgroup.exists_isGalois_range_eq.{u} {X : Type u} [Finite X]
      (G : Subgroup (Equiv.Perm X)) :
      ∃ K L x x_1 x_2,
        ∃ (_ : FiniteDimensional K L) (_ : IsGalois K L),
          ∃ ρ, Function.Injective ⇑ρ ∧ ρ.range = G
    theorem Subgroup.exists_isGalois_range_eq.{u}
      {X : Type u} [Finite X]
      (G : Subgroup (Equiv.Perm X)) :
      ∃ K L x x_1 x_2,
        ∃ (_ : FiniteDimensional K L) (_ :
          IsGalois K L),
          ∃ ρ,
            Function.Injective ⇑ρ ∧
              ρ.range = G
    **Every group of permutations of a finite set is a Galois group** (LMFDB
    `gg.field_automorphisms`): for a subgroup `G` of `Sym(X)`, `X` finite, there are a finite Galois
    extension `L/K` and an injective homomorphism `Gal(L/K) → Sym(X)` with image `G`. Here `L` is the
    field `ℚ(x_i : i ∈ X)` of rational functions, on which `G` acts by permuting the variables, and
    `K = L^G` (Artin's theorem). So every transitive `G` is realised as in
    `IsGalois.card_aut_fixedField_stabilizer`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/Galois/StemFieldAutomorphisms.lean
    complete
    theorem IsGalois.normalClosure_fixedField_stabilizer.{u_1, u_2, u_3}
      {K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L] {X : Type u_3}
      [MulAction Gal(L/K) X] [MulAction.IsPretransitive Gal(L/K) X] (x : X)
      [FaithfulSMul Gal(L/K) X] :
      IntermediateField.normalClosure K
          (↥(IntermediateField.fixedField
              (MulAction.stabilizer Gal(L/K) x)))
          L =
        ⊤
    theorem IsGalois.normalClosure_fixedField_stabilizer.{u_1,
        u_2, u_3}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L]
      {X : Type u_3} [MulAction Gal(L/K) X]
      [MulAction.IsPretransitive Gal(L/K) X]
      (x : X) [FaithfulSMul Gal(L/K) X] :
      IntermediateField.normalClosure K
          (↥(IntermediateField.fixedField
              (MulAction.stabilizer Gal(L/K)
                x)))
          L =
        ⊤
    **The Galois closure of the stem field of a faithful transitive Galois group is `L`** (LMFDB
    `gg.field_automorphisms`): the normal closure in `L` of the fixed field of the stabilizer of a point
    is `L`, since the elements of `Gal(L/K)` fixing it fix every point of `X`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/Galois/StemFieldAutomorphisms.lean
    complete
    theorem AdjoinRoot.card_aut_eq_card_rootSet.{u_1} {K : Type u_1} [Field K]
      (f : Polynomial K) [Fact (Irreducible f)] :
      Nat.card Gal(AdjoinRoot f/K) = Nat.card ↑(f.rootSet (AdjoinRoot f))
    theorem AdjoinRoot.card_aut_eq_card_rootSet.{u_1}
      {K : Type u_1} [Field K]
      (f : Polynomial K)
      [Fact (Irreducible f)] :
      Nat.card Gal(AdjoinRoot f/K) =
        Nat.card ↑(f.rootSet (AdjoinRoot f))
    **The automorphisms of `K[x]/(f)` are counted by the roots of `f`** (LMFDB
    `gg.field_automorphisms`): for an irreducible `f`, the number of automorphisms of `F = K[x]/(f)`
    over `K` is the number of roots of `f` in `F`. 
Definition8.1.8
uses 0
Used by 8
Reverse dependency previews
Preview
Definition 5.2.31
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Galois group. (LMFDB)

The Galois group of an irreducible separable polynomial of degree n can be embedded in S_n through its action on the roots of the polynomial, with the image being well-defined up to labeling of the roots. Different labelings lead to conjugate subgroups. The subgroup acts transitively on \{1,\ldots,n\}. Conversely, for every transitive subgroup G of S_n with n\in\mathbb{Z}^+, there is a field K such that G is the Galois group of some polynomial over K.

Tau Ceti Review: Polynomial.Gal, Polynomial.Gal.galActionHom_injective, Polynomial.card_rootSet_eq_natDegree, Polynomial.Gal.galAction_isPretransitive, Equiv.map_permCongrHom_eq_map_conj.

Lean code for Definition8.1.8●6 declarations
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.{u_1} {F : Type u_1} [Field F] (p : Polynomial F) :
      Type u_1
    def Polynomial.Gal.{u_1} {F : Type u_1}
      [Field F] (p : Polynomial F) : Type u_1
    The Galois group of a polynomial. 
  • theoremdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    theorem Polynomial.Gal.galActionHom_injective.{u_1, u_2} {F : Type u_1}
      [Field F] (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      Function.Injective ⇑(Polynomial.Gal.galActionHom p E)
    theorem Polynomial.Gal.galActionHom_injective.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      Function.Injective
        ⇑(Polynomial.Gal.galActionHom p E)
    `gal p` embeds as a subgroup of permutations of the roots of `p` in `E`. 
  • theoremdefined in Mathlib/FieldTheory/Separable.lean
    complete
    theorem Polynomial.card_rootSet_eq_natDegree.{u, v} {F : Type u} [Field F]
      {K : Type v} [Field K] [Algebra F K] {p : Polynomial F}
      (hsep : p.Separable)
      (hsplit : (Polynomial.map (algebraMap F K) p).Splits) :
      Fintype.card ↑(p.rootSet K) = p.natDegree
    theorem Polynomial.card_rootSet_eq_natDegree.{u,
        v}
      {F : Type u} [Field F] {K : Type v}
      [Field K] [Algebra F K]
      {p : Polynomial F} (hsep : p.Separable)
      (hsplit :
        (Polynomial.map (algebraMap F K)
            p).Splits) :
      Fintype.card ↑(p.rootSet K) =
        p.natDegree
  • theoremdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    theorem Polynomial.Gal.galAction_isPretransitive.{u_1, u_2} {F : Type u_1}
      [Field F] (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits]
      (hp : Irreducible p) : MulAction.IsPretransitive p.Gal ↑(p.rootSet E)
    theorem Polynomial.Gal.galAction_isPretransitive.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits]
      (hp : Irreducible p) :
      MulAction.IsPretransitive p.Gal
        ↑(p.rootSet E)
  • theoremdefined in TauCeti/GroupTheory/Perm/PermCongr.lean
    complete
    theorem Equiv.map_permCongrHom_eq_map_conj.{u_1, u_2} {α : Type u_1}
      {β : Type u_2} (e e' : α ≃ β) (G : Subgroup (Equiv.Perm α)) :
      Subgroup.map e'.permCongrHom.toMonoidHom G =
        Subgroup.map (↑(MulAut.conj (e.symm.trans e')))
          (Subgroup.map e.permCongrHom.toMonoidHom G)
    theorem Equiv.map_permCongrHom_eq_map_conj.{u_1,
        u_2}
      {α : Type u_1} {β : Type u_2}
      (e e' : α ≃ β)
      (G : Subgroup (Equiv.Perm α)) :
      Subgroup.map e'.permCongrHom.toMonoidHom
          G =
        Subgroup.map
          (↑(MulAut.conj (e.symm.trans e')))
          (Subgroup.map
            e.permCongrHom.toMonoidHom G)
    **Reading a permutation group through two equivalences differs by exactly one conjugation**,
    by the re-indexing permutation `e.symm.trans e'`. So the transported subgroup is well defined
    only up to conjugacy, while the group itself is canonical. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/Galois/TransitiveGaloisGroup.lean
    complete
    theorem Subgroup.exists_galActionHom_range_eq_fin {n : ℕ} [NeZero n]
      (G : Subgroup (Equiv.Perm (Fin n)))
      [MulAction.IsPretransitive (↥G) (Fin n)] :
      ∃ K x f,
        Irreducible f ∧
          f.Separable ∧
            f.natDegree = n ∧
              ∃ e,
                Subgroup.map e.permCongrHom.toMonoidHom
                    (Polynomial.Gal.galActionHom f f.SplittingField).range =
                  G
    theorem Subgroup.exists_galActionHom_range_eq_fin
      {n : ℕ} [NeZero n]
      (G : Subgroup (Equiv.Perm (Fin n)))
      [MulAction.IsPretransitive (↥G)
          (Fin n)] :
      ∃ K x f,
        Irreducible f ∧
          f.Separable ∧
            f.natDegree = n ∧
              ∃ e,
                Subgroup.map
                    e.permCongrHom.toMonoidHom
                    (Polynomial.Gal.galActionHom
                        f
                        f.SplittingField).range =
                  G
    **Every transitive subgroup `G` of `S_n`, `n ≥ 1`, is the Galois group of a polynomial**
    (LMFDB `gg.galois_group`): there are a field `K` and an irreducible separable polynomial `f` of
    degree `n` over `K` whose roots, in its splitting field, can be labelled by `{1, …, n}` so that the
    Galois group of `f`, acting on them, becomes `G`. 
Definition8.1.9
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 0✓L∃∀N

Generic polynomial. (LMFDB)

Let K be a field and G a finite group, t_1, \ldots, t_n and x indeterminants. A polynomial f(t_1,\ldots,t_n,x)\in K(t_1,\ldots,t_n)[x] is generic for G if

  1. the splitting field L of f is Galois and regular over K(t_1,\ldots,t_n)

  2. \Gal(L/K(t_1,\ldots,t_n))\cong G

  3. every Galois extension E/K with \Gal(E/K)\cong G is the splitting field of f(a_1,\ldots,a_n,x) for some (a_1,\ldots,a_n)\in K^n

  4. condition 3 holds for every extension field of K.

Depends on: Definition 8.1.20 Definition 8.3.3 Definition 5.1.44 Definition 1.1.30

Lean code for Definition8.1.9●4 declarations
  • defdefined in LeanBridge/ForMathlib/FieldTheory/GenericPolynomialRatFunc.lean
    complete
    def Polynomial.IsGeneric.{u, u_1} (K : Type u) [Field K] (G : Type u_1)
      [Group G] {n : ℕ}
      (f : Polynomial (FractionRing (MvPolynomial (Fin n) K))) : Prop
    def Polynomial.IsGeneric.{u, u_1} (K : Type u)
      [Field K] (G : Type u_1) [Group G]
      {n : ℕ}
      (f :
        Polynomial
          (FractionRing
            (MvPolynomial (Fin n) K))) :
      Prop
    A polynomial `f ∈ K(t₁, …, tₙ)[x]` is **generic** (LMFDB `gg.generic_polynomial`) for the
    group `G` over `K` if, with `L` the splitting field of `f` over `K(t)`, the field of fractions of
    `K[t₁, …, tₙ]`:
    
    1. `L` is Galois over `K(t)` and regular over `K(t)` (LMFDB `gg.regular_extension`): every element
       of `L` algebraic over `K` lies in (the image of) `K`;
    2. `Gal(L/K(t)) ≅ G`;
    3. and 4. for every field `M ⊇ K` (of the universe of `K`) and every Galois extension `E/M` with
       `Gal(E/M) ≅ G`, there is a point `a ∈ Mⁿ` at which the specialisation `f(a, x)` is defined
       (`Polynomial.IsSpecialisationAt`: no denominator of the coefficients of `f` vanishes at `a`)
       and `E` is the splitting field of `f(a, x)` over `M`. 
  • defdefined in LeanBridge/ForMathlib/FieldTheory/GenericPolynomialRatFunc.lean
    complete
    def Polynomial.IsSpecialisationAt.{u, u_2} {K : Type u} [Field K] {n : ℕ}
      {M : Type u_2} [Field M] [Algebra K M]
      (f : Polynomial (FractionRing (MvPolynomial (Fin n) K)))
      (a : Fin n → M) (g : Polynomial M) : Prop
    def Polynomial.IsSpecialisationAt.{u, u_2}
      {K : Type u} [Field K] {n : ℕ}
      {M : Type u_2} [Field M] [Algebra K M]
      (f :
        Polynomial
          (FractionRing
            (MvPolynomial (Fin n) K)))
      (a : Fin n → M) (g : Polynomial M) :
      Prop
    The polynomial `g ∈ M[x]` is the **specialisation** `f(a₁, …, aₙ, x)` (LMFDB
    `gg.generic_polynomial`) of `f ∈ K(t₁, …, tₙ)[x]` at the point `a ∈ Mⁿ` of a field `M ⊇ K` if, for
    some denominator `q ∈ K[t]` of `f` with `q(a) ≠ 0`, so that `F = q f` lies in `K[t][x]`,
    `q(a) g = F(a, x)`. Such a `q` exists exactly when the coefficients of `f` are regular at `a`, and
    `g` then does not depend on it (`Polynomial.IsSpecialisationAt.eq`): at a point where denominators
    vanish the specialisation is undefined. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/GenericPolynomialRatFunc.lean
    complete
    theorem Polynomial.IsSpecialisationAt.eq.{u, u_2} {K : Type u} [Field K] {n : ℕ}
      {M : Type u_2} [Field M] [Algebra K M]
      {f : Polynomial (FractionRing (MvPolynomial (Fin n) K))}
      {a : Fin n → M} {g g' : Polynomial M} (h : f.IsSpecialisationAt a g)
      (h' : f.IsSpecialisationAt a g') : g = g'
    theorem Polynomial.IsSpecialisationAt.eq.{u, u_2}
      {K : Type u} [Field K] {n : ℕ}
      {M : Type u_2} [Field M] [Algebra K M]
      {f :
        Polynomial
          (FractionRing
            (MvPolynomial (Fin n) K))}
      {a : Fin n → M} {g g' : Polynomial M}
      (h : f.IsSpecialisationAt a g)
      (h' : f.IsSpecialisationAt a g') :
      g = g'
    **The specialisation of a polynomial over `K(t)` is well defined**: two specialisations of
    `f` at the same point, computed with two denominators of `f` that do not vanish there, agree. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/GenericPolynomialRatFunc.lean
    complete
    theorem Polynomial.isGenericPolynomial_iff.{u, u_1} {K : Type u} [Field K]
      (G : Type u_1) [Group G] {n : ℕ}
      (F : Polynomial (MvPolynomial (Fin n) K)) :
      Polynomial.IsGenericPolynomial K G F ↔
        F.Monic ∧
          Polynomial.IsGeneric K G
            (Polynomial.map
              (algebraMap (MvPolynomial (Fin n) K)
                (FractionRing (MvPolynomial (Fin n) K)))
              F)
    theorem Polynomial.isGenericPolynomial_iff.{u,
        u_1}
      {K : Type u} [Field K] (G : Type u_1)
      [Group G] {n : ℕ}
      (F :
        Polynomial (MvPolynomial (Fin n) K)) :
      Polynomial.IsGenericPolynomial K G F ↔
        F.Monic ∧
          Polynomial.IsGeneric K G
            (Polynomial.map
              (algebraMap
                (MvPolynomial (Fin n) K)
                (FractionRing
                  (MvPolynomial (Fin n) K)))
              F)
    **Generic polynomials over `K[t]` are generic polynomials over `K(t)`**: a polynomial
    `f ∈ K[t][x]` satisfies `Polynomial.IsGenericPolynomial` exactly when it is monic and its image in
    `K(t)[x]` is generic, its specialisations being the polynomials `f(a, x)`. 
Definition8.1.10
uses 0used by 0✓L∃∀N

Group action Invariants. (LMFDB)

If a group G acts transitively on an n element set, the action is isomorphic to the natural action of a transitive subgroup of S_n. In terms of the Galois correspondence, we consider an irreducible separable polynomial f(x)\in K[x], let F be a field obtained by adjoining a root of f(x) to K and suppose G is the Galois group of the splitting field of f(x) over K where the action on the roots of f(x), \alpha_1, \ldots, \alpha_n is through the subscripts.

The degree is n, the number of elements in the set which equals \deg(f)=[F:K].

Transitive subgroups of S_n have been classified and numbered; t is the corresponding number assigned to this group.

The parity is 1 if G is a subgroup of A_n, otherwise it is -1.

The action is primitive if the only block of size larger than 1 for the action is the whole set. In terms of the Galois correspondence, the action of G is primitive if and only if F/K has no proper intermediate fields.

Resolvent fields are other fields inside the splitting field of f(x) over K. These correspond to small index subgroups of G,up to conjugation. For a degree m field E, the action of G on the embeddings of E into the splitting field of f(x) gives a transitive group action, which is faithful for the appropriate quotient of G. These are given in terms of the degree of the normal closure of E, and information describing the faithful transitive group action corresponding to E.

Tau Ceti Review: MulAction.IsPreprimitive, alternatingGroup, IntermediateField, Polynomial.natDegree, TauCeti.isPreprimitive_iff_isAtom_adjoin_simple, Polynomial.Gal.sign, Equiv.permutationRepresentation, Equiv.permutationRepresentation_injective, Polynomial.Gal.galActionHom, Polynomial.Gal.galActionHom_injective, Polynomial.Gal.galAction_isPretransitive, Polynomial.card_rootSet_eq_natDegree, IntermediateField.adjoin.finrank, Polynomial.Gal.sign_eq_one_iff_range_le_alternatingGroup, MulAction.IsBlock, AlgEquiv.mulActionAlgHom, AlgEquiv.isPretransitiveAlgHom, TauCeti.FieldTheory.faithfulSMul_of_normalClosure_eq_top.

Lean code for Definition8.1.10●19 declarations
  • class(extends 1, 2 methods)defined in Mathlib/GroupTheory/GroupAction/Primitive.lean
    complete
    class MulAction.IsPreprimitive.{u_1, u_2} (G : Type u_1) (X : Type u_2)
      [SMul G X] : Prop
    class MulAction.IsPreprimitive.{u_1, u_2}
      (G : Type u_1) (X : Type u_2)
      [SMul G X] : Prop
    An action is preprimitive if it is pretransitive and
    the only blocks are the trivial ones 
    • MulAction.IsPretransitive G X
    exists_smul_eq : ∀ (x y : X), ∃ g, g • x = y
    Inherited from
    1. MulAction.IsPretransitive
    isTrivialBlock_of_isBlock : ∀ {B : Set X}, MulAction.IsBlock G B → MulAction.IsTrivialBlock B
    An action is preprimitive if it is pretransitive and
    the only blocks are the trivial ones 
  • 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)`. 
  • structure(extends 6, 7 fields)defined in Mathlib/FieldTheory/IntermediateField/Basic.lean
    complete
    structure IntermediateField.{u_1, u_2} (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [Algebra K L] : Type u_2
    structure IntermediateField.{u_1, u_2}
      (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [Algebra K L] : Type u_2
    `S : IntermediateField K L` is a subset of `L` such that there is a field
    tower `L / S / K`. 
    • Subalgebra K L
    carrier : Set L
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    4. Subsemigroup
    mul_mem' : ∀ {a b : L}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    4. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    add_mem' : ∀ {a b : L}, a ∈ self.carrier → b ∈ self.carrier → a + b ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    zero_mem' : 0 ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    algebraMap_mem' : ∀ (r : K), (algebraMap K L) r ∈ self.carrier
    Inherited from
    1. Subalgebra
    inv_mem' : ∀ x ∈ self.carrier, x⁻¹ ∈ self.carrier
  • defdefined in Mathlib/Algebra/Polynomial/Degree/Defs.lean
    complete
    def Polynomial.natDegree.{u} {R : Type u} [Semiring R] (p : Polynomial R) :
      ℕ
    def Polynomial.natDegree.{u} {R : Type u}
      [Semiring R] (p : Polynomial R) : ℕ
    `natDegree p` forces `degree p` to ℕ, by defining `natDegree 0 = 0`. 
  • theoremdefined in TauCeti/FieldTheory/GaloisGroups/Blocks.lean
    complete
    theorem TauCeti.isPreprimitive_iff_isAtom_adjoin_simple.{u} {F : Type u}
      [Field F] {p : Polynomial F} (hp : Irreducible p) (hsep : p.Separable)
      (hdeg : 1 < p.natDegree) (x : ↑(p.rootSet p.SplittingField)) :
      MulAction.IsPreprimitive p.Gal ↑(p.rootSet p.SplittingField) ↔
        IsAtom F⟮↑x⟯
    theorem TauCeti.isPreprimitive_iff_isAtom_adjoin_simple.{u}
      {F : Type u} [Field F]
      {p : Polynomial F} (hp : Irreducible p)
      (hsep : p.Separable)
      (hdeg : 1 < p.natDegree)
      (x : ↑(p.rootSet p.SplittingField)) :
      MulAction.IsPreprimitive p.Gal
          ↑(p.rootSet p.SplittingField) ↔
        IsAtom F⟮↑x⟯
    **The Galois action on the roots is primitive exactly when the simple extension generated by
    a root has no proper intermediate fields.** The degree assumption excludes the one-point action,
    whose generated intermediate field is bottom and hence not an atom. 
  • defdefined in TauCeti/FieldTheory/GaloisGroups/Parity.lean
    complete
    def Polynomial.Gal.sign.{u} {F : Type u} [Field F] (p : Polynomial F) :
      p.Gal →* ℤˣ
    def Polynomial.Gal.sign.{u} {F : Type u}
      [Field F] (p : Polynomial F) :
      p.Gal →* ℤˣ
    The parity character of the action of `p.Gal` on the distinct roots of `p` in its splitting
    field. It takes values in `ℤˣ`, independently of the characteristic of the base field. 
  • 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.permutationRepresentation_injective.{u_1, u_2} {G : Type u_1}
      {α : Type u_2} [Group G] [MulAction G α] {n : ℕ} [FaithfulSMul G α]
      (e : α ≃ Fin n) : Function.Injective ⇑e.permutationRepresentation
    theorem Equiv.permutationRepresentation_injective.{u_1,
        u_2}
      {G : Type u_1} {α : Type u_2} [Group G]
      [MulAction G α] {n : ℕ}
      [FaithfulSMul G α] (e : α ≃ Fin n) :
      Function.Injective
        ⇑e.permutationRepresentation
    **`G` embeds in `S_n`** when the action is faithful: an element acting trivially on the
    enumerated points fixes every point, hence is the identity. 
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.galActionHom.{u_1, u_2} {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    def Polynomial.Gal.galActionHom.{u_1, u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    `Polynomial.Gal.galAction` as a permutation representation 
  • theoremdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    theorem Polynomial.Gal.galActionHom_injective.{u_1, u_2} {F : Type u_1}
      [Field F] (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      Function.Injective ⇑(Polynomial.Gal.galActionHom p E)
    theorem Polynomial.Gal.galActionHom_injective.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      Function.Injective
        ⇑(Polynomial.Gal.galActionHom p E)
    `gal p` embeds as a subgroup of permutations of the roots of `p` in `E`. 
  • theoremdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    theorem Polynomial.Gal.galAction_isPretransitive.{u_1, u_2} {F : Type u_1}
      [Field F] (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits]
      (hp : Irreducible p) : MulAction.IsPretransitive p.Gal ↑(p.rootSet E)
    theorem Polynomial.Gal.galAction_isPretransitive.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits]
      (hp : Irreducible p) :
      MulAction.IsPretransitive p.Gal
        ↑(p.rootSet E)
  • theoremdefined in Mathlib/FieldTheory/Separable.lean
    complete
    theorem Polynomial.card_rootSet_eq_natDegree.{u, v} {F : Type u} [Field F]
      {K : Type v} [Field K] [Algebra F K] {p : Polynomial F}
      (hsep : p.Separable)
      (hsplit : (Polynomial.map (algebraMap F K) p).Splits) :
      Fintype.card ↑(p.rootSet K) = p.natDegree
    theorem Polynomial.card_rootSet_eq_natDegree.{u,
        v}
      {F : Type u} [Field F] {K : Type v}
      [Field K] [Algebra F K]
      {p : Polynomial F} (hsep : p.Separable)
      (hsplit :
        (Polynomial.map (algebraMap F K)
            p).Splits) :
      Fintype.card ↑(p.rootSet K) =
        p.natDegree
  • theoremdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
    complete
    theorem IntermediateField.adjoin.finrank.{u, u_3} {K : Type u} [Field K]
      {L : Type u_3} [Field L] [Algebra K L] {x : L} (hx : IsIntegral K x) :
      Module.finrank K ↥K⟮x⟯ = (minpoly K x).natDegree
    theorem IntermediateField.adjoin.finrank.{u, u_3}
      {K : Type u} [Field K] {L : Type u_3}
      [Field L] [Algebra K L] {x : L}
      (hx : IsIntegral K x) :
      Module.finrank K ↥K⟮x⟯ =
        (minpoly K x).natDegree
    If `x` is an algebraic element of field `K`, then its minimal polynomial has degree
    `[K(x) : K]`. 
  • theoremdefined in TauCeti/FieldTheory/GaloisGroups/Parity.lean
    complete
    theorem Polynomial.Gal.sign_eq_one_iff_range_le_alternatingGroup.{u, v}
      {F : Type u} [Field F] (p : Polynomial F) (E : Type v) [Field E]
      [Algebra F E] [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      Polynomial.Gal.sign p = 1 ↔
        (Polynomial.Gal.galActionHom p E).range ≤
          alternatingGroup ↑(p.rootSet E)
    theorem Polynomial.Gal.sign_eq_one_iff_range_le_alternatingGroup.{u,
        v}
      {F : Type u} [Field F]
      (p : Polynomial F) (E : Type v)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      Polynomial.Gal.sign p = 1 ↔
        (Polynomial.Gal.galActionHom p
              E).range ≤
          alternatingGroup ↑(p.rootSet E)
    The parity character is trivial exactly when the Galois image consists of even permutations
    of the roots. No separability or characteristic restriction is needed for this characterization. 
  • defdefined in Mathlib/GroupTheory/GroupAction/Blocks.lean
    complete
    def MulAction.IsBlock.{u_1, u_2} (G : Type u_1) {X : Type u_2} [SMul G X]
      (B : Set X) : Prop
    def MulAction.IsBlock.{u_1, u_2}
      (G : Type u_1) {X : Type u_2} [SMul G X]
      (B : Set X) : Prop
    A set `B` is a `G`-block iff the sets of the form `g • B` are pairwise equal or disjoint. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/Galois/PrimitiveRootAction.lean
    complete
    theorem Polynomial.Gal.isPreprimitive_iff_forall_eq_bot_or_eq_top.{u_1, u_2}
      {K : Type u_1} [Field K] {f : Polynomial K} {E : Type u_2} [Field E]
      [Algebra K E] {α : E} (hf : Irreducible f) (hsep : f.Separable)
      (hα : (Polynomial.aeval α) f = 0) :
      MulAction.IsPreprimitive f.Gal ↑(f.rootSet f.SplittingField) ↔
        ∀ (L : IntermediateField K ↥K⟮α⟯), L = ⊥ ∨ L = ⊤
    theorem Polynomial.Gal.isPreprimitive_iff_forall_eq_bot_or_eq_top.{u_1,
        u_2}
      {K : Type u_1} [Field K]
      {f : Polynomial K} {E : Type u_2}
      [Field E] [Algebra K E] {α : E}
      (hf : Irreducible f)
      (hsep : f.Separable)
      (hα : (Polynomial.aeval α) f = 0) :
      MulAction.IsPreprimitive f.Gal
          ↑(f.rootSet f.SplittingField) ↔
        ∀ (L : IntermediateField K ↥K⟮α⟯),
          L = ⊥ ∨ L = ⊤
    **The Galois group of an irreducible separable polynomial `f` acts primitively on its roots
    exactly when the field `K(α)` generated by a root `α` has no proper intermediate fields** (LMFDB
    `gg.group_action_invariants`), that is when every intermediate field of `K(α) / K` is `K` or
    `K(α)`. Here `α` is a root of `f` in any extension of `K`, and the statement holds in every degree:
    in degree `1` the action on the single root is primitive and `K(α) = K`. 
  • defdefined in TauCeti/Algebra/GroupAction/AlgHom.lean
    complete
    def AlgEquiv.mulActionAlgHom.{u_1, u_2, u_3} {K : Type u_1} {L : Type u_2}
      {M : Type u_3} [CommSemiring K] [Semiring L] [Semiring M]
      [Algebra K L] [Algebra K M] : MulAction (M ≃ₐ[K] M) (L →ₐ[K] M)
    def AlgEquiv.mulActionAlgHom.{u_1, u_2, u_3}
      {K : Type u_1} {L : Type u_2}
      {M : Type u_3} [CommSemiring K]
      [Semiring L] [Semiring M] [Algebra K L]
      [Algebra K M] :
      MulAction (M ≃ₐ[K] M) (L →ₐ[K] M)
    Postcomposition makes `L →ₐ[K] M` an `M ≃ₐ[K] M`-set. 
  • theoremdefined in TauCeti/FieldTheory/Normal/Embeddings.lean
    complete
    theorem AlgEquiv.isPretransitiveAlgHom.{u_1, u_2, u_3} {F : Type u_1}
      {L : Type u_2} {M : Type u_3} [Field F] [Field L] [Field M]
      [Algebra F L] [Algebra F M] [Normal F M] :
      MulAction.IsPretransitive Gal(M/F) (L →ₐ[F] M)
    theorem AlgEquiv.isPretransitiveAlgHom.{u_1, u_2,
        u_3}
      {F : Type u_1} {L : Type u_2}
      {M : Type u_3} [Field F] [Field L]
      [Field M] [Algebra F L] [Algebra F M]
      [Normal F M] :
      MulAction.IsPretransitive Gal(M/F)
        (L →ₐ[F] M)
    **Any two embeddings into a normal extension are conjugate**, so they lie in the same orbit.
    No embedding is asserted to exist: when `L →ₐ[F] M` is empty this holds vacuously. 
  • theoremdefined in TauCeti/FieldTheory/Normal/Embeddings.lean
    complete
    theorem TauCeti.FieldTheory.faithfulSMul_of_normalClosure_eq_top.{u_1, u_2, u_3}
      {F : Type u_1} {L : Type u_2} {M : Type u_3} [Field F] [Field L]
      [Field M] [Algebra F L] [Algebra F M]
      (hgen : IntermediateField.normalClosure F L M = ⊤) :
      FaithfulSMul Gal(M/F) (L →ₐ[F] M)
    theorem TauCeti.FieldTheory.faithfulSMul_of_normalClosure_eq_top.{u_1,
        u_2, u_3}
      {F : Type u_1} {L : Type u_2}
      {M : Type u_3} [Field F] [Field L]
      [Field M] [Algebra F L] [Algebra F M]
      (hgen :
        IntermediateField.normalClosure F L
            M =
          ⊤) :
      FaithfulSMul Gal(M/F) (L →ₐ[F] M)
    **The action on embeddings is faithful** when the embedded images generate `M`.
    
    With this instance in scope, injectivity of the permutation representation is Mathlib's
    `smul_left_injective'`; no separate statement is needed. 
Definition8.1.11
uses 0
Used by 4
Reverse dependency previews
Preview
Definition 8.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Index of a permuation. (LMFDB)

If \sigma\in S_n, its index is

\textrm{ind}(\sigma) = n - \text{number of cycles}

for the full disjoint cycle decomposition of \sigma.

Tau Ceti Review: TauCeti.orbitCount, Equiv.Perm.isLeast_card_sub_orbitCount, Equiv.Perm.partition.

Lean code for Definition8.1.11●3 declarations
  • defdefined in TauCeti/GroupTheory/Perm/OrbitCount/Basic.lean
    complete
    def TauCeti.orbitCount.{u_1} {α : Type u_1} (σ : Equiv.Perm α) : ℕ
    def TauCeti.orbitCount.{u_1} {α : Type u_1}
      (σ : Equiv.Perm α) : ℕ
    The number of orbits of the cyclic group generated by a permutation `σ`, that is, the number
    of classes of `Equiv.Perm.SameCycle σ`. Every fixed point of `σ` is an orbit, so on a finite type
    this counts the cycles of `σ` *together with* its fixed points, whereas
    `Equiv.Perm.cycleType` records only the former. Being a `Nat.card`, it is `0` when there are
    infinitely many orbits. 
  • theoremdefined in TauCeti/GroupTheory/Perm/SwapFactors.lean
    complete
    theorem Equiv.Perm.isLeast_card_sub_orbitCount.{u_1} {α : Type u_1}
      [DecidableEq α] [Finite α] (σ : Equiv.Perm α) :
      IsLeast {m | ∃ L, (∀ g ∈ L, g.IsSwap) ∧ L.prod = σ ∧ L.length = m}
        (Nat.card α - TauCeti.orbitCount σ)
    theorem Equiv.Perm.isLeast_card_sub_orbitCount.{u_1}
      {α : Type u_1} [DecidableEq α]
      [Finite α] (σ : Equiv.Perm α) :
      IsLeast
        {m |
          ∃ L,
            (∀ g ∈ L, g.IsSwap) ∧
              L.prod = σ ∧ L.length = m}
        (Nat.card α - TauCeti.orbitCount σ)
    **The reflection length of a permutation of a finite type.** The least number of transpositions
    whose product is `σ` is `Nat.card α - orbitCount σ`. 
  • defdefined in Mathlib/GroupTheory/Perm/Cycle/Type.lean
    complete
    def Equiv.Perm.partition.{u_1} {α : Type u_1} [Fintype α] [DecidableEq α]
      (σ : Equiv.Perm α) : (Fintype.card α).Partition
    def Equiv.Perm.partition.{u_1} {α : Type u_1}
      [Fintype α] [DecidableEq α]
      (σ : Equiv.Perm α) :
      (Fintype.card α).Partition
    The partition corresponding to a permutation 
Definition8.1.12
uses 0used by 0✓L∃∀N

Indecomposable integral representation. (LMFDB)

If G is a finite group, an integral representation of G is a homomorphism \rho\colon G\to\Aut(\Z^r) for some r\in\Z, r> 0.

The representation \rho is indecomposable if it is not equivalent to the direct sum of integral representations.

Tau Ceti Review: Representation, Representation.asModule, TauCeti.IsIndecomposableModule.

Lean code for Definition8.1.12●3 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)`.
    
  • defdefined in Mathlib/RepresentationTheory/Basic.lean
    complete
    def Representation.asModule.{u_4, u_5, u_6} {k : Type u_4} {G : Type u_5}
      {V : Type u_6} [Semiring k] [Monoid G] [AddCommMonoid V]
      [Module k V] : Representation k G V → Type u_6
    def Representation.asModule.{u_4, u_5, u_6}
      {k : Type u_4} {G : Type u_5}
      {V : Type u_6} [Semiring k] [Monoid G]
      [AddCommMonoid V] [Module k V] :
      Representation k G V → Type u_6
    If `ρ : Representation k G V`, then `ρ.asModule` is a type synonym for `V`,
    which we equip with an instance `Module k[G] ρ.asModule`.
    
    You should use `asModuleEquiv : ρ.asModule ≃+ V` to translate terms.
    
  • defdefined in TauCeti/RingTheory/KrullSchmidt/Indecomposable.lean
    complete
    def TauCeti.IsIndecomposableModule.{u, v} (A : Type u) (M : Type v)
      [Semiring A] [AddCommMonoid M] [Module A M] : Prop
    def TauCeti.IsIndecomposableModule.{u, v}
      (A : Type u) (M : Type v) [Semiring A]
      [AddCommMonoid M] [Module A M] : Prop
    A module is **indecomposable** when it is nonzero and is not the internal direct sum of two
    nonzero submodules. 
Definition8.1.13
uses 0used by 0✓L∃∀N

Group invariants. (LMFDB)

The order of G is its number of elements.

It is cyclic if and only if there exists g\in G such that G=\langle g\rangle, the cyclic subgroup generated by g.

It is abelian if and only if xy=yx for all x,y\in G.

It is solvable if and only if there is a series of subgroups

\langle e\rangle = G_0 \leq G_1 \leq \cdots \leq G_n=G

such that each G_i is normal in G_{i+1} and all quotients G_{i+1}/G_i are abelian.

The character table shows values of all characters of irreducible complex representations of G. The rows are indexed by characters, and the columns by conjugacy classes of G.

Tau Ceti Review: Nat.card, isCyclic_iff_exists_zpowers_eq_top, isMulCommutative_iff, Group.IsSolvable, TauCeti.characterTable.

Lean code for Definition8.1.13●6 declarations
  • 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`. 
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Cyclic/Subgroup.lean
    complete
    theorem isCyclic_iff_exists_zpowers_eq_top.{u_1} {α : Type u_1} [Group α] :
      IsCyclic α ↔ ∃ g, Subgroup.zpowers g = ⊤
    theorem isCyclic_iff_exists_zpowers_eq_top.{u_1}
      {α : Type u_1} [Group α] :
      IsCyclic α ↔ ∃ g, Subgroup.zpowers g = ⊤
  • theoremdefined in Mathlib/Algebra/Group/Semigroup.lean
    complete
    theorem isMulCommutative_iff.{u_2} {M : Type u_2} [Mul M] :
      IsMulCommutative M ↔ ∀ (a b : M), a * b = b * a
    theorem isMulCommutative_iff.{u_2} {M : Type u_2}
      [Mul M] :
      IsMulCommutative M ↔
        ∀ (a b : M), a * b = b * a
  • 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. 
  • 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. 
Definition8.1.14
Statement uses 2
Statement dependency previews
Preview
Definition 8.1.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 5.1.33
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Galois group label. (LMFDB)

Labels for Galois groups are of the form \tt{nTt} where n is the degree and t is the T-number.

Depends on: Definition 8.1.5 Definition 8.1.26

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

Malle's constant a(G). (LMFDB)

If G is a subgroup of S_n, Malle's constant is defined as

a(G)=\frac{1}{\min(\{\textrm{ind}(g) \mid e\neq g\in G\})}

where \textrm{ind}(g) is the index of the element g. Note, if G is the trivial group, a(G) is defined to be 0.

This constant appears in the conjectures of Malle on asymptotics for the number of number fields with a given Galois group G\leq S_n , .

Depends on: Definition 8.1.11 Definition 8.3.160

Lean code for Definition8.1.15●4 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.malleA.{u_1} {α : Type u_1} (G : Subgroup (Equiv.Perm α)) : ℚ
    def Subgroup.malleA.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : ℚ
    **Malle's constant** `a(G) = 1 / min {ind(g) | g ∈ G, g ≠ 1}` (LMFDB `gg.malle_a`) of a
    permutation group `G`, and `0` when `G` is trivial (`Subgroup.malleA_bot`). 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.minPermIndex.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : ℕ
    def Subgroup.minPermIndex.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : ℕ
    The least index `ind(G)` of a non-identity element of a permutation group `G` (LMFDB
    `gg.malle_a`), and `0` when `G` is trivial. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    theorem Subgroup.malleA_bot.{u_1} {α : Type u_1} : ⊥.malleA = 0
    theorem Subgroup.malleA_bot.{u_1} {α : Type u_1} :
      ⊥.malleA = 0
    **`a(G) = 0` for the trivial group.** 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Equiv.Perm.permIndex.{u_1} {α : Type u_1} (g : Equiv.Perm α) : ℕ
    def Equiv.Perm.permIndex.{u_1} {α : Type u_1}
      (g : Equiv.Perm α) : ℕ
    The **index** of a permutation `g` of a finite set `α` (LMFDB `gg.index`):
    `ind(g) = |α| - c(g)`, where `c(g)` is the number of orbits of `g`, the least number of
    transpositions whose product is `g` (`Equiv.Perm.isLeast_card_sub_orbitCount`). 
Definition8.1.16
Statement uses 4
Statement dependency previews
Preview
Definition 8.1.11
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Malle's constant b(G). (LMFDB)

Let G be a subgroup of S_n and \mathrm{CL}_{\Q}(G) the collection of rational conjugacy classes of G.

Malle's constant b(G) is defined to be

b(G)=\# \{ C \in \mathrm{CL}_{\Q}(G) : \textrm{ind}(C) = a(G)^{-1}\}

where \textrm{ind}(C) is the index of C. Here a(G) is Malle's constant a(G), so that b(G) is the number of non-identity rational conjugacy classes of G of minimal index.

These constants appear in the conjectures of Malle on asymptotics for the number of number fields with a given Galois group G\leq S_n , .

Depends on: Definition 8.1.11 Definition 8.1.15 Definition 8.3.42 Definition 8.3.160

Lean code for Definition8.1.16●8 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.malleB.{u_1} {α : Type u_1} (G : Subgroup (Equiv.Perm α)) : ℕ
    def Subgroup.malleB.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : ℕ
    **Malle's constant** `b(G)` (LMFDB `gg.malle_b`) of a permutation group `G`: the number of
    rational conjugacy classes (`RatConjClasses`) of `G` of index `ind(G) = a(G)⁻¹`, that is, of the
    rational conjugacy classes that meet `minPermIndexElements`. Rationally conjugate elements have the
    same index, so these classes consist of non-identity elements of minimal index; `b(G) = 0` for
    trivial `G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.minPermIndexElements.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Set ↥G
    def Subgroup.minPermIndexElements.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Set ↥G
    The non-identity elements of `G` of least index `ind(G)`, the **elements of minimal index** of
    LMFDB `gg.concentrated`. 
  • 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`. 
  • 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. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleRationalClassIndex.lean
    complete
    def RatConjClasses.permIndex.{u_1} {α : Type u_1}
      {G : Subgroup (Equiv.Perm α)} : RatConjClasses ↥G → ℕ
    def RatConjClasses.permIndex.{u_1}
      {α : Type u_1}
      {G : Subgroup (Equiv.Perm α)} :
      RatConjClasses ↥G → ℕ
    The **index** `ind(C)` (LMFDB `gg.malle_b`, `gg.index`) of a rational conjugacy class `C` of a
    permutation group `G`: the index of any of its elements, which does not depend on the element
    (`IsRationallyConj.permIndex_coe_eq`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleRationalClassIndex.lean
    complete
    theorem IsRationallyConj.permIndex_coe_eq.{u_1} {α : Type u_1}
      {G : Subgroup (Equiv.Perm α)} {x y : ↥G} (h : IsRationallyConj x y) :
      (↑x).permIndex = (↑y).permIndex
    theorem IsRationallyConj.permIndex_coe_eq.{u_1}
      {α : Type u_1}
      {G : Subgroup (Equiv.Perm α)} {x y : ↥G}
      (h : IsRationallyConj x y) :
      (↑x).permIndex = (↑y).permIndex
    **Rationally conjugate elements of a permutation group have the same index** (LMFDB
    `gg.malle_b`, `gg.index`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleRationalClassIndex.lean
    complete
    theorem Subgroup.malleB_eq_card_permIndex_eq_malleA_inv.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) [Finite α] (hG : G ≠ ⊥) :
      G.malleB = Nat.card { C // ↑C.permIndex = G.malleA⁻¹ }
    theorem Subgroup.malleB_eq_card_permIndex_eq_malleA_inv.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) [Finite α]
      (hG : G ≠ ⊥) :
      G.malleB =
        Nat.card
          { C // ↑C.permIndex = G.malleA⁻¹ }
    **Malle's constant `b(G)` counts the rational conjugacy classes `C` of `G` with
    `ind(C) = a(G)⁻¹`** (LMFDB `gg.malle_b`), for a nontrivial permutation group `G` of a finite set:
    `a(G)⁻¹` is then the least index of a non-identity element, which the class of the identity, of
    index `0`, does not have. For the trivial group `a(G)⁻¹` is not defined, and `b(G) = 0` is the
    number of non-identity classes (`Subgroup.malleB_eq_card_ne_mk_one`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleRationalClassIndex.lean
    complete
    theorem Subgroup.malleB_eq_card_ne_mk_one.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) :
      G.malleB =
        Nat.card
          { C // C ≠ RatConjClasses.mk 1 ∧ C.permIndex = G.minPermIndex }
    theorem Subgroup.malleB_eq_card_ne_mk_one.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) :
      G.malleB =
        Nat.card
          { C //
            C ≠ RatConjClasses.mk 1 ∧
              C.permIndex = G.minPermIndex }
    **Malle's constant `b(G)` is the number of non-identity rational conjugacy classes of `G` of
    minimal index** (LMFDB `gg.malle_b`). 
Definition8.1.17
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.80
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Siblings for a Galois group. (LMFDB)

An abstract group G may be a transitive subgroup of S_n for different n and even in different (non-conjugate) ways for a given n. Each action is identified by a label of the form "'nTt"' where n is the degree and "'t"' is the T-number classifying the action.

In terms of the Galois correspondence, the group G corresponds to a degree n extension F/K where F=K(\alpha), and G is the Galois group of the splitting field of the monic irreducible polynomial for \alpha. The siblings correspond to sibling fields, which are not isomorphic to F, yet have the same normal closure.

There can be more than one action with the same transitive classification. This corresponds to non-isomorphic fields with the same degree, Galois group, and Galois closure. We indicate multiplicity using the notation """nTt x k""" where there are "'k"' non-conjugate subgroups such that the action is "'nTt"'.

Tau Ceti Review: Subgroup.normalCore.

Depends on: Definition 8.1.5 Definition 5.1.80

Lean code for Definition8.1.17●5 declarations
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Sibling.lean
    complete
    def Subgroup.IsSibling.{u_1} {G : Type u_1} [Group G] (H H' : Subgroup G) :
      Prop
    def Subgroup.IsSibling.{u_1} {G : Type u_1}
      [Group G] (H H' : Subgroup G) : Prop
    Two subgroups `H` and `H'` of a group `G` are **siblings** (LMFDB `gg.other_representations`)
    if `G` acts faithfully on `G ⧸ H` and on `G ⧸ H'`, that is, `H` and `H'` have trivial normal
    cores, and the two actions are not equivalent, that is, `H` and `H'` are not conjugate.
    
    For a transitive permutation group `G ≤ Sym(n)` with point stabilizer `H`, the siblings of `H` are
    the other faithful transitive permutation representations of the abstract group `G`; for the
    Galois group of a finite Galois extension they correspond to the sibling fields
    (`IntermediateField.isSibling_fixedField_iff_isSibling`). The LMFDB names each of them by the label
    `nTt` of its image in the symmetric group, of degree `n = [G : H']`, and writes `nTt x k` when `k`
    pairwise non-conjugate siblings have the same label; these labels, a database classification of
    transitive groups, are not formalised here. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Sibling.lean
    complete
    theorem IntermediateField.isSibling_fixedField_iff_isSibling.{u_1, u_2}
      {K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L] (H H' : Subgroup Gal(L/K))
      (hH : H.normalCore = ⊥) :
      Algebra.IsSibling K ↥(IntermediateField.fixedField H)
          ↥(IntermediateField.fixedField H') ↔
        H.IsSibling H'
    theorem IntermediateField.isSibling_fixedField_iff_isSibling.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L]
      (H H' : Subgroup Gal(L/K))
      (hH : H.normalCore = ⊥) :
      Algebra.IsSibling K
          ↥(IntermediateField.fixedField H)
          ↥(IntermediateField.fixedField H') ↔
        H.IsSibling H'
    **For a transitive permutation group, sibling subgroups are sibling fields**: if `H` has
    trivial normal core, so that `L` is the Galois closure of `L ^ H` and `Gal(L/K)` acts faithfully
    on `Gal(L/K) ⧸ H`, then the fixed fields of `H` and `H'` are sibling fields exactly when `H'` is a
    sibling of `H`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/Sibling.lean
    complete
    theorem IntermediateField.isSibling_fixedField_iff.{u_1, u_2} {K : Type u_1}
      {L : Type u_2} [Field K] [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L] (H H' : Subgroup Gal(L/K)) :
      Algebra.IsSibling K ↥(IntermediateField.fixedField H)
          ↥(IntermediateField.fixedField H') ↔
        (∀ (σ : Gal(L/K)), MulAut.conj σ • H ≠ H') ∧
          H.normalCore = H'.normalCore
    theorem IntermediateField.isSibling_fixedField_iff.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      [FiniteDimensional K L] [IsGalois K L]
      (H H' : Subgroup Gal(L/K)) :
      Algebra.IsSibling K
          ↥(IntermediateField.fixedField H)
          ↥(IntermediateField.fixedField H') ↔
        (∀ (σ : Gal(L/K)),
            MulAut.conj σ • H ≠ H') ∧
          H.normalCore = H'.normalCore
    **The fixed fields of two subgroups of a Galois group are siblings if and only if the subgroups
    are not conjugate and have the same normal core**, the fixing subgroup of the common Galois
    closure. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Sibling.lean
    complete
    def Algebra.IsSibling.{u_1, u_2, u_3} (F : Type u_1) (A : Type u_2)
      (B : Type u_3) [Field F] [CommRing A] [Algebra F A] [CommRing B]
      [Algebra F B] : Prop
    def Algebra.IsSibling.{u_1, u_2, u_3}
      (F : Type u_1) (A : Type u_2)
      (B : Type u_3) [Field F] [CommRing A]
      [Algebra F A] [CommRing B]
      [Algebra F B] : Prop
    Two `F`-algebras `A` and `B` are **siblings** (LMFDB `nf.sibling`) if they are not isomorphic
    but have isomorphic Galois closures. The LMFDB considers finite separable extensions of `F`, and
    finite separable `ℚ`-algebras, for which this is its definition. 
  • 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`. 
Definition8.1.18
uses 1used by 0✓L∃∀N

Parity of a Galois group. (LMFDB)

A Galois group G\leq S_n has parity 1 if G\leq A_n, and -1 otherwise.

Tau Ceti Review: alternatingGroup, Equiv.Perm.sign, Polynomial.Gal.sign.

Depends on: Definition 8.1.8

Lean code for Definition8.1.18●3 definitions
  • 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)`. 
  • defdefined in Mathlib/GroupTheory/Perm/Sign.lean
    complete
    def Equiv.Perm.sign.{u} {α : Type u} [DecidableEq α] [Fintype α] :
      Equiv.Perm α →* ℤˣ
    def Equiv.Perm.sign.{u} {α : Type u}
      [DecidableEq α] [Fintype α] :
      Equiv.Perm α →* ℤˣ
    `SignType.sign` of a permutation returns the signature or parity of a permutation, `1` for even
    permutations, `-1` for odd permutations. It is the unique surjective group homomorphism from
    `Perm α` to the group with two elements. 
  • defdefined in TauCeti/FieldTheory/GaloisGroups/Parity.lean
    complete
    def Polynomial.Gal.sign.{u} {F : Type u} [Field F] (p : Polynomial F) :
      p.Gal →* ℤˣ
    def Polynomial.Gal.sign.{u} {F : Type u}
      [Field F] (p : Polynomial F) :
      p.Gal →* ℤˣ
    The parity character of the action of `p.Gal` on the distinct roots of `p` in its splitting
    field. It takes values in `ℤˣ`, independently of the characteristic of the base field. 
Definition8.1.19
uses 0used by 1✓L∃∀N

Primitivity of a Galois group. (LMFDB)

Let G be a transitive subgroup of S_n. Then G is primitive if, under the Galois correspondence, it corresponds to a field with no non-trivial proper subfields.

An equivalent group-theoretic condition is as follows. Let

G_1 = \{\sigma\in G\mid \sigma(1)=1\}.

Then G is primitive if and only if G_1 is a maximal subgroup of G.

Tau Ceti Review: MulAction.IsPreprimitive, MulAction.isCoatom_stabilizer_iff_preprimitive, TauCeti.isPreprimitive_iff_isAtom_adjoin_simple.

Lean code for Definition8.1.19●3 declarations
  • class(extends 1, 2 methods)defined in Mathlib/GroupTheory/GroupAction/Primitive.lean
    complete
    class MulAction.IsPreprimitive.{u_1, u_2} (G : Type u_1) (X : Type u_2)
      [SMul G X] : Prop
    class MulAction.IsPreprimitive.{u_1, u_2}
      (G : Type u_1) (X : Type u_2)
      [SMul G X] : Prop
    An action is preprimitive if it is pretransitive and
    the only blocks are the trivial ones 
    • MulAction.IsPretransitive G X
    exists_smul_eq : ∀ (x y : X), ∃ g, g • x = y
    Inherited from
    1. MulAction.IsPretransitive
    isTrivialBlock_of_isBlock : ∀ {B : Set X}, MulAction.IsBlock G B → MulAction.IsTrivialBlock B
    An action is preprimitive if it is pretransitive and
    the only blocks are the trivial ones 
  • theoremdefined in Mathlib/GroupTheory/GroupAction/Primitive.lean
    complete
    theorem MulAction.isCoatom_stabilizer_iff_preprimitive.{u_3, u_4} (G : Type u_3)
      [Group G] {X : Type u_4} [MulAction G X]
      [MulAction.IsPretransitive G X] [Nontrivial X] (a : X) :
      IsCoatom (MulAction.stabilizer G a) ↔ MulAction.IsPreprimitive G X
    theorem MulAction.isCoatom_stabilizer_iff_preprimitive.{u_3,
        u_4}
      (G : Type u_3) [Group G] {X : Type u_4}
      [MulAction G X]
      [MulAction.IsPretransitive G X]
      [Nontrivial X] (a : X) :
      IsCoatom (MulAction.stabilizer G a) ↔
        MulAction.IsPreprimitive G X
    A pretransitive action is preprimitive
    iff the stabilizer of any point is a maximal subgroup (Wielandt, th. 7.5) 
  • theoremdefined in TauCeti/FieldTheory/GaloisGroups/Blocks.lean
    complete
    theorem TauCeti.isPreprimitive_iff_isAtom_adjoin_simple.{u} {F : Type u}
      [Field F] {p : Polynomial F} (hp : Irreducible p) (hsep : p.Separable)
      (hdeg : 1 < p.natDegree) (x : ↑(p.rootSet p.SplittingField)) :
      MulAction.IsPreprimitive p.Gal ↑(p.rootSet p.SplittingField) ↔
        IsAtom F⟮↑x⟯
    theorem TauCeti.isPreprimitive_iff_isAtom_adjoin_simple.{u}
      {F : Type u} [Field F]
      {p : Polynomial F} (hp : Irreducible p)
      (hsep : p.Separable)
      (hdeg : 1 < p.natDegree)
      (x : ↑(p.rootSet p.SplittingField)) :
      MulAction.IsPreprimitive p.Gal
          ↑(p.rootSet p.SplittingField) ↔
        IsAtom F⟮↑x⟯
    **The Galois action on the roots is primitive exactly when the simple extension generated by
    a root has no proper intermediate fields.** The degree assumption excludes the one-point action,
    whose generated intermediate field is bottom and hence not an atom. 
Definition8.1.20
uses 0used by 1✓L∃∀N

Regular extension. (LMFDB)

Let t_1, \ldots, t_n be indeterminants over a field K. A Galois extension L/K(t_1, \ldots t_n) is regular if every element of L-K is transcendental over K.

Tau Ceti Review: algebraicClosure, IsIntegrallyClosedIn.

Lean code for Definition8.1.20●2 definitions
  • defdefined in Mathlib/FieldTheory/AlgebraicClosure.lean
    complete
    def algebraicClosure.{u_1, u_2} (F : Type u_1) (E : Type u_2) [Field F]
      [Field E] [Algebra F E] : IntermediateField F E
    def algebraicClosure.{u_1, u_2} (F : Type u_1)
      (E : Type u_2) [Field F] [Field E]
      [Algebra F E] : IntermediateField F E
    The *relative algebraic closure* of a field `F` in a field extension `E`,
    also called the *maximal algebraic subextension* of `E / F`,
    is defined to be the subalgebra `integralClosure F E`
    upgraded to an intermediate field (since `F` and `E` are both fields).
    This is exactly the intermediate field of `E / F` consisting of all integral/algebraic elements.
    
  • abbrevdefined in Mathlib/RingTheory/IntegralClosure/IntegrallyClosed.lean
    complete
    abbrev IsIntegrallyClosedIn.{u_1, u_2} (R : Type u_1) (A : Type u_2)
      [CommRing R] [CommRing A] [Algebra R A] : Prop
    abbrev IsIntegrallyClosedIn.{u_1, u_2}
      (R : Type u_1) (A : Type u_2)
      [CommRing R] [CommRing A]
      [Algebra R A] : Prop
    `R` is integrally closed in `A` if all integral elements of `A` are also elements of `R`.
    
Definition8.1.21
Statement uses 9
Statement dependency previews
Preview
Definition 5.1.14
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Resolvents of a Galois group. (LMFDB)

Let K/F is finite separable extension of fields with Galois closure L and let let G= \Gal(L/F). Then any subfield of L is a resolvent field for K/F. These are in bijection with the subgroups of G.

One way to group these fields is to collect together subfields with the same Galois closure since given one such field, the other fields are in a collection are visible as siblings of the field. A natural representative of such a collection would be a field of minimal degree over F with ties broken by taking a field whose Galois closure has Galois group nTj with minimal j.

In group theoretic terms, G\leq S_n where n=[K:F]. The resolvents of G correspond to quotients G/N where N \unlhd G. For each normal subgroup N, we then look for H\leq G such that the core of H equals N, and then pick the subgroup H of minimal index in G so that when G acts transitively on the m left cosets of H by left translation, the T-number of the permutation reputation is minimized.

The fixed field of H is then a stem field for L^N, the fixed field of N over F. The Galois group for L^N/F has is a subgroup of S_m, up to conjugation.

Depends on: Definition 8.1.8 Definition 8.1.17 Definition 8.3.34 Definition 8.3.160 Definition 8.3.166 Definition 5.1.14 Definition 5.1.22 Definition 5.1.76 Definition 5.1.83

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

Semiconcentrated group. (LMFDB)

A transitive permutation group G is semiconcentrated if there exists an element of minimal index so that the minimal normal subgroup containing it is a proper subgroup of G.

Depends on: Definition 8.1.11 Definition 8.3.3 Definition 8.3.113

Lean code for Definition8.1.22●3 definitions
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.IsSemiconcentrated.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Prop
    def Subgroup.IsSemiconcentrated.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Prop
    A permutation group `G` is **semiconcentrated** (LMFDB `gg.semiconcentrated`) if it is
    transitive and some non-identity element of minimal index (`minPermIndexElements`) has a normal
    closure, the least normal subgroup of `G` containing it, which is a proper subgroup of `G`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Subgroup.minPermIndexElements.{u_1} {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Set ↥G
    def Subgroup.minPermIndexElements.{u_1}
      {α : Type u_1}
      (G : Subgroup (Equiv.Perm α)) : Set ↥G
    The non-identity elements of `G` of least index `ind(G)`, the **elements of minimal index** of
    LMFDB `gg.concentrated`. 
  • defdefined in LeanBridge/ForMathlib/GroupTheory/Perm/MalleConstants.lean
    complete
    def Equiv.Perm.permIndex.{u_1} {α : Type u_1} (g : Equiv.Perm α) : ℕ
    def Equiv.Perm.permIndex.{u_1} {α : Type u_1}
      (g : Equiv.Perm α) : ℕ
    The **index** of a permutation `g` of a finite set `α` (LMFDB `gg.index`):
    `ind(g) = |α| - c(g)`, where `c(g)` is the number of orbits of `g`, the least number of
    transpositions whose product is `g` (`Equiv.Perm.isLeast_card_sub_orbitCount`). 
Definition8.1.23
uses 0used by 0✓L∃∀N

Simple group name. (LMFDB)

We describe abstract groups using standard building blocks: <ul> <li> C_n denotes the cyclic group of order n <li> D_n denotes the dihedral group of order 2n <li> A_n denotes the alternating group on n letters <li> S_n denotes the symmetric group on n letters </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: IsCyclic, DihedralGroup.nat_card, alternatingGroup, Equiv.Perm, SemidirectProduct, GroupExtension, TauCeti.PermutationWreathProduct.

Lean code for Definition8.1.23●7 declarations
  • 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
  • theoremdefined in Mathlib/GroupTheory/SpecificGroups/Dihedral.lean
    complete
    theorem DihedralGroup.nat_card {n : ℕ} : Nat.card (DihedralGroup n) = 2 * n
    theorem DihedralGroup.nat_card {n : ℕ} :
      Nat.card (DihedralGroup n) = 2 * n
  • 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)`. 
  • 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. 
  • 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 
  • 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. 
  • 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)`. 
Definition8.1.24
uses 0used by 0✓L∃∀N

Subfields. (LMFDB)

In terms of the Galois correspondence, a transitive group G\leq S_n is the Galois group of an irreducible degree n polynomial f(x)\in K[x]. Let F=K(\alpha) where \alpha is a root of f(x). Then the subfields are intermediate fields for the extension F/K.

Tau Ceti Review: IntermediateField, TauCeti.rootBlockIntermediateFieldOrderIso.

Lean code for Definition8.1.24●2 definitions
  • structure(extends 6, 7 fields)defined in Mathlib/FieldTheory/IntermediateField/Basic.lean
    complete
    structure IntermediateField.{u_1, u_2} (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [Algebra K L] : Type u_2
    structure IntermediateField.{u_1, u_2}
      (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [Algebra K L] : Type u_2
    `S : IntermediateField K L` is a subset of `L` such that there is a field
    tower `L / S / K`. 
    • Subalgebra K L
    carrier : Set L
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    4. Subsemigroup
    mul_mem' : ∀ {a b : L}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    4. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    add_mem' : ∀ {a b : L}, a ∈ self.carrier → b ∈ self.carrier → a + b ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    zero_mem' : 0 ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    algebraMap_mem' : ∀ (r : K), (algebraMap K L) r ∈ self.carrier
    Inherited from
    1. Subalgebra
    inv_mem' : ∀ x ∈ self.carrier, x⁻¹ ∈ self.carrier
  • defdefined in TauCeti/FieldTheory/GaloisGroups/Blocks.lean
    complete
    def TauCeti.rootBlockIntermediateFieldOrderIso.{u} {F : Type u} [Field F]
      {p : Polynomial F} (hp : Irreducible p) (hsep : p.Separable)
      (x : ↑(p.rootSet p.SplittingField)) :
      MulAction.BlockMem p.Gal x ≃o (↑(Set.Iic F⟮↑x⟯))ᵒᵈ
    def TauCeti.rootBlockIntermediateFieldOrderIso.{u}
      {F : Type u} [Field F]
      {p : Polynomial F} (hp : Irreducible p)
      (hsep : p.Separable)
      (x : ↑(p.rootSet p.SplittingField)) :
      MulAction.BlockMem p.Gal x ≃o
        (↑(Set.Iic F⟮↑x⟯))ᵒᵈ
    Blocks containing a root of an irreducible separable polynomial correspond contravariantly
    to the intermediate fields of its simple extension. This transports the orbitwise correspondence
    to the polynomial's root set. 
Definition8.1.25
uses 0used by 0✓L∃∀N

Subnormal series. (LMFDB)

A subnormal series of a group G is a chain of subgroups,

\langle e\rangle = H_0 \leq H_i \leq \cdots \leq H_{n} =G

where each H_i is a normal subgroup of H_{i+1}.

Lean code for Definition8.1.25●3 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. 
  • 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`. 
  • 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. 
Definition8.1.26
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 5.1.31
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

T-number of a transitive group. (LMFDB)

The transitive subgroups of S_n have been classified, up to conjugation, for small values of n, including all n\leq 47. The ordering is weakly increasing by the order of the group. The T-number of a subgroup is its index in this classification.

An algorithm for generating the classification is given in , and the results can be accessed from the computer algebra systems SageMath, GAP, and Magma.

Depends on: Definition 8.3.3 Definition 8.3.97

Definition8.1.27
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

Transitivity number. (LMFDB)

If a group G acts on a set A of order n and k\leq n, then G is k-transitive if it acts transitively on the set

S=\{(a_1,\ldots,a_k)\in A^k \mid a_i \text{ are distinct}\}.

The largest such value k is the transitivity number of the action.

Tau Ceti Review: MulAction.IsMultiplyPretransitive.

Depends on: Definition 8.3.3 Definition 8.3.8

Lean code for Definition8.1.27●1 definition
  • abbrevdefined in Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean
    complete
    abbrev MulAction.IsMultiplyPretransitive.{u_1, u_2} (G : Type u_1)
      (α : Type u_2) [Group G] [MulAction G α] (n : ℕ) : Prop
    abbrev MulAction.IsMultiplyPretransitive.{u_1,
        u_2}
      (G : Type u_1) (α : Type u_2) [Group G]
      [MulAction G α] (n : ℕ) : Prop
    An action of a group on a type `α` is `n`-pretransitive
    if the associated action on `Fin n ↪ α` is pretransitive.