Documentation

LeanPool.Monlib4.LinearAlgebra.Coalgebra.FiniteDimensional

LeanPool.Monlib4.LinearAlgebra.Coalgebra.FiniteDimensional #

Imported Lean Pool material for LeanPool.Monlib4.LinearAlgebra.Coalgebra.FiniteDimensional.

theorem LinearMap.rTensor_adjoint {𝕜 : Type u_3} {A : Type u_4} {B : Type u_5} {C : Type u_6} [RCLike 𝕜] [NormedAddCommGroup A] [NormedAddCommGroup B] [NormedAddCommGroup C] [InnerProductSpace 𝕜 A] [InnerProductSpace 𝕜 B] [InnerProductSpace 𝕜 C] [FiniteDimensional 𝕜 A] [FiniteDimensional 𝕜 B] [FiniteDimensional 𝕜 C] (f : A →ₗ[𝕜] B) :
theorem LinearMap.lTensor_adjoint {𝕜 : Type u_3} {A : Type u_4} {B : Type u_5} {C : Type u_6} [RCLike 𝕜] [NormedAddCommGroup A] [NormedAddCommGroup B] [NormedAddCommGroup C] [InnerProductSpace 𝕜 A] [InnerProductSpace 𝕜 B] [InnerProductSpace 𝕜 C] [FiniteDimensional 𝕜 A] [FiniteDimensional 𝕜 B] [FiniteDimensional 𝕜 C] (f : A →ₗ[𝕜] B) :
@[reducible]
Equations
  • One or more equations did not get rendered due to their size.
theorem Coalgebra.inner_eq_counit' {R : Type u_1} {A : Type u_2} [RCLike R] [NormedAddCommGroupOfRing A] [InnerProductSpace R A] [SMulCommClass R A A] [IsScalarTower R A A] [FiniteDimensional R A] :
(fun (x : A) => inner R 1 x) = counit
theorem Coalgebra.rTensor_mul_comp_lTensor_comul {R : Type u_1} {A : Type u_2} [RCLike R] [NormedAddCommGroupOfRing A] [InnerProductSpace R A] [SMulCommClass R A A] [IsScalarTower R A A] [FiniteDimensional R A] (h : ∃ (σ : AA), ∀ (x y z : A), inner R (x * y) z = inner R y (σ x * z)) :
theorem Coalgebra.lTensor_mul_comp_rTensor_comul_of {R : Type u_1} {A : Type u_2} [RCLike R] [NormedAddCommGroupOfRing A] [InnerProductSpace R A] [SMulCommClass R A A] [IsScalarTower R A A] [FiniteDimensional R A] (h : ∃ (σ : AA), ∀ (x y z : A), inner R (x * y) z = inner R y (σ x * z)) :
@[reducible]
noncomputable def FiniteDimensionalCoAlgebraIsFrobeniusAlgebraOf {R : Type u_1} {A : Type u_2} [RCLike R] [NormedAddCommGroupOfRing A] [InnerProductSpace R A] [SMulCommClass R A A] [IsScalarTower R A A] [FiniteDimensional R A] (h : ∃ (σ : AA), ∀ (x y z : A), inner R (x * y) z = inner R y (σ x * z)) :

Construct the Frobenius algebra structure from finite-dimensional Hilbert-algebra data.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    structure LinearMap.IsCoalgHom {R : Type u_3} {A : Type u_4} {B : Type u_5} [CommSemiring R] [AddCommMonoid A] [Module R A] [AddCommMonoid B] [Module R B] [CoalgebraStruct R A] [CoalgebraStruct R B] (x : A →ₗ[R] B) :

    Predicate for linear maps that preserve the counit and comultiplication.

    Instances For
      structure LinearMap.IsAlgHom {R : Type u_3} {A : Type u_4} {B : Type u_5} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (x : A →ₗ[R] B) :

      Predicate for linear maps that preserve the unit and multiplication.

      Instances For
        theorem LinearMap.isAlgHom_iff {R : Type u_3} {A : Type u_4} {B : Type u_5} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (x : A →ₗ[R] B) :
        theorem AlgHom.isAlgHom {R : Type u_3} {A : Type u_4} {B : Type u_5} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (x : A →ₐ[R] B) :
        theorem AlgEquiv.isAlgHom {R : Type u_3} {A : Type u_4} {B : Type u_5} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (x : A ≃ₐ[R] B) :