LeanBridge Blueprint

1.1. Ring theory🔗

This section lists the LMFDB definitions in the categories ring, gl2 and alg. Each definition links back to its LMFDB knowl.

Definition1.1.1
uses 0used by 1✓L∃∀N

Bézout matrix. (LMFDB)

Given two polynomials f and g of degree at most n, their degree n Bézout matrix is the n\times n matrix (c_{ij}) where

\frac{f(x)g(y)-f(y)g(x)}{x-y} = \sum_{i,j=1}^n c_{ij} x^i y^{j}.

The determinant of this matrix is the resultant of the two polynomials.

Tau Ceti Review: Polynomial.resultant, Polynomial.sylvester.

Lean code for Definition1.1.1●5 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/BezoutMatrix.lean
    complete
    def Polynomial.bezoutMatrix.{u_1} {R : Type u_1} [CommRing R]
      (f g : Polynomial R) (n : ℕ) : Matrix (Fin n) (Fin n) R
    def Polynomial.bezoutMatrix.{u_1}
      {R : Type u_1} [CommRing R]
      (f g : Polynomial R) (n : ℕ) :
      Matrix (Fin n) (Fin n) R
    The **degree `n` Bézout matrix** of two polynomials `f` and `g` of degree at most `n` (LMFDB
    `alg.bezout_matrix`): the `n × n` matrix `(c_ij)` with
    `(f(x)g(y) − f(y)g(x))/(x − y) = ∑_{0 ≤ i, j < n} c_ij xⁱ yʲ`
    (`Polynomial.sub_mul_sum_bezoutMatrix`). The LMFDB knowl indexes the entries by `1 ≤ i, j ≤ n` and
    writes `c_ij xⁱ yʲ`, an off-by-one slip for the exponents `i - 1` and `j - 1`: the quotient has
    degree less than `n` in each variable. Its determinant is the resultant up to the sign
    `(-1)^(n(n-1)/2)` (`Polynomial.det_bezoutMatrix`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/BezoutMatrix.lean
    complete
    theorem Polynomial.sub_mul_sum_bezoutMatrix.{u_1, u_2} {R : Type u_1}
      [CommRing R] {f g : Polynomial R} {n : ℕ} (hf : f.natDegree ≤ n)
      (hg : g.natDegree ≤ n) {A : Type u_2} [CommRing A] [Algebra R A]
      (x y : A) :
      (x - y) * ∑ i, ∑ j, f.bezoutMatrix g n i j • (x ^ ↑i * y ^ ↑j) =
        (Polynomial.aeval x) f * (Polynomial.aeval y) g -
          (Polynomial.aeval y) f * (Polynomial.aeval x) g
    theorem Polynomial.sub_mul_sum_bezoutMatrix.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      {f g : Polynomial R} {n : ℕ}
      (hf : f.natDegree ≤ n)
      (hg : g.natDegree ≤ n) {A : Type u_2}
      [CommRing A] [Algebra R A] (x y : A) :
      (x - y) *
          ∑ i,
            ∑ j,
              f.bezoutMatrix g n i j •
                (x ^ ↑i * y ^ ↑j) =
        (Polynomial.aeval x) f *
            (Polynomial.aeval y) g -
          (Polynomial.aeval y) f *
            (Polynomial.aeval x) g
    **The defining identity of the Bézout matrix**: for polynomials `f` and `g` of degree at most
    `n` and elements `x`, `y` of a commutative algebra, the entries `c_ij` of the degree `n` Bézout
    matrix satisfy `(x - y) ∑_{i, j < n} c_ij xⁱ yʲ = f(x)g(y) − f(y)g(x)`. As `x - y` is a
    non-zero-divisor in the polynomial ring in `x` and `y`, this determines the matrix. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/BezoutMatrix.lean
    complete
    theorem Polynomial.det_bezoutMatrix.{u_1} {R : Type u_1} [CommRing R]
      {f g : Polynomial R} {n : ℕ} (hf : f.natDegree ≤ n)
      (hg : g.natDegree ≤ n) :
      (f.bezoutMatrix g n).det = (-1) ^ n.choose 2 * f.resultant g n n
    theorem Polynomial.det_bezoutMatrix.{u_1}
      {R : Type u_1} [CommRing R]
      {f g : Polynomial R} {n : ℕ}
      (hf : f.natDegree ≤ n)
      (hg : g.natDegree ≤ n) :
      (f.bezoutMatrix g n).det =
        (-1) ^ n.choose 2 * f.resultant g n n
    **The determinant of the Bézout matrix is the resultant, up to sign**: for polynomials `f` and
    `g` of degree at most `n`, the determinant of their degree `n` Bézout matrix is `(-1)^(n(n-1)/2)`
    times their resultant `Polynomial.resultant f g n n`, the determinant of their Sylvester matrix.
    The LMFDB knowl `alg.bezout_matrix` states that it is the resultant, leaving out the sign. 
  • defdefined in Mathlib/RingTheory/Polynomial/Resultant/Basic.lean
    complete
    def Polynomial.resultant.{u_1} {R : Type u_1} [CommRing R]
      (f g : Polynomial R) (m : ℕ := f.natDegree) (n : ℕ := g.natDegree) : R
    def Polynomial.resultant.{u_1} {R : Type u_1}
      [CommRing R] (f g : Polynomial R)
      (m : ℕ := f.natDegree)
      (n : ℕ := g.natDegree) : R
    The resultant of two polynomials `f` and `g` is the determinant of the Sylvester matrix of `f`
    and `g`. The size arguments `m` and `n` are implemented as `optParam`, meaning that the default
    values are `f.natDegree` and `g.natDegree` respectively, but they can also be specified to be
    other values. 
  • defdefined in Mathlib/RingTheory/Polynomial/Resultant/Basic.lean
    complete
    def Polynomial.sylvester.{u_1} {R : Type u_1} [Semiring R]
      (f g : Polynomial R) (m n : ℕ) : Matrix (Fin (m + n)) (Fin (m + n)) R
    def Polynomial.sylvester.{u_1} {R : Type u_1}
      [Semiring R] (f g : Polynomial R)
      (m n : ℕ) :
      Matrix (Fin (m + n)) (Fin (m + n)) R
    The Sylvester matrix of two polynomials `f` and `g` of degrees `m` and `n` respectively is a
    `(m+n) × (m+n)` matrix with the coefficients of `f` and `g` arranged in a specific way. Here, `m`
    and `n` are free variables, not necessarily equal to the actual degrees of the polynomials `f` and
    `g`.
    
    Note that the natural definition would be a `Matrix (Fin (m + n)) (Fin m ⊕ Fin n) R` but we prefer
    having this as a square matrix to take determinants later on.
    
Definition1.1.2
uses 0
Used by 9
Reverse dependency previews
Preview
Definition 1.1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Binary operation. (LMFDB)

A binary operation, on a set S is a function S\times S\to S.

If the operation is denoted by *, then the output of this function applied to (s_1,s_2) is typically denoted s_1*s_2.

Lean code for Definition1.1.2●1 definition
  • class(1 method)defined in Init/Prelude.lean
    complete
    class Mul.{u} (α : Type u) : Type u
    class Mul.{u} (α : Type u) : Type u
    The homogeneous version of `HMul`: `a * b : α` where `a b : α`. 
    mul : α → α → α
    `a * b` computes the product of `a` and `b`. See `HMul`. 
Definition1.1.3
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 1.1.24
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Associative binary operation. (LMFDB)

If * is a binary operation on a set A, then * is associative on A if for all a,b,c\in A,

a*(b*c)=(a*b)*c. /div>

Tau Ceti Review: Semigroup.

Depends on: Definition 1.1.2

Lean code for Definition1.1.3●2 definitions
  • class(1 method)defined in Init/Core.lean
    complete
    class Std.Associative.{u} {α : Sort u} (op : α → α → α) : Prop
    class Std.Associative.{u} {α : Sort u}
      (op : α → α → α) : Prop
    `Associative op` indicates `op` is an associative operation,
    i.e. `(a ∘ b) ∘ c = a ∘ (b ∘ c)`.
    
    assoc : ∀ (a b c : α), op (op a b) c = op a (op b c)
    An associative operation satisfies `(a ∘ b) ∘ c = a ∘ (b ∘ c)`. 
  • class(extends 1, 2 methods)defined in Mathlib/Algebra/Group/Semigroup.lean
    complete
    class Semigroup.{u_2} (G : Type u_2) : Type u_2
    class Semigroup.{u_2} (G : Type u_2) : Type u_2
    A semigroup is a type with an associative `(*)`. 
    • Mul G
    mul : G → G → G
    Inherited from
    1. Mul
    mul_assoc : ∀ (a b c : G), a * b * c = a * (b * c)
    Multiplication is associative 
Definition1.1.4
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 1.1.24
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Commutative binary operation. (LMFDB)

If * is a binary operation on a set A, then * is commutative on A if for all a,b\in A,

a*b=b*a.

Tau Ceti Review: CommMagma.

Depends on: Definition 1.1.2

Lean code for Definition1.1.4●2 definitions
  • class(1 method)defined in Init/Core.lean
    complete
    class Std.Commutative.{u} {α : Sort u} (op : α → α → α) : Prop
    class Std.Commutative.{u} {α : Sort u}
      (op : α → α → α) : Prop
    `Commutative op` says that `op` is a commutative operation,
    i.e. `a ∘ b = b ∘ a`.
    
    comm : ∀ (a b : α), op a b = op b a
    A commutative operation satisfies `a ∘ b = b ∘ a`. 
  • class(extends 1, 2 methods)defined in Mathlib/Algebra/Group/Semigroup.lean
    complete
    class CommMagma.{u_2} (G : Type u_2) : Type u_2
    class CommMagma.{u_2} (G : Type u_2) : Type u_2
    A commutative multiplicative magma is a type with a multiplication which commutes. 
    • Mul G
    mul : G → G → G
    Inherited from
    1. Mul
    mul_comm : ∀ (a b : G), a * b = b * a
    Multiplication is commutative in a commutative multiplicative magma. 
Definition1.1.5
uses 1
Used by 7
Reverse dependency previews
Preview
Definition 1.1.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Identity for a binary operation. (LMFDB)

If * is a binary operation on a set A, then A has an identity element with respect to * if there exists e\in A such that for all a\in A,

a*e = e*a = a.

Such an identity element e, if it exists, is unique and is thus called the identity element of A with respect to *.

Tau Ceti Review: MulOneClass.

Depends on: Definition 1.1.2

Lean code for Definition1.1.5●3 declarations
  • class(extends 5, 2 methods)defined in Init/Core.lean
    complete
    class Std.LawfulIdentity.{u} {α : Sort u} (op : α → α → α) (o : outParam α) :
      Prop
    class Std.LawfulIdentity.{u} {α : Sort u}
      (op : α → α → α) (o : outParam α) : Prop
    `LawfulIdentity op o` indicates `o` is a verified left and right
    identity of `op`.
    
    • Std.Identity op o
    • Std.LawfulLeftIdentity op o
    • Std.LawfulRightIdentity op o
    left_id : ∀ (a : α), op o a = a
    Inherited from
    1. Std.LawfulLeftIdentity
    right_id : ∀ (a : α), op a o = a
    Inherited from
    1. Std.LawfulRightIdentity
  • class(extends 3, 4 methods)defined in Mathlib/Algebra/Group/Monoid.lean
    complete
    class MulOneClass.{u_2} (M : Type u_2) : Type u_2
    class MulOneClass.{u_2} (M : Type u_2) :
      Type u_2
    Typeclass for expressing that a type `M` with multiplication and a one satisfies
    `1 * a = a` and `a * 1 = a` for all `a : M`. 
    • One M
    • Mul M
    • MulOne M
    one : M
    Inherited from
    1. One
    mul : M → M → M
    Inherited from
    1. Mul
    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 
  • theoremdefined in Mathlib/Algebra/Group/Monoid.lean
    complete
    theorem MulOneClass.ext.{u_2} {M : Type u_2} ⦃m₁ m₂ : MulOneClass M⦄ :
      Mul.mul = Mul.mul → m₁ = m₂
    theorem MulOneClass.ext.{u_2} {M : Type u_2}
      ⦃m₁ m₂ : MulOneClass M⦄ :
      Mul.mul = Mul.mul → m₁ = m₂
Definition1.1.6
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 1.1.30
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Inverse for a binary operation. (LMFDB)

If * is a binary operation on a set A having identity element e\in A, then an element a\in A has an inverse in A with respect to * if there exists a'\in A such that

a*a' = a'*a = e.

Tau Ceti Review: Invertible.

Depends on: Definition 1.1.2 Definition 1.1.5

Lean code for Definition1.1.6●1 definition
  • class(3 methods)defined in Mathlib/Algebra/Group/Invertible/Defs.lean
    complete
    class Invertible.{u} {α : Type u} [Mul α] [One α] (a : α) : Type u
    class Invertible.{u} {α : Type u} [Mul α]
      [One α] (a : α) : Type u
    `Invertible a` gives a two-sided multiplicative inverse of `a`. 
    invOf : α
    The inverse of an `Invertible` element 
    invOf_mul_self : ⅟a * a = 1
    `invOf a` is a left inverse of `a` 
    mul_invOf_self : a * ⅟a = 1
    `invOf a` is a right inverse of `a` 
Definition1.1.7
uses 0used by 0✓L∃∀N

Skew-symmetric matrix. (LMFDB)

A matrix M is skew-symmetric if its transpose equals its negation, i.e. if M^T = -M. In particular, a skew-symmetric matrix must be square.

Tau Ceti Review: LieAlgebra.Orthogonal.so, LieAlgebra.Orthogonal.mem_so, Matrix.IsSkewAdjoint.

Lean code for Definition1.1.7●3 declarations
  • defdefined in Mathlib/Algebra/Lie/Classical.lean
    complete
    def LieAlgebra.Orthogonal.so.{u₂, u_1} (n : Type u_1) (R : Type u₂)
      [CommRing R] [DecidableEq n] [Fintype n] :
      LieSubalgebra R (Matrix n n R)
    def LieAlgebra.Orthogonal.so.{u₂, u_1}
      (n : Type u_1) (R : Type u₂)
      [CommRing R] [DecidableEq n]
      [Fintype n] :
      LieSubalgebra R (Matrix n n R)
    The definite orthogonal Lie subalgebra: skew-adjoint matrices with respect to the symmetric
    bilinear form defined by the identity matrix. 
  • theoremdefined in Mathlib/Algebra/Lie/Classical.lean
    complete
    theorem LieAlgebra.Orthogonal.mem_so.{u₂, u_1} (n : Type u_1) (R : Type u₂)
      [CommRing R] [DecidableEq n] [Fintype n] (A : Matrix n n R) :
      A ∈ LieAlgebra.Orthogonal.so n R ↔ A.transpose = -A
    theorem LieAlgebra.Orthogonal.mem_so.{u₂, u_1}
      (n : Type u_1) (R : Type u₂)
      [CommRing R] [DecidableEq n] [Fintype n]
      (A : Matrix n n R) :
      A ∈ LieAlgebra.Orthogonal.so n R ↔
        A.transpose = -A
  • defdefined in Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean
    complete
    def Matrix.IsSkewAdjoint.{u_1, u_11} {R : Type u_1} {n : Type u_11}
      [CommRing R] [Fintype n] (J A₁ : Matrix n n R) : Prop
    def Matrix.IsSkewAdjoint.{u_1, u_11}
      {R : Type u_1} {n : Type u_11}
      [CommRing R] [Fintype n]
      (J A₁ : Matrix n n R) : Prop
    The condition for a square matrix `A` to be skew-adjoint with respect to the square matrix
    `J`. 
Definition1.1.8
uses 0used by 1✓L∃∀N

Symmetric bilinear form. (LMFDB)

For a vector space V over a field F, a symmetric bilinear form is a function B \colon V^2 \to F satisfying

  1. B(x+w,y) = B(x,y) + B(w,y) for all x,y,w \in V;

  2. B(\alpha x, y) = \alpha B(x,y) for all x \in V, and all \alpha \in F;

  3. B(x,y) = B(y,x) for all x,y \in V.

Conditions (1) and (2) imply that B(\cdot,y) is a linear map in the first variable when y is fixed. Including condition (3) then implies that B(x,\cdot) is also a linear map in the second variable when x is fixed.

Tau Ceti Review: LinearMap.BilinForm, LinearMap.BilinForm.IsSymm.

Lean code for Definition1.1.8●2 definitions
  • abbrevdefined in Mathlib/LinearAlgebra/BilinearMap.lean
    complete
    abbrev LinearMap.BilinForm.{u_2, u_5} (R : Type u_2) [CommSemiring R]
      (M : Type u_5) [AddCommMonoid M] [Module R M] : Type (max u_2 u_5)
    abbrev LinearMap.BilinForm.{u_2, u_5}
      (R : Type u_2) [CommSemiring R]
      (M : Type u_5) [AddCommMonoid M]
      [Module R M] : Type (max u_2 u_5)
    For convenience, a shorthand for the type of bilinear forms from `M` to `R`. 
  • structure(1 field)defined in Mathlib/LinearAlgebra/BilinearForm/Properties.lean
    complete
    structure LinearMap.BilinForm.IsSymm.{u_1, u_2} {R : Type u_1} {M : Type u_2}
      [CommSemiring R] [AddCommMonoid M] [Module R M]
      (B : LinearMap.BilinForm R M) : Prop
    structure LinearMap.BilinForm.IsSymm.{u_1, u_2}
      {R : Type u_1} {M : Type u_2}
      [CommSemiring R] [AddCommMonoid M]
      [Module R M]
      (B : LinearMap.BilinForm R M) : Prop
    The proposition that a bilinear form is symmetric 
    eq : ∀ (x y : M), (B x) y = (B y) x
Definition1.1.9
uses 0used by 1XL∃∀N

Symplectic isomorphism. (LMFDB)

Let N \ge 1. Let \mu_N be the group of Nth roots of unity in some algebraically closed field of characteristic not dividing N. Let M be a free rank 2 \Z/N\Z-module together with an isomorphism \alpha \colon \bigwedge^2 M \stackrel{\sim}\to \mu_N, or equivalently with a nondegenerate alternating pairing M \times M \to \mu_N. For example, M could be E[N] for an elliptic curve E, together with the Weil pairing. Or M could be \Z/N\Z \times \mu_N with the "determinant" pairing (a,\gamma),(b,\delta) \mapsto \delta^a/\gamma^b.

A symplectic isomorphism from M to another such structure M' is a \Z/N\Z-module isomorphism M \to M' such that the induced isomorphism \bigwedge^2 M \to \bigwedge^2 M' gets identified via \alpha and \alpha' with the identity \mu_N \to \mu_N.

The same definition makes sense in a context in which each free rank 2 \Z/N\Z-module is enriched with a Galois action to make a Galois module, or replaced by a finite etale group scheme that is (\Z/N\Z)^2 etale locally.

Definition1.1.10
uses 0
Used by 3
Reverse dependency previews
Preview
Definition 1.1.12
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Borel subgroup. (LMFDB)

A Borel subgroup of a general linear group is a subgroup that is conjugate to the group of upper triangular matrices.

The Borel subgroups of \GL_2(\F_p) are maximal subgroups that fix a one-dimensional subspace of \F_p^2; every such subgroup is conjugate to the subgroup of upper triangular matrices.

Subgroup labels containing the letter B identify a subgroup of \GL_2(\F_p) that lies in the Borel subgroup of upper triangular matrices but is not contained in the subgroup of diagonal matrices; these are precisely the subgroups of a Borel subgroup that contain an element of order p.

The label B is used for the full Borel subgroup of upper triangular matrices

The label B.a.b denotes the proper subgroup of B generated by the matrices

\begin{pmatrix}a&0\\0&1/a\end{pmatrix},\ \begin{pmatrix}b&0\\0&r/b\end{pmatrix},\ \begin{pmatrix}1&1\\0&1\end{pmatrix},

where a and b are minimally chosen positive integers and r is the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times, as defined in .

Tau Ceti Review: TauCeti.GL2Borel.

Lean code for Definition1.1.10●8 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Borel.lean
    complete
    def Matrix.GeneralLinearGroup.IsBorelSubgroup.{u_1, u_2} {n : Type u_1}
      [Fintype n] [LinearOrder n] {R : Type u_2} [CommRing R]
      (H : Subgroup (GL n R)) : Prop
    def Matrix.GeneralLinearGroup.IsBorelSubgroup.{u_1,
        u_2}
      {n : Type u_1} [Fintype n]
      [LinearOrder n] {R : Type u_2}
      [CommRing R] (H : Subgroup (GL n R)) :
      Prop
    A subgroup of `GL_n(R)` is a **Borel subgroup** (LMFDB `gl2.borel`) if it is conjugate to the
    subgroup `TauCeti.upperTriangularGroup n R` of invertible upper triangular matrices. 
  • abbrevdefined in TauCeti/LinearAlgebra/Matrix/GeneralLinearGroup/Borel.lean
    complete
    abbrev TauCeti.GL2Borel.{u} (R : Type u) [CommRing R] : Subgroup (GL (Fin 2) R)
    abbrev TauCeti.GL2Borel.{u} (R : Type u)
      [CommRing R] : Subgroup (GL (Fin 2) R)
    The **Borel subgroup** of `GL₂`, obtained by specializing the general upper-triangular
    subgroup to `Fin 2`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Borel.lean
    complete
    theorem Matrix.GeneralLinearGroup.isBorelSubgroup_iff_exists_lineStabilizer.{u_1}
      {F : Type u_1} [Field F] {H : Subgroup (GL (Fin 2) F)} :
      Matrix.GeneralLinearGroup.IsBorelSubgroup H ↔
        ∃ v, v ≠ 0 ∧ H = Matrix.GeneralLinearGroup.lineStabilizer v
    theorem Matrix.GeneralLinearGroup.isBorelSubgroup_iff_exists_lineStabilizer.{u_1}
      {F : Type u_1} [Field F]
      {H : Subgroup (GL (Fin 2) F)} :
      Matrix.GeneralLinearGroup.IsBorelSubgroup
          H ↔
        ∃ v,
          v ≠ 0 ∧
            H =
              Matrix.GeneralLinearGroup.lineStabilizer
                v
    **The Borel subgroups of `GL₂(F)` are the stabilizers of the lines of `F²`** (LMFDB
    `gl2.borel`), all of them conjugate to the upper triangular subgroup. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/BorelMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.isCoatom_gl2Borel.{u_1} {F : Type u_1}
      [Field F] : IsCoatom (TauCeti.GL2Borel F)
    theorem Matrix.GeneralLinearGroup.isCoatom_gl2Borel.{u_1}
      {F : Type u_1} [Field F] :
      IsCoatom (TauCeti.GL2Borel F)
    **The upper triangular subgroup of `GL₂(F)` is a maximal subgroup** (LMFDB `gl2.borel`): a
    subgroup strictly containing it meets the big Bruhat cell, so it contains the Weyl element, and
    the two generate `GL₂(F)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/BorelMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsBorelSubgroup.isCoatom.{u_1} {F : Type u_1}
      [Field F] {H : Subgroup (GL (Fin 2) F)}
      (hH : Matrix.GeneralLinearGroup.IsBorelSubgroup H) : IsCoatom H
    theorem Matrix.GeneralLinearGroup.IsBorelSubgroup.isCoatom.{u_1}
      {F : Type u_1} [Field F]
      {H : Subgroup (GL (Fin 2) F)}
      (hH :
        Matrix.GeneralLinearGroup.IsBorelSubgroup
          H) :
      IsCoatom H
    **Every Borel subgroup of `GL₂(F)` is a maximal subgroup** (LMFDB `gl2.borel`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/BorelMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.exists_orderOf_eq_iff_forall_not_le_map_diagonalTorus
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : H ≤ TauCeti.GL2Borel (ZMod p)) :
      (∃ h ∈ H, orderOf h = p) ↔
        ∀ (g : GL (Fin 2) (ZMod p)),
          ¬H ≤
              Subgroup.map (MulEquiv.toMonoidHom (MulAut.conj g))
                (TauCeti.diagonalTorus (ZMod p) 2)
    theorem Matrix.GeneralLinearGroup.exists_orderOf_eq_iff_forall_not_le_map_diagonalTorus
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : H ≤ TauCeti.GL2Borel (ZMod p)) :
      (∃ h ∈ H, orderOf h = p) ↔
        ∀ (g : GL (Fin 2) (ZMod p)),
          ¬H ≤
              Subgroup.map
                (MulEquiv.toMonoidHom
                  (MulAut.conj g))
                (TauCeti.diagonalTorus
                  (ZMod p) 2)
    **A subgroup of the Borel subgroup of `GL₂(𝔽_p)` has an element of order `p` if and only if it
    lies in no conjugate of the diagonal subgroup** (LMFDB `gl2.borel`, corrected: the knowl says
    'not contained in the subgroup of diagonal matrices', which is false for `p = 3`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Borel.lean
    complete
    def Matrix.GeneralLinearGroup.labelBAB (p : ℕ) [Fact (Nat.Prime p)]
      (a b : ℕ) : Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelBAB (p : ℕ)
      [Fact (Nat.Prime p)] (a b : ℕ) :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `B.a.b` (LMFDB `gl2.borel`): the subgroup of the Borel subgroup `B` of `GL₂(𝔽_p)`
    generated by the matrices `!![a, 0; 0, 1/a]`, `!![b, 0; 0, r/b]` and `!![1, 1; 0, 1]`, where `r`
    is the least primitive root modulo `p`. A listed matrix that is not invertible (`p ∣ a` or
    `p ∣ b`) is not among the generators; the label uses minimal positive integers `a` and `b`, which
    avoids this. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/LeastPrimitiveRoot.lean
    complete
    def ZMod.leastPrimitiveRoot (p : ℕ) [Fact (Nat.Prime p)] : ℕ
    def ZMod.leastPrimitiveRoot (p : ℕ)
      [Fact (Nat.Prime p)] : ℕ
    The **least primitive root** modulo a prime `p`: the least positive integer `r` whose class
    generates `(ℤ/pℤ)ˣ`, that is, has multiplicative order `p - 1`. It is the `r` (or `ε`) of
    Sutherland's labels for subgroups of `GL₂(𝔽_p)`; for `p = 2` it is `1`. 
Definition1.1.11
uses 0
Used by 9
Reverse dependency previews
Preview
Definition 1.1.17
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Cartan subgroup. (LMFDB)

Let R be a commutative ring. Given a free rank 2 etale R-algebra A equipped with a basis, any a \in A^\times defines an R-linear multiplication-by-a map A \to A, so we get an injective homomorphism A^\times \to \Aut_{\text{R-module}}(A) \simeq \GL_2(R), and the image is called a Cartan subgroup of \GL_2(R). The canonical involution of the R-algebra A gives another element of \Aut_{\text{R-module}}(A); we call the group generated by it and the Cartan subgroup A^\times the extended Cartan subgroup. The Cartan subgroup has index 2 in the extended Cartan subgroup.

If R=\F_p, there are two possibilities for A: the split algebra \F_p \times \F_p and the nonsplit algebra \F_{p^2}; the resulting Cartan subgroups are called split and nonsplit. The extended Cartan subgroup equals the normalizer of the Cartan subgroup in \GL_2(\F_p) except when p=2 and A is split. In the split case, if we use the standard basis of \F_p \times \F_p, the Cartan subgroup is the subgroup of diagonal matrices in \GL_2(\F_p), and the extended Cartan subgroup is this together with the coset of antidiagonal matrices in \GL_2(\F_p).

If R=\Z/p^e\Z, again there are two possibilities for A: the split algebra R \times R, or the nonsplit algebra. The nonsplit algebra can be described as \mathcal{O}/p^e \mathcal{O} where \mathcal{O} is either the degree 2 unramified extension of \Z_p or a quadratic order in which p is inert. The nonsplit algebra can also be described as the ring of length e Witt vectors W_e(\F_{p^2}).

If R=\Z/N\Z for some N \ge 1, then A can be split or nonsplit independently at each prime dividing N.

Lean code for Definition1.1.11●8 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Cartan.lean
    complete
    def Matrix.GeneralLinearGroup.cartanSubgroup.{u, v} {R : Type u}
      [CommRing R] {A : Type v} [CommRing A] [Algebra R A]
      (b : Module.Basis (Fin 2) R A) : Subgroup (GL (Fin 2) R)
    def Matrix.GeneralLinearGroup.cartanSubgroup.{u,
        v}
      {R : Type u} [CommRing R] {A : Type v}
      [CommRing A] [Algebra R A]
      (b : Module.Basis (Fin 2) R A) :
      Subgroup (GL (Fin 2) R)
    The **Cartan subgroup** of `GL₂(R)` attached to a free rank-2 `R`-algebra `A` with basis `b`
    (LMFDB `gl2.cartan`): the image of the injective homomorphism `Aˣ → GL₂(R)` sending a unit to the
    matrix of multiplication by it in the basis `b`. The LMFDB asks `A` to be étale, which this
    construction does not need; `IsCartanSubgroup` imposes it. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Cartan.lean
    complete
    def Matrix.GeneralLinearGroup.extendedCartanSubgroup.{u, v} {R : Type u}
      [CommRing R] {A : Type v} [CommRing A] [Algebra R A]
      (b : Module.Basis (Fin 2) R A) : Subgroup (GL (Fin 2) R)
    def Matrix.GeneralLinearGroup.extendedCartanSubgroup.{u,
        v}
      {R : Type u} [CommRing R] {A : Type v}
      [CommRing A] [Algebra R A]
      (b : Module.Basis (Fin 2) R A) :
      Subgroup (GL (Fin 2) R)
    The **extended Cartan subgroup** of `GL₂(R)` attached to `A` and its basis `b` (LMFDB
    `gl2.cartan`): the subgroup generated by the Cartan subgroup `cartanSubgroup b` and the matrix of
    the canonical involution of `A`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanEtale.lean
    complete
    theorem Matrix.GeneralLinearGroup.relIndex_cartanSubgroup_extendedCartanSubgroup_eq_two.{u,
        v}
      {R : Type u} [CommRing R] {A : Type v} [CommRing A] [Algebra R A]
      [Nontrivial R] [Algebra.Etale R A] (b : Module.Basis (Fin 2) R A) :
      (Matrix.GeneralLinearGroup.cartanSubgroup b).relIndex
          (Matrix.GeneralLinearGroup.extendedCartanSubgroup b) =
        2
    theorem Matrix.GeneralLinearGroup.relIndex_cartanSubgroup_extendedCartanSubgroup_eq_two.{u,
        v}
      {R : Type u} [CommRing R] {A : Type v}
      [CommRing A] [Algebra R A]
      [Nontrivial R] [Algebra.Etale R A]
      (b : Module.Basis (Fin 2) R A) :
      (Matrix.GeneralLinearGroup.cartanSubgroup
              b).relIndex
          (Matrix.GeneralLinearGroup.extendedCartanSubgroup
            b) =
        2
    **The Cartan subgroup has index `2` in the extended Cartan subgroup** (LMFDB `gl2.cartan`), for
    every free étale algebra of rank `2` with a basis over a nonzero commutative ring. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanEtale.lean
    complete
    theorem Matrix.GeneralLinearGroup.normalizer_cartanSubgroup_eq_extendedCartanSubgroup_iff
      {p : ℕ} [Fact (Nat.Prime p)] {A : Type} [CommRing A]
      [Algebra (ZMod p) A] (b : Module.Basis (Fin 2) (ZMod p) A)
      [Algebra.Etale (ZMod p) A] :
      Subgroup.normalizer ↑(Matrix.GeneralLinearGroup.cartanSubgroup b) =
          Matrix.GeneralLinearGroup.extendedCartanSubgroup b ↔
        ¬(p = 2 ∧ Nonempty (A ≃ₐ[ZMod p] ZMod p × ZMod p))
    theorem Matrix.GeneralLinearGroup.normalizer_cartanSubgroup_eq_extendedCartanSubgroup_iff
      {p : ℕ} [Fact (Nat.Prime p)] {A : Type}
      [CommRing A] [Algebra (ZMod p) A]
      (b : Module.Basis (Fin 2) (ZMod p) A)
      [Algebra.Etale (ZMod p) A] :
      Subgroup.normalizer
            ↑(Matrix.GeneralLinearGroup.cartanSubgroup
                b) =
          Matrix.GeneralLinearGroup.extendedCartanSubgroup
            b ↔
        ¬(p = 2 ∧
            Nonempty
              (A ≃ₐ[ZMod p] ZMod p × ZMod p))
    **The normalizer of a Cartan subgroup of `GL₂(𝔽_p)` is the extended Cartan subgroup, except for
    the split algebra over `𝔽₂`** (LMFDB `gl2.cartan`): for `p = 2` and `A ≅ 𝔽₂ × 𝔽₂` the Cartan
    subgroup is trivial, with normalizer `GL₂(𝔽₂)` of order `6`, while the extended Cartan subgroup has
    order `2`; for `A ≅ 𝔽₄` both are `GL₂(𝔽₂)`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/Etale/QuadraticZModPow.lean
    complete
    theorem Matrix.GeneralLinearGroup.nonempty_algEquiv_prod_or_nonempty_algEquiv_nonsplitCartanAlgebraPow
      {p e : ℕ} [Fact (Nat.Prime p)] [NeZero e] {A : Type} [CommRing A]
      [Algebra (ZMod (p ^ e)) A] [Algebra.Etale (ZMod (p ^ e)) A]
      (b : Module.Basis (Fin 2) (ZMod (p ^ e)) A) :
      Nonempty (A ≃ₐ[ZMod (p ^ e)] ZMod (p ^ e) × ZMod (p ^ e)) ∨
        Nonempty
          (A ≃ₐ[ZMod (p ^ e)]
            Matrix.GeneralLinearGroup.NonsplitCartanAlgebraPow p e)
    theorem Matrix.GeneralLinearGroup.nonempty_algEquiv_prod_or_nonempty_algEquiv_nonsplitCartanAlgebraPow
      {p e : ℕ} [Fact (Nat.Prime p)]
      [NeZero e] {A : Type} [CommRing A]
      [Algebra (ZMod (p ^ e)) A]
      [Algebra.Etale (ZMod (p ^ e)) A]
      (b :
        Module.Basis (Fin 2) (ZMod (p ^ e))
          A) :
      Nonempty
          (A ≃ₐ[ZMod (p ^ e)]
            ZMod (p ^ e) × ZMod (p ^ e)) ∨
        Nonempty
          (A ≃ₐ[ZMod (p ^ e)]
            Matrix.GeneralLinearGroup.NonsplitCartanAlgebraPow
              p e)
    **The two quadratic étale algebras over `ℤ/p^eℤ`** (LMFDB `gl2.cartan`): a free étale algebra
    `A` of rank `2` over `ℤ/p^eℤ` is isomorphic to the split algebra `ℤ/p^eℤ × ℤ/p^eℤ` or to the
    non-split algebra `NonsplitCartanAlgebraPow p e`, according as its reduction `𝔽_p ⊗ A` is
    `𝔽_p × 𝔽_p` or `𝔽_{p²}`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/LocalField/UnramifiedNonsplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.nonempty_ringEquiv_nonsplitCartanAlgebraPow_of_unramifiedExtension.{u_1}
      {p e : ℕ} [Fact (Nat.Prime p)] {Ω : Type u_1} [Field Ω]
      [Algebra ℚ_[p] Ω] [IsSepClosed Ω]
      [ValuativeRel ↥(TauCeti.unramifiedExtension ℚ_[p] Ω 2)]
      [TopologicalSpace ↥(TauCeti.unramifiedExtension ℚ_[p] Ω 2)]
      [IsNonarchimedeanLocalField ↥(TauCeti.unramifiedExtension ℚ_[p] Ω 2)]
      [ValuativeExtension ℚ_[p] ↥(TauCeti.unramifiedExtension ℚ_[p] Ω 2)]
      [NeZero e] :
      Nonempty
        (↥(ValuativeRel.valuation
                  ↥(TauCeti.unramifiedExtension ℚ_[p] Ω 2)).integer ⧸
            Ideal.span {↑p ^ e} ≃+*
          Matrix.GeneralLinearGroup.NonsplitCartanAlgebraPow p e)
    theorem Matrix.GeneralLinearGroup.nonempty_ringEquiv_nonsplitCartanAlgebraPow_of_unramifiedExtension.{u_1}
      {p e : ℕ} [Fact (Nat.Prime p)]
      {Ω : Type u_1} [Field Ω]
      [Algebra ℚ_[p] Ω] [IsSepClosed Ω]
      [ValuativeRel
          ↥(TauCeti.unramifiedExtension ℚ_[p]
              Ω 2)]
      [TopologicalSpace
          ↥(TauCeti.unramifiedExtension ℚ_[p]
              Ω 2)]
      [IsNonarchimedeanLocalField
          ↥(TauCeti.unramifiedExtension ℚ_[p]
              Ω 2)]
      [ValuativeExtension ℚ_[p]
          ↥(TauCeti.unramifiedExtension ℚ_[p]
              Ω 2)]
      [NeZero e] :
      Nonempty
        (↥(ValuativeRel.valuation
                  ↥(TauCeti.unramifiedExtension
                      ℚ_[p] Ω 2)).integer ⧸
            Ideal.span {↑p ^ e} ≃+*
          Matrix.GeneralLinearGroup.NonsplitCartanAlgebraPow
            p e)
    **`𝒪/p^e𝒪` for the unramified quadratic extension `𝒪` of `ℤ_p`** (LMFDB `gl2.cartan`): for the
    ring of integers `𝒪` of the unramified quadratic extension `TauCeti.unramifiedExtension ℚ_[p] Ω 2`
    of `ℚ_p`, `𝒪/p^e𝒪` is isomorphic to the non-split algebra `NonsplitCartanAlgebraPow p e`. A ring
    has at most one `ℤ/p^eℤ`-algebra structure, so this is an isomorphism of `ℤ/p^eℤ`-algebras. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/WittVector/NonsplitCartanAlgebra.lean
    complete
    theorem Matrix.GeneralLinearGroup.nonempty_ringEquiv_truncatedWittVector
      {p e : ℕ} [Fact (Nat.Prime p)] [NeZero e] :
      Nonempty
        (Matrix.GeneralLinearGroup.NonsplitCartanAlgebraPow p e ≃+*
          TruncatedWittVector p e (GaloisField p 2))
    theorem Matrix.GeneralLinearGroup.nonempty_ringEquiv_truncatedWittVector
      {p e : ℕ} [Fact (Nat.Prime p)]
      [NeZero e] :
      Nonempty
        (Matrix.GeneralLinearGroup.NonsplitCartanAlgebraPow
            p e ≃+*
          TruncatedWittVector p e
            (GaloisField p 2))
    **The non-split algebra is the ring of Witt vectors of length `e` over `𝔽_{p²}`** (LMFDB
    `gl2.cartan`): `NonsplitCartanAlgebraPow p e` is isomorphic to
    `TruncatedWittVector p e (GaloisField p 2)`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/Etale/QuadraticZMod.lean
    complete
    theorem Matrix.GeneralLinearGroup.existsUnique_nonempty_algEquiv_nonsplitAtAlgebra
      {N : ℕ} {A : Type} [CommRing A] [Algebra (ZMod N) A] [NeZero N]
      [Algebra.Etale (ZMod N) A] (b : Module.Basis (Fin 2) (ZMod N) A) :
      ∃! S,
        S ⊆ N.primeFactors ∧
          Nonempty
            (A ≃ₐ[ZMod N] Matrix.GeneralLinearGroup.NonsplitAtAlgebra N S)
    theorem Matrix.GeneralLinearGroup.existsUnique_nonempty_algEquiv_nonsplitAtAlgebra
      {N : ℕ} {A : Type} [CommRing A]
      [Algebra (ZMod N) A] [NeZero N]
      [Algebra.Etale (ZMod N) A]
      (b : Module.Basis (Fin 2) (ZMod N) A) :
      ∃! S,
        S ⊆ N.primeFactors ∧
          Nonempty
            (A ≃ₐ[ZMod N]
              Matrix.GeneralLinearGroup.NonsplitAtAlgebra
                N S)
    **The free étale algebras of rank `2` over `ℤ/Nℤ`** (LMFDB `gl2.cartan`): such an algebra is
    isomorphic to `NonsplitAtAlgebra N S` for exactly one set `S` of primes dividing `N`, the set of
    primes where it is non-split. 
Definition1.1.12
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.10
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Exceptional subgroup. (LMFDB)

An exceptional subgroup of \GL_2(\F_p) does not contain \SL_2(\F_p) and is not contained in a Borel subgroup or in the normalizer of a Cartan subgroup.

Exceptional subgroups are classified according to their image in \PGL_2(\F_p), which must be isomorphic to one of the alternating groups A_4 or A_5, or to the symmetric group S_4. These groups are labelled using identifiers containing one of the strings A4, A5, S4, as described in .

Depends on: Definition 1.1.10 Definition 1.1.18

Lean code for Definition1.1.12●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Exceptional.lean
    complete
    def Matrix.GeneralLinearGroup.IsExceptionalSubgroup {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p))) : Prop
    def Matrix.GeneralLinearGroup.IsExceptionalSubgroup
      {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Prop
    A subgroup `H` of `GL₂(𝔽_p)` is **exceptional** (LMFDB `gl2.exceptional`) if it does not contain
    `SL₂(𝔽_p)` (the kernel of the determinant) and is contained neither in a Borel subgroup nor in the
    normalizer of a Cartan subgroup, in the LMFDB's convention (`IsCartanNormalizer`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Exceptional.lean
    complete
    def Matrix.GeneralLinearGroup.HasExceptionalType {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Matrix.GeneralLinearGroup.ExceptionalType → Prop
    def Matrix.GeneralLinearGroup.HasExceptionalType
      {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Matrix.GeneralLinearGroup.ExceptionalType →
        Prop
    A subgroup of `GL₂(𝔽_p)` **has exceptional type** `A4`, `S4` or `A5` (LMFDB `gl2.exceptional`)
    if its image in `PGL₂(𝔽_p)` is isomorphic to `A₄`, `S₄` or `A₅` respectively. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Exceptional.lean
    complete
    def Matrix.GeneralLinearGroup.projectiveImage {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Subgroup (Matrix.ProjGenLinGroup (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.projectiveImage
      {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Subgroup
        (Matrix.ProjGenLinGroup (Fin 2)
          (ZMod p))
    The image of a subgroup of `GL₂(𝔽_p)` in `PGL₂(𝔽_p)`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2ExceptionalType.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsExceptionalSubgroup.exists_hasExceptionalType
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsExceptionalSubgroup H) :
      ∃ t, Matrix.GeneralLinearGroup.HasExceptionalType H t
    theorem Matrix.GeneralLinearGroup.IsExceptionalSubgroup.exists_hasExceptionalType
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsExceptionalSubgroup
          H) :
      ∃ t,
        Matrix.GeneralLinearGroup.HasExceptionalType
          H t
    **The projective image of an exceptional subgroup of `GL₂(𝔽_p)` is isomorphic to `A₄`, `S₄` or
    `A₅`** (LMFDB `gl2.exceptional`), by Dickson's classification. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2ExceptionalType.lean
    complete
    theorem Matrix.GeneralLinearGroup.HasExceptionalType.eq {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      {t t' : Matrix.GeneralLinearGroup.ExceptionalType}
      (ht : Matrix.GeneralLinearGroup.HasExceptionalType H t)
      (ht' : Matrix.GeneralLinearGroup.HasExceptionalType H t') : t = t'
    theorem Matrix.GeneralLinearGroup.HasExceptionalType.eq
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      {t t' :
        Matrix.GeneralLinearGroup.ExceptionalType}
      (ht :
        Matrix.GeneralLinearGroup.HasExceptionalType
          H t)
      (ht' :
        Matrix.GeneralLinearGroup.HasExceptionalType
          H t') :
      t = t'
    **A subgroup of `GL₂(𝔽_p)` has at most one exceptional type**: the groups `A₄`, `S₄` and `A₅`
    have orders `12`, `24` and `60`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2ExceptionalType.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsExceptionalSubgroup.exists_cls_eq {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsExceptionalSubgroup H)
      {L : Matrix.GeneralLinearGroup.SutherlandGroupLabel}
      (hL : Matrix.GeneralLinearGroup.IsCanonicalSutherlandLabel p H L) :
      ∃ t,
        L.cls = t.toSutherlandClass ∧
          Matrix.GeneralLinearGroup.HasExceptionalType H t
    theorem Matrix.GeneralLinearGroup.IsExceptionalSubgroup.exists_cls_eq
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsExceptionalSubgroup
          H)
      {L :
        Matrix.GeneralLinearGroup.SutherlandGroupLabel}
      (hL :
        Matrix.GeneralLinearGroup.IsCanonicalSutherlandLabel
          p H L) :
      ∃ t,
        L.cls = t.toSutherlandClass ∧
          Matrix.GeneralLinearGroup.HasExceptionalType
            H t
    **Sutherland's label of an exceptional subgroup of `GL₂(𝔽_p)` has class `A4`, `S4` or `A5`, the
    type of its projective image** (LMFDB `gl2.exceptional`): exceptional subgroups are labelled by
    identifiers containing one of the strings `A4`, `S4`, `A5`. 
Definition1.1.13
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.21
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 1.1.15
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Genus of a subgroup of \GL_2. (LMFDB)

The genus of an open subgroup H of \GL_2(\widehat{\Z}) or \GL_2(\widehat{\Z}_{\ell}) of level N is defined by the formula

g(H) := g(\Gamma_H) := 1+\frac{i(\Gamma_H)}{12} - \frac{\nu_2(\Gamma_H)}{4} - \frac{\nu_3(\Gamma_H)}{3} - \frac{\nu_{\infty}(\Gamma_H)}{2},

where \Gamma_H:=\pm H_N \cap \SL_2(\Z/N\Z), H_N denotes the projection of H onto \GL_2(\Z/N\Z), and

  • i(\Gamma_H)=[\SL_2(\Z/N\Z):\Gamma_H],

  • \nu_2 is the number of right cosets of \Gamma_H in \SL_2(\Z/N\Z) fixed by the right action of <small>\begin{bmatrix}0&1\\-1&0\end{bmatrix}</small>,

  • \nu_3 is the number of right cosets of \Gamma_H in \SL_2(\Z/N\Z) fixed by the right action of matrix <small>\begin{bmatrix}0&1\\-1&-1\end{bmatrix}</small>,

  • \nu_{\infty}(\Gamma_H) is the number of orbits of the right coset space \Gamma_H\backslash \SL_2(\Z/N\Z) under the right action of <small>\begin{bmatrix}1&1\\0&1\end{bmatrix}</small>.

The genus g(H) is a nonnegative integer that equals the genus of each geometric component of the modular curve X_H.

This coincides with the genus of the Riemann surface \mathcal H^*/\Gamma, where \mathcal H^* is the completed upper half-plane and \Gamma is the inverse image of \Gamma_H in \SL_2(\Z).

Depends on: Definition 1.2.24 Definition 1.1.21 Definition 3.6.27 Definition 4.4.1

Definition1.1.14
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.16
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 1.1.15
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Index of an open subgroup. (LMFDB)

The index of an open subgroup H of a profinite group G is the positive integer [G:H].

When G is a matrix group over \widehat{\Z} or \Z_{\ell} and H is a subgroup of level N, this is the same as the index of H in the reduction of G modulo N.

Tau Ceti Review: Subgroup.index, Subgroup.quotient_finite_of_isOpen, Subgroup.index_ne_zero_of_finite.

Depends on: Definition 1.1.16 Definition 1.1.21 Definition 1.1.22

Lean code for Definition1.1.14●6 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/Topology/Algebra/OpenSubgroup.lean
    complete
    theorem Subgroup.quotient_finite_of_isOpen.{u_1} {G : Type u_1} [Group G]
      [TopologicalSpace G] [SeparatelyContinuousMul G] [CompactSpace G]
      (U : Subgroup G) (h : IsOpen ↑U) : Finite (G ⧸ U)
    theorem Subgroup.quotient_finite_of_isOpen.{u_1}
      {G : Type u_1} [Group G]
      [TopologicalSpace G]
      [SeparatelyContinuousMul G]
      [CompactSpace G] (U : Subgroup G)
      (h : IsOpen ↑U) : Finite (G ⧸ U)
  • theoremdefined in Mathlib/GroupTheory/Index.lean
    complete
    theorem Subgroup.index_ne_zero_of_finite.{u_1} {G : Type u_1} [Group G]
      {H : Subgroup G} [hH : Finite (G ⧸ H)] : H.index ≠ 0
    theorem Subgroup.index_ne_zero_of_finite.{u_1}
      {G : Type u_1} [Group G]
      {H : Subgroup G} [hH : Finite (G ⧸ H)] :
      H.index ≠ 0
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/LevelIndex.lean
    complete
    theorem Subgroup.relIndex_map_of_inf_comap_map_eq.{u_1, u_2} {Γ : Type u_1}
      {Q : Type u_2} [Group Γ] [Group Q] (f : Γ →* Q) {G H : Subgroup Γ}
      (h : G ⊓ Subgroup.comap f (Subgroup.map f H) = H) :
      (Subgroup.map f H).relIndex (Subgroup.map f G) = H.relIndex G
    theorem Subgroup.relIndex_map_of_inf_comap_map_eq.{u_1,
        u_2}
      {Γ : Type u_1} {Q : Type u_2} [Group Γ]
      [Group Q] (f : Γ →* Q)
      {G H : Subgroup Γ}
      (h :
        G ⊓
            Subgroup.comap f
              (Subgroup.map f H) =
          H) :
      (Subgroup.map f H).relIndex
          (Subgroup.map f G) =
        H.relIndex G
    **The index of a subgroup is the index of its image when it is the preimage of its image**:
    `[π(G) : π(H)] = [G : H]` when `H = G ∩ π⁻¹(π(H))`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/LevelIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.relIndex_map_padicReduction_padicLevel.{u_1}
      {n : Type u_1} [Fintype n] [DecidableEq n] (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)] {G H : Subgroup (GL n ℤ_[ℓ])} (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      (Subgroup.map
              (Matrix.GeneralLinearGroup.padicReduction ℓ
                (Matrix.GeneralLinearGroup.padicLevel ℓ G H))
              H).relIndex
          (Subgroup.map
            (Matrix.GeneralLinearGroup.padicReduction ℓ
              (Matrix.GeneralLinearGroup.padicLevel ℓ G H))
            G) =
        H.relIndex G
    theorem Matrix.GeneralLinearGroup.relIndex_map_padicReduction_padicLevel.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n] (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)]
      {G H : Subgroup (GL n ℤ_[ℓ])}
      (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      (Subgroup.map
              (Matrix.GeneralLinearGroup.padicReduction
                ℓ
                (Matrix.GeneralLinearGroup.padicLevel
                  ℓ G H))
              H).relIndex
          (Subgroup.map
            (Matrix.GeneralLinearGroup.padicReduction
              ℓ
              (Matrix.GeneralLinearGroup.padicLevel
                ℓ G H))
            G) =
        H.relIndex G
    **The index of an open subgroup of a matrix group over `ℤ_ℓ` is the index of its reduction
    modulo its level** (LMFDB `gl2.index`): for `H` open in `G ≤ GL_n(ℤ_ℓ)` of level `N`,
    `[G : H] = [G mod N : H mod N]`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/LevelIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.relIndex_map_adelicReduction_adelicLevel.{u_1}
      {n : Type u_1} [Fintype n] [DecidableEq n]
      {G H : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])} (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      (Subgroup.map
              (Matrix.GeneralLinearGroup.adelicReduction
                (Matrix.GeneralLinearGroup.adelicLevel G H))
              H).relIndex
          (Subgroup.map
            (Matrix.GeneralLinearGroup.adelicReduction
              (Matrix.GeneralLinearGroup.adelicLevel G H))
            G) =
        H.relIndex G
    theorem Matrix.GeneralLinearGroup.relIndex_map_adelicReduction_adelicLevel.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n]
      {G H :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])}
      (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      (Subgroup.map
              (Matrix.GeneralLinearGroup.adelicReduction
                (Matrix.GeneralLinearGroup.adelicLevel
                  G H))
              H).relIndex
          (Subgroup.map
            (Matrix.GeneralLinearGroup.adelicReduction
              (Matrix.GeneralLinearGroup.adelicLevel
                G H))
            G) =
        H.relIndex G
    **The index of an open subgroup of a matrix group over `ℤ̂` is the index of its reduction
    modulo its level** (LMFDB `gl2.index`): for `H` open in `G ≤ GL_n(ℤ̂) = ∏_ℓ GL_n(ℤ_ℓ)` of level `N`,
    `[G : H] = [G mod N : H mod N]`. 
Definition1.1.15
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.13
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 4.1.26
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Let H be an open subgroup of \GL_2(\widehat{\Z}) for which \det(H)=\widehat{\Z}^\times. The RSZB label of H has the form \texttt{N.i.g.n}, where

  • N is the level of H,

  • i is the index of H,

  • g is the genus of H, and

  • n is a positive integer that distinguishes nonconjugate subgroups of the same level, index, and genus.

The positive integer n is defined by ordering the subgroups of \GL_2(\Z/n\Z) as described in Section 2.4 of .

When \det(H)\ne \widehat{\Z}^\times the RSZB label of H has the form \texttt{M.d.m-N.i.g.n}, where \texttt{M.d.m} identifies the open subgroup \det(H)\le \GL_1(\widehat{\Z}) in terms of its level M, index d, and a positive integer m that is defined by ordering the open subgroups of \GL_1(\widehat{\Z}) via the lexicographic ordering of the Conrey labels in the corresponding group of Dirichlet characters of modulus M. In this case the index i is taken relative to the inverse image of \det(H) in \GL_2(\widehat{\Z}).

This convention is also used to label open subgroups of \GL_2(\Z_{\ell}) and arbitrary subgroups of \GL_2(\Z/n\Z) by using the label of the inverse image of H in \GL_2(\widehat{\Z}).

Depends on: Definition 1.1.13 Definition 1.1.14 Definition 1.1.16 Definition 1.1.21

Definition1.1.16
uses 1
Used by 10
Reverse dependency previews
Preview
Definition 1.1.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Level of an open subgroup. (LMFDB)

The level of an open subgroup H of a matrix group G over \widehat{\Z} is the least positive integer N for which H is equal to the inverse image of its projection to the reduction of G modulo N.

This also applies to open subgroups of matrix groups over \Z_{\ell}, in which case the level is necessarily a power of \ell.

Depends on: Definition 1.1.21

Lean code for Definition1.1.16●5 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    def Matrix.GeneralLinearGroup.adelicLevel.{u_1} {n : Type u_1} [Fintype n]
      [DecidableEq n] (G H : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])) : ℕ
    def Matrix.GeneralLinearGroup.adelicLevel.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n]
      (G H :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])) :
      ℕ
    The **level** (LMFDB `gl2.level`) of a subgroup `H` of a matrix group
    `G ≤ GL_n(ℤ̂) = ∏_ℓ GL_n(ℤ_ℓ)`: the least positive integer `N` such that `H` is the inverse image in
    `G` of its reduction modulo `N`; for a subgroup of `GL_n(ℤ̂)` itself, `G = ⊤`. It is positive for an
    open subgroup of `G` (`adelicLevel_pos`), and `0` when there is no such `N`, as for a subgroup that
    is not open in `G`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    def Matrix.GeneralLinearGroup.adelicReduction.{u_1} {n : Type u_1}
      [Fintype n] [DecidableEq n] (N : ℕ) :
      ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ]) →*
        (ℓ : Nat.Primes) → GL n (ZMod (↑ℓ ^ N.factorization ↑ℓ))
    def Matrix.GeneralLinearGroup.adelicReduction.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n] (N : ℕ) :
      ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ]) →*
        (ℓ : Nat.Primes) →
          GL n
            (ZMod (↑ℓ ^ N.factorization ↑ℓ))
    **Reduction modulo `N`** of `GL_n(ℤ̂) = ∏_ℓ GL_n(ℤ_ℓ)`: reduction modulo `ℓ ^ v_ℓ(N)` at each
    prime `ℓ`, with values in `∏_ℓ GL_n(ℤ / ℓ ^ v_ℓ(N) ℤ) = GL_n(ℤ / N ℤ)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    theorem Matrix.GeneralLinearGroup.adelicLevel_pos.{u_1} {n : Type u_1}
      [Fintype n] [DecidableEq n]
      (G : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ]))
      {H : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])} (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      0 < Matrix.GeneralLinearGroup.adelicLevel G H
    theorem Matrix.GeneralLinearGroup.adelicLevel_pos.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n]
      (G :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ]))
      {H :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])}
      (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      0 <
        Matrix.GeneralLinearGroup.adelicLevel
          G H
    **The level of an open subgroup of a matrix group over `ℤ̂` is positive.** 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    def Matrix.GeneralLinearGroup.padicLevel.{u_1} {n : Type u_1} [Fintype n]
      [DecidableEq n] (ℓ : ℕ) [Fact (Nat.Prime ℓ)]
      (G H : Subgroup (GL n ℤ_[ℓ])) : ℕ
    def Matrix.GeneralLinearGroup.padicLevel.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n] (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)]
      (G H : Subgroup (GL n ℤ_[ℓ])) : ℕ
    The **level** (LMFDB `gl2.level`) of a subgroup `H` of a matrix group `G ≤ GL_n(ℤ_ℓ)`: the least
    positive integer `N` such that `H` is the inverse image in `G` of its reduction modulo `N`, that is,
    `H = G ∩ π_N⁻¹(π_N(H))`; for a subgroup of `GL_n(ℤ_ℓ)` itself, `G = ⊤`. It is a power of `ℓ`
    (`exists_padicLevel_eq_pow`), and positive for an open subgroup of `G` (`padicLevel_pos`). It is
    `0` when there is no such `N`, as for a subgroup that is not open in `G`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    theorem Matrix.GeneralLinearGroup.exists_padicLevel_eq_pow_of_isOpen.{u_1}
      {n : Type u_1} [Fintype n] [DecidableEq n] (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)] (G : Subgroup (GL n ℤ_[ℓ]))
      {H : Subgroup (GL n ℤ_[ℓ])} (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      ∃ k, Matrix.GeneralLinearGroup.padicLevel ℓ G H = ℓ ^ k
    theorem Matrix.GeneralLinearGroup.exists_padicLevel_eq_pow_of_isOpen.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n] (ℓ : ℕ)
      [Fact (Nat.Prime ℓ)]
      (G : Subgroup (GL n ℤ_[ℓ]))
      {H : Subgroup (GL n ℤ_[ℓ])}
      (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      ∃ k,
        Matrix.GeneralLinearGroup.padicLevel ℓ
            G H =
          ℓ ^ k
    **The level of an open subgroup of a matrix group over `ℤ_ℓ` is a power of `ℓ`.** 
Definition1.1.17
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 1.1.19
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Non-split Cartan subgroup. (LMFDB)

A non-split Cartan subgroup of \GL_2(\F_p) is a Cartan subgroup that is not diagonalizable over \F_p. Every non-split Cartan subgroup is a cyclic group isomorphic to \F_{p^2}^\times.

For p=2 the label Cn identifies the unique index 2 subgroup of \GL_2(\F_2). For p>2 the label Cn identifies the nonsplit Cartan subgroup consisting of matrices of the form

\begin{pmatrix}x&\varepsilon y\\y&x\end{pmatrix},

with x,y\in \F_p not both zero and \varepsilon the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times, corresponding to x+y\sqrt{\varepsilon}\in\F_{p^2}^\times. Every non-split Cartan subgroup is conjugate to the group Cn.

Labels of the form Cn.a.b identify the proper subgroup of Cn generated by the matrix

\begin{pmatrix}a&\varepsilon b\\b&a\end{pmatrix},

where a and b are minimally chosen positive integers and \varepsilon is the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times, as defined in .

Depends on: Definition 1.1.11

Lean code for Definition1.1.17●8 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Cartan.lean
    complete
    def Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup.{u} {F : Type u}
      [Field F] (H : Subgroup (GL (Fin 2) F)) : Prop
    def Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup.{u}
      {F : Type u} [Field F]
      (H : Subgroup (GL (Fin 2) F)) : Prop
    A **non-split Cartan subgroup** of `GL₂(F)` (LMFDB `gl2.nonsplit_cartan`): a Cartan subgroup
    that is not diagonalizable over `F`, that is, no conjugate of which consists of diagonal matrices.
    The LMFDB uses it for `F = 𝔽_p`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelCn (p : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelCn (p : ℕ)
      [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Cn` (LMFDB `gl2.nonsplit_cartan`): the Cartan subgroup of the field
    `NonsplitCartanAlgebra p = 𝔽_{p²}` in the basis `(1, ω)`. For `p > 2` it consists of the
    invertible matrices `!![x, ε * y; y, x]` (`mem_labelCn_iff`); for `p = 2` it is the unique
    subgroup of index `2` of `GL₂(𝔽₂)` (`labelCn_two_eq_of_index_eq_two`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.mem_labelCn_iff (p : ℕ) [Fact (Nat.Prime p)]
      (hp : p ≠ 2) {g : GL (Fin 2) (ZMod p)} :
      g ∈ Matrix.GeneralLinearGroup.labelCn p ↔
        ↑g 1 1 = ↑g 0 0 ∧ ↑g 0 1 = ↑(ZMod.leastPrimitiveRoot p) * ↑g 1 0
    theorem Matrix.GeneralLinearGroup.mem_labelCn_iff
      (p : ℕ) [Fact (Nat.Prime p)]
      (hp : p ≠ 2) {g : GL (Fin 2) (ZMod p)} :
      g ∈
          Matrix.GeneralLinearGroup.labelCn
            p ↔
        ↑g 1 1 = ↑g 0 0 ∧
          ↑g 0 1 =
            ↑(ZMod.leastPrimitiveRoot p) *
              ↑g 1 0
    **For `p > 2`, `Cn` consists of the invertible matrices `!![x, ε * y; y, x]`**, where `ε` is
    the least primitive root modulo `p`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.isNonsplitCartanSubgroup_labelCn (p : ℕ)
      [Fact (Nat.Prime p)] :
      Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup
        (Matrix.GeneralLinearGroup.labelCn p)
    theorem Matrix.GeneralLinearGroup.isNonsplitCartanSubgroup_labelCn
      (p : ℕ) [Fact (Nat.Prime p)] :
      Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup
        (Matrix.GeneralLinearGroup.labelCn p)
    **`Cn` is a non-split Cartan subgroup** of `GL₂(𝔽_p)`, for every prime `p`: no conjugate of the
    matrix of multiplication by `ω` is upper triangular, since it has no eigenvalue in `𝔽_p`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.labelCn_two_eq_of_index_eq_two
      {H : Subgroup (GL (Fin 2) (ZMod 2))} (hH : H.index = 2) :
      H = Matrix.GeneralLinearGroup.labelCn 2
    theorem Matrix.GeneralLinearGroup.labelCn_two_eq_of_index_eq_two
      {H : Subgroup (GL (Fin 2) (ZMod 2))}
      (hH : H.index = 2) :
      H = Matrix.GeneralLinearGroup.labelCn 2
    **`Cn` is the unique subgroup of index `2` of `GL₂(𝔽₂)`**: every element of `Cn` has order
    dividing `3`, so is a square, and a subgroup of index `2` contains all squares. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup.nonempty_mulEquiv_units_galoisField
      {p : ℕ} [Fact (Nat.Prime p)] {C : Subgroup (GL (Fin 2) (ZMod p))}
      (hC : Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup C) :
      Nonempty (↥C ≃* (GaloisField p 2)ˣ)
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup.nonempty_mulEquiv_units_galoisField
      {p : ℕ} [Fact (Nat.Prime p)]
      {C : Subgroup (GL (Fin 2) (ZMod p))}
      (hC :
        Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup
          C) :
      Nonempty (↥C ≃* (GaloisField p 2)ˣ)
    **Every non-split Cartan subgroup of `GL₂(𝔽_p)` is isomorphic to `𝔽_{p²}ˣ`** (LMFDB
    `gl2.nonsplit_cartan`), for every prime `p`: it is conjugate to `Cn`, the image of the units of the
    field `NonsplitCartanAlgebra p` with `p²` elements. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup.exists_map_conj_eq_labelCn
      {p : ℕ} [Fact (Nat.Prime p)] {C : Subgroup (GL (Fin 2) (ZMod p))}
      (hC : Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup C) :
      ∃ g,
        Subgroup.map (MulEquiv.toMonoidHom (MulAut.conj g)) C =
          Matrix.GeneralLinearGroup.labelCn p
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup.exists_map_conj_eq_labelCn
      {p : ℕ} [Fact (Nat.Prime p)]
      {C : Subgroup (GL (Fin 2) (ZMod p))}
      (hC :
        Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup
          C) :
      ∃ g,
        Subgroup.map
            (MulEquiv.toMonoidHom
              (MulAut.conj g))
            C =
          Matrix.GeneralLinearGroup.labelCn p
    **Every non-split Cartan subgroup of `GL₂(𝔽_p)` is conjugate to `Cn`** (LMFDB
    `gl2.nonsplit_cartan`), for every prime `p`: for odd `p` by the classification of the Cartan
    subgroups, and for `p = 2`, where it is nontrivial, so of order `3`, it is the unique subgroup `Cn`
    of index `2`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelCnAB (p : ℕ) [Fact (Nat.Prime p)]
      (a b : ℕ) : Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelCnAB
      (p : ℕ) [Fact (Nat.Prime p)] (a b : ℕ) :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Cn.a.b` (LMFDB `gl2.nonsplit_cartan`), for `p > 2`: the subgroup of `Cn` generated by
    the matrix `!![a, ε * b; b, a]`, where `ε` is the least primitive root modulo `p`. 
Definition1.1.18
uses 1used by 1✓L∃∀N

Normalizer of a Cartan subgroup. (LMFDB)

For p>2 the normalizer of a Cartan subgroup of \GL_2(\F_p) is a maximal subgroup of \GL_2(\F_p) that contains a Cartan subgroup with index 2. It is the normalizer in \GL_2(\F_p) of the Cartan subgroup it contains.

For p=2 the Cartan subgroups of \GL_2(\F_2) are already normal and we instead define the normalizer of a Cartan subgroup to be a group that contains a Cartan subgroup with index 2. This means that the normalizer of a split Cartan subgroup of \GL_2(\F_2) has order 2 (which makes it conjugate to the Borel subgroup), while the normalizer of a non-split Cartan subgroup of \GL_2(\F_2) has order 6 (which makes it all of \GL_2(\F_2)).

Tau Ceti Review: Subgroup.normalizer.

Depends on: Definition 1.1.11

Lean code for Definition1.1.18●9 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizer.lean
    complete
    def Matrix.GeneralLinearGroup.IsCartanNormalizer {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p))) : Prop
    def Matrix.GeneralLinearGroup.IsCartanNormalizer
      {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Prop
    A subgroup `H` of `GL₂(𝔽_p)` is the **normalizer of a Cartan subgroup** (LMFDB
    `gl2.normalizer_cartan`) in the LMFDB's convention: for `p > 2`, `H` is the normalizer in
    `GL₂(𝔽_p)` of a Cartan subgroup; for `p = 2`, where Cartan subgroups are normal, `H` contains a
    Cartan subgroup with index `2`. 
  • 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. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.isCartanNormalizer_iff_exists_relIndex_eq_two
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.IsCartanNormalizer H ↔
        ∃ C,
          Matrix.GeneralLinearGroup.IsCartanSubgroup C ∧
            C ≤ H ∧ C.relIndex H = 2
    theorem Matrix.GeneralLinearGroup.isCartanNormalizer_iff_exists_relIndex_eq_two
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.IsCartanNormalizer
          H ↔
        ∃ C,
          Matrix.GeneralLinearGroup.IsCartanSubgroup
              C ∧
            C ≤ H ∧ C.relIndex H = 2
    **The normalizers of Cartan subgroups of `GL₂(𝔽_p)` are exactly the subgroups containing a
    Cartan subgroup with index `2`** (LMFDB `gl2.normalizer_cartan`), for every prime `p`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsCartanNormalizer.isCoatom_or {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsCartanNormalizer H) (hp : p ≠ 2) :
      IsCoatom H ∨
        Matrix.GeneralLinearGroup.IsSplitCartanNormalizer H ∧
          (p = 3 ∨ p = 5)
    theorem Matrix.GeneralLinearGroup.IsCartanNormalizer.isCoatom_or
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsCartanNormalizer
          H)
      (hp : p ≠ 2) :
      IsCoatom H ∨
        Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
            H ∧
          (p = 3 ∨ p = 5)
    **For `p > 2`, the normalizer of a Cartan subgroup of `GL₂(𝔽_p)` is a maximal subgroup, except
    for the normalizer of a split Cartan subgroup when `p = 3` or `p = 5`** (LMFDB
    `gl2.normalizer_cartan`). 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsCartanSubgroup.normal_of_eq_two {p : ℕ}
      [Fact (Nat.Prime p)] {C : Subgroup (GL (Fin 2) (ZMod p))}
      (hC : Matrix.GeneralLinearGroup.IsCartanSubgroup C) (hp : p = 2) :
      C.Normal
    theorem Matrix.GeneralLinearGroup.IsCartanSubgroup.normal_of_eq_two
      {p : ℕ} [Fact (Nat.Prime p)]
      {C : Subgroup (GL (Fin 2) (ZMod p))}
      (hC :
        Matrix.GeneralLinearGroup.IsCartanSubgroup
          C)
      (hp : p = 2) : C.Normal
    **For `p = 2`, every Cartan subgroup of `GL₂(𝔽₂)` is normal** (LMFDB `gl2.normalizer_cartan`,
    `gl2.normalizer_split_cartan`): it has no element of order `2`, so its order is an odd divisor of
    `6`, and it is trivial or of index `2`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.natCard_eq_two {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsSplitCartanNormalizer H)
      (hp : p = 2) : Nat.card ↥H = 2
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.natCard_eq_two
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
          H)
      (hp : p = 2) : Nat.card ↥H = 2
    **For `p = 2`, the normalizer of a split Cartan subgroup has order `2`** (LMFDB
    `gl2.normalizer_cartan`): the split Cartan subgroups of `GL₂(𝔽₂)`, conjugates of the group of
    invertible diagonal matrices, are trivial. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.isBorelSubgroup
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsSplitCartanNormalizer H)
      (hp : p = 2) : Matrix.GeneralLinearGroup.IsBorelSubgroup H
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.isBorelSubgroup
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
          H)
      (hp : p = 2) :
      Matrix.GeneralLinearGroup.IsBorelSubgroup
        H
    **For `p = 2`, the normalizer of a split Cartan subgroup is conjugate to the Borel subgroup**
    (LMFDB `gl2.normalizer_cartan`): both have order `2`, so are Sylow `2`-subgroups of `GL₂(𝔽₂)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.eq_top {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer H)
      (hp : p = 2) : H = ⊤
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.eq_top
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer
          H)
      (hp : p = 2) : H = ⊤
    **For `p = 2`, the normalizer of a non-split Cartan subgroup is `GL₂(𝔽₂)`** (LMFDB
    `gl2.normalizer_cartan`): the non-split Cartan subgroup is nontrivial, and twice its order divides
    `6`, so it has order `3` and its normalizer order `6`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Cartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.extendedCartanSubgroup_le_normalizer.{u, v}
      {R : Type u} [CommRing R] {A : Type v} [CommRing A] [Algebra R A]
      (b : Module.Basis (Fin 2) R A) :
      Matrix.GeneralLinearGroup.extendedCartanSubgroup b ≤
        Subgroup.normalizer ↑(Matrix.GeneralLinearGroup.cartanSubgroup b)
    theorem Matrix.GeneralLinearGroup.extendedCartanSubgroup_le_normalizer.{u,
        v}
      {R : Type u} [CommRing R] {A : Type v}
      [CommRing A] [Algebra R A]
      (b : Module.Basis (Fin 2) R A) :
      Matrix.GeneralLinearGroup.extendedCartanSubgroup
          b ≤
        Subgroup.normalizer
          ↑(Matrix.GeneralLinearGroup.cartanSubgroup
              b)
    **The extended Cartan subgroup normalises the Cartan subgroup.** 
Definition1.1.19
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 4.1.27
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Normalizer of a non-split Cartan subgroup. (LMFDB)

For p>2 the normalizer of a non-split Cartan subgroup of \GL_2(\F_p) is a maximal subgroup of \GL_2(\F_p) that contains a non-split Cartan subgroup with index 2, and it is the normalizer in \GL_2(\F_p) of the non-split Cartan subgroup it contains. For p=2 the normalizer of a non-split Cartan subgroup is defined to be all of \GL_2(\F_2), which contains its (already normal) non-split Cartan subgroup with index 2.

For p>2 the label Nn identifies the normalizer of the nonsplit Cartan subgroup generated by the non-split Cartan subgroup Cn and the matrix

\begin{pmatrix}1&0\\0&-1\end{pmatrix},

and every normalizer of a non-split Cartan subgroup is conjugate to the group Nn.

The label Nn.a.b denotes the proper subgroup of the normalizer of the nonsplit Cartan subgroup Nn generated by the matrices

\begin{pmatrix}a&\varepsilon b\\b&a\end{pmatrix}, \begin{pmatrix}1&0\\0&-1\end{pmatrix}.

where a and b are minimally chosen positive integers and \varepsilon is the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times, as defined in .

Depends on: Definition 1.1.17

Lean code for Definition1.1.19●9 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizer.lean
    complete
    def Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p))) : Prop
    def Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer
      {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Prop
    A subgroup `H` of `GL₂(𝔽_p)` is the **normalizer of a non-split Cartan subgroup** (LMFDB
    `gl2.normalizer_nonsplit_cartan`): for `p > 2`, `H` is the normalizer in `GL₂(𝔽_p)` of a non-split
    Cartan subgroup; for `p = 2`, `H` contains a non-split Cartan subgroup with index `2`, which forces
    `H` to be all of `GL₂(𝔽₂)`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelNn (p : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelNn (p : ℕ)
      [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Nn` (LMFDB `gl2.normalizer_nonsplit_cartan`): the extended Cartan subgroup of
    `NonsplitCartanAlgebra p = 𝔽_{p²}` in the basis `(1, ω)`. For `p > 2` it is generated by `Cn` and
    `!![1, 0; 0, -1]` (`labelNn_eq_sup`) and is the normalizer of `Cn` (`labelNn_eq_normalizer`); for
    `p = 2` it is all of `GL₂(𝔽₂)` (`labelNn_two`), as the LMFDB prescribes. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.labelNn_eq_sup (p : ℕ) [Fact (Nat.Prime p)]
      (hp : p ≠ 2) :
      Matrix.GeneralLinearGroup.labelNn p =
        Matrix.GeneralLinearGroup.labelCn p ⊔
          Subgroup.zpowers (TauCeti.diagGL ![1, -1])
    theorem Matrix.GeneralLinearGroup.labelNn_eq_sup
      (p : ℕ) [Fact (Nat.Prime p)]
      (hp : p ≠ 2) :
      Matrix.GeneralLinearGroup.labelNn p =
        Matrix.GeneralLinearGroup.labelCn p ⊔
          Subgroup.zpowers
            (TauCeti.diagGL ![1, -1])
    **For `p > 2`, `Nn` is generated by `Cn` and `!![1, 0; 0, -1]`.** 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.isNonsplitCartanNormalizer_iff_exists_relIndex_eq_two
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer H ↔
        ∃ C,
          Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup C ∧
            C ≤ H ∧ C.relIndex H = 2
    theorem Matrix.GeneralLinearGroup.isNonsplitCartanNormalizer_iff_exists_relIndex_eq_two
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer
          H ↔
        ∃ C,
          Matrix.GeneralLinearGroup.IsNonsplitCartanSubgroup
              C ∧
            C ≤ H ∧ C.relIndex H = 2
    **The normalizers of non-split Cartan subgroups of `GL₂(𝔽_p)` are exactly the subgroups
    containing a non-split Cartan subgroup with index `2`** (LMFDB `gl2.normalizer_nonsplit_cartan`),
    for every prime `p`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.isCoatom {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer H)
      (hp : p ≠ 2) : IsCoatom H
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.isCoatom
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer
          H)
      (hp : p ≠ 2) : IsCoatom H
    **For odd `p`, the normalizer of a non-split Cartan subgroup of `GL₂(𝔽_p)` is a maximal
    subgroup** (LMFDB `gl2.normalizer_cartan`): it is conjugate to `Nn`. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.exists_map_conj_eq
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer H) :
      ∃ g,
        Subgroup.map (MulEquiv.toMonoidHom (MulAut.conj g)) H =
          Matrix.GeneralLinearGroup.labelNn p
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.exists_map_conj_eq
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer
          H) :
      ∃ g,
        Subgroup.map
            (MulEquiv.toMonoidHom
              (MulAut.conj g))
            H =
          Matrix.GeneralLinearGroup.labelNn p
    **Every normalizer of a non-split Cartan subgroup of `GL₂(𝔽_p)` is conjugate to `Nn`** (LMFDB
    `gl2.normalizer_nonsplit_cartan`), for every prime `p`: for odd `p` the non-split Cartan subgroup is
    conjugate to `Cn`, and for `p = 2` both groups are `GL₂(𝔽₂)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.eq_top {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer H)
      (hp : p = 2) : H = ⊤
    theorem Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer.eq_top
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsNonsplitCartanNormalizer
          H)
      (hp : p = 2) : H = ⊤
    **For `p = 2`, the normalizer of a non-split Cartan subgroup is `GL₂(𝔽₂)`** (LMFDB
    `gl2.normalizer_cartan`): the non-split Cartan subgroup is nontrivial, and twice its order divides
    `6`, so it has order `3` and its normalizer order `6`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelNnAB (p : ℕ) [Fact (Nat.Prime p)]
      (a b : ℕ) : Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelNnAB
      (p : ℕ) [Fact (Nat.Prime p)] (a b : ℕ) :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Nn.a.b` (LMFDB `gl2.normalizer_nonsplit_cartan`), for `p > 2`: the subgroup of `Nn`
    generated by the matrices `!![a, ε * b; b, a]` and `!![1, 0; 0, -1]`, where `ε` is the least
    primitive root modulo `p`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/NonsplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.labelNn_two :
      Matrix.GeneralLinearGroup.labelNn 2 = ⊤
    theorem Matrix.GeneralLinearGroup.labelNn_two :
      Matrix.GeneralLinearGroup.labelNn 2 = ⊤
    **`Nn = GL₂(𝔽₂)`** for `p = 2`: `Cn` has index `2` in both. 
Definition1.1.20
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 4.1.27
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Normalizer of a split Cartan subgroup. (LMFDB)

The normalizer of a split Cartan subgroup of \GL_2(\F_p) is a maximal subgroup of \GL_2(\F_p) that contains a split Cartan subgroup with index 2. For p>2 such a group is in fact the normalizer in \GL_2(\F_p) of the split Cartan subgroup it contains, but for p=2 this is not the case (the split Cartan subgroup of \GL_2(\F_2) is already normal).

The label Ns identifies the subgroup generated by the split Cartan subgroup Cs of diagonal matrices and the matrix

\begin{pmatrix}0&1\\1&0\end{pmatrix}.

Every normalizer of a split Cartan subgroup is conjugate to the group Ns.

The label Ns.a.b identifies the proper subgroup of Ns generated by the matrices

\begin{pmatrix}a&0\\0&1/a\end{pmatrix}, \begin{pmatrix}0&b\\-r/b&0\end{pmatrix},

where a and b are minimally chosen positive integers and r is the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times.

The label Ns.a.b.c identifies the proper subgroup of the normalizer of the split Cartan subgroup generated by the matrices

\begin{pmatrix}a&0\\0&1/a\end{pmatrix}, \begin{pmatrix}0&b\\-1/b&0\end{pmatrix}, \begin{pmatrix}0&c\\-r/c&0\end{pmatrix}

where a and b are minimally chosen positive integers and r is the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times, as defined in .

Depends on: Definition 1.1.23

Lean code for Definition1.1.20●9 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizer.lean
    complete
    def Matrix.GeneralLinearGroup.IsSplitCartanNormalizer {p : ℕ}
      [Fact (Nat.Prime p)] (H : Subgroup (GL (Fin 2) (ZMod p))) : Prop
    def Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
      {p : ℕ} [Fact (Nat.Prime p)]
      (H : Subgroup (GL (Fin 2) (ZMod p))) :
      Prop
    A subgroup `H` of `GL₂(𝔽_p)` is the **normalizer of a split Cartan subgroup** (LMFDB
    `gl2.normalizer_split_cartan`): for `p > 2`, `H` is the normalizer in `GL₂(𝔽_p)` of a split Cartan
    subgroup; for `p = 2`, where the split Cartan subgroup is trivial and hence normal, `H` contains a
    split Cartan subgroup with index `2`, so has order `2`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelNs (p : ℕ) :
      Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelNs
      (p : ℕ) : Subgroup (GL (Fin 2) (ZMod p))
    The group `Ns` (LMFDB `gl2.normalizer_split_cartan`): the subgroup of `GL₂(𝔽_p)` generated by
    the split Cartan subgroup `Cs` of diagonal matrices and the matrix `!![0, 1; 1, 0]`. It is the
    extended Cartan subgroup of `𝔽_p × 𝔽_p` (`labelNs_eq_extendedCartanSubgroup`), the normalizer of
    `Cs` for `p > 2` (`labelNs_eq_normalizer`), and a group of order `2` for `p = 2`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.isSplitCartanNormalizer_iff_exists_relIndex_eq_two
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.IsSplitCartanNormalizer H ↔
        ∃ C,
          Matrix.GeneralLinearGroup.IsSplitCartanSubgroup C ∧
            C ≤ H ∧ C.relIndex H = 2
    theorem Matrix.GeneralLinearGroup.isSplitCartanNormalizer_iff_exists_relIndex_eq_two
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))} :
      Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
          H ↔
        ∃ C,
          Matrix.GeneralLinearGroup.IsSplitCartanSubgroup
              C ∧
            C ≤ H ∧ C.relIndex H = 2
    **The normalizers of split Cartan subgroups of `GL₂(𝔽_p)` are exactly the subgroups containing
    a split Cartan subgroup with index `2`** (LMFDB `gl2.normalizer_split_cartan`), for every prime
    `p`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/CartanNormalizerIndex.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsCartanSubgroup.eq_normalizer_of_relIndex_eq_two.{u}
      {F : Type u} [Field F] {C : Subgroup (GL (Fin 2) F)}
      (hC : Matrix.GeneralLinearGroup.IsCartanSubgroup C) (h2 : 2 ≠ 0)
      {K : Subgroup (GL (Fin 2) F)} (hCK : C ≤ K) (hK : C.relIndex K = 2) :
      K = Subgroup.normalizer ↑C
    theorem Matrix.GeneralLinearGroup.IsCartanSubgroup.eq_normalizer_of_relIndex_eq_two.{u}
      {F : Type u} [Field F]
      {C : Subgroup (GL (Fin 2) F)}
      (hC :
        Matrix.GeneralLinearGroup.IsCartanSubgroup
          C)
      (h2 : 2 ≠ 0)
      {K : Subgroup (GL (Fin 2) F)}
      (hCK : C ≤ K) (hK : C.relIndex K = 2) :
      K = Subgroup.normalizer ↑C
    **A subgroup containing a Cartan subgroup with index `2` is its normalizer** (LMFDB
    `gl2.normalizer_cartan`, `gl2.normalizer_split_cartan`), over a field of characteristic other than
    `2`: a subgroup of index `2` is normal, and the Cartan subgroup has index `2` in its normalizer. 
  • theoremdefined in LeanBridge/ForMathlib/GroupTheory/SpecificGroups/GL2CartanNormalizerMaximal.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.isCoatom {p : ℕ}
      [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsSplitCartanNormalizer H)
      (h₃ : p ≠ 3) (h₅ : p ≠ 5) : IsCoatom H
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.isCoatom
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
          H)
      (h₃ : p ≠ 3) (h₅ : p ≠ 5) : IsCoatom H
    **The normalizer of a split Cartan subgroup of `GL₂(𝔽_p)` is a maximal subgroup unless `p = 3`
    or `p = 5`** (LMFDB `gl2.normalizer_split_cartan`): it is conjugate to `Ns`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartanNormalizerConjugacy.lean
    complete
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.exists_map_conj_eq
      {p : ℕ} [Fact (Nat.Prime p)] {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH : Matrix.GeneralLinearGroup.IsSplitCartanNormalizer H) :
      ∃ g,
        Subgroup.map (MulEquiv.toMonoidHom (MulAut.conj g)) H =
          Matrix.GeneralLinearGroup.labelNs p
    theorem Matrix.GeneralLinearGroup.IsSplitCartanNormalizer.exists_map_conj_eq
      {p : ℕ} [Fact (Nat.Prime p)]
      {H : Subgroup (GL (Fin 2) (ZMod p))}
      (hH :
        Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
          H) :
      ∃ g,
        Subgroup.map
            (MulEquiv.toMonoidHom
              (MulAut.conj g))
            H =
          Matrix.GeneralLinearGroup.labelNs p
    **Every normalizer of a split Cartan subgroup of `GL₂(𝔽_p)` is conjugate to `Ns`** (LMFDB
    `gl2.normalizer_split_cartan`), for every prime `p`: for `p > 2` the split Cartan subgroup is
    conjugate to `Cs`, so its normalizer to the normalizer `Ns` of `Cs`, and for `p = 2` both groups
    have order `2`, so are Sylow `2`-subgroups of `GL₂(𝔽₂)`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelNsAB (p a b : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelNsAB
      (p a b : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Ns.a.b` (LMFDB `gl2.normalizer_split_cartan`): the subgroup of `Ns` generated by the
    matrices `!![a, 0; 0, 1/a]` and `!![0, b; -r/b, 0]`, where `r` is the least primitive root
    modulo `p`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelNsABC (p a b c : ℕ)
      [Fact (Nat.Prime p)] : Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelNsABC
      (p a b c : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Ns.a.b.c` (LMFDB `gl2.normalizer_split_cartan`): the subgroup of `Ns` generated by
    the matrices `!![a, 0; 0, 1/a]`, `!![0, b; -1/b, 0]` and `!![0, c; -r/c, 0]`, where `r` is the
    least primitive root modulo `p`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.isSplitCartanNormalizer_labelNs (p : ℕ)
      [Fact (Nat.Prime p)] :
      Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
        (Matrix.GeneralLinearGroup.labelNs p)
    theorem Matrix.GeneralLinearGroup.isSplitCartanNormalizer_labelNs
      (p : ℕ) [Fact (Nat.Prime p)] :
      Matrix.GeneralLinearGroup.IsSplitCartanNormalizer
        (Matrix.GeneralLinearGroup.labelNs p)
    **`Ns` is the normalizer of a split Cartan subgroup** of `GL₂(𝔽_p)` in the LMFDB's sense, for
    every prime `p`. 
Definition1.1.21
uses 1
Used by 21
Reverse dependency previews
Preview
Definition 1.1.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Open subgroup. (LMFDB)

An open subgroup H of a profinite group G is a subgroup that is open in the topology of G, which implies that it is equal to the inverse image of its projection to a a finite quotient of G.

Open subgroups of G necessarily have finite index (since G is compact), but not every finite index subgroup of G is necessarily open.

When the profinite group G is a matrix group over a ring R that is equipped with canonical projections to finite rings of the form \Z/n\Z (take R=\Z_{\ell} or R=\widehat{\Z}, for example), we use G(n) to denote the image of G under the group homomorphism induced by the projection R\to\Z/n\Z. In this situation we may identify H with its projection to G(N), where N is the least positive integer for which H is the inverse image of its projection to G(N) (this N is the level of H).

Tau Ceti Review: OpenSubgroup, OpenSubgroup.finiteIndex_toSubgroup.

Depends on: Definition 1.1.22

Lean code for Definition1.1.21●6 declarations
  • structure(extends 3, 5 fields)defined in Mathlib/Topology/Algebra/OpenSubgroup.lean
    complete
    structure OpenSubgroup.{u_1} (G : Type u_1) [Group G] [TopologicalSpace G] :
      Type u_1
    structure OpenSubgroup.{u_1} (G : Type u_1)
      [Group G] [TopologicalSpace G] :
      Type u_1
    The type of open subgroups of a topological group. 
    • 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
    isOpen' : IsOpen (↑self).carrier
  • theoremdefined in TauCeti/Topology/Algebra/Group/OpenSubgroup/FiniteIndex.lean
    complete
    theorem OpenSubgroup.finiteIndex_toSubgroup.{u_1} {G : Type u_1} [Group G]
      [TopologicalSpace G] [SeparatelyContinuousMul G] [CompactSpace G]
      (U : OpenSubgroup G) : (↑U).FiniteIndex
    theorem OpenSubgroup.finiteIndex_toSubgroup.{u_1}
      {G : Type u_1} [Group G]
      [TopologicalSpace G]
      [SeparatelyContinuousMul G]
      [CompactSpace G] (U : OpenSubgroup G) :
      (↑U).FiniteIndex
    **An open subgroup of a compact group has finite index.** Its coset space is compact and
    discrete, hence finite. 
  • theoremdefined in LeanBridge/ForMathlib/Topology/Algebra/Group/ProfiniteOpenSubgroup.lean
    complete
    theorem ProfiniteGrp.exists_comap_map_mk_eq.{u_1} {G : ProfiniteGrp.{u_1}}
      (H : OpenSubgroup ↑G.toProfinite.toTop) :
      ∃ N,
        Finite (↑G.toProfinite.toTop ⧸ ↑N.toOpenSubgroup) ∧
          Subgroup.comap (QuotientGroup.mk' ↑N.toOpenSubgroup)
              (Subgroup.map (QuotientGroup.mk' ↑N.toOpenSubgroup) ↑H) =
            ↑H
    theorem ProfiniteGrp.exists_comap_map_mk_eq.{u_1}
      {G : ProfiniteGrp.{u_1}}
      (H :
        OpenSubgroup ↑G.toProfinite.toTop) :
      ∃ N,
        Finite
            (↑G.toProfinite.toTop ⧸
              ↑N.toOpenSubgroup) ∧
          Subgroup.comap
              (QuotientGroup.mk'
                ↑N.toOpenSubgroup)
              (Subgroup.map
                (QuotientGroup.mk'
                  ↑N.toOpenSubgroup)
                ↑H) =
            ↑H
    **An open subgroup of a profinite group is the inverse image of its image in a finite
    quotient** (LMFDB `gl2.open`): it contains an open normal subgroup `N`, so that `G ⧸ N` is finite,
    and is the inverse image of its image in `G ⧸ N`. 
  • theoremdefined in LeanBridge/ForMathlib/Topology/Algebra/Group/ProfiniteOpenSubgroup.lean
    complete
    theorem ProfiniteGrp.exists_finiteIndex_not_isOpen :
      ∃ G K, K.FiniteIndex ∧ ¬IsOpen ↑K
    theorem ProfiniteGrp.exists_finiteIndex_not_isOpen :
      ∃ G K, K.FiniteIndex ∧ ¬IsOpen ↑K
    **Not every subgroup of finite index of a profinite group is open** (LMFDB `gl2.open`): the
    profinite group `∏_{n ∈ ℕ} ℤ/2ℤ`, written multiplicatively, has a subgroup of index `2` that is not
    open, the kernel of a linear form vanishing on the finitely supported functions but not on the
    constant function `1`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    def Matrix.GeneralLinearGroup.adelicLevel.{u_1} {n : Type u_1} [Fintype n]
      [DecidableEq n] (G H : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])) : ℕ
    def Matrix.GeneralLinearGroup.adelicLevel.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n]
      (G H :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])) :
      ℕ
    The **level** (LMFDB `gl2.level`) of a subgroup `H` of a matrix group
    `G ≤ GL_n(ℤ̂) = ∏_ℓ GL_n(ℤ_ℓ)`: the least positive integer `N` such that `H` is the inverse image in
    `G` of its reduction modulo `N`; for a subgroup of `GL_n(ℤ̂)` itself, `G = ⊤`. It is positive for an
    open subgroup of `G` (`adelicLevel_pos`), and `0` when there is no such `N`, as for a subgroup that
    is not open in `G`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Level.lean
    complete
    theorem Matrix.GeneralLinearGroup.inf_comap_map_adelicReduction_adelicLevel.{u_1}
      {n : Type u_1} [Fintype n] [DecidableEq n]
      (G : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ]))
      {H : Subgroup ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])} (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      G ⊓
          Subgroup.comap
            (Matrix.GeneralLinearGroup.adelicReduction
              (Matrix.GeneralLinearGroup.adelicLevel G H))
            (Subgroup.map
              (Matrix.GeneralLinearGroup.adelicReduction
                (Matrix.GeneralLinearGroup.adelicLevel G H))
              H) =
        H
    theorem Matrix.GeneralLinearGroup.inf_comap_map_adelicReduction_adelicLevel.{u_1}
      {n : Type u_1} [Fintype n]
      [DecidableEq n]
      (G :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ]))
      {H :
        Subgroup
          ((ℓ : Nat.Primes) → GL n ℤ_[↑ℓ])}
      (hHG : H ≤ G)
      (hH : IsOpen ↑(H.subgroupOf G)) :
      G ⊓
          Subgroup.comap
            (Matrix.GeneralLinearGroup.adelicReduction
              (Matrix.GeneralLinearGroup.adelicLevel
                G H))
            (Subgroup.map
              (Matrix.GeneralLinearGroup.adelicReduction
                (Matrix.GeneralLinearGroup.adelicLevel
                  G H))
              H) =
        H
    **An open subgroup of a matrix group over `ℤ̂` is the inverse image of its reduction modulo its
    level.** 
Definition1.1.22
uses 0
Used by 3
Reverse dependency previews
Preview
Definition 1.1.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Profinite group. (LMFDB)

A profinite group is a compact totally disconnected topological group. Equivalently, it is the inverse limit of a system of finite groups equipped with the discrete topology.

For example, if we take the finite groups \GL_2(\Z/n\Z) as n varies over positive integers, order them by divisibility of n and consider the inverse system equipped with reduction maps \GL_2(\Z/n\Z)\to \GL_2(\Z/m\Z) for all positive integers m|n, then the inverse limit

\lim_{\overset{\longleftarrow}{n}} \GL_2(\Z/n\Z) \simeq \GL_2(\widehat{\Z})

is a profinite group which is isomorphic to the group of invertible 2\times 2 matrices over the topological ring \widehat{\Z}, which is the inverse limit of the finite rings \Z/n\Z equipped with the discrete topology.

Tau Ceti Review: ProfiniteGrp, TauCeti.zHat.existsUnique_forall_toZMod_eq.

Lean code for Definition1.1.22●6 declarations
  • structure(3 fields)defined in Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean
    complete
    structure ProfiniteGrp.{u} : Type (u + 1)
    structure ProfiniteGrp.{u} : Type (u + 1)
    The category of profinite groups. A term of this type consists of a profinite
    set with a topological group structure.
    
    toProfinite : Profinite
    The underlying profinite topological space. 
    group : Group ↑self.toProfinite.toTop
    The group structure. 
    isTopologicalGroup : IsTopologicalGroup ↑self.toProfinite.toTop
    The above data together form a topological group. 
  • defdefined in Mathlib/Topology/Algebra/Category/ProfiniteGrp/Limits.lean
    complete
    def ProfiniteGrp.isoLimittoFiniteQuotientFunctor.{u}
      (P : ProfiniteGrp.{u}) : P ≅ ProfiniteGrp.limit P.diagram
    def ProfiniteGrp.isoLimittoFiniteQuotientFunctor.{u}
      (P : ProfiniteGrp.{u}) :
      P ≅ ProfiniteGrp.limit P.diagram
    The isomorphism in the category of profinite group between a profinite group and
    the projective limit of its quotients by open normal subgroups 
  • defdefined in LeanBridge/ForMathlib/Topology/Algebra/Group/GL2ZHat.lean
    complete
    def Matrix.GeneralLinearGroup.gl2ZModLimit :
      Subgroup ((n : ℕ+) → GL (Fin 2) (ZMod ↑n))
    def Matrix.GeneralLinearGroup.gl2ZModLimit :
      Subgroup
        ((n : ℕ+) → GL (Fin 2) (ZMod ↑n))
    The **inverse limit** `lim_n GL₂(ℤ/nℤ)` (LMFDB `gl2.profinite`) of the finite groups
    `GL₂(ℤ/nℤ)`, `n ≥ 1`, ordered by divisibility, along the reduction maps `GL₂(ℤ/nℤ) → GL₂(ℤ/mℤ)` for
    `m ∣ n`: the subgroup of the families in `∏_n GL₂(ℤ/nℤ)` compatible with the reduction maps, with
    the topology induced by the discrete topologies of the `GL₂(ℤ/nℤ)`. 
  • defdefined in LeanBridge/ForMathlib/Topology/Algebra/Group/GL2ZHat.lean
    complete
    def Matrix.GeneralLinearGroup.gl2ZModLimitProfiniteGrp : ProfiniteGrp.{0}
    def Matrix.GeneralLinearGroup.gl2ZModLimitProfiniteGrp :
      ProfiniteGrp.{0}
    The inverse limit `lim_n GL₂(ℤ/nℤ)` (LMFDB `gl2.profinite`) as a **profinite group**: a closed
    subgroup of a product of finite discrete groups, so a compact totally disconnected topological
    group. 
  • defdefined in LeanBridge/ForMathlib/Topology/Algebra/Group/GL2ZHat.lean
    complete
    def Matrix.GeneralLinearGroup.gl2ZHatContinuousMulEquiv.{u} :
      GL (Fin 2) (Additive ↑TauCeti.zHat.toProfinite.toTop) ≃ₜ*
        ↥Matrix.GeneralLinearGroup.gl2ZModLimit
    def Matrix.GeneralLinearGroup.gl2ZHatContinuousMulEquiv.{u} :
      GL (Fin 2)
          (Additive
            ↑TauCeti.zHat.toProfinite.toTop) ≃ₜ*
        ↥Matrix.GeneralLinearGroup.gl2ZModLimit
    **The isomorphism of topological groups `GL₂(ℤ̂) ≃ lim_n GL₂(ℤ/nℤ)`** (LMFDB `gl2.profinite`):
    reduction modulo every `n`, a continuous bijection from the compact group `GL₂(ℤ̂)` to the
    Hausdorff inverse limit, hence a homeomorphism. 
  • theoremdefined in TauCeti/Topology/Algebra/Group/Profinite/ZHat/ZMod.lean
    complete
    theorem TauCeti.zHat.existsUnique_forall_toZMod_eq.{u} (x : (n : ℕ+) → ZMod ↑n)
      (hx :
        ∀ (m n : ℕ+) (h : ↑m ∣ ↑n),
          (ZMod.castHom h (ZMod ↑m)) (x n) = x m) :
      ∃! a, ∀ (n : ℕ+), (TauCeti.zHat.toZMod n) a = x n
    theorem TauCeti.zHat.existsUnique_forall_toZMod_eq.{u}
      (x : (n : ℕ+) → ZMod ↑n)
      (hx :
        ∀ (m n : ℕ+) (h : ↑m ∣ ↑n),
          (ZMod.castHom h (ZMod ↑m)) (x n) =
            x m) :
      ∃! a,
        ∀ (n : ℕ+),
          (TauCeti.zHat.toZMod n) a = x n
    **The profinite integers are the inverse limit of the `ZMod n`.** A family of residues
    `x n : ZMod n`, compatible along the reduction maps, is realized by a unique profinite
    integer. 
Definition1.1.23
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 1.1.20
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Split Cartan subgroup. (LMFDB)

A split Cartan subgroup of \GL_2(\F_p) is a Cartan subgroup that is diagonalizable over \F_p. Every split Cartan subgroup is conjugate to the subgroup of diagonal matrices, which is isomorphic to \F_p^\times\times\F_p^\times.

The label Cs identifies the split Cartan subgroup of diagonal matrices.

The label Cs.a.b identifies the proper subgroup of Cs generated by

\begin{pmatrix}a&0\\0&1/a\end{pmatrix}, \begin{pmatrix}b&0\\0&r/b\end{pmatrix},

where a and b are minimally chosen positive integers and r is the least positive integer generating (\Z/p\Z)^\times\simeq \F_p^\times, as defined in .

Tau Ceti Review: TauCeti.diagonalTorus.

Depends on: Definition 1.1.11

Lean code for Definition1.1.23●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/Cartan.lean
    complete
    def Matrix.GeneralLinearGroup.IsSplitCartanSubgroup.{u} {F : Type u}
      [Field F] (H : Subgroup (GL (Fin 2) F)) : Prop
    def Matrix.GeneralLinearGroup.IsSplitCartanSubgroup.{u}
      {F : Type u} [Field F]
      (H : Subgroup (GL (Fin 2) F)) : Prop
    A **split Cartan subgroup** of `GL₂(F)` (LMFDB `gl2.split_cartan`): a Cartan subgroup that is
    diagonalizable over `F`, that is, has a conjugate consisting of diagonal matrices. The LMFDB uses
    it for `F = 𝔽_p`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartanConjugacy.lean
    complete
    theorem Matrix.GeneralLinearGroup.isSplitCartanSubgroup_iff.{u} {F : Type u}
      [Field F] {H : Subgroup (GL (Fin 2) F)} :
      Matrix.GeneralLinearGroup.IsSplitCartanSubgroup H ↔
        ∃ g,
          Subgroup.map (MulEquiv.toMonoidHom (MulAut.conj g)) H =
            TauCeti.diagonalTorus F 2
    theorem Matrix.GeneralLinearGroup.isSplitCartanSubgroup_iff.{u}
      {F : Type u} [Field F]
      {H : Subgroup (GL (Fin 2) F)} :
      Matrix.GeneralLinearGroup.IsSplitCartanSubgroup
          H ↔
        ∃ g,
          Subgroup.map
              (MulEquiv.toMonoidHom
                (MulAut.conj g))
              H =
            TauCeti.diagonalTorus F 2
    **The split Cartan subgroups of `GL₂(F)` are exactly the conjugates of the subgroup of diagonal
    matrices** (LMFDB `gl2.split_cartan`). 
  • defdefined in TauCeti/LinearAlgebra/Matrix/GeneralLinearGroup/Diagonal/Basic.lean
    complete
    def TauCeti.diagonalTorus.{u} (k : Type u) [Semiring k] (n : ℕ) :
      Subgroup (GL (Fin n) k)
    def TauCeti.diagonalTorus.{u} (k : Type u)
      [Semiring k] (n : ℕ) :
      Subgroup (GL (Fin n) k)
    The **diagonal torus** of `GL n k`: the image of the coordinatewise units under `diagGL`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartanConjugacy.lean
    complete
    def Matrix.GeneralLinearGroup.diagonalTorusMulEquivProd.{u} (F : Type u)
      [Field F] : ↥(TauCeti.diagonalTorus F 2) ≃* Fˣ × Fˣ
    def Matrix.GeneralLinearGroup.diagonalTorusMulEquivProd.{u}
      (F : Type u) [Field F] :
      ↥(TauCeti.diagonalTorus F 2) ≃* Fˣ × Fˣ
    The **isomorphism of the diagonal torus of `GL₂(F)` with `Fˣ × Fˣ`** (LMFDB `gl2.split_cartan`),
    by the two diagonal entries. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartan.lean
    complete
    theorem Matrix.GeneralLinearGroup.isSplitCartanSubgroup_diagonalTorus.{u_2}
      (F : Type u_2) [Field F] :
      Matrix.GeneralLinearGroup.IsSplitCartanSubgroup
        (TauCeti.diagonalTorus F 2)
    theorem Matrix.GeneralLinearGroup.isSplitCartanSubgroup_diagonalTorus.{u_2}
      (F : Type u_2) [Field F] :
      Matrix.GeneralLinearGroup.IsSplitCartanSubgroup
        (TauCeti.diagonalTorus F 2)
    **The group of diagonal matrices is a split Cartan subgroup** of `GL₂(F)`: it is the Cartan
    subgroup of the étale algebra `F × F` in its standard basis. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/GL2/SplitCartan.lean
    complete
    def Matrix.GeneralLinearGroup.labelCsAB (p a b : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    def Matrix.GeneralLinearGroup.labelCsAB
      (p a b : ℕ) [Fact (Nat.Prime p)] :
      Subgroup (GL (Fin 2) (ZMod p))
    The group `Cs.a.b` (LMFDB `gl2.split_cartan`): the subgroup of `Cs` generated by the matrices
    `!![a, 0; 0, 1/a]` and `!![b, 0; 0, r/b]`, where `r` is the least primitive root modulo `p`. A
    listed matrix that is not invertible (`p ∣ a` or `p ∣ b`) is not among the generators; the label
    uses minimal positive integers `a` and `b`, which avoids this. 
Definition1.1.24
Statement uses 5
Statement dependency previews
Preview
Definition 1.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 17
Reverse dependency previews
Preview
Definition 1.1.26
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Definition of ring. (LMFDB)

A ring is a set R with two binary operations + and \cdot such that

  1. R is an abelian group with respect to +

  2. \cdot is associative on R

  3. the distributive laws hold, i.e., for all a,b,c\in R,

a\cdot(b+c) = a\cdot b+a\cdot c \qquad \text{and}\qquad (b+c)\cdot a = b\cdot a+c\cdot a

  1. there is an identity element with respect to the operation \cdot, typically denoted by 1_R or, more simply, by 1.

The identity element of R as a group with respect to + is typically denoted by 0_R or, more simply, by 0.

The ring R is a commutative ring if R is a ring such that the operation \cdot is commutative on R.

We say that R is a rng (also called ring without identity or non-unital ring) if conditions 1-3 (but not necessarily 4) are satisfied.

Tau Ceti Review: Ring, CommRing, NonUnitalRing.

Depends on: Definition 1.1.2 Definition 1.1.3 Definition 1.1.4 Definition 1.1.5 Definition 8.3.5

Lean code for Definition1.1.24●3 definitions
  • class(extends 37, 35 methods)defined in Mathlib/Algebra/Ring/Defs.lean
    complete
    class Ring.{u} (R : Type u) : Type u
    class Ring.{u} (R : Type u) : Type u
    A `Ring` is a `Semiring` with negation making it an additive group. 
    • Semiring R
    • AddCommGroup R
    • AddGroupWithOne R
    zero : R
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    4. Zero
    add : R → R → R
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    4. Add
    add_assoc : ∀ (a b c : R), a + b + c = a + (b + c)
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    zero_add : ∀ (a : R), 0 + a = a
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    add_zero : ∀ (a : R), a + 0 = a
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    nsmul : ℕ → R → R
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    4. NSMul
    nsmul_zero : ∀ (x : R), 0 • x = 0
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    nsmul_succ : ∀ (n : ℕ) (x : R), (n + 1) • x = n • x + x
    Inherited from
    1. Semiring
    2. AddCommMonoid
    3. AddMonoid
    add_comm : ∀ (a b : R), a + b = b + a
    Inherited from
    1. Semiring
    2. AddCommMonoid
    one : R
    Inherited from
    1. Semiring
    2. Monoid
    3. One
    mul : R → R → R
    Inherited from
    1. Semiring
    2. Monoid
    3. Mul
    mul_assoc : ∀ (a b c : R), a * b * c = a * (b * c)
    Inherited from
    1. Semiring
    2. Monoid
    one_mul : ∀ (a : R), 1 * a = a
    Inherited from
    1. Semiring
    2. Monoid
    mul_one : ∀ (a : R), a * 1 = a
    Inherited from
    1. Semiring
    2. Monoid
    npow : ℕ → R → R
    Inherited from
    1. Semiring
    2. Monoid
    3. NPow
    npow_zero : ∀ (x : R), x ^ 0 = 1
    Inherited from
    1. Semiring
    2. Monoid
    npow_succ : ∀ (n : ℕ) (x : R), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. Semiring
    2. Monoid
    zero_mul : ∀ (a : R), 0 * a = 0
    Inherited from
    1. Semiring
    mul_zero : ∀ (a : R), a * 0 = 0
    Inherited from
    1. Semiring
    left_distrib : ∀ (a b c : R), a * (b + c) = a * b + a * c
    Inherited from
    1. Semiring
    right_distrib : ∀ (a b c : R), (a + b) * c = a * c + b * c
    Inherited from
    1. Semiring
    natCast : ℕ → R
    Inherited from
    1. Semiring
    2. NatCast
    natCast_zero : ↑0 = 0
    Inherited from
    1. Semiring
    natCast_succ : ∀ (n : ℕ), ↑(n + 1) = ↑n + 1
    Inherited from
    1. Semiring
    neg : R → R
    Inherited from
    1. Neg
    sub : R → R → R
    Inherited from
    1. Sub
    zsmul : ℤ → R → R
    Inherited from
    1. ZSMul
    sub_eq_add_neg : ∀ (a b : R), a - b = a + -b
    zsmul_zero' : ∀ (a : R), 0 • a = 0
    zsmul_succ' : ∀ (n : ℕ) (a : R), ↑n.succ • a = ↑n • a + a
    zsmul_neg' : ∀ (n : ℕ) (a : R), Int.negSucc n • a = -(↑n.succ • a)
    neg_add_cancel : ∀ (a : R), -a + a = 0
    intCast : ℤ → R
    Inherited from
    1. IntCast
    intCast_ofNat : ∀ (n : ℕ), IntCast.intCast ↑n = ↑n
    The canonical homomorphism `ℤ → R` agrees with the one from `ℕ → R` on `ℕ`. 
    intCast_negSucc : ∀ (n : ℕ), IntCast.intCast (Int.negSucc n) = -↑(n + 1)
    The canonical homomorphism `ℤ → R` for negative values is just the negation of the values
    of the canonical homomorphism `ℕ → R`. 
  • class(extends 41, 36 methods)defined in Mathlib/Algebra/Ring/Defs.lean
    complete
    class CommRing.{u} (α : Type u) : Type u
    class CommRing.{u} (α : Type u) : Type u
    A commutative ring is a ring with commutative multiplication. 
    • Ring α
    • CommMonoid α
    zero : α
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    5. Zero
    add : α → α → α
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    5. Add
    add_assoc : ∀ (a b c : α), a + b + c = a + (b + c)
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    zero_add : ∀ (a : α), 0 + a = a
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    add_zero : ∀ (a : α), a + 0 = a
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    nsmul : ℕ → α → α
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    5. NSMul
    nsmul_zero : ∀ (x : α), 0 • x = 0
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    nsmul_succ : ∀ (n : ℕ) (x : α), (n + 1) • x = n • x + x
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    4. AddMonoid
    add_comm : ∀ (a b : α), a + b = b + a
    Inherited from
    1. Ring
    2. Semiring
    3. AddCommMonoid
    one : α
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    4. One
    mul : α → α → α
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    4. Mul
    mul_assoc : ∀ (a b c : α), a * b * c = a * (b * c)
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    one_mul : ∀ (a : α), 1 * a = a
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    mul_one : ∀ (a : α), a * 1 = a
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    npow : ℕ → α → α
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    4. NPow
    npow_zero : ∀ (x : α), x ^ 0 = 1
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    npow_succ : ∀ (n : ℕ) (x : α), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. Ring
    2. Semiring
    3. Monoid
    zero_mul : ∀ (a : α), 0 * a = 0
    Inherited from
    1. Ring
    2. Semiring
    mul_zero : ∀ (a : α), a * 0 = 0
    Inherited from
    1. Ring
    2. Semiring
    left_distrib : ∀ (a b c : α), a * (b + c) = a * b + a * c
    Inherited from
    1. Ring
    2. Semiring
    right_distrib : ∀ (a b c : α), (a + b) * c = a * c + b * c
    Inherited from
    1. Ring
    2. Semiring
    natCast : ℕ → α
    Inherited from
    1. Ring
    2. Semiring
    3. NatCast
    natCast_zero : ↑0 = 0
    Inherited from
    1. Ring
    2. Semiring
    natCast_succ : ∀ (n : ℕ), ↑(n + 1) = ↑n + 1
    Inherited from
    1. Ring
    2. Semiring
    neg : α → α
    Inherited from
    1. Ring
    2. Neg
    sub : α → α → α
    Inherited from
    1. Ring
    2. Sub
    zsmul : ℤ → α → α
    Inherited from
    1. Ring
    2. ZSMul
    sub_eq_add_neg : ∀ (a b : α), a - b = a + -b
    Inherited from
    1. Ring
    zsmul_zero' : ∀ (a : α), 0 • a = 0
    Inherited from
    1. Ring
    zsmul_succ' : ∀ (n : ℕ) (a : α), ↑n.succ • a = ↑n • a + a
    Inherited from
    1. Ring
    zsmul_neg' : ∀ (n : ℕ) (a : α), Int.negSucc n • a = -(↑n.succ • a)
    Inherited from
    1. Ring
    neg_add_cancel : ∀ (a : α), -a + a = 0
    Inherited from
    1. Ring
    intCast : ℤ → α
    Inherited from
    1. Ring
    2. IntCast
    intCast_ofNat : ∀ (n : ℕ), IntCast.intCast ↑n = ↑n
    Inherited from
    1. Ring
    intCast_negSucc : ∀ (n : ℕ), IntCast.intCast (Int.negSucc n) = -↑(n + 1)
    Inherited from
    1. Ring
    mul_comm : ∀ (a b : α), a * b = b * a
    Multiplication is commutative in a commutative multiplicative magma. 
  • class(extends 24, 23 methods)defined in Mathlib/Algebra/Ring/Defs.lean
    complete
    class NonUnitalRing.{u_1} (α : Type u_1) : Type u_1
    class NonUnitalRing.{u_1} (α : Type u_1) :
      Type u_1
    An associative but not-necessarily unital ring. 
    • NonUnitalNonAssocRing α
    • NonUnitalSemiring α
    zero : α
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    6. Zero
    add : α → α → α
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    6. Add
    add_assoc : ∀ (a b c : α), a + b + c = a + (b + c)
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    zero_add : ∀ (a : α), 0 + a = a
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    add_zero : ∀ (a : α), a + 0 = a
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    nsmul : ℕ → α → α
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    6. NSMul
    nsmul_zero : ∀ (x : α), 0 • x = 0
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    nsmul_succ : ∀ (n : ℕ) (x : α), (n + 1) • x = n • x + x
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. AddMonoid
    neg : α → α
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. Neg
    sub : α → α → α
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. Sub
    zsmul : ℤ → α → α
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    5. ZSMul
    sub_eq_add_neg : ∀ (a b : α), a - b = a + -b
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    zsmul_zero' : ∀ (a : α), 0 • a = 0
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    zsmul_succ' : ∀ (n : ℕ) (a : α), ↑n.succ • a = ↑n • a + a
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    zsmul_neg' : ∀ (n : ℕ) (a : α), Int.negSucc n • a = -(↑n.succ • a)
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    4. SubNegMonoid
    neg_add_cancel : ∀ (a : α), -a + a = 0
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    3. AddGroup
    add_comm : ∀ (a b : α), a + b = b + a
    Inherited from
    1. NonUnitalNonAssocRing
    2. AddCommGroup
    mul : α → α → α
    Inherited from
    1. NonUnitalNonAssocRing
    2. Mul
    left_distrib : ∀ (a b c : α), a * (b + c) = a * b + a * c
    Inherited from
    1. NonUnitalNonAssocRing
    right_distrib : ∀ (a b c : α), (a + b) * c = a * c + b * c
    Inherited from
    1. NonUnitalNonAssocRing
    zero_mul : ∀ (a : α), 0 * a = 0
    Inherited from
    1. NonUnitalNonAssocRing
    mul_zero : ∀ (a : α), a * 0 = 0
    Inherited from
    1. NonUnitalNonAssocRing
    mul_assoc : ∀ (a b c : α), a * b * c = a * (b * c)
    Multiplication is associative 
Definition1.1.25
uses 1used by 1✓L∃∀N

A-field. (LMFDB)

Let A be a commutative ring. An A-field is an A-algebra that is a field.

Tau Ceti Review: Algebra, Field.

Depends on: Definition 1.1.30

Lean code for Definition1.1.25●2 definitions
  • class(extends 1, 4 methods)defined in Mathlib/Algebra/Algebra/Defs.lean
    complete
    class Algebra.{u, v} (R : Type u) (A : Type v) [CommSemiring R] [Semiring A] :
      Type (max u v)
    class Algebra.{u, v} (R : Type u) (A : Type v)
      [CommSemiring R] [Semiring A] :
      Type (max u v)
    An associative unital `R`-algebra is a semiring `A` equipped with a map into its center `R → A`.
    
    See the implementation notes in this file for discussion of the details of this definition.
    
    • SMul R A
    smul : R → A → A
    Inherited from
    1. SMul
    algebraMap : R →+* A
    Embedding `R →+* A` given by `Algebra` structure. 
    commutes' : ∀ (r : R) (x : A), (algebraMap R A) r * x = x * (algebraMap R A) r
    smul_def' : ∀ (r : R) (x : A), r • x = (algebraMap R A) r * x
  • class(extends 50, 54 methods)defined in Mathlib/Algebra/Field/Defs.lean
    complete
    class Field.{u} (K : Type u) : Type u
    class Field.{u} (K : Type u) : Type u
    A `Field` is a `CommRing` with multiplicative inverses for nonzero elements.
    
    An instance of `Field K` includes maps `ratCast : ℚ → K` and `qsmul : ℚ → K → K`.
    Those two fields are needed to implement the `DivisionRing K → Algebra ℚ K` instance since we need
    to control the specific definitions for some special cases of `K` (in particular `K = ℚ` itself).
    See also note [forgetful inheritance].
    
    If the field has positive characteristic `p`, our division by zero convention forces
    `ratCast (1 / p) = 1 / 0 = 0`. 
    • CommRing K
    • DivisionRing K
    zero : K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. Zero
    add : K → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. Add
    add_assoc : ∀ (a b c : K), a + b + c = a + (b + c)
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    zero_add : ∀ (a : K), 0 + a = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    add_zero : ∀ (a : K), a + 0 = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    nsmul : ℕ → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. NSMul
    nsmul_zero : ∀ (x : K), 0 • x = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    nsmul_succ : ∀ (n : ℕ) (x : K), (n + 1) • x = n • x + x
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    add_comm : ∀ (a b : K), a + b = b + a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    one : K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. One
    mul : K → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. Mul
    mul_assoc : ∀ (a b c : K), a * b * c = a * (b * c)
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    one_mul : ∀ (a : K), 1 * a = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    mul_one : ∀ (a : K), a * 1 = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    npow : ℕ → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. NPow
    npow_zero : ∀ (x : K), x ^ 0 = 1
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    npow_succ : ∀ (n : ℕ) (x : K), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    zero_mul : ∀ (a : K), 0 * a = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    mul_zero : ∀ (a : K), a * 0 = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    left_distrib : ∀ (a b c : K), a * (b + c) = a * b + a * c
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    right_distrib : ∀ (a b c : K), (a + b) * c = a * c + b * c
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    natCast : ℕ → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. NatCast
    natCast_zero : ↑0 = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    natCast_succ : ∀ (n : ℕ), ↑(n + 1) = ↑n + 1
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    neg : K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Neg
    sub : K → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Sub
    zsmul : ℤ → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. ZSMul
    sub_eq_add_neg : ∀ (a b : K), a - b = a + -b
    Inherited from
    1. CommRing
    2. Ring
    zsmul_zero' : ∀ (a : K), 0 • a = 0
    Inherited from
    1. CommRing
    2. Ring
    zsmul_succ' : ∀ (n : ℕ) (a : K), ↑n.succ • a = ↑n • a + a
    Inherited from
    1. CommRing
    2. Ring
    zsmul_neg' : ∀ (n : ℕ) (a : K), Int.negSucc n • a = -(↑n.succ • a)
    Inherited from
    1. CommRing
    2. Ring
    neg_add_cancel : ∀ (a : K), -a + a = 0
    Inherited from
    1. CommRing
    2. Ring
    intCast : ℤ → K
    Inherited from
    1. CommRing
    2. Ring
    3. IntCast
    intCast_ofNat : ∀ (n : ℕ), IntCast.intCast ↑n = ↑n
    Inherited from
    1. CommRing
    2. Ring
    intCast_negSucc : ∀ (n : ℕ), IntCast.intCast (Int.negSucc n) = -↑(n + 1)
    Inherited from
    1. CommRing
    2. Ring
    mul_comm : ∀ (a b : K), a * b = b * a
    Inherited from
    1. CommRing
    inv : K → K
    Inherited from
    1. Inv
    div : K → K → K
    Inherited from
    1. Div
    zpow : ℤ → K → K
    Inherited from
    1. ZPow
    div_eq_mul_inv : ∀ (a b : K), a / b = a * b⁻¹
    `a / b := a * b⁻¹` 
    zpow_zero' : ∀ (a : K), a ^ 0 = 1
    `a ^ 0 = 1` 
    zpow_succ' : ∀ (n : ℕ) (a : K), a ^ ↑n.succ = a ^ ↑n * a
    `a ^ (n + 1) = a ^ n * a` 
    zpow_neg' : ∀ (n : ℕ) (a : K), a ^ Int.negSucc n = (a ^ ↑n.succ)⁻¹
    `a ^ -(n + 1) = (a ^ (n + 1))⁻¹` 
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
    nnratCast : ℚ≥0 → K
    Inherited from
    1. NNRatCast
    ratCast : ℚ → K
    Inherited from
    1. RatCast
    mul_inv_cancel : ∀ (a : K), a ≠ 0 → a * a⁻¹ = 1
    For a nonzero `a`, `a⁻¹` is a right multiplicative inverse. 
    inv_zero : 0⁻¹ = 0
    The inverse of `0` is `0` by convention. 
    nnratCast_def : ∀ (q : ℚ≥0), ↑q = ↑q.num / ↑q.den
    However `NNRat.cast` is defined, it must be equal to `a / b`.
    
    Do not use this lemma directly. Use `NNRat.cast_def` instead. 
    nnqsmul : ℚ≥0 → K → K
    Scalar multiplication by a nonnegative rational number.
    
    Unless there is a risk of a `Module ℚ≥0 _` instance diamond, write `nnqsmul := _`. This will set
    `nnqsmul` to `(NNRat.cast · * ·)` thanks to unification in the default proof of `nnqsmul_def`.
    
    Do not use directly. Instead use the `•` notation. 
    nnqsmul_def : ∀ (q : ℚ≥0) (a : K), Field.nnqsmul q a = ↑q * a
    However `qsmul` is defined, it must be propositionally equal to multiplication by `Rat.cast`.
    
    Do not use this lemma directly. Use `NNRat.smul_def` instead. 
    ratCast_def : ∀ (q : ℚ), ↑q = ↑q.num / ↑q.den
    However `Rat.cast q` is defined, it must be propositionally equal to `q.num / q.den`.
    
    Do not use this lemma directly. Use `Rat.cast_def` instead. 
    qsmul : ℚ → K → K
    Scalar multiplication by a rational number.
    
    Unless there is a risk of a `Module ℚ _` instance diamond, write `qsmul := _`. This will set
    `qsmul` to `(Rat.cast · * ·)` thanks to unification in the default proof of `qsmul_def`.
    
    Do not use directly. Instead use the `•` notation. 
    qsmul_def : ∀ (a : ℚ) (x : K), Field.qsmul a x = ↑a * x
    However `qsmul` is defined, it must be propositionally equal to multiplication by `Rat.cast`.
    
    Do not use this lemma directly. Use `Rat.cast_def` instead. 
Definition1.1.26
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

Associate of an element. (LMFDB)

If R is a commutative ring, two elements x, y \in R are associates if there is a unit u \in R with y = ux. This defines an equivalence relation on the elements of R.

Tau Ceti Review: Associated, Associated.setoid.

Depends on: Definition 1.1.24 Definition 1.1.45

Lean code for Definition1.1.26●2 definitions
  • defdefined in Mathlib/Algebra/GroupWithZero/Associated.lean
    complete
    def Associated.{u_1} {M : Type u_1} [Monoid M] (x y : M) : Prop
    def Associated.{u_1} {M : Type u_1} [Monoid M]
      (x y : M) : Prop
    Two elements of a `Monoid` are `Associated` if one of them is another one
    multiplied by a unit on the right. 
  • defdefined in Mathlib/Algebra/GroupWithZero/Associated.lean
    complete
    def Associated.setoid.{u_2} (M : Type u_2) [Monoid M] : Setoid M
    def Associated.setoid.{u_2} (M : Type u_2)
      [Monoid M] : Setoid M
    The setoid of the relation `x ~ᵤ y` iff there is a unit `u` such that `x * u = y` 
Definition1.1.27
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.24
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 10
Reverse dependency previews
Preview
Definition 4.1.11
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Characteristic of a ring. (LMFDB)

The characteristic of a ring is the least positive integer n for which

\underbrace{1+\cdots + 1}_n = 0,

if such an n exists, and 0 otherwise. Equivalently, it is the exponent of the additive group of the ring.

The characteristic of a field k is either 0 or a prime number p, depending on whether the prime field of k is isomorphic to \Q or \F_p.

Tau Ceti Review: ringChar, CharP, CharP.addOrderOf_one, CharP.char_is_prime_or_zero.

Depends on: Definition 8.3.3 Definition 1.1.24 Definition 1.1.30

Lean code for Definition1.1.27●4 declarations
  • defdefined in Mathlib/Algebra/CharP/Defs.lean
    complete
    def ringChar.{u_1} (R : Type u_1) [NonAssocSemiring R] : ℕ
    def ringChar.{u_1} (R : Type u_1)
      [NonAssocSemiring R] : ℕ
    Noncomputable function that outputs the unique characteristic of a semiring. 
  • class(1 method)defined in Mathlib/Algebra/CharP/Defs.lean
    complete
    class CharP.{u_2} (R : Type u_2) [AddMonoidWithOne R] (p : outParam ℕ) : Prop
    class CharP.{u_2} (R : Type u_2)
      [AddMonoidWithOne R] (p : outParam ℕ) :
      Prop
    The generator of the kernel of the unique homomorphism ℕ → R for a semiring R.
    
    *Warning*: for a semiring `R`, `CharP R 0` and `CharZero R` need not coincide.
    * `CharP R 0` asks that only `0 : ℕ` maps to `0 : R` under the map `ℕ → R`;
    * `CharZero R` requires an injection `ℕ ↪ R`.
    
    For instance, endowing `{0, 1}` with addition given by `max` (i.e. `1` is absorbing), shows that
    `CharZero {0, 1}` does not hold and yet `CharP {0, 1} 0` does.
    This example is formalized in `Counterexamples/CharPZeroNeCharZero.lean`.
    
    cast_eq_zero_iff : ∀ (x : ℕ), ↑x = 0 ↔ p ∣ x
  • theoremdefined in Mathlib/GroupTheory/OrderOfElement.lean
    complete
    theorem CharP.addOrderOf_one.{u_6} (R : Type u_6) [NonAssocRing R] :
      CharP R (addOrderOf 1)
    theorem CharP.addOrderOf_one.{u_6} (R : Type u_6)
      [NonAssocRing R] :
      CharP R (addOrderOf 1)
  • theoremdefined in Mathlib/Algebra/CharP/Defs.lean
    complete
    theorem CharP.char_is_prime_or_zero.{u_1} (R : Type u_1) [NonAssocSemiring R]
      [NoZeroDivisors R] [Nontrivial R] (p : ℕ) [hc : CharP R p] :
      Nat.Prime p ∨ p = 0
    theorem CharP.char_is_prime_or_zero.{u_1}
      (R : Type u_1) [NonAssocSemiring R]
      [NoZeroDivisors R] [Nontrivial R]
      (p : ℕ) [hc : CharP R p] :
      Nat.Prime p ∨ p = 0
Definition1.1.28
Statement uses 10
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

Dedekind domain. (LMFDB)

A Dedekind domain D is a integral domain which is not a field such that

  1. D is Noetherian;

  2. every non-zero prime ideal is maximal;

  3. D is integrally closed.

The ring of integers of a number field is always a Dedekind domain, as is every discrete valuation ring.

In a Dedekind domain, every non-zero ideal I can be written as a product of non-zero prime ideals,

I=P_1P_2\cdots P_k,

and the product is unique up to the order of the factors. Repeated factors are often grouped, so we write I=Q_1^{e_1}\cdots Q_g^{e_g} where the Q_i are non-zero prime ideals of D.

In addition, every fractional ideal I is invertible in the sense that there exists a fractional ideal J such that IJ=D.

Tau Ceti Review: IsDedekindDomain.

Depends on: Definition 5.1.1 Definition 5.1.74 Definition 1.1.30 Definition 1.1.33 Definition 1.1.34 Definition 1.1.36 Definition 1.1.37 Definition 1.1.39 Definition 1.1.40 Definition 1.1.41

Lean code for Definition1.1.28●1 definition
  • class(extends 9, 7 methods)defined in Mathlib/RingTheory/DedekindDomain/Basic.lean
    complete
    class IsDedekindDomain.{u_2} (A : Type u_2) [CommRing A] : Prop
    class IsDedekindDomain.{u_2} (A : Type u_2)
      [CommRing A] : Prop
    A Dedekind domain is an integral domain that is Noetherian, integrally closed, and
    has Krull dimension at most one.
    
    This is definition 3.2 of [Neukirch1992].
    
    This is exactly `IsDedekindRing` plus the `IsDomain` hypothesis.
    
    The integral closure condition is independent of the choice of field of fractions:
    use `isDedekindDomain_iff` to prove `IsDedekindDomain` for a given `fraction_map`.
    
    See also `isDedekindDomain_iff_isDiscreteValuationRing_atPrime` and
    `isDedekindDomain_iff_mul_inv_cancel`. 
    • IsDomain A
    • IsDedekindRing A
    mul_left_cancel_of_ne_zero : ∀ {a : A}, a ≠ 0 → IsLeftRegular a
    Inherited from
    1. IsDomain
    2. IsCancelMulZero
    3. IsLeftCancelMulZero
    mul_right_cancel_of_ne_zero : ∀ {a : A}, a ≠ 0 → IsRightRegular a
    Inherited from
    1. IsDomain
    2. IsCancelMulZero
    3. IsRightCancelMulZero
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. IsDomain
    2. Nontrivial
    noetherian : ∀ (s : Submodule A A), s.FG
    Inherited from
    1. IsDedekindRing
    2. IsNoetherian
    maximalOfPrime : ∀ {p : Ideal A}, p ≠ ⊥ → p.IsPrime → p.IsMaximal
    Inherited from
    1. IsDedekindRing
    2. Ring.DimensionLEOne
    algebraMap_injective : Function.Injective ⇑(algebraMap A (FractionRing A))
    Inherited from
    1. IsDedekindRing
    2. IsIntegralClosure
    isIntegral_iff : ∀ {x : FractionRing A}, IsIntegral A x ↔ ∃ y, (algebraMap A (FractionRing A)) y = x
    Inherited from
    1. IsDedekindRing
    2. IsIntegralClosure
Definition1.1.29
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.36
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Euclidean domain. (LMFDB)

An Euclidean domain is an integral domain R with a function

\nu: R-\{0\}\to \Z_{\geq 0}

such that for all a\in R and all b\in R-\{0\}, there exists q,r\in R such that a=bq+r and r=0 or \nu(r)<\nu(b).

Euclidean domains are principal ideal domains, and hence, unique factorization domains.

Tau Ceti Review: EuclideanDomain.

Depends on: Definition 1.1.36 Definition 1.1.43 Definition 1.1.44

Lean code for Definition1.1.29●4 declarations
  • defdefined in LeanBridge/ForMathlib/Algebra/EuclideanDomain/NatEuclidean.lean
    complete
    def IsNatEuclidean.{u_1} (R : Type u_1) [CommRing R] : Prop
    def IsNatEuclidean.{u_1} (R : Type u_1)
      [CommRing R] : Prop
    A commutative ring `R` is **Euclidean** (LMFDB `ring.euclidean_domain`, for an integral domain
    `R`) if there is a function `ν : R → ℕ` such that for all `a` and all `b ≠ 0` there are `q` and `r`
    with `a = b q + r` and `r = 0` or `ν r < ν b`. The value `ν 0` plays no role, so `ν` is a function
    on `R ∖ {0}` as in the LMFDB. 
  • defdefined in LeanBridge/ForMathlib/Algebra/EuclideanDomain/NatEuclidean.lean
    complete
    def IsNatEuclidean.toEuclideanDomain.{u_1} {R : Type u_1} [CommRing R]
      [IsDomain R] (h : IsNatEuclidean R) : EuclideanDomain R
    def IsNatEuclidean.toEuclideanDomain.{u_1}
      {R : Type u_1} [CommRing R] [IsDomain R]
      (h : IsNatEuclidean R) :
      EuclideanDomain R
    The **Euclidean domain** structure (Mathlib's `EuclideanDomain`) of an integral domain that is
    Euclidean in the sense of the LMFDB (`IsNatEuclidean`), with the well-founded relation
    `ν' x < ν' y` for the modified Euclidean function `ν'` (`IsNatEuclidean.minFun`). 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/EuclideanDomain/NatEuclidean.lean
    complete
    theorem IsNatEuclidean.isPrincipalIdealRing.{u_1} {R : Type u_1} [CommRing R]
      [IsDomain R] (h : IsNatEuclidean R) : IsPrincipalIdealRing R
    theorem IsNatEuclidean.isPrincipalIdealRing.{u_1}
      {R : Type u_1} [CommRing R] [IsDomain R]
      (h : IsNatEuclidean R) :
      IsPrincipalIdealRing R
    **An LMFDB Euclidean domain is a principal ideal domain.** 
  • class(extends 43, 45 methods)defined in Mathlib/Algebra/EuclideanDomain/Defs.lean
    complete
    class EuclideanDomain.{u} (R : Type u) : Type u
    class EuclideanDomain.{u} (R : Type u) : Type u
    A `EuclideanDomain` is a non-trivial commutative ring with a division and a remainder,
    satisfying `b * (a / b) + a % b = a`.
    The definition of a Euclidean domain usually includes a valuation function `R → ℕ`.
    This definition is slightly generalised to include a well-founded relation
    `r` with the property that `r (a % b) b`, instead of a valuation. 
    • CommRing R
    • Nontrivial R
    zero : R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. Zero
    add : R → R → R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. Add
    add_assoc : ∀ (a b c : R), a + b + c = a + (b + c)
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    zero_add : ∀ (a : R), 0 + a = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    add_zero : ∀ (a : R), a + 0 = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    nsmul : ℕ → R → R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. NSMul
    nsmul_zero : ∀ (x : R), 0 • x = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    nsmul_succ : ∀ (n : ℕ) (x : R), (n + 1) • x = n • x + x
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    add_comm : ∀ (a b : R), a + b = b + a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    one : R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. One
    mul : R → R → R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. Mul
    mul_assoc : ∀ (a b c : R), a * b * c = a * (b * c)
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    one_mul : ∀ (a : R), 1 * a = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    mul_one : ∀ (a : R), a * 1 = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    npow : ℕ → R → R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. NPow
    npow_zero : ∀ (x : R), x ^ 0 = 1
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    npow_succ : ∀ (n : ℕ) (x : R), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    zero_mul : ∀ (a : R), 0 * a = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    mul_zero : ∀ (a : R), a * 0 = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    left_distrib : ∀ (a b c : R), a * (b + c) = a * b + a * c
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    right_distrib : ∀ (a b c : R), (a + b) * c = a * c + b * c
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    natCast : ℕ → R
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. NatCast
    natCast_zero : ↑0 = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    natCast_succ : ∀ (n : ℕ), ↑(n + 1) = ↑n + 1
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    neg : R → R
    Inherited from
    1. CommRing
    2. Ring
    3. Neg
    sub : R → R → R
    Inherited from
    1. CommRing
    2. Ring
    3. Sub
    zsmul : ℤ → R → R
    Inherited from
    1. CommRing
    2. Ring
    3. ZSMul
    sub_eq_add_neg : ∀ (a b : R), a - b = a + -b
    Inherited from
    1. CommRing
    2. Ring
    zsmul_zero' : ∀ (a : R), 0 • a = 0
    Inherited from
    1. CommRing
    2. Ring
    zsmul_succ' : ∀ (n : ℕ) (a : R), ↑n.succ • a = ↑n • a + a
    Inherited from
    1. CommRing
    2. Ring
    zsmul_neg' : ∀ (n : ℕ) (a : R), Int.negSucc n • a = -(↑n.succ • a)
    Inherited from
    1. CommRing
    2. Ring
    neg_add_cancel : ∀ (a : R), -a + a = 0
    Inherited from
    1. CommRing
    2. Ring
    intCast : ℤ → R
    Inherited from
    1. CommRing
    2. Ring
    3. IntCast
    intCast_ofNat : ∀ (n : ℕ), IntCast.intCast ↑n = ↑n
    Inherited from
    1. CommRing
    2. Ring
    intCast_negSucc : ∀ (n : ℕ), IntCast.intCast (Int.negSucc n) = -↑(n + 1)
    Inherited from
    1. CommRing
    2. Ring
    mul_comm : ∀ (a b : R), a * b = b * a
    Inherited from
    1. CommRing
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
    quotient : R → R → R
    A division function (denoted `/`) on `R`.
    This satisfies the property `b * (a / b) + a % b = a`, where `%` denotes `remainder`. 
    quotient_zero : ∀ (a : R), EuclideanDomain.quotient a 0 = 0
    Division by zero should always give zero by convention. 
    remainder : R → R → R
    A remainder function (denoted `%`) on `R`.
    This satisfies the property `b * (a / b) + a % b = a`, where `/` denotes `quotient`. 
    quotient_mul_add_remainder_eq : ∀ (a b : R), b * EuclideanDomain.quotient a b + EuclideanDomain.remainder a b = a
    The property that links the quotient and remainder functions.
    This allows us to compute GCDs and LCMs. 
    r : R → R → Prop
    A well-founded relation on `R`, satisfying `r (a % b) b`.
    This ensures that the GCD algorithm always terminates. 
    r_wellFounded : WellFounded EuclideanDomain.r
    The relation `r` must be well-founded.
    This ensures that the GCD algorithm always terminates. 
    remainder_lt : ∀ (a : R) {b : R}, b ≠ 0 → EuclideanDomain.r (EuclideanDomain.remainder a b) b
    The relation `r` satisfies `r (a % b) b`. 
    mul_left_not_lt : ∀ (a : R) {b : R}, b ≠ 0 → ¬EuclideanDomain.r (a * b) a
    An additional constraint on `r`. 
Definition1.1.30
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 27
Reverse dependency previews
Preview
Definition 1.1.25
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Field. (LMFDB)

A field is a commutative ring R such that 0_R\neq 1_R and every nonzero element of R has an inverse in R with respect to multiplication.

Tau Ceti Review: Field.

Depends on: Definition 1.1.6 Definition 1.1.24

Lean code for Definition1.1.30●1 definition
  • class(extends 50, 54 methods)defined in Mathlib/Algebra/Field/Defs.lean
    complete
    class Field.{u} (K : Type u) : Type u
    class Field.{u} (K : Type u) : Type u
    A `Field` is a `CommRing` with multiplicative inverses for nonzero elements.
    
    An instance of `Field K` includes maps `ratCast : ℚ → K` and `qsmul : ℚ → K → K`.
    Those two fields are needed to implement the `DivisionRing K → Algebra ℚ K` instance since we need
    to control the specific definitions for some special cases of `K` (in particular `K = ℚ` itself).
    See also note [forgetful inheritance].
    
    If the field has positive characteristic `p`, our division by zero convention forces
    `ratCast (1 / p) = 1 / 0 = 0`. 
    • CommRing K
    • DivisionRing K
    zero : K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. Zero
    add : K → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. Add
    add_assoc : ∀ (a b c : K), a + b + c = a + (b + c)
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    zero_add : ∀ (a : K), 0 + a = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    add_zero : ∀ (a : K), a + 0 = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    nsmul : ℕ → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    6. NSMul
    nsmul_zero : ∀ (x : K), 0 • x = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    nsmul_succ : ∀ (n : ℕ) (x : K), (n + 1) • x = n • x + x
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    5. AddMonoid
    add_comm : ∀ (a b : K), a + b = b + a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. AddCommMonoid
    one : K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. One
    mul : K → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. Mul
    mul_assoc : ∀ (a b c : K), a * b * c = a * (b * c)
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    one_mul : ∀ (a : K), 1 * a = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    mul_one : ∀ (a : K), a * 1 = a
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    npow : ℕ → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    5. NPow
    npow_zero : ∀ (x : K), x ^ 0 = 1
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    npow_succ : ∀ (n : ℕ) (x : K), x ^ (n + 1) = x ^ n * x
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. Monoid
    zero_mul : ∀ (a : K), 0 * a = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    mul_zero : ∀ (a : K), a * 0 = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    left_distrib : ∀ (a b c : K), a * (b + c) = a * b + a * c
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    right_distrib : ∀ (a b c : K), (a + b) * c = a * c + b * c
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    natCast : ℕ → K
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    4. NatCast
    natCast_zero : ↑0 = 0
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    natCast_succ : ∀ (n : ℕ), ↑(n + 1) = ↑n + 1
    Inherited from
    1. CommRing
    2. Ring
    3. Semiring
    neg : K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Neg
    sub : K → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. Sub
    zsmul : ℤ → K → K
    Inherited from
    1. CommRing
    2. Ring
    3. ZSMul
    sub_eq_add_neg : ∀ (a b : K), a - b = a + -b
    Inherited from
    1. CommRing
    2. Ring
    zsmul_zero' : ∀ (a : K), 0 • a = 0
    Inherited from
    1. CommRing
    2. Ring
    zsmul_succ' : ∀ (n : ℕ) (a : K), ↑n.succ • a = ↑n • a + a
    Inherited from
    1. CommRing
    2. Ring
    zsmul_neg' : ∀ (n : ℕ) (a : K), Int.negSucc n • a = -(↑n.succ • a)
    Inherited from
    1. CommRing
    2. Ring
    neg_add_cancel : ∀ (a : K), -a + a = 0
    Inherited from
    1. CommRing
    2. Ring
    intCast : ℤ → K
    Inherited from
    1. CommRing
    2. Ring
    3. IntCast
    intCast_ofNat : ∀ (n : ℕ), IntCast.intCast ↑n = ↑n
    Inherited from
    1. CommRing
    2. Ring
    intCast_negSucc : ∀ (n : ℕ), IntCast.intCast (Int.negSucc n) = -↑(n + 1)
    Inherited from
    1. CommRing
    2. Ring
    mul_comm : ∀ (a b : K), a * b = b * a
    Inherited from
    1. CommRing
    inv : K → K
    Inherited from
    1. Inv
    div : K → K → K
    Inherited from
    1. Div
    zpow : ℤ → K → K
    Inherited from
    1. ZPow
    div_eq_mul_inv : ∀ (a b : K), a / b = a * b⁻¹
    `a / b := a * b⁻¹` 
    zpow_zero' : ∀ (a : K), a ^ 0 = 1
    `a ^ 0 = 1` 
    zpow_succ' : ∀ (n : ℕ) (a : K), a ^ ↑n.succ = a ^ ↑n * a
    `a ^ (n + 1) = a ^ n * a` 
    zpow_neg' : ∀ (n : ℕ) (a : K), a ^ Int.negSucc n = (a ^ ↑n.succ)⁻¹
    `a ^ -(n + 1) = (a ^ (n + 1))⁻¹` 
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
    nnratCast : ℚ≥0 → K
    Inherited from
    1. NNRatCast
    ratCast : ℚ → K
    Inherited from
    1. RatCast
    mul_inv_cancel : ∀ (a : K), a ≠ 0 → a * a⁻¹ = 1
    For a nonzero `a`, `a⁻¹` is a right multiplicative inverse. 
    inv_zero : 0⁻¹ = 0
    The inverse of `0` is `0` by convention. 
    nnratCast_def : ∀ (q : ℚ≥0), ↑q = ↑q.num / ↑q.den
    However `NNRat.cast` is defined, it must be equal to `a / b`.
    
    Do not use this lemma directly. Use `NNRat.cast_def` instead. 
    nnqsmul : ℚ≥0 → K → K
    Scalar multiplication by a nonnegative rational number.
    
    Unless there is a risk of a `Module ℚ≥0 _` instance diamond, write `nnqsmul := _`. This will set
    `nnqsmul` to `(NNRat.cast · * ·)` thanks to unification in the default proof of `nnqsmul_def`.
    
    Do not use directly. Instead use the `•` notation. 
    nnqsmul_def : ∀ (q : ℚ≥0) (a : K), Field.nnqsmul q a = ↑q * a
    However `qsmul` is defined, it must be propositionally equal to multiplication by `Rat.cast`.
    
    Do not use this lemma directly. Use `NNRat.smul_def` instead. 
    ratCast_def : ∀ (q : ℚ), ↑q = ↑q.num / ↑q.den
    However `Rat.cast q` is defined, it must be propositionally equal to `q.num / q.den`.
    
    Do not use this lemma directly. Use `Rat.cast_def` instead. 
    qsmul : ℚ → K → K
    Scalar multiplication by a rational number.
    
    Unless there is a risk of a `Module ℚ _` instance diamond, write `qsmul := _`. This will set
    `qsmul` to `(Rat.cast · * ·)` thanks to unification in the default proof of `qsmul_def`.
    
    Do not use directly. Instead use the `•` notation. 
    qsmul_def : ∀ (a : ℚ) (x : K), Field.qsmul a x = ↑a * x
    However `qsmul` is defined, it must be propositionally equal to multiplication by `Rat.cast`.
    
    Do not use this lemma directly. Use `Rat.cast_def` instead. 
Definition1.1.31
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 5
Reverse dependency previews
Preview
Definition 1.1.33
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Field of fractions of an integral domain. (LMFDB)

If R is an integral domain, then its field of fractions F is the smallest field containing R.

It can be constructed by mimicking the set of fractions a/b where a,b\in R with b\neq 0 following the usual rules for fraction arithmetic. It is unique, up to unique isomorphism.

Tau Ceti Review: FractionRing, IsFractionRing, FractionRing.field, IsFractionRing.lift, FractionRing.algEquiv.

Depends on: Definition 1.1.30 Definition 1.1.32 Definition 1.1.36

Lean code for Definition1.1.31●5 definitions
  • abbrevdefined in Mathlib/RingTheory/Localization/FractionRing.lean
    complete
    abbrev FractionRing.{u_1} (R : Type u_1) [CommRing R] : Type u_1
    abbrev FractionRing.{u_1} (R : Type u_1)
      [CommRing R] : Type u_1
    The fraction ring of a commutative ring `R` as a quotient type.
    
    We instantiate this definition as generally as possible, and assume that the
    commutative ring `R` is an integral domain only when this is needed for proving.
    
    In this generality, this construction is also known as the *total fraction ring* of `R`.
    
  • abbrevdefined in Mathlib/RingTheory/Localization/FractionRing.lean
    complete
    abbrev IsFractionRing.{u_6, u_7} (R : Type u_6) [CommSemiring R] (K : Type u_7)
      [CommSemiring K] [Algebra R K] : Prop
    abbrev IsFractionRing.{u_6, u_7} (R : Type u_6)
      [CommSemiring R] (K : Type u_7)
      [CommSemiring K] [Algebra R K] : Prop
    `IsFractionRing R K` states `K` is the ring of fractions of a commutative ring `R`. 
  • defdefined in Mathlib/RingTheory/Localization/FractionRing.lean
    complete
    def FractionRing.field.{u_4} (A : Type u_4) [CommRing A] [IsDomain A] :
      Field (FractionRing A)
    def FractionRing.field.{u_4} (A : Type u_4)
      [CommRing A] [IsDomain A] :
      Field (FractionRing A)
  • defdefined in Mathlib/RingTheory/Localization/FractionRing.lean
    complete
    def IsFractionRing.lift.{u_4, u_5, u_7} {A : Type u_4} [CommRing A]
      {K : Type u_5} [Field K] {L : Type u_7} [Field L] [Algebra A K]
      [IsFractionRing A K] {g : A →+* L} (hg : Function.Injective ⇑g) :
      K →+* L
    def IsFractionRing.lift.{u_4, u_5, u_7}
      {A : Type u_4} [CommRing A]
      {K : Type u_5} [Field K] {L : Type u_7}
      [Field L] [Algebra A K]
      [IsFractionRing A K] {g : A →+* L}
      (hg : Function.Injective ⇑g) : K →+* L
    Given a commutative ring `A` with field of fractions `K`,
    and an injective ring hom `g : A →+* L` where `L` is a field, we get a
    field hom sending `z : K` to `g x * (g y)⁻¹`, where `(x, y) : A × (NonZeroDivisors A)` are
    such that `z = f x * (f y)⁻¹`. 
  • defdefined in Mathlib/RingTheory/Localization/FractionRing.lean
    complete
    def FractionRing.algEquiv.{u_4, u_6} (A : Type u_4) [CommRing A]
      (K : Type u_6) [CommRing K] [Algebra A K] [IsFractionRing A K] :
      FractionRing A ≃ₐ[A] K
    def FractionRing.algEquiv.{u_4, u_6}
      (A : Type u_4) [CommRing A]
      (K : Type u_6) [CommRing K]
      [Algebra A K] [IsFractionRing A K] :
      FractionRing A ≃ₐ[A] K
    Given a ring `A` and a localization map to a fraction ring
    `f : A →+* K`, we get an `A`-isomorphism between the fraction ring of `A` as a quotient
    type and `K`. 
Definition1.1.32
uses 1used by 1✓L∃∀N

Field of fractions (mathlib). (LMFDB)

This is also defined in mathlib as Fraction Ring, which is the localisation at the non-zero divisors of your ring. When your ring R is a commutative ring and an integral domain then gets the fact that this is a field.

Tau Ceti Review: FractionRing.

Depends on: Definition 1.1.24

Lean code for Definition1.1.32●1 definition
  • abbrevdefined in Mathlib/RingTheory/Localization/FractionRing.lean
    complete
    abbrev FractionRing.{u_1} (R : Type u_1) [CommRing R] : Type u_1
    abbrev FractionRing.{u_1} (R : Type u_1)
      [CommRing R] : Type u_1
    The fraction ring of a commutative ring `R` as a quotient type.
    
    We instantiate this definition as generally as possible, and assume that the
    commutative ring `R` is an integral domain only when this is needed for proving.
    
    In this generality, this construction is also known as the *total fraction ring* of `R`.
    
Definition1.1.33
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.31
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Fractional ideal. (LMFDB)

If R is an integral domain with field of fractions K, then a fractional ideal I of R is an R-submodule of K such that there exists d\in R-\{0\} with dI=\{da\mid a\in I\} \subseteq R\,.

Tau Ceti Review: FractionalIdeal.

Depends on: Definition 1.1.31 Definition 1.1.36

Lean code for Definition1.1.33●1 definition
  • defdefined in Mathlib/RingTheory/FractionalIdeal/Basic.lean
    complete
    def FractionalIdeal.{u_1, u_2} {R : Type u_1} [CommRing R] (S : Submonoid R)
      (P : Type u_2) [CommRing P] [Algebra R P] : Type u_2
    def FractionalIdeal.{u_1, u_2} {R : Type u_1}
      [CommRing R] (S : Submonoid R)
      (P : Type u_2) [CommRing P]
      [Algebra R P] : Type u_2
    The fractional ideals of a domain `R` are ideals of `R` divided by some `a ∈ R`.
    
    More precisely, let `P` be a localization of `R` at some submonoid `S`,
    then a fractional ideal `I ⊆ P` is an `R`-submodule of `P`,
    such that there is an `a ∈ S` with `a I ⊆ R`.
    
Definition1.1.34
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 6
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Ideal of a ring. (LMFDB)

If R is a ring, a subset I\subseteq R is an ideal of R if I is a subgroup of R for + and for all a\in I and all r\in R,

r\cdot a\in I \qquad\text{and}\qquad a\cdot r\in I.

In a polynomial ring R[X_1,\dots,X_n], an ideal is homogeneous if it can be generated by homogeneous polynomials.

Tau Ceti Review: TwoSidedIdeal, Ideal.IsHomogeneous.

Depends on: Definition 8.3.160 Definition 1.1.24

Lean code for Definition1.1.34●8 declarations
  • structure(1 field)defined in Mathlib/RingTheory/TwoSidedIdeal/Basic.lean
    complete
    structure TwoSidedIdeal.{u_1} (R : Type u_1) [NonUnitalNonAssocRing R] : Type u_1
    structure TwoSidedIdeal.{u_1} (R : Type u_1)
      [NonUnitalNonAssocRing R] : Type u_1
    A two-sided ideal of a ring `R` is a subset of `R` that contains `0` and is closed under addition,
    negation, and absorbs multiplication on both sides.
    
    ringCon : RingCon R
    The congruence relation induced by this ideal. 
  • defdefined in LeanBridge/ForMathlib/RingTheory/TwoSidedIdeal/Homogeneous.lean
    complete
    def TwoSidedIdeal.IsHomogeneous.{u_1, u_2, u_3} {ι : Type u_1}
      {B : Type u_2} {A : Type u_3} [Ring A] [SetLike B A] (𝒜 : ι → B)
      (I : TwoSidedIdeal A) : Prop
    def TwoSidedIdeal.IsHomogeneous.{u_1, u_2,
        u_3}
      {ι : Type u_1} {B : Type u_2}
      {A : Type u_3} [Ring A] [SetLike B A]
      (𝒜 : ι → B) (I : TwoSidedIdeal A) : Prop
    A two-sided ideal `I` of a ring `A` is **homogeneous** (LMFDB `ring.ideal`) for a family `𝒜` of
    subsets of `A`, whose members are the homogeneous elements of each degree, if it is generated as a
    two-sided ideal by homogeneous elements. For the polynomial ring `R[X_i : i ∈ σ]` over a ring `R`
    graded by degree, `𝒜` is `AddMonoidAlgebra.homogeneousSubmodule R σ`. 
  • abbrevdefined in LeanBridge/ForMathlib/RingTheory/TwoSidedIdeal/Homogeneous.lean
    complete
    abbrev AddMonoidAlgebra.homogeneousSubmodule.{u_1, u_2} (R : Type u_1)
      (σ : Type u_2) [Semiring R] (n : ℕ) :
      Submodule R (AddMonoidAlgebra R (σ →₀ ℕ))
    abbrev AddMonoidAlgebra.homogeneousSubmodule.{u_1,
        u_2}
      (R : Type u_1) (σ : Type u_2)
      [Semiring R] (n : ℕ) :
      Submodule R
        (AddMonoidAlgebra R (σ →₀ ℕ))
    The **homogeneous polynomials of degree `n`** (LMFDB `ring.ideal`) in the polynomial ring
    `R[X_i : i ∈ σ] = AddMonoidAlgebra R (σ →₀ ℕ)` over a not necessarily commutative semiring `R`:
    the polynomials all of whose monomials have total degree `n`. For `R` commutative this is
    Mathlib's `MvPolynomial.homogeneousSubmodule σ R n`
    (`AddMonoidAlgebra.homogeneousSubmodule_eq`). 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/TwoSidedIdeal/Homogeneous.lean
    complete
    theorem TwoSidedIdeal.isHomogeneous_homogeneousSubmodule_iff.{u_1, u_2}
      {R : Type u_1} {σ : Type u_2} [CommRing R]
      (I : TwoSidedIdeal (MvPolynomial σ R)) :
      TwoSidedIdeal.IsHomogeneous
          (AddMonoidAlgebra.homogeneousSubmodule R σ) I ↔
        Ideal.IsHomogeneous (MvPolynomial.homogeneousSubmodule σ R)
          (TwoSidedIdeal.asIdeal I)
    theorem TwoSidedIdeal.isHomogeneous_homogeneousSubmodule_iff.{u_1,
        u_2}
      {R : Type u_1} {σ : Type u_2}
      [CommRing R]
      (I : TwoSidedIdeal (MvPolynomial σ R)) :
      TwoSidedIdeal.IsHomogeneous
          (AddMonoidAlgebra.homogeneousSubmodule
            R σ)
          I ↔
        Ideal.IsHomogeneous
          (MvPolynomial.homogeneousSubmodule σ
            R)
          (TwoSidedIdeal.asIdeal I)
    **Homogeneous ideals of polynomial rings over a commutative ring** (LMFDB `ring.ideal`): for a
    commutative ring `R`, a two-sided ideal of `R[X_i : i ∈ σ]` is generated by homogeneous polynomials
    exactly when it is a homogeneous ideal of `MvPolynomial σ R` in Mathlib's sense, which contains the
    homogeneous components of its elements. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/TwoSidedIdeal/Homogeneous.lean
    complete
    theorem TwoSidedIdeal.isHomogeneous_iff_isHomogeneous_asIdeal.{u_1, u_2, u_3}
      {ι : Type u_1} {B : Type u_2} {A : Type u_3} [CommRing A]
      [SetLike B A] [AddSubmonoidClass B A] (𝒜 : ι → B) [DecidableEq ι]
      [AddMonoid ι] [GradedRing 𝒜] (I : TwoSidedIdeal A) :
      TwoSidedIdeal.IsHomogeneous 𝒜 I ↔
        Ideal.IsHomogeneous 𝒜 (TwoSidedIdeal.asIdeal I)
    theorem TwoSidedIdeal.isHomogeneous_iff_isHomogeneous_asIdeal.{u_1,
        u_2, u_3}
      {ι : Type u_1} {B : Type u_2}
      {A : Type u_3} [CommRing A]
      [SetLike B A] [AddSubmonoidClass B A]
      (𝒜 : ι → B) [DecidableEq ι]
      [AddMonoid ι] [GradedRing 𝒜]
      (I : TwoSidedIdeal A) :
      TwoSidedIdeal.IsHomogeneous 𝒜 I ↔
        Ideal.IsHomogeneous 𝒜
          (TwoSidedIdeal.asIdeal I)
    **Over a commutative graded ring, the two-sided ideals generated by homogeneous elements are
    the homogeneous ideals**: a two-sided ideal is generated by homogeneous elements exactly when the
    corresponding ideal (`TwoSidedIdeal.orderIsoIdeal`) contains the homogeneous components of its
    elements. 
  • defdefined in Mathlib/RingTheory/TwoSidedIdeal/Operations.lean
    complete
    def TwoSidedIdeal.orderIsoIdeal.{u_1} {R : Type u_1} [CommRing R] :
      TwoSidedIdeal R ≃o Ideal R
    def TwoSidedIdeal.orderIsoIdeal.{u_1}
      {R : Type u_1} [CommRing R] :
      TwoSidedIdeal R ≃o Ideal R
    When the ring is commutative, two-sided ideals are exactly the same as left ideals.
    
  • abbrevdefined in Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean
    complete
    abbrev Ideal.IsHomogeneous.{u_1, u_2, u_3} {ι : Type u_1} {σ : Type u_2}
      {A : Type u_3} [Semiring A] [SetLike σ A] [AddSubmonoidClass σ A]
      (𝒜 : ι → σ) [DecidableEq ι] [AddMonoid ι] [GradedRing 𝒜]
      (I : Ideal A) : Prop
    abbrev Ideal.IsHomogeneous.{u_1, u_2, u_3}
      {ι : Type u_1} {σ : Type u_2}
      {A : Type u_3} [Semiring A]
      [SetLike σ A] [AddSubmonoidClass σ A]
      (𝒜 : ι → σ) [DecidableEq ι]
      [AddMonoid ι] [GradedRing 𝒜]
      (I : Ideal A) : Prop
    An `I : Ideal A` is homogeneous if for every `r ∈ I`, all homogeneous components
    of `r` are in `I`. 
  • theoremdefined in Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean
    complete
    theorem Ideal.IsHomogeneous.iff_exists.{u_1, u_2, u_3} {ι : Type u_1}
      {σ : Type u_2} {A : Type u_3} [Semiring A] [SetLike σ A]
      [AddSubmonoidClass σ A] (𝒜 : ι → σ) [DecidableEq ι] [AddMonoid ι]
      [GradedRing 𝒜] (I : Ideal A) :
      Ideal.IsHomogeneous 𝒜 I ↔ ∃ S, I = Ideal.span (Subtype.val '' S)
    theorem Ideal.IsHomogeneous.iff_exists.{u_1, u_2,
        u_3}
      {ι : Type u_1} {σ : Type u_2}
      {A : Type u_3} [Semiring A]
      [SetLike σ A] [AddSubmonoidClass σ A]
      (𝒜 : ι → σ) [DecidableEq ι]
      [AddMonoid ι] [GradedRing 𝒜]
      (I : Ideal A) :
      Ideal.IsHomogeneous 𝒜 I ↔
        ∃ S, I = Ideal.span (Subtype.val '' S)
Definition1.1.35
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 1.1.37
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Integral element of a ring. (LMFDB)

If R\subseteq S are commutative rings, an element s\in S is integral over R if there exists n\in\Z^+ and a_i\in R such that

s^n+a_{n-1} s^{n-1}+\cdots + a_0 =0\,.

The integral closure of R in S is \{s\in S\mid s \text{ is integral over } R\}.

Tau Ceti Review: IsIntegral, integralClosure.

Depends on: Definition 1.1.24

Lean code for Definition1.1.35●2 definitions
  • defdefined in Mathlib/RingTheory/IntegralClosure/IsIntegral/Defs.lean
    complete
    def IsIntegral.{u_1, u_3} (R : Type u_1) {A : Type u_3} [CommRing R]
      [Ring A] [Algebra R A] (x : A) : Prop
    def IsIntegral.{u_1, u_3} (R : Type u_1)
      {A : Type u_3} [CommRing R] [Ring A]
      [Algebra R A] (x : A) : Prop
    An element `x` of an algebra `A` over a commutative ring `R` is said to be *integral*,
    if it is a root of some monic polynomial `p : R[X]`.
    Equivalently, the element is integral over `R` with respect to the induced `algebraMap` 
  • defdefined in Mathlib/RingTheory/IntegralClosure/Algebra/Basic.lean
    complete
    def integralClosure.{u_1, u_2} (R : Type u_1) (A : Type u_2) [CommRing R]
      [CommRing A] [Algebra R A] : Subalgebra R A
    def integralClosure.{u_1, u_2} (R : Type u_1)
      (A : Type u_2) [CommRing R] [CommRing A]
      [Algebra R A] : Subalgebra R A
    The integral closure of `R` in an `R`-algebra `A`. 
Definition1.1.36
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 9
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Integral domain. (LMFDB)

An integral domain is a commutative ring R such that 1_R\neq 0_R and R contains no zero divisors.

Tau Ceti Review: IsDomain.

Depends on: Definition 1.1.24 Definition 1.1.46

Lean code for Definition1.1.36●1 definition
  • class(extends 4, 3 methods)defined in Mathlib/Algebra/Ring/Defs.lean
    complete
    class IsDomain.{u} (α : Type u) [Semiring α] : Prop
    class IsDomain.{u} (α : Type u) [Semiring α] :
      Prop
    A domain is a nontrivial semiring such that multiplication by a nonzero element
    is cancellative on both sides. In other words, a nontrivial semiring `R` satisfying
    `∀ {a b c : R}, a ≠ 0 → a * b = a * c → b = c` and
    `∀ {a b c : R}, b ≠ 0 → a * b = c * b → a = c`.
    
    This is implemented as a mixin for `Semiring α`.
    To obtain an integral domain use `[CommRing α] [IsDomain α]`. 
    • IsCancelMulZero α
    • Nontrivial α
    mul_left_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsLeftRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsLeftCancelMulZero
    mul_right_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsRightRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsRightCancelMulZero
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
Definition1.1.37
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.31
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Integrally closed. (LMFDB)

Let R be an integral domain and F its field of fractions. Then R is integrally closed if R equals the integral closure of R in F.

Tau Ceti Review: IsIntegrallyClosed.

Depends on: Definition 1.1.31 Definition 1.1.35 Definition 1.1.36

Lean code for Definition1.1.37●1 definition
  • abbrevdefined in Mathlib/RingTheory/IntegralClosure/IntegrallyClosed.lean
    complete
    abbrev IsIntegrallyClosed.{u_1} (R : Type u_1) [CommRing R] : Prop
    abbrev IsIntegrallyClosed.{u_1} (R : Type u_1)
      [CommRing R] : Prop
    `R` is integrally closed if all integral elements of `Frac(R)` are also elements of `R`.
    
    This definition uses `FractionRing R` to denote `Frac(R)`. See `isIntegrallyClosed_iff`
    if you want to choose another field of fractions for `R`.
    
Definition1.1.38
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 3
Reverse dependency previews
Preview
Definition 1.1.44
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Irreducible element. (LMFDB)

An element x \ne 0 of a commutative ring R is irreducible if it is not a unit and has the property that whenever x=yz for some y,z \in R, either y or z is a unit.

Tau Ceti Review: Irreducible.

Depends on: Definition 1.1.24 Definition 1.1.45

Lean code for Definition1.1.38●1 definition
  • structure(2 fields)defined in Mathlib/Algebra/Group/Irreducible/Defs.lean
    complete
    structure Irreducible.{u_1} {M : Type u_1} [Monoid M] (p : M) : Prop
    structure Irreducible.{u_1} {M : Type u_1}
      [Monoid M] (p : M) : Prop
    `Irreducible p` states that `p` is non-unit and only factors into units.
    
    We explicitly avoid stating that `p` is non-zero, this would require a semiring. Assuming only a
    monoid allows us to reuse irreducible for associated elements. 
    
    [Wikidata Q2989575](https://www.wikidata.org/wiki/Q2989575)
    not_isUnit : ¬IsUnit p
    An irreducible element is not a unit. 
    isUnit_or_isUnit : ∀ ⦃a b : M⦄, p = a * b → IsUnit a ∨ IsUnit b
    If an irreducible element factors, then one factor is a unit. 
Definition1.1.39
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 2
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Maximal ideal. (LMFDB)

In a ring R, an ideal M is maximal if M\neq R and for all ideals I of R,

M\subseteq I \subseteq R\implies M=I\quad\text{or}\quad I=R.

Tau Ceti Review: Ideal.IsMaximal.

Depends on: Definition 1.1.24 Definition 1.1.34

Lean code for Definition1.1.39●1 definition
  • class(1 method)defined in Mathlib/RingTheory/Ideal/Maximal.lean
    complete
    class Ideal.IsMaximal.{u} {α : Type u} [Semiring α] (I : Ideal α) : Prop
    class Ideal.IsMaximal.{u} {α : Type u}
      [Semiring α] (I : Ideal α) : Prop
    An ideal is maximal if it is maximal in the collection of proper ideals. 
    out : IsCoatom I
    The maximal ideal is a coatom in the ordering on ideals; that is, it is not the entire ring,
    and there are no other proper ideals strictly containing it. 
Definition1.1.40
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

Noetherian ring. (LMFDB)

A commutative ring R is Noetherian if for every ascending chain of ideals

I_1\subseteq I_2\subseteq I_3\subseteq \cdots

there exists N such that for all n\geq N, I_n=I_N.

Tau Ceti Review: IsNoetherianRing.

Depends on: Definition 1.1.24 Definition 1.1.34

Lean code for Definition1.1.40●1 definition
  • abbrevdefined in Mathlib/RingTheory/Noetherian/Defs.lean
    complete
    abbrev IsNoetherianRing.{u_1} (R : Type u_1) [Semiring R] : Prop
    abbrev IsNoetherianRing.{u_1} (R : Type u_1)
      [Semiring R] : Prop
    A (semi)ring is Noetherian if it is Noetherian as a module over itself,
    i.e. all its ideals are finitely generated. 
Definition1.1.41
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 4
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Prime ideal. (LMFDB)

If R is a commutative ring R, an ideal I \ne R is prime if for all a,b\in R,

ab\in I \implies a\in I \quad \text{or}\quad b\in I.

Tau Ceti Review: Ideal.IsPrime.

Depends on: Definition 1.1.24 Definition 1.1.34

Lean code for Definition1.1.41●1 definition
  • class(2 methods)defined in Mathlib/RingTheory/Ideal/Prime.lean
    complete
    class Ideal.IsPrime.{u} {α : Type u} [Semiring α] (I : Ideal α) : Prop
    class Ideal.IsPrime.{u} {α : Type u}
      [Semiring α] (I : Ideal α) : Prop
    An ideal `P` of a ring `R` is prime if `P ≠ R` and `xy ∈ P → x ∈ P ∨ y ∈ P` 
    ne_top' : I ≠ ⊤
    The prime ideal is not the entire ring. 
    mem_or_mem' : ∀ {x y : α}, x * y ∈ I → x ∈ I ∨ y ∈ I
    If a product lies in the prime ideal, then at least one element lies in the prime ideal. 
Definition1.1.42
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.31
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Principal fractional ideal. (LMFDB)

Let R be an integral domain with field of fractions K. If a\in K^\times, then the principal fractional ideal generated by a is the set

\{ar\mid r\in R\}\,.

Tau Ceti Review: FractionalIdeal.spanSingleton, toPrincipalIdeal, FractionalIdeal.mem_spanSingleton.

Depends on: Definition 1.1.31 Definition 1.1.36

Lean code for Definition1.1.42●3 declarations
  • defdefined in Mathlib/RingTheory/FractionalIdeal/Operations.lean
    complete
    def FractionalIdeal.spanSingleton.{u_1, u_2} {R : Type u_1} [CommRing R]
      (S : Submonoid R) {P : Type u_2} [CommRing P] [Algebra R P]
      [IsLocalization S P] : P →*₀ FractionalIdeal S P
    def FractionalIdeal.spanSingleton.{u_1, u_2}
      {R : Type u_1} [CommRing R]
      (S : Submonoid R) {P : Type u_2}
      [CommRing P] [Algebra R P]
      [IsLocalization S P] :
      P →*₀ FractionalIdeal S P
    `spanSingleton S x` is the fractional ideal generated by `x`, as a monoid with zero
    homomorphism from `P` to `FractionalIdeal S P`. 
  • defdefined in Mathlib/RingTheory/ClassGroup/Basic.lean
    complete
    def toPrincipalIdeal.{u_3, u_4} (R : Type u_3) (K : Type u_4) [CommRing R]
      [Field K] [Algebra R K] [IsFractionRing R K] :
      Kˣ →* (FractionalIdeal (nonZeroDivisors R) K)ˣ
    def toPrincipalIdeal.{u_3, u_4} (R : Type u_3)
      (K : Type u_4) [CommRing R] [Field K]
      [Algebra R K] [IsFractionRing R K] :
      Kˣ →*
        (FractionalIdeal (nonZeroDivisors R)
            K)ˣ
    `toPrincipalIdeal R K x` sends `x ≠ 0 : K` to the fractional `R`-ideal generated by `x` 
  • theoremdefined in Mathlib/RingTheory/FractionalIdeal/Operations.lean
    complete
    theorem FractionalIdeal.mem_spanSingleton.{u_1, u_2} {R : Type u_1} [CommRing R]
      (S : Submonoid R) {P : Type u_2} [CommRing P] [Algebra R P]
      [IsLocalization S P] {x y : P} :
      x ∈ (FractionalIdeal.spanSingleton S) y ↔ ∃ z, z • y = x
    theorem FractionalIdeal.mem_spanSingleton.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      (S : Submonoid R) {P : Type u_2}
      [CommRing P] [Algebra R P]
      [IsLocalization S P] {x y : P} :
      x ∈
          (FractionalIdeal.spanSingleton S)
            y ↔
        ∃ z, z • y = x
Definition1.1.43
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.36
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Principal ideal domain. (LMFDB)

A principal ideal domain, or PID, is an integral domain R such that every ideal of R is of the form \langle a\rangle for some a\in R.

Every such ring is a unique factorization domain.

Tau Ceti Review: IsPrincipalIdealRing, IsDomain, PrincipalIdealRing.to_uniqueFactorizationMonoid.

Depends on: Definition 1.1.36 Definition 1.1.44

Lean code for Definition1.1.43●3 declarations
  • class(1 method)defined in Mathlib/RingTheory/Ideal/Span.lean
    complete
    class IsPrincipalIdealRing.{u} (R : Type u) [Semiring R] : Prop
    class IsPrincipalIdealRing.{u} (R : Type u)
      [Semiring R] : Prop
    A ring is a principal ideal ring if all (left) ideals are principal. 
    principal : ∀ (S : Ideal R), Submodule.IsPrincipal S
  • class(extends 4, 3 methods)defined in Mathlib/Algebra/Ring/Defs.lean
    complete
    class IsDomain.{u} (α : Type u) [Semiring α] : Prop
    class IsDomain.{u} (α : Type u) [Semiring α] :
      Prop
    A domain is a nontrivial semiring such that multiplication by a nonzero element
    is cancellative on both sides. In other words, a nontrivial semiring `R` satisfying
    `∀ {a b c : R}, a ≠ 0 → a * b = a * c → b = c` and
    `∀ {a b c : R}, b ≠ 0 → a * b = c * b → a = c`.
    
    This is implemented as a mixin for `Semiring α`.
    To obtain an integral domain use `[CommRing α] [IsDomain α]`. 
    • IsCancelMulZero α
    • Nontrivial α
    mul_left_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsLeftRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsLeftCancelMulZero
    mul_right_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsRightRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsRightCancelMulZero
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
  • theoremdefined in Mathlib/RingTheory/PrincipalIdealDomain.lean
    complete
    theorem PrincipalIdealRing.to_uniqueFactorizationMonoid.{u} {R : Type u}
      [CommRing R] [IsDomain R] [IsPrincipalIdealRing R] :
      UniqueFactorizationMonoid R
    theorem PrincipalIdealRing.to_uniqueFactorizationMonoid.{u}
      {R : Type u} [CommRing R] [IsDomain R]
      [IsPrincipalIdealRing R] :
      UniqueFactorizationMonoid R
    A principal ideal domain has unique factorization 
Definition1.1.44
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.26
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 1.1.29
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Unique factorization domain. (LMFDB)

A unique factorization domain, or UFD, is an integral domain R such that for every non-zero non-unit a\in R there exist irreducibles p_1, \ldots, p_n such that

a = p_1\cdots p_n,

and this representation is unique up to the order of the factors and up to associates.

Tau Ceti Review: UniqueFactorizationMonoid, IsDomain.

Depends on: Definition 1.1.26 Definition 1.1.36 Definition 1.1.38

Lean code for Definition1.1.44●4 declarations
  • class(extends 3, 4 methods)defined in Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean
    complete
    class UniqueFactorizationMonoid.{u_2} (α : Type u_2) [CommMonoidWithZero α] :
      Prop
    class UniqueFactorizationMonoid.{u_2}
      (α : Type u_2) [CommMonoidWithZero α] :
      Prop
    Unique factorization monoids are defined as cancellative `CommMonoidWithZero`s with well-founded
    strict divisibility relations, but this is equivalent to more familiar definitions:
    
    Each element (except zero) is uniquely represented as a multiset of irreducible factors.
    Uniqueness is only up to associated elements.
    
    Each element (except zero) is non-uniquely represented as a multiset
    of prime factors.
    
    To define a UFD using the definition in terms of multisets
    of irreducible factors, use the definition `of_existsUnique_irreducible_factors`
    
    To define a UFD using the definition in terms of multisets
    of prime factors, use the definition `of_exists_prime_factors`
    
    • IsCancelMulZero α
    mul_left_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsLeftRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsLeftCancelMulZero
    mul_right_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsRightRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsRightCancelMulZero
    toWellFounded : WellFounded DvdNotUnit
    irreducible_iff_prime : ∀ {a : α}, Irreducible a ↔ Prime a
  • class(extends 4, 3 methods)defined in Mathlib/Algebra/Ring/Defs.lean
    complete
    class IsDomain.{u} (α : Type u) [Semiring α] : Prop
    class IsDomain.{u} (α : Type u) [Semiring α] :
      Prop
    A domain is a nontrivial semiring such that multiplication by a nonzero element
    is cancellative on both sides. In other words, a nontrivial semiring `R` satisfying
    `∀ {a b c : R}, a ≠ 0 → a * b = a * c → b = c` and
    `∀ {a b c : R}, b ≠ 0 → a * b = c * b → a = c`.
    
    This is implemented as a mixin for `Semiring α`.
    To obtain an integral domain use `[CommRing α] [IsDomain α]`. 
    • IsCancelMulZero α
    • Nontrivial α
    mul_left_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsLeftRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsLeftCancelMulZero
    mul_right_cancel_of_ne_zero : ∀ {a : α}, a ≠ 0 → IsRightRegular a
    Inherited from
    1. IsCancelMulZero
    2. IsRightCancelMulZero
    exists_pair_ne : ∃ x y, x ≠ y
    Inherited from
    1. Nontrivial
  • theoremdefined in Mathlib/RingTheory/UniqueFactorizationDomain/Basic.lean
    complete
    theorem UniqueFactorizationMonoid.of_existsUnique_irreducible_factors.{u_1}
      {α : Type u_1} [CommMonoidWithZero α] [IsCancelMulZero α]
      (eif :
        ∀ (a : α),
          a ≠ 0 → ∃ f, (∀ b ∈ f, Irreducible b) ∧ Associated f.prod a)
      (uif :
        ∀ (f g : Multiset α),
          (∀ x ∈ f, Irreducible x) →
            (∀ x ∈ g, Irreducible x) →
              Associated f.prod g.prod → Multiset.Rel Associated f g) :
      UniqueFactorizationMonoid α
    theorem UniqueFactorizationMonoid.of_existsUnique_irreducible_factors.{u_1}
      {α : Type u_1} [CommMonoidWithZero α]
      [IsCancelMulZero α]
      (eif :
        ∀ (a : α),
          a ≠ 0 →
            ∃ f,
              (∀ b ∈ f, Irreducible b) ∧
                Associated f.prod a)
      (uif :
        ∀ (f g : Multiset α),
          (∀ x ∈ f, Irreducible x) →
            (∀ x ∈ g, Irreducible x) →
              Associated f.prod g.prod →
                Multiset.Rel Associated f g) :
      UniqueFactorizationMonoid α
  • theoremdefined in Mathlib/RingTheory/UniqueFactorizationDomain/Basic.lean
    complete
    theorem UniqueFactorizationMonoid.factors_unique.{u_1} {α : Type u_1}
      [CommMonoidWithZero α] [UniqueFactorizationMonoid α]
      {f g : Multiset α} (hf : ∀ x ∈ f, Irreducible x)
      (hg : ∀ x ∈ g, Irreducible x) (h : Associated f.prod g.prod) :
      Multiset.Rel Associated f g
    theorem UniqueFactorizationMonoid.factors_unique.{u_1}
      {α : Type u_1} [CommMonoidWithZero α]
      [UniqueFactorizationMonoid α]
      {f g : Multiset α}
      (hf : ∀ x ∈ f, Irreducible x)
      (hg : ∀ x ∈ g, Irreducible x)
      (h : Associated f.prod g.prod) :
      Multiset.Rel Associated f g
Definition1.1.45
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 3
Reverse dependency previews
Preview
Definition 1.1.26
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Unit in a ring. (LMFDB)

A unit in a commutative ring R is an element x \in R so that there exists y \in R with xy = 1. The set of units in R is denoted R^* or R^\times and forms a group under multiplication.

Tau Ceti Review: IsUnit.

Depends on: Definition 8.3.3 Definition 1.1.24

Lean code for Definition1.1.45●1 definition
  • defdefined in Mathlib/Algebra/Group/Units/Defs.lean
    complete
    def IsUnit.{u_1} {M : Type u_1} [Monoid M] (a : M) : Prop
    def IsUnit.{u_1} {M : Type u_1} [Monoid M]
      (a : M) : Prop
    An element `a : M` of a `Monoid` is a unit if it has a two-sided inverse.
    The actual definition says that `a` is equal to some `u : Mˣ`, where
    `Mˣ` is a bundled version of `IsUnit`. 
Definition1.1.46
uses 1used by 1✓L∃∀N

Zero divisor. (LMFDB)

An element a in a ring R is a zero divisor if a\neq 0_R and there exists an element b\in R-\{0_R\} such that

a\cdot b = 0_R \qquad \text{or}\qquad b\cdot a = 0_R.

Tau Ceti Review: nonZeroDivisors.

Depends on: Definition 1.1.24

Lean code for Definition1.1.46●2 declarations
  • defdefined in Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean
    complete
    def nonZeroDivisors.{u_1} (M₀ : Type u_1) [MonoidWithZero M₀] : Submonoid M₀
    def nonZeroDivisors.{u_1} (M₀ : Type u_1)
      [MonoidWithZero M₀] : Submonoid M₀
    The submonoid of non-zero-divisors of a `MonoidWithZero` `M₀`. 
  • theoremdefined in Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean
    complete
    theorem notMem_nonZeroDivisors_iff.{u_2} {M₀ : Type u_2} [MonoidWithZero M₀]
      {r : M₀} :
      r ∉ nonZeroDivisors M₀ ↔
        {s | r * s = 0 ∧ s ≠ 0}.Nonempty ∨ {s | s * r = 0 ∧ s ≠ 0}.Nonempty
    theorem notMem_nonZeroDivisors_iff.{u_2}
      {M₀ : Type u_2} [MonoidWithZero M₀]
      {r : M₀} :
      r ∉ nonZeroDivisors M₀ ↔
        {s | r * s = 0 ∧ s ≠ 0}.Nonempty ∨
          {s | s * r = 0 ∧ s ≠ 0}.Nonempty