Theorems · Theorem · number theory
IsPrimitiveRoot.exists_neg_pow_of_isOfFinOrder
∀ {n : ℕ} [NeZero n] {K : Type u} [inst : Field K] [inst_1 : NumberField K] [IsCyclotomicExtension {n} ℚ K],
Odd n → ∀ {ζ x : K}, IsPrimitiveRoot ζ n → IsOfFinOrder x → ∃ r, x = (-ζ) ^ rIf x is a root of unity (spelled as IsOfFinOrder x) in an n-th cyclotomic extension of
ℚ, where n is odd, and ζ is a primitive n-th root of unity, then there exist r
such that x = (-ζ)^r.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 215 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites28
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Fieldstatement and proof · cited by 7,404
- CommMonoidproof · cited by 2,264
- NumberFieldstatement and proof · cited by 653
- one_powproof · cited by 521
- Oddstatement and proof · cited by 364
- IsPrimitiveRootstatement and proof · cited by 356
- orderOfproof · cited by 324
- IsCyclotomicExtensionstatement and proof · cited by 220
- pow_mulproof · cited by 210
- Polynomial.IsRootproof · cited by 152
- Nat.divisorsproof · cited by 137
Cited by1
Results whose statement or proof uses this declaration.
- IsPrimitiveRoot.exists_pow_or_neg_mul_pow_of_isOfFinOrderproof · cited by 1