Loogle!
Result
Found 525 declarations mentioning AddSubgroup.zmultiples. Of these, only the first 200 are shown.
- AddSubgroup.zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) : AddSubgroup G - Int.zmultiples_natAbs π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
(a : β€) : AddSubgroup.zmultiples βa.natAbs = AddSubgroup.zmultiples a - Int.zmultiples_one π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
: AddSubgroup.zmultiples 1 = β€ - AddSubgroup.mem_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) : g β AddSubgroup.zmultiples g - AddSubgroup.zmultiples_eq_closure π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) : AddSubgroup.zmultiples g = AddSubgroup.closure {g} - AddSubgroup.decidableMemZMultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {a : G} : DecidablePred fun x => x β AddSubgroup.zmultiples a - Int.mem_zmultiples_iff π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{a b : β€} : b β AddSubgroup.zmultiples a β a β£ b - AddSubgroup.zmultiples_neg π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {g : G} : AddSubgroup.zmultiples (-g) = AddSubgroup.zmultiples g - AddSubgroup.zmultiples_zero_eq_bot π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] : AddSubgroup.zmultiples 0 = β₯ - Int.zmultiples_le_zmultiples_iff π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{a b : β€} : AddSubgroup.zmultiples a β€ AddSubgroup.zmultiples b β b β£ a - AddSubgroup.zmultiples_isAddCommutative π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) : IsAddCommutative β₯(AddSubgroup.zmultiples g) - AddSubgroup.zmultiples_eq_bot π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {g : G} : AddSubgroup.zmultiples g = β₯ β g = 0 - AddSubgroup.zmultiples_ne_bot π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {g : G} : AddSubgroup.zmultiples g β β₯ β g β 0 - AddSubgroup.zsmul_mem_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) (k : β€) : k β’ g β AddSubgroup.zmultiples g - AddSubgroup.coe_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) : β(AddSubgroup.zmultiples g) = Set.range fun x => x β’ g - AddSubgroup.nsmul_mem_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) (k : β) : k β’ g β AddSubgroup.zmultiples g - AddSubgroup.zmultiples_le_of_mem π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {g : G} {H : AddSubgroup G} : g β H β AddSubgroup.zmultiples g β€ H - AddSubgroup.zmultiples_le π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {g : G} {H : AddSubgroup G} : AddSubgroup.zmultiples g β€ H β g β H - AddSubgroup.forall_mem_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {x : G} {p : G β Prop} : (β g β AddSubgroup.zmultiples x, p g) β β (m : β€), p (m β’ x) - AddSubgroup.mem_zmultiples_iff π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {g h : G} : h β AddSubgroup.zmultiples g β β k, k β’ g = h - AddSubgroup.exists_mem_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {x : G} {p : G β Prop} : (β g β AddSubgroup.zmultiples x, p g) β β m, p (m β’ x) - AddSubgroup.zmultiples_add_le_sup π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g h : G) : AddSubgroup.zmultiples (g + h) β€ AddSubgroup.zmultiples g β AddSubgroup.zmultiples h - ofAdd_image_zmultiples_eq_zpowers_ofAdd π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{A : Type u_2} [AddGroup A] {x : A} : βMultiplicative.ofAdd '' β(AddSubgroup.zmultiples x) = β(Subgroup.zpowers (Multiplicative.ofAdd x)) - ofMul_image_zpowers_eq_zmultiples_ofMul π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [Group G] {x : G} : βAdditive.ofMul '' β(Subgroup.zpowers x) = β(AddSubgroup.zmultiples (Additive.ofMul x)) - AddMonoidHom.map_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {N : Type u_3} [AddGroup N] (f : G β+ N) (x : G) : AddSubgroup.map f (AddSubgroup.zmultiples x) = AddSubgroup.zmultiples (f x) - AddSubgroup.forall_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {x : G} {p : β₯(AddSubgroup.zmultiples x) β Prop} : (β (g : β₯(AddSubgroup.zmultiples x)), p g) β β (m : β€), p β¨m β’ x, β―β© - AddSubgroup.exists_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] {x : G} {p : β₯(AddSubgroup.zmultiples x) β Prop} : (β g, p g) β β m, p β¨m β’ x, β―β© - AddSubmonoid.multiples_le_zmultiples π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (g : G) : AddSubmonoid.multiples g β€ (AddSubgroup.zmultiples g).toAddSubmonoid - AddSubgroup.toAddSubmonoid_zmultiples π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (g : G) : (AddSubgroup.zmultiples g).toAddSubmonoid = AddSubmonoid.multiples g β AddSubmonoid.multiples (-g) - Ideal.span_singleton_toAddSubgroup_eq_zmultiples π Mathlib.RingTheory.Ideal.Operations
(a : β€) : Submodule.toAddSubgroup (Ideal.span {a}) = AddSubgroup.zmultiples a - Submodule.span_singleton_toAddSubgroup_eq_zmultiples π Mathlib.RingTheory.Ideal.Operations
{M : Type u_1} [AddCommGroup M] (a : M) : (β€ β a).toAddSubgroup = AddSubgroup.zmultiples a - IsOfFinAddOrder.of_mem_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} (h : IsOfFinAddOrder x) (h' : y β AddSubgroup.zmultiples x) : IsOfFinAddOrder y - addOrderOf_dvd_of_mem_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} (h : y β AddSubgroup.zmultiples x) : addOrderOf y β£ addOrderOf x - finEquivZMultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x : G} (hx : IsOfFinAddOrder x) : Fin (addOrderOf x) β β₯(AddSubgroup.zmultiples x) - AddSubgroup.zmultiples_eq_zmultiples_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} (hx : Β¬IsOfFinAddOrder x) : AddSubgroup.zmultiples x = AddSubgroup.zmultiples y β x = y β¨ -x = y - multiples_eq_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] [Finite G] (x : G) : β(AddSubmonoid.multiples x) = β(AddSubgroup.zmultiples x) - zmultiples_abs π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] (g : G) : AddSubgroup.zmultiples |g| = AddSubgroup.zmultiples g - Fintype.card_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] [Fintype G] {x : G} : Fintype.card β₯(AddSubgroup.zmultiples x) = addOrderOf x - IsOfFinAddOrder.multiples_eq_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x : G} (hx : IsOfFinAddOrder x) : β(AddSubmonoid.multiples x) = β(AddSubgroup.zmultiples x) - mem_zmultiples_nsmul_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {g : G} {k : β} : g β AddSubgroup.zmultiples (k β’ g) β k.gcd (addOrderOf g) = 1 - mem_zmultiples_zsmul_iff π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {g : G} {k : β€} : g β AddSubgroup.zmultiples (k β’ g) β k.gcd β(addOrderOf g) = 1 - mem_multiples_iff_mem_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} [Finite G] : y β AddSubmonoid.multiples x β y β AddSubgroup.zmultiples x - zmultiplesEquivZMultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} [Finite G] (h : addOrderOf x = addOrderOf y) : β₯(AddSubgroup.zmultiples x) β β₯(AddSubgroup.zmultiples y) - image_range_addOrderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] [Fintype G] {x : G} [DecidableEq G] : Finset.image (fun i => i β’ x) (Finset.range (addOrderOf x)) = (β(AddSubgroup.zmultiples x)).toFinset - mem_zmultiples_iff_mem_range_addOrderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} [Finite G] [DecidableEq G] : y β AddSubgroup.zmultiples x β y β Finset.image (fun x_1 => x_1 β’ x) (Finset.range (addOrderOf x)) - IsOfFinAddOrder.mem_multiples_iff_mem_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} (hx : IsOfFinAddOrder x) : y β AddSubmonoid.multiples x β y β AddSubgroup.zmultiples x - IsOfFinAddOrder.mem_zmultiples_iff_mem_range_addOrderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} [DecidableEq G] (hx : IsOfFinAddOrder x) : y β AddSubgroup.zmultiples x β y β Finset.image (fun x_1 => x_1 β’ x) (Finset.range (addOrderOf x)) - card_zmultiples_le π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] [Fintype G] (a : G) {k : β} (k_pos : k β 0) (ha : k β’ a = 0) : Fintype.card β₯(AddSubgroup.zmultiples a) β€ k - vadd_eq_self_of_mem_zmultiples π Mathlib.GroupTheory.OrderOfElement
{G : Type u_6} [AddGroup G] {x y : G} {Ξ± : Type u_7} [AddAction G Ξ±] (hx : x β AddSubgroup.zmultiples y) {a : Ξ±} (hs : y +α΅₯ a = a) : x +α΅₯ a = a - nsmul_finEquivZMultiples_symm_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x : G} (hx : IsOfFinAddOrder x) (a : β₯(AddSubgroup.zmultiples x)) : β((finEquivZMultiples hx).symm a) β’ x = βa - finEquivZMultiples_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x : G} (hx : IsOfFinAddOrder x) {n : Fin (addOrderOf x)} : (finEquivZMultiples hx) n = β¨βn β’ x, β―β© - finEquivZMultiples_symm_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x : G} (hx : IsOfFinAddOrder x) (n : β) : (finEquivZMultiples hx).symm β¨n β’ x, β―β© = β¨n % addOrderOf x, β―β© - zmultiples_equiv_zmultiples_apply π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {x y : G} [Finite G] (h : addOrderOf x = addOrderOf y) (n : β) : (zmultiplesEquivZMultiples h) β¨n β’ x, β―β© = β¨n β’ y, β―β© - ZMod.ker_intCastAddHom π Mathlib.Data.ZMod.Basic
(n : β) : (Int.castAddHom (ZMod n)).ker = AddSubgroup.zmultiples βn - Int.range_nsmulAddMonoidHom π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(n : β) : (nsmulAddMonoidHom n).range = AddSubgroup.zmultiples βn - AddSubgroup.instCountableSubtypeMemZMultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{G : Type u_1} [AddGroup G] (a : G) : Countable β₯(AddSubgroup.zmultiples a) - Int.zmultiples_inf π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(a b : β€) : AddSubgroup.zmultiples a β AddSubgroup.zmultiples b = AddSubgroup.zmultiples β(a.lcm b) - Int.closure_eq_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(a b : β€) : AddSubgroup.closure {a, b} = AddSubgroup.zmultiples β(a.gcd b) - Int.closure_eq_zmultiples_finsetGcd π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(s : Finset β€) : AddSubgroup.closure βs = AddSubgroup.zmultiples (s.gcd id) - Int.range_castAddHom π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{A : Type u_4} [AddGroupWithOne A] : (Int.castAddHom A).range = AddSubgroup.zmultiples 1 - Int.zmultiples_sup π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(a b : β€) : AddSubgroup.zmultiples a β AddSubgroup.zmultiples b = AddSubgroup.zmultiples β(a.gcd b) - AddSubgroup.intCast_mem_zmultiples_one π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{R : Type u_4} [Ring R] (k : β€) : βk β AddSubgroup.zmultiples 1 - AddSubgroup.intCast_mul_mem_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{R : Type u_4} [Ring R] (r : R) (k : β€) : βk * r β AddSubgroup.zmultiples r - AddSubgroup.finsetSup_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{G : Type u_1} [AddGroup G] (s : Finset G) : s.sup AddSubgroup.zmultiples = AddSubgroup.closure βs - Int.finsetInf_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(s : Finset β€) : s.inf AddSubgroup.zmultiples = AddSubgroup.zmultiples (s.lcm id) - Int.finsetSup_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(s : Finset β€) : s.sup AddSubgroup.zmultiples = AddSubgroup.zmultiples (s.gcd id) - AddSubgroup.range_zmultiplesHom π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{A : Type u_2} [AddGroup A] (a : A) : ((zmultiplesHom A) a).range = AddSubgroup.zmultiples a - Int.index_zmultiples π Mathlib.Data.ZMod.QuotientGroup
(a : β€) : (AddSubgroup.zmultiples a).index = a.natAbs - IsOfFinAddOrder.finite_zmultiples π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} [AddGroup Ξ±] {a : Ξ±} : IsOfFinAddOrder a β (β(AddSubgroup.zmultiples a)).Finite - finite_zmultiples π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} [AddGroup Ξ±] {a : Ξ±} : (β(AddSubgroup.zmultiples a)).Finite β IsOfFinAddOrder a - infinite_zmultiples π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} [AddGroup Ξ±] {a : Ξ±} : (β(AddSubgroup.zmultiples a)).Infinite β Β¬IsOfFinAddOrder a - Int.relIndex_zmultiples_mul π Mathlib.Data.ZMod.QuotientGroup
(a b : β) : (AddSubgroup.zmultiples βa).relIndex (AddSubgroup.zmultiples βb) * a.gcd b = a - Nat.card_zmultiples π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} [AddGroup Ξ±] (a : Ξ±) : Nat.card β₯(AddSubgroup.zmultiples a) = addOrderOf a - Int.quotientZMultiplesEquivZMod π Mathlib.Data.ZMod.QuotientGroup
(a : β€) : β€ β§Έ AddSubgroup.zmultiples a β+ ZMod a.natAbs - Int.quotientZMultiplesNatEquivZMod π Mathlib.Data.ZMod.QuotientGroup
(n : β) : β€ β§Έ AddSubgroup.zmultiples βn β+ ZMod n - AddAction.orbitZMultiplesEquiv π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_4} {Ξ² : Type u_5} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) : β(AddAction.orbit (β₯(AddSubgroup.zmultiples a)) b) β ZMod (Function.minimalPeriod (fun x => a +α΅₯ x) b) - AddAction.minimalPeriod_pos π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} {Ξ² : Type u_3} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) [Finite β(AddAction.orbit (β₯(AddSubgroup.zmultiples a)) b)] : NeZero (Function.minimalPeriod (fun x => a +α΅₯ x) b) - AddAction.minimalPeriod_eq_card π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} {Ξ² : Type u_3} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) [Fintype β(AddAction.orbit (β₯(AddSubgroup.zmultiples a)) b)] : Function.minimalPeriod (fun x => a +α΅₯ x) b = Fintype.card β(AddAction.orbit (β₯(AddSubgroup.zmultiples a)) b) - AddAction.zmultiplesQuotientStabilizerEquiv π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} {Ξ² : Type u_3} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) : β₯(AddSubgroup.zmultiples a) β§Έ AddAction.stabilizer (β₯(AddSubgroup.zmultiples a)) b β+ ZMod (Function.minimalPeriod (fun x => a +α΅₯ x) b) - AddAction.orbitZMultiplesEquiv_symm_apply π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} {Ξ² : Type u_3} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) (k : ZMod (Function.minimalPeriod (fun x => a +α΅₯ x) b)) : (AddAction.orbitZMultiplesEquiv a b).symm k = k.cast β’ β¨a, β―β© +α΅₯ β¨b, β―β© - AddAction.orbitZMultiplesEquiv_symm_apply' π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_4} {Ξ² : Type u_5} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) (k : β€) : (AddAction.orbitZMultiplesEquiv a b).symm βk = k β’ β¨a, β―β© +α΅₯ β¨b, β―β© - AddAction.zmultiplesQuotientStabilizerEquiv_symm_apply π Mathlib.Data.ZMod.QuotientGroup
{Ξ± : Type u_2} {Ξ² : Type u_3} [AddGroup Ξ±] (a : Ξ±) [AddAction Ξ± Ξ²] (b : Ξ²) (n : ZMod (Function.minimalPeriod (fun x => a +α΅₯ x) b)) : (AddAction.zmultiplesQuotientStabilizerEquiv a b).symm n = n.cast β’ ββ¨a, β―β© - addOrderOf_eq_card_of_zmultiples_eq_top π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {g : G} (h : AddSubgroup.zmultiples g = β€) : addOrderOf g = Nat.card G - isAddCyclic_iff_exists_zmultiples_eq_top π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] : IsAddCyclic Ξ± β β g, AddSubgroup.zmultiples g = β€ - AddSubgroup.isAddCyclic_zmultiples π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] (g : G) : IsAddCyclic β₯(AddSubgroup.zmultiples g) - IsAddCyclic.exists_generator π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] [IsAddCyclic Ξ±] : β g, β (x : Ξ±), x β AddSubgroup.zmultiples g - addOrderOf_eq_card_of_forall_mem_zmultiples π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] {g : Ξ±} (hx : β (x : Ξ±), x β AddSubgroup.zmultiples g) : addOrderOf g = Nat.card Ξ± - Infinite.addOrderOf_eq_zero_of_forall_mem_zmultiples π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] [Infinite Ξ±] {g : Ξ±} (h : β (x : Ξ±), x β AddSubgroup.zmultiples g) : addOrderOf g = 0 - AddSubgroup.isAddCyclic_iff_exists_zmultiples_eq_top π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} [AddGroup Ξ±] (H : AddSubgroup Ξ±) : IsAddCyclic β₯H β β g, AddSubgroup.zmultiples g = H - zmultiples_eq_top_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g : G} (hg : g β 0) : AddSubgroup.zmultiples g = β€ - mem_zmultiples_of_prime_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] {p : β} [hp : Fact (Nat.Prime p)] (h : Nat.card G = p) {g g' : G} (hg : g β 0) : g' β AddSubgroup.zmultiples g - AddSubgroup.le_zmultiples_iff π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{G : Type u_2} [AddGroup G] (g : G) (H : AddSubgroup G) : H β€ AddSubgroup.zmultiples g β β n, H = AddSubgroup.zmultiples (n β’ g) - IsAddCyclic.image_range_card π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} {a : Ξ±} [AddGroup Ξ±] [Fintype Ξ±] [DecidableEq Ξ±] (ha : β (x : Ξ±), x β AddSubgroup.zmultiples a) : Finset.image (fun i => i β’ a) (Finset.range (Nat.card Ξ±)) = Finset.univ - IsAddCyclic.unique_zsmul_zmod π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} {a : Ξ±} [AddGroup Ξ±] [Fintype Ξ±] (ha : β (x : Ξ±), x β AddSubgroup.zmultiples a) (x : Ξ±) : β! n, x = n.val β’ a - IsAddCyclic.image_range_addOrderOf π Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
{Ξ± : Type u_1} {a : Ξ±} [AddGroup Ξ±] [Fintype Ξ±] [DecidableEq Ξ±] (ha : β (x : Ξ±), x β AddSubgroup.zmultiples a) : Finset.image (fun i => i β’ a) (Finset.range (addOrderOf a)) = Finset.univ - Function.Periodic.lift π Mathlib.Algebra.Ring.Periodic
{Ξ± : Type u_1} {Ξ² : Type u_2} {f : Ξ± β Ξ²} {c : Ξ±} [AddGroup Ξ±] (h : Function.Periodic f c) (x : Ξ± β§Έ AddSubgroup.zmultiples c) : Ξ² - Function.Periodic.lift_coe π Mathlib.Algebra.Ring.Periodic
{Ξ± : Type u_1} {Ξ² : Type u_2} {f : Ξ± β Ξ²} {c : Ξ±} [AddGroup Ξ±] (h : Function.Periodic f c) (a : Ξ±) : h.lift βa = f a - Function.Periodic.map_vadd_zmultiples π Mathlib.Algebra.Ring.Periodic
{Ξ± : Type u_1} {Ξ² : Type u_2} {f : Ξ± β Ξ²} {c : Ξ±} [AddCommGroup Ξ±] (hf : Function.Periodic f c) (a : β₯(AddSubgroup.zmultiples c)) (x : Ξ±) : f (a +α΅₯ x) = f x - AddCommGroup.modEq_iff_eq_mod_zmultiples π Mathlib.GroupTheory.QuotientGroup.ModEq
{G : Type u_1} [AddCommGroup G] {a b p : G} : a β‘ b [PMOD p] β βa = βb - AddCommGroup.not_modEq_iff_ne_mod_zmultiples π Mathlib.GroupTheory.QuotientGroup.ModEq
{G : Type u_1} [AddCommGroup G] {a b p : G} : Β¬a β‘ b [PMOD p] β βa β βb - QuotientAddGroup.circularOrder π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] : CircularOrder (Ξ± β§Έ AddSubgroup.zmultiples p) - QuotientAddGroup.circularPreorder π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] : CircularPreorder (Ξ± β§Έ AddSubgroup.zmultiples p) - QuotientAddGroup.instBtwQuotientAddSubgroupZmultiples π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] : Btw (Ξ± β§Έ AddSubgroup.zmultiples p) - QuotientAddGroup.equivIcoMod π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a : Ξ±) : Ξ± β§Έ AddSubgroup.zmultiples p β β(Set.Ico a (a + p)) - QuotientAddGroup.equivIocMod π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a : Ξ±) : Ξ± β§Έ AddSubgroup.zmultiples p β β(Set.Ioc a (a + p)) - QuotientAddGroup.btw_coe_iff π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] {xβ xβ xβ : Ξ±} : btw βxβ βxβ βxβ β toIcoMod β― xβ xβ β€ toIocMod β― xβ xβ - QuotientAddGroup.btw_coe_iff' π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} [hp' : Fact (0 < p)] {xβ xβ xβ : Ξ±} : btw βxβ βxβ βxβ β toIcoMod β― 0 (xβ - xβ) β€ toIocMod β― 0 (xβ - xβ) - QuotientAddGroup.equivIcoMod_coe π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a b : Ξ±) : (QuotientAddGroup.equivIcoMod hp a) βb = β¨toIcoMod hp a b, β―β© - QuotientAddGroup.equivIocMod_coe π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a b : Ξ±) : (QuotientAddGroup.equivIocMod hp a) βb = β¨toIocMod hp a b, β―β© - QuotientAddGroup.equivIcoMod_symm_apply π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a : Ξ±) (x : β(Set.Ico a (a + p))) : (QuotientAddGroup.equivIcoMod hp a).symm x = ββx - QuotientAddGroup.equivIocMod_symm_apply π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a : Ξ±) (x : β(Set.Ioc a (a + p))) : (QuotientAddGroup.equivIocMod hp a).symm x = ββx - QuotientAddGroup.equivIcoMod_zero π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a : Ξ±) : (QuotientAddGroup.equivIcoMod hp a) 0 = β¨toIcoMod hp a 0, β―β© - QuotientAddGroup.equivIocMod_zero π Mathlib.Algebra.Order.ToIntervalMod
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] [hΞ± : Archimedean Ξ±] {p : Ξ±} (hp : 0 < p) (a : Ξ±) : (QuotientAddGroup.equivIocMod hp a) 0 = β¨toIocMod hp a 0, β―β© - AddCircle.coe_add_period π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p x : π) : β(x + p) = βx - AddCircle.coe_zero π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) : β0 = 0 - AddCircle.finite_setOfPred_addOrderOf_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] {n : β} (hn : 0 < n) : {u | addOrderOf u = n}.Finite - AddCircle.finite_setOf_addOrderOf_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] {n : β} (hn : 0 < n) : {u | addOrderOf u = n}.Finite - AddCircle.liftIoc_eq_liftIco_of_ne π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {f : π β B} {x : AddCircle p} (x_ne_a : x β βa) : AddCircle.liftIoc p a f x = AddCircle.liftIco p a f x - AddCircle.eq_coe_Ico π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] (a : AddCircle p) : β b β Set.Ico 0 p, βb = a - AddCircle.eq_coe_Ioc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] (a : AddCircle p) : β b β Set.Ioc 0 p, βb = a - AddCircle.liftIco_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ico a (a + p)) : AddCircle.liftIco p a f βx = f x - AddCircle.liftIoc_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ioc a (a + p)) : AddCircle.liftIoc p a f βx = f x - AddCircle.finite_torsion_of_isSMulRegular_int π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) (n : β€) (hn : IsSMulRegular π n) : {x | n β’ x = 0}.Finite - AddCircle.homeomorphAddCircle π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) [LinearOrder π] [IsStrictOrderedRing π] [TopologicalSpace π] [OrderTopology π] (hp : p β 0) (hq : q β 0) : AddCircle p ββ AddCircle q - AddCircle.liftIco_zero_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ico 0 p) : AddCircle.liftIco p 0 f βx = f x - AddCircle.liftIoc_zero_coe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] {f : π β B} {x : π} (hx : x β Set.Ioc 0 p) : AddCircle.liftIoc p 0 f βx = f x - AddCircle.coe_fract π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] [LinearOrder π] [FloorRing π] (x : π) : β(Int.fract x) = βx - AddCircle.finite_torsion_of_isSMulRegular π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) (n : β) (hn : IsSMulRegular π n) : {x | n β’ x = 0}.Finite - AddCircle.Ico_ext π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] {Ξ± : Type u_3} {f g : AddCircle p β Ξ±} (a : π) (h : β x β Set.Ico a (a + p), f βx = g βx) : f = g - AddCircle.Ioc_ext π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] [Archimedean π] {Ξ± : Type u_3} {f g : AddCircle p β Ξ±} (a : π) (h : β x β Set.Ioc a (a + p), f βx = g βx) : f = g - AddCircle.card_torsion_le_of_isSMulRegular_int π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) (n : β€) (h0 : n β 0) (hn : IsSMulRegular π n) : {x | n β’ x = 0}.encard β€ βn.natAbs - AddCircle.finite_torsion π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] {n : β} (hn : 0 < n) : {u | n β’ u = 0}.Finite - AddCircle.openPartialHomeomorphCoe π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] : OpenPartialHomeomorph π (AddCircle p) - AddCircle.card_torsion_le_of_isSMulRegular π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) (n : β) (h0 : n β 0) (hn : IsSMulRegular π n) : {x | n β’ x = 0}.encard β€ βn - AddCircle.coe_image_Icc_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : QuotientAddGroup.mk '' Set.Icc a (a + p) = Set.univ - AddCircle.coe_image_Ico_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : QuotientAddGroup.mk '' Set.Ico a (a + p) = Set.univ - AddCircle.coe_image_Ioc_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] : QuotientAddGroup.mk '' Set.Ioc a (a + p) = Set.univ - AddCircle.coe_period π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) : βp = 0 - AddCircle.liftIco_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f a = f (a + p)) (hc : ContinuousOn f (Set.Icc a (a + p))) : Continuous (AddCircle.liftIco p a f) - AddCircle.liftIoc_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p a : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f a = f (a + p)) (hc : ContinuousOn f (Set.Icc a (a + p))) : Continuous (AddCircle.liftIoc p a f) - AddCircle.card_addOrderOf_eq_totient π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} : Nat.card { u // addOrderOf u = n } = n.totient - AddCircle.coe_neg π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) {x : π} : β(-x) = -βx - AddCircle.liftIco_zero_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f 0 = f p) (hc : ContinuousOn f (Set.Icc 0 p)) : Continuous (AddCircle.liftIco p 0 f) - AddCircle.liftIoc_zero_continuous π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} {B : Type u_2} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] {p : π} [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] [TopologicalSpace B] {f : π β B} (hf : f 0 = f p) (hc : ContinuousOn f (Set.Icc 0 p)) : Continuous (AddCircle.liftIoc p 0 f) - AddCircle.equivAddCircle π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) (hp : p β 0) (hq : q β 0) : AddCircle p β+ AddCircle q - AddCircle.coe_eq_coe_iff_of_mem_Ico π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x y : π} (hx : x β Set.Ico a (a + p)) (hy : y β Set.Ico a (a + p)) : βx = βy β x = y - AddCircle.coe_eq_coe_iff_of_mem_Ioc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x y : π} (hx : x β Set.Ioc a (a + p)) (hy : y β Set.Ioc a (a + p)) : βx = βy β x = y - AddCircle.coe_eq_zero_iff π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) {x : π} : βx = 0 β β n, n β’ p = x - AddCircle.openPartialHomeomorphCoe_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] (aβ : π) : β(AddCircle.openPartialHomeomorphCoe p a) aβ = βaβ - AddCircle.coe_zsmul π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) {n : β€} {x : π} : β(n β’ x) = n β’ βx - AddCircle.coe_sub π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p x y : π) : β(x - y) = βx - βy - AddCircle.setAddOrderOfEquiv π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} (hn : 0 < n) : β{u | addOrderOf u = n} β β{m | m < n β§ m.gcd n = 1} - AddCircle.homeoIccQuot π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] [TopologicalSpace π] [OrderTopology π] : AddCircle p ββ Quot (AddCircle.EndpointIdent p a) - AddCircle.coe_nsmul π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) {n : β} {x : π} : β(n β’ x) = n β’ βx - AddCircle.coe_add π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p x y : π) : β(x + y) = βx + βy - AddCircle.openPartialHomeomorphCoe_source π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] : (AddCircle.openPartialHomeomorphCoe p a).source = Set.Ioo a (a + p) - AddCircle.openPartialHomeomorphCoe_target π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] : (AddCircle.openPartialHomeomorphCoe p a).target = {βa}αΆ - AddCircle.instDivisibleByInt π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] [FloorRing π] : DivisibleBy (AddCircle p) β€ - AddCircle.not_isOfFinAddOrder_iff_forall_rat_ne_div π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {a : π} : Β¬IsOfFinAddOrder βa β β (q : β), βq β a / p - AddCircle.addOrderOf_coe_rat π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {q : β} : addOrderOf β(βq * p) = q.den - AddCircle.isOfFinAddOrder_iff_exists_rat_eq_div π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {a : π} : IsOfFinAddOrder βa β β q, βq = a / p - AddCircle.coe_eq_zero_of_pos_iff π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] (hp : 0 < p) {x : π} (hx : 0 < x) : βx = 0 β β n, n β’ p = x - AddCircle.addOrderOf_eq_pos_iff π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {u : AddCircle p} {n : β} (h : 0 < n) : addOrderOf u = n β β m < n, m.gcd n = 1 β§ β(βm / βn * p) = u - AddCircle.addOrderOf_period_div π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} (h : 0 < n) : addOrderOf β(p / βn) = n - AddCircle.coe_eq_zero_iff_of_mem_Ico π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] (ha : a β Set.Ico 0 p) : βa = 0 β a = 0 - AddCircle.addOrderOf_div_of_gcd_eq_one' π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {m : β€} {n : β} (hn : 0 < n) (h : m.natAbs.gcd n = 1) : addOrderOf β(βm / βn * p) = n - AddCircle.addOrderOf_div_of_gcd_eq_one π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {m n : β} (hn : 0 < n) (h : m.gcd n = 1) : addOrderOf β(βm / βn * p) = n - AddCircle.gcd_mul_addOrderOf_div_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {n : β} (m : β) (hn : 0 < n) : m.gcd n * addOrderOf β(βm / βn * p) = n - AddCircle.coe_equivIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : AddCircle p} : ββ((AddCircle.equivIco p a) y) = y - AddCircle.coe_equivIoc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : AddCircle p} : ββ((AddCircle.equivIoc p a) y) = y - AddCircle.continuous_mk' π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [TopologicalSpace π] : Continuous β(QuotientAddGroup.mk' (AddSubgroup.zmultiples p)) - AddCircle.equivIco_coe_of_mem π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : π} (hy : y β Set.Ico a (a + p)) : β((AddCircle.equivIco p a) βy) = y - AddCircle.equivIoc_coe_of_mem π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {y : π} (hy : y β Set.Ioc a (a + p)) : β((AddCircle.equivIoc p a) βy) = y - AddCircle.equivIco_coe_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x : π} (hx : x β Set.Ico a (a + p)) : (AddCircle.equivIco p a) βx = β¨x, hxβ© - AddCircle.equivIoc_coe_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] {p : π} [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] {a : π} [Archimedean π] {x : π} (hx : x β Set.Ioc a (a + p)) : (AddCircle.equivIoc p a) βx = β¨x, hxβ© - AddCircle.continuousAt_equivIco π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] {x : AddCircle p} (hx : x β βa) : ContinuousAt (β(AddCircle.equivIco p a)) x - AddCircle.continuousAt_equivIoc π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] {x : AddCircle p} (hx : x β βa) : ContinuousAt (β(AddCircle.equivIoc p a)) x - AddCircle.nsmul_eq_zero_iff π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {u : AddCircle p} {n : β} (h : 0 < n) : n β’ u = 0 β β m < n, β(βm / βn * p) = u - AddCircle.continuous_equivIco_symm π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] : Continuous β(AddCircle.equivIco p a).symm - AddCircle.continuous_equivIoc_symm π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] : Continuous β(AddCircle.equivIoc p a).symm - AddCircle.intCast_div_mul_eq_zsmul π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q r : π) (m : β€) : β(βm / q * r) = m β’ β(r / q) - AddCircle.openPartialHomeomorphCoe_symm_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] (p : π) [LinearOrder π] [IsOrderedAddMonoid π] [hp : Fact (0 < p)] (a : π) [Archimedean π] [TopologicalSpace π] [OrderTopology π] [DiscreteTopology β₯(AddSubgroup.zmultiples p)] (x : AddCircle p) : β(AddCircle.openPartialHomeomorphCoe p a).symm x = β((AddCircle.equivIco p a) x) - AddCircle.homeomorphAddCircle_apply_mk π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) [LinearOrder π] [IsStrictOrderedRing π] [TopologicalSpace π] [OrderTopology π] (hp : p β 0) (hq : q β 0) (x : π) : (AddCircle.homeomorphAddCircle p q hp hq) βx = β(x * (pβ»ΒΉ * q)) - AddCircle.natCast_div_mul_eq_nsmul π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q r : π) (m : β) : β(βm / q * r) = m β’ β(r / q) - AddCircle.homeomorphAddCircle_symm_apply_mk π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) [LinearOrder π] [IsStrictOrderedRing π] [TopologicalSpace π] [OrderTopology π] (hp : p β 0) (hq : q β 0) (x : π) : (AddCircle.homeomorphAddCircle p q hp hq).symm βx = β(x * (qβ»ΒΉ * p)) - AddCircle.exists_gcd_eq_one_of_isOfFinAddOrder π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] {p : π} [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] {u : AddCircle p} (h : IsOfFinAddOrder u) : β m, m.gcd (addOrderOf u) = 1 β§ m < addOrderOf u β§ β(βm / β(addOrderOf u) * p) = u - AddCircle.continuous_equivAddCircle π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) [LinearOrder π] [IsStrictOrderedRing π] [TopologicalSpace π] [OrderTopology π] (hp : p β 0) (hq : q β 0) : Continuous β(AddCircle.equivAddCircle p q hp hq) - AddCircle.equivIccQuot_comp_mk_eq_toIcoMod π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] : β(AddCircle.equivIccQuot p a) β Quotient.mk'' = fun x => Quot.mk (AddCircle.EndpointIdent p a) β¨toIcoMod β― a x, β―β© - AddCircle.equivIccQuot_comp_mk_eq_toIocMod π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [AddCommGroup π] [LinearOrder π] [IsOrderedAddMonoid π] (p a : π) [hp : Fact (0 < p)] [Archimedean π] : β(AddCircle.equivIccQuot p a) β Quotient.mk'' = fun x => Quot.mk (AddCircle.EndpointIdent p a) β¨toIocMod β― a x, β―β© - AddCircle.equivAddCircle_apply_mk π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) (hp : p β 0) (hq : q β 0) (x : π) : (AddCircle.equivAddCircle p q hp hq) βx = β(x * (pβ»ΒΉ * q)) - AddCircle.coe_equivIco_mk_apply π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p : π) [LinearOrder π] [IsStrictOrderedRing π] [hp : Fact (0 < p)] [FloorRing π] (x : π) : β((AddCircle.equivIco p 0) βx) = Int.fract (x / p) * p - AddCircle.equivAddCircle_symm_apply_mk π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) (hp : p β 0) (hq : q β 0) (x : π) : (AddCircle.equivAddCircle p q hp hq).symm βx = β(x * (qβ»ΒΉ * p)) - AddCircle.equivAddCircle_eq π Mathlib.Topology.Instances.AddCircle.Defs
{π : Type u_1} [Field π] (p q : π) [LinearOrder π] [IsOrderedAddMonoid π] [Archimedean π] [hp : Fact (0 < p)] (hq : q β 0) : β(AddCircle.equivAddCircle p q β― hq) = fun x => β(β((AddCircle.equivIco p 0) x) * (pβ»ΒΉ * q)) - CharacterModule.instLinearMapClassIntAddCircleRatOfNat π Mathlib.Algebra.Module.CharacterModule
(A : Type uA) [AddCommGroup A] : LinearMapClass (CharacterModule A) β€ A (AddCircle 1) - CharacterModule.int.divByNat_self π Mathlib.Algebra.Module.CharacterModule
(n : β) : (CharacterModule.int.divByNat n) βn = 0 - CharacterModule.eq_zero_of_character_apply π Mathlib.Algebra.Module.CharacterModule
{A : Type uA} [AddCommGroup A] {a : A} (h : β (c : CharacterModule A), c a = 0) : a = 0 - CharacterModule.exists_character_apply_ne_zero_of_ne_zero π Mathlib.Algebra.Module.CharacterModule
{A : Type uA} [AddCommGroup A] {a : A} (ne_zero : a β 0) : β c, c a β 0 - CharacterModule.dual_apply π Mathlib.Algebra.Module.CharacterModule
{R : Type uR} [CommRing R] {A : Type uA} [AddCommGroup A] {B : Type uB} [AddCommGroup B] [Module R A] [Module R B] (f : A ββ[R] B) (L : CharacterModule B) : (CharacterModule.dual f) L = AddMonoidHom.comp L f.toAddMonoidHom - CharacterModule.eq_zero_of_ofSpanSingleton_apply_self π Mathlib.Algebra.Module.CharacterModule
{A : Type uA} [AddCommGroup A] (a : A) (h : (CharacterModule.ofSpanSingleton a) β¨a, β―β© = 0) : a = 0 - CharacterModule.uncurry_apply π Mathlib.Algebra.Module.CharacterModule
{R : Type uR} [CommRing R] {A : Type uA} [AddCommGroup A] {B : Type uB} [AddCommGroup B] [Module R A] [Module R B] (c : A ββ[R] CharacterModule B) : CharacterModule.uncurry c = TensorProduct.liftAddHom c.toAddMonoidHom β―
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