Loogle!
Result
Found 70 declarations mentioning IsPrimitiveRoot.toInteger.
- IsPrimitiveRoot.toInteger 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} {k : ℕ} [NeZero k] (hζ : IsPrimitiveRoot ζ k) : NumberField.RingOfIntegers K - IsPrimitiveRoot.toInteger_isPrimitiveRoot 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} {k : ℕ} [NeZero k] (hζ : IsPrimitiveRoot ζ k) : IsPrimitiveRoot hζ.toInteger k - IsPrimitiveRoot.toInteger_coe 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {k : ℕ} [NeZero k] {x : NumberField.RingOfIntegers K} (hx : IsPrimitiveRoot (↑x) k) : hx.toInteger = x - IsPrimitiveRoot.integralPowerBasis_gen 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{n : ℕ} {K : Type u} [Field K] {ζ : K} [NeZero n] [CharZero K] [hcycl : IsCyclotomicExtension {n} ℚ K] (hζ : IsPrimitiveRoot ζ n) : hζ.integralPowerBasis.gen = hζ.toInteger - IsPrimitiveRoot.coe_toInteger 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} {k : ℕ} [NeZero k] (hζ : IsPrimitiveRoot ζ k) : ↑hζ.toInteger = ζ - IsPrimitiveRoot.zeta_sub_one_prime' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [h : IsCyclotomicExtension {p} ℚ K] (hζ : IsPrimitiveRoot ζ p) : Prime (hζ.toInteger - 1) - IsPrimitiveRoot.integralPowerBasisOfPrimePow_gen 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p ^ k} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ k)) : hζ.integralPowerBasisOfPrimePow.gen = hζ.toInteger - IsPrimitiveRoot.finite_quotient_toInteger_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} [NumberField K] {k : ℕ} (hk : 1 < k) (hζ : IsPrimitiveRoot ζ k) : Finite (NumberField.RingOfIntegers K ⧸ Ideal.span {hζ.toInteger - 1}) - IsPrimitiveRoot.finite_quotient_span_sub_one' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p} ℚ K] (hζ : IsPrimitiveRoot ζ p) : Finite (NumberField.RingOfIntegers K ⧸ Ideal.span {hζ.toInteger - 1}) - IsPrimitiveRoot.toInteger_sub_one_dvd_prime' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p} ℚ K] (hζ : IsPrimitiveRoot ζ p) : hζ.toInteger - 1 ∣ ↑p - IsPrimitiveRoot.not_exists_int_prime_dvd_sub_of_prime_ne_two' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p} ℚ K] (hζ : IsPrimitiveRoot ζ p) (hodd : p ≠ 2) : ¬∃ n, ↑p ∣ hζ.toInteger - ↑n - IsPrimitiveRoot.prime_dvd_of_dvd_norm_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{n : ℕ} (hn : 2 ≤ n) {K : Type u_1} [Field K] [NumberField K] {ζ : K} {p : ℕ} [hF : Fact (Nat.Prime p)] (hζ : IsPrimitiveRoot ζ n) (hp : ↑p ∣ (Algebra.norm ℤ) (hζ.toInteger - 1)) : p ∣ n - IsPrimitiveRoot.zeta_sub_one_prime 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : Prime (hζ.toInteger - 1) - IsPrimitiveRoot.zeta_sub_one_prime_of_two_pow 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{k : ℕ} {K : Type u} [Field K] {ζ : K} [CharZero K] [IsCyclotomicExtension {2 ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (2 ^ (k + 1))) : Prime (hζ.toInteger - 1) - IsPrimitiveRoot.zeta_sub_one_prime_of_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (hodd : p ≠ 2) : Prime (hζ.toInteger - 1) - IsPrimitiveRoot.norm_toInteger_sub_one_of_eq_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} [CharZero K] [IsCyclotomicExtension {2} ℚ K] (hζ : IsPrimitiveRoot ζ 2) : (Algebra.norm ℤ) (hζ.toInteger - 1) = -2 - IsPrimitiveRoot.prime_norm_toInteger_sub_one_of_prime_ne_two' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p} ℚ K] (hζ : IsPrimitiveRoot ζ p) (hodd : p ≠ 2) : Prime ((Algebra.norm ℤ) (hζ.toInteger - 1)) - IsPrimitiveRoot.norm_toInteger_sub_one_of_prime_ne_two' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p} ℚ K] (hζ : IsPrimitiveRoot ζ p) (h : p ≠ 2) : (Algebra.norm ℤ) (hζ.toInteger - 1) = ↑p - IsPrimitiveRoot.finite_quotient_span_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : Finite (NumberField.RingOfIntegers K ⧸ Ideal.span {hζ.toInteger - 1}) - IsPrimitiveRoot.toInteger_sub_one_dvd_prime 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : hζ.toInteger - 1 ∣ ↑p - IsPrimitiveRoot.not_exists_int_prime_dvd_sub_of_prime_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (hodd : p ≠ 2) : ¬∃ n, ↑p ∣ hζ.toInteger - ↑n - IsPrimitiveRoot.norm_toInteger_sub_one_eq_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} [CharZero K] {n : ℕ} [IsCyclotomicExtension {n} ℚ K] (hζ : IsPrimitiveRoot ζ n) (h₁ : 2 < n) (h₂ : ∀ {p : ℕ}, Nat.Prime p → ∀ (k : ℕ), p ^ k ≠ n) : have this := ⋯; (Algebra.norm ℤ) (hζ.toInteger - 1) = 1 - IsPrimitiveRoot.toInteger_sub_one_not_dvd_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (hodd : p ≠ 2) : ¬hζ.toInteger - 1 ∣ 2 - IsPrimitiveRoot.not_exists_int_prime_dvd_sub_of_prime_pow_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (htwo : p ^ (k + 1) ≠ 2) : ¬∃ n, ↑p ∣ hζ.toInteger - ↑n - IsPrimitiveRoot.card_quotient_toInteger_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{K : Type u} [Field K] {ζ : K} [NumberField K] {k : ℕ} [NeZero k] (hζ : IsPrimitiveRoot ζ k) : Nat.card (NumberField.RingOfIntegers K ⧸ Ideal.span {hζ.toInteger - 1}) = ((Algebra.norm ℤ) (hζ.toInteger - 1)).natAbs - IsPrimitiveRoot.norm_toInteger_sub_one_of_eq_two_pow 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{k : ℕ} {K : Type u_1} [Field K] {ζ : K} [CharZero K] [IsCyclotomicExtension {2 ^ (k + 2)} ℚ K] (hζ : IsPrimitiveRoot ζ (2 ^ (k + 2))) : (Algebra.norm ℤ) (hζ.toInteger - 1) = 2 - IsPrimitiveRoot.prime_norm_toInteger_sub_one_of_prime_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [hcycl : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (hodd : p ≠ 2) : Prime ((Algebra.norm ℤ) (hζ.toInteger - 1)) - IsPrimitiveRoot.norm_toInteger_sub_one_of_prime_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (hodd : p ≠ 2) : (Algebra.norm ℤ) (hζ.toInteger - 1) = ↑p - IsPrimitiveRoot.prime_norm_toInteger_sub_one_of_prime_pow_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (htwo : p ^ (k + 1) ≠ 2) : Prime ((Algebra.norm ℤ) (hζ.toInteger - 1)) - IsPrimitiveRoot.norm_toInteger_pow_sub_one_of_prime_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) {s : ℕ} (hs : s ≤ k) (hodd : p ≠ 2) : (Algebra.norm ℤ) (hζ.toInteger ^ p ^ s - 1) = ↑p ^ p ^ s - IsPrimitiveRoot.norm_toInteger_pow_sub_one_of_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{k : ℕ} {K : Type u} [Field K] {ζ : K} [CharZero K] [IsCyclotomicExtension {2 ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (2 ^ (k + 1))) : (Algebra.norm ℤ) (hζ.toInteger ^ 2 ^ k - 1) = (-2) ^ 2 ^ k - IsPrimitiveRoot.norm_toInteger_pow_sub_one_of_prime_pow_ne_two 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : ℕ} {K : Type u} [Field K] {ζ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ (k + 1)} ℚ K] (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) {s : ℕ} (hs : s ≤ k) (htwo : p ^ (k - s + 1) ≠ 2) : (Algebra.norm ℤ) (hζ.toInteger ^ p ^ s - 1) = ↑p ^ p ^ s - IsCyclotomicExtension.Rat.adjoin_singleton_eq_top 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{n : ℕ} {K : Type u} [Field K] [CharZero K] [hn : NeZero n] [hK : IsCyclotomicExtension {n} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ n) : ℤ[hζ.toInteger] = ⊤ - IsPrimitiveRoot.toInteger_cube_eq_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) : hζ.toInteger ^ 3 = 1 - IsCyclotomicExtension.Rat.Three.coe_eta 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) : ↑⋯.unit = hζ.toInteger - IsCyclotomicExtension.Rat.Three.eta_sq 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) : ↑⋯.unit ^ 2 = -↑⋯.unit - 1 - IsCyclotomicExtension.Rat.Three.eta_sq_add_eta_add_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) : ↑⋯.unit ^ 2 + ↑⋯.unit + 1 = 0 - IsCyclotomicExtension.Rat.Three.lambda_pow_four_dvd_cube_add_one_of_dvd_add_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) [NumberField K] [IsCyclotomicExtension {3} ℚ K] {x : NumberField.RingOfIntegers K} (h : hζ.toInteger - 1 ∣ x + 1) : (hζ.toInteger - 1) ^ 4 ∣ x ^ 3 + 1 - IsCyclotomicExtension.Rat.Three.lambda_pow_four_dvd_cube_sub_one_of_dvd_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) [NumberField K] [IsCyclotomicExtension {3} ℚ K] {x : NumberField.RingOfIntegers K} (h : hζ.toInteger - 1 ∣ x - 1) : (hζ.toInteger - 1) ^ 4 ∣ x ^ 3 - 1 - IsCyclotomicExtension.Rat.Three.lambda_dvd_mul_sub_one_mul_sub_eta_add_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) (x : NumberField.RingOfIntegers K) [NumberField K] [IsCyclotomicExtension {3} ℚ K] : hζ.toInteger - 1 ∣ x * (x - 1) * (x - (↑⋯.unit + 1)) - IsCyclotomicExtension.Rat.Three.lambda_dvd_or_dvd_sub_one_or_dvd_add_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) (x : NumberField.RingOfIntegers K) [NumberField K] [IsCyclotomicExtension {3} ℚ K] : hζ.toInteger - 1 ∣ x ∨ hζ.toInteger - 1 ∣ x - 1 ∨ hζ.toInteger - 1 ∣ x + 1 - IsCyclotomicExtension.Rat.Three.eq_one_or_neg_one_of_unit_of_congruent 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) (u : (NumberField.RingOfIntegers K)ˣ) [NumberField K] [IsCyclotomicExtension {3} ℚ K] (hcong : ∃ n, (hζ.toInteger - 1) ^ 2 ∣ ↑u - ↑n) : u = 1 ∨ u = -1 - IsCyclotomicExtension.Rat.Three.cube_sub_one_eq_mul 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) (x : NumberField.RingOfIntegers K) : x ^ 3 - 1 = (x - 1) * (x - ↑⋯.unit) * (x - ↑⋯.unit ^ 2) - IsCyclotomicExtension.Rat.Three.lambda_pow_four_dvd_cube_sub_one_or_add_one_of_lambda_not_dvd 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) [NumberField K] [IsCyclotomicExtension {3} ℚ K] {x : NumberField.RingOfIntegers K} (h : ¬hζ.toInteger - 1 ∣ x) : (hζ.toInteger - 1) ^ 4 ∣ x ^ 3 - 1 ∨ (hζ.toInteger - 1) ^ 4 ∣ x ^ 3 + 1 - IsCyclotomicExtension.Rat.Three.Units.mem 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Three
{K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ 3) (u : (NumberField.RingOfIntegers K)ˣ) [NumberField K] [IsCyclotomicExtension {3} ℚ K] : u ∈ [1, -1, ⋯.unit, -⋯.unit, ⋯.unit ^ 2, -⋯.unit ^ 2] - _private.Mathlib.NumberTheory.FLT.Three.0.FermatLastTheoremForThreeGen.Solution'.hcdvd 📋 Mathlib.NumberTheory.FLT.Three
{K : Type u_1} [Field K] {ζ : K} {hζ : IsPrimitiveRoot ζ 3} (self : FermatLastTheoremForThreeGen.Solution'✝ hζ) : hζ.toInteger - 1 ∣ FermatLastTheoremForThreeGen.Solution'.c✝ self - _private.Mathlib.NumberTheory.FLT.Three.0.FermatLastTheoremForThreeGen.Solution'.ha 📋 Mathlib.NumberTheory.FLT.Three
{K : Type u_1} [Field K] {ζ : K} {hζ : IsPrimitiveRoot ζ 3} (self : FermatLastTheoremForThreeGen.Solution'✝ hζ) : ¬hζ.toInteger - 1 ∣ FermatLastTheoremForThreeGen.Solution'.a✝ self - _private.Mathlib.NumberTheory.FLT.Three.0.FermatLastTheoremForThreeGen.Solution'.hb 📋 Mathlib.NumberTheory.FLT.Three
{K : Type u_1} [Field K] {ζ : K} {hζ : IsPrimitiveRoot ζ 3} (self : FermatLastTheoremForThreeGen.Solution'✝ hζ) : ¬hζ.toInteger - 1 ∣ FermatLastTheoremForThreeGen.Solution'.b✝ self - _private.Mathlib.NumberTheory.FLT.Three.0.FermatLastTheoremForThreeGen.Solution.hab 📋 Mathlib.NumberTheory.FLT.Three
{K : Type u_1} [Field K] {ζ : K} {hζ : IsPrimitiveRoot ζ 3} (self : FermatLastTheoremForThreeGen.Solution✝ hζ) : (hζ.toInteger - 1) ^ 2 ∣ FermatLastTheoremForThreeGen.Solution'.a✝ (FermatLastTheoremForThreeGen.Solution.toSolution'✝ self) + FermatLastTheoremForThreeGen.Solution'.b✝ (FermatLastTheoremForThreeGen.Solution.toSolution'✝ self) - IsCyclotomicExtension.Rat.isPrime_span_zeta_sub_one' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) : (Ideal.span {hζ.toInteger - 1}).IsPrime - IsCyclotomicExtension.Rat.inertiaDeg_span_zeta_sub_one' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) : (Ideal.span {hζ.toInteger - 1}).inertiaDeg ℤ = 1 - IsCyclotomicExtension.Rat.zeta_sub_one_dvd_intCast_iff' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) {n : ℤ} : hζ.toInteger - 1 ∣ ↑n ↔ ↑p ∣ n - IsCyclotomicExtension.Rat.ramificationIdx_span_zeta_sub_one' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) : (Ideal.span {hζ.toInteger - 1}).ramificationIdx ℤ = p - 1 - IsCyclotomicExtension.Rat.associated_sub_one_of_isPrimitiveRoot 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) {K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) [NeZero p] {η : K} (hη : IsPrimitiveRoot η p) : Associated (hζ.toInteger - 1) (hη.toInteger - 1) - IsCyclotomicExtension.Rat.associated_zeta_sub_one_pow_prime 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) : Associated ((hζ.toInteger - 1) ^ (p - 1)) ↑p - IsCyclotomicExtension.Rat.isCoprime_of_not_zeta_sub_one_dvd 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) {x : NumberField.RingOfIntegers K} (hx : ¬hζ.toInteger - 1 ∣ x) : IsCoprime (↑p) x - IsCyclotomicExtension.Rat.eq_span_zeta_sub_one_of_liesOver' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] (K : Type u_1) [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) (P : Ideal (NumberField.RingOfIntegers K)) [hP₁ : P.IsPrime] [hP₂ : P.LiesOver (Ideal.span {↑p})] : P = Ideal.span {hζ.toInteger - 1} - IsCyclotomicExtension.Rat.isPrime_span_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : (Ideal.span {hζ.toInteger - 1}).IsPrime - IsCyclotomicExtension.Rat.inertiaDeg_span_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : (Ideal.span {hζ.toInteger - 1}).inertiaDeg ℤ = 1 - IsCyclotomicExtension.Rat.zeta_sub_one_dvd_intCast_iff 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) {n : ℤ} : hζ.toInteger - 1 ∣ ↑n ↔ ↑p ∣ n - IsCyclotomicExtension.Rat.liesOver_span_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : (Ideal.span {hζ.toInteger - 1}).LiesOver (Ideal.span {↑p}) - IsCyclotomicExtension.Rat.two_not_mem_span_zeta_sub_one' 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ p) (h : 2 < p) : 2 ∉ Ideal.span {hζ.toInteger - 1} - IsCyclotomicExtension.Rat.ramificationIdx_span_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : (Ideal.span {hζ.toInteger - 1}).ramificationIdx ℤ = p ^ k * (p - 1) - IsCyclotomicExtension.Rat.span_zeta_sub_one_ne_bot 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : Ideal.span {hζ.toInteger - 1} ≠ ⊥ - IsCyclotomicExtension.Rat.associated_norm_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : Associated ((Algebra.norm ℤ) (hζ.toInteger - 1)) ↑p - IsCyclotomicExtension.Rat.eq_span_zeta_sub_one_of_liesOver 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] (K : Type u_1) [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) (P : Ideal (NumberField.RingOfIntegers K)) [hP₁ : P.IsPrime] [hP₂ : P.LiesOver (Ideal.span {↑p})] : P = Ideal.span {hζ.toInteger - 1} - IsCyclotomicExtension.Rat.p_mem_span_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : ↑p ∈ Ideal.span {hζ.toInteger - 1} - IsCyclotomicExtension.Rat.absNorm_span_zeta_sub_one 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : Ideal.absNorm (Ideal.span {hζ.toInteger - 1}) = p - IsCyclotomicExtension.Rat.map_eq_span_zeta_sub_one_pow 📋 Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal
(p k : ℕ) [hp : Fact (Nat.Prime p)] {K : Type u_1} [Field K] [NumberField K] [hK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K] {ζ : K} (hζ : IsPrimitiveRoot ζ (p ^ (k + 1))) : Ideal.map (algebraMap ℤ (NumberField.RingOfIntegers K)) (Ideal.span {↑p}) = Ideal.span {hζ.toInteger - 1} ^ Module.finrank ℚ K - IsPrimitiveRoot.not_coprime_norm_of_mk_eq_one 📋 Mathlib.NumberTheory.NumberField.Ideal.Basic
{K : Type u_1} [Field K] {I : Ideal (NumberField.RingOfIntegers K)} [NumberField K] (hI : Ideal.absNorm I ≠ 1) {n : ℕ} {ζ : K} (hn : 2 ≤ n) (hζ : IsPrimitiveRoot ζ n) (h : (Ideal.Quotient.mk I) hζ.toInteger = 1) : ¬(Ideal.absNorm I).Coprime n
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c