Embeddings of number fields

This file defines the embeddings of a number field and, in particular, the embeddings into the field of complex numbers.

Main Definitions and Results

• NumberField.Embeddings.range_eval_eq_rootSet_minpoly: let x ∈ K with K a number field and let A be an algebraically closed field of char. 0. Then the images of x under the embeddings of K in A are exactly the roots in A of the minimal polynomial of x over ℚ.
• NumberField.Embeddings.pow_eq_one_of_norm_eq_one: an algebraic integer whose conjugates are all of norm one is a root of unity.

Tags

number field, embeddings

noncomputable instance NumberField.Embeddings.instFintypeRingHom (K : Type u_1) [Field K] [NumberField K] (A : Type u_2) [Field A] [CharZero A] : Fintype (K →+* A)

There are finitely many embeddings of a number field.

Equations

• NumberField.Embeddings.instFintypeRingHom K A = Fintype.ofEquiv (K →ₐ[ℚ] A) RingHom.equivRatAlgHom.symm

theorem NumberField.Embeddings.card (K : Type u_1) [Field K] [NumberField K] (A : Type u_2) [Field A] [CharZero A] [IsAlgClosed A] : Fintype.card (K →+* A) = Module.finrank ℚ K

The number of embeddings of a number field is equal to its finrank.

instance NumberField.Embeddings.instNonemptyRingHom (K : Type u_1) [Field K] [NumberField K] (A : Type u_2) [Field A] [CharZero A] [IsAlgClosed A] : Nonempty (K →+* A)

theorem NumberField.Embeddings.range_eval_eq_rootSet_minpoly (K : Type u_1) (A : Type u_2) [Field K] [NumberField K] [Field A] [Algebra ℚ A] [IsAlgClosed A] (x : K) : (Set.range fun (φ : K →+* A) => φ x) = (minpoly ℚ x).rootSet A

Let A be an algebraically closed field and let x ∈ K, with K a number field. The images of x by the embeddings of K in A are exactly the roots in A of the minimal polynomial of x over ℚ.

theorem NumberField.Embeddings.coeff_bdd_of_norm_le {K : Type u_1} [Field K] [NumberField K] {A : Type u_2} [NormedField A] [IsAlgClosed A] [NormedAlgebra ℚ A] {B : ℝ} {x : K} (h : ∀ (φ : K →+* A), ‖φ x‖ ≤ B) (i : ℕ) : ‖(minpoly ℚ x).coeff i‖ ≤ max B 1 ^ Module.finrank ℚ K * ↑((Module.finrank ℚ K).choose (Module.finrank ℚ K / 2))

theorem NumberField.Embeddings.finite_of_norm_le (K : Type u_1) [Field K] [NumberField K] (A : Type u_2) [NormedField A] [IsAlgClosed A] [NormedAlgebra ℚ A] (B : ℝ) : {x : K | IsIntegral ℤ x ∧ ∀ (φ : K →+* A), ‖φ x‖ ≤ B}.Finite

Let B be a real number. The set of algebraic integers in K whose conjugates are all smaller in norm than B is finite.

theorem NumberField.Embeddings.pow_eq_one_of_norm_eq_one (K : Type u_1) [Field K] [NumberField K] (A : Type u_2) [NormedField A] [IsAlgClosed A] [NormedAlgebra ℚ A] {x : K} (hxi : IsIntegral ℤ x) (hx : ∀ (φ : K →+* A), ‖φ x‖ = 1) : ∃ (n : ℕ) (_ : 0 < n), x ^ n = 1

An algebraic integer whose conjugates are all of norm one is a root of unity.

def NumberField.place {K : Type u_1} [Field K] {A : Type u_2} [NormedDivisionRing A] [Nontrivial A] (φ : K →+* A) : AbsoluteValue K ℝ

An embedding into a normed division ring defines a place of K

Equations

• NumberField.place φ = (IsAbsoluteValue.toAbsoluteValue norm).comp ⋯

@[simp]

theorem NumberField.place_apply {K : Type u_1} [Field K] {A : Type u_2} [NormedDivisionRing A] [Nontrivial A] (φ : K →+* A) (x : K) : (place φ) x = ‖φ x‖

noncomputable def NumberField.ComplexEmbedding.lift (K : Type u_1) [Field K] {k : Type u_2} [Field k] [Algebra k K] [Algebra.IsAlgebraic k K] (φ : k →+* ℂ) : K →+* ℂ

A (random) lift of the complex embedding φ : k →+* ℂ to an extension K of k.

Equations

• NumberField.ComplexEmbedding.lift K φ = IsAlgClosed.lift.toRingHom

@[simp]

theorem NumberField.ComplexEmbedding.lift_comp_algebraMap (K : Type u_1) [Field K] {k : Type u_2} [Field k] [Algebra k K] [Algebra.IsAlgebraic k K] (φ : k →+* ℂ) : (lift K φ).comp (algebraMap k K) = φ

@[simp]

theorem NumberField.ComplexEmbedding.lift_algebraMap_apply (K : Type u_1) [Field K] {k : Type u_2} [Field k] [Algebra k K] [Algebra.IsAlgebraic k K] (φ : k →+* ℂ) (x : k) : (lift K φ) ((algebraMap k K) x) = φ x

@[reducible, inline]

abbrev NumberField.ComplexEmbedding.conjugate {K : Type u_1} [Field K] (φ : K →+* ℂ) : K →+* ℂ

The conjugate of a complex embedding as a complex embedding.

Equations

• NumberField.ComplexEmbedding.conjugate φ = star φ

@[simp]

theorem NumberField.ComplexEmbedding.conjugate_coe_eq {K : Type u_1} [Field K] (φ : K →+* ℂ) (x : K) : (conjugate φ) x = (starRingEnd ℂ) (φ x)

theorem NumberField.ComplexEmbedding.place_conjugate {K : Type u_1} [Field K] (φ : K →+* ℂ) : place (conjugate φ) = place φ

@[reducible, inline]

abbrev NumberField.ComplexEmbedding.IsReal {K : Type u_1} [Field K] (φ : K →+* ℂ) : Prop

An embedding into ℂ is real if it is fixed by complex conjugation.

Equations

• NumberField.ComplexEmbedding.IsReal φ = IsSelfAdjoint φ

theorem NumberField.ComplexEmbedding.isReal_iff {K : Type u_1} [Field K] {φ : K →+* ℂ} : IsReal φ ↔ conjugate φ = φ

theorem NumberField.ComplexEmbedding.isReal_conjugate_iff {K : Type u_1} [Field K] {φ : K →+* ℂ} : IsReal (conjugate φ) ↔ IsReal φ

def NumberField.ComplexEmbedding.IsReal.embedding {K : Type u_1} [Field K] {φ : K →+* ℂ} (hφ : IsReal φ) : K →+* ℝ

A real embedding as a ring homomorphism from K to ℝ .

Equations

• hφ.embedding = { toFun := fun (x : K) => (φ x).re, map_one' := ⋯, map_mul' := ⋯, map_zero' := ⋯, map_add' := ⋯ }

@[simp]

theorem NumberField.ComplexEmbedding.IsReal.coe_embedding_apply {K : Type u_1} [Field K] {φ : K →+* ℂ} (hφ : IsReal φ) (x : K) : ↑(hφ.embedding x) = φ x

theorem NumberField.ComplexEmbedding.IsReal.comp {K : Type u_1} [Field K] {k : Type u_2} [Field k] (f : k →+* K) {φ : K →+* ℂ} (hφ : IsReal φ) : IsReal (φ.comp f)

theorem NumberField.ComplexEmbedding.isReal_comp_iff {K : Type u_1} [Field K] {k : Type u_2} [Field k] {f : k ≃+* K} {φ : K →+* ℂ} : IsReal (φ.comp ↑f) ↔ IsReal φ

theorem NumberField.ComplexEmbedding.exists_comp_symm_eq_of_comp_eq {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] [IsGalois k K] (φ ψ : K →+* ℂ) (h : φ.comp (algebraMap k K) = ψ.comp (algebraMap k K)) : ∃ (σ : K ≃ₐ[k] K), φ.comp ↑σ.symm = ψ

def NumberField.ComplexEmbedding.IsConj {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] (φ : K →+* ℂ) (σ : K ≃ₐ[k] K) : Prop

IsConj φ σ states that σ : K ≃ₐ[k] K is the conjugation under the embedding φ : K →+* ℂ.

Equations

• NumberField.ComplexEmbedding.IsConj φ σ = (NumberField.ComplexEmbedding.conjugate φ = φ.comp ↑σ)

theorem NumberField.ComplexEmbedding.IsConj.eq {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ : K ≃ₐ[k] K} (h : IsConj φ σ) (x : K) : φ (σ x) = star (φ x)

theorem NumberField.ComplexEmbedding.IsConj.ext {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ₁ σ₂ : K ≃ₐ[k] K} (h₁ : IsConj φ σ₁) (h₂ : IsConj φ σ₂) : σ₁ = σ₂

theorem NumberField.ComplexEmbedding.IsConj.ext_iff {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ₁ σ₂ : K ≃ₐ[k] K} (h₁ : IsConj φ σ₁) : σ₁ = σ₂ ↔ IsConj φ σ₂

theorem NumberField.ComplexEmbedding.IsConj.isReal_comp {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ : K ≃ₐ[k] K} (h : IsConj φ σ) : IsReal (φ.comp (algebraMap k K))

theorem NumberField.ComplexEmbedding.isConj_one_iff {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} : IsConj φ 1 ↔ IsReal φ

theorem NumberField.ComplexEmbedding.IsReal.isConjGal_one {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} : IsReal φ → IsConj φ 1

Alias of the reverse direction of NumberField.ComplexEmbedding.isConj_one_iff.

theorem NumberField.ComplexEmbedding.isConj_ne_one_iff {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ : K ≃ₐ[k] K} (hσ : IsConj φ σ) : σ ≠ 1 ↔ ¬IsReal φ

theorem NumberField.ComplexEmbedding.IsConj.symm {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ : K ≃ₐ[k] K} (hσ : IsConj φ σ) : IsConj φ σ.symm

theorem NumberField.ComplexEmbedding.isConj_symm {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ : K ≃ₐ[k] K} : IsConj φ σ.symm ↔ IsConj φ σ

theorem NumberField.ComplexEmbedding.isConj_apply_apply {K : Type u_1} [Field K] {k : Type u_2} [Field k] [Algebra k K] {φ : K →+* ℂ} {σ : K ≃ₐ[k] K} (hσ : IsConj φ σ) (x : K) : σ (σ x) = x