Loogle!
Result
Found 386 declarations mentioning AlgEquiv.symm. Of these, only the first 200 are shown.
- AlgEquiv.symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : A₂ ≃ₐ[R] A₁ - AlgEquiv.refl_symm 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} [CommSemiring R] [Semiring A₁] [Algebra R A₁] : AlgEquiv.refl.symm = AlgEquiv.refl - AlgEquiv.symm_bijective 📋 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₂] : Function.Bijective AlgEquiv.symm - AlgEquiv.symm_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : e.symm.symm = e - AlgEquiv.self_trans_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : e.trans e.symm = AlgEquiv.refl - AlgEquiv.symm_trans_self 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : e.symm.trans e = AlgEquiv.refl - AlgEquiv.invFun_eq_symm 📋 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₂] {e : A₁ ≃ₐ[R] A₂} : e.invFun = ⇑e.symm - ULift.down_algEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type u_1} {A : Type u_2} [CommSemiring R] [Semiring A] [Algebra R A] (a : A) : (ULift.algEquiv.{u_1, u_2, u_3}.symm a).down = a - ULift.algEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type u} {A : Type v} [CommSemiring R] [Semiring A] [Algebra R A] (down : A) : ULift.algEquiv.{u, v, w}.symm down = { down := down } - AlgEquiv.comp_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : (↑e).comp ↑e.symm = AlgHom.id R A₂ - AlgEquiv.symm_comp 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : (↑e.symm).comp ↑e = AlgHom.id R A₁ - AlgEquiv.leftInverse_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : Function.LeftInverse ⇑e.symm ⇑e - AlgEquiv.rightInverse_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : Function.RightInverse ⇑e.symm ⇑e - AlgEquiv.apply_symm_apply 📋 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₂] (e : A₁ ≃ₐ[R] A₂) (x : A₂) : e (e.symm x) = x - AlgEquiv.symm_apply_apply 📋 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₂] (e : A₁ ≃ₐ[R] A₂) (x : A₁) : e.symm (e x) = x - AlgEquiv.symm_toEquiv_eq_symm 📋 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₂] {e : A₁ ≃ₐ[R] A₂} : (↑e).symm = ↑e.symm - RingEquiv.symm_toNatAlgEquiv 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type u_1} {S : Type u_2} [Semiring R] [Semiring S] (f : R ≃+* S) : f.toNatAlgEquiv.symm = f.symm.toNatAlgEquiv - AlgEquiv.eq_symm_apply 📋 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₂] (e : A₁ ≃ₐ[R] A₂) {x : A₂} {y : A₁} : y = e.symm x ↔ e y = x - AlgEquiv.symm_apply_eq 📋 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₂] (e : A₁ ≃ₐ[R] A₂) {x : A₂} {y : A₁} : e.symm x = y ↔ x = e y - AlgEquiv.coe_apply_coe_coe_symm_apply 📋 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 : Type u_1} [EquivLike F A₁ A₂] [AlgEquivClass F R A₁ A₂] (f : F) (x : A₂) : f ((↑f).symm x) = x - AlgEquiv.coe_coe_symm_apply_coe_apply 📋 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 : Type u_1} [EquivLike F A₁ A₂] [AlgEquivClass F R A₁ A₂] (f : F) (x : A₁) : (↑f).symm (f x) = x - AlgEquiv.image_symm_eq_preimage 📋 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₂] (e : A₁ ≃ₐ[R] A₂) (s : Set A₂) : ⇑e.symm '' s = ⇑e ⁻¹' s - AlgEquiv.aut_inv 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} [CommSemiring R] [Semiring A₁] [Algebra R A₁] (ϕ : A₁ ≃ₐ[R] A₁) : ϕ⁻¹ = ϕ.symm - AlgEquiv.symm_toRingEquiv 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : e.symm.toRingEquiv = e.toRingEquiv.symm - AlgEquiv.toRingEquiv_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : e.toRingEquiv.symm = e.symm.toRingEquiv - AlgEquiv.cast_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} [CommSemiring R] {ι : Type u_1} {A : ι → Type u_2} [(i : ι) → Semiring (A i)] [(i : ι) → Algebra R (A i)] {i j : ι} (h : i = j) (a : A j) : (AlgEquiv.cast h).symm a = cast ⋯ a - RingEquiv.symm_toIntAlgEquiv 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type u_1} {S : Type u_2} [Ring R] [Ring S] (f : R ≃+* S) : f.toIntAlgEquiv.symm = f.symm.toIntAlgEquiv - AlgEquiv.ofBijective_apply_symm_apply 📋 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₂) (hf : Function.Bijective ⇑f) (x : A₂) : f ((AlgEquiv.ofBijective f hf).symm x) = x - AlgEquiv.ofBijective_symm_apply_apply 📋 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₂) (hf : Function.Bijective ⇑f) (x : A₁) : (AlgEquiv.ofBijective f hf).symm (f x) = x - AlgEquiv.coe_inv 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} [CommSemiring R] [Semiring A₁] [Algebra R A₁] (ϕ : A₁ ≃ₐ[R] A₁) : ⇑ϕ⁻¹ = ⇑ϕ.symm - AlgEquiv.ofAlgHom_symm 📋 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₂) (g : A₂ →ₐ[R] A₁) (h₁ : f.comp g = AlgHom.id R A₂) (h₂ : g.comp f = AlgHom.id R A₁) : (AlgEquiv.ofAlgHom f g h₁ h₂).symm = AlgEquiv.ofAlgHom g f h₂ h₁ - AlgEquiv.arrowCongr_symm 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} {A₂ : Type uA₂} {A₁' : Type uA₁'} {A₂' : Type uA₂'} [CommSemiring R] [Semiring A₁] [Semiring A₂] [Semiring A₁'] [Semiring A₂'] [Algebra R A₁] [Algebra R A₂] [Algebra R A₁'] [Algebra R A₂'] (e₁ : A₁ ≃ₐ[R] A₁') (e₂ : A₂ ≃ₐ[R] A₂') : (e₁.arrowCongr e₂).symm = e₁.symm.arrowCongr e₂.symm - AlgEquiv.equivCongr_symm 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} {A₂ : Type uA₂} {A₁' : Type uA₁'} {A₂' : Type uA₂'} [CommSemiring R] [Semiring A₁] [Semiring A₂] [Semiring A₁'] [Semiring A₂'] [Algebra R A₁] [Algebra R A₂] [Algebra R A₁'] [Algebra R A₂'] (e : A₁ ≃ₐ[R] A₂) (e' : A₁' ≃ₐ[R] A₂') : (e.equivCongr e').symm = e.symm.equivCongr e'.symm - AlgEquiv.symm_trans_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} {A₂ : Type uA₂} {A₃ : Type uA₃} [CommSemiring R] [Semiring A₁] [Semiring A₂] [Semiring A₃] [Algebra R A₁] [Algebra R A₂] [Algebra R A₃] (e₁ : A₁ ≃ₐ[R] A₂) (e₂ : A₂ ≃ₐ[R] A₃) (x : A₃) : (e₁.trans e₂).symm x = e₁.symm (e₂.symm x) - AlgEquiv.toLinearEquiv_symm 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : ↑e.symm = (↑e).symm - AlgEquiv.ofAlgHom_symm_apply 📋 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₂) (g : A₂ →ₐ[R] A₁) (h₁ : f.comp g = AlgHom.id R A₂) (h₂ : g.comp f = AlgHom.id R A₁) (a : A₂) : (AlgEquiv.ofAlgHom f g h₁ h₂).symm a = g a - MulSemiringAction.toAlgEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
{G : Type u_1} (R : Type u_2) (A : Type u_3) [CommSemiring R] [Semiring A] [Algebra R A] [Group G] [MulSemiringAction G A] [SMulCommClass G R A] (g : G) (a✝ : A) : (MulSemiringAction.toAlgEquiv R A g).symm a✝ = g⁻¹ • a✝ - AlgEquiv.equivCongr_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} {A₂ : Type uA₂} {A₁' : Type uA₁'} {A₂' : Type uA₂'} [CommSemiring R] [Semiring A₁] [Semiring A₂] [Semiring A₁'] [Semiring A₂'] [Algebra R A₁] [Algebra R A₂] [Algebra R A₁'] [Algebra R A₂'] (e : A₁ ≃ₐ[R] A₂) (e' : A₁' ≃ₐ[R] A₂') (ψ : A₁ ≃ₐ[R] A₁') : (e.equivCongr e') ψ = e.symm.trans (ψ.trans e') - AlgEquiv.arrowCongr_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {A₁ : Type uA₁} {A₂ : Type uA₂} {A₁' : Type uA₁'} {A₂' : Type uA₂'} [CommSemiring R] [Semiring A₁] [Semiring A₂] [Semiring A₁'] [Semiring A₂'] [Algebra R A₁] [Algebra R A₂] [Algebra R A₁'] [Algebra R A₂'] (e₁ : A₁ ≃ₐ[R] A₁') (e₂ : A₂ ≃ₐ[R] A₂') (f : A₁ →ₐ[R] A₂) : (e₁.arrowCongr e₂) f = ((↑e₂).comp f).comp ↑e₁.symm - AlgEquiv.symm_toMulEquiv 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : ↑e.symm = (↑e).symm - AlgEquiv.coe_symm_toLinearEquiv 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : ⇑(↑e).symm = ⇑e.symm - AlgEquiv.symm_mk 📋 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₂] (e : A₁ ≃ A₂) (h₁ : ∀ (x y : A₁), e.toFun (x * y) = e.toFun x * e.toFun y) (h₂ : ∀ (x y : A₁), e.toFun (x + y) = e.toFun x + e.toFun y) (h₃ : ∀ (r : R), e.toFun ((algebraMap R A₁) r) = (algebraMap R A₂) r) : { toEquiv := e, map_mul' := h₁, map_add' := h₂, commutes' := h₃ }.symm = { toEquiv := e.symm, map_mul' := ⋯, map_add' := ⋯, commutes' := ⋯ } - AlgEquiv.autCongr_symm 📋 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₂] (ϕ : A₁ ≃ₐ[R] A₂) : ϕ.autCongr.symm = ϕ.symm.autCongr - AlgEquiv.ofRingEquiv_symm_apply 📋 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₁ ≃+* A₂} (hf : ∀ (x : R), f ((algebraMap R A₁) x) = (algebraMap R A₂) x) (a : A₂) : (AlgEquiv.ofRingEquiv hf).symm a = f.symm a - AlgEquiv.symm_toAddEquiv 📋 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₂] (e : A₁ ≃ₐ[R] A₂) : ↑e.symm = (↑e).symm - AlgEquiv.mk_coe' 📋 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₂] (e : A₁ ≃ₐ[R] A₂) (f : A₂ → A₁) (h₁ : Function.LeftInverse (⇑e) f) (h₂ : Function.RightInverse (⇑e) f) (h₃ : ∀ (x y : A₂), { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun (x * y) = { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun x * { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun y) (h₄ : ∀ (x y : A₂), { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun (x + y) = { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun x + { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun y) (h₅ : ∀ (r : R), { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂ }.toFun ((algebraMap R A₂) r) = (algebraMap R A₁) r) : { toFun := f, invFun := ⇑e, left_inv := h₁, right_inv := h₂, map_mul' := h₃, map_add' := h₄, commutes' := h₅ } = e.symm - AlgEquiv.autCongr_apply 📋 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₂] (ϕ : A₁ ≃ₐ[R] A₂) (ψ : A₁ ≃ₐ[R] A₁) : ϕ.autCongr ψ = ϕ.symm.trans (ψ.trans ϕ) - LinearEquiv.symm_conjAlgEquiv 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type u_1} {S : Type u_2} {M₁ : Type u_3} {M₂ : Type u_4} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Semiring S] [Module S M₁] [Module S M₂] [SMulCommClass S R M₁] [SMulCommClass S R M₂] [SMul R S] [IsScalarTower R S M₁] [IsScalarTower R S M₂] (e : M₁ ≃ₗ[S] M₂) : (LinearEquiv.conjAlgEquiv R e).symm = LinearEquiv.conjAlgEquiv R e.symm - AlgEquiv.algHomUnitsEquiv_apply_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
(R : Type u_1) (S : Type u_2) [CommSemiring R] [Semiring S] [Algebra R S] (f : (S →ₐ[R] S)ˣ) (a : S) : ((AlgEquiv.algHomUnitsEquiv R S) f).symm a = ↑↑f⁻¹ a - LinearEquiv.algEquivOfRing_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
{R : Type u_1} {A : Type u_2} [CommSemiring R] [CommSemiring A] [Algebra R A] (e : R ≃ₗ[R] A) (x : A) : e.algEquivOfRing.symm x = e.symm (e 1 * x) - AlgEquiv.val_inv_algHomUnitsEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Equiv
(R : Type u_1) (S : Type u_2) [CommSemiring R] [Semiring S] [Algebra R S] (f : S ≃ₐ[R] S) : ↑((AlgEquiv.algHomUnitsEquiv R S).symm f)⁻¹ = ↑f.symm - LinearEquiv.conjAlgEquiv_symm_apply_apply 📋 Mathlib.Algebra.Algebra.Equiv
(R : Type u_1) {S : Type u_2} {M₁ : Type u_3} {M₂ : Type u_4} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Semiring S] [Module S M₁] [Module S M₂] [SMulCommClass S R M₁] [SMulCommClass S R M₂] [SMul R S] [IsScalarTower R S M₁] [IsScalarTower R S M₂] (e : M₁ ≃ₗ[S] M₂) (f : M₂ →ₗ[S] M₂) (x : M₁) : ((LinearEquiv.conjAlgEquiv R e).symm f) x = e.symm (f (e x)) - AlgEquiv.ofLinearEquiv_symm 📋 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₂] (l : A₁ ≃ₗ[R] A₂) (map_one : l 1 = 1) (map_mul : ∀ (x y : A₁), l (x * y) = l x * l y) : (AlgEquiv.ofLinearEquiv l map_one map_mul).symm = AlgEquiv.ofLinearEquiv l.symm ⋯ ⋯ - AlgEquiv.symm_restrictScalars 📋 Mathlib.Algebra.Algebra.Tower
(R : Type u) {S : Type v} {A : Type w} {B : Type u₁} [CommSemiring R] [CommSemiring S] [Semiring A] [Semiring B] [Algebra R S] [Algebra S A] [Algebra S B] [Algebra R A] [Algebra R B] [IsScalarTower R S A] [IsScalarTower R S B] (f : A ≃ₐ[S] B) : (AlgEquiv.restrictScalars R f).symm = AlgEquiv.restrictScalars R f.symm - AlgEquiv.coe_restrictScalars_symm 📋 Mathlib.Algebra.Algebra.Tower
(R : Type u) {S : Type v} {A : Type w} {B : Type u₁} [CommSemiring R] [CommSemiring S] [Semiring A] [Semiring B] [Algebra R S] [Algebra S A] [Algebra S B] [Algebra R A] [Algebra R B] [IsScalarTower R S A] [IsScalarTower R S B] (f : A ≃ₐ[S] B) : (AlgEquiv.restrictScalars R f).symm.toRingEquiv = f.symm.toRingEquiv - AlgEquiv.coe_restrictScalars_symm' 📋 Mathlib.Algebra.Algebra.Tower
(R : Type u) {S : Type v} {A : Type w} {B : Type u₁} [CommSemiring R] [CommSemiring S] [Semiring A] [Semiring B] [Algebra R S] [Algebra S A] [Algebra S B] [Algebra R A] [Algebra R B] [IsScalarTower R S A] [IsScalarTower R S B] (f : A ≃ₐ[S] B) : ⇑(AlgEquiv.restrictScalars R f).symm = ⇑f.symm - AlgEquiv.restrictScalars_symm_apply 📋 Mathlib.Algebra.Algebra.Tower
(R : Type u) {S : Type v} {A : Type w} {B : Type u₁} [CommSemiring R] [CommSemiring S] [Semiring A] [Semiring B] [Algebra R S] [Algebra S A] [Algebra S B] [Algebra R A] [Algebra R B] [IsScalarTower R S A] [IsScalarTower R S B] (f : A ≃ₐ[S] B) (x : B) : (AlgEquiv.restrictScalars R f).symm x = f.symm x - AlgEquiv.extendScalarsOfSurjective_symm 📋 Mathlib.Algebra.Algebra.Tower
{R : Type u} {S : Type v} {A : Type w} {B : Type u₁} [CommSemiring R] [CommSemiring S] [Semiring A] [Semiring B] [Algebra R S] [Algebra S A] [Algebra S B] [Algebra R A] [Algebra R B] [IsScalarTower R S A] [IsScalarTower R S B] (h : Function.Surjective ⇑(algebraMap R S)) (f : A ≃ₐ[R] B) : ((AlgEquiv.extendScalarsOfSurjective h) f).symm = (AlgEquiv.extendScalarsOfSurjective h) f.symm - AlgEquiv.prodUnique_symm_apply 📋 Mathlib.Algebra.Algebra.Prod
{R : Type u_1} {A : Type u_2} {B : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] [Unique B] (x : A) : AlgEquiv.prodUnique.symm x = (x, 0) - AlgEquiv.uniqueProd_symm_apply 📋 Mathlib.Algebra.Algebra.Prod
{R : Type u_1} {A : Type u_2} {B : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] [Unique B] (x : A) : AlgEquiv.uniqueProd.symm x = (0, x) - AlgEquiv.prodCongr_symm_apply 📋 Mathlib.Algebra.Algebra.Prod
{R : Type u_1} [CommSemiring R] {S : Type u_5} {T : Type u_6} {A : Type u_7} {B : Type u_8} [Semiring A] [Semiring B] [Semiring S] [Semiring T] [Algebra R S] [Algebra R T] [Algebra R A] [Algebra R B] (l : S ≃ₐ[R] A) (r : T ≃ₐ[R] B) (x : A × B) : (l.prodCongr r).symm x = ((↑l).prodCongr ↑r).symm x - AlgEquiv.toOpposite_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) (A : Type u_3) [CommSemiring R] [CommSemiring A] [Algebra R A] (a✝ : Aᵐᵒᵖ) : (AlgEquiv.toOpposite R A).symm a✝ = MulOpposite.unop a✝ - AlgEquiv.opOp_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) (A : Type u_3) [CommSemiring R] [Semiring A] [Algebra R A] (a✝ : Aᵐᵒᵖᵐᵒᵖ) : (AlgEquiv.opOp R A).symm a✝ = MulOpposite.unop (MulOpposite.unop a✝) - AlgEquiv.op_apply_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A ≃ₐ[R] B) (a✝ : Bᵐᵒᵖ) : (AlgEquiv.op f).symm a✝ = MulOpposite.op (f.symm (MulOpposite.unop a✝)) - AlgEquiv.moduleEndSelf_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) {A : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] (f : Module.End A A) : (AlgEquiv.moduleEndSelf R).symm f = MulOpposite.op (f 1) - AlgEquiv.opComm_apply_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (a✝ : A ≃ₐ[R] Bᵐᵒᵖ) (a✝¹ : B) : (AlgEquiv.opComm a✝).symm a✝¹ = MulOpposite.op (a✝.symm (MulOpposite.op a✝¹)) - AlgEquiv.opComm_symm_apply_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (a✝ : Aᵐᵒᵖ ≃ₐ[R] B) (a✝¹ : Bᵐᵒᵖ) : (AlgEquiv.opComm.symm a✝).symm a✝¹ = MulOpposite.unop (a✝.symm (MulOpposite.unop a✝¹)) - AlgEquiv.op_symm_apply_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : Aᵐᵒᵖ ≃ₐ[R] Bᵐᵒᵖ) (a✝ : B) : (AlgEquiv.op.symm f).symm a✝ = MulOpposite.unop (f.symm (MulOpposite.op a✝)) - AlgEquiv.moduleEndSelfOp_symm_apply 📋 Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) {A : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] (f : Module.End Aᵐᵒᵖ A) : (AlgEquiv.moduleEndSelfOp R).symm f = f 1 - AlgEquiv.funUnique_symm_apply 📋 Mathlib.Algebra.Algebra.Pi
{R : Type u_3} {ι : Type u_4} [CommSemiring R] (S : Type u_8) [Semiring S] [Algebra R S] [Unique ι] (x : S) : (AlgEquiv.funUnique R ι S).symm x = (Equiv.funUnique ι S).symm x - AlgEquiv.piCongrRight_symm 📋 Mathlib.Algebra.Algebra.Pi
{R : Type u_3} {ι : Type u_4} {A₁ : ι → Type u_5} {A₂ : ι → Type u_6} [CommSemiring R] [(i : ι) → Semiring (A₁ i)] [(i : ι) → Semiring (A₂ i)] [(i : ι) → Algebra R (A₁ i)] [(i : ι) → Algebra R (A₂ i)] (e : (i : ι) → A₁ i ≃ₐ[R] A₂ i) : (AlgEquiv.piCongrRight e).symm = AlgEquiv.piCongrRight fun i => (e i).symm - AlgEquiv.sumArrowEquivProdArrow_symm_apply_inr 📋 Mathlib.Algebra.Algebra.Pi
{α : Type u_1} {β : Type u_2} {R : Type u_3} [CommSemiring R] (S : Type u_8) [Semiring S] [Algebra R S] (x : (α → S) × (β → S)) : (AlgEquiv.sumArrowEquivProdArrow α β R S).symm x = (Equiv.sumArrowEquivProdArrow α β S).symm x - AlgEquiv.piCongrLeft_symm_apply 📋 Mathlib.Algebra.Algebra.Pi
{R : Type u_3} {ι : Type u_4} {A₁ : ι → Type u_5} [CommSemiring R] [(i : ι) → Semiring (A₁ i)] [(i : ι) → Algebra R (A₁ i)] {ι' : Type u_8} (e : ι' ≃ ι) (x : (i : ι) → A₁ i) : (AlgEquiv.piCongrLeft R A₁ e).symm x = (Equiv.piCongrLeft A₁ e).symm x - AlgEquiv.piCongrLeft'_symm_apply 📋 Mathlib.Algebra.Algebra.Pi
{R : Type u_3} {ι : Type u_4} {A₁ : ι → Type u_5} [CommSemiring R] [(i : ι) → Semiring (A₁ i)] [(i : ι) → Algebra R (A₁ i)] {ι' : Type u_8} (e : ι ≃ ι') (x : (i : ι') → A₁ (e.symm i)) : (AlgEquiv.piCongrLeft' R A₁ e).symm x = (Equiv.piCongrLeft' A₁ e).symm x - Submodule.coe_mapAlgEquiv_symm_apply 📋 Mathlib.RingTheory.Ideal.Operations
{R : Type u_1} [CommSemiring R] {A : Type u_3} {B : Type u_4} [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A ≃ₐ[R] B) (a : Submodule R B) : ↑((Submodule.mapAlgEquiv f).symm a) = ⇑f.symm '' ↑a - AlgEquiv.mapMatrix_symm 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_4} {α : Type u_8} {β : Type u_9} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Semiring β] [Algebra R α] [Algebra R β] (f : α ≃ₐ[R] β) : f.mapMatrix.symm = f.symm.mapMatrix - Matrix.transposeAlgEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
(m : Type u_2) (R : Type u_4) (α : Type u_8) [CommSemiring R] [CommSemiring α] [Fintype m] [DecidableEq m] [Algebra R α] (a✝ : (Matrix m m α)ᵐᵒᵖ) : (Matrix.transposeAlgEquiv m R α).symm a✝ = (MulOpposite.unop a✝).transpose - AlgEquiv.mopMatrix_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_4} {α : Type u_8} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : (Matrix m m α)ᵐᵒᵖ) : AlgEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - Matrix.piAlgEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
{n : Type u_3} {ι : Type u_11} {β : ι → Type u_12} (R : Type u_13) [CommSemiring R] [(i : ι) → Semiring (β i)] [(i : ι) → Algebra R (β i)] [Fintype n] [DecidableEq n] (f : (i : ι) → Matrix n n (β i)) : (Matrix.piAlgEquiv R).symm f = Matrix.of fun j k i => f i j k - Subalgebra.equivOfEq_symm 📋 Mathlib.Algebra.Algebra.Subalgebra.Basic
{R : Type u} {A : Type v} [CommSemiring R] [Semiring A] [Algebra R A] (S T : Subalgebra R A) (h : S = T) : (S.equivOfEq T h).symm = T.equivOfEq S ⋯ - AlgEquiv.ofLeftInverse_symm_apply 📋 Mathlib.Algebra.Algebra.Subalgebra.Basic
{R : Type u} {A : Type v} {B : Type w} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] {g : B → A} {f : A →ₐ[R] B} (h : Function.LeftInverse g ⇑f) (x : ↥f.range) : (AlgEquiv.ofLeftInverse h).symm x = g ↑x - AlgEquiv.subalgebraMap_symm_apply_coe 📋 Mathlib.Algebra.Algebra.Subalgebra.Basic
{R : Type u} {A : Type v} {B : Type w} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (e : A ≃ₐ[R] B) (S : Subalgebra R A) (y : ↑(⇑↑e.toRingEquiv.toAddEquiv '' ↑S.toAddSubmonoid)) : ↑((e.subalgebraMap S).symm y) = e.symm ↑y - Subalgebra.topEquiv_symm_apply_coe 📋 Mathlib.Algebra.Algebra.Subalgebra.Lattice
{R : Type u} {A : Type v} [CommSemiring R] [Semiring A] [Algebra R A] (a : A) : ↑(Subalgebra.topEquiv.symm a) = a - Algebra.botEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Subalgebra.Lattice
(F : Type u_1) (R : Type u_2) [Field F] [Semiring R] [Nontrivial R] [Algebra F R] (a✝ : F) : (Algebra.botEquiv F R).symm a✝ = (algebraMap F ↥⊥) a✝ - Matrix.compAlgEquiv_symm_apply 📋 Mathlib.Data.Matrix.Composition
(I : Type u_1) (J : Type u_2) (R : Type u_5) (K : Type u_7) [CommSemiring K] [Semiring R] [Fintype I] [Fintype J] [Algebra K R] [DecidableEq I] [DecidableEq J] (M : Matrix (I × J) (I × J) R) : (Matrix.compAlgEquiv I J R K).symm M = (Matrix.comp I I J J R).symm M - StarAlgEquiv.toAlgEquiv_symm 📋 Mathlib.Algebra.Star.StarAlgHom
{R : Type u_6} {A : Type u_7} {B : Type u_8} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] [Star A] [Star B] (f : A ≃⋆ₐ[R] B) : f.symm.toAlgEquiv = f.toAlgEquiv.symm - StarAlgEquiv.coe_symm_toAlgEquiv 📋 Mathlib.Algebra.Star.StarAlgHom
{R : Type u_6} {A : Type u_7} {B : Type u_8} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] [Star A] [Star B] (f : A ≃⋆ₐ[R] B) : ⇑f.toAlgEquiv.symm = ⇑f.symm - StarAlgEquiv.ofAlgEquiv_symm 📋 Mathlib.Algebra.Star.StarAlgHom
{R : Type u_6} {A : Type u_7} {B : Type u_8} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] [Star A] [Star B] (f : A ≃ₐ[R] B) (map_star : ∀ (x : A), f (star x) = star (f x)) : (StarAlgEquiv.ofAlgEquiv f map_star).symm = StarAlgEquiv.ofAlgEquiv f.symm ⋯ - LinearMap.toMatrixAlgEquiv_symm 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {n : Type u_4} [Fintype n] [DecidableEq n] {M₁ : Type u_5} [AddCommMonoid M₁] [Module R M₁] (v₁ : Module.Basis n R M₁) : (LinearMap.toMatrixAlgEquiv v₁).symm = Matrix.toLinAlgEquiv v₁ - Matrix.toLinAlgEquiv_symm 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {n : Type u_4} [Fintype n] [DecidableEq n] {M₁ : Type u_5} [AddCommMonoid M₁] [Module R M₁] (v₁ : Module.Basis n R M₁) : (Matrix.toLinAlgEquiv v₁).symm = LinearMap.toMatrixAlgEquiv v₁ - LinearMap.toMatrixAlgEquiv'_symm 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {n : Type u_5} [DecidableEq n] [Fintype n] : LinearMap.toMatrixAlgEquiv'.symm = Matrix.toLinAlgEquiv' - Matrix.toLinAlgEquiv'_symm 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {n : Type u_5} [DecidableEq n] [Fintype n] : Matrix.toLinAlgEquiv'.symm = LinearMap.toMatrixAlgEquiv' - endVecAlgEquivMatrixEnd_symm_apply_apply 📋 Mathlib.LinearAlgebra.Matrix.ToLin
(ι : Type u_1) [Fintype ι] [DecidableEq ι] (R : Type u_2) [CommSemiring R] (A : Type u_3) [Semiring A] [Algebra R A] (M : Type u_4) [AddCommMonoid M] [Module R M] [Module A M] [IsScalarTower R A M] (m : Matrix ι ι (Module.End A M)) (x : ι → M) (i : ι) : ((endVecAlgEquivMatrixEnd ι R A M).symm m) x i = ∑ j, (m i j) (x j) - IsLocalization.algEquiv_symm_mk' 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} [CommSemiring R] {M : Submonoid R} {S : Type u_2} [CommSemiring S] [Algebra R S] [IsLocalization M S] {Q : Type u_4} [CommSemiring Q] [Algebra R Q] [IsLocalization M Q] (x : R) (y : ↥M) : (IsLocalization.algEquiv M S Q).symm (IsLocalization.mk' Q x y) = IsLocalization.mk' S x y - AlgEquiv.extendScalarsOfIsLocalization_symm_apply 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} {A : Type u_2} {B : Type u_3} [CommSemiring R] [Semiring A] [Semiring B] (S : Type u_4) [CommSemiring S] [Algebra R S] (M : Submonoid R) [IsLocalization M S] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Algebra R B] [Algebra S B] [IsScalarTower R S B] (f : A ≃ₐ[R] B) (a✝ : B) : (AlgEquiv.extendScalarsOfIsLocalization S M f).symm a✝ = f.invFun a✝ - IsLocalization.algEquiv_symm_apply 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} [CommSemiring R] (M : Submonoid R) (S : Type u_2) [CommSemiring S] [Algebra R S] [IsLocalization M S] (Q : Type u_4) [CommSemiring Q] [Algebra R Q] [IsLocalization M Q] (a : Q) : (IsLocalization.algEquiv M S Q).symm a = (IsLocalization.map S (RingHom.id R) ⋯) a - Localization.algEquiv_symm_mk 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} [CommSemiring R] {M : Submonoid R} {S : Type u_2} [CommSemiring S] [Algebra R S] [IsLocalization M S] (x : R) (y : ↥M) : (Localization.algEquiv M S).symm (IsLocalization.mk' S x y) = Localization.mk x y - Localization.algEquiv_symm_mk' 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} [CommSemiring R] {M : Submonoid R} {S : Type u_2} [CommSemiring S] [Algebra R S] [IsLocalization M S] (x : R) (y : ↥M) : (Localization.algEquiv M S).symm (IsLocalization.mk' S x y) = IsLocalization.mk' (Localization M) x y - Localization.algEquiv_symm_apply 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} [CommSemiring R] (M : Submonoid R) (S : Type u_2) [CommSemiring S] [Algebra R S] [IsLocalization M S] (a : S) : (Localization.algEquiv M S).symm a = (IsLocalization.map (Localization M) (RingHom.id R) ⋯) a - Localization.coe_algEquiv_symm 📋 Mathlib.RingTheory.Localization.Basic
{R : Type u_1} [CommSemiring R] {M : Submonoid R} {S : Type u_2} [CommSemiring S] [Algebra R S] [IsLocalization M S] : ↑(Localization.algEquiv M S).symm = IsLocalization.map (Localization M) (RingHom.id R) ⋯ - IsLocalization.algEquivOfAlgEquiv_symm 📋 Mathlib.RingTheory.Localization.Basic
{A : Type u_4} [CommSemiring A] {R : Type u_5} [CommSemiring R] [Algebra A R] {M : Submonoid R} {S : Type u_6} [CommSemiring S] [Algebra A S] [Algebra R S] [IsScalarTower A R S] [IsLocalization M S] {P : Type u_7} [CommSemiring P] [Algebra A P] {T : Submonoid P} {Q : Type u_8} [CommSemiring Q] [Algebra A Q] [Algebra P Q] [IsScalarTower A P Q] [IsLocalization T Q] {h : R ≃ₐ[A] P} (H : Submonoid.map h M = T) : (IsLocalization.algEquivOfAlgEquiv S Q h H).symm = IsLocalization.algEquivOfAlgEquiv Q S h.symm ⋯ - IsLocalization.algEquivOfAlgEquiv_symm_apply 📋 Mathlib.RingTheory.Localization.Basic
{A : Type u_4} [CommSemiring A] {R : Type u_5} [CommSemiring R] [Algebra A R] {M : Submonoid R} (S : Type u_6) [CommSemiring S] [Algebra A S] [Algebra R S] [IsScalarTower A R S] [IsLocalization M S] {P : Type u_7} [CommSemiring P] [Algebra A P] {T : Submonoid P} (Q : Type u_8) [CommSemiring Q] [Algebra A Q] [Algebra P Q] [IsScalarTower A P Q] [IsLocalization T Q] (h : R ≃ₐ[A] P) (H : Submonoid.map h M = T) (a : Q) : (IsLocalization.algEquivOfAlgEquiv S Q h H).symm a = (IsLocalization.map S ↑{ toEquiv := ↑h.symm, map_mul' := ⋯, map_add' := ⋯ } ⋯) a - IsFractionRing.algEquivOfAlgEquiv_symm 📋 Mathlib.RingTheory.Localization.FractionRing
{R : Type u_8} {A : Type u_9} {K : Type u_10} {B : Type u_11} {L : Type u_12} [CommSemiring R] [CommRing A] [CommRing B] [CommRing K] [CommRing L] [Algebra R A] [Algebra R K] [Algebra A K] [IsFractionRing A K] [IsScalarTower R A K] [Algebra R B] [Algebra R L] [Algebra B L] [IsFractionRing B L] [IsScalarTower R B L] (h : A ≃ₐ[R] B) : (IsFractionRing.algEquivOfAlgEquiv h).symm = IsFractionRing.algEquivOfAlgEquiv h.symm - Algebra.TensorProduct.comm_symm 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) (A : Type uA) (B : Type uB) [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] : (Algebra.TensorProduct.comm R A B).symm = Algebra.TensorProduct.comm R B A - Algebra.TensorProduct.lid_symm_apply 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) {A : Type uA} [CommSemiring R] [Semiring A] [Algebra R A] (a : A) : (Algebra.TensorProduct.lid R A).symm a = 1 ⊗ₜ[R] a - Algebra.TensorProduct.rid_symm_apply 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) (S : Type uS) {A : Type uA} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] (a : A) : (Algebra.TensorProduct.rid R S A).symm a = a ⊗ₜ[R] 1 - Algebra.TensorProduct.comm_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) {A : Type uA} {B : Type uB} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] (a : A) (b : B) : (Algebra.TensorProduct.comm R A B).symm (b ⊗ₜ[R] a) = a ⊗ₜ[R] b - Algebra.TensorProduct.congr_symm 📋 Mathlib.RingTheory.TensorProduct.Maps
{R : Type uR} {S : Type uS} {A : Type uA} {B : Type uB} {C : Type uC} {D : Type uD} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring B] [Algebra R B] [Semiring C] [Algebra R C] [Algebra S C] [IsScalarTower R S C] [Semiring D] [Algebra R D] (f : A ≃ₐ[S] C) (g : B ≃ₐ[R] D) : Algebra.TensorProduct.congr f.symm g.symm = (Algebra.TensorProduct.congr f g).symm - Algebra.TensorProduct.commRight_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) {S : Type uS} {A : Type uA} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] (s : S) (a : A) : (Algebra.TensorProduct.commRight R S A).symm (a ⊗ₜ[R] s) = s ⊗ₜ[R] a - Algebra.TensorProduct.Algebra.TensorProduct.commRight_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) {S : Type uS} {A : Type uA} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] (s : S) (a : A) : (Algebra.TensorProduct.commRight R S A).symm (a ⊗ₜ[R] s) = s ⊗ₜ[R] a - Algebra.TensorProduct.congr_symm_apply 📋 Mathlib.RingTheory.TensorProduct.Maps
{R : Type uR} {S : Type uS} {A : Type uA} {B : Type uB} {C : Type uC} {D : Type uD} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring B] [Algebra R B] [Semiring C] [Algebra R C] [Algebra S C] [IsScalarTower R S C] [Semiring D] [Algebra R D] (f : A ≃ₐ[S] C) (g : B ≃ₐ[R] D) (x : TensorProduct R C D) : (Algebra.TensorProduct.congr f g).symm x = (Algebra.TensorProduct.map ↑f.symm ↑g.symm) x - Algebra.TensorProduct.leftComm_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
{R : Type uR} {A : Type uA} {B : Type uB} {C : Type uC} [CommSemiring R] [Semiring A] [Algebra R A] [Semiring B] [Algebra R B] [Semiring C] [Algebra R C] (m : A) (n : B) (p : C) : (Algebra.TensorProduct.leftComm R A B C).symm (n ⊗ₜ[R] (m ⊗ₜ[R] p)) = m ⊗ₜ[R] (n ⊗ₜ[R] p) - Algebra.TensorProduct.cancelBaseChange_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) (S : Type uS) [CommSemiring R] [CommSemiring S] [Algebra R S] (T : Type u_3) (A : Type u_4) (B : Type u_5) [CommSemiring T] [CommSemiring A] [CommSemiring B] [Algebra R T] [Algebra R A] [Algebra R B] [Algebra T A] [IsScalarTower R T A] [Algebra S A] [IsScalarTower R S A] [Algebra S T] [IsScalarTower S T A] (a : A) (b : B) : (Algebra.TensorProduct.cancelBaseChange R S T A B).symm (a ⊗ₜ[R] b) = a ⊗ₜ[S] (1 ⊗ₜ[R] b) - Algebra.TensorProduct.tensorTensorTensorComm_symm 📋 Mathlib.RingTheory.TensorProduct.Maps
{R : Type uR} {R' : Type u_1} {S : Type uS} {T : Type u_2} {A : Type uA} {B : Type uB} {C : Type uC} {D : Type uD} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring B] [Algebra R B] [Semiring C] [Algebra R C] [Algebra S C] [IsScalarTower R S C] [Semiring D] [Algebra R D] [CommSemiring T] [Algebra R T] [Algebra T A] [IsScalarTower R T A] [SMulCommClass S T A] [Algebra S T] [IsScalarTower S T A] [CommSemiring R'] [Algebra R R'] [Algebra R' T] [Algebra R' A] [Algebra R' B] [IsScalarTower R R' A] [SMulCommClass S R' A] [SMulCommClass R' S A] [IsScalarTower R' T A] [IsScalarTower R R' B] : (Algebra.TensorProduct.tensorTensorTensorComm R R' S T A B C D).symm = Algebra.TensorProduct.tensorTensorTensorComm R S R' T A C B D - Algebra.TensorProduct.down_uliftEquiv_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type u_4) (S : Type u_5) {A : Type u_6} {B : Type u_7} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring B] [Algebra R B] (a : ULift.{u_8, u_6} A) (b : ULift.{u_9, u_7} B) : ((Algebra.TensorProduct.uliftEquiv R S A B).symm (a ⊗ₜ[ULift.{u_11, u_4} R] b)).down = a.down ⊗ₜ[R] b.down - Algebra.TensorProduct.uliftEquiv_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type u_4) (S : Type u_5) {A : Type u_6} {B : Type u_7} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring B] [Algebra R B] (a : ULift.{u_8, u_6} A) (b : ULift.{u_9, u_7} B) : (Algebra.TensorProduct.uliftEquiv R S A B).symm (a ⊗ₜ[ULift.{u_11, u_4} R] b) = { down := a.down ⊗ₜ[R] b.down } - Algebra.TensorProduct.assoc_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type uR) (S : Type uS) {T : Type u_2} (A : Type uA) {C : Type uC} {D : Type uD} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring C] [Algebra R C] [Algebra S C] [IsScalarTower R S C] [Semiring D] [Algebra R D] [CommSemiring T] [Algebra R T] [Algebra S T] [Algebra T A] [IsScalarTower R T A] [IsScalarTower S T A] (a : A) (b : C) (c : D) : (Algebra.TensorProduct.assoc R S T A C D).symm (a ⊗ₜ[S] (b ⊗ₜ[R] c)) = a ⊗ₜ[S] b ⊗ₜ[R] c - Algebra.TensorProduct.tensorTensorTensorComm_symm_tmul 📋 Mathlib.RingTheory.TensorProduct.Maps
{R : Type uR} {R' : Type u_1} {S : Type uS} {T : Type u_2} {A : Type uA} {B : Type uB} {C : Type uC} {D : Type uD} [CommSemiring R] [CommSemiring S] [Algebra R S] [Semiring A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] [Semiring B] [Algebra R B] [Semiring C] [Algebra R C] [Algebra S C] [IsScalarTower R S C] [Semiring D] [Algebra R D] [CommSemiring T] [Algebra R T] [Algebra T A] [IsScalarTower R T A] [SMulCommClass S T A] [Algebra S T] [IsScalarTower S T A] [CommSemiring R'] [Algebra R R'] [Algebra R' T] [Algebra R' A] [Algebra R' B] [IsScalarTower R R' A] [SMulCommClass S R' A] [SMulCommClass R' S A] [IsScalarTower R' T A] [IsScalarTower R R' B] (m : A) (n : C) (p : B) (q : D) : (Algebra.TensorProduct.tensorTensorTensorComm R R' S T A B C D).symm (m ⊗ₜ[S] n ⊗ₜ[R'] (p ⊗ₜ[R] q)) = m ⊗ₜ[R'] p ⊗ₜ[S] (n ⊗ₜ[R] q) - Algebra.TensorProduct.lmul'_ulift 📋 Mathlib.RingTheory.TensorProduct.Maps
(R : Type u_4) (S : Type u_5) [CommSemiring R] [CommSemiring S] [Algebra R S] : Algebra.TensorProduct.lmul' (ULift.{u₁, u_4} R) = (AlgHom.ulift.{u_8, u₁, u₂, u_4, u_5, u_5} (Algebra.TensorProduct.lmul' R)).comp ↑(Algebra.TensorProduct.uliftEquiv R (ULift.{u₁, u_4} R) S S).symm - RingEquiv.symm_toRatAlgEquiv 📋 Mathlib.Algebra.Algebra.Hom.Rat
{R : Type u_1} {S : Type u_2} [Ring R] [Ring S] [Algebra ℚ R] [Algebra ℚ S] (f : R ≃+* S) : f.toRatAlgEquiv.symm = f.symm.toRatAlgEquiv - Equiv.algEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.TransferInstance
{R : Type u_1} {α : Type u_2} {β : Type u_3} [CommSemiring R] (e : α ≃ β) [Semiring β] [Algebra R β] (b : β) : (AlgEquiv.symm (Equiv.algEquiv R e)) b = e.symm b - Shrink.algEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [CommSemiring R] [Semiring α] [Algebra R α] (a✝ : α) : (Shrink.algEquiv R α).symm a✝ = (equivShrink α) a✝ - AddMonoidAlgebra.uniqueAlgEquiv_symm_apply 📋 Mathlib.Algebra.MonoidAlgebra.Basic
(R : Type u_1) {A : Type u_4} (M : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [Subsingleton M] (a : A) : (AddMonoidAlgebra.uniqueAlgEquiv R M).symm a = AddMonoidAlgebra.single 0 a - MonoidAlgebra.uniqueAlgEquiv_symm_apply 📋 Mathlib.Algebra.MonoidAlgebra.Basic
(R : Type u_1) {A : Type u_4} (M : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Subsingleton M] (a : A) : (MonoidAlgebra.uniqueAlgEquiv R M).symm a = MonoidAlgebra.single 1 a - AddMonoidAlgebra.coeff_uniqueAlgEquiv_symm 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [Subsingleton M] (a : A) (m : M) : ((AddMonoidAlgebra.uniqueAlgEquiv R M).symm a).coeff m = a - MonoidAlgebra.coeff_uniqueAlgEquiv_symm 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Subsingleton M] (a : A) (m : M) : ((MonoidAlgebra.uniqueAlgEquiv R M).symm a).coeff m = a - AddMonoidAlgebra.symm_mapAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {B : Type u_5} {M : Type u_7} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] [AddMonoid M] (e : A ≃ₐ[R] B) : (AddMonoidAlgebra.mapAlgEquiv R M e).symm = AddMonoidAlgebra.mapAlgEquiv R M e.symm - MonoidAlgebra.symm_mapAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {B : Type u_5} {M : Type u_7} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] [Monoid M] (e : A ≃ₐ[R] B) : (MonoidAlgebra.mapAlgEquiv R M e).symm = MonoidAlgebra.mapAlgEquiv R M e.symm - MonoidAlgebra.symm_mapRangeAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {B : Type u_5} {M : Type u_7} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] [Monoid M] (e : A ≃ₐ[R] B) : (MonoidAlgebra.mapAlgEquiv R M e).symm = MonoidAlgebra.mapAlgEquiv R M e.symm - AddMonoidAlgebra.domCongr_symm 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [AddMonoid N] (e : M ≃+ N) : (AddMonoidAlgebra.domCongr R A e).symm = AddMonoidAlgebra.domCongr R A e.symm - MonoidAlgebra.domCongr_symm 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Monoid N] (e : M ≃* N) : (MonoidAlgebra.domCongr R A e).symm = MonoidAlgebra.domCongr R A e.symm - AddMonoidAlgebra.symm_commAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [AddMonoid N] : (AddMonoidAlgebra.commAlgEquiv R).symm = AddMonoidAlgebra.commAlgEquiv R - MonoidAlgebra.symm_commAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Monoid N] : (MonoidAlgebra.commAlgEquiv R).symm = MonoidAlgebra.commAlgEquiv R - AddMonoidAlgebra.coeff_toMultiplicativeAlgEquiv_symm_apply 📋 Mathlib.Algebra.MonoidAlgebra.Basic
(R : Type u_1) (A : Type u_4) (M : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] (x : MonoidAlgebra A (Multiplicative M)) : ((AddMonoidAlgebra.toMultiplicativeAlgEquiv R A M).symm x).coeff = Finsupp.mapDomain (⇑Multiplicative.toAdd) x.coeff - MonoidAlgebra.coeff_toAdditiveAlgEquiv_symm_apply 📋 Mathlib.Algebra.MonoidAlgebra.Basic
(R : Type u_1) (A : Type u_4) (M : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] (x : AddMonoidAlgebra A (Additive M)) : ((MonoidAlgebra.toAdditiveAlgEquiv R A M).symm x).coeff = Finsupp.mapDomain (⇑Additive.toMul) x.coeff - AddMonoidAlgebra.toRingEquiv_symm_uniqueAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
(R : Type u_1) {A : Type u_4} (M : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [Unique M] : ↑(AddMonoidAlgebra.uniqueAlgEquiv R M).symm = (AddMonoidAlgebra.uniqueRingEquiv M).symm - MonoidAlgebra.toRingEquiv_symm_uniqueAlgEquiv 📋 Mathlib.Algebra.MonoidAlgebra.Basic
(R : Type u_1) {A : Type u_4} (M : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Unique M] : ↑(MonoidAlgebra.uniqueAlgEquiv R M).symm = (MonoidAlgebra.uniqueRingEquiv M).symm - AddMonoidAlgebra.curryAlgEquiv_symm_single 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [AddMonoid N] (m : M) (n : N) (a : A) : (AddMonoidAlgebra.curryAlgEquiv R).symm (AddMonoidAlgebra.single m (AddMonoidAlgebra.single n a)) = AddMonoidAlgebra.single (m, n) a - MonoidAlgebra.curryAlgEquiv_symm_single 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Monoid N] (m : M) (n : N) (a : A) : (MonoidAlgebra.curryAlgEquiv R).symm (MonoidAlgebra.single m (MonoidAlgebra.single n a)) = MonoidAlgebra.single (m, n) a - Polynomial.algEquivOfCompEqX_symm 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u} [CommSemiring R] (p q : Polynomial R) (hpq : p.comp q = Polynomial.X) (hqp : q.comp p = Polynomial.X) : (p.algEquivOfCompEqX q hpq hqp).symm = q.algEquivOfCompEqX p hqp hpq - Polynomial.algEquivAevalXAddC_symm 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (t : R) : (Polynomial.algEquivAevalXAddC t).symm = Polynomial.algEquivAevalXAddC (-t) - Polynomial.toFinsuppIsoAlg_symm_apply_toFinsupp 📋 Mathlib.Algebra.Polynomial.AlgebraMap
(R : Type u) [CommSemiring R] (toFinsupp : AddMonoidAlgebra R ℕ) : ((Polynomial.toFinsuppIsoAlg R).symm toFinsupp).toFinsupp = toFinsupp - Polynomial.algEquivCMulXAddC_symm_eq 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a b : R) [Invertible a] : (Polynomial.algEquivCMulXAddC a b).symm = Polynomial.algEquivCMulXAddC (⅟a) (-⅟a * b) - Polynomial.algEquivAevalNegX_symm_apply 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a : Polynomial R) : Polynomial.algEquivAevalNegX.symm a = (Polynomial.aeval (-Polynomial.X)) a - Polynomial.algEquivCMulXAddC_symm_apply 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a b : R) [Invertible a] (a✝ : Polynomial R) : (Polynomial.algEquivCMulXAddC a b).symm a✝ = (Polynomial.aeval (Polynomial.C ⅟a * (Polynomial.X - Polynomial.C b))) a✝ - MvPolynomial.renameEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Rename
{σ : Type u_1} {τ : Type u_2} (R : Type u_4) [CommSemiring R] (f : σ ≃ τ) : (MvPolynomial.renameEquiv R f).symm = MvPolynomial.renameEquiv R f.symm - MvPolynomial.isEmptyAlgEquiv_symm_toRingHom 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) {σ : Type u_1} [CommSemiring R] [IsEmpty σ] : (MvPolynomial.isEmptyAlgEquiv R σ).symm.toRingEquiv.toRingHom = MvPolynomial.C - MvPolynomial.mapAlgEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Equiv
{R : Type u} (σ : Type u_1) [CommSemiring R] {A₁ : Type u_2} {A₂ : Type u_3} [CommSemiring A₁] [CommSemiring A₂] [Algebra R A₁] [Algebra R A₂] (e : A₁ ≃ₐ[R] A₂) : (MvPolynomial.mapAlgEquiv σ e).symm = MvPolynomial.mapAlgEquiv σ e.symm - MvPolynomial.isEmptyAlgEquiv_symm_apply 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) {σ : Type u_1} [CommSemiring R] [IsEmpty σ] (r : R) : (MvPolynomial.isEmptyAlgEquiv R σ).symm r = MvPolynomial.C r - MvPolynomial.eval₂_const_pUnitAlgEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Equiv
{R : Type u_2} {S : Type u_3} [CommSemiring R] [CommSemiring S] {f : Polynomial R} {φ : R →+* S} {a : S} : MvPolynomial.eval₂ φ (fun x => a) ((MvPolynomial.pUnitAlgEquiv R).symm f) = Polynomial.eval₂ φ a f - MvPolynomial.eval₂_pUnitAlgEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Equiv
{R : Type u_2} {S : Type u_3} [CommSemiring R] [CommSemiring S] {f : Polynomial R} {φ : R →+* S} {a : Unit → S} : MvPolynomial.eval₂ φ a ((MvPolynomial.pUnitAlgEquiv R).symm f) = Polynomial.eval₂ φ (a ()) f - MvPolynomial.eval₂_const_uniqueAlgEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Equiv
{σ : Type u_1} {R : Type u_2} {S : Type u_3} [CommSemiring R] [CommSemiring S] [Unique σ] {f : Polynomial R} {φ : R →+* S} {a : S} : MvPolynomial.eval₂ φ (fun x => a) ((MvPolynomial.uniqueAlgEquiv R σ).symm f) = Polynomial.eval₂ φ a f - MvPolynomial.uniqueAlgEquiv_symm_apply 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) [CommSemiring R] (σ : Type u_2) [Unique σ] (p : Polynomial R) : (MvPolynomial.uniqueAlgEquiv R σ).symm p = Polynomial.eval₂ MvPolynomial.C (MvPolynomial.X default) p - MvPolynomial.eval₂_uniqueAlgEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Equiv
{σ : Type u_1} {R : Type u_2} {S : Type u_3} [CommSemiring R] [CommSemiring S] [Unique σ] {f : Polynomial R} {φ : R →+* S} {a : σ → S} : MvPolynomial.eval₂ φ a ((MvPolynomial.uniqueAlgEquiv R σ).symm f) = Polynomial.eval₂ φ (a default) f - Polynomial.toMvPolynomial_eq_rename_comp 📋 Mathlib.Algebra.MvPolynomial.Equiv
{R : Type u_1} {σ : Type u_3} [CommSemiring R] (i : σ) : Polynomial.toMvPolynomial i = (MvPolynomial.rename fun x => i).comp ↑(MvPolynomial.uniqueAlgEquiv R Unit).symm - MvPolynomial.coeff_uniqueAlgEquiv_symm 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) {σ : Type u_1} [CommSemiring R] [Unique σ] (P : Polynomial R) (d : σ →₀ ℕ) : ((MvPolynomial.uniqueAlgEquiv R σ).symm P).coeff d = P.coeff (d default) - MvPolynomial.optionEquivLeft_symm_X 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) [CommSemiring R] : (MvPolynomial.optionEquivLeft R S₁).symm Polynomial.X = MvPolynomial.X none - MvPolynomial.pUnitAlgEquiv_symm_monomial 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) [CommSemiring R] {d : PUnit.{1} →₀ ℕ} {r : R} : (MvPolynomial.pUnitAlgEquiv R).symm ((Polynomial.monomial (d ())) r) = (MvPolynomial.monomial d) r - MvPolynomial.uniqueAlgEquiv_symm_monomial 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) {σ : Type u_1} [CommSemiring R] [Unique σ] {d : σ →₀ ℕ} {r : R} : (MvPolynomial.uniqueAlgEquiv R σ).symm ((Polynomial.monomial (d default)) r) = (MvPolynomial.monomial d) r - MvPolynomial.sumAlgEquiv_symm_X 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (c : S₁) : (MvPolynomial.sumAlgEquiv R S₁ S₂).symm (MvPolynomial.X c) = MvPolynomial.X (Sum.inl c) - MvPolynomial.optionEquivLeft_symm_C_X 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) [CommSemiring R] (x : S₁) : (MvPolynomial.optionEquivLeft R S₁).symm (Polynomial.C (MvPolynomial.X x)) = MvPolynomial.X (some x) - MvPolynomial.sumAlgEquiv_symm_C_X 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (c : S₂) : (MvPolynomial.sumAlgEquiv R S₁ S₂).symm (MvPolynomial.C (MvPolynomial.X c)) = MvPolynomial.X (Sum.inr c) - MvPolynomial.optionEquivRight_symm_apply 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) [CommSemiring R] (a : MvPolynomial S₁ (Polynomial R)) : (MvPolynomial.optionEquivRight R S₁).symm a = (MvPolynomial.aevalTower (Polynomial.aeval (MvPolynomial.X none)) fun i => MvPolynomial.X (some i)) a - MvPolynomial.optionEquivLeft_symm_C_C 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) [CommSemiring R] (x : R) : (MvPolynomial.optionEquivLeft R S₁).symm (Polynomial.C (MvPolynomial.C x)) = MvPolynomial.C x - MvPolynomial.optionEquivLeft_symm_apply 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) [CommSemiring R] (a : Polynomial (MvPolynomial S₁ R)) : (MvPolynomial.optionEquivLeft R S₁).symm a = (Polynomial.aevalTower (MvPolynomial.rename some) (MvPolynomial.X none)) a - MvPolynomial.sumAlgEquiv_symm_C_C 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (r : R) : (MvPolynomial.sumAlgEquiv R S₁ S₂).symm (MvPolynomial.C (MvPolynomial.C r)) = MvPolynomial.C r - MvPolynomial.finSuccEquiv_comp_C_eq_C 📋 Mathlib.Algebra.MvPolynomial.Equiv
{R : Type u} [CommSemiring R] (n : ℕ) : (↑(MvPolynomial.finSuccEquiv R n).symm).comp (Polynomial.C.comp MvPolynomial.C) = MvPolynomial.C - MvPolynomial.coeff_sumAlgEquiv_symm_apply 📋 Mathlib.Algebra.MvPolynomial.Equiv
(R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (a✝ : MvPolynomial S₁ (MvPolynomial S₂ R)) : ((MvPolynomial.sumAlgEquiv R S₁ S₂).symm a✝).coeff = Finsupp.mapDomain (⇑Finsupp.sumFinsuppAddEquivProdFinsupp.symm) ({ toEquiv := ↑(AddMonoidAlgebra.curryAlgEquiv R).symm, map_mul' := ⋯, map_add' := ⋯ } a✝).coeff - Ideal.quotientEquivAlgOfEq_symm 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R₁ : Type u_1) {A : Type u_3} [CommSemiring R₁] [Ring A] [Algebra R₁ A] {I J : Ideal A} [I.IsTwoSided] [J.IsTwoSided] (h : I = J) : (Ideal.quotientEquivAlgOfEq R₁ h).symm = Ideal.quotientEquivAlgOfEq R₁ ⋯ - Ideal.quotientEquivAlg_symm 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
{R₁ : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R₁] [Ring A] [Algebra R₁ A] [Ring B] [Algebra R₁ B] {I : Ideal A} (J : Ideal B) [I.IsTwoSided] [J.IsTwoSided] (f : A ≃ₐ[R₁] B) (hIJ : J = Ideal.map (↑f) I) : (I.quotientEquivAlg J f hIJ).symm = J.quotientEquivAlg I f.symm ⋯ - AlgEquiv.quotientBot_symm_mk 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
{R : Type u_1} {S : Type u_2} [CommSemiring R] [CommRing S] [Algebra R S] (s : S) : (AlgEquiv.quotientBot R S).symm s = (Ideal.Quotient.mk ⊥) s - DoubleQuot.quotQuotEquivComm_symmₐ 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R : Type u) {A : Type u_1} [CommSemiring R] [CommRing A] [Algebra R A] (I J : Ideal A) : (DoubleQuot.quotQuotEquivCommₐ R I J).symm = DoubleQuot.quotQuotEquivCommₐ R J I - Ideal.quotientKerAlgEquivOfRightInverse_symm_apply 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
{R₁ : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R₁] [Ring A] [Algebra R₁ A] [Semiring B] [Algebra R₁ B] {f : A →ₐ[R₁] B} {g : B → A} (hf : Function.RightInverse g ⇑f) (a✝ : B) : (Ideal.quotientKerAlgEquivOfRightInverse hf).symm a✝ = (Ideal.Quotient.mk (RingHom.ker ↑f)) (g a✝) - DoubleQuot.quotQuotEquivQuotOfLE_symm_comp_mkₐ 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R : Type u) {A : Type u_1} [CommSemiring R] [CommRing A] [Algebra R A] {I J : Ideal A} (h : I ≤ J) : (↑(DoubleQuot.quotQuotEquivQuotOfLEₐ R h).symm).comp (Ideal.Quotient.mkₐ R J) = DoubleQuot.quotQuotMkₐ R I J - Ideal.quotientKerAlgEquivOfSurjective_symm_apply 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
{R₁ : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R₁] [Ring A] [Algebra R₁ A] [Semiring B] [Algebra R₁ B] {f : A →ₐ[R₁] B} (hf : Function.Surjective ⇑f) (a : A) : (Ideal.quotientKerAlgEquivOfSurjective hf).symm (f a) = (Ideal.Quotient.mk (RingHom.ker f)) a - DoubleQuot.quotQuotEquivQuotOfLEₐ_symm_toRingEquiv 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R : Type u) {A : Type u_1} [CommSemiring R] [CommRing A] [Algebra R A] {I J : Ideal A} (h : I ≤ J) : (DoubleQuot.quotQuotEquivQuotOfLEₐ R h).symm.toRingEquiv = (DoubleQuot.quotQuotEquivQuotOfLE h).symm - DoubleQuot.quotQuotEquivQuotSupₐ_symm_toRingEquiv 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R : Type u) {A : Type u_1} [CommSemiring R] [CommRing A] [Algebra R A] (I J : Ideal A) : (DoubleQuot.quotQuotEquivQuotSupₐ R I J).symm.toRingEquiv = (DoubleQuot.quotQuotEquivQuotSup I J).symm - DoubleQuot.coe_quotQuotEquivQuotOfLEₐ_symm 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R : Type u) {A : Type u_1} [CommSemiring R] [CommRing A] [Algebra R A] {I J : Ideal A} (h : I ≤ J) : ⇑(DoubleQuot.quotQuotEquivQuotOfLEₐ R h).symm = ⇑(DoubleQuot.quotQuotEquivQuotOfLE h).symm - DoubleQuot.coe_quotQuotEquivQuotSupₐ_symm 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R : Type u) {A : Type u_1} [CommSemiring R] [CommRing A] [Algebra R A] (I J : Ideal A) : ⇑(DoubleQuot.quotQuotEquivQuotSupₐ R I J).symm = ⇑(DoubleQuot.quotQuotEquivQuotSup I J).symm - Subalgebra.algEquivOpMop_symm_apply_coe 📋 Mathlib.Algebra.Algebra.Subalgebra.MulOpposite
{R : Type u_2} {A : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] (S : Subalgebra R A) (a✝ : (↥S.op)ᵐᵒᵖ) : ↑(S.algEquivOpMop.symm a✝) = MulOpposite.unop ↑(MulOpposite.unop a✝) - Subalgebra.mopAlgEquivOp_symm_apply 📋 Mathlib.Algebra.Algebra.Subalgebra.MulOpposite
{R : Type u_2} {A : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] (S : Subalgebra R A) (a✝ : ↥S.op) : S.mopAlgEquivOp.symm a✝ = MulOpposite.op (S.addEquivOp.symm a✝) - Polynomial.algEquivOfTranscendental_symm_gen 📋 Mathlib.RingTheory.Algebraic.Basic
(R : Type u_1) {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (s : S) (h : Transcendental R s) : (Polynomial.algEquivOfTranscendental R s h).symm ⟨s, ⋯⟩ = Polynomial.X - Polynomial.algEquivOfTranscendental_symm_aeval 📋 Mathlib.RingTheory.Algebraic.Basic
(R : Type u_1) {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (s : S) (h : Transcendental R s) (f : Polynomial R) : (Polynomial.algEquivOfTranscendental R s h).symm ((Polynomial.aeval ⟨s, ⋯⟩) f) = f - Algebra.IsPushout.equiv_symm_algebraMap_left 📋 Mathlib.RingTheory.IsTensorProduct
(R : Type u_1) (S : Type v₃) [CommSemiring R] [CommSemiring S] [Algebra R S] (R' : Type u_6) (S' : Type u_7) [CommSemiring R'] [CommSemiring S'] [Algebra R R'] [Algebra S S'] [Algebra R' S'] [Algebra R S'] [IsScalarTower R R' S'] [IsScalarTower R S S'] [Algebra.IsPushout R S R' S'] (a : S) : (Algebra.IsPushout.equiv R S R' S').symm ((algebraMap S S') a) = a ⊗ₜ[R] 1 - Algebra.IsPushout.equiv_symm_algebraMap_right 📋 Mathlib.RingTheory.IsTensorProduct
(R : Type u_1) (S : Type v₃) [CommSemiring R] [CommSemiring S] [Algebra R S] (R' : Type u_6) (S' : Type u_7) [CommSemiring R'] [CommSemiring S'] [Algebra R R'] [Algebra S S'] [Algebra R' S'] [Algebra R S'] [IsScalarTower R R' S'] [IsScalarTower R S S'] [Algebra.IsPushout R S R' S'] (a : R') : (Algebra.IsPushout.equiv R S R' S').symm ((algebraMap R' S') a) = 1 ⊗ₜ[R] a - Algebra.pushoutDesc_apply 📋 Mathlib.RingTheory.IsTensorProduct
{R : Type u_1} {S : Type v₃} [CommSemiring R] [CommSemiring S] [Algebra R S] {R' : Type u_6} (S' : Type u_7) [CommSemiring R'] [CommSemiring S'] [Algebra R R'] [Algebra S S'] [Algebra R' S'] [Algebra R S'] [IsScalarTower R R' S'] [IsScalarTower R S S'] [H : Algebra.IsPushout R S R' S'] {A : Type u_8} [Semiring A] [Algebra R A] (f : S →ₐ[R] A) (g : R' →ₐ[R] A) (hf : ∀ (x : S) (y : R'), f x * g y = g y * f x) (x : S') : (Algebra.pushoutDesc S' f g hf) x = (Algebra.TensorProduct.lift f g hf) ((Algebra.IsPushout.equiv R S R' S').symm x) - Algebra.IsPushout.cancelBaseChangeAlg_symm_tmul 📋 Mathlib.RingTheory.IsTensorProduct
(R : Type u_1) (S : Type v₃) [CommSemiring R] [CommSemiring S] [Algebra R S] (A : Type u_8) (B : Type u_9) [CommRing A] [CommRing B] [Algebra R A] [Algebra R B] [Algebra A B] [Algebra S B] [IsScalarTower R A B] [IsScalarTower R S B] [Algebra.IsPushout R S A B] (C : Type u_11) [CommRing C] [Algebra R C] [Algebra A C] [IsScalarTower R A C] (s : S) (c : C) : (Algebra.IsPushout.cancelBaseChangeAlg R S A B C).symm (s ⊗ₜ[R] c) = (algebraMap S B) s ⊗ₜ[A] c - Algebra.IsPushout.cancelBaseChange_symm_comp_lTensor 📋 Mathlib.RingTheory.IsTensorProduct
(R : Type u_1) [CommSemiring R] (A : Type u_8) [CommRing A] [Algebra R A] (C : Type u_11) [CommRing C] [Algebra R C] [Algebra A C] [IsScalarTower R A C] (S : Type u_12) [CommRing S] [Algebra R S] : (↑(Algebra.IsPushout.cancelBaseChangeAlg R S A (TensorProduct R S A) C).symm).comp (Algebra.TensorProduct.lTensor S (IsScalarTower.toAlgHom R A C)) = Algebra.TensorProduct.includeLeft - AlgEquiv.toAlgebraIso_inv 📋 Mathlib.Algebra.Category.AlgCat.Basic
{R : Type u} [CommRing R] {X₁ X₂ : Type v} {g₁ : Ring X₁} {g₂ : Ring X₂} {m₁ : Algebra R X₁} {m₂ : Algebra R X₂} (e : X₁ ≃ₐ[R] X₂) : e.toAlgebraIso.inv = AlgCat.ofHom ↑e.symm - CategoryTheory.Iso.toAlgEquiv_symm_apply 📋 Mathlib.Algebra.Category.AlgCat.Basic
{R : Type u} [CommRing R] {X Y : AlgCat R} (i : X ≅ Y) (a : ↑Y) : i.toAlgEquiv.symm a = (CategoryTheory.ConcreteCategory.hom i.inv) a - Matrix.reindexAlgEquiv_symm 📋 Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) (A : Type u_10) [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] [Semiring A] [Algebra R A] (e : m ≃ n) : (Matrix.reindexAlgEquiv R A e).symm = Matrix.reindexAlgEquiv R A e.symm - Matrix.symm_reindexAlgEquiv 📋 Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) (A : Type u_10) [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] [Semiring A] [Algebra R A] (e : m ≃ n) : (Matrix.reindexAlgEquiv R A e).symm = Matrix.reindexAlgEquiv R A e.symm - AlgCat.hom_inv_leftUnitor 📋 Mathlib.Algebra.Category.AlgCat.Monoidal
{R : Type u} [CommRing R] {M : AlgCat R} : AlgCat.Hom.hom (CategoryTheory.MonoidalCategoryStruct.leftUnitor M).inv = ↑(Algebra.TensorProduct.lid R ↑M).symm - AlgCat.hom_inv_rightUnitor 📋 Mathlib.Algebra.Category.AlgCat.Monoidal
{R : Type u} [CommRing R] {M : AlgCat R} : AlgCat.Hom.hom (CategoryTheory.MonoidalCategoryStruct.rightUnitor M).inv = ↑(Algebra.TensorProduct.rid (↑(CategoryTheory.MonoidalCategoryStruct.tensorUnit (AlgCat R))) R ↑M).symm - AlgCat.hom_inv_associator 📋 Mathlib.Algebra.Category.AlgCat.Monoidal
{R : Type u} [CommRing R] {M N K : AlgCat R} : AlgCat.Hom.hom (CategoryTheory.MonoidalCategoryStruct.associator M N K).inv = ↑(Algebra.TensorProduct.assoc R R R ↑M ↑N ↑K).symm - RingCon.congrₐ_symm 📋 Mathlib.RingTheory.Congruence.Hom
{M : Type u_1} {N : Type u_2} {R : Type u_4} [CommSemiring R] [Semiring M] [Algebra R M] [Semiring N] [Algebra R N] {c : RingCon M} {d : RingCon N} (e : M ≃ₐ[R] N) (h : c = d.comap e) : (RingCon.congrₐ R e h).symm = RingCon.congrₐ R e.symm ⋯ - RingCon.coe_comapQuotientEquivRangeₐ_symm_mk 📋 Mathlib.RingTheory.Congruence.Hom
{M : Type u_1} {N : Type u_2} {R : Type u_4} [CommSemiring R] [Semiring M] [Algebra R M] [Semiring N] [Algebra R N] (c : RingCon M) (f : N →ₐ[R] M) (x : N) {d : RingCon N} (h : d = c.comap f) : (c.comapQuotientEquivRangeₐ f h).symm ⟨↑(f x), ⋯⟩ = ↑x - RingCon.quotientQuotientEquivQuotientₐ_symm_mk 📋 Mathlib.RingTheory.Congruence.Hom
{M : Type u_1} (R : Type u_4) [CommSemiring R] [Semiring M] [Algebra R M] {c d : RingCon M} (h : c ≤ d) (x : M) : (RingCon.quotientQuotientEquivQuotientₐ R h).symm ⟦x⟧ = ⟦⟦x⟧⟧ - Bialgebra.ofAlgHom 📋 Mathlib.RingTheory.Bialgebra.Basic
{R : Type u_1} {A : Type u_2} [CommSemiring R] [Semiring A] [Algebra R A] (comul : A →ₐ[R] TensorProduct R A A) (counit : A →ₐ[R] R) (h_coassoc : (↑(Algebra.TensorProduct.assoc R R R A A A)).comp ((Algebra.TensorProduct.map comul (AlgHom.id R A)).comp comul) = (Algebra.TensorProduct.map (AlgHom.id R A) comul).comp comul) (h_rTensor : (Algebra.TensorProduct.map counit (AlgHom.id R A)).comp comul = ↑(Algebra.TensorProduct.lid R A).symm) (h_lTensor : (Algebra.TensorProduct.map (AlgHom.id R A) counit).comp comul = ↑(Algebra.TensorProduct.rid R R A).symm) : Bialgebra R A - AlgEquiv.toUnder_inv_right_apply 📋 Mathlib.Algebra.Category.Ring.Under.Basic
{R : CommRingCat} {A B : Type u} [CommRing A] [CommRing B] [Algebra (↑R) A] [Algebra (↑R) B] (f : A ≃ₐ[↑R] B) (b : B) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Under.Hom.right f.toUnder.inv)) b = f.symm b
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