Loogle!
Result
Found 261 declarations mentioning orderOf. Of these, only the first 200 are shown.
- orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] (x : G) : β - orderOf_le_card π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} [Finite G] : orderOf x β€ Nat.card G - orderOf_le_card_univ π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} [Fintype G] : orderOf x β€ Fintype.card G - orderOf_dvd_natCard π Mathlib.GroupTheory.OrderOfElement
{G : Type u_6} [Group G] (x : G) : orderOf x β£ Nat.card G - Subsingleton.orderOf_eq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] [Subsingleton G] (x : G) : orderOf x = 1 - orderOf_dvd_card π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] [Fintype G] {x : G} : orderOf x β£ Fintype.card G - orderOf_eq_zero π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (h : Β¬IsOfFinOrder x) : orderOf x = 0 - orderOf_ne_zero_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} : orderOf x β 0 β IsOfFinOrder x - orderOf_pos π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] [Finite G] (x : G) : 0 < orderOf x - IsOfFinOrder.orderOf_pos π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (h : IsOfFinOrder x) : 0 < orderOf x - orderOf_eq_zero_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} : orderOf x = 0 β Β¬IsOfFinOrder x - orderOf_pos_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} : 0 < orderOf x β IsOfFinOrder x - orderOf_units π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {y : GΛ£} : orderOf βy = orderOf y - IsUnit.orderOf_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] [Subsingleton GΛ£] {x : G} (h : IsUnit x) : orderOf x = 1 - orderOf_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] : orderOf 1 = 1 - IsOfFinOrder.mono π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} {Ξ² : Type u_5} [Monoid G] {x : G} [Monoid Ξ²] {y : Ξ²} (hx : IsOfFinOrder x) (h : orderOf y β£ orderOf x) : IsOfFinOrder y - orderOf_fst_dvd_orderOf π Mathlib.GroupTheory.OrderOfElement
{Ξ± : Type u_4} {Ξ² : Type u_5} [Monoid Ξ±] [Monoid Ξ²] {x : Ξ± Γ Ξ²} : orderOf x.1 β£ orderOf x - orderOf_pow_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (n : β) : orderOf (x ^ n) β£ orderOf x - orderOf_snd_dvd_orderOf π Mathlib.GroupTheory.OrderOfElement
{Ξ± : Type u_4} {Ξ² : Type u_5} [Monoid Ξ±] [Monoid Ξ²] {x : Ξ± Γ Ξ²} : orderOf x.2 β£ orderOf x - orderOf_zero π Mathlib.GroupTheory.OrderOfElement
(Mβ : Type u_6) [MonoidWithZero Mβ] [Nontrivial Mβ] : orderOf 0 = 0 - pow_injOn_Iio_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} : Set.InjOn (fun x_1 => x ^ x_1) (Set.Iio (orderOf x)) - orderOf_apply_dvd_orderOf π Mathlib.GroupTheory.OrderOfElement
{ΞΉ : Type u_6} {Ξ± : ΞΉ β Type u_7} [(i : ΞΉ) β Monoid (Ξ± i)] {x : (i : ΞΉ) β Ξ± i} (i : ΞΉ) : orderOf (x i) β£ orderOf x - orderOf_eq_one_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} : orderOf x = 1 β x = 1 - IsMulTorsionFree.orderOf_le_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [CommGroup G] [IsMulTorsionFree G] (g : G) : orderOf g β€ 1 - orderOf_inv π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] (x : G) : orderOf xβ»ΒΉ = orderOf x - Prod.orderOf_mk π Mathlib.GroupTheory.OrderOfElement
{Ξ± : Type u_4} {Ξ² : Type u_5} [Monoid Ξ±] [Monoid Ξ²] {a : Ξ±} {b : Ξ²} : orderOf (a, b) = (orderOf a).lcm (orderOf b) - IsOfFinOrder.natCard_powers_le_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {a : G} (ha : IsOfFinOrder a) : Nat.card ββ(Submonoid.powers a) β€ orderOf a - Nat.Coprime.orderOf_pow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {y : G} {m : β} (h : (orderOf y).Coprime m) : orderOf (y ^ m) = orderOf y - pow_orderOf_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] (x : G) : x ^ orderOf x = 1 - LinearOrderedRing.orderOf_le_two π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Ring G] [LinearOrder G] [IsStrictOrderedRing G] {x : G} : orderOf x β€ 2 - Prod.orderOf π Mathlib.GroupTheory.OrderOfElement
{Ξ± : Type u_4} {Ξ² : Type u_5} [Monoid Ξ±] [Monoid Ξ²] (x : Ξ± Γ Ξ²) : orderOf x = (orderOf x.1).lcm (orderOf x.2) - orderOf_eq_zero_iff_eq_zero π Mathlib.GroupTheory.OrderOfElement
{Gβ : Type u_6} [GroupWithZero Gβ] [Finite Gβ] {a : Gβ} : orderOf a = 0 β a = 0 - addOrderOf_ofMul_eq_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] (x : G) : addOrderOf (Additive.ofMul x) = orderOf x - orderOf_ofAdd_eq_addOrderOf π Mathlib.GroupTheory.OrderOfElement
{Ξ± : Type u_6} [AddMonoid Ξ±] (a : Ξ±) : orderOf (Multiplicative.ofAdd a) = addOrderOf a - SemiconjBy.orderOf_eq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] (a : G) {x y : G} (h : SemiconjBy a x y) : orderOf x = orderOf y - finEquivPowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (hx : IsOfFinOrder x) : Fin (orderOf x) β β₯(Submonoid.powers x) - orderOf_dvd_of_pow_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (h : x ^ n = 1) : orderOf x β£ n - IsOfFinOrder.isSelfInv_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {a : G} (h : IsOfFinOrder a) : IsSelfInv a β orderOf a β€ 2 - isSelfInv_iff_isOfFinOrder_and_orderOf_le_two π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {a : G} : IsSelfInv a β IsOfFinOrder a β§ orderOf a β€ 2 - orderOf_dvd_iff_pow_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} : orderOf x β£ n β x ^ n = 1 - orderOf_dvd_of_mem_zpowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x y : G} (h : y β Subgroup.zpowers x) : orderOf y β£ orderOf x - Pi.orderOf π Mathlib.GroupTheory.OrderOfElement
{ΞΉ : Type u_6} {Ξ± : ΞΉ β Type u_7} [(i : ΞΉ) β Monoid (Ξ± i)] [Fintype ΞΉ] (x : (i : ΞΉ) β Ξ± i) : orderOf x = Finset.univ.lcm fun i => orderOf (x i) - finEquivZPowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} (hx : IsOfFinOrder x) : Fin (orderOf x) β β₯(Subgroup.zpowers x) - exists_pow_eq_self_of_coprime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (h : n.Coprime (orderOf x)) : β m, (x ^ n) ^ m = x - pow_eq_one_iff_modEq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} : x ^ n = 1 β n β‘ 0 [MOD orderOf x] - IsOfFinOrder.orderOf_pow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] (x : G) (n : β) (h : IsOfFinOrder x) : orderOf (x ^ n) = orderOf x / (orderOf x).gcd n - orderOf_piMulSingle π Mathlib.GroupTheory.OrderOfElement
{ΞΉ : Type u_6} [DecidableEq ΞΉ] {M : ΞΉ β Type u_7} [(i : ΞΉ) β Monoid (M i)] (i : ΞΉ) (g : M i) : orderOf (Pi.mulSingle i g) = orderOf g - pow_mod_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] (x : G) (n : β) : x ^ (n % orderOf x) = x ^ n - Commute.orderOf_dvd_lcm_mul π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} (h : Commute x y) : orderOf y β£ (orderOf x).lcm (orderOf (x * y)) - Commute.orderOf_mul_dvd_lcm π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} (h : Commute x y) : orderOf (x * y) β£ (orderOf x).lcm (orderOf y) - IsOfFinOrder.pow_eq_pow_iff_modEq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n m : β} (hx : IsOfFinOrder x) : x ^ n = x ^ m β n β‘ m [MOD orderOf x] - Nat.card_submonoidPowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] {a : G} : Nat.card β₯(Submonoid.powers a) = orderOf a - RightCancelMonoid.Nat.card_submonoidPowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [RightCancelMonoid G] {a : G} : Nat.card β₯(Submonoid.powers a) = orderOf a - orderOf_pow' π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] (x : G) {n : β} (h : n β 0) : orderOf (x ^ n) = orderOf x / (orderOf x).gcd n - pow_ne_one_of_lt_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (n0 : n β 0) (h : n < orderOf x) : x ^ n β 1 - Pi.orderOf_eq_sInf π Mathlib.GroupTheory.OrderOfElement
{ΞΉ : Type u_6} {Ξ± : ΞΉ β Type u_7} [(i : ΞΉ) β Monoid (Ξ± i)] (x : (i : ΞΉ) β Ξ± i) : orderOf x = sInf {n | n > 0 β§ β (i : ΞΉ), orderOf (x i) β£ n} - orderOf_le_of_pow_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (hn : 0 < n) (h : x ^ n = 1) : orderOf x β€ n - pow_eq_pow_iff_modEq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] {x : G} {m n : β} : x ^ n = x ^ m β n β‘ m [MOD orderOf x] - Fintype.card_zpowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] [Fintype G] {x : G} : Fintype.card β₯(Subgroup.zpowers x) = orderOf x - RightCancelMonoid.pow_eq_pow_iff_modEq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [RightCancelMonoid G] {x : G} {m n : β} : x ^ n = x ^ m β n β‘ m [MOD orderOf x] - orderOf_pow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] [Finite G] {n : β} (x : G) : orderOf (x ^ n) = orderOf x / (orderOf x).gcd n - orderOf_pow_of_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (hn : n β 0) (dvd : n β£ orderOf x) : orderOf (x ^ n) = orderOf x / n - Commute.orderOf_mul_dvd_mul_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} (h : Commute x y) : orderOf (x * y) β£ orderOf x * orderOf y - Subgroup.orderOf_dvd_natCard π Mathlib.GroupTheory.OrderOfElement
{G : Type u_6} [Group G] (s : Subgroup G) {x : G} (hx : x β s) : orderOf x β£ Nat.card β₯s - orderOf_dvd_iff_zpow_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} {i : β€} : β(orderOf x) β£ i β x ^ i = 1 - orderOf_eq_zero_iff' π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} : orderOf x = 0 β β (n : β), 0 < n β x ^ n β 1 - IsOfFinOrder.val_inv_unit π Mathlib.GroupTheory.OrderOfElement
{M : Type u_6} [Monoid M] {x : M} (hx : IsOfFinOrder x) : βhx.unitβ»ΒΉ = x ^ (orderOf x - 1) - orderOf_pow_orderOf_div π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (hx : orderOf x β 0) (hn : n β£ orderOf x) : orderOf (x ^ (orderOf x / n)) = n - zpow_eq_zpow_iff_modEq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} {m n : β€} : x ^ m = x ^ n β m β‘ n [ZMOD β(orderOf x)] - orderOf_pow_natAbs π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] (x : G) (n : β€) : orderOf (x ^ n.natAbs) = orderOf (x ^ n) - zpow_eq_one_iff_modEq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} {n : β€} : x ^ n = 1 β n β‘ 0 [ZMOD β(orderOf x)] - orderOf_eq_card_powers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] [Fintype G] {x : G} : orderOf x = Fintype.card β₯(Submonoid.powers x) - zpow_mod_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] (x : G) (z : β€) : x ^ (z % β(orderOf x)) = x ^ z - mem_zpowers_pow_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {g : G} {k : β} : g β Subgroup.zpowers (g ^ k) β k.gcd (orderOf g) = 1 - orderOf_eq_prime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] (hg : x ^ p = 1) (hg1 : x β 1) : orderOf x = p - orderOf_zpow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] [Finite G] (x : G) (n : β€) : orderOf (x ^ n) = orderOf x / (orderOf x).gcd n.natAbs - pow_inj_iff_of_orderOf_eq_zero π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] {x : G} (h : orderOf x = 0) {n m : β} : x ^ n = x ^ m β n = m - RightCancelMonoid.pow_inj_iff_of_orderOf_eq_zero π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [RightCancelMonoid G] {x : G} (h : orderOf x = 0) {n m : β} : x ^ n = x ^ m β n = m - mem_zpowers_zpow_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {g : G} {k : β€} : g β Subgroup.zpowers (g ^ k) β k.gcd β(orderOf g) = 1 - IsOfFinOrder.powers_eq_image_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} [DecidableEq G] (hx : IsOfFinOrder x) : β(Submonoid.powers x) = β(Finset.image (fun x_1 => x ^ x_1) (Finset.range (orderOf x))) - orderOf_eq_prime_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] : orderOf x = p β x ^ p = 1 β§ x β 1 - Commute.orderOf_mul_eq_mul_orderOf_of_coprime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} (h : Commute x y) (hco : (orderOf x).Coprime (orderOf y)) : orderOf (x * y) = orderOf x * orderOf y - zpow_pow_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} {i : β€} : (x ^ i) ^ orderOf x = 1 - orderOf_abs_ne_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Ring G] [LinearOrder G] [IsStrictOrderedRing G] {x : G} (h : |x| β 1) : orderOf x = 0 - orderOf_map_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {H : Type u_6} [Monoid H] (Ο : G β* H) (x : G) : orderOf (Ο x) β£ orderOf x - Subgroup.orderOf_le_card π Mathlib.GroupTheory.OrderOfElement
{G : Type u_6} [Group G] (s : Subgroup G) (hs : (βs).Finite) {x : G} (hx : x β s) : orderOf x β€ Nat.card β₯s - orderOf_dvd_sub_iff_zpow_eq_zpow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} {a b : β€} : β(orderOf x) β£ a - b β x ^ a = x ^ b - orderOf_zpow' π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] (x : G) {n : β€} (h : n β 0) : orderOf (x ^ n) = orderOf x / (orderOf x).gcd n.natAbs - IsOfFinOrder.pow_inj_mod π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (hx : IsOfFinOrder x) {n m : β} : x ^ n = x ^ m β n % orderOf x = m % orderOf x - zpowersEquivZPowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x y : G} [Finite G] (h : orderOf x = orderOf y) : β₯(Subgroup.zpowers x) β β₯(Subgroup.zpowers y) - image_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] [Fintype G] {x : G} [DecidableEq G] : Finset.image (fun i => x ^ i) (Finset.range (orderOf x)) = (β(Subgroup.zpowers x)).toFinset - mem_zpowers_iff_mem_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x y : G} [Finite G] [DecidableEq G] : y β Subgroup.zpowers x β y β Finset.image (fun x_1 => x ^ x_1) (Finset.range (orderOf x)) - pow_inj_mod π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] {x : G} {n m : β} : x ^ n = x ^ m β n % orderOf x = m % orderOf x - IsOfFinOrder.mem_powers_iff_mem_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} [DecidableEq G] (hx : IsOfFinOrder x) : y β Submonoid.powers x β y β Finset.image (fun x_1 => x ^ x_1) (Finset.range (orderOf x)) - RightCancelMonoid.pow_inj_mod π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [RightCancelMonoid G] {x : G} {n m : β} : x ^ n = x ^ m β n % orderOf x = m % orderOf x - Commute.orderOf_mul_eq_left_of_forall_prime_mul_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} (h : Commute x y) (hx : IsOfFinOrder x) (hdvd : β (p : β), Nat.Prime p β p β£ orderOf y β p * orderOf y β£ orderOf x) : orderOf (x * y) = orderOf x - Commute.orderOf_mul_eq_right_of_forall_prime_mul_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x y : G} (h : Commute x y) (hy : IsOfFinOrder y) (hdvd : β (p : β), Nat.Prime p β p β£ orderOf x β p * orderOf x β£ orderOf y) : orderOf (x * y) = orderOf y - exists_orderOf_eq_prime_pow_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {p : β} [hp : Fact (Nat.Prime p)] : (β k, orderOf x = p ^ k) β β m, x ^ p ^ m = 1 - orderOf_eq_orderOf_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {H : Type u_6} [Monoid H] {y : H} : orderOf x = orderOf y β β (n : β), x ^ n = 1 β y ^ n = 1 - IsOfFinOrder.mem_zpowers_iff_mem_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x y : G} [DecidableEq G] (hx : IsOfFinOrder x) : y β Subgroup.zpowers x β y β Finset.image (fun x_1 => x ^ x_1) (Finset.range (orderOf x)) - orderOf_neg_one π Mathlib.GroupTheory.OrderOfElement
{R : Type u_6} [Ring R] [Nontrivial R] : orderOf (-1) = if ringChar R = 2 then 1 else 2 - mem_powers_iff_mem_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] [Finite G] {x y : G} [DecidableEq G] : y β Submonoid.powers x β y β Finset.image (fun x_1 => x ^ x_1) (Finset.range (orderOf x)) - CharP.orderOf_eq_two_iff π Mathlib.GroupTheory.OrderOfElement
{R : Type u_6} [Ring R] [Nontrivial R] [NoZeroDivisors R] (p : β) (hp : p β 2) [CharP R p] {x : R} : orderOf x = 2 β x = -1 - orderOf_submonoid π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {H : Submonoid G} (y : β₯H) : orderOf βy = orderOf y - powersEquivPowers π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] [Finite G] {x y : G} (h : orderOf x = orderOf y) : β₯(Submonoid.powers x) β β₯(Submonoid.powers y) - orderOf_eq_of_pow_and_pow_div_prime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (hn : 0 < n) (hx : x ^ n = 1) (hd : β (p : β), Nat.Prime p β p β£ n β x ^ (n / p) β 1) : orderOf x = n - MulEquiv.orderOf_eq π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {H : Type u_6} [Monoid H] (e : G β* H) (x : G) : orderOf (e x) = orderOf x - orderOf_eq_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n : β} (h : 0 < n) : orderOf x = n β x ^ n = 1 β§ β m < n, 0 < m β x ^ m β 1 - orderOf_injective π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {H : Type u_6} [Monoid H] (f : G β* H) (hf : Function.Injective βf) (x : G) : orderOf (f x) = orderOf x - sum_card_orderOf_eq_card_pow_eq_one π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {n : β} [Fintype G] [DecidableEq G] (hn : n β 0) : β m β n.divisors, {x | orderOf x = m}.card = {x | x ^ n = 1}.card - Subgroup.orderOf_mk π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {H : Subgroup G} (a : G) (ha : a β H) : orderOf β¨a, haβ© = orderOf a - Subgroup.orderOf_coe π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {H : Subgroup G} (a : β₯H) : orderOf βa = orderOf a - Submonoid.orderOf_le_card π Mathlib.GroupTheory.OrderOfElement
{G : Type u_6} [Group G] (s : Submonoid G) (hs : (βs).Finite) {x : G} (hx : x β s) : orderOf x β€ Nat.card β₯s - orderOf_eq_prime_pow π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} {n p : β} [hp : Fact (Nat.Prime p)] (hnot : Β¬x ^ p ^ n = 1) (hfin : x ^ p ^ (n + 1) = 1) : orderOf x = p ^ (n + 1) - pow_finEquivZPowers_symm_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} (hx : IsOfFinOrder x) (a : β₯(Subgroup.zpowers x)) : x ^ β((finEquivZPowers hx).symm a) = βa - finEquivPowers_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (hx : IsOfFinOrder x) {n : Fin (orderOf x)} : (finEquivPowers hx) n = β¨x ^ βn, β―β© - finEquivZPowers_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} (hx : IsOfFinOrder x) {n : Fin (orderOf x)} : (finEquivZPowers hx) n = β¨x ^ βn, β―β© - finEquivPowers_symm_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Monoid G] {x : G} (hx : IsOfFinOrder x) (n : β) : (finEquivPowers hx).symm β¨x ^ n, β―β© = β¨n % orderOf x, β―β© - finEquivZPowers_symm_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} (hx : IsOfFinOrder x) (n : β) : (finEquivZPowers hx).symm β¨x ^ n, β―β© = β¨n % orderOf x, β―β© - zpowersEquivZPowers_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x y : G} [Finite G] (h : orderOf x = orderOf y) (n : β) : (zpowersEquivZPowers h) β¨x ^ n, β―β© = β¨y ^ n, β―β© - powersEquivPowers_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [LeftCancelMonoid G] [Finite G] {x y : G} (h : orderOf x = orderOf y) (n : β) : (powersEquivPowers h) β¨x ^ n, β―β© = β¨y ^ n, β―β© - Nat.card_zpowers π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} [Group Ξ±] (a : Ξ±) : Nat.card β₯(Subgroup.zpowers a) = orderOf a - isCyclic_of_orderOf_eq_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] [Finite Ξ±] (x : Ξ±) (hx : orderOf x = Nat.card Ξ±) : IsCyclic Ξ± - IsCyclic.exists_ofOrder_eq_natCard π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] [h : IsCyclic Ξ±] : β g, orderOf g = Nat.card Ξ± - isCyclic_of_card_le_orderOf π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] [Finite Ξ±] (x : Ξ±) (hx : Nat.card Ξ± β€ orderOf x) : IsCyclic Ξ± - isCyclic_iff_exists_orderOf_eq_natCard π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] [Finite Ξ±] : IsCyclic Ξ± β β g, orderOf g = Nat.card Ξ± - isCyclic_iff_exists_natCard_le_orderOf π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] [Finite Ξ±] : IsCyclic Ξ± β β g, Nat.card Ξ± β€ orderOf g - orderOf_eq_card_of_zpowers_eq_top π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [Group G] {g : G} (h : Subgroup.zpowers g = β€) : orderOf g = Nat.card G - orderOf_eq_card_of_forall_mem_zpowers π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] {g : Ξ±} (hx : β (x : Ξ±), x β Subgroup.zpowers g) : orderOf g = Nat.card Ξ± - Infinite.orderOf_eq_zero_of_forall_mem_zpowers π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] [Infinite Ξ±] {g : Ξ±} (h : β (x : Ξ±), x β Subgroup.zpowers g) : orderOf g = 0 - orderOf_eq_card_of_forall_mem_powers π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [Group Ξ±] {g : Ξ±} (hx : β (x : Ξ±), x β Submonoid.powers g) : orderOf g = Nat.card Ξ± - IsCyclic.image_range_orderOf π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} {a : Ξ±} [Group Ξ±] [Fintype Ξ±] [DecidableEq Ξ±] (ha : β (x : Ξ±), x β Subgroup.zpowers a) : Finset.image (fun i => a ^ i) (Finset.range (orderOf a)) = Finset.univ - Equiv.Perm.support_pow_coprime π Mathlib.GroupTheory.Perm.Finite
{Ξ± : Type u} [DecidableEq Ξ±] [Fintype Ξ±] {Ο : Equiv.Perm Ξ±} {n : β} (h : n.Coprime (orderOf Ο)) : (Ο ^ n).support = Ο.support - Equiv.Perm.Disjoint.orderOf π Mathlib.GroupTheory.Perm.Finite
{Ξ± : Type u} {Ο Ο : Equiv.Perm Ξ±} (hΟΟ : Ο.Disjoint Ο) : orderOf (Ο * Ο) = (orderOf Ο).lcm (orderOf Ο) - Equiv.Perm.IsCycle.orderOf π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ± : Type u_2} {f : Equiv.Perm Ξ±} [DecidableEq Ξ±] [Fintype Ξ±] (hf : f.IsCycle) : orderOf f = f.support.card - Equiv.Perm.IsCycle.pow_iff π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ² : Type u_3} [Finite Ξ²] {f : Equiv.Perm Ξ²} (hf : f.IsCycle) {n : β} : (f ^ n).IsCycle β n.Coprime (orderOf f) - Equiv.Perm.IsCycle.support_pow_eq_iff π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ± : Type u_2} {f : Equiv.Perm Ξ±} [DecidableEq Ξ±] [Fintype Ξ±] (hf : f.IsCycle) {n : β} : (f ^ n).support = f.support β Β¬orderOf f β£ n - Equiv.Perm.IsCycle.support_pow_of_pos_of_lt_orderOf π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ± : Type u_2} {f : Equiv.Perm Ξ±} [DecidableEq Ξ±] [Fintype Ξ±] (hf : f.IsCycle) {n : β} (npos : 0 < n) (hn : n < orderOf f) : (f ^ n).support = f.support - Equiv.Perm.IsCycle.isCycle_pow_pos_of_lt_prime_order π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ² : Type u_3} [Finite Ξ²] {f : Equiv.Perm Ξ²} (hf : f.IsCycle) (hf' : Nat.Prime (orderOf f)) (n : β) (hn : 0 < n) (hn' : n < orderOf f) : (f ^ n).IsCycle - Equiv.Perm.SameCycle.exists_pow_eq' π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ± : Type u_2} {f : Equiv.Perm Ξ±} {x y : Ξ±} [Finite Ξ±] : f.SameCycle x y β β i < orderOf f, (f ^ i) x = y - Equiv.Perm.SameCycle.exists_pow_eq'' π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ± : Type u_2} {f : Equiv.Perm Ξ±} {x y : Ξ±} [Finite Ξ±] (h : f.SameCycle x y) : β i, 0 < i β§ i β€ orderOf f β§ (f ^ i) x = y - Equiv.Perm.SameCycle.exists_fin_pow_eq π Mathlib.GroupTheory.Perm.Cycle.Basic
{Ξ± : Type u_2} {f : Equiv.Perm Ξ±} {x y : Ξ±} [Finite Ξ±] (h : f.SameCycle x y) : β i, (f ^ βi) x = y - Equiv.Perm.pow_mod_orderOf_cycleOf_apply π Mathlib.GroupTheory.Perm.Cycle.Factors
{Ξ± : Type u_1} (f : Equiv.Perm Ξ±) [DecidableRel f.SameCycle] (n : β) (x : Ξ±) : (f ^ (n % orderOf (f.cycleOf x))) x = (f ^ n) x - exists_prime_orderOf_dvd_card' π Mathlib.GroupTheory.Perm.Cycle.Type
{G : Type u_3} [Group G] [Finite G] (p : β) [hp : Fact (Nat.Prime p)] (hdvd : p β£ Nat.card G) : β x, orderOf x = p - Equiv.Perm.isCycle_of_prime_order'' π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] {Ο : Equiv.Perm Ξ±} (h1 : Nat.Prime (Fintype.card Ξ±)) (h2 : orderOf Ο = Fintype.card Ξ±) : Ο.IsCycle - exists_prime_orderOf_dvd_card π Mathlib.GroupTheory.Perm.Cycle.Type
{G : Type u_3} [Group G] [Fintype G] (p : β) [hp : Fact (Nat.Prime p)] (hdvd : p β£ Fintype.card G) : β x, orderOf x = p - Equiv.Perm.IsSwap.orderOf π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [DecidableEq Ξ±] [Finite Ξ±] {Ο : Equiv.Perm Ξ±} (h : Ο.IsSwap) : orderOf Ο = 2 - Equiv.Perm.IsThreeCycle.orderOf π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {g : Equiv.Perm Ξ±} (ht : g.IsThreeCycle) : orderOf g = 3 - Equiv.Perm.lcm_cycleType π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] (Ο : Equiv.Perm Ξ±) : Ο.cycleType.lcm = orderOf Ο - Equiv.Perm.dvd_of_mem_cycleType π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {Ο : Equiv.Perm Ξ±} {n : β} (h : n β Ο.cycleType) : n β£ orderOf Ο - Equiv.Perm.orderOf_cycleOf_dvd_orderOf π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] (f : Equiv.Perm Ξ±) (x : Ξ±) : orderOf (f.cycleOf x) β£ orderOf f - Equiv.Perm.isCycle_of_prime_order' π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] {Ο : Equiv.Perm Ξ±} (h1 : Nat.Prime (orderOf Ο)) (h2 : Fintype.card Ξ± < 2 * orderOf Ο) : Ο.IsCycle - Equiv.Perm.isCycle_of_prime_order π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {Ο : Equiv.Perm Ξ±} (h1 : Nat.Prime (orderOf Ο)) (h2 : Ο.support.card < 2 * orderOf Ο) : Ο.IsCycle - Equiv.Perm.cycleType_prime_order π Mathlib.GroupTheory.Perm.Cycle.Type
{Ξ± : Type u_1} [Fintype Ξ±] [DecidableEq Ξ±] {Ο : Equiv.Perm Ξ±} (hΟ : Nat.Prime (orderOf Ο)) : β n, Ο.cycleType = Multiset.replicate (n + 1) (orderOf Ο) - Monoid.order_dvd_exponent π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] (g : G) : orderOf g β£ Monoid.exponent G - Monoid.orderOf_le_exponent π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] (h : Monoid.ExponentExists G) (g : G) : orderOf g β€ Monoid.exponent G - Monoid.ExponentExists.orderOf_pos π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] (h : Monoid.ExponentExists G) (g : G) : 0 < orderOf g - Monoid.exponent_dvd π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] {n : β} : Monoid.exponent G β£ n β β (g : G), orderOf g β£ n - Monoid.exists_orderOf_eq_exponent π Mathlib.GroupTheory.Exponent
{G : Type u} [CommMonoid G] (hG : Monoid.ExponentExists G) : β g, orderOf g = Monoid.exponent G - Monoid.lcm_orderOf_eq_exponent π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] [Fintype G] : Finset.univ.lcm orderOf = Monoid.exponent G - Monoid.exponent_eq_zero_of_order_zero π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] {g : G} (hg : orderOf g = 0) : Monoid.exponent G = 0 - Monoid.lcm_orderOf_dvd_exponent π Mathlib.GroupTheory.Exponent
(G : Type u) [Monoid G] [Fintype G] : Finset.univ.lcm orderOf β£ Monoid.exponent G - inv_eq_self_of_orderOf_eq_two π Mathlib.GroupTheory.Exponent
{G : Type u} [Group G] {x : G} (hx : orderOf x = 2) : xβ»ΒΉ = x - Monoid.exponent_eq_zero_iff_range_orderOf_infinite π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] (h : β (g : G), 0 < orderOf g) : Monoid.exponent G = 0 β (Set.range orderOf).Infinite - Monoid.exponent_ne_zero_iff_range_orderOf_finite π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] (h : β (g : G), 0 < orderOf g) : Monoid.exponent G β 0 β (Set.range orderOf).Finite - Monoid.exponent_eq_iSup_orderOf π Mathlib.GroupTheory.Exponent
{G : Type u} [CommMonoid G] (h : β (g : G), 0 < orderOf g) : Monoid.exponent G = β¨ g, orderOf g - Commute.of_orderOf_dvd_two π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] [IsCancelMul G] (h : β (g : G), orderOf g β£ 2) (a b : G) : Commute a b - Monoid.exponent_eq_prime_iff π Mathlib.GroupTheory.Exponent
{G : Type u_1} [Monoid G] [Nontrivial G] {p : β} (hp : Nat.Prime p) : Monoid.exponent G = p β β (g : G), g β 1 β orderOf g = p - orderOf_eq_two_iff π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] (hG : Monoid.exponent G = 2) {x : G} : orderOf x = 2 β x β 1 - Nat.Prime.exists_orderOf_eq_pow_factorization_exponent π Mathlib.GroupTheory.Exponent
(G : Type u) [Monoid G] {p : β} (hp : Nat.Prime p) : β g, orderOf g = p ^ (Monoid.exponent G).factorization p - Monoid.exponent_eq_iSup_orderOf' π Mathlib.GroupTheory.Exponent
{G : Type u} [CommMonoid G] : Monoid.exponent G = if β g, orderOf g = 0 then 0 else β¨ g, orderOf g - Monoid.exponent_eq_max'_orderOf π Mathlib.GroupTheory.Exponent
{G : Type u} [CancelCommMonoid G] [Fintype G] : Monoid.exponent G = (Finset.image orderOf Finset.univ).max' β― - Commute.exists_orderOf_eq_lcm π Mathlib.GroupTheory.Exponent
(G : Type u) [Monoid G] {x y : G} (h : Commute x y) : β z β Submonoid.closure {x, y}, orderOf z = (orderOf x).lcm (orderOf y) - mul_notMem_of_orderOf_eq_two π Mathlib.GroupTheory.Exponent
{G : Type u} [Group G] {x y : G} (hx : orderOf x = 2) (hy : orderOf y = 2) (hxy : x β y) : x * y β {x, y, 1} - Commute.orderOf_mul_pow_eq_lcm π Mathlib.GroupTheory.Exponent
{G : Type u} [Monoid G] {x y : G} (h : Commute x y) (hx : orderOf x β 0) (hy : orderOf y β 0) : orderOf (x ^ (orderOf x / (orderOf x).factorizationLCMLeft (orderOf y)) * y ^ (orderOf y / (orderOf x).factorizationLCMRight (orderOf y))) = (orderOf x).lcm (orderOf y) - Subgroup.relIndex_zpowers_zpow π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} [Group G] (g : G) (i : β€) : (Subgroup.zpowers (g ^ i)).relIndex (Subgroup.zpowers g) = i.gcd β(orderOf g) - IsCyclic.card_orderOf_eq_totient π Mathlib.GroupTheory.SpecificGroups.Cyclic
{Ξ± : Type u_1} [Group Ξ±] [IsCyclic Ξ±] [Fintype Ξ±] {d : β} (hd : d β£ Fintype.card Ξ±) : {a | orderOf a = d}.card = d.totient - Subgroup.index_zpowers_zpow π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} [Group G] {g : G} (hg : Subgroup.zpowers g = β€) (i : β€) : (Subgroup.zpowers (g ^ i)).index = i.gcd β(orderOf g) - monoidHomOfForallMemZpowers π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} [Group G] [Group G'] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) {g' : G'} (hg' : orderOf g' β£ orderOf g) : G β* G' - Subgroup.zpowers_eq_zpowers_iff' π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} [Group G] (g : G) (i j : β€) : Subgroup.zpowers (g ^ i) = Subgroup.zpowers (g ^ j) β i.gcd β(orderOf g) = j.gcd β(orderOf g) - Subgroup.relIndex_zpowers_zpow_zpow π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} [Group G] (g : G) (i j : β€) : (Subgroup.zpowers (g ^ i)).relIndex (Subgroup.zpowers (g ^ j)) * (i.gcd j).gcd (orderOf g) = i.gcd β(orderOf g) - mulEquivOfOrderOfEq π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} [Group G] [Group G'] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) {g' : G'} (hg' : β (x : G'), x β Subgroup.zpowers g') (h : orderOf g = orderOf g') : G β* G' - Subgroup.zpowers_le_zpowers_iff π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} [Group G] (g : G) (i j : β€) : Subgroup.zpowers (g ^ i) β€ Subgroup.zpowers (g ^ j) β j.gcd β(orderOf g) β£ i.gcd β(orderOf g) - monoidHomOfForallMemZpowers_apply_gen π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} [Group G] [Group G'] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) {g' : G'} (hg' : orderOf g' β£ orderOf g) : (monoidHomOfForallMemZpowers hg hg') g = g' - card_orderOf_eq_totient_auxβ π Mathlib.GroupTheory.SpecificGroups.Cyclic
{Ξ± : Type u_1} [Group Ξ±] [DecidableEq Ξ±] [Fintype Ξ±] (hn : β (n : β), 0 < n β {a | a ^ n = 1}.card β€ n) {d : β} (hd : d β£ Fintype.card Ξ±) : {a | orderOf a = d}.card = d.totient - mulEquivOfOrderOfEq_symm π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} [Group G] [Group G'] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) {g' : G'} (hg' : β (x : G'), x β Subgroup.zpowers g') (h : orderOf g = orderOf g') : (mulEquivOfOrderOfEq hg hg' h).symm = mulEquivOfOrderOfEq hg' hg β― - mulEquivOfOrderOfEq_apply_gen π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} [Group G] [Group G'] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) {g' : G'} (hg' : β (x : G'), x β Subgroup.zpowers g') (h : orderOf g = orderOf g') : (mulEquivOfOrderOfEq hg hg' h) g = g' - mulEquivOfOrderOfEq_symm_apply_gen π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} {G' : Type u_3} [Group G] [Group G'] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) {g' : G'} (hg' : β (x : G'), x β Subgroup.zpowers g') (h : orderOf g = orderOf g') : (mulEquivOfOrderOfEq hg hg' h).symm g' = g - zpowersHom_ker_eq π Mathlib.GroupTheory.SpecificGroups.Cyclic
{G : Type u_2} [Group G] (g : G) : ((zpowersHom G) g).ker = Subgroup.zpowers (Multiplicative.ofAdd β(orderOf g)) - IsPGroup.orderOf_coprime π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) {n : β} (hn : p.Coprime n) (g : G) : (orderOf g).Coprime n - IsPGroup.exists_orderOf_dvd_pow π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] : IsPGroup p G β β (g : G), β k, orderOf g β£ p ^ k - isPGroup_iff_orderOf_dvd_pow π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] : IsPGroup p G β β (g : G), β k, orderOf g β£ p ^ k - IsPGroup.exists_orderOf_eq_pow π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Fact (Nat.Prime p)] : IsPGroup p G β β (g : G), β k, orderOf g = p ^ k - isPGroup_iff_exists_orderOf_dvd_pow π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Finite G] : IsPGroup p G β β k, β (g : G), orderOf g β£ p ^ k - IsPGroup.iff_orderOf π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Fact (Nat.Prime p)] : IsPGroup p G β β (g : G), β k, orderOf g = p ^ k - IsPGroup.dvd_orderOf π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] [Fact (Nat.Prime p)] (hG : IsPGroup p G) {g : G} (hg : g β 1) : p β£ orderOf g - IsPGroup.powEquiv_symm_apply π Mathlib.GroupTheory.PGroup
{p : β} {G : Type u_1} [Group G] (hG : IsPGroup p G) {n : β} (hn : p.Coprime n) (g : G) : (hG.powEquiv hn).symm g = g ^ (orderOf g).gcdB n - Group.card_dvd_prod_orderOf π Mathlib.GroupTheory.Sylow
(G : Type u) [Group G] [Fintype G] : Nat.card G β£ β g, orderOf g - IsMulTorsion.exponentExists π Mathlib.GroupTheory.Torsion
{G : Type u_1} [Group G] (tG : IsMulTorsion G) (bounded : (Set.range fun g => orderOf g).Finite) : Monoid.ExponentExists G - IsTorsion.exponentExists π Mathlib.GroupTheory.Torsion
{G : Type u_1} [Group G] (tG : IsMulTorsion G) (bounded : (Set.range fun g => orderOf g).Finite) : Monoid.ExponentExists G
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 69fae59