Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions Mathlib.lean
Original file line number Diff line number Diff line change
Expand Up @@ -6149,6 +6149,7 @@ public import Mathlib.NumberTheory.ModularForms.SlashInvariantForms
public import Mathlib.NumberTheory.MulChar.Basic
public import Mathlib.NumberTheory.MulChar.Duality
public import Mathlib.NumberTheory.MulChar.Lemmas
public import Mathlib.NumberTheory.MulChar.Teichmuller
public import Mathlib.NumberTheory.Multiplicity
public import Mathlib.NumberTheory.Niven
public import Mathlib.NumberTheory.NumberField.AdeleRing
Expand All @@ -6169,6 +6170,8 @@ public import Mathlib.NumberTheory.NumberField.Cyclotomic.Embeddings
public import Mathlib.NumberTheory.NumberField.Cyclotomic.Galois
public import Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
public import Mathlib.NumberTheory.NumberField.Cyclotomic.PID
public import Mathlib.NumberTheory.NumberField.Cyclotomic.Stickelberger
public import Mathlib.NumberTheory.NumberField.Cyclotomic.StickelbergerPrereqs
public import Mathlib.NumberTheory.NumberField.Cyclotomic.Three
public import Mathlib.NumberTheory.NumberField.DedekindZeta
public import Mathlib.NumberTheory.NumberField.DirichletDensity
Expand Down Expand Up @@ -7361,6 +7364,7 @@ public import Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
public import Mathlib.RingTheory.RootsOfUnity.Lemmas
public import Mathlib.RingTheory.RootsOfUnity.Minpoly
public import Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
public import Mathlib.RingTheory.RootsOfUnity.Quotient
public import Mathlib.RingTheory.SimpleModule.Basic
public import Mathlib.RingTheory.SimpleModule.InjectiveProjective
public import Mathlib.RingTheory.SimpleModule.IsAlgClosed
Expand Down
11 changes: 11 additions & 0 deletions Mathlib/Algebra/GroupWithZero/Units/Fintype.lean
Original file line number Diff line number Diff line change
Expand Up @@ -58,3 +58,14 @@ theorem Fintype.card_units [GroupWithZero α] [Fintype α] [DecidableEq α] :
theorem Fintype.card_eq_card_units_add_one [GroupWithZero α] [Fintype α] [DecidableEq α] :
Fintype.card α = Fintype.card αˣ + 1 := by
rw [Fintype.card_units, tsub_add_cancel_of_le Fintype.card_pos]

variable {α}

/-- A product over the nonzero elements of a finite group with zero is a product over its units. -/
@[to_additive (dont_translate := α)
/-- A sum over the nonzero elements of a finite group with zero is a sum over its units. -/]
theorem Fintype.prod_compl_zero {M : Type*} [GroupWithZero α] [Fintype α] [DecidableEq α]
[Fintype αˣ] [CommMonoid M] (f : α → M) :
∏ x ∈ {0}ᶜ, f x = ∏ x : αˣ, f x := by
rw [← Fintype.prod_equiv unitsEquivNeZero.symm (fun x ↦ f x) _ (fun _ ↦ rfl),
← Finset.prod_subtype {0}ᶜ (by simp)]
44 changes: 27 additions & 17 deletions Mathlib/FieldTheory/Finite/Basic.lean
Original file line number Diff line number Diff line change
Expand Up @@ -30,9 +30,12 @@ cyclic group, as well as the fact that every finite integral domain is a field

1. `Fintype.card_units`: The unit group of a finite field has cardinality `q - 1`.
2. `sum_pow_units`: The sum of `x^i`, where `x` ranges over the units of `K`, is
- `q-1` if `q-1 ∣ i`
- `-1` if `q-1 ∣ i`
- `0` otherwise
3. `FiniteField.card`: The cardinality `q` is a power of the characteristic of `K`.
3. `sum_pow_of_ne_zero`: The sum of `x^i`, with `i ≠ 0`, where `x` ranges over `K`, is
- `-1` if `q-1 ∣ i`
- `0` otherwise
4. `FiniteField.card`: The cardinality `q` is a power of the characteristic of `K`.
See `FiniteField.card'` for a variant.

## Notation
Expand Down Expand Up @@ -286,7 +289,7 @@ theorem forall_pow_eq_one_iff (i : ℕ) : (∀ x : Kˣ, x ^ i = 1) ↔ q - 1 ∣
rw [← pow_mul, mul_comm, pow_mul, h, one_pow]

/-- The sum of `x ^ i` as `x` ranges over the units of a finite field of cardinality `q`
is equal to `0` unless `(q - 1) ∣ i`, in which case the sum is `q - 1`. -/
is equal to `0` unless `(q - 1) ∣ i`, in which case the sum is `-1`. -/
theorem sum_pow_units [DecidableEq K] (i : ℕ) :
(∑ x : Kˣ, (x ^ i : K)) = if q - 1 ∣ i then -1 else 0 := by
let φ : Kˣ →* K :=
Expand All @@ -306,23 +309,30 @@ theorem sum_pow_units [DecidableEq K] (i : ℕ) :
rw [← forall_pow_eq_one_iff, DFunLike.ext_iff]
apply forall_congr'; intro x; simp [φ, Units.ext_iff]

/-- The sum of `x ^ i`, with `i ≠ 0`, as `x` ranges over a finite field of cardinality `q`
is equal to `-1` if `q - 1 ∣ i`, and to `0` otherwise. -/
theorem sum_pow_of_ne_zero (i : ℕ) (hi : i ≠ 0) :
∑ x : K, x ^ i = if q - 1 ∣ i then -1 else 0 := by
classical
rw [Fintype.sum_eq_sum_compl_add 0, zero_pow hi, add_zero, Fintype.sum_compl_zero,
sum_pow_units]

/-- The sum of `x ^ i` as `x` ranges over a finite field of cardinality `q`
is equal to `0` if `i < q - 1`. -/
theorem sum_pow_lt_card_sub_one (i : ℕ) (h : i < q - 1) : ∑ x : K, x ^ i = 0 := by
by_cases hi : i = 0
· simp only [hi, nsmul_one, sum_const, pow_zero, card_univ, cast_card_eq_zero]
classical
have hiq : ¬q - 1 ∣ i := by contrapose! h; exact Nat.le_of_dvd (Nat.pos_of_ne_zero hi) h
let φ : Kˣ ↪ K := ⟨fun x ↦ x, Units.val_injective⟩
have : univ.map φ = univ \ {0} := by
ext x
simpa only [mem_map, mem_univ, Function.Embedding.coeFn_mk, true_and, mem_sdiff,
mem_singleton, φ] using! isUnit_iff_ne_zero
calc
∑ x : K, x ^ i = ∑ x ∈ univ \ {(0 : K)}, x ^ i := by
rw [← sum_sdiff ({0} : Finset K).subset_univ, sum_singleton, zero_pow hi, add_zero]
_ = ∑ x : Kˣ, (x ^ i : K) := by simp [φ, ← this, univ.sum_map φ]
_ = 0 := by rw [sum_pow_units K i, ite_eq_right]; exact hiq
obtain rfl | hi := eq_or_ne i 0
· simp
simp [sum_pow_of_ne_zero K _ hi, Nat.not_dvd_of_pos_of_lt (by lia) h]

/-- The sum of all the elements of a finite field of cardinality `q` is equal to `1` if `q = 2`,
and to `0` otherwise. -/
theorem sum_univ_id_eq_ite :
∑ x : K, x = if q = 2 then 1 else 0 := by
rw [show ∑ x : K, x = ∑ x : K, x ^ 1 by simp, sum_pow_of_ne_zero K 1 one_ne_zero]
simp only [Nat.dvd_one, Nat.pred_eq_succ_iff, zero_add]
split_ifs with hq
· rw [neg_eq_iff_add_eq_zero, one_add_one_eq_two, ← Nat.cast_ofNat, ← hq, cast_card_eq_zero]
· rfl

section frobenius

Expand Down
187 changes: 187 additions & 0 deletions Mathlib/NumberTheory/MulChar/Teichmuller.lean
Original file line number Diff line number Diff line change
@@ -0,0 +1,187 @@
/-
Copyright (c) 2026 Xavier Roblot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Xavier Roblot
-/
module

public import Mathlib.NumberTheory.MulChar.Basic
public import Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
public import Mathlib.RingTheory.RootsOfUnity.Quotient

/-!
# The Teichmüller character

Let `I` be an ideal of a commutative ring `R` such that reduction modulo `I` is a bijection from
the `n`-th roots of unity of `R` onto the units of `R ⧸ I`, a property recorded by the class
`Ideal.HasTeichmullerLift`. Inverting that bijection and extending by zero gives a multiplicative
character of `R ⧸ I` with values in `R`, the Teichmüller character, which is a multiplicative
section of the reduction map.

## Main definitions

* `Ideal.HasTeichmullerLift`: the property that every unit of `R ⧸ I` is the reduction of a
unique `n`-th root of unity of `R`, its Teichmüller lift.
* `Ideal.HasTeichmullerLift.equiv`: the isomorphism, given by reduction modulo `I`, from the `n`-th
roots of unity of `R` onto the units of `R ⧸ I`.
* `MulChar.teichmuller`: the Teichmüller character of `R ⧸ I`, with values in `R`.

## Main results

* `MulChar.teichmuller_mk_coe`: the Teichmüller character sends the reduction of an `n`-th root of
unity back to it.
* `MulChar.mk_teichmuller_apply_coe`, `MulChar.mk_teichmuller_apply`: the Teichmüller character is
a section of the reduction map on units, and everywhere when `I` is maximal.
* `MulChar.orderOf_teichmuller`: the Teichmüller character has order `n`.
* `MulChar.exists_teichmuller_zpow_apply_eq_pow`: over a domain containing a primitive `n`-th root
of unity `ζ`, the values of the powers of the Teichmüller character at units are powers of `ζ`.
* `MulChar.map_ringHomComp_teichmuller_zpow_apply`: if `σ (f ζ) = f ζ ^ m`, then `σ` sends
`(teichmuller I n ^ a).ringHomComp f` to `(teichmuller I n ^ (a * m)).ringHomComp f`.

## Tags

Teichmüller character, multiplicative character, roots of unity

-/

public section

variable {R : Type*} [CommRing R]

/-- The ideal `I` has Teichmüller lifts of order `n` if every unit of `R ⧸ I` is the reduction of
a unique `n`-th root of unity of `R`. -/
class Ideal.HasTeichmullerLift (I : Ideal R) (n : ℕ) : Prop where
bijective_rootsOfUnityMapQuot : Function.Bijective (I.rootsOfUnityMapQuot n)

/-- If the domain `R` has enough `n`-th roots of unity, the integer `n` does not lie in `I` and
the group of units of `R ⧸ I` has order `n`, then `I` has Teichmüller lifts of order `n`. -/
theorem Ideal.HasTeichmullerLift.of_card [IsDomain R] {I : Ideal R} {n : ℕ} [NeZero n]
[HasEnoughRootsOfUnity R n] (hn : (n : R) ∉ I) (hcard : Nat.card (R ⧸ I)ˣ = n) :
I.HasTeichmullerLift n :=
have : Finite (R ⧸ I)ˣ := Nat.finite_of_card_ne_zero (hcard ▸ NeZero.ne n)
⟨(Nat.bijective_iff_injective_and_card _).mpr ⟨I.rootsOfUnityMapQuot_injective_of_notMem hn, by
rw [HasEnoughRootsOfUnity.natCard_rootsOfUnity, hcard]⟩⟩

/-- If the domain `R` has enough `n`-th roots of unity and the units of the quotient of `R` by the
prime ideal `I` form a group of order `n`, then `I` has Teichmüller lifts of order `n`. -/
theorem Ideal.HasTeichmullerLift.of_card_of_isPrime [IsDomain R] {I : Ideal R} {n : ℕ} [NeZero n]
[HasEnoughRootsOfUnity R n] [I.IsPrime] (hcard : Nat.card (R ⧸ I)ˣ = n) :
I.HasTeichmullerLift n := by
refine .of_card (fun hmem ↦ ?_) hcard
replace hmem : (n : R ⧸ I) = 0 := Ideal.Quotient.eq_zero_iff_mem.mpr hmem
have : NeZero (ringChar (R ⧸ I)) :=
⟨fun h ↦ NeZero.ne n <| Nat.zero_dvd.mp <| h ▸ ringChar.dvd hmem⟩
have : Fact (ringChar (R ⧸ I)).Prime := CharP.char_is_prime_of_pos (R ⧸ I) _
have : Finite (R ⧸ I)ˣ := Nat.finite_of_card_ne_zero (hcard ▸ NeZero.ne n)
obtain ⟨g, hg⟩ := IsCyclic.exists_ofOrder_eq_natCard (α := (R ⧸ I)ˣ)
exact ExpChar.not_dvd_orderOf (ringChar (R ⧸ I)) CharP.ringChar_ne_one g
(isOfFinOrder_of_finite g) (by rwa [hg, hcard, ← ringChar.spec])

/-- If `I` has Teichmüller lifts of order `n`, reduction modulo `I` is an isomorphism from the
`n`-th roots of unity of `R` onto the units of `R ⧸ I`. -/
noncomputable def Ideal.HasTeichmullerLift.equiv (I : Ideal R) (n : ℕ)
[h : I.HasTeichmullerLift n] : rootsOfUnity n R ≃* (R ⧸ I)ˣ :=
MulEquiv.ofBijective _ h.bijective_rootsOfUnityMapQuot

@[simp]
theorem Ideal.HasTeichmullerLift.equiv_apply (I : Ideal R) (n : ℕ) [I.HasTeichmullerLift n]
(ζ : rootsOfUnity n R) : equiv I n ζ = I.rootsOfUnityMapQuot n ζ := by
simp [equiv]

namespace MulChar

/-- The Teichmüller character of `R ⧸ I`: the multiplicative character with values in `R`
obtained by inverting the reduction of the `n`-th roots of unity and extending by zero. -/
noncomputable def teichmuller (I : Ideal R) (n : ℕ) [I.HasTeichmullerLift n] :
MulChar (R ⧸ I) R :=
MulChar.ofUnitHom <| (rootsOfUnity n R).subtype.comp
(Ideal.HasTeichmullerLift.equiv I n).symm.toMonoidHom

variable {n : ℕ} {I : Ideal R} [I.HasTeichmullerLift n]

/-- The value of the Teichmüller character at a unit. -/
theorem teichmuller_apply_coe (x : (R ⧸ I)ˣ) :
teichmuller I n x = ((Ideal.HasTeichmullerLift.equiv I n).symm x : Rˣ) := by
simp [teichmuller]

/-- The Teichmüller character sends the reduction of an `n`-th root of unity back to it. -/
@[simp]
theorem teichmuller_mk_coe (ζ : rootsOfUnity n R) :
teichmuller I n (Ideal.Quotient.mk I ((ζ : Rˣ) : R)) = ((ζ : Rˣ) : R) := by
rw [← Ideal.rootsOfUnityMapQuot_coe_apply, teichmuller_apply_coe,
← Ideal.HasTeichmullerLift.equiv_apply, MulEquiv.symm_apply_apply]

/-- The values of the Teichmüller character at units are `n`-th roots of unity. -/
@[simp]
theorem teichmuller_apply_coe_pow_eq_one (x : (R ⧸ I)ˣ) : teichmuller I n x ^ n = 1 := by
rw [teichmuller_apply_coe, ← Units.val_pow_eq_pow_val,
(mem_rootsOfUnity _ _).mp ((Ideal.HasTeichmullerLift.equiv I n).symm x).prop, Units.val_one]

/-- On units, the Teichmüller character is a section of the reduction map `R → R ⧸ I`. -/
@[simp]
theorem mk_teichmuller_apply_coe (x : (R ⧸ I)ˣ) :
Ideal.Quotient.mk I (teichmuller I n x) = x := by
obtain ⟨ζ, rfl⟩ := (Ideal.HasTeichmullerLift.equiv I n).surjective x
simp

attribute [local instance] Ideal.Quotient.field in
/-- The Teichmüller character is a section of the reduction map `R → R ⧸ I`. -/
@[simp]
theorem mk_teichmuller_apply [I.IsMaximal] (x : R ⧸ I) :
Ideal.Quotient.mk I (teichmuller I n x) = x := by
obtain rfl | ⟨u, rfl⟩ := GroupWithZero.eq_zero_or_unit x
· simp
· exact mk_teichmuller_apply_coe u

/-- The Teichmüller character is nontrivial if and only if the group of units of `R ⧸ I` is
nontrivial. -/
theorem teichmuller_ne_one_iff : teichmuller I n ≠ 1 ↔ Nontrivial (R ⧸ I)ˣ := by
rw [MulChar.ne_one_iff, nontrivial_iff_exists_ne 1]
simp [teichmuller_apply_coe]

/-- The `n`-th power of the Teichmüller character is trivial. -/
@[simp]
theorem teichmuller_pow_eq_one : teichmuller I n ^ n = 1 := by
ext x
rw [MulChar.pow_apply_coe, teichmuller_apply_coe_pow_eq_one, MulChar.one_apply_coe]

/-- A power of the Teichmüller character whose exponent is divisible by `n` is trivial. -/
theorem teichmuller_zpow_eq_one_of_dvd {a : ℤ} (ha : (n : ℤ) ∣ a) : teichmuller I n ^ a = 1 := by
obtain ⟨c, rfl⟩ := ha
rw [zpow_mul, zpow_natCast, teichmuller_pow_eq_one, one_zpow]

/-- The Teichmüller character has order `n`. -/
theorem orderOf_teichmuller [NeZero n] [HasEnoughRootsOfUnity R n] :
orderOf (teichmuller I n) = n := by
obtain ⟨ζ, hζ⟩ := HasEnoughRootsOfUnity.exists_isPrimitiveRoot R n
refine (orderOf_eq_iff (NeZero.pos _)).mpr ⟨teichmuller_pow_eq_one,
fun m hmn hm ↦ MulChar.ne_one_iff.mpr ⟨I.rootsOfUnityMapQuot n hζ.toRootsOfUnity, ?_⟩⟩
rw [MulChar.pow_apply_coe, Ideal.rootsOfUnityMapQuot_coe_apply, teichmuller_mk_coe,
IsPrimitiveRoot.val_toRootsOfUnity_coe, ne_eq, hζ.pow_eq_one_iff_dvd]
exact Nat.not_dvd_of_pos_of_lt hm hmn

/-- The values at units of the powers of the Teichmüller character are powers of a primitive
`n`-th root of unity `ζ`. -/
theorem exists_teichmuller_zpow_apply_eq_pow [IsDomain R] [NeZero n] {ζ : R}
(hζ : IsPrimitiveRoot ζ n) (a : ℤ) (x : (R ⧸ I)ˣ) :
∃ m < n, (teichmuller I n ^ a) x = ζ ^ m := by
obtain ⟨k, hk, hk'⟩ := hζ.eq_pow_of_pow_eq_one (ξ := (teichmuller I n ^ a) x) <| by
rw [← MulChar.pow_apply_coe, ← zpow_natCast, ← zpow_mul,
teichmuller_zpow_eq_one_of_dvd (dvd_mul_left _ _), MulChar.one_apply_coe]
exact ⟨k, hk, hk'.symm⟩

/-- A ring homomorphism sending `ζ` to `ζ ^ m` multiplies by `m` the exponent of a power of the
Teichmüller character. -/
theorem map_ringHomComp_teichmuller_zpow_apply [IsDomain R] [NeZero n] {S : Type*}
[CommRing S] {F : Type*} [FunLike F S S] [MonoidWithZeroHomClass F S S] (σ : F) (f : R →+* S)
(m : ℕ) {ζ : R} (hζ : IsPrimitiveRoot ζ n) (hσ : σ (f ζ) = (f ζ) ^ m) (a : ℤ)
(x : R ⧸ I) :
σ ((teichmuller I n ^ a).ringHomComp f x) = (teichmuller I n ^ (a * m)).ringHomComp f x := by
by_cases hx : IsUnit x
· lift x to (R ⧸ I)ˣ using hx
obtain ⟨t, -, ht⟩ := exists_teichmuller_zpow_apply_eq_pow hζ a x
rw [MulChar.ringHomComp_apply, ht, map_pow, map_pow, hσ, MulChar.ringHomComp_apply,
zpow_mul, zpow_natCast, MulChar.pow_apply_coe, ht, map_pow, map_pow, pow_right_comm]
· simp [MulChar.map_nonunit _ hx]

end MulChar
39 changes: 18 additions & 21 deletions Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
Original file line number Diff line number Diff line change
Expand Up @@ -316,15 +316,15 @@ The norm, relative to `ℤ`, of `ζ - 1` in an `n`-th cyclotomic extension of `
power of a prime number is `1`.
-/
theorem norm_toInteger_sub_one_eq_one {n : ℕ} [IsCyclotomicExtension {n} ℚ K]
(hζ : IsPrimitiveRoot ζ n) (h₁ : 2 < n) (h₂ : ∀ {p : ℕ}, Nat.Prime p → ∀ (k : ℕ), p ^ k ≠ n) :
(hζ : IsPrimitiveRoot ζ n) (h₁ : 2 < n) (h₂ : ¬ IsPrimePow n) :
have : NeZero n := NeZero.of_gt h₁
norm ℤ (hζ.toInteger - 1) = 1 := by
have : NumberField K := IsCyclotomicExtension.numberField {n} ℚ K
have : NeZero n := NeZero.of_gt h₁
dsimp only
rw [norm_eq_iff ℤ (Sₘ := K) (Rₘ := ℚ) le_rfl, map_sub, map_one, map_one, RingOfIntegers.map_mk,
sub_one_norm_eq_eval_cyclotomic hζ h₁ (cyclotomic.irreducible_rat (NeZero.pos _)),
eval_one_cyclotomic_not_prime_pow h₂, Int.cast_one]
eval_one_cyclotomic_of_not_isPrimePow (by lia) h₂, Int.cast_one]

set_option backward.isDefEq.respectTransparency.types false in
/-- The norm, relative to `ℤ`, of `ζ ^ p ^ s - 1` in a `p ^ (k + 1)`-th cyclotomic extension of `ℚ`
Expand Down Expand Up @@ -563,27 +563,24 @@ theorem prime_dvd_of_dvd_norm_sub_one {n : ℕ} (hn : 2 ≤ n) {K : Type*}
rsuffices ⟨q, hq, t, s, ht₁, ht₂, hs⟩ :
∃ q, q.Prime ∧ ∃ t s, t ≠ 0 ∧ n = q ^ t ∧ (p : ℤ) ∣ (q : ℤ) ^ s := by
obtain hn | hn := lt_or_eq_of_le hn
· by_cases! h : ∃ q, q.Prime ∧ ∃ t, q ^ t = n
· obtain ⟨q, hq, t, hn'⟩ := h
· by_cases h : IsPrimePow n
· obtain ⟨q, t, hq, ht, hn'⟩ := (isPrimePow_nat_iff _).mp h
obtain ⟨r, rfl⟩ := Nat.exists_eq_add_one_of_ne_zero ht.ne'
have : Fact (Nat.Prime q) := ⟨hq⟩
cases t with
| zero => simp [← hn'] at hn
| succ r =>
rw [← hn'] at hC hμ
refine ⟨q, hq, r + 1, Module.finrank (ℚ⟮ζ⟯) K, r.add_one_ne_zero, hn'.symm, ?_⟩
by_cases hq' : q = 2
· cases r with
| zero =>
rw [← hn', hq', zero_add, pow_one] at hn
exact hn.false.elim
| succ k =>
rw [hq'] at hC hμ ⊢
rwa [hμ.norm_toInteger_sub_one_of_eq_two_pow] at hp
· rwa [hμ.norm_toInteger_sub_one_of_prime_ne_two hq'] at hp
· rw [IsPrimitiveRoot.norm_toInteger_sub_one_eq_one hμ hn, one_pow,
rw [← hn'] at hC hμ
refine ⟨q, hq, r + 1, Module.finrank (ℚ⟮ζ⟯) K, r.add_one_ne_zero, hn'.symm, ?_⟩
by_cases hq' : q = 2
· cases r with
| zero =>
rw [← hn', hq', zero_add, pow_one] at hn
exact hn.false.elim
| succ k =>
rw [hq'] at hC hμ ⊢
rwa [hμ.norm_toInteger_sub_one_of_eq_two_pow] at hp
· rwa [hμ.norm_toInteger_sub_one_of_prime_ne_two hq'] at hp
· rw [IsPrimitiveRoot.norm_toInteger_sub_one_eq_one hμ hn h, one_pow,
Int.natCast_dvd_ofNat, Nat.dvd_one] at hp
· exact (Nat.Prime.ne_one hF.out hp).elim
· exact fun {p} a k ↦ h p a k
exact (Nat.Prime.ne_one hF.out hp).elim
· rw [← hn] at hμ hC ⊢
refine ⟨2, Nat.prime_two, 1, Module.finrank ℚ⟮ζ⟯ K, one_ne_zero, by rw [pow_one], ?_⟩
rwa [hμ.norm_toInteger_sub_one_of_eq_two, neg_eq_neg_one_mul, mul_pow, IsUnit.dvd_mul_left
Expand Down
Loading