Loogle!
Result
Found 32 declarations mentioning LinearEquiv.conj.
- LinearEquiv.conj π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') : Module.End Rβ' Mβ' βββ[Οβ'β'] Module.End Rβ' Mβ' - LinearEquiv.conj_id π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') : e.conj LinearMap.id = LinearMap.id - LinearEquiv.conj_refl π Mathlib.Algebra.Module.Equiv.Basic
{R : Type u_1} {M : Type u_5} [CommSemiring R] [AddCommMonoid M] [Module R M] (f : Module.End R M) : (LinearEquiv.refl R M).conj f = f - LinearEquiv.conj_trans π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Rβ' : Type u_14} {Mβ' : Type u_20} {Mβ' : Type u_21} {Mβ' : Type u_22} [CommSemiring Rβ'] [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] [RingHomCompTriple Οβ'β' Οβ'β' Οβ'β'] [RingHomCompTriple Οβ'β' Οβ'β' Οβ'β'] (eβ : Mβ' βββ[Οβ'β'] Mβ') (eβ : Mβ' βββ[Οβ'β'] Mβ') : eβ.conj.trans eβ.conj = (eβ.trans eβ).conj - LinearEquiv.conj_apply π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') (f : Module.End Rβ' Mβ') : e.conj f = (βe βββ f) βββ βe.symm - LinearEquiv.symm_conj_apply π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') (f : Module.End Rβ' Mβ') : e.symm.conj f = (βe.symm βββ f) βββ βe - LinearEquiv.conj_apply_apply π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') (f : Module.End Rβ' Mβ') (x : Mβ') : (e.conj f) x = e (f (e.symm x)) - LinearEquiv.conj_conj_symm π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') (f : Module.End Rβ' Mβ') : e.conj (e.symm.conj f) = f - LinearEquiv.conj_symm_conj π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') (f : Module.End Rβ' Mβ') : e.symm.conj (e.conj f) = f - LinearEquiv.conj_comp π Mathlib.Algebra.Module.Equiv.Basic
{Rβ' : Type u_12} {Rβ' : Type u_13} {Mβ' : Type u_20} {Mβ' : Type u_21} [CommSemiring Rβ'] [CommSemiring Rβ'] [AddCommMonoid Mβ'] [AddCommMonoid Mβ'] [Module Rβ' Mβ'] [Module Rβ' Mβ'] {Οβ'β' : Rβ' β+* Rβ'} {Οβ'β' : Rβ' β+* Rβ'} [RingHomInvPair Οβ'β' Οβ'β'] [RingHomInvPair Οβ'β' Οβ'β'] (e : Mβ' βββ[Οβ'β'] Mβ') (f g : Module.End Rβ' Mβ') : e.conj (g ββ f) = e.conj g ββ e.conj f - AlgEquiv.linearEquivConj_mulLeft π Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {Aβ : Type uAβ} {Aβ : Type uAβ} [CommSemiring R] [Semiring Aβ] [Semiring Aβ] [Algebra R Aβ] [Algebra R Aβ] (f : Aβ ββ[R] Aβ) (x : Aβ) : (βf).conj (LinearMap.mulLeft R x) = LinearMap.mulLeft R (f x) - AlgEquiv.linearEquivConj_mulRight π Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {Aβ : Type uAβ} {Aβ : Type uAβ} [CommSemiring R] [Semiring Aβ] [Semiring Aβ] [Algebra R Aβ] [Algebra R Aβ] (f : Aβ ββ[R] Aβ) (x : Aβ) : (βf).conj (LinearMap.mulRight R x) = LinearMap.mulRight R (f x) - AlgEquiv.linearEquivConj_mulLeftRight π Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {Aβ : Type uAβ} {Aβ : Type uAβ} [CommSemiring R] [Semiring Aβ] [Semiring Aβ] [Algebra R Aβ] [Algebra R Aβ] (f : Aβ ββ[R] Aβ) (x : Aβ Γ Aβ) : (βf).conj (LinearMap.mulLeftRight R x) = LinearMap.mulLeftRight R (Prod.map (βf) (βf) x) - LinearEquiv.map_mem_invtSubmodule_conj_iff π Mathlib.Algebra.Module.Submodule.Invariant
{R : Type u_3} {M : Type u_4} {N : Type u_5} [CommSemiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid N] [Module R N] {f : Module.End R M} {e : M ββ[R] N} {p : Submodule R M} : Submodule.map (βe) p β (e.conj f).invtSubmodule β p β f.invtSubmodule - LinearEquiv.map_mem_invtSubmodule_iff π Mathlib.Algebra.Module.Submodule.Invariant
{R : Type u_3} {M : Type u_4} {N : Type u_5} [CommSemiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid N] [Module R N] {f : Module.End R N} {e : M ββ[R] N} {p : Submodule R M} : Submodule.map (βe) p β f.invtSubmodule β p β (e.symm.conj f).invtSubmodule - LinearMap.IsProj.eq_conj_prodMap π Mathlib.LinearAlgebra.Projection
{R : Type u_1} [CommRing R] {E : Type u_2} [AddCommGroup E] [Module R E] {p : Submodule R E} {f : E ββ[R] E} (h : LinearMap.IsProj p f) : f = (p.prodEquivOfIsCompl f.ker β―).conj (LinearMap.id.prodMap 0) - SemimoduleCat.Iso.conj_eq_conj π Mathlib.Algebra.Category.ModuleCat.Semi
{S : Type u} [CommSemiring S] {X X' : SemimoduleCat S} (i : X β X') (f : CategoryTheory.End X) : i.conj f = { hom' := i.toLinearEquivβ.conj (SemimoduleCat.Hom.hom f) } - ModuleCat.Iso.conj_eq_conj π Mathlib.Algebra.Category.ModuleCat.Basic
{S : Type u} [CommRing S] {X X' : ModuleCat S} (i : X β X') (f : CategoryTheory.End X) : i.conj f = { hom' := i.toLinearEquiv.conj (ModuleCat.Hom.hom f) } - LinearMap.isPairSelfAdjoint_equiv π Mathlib.LinearAlgebra.SesquilinearForm.Basic
{R : Type u_1} {M : Type u_5} {Mβ : Type u_6} {Mβ : Type u_7} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup Mβ] [Module R Mβ] [AddCommGroup Mβ] [Module R Mβ] {B F : M ββ[R] M ββ[R] Mβ} (e : Mβ ββ[R] M) (f : Module.End R M) : B.IsPairSelfAdjoint F βf β (B.complββ βe βe).IsPairSelfAdjoint (F.complββ βe βe) β(e.symm.conj f) - FGModuleCat.Iso.conj_eq_conj π Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] {V W : FGModuleCat R} (i : V β W) (f : CategoryTheory.End V) : i.conj f = FGModuleCat.ofHom ((FGModuleCat.isoToLinearEquiv i).conj (ModuleCat.Hom.hom f.hom)) - FGModuleCat.Iso.conj_hom_eq_conj π Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] {V W : FGModuleCat R} (i : V β W) (f : CategoryTheory.End V) : ModuleCat.Hom.hom (i.conj f).hom = (FGModuleCat.isoToLinearEquiv i).conj (ModuleCat.Hom.hom f.hom) - LinearMap.trace_conj' π Mathlib.LinearAlgebra.Trace
{R : Type u_1} [CommRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {N : Type u_3} [AddCommGroup N] [Module R N] (f : M ββ[R] M) (e : M ββ[R] N) : (LinearMap.trace R N) (e.conj f) = (LinearMap.trace R M) f - LinearEquiv.lieConj_apply π Mathlib.Algebra.Lie.OfAssociative
{R : Type u} {Mβ : Type v} {Mβ : Type w} [CommRing R] [AddCommGroup Mβ] [Module R Mβ] [AddCommGroup Mβ] [Module R Mβ] (e : Mβ ββ[R] Mβ) (f : Module.End R Mβ) : e.lieConj f = e.conj f - LieAlgebra.conj_ad_apply π Mathlib.Algebra.Lie.OfAssociative
{R : Type u_1} {L : Type u_2} {L' : Type u_3} [CommRing R] [LieRing L] [LieAlgebra R L] [LieRing L'] [LieAlgebra R L'] (e : L βββ Rβ L') (x : L) : e.toLinearEquiv.conj ((LieAlgebra.ad R L) x) = (LieAlgebra.ad R L') (e x) - LieModule.shiftedGenWeightSpace.toEnd_eq π Mathlib.Algebra.Lie.Weights.Linear
(R : Type u_2) (L : Type u_3) (M : Type u_4) [CommRing R] [LieRing L] [LieAlgebra R L] [AddCommGroup M] [Module R M] [LieRingModule L M] [LieModule R L M] [LieRing.IsNilpotent L] (Ο : L β R) [LieModule.LinearWeights R L M] (x : L) : (LieModule.toEnd R L β₯(LieModule.shiftedGenWeightSpace R L M Ο)) x = (LieModule.shiftedGenWeightSpace.shift R L M Ο).conj ((LieModule.toEnd R L β₯(LieModule.genWeightSpace M Ο)) x - Ο x β’ LinearMap.id) - RootPairing.toPerfPair_conj_reflection π Mathlib.LinearAlgebra.RootSystem.Defs
{ΞΉ : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (P : RootPairing ΞΉ R M N) (i : ΞΉ) : P.toPerfPair.conj β(P.reflection i) = (β(P.coreflection i)).dualMap - RootPairing.toPerfPair_flip_conj_coreflection π Mathlib.LinearAlgebra.RootSystem.Defs
{ΞΉ : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (P : RootPairing ΞΉ R M N) (i : ΞΉ) : P.flip.toPerfPair.conj β(P.coreflection i) = (β(P.reflection i)).dualMap - RootPairing.Equiv.coweightEquiv_conj_coreflection π Mathlib.LinearAlgebra.RootSystem.Hom
{ΞΉ : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {ΞΉβ : Type u_5} {Mβ : Type u_6} {Nβ : Type u_7} [AddCommGroup Mβ] [Module R Mβ] [AddCommGroup Nβ] [Module R Nβ] {P : RootPairing ΞΉ R M N} {Q : RootPairing ΞΉβ R Mβ Nβ} (e : P.Equiv Q) (i : ΞΉ) : e.coweightEquiv.conj β(Q.coreflection ((βe).indexEquiv i)) = β(P.coreflection i) - RootPairing.Equiv.weightEquiv_symm_conj_reflection π Mathlib.LinearAlgebra.RootSystem.Hom
{ΞΉ : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {ΞΉβ : Type u_5} {Mβ : Type u_6} {Nβ : Type u_7} [AddCommGroup Mβ] [Module R Mβ] [AddCommGroup Nβ] [Module R Nβ] {P : RootPairing ΞΉ R M N} {Q : RootPairing ΞΉβ R Mβ Nβ} (e : P.Equiv Q) (i : ΞΉ) : e.weightEquiv.symm.conj β(Q.reflection ((βe).indexEquiv i)) = β(P.reflection i) - LinearEquiv.charpoly_conj π Mathlib.LinearAlgebra.Charpoly.ToMatrix
{R : Type u_1} {Mβ : Type u_3} {Mβ : Type u_4} [CommRing R] [AddCommGroup Mβ] [Module R Mβ] [Module.Finite R Mβ] [Module.Free R Mβ] [AddCommGroup Mβ] [Module R Mβ] [Module.Finite R Mβ] [Module.Free R Mβ] (e : Mβ ββ[R] Mβ) (Ο : Module.End R Mβ) : LinearMap.charpoly (e.conj Ο) = LinearMap.charpoly Ο - Representation.Equiv.conj_apply_self π Mathlib.RepresentationTheory.Intertwining
{A : Type u_1} {G : Type u_2} {V : Type u_3} {W : Type u_4} [CommSemiring A] [Monoid G] [AddCommMonoid V] [AddCommMonoid W] [Module A V] [Module A W] {Ο : Representation A G V} {Ο : Representation A G W} (g : G) (Ο : Ο.Equiv Ο) : Ο.toLinearEquiv.conj (Ο g) = Ο g - FDRep.Iso.conj_Ο π Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] {V W : FDRep R G} (i : V β W) (g : G) : W.Ο g = (FDRep.isoToLinearEquiv i).conj (V.Ο 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 ce5dd8c