Theorems · Theorem · number theory
IsPrimitiveRoot.minpoly_dvd_expand
∀ {n : ℕ} {K : Type u_1} [inst : CommRing K] {μ : K},
IsPrimitiveRoot μ n →
∀ [IsDomain K] [CharZero K] {p : ℕ}, ¬p ∣ n → minpoly ℤ μ ∣ (Polynomial.expand ℤ p) (minpoly ℤ (μ ^ p))Let P be the minimal polynomial of a root of unity μ and Q be the minimal polynomial of
μ ^ p, where p is a natural number that does not divide n. Then P divides expand ℤ p Q.
- Defined in
- Mathlib.RingTheory.RootsOfUnity.Minpoly
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 159 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- CommRingstatement and proof · cited by 17,173
- Polynomialstatement and proof · cited by 5,681
- Algebra.algebraMapproof · cited by 4,706
- AlgHomstatement · cited by 3,236
- IsDomainstatement and proof · cited by 2,196
- Polynomial.Xproof · cited by 1,639
- CharZerostatement and proof · cited by 932
- Polynomial.mapproof · cited by 806
- Polynomial.evalproof · cited by 796
- minpolystatement and proof · cited by 439
- IsPrimitiveRootstatement and proof · cited by 356
Cited by1
Results whose statement or proof uses this declaration.
- IsPrimitiveRoot.minpoly_dvd_pow_modproof · cited by 1