Documentation

Atlas.TensorCategories.code.CoalgebraBialgebra

@[reducible, inline]
abbrev Definition_1_20_1 (R : Type u) (C : Type v) [CommSemiring R] [AddCommMonoid C] [Module R C] :
Type (max u v)
Instances For
    structure Subcoalgebra (R : Type u) (A : Type v) [CommSemiring R] [AddCommMonoid A] [Module R A] [Coalgebra R A] extends Submodule R A :
    Instances For
      @[implicit_reducible]
      instance Subcoalgebra.instSetLike {R : Type u} {A : Type v} [CommSemiring R] [AddCommMonoid A] [Module R A] [Coalgebra R A] :
      @[reducible, inline]
      abbrev LeftComodule_def_1_20_2 (R : Type u) (C : Type v) (M : Type u_1) [CommSemiring R] [AddCommMonoid C] [Module R C] [Coalgebra R C] [AddCommMonoid M] [Module R M] :
      Type (max u_1 v)
      Instances For
        @[reducible, inline]
        abbrev Definition_1_20_2 (R : Type u) (C : Type v) (M : Type u_1) [CommSemiring R] [AddCommMonoid C] [Module R C] [Coalgebra R C] [AddCommMonoid M] [Module R M] :
        Type (max u_1 v)
        Instances For
          @[implicit_reducible]
          instance Coalgebra.regularComodule (R : Type u) (C : Type v) [CommSemiring R] [AddCommMonoid C] [Module R C] [Coalgebra R C] :
          Comodule R C C
          @[reducible, inline]
          abbrev RightComodule_def_1_20_2 (R : Type u) (C : Type v) (M : Type u_1) [CommSemiring R] [AddCommMonoid C] [Module R C] [Coalgebra R C] [AddCommMonoid M] [Module R M] :
          Type (max u_1 v)
          Instances For
            @[implicit_reducible]

            The counit End(F) → k of the bialgebra End(F) of a fiber functor F: evaluate the natural transformation at the unit object and read off its action on 1 ∈ k.

            Instances For

              The bifunctor (X, Y) ↦ F(X) ⊗ F(Y) from C × C to ModuleCat k, used to express the multiplicative structure on End(F).

              Instances For
                @[implicit_reducible]

                The tensor product End(F) ⊗_k End(F) is itself a (semi)ring via the tensor product of algebras.

                @[implicit_reducible]

                The tensor product End(F) ⊗_k End(F) is a k-algebra.

                Proposition 1.18.3: the canonical algebra isomorphism End(F₁) ⊗ End(F₂) ≅ End(F₁ ⊗ F₂), here specialized to F₁ = F₂ = F.

                Instances For

                  Evaluation map sending an endomorphism η ∈ End F to its component at Z, viewed as a k-linear endomorphism of F.obj Z.

                  Instances For
                    def wrapEnd (k : Type u) [CommRing k] (M : ModuleCat k) :

                    Wrap a k-linear endomorphism of the underlying module into the corresponding endomorphism in ModuleCat k.

                    Instances For

                      The canonical map End(F) ⊗ End(F) → End(F(X) ⊗ F(Y)) sending η₁ ⊗ η₂ to η₁ ⊗ η₂ evaluated component-wise.

                      Instances For

                        On a simple tensor η₁ ⊗ η₂, endF_tensor_hom returns the tensor product of the component morphisms η₁.app X ⊗ₘ η₂.app Y.

                        Existence half of Proposition 1.18.3: there is a comultiplication Δ : End(F) → End(F) ⊗ End(F) whose image under endF_tensor_hom recovers the "conjugated" component-wise action of η on F(X ⊗ Y).

                        Faithfulness consequence of Proposition 1.18.3: the system of maps endF_tensor_hom across all X, Y jointly separates elements of End(F) ⊗ End(F).

                        The map endF_tensor_hom k C F X Y is multiplicative on End(F) ⊗ End(F).

                        The comultiplication on End(F) produced by Proposition 1.18.3.

                        Instances For

                          Specification property of endF_comul: under endF_tensor_hom, the comultiplication of η is the conjugate of η.app (X ⊗ Y) by the monoidal multiplication isomorphism.

                          Two elements of End(F) ⊗ End(F) agreeing under all endF_tensor_hom maps must be equal, by the injectivity of the joint evaluation.

                          Theorem 1.21.1: The endomorphism algebra End(F) of a fiber functor is a bialgebra, i.e. its comultiplication and counit are unital algebra homomorphisms satisfying the coassociativity, counit, and multiplicativity properties.

                          @[implicit_reducible]

                          The coalgebra structure on End(F) arising from endF_comul and endF_counit_def.

                          @[reducible]

                          Theorem 1.21.1: The bialgebra structure on End(F) of a fiber functor F, combining the coalgebra structure with the unit/multiplicativity axioms.

                          Instances For
                            @[reducible]
                            def thm_1_21_1_converse (R' : Type u_1) (H' : Type u_2) [CommSemiring R'] [Semiring H'] [Algebra R' H'] (Δ : H' →ₐ[R'] TensorProduct R' H' H') (ε : H' →ₐ[R'] R') (h_coassoc : (↑(Algebra.TensorProduct.assoc R' R' R' H' H' H')).comp ((Algebra.TensorProduct.map Δ (AlgHom.id R' H')).comp Δ) = (Algebra.TensorProduct.map (AlgHom.id R' H') Δ).comp Δ) (h_rTensor : (Algebra.TensorProduct.map ε (AlgHom.id R' H')).comp Δ = (Algebra.TensorProduct.lid R' H').symm) (h_lTensor : (Algebra.TensorProduct.map (AlgHom.id R' H') ε).comp Δ = (Algebra.TensorProduct.rid R' R' H').symm) :
                            Bialgebra R' H'

                            Converse direction for Theorem 1.21.1: a k-algebra equipped with algebra maps Δ, ε satisfying the coassociativity and counit axioms is a bialgebra.

                            Instances For
                              @[reducible, inline]
                              abbrev IsBialgebra (R : Type u) (H : Type v) [CommSemiring R] [Semiring H] :
                              Type (max u v)

                              A bialgebra over R is an algebra equipped with a compatible coalgebra structure.

                              Instances For
                                @[reducible, inline]
                                abbrev Definition_1_21_2 (R : Type u) (H : Type v) [CommSemiring R] [Semiring H] :
                                Type (max u v)

                                Definition 1.21.2: An algebra H with comultiplication Δ and counit ε satisfying the bialgebra axioms is called a bialgebra.

                                Instances For
                                  theorem Coalgebra.exists_fg_submodule_comul_mem {R : Type u} {C : Type v} [CommRing R] [AddCommGroup C] [Module R C] [Coalgebra R C] (c : C) :
                                  ∃ (V : Submodule R C), V.FG c V comul c Submodule.map₂ (TensorProduct.mk R C C) V

                                  Fundamental theorem ingredient: every element c of a coalgebra C lies in some finitely generated submodule V such that Δ(c) ∈ C ⊗ V.