Loogle!
Result
Found 130 declarations mentioning rootsOfUnity.
- rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
(k : β) (M : Type u_7) [CommMonoid M] : Subgroup MΛ£ - rootsOfUnity_one π Mathlib.RingTheory.RootsOfUnity.Basic
(M : Type u_7) [CommMonoid M] : rootsOfUnity 1 M = β₯ - rootsOfUnity_zero π Mathlib.RingTheory.RootsOfUnity.Basic
(M : Type u_7) [CommMonoid M] : rootsOfUnity 0 M = β€ - rootsOfUnity_inf_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {m n : β} : rootsOfUnity m M β rootsOfUnity n M = rootsOfUnity (m.gcd n) M - rootsOfUnity_eq_ker π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {k : β} : rootsOfUnity k M = (powMonoidHom k).ker - ker_zpowGroupHom_eq_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {k : β€} : (zpowGroupHom k).ker = rootsOfUnity k.natAbs M - rootsOfUnity_le_of_dvd π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {k l : β} (h : k β£ l) : rootsOfUnity k M β€ rootsOfUnity l M - instSubsingletonSubtypeUnitsMemSubgroupRootsOfUnityOfNatNat π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] : Subsingleton β₯(rootsOfUnity 1 M) - Units.val_set_image_rootsOfUnity_one π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} [CommMonoid R] : Units.val '' β(rootsOfUnity 1 R) = {1} - Units.val_set_image_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {k : β} [CommMonoid R] [NeZero k] : Units.val '' β(rootsOfUnity k R) = {z | z ^ k = 1} - mem_rootsOfUnity' π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] (k : β) (ΞΆ : MΛ£) : ΞΆ β rootsOfUnity k M β βΞΆ ^ k = 1 - instFiniteSubtypeUnitsMemSubgroupRootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
(R : Type u_4) (k : β) [NeZero k] [CommRing R] [IsDomain R] : Finite β₯(rootsOfUnity k R) - rootsOfUnity.mkOfPowEq π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] (ΞΆ : M) {n : β} [NeZero n] (h : ΞΆ ^ n = 1) : β₯(rootsOfUnity n M) - card_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
(R : Type u_4) (k : β) [NeZero k] [CommRing R] [IsDomain R] : Nat.card β₯(rootsOfUnity k R) β€ k - disjoint_rootsOfUnity_of_coprime π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {m n : β} (h : m.Coprime n) : Disjoint (rootsOfUnity m M) (rootsOfUnity n M) - map_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} {N : Type u_2} [CommMonoid M] [CommMonoid N] (f : MΛ£ β* NΛ£) (k : β) : Subgroup.map f (rootsOfUnity k M) β€ rootsOfUnity k N - rootsOfUnity.coe_mkOfPowEq π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {ΞΆ : M} {n : β} [NeZero n] (h : ΞΆ ^ n = 1) : ββ(rootsOfUnity.mkOfPowEq ΞΆ h) = ΞΆ - rootsOfUnity.val_mkOfPowEq_coe π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] (ΞΆ : M) {n : β} [NeZero n] (h : ΞΆ ^ n = 1) : ββ(rootsOfUnity.mkOfPowEq ΞΆ h) = ΞΆ - mem_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] (k : β) (ΞΆ : MΛ£) : ΞΆ β rootsOfUnity k M β ΞΆ ^ k = 1 - rootsOfUnity.isCyclic π Mathlib.RingTheory.RootsOfUnity.Basic
(R : Type u_4) (k : β) [NeZero k] [CommRing R] [IsDomain R] : IsCyclic β₯(rootsOfUnity k R) - rootsOfUnityEquivNthRoots π Mathlib.RingTheory.RootsOfUnity.Basic
(R : Type u_4) (k : β) [NeZero k] [CommRing R] [IsDomain R] : β₯(rootsOfUnity k R) β { x // x β Polynomial.nthRoots k 1 } - mem_rootsOfUnity_iff_mem_nthRoots π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {k : β} [NeZero k] [CommRing R] [IsDomain R] {ΞΆ : RΛ£} : ΞΆ β rootsOfUnity k R β βΞΆ β Polynomial.nthRoots k 1 - Units.val_set_image_rootsOfUnity_two π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} [CommRing R] [NoZeroDivisors R] : Units.val '' β(rootsOfUnity 2 R) = {1, -1} - IsCyclic.monoidHom_mulEquiv_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
(G : Type u_7) [CommGroup G] [IsCyclic G] (G' : Type u_8) [CommGroup G'] : Nonempty ((G β* G') β* β₯(rootsOfUnity (Nat.card G) G')) - IsCyclic.monoidHomMulEquivRootsOfUnityOfGenerator π Mathlib.RingTheory.RootsOfUnity.Basic
{G : Type u_7} [CommGroup G] {g : G} (hg : β (x : G), x β Subgroup.zpowers g) (G' : Type u_8) [CommGroup G'] : (G β* G') β* β₯(rootsOfUnity (Nat.card G) G') - MulEquiv.restrictRootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {S : Type u_5} [CommMonoid R] [CommMonoid S] (Ο : R β* S) (n : β) : β₯(rootsOfUnity n R) β* β₯(rootsOfUnity n S) - rootsOfUnity.coe_injective π Mathlib.RingTheory.RootsOfUnity.Basic
{M : Type u_1} [CommMonoid M] {n : β} : Function.Injective fun x => ββx - mem_rootsOfUnity_prime_pow_mul_iff π Mathlib.RingTheory.RootsOfUnity.Basic
(R : Type u_4) [CommRing R] [IsReduced R] (p k m : β) [ExpChar R p] {ΞΆ : RΛ£} : ΞΆ β rootsOfUnity (p ^ k * m) R β ΞΆ β rootsOfUnity m R - mem_rootsOfUnity_iff_isRoot π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} [CommRing R] (k : β) (ΞΆ : RΛ£) : ΞΆ β rootsOfUnity k R β (Polynomial.X ^ k - 1).IsRoot βΞΆ - mem_rootsOfUnity_prime_pow_mul_iff' π Mathlib.RingTheory.RootsOfUnity.Basic
(R : Type u_4) [CommRing R] [IsReduced R] (p k m : β) [ExpChar R p] {ΞΆ : RΛ£} : ΞΆ ^ (p ^ k * m) = 1 β ΞΆ β rootsOfUnity m R - map_rootsOfUnity_eq_pow_self π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {F : Type u_6} {k : β} [NeZero k] [CommRing R] [IsDomain R] [FunLike F R R] [MonoidHomClass F R R] (Ο : F) (ΞΆ : β₯(rootsOfUnity k R)) : β m, Ο ββΞΆ = ββΞΆ ^ m - MulEquiv.restrictRootsOfUnity_symm π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {S : Type u_5} {k : β} [CommMonoid R] [CommMonoid S] (Ο : R β* S) : (Ο.restrictRootsOfUnity k).symm = Ο.symm.restrictRootsOfUnity k - rootsOfUnityUnitsMulEquiv π Mathlib.RingTheory.RootsOfUnity.Basic
(M : Type u_7) [CommMonoid M] (n : β) : β₯(rootsOfUnity n MΛ£) β* β₯(rootsOfUnity n M) - rootsOfUnity.coe_pow π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {k : β} [CommMonoid R] (ΞΆ : β₯(rootsOfUnity k R)) (m : β) : ββ(ΞΆ ^ m) = ββΞΆ ^ m - restrictRootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {S : Type u_5} {F : Type u_6} [CommMonoid R] [CommMonoid S] [FunLike F R S] [MonoidHomClass F R S] (Ο : F) (n : β) : β₯(rootsOfUnity n R) β* β₯(rootsOfUnity n S) - rootsOfUnityEquivNthRoots_apply π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {k : β} [NeZero k] [CommRing R] [IsDomain R] (x : β₯(rootsOfUnity k R)) : β((rootsOfUnityEquivNthRoots R k) x) = ββx - rootsOfUnityEquivNthRoots_symm_apply π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {k : β} [NeZero k] [CommRing R] [IsDomain R] (x : { x // x β Polynomial.nthRoots k 1 }) : ββ((rootsOfUnityEquivNthRoots R k).symm x) = βx - MulEquiv.restrictRootsOfUnity_coe_apply π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {S : Type u_5} {k : β} [CommMonoid R] [CommMonoid S] (Ο : R β* S) (ΞΆ : β₯(rootsOfUnity k R)) : ββ((Ο.restrictRootsOfUnity k) ΞΆ) = Ο ββΞΆ - restrictRootsOfUnity_coe_apply π Mathlib.RingTheory.RootsOfUnity.Basic
{R : Type u_4} {S : Type u_5} {F : Type u_6} {k : β} [CommMonoid R] [CommMonoid S] [FunLike F R S] [MonoidHomClass F R S] (Ο : F) (ΞΆ : β₯(rootsOfUnity k R)) : ββ((restrictRootsOfUnity Ο k) ΞΆ) = Ο ββΞΆ - Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity' π Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (i : n) : β₯(Subgroup.center (Matrix.SpecialLinearGroup n R)) β* β₯(rootsOfUnity (Fintype.card n) R) - Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity π Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] : β₯(Subgroup.center (Matrix.SpecialLinearGroup n R)) β* β₯(rootsOfUnity (max (Fintype.card n) 1) R) - Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity'_apply π Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (i : n) (A : β₯(Subgroup.center (Matrix.SpecialLinearGroup n R))) : (Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity' i) A = rootsOfUnity.mkOfPowEq (ββA i i) β― - Matrix.SpecialLinearGroup.eq_scalar_center_equiv_rootsOfUnity π Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (A : β₯(Subgroup.center (Matrix.SpecialLinearGroup n R))) : ββA = (Matrix.scalar n) ββ(Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity A) - Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity'_symm_apply_coe_coe π Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (i : n) (a : β₯(rootsOfUnity (Fintype.card n) R)) : ββ((Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity' i).symm a) = a β’ 1 - IsPrimitiveRoot.mem_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{M : Type u_1} [CommMonoid M] {ΞΆ : MΛ£} {n : β} (h : IsPrimitiveRoot ΞΆ n) : ΞΆ β rootsOfUnity n M - IsPrimitiveRoot.toRootsOfUnity π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{M : Type u_1} [CommMonoid M] {ΞΌ : M} {n : β} [NeZero n] (h : IsPrimitiveRoot ΞΌ n) : β₯(rootsOfUnity n M) - IsPrimitiveRoot.val_toRootsOfUnity_coe π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{M : Type u_1} [CommMonoid M] {ΞΌ : M} {n : β} [NeZero n] (h : IsPrimitiveRoot ΞΌ n) : ββh.toRootsOfUnity = ΞΌ - IsPrimitiveRoot.zpowers_eq π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {k : β} [NeZero k] {ΞΆ : RΛ£} (h : IsPrimitiveRoot ΞΆ k) : Subgroup.zpowers ΞΆ = rootsOfUnity k R - isPrimitiveRoot_of_mem_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{M : Type u_1} [CommMonoid M] {u : MΛ£} {n : β} [NeZero n] (hu : u β rootsOfUnity n M) : β d, d β 0 β§ d β£ n β§ IsPrimitiveRoot u d - IsPrimitiveRoot.card_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {ΞΆ : R} {n : β} [NeZero n] (h : IsPrimitiveRoot ΞΆ n) : Nat.card β₯(rootsOfUnity n R) = n - card_rootsOfUnity_eq_iff_exists_isPrimitiveRoot π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {n : β} [NeZero n] : Nat.card β₯(rootsOfUnity n R) = n β β ΞΆ, IsPrimitiveRoot ΞΆ n - IsPrimitiveRoot.val_inv_toRootsOfUnity_coe π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{M : Type u_1} [CommMonoid M] {ΞΌ : M} {n : β} [NeZero n] (h : IsPrimitiveRoot ΞΌ n) : β(βh.toRootsOfUnity)β»ΒΉ = ΞΌ ^ (n - 1) - IsPrimitiveRoot.card_rootsOfUnity' π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] {ΞΆ : RΛ£} [IsDomain R] {n : β} [NeZero n] (h : IsPrimitiveRoot ΞΆ n) : Nat.card β₯(rootsOfUnity n R) = n - IsPrimitiveRoot.map_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {S : Type u_7} {F : Type u_8} [CommRing S] [IsDomain S] [FunLike F R S] [MonoidHomClass F R S] {ΞΆ : R} {n : β} [NeZero n] (hΞΆ : IsPrimitiveRoot ΞΆ n) {f : F} (hf : Function.Injective βf) : Subgroup.map (Units.map βf) (rootsOfUnity n R) = rootsOfUnity n S - IsPrimitiveRoot.eq_pow_of_mem_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {k : β} [NeZero k] {ΞΆ ΞΎ : RΛ£} (h : IsPrimitiveRoot ΞΆ k) (hΞΎ : ΞΎ β rootsOfUnity k R) : β i < k, ΞΆ ^ i = ΞΎ - rootsOfUnityEquivOfPrimitiveRoots π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {S : Type u_7} {F : Type u_8} [CommRing S] [IsDomain S] [FunLike F R S] [MonoidHomClass F R S] {n : β} [NeZero n] {f : F} (hf : Function.Injective βf) (hΞΆ : (primitiveRoots n R).Nonempty) : β₯(rootsOfUnity n R) β* β₯(rootsOfUnity n S) - IsPrimitiveRoot.coe_autToPow_apply π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
(R : Type u_4) {S : Type u_5} [CommRing S] [IsDomain S] {ΞΌ : S} {n : β} (hΞΌ : IsPrimitiveRoot ΞΌ n) [CommRing R] [Algebra R S] [NeZero n] (f : S ββ[R] S) : β((IsPrimitiveRoot.autToPow R hΞΌ) f) = ββ―.choose - val_rootsOfUnityEquivOfPrimitiveRoots_apply_coe π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {S : Type u_7} {F : Type u_8} [CommRing S] [IsDomain S] [FunLike F R S] [MonoidHomClass F R S] {n : β} [NeZero n] {f : F} (hf : Function.Injective βf) (hΞΆ : (primitiveRoots n R).Nonempty) (aβ : β₯(rootsOfUnity n R)) : ββ((rootsOfUnityEquivOfPrimitiveRoots hf hΞΆ) aβ) = f ββaβ - rootsOfUnityEquivOfPrimitiveRoots_symm_apply π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {S : Type u_7} {F : Type u_8} [CommRing S] [IsDomain S] [FunLike F R S] [MonoidHomClass F R S] {n : β} [NeZero n] {f : F} (hf : Function.Injective βf) (hΞΆ : (primitiveRoots n R).Nonempty) (Ξ· : β₯(rootsOfUnity n S)) : f ββ((rootsOfUnityEquivOfPrimitiveRoots hf hΞΆ).symm Ξ·) = ββΞ· - rootsOfUnityEquivOfPrimitiveRoots_apply_coe_inv_val π Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] {S : Type u_7} {F : Type u_8} [CommRing S] [IsDomain S] [FunLike F R S] [MonoidHomClass F R S] {n : β} [NeZero n] {f : F} (hf : Function.Injective βf) (hΞΆ : (primitiveRoots n R).Nonempty) (aβ : β₯(rootsOfUnity n R)) : β― = β― - Complex.card_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Complex
(n : β) [NeZero n] : Nat.card β₯(rootsOfUnity n β) = n - Complex.norm_eq_one_of_mem_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Complex
{ΞΆ : βΛ£} {n : β} [NeZero n] (hΞΆ : ΞΆ β rootsOfUnity n β) : ββΞΆβ = 1 - Complex.conj_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Complex
{ΞΆ : βΛ£} {n : β} [NeZero n] (hΞΆ : ΞΆ β rootsOfUnity n β) : (starRingEnd β) βΞΆ = βΞΆβ»ΒΉ - Complex.mem_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.Complex
(n : β) [NeZero n] (x : βΛ£) : x β rootsOfUnity n β β β i < n, Complex.exp (2 * βReal.pi * Complex.I * (βi / βn)) = βx - AddChar.val_mem_rootsOfUnity π Mathlib.NumberTheory.LegendreSymbol.AddCharacter
{R : Type u} [CommRing R] {R' : Type v} [CommMonoid R'] (Ο : AddChar R R') (a : R) (h : 0 < ringChar R) : β―.unit β rootsOfUnity (β(ringChar R).toPNat') R' - HasEnoughRootsOfUnity.finite_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
(M : Type u_1) [CommMonoid M] (n : β) [NeZero n] [HasEnoughRootsOfUnity M n] : Finite β₯(rootsOfUnity n M) - HasEnoughRootsOfUnity.natCard_rootsOfUnity π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
(M : Type u_1) [CommMonoid M] (n : β) [NeZero n] [HasEnoughRootsOfUnity M n] : Nat.card β₯(rootsOfUnity n M) = n - HasEnoughRootsOfUnity.cyc π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
{M : Type u_1} {instβ : CommMonoid M} {n : β} [self : HasEnoughRootsOfUnity M n] : IsCyclic β₯(rootsOfUnity n M) - HasEnoughRootsOfUnity.rootsOfUnity_isCyclic π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
(M : Type u_1) [CommMonoid M] (n : β) [HasEnoughRootsOfUnity M n] : IsCyclic β₯(rootsOfUnity n M) - HasEnoughRootsOfUnity.mk π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
{M : Type u_1} [CommMonoid M] {n : β} (prim : β m, IsPrimitiveRoot m n) (cyc : IsCyclic β₯(rootsOfUnity n M)) : HasEnoughRootsOfUnity M n - HasEnoughRootsOfUnity.of_card_le π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
{R : Type u_1} [CommRing R] [IsDomain R] {n : β} [NeZero n] (h : n β€ Nat.card β₯(rootsOfUnity n R)) : HasEnoughRootsOfUnity R n - MulEquiv.hasEnoughRootsOfUnity π Mathlib.RingTheory.RootsOfUnity.EnoughRootsOfUnity
{n : β} [NeZero n] {M : Type u_1} {N : Type u_2} [CommMonoid M] [CommMonoid N] [hm : HasEnoughRootsOfUnity M n] (e : β₯(rootsOfUnity n M) β* β₯(rootsOfUnity n N)) : HasEnoughRootsOfUnity N n - rootsOfUnityCircleEquiv π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] : β₯(rootsOfUnity n Circle) β* β₯(rootsOfUnity n β) - ZMod.rootsOfUnityAddChar π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] : AddChar (ZMod n) β₯(rootsOfUnity n Circle) - rootsOfUnitytoCircle π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] : β₯(rootsOfUnity n β) β* Circle - bijective_rootsOfUnityAddChar π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] : Function.Bijective β(ZMod.rootsOfUnityAddChar n) - ZMod.rootsOfUnityAddChar_val π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] (x : ZMod n) : ββ((ZMod.rootsOfUnityAddChar n) x) = ZMod.toCircle x - rootsOfUnityCircleEquiv_apply π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] (w : β₯(rootsOfUnity n Circle)) : ββ((rootsOfUnityCircleEquiv n) w) = βββw - rootsOfUnityCircleEquiv_comp_rootsOfUnityAddChar_val π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] (j : ZMod n) : ββ((rootsOfUnityCircleEquiv n) ((ZMod.rootsOfUnityAddChar n) j)) = Complex.exp (2 * βReal.pi * Complex.I * βj.val / βn) - surjective_rootsOfUnityCircleEquiv_comp_rootsOfUnityAddChar π Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
(n : β) [NeZero n] : Function.Surjective (β(rootsOfUnityCircleEquiv n) β β(ZMod.rootsOfUnityAddChar n)) - MulChar.ofRootOfUnity π Mathlib.NumberTheory.MulChar.Lemmas
{M : Type u_1} [CommMonoid M] [Fintype M] [DecidableEq M] {R : Type u_2} [CommMonoidWithZero R] {ΞΆ : RΛ£} (hΞΆ : ΞΆ β rootsOfUnity (Fintype.card MΛ£) R) {g : MΛ£} (hg : β (x : MΛ£), x β Subgroup.zpowers g) : MulChar M R - MulChar.equiv_rootsOfUnity π Mathlib.NumberTheory.MulChar.Lemmas
(M : Type u_1) [CommMonoid M] [Fintype M] [DecidableEq M] (R : Type u_2) [CommMonoidWithZero R] [inst_cyc : IsCyclic MΛ£] : MulChar M R β* β₯(rootsOfUnity (Fintype.card MΛ£) R) - MulChar.ofRootOfUnity_spec π Mathlib.NumberTheory.MulChar.Lemmas
{M : Type u_1} [CommMonoid M] [Fintype M] [DecidableEq M] {R : Type u_2} [CommMonoidWithZero R] {ΞΆ : RΛ£} (hΞΆ : ΞΆ β rootsOfUnity (Fintype.card MΛ£) R) {g : MΛ£} (hg : β (x : MΛ£), x β Subgroup.zpowers g) : (MulChar.ofRootOfUnity hΞΆ hg) βg = βΞΆ - MulChar.apply_mem_rootsOfUnity_orderOf π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] (Ο : MulChar F R) {a : F} (ha : a β 0) : β ΞΆ β rootsOfUnity (orderOf Ο) R, βΞΆ = Ο a - MulChar.apply_mem_rootsOfUnity_of_pow_eq_one π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] {Ο : MulChar F R} {n : β} (hΟ : Ο ^ n = 1) {a : F} (ha : a β 0) : β ΞΆ β rootsOfUnity n R, βΞΆ = Ο a - MulChar.apply_mem_rootsOfUnity π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommRing R'] [Fintype RΛ£] (a : RΛ£) {Ο : MulChar R R'} : (MulChar.equivToUnitHom Ο) a β rootsOfUnity (Fintype.card RΛ£) R' - autEquivRootsOfUnity π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) (L : Type u_1) [Field L] [Algebra K L] [Polynomial.IsSplittingField K L (Polynomial.X ^ n - Polynomial.C a)] [NeZero n] : Gal(L/K) β* β₯(rootsOfUnity n K) - AdjoinRootXPowSubCEquivToRootsOfUnity π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) [NeZero n] (Ο : AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) ββ[K] AdjoinRoot (Polynomial.X ^ n - Polynomial.C a)) : β₯(rootsOfUnity n K) - autEquivRootsOfUnity_apply_rootOfSplit π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) (L : Type u_1) [Field L] [Algebra K L] [Polynomial.IsSplittingField K L (Polynomial.X ^ n - Polynomial.C a)] [NeZero n] (Ο : Gal(L/K)) : Ο (rootOfSplitsXPowSubC β― a L) = (autEquivRootsOfUnity hΞΆ H L) Ο β’ rootOfSplitsXPowSubC β― a L - autEquivRootsOfUnity_smul π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) (L : Type u_1) [Field L] [Algebra K L] [Polynomial.IsSplittingField K L (Polynomial.X ^ n - Polynomial.C a)] {Ξ± : L} (hΞ± : Ξ± ^ n = (algebraMap K L) a) [NeZero n] (Ο : Gal(L/K)) : (autEquivRootsOfUnity hΞΆ H L) Ο β’ Ξ± = Ο Ξ± - autAdjoinRootXPowSubCHom π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] (n : β) (a : K) : β₯(rootsOfUnity n K) β* AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) ββ[K] AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) - autAdjoinRootXPowSubC π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] (n : β) (a : K) : β₯(rootsOfUnity n K) β* AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) ββ[K] AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) - autAdjoinRootXPowSubCEquiv π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) [NeZero n] : β₯(rootsOfUnity n K) β* AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) ββ[K] AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) - autAdjoinRootXPowSubC_root π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (a : K) (Ξ· : β₯(rootsOfUnity n K)) : ((autAdjoinRootXPowSubC n a) Ξ·) (AdjoinRoot.root (Polynomial.X ^ n - Polynomial.C a)) = ββΞ· β’ AdjoinRoot.root (Polynomial.X ^ n - Polynomial.C a) - autAdjoinRootXPowSubCEquiv_root π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) [NeZero n] (Ξ· : β₯(rootsOfUnity n K)) : ((autAdjoinRootXPowSubCEquiv hΞΆ H) Ξ·) (AdjoinRoot.root (Polynomial.X ^ n - Polynomial.C a)) = ββΞ· β’ AdjoinRoot.root (Polynomial.X ^ n - Polynomial.C a) - autAdjoinRootXPowSubCEquiv_symm_smul π Mathlib.FieldTheory.KummerExtension
{K : Type u} [Field K] {n : β} (hΞΆ : (primitiveRoots n K).Nonempty) {a : K} (H : Irreducible (Polynomial.X ^ n - Polynomial.C a)) [NeZero n] (Ο : AdjoinRoot (Polynomial.X ^ n - Polynomial.C a) ββ[K] AdjoinRoot (Polynomial.X ^ n - Polynomial.C a)) : β((autAdjoinRootXPowSubCEquiv hΞΆ H).symm Ο) β’ AdjoinRoot.root (Polynomial.X ^ n - Polynomial.C a) = Ο (AdjoinRoot.root (Polynomial.X ^ n - Polynomial.C a)) - rootsOfUnity.eq_one π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} [CommRing R] {n : β} {r : β₯(rootsOfUnity n R)} (hn : n = 1) : βr = 1 - SpecialLinearGroup.centerEquivRootsOfUnity_invFun π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] (r : β₯(rootsOfUnity (max (Module.finrank R V) 1) R)) : β₯(Subgroup.center (SpecialLinearGroup R V)) - SpecialLinearGroup.centerEquivRootsOfUnity π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] : β₯(Subgroup.center (SpecialLinearGroup R V)) β* β₯(rootsOfUnity (max (Module.finrank R V) 1) R) - SpecialLinearGroup.centerEquivRootsOfUnity_apply_of_finrank_le_one π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] (d1 : Module.finrank R V β€ 1) (g : β₯(Subgroup.center (SpecialLinearGroup R V))) : SpecialLinearGroup.centerEquivRootsOfUnity g = 1 - SpecialLinearGroup.centerCongr_toLin_equiv_trans_centerEquivRootsOfUnity_eq π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_3} [CommRing R] {V : Type u_4} [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] {ΞΉ : Type u_5} [Fintype ΞΉ] [DecidableEq ΞΉ] (b : Module.Basis ΞΉ R V) (g : β₯(Subgroup.center (Matrix.SpecialLinearGroup ΞΉ R))) : β(((Subgroup.centerCongr (Matrix.SpecialLinearGroup.toLin_equiv b)).trans SpecialLinearGroup.centerEquivRootsOfUnity) g) = β(Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity g) - SpecialLinearGroup.centerEquivRootsOfUnity_apply_apply π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] (g : β₯(Subgroup.center (SpecialLinearGroup R V))) (x : V) : SpecialLinearGroup.centerEquivRootsOfUnity g β’ x = (fun x => ββg x) x - SpecialLinearGroup.centerEquivRootsOfUnity_apply π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] (g : β₯(Subgroup.center (SpecialLinearGroup R V))) : βββg = SpecialLinearGroup.centerEquivRootsOfUnity g β’ LinearMap.id - SpecialLinearGroup.centerEquivRootsOfUnity_symm_apply π Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] (r : β₯(rootsOfUnity (max (Module.finrank R V) 1) R)) : βββ(SpecialLinearGroup.centerEquivRootsOfUnity.symm r) = r β’ LinearMap.id - modularCyclotomicCharacter.toFun π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) : ZMod (Nat.card β₯(rootsOfUnity n L)) - modularCyclotomicCharacter.toFun_spec'' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (g : L β+* L) {n : β} [NeZero n] {t : L} (ht : IsPrimitiveRoot t n) : g t = t ^ (modularCyclotomicCharacter.toFun n g).val - rootsOfUnity.integer_power_of_ringEquiv' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) : β m, β t β rootsOfUnity n L, g βt = β(t ^ m) - modularCyclotomicCharacter π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
(L : Type u) [CommRing L] [IsDomain L] {n : β} [NeZero n] (hn : Nat.card β₯(rootsOfUnity n L) = n) : (L β+* L) β* (ZMod n)Λ£ - modularCyclotomicCharacter.toFun_spec' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (g : L β+* L) {n : β} [NeZero n] {t : LΛ£} (ht : t β rootsOfUnity n L) : g βt = βt ^ (modularCyclotomicCharacter.toFun n g).val - rootsOfUnity.integer_power_of_ringEquiv π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) : β m, β (t : β₯(rootsOfUnity n L)), g ββt = β(βt ^ m) - modularCyclotomicCharacter.aux_spec π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (g : L β+* L) (n : β) [NeZero n] (t : β₯(rootsOfUnity n L)) : g ββt = β(βt ^ modularCyclotomicCharacter.aux g n) - modularCyclotomicCharacter.toFun_unique' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) (c : ZMod (Nat.card β₯(rootsOfUnity n L))) (hc : β t β rootsOfUnity n L, g βt = βt ^ c.val) : c = modularCyclotomicCharacter.toFun n g - modularCyclotomicCharacter.toFun_spec π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (g : L β+* L) {n : β} [NeZero n] (t : β₯(rootsOfUnity n L)) : g ββt = β(βt ^ (modularCyclotomicCharacter.toFun n g).val) - modularCyclotomicCharacter.id π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] : modularCyclotomicCharacter.toFun n (RingEquiv.refl L) = 1 - modularCyclotomicCharacter.toFun_unique π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) (c : ZMod (Nat.card β₯(rootsOfUnity n L))) (hc : β (t : β₯(rootsOfUnity n L)), g ββt = β(βt ^ c.val)) : c = modularCyclotomicCharacter.toFun n g - cyclotomicCharacter.toFun_spec π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (p : β) [Fact (Nat.Prime p)] [β (i : β), HasEnoughRootsOfUnity L (p ^ i)] (g : L β+* L) {n : β} (t : β₯(rootsOfUnity (p ^ n) L)) : g ββt = ββt ^ ((PadicInt.toZModPow n) (cyclotomicCharacter.toFun p g)).val - modularCyclotomicCharacter.unique π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
(L : Type u) [CommRing L] [IsDomain L] {n : β} [NeZero n] (hn : Nat.card β₯(rootsOfUnity n L) = n) (g : L β+* L) {c : ZMod n} (hc : β t β rootsOfUnity n L, g βt = βt ^ c.val) : c = β((modularCyclotomicCharacter L hn) g) - modularCyclotomicCharacter.spec π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
(L : Type u) [CommRing L] [IsDomain L] {n : β} [NeZero n] (hn : Nat.card β₯(rootsOfUnity n L) = n) (g : L β+* L) {t : LΛ£} (ht : t β rootsOfUnity n L) : g βt = βt ^ (β((modularCyclotomicCharacter L hn) g)).val - modularCyclotomicCharacter.comp π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
{L : Type u} [CommRing L] [IsDomain L] (n : β) [NeZero n] (g h : L β+* L) : modularCyclotomicCharacter.toFun n (g * h) = modularCyclotomicCharacter.toFun n g * modularCyclotomicCharacter.toFun n h - modularCyclotomicCharacter' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
(L : Type u) [CommRing L] [IsDomain L] (n : β) [NeZero n] : (L β+* L) β* (ZMod (Nat.card β₯(rootsOfUnity n L)))Λ£ - modularCyclotomicCharacter'.spec' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
(L : Type u) [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) {t : LΛ£} (ht : t β rootsOfUnity n L) : g βt = βt ^ (β((modularCyclotomicCharacter' L n) g)).val - modularCyclotomicCharacter'.unique' π Mathlib.NumberTheory.Cyclotomic.CyclotomicCharacter
(L : Type u) [CommRing L] [IsDomain L] (n : β) [NeZero n] (g : L β+* L) {c : ZMod (Nat.card β₯(rootsOfUnity n L))} (hc : β t β rootsOfUnity n L, g βt = βt ^ c.val) : c = β((modularCyclotomicCharacter' L n) g) - NumberField.Units.rootsOfUnity_eq_torsion π Mathlib.NumberTheory.NumberField.Units.Basic
(K : Type u_1) [Field K] [NumberField K] : rootsOfUnity (NumberField.Units.torsionOrder K) (NumberField.RingOfIntegers K) = NumberField.Units.torsion K - NumberField.Units.map_complexEmbedding_torsion π Mathlib.NumberTheory.NumberField.Units.Basic
(K : Type u_1) [Field K] [NumberField K] (Ο : K β+* β) : Subgroup.map (NumberField.Units.complexEmbedding Ο) (NumberField.Units.torsion K) = rootsOfUnity (NumberField.Units.torsionOrder K) β - NumberField.Units.rootsOfUnity_eq_one π Mathlib.NumberTheory.NumberField.Units.Basic
(K : Type u_1) [Field K] {k : β+} (hc : (βk).Coprime (NumberField.Units.torsionOrder K)) {ΞΆ : (NumberField.RingOfIntegers K)Λ£} : ΞΆ β rootsOfUnity (βk) (NumberField.RingOfIntegers K) β ΞΆ = 1 - Ideal.rootsOfUnityMapQuot π Mathlib.NumberTheory.NumberField.Ideal.Basic
{K : Type u_1} [Field K] (I : Ideal (NumberField.RingOfIntegers K)) (n : β) : β₯(rootsOfUnity n (NumberField.RingOfIntegers K)) β* (NumberField.RingOfIntegers K β§Έ I)Λ£ - Ideal.rootsOfUnityMapQuot_injective π Mathlib.NumberTheory.NumberField.Ideal.Basic
{K : Type u_1} [Field K] {I : Ideal (NumberField.RingOfIntegers K)} [NumberField K] (n : β) [NeZero n] (hIβ : Ideal.absNorm I β 1) (hIβ : (Ideal.absNorm I).Coprime n) : Function.Injective β(I.rootsOfUnityMapQuot n) - Ideal.rootsOfUnityMapQuot_apply π Mathlib.NumberTheory.NumberField.Ideal.Basic
{K : Type u_1} [Field K] (I : Ideal (NumberField.RingOfIntegers K)) (n : β) {x : (NumberField.RingOfIntegers K)Λ£} (hx : x β rootsOfUnity n (NumberField.RingOfIntegers K)) : β((I.rootsOfUnityMapQuot n) β¨x, hxβ©) = (Ideal.Quotient.mk I) βx - Ideal.rootsOfUnityMapQuot_inj π Mathlib.NumberTheory.NumberField.Ideal.Basic
{K : Type u_1} [Field K] {I : Ideal (NumberField.RingOfIntegers K)} [NumberField K] (n : β) [NeZero n] (hIβ : Ideal.absNorm I β 1) (hIβ : (Ideal.absNorm I).Coprime n) {x y : β₯(rootsOfUnity n (NumberField.RingOfIntegers K))} : (I.rootsOfUnityMapQuot n) x = (I.rootsOfUnityMapQuot n) y β x = y - ZMod.rootsOfUnity_eq_top π Mathlib.RingTheory.ZMod.Torsion
{p : β} [Fact (Nat.Prime p)] : rootsOfUnity (p - 1) (ZMod p) = β€
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