LeanBridge Blueprint

5.1. Number fields🔗

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

Definition5.1.1
uses 1
Used by 139
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Number field. (LMFDB)

A number field is a field extension of finite degree of the field \Q of rational numbers. In the LMFDB, number fields are identified by a label.

Tau Ceti Review: NumberField.

Depends on: Definition 5.1.14

Lean code for Definition5.1.1●1 definition
  • class(2 methods)defined in Mathlib/NumberTheory/NumberField/Basic.lean
    complete
    class NumberField.{u_1} (K : Type u_1) [Field K] : Prop
    class NumberField.{u_1} (K : Type u_1)
      [Field K] : Prop
    A number field is a field which has characteristic zero and is finite
    dimensional over ℚ. 
    to_charZero : CharZero K
    to_finiteDimensional : FiniteDimensional ℚ K
Definition5.1.2
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 5.1.11
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Abelian number field. (LMFDB)

A number field K is abelian if it is Galois over \Q and its Galois group \Gal(K/\Q) is abelian.

Tau Ceti Review: IsAbelianGalois.

Depends on: Definition 5.1.1 Definition 5.1.23

Lean code for Definition5.1.2●1 definition
  • class(extends 2, 3 methods)defined in Mathlib/FieldTheory/Galois/Abelian.lean
    complete
    class IsAbelianGalois.{u_4, u_5} (K : Type u_4) (L : Type u_5) [Field K]
      [Field L] [Algebra K L] : Prop
    class IsAbelianGalois.{u_4, u_5} (K : Type u_4)
      (L : Type u_5) [Field K] [Field L]
      [Algebra K L] : Prop
    The class of abelian extensions,
    defined as galois extensions whose galois group is commutative. 
    • IsGalois K L
    • IsMulCommutative Gal(L/K)
    to_isSeparable : Algebra.IsSeparable K L
    Inherited from
    1. IsGalois
    to_normal : Normal K L
    Inherited from
    1. IsGalois
    is_comm : Std.Commutative fun x1 x2 => x1 * x2
    Inherited from
    1. IsMulCommutative
Definition5.1.3
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 2.70
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Absolute discriminant of a number field. (LMFDB)

The absolute discriminant of a number field is the absolute value of its discriminant.

Tau Ceti Review: NumberField.discr.

Depends on: Definition 5.1.1 Definition 5.1.17

Lean code for Definition5.1.3●1 definition
  • abbrevdefined in Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean
    complete
    abbrev NumberField.discr.{u_1} (K : Type u_1) [Field K] [NumberField K] : ℤ
    abbrev NumberField.discr.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : ℤ
    The absolute discriminant of a number field. 
Definition5.1.4
uses 0
Used by 6
Reverse dependency previews
Preview
Definition 1.2.53
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Absolute value of a field. (LMFDB)

An absolute value of a field k is a function |\ |:k\to \R_{\ge 0} that satisfies:

  • |x|=0 if and only if x=0;

  • |xy| = |x||y|;

  • |x+y| \le |x|+|y|.

Absolute values that satisfy the stronger condition |x+y|\le \max(|x|,|y|) are nonarchimedean, while those that do not are archimedean; the latter arise only in fields of characteristic zero. The trivial absolute value assigns 1 to every nonzero element of k; it is a nonarchimedean absolute value.

Absolute values |\ |_1 and |\ |_2 are equivalent if there exists a positive real number c such that |x|_1 = |x|_2^c for all x\in k; this defines an equivalence relation on the set of absolute values of k.

Tau Ceti Review: Archimedean, AbsoluteValue, IsNonarchimedean.

Lean code for Definition5.1.4●7 declarations
  • class(1 method)defined in Mathlib/Algebra/Order/Archimedean/Defs.lean
    complete
    class Archimedean.{u_2} (R : Type u_2) [AddCommMonoid R] [PartialOrder R] :
      Prop
    class Archimedean.{u_2} (R : Type u_2)
      [AddCommMonoid R] [PartialOrder R] :
      Prop
    An ordered additive commutative monoid is called `Archimedean` if for any two elements `x`, `y`
    such that `0 < y`, there exists a natural number `n` such that `x ≤ n • y`. 
    arch : ∀ (x : R) {y : R}, 0 < y → ∃ n, x ≤ n • y
    For any two elements `x`, `y` such that `0 < y`, there exists a natural number `n`
    such that `x ≤ n • y`. 
  • structure(extends 1, 5 fields)defined in Mathlib/Algebra/Order/AbsoluteValue/Basic.lean
    complete
    structure AbsoluteValue.{u_4, u_5} (R : Type u_4) (S : Type u_5) [Semiring R]
      [Semiring S] [PartialOrder S] : Type (max u_4 u_5)
    structure AbsoluteValue.{u_4, u_5} (R : Type u_4)
      (S : Type u_5) [Semiring R] [Semiring S]
      [PartialOrder S] : Type (max u_4 u_5)
    `AbsoluteValue R S` is the type of absolute values on `R` mapping to `S`:
    the maps that preserve `*`, are nonnegative, positive definite and satisfy
    the triangle inequality. 
    • R →ₙ* S
    toFun : R → S
    Inherited from
    1. MulHom
    map_mul' : ∀ (x y : R), self.toFun (x * y) = self.toFun x * self.toFun y
    Inherited from
    1. MulHom
    nonneg' : ∀ (x : R), 0 ≤ self.toFun x
    The absolute value is nonnegative 
    eq_zero' : ∀ (x : R), self.toFun x = 0 ↔ x = 0
    The absolute value is positive definitive 
    add_le' : ∀ (x y : R), self.toFun (x + y) ≤ self.toFun x + self.toFun y
    The absolute value satisfies the triangle inequality 
  • defdefined in Mathlib/Algebra/Order/Ring/Basic.lean
    complete
    def IsNonarchimedean.{u_3, u_4} {R : Type u_3} [LinearOrder R]
      {α : Type u_4} [Add α] (f : α → R) : Prop
    def IsNonarchimedean.{u_3, u_4} {R : Type u_3}
      [LinearOrder R] {α : Type u_4} [Add α]
      (f : α → R) : Prop
    A function `f : α → R` is nonarchimedean if it satisfies the ultrametric inequality
    `f (a + b) ≤ max (f a) (f b)` for all `a b : α`. 
  • theoremdefined in LeanBridge/ForMathlib/Analysis/AbsoluteValue/Archimedean.lean
    complete
    theorem AbsoluteValue.charZero_of_not_isNonarchimedean.{u_1} {k : Type u_1}
      [Field k] {v : AbsoluteValue k ℝ} (h : ¬IsNonarchimedean ⇑v) :
      CharZero k
    theorem AbsoluteValue.charZero_of_not_isNonarchimedean.{u_1}
      {k : Type u_1} [Field k]
      {v : AbsoluteValue k ℝ}
      (h : ¬IsNonarchimedean ⇑v) : CharZero k
    Archimedean absolute values occur only in characteristic zero (LMFDB `nf.absolute_value`): a
    field with an absolute value that is not nonarchimedean has characteristic zero. 
  • theoremdefined in LeanBridge/ForMathlib/Analysis/AbsoluteValue/Archimedean.lean
    complete
    theorem AbsoluteValue.isNonarchimedean_trivial.{u_2, u_3} {R : Type u_2}
      {S : Type u_3} [Semiring R] [DecidablePred fun x => x = 0]
      [NoZeroDivisors R] [Semiring S] [LinearOrder S]
      [IsStrictOrderedRing S] : IsNonarchimedean ⇑AbsoluteValue.trivial
    theorem AbsoluteValue.isNonarchimedean_trivial.{u_2,
        u_3}
      {R : Type u_2} {S : Type u_3}
      [Semiring R]
      [DecidablePred fun x => x = 0]
      [NoZeroDivisors R] [Semiring S]
      [LinearOrder S]
      [IsStrictOrderedRing S] :
      IsNonarchimedean ⇑AbsoluteValue.trivial
    The trivial absolute value, `1` at every nonzero element, is nonarchimedean (LMFDB
    `nf.absolute_value`). 
  • theoremdefined in LeanBridge/ForMathlib/Analysis/AbsoluteValue/Archimedean.lean
    complete
    theorem AbsoluteValue.isEquiv_iff_exists_eq_rpow.{u_1} {k : Type u_1} [Field k]
      {v w : AbsoluteValue k ℝ} :
      v.IsEquiv w ↔ ∃ c, 0 < c ∧ ∀ (x : k), v x = w x ^ c
    theorem AbsoluteValue.isEquiv_iff_exists_eq_rpow.{u_1}
      {k : Type u_1} [Field k]
      {v w : AbsoluteValue k ℝ} :
      v.IsEquiv w ↔
        ∃ c, 0 < c ∧ ∀ (x : k), v x = w x ^ c
    Two absolute values `|·|₁`, `|·|₂` of a field are equivalent if and only if there is a positive
    real number `c` with `|x|₁ = |x|₂ ^ c` for every `x` (LMFDB `nf.absolute_value`), the form of
    `AbsoluteValue.isEquiv_iff_exists_rpow_eq` that the knowl uses. 
  • theoremdefined in LeanBridge/ForMathlib/Analysis/AbsoluteValue/Archimedean.lean
    complete
    theorem AbsoluteValue.equivalence_exists_eq_rpow.{u_1} {k : Type u_1}
      [Field k] :
      Equivalence fun v w => ∃ c, 0 < c ∧ ∀ (x : k), v x = w x ^ c
    theorem AbsoluteValue.equivalence_exists_eq_rpow.{u_1}
      {k : Type u_1} [Field k] :
      Equivalence fun v w =>
        ∃ c, 0 < c ∧ ∀ (x : k), v x = w x ^ c
    The relation `|x|₁ = |x|₂ ^ c` for some `c > 0` and every `x` is an equivalence relation on the
    absolute values of a field (LMFDB `nf.absolute_value`). 
Definition5.1.5
uses 1used by 0✓L∃∀N

Algebraic closure of a field. (LMFDB)

An algebraic closure of a field K is a minimal algebraically closed field extension of K. It is unique up to (non-canonical) isomorphism. It is usually denoted \overline{K}.

For any number field, its algebraic closure is usually denoted by \overline{\Q}, and it is isomorphic to the field of all algebraic numbers in \C.

Tau Ceti Review: IsAlgClosure, AlgebraicClosure, IsAlgClosure.equiv.

Depends on: Definition 5.1.1

Lean code for Definition5.1.5●6 declarations
  • class(2 methods)defined in Mathlib/FieldTheory/IsAlgClosed/Basic.lean
    complete
    class IsAlgClosure.{u, v} (R : Type u) (K : Type v) [CommRing R] [Field K]
      [Algebra R K] [Module.IsTorsionFree R K] : Prop
    class IsAlgClosure.{u, v} (R : Type u)
      (K : Type v) [CommRing R] [Field K]
      [Algebra R K]
      [Module.IsTorsionFree R K] : Prop
    Typeclass for an extension being an algebraic closure. 
    isAlgClosed : IsAlgClosed K
    isAlgebraic : Algebra.IsAlgebraic R K
  • defdefined in Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean
    complete
    def AlgebraicClosure.{u} (k : Type u) [Field k] : Type u
    def AlgebraicClosure.{u} (k : Type u)
      [Field k] : Type u
    The canonical algebraic closure of a field, the direct limit of adding roots to the field for
    each polynomial over the field. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/IsAlgClosureMinimal.lean
    complete
    theorem isAlgClosure_iff_forall_isAlgClosed_eq_top.{u_1, u_2} {K : Type u_1}
      {L : Type u_2} [Field K] [Field L] [Algebra K L] [IsAlgClosed L] :
      IsAlgClosure K L ↔
        ∀ (E : IntermediateField K L), IsAlgClosed ↥E → E = ⊤
    theorem isAlgClosure_iff_forall_isAlgClosed_eq_top.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      [IsAlgClosed L] :
      IsAlgClosure K L ↔
        ∀ (E : IntermediateField K L),
          IsAlgClosed ↥E → E = ⊤
    **Algebraic closures are the minimal algebraically closed extensions**
    (LMFDB `nf.algebraic_closure`): an algebraically closed extension `L` of `K` is algebraic over `K`
    exactly when no intermediate field of `L / K` other than `L` is algebraically closed. 
  • defdefined in Mathlib/FieldTheory/IsAlgClosed/Basic.lean
    complete
    def IsAlgClosure.equiv.{u, v, w} (R : Type u) [CommRing R] [IsDomain R]
      (L : Type v) (M : Type w) [Field L] [Field M] [Algebra R M]
      [Module.IsTorsionFree R M] [IsAlgClosure R M] [Algebra R L]
      [Module.IsTorsionFree R L] [IsAlgClosure R L] : L ≃ₐ[R] M
    def IsAlgClosure.equiv.{u, v, w} (R : Type u)
      [CommRing R] [IsDomain R] (L : Type v)
      (M : Type w) [Field L] [Field M]
      [Algebra R M] [Module.IsTorsionFree R M]
      [IsAlgClosure R M] [Algebra R L]
      [Module.IsTorsionFree R L]
      [IsAlgClosure R L] : L ≃ₐ[R] M
    A (random) isomorphism between two algebraic closures of `R`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/IsAlgClosureMinimal.lean
    complete
    theorem nontrivial_algEquiv_of_not_isSepClosed.{u_1, u_2} {K : Type u_1}
      {L : Type u_2} [Field K] [Field L] [Algebra K L] [IsAlgClosure K L]
      (hK : ¬IsSepClosed K) : Nontrivial Gal(L/K)
    theorem nontrivial_algEquiv_of_not_isSepClosed.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L]
      [IsAlgClosure K L]
      (hK : ¬IsSepClosed K) :
      Nontrivial Gal(L/K)
    **Algebraic closures are unique only up to non-unique isomorphism**
    (LMFDB `nf.algebraic_closure`): an algebraic closure `L` of a field `K` that is not separably closed
    has an automorphism over `K` other than the identity, which sends a separable element of `L` outside
    `K` to another root of its minimal polynomial. 
  • defdefined in LeanBridge/ForMathlib/FieldTheory/IsAlgClosureMinimal.lean
    complete
    def NumberField.ringEquivAlgebraicClosure.{u_1, u_2} {K : Type u_1}
      {L : Type u_2} [Field K] [Field L] [Algebra K L] [NumberField K]
      [IsAlgClosure K L] : L ≃+* ↥(algebraicClosure ℚ ℂ)
    def NumberField.ringEquivAlgebraicClosure.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [Field L] [Algebra K L] [NumberField K]
      [IsAlgClosure K L] :
      L ≃+* ↥(algebraicClosure ℚ ℂ)
    An algebraic closure `L` of a number field `K`, usually written `ℚ̄`, is isomorphic to the field
    `algebraicClosure ℚ ℂ` of algebraic numbers in `ℂ` (LMFDB `nf.algebraic_closure`): both are
    algebraic closures of `ℚ`. 
Definition5.1.6
Statement uses 6
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Arithmetically equivalent fields. (LMFDB)

Two number fields are arithmetically equivalent if they have the same Dedekind \zeta-functions. Arithmetically equivalent fields share many invariants, such as their degrees, signatures, discriminants, and Galois groups. For a given field, the existence of an arithmetically equivalent sibling depends only on the Galois group.

Depends on: Definition 5.1.1 Definition 5.1.14 Definition 5.1.17 Definition 5.1.23 Definition 5.1.80 Definition 5.1.81

Definition5.1.7
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 14
Reverse dependency previews
Preview
Definition 3.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Class number of a number field. (LMFDB)

The class number of a number field K is the order of the ideal class group of K.

Tau Ceti Review: NumberField.classNumber.

Depends on: Definition 5.1.1 Definition 5.1.36

Lean code for Definition5.1.7●1 definition
  • defdefined in Mathlib/NumberTheory/NumberField/ClassNumber.lean
    complete
    def NumberField.classNumber.{u_1} (K : Type u_1) [Field K] [NumberField K] :
      ℕ
    def NumberField.classNumber.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    The class number of a number field is the (finite) cardinality of the class group. 
Definition5.1.8
Statement uses 5
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Analytic class number formula. (LMFDB)

If K is a number field with signature (r_1, r_2), discriminant D, regulator R, class number h, containing w roots of unity, and Dedekind \zeta-function \zeta_K, then \zeta_K has a meromorphic continuation to the whole complex plane with a single pole at s=1, which is of order 1. The analytic class number formula gives the residue at this pole:

\lim_{s\to 1}\ (s-1)\zeta_K(s) = \frac{2^{r_1}\cdot (2\pi)^{r_2}\cdot R\cdot h}{w\cdot\sqrt{|D|}} .

Depends on: Definition 5.1.1 Definition 5.1.7 Definition 5.1.17 Definition 5.1.72 Definition 5.1.81

Definition5.1.9
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 9
Reverse dependency previews
Preview
Definition 1.2.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N
Lean code for Definition5.1.9●3 declarations
  • class(2 methods)defined in Mathlib/NumberTheory/NumberField/CMField.lean
    complete
    class NumberField.IsCMField.{u_1} (K : Type u_1) [Field K] [CharZero K] : Prop
    class NumberField.IsCMField.{u_1} (K : Type u_1)
      [Field K] [CharZero K] : Prop
    A field `K` is `CM` if `K` is a totally complex quadratic extension of its maximal
    real subfield `K⁺`.
    
    to_isTotallyComplex : NumberField.IsTotallyComplex K
    is_quadratic : Algebra.IsQuadraticExtension (↥(NumberField.maximalRealSubfield K)) K
  • theoremdefined in Mathlib/NumberTheory/NumberField/CMField.lean
    complete
    theorem NumberField.IsCMField.ofCMExtension.{u_1, u_2} (F : Type u_1)
      (K : Type u_2) [Field F] [NumberField.IsTotallyReal F] [Field K]
      [CharZero K] [Algebra.IsIntegral ℚ K] [NumberField.IsTotallyComplex K]
      [Algebra F K] [Algebra.IsQuadraticExtension F K] :
      NumberField.IsCMField K
    theorem NumberField.IsCMField.ofCMExtension.{u_1,
        u_2}
      (F : Type u_1) (K : Type u_2) [Field F]
      [NumberField.IsTotallyReal F] [Field K]
      [CharZero K] [Algebra.IsIntegral ℚ K]
      [NumberField.IsTotallyComplex K]
      [Algebra F K]
      [Algebra.IsQuadraticExtension F K] :
      NumberField.IsCMField K
    If `K/F` is a CM-extension then `K` is a CM-field.
    
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    theorem NumberField.isTotallyReal_maximalRealSubfield.{u_2} {K : Type u_2}
      [Field K] [CharZero K] [Algebra.IsAlgebraic ℚ K] :
      NumberField.IsTotallyReal ↥(NumberField.maximalRealSubfield K)
    theorem NumberField.isTotallyReal_maximalRealSubfield.{u_2}
      {K : Type u_2} [Field K] [CharZero K]
      [Algebra.IsAlgebraic ℚ K] :
      NumberField.IsTotallyReal
        ↥(NumberField.maximalRealSubfield K)
Definition5.1.10
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.123
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Complex embedding. (LMFDB)

A complex embedding of a number field K is a nonzero field homomorphism K\to \C whose image is not contained in \R.

A single number field may have several distinct complex embeddings.

For K=\Q(a) where a is an algebraic number with minimal polynomial f(X), the embeddings \iota:K\to\C are determined by the value z=\iota(a) which is one of the complex roots of f(X), and the embedding is complex when z\notin\R. The complex embeddings come in conjugate pairs.

Tau Ceti Review: NumberField.ComplexEmbedding.IsReal, NumberField.ComplexEmbedding.conjugate.

Depends on: Definition 5.1.1 Definition 5.1.49

Lean code for Definition5.1.10●3 declarations
  • abbrevdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
    complete
    abbrev NumberField.ComplexEmbedding.IsReal.{u_1} {K : Type u_1} [Field K]
      (φ : K →+* ℂ) : Prop
    abbrev NumberField.ComplexEmbedding.IsReal.{u_1}
      {K : Type u_1} [Field K] (φ : K →+* ℂ) :
      Prop
    An embedding into `ℂ` is real if it is fixed by complex conjugation. 
  • abbrevdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
    complete
    abbrev NumberField.ComplexEmbedding.conjugate.{u_1} {K : Type u_1} [Field K]
      (φ : K →+* ℂ) : K →+* ℂ
    abbrev NumberField.ComplexEmbedding.conjugate.{u_1}
      {K : Type u_1} [Field K] (φ : K →+* ℂ) :
      K →+* ℂ
    The conjugate of a complex embedding as a complex embedding. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_complex_embeddings.{u_1} (K : Type u_1)
      [Field K] [NumberField K] :
      Fintype.card { φ // ¬NumberField.ComplexEmbedding.IsReal φ } =
        2 * NumberField.InfinitePlace.nrComplexPlaces K
    theorem NumberField.InfinitePlace.card_complex_embeddings.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fintype.card
          { φ //
            ¬NumberField.ComplexEmbedding.IsReal
                φ } =
        2 *
          NumberField.InfinitePlace.nrComplexPlaces
            K
Definition5.1.11
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Conductor of an abelian number field. (LMFDB)

If a number field K is abelian, then K\subseteq \Q(\zeta_n) for some positive integer n. The minimum such n is the conductor of K.

Depends on: Definition 5.1.1 Definition 5.1.2

Definition5.1.12
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 5.1.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Defining Polynomial of a Number Field. (LMFDB)

A defining polynomial of a number field K is an irreducible polynomial f\in\Q[x] such that K\cong \mathbb{Q}(a), where a is a root of f(x). Equivalently, it is a polynomial f\in \Q[x] such that K \cong \Q[x]/(f).

A root a \in K of the defining polynomial is a generator of K.

Tau Ceti Review: IsAdjoinRoot, AdjoinRoot, IntermediateField.adjoinRootEquivAdjoin.

Depends on: Definition 5.1.1

Lean code for Definition5.1.12●5 declarations
  • structure(3 fields)defined in Mathlib/RingTheory/IsAdjoinRoot.lean
    complete
    structure IsAdjoinRoot.{u, v} {R : Type u} (S : Type v) [CommSemiring R]
      [Semiring S] [Algebra R S] (f : Polynomial R) : Type (max u v)
    structure IsAdjoinRoot.{u, v} {R : Type u}
      (S : Type v) [CommSemiring R]
      [Semiring S] [Algebra R S]
      (f : Polynomial R) : Type (max u v)
    `IsAdjoinRoot S f` states that the ring `S` can be constructed by adjoining a specified root
    of the polynomial `f : R[X]` to `R`.
    
    Compare `PowerBasis R S`, which does not explicitly specify which polynomial we adjoin a root of
    (in particular `f` does not need to be the minimal polynomial of the root we adjoin),
    and `AdjoinRoot` which constructs a new type.
    
    This is not a typeclass because the choice of root given `S` and `f` is not unique.
    
    map : Polynomial R →ₐ[R] S
    map_surjective : Function.Surjective ⇑self.map
    ker_map : RingHom.ker self.map = Ideal.span {f}
  • defdefined in Mathlib/RingTheory/AdjoinRoot.lean
    complete
    def AdjoinRoot.{u_1} {R : Type u_1} [CommRing R] (f : Polynomial R) :
      Type u_1
    def AdjoinRoot.{u_1} {R : Type u_1}
      [CommRing R] (f : Polynomial R) :
      Type u_1
    Adjoin a root of a polynomial `f` to a commutative ring `R`. We define the new ring
    as the quotient of `R[X]` by the principal ideal generated by `f`. 
  • defdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
    complete
    def IntermediateField.adjoinRootEquivAdjoin.{u_1, u_2} (F : Type u_1)
      [Field F] {E : Type u_2} [Field E] [Algebra F E] {α : E}
      (h : IsIntegral F α) : AdjoinRoot (minpoly F α) ≃ₐ[F] ↥F⟮α⟯
    def IntermediateField.adjoinRootEquivAdjoin.{u_1,
        u_2}
      (F : Type u_1) [Field F] {E : Type u_2}
      [Field E] [Algebra F E] {α : E}
      (h : IsIntegral F α) :
      AdjoinRoot (minpoly F α) ≃ₐ[F] ↥F⟮α⟯
    algebra isomorphism between `AdjoinRoot` and `F⟮α⟯` 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/IsAdjoinRootPrimitive.lean
    complete
    theorem IsAdjoinRoot.nonempty_iff.{u_1, u_2} {F : Type u_1} {K : Type u_2}
      [Field F] [Field K] [Algebra F K] {f : Polynomial F} :
      Nonempty (IsAdjoinRoot K f) ↔
        Irreducible f ∧ ∃ a, (Polynomial.aeval a) f = 0 ∧ F⟮a⟯ = ⊤
    theorem IsAdjoinRoot.nonempty_iff.{u_1, u_2}
      {F : Type u_1} {K : Type u_2} [Field F]
      [Field K] [Algebra F K]
      {f : Polynomial F} :
      Nonempty (IsAdjoinRoot K f) ↔
        Irreducible f ∧
          ∃ a,
            (Polynomial.aeval a) f = 0 ∧
              F⟮a⟯ = ⊤
    **The two forms of a defining polynomial agree** (LMFDB `nf.defining_polynomial`):
    `K ≅ F[x] / (f)` exactly when `f` is irreducible and `K = F(a)` for a root `a ∈ K` of `f`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/IsAdjoinRootPrimitive.lean
    complete
    theorem IsAdjoinRoot.primitive_element_of_aeval_eq_zero.{u_1, u_2}
      {F : Type u_1} {K : Type u_2} [Field F] [Field K] [Algebra F K]
      {f : Polynomial F} {a : K} (h : IsAdjoinRoot K f)
      (ha : (Polynomial.aeval a) f = 0) : F⟮a⟯ = ⊤
    theorem IsAdjoinRoot.primitive_element_of_aeval_eq_zero.{u_1,
        u_2}
      {F : Type u_1} {K : Type u_2} [Field F]
      [Field K] [Algebra F K]
      {f : Polynomial F} {a : K}
      (h : IsAdjoinRoot K f)
      (ha : (Polynomial.aeval a) f = 0) :
      F⟮a⟯ = ⊤
    **Every root of a defining polynomial generates the field** (LMFDB `nf.defining_polynomial`):
    if `K ≅ F[x] / (f)`, then `F(a) = K` for every root `a ∈ K` of `f`, not only for the root that the
    presentation singles out. 
Definition5.1.13
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.12
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Normalization of defining polynomials for number fields. (LMFDB)

A number field can be defined by many different irreducible polynomials f(x)\in\Q[x]. The normalized polynomial is the output of gp/pari's <code>polredabs</code>, which is effectively a canonically chosen defining polynomial.

Normalized polynomials are always monic with integer coefficients, such that the sum of the squares of the absolute values of all complex roots of f(x) is minimized. When there is more than one such polynomial, the tie is broken based on the size of the polynomial's coefficients and discriminant.

Depends on: Definition 5.1.12 Definition 5.1.62

Lean code for Definition5.1.13●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    def NumberField.polredabs.{u_1} (K : Type u_1) [Field K] [NumberField K] :
      Polynomial ℤ
    def NumberField.polredabs.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : Polynomial ℤ
    The **reduced defining polynomial** of a number field `K` (LMFDB `nf.polredabs`), the
    polynomial `P` with `IsPolredabs K P`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    def NumberField.IsPolredabs.{u_1} (K : Type u_1) [Field K] [NumberField K]
      (P : Polynomial ℤ) : Prop
    def NumberField.IsPolredabs.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (P : Polynomial ℤ) : Prop
    `P` is the **reduced defining polynomial** of a number field `K` (LMFDB `nf.polredabs`), the
    output of PARI's `polredabs`: a defining polynomial of `K` that is least among the defining
    polynomials of `K` for the lexicographic order on `(T₂(P), |disc P|, S(P))`. That is, `P` has
    minimal `T₂` norm, then minimal absolute discriminant among those, and comes first among those for
    the lexicographic order on `S(P)`. It exists (`exists_isPolredabs`) and is unique
    (`IsPolredabs.eq`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    def Polynomial.t2Norm (P : Polynomial ℤ) : ℝ
    def Polynomial.t2Norm (P : Polynomial ℤ) : ℝ
    The **`T₂` norm** of an integer polynomial `P` (LMFDB `nf.polredabs`): the sum of the squared
    absolute values of the complex roots of `P`, counted with multiplicity. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    theorem NumberField.exists_isPolredabs.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : ∃ P, NumberField.IsPolredabs K P
    theorem NumberField.exists_isPolredabs.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      ∃ P, NumberField.IsPolredabs K P
    Every number field has a reduced defining polynomial. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    theorem NumberField.IsPolredabs.eq.{u_1} {K : Type u_1} [Field K]
      [NumberField K] {P Q : Polynomial ℤ}
      (hP : NumberField.IsPolredabs K P)
      (hQ : NumberField.IsPolredabs K Q) : P = Q
    theorem NumberField.IsPolredabs.eq.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {P Q : Polynomial ℤ}
      (hP : NumberField.IsPolredabs K P)
      (hQ : NumberField.IsPolredabs K Q) :
      P = Q
    The reduced defining polynomial of a number field is unique. 
Definition5.1.14
uses 1
Used by 25
Reverse dependency previews
Preview
Definition 1.2.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Degree of a number field. (LMFDB)

The degree of a number field K is its degree as an extension of the rational field \mathbb{Q}, i.e., the dimension of K as a \mathbb{Q}-vector space. The degree of K/\Q is written [K:\mathbb{Q}].

Tau Ceti Review: Module.finrank.

Depends on: Definition 5.1.15

Lean code for Definition5.1.14●1 definition
  • defdefined in Mathlib/LinearAlgebra/Dimension/Finrank.lean
    complete
    def Module.finrank.{u_1, u_2} (R : Type u_1) (M : Type u_2) [Semiring R]
      [AddCommMonoid M] [Module R M] : ℕ
    def Module.finrank.{u_1, u_2} (R : Type u_1)
      (M : Type u_2) [Semiring R]
      [AddCommMonoid M] [Module R M] : ℕ
    The rank of a module as a natural number.
    
    For a finite-dimensional vector space `V` over a field `k`, `Module.finrank k V` is equal to
    the dimension of `V` over `k`.
    
    For a general module `M` over a ring `R`, `Module.finrank R M` is defined to be the supremum of the
    cardinalities of the `R`-linearly independent subsets of `M`, if this supremum is finite. It is
    defined by convention to be `0` if this supremum is infinite. See `Module.rank` for a
    cardinal-valued version where infinite rank modules have rank an infinite cardinal.
    
    Note that if `R` is not a field then there can exist modules `M` with `¬(Module.Finite R M)` but
    `finrank R M ≠ 0`. For example `ℚ` has `finrank` equal to `1` over `ℤ`, because the nonempty
    `ℤ`-linearly independent subsets of `ℚ` are precisely the nonzero singletons. 
Definition5.1.15
uses 0used by 1✓L∃∀N

Number field degree (mathlib). (LMFDB)

This is also defined in mathlib as 'finrank ℚ K', where K is the number field and 'finrank ℚ' is its module rank over the rationals.

Tau Ceti Review: Module.finrank.

Lean code for Definition5.1.15●1 definition
  • defdefined in Mathlib/LinearAlgebra/Dimension/Finrank.lean
    complete
    def Module.finrank.{u_1, u_2} (R : Type u_1) (M : Type u_2) [Semiring R]
      [AddCommMonoid M] [Module R M] : ℕ
    def Module.finrank.{u_1, u_2} (R : Type u_1)
      (M : Type u_2) [Semiring R]
      [AddCommMonoid M] [Module R M] : ℕ
    The rank of a module as a natural number.
    
    For a finite-dimensional vector space `V` over a field `k`, `Module.finrank k V` is equal to
    the dimension of `V` over `k`.
    
    For a general module `M` over a ring `R`, `Module.finrank R M` is defined to be the supremum of the
    cardinalities of the `R`-linearly independent subsets of `M`, if this supremum is finite. It is
    defined by convention to be `0` if this supremum is infinite. See `Module.rank` for a
    cardinal-valued version where infinite rank modules have rank an infinite cardinal.
    
    Note that if `R` is not a field then there can exist modules `M` with `¬(Module.Finite R M)` but
    `finrank R M ≠ 0`. For example `ℚ` has `finrank` equal to `1` over `ℤ`, because the nonempty
    `ℤ`-linearly independent subsets of `ℚ` are precisely the nonzero singletons. 
Definition5.1.16
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Dirichlet group of an Abelian number field. (LMFDB)

If K is an abelian number field, then K\subseteq \Q(\zeta_n) for some positive integer n. Take the minimal such n, i.e., the conductor of K.

The Galois group \Gal(\Q(\zeta_n)/\Q) is canonically isomorphic to \Z_n^\times. The Dirichlet characters modulo n form the dual group of homomorphisms \chi:\Z_n^\times\to\C^\times. Since \Gal(K/\Q) is a quotient group of \Gal(\Q(\zeta_n)/\Q), its dual group is a subgroup of the group of Dirichlet characters modulo n, called the Dirichlet character group of K.

Depends on: Definition 6.1.1 Definition 5.1.2 Definition 5.1.11

Definition5.1.17
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 16
Reverse dependency previews
Preview
Definition 3.1.84
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Discriminant of a number field. (LMFDB)

The discriminant of a number field K is the square of the determinant of the matrix

\left( \begin{array}{ccc} \sigma_1(\beta_1) & \cdots & \sigma_1(\beta_n) \\ \vdots & & \vdots \\ \sigma_n(\beta_1) & \cdots & \sigma_n(\beta_n) \\ \end{array} \right)

where \sigma_1,..., \sigma_n are the embeddings of K into the complex numbers \mathbb{C}, and \{\beta_1, \ldots, \beta_n\} is an integral basis for the ring of integers of K.

The discriminant of K is a non-zero integer divisible exactly by the primes which ramify in K.

Tau Ceti Review: NumberField.discr.

Depends on: Definition 5.1.1 Definition 5.1.42

Lean code for Definition5.1.17●1 definition
  • abbrevdefined in Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean
    complete
    abbrev NumberField.discr.{u_1} (K : Type u_1) [Field K] [NumberField K] : ℤ
    abbrev NumberField.discr.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : ℤ
    The absolute discriminant of a number field. 
Definition5.1.18
uses 0used by 1✓L∃∀N

Discriminant root field. (LMFDB)

If K/F is a finite algebraic extension, it can be defined by a polynomial f(x)\in F[x]. The polynomial discriminant, \mathrm{disc}(f), is well-defined up a factor of a non-zero square. The discriminant root field of the extension is F(\sqrt{\mathrm{disc}(f)}), which is well-defined.

If n=[K:F], then the Galois group G for K/F is a subgroup of S_n, well-defined up to conjugation. The discriminant root field can alternatively be described as the fixed field of G\cap A_n.

Tau Ceti Review: Polynomial.discr, TauCeti.discrField, TauCeti.evenAutSubgroup, TauCeti.fixedField_evenAutSubgroup.

Lean code for Definition5.1.18●6 declarations
  • defdefined in Mathlib/RingTheory/Polynomial/Resultant/Basic.lean
    complete
    def Polynomial.discr.{u_1} {R : Type u_1} [CommRing R] (f : Polynomial R) :
      R
    def Polynomial.discr.{u_1} {R : Type u_1}
      [CommRing R] (f : Polynomial R) : R
    The discriminant of a polynomial, defined as the determinant of `f.sylvesterDeriv` modified
    by a sign. The sign is chosen so polynomials over `ℝ` with all roots real have non-negative
    discriminant. 
  • defdefined in TauCeti/FieldTheory/GaloisGroups/Discriminant/Field.lean
    complete
    def TauCeti.discrField.{u, v} {F : Type u} [Field F] (f : Polynomial F)
      (E : Type v) [Field E] [Algebra F E] : IntermediateField F E
    def TauCeti.discrField.{u, v} {F : Type u}
      [Field F] (f : Polynomial F)
      (E : Type v) [Field E] [Algebra F E] :
      IntermediateField F E
    **The discriminant field of `f` in `E`**: the subfield of `E` generated over `F` by the square
    roots of `Polynomial.discr f` that lie in `E`. If `E` contains such a square root this is a
    splitting field of `X ^ 2 - C f.discr` over `F` (`TauCeti.isSplittingField_discrField`); if it
    contains none, the root set is empty and the discriminant field is `F` itself.
    
    `TauCeti.discrField_eq_adjoin_simple` describes it as `F⟮δ⟯` for any square root `δ` of the
    discriminant in `E`. Stating it as an adjunction of the whole root set instead of a simple
    extension keeps it independent of the choice of square root, hence of the numbering of the roots of
    `f` that `TauCeti.discrSqrt` is computed from. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/DiscriminantRootField.lean
    complete
    theorem Polynomial.isSquare_discr_mul_discr.{u_1, u_2} {F : Type u_1}
      {K : Type u_2} [Field F] [Field K] [Algebra F K] {x x' : K}
      {f f' : Polynomial F} [FiniteDimensional F K] (hf : Irreducible f)
      (hfx : (Polynomial.aeval x) f = 0) (hx : F⟮x⟯ = ⊤)
      (hf' : Irreducible f') (hfx' : (Polynomial.aeval x') f' = 0)
      (hx' : F⟮x'⟯ = ⊤) : IsSquare (f.discr * f'.discr)
    theorem Polynomial.isSquare_discr_mul_discr.{u_1,
        u_2}
      {F : Type u_1} {K : Type u_2} [Field F]
      [Field K] [Algebra F K] {x x' : K}
      {f f' : Polynomial F}
      [FiniteDimensional F K]
      (hf : Irreducible f)
      (hfx : (Polynomial.aeval x) f = 0)
      (hx : F⟮x⟯ = ⊤) (hf' : Irreducible f')
      (hfx' : (Polynomial.aeval x') f' = 0)
      (hx' : F⟮x'⟯ = ⊤) :
      IsSquare (f.discr * f'.discr)
    **The polynomial discriminant is well defined up to a square** (LMFDB
    `nf.discriminant_root_field`): if `f, f'` are irreducible polynomials over `F` with roots `x, x'`
    generating `K`, then `disc f · disc f'` is a square in `F`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/DiscriminantRootField.lean
    complete
    theorem Polynomial.discrField_eq_discrField.{u_1, u_2, u_3} {F : Type u_1}
      {K : Type u_2} [Field F] [Field K] [Algebra F K] {x x' : K}
      {f f' : Polynomial F} [FiniteDimensional F K]
      [Algebra.IsSeparable F K] (E : Type u_3) [Field E] [Algebra F E]
      [IsAlgClosed E] (hf : Irreducible f)
      (hfx : (Polynomial.aeval x) f = 0) (hx : F⟮x⟯ = ⊤)
      (hf' : Irreducible f') (hfx' : (Polynomial.aeval x') f' = 0)
      (hx' : F⟮x'⟯ = ⊤) : TauCeti.discrField f E = TauCeti.discrField f' E
    theorem Polynomial.discrField_eq_discrField.{u_1,
        u_2, u_3}
      {F : Type u_1} {K : Type u_2} [Field F]
      [Field K] [Algebra F K] {x x' : K}
      {f f' : Polynomial F}
      [FiniteDimensional F K]
      [Algebra.IsSeparable F K] (E : Type u_3)
      [Field E] [Algebra F E] [IsAlgClosed E]
      (hf : Irreducible f)
      (hfx : (Polynomial.aeval x) f = 0)
      (hx : F⟮x⟯ = ⊤) (hf' : Irreducible f')
      (hfx' : (Polynomial.aeval x') f' = 0)
      (hx' : F⟮x'⟯ = ⊤) :
      TauCeti.discrField f E =
        TauCeti.discrField f' E
    **The discriminant root field is well defined** (LMFDB `nf.discriminant_root_field`): for a
    finite separable extension `K / F` and irreducible polynomials `f, f'` over `F` with roots `x, x'`
    generating `K`, the discriminant root fields `F(√disc f)` and `F(√disc f')` in an algebraically
    closed field `E` agree. 
  • defdefined in TauCeti/FieldTheory/GaloisGroups/Discriminant/Field.lean
    complete
    def TauCeti.evenAutSubgroup.{u, v} {F : Type u} [Field F] (f : Polynomial F)
      (E : Type v) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) f).Splits] : Subgroup Gal(E/F)
    def TauCeti.evenAutSubgroup.{u, v}
      {F : Type u} [Field F]
      (f : Polynomial F) (E : Type v)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              f).Splits] :
      Subgroup Gal(E/F)
    **The even part of the Galois group.** For a splitting extension `E` of `f` over `F`, this is
    the subgroup of automorphisms of `E` over `F` that permute the roots of `f` evenly. It is the
    kernel of the sign of the root action, hence a normal subgroup of index at most two. 
  • theoremdefined in TauCeti/FieldTheory/GaloisGroups/Discriminant/Field.lean
    complete
    theorem TauCeti.fixedField_evenAutSubgroup.{u, v} {F : Type u} [Field F]
      {E : Type v} [Field E] [Algebra F E] {f : Polynomial F}
      [Fact (Polynomial.map (algebraMap F E) f).Splits] [IsGalois F E]
      (hf : f.Monic) (hsep : f.Separable) (hchar : ringChar F ≠ 2) :
      IntermediateField.fixedField (TauCeti.evenAutSubgroup f E) =
        TauCeti.discrField f E
    theorem TauCeti.fixedField_evenAutSubgroup.{u, v}
      {F : Type u} [Field F] {E : Type v}
      [Field E] [Algebra F E]
      {f : Polynomial F}
      [Fact
          (Polynomial.map (algebraMap F E)
              f).Splits]
      [IsGalois F E] (hf : f.Monic)
      (hsep : f.Separable)
      (hchar : ringChar F ≠ 2) :
      IntermediateField.fixedField
          (TauCeti.evenAutSubgroup f E) =
        TauCeti.discrField f E
    **The comparison theorem.** In a Galois splitting extension, and away from characteristic `2`,
    the discriminant field of a monic separable polynomial is the field fixed by the automorphisms
    acting on the roots by an even permutation. 
Definition5.1.19
Statement uses 6
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 3.1.34
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Embedding of a number field. (LMFDB)

An embedding of a number field K is a field homomorphism K\to \C. A number field of degree n has n distinct embeddings, which may be distinguished as real or complex depending on whether the image of the embedding is contained in \R or not.

Complex embeddings necessarily come in conjugate pairs. The signature of a number field is determined by the number of real embeddings and the number of pairs of conjugate complex embeddings.

For K=\Q(a), where a is an algebraic number with minimal polynomial f(X), each embedding \iota is uniquely determined by the value z=\iota(a), which is one of the complex roots of f(X). The embedding is real if z\in\R and complex if z\notin\R.

Tau Ceti Review: RingHom, NumberField.Embeddings.card.

Depends on: Definition 5.1.1 Definition 5.1.10 Definition 5.1.14 Definition 5.1.49 Definition 5.1.69 Definition 5.1.81

Lean code for Definition5.1.19●6 declarations
  • structure(extends 8, 5 fields)defined in Mathlib/Algebra/Ring/Hom/Defs.lean
    complete
    structure RingHom.{u_5, u_6} (α : Type u_5) (β : Type u_6) [NonAssocSemiring α]
      [NonAssocSemiring β] : Type (max u_5 u_6)
    structure RingHom.{u_5, u_6} (α : Type u_5)
      (β : Type u_6) [NonAssocSemiring α]
      [NonAssocSemiring β] :
      Type (max u_5 u_6)
    Bundled semiring homomorphisms; use this for bundled ring homomorphisms too.
    
    This extends from both `MonoidHom` and `MonoidWithZeroHom` in order to put the fields in a
    sensible order, even though `MonoidWithZeroHom` already extends `MonoidHom`. 
    • α →* β
    • α →+ β
    • α →ₙ+* β
    • α →*₀ β
    toFun : α → β
    Inherited from
    1. MonoidHom
    2. OneHom
    map_one' : (↑↑self).toFun 1 = 1
    Inherited from
    1. MonoidHom
    2. OneHom
    map_mul' : ∀ (x y : α), (↑↑self).toFun (x * y) = (↑↑self).toFun x * (↑↑self).toFun y
    Inherited from
    1. MonoidHom
    map_zero' : (↑↑self).toFun 0 = 0
    The proposition that the function preserves 0 
    map_add' : ∀ (x y : α), (↑↑self).toFun (x + y) = (↑↑self).toFun x + (↑↑self).toFun y
    The proposition that the function preserves addition 
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
    complete
    theorem NumberField.Embeddings.card.{u_1, u_2} (K : Type u_1) [Field K]
      (A : Type u_2) [Field A] [CharZero A] [NumberField K]
      [IsAlgClosed A] : Fintype.card (K →+* A) = Module.finrank ℚ K
    theorem NumberField.Embeddings.card.{u_1, u_2}
      (K : Type u_1) [Field K] (A : Type u_2)
      [Field A] [CharZero A] [NumberField K]
      [IsAlgClosed A] :
      Fintype.card (K →+* A) =
        Module.finrank ℚ K
    The number of embeddings of a number field is equal to its finrank. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/EmbeddingGenerator.lean
    complete
    theorem NumberField.ComplexEmbedding.isReal_iff_range_subset.{u_1}
      {K : Type u_1} [Field K] {φ : K →+* ℂ} :
      NumberField.ComplexEmbedding.IsReal φ ↔
        Set.range ⇑φ ⊆ Set.range Complex.ofReal
    theorem NumberField.ComplexEmbedding.isReal_iff_range_subset.{u_1}
      {K : Type u_1} [Field K] {φ : K →+* ℂ} :
      NumberField.ComplexEmbedding.IsReal φ ↔
        Set.range ⇑φ ⊆
          Set.range Complex.ofReal
    **An embedding is real exactly when its image lies in `ℝ`** (LMFDB `nf.embedding`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/EmbeddingGenerator.lean
    complete
    theorem NumberField.ComplexEmbedding.ne_and_mk_eq_iff_eq_conjugate.{u_1}
      {K : Type u_1} [Field K] {φ ψ : K →+* ℂ}
      (h : ¬NumberField.ComplexEmbedding.IsReal φ) :
      ψ ≠ φ ∧
          NumberField.InfinitePlace.mk ψ = NumberField.InfinitePlace.mk φ ↔
        ψ = NumberField.ComplexEmbedding.conjugate φ
    theorem NumberField.ComplexEmbedding.ne_and_mk_eq_iff_eq_conjugate.{u_1}
      {K : Type u_1} [Field K] {φ ψ : K →+* ℂ}
      (h :
        ¬NumberField.ComplexEmbedding.IsReal
            φ) :
      ψ ≠ φ ∧
          NumberField.InfinitePlace.mk ψ =
            NumberField.InfinitePlace.mk φ ↔
        ψ =
          NumberField.ComplexEmbedding.conjugate
            φ
    **Complex embeddings come in conjugate pairs** (LMFDB `nf.embedding`): for a complex embedding
    `φ`, the embeddings other than `φ` that induce the same place are exactly its complex conjugate,
    which is again complex (`NumberField.ComplexEmbedding.isReal_conjugate_iff`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/EmbeddingGenerator.lean
    complete
    def NumberField.ComplexEmbedding.equivRootSet.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (a : K) (ha : ℚ⟮a⟯ = ⊤) :
      (K →+* ℂ) ≃ ↑((minpoly ℚ a).rootSet ℂ)
    def NumberField.ComplexEmbedding.equivRootSet.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (a : K) (ha : ℚ⟮a⟯ = ⊤) :
      (K →+* ℂ) ≃ ↑((minpoly ℚ a).rootSet ℂ)
    For a generator `a` of `K`, with `K = ℚ(a)`, the bijection `φ ↦ φ a` between the embeddings of
    `K` and the complex roots of the minimal polynomial `f` of `a` (LMFDB `nf.embedding`): each
    embedding is determined by `z = φ a`, which is a complex root of `f`, and every root arises. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/EmbeddingGenerator.lean
    complete
    theorem NumberField.ComplexEmbedding.isReal_iff_apply_mem_range.{u_1}
      {K : Type u_1} [Field K] {φ : K →+* ℂ} [NumberField K] {a : K}
      (ha : ℚ⟮a⟯ = ⊤) :
      NumberField.ComplexEmbedding.IsReal φ ↔ φ a ∈ Set.range Complex.ofReal
    theorem NumberField.ComplexEmbedding.isReal_iff_apply_mem_range.{u_1}
      {K : Type u_1} [Field K] {φ : K →+* ℂ}
      [NumberField K] {a : K}
      (ha : ℚ⟮a⟯ = ⊤) :
      NumberField.ComplexEmbedding.IsReal φ ↔
        φ a ∈ Set.range Complex.ofReal
    **An embedding of `K = ℚ(a)` is real exactly when its value at `a` is real**
    (LMFDB `nf.embedding`): `φ` is real if `z = φ a ∈ ℝ` and complex if `z ∉ ℝ`. 
Definition5.1.20
uses 0used by 1✓L∃∀N

Frobenius cycle types. (LMFDB)

If K is a degree n extension of \mathbb{Q}, \hat{K} its normal closure and G=\text{Gal}(\hat{K}/\mathbb{Q}), then G acts on the set of n embeddings of K\to \hat{K} giving an embedding G\to S_n. Let \mathcal{O}_K be the ring of integers of K and p a prime number. Then

p\mathcal{O}_K = P_1^{e_1}\cdots P_g^{e_g}

where the P_i are distinct prime ideals of \mathcal{O}_K. The prime p is unramified if e_i=1 for all i.

Suppose hereafter that p is unramified. For each P_i, there is a unique element of G that fixes P_i and acts on the quotient \mathcal{O}_K/P_i via the Frobenius automorphism x \mapsto x^p; this element is the Frobenius element associated to P_i. The Frobenius elements associated to the different P_i are conjugate to each other, so their images in S_n all have the same lengths of cycles in their disjoint cycle decompositions. This is the Frobenius cycle type of p.

Alternatively, for each prime P_i, its residue degree f_i is defined by |\mathcal{O}_K/P_i| = p^{f_i}. The list of f_i is the same partition of n as the cycle decomposition described above.

Tau Ceti Review: IsArithFrobAt, Ideal.inertiaDeg.

Lean code for Definition5.1.20●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FrobeniusCycleType.lean
    complete
    def NumberField.frobeniusCycleType.{u_1, u_2} {F : Type u_1} [Field F]
      (K : Type u_2) [Field K] [NumberField K] [Algebra F K]
      (p : Ideal (NumberField.RingOfIntegers F)) [p.IsMaximal] : Multiset ℕ
    def NumberField.frobeniusCycleType.{u_1, u_2}
      {F : Type u_1} [Field F] (K : Type u_2)
      [Field K] [NumberField K] [Algebra F K]
      (p :
        Ideal (NumberField.RingOfIntegers F))
      [p.IsMaximal] : Multiset ℕ
    The **Frobenius cycle type** of a prime `p` of `F` in a finite extension `K / F` of number
    fields (LMFDB `nf.frobenius_cycle_types`, where `F = ℚ`): the multiset of the residue degrees of the
    primes of `K` above `p`.
    
    The LMFDB defines it for the primes `p` unramified in `K`. When `p` is unramified in a Galois
    extension `L / F` containing a copy of `K`, this is the cycle type, fixed points included, of the
    permutation of the embeddings `K → L` induced by a Frobenius element at any prime of `L` above `p`
    (`fullCycleType_toPerm_eq_frobeniusCycleType`), which is the LMFDB's definition. That theorem shows
    in particular that the LMFDB's definition does not depend on the choices of `L`, of the prime of
    `L` and of the Frobenius element. For a ramified `p` the multiset of residue degrees, which no
    longer sums to `[K : F]`, is a value outside the LMFDB's definition. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FrobeniusCycleType.lean
    complete
    theorem NumberField.fullCycleType_toPerm_eq_frobeniusCycleType.{u_1, u_2, u_4}
      {F : Type u_1} [Field F] {K : Type u_2} [Field K] [NumberField K]
      [Algebra F K] (p : Ideal (NumberField.RingOfIntegers F)) [p.IsMaximal]
      {L : Type u_4} [Field L] [NumberField L] [Algebra F L] [IsGalois F L]
      [NumberField F] (φ : K →ₐ[F] L)
      (Q : Ideal (NumberField.RingOfIntegers L)) [Q.IsPrime] [Q.LiesOver p]
      [Algebra.IsUnramifiedAt (NumberField.RingOfIntegers F) Q]
      {σ : Gal(L/F)}
      (hσ : IsArithFrobAt (NumberField.RingOfIntegers F) σ Q) :
      (MulAction.toPerm σ).fullCycleType =
        NumberField.frobeniusCycleType K p
    theorem NumberField.fullCycleType_toPerm_eq_frobeniusCycleType.{u_1,
        u_2, u_4}
      {F : Type u_1} [Field F] {K : Type u_2}
      [Field K] [NumberField K] [Algebra F K]
      (p :
        Ideal (NumberField.RingOfIntegers F))
      [p.IsMaximal] {L : Type u_4} [Field L]
      [NumberField L] [Algebra F L]
      [IsGalois F L] [NumberField F]
      (φ : K →ₐ[F] L)
      (Q :
        Ideal (NumberField.RingOfIntegers L))
      [Q.IsPrime] [Q.LiesOver p]
      [Algebra.IsUnramifiedAt
          (NumberField.RingOfIntegers F) Q]
      {σ : Gal(L/F)}
      (hσ :
        IsArithFrobAt
          (NumberField.RingOfIntegers F) σ
          Q) :
      (MulAction.toPerm σ).fullCycleType =
        NumberField.frobeniusCycleType K p
    **Frobenius cycle types.** Let `L / F` be a finite Galois extension into which `K` embeds, and
    `σ ∈ Gal(L/F)` a Frobenius element at a prime `Q` of `L` above `p` unramified over `F`. Then the
    cycle type, fixed points included, of the permutation of the embeddings `K → L` induced by `σ` is
    the multiset of the residue degrees of the primes of `K` above `p`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FrobeniusCycleType.lean
    complete
    theorem NumberField.frobeniusCycleType_congr.{u_1, u_2, u_3} {F : Type u_1}
      [Field F] {K : Type u_2} [Field K] [NumberField K] [Algebra F K]
      (p : Ideal (NumberField.RingOfIntegers F)) [p.IsMaximal]
      {K' : Type u_3} [Field K'] [NumberField K'] [Algebra F K']
      (e : K ≃ₐ[F] K') :
      NumberField.frobeniusCycleType K p =
        NumberField.frobeniusCycleType K' p
    theorem NumberField.frobeniusCycleType_congr.{u_1,
        u_2, u_3}
      {F : Type u_1} [Field F] {K : Type u_2}
      [Field K] [NumberField K] [Algebra F K]
      (p :
        Ideal (NumberField.RingOfIntegers F))
      [p.IsMaximal] {K' : Type u_3} [Field K']
      [NumberField K'] [Algebra F K']
      (e : K ≃ₐ[F] K') :
      NumberField.frobeniusCycleType K p =
        NumberField.frobeniusCycleType K' p
    Isomorphic extensions of `F` have the same Frobenius cycle types. 
  • abbrevdefined in Mathlib/RingTheory/Frobenius.lean
    complete
    abbrev IsArithFrobAt.{u_1, u_2, u_3} (R : Type u_1) {S : Type u_2} [CommRing R]
      [CommRing S] [Algebra R S] {M : Type u_3} [Monoid M]
      [MulSemiringAction M S] [SMulCommClass M R S] (σ : M) (Q : Ideal S) :
      Prop
    abbrev IsArithFrobAt.{u_1, u_2, u_3}
      (R : Type u_1) {S : Type u_2}
      [CommRing R] [CommRing S] [Algebra R S]
      {M : Type u_3} [Monoid M]
      [MulSemiringAction M S]
      [SMulCommClass M R S] (σ : M)
      (Q : Ideal S) : Prop
    Suppose `S` is an `R` algebra, `M` is a monoid acting on `S` whose action is trivial on `R`
    `σ : M` is an (arithmetic) Frobenius at an ideal `Q` of `S` if `σ • x ≡ x ^ q (mod Q)` for all `x`.
    
  • defdefined in Mathlib/RingTheory/RamificationInertia/Inertia.lean
    complete
    def Ideal.inertiaDeg.{u_1, u_2} {S : Type u_1} [CommRing S] (q : Ideal S)
      (R : Type u_2) [CommRing R] [Algebra R S] : ℕ
    def Ideal.inertiaDeg.{u_1, u_2} {S : Type u_1}
      [CommRing S] (q : Ideal S)
      (R : Type u_2) [CommRing R]
      [Algebra R S] : ℕ
    Given a prime ideal `q` of an `R`-algebra `S`, the inertia degree of `q` over `R` is defined
    to be the degree of the residue field of `q` over the residue field of its preimage `p` in `R`.
    
    When `q` is not prime, we use a junk value of `0`.
    
    This will eventually replace the existing definition of `Ideal.inertiaDeg'`. 
Definition5.1.21
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 5.1.68
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Fundamental units of a number field. (LMFDB)

A minimal set of generators of a maximal torsion-free subgroup of the unit group of a number field K is called a set of fundamental units for K.

Tau Ceti Review: NumberField.Units.fundSystem, NumberField.Units.exist_unique_eq_mul_prod.

Depends on: Definition 5.1.1 Definition 5.1.88

Lean code for Definition5.1.21●3 declarations
  • defdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    def NumberField.Units.fundSystem.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Fin (NumberField.Units.rank K) → (NumberField.RingOfIntegers K)ˣ
    def NumberField.Units.fundSystem.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fin (NumberField.Units.rank K) →
        (NumberField.RingOfIntegers K)ˣ
    A fundamental system of units of `K`. The units of `fundSystem` are arbitrary lifts of the
    units in `basisModTorsion`. 
  • defdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    def NumberField.Units.basisModTorsion.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Module.Basis (Fin (NumberField.Units.rank K)) ℤ
        (Additive
          ((NumberField.RingOfIntegers K)ˣ ⧸ NumberField.Units.torsion K))
    def NumberField.Units.basisModTorsion.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Module.Basis
        (Fin (NumberField.Units.rank K)) ℤ
        (Additive
          ((NumberField.RingOfIntegers K)ˣ ⧸
            NumberField.Units.torsion K))
    A basis of the quotient `(𝓞 K)ˣ ⧸ (torsion K)` seen as an additive ℤ-module. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    theorem NumberField.Units.exist_unique_eq_mul_prod.{u_1} (K : Type u_1)
      [Field K] [NumberField K] (x : (NumberField.RingOfIntegers K)ˣ) :
      ∃! ζe, x = ↑ζe.1 * ∏ i, NumberField.Units.fundSystem K i ^ ζe.2 i
    theorem NumberField.Units.exist_unique_eq_mul_prod.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (x : (NumberField.RingOfIntegers K)ˣ) :
      ∃! ζe,
        x =
          ↑ζe.1 *
            ∏ i,
              NumberField.Units.fundSystem K
                  i ^
                ζe.2 i
    **Dirichlet Unit Theorem**. Any unit `x` of `𝓞 K` can be written uniquely as the product of
    a root of unity and powers of the units of the fundamental system `fundSystem`. 
Definition5.1.22
uses 1
Used by 11
Reverse dependency previews
Preview
Definition 5.1.23
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Galois closure of an extension. (LMFDB)

If K is a separable algebraic extension of a field F, then its Galois closure is the smallest extension field, in terms of inclusion, which contains K and is Galois over F. If K=F(\alpha) where \alpha has irreducible polynomial f over F, then the Galois closure of K is the splitting field of f over F.

Tau Ceti Review: IntermediateField.normalClosure, IsNormalClosure, IsGalois.normalClosure_of_isSeparable, IntermediateField.normalClosure_le_iff_of_normal.

Depends on: Definition 5.1.76

Lean code for Definition5.1.22●4 declarations
  • defdefined in Mathlib/FieldTheory/Normal/Closure.lean
    complete
    def IntermediateField.normalClosure.{u_1, u_2, u_3} (F : Type u_1)
      (K : Type u_2) (L : Type u_3) [Field F] [Field K] [Field L]
      [Algebra F K] [Algebra F L] : IntermediateField F L
    def IntermediateField.normalClosure.{u_1, u_2,
        u_3}
      (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K]
      [Field L] [Algebra F K] [Algebra F L] :
      IntermediateField F L
    The normal closure of `K/F` in `L/F`. 
  • class(2 methods)defined in Mathlib/FieldTheory/Normal/Closure.lean
    complete
    class IsNormalClosure.{u_1, u_2, u_3} (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K] [Field L] [Algebra F K]
      [Algebra F L] : Prop
    class IsNormalClosure.{u_1, u_2, u_3}
      (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K]
      [Field L] [Algebra F K] [Algebra F L] :
      Prop
    `L/F` is a normal closure of `K/F` if the minimal polynomial of every element of `K` over `F`
    splits in `L`, and `L` is generated by roots of such minimal polynomials over `F`.
    (Since the minimal polynomial of a transcendental element is 0,
    the normal closure of `K/F` is the same as the normal closure over `F`
    of the algebraic closure of `F` in `K`.) 
    splits : ∀ (x : K), (Polynomial.map (algebraMap F L) (minpoly F x)).Splits
    adjoin_rootSet : ⨆ x, IntermediateField.adjoin F ((minpoly F x).rootSet L) = ⊤
  • theoremdefined in Mathlib/FieldTheory/Galois/Basic.lean
    complete
    theorem IsGalois.normalClosure_of_isSeparable.{u_1, u_2, u_3} (k : Type u_1)
      (K : Type u_2) (F : Type u_3) [Field k] [Field K] [Field F]
      [Algebra k K] [Algebra k F] [Algebra.IsSeparable k K] [Normal k F] :
      IsGalois k ↥(IntermediateField.normalClosure k K F)
    theorem IsGalois.normalClosure_of_isSeparable.{u_1,
        u_2, u_3}
      (k : Type u_1) (K : Type u_2)
      (F : Type u_3) [Field k] [Field K]
      [Field F] [Algebra k K] [Algebra k F]
      [Algebra.IsSeparable k K] [Normal k F] :
      IsGalois k
        ↥(IntermediateField.normalClosure k K
            F)
    Let $F / K / k$ be a tower of field extensions. If $K$ is separable over $k$ and $F$ is normal
    over $k$, then the normal closure of $K$ over $k$ in $F$ is Galois over $k$. 
  • theoremdefined in Mathlib/FieldTheory/Normal/Closure.lean
    complete
    theorem IntermediateField.normalClosure_le_iff_of_normal.{u_1, u_3}
      {F : Type u_1} {L : Type u_3} [Field F] [Field L] [Algebra F L]
      [Normal F L] {K₁ K₂ : IntermediateField F L} [Normal F ↥K₂] :
      IntermediateField.normalClosure F (↥K₁) L ≤ K₂ ↔ K₁ ≤ K₂
    theorem IntermediateField.normalClosure_le_iff_of_normal.{u_1,
        u_3}
      {F : Type u_1} {L : Type u_3} [Field F]
      [Field L] [Algebra F L] [Normal F L]
      {K₁ K₂ : IntermediateField F L}
      [Normal F ↥K₂] :
      IntermediateField.normalClosure F (↥K₁)
            L ≤
          K₂ ↔
        K₁ ≤ K₂
Definition5.1.23
Statement uses 5
Statement dependency previews
Preview
Definition 1.1.30
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 14
Reverse dependency previews
Preview
Definition 2.67
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Galois group. (LMFDB)

Let K be a finite degree n separable extension of a field F, and K^{gal} be its Galois (or normal) closure. The Galois group for K/F is the automorphism group \Aut(K^{gal}/F).

This automorphism group acts on the n embeddings K\hookrightarrow K^{gal} via composition. As a result, we get an injection \Aut(K^{gal}/F)\hookrightarrow S_n, which is well-defined up to the labelling of the n embeddings, which corresponds to being well-defined up to conjugation in S_n.

We use the notation \Gal(K/F) for \Aut(K/F) when K=K^{gal}.

There is a naming convention for Galois groups up to degree 47.

Tau Ceti Review: Polynomial.Gal, Polynomial.Gal.galActionHom, Polynomial.Gal.galActionHom_injective, TauCeti.galEquivNormalClosure.

Depends on: Definition 5.2.3 Definition 5.1.14 Definition 5.1.22 Definition 5.1.76 Definition 1.1.30

Lean code for Definition5.1.23●4 declarations
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.{u_1} {F : Type u_1} [Field F] (p : Polynomial F) :
      Type u_1
    def Polynomial.Gal.{u_1} {F : Type u_1}
      [Field F] (p : Polynomial F) : Type u_1
    The Galois group of a polynomial. 
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.galActionHom.{u_1, u_2} {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    def Polynomial.Gal.galActionHom.{u_1, u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    `Polynomial.Gal.galAction` as a permutation representation 
  • theoremdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    theorem Polynomial.Gal.galActionHom_injective.{u_1, u_2} {F : Type u_1}
      [Field F] (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      Function.Injective ⇑(Polynomial.Gal.galActionHom p E)
    theorem Polynomial.Gal.galActionHom_injective.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      Function.Injective
        ⇑(Polynomial.Gal.galActionHom p E)
    `gal p` embeds as a subgroup of permutations of the roots of `p` in `E`. 
  • defdefined in TauCeti/FieldTheory/GaloisGroups/NormalClosure.lean
    complete
    def TauCeti.galEquivNormalClosure.{u_1, u_2} {F : Type u_1} {E : Type u_2}
      [Field F] [Field E] [Algebra F E] [Normal F E] (x : E) :
      (minpoly F x).Gal ≃*
        Gal(↥(IntermediateField.normalClosure F (↥F⟮x⟯) E)/F)
    def TauCeti.galEquivNormalClosure.{u_1, u_2}
      {F : Type u_1} {E : Type u_2} [Field F]
      [Field E] [Algebra F E] [Normal F E]
      (x : E) :
      (minpoly F x).Gal ≃*
        Gal(↥(IntermediateField.normalClosure
              F (↥F⟮x⟯) E)/F)
    The Galois group of a minimal polynomial is the automorphism group of the normal
    closure of the simple extension, via conjugation by the field comparison. 
Definition5.1.24
uses 0used by 0✓L∃∀N

Galois module structure of Type I (i) for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type I (i) means that there is a generating set for U/\{\pm 1\} consisting of fundamental units of the quadratic subfields.

Tau Ceti Review: TauCeti.NumberField.Units.torsion_eq_one_or_neg_one_of_isReal.

Lean code for Definition5.1.24●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeI₁.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeI₁.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type I (i)** in the notation of Mazur and
    Ullom (LMFDB `nf.galois_group.gmodule_v4_type_i_i`): `U/{±1}` is generated by fundamental units
    `e₁, e₂, e₃` of the three quadratic subfields of `K`. Only meaningful for real biquadratic `K`,
    where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/Units/Torsion.lean
    complete
    theorem TauCeti.NumberField.Units.torsion_eq_one_or_neg_one_of_isReal.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {w : NumberField.InfinitePlace K} (hw : w.IsReal)
      (x : ↥(NumberField.Units.torsion K)) : ↑x = 1 ∨ ↑x = -1
    theorem TauCeti.NumberField.Units.torsion_eq_one_or_neg_one_of_isReal.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {w : NumberField.InfinitePlace K}
      (hw : w.IsReal)
      (x : ↥(NumberField.Units.torsion K)) :
      ↑x = 1 ∨ ↑x = -1
    In a number field with a real infinite place, every torsion unit is `1` or `-1`. 
Definition5.1.25
uses 0used by 0✓L∃∀N

Galois module structure of Type I (ii) for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type I (ii) means that there are fundamental units e_1,e_2,e_3 of the three quadratic subfields such that \sqrt{e_1},e_2,e_3 generate the rank 3 group U/\{\pm 1\}.

Lean code for Definition5.1.25●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeI₂.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeI₂.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type I (ii)** in the notation of Mazur and
    Ullom (LMFDB `nf.galois_group.gmodule_v4_type_i_ii`): for some fundamental units `e₁, e₂, e₃` of
    the three quadratic subfields of `K`, the classes `√e₁, e₂, e₃` generate `U/{±1}`. Only
    meaningful for real biquadratic `K`, where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    **The units modulo torsion of a real biquadratic field have rank `3`**: `U/{±1}` has rank `3`
    over `ℤ`, by Mathlib's Dirichlet unit theorem and `NumberField.Units.rank_eq_three`. 
Definition5.1.26
uses 0used by 0✓L∃∀N

Galois module structure of Type I (iii) for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type I (iii) means that there are fundamental units e_1,e_2,e_3 of the three quadratic subfields such that \sqrt{e_1},\sqrt{e_2},e_3 generate the rank 3 group U/\{\pm 1\}.

Lean code for Definition5.1.26●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeI₃.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeI₃.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type I (iii)** in the notation of Mazur and
    Ullom (LMFDB `nf.galois_group.gmodule_v4_type_i_iii`): for some fundamental units `e₁, e₂, e₃` of
    the three quadratic subfields of `K`, the classes `√e₁, √e₂, e₃` generate `U/{±1}`. Only
    meaningful for real biquadratic `K`, where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    **The units modulo torsion of a real biquadratic field have rank `3`**: `U/{±1}` has rank `3`
    over `ℤ`, by Mathlib's Dirichlet unit theorem and `NumberField.Units.rank_eq_three`. 
Definition5.1.27
uses 0used by 0✓L∃∀N

Galois module structure of Type II (i) for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type II (i) means that there are fundamental units e_1,e_2,e_3 of the three quadratic subfields such that \sqrt{e_1e_2},e_2,e_3 generate the rank 3 group U/\{\pm 1\}.

Lean code for Definition5.1.27●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeII₁.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeII₁.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type II (i)** in the notation of Mazur and
    Ullom (LMFDB `nf.galois_group.gmodule_v4_type_ii_i`): for some fundamental units `e₁, e₂, e₃` of
    the three quadratic subfields of `K`, the classes `√(e₁e₂), e₂, e₃` generate `U/{±1}`. Only
    meaningful for real biquadratic `K`, where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    **The units modulo torsion of a real biquadratic field have rank `3`**: `U/{±1}` has rank `3`
    over `ℤ`, by Mathlib's Dirichlet unit theorem and `NumberField.Units.rank_eq_three`. 
Definition5.1.28
uses 0used by 0✓L∃∀N

Galois module structure of Type II (ii) for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type II (ii) means that there are fundamental units e_1,e_2,e_3 of the three quadratic subfields such that \sqrt{e_1e_2},e_2,\sqrt{e_3} generate the rank 3 group U/\{\pm 1\}.

Lean code for Definition5.1.28●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeII₂.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeII₂.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type II (ii)** in the notation of Mazur
    and Ullom (LMFDB `nf.galois_group.gmodule_v4_type_ii_ii`): for some fundamental units `e₁, e₂, e₃`
    of the three quadratic subfields of `K`, the classes `√(e₁e₂), e₂, √e₃` generate `U/{±1}`. Only
    meaningful for real biquadratic `K`, where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    **The units modulo torsion of a real biquadratic field have rank `3`**: `U/{±1}` has rank `3`
    over `ℤ`, by Mathlib's Dirichlet unit theorem and `NumberField.Units.rank_eq_three`. 
Definition5.1.29
uses 0used by 0✓L∃∀N

Galois module structure of Type III for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type III means that there are fundamental units e_1,e_2,e_3 of the three quadratic subfields such that \sqrt{e_1e_2},\sqrt{e_2e_3},\sqrt{e_3e_1} generate the rank 3 group U/\{\pm 1\}.

Lean code for Definition5.1.29●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeIII.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeIII.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type III** in the notation of Mazur and
    Ullom (LMFDB `nf.galois_group.gmodule_v4_type_iii`): for some fundamental units `e₁, e₂, e₃` of the
    three quadratic subfields of `K`, the classes `√(e₁e₂), √(e₂e₃), √(e₃e₁)` generate `U/{±1}`.
    Only meaningful for real biquadratic `K`, where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    **The units modulo torsion of a real biquadratic field have rank `3`**: `U/{±1}` has rank `3`
    over `ℤ`, by Mathlib's Dirichlet unit theorem and `NumberField.Units.rank_eq_three`. 
Definition5.1.30
uses 0used by 0✓L∃∀N

Galois module structure of Type IV for units in biquadratic number fields. (LMFDB)

The notation follows Mazur and Ullom, Galois module structure of units in real biquadratic number fields, Acta Arithmetica 111.2 (2004) . There are four basic types, I-IV, which describe the structure of the units U modulo roots of unity. The subtype describes the actual structure of the units. Type IV means that there are fundamental units e_1,e_2,e_3 of the three quadratic subfields such that \sqrt{e_1e_2e_3},e_2,e_3 generate the rank 3 group U/\{\pm 1\}.

Lean code for Definition5.1.30●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    def NumberField.Units.IsMazurUllomTypeIV.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Prop
    def NumberField.Units.IsMazurUllomTypeIV.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Prop
    The units `U` of a real biquadratic field `K` have **type IV** in the notation of Mazur and
    Ullom (LMFDB `nf.galois_group.gmodule_v4_type_iv`): for some fundamental units `e₁, e₂, e₃` of the
    three quadratic subfields of `K`, the classes `√(e₁e₂e₃), e₂, e₃` generate `U/{±1}`. Only
    meaningful for real biquadratic `K`, where `(𝓞 K)ˣ ⧸ torsion K` is `U/{±1}`. 
  • structure(3 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/Biquadratic.lean
    complete
    structure NumberField.Units.QuadraticUnitFrame.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    structure NumberField.Units.QuadraticUnitFrame.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    A **frame of quadratic units** of `K`: a labelling `k₁, k₂, k₃` of the quadratic subfields of
    `K`, together with a fundamental unit `eᵢ` of each `kᵢ`. A frame exists exactly when `K` has three
    quadratic subfields, all with fundamental units, as a real biquadratic field has
    (`nonempty_quadraticUnitFrame`). The indices `0, 1, 2` stand for `1, 2, 3`. 
    subfield : Fin 3 ≃ { k // Module.finrank ℚ ↥k = 2 }
    The labelling `i ↦ kᵢ` of the quadratic subfields of `K`. 
    unit : (i : Fin 3) → (NumberField.RingOfIntegers ↥↑(self.subfield i))ˣ
    The fundamental unit `eᵢ` of `kᵢ`. 
    isFundamentalUnit_unit : ∀ (i : Fin 3), NumberField.Units.IsFundamentalUnit (self.unit i)
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticClassification.lean
    complete
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t, NumberField.Units.IsMazurUllomType K t
    theorem NumberField.Units.existsUnique_isMazurUllomType.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      ∃! t,
        NumberField.Units.IsMazurUllomType K t
    **The classification of Kubota and of Mazur and Ullom**: every real biquadratic field has
    exactly one of the seven subtypes I (i), I (ii), I (iii), II (i), II (ii), III and IV, which say
    how square roots of products of fundamental units of its quadratic subfields generate its units
    modulo `±1`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    def NumberField.Units.MazurUllomBasicType.rep
      (T : NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    def NumberField.Units.MazurUllomBasicType.rep
      (T :
        NumberField.Units.MazurUllomBasicType) :
      Representation ℤ (ℤˣ × ℤˣ) ↥T.lattice
    **The `ℤ[V₄]`-module of the basic type `T`** of Mazur and Ullom, for `V₄ = ℤˣ × ℤˣ`: the lattice
    `T.lattice` of `ℤ³`, on which `g` multiplies the `j`-th coordinate by `χⱼ g`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T : NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp T.rep φ.toMonoidHom))
    theorem NumberField.Units.isMazurUllomBasicType_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {T :
        NumberField.Units.MazurUllomBasicType} :
      NumberField.Units.IsMazurUllomBasicType
          K T ↔
        ∃ φ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp T.rep
                φ.toMonoidHom))
    **The basic type is the isomorphism class of the Galois module** (Mazur and Ullom, Theorem 1
    and Remark 1): a real biquadratic field `K` has the basic type `T` iff its units modulo torsion
    `U/{±1}` are isomorphic, as a `ℤ[Gal(K/ℚ)]`-module, to the module `T.rep` along some isomorphism
    `Gal(K/ℚ) ≃* V₄`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/MazurUllomModule.lean
    complete
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T : NumberField.Units.MazurUllomBasicType)
      {T' : NumberField.Units.MazurUllomBasicType} (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e : T.rep.Equiv (MonoidHom.comp T'.rep ψ.toMonoidHom)) : T = T'
    theorem NumberField.Units.MazurUllomBasicType.eq_of_equiv
      (T :
        NumberField.Units.MazurUllomBasicType)
      {T' :
        NumberField.Units.MazurUllomBasicType}
      (ψ : ℤˣ × ℤˣ ≃* ℤˣ × ℤˣ)
      (e :
        T.rep.Equiv
          (MonoidHom.comp T'.rep
            ψ.toMonoidHom)) :
      T = T'
    **The four modules of Mazur and Ullom are pairwise non-isomorphic, even after an automorphism
    of `V₄`** (their Remark 1): if the module of type `T` is isomorphic as a `ℤ[V₄]`-module to the
    module of type `T'` twisted by an automorphism `ψ` of `V₄ = ℤˣ × ℤˣ`, then `T = T'`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.exists_equiv_iff.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K'] [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep K).Equiv
              (MonoidHom.comp (NumberField.Units.modTorsionRep K')
                ψ.toMonoidHom))) ↔
        ∀ (T : NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType K T ↔
            NumberField.Units.IsMazurUllomBasicType K' T
    theorem NumberField.Units.exists_equiv_iff.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K]
      {K' : Type u_2} [Field K']
      [NumberField K'] [IsGalois ℚ K']
      [IsKleinFour Gal(K'/ℚ)]
      [NumberField.IsTotallyReal K'] :
      (∃ ψ,
          Nonempty
            ((NumberField.Units.modTorsionRep
                  K).Equiv
              (MonoidHom.comp
                (NumberField.Units.modTorsionRep
                  K')
                ψ.toMonoidHom))) ↔
        ∀
          (T :
            NumberField.Units.MazurUllomBasicType),
          NumberField.Units.IsMazurUllomBasicType
              K T ↔
            NumberField.Units.IsMazurUllomBasicType
              K' T
    **Two real biquadratic fields have isomorphic Galois modules iff they have the same basic
    type**: the units modulo torsion of `K` and `K'` are isomorphic, along some isomorphism
    `ψ : Gal(K/ℚ) ≃* Gal(K'/ℚ)` of their Galois groups, iff `K` and `K'` have the same basic type. So
    the basic type is an invariant of the Galois module, and determines it. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/BiquadraticGaloisModule.lean
    complete
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1} {K : Type u_1}
      [Field K] [NumberField K] [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    theorem NumberField.Units.finrank_modTorsion_eq_three.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      [IsGalois ℚ K] [IsKleinFour Gal(K/ℚ)]
      [NumberField.IsTotallyReal K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        3
    **The units modulo torsion of a real biquadratic field have rank `3`**: `U/{±1}` has rank `3`
    over `ℤ`, by Mathlib's Dirichlet unit theorem and `NumberField.Units.rank_eq_three`. 
Definition5.1.31
Statement uses 2
Statement dependency previews
Preview
Definition 8.1.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 5.1.33
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Galois group of a number field -- naming convention. (LMFDB)

Each Galois group is identified by its degree and an index called its T-number. This specifies both the abstract group and a faithful transitive permutation of that group. One may search for a group in the form nTt where n is the degree and t is the T-number. The search results will then only show fields where the Galois group matches the requested permutation representation.

For familiar groups one can use short names of the form <code>Cj</code> <code>Dj</code>, <code>Sj</code>, <code>Aj</code> (1\leq j\leq 47), for cyclic, dihedral, symmetric, and alternating groups, or from the table below.

An abstract group may have more than one representation as a Galois group. Correspondingly, the familiar symbol for a group may represent several Galois groups. When searching for fields using the name of an abstract group, e.g., <code>S3</code>, the results may contain fields with different degrees and permutation representations.

Tau Ceti Review: Polynomial.Gal.galActionHom, TauCeti.hasGaloisLabel_X_pow_three_sub_two.

Depends on: Definition 8.1.5 Definition 8.1.26

Lean code for Definition5.1.31●8 declarations
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.galActionHom.{u_1, u_2} {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    def Polynomial.Gal.galActionHom.{u_1, u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    `Polynomial.Gal.galAction` as a permutation representation 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/GaloisGroupCubeRootTwo.lean
    complete
    theorem Polynomial.exists_card_rootSet_eq_six_and_nonempty_gal_mulEquiv :
      ∃ g,
        Irreducible g ∧
          Fintype.card ↑(g.rootSet ℂ) = 6 ∧
            Nonempty (g.Gal ≃* Equiv.Perm (Fin 3))
    theorem Polynomial.exists_card_rootSet_eq_six_and_nonempty_gal_mulEquiv :
      ∃ g,
        Irreducible g ∧
          Fintype.card ↑(g.rootSet ℂ) = 6 ∧
            Nonempty
              (g.Gal ≃* Equiv.Perm (Fin 3))
    **An abstract group may have more than one representation as a Galois group** (LMFDB
    `nf.galois_group.name`): the symmetric group `S₃`, the Galois group of the irreducible cubic
    `X³ - 2` acting on its three complex roots, is also the Galois group of an irreducible polynomial
    over `ℚ` acting on six complex roots, the minimal polynomial of a primitive element of the
    splitting field of `X³ - 2`. 
  • defdefined in LeanBridge/ForMathlib/FieldTheory/GaloisGroupCubeRootTwo.lean
    complete
    def Polynomial.galXPowThreeSubTwoMulEquiv :
      (Polynomial.X ^ 3 - 2).Gal ≃* Equiv.Perm (Fin 3)
    def Polynomial.galXPowThreeSubTwoMulEquiv :
      (Polynomial.X ^ 3 - 2).Gal ≃*
        Equiv.Perm (Fin 3)
    The Galois group of `X³ - 2` over `ℚ`, the Galois group of the pure cubic field `ℚ(∛2)`, is the
    symmetric group `S₃`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/GaloisGroupCubeRootTwo.lean
    complete
    theorem Polynomial.bijective_galActionHom_X_pow_three_sub_two :
      Function.Bijective
        ⇑(Polynomial.Gal.galActionHom (Polynomial.X ^ 3 - 2) ℂ)
    theorem Polynomial.bijective_galActionHom_X_pow_three_sub_two :
      Function.Bijective
        ⇑(Polynomial.Gal.galActionHom
            (Polynomial.X ^ 3 - 2) ℂ)
    **The Galois group of `X³ - 2` over `ℚ` is the full symmetric group on its three complex
    roots**, the transitive group `3T2`: its action on the roots is bijective onto the permutations. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/GaloisGroupCubeRootTwo.lean
    complete
    theorem Polynomial.card_rootSet_X_pow_three_sub_two :
      Fintype.card ↑((Polynomial.X ^ 3 - 2).rootSet ℂ) = 3
    theorem Polynomial.card_rootSet_X_pow_three_sub_two :
      Fintype.card
          ↑((Polynomial.X ^ 3 - 2).rootSet
              ℂ) =
        3
    **`X³ - 2` has three complex roots.** 
  • theoremdefined in TauCeti/FieldTheory/GaloisGroups/Cubic.lean
    complete
    theorem TauCeti.hasGaloisLabel_X_pow_three_sub_two :
      TauCeti.HasGaloisLabel (Polynomial.X ^ 3 - 2)
        ⟨1, TauCeti.hasGaloisLabel_three_one_iff._proof_1⟩
    theorem TauCeti.hasGaloisLabel_X_pow_three_sub_two :
      TauCeti.HasGaloisLabel
        (Polynomial.X ^ 3 - 2)
        ⟨1,
          TauCeti.hasGaloisLabel_three_one_iff._proof_1⟩
    **`X³ - 2` has label `3T2`**: its Galois group over `ℚ` is the symmetric group on its three
    roots. The discriminant `-108` is negative, hence not a square. 
  • defdefined in LeanBridge/ForMathlib/FieldTheory/GaloisGroupCubeRootTwo.lean
    complete
    def Polynomial.galMinpolySplittingFieldXPowThreeSubTwoMulEquiv
      {y : (Polynomial.X ^ 3 - 2).SplittingField} (hy : ℚ⟮y⟯ = ⊤) :
      (minpoly ℚ y).Gal ≃* Equiv.Perm (Fin 3)
    def Polynomial.galMinpolySplittingFieldXPowThreeSubTwoMulEquiv
      {y :
        (Polynomial.X ^ 3 - 2).SplittingField}
      (hy : ℚ⟮y⟯ = ⊤) :
      (minpoly ℚ y).Gal ≃* Equiv.Perm (Fin 3)
    The Galois group of the minimal polynomial of a primitive element `y` of the splitting field
    of `X³ - 2`, the Galois group of the sextic Galois closure of `ℚ(∛2)`, is the symmetric group
    `S₃`. 
  • theoremdefined in LeanBridge/ForMathlib/FieldTheory/GaloisGroupCubeRootTwo.lean
    complete
    theorem Polynomial.card_rootSet_minpoly_splittingField_X_pow_three_sub_two
      {y : (Polynomial.X ^ 3 - 2).SplittingField} (hy : ℚ⟮y⟯ = ⊤) :
      Fintype.card ↑((minpoly ℚ y).rootSet ℂ) = 6
    theorem Polynomial.card_rootSet_minpoly_splittingField_X_pow_three_sub_two
      {y :
        (Polynomial.X ^ 3 - 2).SplittingField}
      (hy : ℚ⟮y⟯ = ⊤) :
      Fintype.card
          ↑((minpoly ℚ y).rootSet ℂ) =
        6
    **The Galois group of a defining polynomial of the splitting field of `X³ - 2` acts on six
    complex roots**: as an abstract group it is `S₃`
    (`Polynomial.galMinpolySplittingFieldXPowThreeSubTwoMulEquiv`), and as a permutation group it has
    degree `6`, not `3`. It is the transitive group `6T2` of the LMFDB, a label that is not formalised
    here: Tau Ceti's labels stop at degree `5`. 
Definition5.1.32
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Galois root discriminant. (LMFDB)

The Galois root discriminant of a number field is the root discriminant of its Galois closure.

Tau Ceti Review: IntermediateField.normalClosure, IsNormalClosure.

Depends on: Definition 5.1.1 Definition 5.1.22 Definition 5.1.75

Lean code for Definition5.1.32●3 definitions
  • defdefined in Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean
    complete
    def NumberField.rootDiscr.{u_1} (K : Type u_1) [Field K] [NumberField K] : ℝ
    def NumberField.rootDiscr.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : ℝ
    The root discriminant of a number field `K`. 
  • defdefined in Mathlib/FieldTheory/Normal/Closure.lean
    complete
    def IntermediateField.normalClosure.{u_1, u_2, u_3} (F : Type u_1)
      (K : Type u_2) (L : Type u_3) [Field F] [Field K] [Field L]
      [Algebra F K] [Algebra F L] : IntermediateField F L
    def IntermediateField.normalClosure.{u_1, u_2,
        u_3}
      (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K]
      [Field L] [Algebra F K] [Algebra F L] :
      IntermediateField F L
    The normal closure of `K/F` in `L/F`. 
  • class(2 methods)defined in Mathlib/FieldTheory/Normal/Closure.lean
    complete
    class IsNormalClosure.{u_1, u_2, u_3} (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K] [Field L] [Algebra F K]
      [Algebra F L] : Prop
    class IsNormalClosure.{u_1, u_2, u_3}
      (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K]
      [Field L] [Algebra F K] [Algebra F L] :
      Prop
    `L/F` is a normal closure of `K/F` if the minimal polynomial of every element of `K` over `F`
    splits in `L`, and `L` is generated by roots of such minimal polynomials over `F`.
    (Since the minimal polynomial of a transcendental element is 0,
    the normal closure of `K/F` is the same as the normal closure over `F`
    of the algebraic closure of `F` in `K`.) 
    splits : ∀ (x : K), (Polynomial.map (algebraMap F L) (minpoly F x)).Splits
    adjoin_rootSet : ⨆ x, IntermediateField.adjoin F ((minpoly F x).rootSet L) = ⊤
Definition5.1.33
Statement uses 4
Statement dependency previews
Preview
Definition 5.1.23
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Galois group. (LMFDB)

Definition 5.1.23

To specify a Galois group, you can give its GAP id (e.g. [8,3] or [16,7]), a name (e.g. C5 or S12) or a transitive group label (e.g. 7T2 or 11T5).

Tau Ceti Review: Polynomial.Gal, Polynomial.Gal.galActionHom, Polynomial.Gal.galActionHom_injective, TauCeti.galEquivNormalClosure.

Depends on: Definition 8.1.14 Definition 8.3.147 Definition 5.1.23 Definition 5.1.31

Lean code for Definition5.1.33●4 declarations
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.{u_1} {F : Type u_1} [Field F] (p : Polynomial F) :
      Type u_1
    def Polynomial.Gal.{u_1} {F : Type u_1}
      [Field F] (p : Polynomial F) : Type u_1
    The Galois group of a polynomial. 
  • defdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    def Polynomial.Gal.galActionHom.{u_1, u_2} {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    def Polynomial.Gal.galActionHom.{u_1, u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      p.Gal →* Equiv.Perm ↑(p.rootSet E)
    `Polynomial.Gal.galAction` as a permutation representation 
  • theoremdefined in Mathlib/FieldTheory/PolynomialGaloisGroup.lean
    complete
    theorem Polynomial.Gal.galActionHom_injective.{u_1, u_2} {F : Type u_1}
      [Field F] (p : Polynomial F) (E : Type u_2) [Field E] [Algebra F E]
      [Fact (Polynomial.map (algebraMap F E) p).Splits] :
      Function.Injective ⇑(Polynomial.Gal.galActionHom p E)
    theorem Polynomial.Gal.galActionHom_injective.{u_1,
        u_2}
      {F : Type u_1} [Field F]
      (p : Polynomial F) (E : Type u_2)
      [Field E] [Algebra F E]
      [Fact
          (Polynomial.map (algebraMap F E)
              p).Splits] :
      Function.Injective
        ⇑(Polynomial.Gal.galActionHom p E)
    `gal p` embeds as a subgroup of permutations of the roots of `p` in `E`. 
  • defdefined in TauCeti/FieldTheory/GaloisGroups/NormalClosure.lean
    complete
    def TauCeti.galEquivNormalClosure.{u_1, u_2} {F : Type u_1} {E : Type u_2}
      [Field F] [Field E] [Algebra F E] [Normal F E] (x : E) :
      (minpoly F x).Gal ≃*
        Gal(↥(IntermediateField.normalClosure F (↥F⟮x⟯) E)/F)
    def TauCeti.galEquivNormalClosure.{u_1, u_2}
      {F : Type u_1} {E : Type u_2} [Field F]
      [Field E] [Algebra F E] [Normal F E]
      (x : E) :
      (minpoly F x).Gal ≃*
        Gal(↥(IntermediateField.normalClosure
              F (↥F⟮x⟯) E)/F)
    The Galois group of a minimal polynomial is the automorphism group of the normal
    closure of the simple extension, via conjugation by the field comparison. 
Definition5.1.34
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Generator of a number field. (LMFDB)

A generator of a number field K is an element a\in K such that K=\Q(a). The minimal polynomial of a generator is a defining polynomial for K.

Tau Ceti Review: IntermediateField.adjoin, IntermediateField.adjoinRootEquivAdjoin, Field.exists_primitive_element.

Depends on: Definition 5.1.1 Definition 5.1.12 Definition 5.1.49

Lean code for Definition5.1.34●3 declarations
  • defdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean
    complete
    def IntermediateField.adjoin.{u_1, u_2} (F : Type u_1) [Field F]
      {E : Type u_2} [Field E] [Algebra F E] (S : Set E) :
      IntermediateField F E
    def IntermediateField.adjoin.{u_1, u_2}
      (F : Type u_1) [Field F] {E : Type u_2}
      [Field E] [Algebra F E] (S : Set E) :
      IntermediateField F E
    `adjoin F S` extends a field `F` by adjoining a set `S ⊆ E`. 
  • defdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
    complete
    def IntermediateField.adjoinRootEquivAdjoin.{u_1, u_2} (F : Type u_1)
      [Field F] {E : Type u_2} [Field E] [Algebra F E] {α : E}
      (h : IsIntegral F α) : AdjoinRoot (minpoly F α) ≃ₐ[F] ↥F⟮α⟯
    def IntermediateField.adjoinRootEquivAdjoin.{u_1,
        u_2}
      (F : Type u_1) [Field F] {E : Type u_2}
      [Field E] [Algebra F E] {α : E}
      (h : IsIntegral F α) :
      AdjoinRoot (minpoly F α) ≃ₐ[F] ↥F⟮α⟯
    algebra isomorphism between `AdjoinRoot` and `F⟮α⟯` 
  • theoremdefined in Mathlib/FieldTheory/PrimitiveElement.lean
    complete
    theorem Field.exists_primitive_element.{u_1, u_2} (F : Type u_1) (E : Type u_2)
      [Field F] [Field E] [Algebra F E] [FiniteDimensional F E]
      [Algebra.IsSeparable F E] : ∃ α, F⟮α⟯ = ⊤
    theorem Field.exists_primitive_element.{u_1, u_2}
      (F : Type u_1) (E : Type u_2) [Field F]
      [Field E] [Algebra F E]
      [FiniteDimensional F E]
      [Algebra.IsSeparable F E] :
      ∃ α, F⟮α⟯ = ⊤
    **Primitive element theorem**: a finite separable field extension `E` of `F` has a
    primitive element, i.e. there is an `α ∈ E` such that `F⟮α⟯ = (⊤ : Subalgebra F E)`. 
Definition5.1.35
uses 0used by 0XL∃∀N

Hilbert modular form convention for the label of a number field ideal. (LMFDB)

In the Hilbert modular form pages, an ideal I of a number field is represented by the label [N,m,\alpha], where N is the absolute norm of the ideal, m is the smallest rational integer in the ideal, and \alpha is an element chosen so that (m,\alpha)=I.

Definition5.1.36
Statement uses 4
Statement dependency previews
Preview
Definition 1.1.33
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 4.1.29
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Ideal class group of a number field. (LMFDB)

The ideal class group of a number field K with ring of integers O_K is the group of equivalence classes of ideals, given by the quotient of the multiplicative group of all fractional ideals of O_K by the subgroup of principal fractional ideals.

Since K is a number field, the ideal class group of K is a finite abelian group, and so has the structure of a product of cyclic groups encoded by a finite list [a_1,\dots,a_n], where the a_i are positive integers with a_i\mid a_{i+1} for 1\leq i < n.

Tau Ceti Review: ClassGroup.

Depends on: Definition 5.1.1 Definition 5.1.74 Definition 1.1.33 Definition 1.1.42

Lean code for Definition5.1.36●1 definition
  • defdefined in Mathlib/RingTheory/ClassGroup/Basic.lean
    complete
    def ClassGroup.{u_1} (R : Type u_1) [CommRing R] [IsDomain R] : Type u_1
    def ClassGroup.{u_1} (R : Type u_1)
      [CommRing R] [IsDomain R] : Type u_1
    The ideal class group of `R` is the group of invertible fractional ideals
    modulo the principal ideals. 
Definition5.1.37
uses 1
Used by 6
Reverse dependency previews
Preview
Definition 3.3.5
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Ideal labels. (LMFDB)

In the LMFDB ideals in rings of integers of number fields are identified using the labeling system developed by John Cremona, Aurel Page and Andrew Sutherland .

In a number field K, each nonzero ideal I of its ring of integers \mathcal{O}_K is assigned an ideal label of the form \texttt{N.i}, where N and i are positive integers, in which N:=[\mathcal{O}_K:I] is the norm of the ideal and i is the index of the ideal in a sorted list of all ideals of norm N. Once an integral primitive element \alpha for the field K is fixed, the ordering of ideals of the same norm is defined in a deterministic fashion (involving no arbitrary choices).

In the LMFDB we always represent number fields as K = \mathbb{Q}[X]/(g(X)) where g is the unique monic integral polynomial which satisfies the polredabs condition. In this representation the image of X under the quotient map \mathbb{Q}[X]\rightarrow\mathbb{Q}[X]/(g(X)) is a canonical integral primitive element \alpha for K. Fixing this element determines a unique ordering of all \mathcal{O}_K-ideals of the same norm.

Depends on: Definition 5.1.62

Lean code for Definition5.1.37●6 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/IdealLabelOrder.lean
    complete
    def NumberField.lmfdbIdealLabel.{u_1} {K : Type u_1} [Field K]
      [NumberField K]
      (e₀ :
        AdjoinRoot
            (Polynomial.map (Int.castRingHom ℚ)
              (NumberField.polredabs K)) ≃ₐ[ℚ]
          K)
      (𝔞 : Ideal (NumberField.RingOfIntegers K)) : ℕ × ℕ
    def NumberField.lmfdbIdealLabel.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (e₀ :
        AdjoinRoot
            (Polynomial.map
              (Int.castRingHom ℚ)
              (NumberField.polredabs K)) ≃ₐ[ℚ]
          K)
      (𝔞 :
        Ideal
          (NumberField.RingOfIntegers K)) :
      ℕ × ℕ
    The **LMFDB ideal label** `N.i` (LMFDB `nf.ideal_labels`) of an ideal of `𝓞 K`, for `K`
    represented as `ℚ[X]/(g)` through an isomorphism `e₀`, `g = polredabs K` the reduced defining
    polynomial of `K` (LMFDB `nf.polredabs`): the label `idealLabel α` for the canonical integral
    primitive element `α`, the image of the class of `X`. The LMFDB's fields are `ℚ[X]/(g)` itself,
    with `e₀` the identity (up to `polredabs K = g`, `IsPolredabs.eq`). For an abstract `K` the labels
    depend on `e₀`: two such isomorphisms `e₀` and `σ ∘ e₀` differ by an automorphism `σ` of `K`, and
    by transport of structure (not formalised here) the label of `𝔞` for `σ ∘ e₀` is that of `σ⁻¹(𝔞)`
    for `e₀`. For instance, complex conjugation exchanges the ideals `5.1 = (i + 2)` and `5.2 = (i - 2)`
    of `ℚ(i)`, so these labels are only defined up to `Aut(K)` on an abstract `K`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/IdealLabelOrder.lean
    complete
    def NumberField.idealLabel.{u_1} {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (I : Ideal (NumberField.RingOfIntegers K)) : ℕ × ℕ
    def NumberField.idealLabel.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (I :
        Ideal
          (NumberField.RingOfIntegers K)) :
      ℕ × ℕ
    The **ideal label** `N.i` (LMFDB `nf.ideal_labels`) of an ideal `I` of `𝓞 K`, for the integral
    primitive element `α` of `K` (Cremona–Page–Sutherland, arXiv:2005.09491, §3), as the pair
    `(N, i)`: its norm `N = [𝓞 K : I]` and its index `i` in the list of the ideals of norm `N` sorted by
    the Cremona–Page–Sutherland order `IdealLT α`. The LMFDB takes `K = ℚ[X]/(g)` and `α` the class of
    `X`, `g` the reduced defining polynomial of `K` (`NumberField.polredabs`), and labels the nonzero
    ideals. The order is total when `α` generates `K` (`isStrictTotalOrder_idealLT`), and then the label
    determines the ideal (`idealLabel_injective`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/IdealLabelOrder.lean
    complete
    def NumberField.IdealLT.{u_1} {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (I J : Ideal (NumberField.RingOfIntegers K)) : Prop
    def NumberField.IdealLT.{u_1} {K : Type u_1}
      [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (I J :
        Ideal
          (NumberField.RingOfIntegers K)) :
      Prop
    The **Cremona–Page–Sutherland order** (LMFDB `nf.ideal_labels`) on the ideals of `𝓞 K`, for
    the integral primitive element `α` (arXiv:2005.09491, §3): by norm, and then by the key
    `idealKey α`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/IdealLabelOrder.lean
    complete
    theorem NumberField.idealLabel_injective.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (α : NumberField.RingOfIntegers K) (hα : ℚ⟮↑α⟯ = ⊤) :
      Function.Injective (NumberField.idealLabel α)
    theorem NumberField.idealLabel_injective.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (hα : ℚ⟮↑α⟯ = ⊤) :
      Function.Injective
        (NumberField.idealLabel α)
    **An ideal is determined by its label.** 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/PrimeIdealOrder.lean
    complete
    def NumberField.primeKey.{u_1} {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (𝔭 :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K)) :
      Lex (ℕ × Lex (ℕ × Lex (ℕ → Lex (ℕ → ℕ))))
    def NumberField.primeKey.{u_1} {K : Type u_1}
      [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (𝔭 :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K)) :
      Lex
        (ℕ × Lex (ℕ × Lex (ℕ → Lex (ℕ → ℕ))))
    The **Cremona–Page–Sutherland key** (LMFDB `nf.ideal_labels`) of a prime `𝔭` of `K`, for the
    integral primitive element `α` (arXiv:2005.09491, §2): its norm `N(𝔭) = p ^ f`, its ramification
    index `e(𝔭/p)` and the digit vector of its `p`-adic factor, ordered lexicographically. The primes
    are ordered first by norm, then by ramification index, and the primes above the same `p` of the same
    norm and ramification index by the lexicographic order of the digit vectors of their `p`-adic
    factors. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/PrimeIdealOrder.lean
    complete
    def NumberField.padicFactor.{u_1} {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers ℚ))
      (w : { w // w.asIdeal.LiesOver v.asIdeal }) :
      Polynomial (IsDedekindDomain.HeightOneSpectrum.adicCompletion ℚ v)
    def NumberField.padicFactor.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (α : NumberField.RingOfIntegers K)
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers ℚ))
      (w :
        { w //
          w.asIdeal.LiesOver v.asIdeal }) :
      Polynomial
        (IsDedekindDomain.HeightOneSpectrum.adicCompletion
          ℚ v)
    The **`p`-adic factor** (LMFDB `nf.ideal_labels`) of a prime `𝔭` of `K` above the prime `p` of
    `ℚ` given by `v` (Cremona–Page–Sutherland, arXiv:2005.09491, §2.2): the irreducible factor over
    `ℚ_p = ℚ_v` of the minimal polynomial of `α` that corresponds to `𝔭`, the one with `h(α) = 0` in
    the completion `K_𝔭`. It is the minimal polynomial over `ℚ_v` of the image of `α` in `K_𝔭`. 
Definition5.1.38
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Index of an order. (LMFDB)

Let \mathcal{O} be an order in a number field K. The index of \mathcal{O} is its index as a sublattice of the ring of integers of K.

Tau Ceti Review: TauCeti.GlobalNumberFields.NumberFieldOrder.index, TauCeti.GlobalNumberFields.NumberFieldOrder.index_def, TauCeti.GlobalNumberFields.NumberFieldOrder.

Depends on: Definition 5.1.1 Definition 5.1.57 Definition 5.1.74

Lean code for Definition5.1.38●3 declarations
  • defdefined in TauCeti/NumberTheory/NumberField/Global/Orders/Discriminant.lean
    complete
    def TauCeti.GlobalNumberFields.NumberFieldOrder.index.{u_1} {K : Type u_1}
      [Field K] [NumberField K]
      (O : TauCeti.GlobalNumberFields.NumberFieldOrder K) : ℕ
    def TauCeti.GlobalNumberFields.NumberFieldOrder.index.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (O :
        TauCeti.GlobalNumberFields.NumberFieldOrder
          K) :
      ℕ
    The index `[𝓞 K : O]` of an order in the maximal order. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/Global/Orders/Discriminant.lean
    complete
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.index_def.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (O : TauCeti.GlobalNumberFields.NumberFieldOrder K) :
      O.index =
        Nat.card
          (NumberField.RingOfIntegers K ⧸
            Subalgebra.toSubmodule O.toRingOfIntegers)
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.index_def.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (O :
        TauCeti.GlobalNumberFields.NumberFieldOrder
          K) :
      O.index =
        Nat.card
          (NumberField.RingOfIntegers K ⧸
            Subalgebra.toSubmodule
              O.toRingOfIntegers)
    The index of an order is the cardinality of the additive quotient `𝓞 K / O`. 
  • structure(3 fields)defined in TauCeti/NumberTheory/NumberField/Global/Orders/Basic.lean
    complete
    structure TauCeti.GlobalNumberFields.NumberFieldOrder.{u} (K : Type u) [Field K]
      [NumberField K] : Type u
    structure TauCeti.GlobalNumberFields.NumberFieldOrder.{u}
      (K : Type u) [Field K] [NumberField K] :
      Type u
    An order in a number field `K`: a subring containing `ℤ`, finite as a `ℤ`-module, whose
    `ℚ`-span is all of `K`. 
    toSubalgebra : Subalgebra ℤ K
    The order as a `ℤ`-subalgebra of its ambient number field. 
    finite : Module.Finite ℤ ↥self.toSubalgebra
    An order is finitely generated as a `ℤ`-module. 
    spans : Submodule.span ℚ ↑self.toSubalgebra = ⊤
    An order has full rank in its ambient number field. 
Definition5.1.39
uses 0used by 0✓L∃∀N

Inertial height function. (LMFDB)

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

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

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

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

Let p be a prime with p \nmid \#G and \Gamma_{\Q_p} the absolute Galois group of \Q_p. We define the local height function associated to w to be

H_{w,p}: \Hom(\Gamma_{\Q_p}, G) \to \R_{>0}, \quad \varphi \mapsto w(\varphi(\tau_p))

where \tau_p is any choice of generator of the tame inertia group of \Gamma_{\Q_p}.

For p \mid \#G, we take H_p: \Hom(\Gamma_{\Q_p}, G) \to \R_{>0} to be any positive function on the finite set \Hom(\Gamma_{\Q_p}, G). We define the associated inertial height function to be

H: \Hom(\Gamma_{\Q}, G) \to \R_{>0}, \quad \varphi \mapsto \prod_{p \mid \#G} H_p(\varphi) \prod_{p \mid \#G} H_{w,p}(\varphi)

the product of local heights.

For example taking the weight function w with w(g) = 1 for all non-identity elements g \in G, an associated inertial height function is the radical discriminant: the product of primes which are ramified in the corresponding number field.

More general weight functions can be considered over more general base number fields. See ??? for further details.

Lean code for Definition5.1.39●8 declarations
  • structure(4 fields)defined in LeanBridge/ForMathlib/NumberTheory/NumberField/WeightFunction.lean
    complete
    structure NumberField.WeightFunction.{u_1} (G : Type u_1) [Group G] : Type u_1
    structure NumberField.WeightFunction.{u_1}
      (G : Type u_1) [Group G] : Type u_1
    A **weight function** on a group `G` (LMFDB `nf.inertial_height_function`): a function
    `w : G → ℝ≥0` such that `w g = 0` exactly when `g = 1`, `w (h g h⁻¹) = w g`, and `w (g ^ n) = w g`
    for every natural number `n` prime to the order of `G`.
    
    The LMFDB knowl asks for the last condition for the `n` with `n ∤ #G`, which no function vanishing
    only at the identity satisfies for a nontrivial finite `G` (take `n` a multiple of `#G` not
    dividing `#G`); its gloss "invariant under invertible powering" is the condition imposed here. 
    toFun : G → NNReal
    The function. 
    toFun_eq_zero_iff : ∀ (g : G), self.toFun g = 0 ↔ g = 1
    It vanishes exactly at the identity. 
    toFun_conj : ∀ (g h : G), self.toFun (h * g * h⁻¹) = self.toFun g
    It is invariant under conjugation. 
    toFun_pow : ∀ (g : G) (n : ℕ), n.Coprime (Nat.card G) → self.toFun (g ^ n) = self.toFun g
    It is invariant under powering by integers prime to the order of the group. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/InertialHeight.lean
    complete
    def NumberField.WeightFunction.localHeight.{u_1} {G : Type u_1} [Group G]
      (w : NumberField.WeightFunction G) [TopologicalSpace G] (p : ℕ)
      [Fact (Nat.Prime p)] (φ : Field.absoluteGaloisGroup ℚ_[p] →ₜ* G) :
      NNReal
    def NumberField.WeightFunction.localHeight.{u_1}
      {G : Type u_1} [Group G]
      (w : NumberField.WeightFunction G)
      [TopologicalSpace G] (p : ℕ)
      [Fact (Nat.Prime p)]
      (φ :
        Field.absoluteGaloisGroup ℚ_[p] →ₜ*
          G) :
      NNReal
    The **local height function** `H_{w,p}` of a weight function `w` on a finite group `G` at a
    prime `p ∤ #G` (LMFDB `nf.inertial_height_function`): `H_{w,p}(φ) = p ^ w(φ(τ_p))` for a continuous
    homomorphism `φ : Gal(ℚ̄_p/ℚ_p) → G`, where `τ_p` is a generator of the tame inertia group, an
    element of the inertia subgroup whose tame character topologically generates `ℤ̂^{(p')}(1)`. The
    value does not depend on the choice of `τ_p` (`NumberField.WeightFunction.localHeight_eq`). The
    LMFDB knowl writes `w(φ(τ_p))`, a misprint for `p ^ w(φ(τ_p))`. The definition makes sense at every
    prime, with a fixed choice of `τ_p`; at the primes `p ∣ #G`, where wild inertia need not die in `G`,
    its value may depend on that choice, and it is not used there. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/InertialHeight.lean
    complete
    def NumberField.WeightFunction.inertialHeight.{u_1} {G : Type u_1} [Group G]
      (w : NumberField.WeightFunction G) [TopologicalSpace G]
      (H :
        (ℓ : ℕ) →
          [inst : Fact (Nat.Prime ℓ)] →
            (Field.absoluteGaloisGroup ℚ_[ℓ] →ₜ* G) → NNReal)
      (φ : Field.absoluteGaloisGroup ℚ →ₜ* G) : NNReal
    def NumberField.WeightFunction.inertialHeight.{u_1}
      {G : Type u_1} [Group G]
      (w : NumberField.WeightFunction G)
      [TopologicalSpace G]
      (H :
        (ℓ : ℕ) →
          [inst : Fact (Nat.Prime ℓ)] →
            (Field.absoluteGaloisGroup
                  ℚ_[ℓ] →ₜ*
                G) →
              NNReal)
      (φ :
        Field.absoluteGaloisGroup ℚ →ₜ* G) :
      NNReal
    The **inertial height function** of a weight function `w` on a finite group `G` (LMFDB
    `nf.inertial_height_function`), with auxiliary local heights `H ℓ` at the primes `ℓ ∣ #G`: for a
    continuous homomorphism `φ : Gal(ℚ̄/ℚ) → G`, the product over all primes `ℓ` of `H ℓ (φ_ℓ)` if
    `ℓ ∣ #G` and of the local height `H_{w,ℓ}(φ_ℓ)` if `ℓ ∤ #G`, where `φ_ℓ` is the restriction of `φ`
    to the decomposition group `Gal(ℚ̄_ℓ/ℚ_ℓ)`, along Mathlib's chosen embedding `ℚ̄ → ℚ̄_ℓ`. The
    LMFDB knowl takes the auxiliary heights positive on the finite set `Hom(Γ_{ℚ_ℓ}, G)`
    (`Padic.finite_continuousMonoidHom_absoluteGaloisGroup`), and writes the product of the `H_{w,ℓ}`
    over the primes `ℓ ∣ #G`, a misprint for `ℓ ∤ #G`.
    
    The product is a `finprod`, which is `1` when infinitely many factors differ from `1`. That does not
    happen for a finite `G` (`NumberField.WeightFunction.finite_mulSupport_inertialHeight`): the kernel
    of `φ` is open, so it cuts out a finite Galois extension of `ℚ`, and at the primes `ℓ ∤ #G`
    unramified in it the restriction `φ_ℓ` kills inertia
    (`NumberField.forall_apply_map_eq_one_iff_notMem_ramifiedPrimes`), so that
    `H_{w,ℓ}(φ_ℓ) = ℓ ^ w(1) = 1`. (For an infinite `G`, outside the knowl's setting, `Nat.card G = 0`
    and every prime counts as dividing `#G`.) 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/InertialHeight.lean
    complete
    theorem NumberField.WeightFunction.localHeight_eq.{u_1} {G : Type u_1} [Group G]
      (w : NumberField.WeightFunction G) [TopologicalSpace G]
      [DiscreteTopology G] {p : ℕ} [Fact (Nat.Prime p)]
      (hp : ¬p ∣ Nat.card G) (ψ : Field.absoluteGaloisGroup ℚ_[p] →ₜ* G)
      {τ : ↥(TauCeti.inertiaSubgroup ℚ_[p])}
      (hτ :
        (Subgroup.zpowers
              ((TauCeti.inertiaTameCharacter ℚ_[p]) τ)).topologicalClosure =
          ⊤) :
      w.localHeight p ψ = ↑p ^ ↑(w.toFun (ψ ↑τ))
    theorem NumberField.WeightFunction.localHeight_eq.{u_1}
      {G : Type u_1} [Group G]
      (w : NumberField.WeightFunction G)
      [TopologicalSpace G]
      [DiscreteTopology G] {p : ℕ}
      [Fact (Nat.Prime p)]
      (hp : ¬p ∣ Nat.card G)
      (ψ :
        Field.absoluteGaloisGroup ℚ_[p] →ₜ* G)
      {τ : ↥(TauCeti.inertiaSubgroup ℚ_[p])}
      (hτ :
        (Subgroup.zpowers
              ((TauCeti.inertiaTameCharacter
                  ℚ_[p])
                τ)).topologicalClosure =
          ⊤) :
      w.localHeight p ψ =
        ↑p ^ ↑(w.toFun (ψ ↑τ))
    **The local height does not depend on the generator of tame inertia**: at a prime `p ∤ #G`, it
    is `p ^ w(ψ(τ))` for every element `τ` of inertia whose tame character topologically generates
    `ℤ̂^{(p')}(1)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/LocalField/AbsoluteGaloisGroupHom.lean
    complete
    theorem Padic.finite_continuousMonoidHom_absoluteGaloisGroup.{u_1} (p : ℕ)
      [Fact (Nat.Prime p)] (G : Type u_1) [Group G] [TopologicalSpace G]
      [T2Space G] [Finite G] :
      Finite (Field.absoluteGaloisGroup ℚ_[p] →ₜ* G)
    theorem Padic.finite_continuousMonoidHom_absoluteGaloisGroup.{u_1}
      (p : ℕ) [Fact (Nat.Prime p)]
      (G : Type u_1) [Group G]
      [TopologicalSpace G] [T2Space G]
      [Finite G] :
      Finite
        (Field.absoluteGaloisGroup ℚ_[p] →ₜ*
          G)
    **The set `Hom(Γ_{ℚ_p}, G)` is finite** (LMFDB `nf.inertial_height_function`): for a finite
    group `G` with a Hausdorff topology, such as the discrete one, there are finitely many continuous
    homomorphisms `Gal(ℚ̄_p/ℚ_p) → G`. These form the domain of the auxiliary local heights `H_p` at the
    primes `p ∣ #G` that enter the inertial height `NumberField.WeightFunction.inertialHeight`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/InertialHeightSupport.lean
    complete
    theorem NumberField.WeightFunction.finite_mulSupport_inertialHeight.{u_1}
      {G : Type u_1} [Group G] [TopologicalSpace G]
      (w : NumberField.WeightFunction G) [DiscreteTopology G] [Finite G]
      (H :
        (ℓ : ℕ) →
          [inst : Fact (Nat.Prime ℓ)] →
            (Field.absoluteGaloisGroup ℚ_[ℓ] →ₜ* G) → NNReal)
      (φ : Field.absoluteGaloisGroup ℚ →ₜ* G) :
      (Function.mulSupport fun ℓ =>
          ∏ᶠ (hℓ : Nat.Prime ℓ),
            if ℓ ∣ Nat.card G then
              H ℓ
                (φ.comp
                  (Field.absoluteGaloisGroup.map (algebraMap ℚ ℚ_[ℓ])))
            else
              w.localHeight ℓ
                (φ.comp
                  (Field.absoluteGaloisGroup.map
                    (algebraMap ℚ ℚ_[ℓ])))).Finite
    theorem NumberField.WeightFunction.finite_mulSupport_inertialHeight.{u_1}
      {G : Type u_1} [Group G]
      [TopologicalSpace G]
      (w : NumberField.WeightFunction G)
      [DiscreteTopology G] [Finite G]
      (H :
        (ℓ : ℕ) →
          [inst : Fact (Nat.Prime ℓ)] →
            (Field.absoluteGaloisGroup
                  ℚ_[ℓ] →ₜ*
                G) →
              NNReal)
      (φ :
        Field.absoluteGaloisGroup ℚ →ₜ* G) :
      (Function.mulSupport fun ℓ =>
          ∏ᶠ (hℓ : Nat.Prime ℓ),
            if ℓ ∣ Nat.card G then
              H ℓ
                (φ.comp
                  (Field.absoluteGaloisGroup.map
                    (algebraMap ℚ ℚ_[ℓ])))
            else
              w.localHeight ℓ
                (φ.comp
                  (Field.absoluteGaloisGroup.map
                    (algebraMap ℚ
                      ℚ_[ℓ])))).Finite
    **The product defining the inertial height has finitely many factors different from `1`**
    (LMFDB `nf.inertial_height_function`): for a finite group `G`, the inertial height of a continuous
    homomorphism `φ : Gal(ℚ̄/ℚ) → G` is the `finprod` over the primes `ℓ` of `H ℓ (φ_ℓ)` if `ℓ ∣ #G`
    and of the local height `H_{w,ℓ}(φ_ℓ)` if `ℓ ∤ #G`, and these factors are `1` outside a finite set
    of primes, since `φ` is unramified outside a finite set of primes. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/InertialHeightRamification.lean
    complete
    theorem NumberField.WeightFunction.inertialHeight_pos.{u_2} {G : Type u_2}
      [Group G] [TopologicalSpace G] (φ : Field.absoluteGaloisGroup ℚ →ₜ* G)
      (w : NumberField.WeightFunction G)
      {H :
        (ℓ : ℕ) →
          [inst : Fact (Nat.Prime ℓ)] →
            (Field.absoluteGaloisGroup ℚ_[ℓ] →ₜ* G) → NNReal}
      (hH :
        ∀ (ℓ : ℕ) [inst : Fact (Nat.Prime ℓ)]
          (χ : Field.absoluteGaloisGroup ℚ_[ℓ] →ₜ* G), 0 < H ℓ χ) :
      0 < w.inertialHeight H φ
    theorem NumberField.WeightFunction.inertialHeight_pos.{u_2}
      {G : Type u_2} [Group G]
      [TopologicalSpace G]
      (φ : Field.absoluteGaloisGroup ℚ →ₜ* G)
      (w : NumberField.WeightFunction G)
      {H :
        (ℓ : ℕ) →
          [inst : Fact (Nat.Prime ℓ)] →
            (Field.absoluteGaloisGroup
                  ℚ_[ℓ] →ₜ*
                G) →
              NNReal}
      (hH :
        ∀ (ℓ : ℕ) [inst : Fact (Nat.Prime ℓ)]
          (χ :
            Field.absoluteGaloisGroup
                ℚ_[ℓ] →ₜ*
              G),
          0 < H ℓ χ) :
      0 < w.inertialHeight H φ
    **Inertial heights are positive** (LMFDB `nf.inertial_height_function`) when the auxiliary local
    heights at the primes dividing `#G` are: an inertial height is a product of positive local
    heights. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/InertialHeightRamification.lean
    complete
    theorem NumberField.WeightFunction.inertialHeight_indicator_eq_finprod_ramifiedPrimes.{u_2}
      {G : Type u_2} [Group G] [TopologicalSpace G]
      (φ : Field.absoluteGaloisGroup ℚ →ₜ* G) [DiscreteTopology G]
      [DecidableEq G] :
      NumberField.WeightFunction.indicator.inertialHeight
          (fun ℓ [Fact (Nat.Prime ℓ)] χ =>
            if Subgroup.map (↑χ) (TauCeti.inertiaSubgroup ℚ_[ℓ]) = ⊥ then 1
            else ↑ℓ)
          φ =
        ∏ᶠ (ℓ : ℕ) (_ :
          ℓ ∈
            NumberField.ramifiedPrimes
              ↥(IntermediateField.fixedField (↑φ).ker)),
          ↑ℓ
    theorem NumberField.WeightFunction.inertialHeight_indicator_eq_finprod_ramifiedPrimes.{u_2}
      {G : Type u_2} [Group G]
      [TopologicalSpace G]
      (φ : Field.absoluteGaloisGroup ℚ →ₜ* G)
      [DiscreteTopology G] [DecidableEq G] :
      NumberField.WeightFunction.indicator.inertialHeight
          (fun ℓ [Fact (Nat.Prime ℓ)] χ =>
            if
                Subgroup.map (↑χ)
                    (TauCeti.inertiaSubgroup
                      ℚ_[ℓ]) =
                  ⊥ then
              1
            else ↑ℓ)
          φ =
        ∏ᶠ (ℓ : ℕ) (_ :
          ℓ ∈
            NumberField.ramifiedPrimes
              ↥(IntermediateField.fixedField
                  (↑φ).ker)),
          ↑ℓ
    **The radical discriminant is an inertial height** (LMFDB `nf.inertial_height_function`): for
    the weight function equal to `1` away from the identity, with the auxiliary local heights `ℓ` or `1`
    at the primes `ℓ ∣ #G` according as `χ : Gal(ℚ̄_ℓ/ℚ_ℓ) → G` ramifies or not, the inertial height of
    `φ` is the product of the primes ramified in the number field cut out by `φ`. By
    `NumberField.finprod_mem_ramifiedPrimes_eq_prod_primeFactors` this is the product of the prime
    divisors of its discriminant. 
Definition5.1.40
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Inessential prime. (LMFDB)

An inessential prime of a number field is a prime divisor of its index.

Tau Ceti Review: TauCeti.NumberField.IntegralPrimitiveElement.index, TauCeti.NumberField.IsCommonIndexDivisor.

Depends on: Definition 5.1.1 Definition 5.1.94

Lean code for Definition5.1.40●2 definitions
  • defdefined in TauCeti/NumberTheory/NumberField/Index/Basic.lean
    complete
    def TauCeti.NumberField.IntegralPrimitiveElement.index.{u_1} {K : Type u_1}
      [Field K] [NumberField K]
      (θ : TauCeti.NumberField.IntegralPrimitiveElement K) : ℕ
    def TauCeti.NumberField.IntegralPrimitiveElement.index.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (θ :
        TauCeti.NumberField.IntegralPrimitiveElement
          K) :
      ℕ
    The index `[𝓞 K : ℤ[θ]]`, defined as the cardinality of the additive quotient. 
  • defdefined in TauCeti/NumberTheory/NumberField/Index/CommonIndexDivisor.lean
    complete
    def TauCeti.NumberField.IsCommonIndexDivisor.{u_2} (p : ℕ) (K : Type u_2)
      [Field K] [NumberField K] : Prop
    def TauCeti.NumberField.IsCommonIndexDivisor.{u_2}
      (p : ℕ) (K : Type u_2) [Field K]
      [NumberField K] : Prop
    `p` is a **common index divisor** of `K` when it divides the index `[𝓞 K : ℤ[θ]]` of every
    integral primitive element `θ` of `K`.
    
    A common index divisor obstructs monogenicity. If `K` admits no integral primitive element the
    condition holds vacuously, so the predicate carries content only when such a `θ` exists. 
Definition5.1.41
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.35
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.1.49
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Integral elements. (LMFDB)

An element of a number field K is integral if it is integral over \Z.

Tau Ceti Review: IsIntegral.

Depends on: Definition 5.1.1 Definition 1.1.35

Lean code for Definition5.1.41●1 definition
  • 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` 
Definition5.1.42
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Integral basis of a number field. (LMFDB)

An integral basis of a number field K is a \mathbb{Z}-basis for the ring of integers of K. This is also a \mathbb{Q}-basis for K.

Tau Ceti Review: NumberField.RingOfIntegers.basis.

Depends on: Definition 5.1.1 Definition 5.1.74

Lean code for Definition5.1.42●1 definition
  • defdefined in Mathlib/NumberTheory/NumberField/Basic.lean
    complete
    def NumberField.RingOfIntegers.basis.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Module.Basis
        (Module.Free.ChooseBasisIndex ℤ (NumberField.RingOfIntegers K)) ℤ
        (NumberField.RingOfIntegers K)
    def NumberField.RingOfIntegers.basis.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Module.Basis
        (Module.Free.ChooseBasisIndex ℤ
          (NumberField.RingOfIntegers K))
        ℤ (NumberField.RingOfIntegers K)
    A ℤ-basis of the ring of integers of `K`. 
Definition5.1.43
uses 0used by 0✓L∃∀N

Intermediate fields. (LMFDB)

For a number field K, intermediate fields F are fields with \Q\subsetneqq F \subsetneqq K.

Tau Ceti Review: IntermediateField.

Lean code for Definition5.1.43●1 definition
  • structure(extends 6, 7 fields)defined in Mathlib/FieldTheory/IntermediateField/Basic.lean
    complete
    structure IntermediateField.{u_1, u_2} (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [Algebra K L] : Type u_2
    structure IntermediateField.{u_1, u_2}
      (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [Algebra K L] : Type u_2
    `S : IntermediateField K L` is a subset of `L` such that there is a field
    tower `L / S / K`. 
    • Subalgebra K L
    carrier : Set L
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    4. Subsemigroup
    mul_mem' : ∀ {a b : L}, a ∈ self.carrier → b ∈ self.carrier → a * b ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    4. Subsemigroup
    one_mem' : 1 ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    3. Submonoid
    add_mem' : ∀ {a b : L}, a ∈ self.carrier → b ∈ self.carrier → a + b ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    zero_mem' : 0 ∈ self.carrier
    Inherited from
    1. Subalgebra
    2. Subsemiring
    algebraMap_mem' : ∀ (r : K), (algebraMap K L) r ∈ self.carrier
    Inherited from
    1. Subalgebra
    inv_mem' : ∀ x ∈ self.carrier, x⁻¹ ∈ self.carrier
Definition5.1.44
uses 0
Used by 12
Reverse dependency previews
Preview
Definition 1.2.57
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Is a Galois extension. (LMFDB)

Let F be a subfield of K,

\Aut(K/F)=\{ \sigma:K\to K\mid \sigma(a)=a \text{ for all } a\in F \text{ and } \sigma \text{ is a ring homomorphism}\},

and

K^{\Aut(K/F)} = \{ a\in K \mid \sigma(a)=a\}.

Then K is Galois over F if K^{\Aut(K/F)} = F.

Tau Ceti Review: IsGalois.

Lean code for Definition5.1.44●2 declarations
  • class(2 methods)defined in Mathlib/FieldTheory/Galois/Basic.lean
    complete
    class IsGalois.{u_1, u_2} (F : Type u_1) [Field F] (E : Type u_2) [Field E]
      [Algebra F E] : Prop
    class IsGalois.{u_1, u_2} (F : Type u_1)
      [Field F] (E : Type u_2) [Field E]
      [Algebra F E] : Prop
    A field extension E/F is Galois if it is both separable and normal. Note that in mathlib
    a separable extension of fields is by definition algebraic. 
    to_isSeparable : Algebra.IsSeparable F E
    to_normal : Normal F E
  • theoremdefined in Mathlib/FieldTheory/Galois/Basic.lean
    complete
    theorem IsGalois.tfae.{u_1, u_2} {F : Type u_1} [Field F] {E : Type u_2}
      [Field E] [Algebra F E] [FiniteDimensional F E] :
      [IsGalois F E, IntermediateField.fixedField ⊤ = ⊥,
          Nat.card Gal(E/F) = Module.finrank F E,
          ∃ p, p.Separable ∧ Polynomial.IsSplittingField F E p].TFAE
    theorem IsGalois.tfae.{u_1, u_2} {F : Type u_1}
      [Field F] {E : Type u_2} [Field E]
      [Algebra F E] [FiniteDimensional F E] :
      [IsGalois F E,
          IntermediateField.fixedField ⊤ = ⊥,
          Nat.card Gal(E/F) =
            Module.finrank F E,
          ∃ p,
            p.Separable ∧
              Polynomial.IsSplittingField F E
                p].TFAE
    Equivalent characterizations of a Galois extension of finite degree. 
Definition5.1.45
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.14
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 3.3.5
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Number field label. (LMFDB)

Each (global) number field has a unique label of the form d.r.D.i where <ul> <li>d is the degree; <li>r is the real signature; the full signature is therefore [r,(d-r)/2]; <li>D is the absolute value of the discriminant; <li>i is the index, counting from 1. This is in case there is more than one field with the same signature and absolute value of the discriminant: for example 4.0.1008.1 and 4.0.1008.2. </ul> The discriminant portion of the label can take the form a_1 e \epsilon_1 textit{ a}2 e \epsilon_2 \cdots a_k e \epsilon_k to mean the absolute value of the discriminant equals a_1^{\epsilon_1}a_2^{\epsilon_2}\cdots a_k^{\epsilon_k}. The separators are the letter e and the underscore symbol.

Depends on: Definition 5.1.14 Definition 5.1.17 Definition 5.1.81

Definition5.1.46
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 5.1.58
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Local algebra. (LMFDB)

Given a global number field K and a prime p, the local algebra for K is K\otimes \Q_p. This is a finite separable algebra over \Q_p which is isomorphic to a finite direct product of finite extension fields of \Q_p.

Tau Ceti Review: TensorProduct, Padic, Algebra.Etale.baseChange, Algebra.Etale.iff_exists_algEquiv_prod.

Depends on: Definition 5.1.1 Definition 5.1.77

Lean code for Definition5.1.46●4 declarations
  • defdefined in Mathlib/LinearAlgebra/TensorProduct/Defs.lean
    complete
    def TensorProduct.{u_1, u_5, u_6} (R : Type u_1) [CommSemiring R]
      (M : Type u_5) (N : Type u_6) [AddCommMonoid M] [AddCommMonoid N]
      [Module R M] [Module R N] : Type (max u_5 u_6)
    def TensorProduct.{u_1, u_5, u_6}
      (R : Type u_1) [CommSemiring R]
      (M : Type u_5) (N : Type u_6)
      [AddCommMonoid M] [AddCommMonoid N]
      [Module R M] [Module R N] :
      Type (max u_5 u_6)
    The tensor product of two modules `M` and `N` over the same commutative semiring `R`.
    The localized notations are `M ⊗ N` and `M ⊗[R] N`, accessed by `open scoped TensorProduct`. 
  • defdefined in Mathlib/NumberTheory/Padics/PadicNumbers.lean
    complete
    def Padic (p : ℕ) [Fact (Nat.Prime p)] : Type
    def Padic (p : ℕ) [Fact (Nat.Prime p)] : Type
    The `p`-adic numbers `ℚ_[p]` are the Cauchy completion of `ℚ` with respect to the `p`-adic norm.
    
  • theoremdefined in Mathlib/RingTheory/Etale/Basic.lean
    complete
    theorem Algebra.Etale.baseChange.{u, v, u_1} (R : Type u) (A : Type v)
      (B : Type u_1) [CommRing R] [CommRing A] [Algebra R A] [CommRing B]
      [Algebra R B] [Algebra.Etale R A] :
      Algebra.Etale B (TensorProduct R B A)
    theorem Algebra.Etale.baseChange.{u, v, u_1}
      (R : Type u) (A : Type v) (B : Type u_1)
      [CommRing R] [CommRing A] [Algebra R A]
      [CommRing B] [Algebra R B]
      [Algebra.Etale R A] :
      Algebra.Etale B (TensorProduct R B A)
    Étale is stable under base change. 
  • theoremdefined in Mathlib/RingTheory/Etale/Field.lean
    complete
    theorem Algebra.Etale.iff_exists_algEquiv_prod.{u, u_1} (K : Type u_1)
      (A : Type u) [Field K] [CommRing A] [Algebra K A] :
      Algebra.Etale K A ↔
        ∃ I,
          ∃ (_ : Finite I),
            ∃ Ai x x_1 x_2,
              ∀ (i : I),
                Module.Finite K (Ai i) ∧ Algebra.IsSeparable K (Ai i)
    theorem Algebra.Etale.iff_exists_algEquiv_prod.{u,
        u_1}
      (K : Type u_1) (A : Type u) [Field K]
      [CommRing A] [Algebra K A] :
      Algebra.Etale K A ↔
        ∃ I,
          ∃ (_ : Finite I),
            ∃ Ai x x_1 x_2,
              ∀ (i : I),
                Module.Finite K (Ai i) ∧
                  Algebra.IsSeparable K (Ai i)
    `A` is étale over a field `K` if and only if
    `A` is a finite product of finite separable field extensions.
    
Definition5.1.47
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Maximum ramified prime. (LMFDB)

If K is a number field, the maximum ramified prime is simply the largest prime ramified in K. By convention, we take this to be 0 for \Q, the unique unramified extension of \Q.

Tau Ceti Review: NumberField.ramifiedPrimes, NumberField.finite_ramifiedPrimes, NumberField.ramifiedPrimes_rat.

Depends on: Definition 5.1.1 Definition 5.1.67

Lean code for Definition5.1.47●4 declarations
  • defdefined in TauCeti/NumberTheory/NumberField/RamifiedPrimes.lean
    complete
    def NumberField.ramifiedPrimes.{u_1} (K : Type u_1) [Field K] : Set ℕ
    def NumberField.ramifiedPrimes.{u_1}
      (K : Type u_1) [Field K] : Set ℕ
    **The ramified rational primes of a number field.** The set of natural primes `p` such that
    `p` — as the ideal `span {p}` of `ℤ` — ramifies in the ring of integers of `K`. For a quadratic
    field `K`, its cardinality is the `t` of genus theory. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/RamifiedPrimes.lean
    complete
    theorem NumberField.finite_ramifiedPrimes.{u_1} {K : Type u_1} [Field K]
      [NumberField K] : (NumberField.ramifiedPrimes K).Finite
    theorem NumberField.finite_ramifiedPrimes.{u_1}
      {K : Type u_1} [Field K]
      [NumberField K] :
      (NumberField.ramifiedPrimes K).Finite
    **Only finitely many primes ramify**, since they all divide the nonzero integer
    `NumberField.discr K`. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/RamifiedPrimes.lean
    complete
    theorem NumberField.ramifiedPrimes_rat : NumberField.ramifiedPrimes ℚ = ∅
    theorem NumberField.ramifiedPrimes_rat :
      NumberField.ramifiedPrimes ℚ = ∅
    **No prime ramifies in `ℚ`**, whose discriminant is `1`. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/RamifiedPrimes.lean
    complete
    theorem NumberField.ramifiedPrimes_nonempty.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (h : Module.finrank ℚ K ≠ 1) :
      (NumberField.ramifiedPrimes K).Nonempty
    theorem NumberField.ramifiedPrimes_nonempty.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (h : Module.finrank ℚ K ≠ 1) :
      (NumberField.ramifiedPrimes K).Nonempty
    **Some prime ramifies in a number field other than `ℚ`.** This is Minkowski's bound in the form
    `NumberField.exists_not_isUnramifiedIn`. 
Definition5.1.48
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Maximal CM subfield. (LMFDB)

The maximal CM subfield of a number field is the largest subfield by degree which is a CM field.

Depends on: Definition 5.1.1 Definition 5.1.9 Definition 5.1.14

Lean code for Definition5.1.48●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MaximalCMSubfield.lean
    complete
    def NumberField.maximalCMSubfield.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Subfield K
    def NumberField.maximalCMSubfield.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Subfield K
    The **maximal CM subfield** of a number field `K` (LMFDB `nf.maximal_cm_subfield`): the CM
    subfield of `K` of largest degree. It is defined as the subfield of the `x ∈ K` such that some
    `y ∈ K` satisfies `φ y = conj (φ x)` for every complex embedding `φ` of `K`; this is the largest
    subfield of `K` that is totally real or CM.
    
    If `K` has a CM subfield then this subfield is CM (`isCMField_maximalCMSubfield_iff`) and contains
    every CM subfield of `K` (`IsCMField.le_maximalCMSubfield`), so it is the unique CM subfield of
    largest degree (`IsCMField.eq_maximalCMSubfield`). Otherwise the LMFDB's maximal CM subfield does
    not exist, and this is the junk value `maximalRealSubfield K`
    (`maximalCMSubfield_eq_maximalRealSubfield_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MaximalCMSubfield.lean
    complete
    theorem NumberField.isCMField_maximalCMSubfield_iff.{u_1} {K : Type u_1}
      [Field K] [NumberField K] :
      NumberField.IsCMField ↥(NumberField.maximalCMSubfield K) ↔
        ∃ E, NumberField.IsCMField ↥E
    theorem NumberField.isCMField_maximalCMSubfield_iff.{u_1}
      {K : Type u_1} [Field K]
      [NumberField K] :
      NumberField.IsCMField
          ↥(NumberField.maximalCMSubfield K) ↔
        ∃ E, NumberField.IsCMField ↥E
    The maximal CM subfield of `K` is CM exactly when `K` has a CM subfield. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MaximalCMSubfield.lean
    complete
    theorem NumberField.IsCMField.le_maximalCMSubfield.{u_1} {K : Type u_1}
      [Field K] [NumberField K] (E : Subfield K)
      [NumberField.IsCMField ↥E] : E ≤ NumberField.maximalCMSubfield K
    theorem NumberField.IsCMField.le_maximalCMSubfield.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (E : Subfield K)
      [NumberField.IsCMField ↥E] :
      E ≤ NumberField.maximalCMSubfield K
    Every CM subfield of `K` lies in the maximal CM subfield. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MaximalCMSubfield.lean
    complete
    theorem NumberField.IsCMField.eq_maximalCMSubfield.{u_1} {K : Type u_1}
      [Field K] [NumberField K] (E : Subfield K) [NumberField.IsCMField ↥E]
      (h :
        Module.finrank ℚ ↥(NumberField.maximalCMSubfield K) ≤
          Module.finrank ℚ ↥E) :
      E = NumberField.maximalCMSubfield K
    theorem NumberField.IsCMField.eq_maximalCMSubfield.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (E : Subfield K)
      [NumberField.IsCMField ↥E]
      (h :
        Module.finrank ℚ
            ↥(NumberField.maximalCMSubfield
                K) ≤
          Module.finrank ℚ ↥E) :
      E = NumberField.maximalCMSubfield K
    **The maximal CM subfield is the CM subfield of largest degree.** A CM subfield of `K` whose
    degree is at least that of the maximal CM subfield is the maximal CM subfield. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MaximalCMSubfield.lean
    complete
    theorem NumberField.maximalCMSubfield_eq_maximalRealSubfield_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K] :
      NumberField.maximalCMSubfield K = NumberField.maximalRealSubfield K ↔
        ¬∃ E, NumberField.IsCMField ↥E
    theorem NumberField.maximalCMSubfield_eq_maximalRealSubfield_iff.{u_1}
      {K : Type u_1} [Field K]
      [NumberField K] :
      NumberField.maximalCMSubfield K =
          NumberField.maximalRealSubfield K ↔
        ¬∃ E, NumberField.IsCMField ↥E
    The maximal CM subfield of `K` is the maximal real subfield of `K` exactly when `K` has no CM
    subfield. 
Definition5.1.49
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 5.1.10
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Minimal polynomial. (LMFDB)

The minimal polynomial of an element a in a number field K is the unique monic polynomial f(X)\in\Q[X] of minimal degree such that f(a)=0. It is necessarily irreducible over \Q.

Tau Ceti Review: minpoly, minpoly.irreducible.

Depends on: Definition 5.1.1

Lean code for Definition5.1.49●3 declarations
  • defdefined in Mathlib/FieldTheory/Minpoly/Basic.lean
    complete
    def minpoly.{u_1, u_2} (A : Type u_1) {B : Type u_2} [CommRing A] [Ring B]
      [Algebra A B] (x : B) : Polynomial A
    def minpoly.{u_1, u_2} (A : Type u_1)
      {B : Type u_2} [CommRing A] [Ring B]
      [Algebra A B] (x : B) : Polynomial A
    Suppose `x : B`, where `B` is an `A`-algebra.
    
    The minimal polynomial `minpoly A x` of `x`
    is a monic polynomial with coefficients in `A` of smallest degree that has `x` as its root,
    if such exists (`IsIntegral A x`) or zero otherwise.
    
    For example, if `V` is a `𝕜`-vector space for some field `𝕜` and `f : V →ₗ[𝕜] V` then
    the minimal polynomial of `f` is `minpoly 𝕜 f`.
    
  • theoremdefined in Mathlib/FieldTheory/Minpoly/Field.lean
    complete
    theorem minpoly.unique.{u_1, u_2} (A : Type u_1) {B : Type u_2} [Field A]
      [Ring B] [Algebra A B] (x : B) {p : Polynomial A} (pmonic : p.Monic)
      (hp : (Polynomial.aeval x) p = 0)
      (pmin :
        ∀ (q : Polynomial A),
          q.Monic → (Polynomial.aeval x) q = 0 → p.degree ≤ q.degree) :
      p = minpoly A x
    theorem minpoly.unique.{u_1, u_2} (A : Type u_1)
      {B : Type u_2} [Field A] [Ring B]
      [Algebra A B] (x : B) {p : Polynomial A}
      (pmonic : p.Monic)
      (hp : (Polynomial.aeval x) p = 0)
      (pmin :
        ∀ (q : Polynomial A),
          q.Monic →
            (Polynomial.aeval x) q = 0 →
              p.degree ≤ q.degree) :
      p = minpoly A x
    The minimal polynomial of an element `x` is uniquely characterized by its defining property:
    if there is another monic polynomial of minimal degree that has `x` as a root, then this polynomial
    is equal to the minimal polynomial of `x`. See also `minpoly.IsIntegrallyClosed.Minpoly.unique`
    which relaxes the assumptions on `A` in exchange for stronger assumptions on `B`. 
  • theoremdefined in Mathlib/FieldTheory/Minpoly/Basic.lean
    complete
    theorem minpoly.irreducible.{u_1, u_2} {A : Type u_1} {B : Type u_2}
      [CommRing A] [Ring B] [Algebra A B] {x : B} [IsDomain A] [IsDomain B]
      (hx : IsIntegral A x) : Irreducible (minpoly A x)
    theorem minpoly.irreducible.{u_1, u_2}
      {A : Type u_1} {B : Type u_2}
      [CommRing A] [Ring B] [Algebra A B]
      {x : B} [IsDomain A] [IsDomain B]
      (hx : IsIntegral A x) :
      Irreducible (minpoly A x)
    A minimal polynomial is irreducible. 
Definition5.1.50
Statement uses 5
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 6.3.25
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Minimal sibling. (LMFDB)

The minimal sibling of a number field is a sibling that is minimal with respect to the following quantities considered in order:

x^n+a_{n-1} x^{n-1}+\cdots +a_0

Depends on: Definition 5.1.1 Definition 5.1.14 Definition 5.1.17 Definition 5.1.23 Definition 5.1.80

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

Monogenic field. (LMFDB)

A number field K is monogenic if its ring of integers \mathcal{O}_K equals \Z[\alpha] for some \alpha \in \mathcal{O}_K.

Tau Ceti Review: TauCeti.NumberField.IsMonogenic.

Depends on: Definition 5.1.1 Definition 5.1.74

Lean code for Definition5.1.51●1 definition
  • defdefined in TauCeti/NumberTheory/NumberField/Monogenic.lean
    complete
    def TauCeti.NumberField.IsMonogenic.{u_2} (K : Type u_2) [Field K] : Prop
    def TauCeti.NumberField.IsMonogenic.{u_2}
      (K : Type u_2) [Field K] : Prop
    A field `K` is **monogenic** when its ring of integers is generated by a single algebraic
    integer as a `ℤ`-algebra, that is `𝓞 K = ℤ[θ]`.
    
    Only `[Field K]` is assumed, because `𝓞 K` needs no more than that; the intended case, and the
    one every result below is about, is a number field. 
Definition5.1.52
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Monomial order. (LMFDB)

A monomial order in a number field K is an order of the form \Z[\alpha], where \alpha is an element of K. The element \alpha is necessarily both an algebraic integer and a primitive element for K.

Tau Ceti Review: TauCeti.GlobalNumberFields.NumberFieldOrder.

Depends on: Definition 5.1.1 Definition 5.1.57 Definition 5.1.74

Lean code for Definition5.1.52●5 declarations
  • structure(3 fields)defined in TauCeti/NumberTheory/NumberField/Global/Orders/Basic.lean
    complete
    structure TauCeti.GlobalNumberFields.NumberFieldOrder.{u} (K : Type u) [Field K]
      [NumberField K] : Type u
    structure TauCeti.GlobalNumberFields.NumberFieldOrder.{u}
      (K : Type u) [Field K] [NumberField K] :
      Type u
    An order in a number field `K`: a subring containing `ℤ`, finite as a `ℤ`-module, whose
    `ℚ`-span is all of `K`. 
    toSubalgebra : Subalgebra ℤ K
    The order as a `ℤ`-subalgebra of its ambient number field. 
    finite : Module.Finite ℤ ↥self.toSubalgebra
    An order is finitely generated as a `ℤ`-module. 
    spans : Submodule.span ℚ ↑self.toSubalgebra = ⊤
    An order has full rank in its ambient number field. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MonomialOrder.lean
    complete
    def TauCeti.GlobalNumberFields.NumberFieldOrder.IsMonomial.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (O : TauCeti.GlobalNumberFields.NumberFieldOrder K) : Prop
    def TauCeti.GlobalNumberFields.NumberFieldOrder.IsMonomial.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (O :
        TauCeti.GlobalNumberFields.NumberFieldOrder
          K) :
      Prop
    An order `O` of a number field `K` is **monomial** (LMFDB `nf.monomial_order`) if it is
    `ℤ[α]` for some `α ∈ K`. Such an `α` is an algebraic integer
    (`isIntegral_of_toSubalgebra_eq_adjoin`) and a primitive element of `K`
    (`primitive_element_of_toSubalgebra_eq_adjoin`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MonomialOrder.lean
    complete
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.isIntegral_of_toSubalgebra_eq_adjoin.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {O : TauCeti.GlobalNumberFields.NumberFieldOrder K} {α : K}
      (hα : O.toSubalgebra = ℤ[α]) : IsIntegral ℤ α
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.isIntegral_of_toSubalgebra_eq_adjoin.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {O :
        TauCeti.GlobalNumberFields.NumberFieldOrder
          K}
      {α : K} (hα : O.toSubalgebra = ℤ[α]) :
      IsIntegral ℤ α
    **The generator of a monomial order is an algebraic integer** (LMFDB `nf.monomial_order`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MonomialOrder.lean
    complete
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.primitive_element_of_toSubalgebra_eq_adjoin.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {O : TauCeti.GlobalNumberFields.NumberFieldOrder K} {α : K}
      (hα : O.toSubalgebra = ℤ[α]) : ℚ⟮α⟯ = ⊤
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.primitive_element_of_toSubalgebra_eq_adjoin.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {O :
        TauCeti.GlobalNumberFields.NumberFieldOrder
          K}
      {α : K} (hα : O.toSubalgebra = ℤ[α]) :
      ℚ⟮α⟯ = ⊤
    **The generator of a monomial order is a primitive element** (LMFDB `nf.monomial_order`): if
    an order of `K` is `ℤ[α]`, then `ℚ(α) = K`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/MonomialOrder.lean
    complete
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.isMonomial_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {O : TauCeti.GlobalNumberFields.NumberFieldOrder K} :
      O.IsMonomial ↔
        ∃ θ,
          O =
            TauCeti.GlobalNumberFields.NumberFieldOrder.ofIntegralPrimitiveElement
              θ
    theorem TauCeti.GlobalNumberFields.NumberFieldOrder.isMonomial_iff.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {O :
        TauCeti.GlobalNumberFields.NumberFieldOrder
          K} :
      O.IsMonomial ↔
        ∃ θ,
          O =
            TauCeti.GlobalNumberFields.NumberFieldOrder.ofIntegralPrimitiveElement
              θ
    **The monomial orders are the orders `ℤ[θ]` of the integral primitive elements `θ`.** 
Definition5.1.53
uses 0used by 0✓L∃∀N

Multiplicative Galois Module Structure. (LMFDB)

Let K be a number field with Galois closure K^{gal} and U be the group of units of the ring of integers of K^{gal}. Let \mu \subset U be the subgroup of roots of unity which lie in K^{gal}. Let M=U/\mu be the units modulo its torsion subgroup. This is a lattice which is a module for \Z[G] where G=\textrm{Gal}(K^{gal}/\Q). We give a decomposition of M as a direct sum of indecomposable submodules.

Tau Ceti Review: TauCeti.NumberField.Units.unitLatticeSubrep, TauCeti.NumberField.Units.logSpaceRep, NumberField.Units.unitLattice, NumberField.Units.logEmbedding, NumberField.Units.dirichletUnitTheorem.logEmbedding_ker.

Lean code for Definition5.1.53●5 declarations
  • defdefined in TauCeti/NumberTheory/NumberField/Units/Log/Embedding.lean
    complete
    def TauCeti.NumberField.Units.unitLatticeSubrep.{u_1, u_2} (K : Type u_1)
      (L : Type u_2) [Field K] [Field L] [NumberField L] [Algebra K L] :
      Subrepresentation
        (TauCeti.NumberField.Units.logSpaceRep K L).restrictScalarsInt
    def TauCeti.NumberField.Units.unitLatticeSubrep.{u_1,
        u_2}
      (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [NumberField L]
      [Algebra K L] :
      Subrepresentation
        (TauCeti.NumberField.Units.logSpaceRep
            K L).restrictScalarsInt
    The unit lattice `logEmbedding L ((𝓞 L)ˣ)` as an integral subrepresentation of `logSpaceRep`:
    it is stable under `Aut(L/K)` by `TauCeti.NumberField.Units.logEmbedding_smul`. 
  • defdefined in TauCeti/NumberTheory/NumberField/Units/Log/Embedding.lean
    complete
    def TauCeti.NumberField.Units.logSpaceRep.{u_1, u_2} (K : Type u_1)
      (L : Type u_2) [Field K] [Field L] [NumberField L] [Algebra K L] :
      Representation ℝ Gal(L/K)
        (NumberField.Units.dirichletUnitTheorem.logSpace L)
    def TauCeti.NumberField.Units.logSpaceRep.{u_1,
        u_2}
      (K : Type u_1) (L : Type u_2) [Field K]
      [Field L] [NumberField L]
      [Algebra K L] :
      Representation ℝ Gal(L/K)
        (NumberField.Units.dirichletUnitTheorem.logSpace
          L)
    The real representation of `Aut(L/K)` on `logSpace L`: an automorphism `σ` permutes the
    coordinates of the sum-zero hyperplane of `ℝ^{InfinitePlace L}` by `w ↦ σ • w`, read in the chart
    `logSpaceExtend L` (`TauCeti.NumberField.Units.logSpaceExtend_logSpaceRep`). 
  • defdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    def NumberField.Units.unitLattice.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Submodule ℤ (NumberField.Units.dirichletUnitTheorem.logSpace K)
    def NumberField.Units.unitLattice.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Submodule ℤ
        (NumberField.Units.dirichletUnitTheorem.logSpace
          K)
    The lattice formed by the image of the logarithmic embedding. 
  • defdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    def NumberField.Units.logEmbedding.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Additive (NumberField.RingOfIntegers K)ˣ →+
        NumberField.Units.dirichletUnitTheorem.logSpace K
    def NumberField.Units.logEmbedding.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Additive
          (NumberField.RingOfIntegers K)ˣ →+
        NumberField.Units.dirichletUnitTheorem.logSpace
          K
    The logarithmic embedding of the units (seen as an `Additive` group). 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    theorem NumberField.Units.dirichletUnitTheorem.logEmbedding_ker.{u_1}
      {K : Type u_1} [Field K] [NumberField K] :
      (NumberField.Units.logEmbedding K).ker =
        Subgroup.toAddSubgroup (NumberField.Units.torsion K)
    theorem NumberField.Units.dirichletUnitTheorem.logEmbedding_ker.{u_1}
      {K : Type u_1} [Field K]
      [NumberField K] :
      (NumberField.Units.logEmbedding K).ker =
        Subgroup.toAddSubgroup
          (NumberField.Units.torsion K)
Definition5.1.54
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 3.3.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Narrow class group. (LMFDB)

The narrow class group (also called the strict class group) of a number field K is the group of equivalence classes of ideals, given by the quotient of the multiplicative group of all fractional ideals of K by the subgroup of principal fractional ideals which have a totally positive generator. It is a finite abelian group whose order is the narrow class number.

Tau Ceti Review: NumberField.IsTotallyPositive, NumberField.NarrowClassGroup, NumberField.NarrowClassGroup.toClassGroup, NumberField.narrowPrincipalSubgroup.

Depends on: Definition 5.1.1 Definition 5.1.86

Lean code for Definition5.1.54●4 definitions
  • defdefined in TauCeti/NumberTheory/NumberField/TotallyPositive.lean
    complete
    def NumberField.IsTotallyPositive.{u_1} {K : Type u_1} [Field K] (x : K) :
      Prop
    def NumberField.IsTotallyPositive.{u_1}
      {K : Type u_1} [Field K] (x : K) : Prop
    An element of a number field is **totally positive** when it is strictly positive under every
    real embedding `K →+* ℝ` (equivalently, at every real infinite place `w`). For a totally complex
    field the condition is vacuous; the content is at the real places. 
  • defdefined in TauCeti/NumberTheory/NumberField/NarrowClassGroup/Basic.lean
    complete
    def NumberField.NarrowClassGroup.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    def NumberField.NarrowClassGroup.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    The **narrow class group** `Cl⁺(K)`: invertible fractional ideals of `𝓞 K` modulo the principal
    ones with a totally positive generator. 
  • defdefined in TauCeti/NumberTheory/NumberField/NarrowClassGroup/Basic.lean
    complete
    def NumberField.NarrowClassGroup.toClassGroup.{u_1} {K : Type u_1} [Field K]
      [NumberField K] :
      NumberField.NarrowClassGroup K →*
        ClassGroup (NumberField.RingOfIntegers K)
    def NumberField.NarrowClassGroup.toClassGroup.{u_1}
      {K : Type u_1} [Field K]
      [NumberField K] :
      NumberField.NarrowClassGroup K →*
        ClassGroup
          (NumberField.RingOfIntegers K)
    The **surjection `Cl⁺(K) → Cl(K)`** onto the ordinary class group, forgetting the positivity
    condition on generators. 
  • defdefined in TauCeti/NumberTheory/NumberField/NarrowClassGroup/Basic.lean
    complete
    def NumberField.narrowPrincipalSubgroup.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Subgroup
        (FractionalIdeal (nonZeroDivisors (NumberField.RingOfIntegers K))
            K)ˣ
    def NumberField.narrowPrincipalSubgroup.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Subgroup
        (FractionalIdeal
            (nonZeroDivisors
              (NumberField.RingOfIntegers K))
            K)ˣ
    The subgroup of `(FractionalIdeal (𝓞 K)⁰ K)ˣ` of **principal fractional ideals with a totally
    positive generator**: the image of `totallyPositiveUnits` under `toPrincipalIdeal`. The narrow class
    group quotients by this subgroup. 
Definition5.1.55
Statement uses 5
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Narrow class number. (LMFDB)

The narrow class number (also called the strict class number) of an algebraic number field is the order of its narrow class group. Since the ordinary ideal class group is a quotient of the narrow class group, the narrow class number is a multiple of the class number. Moreover, the ratio is a power of 2. The two class numbers are the same in many cases, for example when the number field is totally complex.

Tau Ceti Review: NumberField.NarrowClassGroup.

Depends on: Definition 5.1.1 Definition 5.1.7 Definition 5.1.36 Definition 5.1.54 Definition 5.1.85

Lean code for Definition5.1.55●1 definition
  • defdefined in TauCeti/NumberTheory/NumberField/NarrowClassGroup/Basic.lean
    complete
    def NumberField.NarrowClassGroup.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    def NumberField.NarrowClassGroup.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : Type u_1
    The **narrow class group** `Cl⁺(K)`: invertible fractional ideals of `𝓞 K` modulo the principal
    ones with a totally positive generator. 
Definition5.1.56
uses 0used by 0✓L∃∀N

Number field nicknames. (LMFDB)

The LMFDB supports nicknames, short human-readable names for various fields. Examples include:

  • "\texttt{Q}", for the rationals \mathbb{Q},

  • "\texttt{Qi}", for \mathbb{Q}(i),

  • "\texttt{QsqrtN}", for \mathbb{Q}(\sqrt{N}), as in Qsqrt-5 for \mathbb{Q}(\sqrt{-5}),

  • "\texttt{QzetaN}", for \mathbb{Q}(\zeta_N), where \zeta_N is a primitive Nth root of unity,

  • "\texttt{QzetaN+}", for \mathbb{Q}(\zeta_N)^+; i.e. the maximal real subfield of \mathbb{Q}(\zeta_N) (equivalently, the field \mathbb{Q}(\zeta_N + \zeta_N^{-1})).

  • more generally, "\texttt{Q(s1, s2, ... ,sk)}", for the field generated by algebraic numbers s_1,s_2,\dots,s_k.

In the general syntax, each \texttt{si} may be built using the functions \texttt{sqrt} (or \texttt{root}) and \texttt{cbrt}, together with the usual arithmetic operations \texttt{+}, \texttt{-}, \texttt{*}, \texttt{/}, ^, and parentheses. The usual constants \texttt{i}, \texttt{zetaN} and \texttt{phi} (for (1 + \sqrt{5})/2) are also supported. Some examples include: "\texttt{Q(sqrt2,sqrt3)}", "\texttt{Q(sqrt(1+sqrt2))}","\texttt{Q(cbrt(1+zeta7))}", and "\texttt{Q(5}^\texttt{(1/12))}".

Tau Ceti Review: IsCyclotomicExtension, NumberField.maximalRealSubfield, TauCeti.IsCyclotomicExtension.Rat.toSubfield_fixedField_zpowers_galEquivZMod_symm_neg_one.

Lean code for Definition5.1.56●5 declarations
  • class(2 methods)defined in Mathlib/NumberTheory/Cyclotomic/Basic.lean
    complete
    class IsCyclotomicExtension.{u, v} (S : Set ℕ) (A : Type u) (B : Type v)
      [CommRing A] [CommRing B] [Algebra A B] : Prop
    class IsCyclotomicExtension.{u, v} (S : Set ℕ)
      (A : Type u) (B : Type v) [CommRing A]
      [CommRing B] [Algebra A B] : Prop
    Given an `A`-algebra `B` and `S : Set ℕ`, we define `IsCyclotomicExtension S A B` requiring
    that there is an `n`-th primitive root of unity in `B` for all nonzero `n ∈ S` and that
    `B` is generated over `A` by the roots of `X ^ n - 1`. 
    exists_isPrimitiveRoot : ∀ {n : ℕ}, n ∈ S → n ≠ 0 → ∃ r, IsPrimitiveRoot r n
    For all nonzero `n ∈ S`, there exists a primitive `n`-th root of unity in `B`. 
    adjoin_roots : ∀ (x : B), x ∈ Algebra.adjoin A {b | ∃ n ∈ S, n ≠ 0 ∧ b ^ n = 1}
    The `n`-th roots of unity, for `n ∈ S` nonzero, generate `B` as an `A`-algebra. 
  • defdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    def NumberField.maximalRealSubfield.{u_2} (K : Type u_2) [Field K] :
      Subfield K
    def NumberField.maximalRealSubfield.{u_2}
      (K : Type u_2) [Field K] : Subfield K
    The maximal real subfield of `K`. It is totally real,
    see `NumberField.isTotallyReal_maximalRealSubfield`, and contains all the other totally real
    subfields of `K`, see `NumberField.IsTotallyReal.le_maximalRealSubfield`.
    
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/Cyclotomic/MaximalRealSubfieldAdjoin.lean
    complete
    theorem IsPrimitiveRoot.maximalRealSubfield_eq_adjoin_add_inv.{u_1} {n : ℕ}
      [NeZero n] {K : Type u_1} [Field K] {ζ : K} [NumberField K]
      [IsCyclotomicExtension {n} ℚ K] (hζ : IsPrimitiveRoot ζ n) :
      NumberField.maximalRealSubfield K = ℚ⟮ζ + ζ⁻¹⟯.toSubfield
    theorem IsPrimitiveRoot.maximalRealSubfield_eq_adjoin_add_inv.{u_1}
      {n : ℕ} [NeZero n] {K : Type u_1}
      [Field K] {ζ : K} [NumberField K]
      [IsCyclotomicExtension {n} ℚ K]
      (hζ : IsPrimitiveRoot ζ n) :
      NumberField.maximalRealSubfield K =
        ℚ⟮ζ + ζ⁻¹⟯.toSubfield
    **The maximal real subfield of the cyclotomic field `ℚ(ζ)` is `ℚ(ζ + ζ⁻¹)`.** 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/Cyclotomic/MaximalRealSubfieldAdjoin.lean
    complete
    theorem IsPrimitiveRoot.add_inv_mem_maximalRealSubfield.{u_1} {n : ℕ} [NeZero n]
      {K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ n) :
      ζ + ζ⁻¹ ∈ NumberField.maximalRealSubfield K
    theorem IsPrimitiveRoot.add_inv_mem_maximalRealSubfield.{u_1}
      {n : ℕ} [NeZero n] {K : Type u_1}
      [Field K] {ζ : K}
      (hζ : IsPrimitiveRoot ζ n) :
      ζ + ζ⁻¹ ∈
        NumberField.maximalRealSubfield K
  • theoremdefined in TauCeti/NumberTheory/NumberField/Cyclotomic/MaximalRealSubfield.lean
    complete
    theorem TauCeti.IsCyclotomicExtension.Rat.toSubfield_fixedField_zpowers_galEquivZMod_symm_neg_one.{u_1}
      (n : ℕ) [NeZero n] (K : Type u_1) [Field K] [NumberField K]
      [hK : IsCyclotomicExtension {n} ℚ K] :
      (IntermediateField.fixedField
            (Subgroup.zpowers
              ((IsCyclotomicExtension.Rat.galEquivZMod n K).symm
                (-1)))).toSubfield =
        NumberField.maximalRealSubfield K
    theorem TauCeti.IsCyclotomicExtension.Rat.toSubfield_fixedField_zpowers_galEquivZMod_symm_neg_one.{u_1}
      (n : ℕ) [NeZero n] (K : Type u_1)
      [Field K] [NumberField K]
      [hK : IsCyclotomicExtension {n} ℚ K] :
      (IntermediateField.fixedField
            (Subgroup.zpowers
              ((IsCyclotomicExtension.Rat.galEquivZMod
                    n K).symm
                (-1)))).toSubfield =
        NumberField.maximalRealSubfield K
    The fixed field of the cyclic subgroup generated by `ζ ↦ ζ⁻¹` is the maximal real
    subfield of the cyclotomic field. 
Definition5.1.57
uses 1
Used by 8
Reverse dependency previews
Preview
Definition 1.2.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Order. (LMFDB)

An order in a number field K is a subring of K which is also a lattice in K. Every order in K is contained in the ring of integers of K, which is itself an order in K; for this reason, the ring of integers is sometimes called the maximal order.

Example: \Z[\sqrt{5}] is an order in K=\Q(\sqrt{5}). However, it is not maximal, since the maximal order (i.e. ring of integers) of K is \Z\left[\frac{1+\sqrt{5}}2\right].

Tau Ceti Review: TauCeti.GlobalNumberFields.NumberFieldOrder, TauCeti.GlobalNumberFields.maximalNumberFieldOrder.

Depends on: Definition 5.1.1

Lean code for Definition5.1.57●2 definitions
  • structure(3 fields)defined in TauCeti/NumberTheory/NumberField/Global/Orders/Basic.lean
    complete
    structure TauCeti.GlobalNumberFields.NumberFieldOrder.{u} (K : Type u) [Field K]
      [NumberField K] : Type u
    structure TauCeti.GlobalNumberFields.NumberFieldOrder.{u}
      (K : Type u) [Field K] [NumberField K] :
      Type u
    An order in a number field `K`: a subring containing `ℤ`, finite as a `ℤ`-module, whose
    `ℚ`-span is all of `K`. 
    toSubalgebra : Subalgebra ℤ K
    The order as a `ℤ`-subalgebra of its ambient number field. 
    finite : Module.Finite ℤ ↥self.toSubalgebra
    An order is finitely generated as a `ℤ`-module. 
    spans : Submodule.span ℚ ↑self.toSubalgebra = ⊤
    An order has full rank in its ambient number field. 
  • defdefined in TauCeti/NumberTheory/NumberField/Global/Orders/Basic.lean
    complete
    def TauCeti.GlobalNumberFields.maximalNumberFieldOrder.{u} (K : Type u)
      [Field K] [NumberField K] :
      TauCeti.GlobalNumberFields.NumberFieldOrder K
    def TauCeti.GlobalNumberFields.maximalNumberFieldOrder.{u}
      (K : Type u) [Field K] [NumberField K] :
      TauCeti.GlobalNumberFields.NumberFieldOrder
        K
    The maximal order of a number field, namely its ring of integers. 
Definition5.1.58
Statement uses 9
Statement dependency previews
Preview
Definition 1.1.28
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

p-adic completion of a number field. (LMFDB)

Let K be a number field, \mathcal{O}_K its ring of integers, \mathfrak{P} a non-zero prime ideal of \mathcal{O}_K, and p\in \Z\cap \mathfrak{P}. There are a couple of ways to construct K_{\mathfrak{P}}, the p-adic completion of K at \mathfrak{P}.

First, we can take the inverse limit

\lim_{\leftarrow} \mathcal{O}_K/\mathfrak{P}^n

which is an integral domain. Its field of fractions is K_{\mathfrak{P}}.

Second, since \mathcal{O}_K is a Dedekind domain, if \alpha\in K^* the fractional ideal

\langle \alpha\rangle = \prod_{\mathfrak{Q}} \mathfrak{Q}^{e_{\mathfrak{Q}}}

where the product is over all non-zero prime ideals \mathfrak{Q}, all e_{\mathfrak{Q}}\in\Z, and all but finitely many e_{\mathfrak{Q}}=0. Then we define v_{\mathfrak{P}}(\alpha)=e_{\mathfrak{P}}, and then the metric d on K by d(\alpha, \beta) = p^{-v_{\mathfrak{P}}(\alpha-\beta)} if \alpha\neq \beta and d(\alpha,\alpha)=0. Then the completion of K with respect to this metric is K_{\mathfrak{P}}.

If K=\Q(a), and f\in\Q[x] is the monic irreducible polynomial for a over \Q, then adjoining the roots of f to \Q_p provide another means of constructing the completions.

Finally, the local algebra of K, \prod_{j=1}^g K_j is a product of the p-adic completions of K. The p-adic completions of K correspond to the nonarchimedian places of K.

Tau Ceti Review: IsDedekindDomain.HeightOneSpectrum.adicCompletion, TauCeti.semilocalEquiv, IsDedekindDomain.HeightOneSpectrum.valuation.

Depends on: Definition 5.2.51 Definition 5.1.1 Definition 5.1.46 Definition 5.1.64 Definition 1.1.28 Definition 1.1.31 Definition 1.1.33 Definition 1.1.36 Definition 1.1.38

Lean code for Definition5.1.58●9 declarations
  • structure(1 field)defined in Mathlib/RingTheory/DedekindDomain/AdicValuation.lean
    complete
    structure IsDedekindDomain.HeightOneSpectrum.adicCompletion.{u_1, u_2}
      {R : Type u_1} [CommRing R] [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K] [IsFractionRing R K]
      (v : IsDedekindDomain.HeightOneSpectrum R) : Type u_2
    structure IsDedekindDomain.HeightOneSpectrum.adicCompletion.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          R) :
      Type u_2
    The completion of `K` with respect to its `v`-adic valuation, defined as a one-field structure
    wrapping the uniform-space completion `(v.valuation K).Completion`. 
    toCompletion : (IsDedekindDomain.HeightOneSpectrum.valuation K v).Completion
    The underlying element of the completion `(v.valuation K).Completion`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/DedekindDomain/AdicCompletionInverseLimit.lean
    complete
    theorem IsDedekindDomain.HeightOneSpectrum.isFractionRing_adicCompletion.{u_1,
        u_2}
      {R : Type u_1} [CommRing R] [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K] [IsFractionRing R K]
      (v : IsDedekindDomain.HeightOneSpectrum R) :
      IsFractionRing (AdicCompletion v.asIdeal R)
        (IsDedekindDomain.HeightOneSpectrum.adicCompletion K v)
    theorem IsDedekindDomain.HeightOneSpectrum.isFractionRing_adicCompletion.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          R) :
      IsFractionRing
        (AdicCompletion v.asIdeal R)
        (IsDedekindDomain.HeightOneSpectrum.adicCompletion
          K v)
    **The field of fractions of `lim R / 𝔓 ^ n` is `K_v`** (LMFDB `nf.padic_completion`), the
    completion of `K` at `𝔓`, through the isomorphism `lim R / 𝔓 ^ n ≃+* 𝒪_v`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/DedekindDomain/AdicAbvCompletion.lean
    complete
    theorem IsDedekindDomain.HeightOneSpectrum.dist_toAbs_adicAbv.{u_1, u_2}
      {R : Type u_1} [CommRing R] [IsDedekindDomain R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K]
      (v : IsDedekindDomain.HeightOneSpectrum R) {b : NNReal} (hb : 1 < b)
      {x y : K} (hxy : x ≠ y) :
      dist (WithAbs.toAbs (v.adicAbv hb) x)
          (WithAbs.toAbs (v.adicAbv hb) y) =
        ↑b ^
          (-FractionalIdeal.count K v
              ((FractionalIdeal.spanSingleton (nonZeroDivisors R)) (x - y)))
    theorem IsDedekindDomain.HeightOneSpectrum.dist_toAbs_adicAbv.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      [IsDedekindDomain R] {K : Type u_2}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (v :
        IsDedekindDomain.HeightOneSpectrum R)
      {b : NNReal} (hb : 1 < b) {x y : K}
      (hxy : x ≠ y) :
      dist (WithAbs.toAbs (v.adicAbv hb) x)
          (WithAbs.toAbs (v.adicAbv hb) y) =
        ↑b ^
          (-FractionalIdeal.count K v
              ((FractionalIdeal.spanSingleton
                  (nonZeroDivisors R))
                (x - y)))
    **The metric of `adicAbv` is `d(x, y) = b ^ (-v_𝔓(x - y))`** (LMFDB `nf.padic_completion`) for
    `x ≠ y`, where `v_𝔓(x - y)` is the exponent of `𝔓` in the factorization of the fractional ideal
    generated by `x - y`. 
  • defdefined in LeanBridge/ForMathlib/RingTheory/DedekindDomain/AdicAbvCompletion.lean
    complete
    def IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv.{u_1, u_2}
      {R : Type u_1} [CommRing R] [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K] [IsFractionRing R K]
      (v : IsDedekindDomain.HeightOneSpectrum R) {b : NNReal} (hb : 1 < b) :
      (v.adicAbv hb).Completion ≃+*
        IsDedekindDomain.HeightOneSpectrum.adicCompletion K v
    def IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (v :
        IsDedekindDomain.HeightOneSpectrum R)
      {b : NNReal} (hb : 1 < b) :
      (v.adicAbv hb).Completion ≃+*
        IsDedekindDomain.HeightOneSpectrum.adicCompletion
          K v
    **The completion of `K` for the metric of `adicAbv` is `K_𝔓`** (LMFDB `nf.padic_completion`):
    the isomorphism between the completion of `K` for the metric `b ^ (-v_𝔓(x - y))` and Mathlib's
    completion `K_𝔓` of `K` for the `𝔓`-adic valuation. It extends the identity of `K`
    (`IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv_coe`) and is a homeomorphism
    (`IsDedekindDomain.HeightOneSpectrum.isHomeomorph_adicAbvCompletionRingEquiv`). 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/DedekindDomain/AdicAbvCompletion.lean
    complete
    theorem IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv_coe.{u_1,
        u_2}
      {R : Type u_1} [CommRing R] [IsDedekindDomain R] {K : Type u_2}
      [Field K] [Algebra R K] [IsFractionRing R K]
      (v : IsDedekindDomain.HeightOneSpectrum R) {b : NNReal} (hb : 1 < b)
      (x : K) :
      (IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv K v hb)
          ↑(WithAbs.toAbs (v.adicAbv hb) x) =
        IsDedekindDomain.HeightOneSpectrum.adicCompletion.ofCompletion
          ↑(WithVal.toVal (IsDedekindDomain.HeightOneSpectrum.valuation K v)
              x)
    theorem IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv_coe.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      [IsDedekindDomain R] {K : Type u_2}
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (v :
        IsDedekindDomain.HeightOneSpectrum R)
      {b : NNReal} (hb : 1 < b) (x : K) :
      (IsDedekindDomain.HeightOneSpectrum.adicAbvCompletionRingEquiv
            K v hb)
          ↑(WithAbs.toAbs (v.adicAbv hb) x) =
        IsDedekindDomain.HeightOneSpectrum.adicCompletion.ofCompletion
          ↑(WithVal.toVal
              (IsDedekindDomain.HeightOneSpectrum.valuation
                K v)
              x)
    **The completion of `K` for the metric of `adicAbv` is `K_𝔓` over `K`**: the isomorphism of
    completions extends the identity of `K`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/CompletionRootField.lean
    complete
    def NumberField.adjoinRootEquivCompletion.{u_1, u_2} {K : Type u_1}
      [Field K] [NumberField K] {L : Type u_2} [Field L] [NumberField L]
      [Algebra K L]
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K))
      (pb : PowerBasis K L) (w : { w // w.asIdeal.LiesOver v.asIdeal }) :
      AdjoinRoot
          (minpoly (IsDedekindDomain.HeightOneSpectrum.adicCompletion K v)
            ((algebraMap L
                (IsDedekindDomain.HeightOneSpectrum.adicCompletion L ↑w))
              pb.gen)) ≃ₐ[IsDedekindDomain.HeightOneSpectrum.adicCompletion
          K v]
        IsDedekindDomain.HeightOneSpectrum.adicCompletion L ↑w
    def NumberField.adjoinRootEquivCompletion.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      {L : Type u_2} [Field L] [NumberField L]
      [Algebra K L]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K))
      (pb : PowerBasis K L)
      (w :
        { w //
          w.asIdeal.LiesOver v.asIdeal }) :
      AdjoinRoot
          (minpoly
            (IsDedekindDomain.HeightOneSpectrum.adicCompletion
              K v)
            ((algebraMap L
                (IsDedekindDomain.HeightOneSpectrum.adicCompletion
                  L ↑w))
              pb.gen)) ≃ₐ[IsDedekindDomain.HeightOneSpectrum.adicCompletion
          K v]
        IsDedekindDomain.HeightOneSpectrum.adicCompletion
          L ↑w
    The completion `L_w` from a root of `f` (LMFDB `nf.padic_completion`):
    `K_v[x] / (q_w) ≃ₐ[K_v] L_w` for the minimal polynomial `q_w` over `K_v` of the image `a_w` of a
    generator `a` of `L / K`, a factor of `f` (`NumberField.minpoly_dvd_map_minpoly`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/CompletionRootField.lean
    complete
    theorem NumberField.exists_eq_minpoly_algebraMap.{u_1, u_2} {K : Type u_1}
      [Field K] [NumberField K] {L : Type u_2} [Field L] [NumberField L]
      [Algebra K L]
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K))
      (pb : PowerBasis K L)
      {q :
        Polynomial (IsDedekindDomain.HeightOneSpectrum.adicCompletion K v)}
      (hq : Irreducible q) (hqm : q.Monic)
      (hdvd :
        q ∣
          Polynomial.map
            (algebraMap K
              (IsDedekindDomain.HeightOneSpectrum.adicCompletion K v))
            (minpoly K pb.gen)) :
      ∃ w,
        q =
          minpoly (IsDedekindDomain.HeightOneSpectrum.adicCompletion K v)
            ((algebraMap L
                (IsDedekindDomain.HeightOneSpectrum.adicCompletion L ↑w))
              pb.gen)
    theorem NumberField.exists_eq_minpoly_algebraMap.{u_1,
        u_2}
      {K : Type u_1} [Field K] [NumberField K]
      {L : Type u_2} [Field L] [NumberField L]
      [Algebra K L]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K))
      (pb : PowerBasis K L)
      {q :
        Polynomial
          (IsDedekindDomain.HeightOneSpectrum.adicCompletion
            K v)}
      (hq : Irreducible q) (hqm : q.Monic)
      (hdvd :
        q ∣
          Polynomial.map
            (algebraMap K
              (IsDedekindDomain.HeightOneSpectrum.adicCompletion
                K v))
            (minpoly K pb.gen)) :
      ∃ w,
        q =
          minpoly
            (IsDedekindDomain.HeightOneSpectrum.adicCompletion
              K v)
            ((algebraMap L
                (IsDedekindDomain.HeightOneSpectrum.adicCompletion
                  L ↑w))
              pb.gen)
    **Every factor of `f` over `K_v` gives a completion** (LMFDB `nf.padic_completion`): every
    monic irreducible factor `q` of `f` over `K_v` is the minimal polynomial of the image `a_w` of `a`
    in `L_w` for some place `w ∣ v`, so that `K_v[x] / (q) ≃ₐ[K_v] L_w`. 
  • defdefined in TauCeti/NumberTheory/NumberField/LocalGlobal/Semilocal/Basic.lean
    complete
    def TauCeti.semilocalEquiv.{u_1, u_2} {K : Type u_1} [Field K]
      [NumberField K] (L : Type u_2) [Field L] [NumberField L] [Algebra K L]
      (v :
        IsDedekindDomain.HeightOneSpectrum (NumberField.RingOfIntegers K)) :
      TensorProduct K
          (IsDedekindDomain.HeightOneSpectrum.adicCompletion K v)
          L ≃ₐ[IsDedekindDomain.HeightOneSpectrum.adicCompletion K v]
        (w : { w // w.asIdeal.LiesOver v.asIdeal }) →
          IsDedekindDomain.HeightOneSpectrum.adicCompletion L ↑w
    def TauCeti.semilocalEquiv.{u_1, u_2}
      {K : Type u_1} [Field K] [NumberField K]
      (L : Type u_2) [Field L] [NumberField L]
      [Algebra K L]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          (NumberField.RingOfIntegers K)) :
      TensorProduct K
          (IsDedekindDomain.HeightOneSpectrum.adicCompletion
            K v)
          L ≃ₐ[IsDedekindDomain.HeightOneSpectrum.adicCompletion
          K v]
        (w :
            { w //
              w.asIdeal.LiesOver
                v.asIdeal }) →
          IsDedekindDomain.HeightOneSpectrum.adicCompletion
            L ↑w
    **The semi-local decomposition** `K_v ⊗[K] L ≃ₐ[K_v] ∏_{w ∣ v} L_w`: completing `L` at the
    finitely many places above a finite place `v` of `K` decomposes the scalar extension of `L` to
    `K_v` into the product of those completions. 
  • defdefined in Mathlib/RingTheory/DedekindDomain/AdicValuation.lean
    complete
    def IsDedekindDomain.HeightOneSpectrum.valuation.{u_1, u_2} {R : Type u_1}
      [CommRing R] [IsDedekindDomain R] (K : Type u_2) [Field K]
      [Algebra R K] [IsFractionRing R K]
      (v : IsDedekindDomain.HeightOneSpectrum R) :
      Valuation K (WithZero (Multiplicative ℤ))
    def IsDedekindDomain.HeightOneSpectrum.valuation.{u_1,
        u_2}
      {R : Type u_1} [CommRing R]
      [IsDedekindDomain R] (K : Type u_2)
      [Field K] [Algebra R K]
      [IsFractionRing R K]
      (v :
        IsDedekindDomain.HeightOneSpectrum
          R) :
      Valuation K
        (WithZero (Multiplicative ℤ))
    The `v`-adic valuation of `x : K` is the valuation of `r` divided by the valuation of `s`,
    where `r` and `s` are chosen so that `x = r/s`. 
Definition5.1.59
uses 1used by 0✓L∃∀N

Searching p-adic completions of a number field. (LMFDB)

Definition 5.1.61

When searching for number fields with a list of p-adic completions, the results will contain fields which match all of the completions in the list.

Tau Ceti Review: AbsoluteValue.Completion.

Depends on: Definition 5.1.61

Lean code for Definition5.1.59●7 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Place.lean
    complete
    def AbsoluteValue.Place.{u_1} (K : Type u_1) [Field K] : Type u_1
    def AbsoluteValue.Place.{u_1} (K : Type u_1)
      [Field K] : Type u_1
    A **place** of a field `K` (LMFDB `nf.place`): an equivalence class of nontrivial absolute
    values on `K`, real-valued and satisfying the triangle inequality, for the equivalence
    `AbsoluteValue.IsEquiv`; two absolute values are equivalent when one is a positive power of the
    other (`AbsoluteValue.isEquiv_iff_exists_rpow_eq`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Place.lean
    complete
    def AbsoluteValue.Place.IsArchimedean.{u_1} {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Prop
    def AbsoluteValue.Place.IsArchimedean.{u_1}
      {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Prop
    A place is **archimedean** when its absolute values do not satisfy the ultrametric inequality;
    this does not depend on the absolute value (`IsEquiv.isNonarchimedean_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Ostrowski.lean
    complete
    theorem AbsoluteValue.Place.isArchimedean_iff_isReal_or_isComplex.{u_1}
      {K : Type u_1} [Field K] [NumberField K] (p : AbsoluteValue.Place K) :
      p.IsArchimedean ↔ p.IsReal ∨ p.IsComplex
    theorem AbsoluteValue.Place.isArchimedean_iff_isReal_or_isComplex.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (p : AbsoluteValue.Place K) :
      p.IsArchimedean ↔ p.IsReal ∨ p.IsComplex
    The archimedean places of a number field, also called its **infinite places**, are its real
    and its complex places. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Ostrowski.lean
    complete
    theorem AbsoluteValue.Place.not_isArchimedean_iff_exists_finitePlace.{u_1}
      {K : Type u_1} [Field K] [NumberField K] (p : AbsoluteValue.Place K) :
      ¬p.IsArchimedean ↔ ∃ w, w.toPlace = p
    theorem AbsoluteValue.Place.not_isArchimedean_iff_exists_finitePlace.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (p : AbsoluteValue.Place K) :
      ¬p.IsArchimedean ↔ ∃ w, w.toPlace = p
    **Ostrowski's theorem** for number fields, nonarchimedean case: the nonarchimedean places of a
    number field are those given by its finite places, that is by the maximal ideals of `𝓞 K`. 
  • abbrevdefined in Mathlib/Analysis/Normed/Field/WithAbs.lean
    complete
    abbrev AbsoluteValue.Completion.{u_1} {K : Type u_1} [Field K]
      (v : AbsoluteValue K ℝ) : Type u_1
    abbrev AbsoluteValue.Completion.{u_1}
      {K : Type u_1} [Field K]
      (v : AbsoluteValue K ℝ) : Type u_1
    The completion of a field with respect to a real absolute value. 
  • abbrevdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/PlaceCompletion.lean
    complete
    abbrev AbsoluteValue.Place.Completion.{u_1} {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Type u_1
    abbrev AbsoluteValue.Place.Completion.{u_1}
      {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Type u_1
    The **completion** `K_v` of a field `K` at a place `v` (LMFDB `nf.place`): the completion of `K`
    for the metric of a chosen absolute value in `v`. It is a complete topological field, indeed a
    normed field, and up to an isomorphism of topological fields extending the identity of `K` it does
    not depend on the chosen absolute value (`Place.completionRingEquiv`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/PlaceCompletion.lean
    complete
    def AbsoluteValue.Place.completionRingEquiv.{u_1} {K : Type u_1} [Field K]
      {v : AbsoluteValue K ℝ} {p : AbsoluteValue.Place K}
      {hv : v.IsNontrivial} (hp : AbsoluteValue.Place.mk v hv = p) :
      p.Completion ≃+* v.Completion
    def AbsoluteValue.Place.completionRingEquiv.{u_1}
      {K : Type u_1} [Field K]
      {v : AbsoluteValue K ℝ}
      {p : AbsoluteValue.Place K}
      {hv : v.IsNontrivial}
      (hp : AbsoluteValue.Place.mk v hv = p) :
      p.Completion ≃+* v.Completion
    The isomorphism between the completion `K_v` at a place `v` and the completion of `K` at any
    absolute value in `v` (LMFDB `nf.place`): it extends the identity of `K`
    (`Place.completionRingEquiv_coe`) and is a homeomorphism
    (`Place.isHomeomorph_completionRingEquiv`). 
Definition5.1.60
Statement uses 5
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Pictures for number fields. (LMFDB)

For each number field F, the picture displays the prime spectrum of the ring of integers \mathcal{O}_F of F, visualized as a curve over \operatorname{Spec} \mathbb{Z}. This is by analogy with algebraic curves, since points on a curve over \mathbb{C} are in bijection with prime ideals of its coordinate ring. Each prime ideal in \operatorname{Spec} \mathcal{O}_F is drawn as a point, and the lines connecting the points are purely for aesthetical purposes, having no deeper meaning.

  • A point is colored if it corresponds to a ramified prime, with ramification index corresponding to the hue of the point.

  • The radius of a point is proportional to its residue degree.

In the portrait in the properties box, only the spectrum of \mathcal{O}_F is drawn, while at the bottom of the number field page, we also draw \operatorname{Spec} \mathbb{Z}. This way we can intuitively study the fibers of the map \operatorname{Spec} \mathcal{O}_F \to \operatorname{Spec} \mathbb{Z}, where the fiber above a rational prime p is the set of primes of \mathcal{O}_F lying above p.

Tau Ceti Review: PrimeSpectrum, AlgebraicGeometry.Scheme.isoSpec, Ideal.primesOver, AlgebraicGeometry.Scheme.Hom.fiber.

Depends on: Definition 5.1.1 Definition 5.1.20 Definition 5.1.67 Definition 5.1.74 Definition 5.1.82

Lean code for Definition5.1.60●8 declarations
  • structure(2 fields)defined in Mathlib/RingTheory/Spectrum/Prime/Defs.lean
    complete
    structure PrimeSpectrum.{u_1} (R : Type u_1) [CommSemiring R] : Type u_1
    structure PrimeSpectrum.{u_1} (R : Type u_1)
      [CommSemiring R] : Type u_1
    The prime spectrum of a commutative (semi)ring `R` is the type of all prime ideals of `R`.
    
    It is naturally endowed with a topology (the Zariski topology),
    and a sheaf of commutative rings (see `Mathlib/AlgebraicGeometry/StructureSheaf.lean`).
    It is a fundamental building block in algebraic geometry. 
    asIdeal : Ideal R
    isPrime : self.asIdeal.IsPrime
  • defdefined in Mathlib/AlgebraicGeometry/AffineScheme.lean
    complete
    def AlgebraicGeometry.Scheme.isoSpec.{u_1} (X : AlgebraicGeometry.Scheme)
      [AlgebraicGeometry.IsAffine X] :
      X ≅ AlgebraicGeometry.Spec (X.presheaf.obj (Opposite.op ⊤))
    def AlgebraicGeometry.Scheme.isoSpec.{u_1}
      (X : AlgebraicGeometry.Scheme)
      [AlgebraicGeometry.IsAffine X] :
      X ≅
        AlgebraicGeometry.Spec
          (X.presheaf.obj (Opposite.op ⊤))
    The canonical isomorphism `X ≅ Spec Γ(X)` for an affine scheme. 
  • defdefined in LeanBridge/ForMathlib/RingTheory/NullstellensatzMaximalSpectrum.lean
    complete
    def MvPolynomial.zeroLocusToMaximalSpectrum.{u_1, u_2} {K : Type u_1}
      {σ : Type u_2} [Field K] (I : Ideal (MvPolynomial σ K))
      (x : ↑(MvPolynomial.zeroLocus K I)) :
      MaximalSpectrum (MvPolynomial σ K ⧸ I)
    def MvPolynomial.zeroLocusToMaximalSpectrum.{u_1,
        u_2}
      {K : Type u_1} {σ : Type u_2} [Field K]
      (I : Ideal (MvPolynomial σ K))
      (x : ↑(MvPolynomial.zeroLocus K I)) :
      MaximalSpectrum (MvPolynomial σ K ⧸ I)
    The maximal ideal of the coordinate ring `K[X] ⧸ I` of the functions vanishing at a point `x`
    of the zero locus of `I`: the kernel of the evaluation at `x`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/NullstellensatzMaximalSpectrum.lean
    complete
    theorem MvPolynomial.bijective_zeroLocusToMaximalSpectrum.{u_1, u_2}
      {K : Type u_1} {σ : Type u_2} [Field K] (I : Ideal (MvPolynomial σ K))
      [IsAlgClosed K] [Finite σ] :
      Function.Bijective (MvPolynomial.zeroLocusToMaximalSpectrum I)
    theorem MvPolynomial.bijective_zeroLocusToMaximalSpectrum.{u_1,
        u_2}
      {K : Type u_1} {σ : Type u_2} [Field K]
      (I : Ideal (MvPolynomial σ K))
      [IsAlgClosed K] [Finite σ] :
      Function.Bijective
        (MvPolynomial.zeroLocusToMaximalSpectrum
          I)
    **The points of an affine variety over an algebraically closed field are in bijection with the
    maximal ideals of its coordinate ring**: the map sending a point `x` of `V(I)` to the maximal ideal
    of `K[X] ⧸ I` of the functions vanishing at `x` is bijective. 
  • defdefined in Mathlib/RingTheory/Ideal/Over.lean
    complete
    def Ideal.primesOver.{u_2, u_3} {A : Type u_2} [CommSemiring A]
      (p : Ideal A) (B : Type u_3) [Semiring B] [Algebra A B] :
      Set (Ideal B)
    def Ideal.primesOver.{u_2, u_3} {A : Type u_2}
      [CommSemiring A] (p : Ideal A)
      (B : Type u_3) [Semiring B]
      [Algebra A B] : Set (Ideal B)
    The set of all prime ideals in `B` that lie over an ideal `p` of `A`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SpecFiber.lean
    complete
    theorem PrimeSpectrum.preimage_comap_singleton_eq_primesOver.{u_1, u_2}
      {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S]
      (𝔭 : PrimeSpectrum R) :
      PrimeSpectrum.comap (algebraMap R S) ⁻¹' {𝔭} =
        {P | P.asIdeal ∈ 𝔭.asIdeal.primesOver S}
    theorem PrimeSpectrum.preimage_comap_singleton_eq_primesOver.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2}
      [CommRing R] [CommRing S] [Algebra R S]
      (𝔭 : PrimeSpectrum R) :
      PrimeSpectrum.comap (algebraMap R S) ⁻¹'
          {𝔭} =
        {P |
          P.asIdeal ∈ 𝔭.asIdeal.primesOver S}
    **The fibre of `Spec S → Spec R` over a prime `𝔭` is the set of primes of `S` lying over
    `𝔭`.** 
  • defdefined in Mathlib/AlgebraicGeometry/Fiber.lean
    complete
    def AlgebraicGeometry.Scheme.Hom.fiber.{u} {X Y : AlgebraicGeometry.Scheme}
      (f : X ⟶ Y) (y : ↥Y) : AlgebraicGeometry.Scheme
    def AlgebraicGeometry.Scheme.Hom.fiber.{u}
      {X Y : AlgebraicGeometry.Scheme}
      (f : X ⟶ Y) (y : ↥Y) :
      AlgebraicGeometry.Scheme
    `f.fiber y` is the scheme-theoretic fiber of `f` at `y`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SpecFiber.lean
    complete
    theorem NumberField.range_fiberι_spec_map_algebraMap_int (F : Type) [Field F]
      {p : ℕ} (hp : (Ideal.span {↑p}).IsPrime) :
      Set.range
          ⇑(AlgebraicGeometry.Scheme.Hom.fiberι
              (AlgebraicGeometry.Spec.map
                (CommRingCat.ofHom
                  (algebraMap ℤ (NumberField.RingOfIntegers F))))
              { asIdeal := Ideal.span {↑p}, isPrime := hp }) =
        {P |
          P.asIdeal ∈
            (Ideal.span {↑p}).primesOver (NumberField.RingOfIntegers F)}
    theorem NumberField.range_fiberι_spec_map_algebraMap_int
      (F : Type) [Field F] {p : ℕ}
      (hp : (Ideal.span {↑p}).IsPrime) :
      Set.range
          ⇑(AlgebraicGeometry.Scheme.Hom.fiberι
              (AlgebraicGeometry.Spec.map
                (CommRingCat.ofHom
                  (algebraMap ℤ
                    (NumberField.RingOfIntegers
                      F))))
              { asIdeal := Ideal.span {↑p},
                isPrime := hp }) =
        {P |
          P.asIdeal ∈
            (Ideal.span {↑p}).primesOver
              (NumberField.RingOfIntegers F)}
    **The fibre of `Spec 𝓞_F → Spec ℤ` above a rational prime `p` is the set of the primes of `𝓞_F`
    lying above `p`**: the points of the scheme-theoretic fibre over the point `(p)` of `Spec ℤ`. 
Definition5.1.61
Statement uses 6
Statement dependency previews
Preview
Definition 1.1.41
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 1.2.53
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Place of a number field. (LMFDB)

A place v of a field K is an equivalence class of non-trivial absolute values on K. As with absolute values, places may be classified as archimedean or nonarchimedean, since these properties are preserved under equivalence.

Each place induces a distance metric that gives K a metric topology. The completion K_v of K at v is the completion of this metric space, which is also a topological field.

When K is a number field each nonarchimedean place arises from the valuation associated to each prime ideal in the ring of integers of K, while archimedean places arise from embeddings of K into the complex numbers: each real embedding determines a real place, and each conjugate pair of complex embeddings determines a complex place. The archimedean places of a number field are also called infinite places.

Tau Ceti Review: AbsoluteValue.Completion.

Depends on: Definition 5.1.1 Definition 5.1.4 Definition 5.1.10 Definition 5.1.69 Definition 5.1.74 Definition 1.1.41

Lean code for Definition5.1.61●7 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Place.lean
    complete
    def AbsoluteValue.Place.{u_1} (K : Type u_1) [Field K] : Type u_1
    def AbsoluteValue.Place.{u_1} (K : Type u_1)
      [Field K] : Type u_1
    A **place** of a field `K` (LMFDB `nf.place`): an equivalence class of nontrivial absolute
    values on `K`, real-valued and satisfying the triangle inequality, for the equivalence
    `AbsoluteValue.IsEquiv`; two absolute values are equivalent when one is a positive power of the
    other (`AbsoluteValue.isEquiv_iff_exists_rpow_eq`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Place.lean
    complete
    def AbsoluteValue.Place.IsArchimedean.{u_1} {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Prop
    def AbsoluteValue.Place.IsArchimedean.{u_1}
      {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Prop
    A place is **archimedean** when its absolute values do not satisfy the ultrametric inequality;
    this does not depend on the absolute value (`IsEquiv.isNonarchimedean_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Ostrowski.lean
    complete
    theorem AbsoluteValue.Place.isArchimedean_iff_isReal_or_isComplex.{u_1}
      {K : Type u_1} [Field K] [NumberField K] (p : AbsoluteValue.Place K) :
      p.IsArchimedean ↔ p.IsReal ∨ p.IsComplex
    theorem AbsoluteValue.Place.isArchimedean_iff_isReal_or_isComplex.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (p : AbsoluteValue.Place K) :
      p.IsArchimedean ↔ p.IsReal ∨ p.IsComplex
    The archimedean places of a number field, also called its **infinite places**, are its real
    and its complex places. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Ostrowski.lean
    complete
    theorem AbsoluteValue.Place.not_isArchimedean_iff_exists_finitePlace.{u_1}
      {K : Type u_1} [Field K] [NumberField K] (p : AbsoluteValue.Place K) :
      ¬p.IsArchimedean ↔ ∃ w, w.toPlace = p
    theorem AbsoluteValue.Place.not_isArchimedean_iff_exists_finitePlace.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (p : AbsoluteValue.Place K) :
      ¬p.IsArchimedean ↔ ∃ w, w.toPlace = p
    **Ostrowski's theorem** for number fields, nonarchimedean case: the nonarchimedean places of a
    number field are those given by its finite places, that is by the maximal ideals of `𝓞 K`. 
  • abbrevdefined in Mathlib/Analysis/Normed/Field/WithAbs.lean
    complete
    abbrev AbsoluteValue.Completion.{u_1} {K : Type u_1} [Field K]
      (v : AbsoluteValue K ℝ) : Type u_1
    abbrev AbsoluteValue.Completion.{u_1}
      {K : Type u_1} [Field K]
      (v : AbsoluteValue K ℝ) : Type u_1
    The completion of a field with respect to a real absolute value. 
  • abbrevdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/PlaceCompletion.lean
    complete
    abbrev AbsoluteValue.Place.Completion.{u_1} {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Type u_1
    abbrev AbsoluteValue.Place.Completion.{u_1}
      {K : Type u_1} [Field K]
      (p : AbsoluteValue.Place K) : Type u_1
    The **completion** `K_v` of a field `K` at a place `v` (LMFDB `nf.place`): the completion of `K`
    for the metric of a chosen absolute value in `v`. It is a complete topological field, indeed a
    normed field, and up to an isomorphism of topological fields extending the identity of `K` it does
    not depend on the chosen absolute value (`Place.completionRingEquiv`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/PlaceCompletion.lean
    complete
    def AbsoluteValue.Place.completionRingEquiv.{u_1} {K : Type u_1} [Field K]
      {v : AbsoluteValue K ℝ} {p : AbsoluteValue.Place K}
      {hv : v.IsNontrivial} (hp : AbsoluteValue.Place.mk v hv = p) :
      p.Completion ≃+* v.Completion
    def AbsoluteValue.Place.completionRingEquiv.{u_1}
      {K : Type u_1} [Field K]
      {v : AbsoluteValue K ℝ}
      {p : AbsoluteValue.Place K}
      {hv : v.IsNontrivial}
      (hp : AbsoluteValue.Place.mk v hv = p) :
      p.Completion ≃+* v.Completion
    The isomorphism between the completion `K_v` at a place `v` and the completion of `K` at any
    absolute value in `v` (LMFDB `nf.place`): it extends the identity of `K`
    (`Place.completionRingEquiv_coe`) and is a homeomorphism
    (`Place.isHomeomorph_completionRingEquiv`). 
Definition5.1.62
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 5.1.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Canonical defining polynomial for number fields. (LMFDB)

Every number field K can be represented as K = \Q[X]/P(x) for some monic P\in\Z[X], called a defining polynomial for K. Among all such defining polynomials, we define the reduced defining polynomial as follows.

Recall that for a monic polynomial P(x) = \prod_i(x-\alpha_i), the T_2 norm of P is T_2(P) = \sum_i |\alpha_i|^2.

  • Let L_0 be the list of (monic integral) defining polynomials for K that are minimal with respect to the T_2 norm.

  • Let L_1 be the sublist of L_0 of polynomials whose discriminant has minimal absolute value.

  • For a polynomial P = x^n + a_1x^{n-1} + \dots + a_n, let S(P) = (|a_1|,a_1,\dots,|a_n|,a_n), and order the polynomials in L_1 by the lexicographic order of the vectors S(P).

Then the reduced defining polynomial of K is the first polynomial in L_1 with respect to this order.

The pari/gp function <code>polredabs()</code> computes reduced defining polynomials, which are also commonly called <code>polredabs</code> polynomials.

Depends on: Definition 5.1.1 Definition 5.1.63

Lean code for Definition5.1.62●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    def NumberField.IsPolredabs.{u_1} (K : Type u_1) [Field K] [NumberField K]
      (P : Polynomial ℤ) : Prop
    def NumberField.IsPolredabs.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (P : Polynomial ℤ) : Prop
    `P` is the **reduced defining polynomial** of a number field `K` (LMFDB `nf.polredabs`), the
    output of PARI's `polredabs`: a defining polynomial of `K` that is least among the defining
    polynomials of `K` for the lexicographic order on `(T₂(P), |disc P|, S(P))`. That is, `P` has
    minimal `T₂` norm, then minimal absolute discriminant among those, and comes first among those for
    the lexicographic order on `S(P)`. It exists (`exists_isPolredabs`) and is unique
    (`IsPolredabs.eq`). 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    def NumberField.polredabs.{u_1} (K : Type u_1) [Field K] [NumberField K] :
      Polynomial ℤ
    def NumberField.polredabs.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : Polynomial ℤ
    The **reduced defining polynomial** of a number field `K` (LMFDB `nf.polredabs`), the
    polynomial `P` with `IsPolredabs K P`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    def NumberField.IsDefiningPolynomial.{u_1} (K : Type u_1) [Field K]
      [NumberField K] (P : Polynomial ℤ) : Prop
    def NumberField.IsDefiningPolynomial.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (P : Polynomial ℤ) : Prop
    A **defining polynomial** of a number field `K` (LMFDB `nf.polredabs`): a monic polynomial
    `P ∈ ℤ[X]` such that `K ≅ ℚ[X] / (P)`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    theorem NumberField.exists_isPolredabs.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : ∃ P, NumberField.IsPolredabs K P
    theorem NumberField.exists_isPolredabs.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      ∃ P, NumberField.IsPolredabs K P
    Every number field has a reduced defining polynomial. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Polredabs.lean
    complete
    theorem NumberField.IsPolredabs.eq.{u_1} {K : Type u_1} [Field K]
      [NumberField K] {P Q : Polynomial ℤ}
      (hP : NumberField.IsPolredabs K P)
      (hQ : NumberField.IsPolredabs K Q) : P = Q
    theorem NumberField.IsPolredabs.eq.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {P Q : Polynomial ℤ}
      (hP : NumberField.IsPolredabs K P)
      (hQ : NumberField.IsPolredabs K Q) :
      P = Q
    The reduced defining polynomial of a number field is unique. 
Definition5.1.63
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Discriminant of polynomial. (LMFDB)

The discriminant of a monic polynomial f(x) = \prod_{i=1}^d (x - \alpha_i) is the quantity

\Delta = \prod_{i < j} (\alpha_i - \alpha_j)^2.

If f has integral coefficients, K is the number field defined by f and \alpha is a root of f in K, then the discriminant D of K divides \Delta and the ratio \Delta/D is the square of the index of \Z[\alpha] in the ring of integers of K.

Tau Ceti Review: Polynomial.discr, Polynomial.Monic.discr_eq_prod_roots_sub_sq, TauCeti.NumberField.IntegralPrimitiveElement.discr_minpoly_eq_index_sq_mul_discr.

Depends on: Definition 5.1.1 Definition 5.1.17 Definition 5.1.74

Lean code for Definition5.1.63●3 declarations
  • defdefined in Mathlib/RingTheory/Polynomial/Resultant/Basic.lean
    complete
    def Polynomial.discr.{u_1} {R : Type u_1} [CommRing R] (f : Polynomial R) :
      R
    def Polynomial.discr.{u_1} {R : Type u_1}
      [CommRing R] (f : Polynomial R) : R
    The discriminant of a polynomial, defined as the determinant of `f.sylvesterDeriv` modified
    by a sign. The sign is chosen so polynomials over `ℝ` with all roots real have non-negative
    discriminant. 
  • theoremdefined in TauCeti/RingTheory/Polynomial/Resultant/Discriminant.lean
    complete
    theorem Polynomial.Monic.discr_eq_prod_roots_sub_sq.{u_1, u_3} {R : Type u_1}
      [CommRing R] {L : Type u_3} [CommRing L] [IsDomain L] [Algebra R L]
      {f : Polynomial R} (hf : f.Monic) {r : Fin f.natDegree → L}
      (hr :
        (Polynomial.map (algebraMap R L) f).roots =
          Multiset.map r Finset.univ.val) :
      (algebraMap R L) f.discr = ∏ i, ∏ j > i, (r i - r j) ^ 2
    theorem Polynomial.Monic.discr_eq_prod_roots_sub_sq.{u_1,
        u_3}
      {R : Type u_1} [CommRing R]
      {L : Type u_3} [CommRing L] [IsDomain L]
      [Algebra R L] {f : Polynomial R}
      (hf : f.Monic) {r : Fin f.natDegree → L}
      (hr :
        (Polynomial.map (algebraMap R L)
              f).roots =
          Multiset.map r Finset.univ.val) :
      (algebraMap R L) f.discr =
        ∏ i, ∏ j > i, (r i - r j) ^ 2
    **The root-product formula for a monic polynomial.** Number the roots of a monic `f` over an
    extension `L`, with multiplicity, as `r : Fin f.natDegree → L`. Then the discriminant of `f` is
    the square of the Vandermonde-like product of the differences of the roots. Numbering the whole
    root multiset by `Fin f.natDegree` already says that `f` splits over `L`, so no splitting
    hypothesis appears. 
  • theoremdefined in TauCeti/NumberTheory/NumberField/Index/Discriminant.lean
    complete
    theorem TauCeti.NumberField.IntegralPrimitiveElement.discr_minpoly_eq_index_sq_mul_discr.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (θ : TauCeti.NumberField.IntegralPrimitiveElement K) :
      (minpoly ℤ ↑θ).discr = ↑θ.index ^ 2 * NumberField.discr K
    theorem TauCeti.NumberField.IntegralPrimitiveElement.discr_minpoly_eq_index_sq_mul_discr.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (θ :
        TauCeti.NumberField.IntegralPrimitiveElement
          K) :
      (minpoly ℤ ↑θ).discr =
        ↑θ.index ^ 2 * NumberField.discr K
    **The index formula.** For an integral primitive element `θ` of a number field `K`, the
    discriminant of `minpoly ℤ θ` is the square of the index `[𝓞 K : ℤ[θ]]` times the discriminant
    of `K`. 
Definition5.1.64
Statement uses 3
Statement dependency previews
Preview
Definition 1.1.41
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 21
Reverse dependency previews
Preview
Definition 1.2.30
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Prime of a number field. (LMFDB)

A prime \mathfrak p of a number field K is a nonzero prime ideal of its ring of integers \mathcal O_K.

The ideal \mathfrak p \cap\mathcal O_K is a nonzero prime ideal of \Z (a prime of \Q), which is necessarily a principal ideal (p) for some prime number p. The prime \mathfrak p is then said to be a prime above p.

Tau Ceti Review: IsDedekindDomain.HeightOneSpectrum, Ideal.LiesOver, Ideal.under, Ideal.primesOver.

Depends on: Definition 5.1.1 Definition 5.1.74 Definition 1.1.41

Lean code for Definition5.1.64●4 definitions
  • structure(3 fields)defined in Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean
    complete
    structure IsDedekindDomain.HeightOneSpectrum.{u_1} (R : Type u_1) [CommRing R] :
      Type u_1
    structure IsDedekindDomain.HeightOneSpectrum.{u_1}
      (R : Type u_1) [CommRing R] : Type u_1
    The height one prime spectrum of a Dedekind domain `R` is the type of nonzero prime ideals of
    `R`. Note that this equals the maximal spectrum if `R` has Krull dimension 1. 
    asIdeal : Ideal R
    isPrime : self.asIdeal.IsPrime
    ne_bot : self.asIdeal ≠ ⊥
  • class(1 method)defined in Mathlib/RingTheory/Ideal/Over.lean
    complete
    class Ideal.LiesOver.{u_2, u_3} {A : Type u_2} [CommSemiring A] {B : Type u_3}
      [Semiring B] [Algebra A B] (P : Ideal B) (p : Ideal A) : Prop
    class Ideal.LiesOver.{u_2, u_3} {A : Type u_2}
      [CommSemiring A] {B : Type u_3}
      [Semiring B] [Algebra A B] (P : Ideal B)
      (p : Ideal A) : Prop
    `P` lies over `p` if `p` is the preimage of `P` by the `algebraMap`. 
    over : p = Ideal.under A P
  • abbrevdefined in Mathlib/RingTheory/Ideal/Over.lean
    complete
    abbrev Ideal.under.{u_2, u_3} (A : Type u_2) [CommSemiring A] {B : Type u_3}
      [Semiring B] [Algebra A B] (P : Ideal B) : Ideal A
    abbrev Ideal.under.{u_2, u_3} (A : Type u_2)
      [CommSemiring A] {B : Type u_3}
      [Semiring B] [Algebra A B]
      (P : Ideal B) : Ideal A
    The ideal obtained by pulling back the ideal `P` from `B` to `A`. 
  • defdefined in Mathlib/RingTheory/Ideal/Over.lean
    complete
    def Ideal.primesOver.{u_2, u_3} {A : Type u_2} [CommSemiring A]
      (p : Ideal A) (B : Type u_3) [Semiring B] [Algebra A B] :
      Set (Ideal B)
    def Ideal.primesOver.{u_2, u_3} {A : Type u_2}
      [CommSemiring A] (p : Ideal A)
      (B : Type u_3) [Semiring B]
      [Algebra A B] : Set (Ideal B)
    The set of all prime ideals in `B` that lie over an ideal `p` of `A`. 
Definition5.1.65
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Primitive element. (LMFDB)

A primitive element for a number field K is a field generator of K. In other words, it is an element \alpha \in K such that the inclusion \Q(\alpha) \subseteq K is an equality. The primitive element theorem asserts that every number field admits a primitive element.

Tau Ceti Review: IntermediateField.adjoin, Field.exists_primitive_element.

Depends on: Definition 5.1.1 Definition 5.1.34

Lean code for Definition5.1.65●2 declarations
  • defdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean
    complete
    def IntermediateField.adjoin.{u_1, u_2} (F : Type u_1) [Field F]
      {E : Type u_2} [Field E] [Algebra F E] (S : Set E) :
      IntermediateField F E
    def IntermediateField.adjoin.{u_1, u_2}
      (F : Type u_1) [Field F] {E : Type u_2}
      [Field E] [Algebra F E] (S : Set E) :
      IntermediateField F E
    `adjoin F S` extends a field `F` by adjoining a set `S ⊆ E`. 
  • theoremdefined in Mathlib/FieldTheory/PrimitiveElement.lean
    complete
    theorem Field.exists_primitive_element.{u_1, u_2} (F : Type u_1) (E : Type u_2)
      [Field F] [Field E] [Algebra F E] [FiniteDimensional F E]
      [Algebra.IsSeparable F E] : ∃ α, F⟮α⟯ = ⊤
    theorem Field.exists_primitive_element.{u_1, u_2}
      (F : Type u_1) (E : Type u_2) [Field F]
      [Field E] [Algebra F E]
      [FiniteDimensional F E]
      [Algebra.IsSeparable F E] :
      ∃ α, F⟮α⟯ = ⊤
    **Primitive element theorem**: a finite separable field extension `E` of `F` has a
    primitive element, i.e. there is an `α ∈ E` such that `F⟮α⟯ = (⊤ : Subalgebra F E)`. 
Definition5.1.66
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Radical discriminant of a number field. (LMFDB)

The radical discriminant of a number field K is the product of the primes dividing the discriminant of K, i.e. the product of the primes which ramify in K.

Tau Ceti Review: UniqueFactorizationMonoid.radical, NumberField.discr, NumberField.not_dvd_discr_iff_isUnramifiedIn.

Depends on: Definition 5.1.1 Definition 5.1.17

Lean code for Definition5.1.66●4 declarations
  • defdefined in Mathlib/RingTheory/Radical/Basic.lean
    complete
    def UniqueFactorizationMonoid.radical.{u_1} {M : Type u_1}
      [CommMonoidWithZero M] [NormalizationMonoid M]
      [UniqueFactorizationMonoid M] (a : M) : M
    def UniqueFactorizationMonoid.radical.{u_1}
      {M : Type u_1} [CommMonoidWithZero M]
      [NormalizationMonoid M]
      [UniqueFactorizationMonoid M] (a : M) :
      M
    The radical of an element `a` in a unique factorization monoid is the product of
    the prime factors of `a`. 
  • abbrevdefined in Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean
    complete
    abbrev NumberField.discr.{u_1} (K : Type u_1) [Field K] [NumberField K] : ℤ
    abbrev NumberField.discr.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : ℤ
    The absolute discriminant of a number field. 
  • theoremdefined in Mathlib/RingTheory/Radical/NatInt.lean
    complete
    theorem Int.radical_eq_prod_primeFactors {z : ℤ} :
      UniqueFactorizationMonoid.radical z =
        ↑(∏ p ∈ z.natAbs.primeFactors, p)
    theorem Int.radical_eq_prod_primeFactors {z : ℤ} :
      UniqueFactorizationMonoid.radical z =
        ↑(∏ p ∈ z.natAbs.primeFactors, p)
  • theoremdefined in Mathlib/NumberTheory/NumberField/Discriminant/Different.lean
    complete
    theorem NumberField.not_dvd_discr_iff_isUnramifiedIn.{u_1, u_2} (K : Type u_1)
      (𝒪 : Type u_2) [Field K] [NumberField K] [CommRing 𝒪] [Algebra 𝒪 K]
      [IsIntegralClosure 𝒪 ℤ K] {p : ℤ} (hp : Prime p) :
      ¬p ∣ NumberField.discr K ↔ Algebra.IsUnramifiedIn 𝒪 (Ideal.span {p})
    theorem NumberField.not_dvd_discr_iff_isUnramifiedIn.{u_1,
        u_2}
      (K : Type u_1) (𝒪 : Type u_2) [Field K]
      [NumberField K] [CommRing 𝒪]
      [Algebra 𝒪 K] [IsIntegralClosure 𝒪 ℤ K]
      {p : ℤ} (hp : Prime p) :
      ¬p ∣ NumberField.discr K ↔
        Algebra.IsUnramifiedIn 𝒪
          (Ideal.span {p})
    A prime `p` does not divide `discr K` if and only if `p` (as the ideal `span {p}`) is
    unramified in the ring of integers `𝒪`.
    
    Also see `not_dvd_discr_iff_forall_liesOver` and `not_dvd_discr_iff_forall_mem` for variants
    whose RHS does not use `Algebra.IsUnramifiedIn`. 
Definition5.1.67
uses 0
Used by 4
Reverse dependency previews
Preview
Definition 5.1.47
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Ramified (rational) prime of a number field. (LMFDB)

A prime integer p is a ramified prime of a number field K if, when the ideal generated by p is factored into prime ideals in the ring of integers \mathcal{O}_K of K,

p\mathcal{O}_K= \mathcal{P_1}^{e_1}\cdots \mathcal{P_k}^{e_k},

there is an i such that e_i\geq 2.

The ramified primes of K are the primes dividing the discriminant of K.

Tau Ceti Review: Algebra.IsUnramifiedIn, Algebra.isUnramifiedIn_iff_forall_ramificationIdx_eq_one, Ideal.ramificationIdx, Ideal.IsDedekindDomain.ramificationIdx_eq_normalizedFactors_count, NumberField.not_dvd_discr_iff_isUnramifiedIn.

Lean code for Definition5.1.67●5 declarations
  • defdefined in Mathlib/RingTheory/Unramified/Locus.lean
    complete
    def Algebra.IsUnramifiedIn.{u_1, u_2} {R : Type u_1} [CommRing R]
      (A : Type u_2) [CommRing A] [Algebra R A] (𝔭 : Ideal R) : Prop
    def Algebra.IsUnramifiedIn.{u_1, u_2}
      {R : Type u_1} [CommRing R]
      (A : Type u_2) [CommRing A]
      [Algebra R A] (𝔭 : Ideal R) : Prop
    A prime `𝔭` of `R` is unramified in `A` if every prime ideal `𝔓` of `A` lying over `𝔭` is
    unramified. 
  • theoremdefined in Mathlib/NumberTheory/RamificationInertia/Unramified.lean
    complete
    theorem Algebra.isUnramifiedIn_iff_forall_ramificationIdx_eq_one.{u_1, u_2}
      {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S]
      [IsDomain R] [Module.Finite ℤ R] [CharZero R]
      [Algebra.EssFiniteType R S] [Algebra.IsIntegral R S] {𝔭 : Ideal R} :
      Algebra.IsUnramifiedIn S 𝔭 ↔
        ∀ (𝔓 : Ideal S) [𝔓.IsPrime], 𝔓.LiesOver 𝔭 → 𝔓.ramificationIdx R = 1
    theorem Algebra.isUnramifiedIn_iff_forall_ramificationIdx_eq_one.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2}
      [CommRing R] [CommRing S] [Algebra R S]
      [IsDomain R] [Module.Finite ℤ R]
      [CharZero R] [Algebra.EssFiniteType R S]
      [Algebra.IsIntegral R S] {𝔭 : Ideal R} :
      Algebra.IsUnramifiedIn S 𝔭 ↔
        ∀ (𝔓 : Ideal S) [𝔓.IsPrime],
          𝔓.LiesOver 𝔭 →
            𝔓.ramificationIdx R = 1
    A nonzero ideal of `R` is unramified in `S` if and only if every prime ideal of `S` lying
    over it has ramification index `1`. 
  • defdefined in Mathlib/RingTheory/RamificationInertia/Ramification.lean
    complete
    def Ideal.ramificationIdx.{u_1, u_2} {S : Type u_1} [CommRing S]
      (q : Ideal S) (R : Type u_2) [CommRing R] [Algebra R S] : ℕ
    def Ideal.ramificationIdx.{u_1, u_2}
      {S : Type u_1} [CommRing S]
      (q : Ideal S) (R : Type u_2)
      [CommRing R] [Algebra R S] : ℕ
    Let `S/R` be an extension of rings, and let `q` be a prime ideal of `S` lying over a prime ideal
    `p` of `R`. Let `Sq` be the localization of `S` and `q`, and let `pSq` be the image of `p` in `Sq`.
    Then the ramification index of `q` over `R` is defined to be the length of the quotient `Sq/pSq` as
    an `Sq`-module.
    
    When `q` is not prime, we use a junk value of `0`.
    
    This will eventually replace the existing definition of `Ideal.ramificationIdx'`. 
  • theoremdefined in Mathlib/RingTheory/RamificationInertia/Ramification.lean
    complete
    theorem Ideal.IsDedekindDomain.ramificationIdx_eq_normalizedFactors_count.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S]
      (p : Ideal R) (q : Ideal S) [IsDedekindDomain S] [q.LiesOver p]
      (hp0 : Ideal.map (algebraMap R S) p ≠ ⊥) :
      q.ramificationIdx R =
        Multiset.count q
          (UniqueFactorizationMonoid.normalizedFactors
            (Ideal.map (algebraMap R S) p))
    theorem Ideal.IsDedekindDomain.ramificationIdx_eq_normalizedFactors_count.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2}
      [CommRing R] [CommRing S] [Algebra R S]
      (p : Ideal R) (q : Ideal S)
      [IsDedekindDomain S] [q.LiesOver p]
      (hp0 :
        Ideal.map (algebraMap R S) p ≠ ⊥) :
      q.ramificationIdx R =
        Multiset.count q
          (UniqueFactorizationMonoid.normalizedFactors
            (Ideal.map (algebraMap R S) p))
  • theoremdefined in Mathlib/NumberTheory/NumberField/Discriminant/Different.lean
    complete
    theorem NumberField.not_dvd_discr_iff_isUnramifiedIn.{u_1, u_2} (K : Type u_1)
      (𝒪 : Type u_2) [Field K] [NumberField K] [CommRing 𝒪] [Algebra 𝒪 K]
      [IsIntegralClosure 𝒪 ℤ K] {p : ℤ} (hp : Prime p) :
      ¬p ∣ NumberField.discr K ↔ Algebra.IsUnramifiedIn 𝒪 (Ideal.span {p})
    theorem NumberField.not_dvd_discr_iff_isUnramifiedIn.{u_1,
        u_2}
      (K : Type u_1) (𝒪 : Type u_2) [Field K]
      [NumberField K] [CommRing 𝒪]
      [Algebra 𝒪 K] [IsIntegralClosure 𝒪 ℤ K]
      {p : ℤ} (hp : Prime p) :
      ¬p ∣ NumberField.discr K ↔
        Algebra.IsUnramifiedIn 𝒪
          (Ideal.span {p})
    A prime `p` does not divide `discr K` if and only if `p` (as the ideal `span {p}`) is
    unramified in the ring of integers `𝒪`.
    
    Also see `not_dvd_discr_iff_forall_liesOver` and `not_dvd_discr_iff_forall_mem` for variants
    whose RHS does not use `Algebra.IsUnramifiedIn`. 
Definition5.1.68
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Rank of a number field. (LMFDB)

The rank of a number field K is the size of any set of fundamental units of K. It is equal to r = r_1 + r_2 -1 where r_1 is the number of real embeddings of K into \C and 2r_2 is the number of complex embeddings of K into \C.

Tau Ceti Review: NumberField.Units.rank, NumberField.InfinitePlace.card_eq_nrRealPlaces_add_nrComplexPlaces.

Depends on: Definition 5.1.1 Definition 5.1.21

Lean code for Definition5.1.68●3 declarations
  • defdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    def NumberField.Units.rank.{u_1} (K : Type u_1) [Field K] [NumberField K] :
      ℕ
    def NumberField.Units.rank.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    The unit rank of the number field `K`, it is equal to `card (InfinitePlace K) - 1`. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    theorem NumberField.Units.finrank_modTorsion.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        NumberField.Units.rank K
    theorem NumberField.Units.finrank_modTorsion.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Module.finrank ℤ
          (Additive
            ((NumberField.RingOfIntegers K)ˣ ⧸
              NumberField.Units.torsion K)) =
        NumberField.Units.rank K
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_eq_nrRealPlaces_add_nrComplexPlaces.{u_1}
      (K : Type u_1) [Field K] [NumberField K] :
      Fintype.card (NumberField.InfinitePlace K) =
        NumberField.InfinitePlace.nrRealPlaces K +
          NumberField.InfinitePlace.nrComplexPlaces K
    theorem NumberField.InfinitePlace.card_eq_nrRealPlaces_add_nrComplexPlaces.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fintype.card
          (NumberField.InfinitePlace K) =
        NumberField.InfinitePlace.nrRealPlaces
            K +
          NumberField.InfinitePlace.nrComplexPlaces
            K
Definition5.1.69
uses 0
Used by 5
Reverse dependency previews
Preview
Definition 4.1.123
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Real embedding. (LMFDB)

A real embedding of a number field K is a field homomorphism K\to \R. A single number field may have several distinct real embeddings.

Tau Ceti Review: RingHom, NumberField.ComplexEmbedding.IsReal, NumberField.ComplexEmbedding.IsReal.embedding.

Lean code for Definition5.1.69●4 declarations
  • structure(extends 8, 5 fields)defined in Mathlib/Algebra/Ring/Hom/Defs.lean
    complete
    structure RingHom.{u_5, u_6} (α : Type u_5) (β : Type u_6) [NonAssocSemiring α]
      [NonAssocSemiring β] : Type (max u_5 u_6)
    structure RingHom.{u_5, u_6} (α : Type u_5)
      (β : Type u_6) [NonAssocSemiring α]
      [NonAssocSemiring β] :
      Type (max u_5 u_6)
    Bundled semiring homomorphisms; use this for bundled ring homomorphisms too.
    
    This extends from both `MonoidHom` and `MonoidWithZeroHom` in order to put the fields in a
    sensible order, even though `MonoidWithZeroHom` already extends `MonoidHom`. 
    • α →* β
    • α →+ β
    • α →ₙ+* β
    • α →*₀ β
    toFun : α → β
    Inherited from
    1. MonoidHom
    2. OneHom
    map_one' : (↑↑self).toFun 1 = 1
    Inherited from
    1. MonoidHom
    2. OneHom
    map_mul' : ∀ (x y : α), (↑↑self).toFun (x * y) = (↑↑self).toFun x * (↑↑self).toFun y
    Inherited from
    1. MonoidHom
    map_zero' : (↑↑self).toFun 0 = 0
    The proposition that the function preserves 0 
    map_add' : ∀ (x y : α), (↑↑self).toFun (x + y) = (↑↑self).toFun x + (↑↑self).toFun y
    The proposition that the function preserves addition 
  • abbrevdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
    complete
    abbrev NumberField.ComplexEmbedding.IsReal.{u_1} {K : Type u_1} [Field K]
      (φ : K →+* ℂ) : Prop
    abbrev NumberField.ComplexEmbedding.IsReal.{u_1}
      {K : Type u_1} [Field K] (φ : K →+* ℂ) :
      Prop
    An embedding into `ℂ` is real if it is fixed by complex conjugation. 
  • defdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
    complete
    def NumberField.ComplexEmbedding.IsReal.embedding.{u_1} {K : Type u_1}
      [Field K] {φ : K →+* ℂ} (hφ : NumberField.ComplexEmbedding.IsReal φ) :
      K →+* ℝ
    def NumberField.ComplexEmbedding.IsReal.embedding.{u_1}
      {K : Type u_1} [Field K] {φ : K →+* ℂ}
      (hφ :
        NumberField.ComplexEmbedding.IsReal
          φ) :
      K →+* ℝ
    A real embedding as a ring homomorphism from `K` to `ℝ` . 
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_real_embeddings.{u_1} (K : Type u_1)
      [Field K] [NumberField K] :
      Fintype.card { φ // NumberField.ComplexEmbedding.IsReal φ } =
        NumberField.InfinitePlace.nrRealPlaces K
    theorem NumberField.InfinitePlace.card_real_embeddings.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fintype.card
          { φ //
            NumberField.ComplexEmbedding.IsReal
              φ } =
        NumberField.InfinitePlace.nrRealPlaces
          K
Definition5.1.70
Statement uses 5
Statement dependency previews
Preview
Definition 5.1.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Reflex field. (LMFDB)

Let K be a CM number field and let \overline{\mathbb{Q}} be the algebraic closure of \Q in \C. A subset \Phi \subset \mathrm{Hom}(K, \overline{\mathbb{Q}}) is called a CM type if for every embedding \iota \in \mathrm{Hom}(K, \overline{\mathbb{Q}}) either \iota \in \Phi or \overline{\iota} \in \Phi, but not both, where \overline{\iota} is the complex conjugate of \iota.

Given a CM field K and a CM type \Phi, the reflex field is the fixed field inside \overline{\Q} corresponding to the subgroup \{ \rho \in \Gal(\overline{\Q}/\Q) : \rho \Phi = \Phi \} of \Gal(\overline{\Q}/\Q). A CM type \Phi and its complement \overline{\Phi}, which is the same as the set of complex conjugate embeddings, have the same reflex field. The number of complex conjugate pairs of CM types is 2^{g-1}, where 2g=[K:\Q], the degree of K over \Q.

To specify a CM type \Phi for the CM field K=\Q(a): <ol> <li>fix an order (\iota_1,\overline{\iota_1}), \dots, (\iota_g,\overline{\iota_g}) of the pairs of complex embeddings of K; <li> then \Phi=(\varphi_1,\dots,\varphi_g) where \varphi_j\in\{\iota_j,\overline{\iota_j}\} for 1\le j\le g; <li> now \Phi can be encoded by the list (\text{sign}(\text{im}(\varphi_1(a))),\dots,\text{sign}(\text{im}(\varphi_g(a)))). </ol>

The CM types in the LMFDB are grouped in Galois orbits under the action of \mathrm{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) described above.

<!--- (commented out by John Cremona: this information should be in the completeness knowl for number fields) In the LMFDB, there is a potentially incomplete list of reflex fields for each CM field K of degree at most 12. For each reflex field, it is indicated for how many of the 2^{[K:\mathbb{Q}]/2 - 1} pairs of complementary CM types this particular field is the reflex field. The only reflex fields listed are those of degree at most 36.

--->

Depends on: Definition 8.3.160 Definition 5.1.9 Definition 5.1.10 Definition 5.1.14 Definition 5.1.19

Lean code for Definition5.1.70●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexField.lean
    complete
    def NumberField.CMType.{u_1} (K : Type u_1) [Field K] : Type u_1
    def NumberField.CMType.{u_1} (K : Type u_1)
      [Field K] : Type u_1
    A **CM type** of a CM field `K` (LMFDB `nf.reflex_field`): a set `Φ` of complex embeddings of
    `K` such that for every complex embedding `φ`, exactly one of `φ` and its complex conjugate lies in
    `Φ`. A field with a real embedding has no CM type. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexField.lean
    complete
    def NumberField.CMType.reflexField.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (Φ : NumberField.CMType K) :
      IntermediateField ℚ ↥(algebraicClosure ℚ ℂ)
    def NumberField.CMType.reflexField.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (Φ : NumberField.CMType K) :
      IntermediateField ℚ
        ↥(algebraicClosure ℚ ℂ)
    The **reflex field** of a CM type `Φ` (LMFDB `nf.reflex_field`): the fixed field in the
    algebraic closure `ℚ̄` of `ℚ` in `ℂ` of the subgroup `{ρ ∈ Gal(ℚ̄/ℚ) | ρ Φ = Φ}`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexField.lean
    complete
    def NumberField.CMType.stabilizer.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (Φ : NumberField.CMType K) :
      Subgroup Gal(↥(algebraicClosure ℚ ℂ)/ℚ)
    def NumberField.CMType.stabilizer.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (Φ : NumberField.CMType K) :
      Subgroup Gal(↥(algebraicClosure ℚ ℂ)/ℚ)
    The **stabilizer** of a CM type `Φ` in the absolute Galois group `Gal(ℚ̄/ℚ)`: the `ρ` with
    `ρ Φ = Φ` (`mem_stabilizer_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexField.lean
    complete
    theorem NumberField.CMType.reflexField_compl.{u_1} {K : Type u_1} [Field K]
      [NumberField K] (Φ : NumberField.CMType K) :
      Φ.compl.reflexField = Φ.reflexField
    theorem NumberField.CMType.reflexField_compl.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (Φ : NumberField.CMType K) :
      Φ.compl.reflexField = Φ.reflexField
    A CM type and its complement have the same reflex field. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexField.lean
    complete
    theorem NumberField.CMType.card_cmType.{u_1} (K : Type u_1) [Field K]
      [NumberField K] [NumberField.IsTotallyComplex K] :
      Nat.card (NumberField.CMType K) = 2 ^ (Module.finrank ℚ K / 2)
    theorem NumberField.CMType.card_cmType.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      [NumberField.IsTotallyComplex K] :
      Nat.card (NumberField.CMType K) =
        2 ^ (Module.finrank ℚ K / 2)
    **A totally complex field of degree `2g` has `2 ^ g` CM types**: one choice of an embedding
    for each complex place. 
Definition5.1.71
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Reflex field of the reflex field. (LMFDB)

Let K be a CM number field and let N a normal closure of K, let \Phi \subset \mathrm{Hom}(K, \overline{\mathbb{Q}}) be a CM type and L its associated reflex field. Then \Phi induces a CM type \Phi_N \subset \mathrm{Hom}(N, \mathbb{C}) by taking the maps that restrict to a map inside \Phi on K. The maps in \Phi_N are isomorphisms on the image F of N inside \overline{\mathbb{Q}} and by inverting them, we obtain a CM type on F with values in N. The reflex field of the reflex field is the reflex field of this CM type.

It can also be computed as follows. Consider the right action of \mathrm{Gal}(N/K) on the set of CM types on K. Then the reflex field of the reflex field is the subfield corresponding to the subgroup stabilising \Phi.

The reflex field of the reflex field is also the smallest field of definition of the CM type \Phi, i.e. it is the largest subfield M of K such that \Phi is induced from a CM type on M.

Depends on: Definition 5.1.9 Definition 5.1.70

Lean code for Definition5.1.71●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexField.lean
    complete
    def NumberField.CMType.reflexReflexField.{u_1} {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K) : Subfield K
    def NumberField.CMType.reflexReflexField.{u_1}
      {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K) : Subfield K
    The **reflex field of the reflex field** of a CM type `Φ` of `K` (LMFDB
    `nf.reflex_reflex_field`): the smallest subfield of `K` from which `Φ` is induced, the field of
    definition of `Φ`, defined as the intersection of the subfields from which `Φ` is induced. That `Φ`
    is induced from this intersection, by Galois theory in a Galois closure of `K`, is
    `isInducedFrom_reflexReflexField` (`ReflexReflexFieldGalois`).
    
    The LMFDB knowl calls this field the *largest* subfield from which `Φ` is induced; since a CM type
    induced from a subfield is induced from every larger subfield (`IsInducedFrom.mono`), the field of
    definition is the smallest such subfield. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexField.lean
    complete
    def NumberField.CMType.IsInducedFrom.{u_1} {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K) (M : Subfield K) : Prop
    def NumberField.CMType.IsInducedFrom.{u_1}
      {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K)
      (M : Subfield K) : Prop
    A CM type `Φ` of `K` is **induced** from the subfield `M` of `K` when there is a CM type `Ψ` of
    `M` such that `Φ` consists of the complex embeddings of `K` whose restriction to `M` lies in
    `Ψ`. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexField.lean
    complete
    def NumberField.CMType.induce.{u_1, u_2} {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K) {L : Type u_2} [Field L] (g : K →+* L) :
      NumberField.CMType L
    def NumberField.CMType.induce.{u_1, u_2}
      {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K)
      {L : Type u_2} [Field L] (g : K →+* L) :
      NumberField.CMType L
    The CM type of a field `L` **induced** by a CM type `Φ` of `K` along a ring homomorphism
    `g : K → L`: the complex embeddings of `L` whose composite with `g` lies in `Φ`. For a normal
    closure `L` of `K` this is the CM type `Φ_L` of the LMFDB knowl `nf.reflex_reflex_field`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexFieldInverseType.lean
    complete
    theorem NumberField.CMType.mem_inverseType_iff_comp_imageFieldConj_notMem.{u_1}
      {N : Type u_1} [Field N] [NumberField N] [IsGalois ℚ N]
      (Θ : NumberField.CMType N)
      (ψ : ↥(NumberField.ComplexEmbedding.imageField N) →+* N) :
      ψ ∈ Θ.inverseType ↔
        ψ.comp (NumberField.ComplexEmbedding.imageFieldConj N) ∉
          Θ.inverseType
    theorem NumberField.CMType.mem_inverseType_iff_comp_imageFieldConj_notMem.{u_1}
      {N : Type u_1} [Field N] [NumberField N]
      [IsGalois ℚ N]
      (Θ : NumberField.CMType N)
      (ψ :
        ↥(NumberField.ComplexEmbedding.imageField
              N) →+*
          N) :
      ψ ∈ Θ.inverseType ↔
        ψ.comp
            (NumberField.ComplexEmbedding.imageFieldConj
              N) ∉
          Θ.inverseType
    **The inverted CM type is a CM type with values in `N`**: it contains exactly one of an
    embedding `ψ` of `F` into `N` and its complex conjugate, the composite of `ψ` with complex
    conjugation on `F`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexFieldInverseType.lean
    complete
    theorem NumberField.CMType.map_algebraMap_reflexReflexField_eq_fixedField_inverseTypeStabilizer.{u_1,
        u_2}
      {N : Type u_1} [Field N] [NumberField N] [IsGalois ℚ N] {K : Type u_2}
      [Field K] [NumberField K] [Algebra K N] (Φ : NumberField.CMType K) :
      Subfield.map (algebraMap K N) Φ.reflexReflexField =
        (IntermediateField.fixedField
            (Φ.induce (algebraMap K N)).inverseTypeStabilizer).toSubfield
    theorem NumberField.CMType.map_algebraMap_reflexReflexField_eq_fixedField_inverseTypeStabilizer.{u_1,
        u_2}
      {N : Type u_1} [Field N] [NumberField N]
      [IsGalois ℚ N] {K : Type u_2} [Field K]
      [NumberField K] [Algebra K N]
      (Φ : NumberField.CMType K) :
      Subfield.map (algebraMap K N)
          Φ.reflexReflexField =
        (IntermediateField.fixedField
            (Φ.induce
                (algebraMap K
                  N)).inverseTypeStabilizer).toSubfield
    **The reflex field of the reflex field is the reflex field of the inverted CM type** (LMFDB
    `nf.reflex_reflex_field`): for a CM type `Φ` of `K`, a finite Galois extension `N` of `ℚ`
    containing `K`, such as a Galois closure of `K`, and the CM type `Φ_N` of `N` induced by `Φ`, the
    subfield of `N` fixed by the stabiliser of the inverses of the embeddings in `Φ_N` is the image of
    the reflex field of the reflex field of `Φ`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexFieldGalois.lean
    complete
    theorem NumberField.CMType.map_algebraMap_reflexReflexField.{u_1, u_3}
      {K : Type u_1} [Field K] (Φ : NumberField.CMType K) [NumberField K]
      (N : Type u_3) [Field N] [NumberField N] [IsGalois ℚ N]
      [Algebra K N] :
      Subfield.map (algebraMap K N) Φ.reflexReflexField =
        (IntermediateField.fixedField
            (Φ.induce (algebraMap K N)).precompStabilizer).toSubfield
    theorem NumberField.CMType.map_algebraMap_reflexReflexField.{u_1,
        u_3}
      {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K)
      [NumberField K] (N : Type u_3) [Field N]
      [NumberField N] [IsGalois ℚ N]
      [Algebra K N] :
      Subfield.map (algebraMap K N)
          Φ.reflexReflexField =
        (IntermediateField.fixedField
            (Φ.induce
                (algebraMap K
                  N)).precompStabilizer).toSubfield
    **In a finite Galois extension of `ℚ` containing `K`, the reflex field of the reflex field is
    the fixed field of the stabiliser of the induced CM type** (LMFDB `nf.reflex_reflex_field`): for a
    finite Galois extension `N` of `ℚ` containing `K`, such as a Galois closure of `K`, and the CM type
    `Φ_N` of `N` induced by `Φ`, the subfield of `N` fixed by the `g ∈ Gal(N/ℚ)` with `Φ_N ∘ g = Φ_N`
    is the reflex field of the reflex field of `Φ`. The LMFDB knowl lets `Gal(N/K)` act on the CM types
    of `K`; that action is trivial. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexFieldGalois.lean
    complete
    theorem NumberField.CMType.isLeast_reflexReflexField.{u_1} {K : Type u_1}
      [Field K] (Φ : NumberField.CMType K) [NumberField K] :
      IsLeast {M | Φ.IsInducedFrom M} Φ.reflexReflexField
    theorem NumberField.CMType.isLeast_reflexReflexField.{u_1}
      {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K)
      [NumberField K] :
      IsLeast {M | Φ.IsInducedFrom M}
        Φ.reflexReflexField
    **The reflex field of the reflex field is the smallest field of definition** (LMFDB
    `nf.reflex_reflex_field`): it is the least subfield of `K` from which `Φ` is induced. The LMFDB
    knowl says "largest", but a CM type induced from a subfield is induced from every larger
    subfield. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/ReflexReflexFieldGalois.lean
    complete
    theorem NumberField.CMType.map_reflexReflexField_eq_reflexField_reflexType.{u_1}
      {K : Type u_1} [Field K] (Φ : NumberField.CMType K) [NumberField K]
      (φ₀ : K →+* ℂ) [NumberField.IsCMField K] :
      Subfield.map (φ₀.codRestrict (algebraicClosure ℚ ℂ) ⋯)
          Φ.reflexReflexField =
        (Φ.reflexType φ₀).reflexField.toSubfield
    theorem NumberField.CMType.map_reflexReflexField_eq_reflexField_reflexType.{u_1}
      {K : Type u_1} [Field K]
      (Φ : NumberField.CMType K)
      [NumberField K] (φ₀ : K →+* ℂ)
      [NumberField.IsCMField K] :
      Subfield.map
          (φ₀.codRestrict
            (algebraicClosure ℚ ℂ) ⋯)
          Φ.reflexReflexField =
        (Φ.reflexType
              φ₀).reflexField.toSubfield
    **The reflex field of the reflex field is the reflex field of the reflex type** (LMFDB
    `nf.reflex_reflex_field`): for a CM type `Φ` of a CM field `K` and a complex embedding `φ₀` of `K`,
    the image under `φ₀` of the smallest subfield of `K` from which `Φ` is induced is the reflex field
    of the reflex type of `Φ` with respect to `φ₀`, as subfields of the algebraic closure `ℚ̄` of `ℚ` in
    `ℂ`. 
Definition5.1.72
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Regulator of a number field. (LMFDB)

Let \sigma_1,\ldots,\sigma_{r_1} be the real embeddings of a number field K into the complex numbers \mathbb{C}, and \sigma_{r_1+ 1},\ldots,\sigma_{r_1+r_2} be complex embeddings of K into \C such that no two are complex conjugate. Let u_1,\ldots,u_r be a set of fundamental units of K. Then r = r_1 + r_2 -1.

Let M be the (r_1+ r_2-1)\times (r_1+r_2) matrix (d_j\log{ |\sigma_j(u_i)|}), where d_j=1 if j\leq r_1, i.e, if \sigma_j is a real embedding, and d_j=2 otherwise, i.e., if \sigma_j is a complex embedding. The sum of the columns of M is the zero vector.

The regulator of K is the absolute value of the determinant of the sub-matrix of M where one column is removed. Its value is independent of the choice of column which is removed.

Tau Ceti Review: NumberField.Units.regulator, NumberField.Units.regulator_eq_det.

Depends on: Definition 5.1.1 Definition 5.1.21

Lean code for Definition5.1.72●2 declarations
  • defdefined in Mathlib/NumberTheory/NumberField/Units/Regulator.lean
    complete
    def NumberField.Units.regulator.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : ℝ
    def NumberField.Units.regulator.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℝ
    The regulator of a number field `K`. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Units/Regulator.lean
    complete
    theorem NumberField.Units.regulator_eq_det.{u_1} (K : Type u_1) [Field K]
      [NumberField K] (w' : NumberField.InfinitePlace K)
      (e : { w // w ≠ w' } ≃ Fin (NumberField.Units.rank K)) :
      NumberField.Units.regulator K =
        |(Matrix.of fun i w =>
              ↑(↑w).mult *
                Real.log
                  (↑w
                    ((algebraMap (NumberField.RingOfIntegers K) K)
                      ↑(NumberField.Units.fundSystem K (e i))))).det|
    theorem NumberField.Units.regulator_eq_det.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (w' : NumberField.InfinitePlace K)
      (e :
        { w // w ≠ w' } ≃
          Fin (NumberField.Units.rank K)) :
      NumberField.Units.regulator K =
        |(Matrix.of fun i w =>
              ↑(↑w).mult *
                Real.log
                  (↑w
                    ((algebraMap
                        (NumberField.RingOfIntegers
                          K)
                        K)
                      ↑(NumberField.Units.fundSystem
                          K (e i))))).det|
    For any infinite place `w'`, the regulator is equal to the absolute value of the determinant
    of the matrix with entries `(mult w * log w (fundSystem K i))_i` for `w ≠ w'`.
    
Definition5.1.73
Statement uses 4
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Relative class number of a CM field. (LMFDB)

If K is a number field with CM with class number h, and K^+ is its maximal totally real subfield with class number h^+, then h^+ divides h and the relative class number is h/h^+.

Depends on: Definition 5.1.1 Definition 5.1.7 Definition 5.1.9 Definition 5.1.87

Definition5.1.74
Statement uses 2
Statement dependency previews
Preview
Definition 1.1.35
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 24
Reverse dependency previews
Preview
Definition 1.1.28
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Ring of integers of a number field. (LMFDB)

The ring of integers of a number field K is the integral closure of \Z in K.

Tau Ceti Review: NumberField.RingOfIntegers.

Depends on: Definition 5.1.1 Definition 1.1.35

Lean code for Definition5.1.74●1 definition
  • defdefined in Mathlib/NumberTheory/NumberField/Basic.lean
    complete
    def NumberField.RingOfIntegers.{u_1} (K : Type u_1) [Field K] : Type u_1
    def NumberField.RingOfIntegers.{u_1}
      (K : Type u_1) [Field K] : Type u_1
    The ring of integers (or number ring) corresponding to a number field
    is the integral closure of ℤ in the number field.
    
    This is defined as its own type, rather than a `Subalgebra`, for performance reasons:
    looking for instances of the form `SMul (RingOfIntegers _) (RingOfIntegers _)` makes
    much more effective use of the discrimination tree than instances of the form
    `SMul (Subtype _) (Subtype _)`.
    The drawback is we have to copy over instances manually.
    
Definition5.1.75
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 2.53
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Root discriminant of a number field. (LMFDB)

If K is a number field of degree n and discriminant D, then the root discriminant of K is

\textrm{rd}(K) = |D|^{1/n}.

It gives a measure of the discriminant of a number field which is normalized for the degree. For example, if K\subseteq L are number fields and L/K is unramified, then \textrm{rd}(K)=\textrm{rd}(L).

Tau Ceti Review: NumberField.discr.

Depends on: Definition 5.1.1 Definition 5.1.14 Definition 5.1.17

Lean code for Definition5.1.75●5 declarations
  • defdefined in Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean
    complete
    def NumberField.rootDiscr.{u_1} (K : Type u_1) [Field K] [NumberField K] : ℝ
    def NumberField.rootDiscr.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : ℝ
    The root discriminant of a number field `K`. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean
    complete
    theorem NumberField.rootDiscr_def.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      NumberField.rootDiscr K =
        ↑|NumberField.discr K| ^ (↑(Module.finrank ℚ K))⁻¹
    theorem NumberField.rootDiscr_def.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      NumberField.rootDiscr K =
        ↑|NumberField.discr K| ^
          (↑(Module.finrank ℚ K))⁻¹
  • abbrevdefined in Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean
    complete
    abbrev NumberField.discr.{u_1} (K : Type u_1) [Field K] [NumberField K] : ℤ
    abbrev NumberField.discr.{u_1} (K : Type u_1)
      [Field K] [NumberField K] : ℤ
    The absolute discriminant of a number field. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/RootDiscrUnramified.lean
    complete
    theorem NumberField.abs_discr_eq_pow_of_ramificationIdx_eq_one.{u_1, u_2}
      {K : Type u_1} {L : Type u_2} [Field K] [NumberField K] [Field L]
      [NumberField L] [Algebra K L]
      (h :
        ∀ (P : Ideal (NumberField.RingOfIntegers L)),
          P.IsMaximal →
            P.ramificationIdx (NumberField.RingOfIntegers K) = 1) :
      |NumberField.discr L| = |NumberField.discr K| ^ Module.finrank K L
    theorem NumberField.abs_discr_eq_pow_of_ramificationIdx_eq_one.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [NumberField K] [Field L]
      [NumberField L] [Algebra K L]
      (h :
        ∀
          (P :
            Ideal
              (NumberField.RingOfIntegers L)),
          P.IsMaximal →
            P.ramificationIdx
                (NumberField.RingOfIntegers
                  K) =
              1) :
      |NumberField.discr L| =
        |NumberField.discr K| ^
          Module.finrank K L
    **The discriminant in an extension unramified at every finite prime**: `|d_L| = |d_K| ^ [L : K]`
    when every maximal ideal of `𝓞 L` has ramification index `1` over `𝓞 K`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/RootDiscrUnramified.lean
    complete
    theorem NumberField.rootDiscr_eq_of_ramificationIdx_eq_one.{u_1, u_2}
      {K : Type u_1} {L : Type u_2} [Field K] [NumberField K] [Field L]
      [NumberField L] [Algebra K L]
      (h :
        ∀ (P : Ideal (NumberField.RingOfIntegers L)),
          P.IsMaximal →
            P.ramificationIdx (NumberField.RingOfIntegers K) = 1) :
      NumberField.rootDiscr K = NumberField.rootDiscr L
    theorem NumberField.rootDiscr_eq_of_ramificationIdx_eq_one.{u_1,
        u_2}
      {K : Type u_1} {L : Type u_2} [Field K]
      [NumberField K] [Field L]
      [NumberField L] [Algebra K L]
      (h :
        ∀
          (P :
            Ideal
              (NumberField.RingOfIntegers L)),
          P.IsMaximal →
            P.ramificationIdx
                (NumberField.RingOfIntegers
                  K) =
              1) :
      NumberField.rootDiscr K =
        NumberField.rootDiscr L
    **The root discriminant does not change in an unramified extension**
    (LMFDB `nf.root_discriminant`): `rd(K) = rd(L)` when every maximal ideal of `𝓞 L` has ramification
    index `1` over `𝓞 K`. 
Definition5.1.76
uses 1
Used by 5
Reverse dependency previews
Preview
Definition 5.1.22
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Separable extension. (LMFDB)

If K/F is a finite degree field extension, \alpha\in K is separable over F if its monic irreducible polynomial has distinct roots in the algebraic closure \overline{F}.

The extension K/F is separable if every \alpha\in K is separable over F.

All algebraic extensions of local and global number fields are separable.

Tau Ceti Review: IsSeparable, Algebra.IsSeparable, Polynomial.Separable, Polynomial.nodup_aroots_iff_of_splits.

Depends on: Definition 5.1.14

Lean code for Definition5.1.76●4 declarations
  • defdefined in Mathlib/FieldTheory/Separable.lean
    complete
    def IsSeparable.{u_1, u_3} (F : Type u_1) {K : Type u_3} [CommRing F]
      [Ring K] [Algebra F K] (x : K) : Prop
    def IsSeparable.{u_1, u_3} (F : Type u_1)
      {K : Type u_3} [CommRing F] [Ring K]
      [Algebra F K] (x : K) : Prop
    An element `x` of an algebra `K` over a commutative ring `F` is said to be *separable*, if its
    minimal polynomial over `K` is separable. Note that the minimal polynomial of any element not
    integral over `F` is defined to be `0`, which is not a separable polynomial.
    
  • class(1 method)defined in Mathlib/FieldTheory/Separable.lean
    complete
    class Algebra.IsSeparable.{u_1, u_3} (F : Type u_1) (K : Type u_3)
      [CommRing F] [Ring K] [Algebra F K] : Prop
    class Algebra.IsSeparable.{u_1, u_3}
      (F : Type u_1) (K : Type u_3)
      [CommRing F] [Ring K] [Algebra F K] :
      Prop
    Typeclass for separable field extension: `K` is a separable field extension of `F` iff
    the minimal polynomial of every `x : K` is separable. This implies that `K/F` is an algebraic
    extension, because the minimal polynomial of a non-integral element is `0`, which is not
    separable.
    
    We define this for general (commutative) rings and only assume `F` and `K` are fields if this
    is needed for a proof. 
    isSeparable' : ∀ (x : K), IsSeparable F x
  • defdefined in Mathlib/FieldTheory/Separable.lean
    complete
    def Polynomial.Separable.{u} {R : Type u} [CommSemiring R]
      (f : Polynomial R) : Prop
    def Polynomial.Separable.{u} {R : Type u}
      [CommSemiring R] (f : Polynomial R) :
      Prop
    A polynomial is separable iff it is coprime with its derivative. 
  • theoremdefined in Mathlib/FieldTheory/Separable.lean
    complete
    theorem Polynomial.nodup_aroots_iff_of_splits.{u, v} {F : Type u} [Field F]
      {K : Type v} [Field K] [Algebra F K] {f : Polynomial F} (hf : f ≠ 0)
      (h : (Polynomial.map (algebraMap F K) f).Splits) :
      (f.aroots K).Nodup ↔ f.Separable
    theorem Polynomial.nodup_aroots_iff_of_splits.{u,
        v}
      {F : Type u} [Field F] {K : Type v}
      [Field K] [Algebra F K]
      {f : Polynomial F} (hf : f ≠ 0)
      (h :
        (Polynomial.map (algebraMap F K)
            f).Splits) :
      (f.aroots K).Nodup ↔ f.Separable
    If a non-zero polynomial over `F` splits in `K`, then it has no repeated roots on `K`
    if and only if it is separable. 
Definition5.1.77
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 5.1.46
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Separable algebra. (LMFDB)

A (finite) separable algebra A over a field F, also called an 'etale F-algebra, is an F-algebra of finite dimension that is isomorphic to a product of separable field extensions of F.

If L/K is a field extension and A is a separable K-algebra then A\otimes_K L is a separable L-algebra (which is typically not a field, even when A is).

Tau Ceti Review: Algebra.Etale, Algebra.Etale.iff_exists_algEquiv_prod, Algebra.Etale.baseChange.

Depends on: Definition 5.1.76

Lean code for Definition5.1.77●3 declarations
  • class(2 methods)defined in Mathlib/RingTheory/Etale/Basic.lean
    complete
    class Algebra.Etale.{u, v} (R : Type u) (A : Type v) [CommRing R] [CommRing A]
      [Algebra R A] : Prop
    class Algebra.Etale.{u, v} (R : Type u)
      (A : Type v) [CommRing R] [CommRing A]
      [Algebra R A] : Prop
    An `R`-algebra `A` is étale if it is formally étale and of finite presentation. 
    formallyEtale : Algebra.FormallyEtale R A
    finitePresentation : Algebra.FinitePresentation R A
  • theoremdefined in Mathlib/RingTheory/Etale/Field.lean
    complete
    theorem Algebra.Etale.iff_exists_algEquiv_prod.{u, u_1} (K : Type u_1)
      (A : Type u) [Field K] [CommRing A] [Algebra K A] :
      Algebra.Etale K A ↔
        ∃ I,
          ∃ (_ : Finite I),
            ∃ Ai x x_1 x_2,
              ∀ (i : I),
                Module.Finite K (Ai i) ∧ Algebra.IsSeparable K (Ai i)
    theorem Algebra.Etale.iff_exists_algEquiv_prod.{u,
        u_1}
      (K : Type u_1) (A : Type u) [Field K]
      [CommRing A] [Algebra K A] :
      Algebra.Etale K A ↔
        ∃ I,
          ∃ (_ : Finite I),
            ∃ Ai x x_1 x_2,
              ∀ (i : I),
                Module.Finite K (Ai i) ∧
                  Algebra.IsSeparable K (Ai i)
    `A` is étale over a field `K` if and only if
    `A` is a finite product of finite separable field extensions.
    
  • theoremdefined in Mathlib/RingTheory/Etale/Basic.lean
    complete
    theorem Algebra.Etale.baseChange.{u, v, u_1} (R : Type u) (A : Type v)
      (B : Type u_1) [CommRing R] [CommRing A] [Algebra R A] [CommRing B]
      [Algebra R B] [Algebra.Etale R A] :
      Algebra.Etale B (TensorProduct R B A)
    theorem Algebra.Etale.baseChange.{u, v, u_1}
      (R : Type u) (A : Type v) (B : Type u_1)
      [CommRing R] [CommRing A] [Algebra R A]
      [CommRing B] [Algebra R B]
      [Algebra.Etale R A] :
      Algebra.Etale B (TensorProduct R B A)
    Étale is stable under base change. 
Definition5.1.78
Statement uses 4
Statement dependency previews
Preview
Definition 2.50
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Serre Odlyzko bound. (LMFDB)

For each positive integer n, let C_n for the minimum root discriminant for all number fields of degree n. Assuming the Generalized Riemann Hypothesis, \limsup C_n \geq \Omega where

\Omega = 8\pi e^\gamma\approx 44.7632\ldots

and \gamma is the Euler–Mascheroni constant. Lower bounds for the C_n were deduced by analytic methods through the work of Odlyzko and others. In particular, Serre introduced the constant \Omega which we refer to as the Serre Odlyzko bound,

Consequently, any number field whose root discriminant lies below \Omega can be considered to have small discriminant.

Depends on: Definition 2.50 Definition 5.1.1 Definition 5.1.14 Definition 5.1.75

Definition5.1.79
uses 1used by 0✓L∃∀N

Twin sextic algebra. (LMFDB)

If A is a separable algebra of degree 6 over a field F (so \dim_F A=6), then it has a twin algebra B that is also a separable algebra of degree 6 over F; the F-algebras A and B are related by the non-trivial outer automorphism of S_6.

The symmetric group S_n has a non-trivial outer automorphism if and only if n=6, in which case it is unique up to inner automorphisms. This automorphism interchanges S_5\leq S_6 with \PGL_2(5)\leq S_6. In terms of Galois theory, this inclusion gives an absolute resolvent of degree [G:\PGL_2(5)]=6.

A common situation is when A is a field but B is not. Then the nature of the factorization of B assists in the study of A.

Depends on: Definition 5.1.77

Lean code for Definition5.1.79●8 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/Basic.lean
    complete
    def Algebra.IsSexticTwin.{u_1, u_3, u_4} (F : Type u_1) [Field F]
      (A : Type u_3) (B : Type u_4) [CommRing A] [Algebra F A] [CommRing B]
      [Algebra F B] : Prop
    def Algebra.IsSexticTwin.{u_1, u_3, u_4}
      (F : Type u_1) [Field F] (A : Type u_3)
      (B : Type u_4) [CommRing A]
      [Algebra F A] [CommRing B]
      [Algebra F B] : Prop
    An `F`-algebra `B` is a **twin** (LMFDB `nf.sextic_twin`) of an `F`-algebra `A` if their
    Galois sets can be labelled by `{0, …, 5}` so that, for every `σ ∈ Gal(F^sep/F)`, the permutation
    of the labels induced by `σ` on the Galois set of `B` is the image under the outer automorphism
    `θ` of `S₆` of that induced on the Galois set of `A`. The LMFDB's twins are finite separable
    algebras: for finite separable `A` and `B`, which then have degree `6`, this is its relation, and
    `B` is unique up to isomorphism (`Algebra.IsSexticTwin.nonempty_algEquiv`). The definition itself
    does not ask `A` or `B` to be separable. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/OuterAutomorphism.lean
    complete
    def Equiv.Perm.outerAutFinSix : MulAut (Equiv.Perm (Fin 6))
    def Equiv.Perm.outerAutFinSix :
      MulAut (Equiv.Perm (Fin 6))
    The **outer automorphism** `θ` of `S₆` (LMFDB `nf.sextic_twin`): `σ ∈ S₆` permutes the six
    synthematic totals `Tᵢ` as `θ(σ)` permutes their indices, `T_{θ(σ)(i)} = σ • Tᵢ`. It is not inner
    (`isOuter_outerAutFinSix`) and is unique up to inner automorphisms
    (`exists_eq_outerAutFinSix_mul_conj`); the LMFDB uses it to define twin sextic algebras. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/GaloisDescent.lean
    complete
    theorem Algebra.exists_isSexticTwin.{u_1, u_4} {F : Type u_1} [Field F]
      {A : Type u_4} [CommRing A] [Algebra F A] [Algebra.Etale F A]
      (h : Module.finrank F A = 6) :
      ∃ B,
        Algebra.Etale F ↥B ∧
          Module.finrank F ↥B = 6 ∧ Algebra.IsSexticTwin F A ↥B
    theorem Algebra.exists_isSexticTwin.{u_1, u_4}
      {F : Type u_1} [Field F] {A : Type u_4}
      [CommRing A] [Algebra F A]
      [Algebra.Etale F A]
      (h : Module.finrank F A = 6) :
      ∃ B,
        Algebra.Etale F ↥B ∧
          Module.finrank F ↥B = 6 ∧
            Algebra.IsSexticTwin F A ↥B
    **Every finite separable algebra `A` of degree `6` has a twin** (LMFDB `nf.sextic_twin`), a
    finite separable algebra of degree `6`: the twin `sexticTwin e` of `A` for any labelling `e` of
    the six `F`-algebra maps `A → F^sep`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/ProjectiveLine.lean
    complete
    theorem Equiv.Perm.exists_isOuter_iff.{u_1} {α : Type u_1} [DecidableEq α]
      [Fintype α] : (∃ φ, φ.IsOuter) ↔ Nat.card α = 6
    theorem Equiv.Perm.exists_isOuter_iff.{u_1}
      {α : Type u_1} [DecidableEq α]
      [Fintype α] :
      (∃ φ, φ.IsOuter) ↔ Nat.card α = 6
    **The symmetric group `S_n` has an outer automorphism if and only if `n = 6`** (LMFDB
    `nf.sextic_twin`): for `n ≠ 6` every automorphism is inner
    (`Equiv.Perm.surjective_conj_of_card_ne_six`), and for `n = 6` the outer automorphism `θ` of
    `Equiv.Perm.outerAutFinSix`, transported along a bijection with `Fin 6`, is not inner. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/OuterAutomorphism.lean
    complete
    theorem Equiv.Perm.exists_eq_outerAutFinSix_mul_conj
      {φ : MulAut (Equiv.Perm (Fin 6))} (hφ : φ.IsOuter) :
      ∃ g, φ = Equiv.Perm.outerAutFinSix * MulAut.conj g
    theorem Equiv.Perm.exists_eq_outerAutFinSix_mul_conj
      {φ : MulAut (Equiv.Perm (Fin 6))}
      (hφ : φ.IsOuter) :
      ∃ g,
        φ =
          Equiv.Perm.outerAutFinSix *
            MulAut.conj g
    **The outer automorphism of `S₆` is unique up to inner automorphisms**: every outer
    automorphism of `S₆` is `θ` composed with an inner automorphism. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/ProjectiveLine.lean
    complete
    theorem Equiv.Perm.map_stabilizer_outerAutFinSix :
      Subgroup.map (MulEquiv.toMonoidHom Equiv.Perm.outerAutFinSix)
          (MulAction.stabilizer (Equiv.Perm (Fin 6)) 5) =
        Equiv.Perm.pglTwoFiveToPerm.range
    theorem Equiv.Perm.map_stabilizer_outerAutFinSix :
      Subgroup.map
          (MulEquiv.toMonoidHom
            Equiv.Perm.outerAutFinSix)
          (MulAction.stabilizer
            (Equiv.Perm (Fin 6)) 5) =
        Equiv.Perm.pglTwoFiveToPerm.range
    **The outer automorphism `θ` of `S₆` sends `S₅` onto `PGL₂(𝔽₅)`** (LMFDB `nf.sextic_twin`):
    the image under `θ` of the stabilizer of the point `5` is the image of `PGL₂(𝔽₅)` acting on the
    projective line `ℙ¹(𝔽₅)`, labelled by `Fin 6` (`Equiv.Perm.pglTwoFiveToPerm`). The stabilizer is
    generated by `(0 1 2 3 4)` and `(0 1)`, which `θ` sends to the transformations `z ↦ z + 1` and
    `z ↦ (3z + 3)/(z + 2)`, and both groups have order `120`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/Resolvent.lean
    complete
    theorem Equiv.Perm.natDegree_specialize_pglTwoFiveResolventSpec.{u_1}
      (R : Type u_1) [CommRing R] [Nontrivial R] (f : Polynomial R) :
      (Equiv.Perm.pglTwoFiveResolventSpec.specialize R f).natDegree = 6
    theorem Equiv.Perm.natDegree_specialize_pglTwoFiveResolventSpec.{u_1}
      (R : Type u_1) [CommRing R]
      [Nontrivial R] (f : Polynomial R) :
      (Equiv.Perm.pglTwoFiveResolventSpec.specialize
            R f).natDegree =
        6
    **The absolute resolvent of `PGL₂(𝔽₅) ≤ S₆` has degree `[S₆ : PGL₂(𝔽₅)] = 6`** (LMFDB
    `nf.sextic_twin`): its specialization at any polynomial over a nonzero commutative ring has
    degree `6`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SexticTwin/SeventhCyclotomic.lean
    complete
    theorem Algebra.not_isField_sexticTwin_adjoin_seventh_roots :
      ¬IsField ↥(Algebra.sexticTwin Algebra.seventhCyclotomicGaloisSetEquiv)
    theorem Algebra.not_isField_sexticTwin_adjoin_seventh_roots :
      ¬IsField
          ↥(Algebra.sexticTwin
              Algebra.seventhCyclotomicGaloisSetEquiv)
    **A sextic number field whose twin is not a field** (LMFDB `nf.sextic_twin`), the knowl's
    "common situation" where `A` is a field but `B` is not. Here `A` is the subfield `ℚ(μ₇)` of `ℂ`
    generated by the seventh roots of unity, a seventh cyclotomic number field (the instances
    `IsCyclotomicExtension {7} ℚ (adjoin ℚ {b : ℂ | b ^ 7 = 1})` and
    `NumberField (adjoin ℚ {b : ℂ | b ^ 7 = 1})` of the file on the Galois action on characters), so of
    degree `6` (`Algebra.finrank_seventhCyclotomic`). And `B` is its twin `Algebra.sexticTwin` for the
    labelling `Algebra.seventhCyclotomicGaloisSetEquiv`, a finite separable algebra of degree `6`
    (`Algebra.etale_sexticTwin`, `Algebra.finrank_sexticTwin`) that is a twin of `A`
    (`Algebra.isSexticTwin_sexticTwin`), isomorphic to `ℚ × ℚ(√-7) × ℚ(ζ₇ + ζ₇⁻¹)`
    (`Algebra.seventhCyclotomicTwinEquiv`). No twin of a seventh cyclotomic field is a field
    (`Algebra.IsSexticTwin.not_isField_seventhCyclotomic`). 
Definition5.1.80
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.22
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 3.1.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Sibling fields and algebras. (LMFDB)

Two finite separable extension fields K_1 and K_2 of a ground field F are called siblings if they are not isomorphic, but have isomorphic Galois closures.

A finite dimensional separable \Q-algebra is isomorphic to a product of number fields. By its Galois closure, we mean the compositum of the Galois closures of the constituent fields. Then two algebras are siblings if they have isomorphic Galois closures, but are not isomorphic as \Q-algebras.

Tau Ceti Review: Algebra.Etale.iff_exists_algEquiv_prod.

Depends on: Definition 5.1.22 Definition 5.1.76

Lean code for Definition5.1.80●6 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Sibling.lean
    complete
    def Algebra.IsSibling.{u_1, u_2, u_3} (F : Type u_1) (A : Type u_2)
      (B : Type u_3) [Field F] [CommRing A] [Algebra F A] [CommRing B]
      [Algebra F B] : Prop
    def Algebra.IsSibling.{u_1, u_2, u_3}
      (F : Type u_1) (A : Type u_2)
      (B : Type u_3) [Field F] [CommRing A]
      [Algebra F A] [CommRing B]
      [Algebra F B] : Prop
    Two `F`-algebras `A` and `B` are **siblings** (LMFDB `nf.sibling`) if they are not isomorphic
    but have isomorphic Galois closures. The LMFDB considers finite separable extensions of `F`, and
    finite separable `ℚ`-algebras, for which this is its definition. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Sibling.lean
    complete
    def Algebra.galoisClosure.{u_1, u_2} (F : Type u_1) (A : Type u_2) [Field F]
      [CommRing A] [Algebra F A] : IntermediateField F (AlgebraicClosure F)
    def Algebra.galoisClosure.{u_1, u_2}
      (F : Type u_1) (A : Type u_2) [Field F]
      [CommRing A] [Algebra F A] :
      IntermediateField F (AlgebraicClosure F)
    The **Galois closure** of an `F`-algebra `A`: the subfield of the algebraic closure `F̄` of `F`
    generated by the images of all `F`-algebra maps `A → F̄`.
    
    For a field `K` this is the normal closure of `K` in `F̄` (`galoisClosure_eq_normalClosure`), a
    Galois closure of `K` when `K / F` is finite separable. For a finite separable `F`-algebra, a
    product of finite separable extensions `K_i` of `F`, every `F`-algebra map to `F̄` factors through
    one of the `K_i`, so this is the compositum of the Galois closures of the `K_i`, as in the LMFDB
    knowl `nf.sibling`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Sibling.lean
    complete
    theorem Algebra.isSibling_iff.{u_1, u_5, u_6, u_7, u_8} {F : Type u_1} [Field F]
      {K₁ : Type u_5} {K₂ : Type u_6} {L₁ : Type u_7} {L₂ : Type u_8}
      [Field K₁] [Field K₂] [Field L₁] [Field L₂] [Algebra F K₁]
      [Algebra F K₂] [Algebra F L₁] [Algebra F L₂]
      [Algebra.IsAlgebraic F K₁] [Algebra.IsAlgebraic F K₂]
      [IsNormalClosure F K₁ L₁] [IsNormalClosure F K₂ L₂] :
      Algebra.IsSibling F K₁ K₂ ↔
        IsEmpty (K₁ ≃ₐ[F] K₂) ∧ Nonempty (L₁ ≃ₐ[F] L₂)
    theorem Algebra.isSibling_iff.{u_1, u_5, u_6, u_7,
        u_8}
      {F : Type u_1} [Field F] {K₁ : Type u_5}
      {K₂ : Type u_6} {L₁ : Type u_7}
      {L₂ : Type u_8} [Field K₁] [Field K₂]
      [Field L₁] [Field L₂] [Algebra F K₁]
      [Algebra F K₂] [Algebra F L₁]
      [Algebra F L₂]
      [Algebra.IsAlgebraic F K₁]
      [Algebra.IsAlgebraic F K₂]
      [IsNormalClosure F K₁ L₁]
      [IsNormalClosure F K₂ L₂] :
      Algebra.IsSibling F K₁ K₂ ↔
        IsEmpty (K₁ ≃ₐ[F] K₂) ∧
          Nonempty (L₁ ≃ₐ[F] L₂)
    Two algebraic extensions `K₁` and `K₂` of `F` with normal closures `L₁` and `L₂` are siblings
    exactly when they are not isomorphic and `L₁` and `L₂` are isomorphic. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Sibling.lean
    complete
    theorem Algebra.isNormalClosure_galoisClosure.{u_1, u_4} {F : Type u_1}
      [Field F] (K : Type u_4) [Field K] [Algebra F K]
      [Algebra.IsAlgebraic F K] :
      IsNormalClosure F K ↥(Algebra.galoisClosure F K)
    theorem Algebra.isNormalClosure_galoisClosure.{u_1,
        u_4}
      {F : Type u_1} [Field F] (K : Type u_4)
      [Field K] [Algebra F K]
      [Algebra.IsAlgebraic F K] :
      IsNormalClosure F K
        ↥(Algebra.galoisClosure F K)
    The Galois closure of an algebraic extension `K` of `F` is a normal closure of `K / F`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/SiblingProduct.lean
    complete
    theorem Algebra.galoisClosure_eq_iSup_normalClosure.{u_1, u_2, u_4, u_5}
      {F : Type u_1} [Field F] {A : Type u_2} [CommRing A] [Algebra F A]
      {ι : Type u_4} [Finite ι] {K : ι → Type u_5} [(i : ι) → Field (K i)]
      [(i : ι) → Algebra F (K i)] (e : A ≃ₐ[F] (i : ι) → K i) :
      Algebra.galoisClosure F A =
        ⨆ i, IntermediateField.normalClosure F (K i) (AlgebraicClosure F)
    theorem Algebra.galoisClosure_eq_iSup_normalClosure.{u_1,
        u_2, u_4, u_5}
      {F : Type u_1} [Field F] {A : Type u_2}
      [CommRing A] [Algebra F A]
      {ι : Type u_4} [Finite ι]
      {K : ι → Type u_5}
      [(i : ι) → Field (K i)]
      [(i : ι) → Algebra F (K i)]
      (e : A ≃ₐ[F] (i : ι) → K i) :
      Algebra.galoisClosure F A =
        ⨆ i,
          IntermediateField.normalClosure F
            (K i) (AlgebraicClosure F)
    **The Galois closure of an algebra is the compositum of the Galois closures of its constituent
    fields** (LMFDB `nf.sibling`): for `A ≅ ∏ K_i`, `Algebra.galoisClosure F A` is the compositum in
    `F̄` of the normal closures of the `K_i`, which are their Galois closures when the `K_i` are finite
    separable over `F`. 
  • theoremdefined in Mathlib/RingTheory/Etale/Field.lean
    complete
    theorem Algebra.Etale.iff_exists_algEquiv_prod.{u, u_1} (K : Type u_1)
      (A : Type u) [Field K] [CommRing A] [Algebra K A] :
      Algebra.Etale K A ↔
        ∃ I,
          ∃ (_ : Finite I),
            ∃ Ai x x_1 x_2,
              ∀ (i : I),
                Module.Finite K (Ai i) ∧ Algebra.IsSeparable K (Ai i)
    theorem Algebra.Etale.iff_exists_algEquiv_prod.{u,
        u_1}
      (K : Type u_1) (A : Type u) [Field K]
      [CommRing A] [Algebra K A] :
      Algebra.Etale K A ↔
        ∃ I,
          ∃ (_ : Finite I),
            ∃ Ai x x_1 x_2,
              ∀ (i : I),
                Module.Finite K (Ai i) ∧
                  Algebra.IsSeparable K (Ai i)
    `A` is étale over a field `K` if and only if
    `A` is a finite product of finite separable field extensions.
    
Definition5.1.81
Statement uses 4
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Definition 4.1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Signature of a number field. (LMFDB)

The signature of a number field K is the pair [r_1,r_2] where r_1 is the number of real embeddings of K and r_2 is the number of conjugate pairs of complex embeddings.

The degree of K is r_1+2r_2.

Tau Ceti Review: NumberField.InfinitePlace.nrRealPlaces, NumberField.InfinitePlace.nrComplexPlaces, NumberField.InfinitePlace.card_add_two_mul_card_eq_rank.

Depends on: Definition 5.1.1 Definition 5.1.10 Definition 5.1.14 Definition 5.1.69

Lean code for Definition5.1.81●5 declarations
  • abbrevdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    abbrev NumberField.InfinitePlace.nrRealPlaces.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    abbrev NumberField.InfinitePlace.nrRealPlaces.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    The number of infinite real places of the number field `K`. 
  • abbrevdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    abbrev NumberField.InfinitePlace.nrComplexPlaces.{u_1} (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    abbrev NumberField.InfinitePlace.nrComplexPlaces.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    The number of infinite complex places of the number field `K`. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_real_embeddings.{u_1} (K : Type u_1)
      [Field K] [NumberField K] :
      Fintype.card { φ // NumberField.ComplexEmbedding.IsReal φ } =
        NumberField.InfinitePlace.nrRealPlaces K
    theorem NumberField.InfinitePlace.card_real_embeddings.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fintype.card
          { φ //
            NumberField.ComplexEmbedding.IsReal
              φ } =
        NumberField.InfinitePlace.nrRealPlaces
          K
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_complex_embeddings.{u_1} (K : Type u_1)
      [Field K] [NumberField K] :
      Fintype.card { φ // ¬NumberField.ComplexEmbedding.IsReal φ } =
        2 * NumberField.InfinitePlace.nrComplexPlaces K
    theorem NumberField.InfinitePlace.card_complex_embeddings.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      Fintype.card
          { φ //
            ¬NumberField.ComplexEmbedding.IsReal
                φ } =
        2 *
          NumberField.InfinitePlace.nrComplexPlaces
            K
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
    complete
    theorem NumberField.InfinitePlace.card_add_two_mul_card_eq_rank.{u_1}
      (K : Type u_1) [Field K] [NumberField K] :
      NumberField.InfinitePlace.nrRealPlaces K +
          2 * NumberField.InfinitePlace.nrComplexPlaces K =
        Module.finrank ℚ K
    theorem NumberField.InfinitePlace.card_add_two_mul_card_eq_rank.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      NumberField.InfinitePlace.nrRealPlaces
            K +
          2 *
            NumberField.InfinitePlace.nrComplexPlaces
              K =
        Module.finrank ℚ K
Definition5.1.82
uses 0used by 1✓L∃∀N

Prime spectrum of ring of integers in a number field. (LMFDB)

The *(prime) spectrum* of a ring R, \operatorname{Spec} R, is the set of prime ideals in R. In particular, if F is a number field with ring of integers \mathcal{O}_F, the spectrum \operatorname{Spec} \mathcal{O}_F can be thought of as a curve over \operatorname{Spec} \mathbb{Z}.

Tau Ceti Review: PrimeSpectrum, AlgebraicGeometry.Spec, NumberField.RingOfIntegers.

Lean code for Definition5.1.82●3 definitions
  • structure(2 fields)defined in Mathlib/RingTheory/Spectrum/Prime/Defs.lean
    complete
    structure PrimeSpectrum.{u_1} (R : Type u_1) [CommSemiring R] : Type u_1
    structure PrimeSpectrum.{u_1} (R : Type u_1)
      [CommSemiring R] : Type u_1
    The prime spectrum of a commutative (semi)ring `R` is the type of all prime ideals of `R`.
    
    It is naturally endowed with a topology (the Zariski topology),
    and a sheaf of commutative rings (see `Mathlib/AlgebraicGeometry/StructureSheaf.lean`).
    It is a fundamental building block in algebraic geometry. 
    asIdeal : Ideal R
    isPrime : self.asIdeal.IsPrime
  • defdefined in Mathlib/AlgebraicGeometry/Scheme.lean
    complete
    def AlgebraicGeometry.Spec.{u_1} (R : CommRingCat) :
      AlgebraicGeometry.Scheme
    def AlgebraicGeometry.Spec.{u_1}
      (R : CommRingCat) :
      AlgebraicGeometry.Scheme
    The spectrum of a commutative ring, as a scheme. 
  • defdefined in Mathlib/NumberTheory/NumberField/Basic.lean
    complete
    def NumberField.RingOfIntegers.{u_1} (K : Type u_1) [Field K] : Type u_1
    def NumberField.RingOfIntegers.{u_1}
      (K : Type u_1) [Field K] : Type u_1
    The ring of integers (or number ring) corresponding to a number field
    is the integral closure of ℤ in the number field.
    
    This is defined as its own type, rather than a `Subalgebra`, for performance reasons:
    looking for instances of the form `SMul (RingOfIntegers _) (RingOfIntegers _)` makes
    much more effective use of the discrimination tree than instances of the form
    `SMul (Subtype _) (Subtype _)`.
    The drawback is we have to copy over instances manually.
    
Definition5.1.83
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.22
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 6.2.17
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Stem field for a Galois extension. (LMFDB)

If K/F is a Galois extension of fields, a stem field for K/F is a field E such that F\subseteq E\subseteq K and K is the Galois closure of E/F.

This is connected to the notion of the stem field of a polynomial. If f\in F[x] is a separable irreducible polynomial of degree n with roots \alpha_1, \ldots, \alpha_n (in some extension field), then the fields F(\alpha_i) are the stem fields of the polynomial f. The splitting field of f is K=F(\alpha_1,\ldots,\alpha_n), which is a Galois extension of F, and the fields F(\alpha_i) are stem fields for K/F as defined above.

Tau Ceti Review: IsNormalClosure, IntermediateField.adjoin, AdjoinRoot, IntermediateField.adjoinRootEquivAdjoin.

Depends on: Definition 5.1.22 Definition 5.1.44

Lean code for Definition5.1.83●4 definitions
  • class(2 methods)defined in Mathlib/FieldTheory/Normal/Closure.lean
    complete
    class IsNormalClosure.{u_1, u_2, u_3} (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K] [Field L] [Algebra F K]
      [Algebra F L] : Prop
    class IsNormalClosure.{u_1, u_2, u_3}
      (F : Type u_1) (K : Type u_2)
      (L : Type u_3) [Field F] [Field K]
      [Field L] [Algebra F K] [Algebra F L] :
      Prop
    `L/F` is a normal closure of `K/F` if the minimal polynomial of every element of `K` over `F`
    splits in `L`, and `L` is generated by roots of such minimal polynomials over `F`.
    (Since the minimal polynomial of a transcendental element is 0,
    the normal closure of `K/F` is the same as the normal closure over `F`
    of the algebraic closure of `F` in `K`.) 
    splits : ∀ (x : K), (Polynomial.map (algebraMap F L) (minpoly F x)).Splits
    adjoin_rootSet : ⨆ x, IntermediateField.adjoin F ((minpoly F x).rootSet L) = ⊤
  • defdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean
    complete
    def IntermediateField.adjoin.{u_1, u_2} (F : Type u_1) [Field F]
      {E : Type u_2} [Field E] [Algebra F E] (S : Set E) :
      IntermediateField F E
    def IntermediateField.adjoin.{u_1, u_2}
      (F : Type u_1) [Field F] {E : Type u_2}
      [Field E] [Algebra F E] (S : Set E) :
      IntermediateField F E
    `adjoin F S` extends a field `F` by adjoining a set `S ⊆ E`. 
  • defdefined in Mathlib/RingTheory/AdjoinRoot.lean
    complete
    def AdjoinRoot.{u_1} {R : Type u_1} [CommRing R] (f : Polynomial R) :
      Type u_1
    def AdjoinRoot.{u_1} {R : Type u_1}
      [CommRing R] (f : Polynomial R) :
      Type u_1
    Adjoin a root of a polynomial `f` to a commutative ring `R`. We define the new ring
    as the quotient of `R[X]` by the principal ideal generated by `f`. 
  • defdefined in Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
    complete
    def IntermediateField.adjoinRootEquivAdjoin.{u_1, u_2} (F : Type u_1)
      [Field F] {E : Type u_2} [Field E] [Algebra F E] {α : E}
      (h : IsIntegral F α) : AdjoinRoot (minpoly F α) ≃ₐ[F] ↥F⟮α⟯
    def IntermediateField.adjoinRootEquivAdjoin.{u_1,
        u_2}
      (F : Type u_1) [Field F] {E : Type u_2}
      [Field E] [Algebra F E] {α : E}
      (h : IsIntegral F α) :
      AdjoinRoot (minpoly F α) ≃ₐ[F] ↥F⟮α⟯
    algebra isomorphism between `AdjoinRoot` and `F⟮α⟯` 
Definition5.1.84
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Unit group torsion. (LMFDB)

A torsion generator of a number field is a primitive root of unity that generates the torsion subgroup of the unit group (which is necessarily cyclic).

Tau Ceti Review: NumberField.Units.torsion, IsPrimitiveRoot, NumberField.Units.torsionOrder, IsPrimitiveRoot.zpowers_eq.

Depends on: Definition 5.1.1 Definition 5.1.88

Lean code for Definition5.1.84●5 declarations
  • defdefined in Mathlib/NumberTheory/NumberField/Units/Basic.lean
    complete
    def NumberField.Units.torsion.{u_1} (K : Type u_1) [Field K] :
      Subgroup (NumberField.RingOfIntegers K)ˣ
    def NumberField.Units.torsion.{u_1}
      (K : Type u_1) [Field K] :
      Subgroup (NumberField.RingOfIntegers K)ˣ
    The torsion subgroup of the group of units. 
  • structure(2 fields)defined in Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean
    complete
    structure IsPrimitiveRoot.{u_1} {M : Type u_1} [CommMonoid M] (ζ : M) (k : ℕ) :
      Prop
    structure IsPrimitiveRoot.{u_1} {M : Type u_1}
      [CommMonoid M] (ζ : M) (k : ℕ) : Prop
    An element `ζ` is a primitive `k`-th root of unity if `ζ ^ k = 1`,
    and if `l` satisfies `ζ ^ l = 1` then `k ∣ l`. 
    pow_eq_one : ζ ^ k = 1
    dvd_of_pow_eq_one : ∀ (l : ℕ), ζ ^ l = 1 → k ∣ l
  • defdefined in Mathlib/NumberTheory/NumberField/Units/Basic.lean
    complete
    def NumberField.Units.torsionOrder.{u_1} (K : Type u_1) [Field K] : ℕ
    def NumberField.Units.torsionOrder.{u_1}
      (K : Type u_1) [Field K] : ℕ
    The order of the torsion subgroup. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Units/Basic.lean
    complete
    theorem NumberField.Units.rootsOfUnity_eq_torsion.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      rootsOfUnity (NumberField.Units.torsionOrder K)
          (NumberField.RingOfIntegers K) =
        NumberField.Units.torsion K
    theorem NumberField.Units.rootsOfUnity_eq_torsion.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      rootsOfUnity
          (NumberField.Units.torsionOrder K)
          (NumberField.RingOfIntegers K) =
        NumberField.Units.torsion K
    The group of roots of unity of order dividing `torsionOrder` is equal to the torsion
    group. 
  • theoremdefined in Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean
    complete
    theorem IsPrimitiveRoot.zpowers_eq.{u_4} {R : Type u_4} [CommRing R]
      [IsDomain R] {k : ℕ} [NeZero k] {ζ : Rˣ} (h : IsPrimitiveRoot ζ k) :
      Subgroup.zpowers ζ = rootsOfUnity k R
    theorem IsPrimitiveRoot.zpowers_eq.{u_4}
      {R : Type u_4} [CommRing R] [IsDomain R]
      {k : ℕ} [NeZero k] {ζ : Rˣ}
      (h : IsPrimitiveRoot ζ k) :
      Subgroup.zpowers ζ = rootsOfUnity k R
Definition5.1.85
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 4.1.123
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Totally imaginary. (LMFDB)

A number field K is totally imaginary (or totally complex) if it cannot be embedded in the real numbers \R; equivalently, \R does not contain the image of any of the homomorphisms from K to \C.

Tau Ceti Review: NumberField.IsTotallyComplex, NumberField.nrRealPlaces_eq_zero_iff.

Depends on: Definition 5.1.1

Lean code for Definition5.1.85●3 declarations
  • class(1 method)defined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    class NumberField.IsTotallyComplex.{u_1} (K : Type u_1) [Field K] : Prop
    class NumberField.IsTotallyComplex.{u_1}
      (K : Type u_1) [Field K] : Prop
    A field `K` is totally complex if all of its infinite places are complex.
    
    isComplex : ∀ (v : NumberField.InfinitePlace K), v.IsComplex
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    theorem NumberField.IsTotallyComplex.complexEmbedding_not_isReal.{u_2}
      {K : Type u_2} [Field K] [NumberField.IsTotallyComplex K]
      (φ : K →+* ℂ) : ¬NumberField.ComplexEmbedding.IsReal φ
    theorem NumberField.IsTotallyComplex.complexEmbedding_not_isReal.{u_2}
      {K : Type u_2} [Field K]
      [NumberField.IsTotallyComplex K]
      (φ : K →+* ℂ) :
      ¬NumberField.ComplexEmbedding.IsReal φ
  • theoremdefined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    theorem NumberField.nrRealPlaces_eq_zero_iff.{u_2} {K : Type u_2} [Field K]
      [NumberField K] :
      NumberField.InfinitePlace.nrRealPlaces K = 0 ↔
        NumberField.IsTotallyComplex K
    theorem NumberField.nrRealPlaces_eq_zero_iff.{u_2}
      {K : Type u_2} [Field K]
      [NumberField K] :
      NumberField.InfinitePlace.nrRealPlaces
            K =
          0 ↔
        NumberField.IsTotallyComplex K
Definition5.1.86
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 3.3.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Totally positive. (LMFDB)

An element \alpha in a number field K is totally positive if \sigma(\alpha)>0 for all real embeddings \sigma of K into \R.

Tau Ceti Review: NumberField.IsTotallyPositive, NumberField.totallyPositiveUnits.

Depends on: Definition 5.1.1

Lean code for Definition5.1.86●2 definitions
  • defdefined in TauCeti/NumberTheory/NumberField/TotallyPositive.lean
    complete
    def NumberField.IsTotallyPositive.{u_1} {K : Type u_1} [Field K] (x : K) :
      Prop
    def NumberField.IsTotallyPositive.{u_1}
      {K : Type u_1} [Field K] (x : K) : Prop
    An element of a number field is **totally positive** when it is strictly positive under every
    real embedding `K →+* ℝ` (equivalently, at every real infinite place `w`). For a totally complex
    field the condition is vacuous; the content is at the real places. 
  • defdefined in TauCeti/NumberTheory/NumberField/TotallyPositive.lean
    complete
    def NumberField.totallyPositiveUnits.{u_1} {K : Type u_1} [Field K] :
      Subgroup Kˣ
    def NumberField.totallyPositiveUnits.{u_1}
      {K : Type u_1} [Field K] : Subgroup Kˣ
    The subgroup of **totally positive units** of `Kˣ`: the intersection, over the real infinite
    places `w`, of the preimages of the positive units of `ℝ` under the real embedding `w`. It is the
    kernel of the sign (signature) map on units, and controls the comparison between the narrow class
    group `Cl⁺(K)` and the ordinary class group `Cl(K)`. 
Definition5.1.87
uses 1
Used by 11
Reverse dependency previews
Preview
Definition 3.1.86
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Totally real. (LMFDB)

A global number field K is always of the form K=\Q(\alpha) where \alpha has monic irreducible polynomial f(x)\in\Q[x]. The field is totally real if all of the roots of f(x) in \C lie in the real numbers \R.

Equivalently, K is totally real if all the embeddings of K into \C have image contained in \R.

Tau Ceti Review: NumberField.IsTotallyReal, Field.exists_primitive_element, minpoly.irreducible.

Depends on: Definition 5.1.1

Lean code for Definition5.1.87●5 declarations
  • class(1 method)defined in Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
    complete
    class NumberField.IsTotallyReal.{u_1} (K : Type u_1) [Field K] : Prop
    class NumberField.IsTotallyReal.{u_1}
      (K : Type u_1) [Field K] : Prop
    A field `K` is totally real if all of its infinite places are real. In other words,
    the image of every ring homomorphism `K → ℂ` is a subset of `ℝ`. 
    isReal : ∀ (v : NumberField.InfinitePlace K), v.IsReal
  • theoremdefined in Mathlib/FieldTheory/PrimitiveElement.lean
    complete
    theorem Field.exists_primitive_element.{u_1, u_2} (F : Type u_1) (E : Type u_2)
      [Field F] [Field E] [Algebra F E] [FiniteDimensional F E]
      [Algebra.IsSeparable F E] : ∃ α, F⟮α⟯ = ⊤
    theorem Field.exists_primitive_element.{u_1, u_2}
      (F : Type u_1) (E : Type u_2) [Field F]
      [Field E] [Algebra F E]
      [FiniteDimensional F E]
      [Algebra.IsSeparable F E] :
      ∃ α, F⟮α⟯ = ⊤
    **Primitive element theorem**: a finite separable field extension `E` of `F` has a
    primitive element, i.e. there is an `α ∈ E` such that `F⟮α⟯ = (⊤ : Subalgebra F E)`. 
  • theoremdefined in Mathlib/FieldTheory/Minpoly/Basic.lean
    complete
    theorem minpoly.irreducible.{u_1, u_2} {A : Type u_1} {B : Type u_2}
      [CommRing A] [Ring B] [Algebra A B] {x : B} [IsDomain A] [IsDomain B]
      (hx : IsIntegral A x) : Irreducible (minpoly A x)
    theorem minpoly.irreducible.{u_1, u_2}
      {A : Type u_1} {B : Type u_2}
      [CommRing A] [Ring B] [Algebra A B]
      {x : B} [IsDomain A] [IsDomain B]
      (hx : IsIntegral A x) :
      Irreducible (minpoly A x)
    A minimal polynomial is irreducible. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/TotallyRealMinpoly.lean
    complete
    theorem NumberField.isTotallyReal_iff_rootSet_minpoly_subset.{u_1}
      {K : Type u_1} [Field K] {α : K} [NumberField K] (hα : ℚ⟮α⟯ = ⊤) :
      NumberField.IsTotallyReal K ↔
        (minpoly ℚ α).rootSet ℂ ⊆ Set.range Complex.ofReal
    theorem NumberField.isTotallyReal_iff_rootSet_minpoly_subset.{u_1}
      {K : Type u_1} [Field K] {α : K}
      [NumberField K] (hα : ℚ⟮α⟯ = ⊤) :
      NumberField.IsTotallyReal K ↔
        (minpoly ℚ α).rootSet ℂ ⊆
          Set.range Complex.ofReal
    **A number field `K = ℚ(α)` is totally real exactly when all the complex roots of the minimal
    polynomial of `α` are real** (LMFDB `nf.totally_real`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/TotallyRealMinpoly.lean
    complete
    theorem NumberField.isTotallyReal_iff_forall_range_subset.{u_1} {K : Type u_1}
      [Field K] :
      NumberField.IsTotallyReal K ↔
        ∀ (φ : K →+* ℂ), Set.range ⇑φ ⊆ Set.range Complex.ofReal
    theorem NumberField.isTotallyReal_iff_forall_range_subset.{u_1}
      {K : Type u_1} [Field K] :
      NumberField.IsTotallyReal K ↔
        ∀ (φ : K →+* ℂ),
          Set.range ⇑φ ⊆
            Set.range Complex.ofReal
    **A number field is totally real exactly when all its embeddings have real image**
    (LMFDB `nf.totally_real`). 
Definition5.1.88
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 5.1.21
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Unit group of a number field. (LMFDB)

The unit group of a number field K is the group of units of the ring of integers of K. It is a finitely generated abelian group with cyclic torsion subgroup. A set of generators of a maximal torsion-free subgroup is called a set of fundamental units for K.

The unit group of K has as invariants the rank and the regulator of K.

Tau Ceti Review: NumberField.RingOfIntegers, Units, NumberField.Units.torsion, NumberField.Units.exist_unique_eq_mul_prod.

Depends on: Definition 5.1.1 Definition 5.1.74

Lean code for Definition5.1.88●4 declarations
  • defdefined in Mathlib/NumberTheory/NumberField/Basic.lean
    complete
    def NumberField.RingOfIntegers.{u_1} (K : Type u_1) [Field K] : Type u_1
    def NumberField.RingOfIntegers.{u_1}
      (K : Type u_1) [Field K] : Type u_1
    The ring of integers (or number ring) corresponding to a number field
    is the integral closure of ℤ in the number field.
    
    This is defined as its own type, rather than a `Subalgebra`, for performance reasons:
    looking for instances of the form `SMul (RingOfIntegers _) (RingOfIntegers _)` makes
    much more effective use of the discrimination tree than instances of the form
    `SMul (Subtype _) (Subtype _)`.
    The drawback is we have to copy over instances manually.
    
  • structure(4 fields)defined in Mathlib/Algebra/Group/Units/Defs.lean
    complete
    structure Units.{u} (α : Type u) [Monoid α] : Type u
    structure Units.{u} (α : Type u) [Monoid α] : Type u
    Units of a `Monoid`, bundled version. Notation: `αˣ`.
    
    An element of a `Monoid` is a unit if it has a two-sided inverse.
    This version bundles the inverse element so that it can be computed.
    For a predicate see `IsUnit`. 
    val : α
    The underlying value in the base `Monoid`. 
    inv : α
    The inverse value of `val` in the base `Monoid`. 
    val_inv : ↑self * self.inv = 1
    `inv` is the right inverse of `val` in the base `Monoid`. 
    inv_val : self.inv * ↑self = 1
    `inv` is the left inverse of `val` in the base `Monoid`. 
  • defdefined in Mathlib/NumberTheory/NumberField/Units/Basic.lean
    complete
    def NumberField.Units.torsion.{u_1} (K : Type u_1) [Field K] :
      Subgroup (NumberField.RingOfIntegers K)ˣ
    def NumberField.Units.torsion.{u_1}
      (K : Type u_1) [Field K] :
      Subgroup (NumberField.RingOfIntegers K)ˣ
    The torsion subgroup of the group of units. 
  • theoremdefined in Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
    complete
    theorem NumberField.Units.exist_unique_eq_mul_prod.{u_1} (K : Type u_1)
      [Field K] [NumberField K] (x : (NumberField.RingOfIntegers K)ˣ) :
      ∃! ζe, x = ↑ζe.1 * ∏ i, NumberField.Units.fundSystem K i ^ ζe.2 i
    theorem NumberField.Units.exist_unique_eq_mul_prod.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (x : (NumberField.RingOfIntegers K)ˣ) :
      ∃! ζe,
        x =
          ↑ζe.1 *
            ∏ i,
              NumberField.Units.fundSystem K
                  i ^
                ζe.2 i
    **Dirichlet Unit Theorem**. Any unit `x` of `𝓞 K` can be written uniquely as the product of
    a root of unity and powers of the units of the fundamental system `fundSystem`. 
Definition5.1.89
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Unit signature rank of a number field. (LMFDB)

Let K be a number field with at least one real embedding, and let \sigma_1, \dots, \sigma_{r_1} : K \to \R be the r_1 real embeddings of K. The signature of a nonzero element \alpha \in K is the r_1-tuple of signs of \sigma(\alpha) over all real embeddings \sigma of K, viewed as lying in the additive group \F_2. I.e. the signature is the vector (\text{sign}(\sigma_1(\alpha)), \dots, \text{sign}(\sigma_{r_1}(\alpha))) \in \F_2^{r_1}, where \text{sign}(x) = 0 if x is positive, otherwise \text{sign}(x) = 1 if x is negative.

The collection of all signatures of units \alpha \in \mathcal{O}_K^\times can be viewed as a subspace of \F_2^{r_1}. The dimension of this subspace (over \F_2) is the unit signature rank of K.

By convention, we define the unit signature rank of a totally complex field to be 0.

If K has at least one real embedding, then the unit signature rank is always a positive integer which is at most the number of real embeddings r_1 of K. If K is a real quadratic field, then the unit signature rank of K is 1 if the fundamental unit for K has norm 1, otherwise the unit signature rank of K is 2 if the fundamental unit for K has norm -1.

Depends on: Definition 5.1.1 Definition 5.1.69

Lean code for Definition5.1.89●6 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/SignatureZMod2.lean
    complete
    def NumberField.elementSignature.{u_1} {K : Type u_1} [Field K] :
      Additive Kˣ →+ { w // w.IsReal } → ZMod 2
    def NumberField.elementSignature.{u_1}
      {K : Type u_1} [Field K] :
      Additive Kˣ →+
        { w // w.IsReal } → ZMod 2
    The **signature** (LMFDB `nf.unit_signature_rank`) of a nonzero element `α` of `K`: the vector,
    indexed by the real places `w` of `K`, of the signs `sign(σ_w(α)) ∈ 𝔽₂` at the real embeddings
    `σ_w`, where `sign(x)` is `0` for `x > 0` and `1` for `x < 0`. It is additive in `α`, the product
    of two elements having the sum of their signatures. 
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/SignatureRank.lean
    complete
    def NumberField.unitSignatureRank.{u_1} (K : Type u_1) [Field K] : ℕ
    def NumberField.unitSignatureRank.{u_1}
      (K : Type u_1) [Field K] : ℕ
    The **unit signature rank** of a number field `K` (LMFDB `nf.unit_signature_rank`): the
    dimension over `𝔽₂` of the space of signatures of the units of `𝓞 K`, where the signature of a
    unit is its vector of signs at the real places of `K`, each sign read in `ℝˣ ⧸ ℝˣ₊ ≅ 𝔽₂`.
    
    A totally complex field has no real places, so its unit signature rank is `0`, as in the LMFDB's
    convention (`unitSignatureRank_eq_zero_iff`). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/SignatureZMod2.lean
    complete
    theorem NumberField.unitSignatureRank_eq_finrank.{u_1} {K : Type u_1} [Field K]
      [NumberField K] :
      NumberField.unitSignatureRank K =
        Module.finrank (ZMod 2) ↥(NumberField.unitSignatureSpace K)
    theorem NumberField.unitSignatureRank_eq_finrank.{u_1}
      {K : Type u_1} [Field K]
      [NumberField K] :
      NumberField.unitSignatureRank K =
        Module.finrank (ZMod 2)
          ↥(NumberField.unitSignatureSpace K)
    **The unit signature rank is the dimension of the space of signatures of units**
    (LMFDB `nf.unit_signature_rank`): `NumberField.unitSignatureRank K` is the dimension over `𝔽₂` of
    the subspace of `𝔽₂ ^ r₁` formed by the signatures of the units of `𝓞 K`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/SignatureRank.lean
    complete
    theorem NumberField.unitSignatureRank_pos.{u_1} (K : Type u_1) [Field K]
      [NumberField K] (h : 0 < NumberField.InfinitePlace.nrRealPlaces K) :
      0 < NumberField.unitSignatureRank K
    theorem NumberField.unitSignatureRank_pos.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (h :
        0 <
          NumberField.InfinitePlace.nrRealPlaces
            K) :
      0 < NumberField.unitSignatureRank K
    The unit signature rank of a number field with a real place is positive, since the unit `-1`
    is negative at every real place. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/SignatureRank.lean
    complete
    theorem NumberField.unitSignatureRank_le.{u_1} (K : Type u_1) [Field K]
      [NumberField K] :
      NumberField.unitSignatureRank K ≤
        NumberField.InfinitePlace.nrRealPlaces K
    theorem NumberField.unitSignatureRank_le.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] :
      NumberField.unitSignatureRank K ≤
        NumberField.InfinitePlace.nrRealPlaces
          K
    The unit signature rank is at most the number of real places. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/Units/SignatureRankQuadratic.lean
    complete
    theorem NumberField.unitSignatureRank_eq_ite.{u_1} {K : Type u_1} [Field K]
      [NumberField K] {ε : (NumberField.RingOfIntegers K)ˣ}
      [NumberField.IsTotallyReal K] (hK : Module.finrank ℚ K = 2)
      (hε : Subgroup.closure {ε} ⊔ NumberField.Units.torsion K = ⊤) :
      NumberField.unitSignatureRank K =
        if
            (Algebra.norm ℚ)
                ((algebraMap (NumberField.RingOfIntegers K) K) ↑ε) =
              1 then
          1
        else 2
    theorem NumberField.unitSignatureRank_eq_ite.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      {ε : (NumberField.RingOfIntegers K)ˣ}
      [NumberField.IsTotallyReal K]
      (hK : Module.finrank ℚ K = 2)
      (hε :
        Subgroup.closure {ε} ⊔
            NumberField.Units.torsion K =
          ⊤) :
      NumberField.unitSignatureRank K =
        if
            (Algebra.norm ℚ)
                ((algebraMap
                    (NumberField.RingOfIntegers
                      K)
                    K)
                  ↑ε) =
              1 then
          1
        else 2
    **The unit signature rank of a real quadratic field** (LMFDB `nf.unit_signature_rank`): it is
    `1` if the fundamental unit `ε` has norm `1`, and otherwise, when `ε` has norm `-1`, it is `2`. 
Definition5.1.90
Statement uses 2
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Unramified (rational) prime of a number field. (LMFDB)

A unramified (rational) prime of a number field K is a prime integer p such that the ideal generated by p is factored into distinct prime ideals in the ring of integers \mathcal{O}_K of K p\mathcal{O}_K = \mathcal{P}_1\cdots \mathcal{P}_k.

The unramified primes of K are the primes which do not divide the discriminant of K.

Tau Ceti Review: Algebra.IsUnramifiedIn, Algebra.isUnramifiedIn_iff_forall_ramificationIdx_eq_one, Ideal.ramificationIdx, Ideal.IsDedekindDomain.ramificationIdx_eq_normalizedFactors_count, NumberField.not_dvd_discr_iff_isUnramifiedIn.

Depends on: Definition 5.1.1 Definition 5.1.17

Lean code for Definition5.1.90●5 declarations
  • defdefined in Mathlib/RingTheory/Unramified/Locus.lean
    complete
    def Algebra.IsUnramifiedIn.{u_1, u_2} {R : Type u_1} [CommRing R]
      (A : Type u_2) [CommRing A] [Algebra R A] (𝔭 : Ideal R) : Prop
    def Algebra.IsUnramifiedIn.{u_1, u_2}
      {R : Type u_1} [CommRing R]
      (A : Type u_2) [CommRing A]
      [Algebra R A] (𝔭 : Ideal R) : Prop
    A prime `𝔭` of `R` is unramified in `A` if every prime ideal `𝔓` of `A` lying over `𝔭` is
    unramified. 
  • theoremdefined in Mathlib/NumberTheory/RamificationInertia/Unramified.lean
    complete
    theorem Algebra.isUnramifiedIn_iff_forall_ramificationIdx_eq_one.{u_1, u_2}
      {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S]
      [IsDomain R] [Module.Finite ℤ R] [CharZero R]
      [Algebra.EssFiniteType R S] [Algebra.IsIntegral R S] {𝔭 : Ideal R} :
      Algebra.IsUnramifiedIn S 𝔭 ↔
        ∀ (𝔓 : Ideal S) [𝔓.IsPrime], 𝔓.LiesOver 𝔭 → 𝔓.ramificationIdx R = 1
    theorem Algebra.isUnramifiedIn_iff_forall_ramificationIdx_eq_one.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2}
      [CommRing R] [CommRing S] [Algebra R S]
      [IsDomain R] [Module.Finite ℤ R]
      [CharZero R] [Algebra.EssFiniteType R S]
      [Algebra.IsIntegral R S] {𝔭 : Ideal R} :
      Algebra.IsUnramifiedIn S 𝔭 ↔
        ∀ (𝔓 : Ideal S) [𝔓.IsPrime],
          𝔓.LiesOver 𝔭 →
            𝔓.ramificationIdx R = 1
    A nonzero ideal of `R` is unramified in `S` if and only if every prime ideal of `S` lying
    over it has ramification index `1`. 
  • defdefined in Mathlib/RingTheory/RamificationInertia/Ramification.lean
    complete
    def Ideal.ramificationIdx.{u_1, u_2} {S : Type u_1} [CommRing S]
      (q : Ideal S) (R : Type u_2) [CommRing R] [Algebra R S] : ℕ
    def Ideal.ramificationIdx.{u_1, u_2}
      {S : Type u_1} [CommRing S]
      (q : Ideal S) (R : Type u_2)
      [CommRing R] [Algebra R S] : ℕ
    Let `S/R` be an extension of rings, and let `q` be a prime ideal of `S` lying over a prime ideal
    `p` of `R`. Let `Sq` be the localization of `S` and `q`, and let `pSq` be the image of `p` in `Sq`.
    Then the ramification index of `q` over `R` is defined to be the length of the quotient `Sq/pSq` as
    an `Sq`-module.
    
    When `q` is not prime, we use a junk value of `0`.
    
    This will eventually replace the existing definition of `Ideal.ramificationIdx'`. 
  • theoremdefined in Mathlib/RingTheory/RamificationInertia/Ramification.lean
    complete
    theorem Ideal.IsDedekindDomain.ramificationIdx_eq_normalizedFactors_count.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S]
      (p : Ideal R) (q : Ideal S) [IsDedekindDomain S] [q.LiesOver p]
      (hp0 : Ideal.map (algebraMap R S) p ≠ ⊥) :
      q.ramificationIdx R =
        Multiset.count q
          (UniqueFactorizationMonoid.normalizedFactors
            (Ideal.map (algebraMap R S) p))
    theorem Ideal.IsDedekindDomain.ramificationIdx_eq_normalizedFactors_count.{u_1,
        u_2}
      {R : Type u_1} {S : Type u_2}
      [CommRing R] [CommRing S] [Algebra R S]
      (p : Ideal R) (q : Ideal S)
      [IsDedekindDomain S] [q.LiesOver p]
      (hp0 :
        Ideal.map (algebraMap R S) p ≠ ⊥) :
      q.ramificationIdx R =
        Multiset.count q
          (UniqueFactorizationMonoid.normalizedFactors
            (Ideal.map (algebraMap R S) p))
  • theoremdefined in Mathlib/NumberTheory/NumberField/Discriminant/Different.lean
    complete
    theorem NumberField.not_dvd_discr_iff_isUnramifiedIn.{u_1, u_2} (K : Type u_1)
      (𝒪 : Type u_2) [Field K] [NumberField K] [CommRing 𝒪] [Algebra 𝒪 K]
      [IsIntegralClosure 𝒪 ℤ K] {p : ℤ} (hp : Prime p) :
      ¬p ∣ NumberField.discr K ↔ Algebra.IsUnramifiedIn 𝒪 (Ideal.span {p})
    theorem NumberField.not_dvd_discr_iff_isUnramifiedIn.{u_1,
        u_2}
      (K : Type u_1) (𝒪 : Type u_2) [Field K]
      [NumberField K] [CommRing 𝒪]
      [Algebra 𝒪 K] [IsIntegralClosure 𝒪 ℤ K]
      {p : ℤ} (hp : Prime p) :
      ¬p ∣ NumberField.discr K ↔
        Algebra.IsUnramifiedIn 𝒪
          (Ideal.span {p})
    A prime `p` does not divide `discr K` if and only if `p` (as the ideal `span {p}`) is
    unramified in the ring of integers `𝒪`.
    
    Also see `not_dvd_discr_iff_forall_liesOver` and `not_dvd_discr_iff_forall_mem` for variants
    whose RHS does not use `Algebra.IsUnramifiedIn`. 
Definition5.1.91
uses 0used by 0✓L∃∀N

Two notions of equivalence for valuations. (LMFDB)

Let v_1 and v_2 are valuations of a ring R, p \in \mathbb{R}_{>1}, and we set \lvert x \rvert_1 = p^{-v_1(x)} and \lvert x \rvert_2 = p^{-v_2(x)}, the following are equivalent:

  • there exists a positive real number c such that |x|_1 = |x|_2^c for all x\in R,

  • for all elements r, s \in R, v_1(r) \le v_1(s) if and only if v_2(r) \le v_2(s).

The second form is the definition used in mathlib.

Tau Ceti Review: Valuation.IsEquiv.

Lean code for Definition5.1.91●6 declarations
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/Valuation/IsEquivRpow.lean
    complete
    theorem AddValuation.exists_rpowAbs_eq_rpow_iff_isEquiv.{u_1} {R : Type u_1}
      [Ring R] {v₁ v₂ : AddValuation R (WithTop ℝ)} {p : ℝ} (hp : 1 < p) :
      (∃ c, 0 < c ∧ ∀ (x : R), v₁.rpowAbs p x = v₂.rpowAbs p x ^ c) ↔
        v₁.IsEquiv v₂
    theorem AddValuation.exists_rpowAbs_eq_rpow_iff_isEquiv.{u_1}
      {R : Type u_1} [Ring R]
      {v₁ v₂ : AddValuation R (WithTop ℝ)}
      {p : ℝ} (hp : 1 < p) :
      (∃ c,
          0 < c ∧
            ∀ (x : R),
              v₁.rpowAbs p x =
                v₂.rpowAbs p x ^ c) ↔
        v₁.IsEquiv v₂
    **Two notions of equivalence for valuations** (LMFDB `nf.valuation_equivalence`): for additive
    valuations `v₁, v₂` of a ring with values in `ℝ ∪ {∞}` and a real `p > 1`, with
    `|x|_i = p ^ (-v_i(x))`, there is a real `c > 0` with `|x|_1 = |x|_2 ^ c` for all `x` exactly when
    `v₁` and `v₂` are equivalent, that is (`AddValuation.isEquiv_iff_le_iff_le`) when
    `v₁(r) ≤ v₁(s) ↔ v₂(r) ≤ v₂(s)` for all `r, s`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/Valuation/IsEquivRpow.lean
    complete
    theorem AddValuation.isEquiv_iff_le_iff_le.{u_1} {R : Type u_1} [Ring R]
      {v₁ v₂ : AddValuation R (WithTop ℝ)} :
      v₁.IsEquiv v₂ ↔ ∀ (r s : R), v₁ r ≤ v₁ s ↔ v₂ r ≤ v₂ s
    theorem AddValuation.isEquiv_iff_le_iff_le.{u_1}
      {R : Type u_1} [Ring R]
      {v₁ v₂ : AddValuation R (WithTop ℝ)} :
      v₁.IsEquiv v₂ ↔
        ∀ (r s : R), v₁ r ≤ v₁ s ↔ v₂ r ≤ v₂ s
    **Mathlib's equivalence of additive valuations is the knowl's second form** (LMFDB
    `nf.valuation_equivalence`): `v₁` and `v₂` are equivalent exactly when `v₁(r) ≤ v₁(s)` if and only
    if `v₂(r) ≤ v₂(s)`, for all `r, s`. Mathlib defines `AddValuation.IsEquiv` through the reversed
    order of `Multiplicative (WithTop ℝ)ᵒᵈ`. 
  • theoremdefined in LeanBridge/ForMathlib/RingTheory/Valuation/IsEquivRpow.lean
    complete
    theorem AddValuation.isEquiv_iff_exists_eq_mul.{u_1} {R : Type u_1} [Ring R]
      {v₁ v₂ : AddValuation R (WithTop ℝ)} :
      v₁.IsEquiv v₂ ↔
        ∃ c, 0 < c ∧ ∀ (x : R), v₁ x = WithTop.map (fun x => c * x) (v₂ x)
    theorem AddValuation.isEquiv_iff_exists_eq_mul.{u_1}
      {R : Type u_1} [Ring R]
      {v₁ v₂ : AddValuation R (WithTop ℝ)} :
      v₁.IsEquiv v₂ ↔
        ∃ c,
          0 < c ∧
            ∀ (x : R),
              v₁ x =
                WithTop.map (fun x => c * x)
                  (v₂ x)
    **Equivalent real-valued valuations are proportional** (LMFDB `nf.valuation_equivalence`): two
    additive valuations `v₁, v₂` of a ring with values in `ℝ ∪ {∞}` induce the same preorder exactly
    when `v₁ = c v₂` for a real `c > 0`. 
  • defdefined in LeanBridge/ForMathlib/RingTheory/Valuation/IsEquivRpow.lean
    complete
    def AddValuation.rpowAbs.{u_1} {R : Type u_1} [Ring R]
      (v : AddValuation R (WithTop ℝ)) (p : ℝ) (x : R) : ℝ
    def AddValuation.rpowAbs.{u_1} {R : Type u_1}
      [Ring R]
      (v : AddValuation R (WithTop ℝ)) (p : ℝ)
      (x : R) : ℝ
    The **real absolute value** `|x| = p ^ (-v(x))` (LMFDB `nf.valuation_equivalence`) attached to
    an additive valuation `v` of a ring with values in `ℝ ∪ {∞}` and a real number `p`, with `|x| = 0`
    when `v(x) = ∞`. 
  • defdefined in Mathlib/RingTheory/Valuation/Basic.lean
    complete
    def AddValuation.IsEquiv.{u_3, u_4, u_5} {R : Type u_3} {Γ₀ : Type u_4}
      {Γ'₀ : Type u_5} [Ring R] [LinearOrderedAddCommMonoidWithTop Γ₀]
      [LinearOrderedAddCommMonoidWithTop Γ'₀] (v₁ : AddValuation R Γ₀)
      (v₂ : AddValuation R Γ'₀) : Prop
    def AddValuation.IsEquiv.{u_3, u_4, u_5}
      {R : Type u_3} {Γ₀ : Type u_4}
      {Γ'₀ : Type u_5} [Ring R]
      [LinearOrderedAddCommMonoidWithTop Γ₀]
      [LinearOrderedAddCommMonoidWithTop Γ'₀]
      (v₁ : AddValuation R Γ₀)
      (v₂ : AddValuation R Γ'₀) : Prop
    Two additive valuations on `R` are defined to be equivalent if they induce the same
    preorder on `R`. 
  • defdefined in Mathlib/RingTheory/Valuation/Basic.lean
    complete
    def Valuation.IsEquiv.{u_3, u_4, u_5} {R : Type u_3} {Γ₀ : Type u_4}
      {Γ'₀ : Type u_5} [Ring R] [LinearOrderedCommMonoidWithZero Γ₀]
      [LinearOrderedCommMonoidWithZero Γ'₀] (v₁ : Valuation R Γ₀)
      (v₂ : Valuation R Γ'₀) : Prop
    def Valuation.IsEquiv.{u_3, u_4, u_5}
      {R : Type u_3} {Γ₀ : Type u_4}
      {Γ'₀ : Type u_5} [Ring R]
      [LinearOrderedCommMonoidWithZero Γ₀]
      [LinearOrderedCommMonoidWithZero Γ'₀]
      (v₁ : Valuation R Γ₀)
      (v₂ : Valuation R Γ'₀) : Prop
    Two valuations on `R` are defined to be equivalent if they induce the same preorder on `R`. 
Definition5.1.92
Statement uses 2
Statement dependency previews
Preview
Definition 1.2.60
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 1.2.10
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Weil height. (LMFDB)

The (logarithmic) Weil height of a nonzero rational number a/b\in\mathbb{Q} in lowest terms is the quantity

h(a/b) = \log\max\bigl\{|a|,|b|\bigr\}. The height of 0 is taken to be 0.

The (absolute logarithmic) Weil height of an element \alpha in a number field K is the quantity

h(\alpha) = \frac{1}{[K:\mathbb{Q}]} \sum_{v\in M_K} [K_v:\mathbb{Q}_v]\log\max\bigl\{\|\alpha\|_v,1\bigr\},

where M_K is an appropriately normalized set of inequivalent absolute values on K. More generally, the height of a point P=[\alpha_0,\alpha_1,\ldots,\alpha_n] in projective space \mathbb{P}^n(K) is given by

h(P) = \frac{1}{[K:\mathbb{Q}]} \sum_{v\in M_K} [K_v:\mathbb{Q}_v]\log\max_{0\le i\le n}\bigl\{\|\alpha_i\|_v\bigr\}.

If \mathcal{L} is a very amply line bundle on a projective variety V inducing an embedding \iota \colon V \hookrightarrow \mathbb{P}^n, then the Weil height associated on X associated to \mathcal{L} is given by

h_{\mathcal{L}}(P) = h(\iota(P)).

This definition can be extended to all line bundles by using the following linearity:

h_{\mathcal{L}_1 \otimes \mathcal{L}_2}(P) = h_{\mathcal{L}_1}(P) + h_{\mathcal{L}_2}(P).

Depends on: Definition 1.2.60 Definition 5.1.1

Definition5.1.93
Statement uses 2
Statement dependency previews
Preview
Definition 1.2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.7.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Weil polynomial. (LMFDB)

For a prime power q, a Weil q-polynomial is a monic polynomial with integer coefficients whose complex roots are of absolute value \sqrt{q}.

Given q and a nonnegative integer d, there are only finitely many Weil q-polynomials of degree d.

The characteristic polynomial of an abelian variety over \F_q is a Weil q-polynomial, but it is not quite true that every Weil q-polynomial arises in this way. Every irreducible Weil q-polynomial has a unique power that is the characteristic polynomial of a simple abelian variety over \F_q; it is the products of these powers that arise from abelian varieties.

Depends on: Definition 1.2.2 Definition 4.9.18

Definition5.1.94
Statement uses 3
Statement dependency previews
Preview
Definition 5.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Index of a number field. (LMFDB)

If K is a number field with ring of integers \mathcal{O}_K, then for all \alpha\in\mathcal{O}_K such that K=\Q(\alpha), the index of \alpha, i(\alpha) is the index of the order \Z[\alpha].

The index of the number field is the greatest common divisor of all i(\alpha) with \alpha as above.

Tau Ceti Review: TauCeti.NumberField.IntegralPrimitiveElement.index.

Depends on: Definition 5.1.1 Definition 5.1.57 Definition 5.1.74

Lean code for Definition5.1.94●5 declarations
  • defdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FieldIndex.lean
    complete
    def NumberField.fieldIndex.{u_1} (K : Type u_1) [Field K] [NumberField K] :
      ℕ
    def NumberField.fieldIndex.{u_1}
      (K : Type u_1) [Field K]
      [NumberField K] : ℕ
    The **index** of a number field `K` (LMFDB `nf.zk_index`): the greatest common divisor of the
    indices `[𝓞 K : ℤ[θ]]` of the algebraic integers `θ` with `K = ℚ(θ)`, defined as the largest
    natural number dividing all of them (`dvd_fieldIndex_iff` shows that it is their greatest common
    divisor in the sense of divisibility as well). 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FieldIndex.lean
    complete
    theorem NumberField.dvd_fieldIndex_iff.{u_1} (K : Type u_1) [Field K]
      [NumberField K] {d : ℕ} :
      d ∣ NumberField.fieldIndex K ↔
        ∀ (θ : TauCeti.NumberField.IntegralPrimitiveElement K), d ∣ θ.index
    theorem NumberField.dvd_fieldIndex_iff.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      {d : ℕ} :
      d ∣ NumberField.fieldIndex K ↔
        ∀
          (θ :
            TauCeti.NumberField.IntegralPrimitiveElement
              K),
          d ∣ θ.index
    The index of `K` is the greatest common divisor of the indices of the integral primitive
    elements of `K`: it is divisible by every common divisor of them. 
  • defdefined in TauCeti/NumberTheory/NumberField/Index/Basic.lean
    complete
    def TauCeti.NumberField.IntegralPrimitiveElement.index.{u_1} {K : Type u_1}
      [Field K] [NumberField K]
      (θ : TauCeti.NumberField.IntegralPrimitiveElement K) : ℕ
    def TauCeti.NumberField.IntegralPrimitiveElement.index.{u_1}
      {K : Type u_1} [Field K] [NumberField K]
      (θ :
        TauCeti.NumberField.IntegralPrimitiveElement
          K) :
      ℕ
    The index `[𝓞 K : ℤ[θ]]`, defined as the cardinality of the additive quotient. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FieldIndex.lean
    complete
    theorem NumberField.isCommonIndexDivisor_iff_dvd_fieldIndex.{u_1} (K : Type u_1)
      [Field K] [NumberField K] {d : ℕ} :
      TauCeti.NumberField.IsCommonIndexDivisor d K ↔
        d ∣ NumberField.fieldIndex K
    theorem NumberField.isCommonIndexDivisor_iff_dvd_fieldIndex.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      {d : ℕ} :
      TauCeti.NumberField.IsCommonIndexDivisor
          d K ↔
        d ∣ NumberField.fieldIndex K
    The common index divisors of `K` are the divisors of the index of `K`. 
  • theoremdefined in LeanBridge/ForMathlib/NumberTheory/NumberField/FieldIndex.lean
    complete
    theorem NumberField.fieldIndex_eq_one_of_isMonogenic.{u_1} (K : Type u_1)
      [Field K] [NumberField K] (h : TauCeti.NumberField.IsMonogenic K) :
      NumberField.fieldIndex K = 1
    theorem NumberField.fieldIndex_eq_one_of_isMonogenic.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (h :
        TauCeti.NumberField.IsMonogenic K) :
      NumberField.fieldIndex K = 1
    A monogenic number field, one with `𝓞 K = ℤ[θ]`, has index `1`.