Theorems · Definition · group theory
orderOf
{G : Type u_1} → [Monoid G] → G → ℕorderOf x is the order of the element x, i.e. the n ≥ 1, s.t. x ^ n = 1 if it exists.
Otherwise, i.e. if x is of infinite order, then orderOf x is 0 by convention.
- Defined in
- Mathlib.GroupTheory.OrderOfElement
- Cited by
- 324 results in Mathlib
- Foundations
- Depth 19 from the axioms, rests on 186 definitions · uses propext, Classical.choice, Quot.sound
- Assumes
- Monoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Monoidstatement and proof · cited by 3,887
- Function.minimalPeriodproof · cited by 100
Cited by335
Results whose statement or proof uses this declaration.
- pow_orderOf_eq_onestatement and proof · cited by 30
- orderOf_dvd_of_pow_eq_onestatement · cited by 24
- orderOf_dvd_iff_pow_eq_onestatement and proof · cited by 22
- IsPrimitiveRoot.eq_orderOfstatement · cited by 18
- IsOfFinOrder.orderOf_posstatement · cited by 17
- orderOf_posstatement · cited by 15
- orderOf_onestatement · cited by 15
- orderOf_dvd_natCardstatement and proof · cited by 14
- Monoid.order_dvd_exponentstatement · cited by 14
- Equiv.Perm.IsCycle.orderOfstatement · cited by 14
- orderOf_eq_card_of_forall_mem_zpowersstatement · cited by 13
- Nat.card_zpowersstatement · cited by 13
Showing the 200 most cited of 335.