Matrices over a category.

When C is a preadditive category, Mat_ C is the preadditive category whose objects are finite tuples of objects in C, and whose morphisms are matrices of morphisms from C.

There is a functor Mat_.embedding : C ⥤ Mat_ C sending morphisms to one-by-one matrices.

Mat_ C has finite biproducts.

The additive envelope

We show that this construction is the "additive envelope" of C, in the sense that any additive functor F : C ⥤ D to a category D with biproducts lifts to a functor Mat_.lift F : Mat_ C ⥤ D, Moreover, this functor is unique (up to natural isomorphisms) amongst functors L : Mat_ C ⥤ D such that embedding C ⋙ L ≅ F. (As we don't have 2-category theory, we can't explicitly state that Mat_ C is the initial object in the 2-category of categories under C which have biproducts.)

As a consequence, when C already has finite biproducts we have Mat_ C ≌ C.

Future work

We should provide a more convenient Mat R, when R is a ring, as a category with objects n : FinType, and whose morphisms are matrices with components in R.

Ideally this would conveniently interact with both Mat_ and Matrix.

structure CategoryTheory.Mat_ (C : Type u₁) : Type (max 1 u₁)

An object in Mat_ C is a finite tuple of objects in C.

• ι : Type
• fintype : Fintype self.ι
• X : self.ι → C

def CategoryTheory.Mat_.Hom {C : Type u₁} [Category.{v₁, u₁} C] (M N : Mat_ C) : Type v₁

A morphism in Mat_ C is a dependently typed matrix of morphisms.

Equations

• M.Hom N = DMatrix M.ι N.ι fun (i : M.ι) (j : N.ι) => M.X i ⟶ N.X j

def CategoryTheory.Mat_.Hom.id {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) : M.Hom M

The identity matrix consists of identity morphisms on the diagonal, and zeros elsewhere.

Equations

• CategoryTheory.Mat_.Hom.id M i j = if h : i = j then CategoryTheory.eqToHom ⋯ else 0

def CategoryTheory.Mat_.Hom.comp {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {M N K : Mat_ C} (f : M.Hom N) (g : N.Hom K) : M.Hom K

Composition of matrices using matrix multiplication.

Equations

• f.comp g i k = ∑ j : N.ι, CategoryTheory.CategoryStruct.comp (f i j) (g j k)

instance CategoryTheory.Mat_.instCategory {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] : Category.{v₁, max 1 u₁} (Mat_ C)

Equations

• CategoryTheory.Mat_.instCategory = CategoryTheory.Category.mk ⋯ ⋯ ⋯

theorem CategoryTheory.Mat_.hom_ext {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {M N : Mat_ C} (f g : M ⟶ N) (H : ∀ (i : M.ι) (j : N.ι), f i j = g i j) : f = g

theorem CategoryTheory.Mat_.id_def {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) : CategoryStruct.id M = fun (i j : M.ι) => if h : i = j then eqToHom ⋯ else 0

theorem CategoryTheory.Mat_.id_apply {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) (i j : M.ι) : CategoryStruct.id M i j = if h : i = j then eqToHom ⋯ else 0

@[simp]

theorem CategoryTheory.Mat_.id_apply_self {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) (i : M.ι) : CategoryStruct.id M i i = CategoryStruct.id (M.X i)

@[simp]

theorem CategoryTheory.Mat_.id_apply_of_ne {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) (i j : M.ι) (h : i ≠ j) : CategoryStruct.id M i j = 0

theorem CategoryTheory.Mat_.comp_def {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {M N K : Mat_ C} (f : M ⟶ N) (g : N ⟶ K) : CategoryStruct.comp f g = fun (i : M.ι) (k : K.ι) => ∑ j : N.ι, CategoryStruct.comp (f i j) (g j k)

@[simp]

theorem CategoryTheory.Mat_.comp_apply {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {M N K : Mat_ C} (f : M ⟶ N) (g : N ⟶ K) (i : M.ι) (k : K.ι) : CategoryStruct.comp f g i k = ∑ j : N.ι, CategoryStruct.comp (f i j) (g j k)

instance CategoryTheory.Mat_.instInhabitedHom {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M N : Mat_ C) : Inhabited (M ⟶ N)

Equations

• M.instInhabitedHom N = { default := fun (i : M.ι) (j : N.ι) => 0 }

instance CategoryTheory.Mat_.instAddCommGroupHom {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M N : Mat_ C) : AddCommGroup (M ⟶ N)

Equations

• M.instAddCommGroupHom N = id inferInstance

@[simp]

theorem CategoryTheory.Mat_.add_apply {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {M N : Mat_ C} (f g : M ⟶ N) (i : M.ι) (j : N.ι) : (f + g) i j = f i j + g i j

instance CategoryTheory.Mat_.instPreadditive {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] : Preadditive (Mat_ C)

Equations

• CategoryTheory.Mat_.instPreadditive = { homGroup := inferInstance, add_comp := ⋯, comp_add := ⋯ }

instance CategoryTheory.Mat_.hasFiniteBiproducts {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] : Limits.HasFiniteBiproducts (Mat_ C)

We now prove that Mat_ C has finite biproducts.

Be warned, however, that Mat_ C is not necessarily Krull-Schmidt, and so the internal indexing of a biproduct may have nothing to do with the external indexing, even though the construction we give uses a sigma type. See however isoBiproductEmbedding.

def CategoryTheory.Functor.mapMat_ {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] (F : Functor C D) [F.Additive] : Functor (Mat_ C) (Mat_ D)

A functor induces a functor of matrix categories.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Functor.mapMat__obj_X {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] (F : Functor C D) [F.Additive] (M : Mat_ C) (i : M.ι) : (F.mapMat_.obj M).X i = F.obj (M.X i)

@[simp]

theorem CategoryTheory.Functor.mapMat__map {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] (F : Functor C D) [F.Additive] {X✝ Y✝ : Mat_ C} (f : X✝ ⟶ Y✝) (i : ((fun (M : Mat_ C) => Mat_.mk M.ι fun (i : M.ι) => F.obj (M.X i)) X✝).ι) (j : ((fun (M : Mat_ C) => Mat_.mk M.ι fun (i : M.ι) => F.obj (M.X i)) Y✝).ι) : F.mapMat_.map f i j = F.map (f i j)

@[simp]

theorem CategoryTheory.Functor.mapMat__obj_fintype {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] (F : Functor C D) [F.Additive] (M : Mat_ C) : (F.mapMat_.obj M).fintype = M.fintype

@[simp]

theorem CategoryTheory.Functor.mapMat__obj_ι {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] (F : Functor C D) [F.Additive] (M : Mat_ C) : (F.mapMat_.obj M).ι = M.ι

def CategoryTheory.Functor.mapMatId {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] : (Functor.id C).mapMat_ ≅ Functor.id (Mat_ C)

The identity functor induces the identity functor on matrix categories.

Equations

• CategoryTheory.Functor.mapMatId = CategoryTheory.NatIso.ofComponents (fun (M : CategoryTheory.Mat_ C) => CategoryTheory.eqToIso ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.mapMatId_hom_app {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (X : Mat_ C) : mapMatId.hom.app X = CategoryStruct.id ((Functor.id C).mapMat_.obj X)

@[simp]

theorem CategoryTheory.Functor.mapMatId_inv_app {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (X : Mat_ C) : mapMatId.inv.app X = CategoryStruct.id ((Functor.id C).mapMat_.obj X)

def CategoryTheory.Functor.mapMatComp {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] {E : Type u_2} [Category.{v₁, u_2} E] [Preadditive E] (F : Functor C D) [F.Additive] (G : Functor D E) [G.Additive] : (F.comp G).mapMat_ ≅ F.mapMat_.comp G.mapMat_

Composite functors induce composite functors on matrix categories.

Equations

• F.mapMatComp G = CategoryTheory.NatIso.ofComponents (fun (M : CategoryTheory.Mat_ C) => CategoryTheory.eqToIso ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.mapMatComp_hom_app {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] {E : Type u_2} [Category.{v₁, u_2} E] [Preadditive E] (F : Functor C D) [F.Additive] (G : Functor D E) [G.Additive] (X : Mat_ C) : (F.mapMatComp G).hom.app X = CategoryStruct.id ((F.comp G).mapMat_.obj X)

@[simp]

theorem CategoryTheory.Functor.mapMatComp_inv_app {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u_1} [Category.{v₁, u_1} D] [Preadditive D] {E : Type u_2} [Category.{v₁, u_2} E] [Preadditive E] (F : Functor C D) [F.Additive] (G : Functor D E) [G.Additive] (X : Mat_ C) : (F.mapMatComp G).inv.app X = CategoryStruct.id ((F.comp G).mapMat_.obj X)

def CategoryTheory.Mat_.embedding (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] : Functor C (Mat_ C)

The embedding of C into Mat_ C as one-by-one matrices. (We index the summands by PUnit.)

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Mat_.embedding_obj_ι (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] (X : C) : ((embedding C).obj X).ι = PUnit.{1}

@[simp]

theorem CategoryTheory.Mat_.embedding_map (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) (x✝ : ((fun (X : C) => mk PUnit.{1} fun (x : PUnit.{1}) => X) X✝).ι) (x✝¹ : ((fun (X : C) => mk PUnit.{1} fun (x : PUnit.{1}) => X) Y✝).ι) : (embedding C).map f x✝ x✝¹ = f

@[simp]

theorem CategoryTheory.Mat_.embedding_obj_X (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] (X : C) (x✝ : PUnit.{1}) : ((embedding C).obj X).X x✝ = X

@[simp]

theorem CategoryTheory.Mat_.embedding_obj_fintype (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] (X : C) : ((embedding C).obj X).fintype = PUnit.fintype

instance CategoryTheory.Mat_.Embedding.instFaithfulEmbedding (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] : (embedding C).Faithful

instance CategoryTheory.Mat_.Embedding.instFullEmbedding (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] : (embedding C).Full

instance CategoryTheory.Mat_.Embedding.instAdditiveEmbedding (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] : (embedding C).Additive

instance CategoryTheory.Mat_.instInhabited (C : Type u₁) [Category.{v₁, u₁} C] [Preadditive C] [Inhabited C] : Inhabited (Mat_ C)

Equations

• CategoryTheory.Mat_.instInhabited C = { default := (CategoryTheory.Mat_.embedding C).obj default }

def CategoryTheory.Mat_.isoBiproductEmbedding {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) : M ≅ ⨁ fun (i : M.ι) => (embedding C).obj (M.X i)

Every object in Mat_ C is isomorphic to the biproduct of its summands.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Mat_.isoBiproductEmbedding_inv {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) : M.isoBiproductEmbedding.inv = Limits.biproduct.desc fun (i : M.ι) (x : ((embedding C).obj (M.X i)).ι) (k : M.ι) => if h : i = k then eqToHom ⋯ else 0

@[simp]

theorem CategoryTheory.Mat_.isoBiproductEmbedding_hom {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] (M : Mat_ C) : M.isoBiproductEmbedding.hom = Limits.biproduct.lift fun (i j : M.ι) (x : ((embedding C).obj (M.X i)).ι) => if h : j = i then eqToHom ⋯ else 0

instance CategoryTheory.Mat_.instHasBiproductιObjEmbeddingXOfAdditive {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] (F : Functor (Mat_ C) D) [F.Additive] (M : Mat_ C) : Limits.HasBiproduct fun (i : M.ι) => F.obj ((embedding C).obj (M.X i))

def CategoryTheory.Mat_.additiveObjIsoBiproduct {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] (F : Functor (Mat_ C) D) [F.Additive] (M : Mat_ C) : F.obj M ≅ ⨁ fun (i : M.ι) => F.obj ((embedding C).obj (M.X i))

Every M is a direct sum of objects from C, and F preserves biproducts.

Equations

• CategoryTheory.Mat_.additiveObjIsoBiproduct F M = F.mapIso M.isoBiproductEmbedding ≪≫ F.mapBiproduct fun (i : M.ι) => (CategoryTheory.Mat_.embedding C).obj (M.X i)

@[simp]

theorem CategoryTheory.Mat_.additiveObjIsoBiproduct_hom_π {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] (F : Functor (Mat_ C) D) [F.Additive] (M : Mat_ C) (i : M.ι) : CategoryStruct.comp (additiveObjIsoBiproduct F M).hom (Limits.biproduct.π (fun (i : M.ι) => F.obj ((embedding C).obj (M.X i))) i) = F.map (CategoryStruct.comp M.isoBiproductEmbedding.hom (Limits.biproduct.π (fun (i : M.ι) => (embedding C).obj (M.X i)) i))

@[simp]

theorem CategoryTheory.Mat_.additiveObjIsoBiproduct_hom_π_assoc {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] (F : Functor (Mat_ C) D) [F.Additive] (M : Mat_ C) (i : M.ι) {Z : D} (h : F.obj ((embedding C).obj (M.X i)) ⟶ Z) : CategoryStruct.comp (additiveObjIsoBiproduct F M).hom (CategoryStruct.comp (Limits.biproduct.π (fun (i : M.ι) => F.obj ((embedding C).obj (M.X i))) i) h) = CategoryStruct.comp (F.map (CategoryStruct.comp M.isoBiproductEmbedding.hom (Limits.biproduct.π (fun (i : M.ι) => (embedding C).obj (M.X i)) i))) h

@[simp]

theorem CategoryTheory.Mat_.ι_additiveObjIsoBiproduct_inv {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] (F : Functor (Mat_ C) D) [F.Additive] (M : Mat_ C) (i : M.ι) : CategoryStruct.comp (Limits.biproduct.ι (fun (i : M.ι) => F.obj ((embedding C).obj (M.X i))) i) (additiveObjIsoBiproduct F M).inv = F.map (CategoryStruct.comp (Limits.biproduct.ι (fun (i : M.ι) => (embedding C).obj (M.X i)) i) M.isoBiproductEmbedding.inv)

@[simp]

theorem CategoryTheory.Mat_.ι_additiveObjIsoBiproduct_inv_assoc {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] (F : Functor (Mat_ C) D) [F.Additive] (M : Mat_ C) (i : M.ι) {Z : D} (h : F.obj M ⟶ Z) : CategoryStruct.comp (Limits.biproduct.ι (fun (i : M.ι) => F.obj ((embedding C).obj (M.X i))) i) (CategoryStruct.comp (additiveObjIsoBiproduct F M).inv h) = CategoryStruct.comp (F.map (CategoryStruct.comp (Limits.biproduct.ι (fun (i : M.ι) => (embedding C).obj (M.X i)) i) M.isoBiproductEmbedding.inv)) h

theorem CategoryTheory.Mat_.additiveObjIsoBiproduct_naturality {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor (Mat_ C) D) [F.Additive] {M N : Mat_ C} (f : M ⟶ N) : CategoryStruct.comp (F.map f) (additiveObjIsoBiproduct F N).hom = CategoryStruct.comp (additiveObjIsoBiproduct F M).hom (Limits.biproduct.matrix fun (i : M.ι) (j : N.ι) => F.map ((embedding C).map (f i j)))

theorem CategoryTheory.Mat_.additiveObjIsoBiproduct_naturality_assoc {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor (Mat_ C) D) [F.Additive] {M N : Mat_ C} (f : M ⟶ N) {Z : D} (h : (⨁ fun (i : N.ι) => F.obj ((embedding C).obj (N.X i))) ⟶ Z) : CategoryStruct.comp (F.map f) (CategoryStruct.comp (additiveObjIsoBiproduct F N).hom h) = CategoryStruct.comp (additiveObjIsoBiproduct F M).hom (CategoryStruct.comp (Limits.biproduct.matrix fun (i : M.ι) (j : N.ι) => F.map ((embedding C).map (f i j))) h)

theorem CategoryTheory.Mat_.additiveObjIsoBiproduct_naturality' {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor (Mat_ C) D) [F.Additive] {M N : Mat_ C} (f : M ⟶ N) : CategoryStruct.comp (additiveObjIsoBiproduct F M).inv (F.map f) = CategoryStruct.comp (Limits.biproduct.matrix fun (i : M.ι) (j : N.ι) => F.map ((embedding C).map (f i j))) (additiveObjIsoBiproduct F N).inv

theorem CategoryTheory.Mat_.additiveObjIsoBiproduct_naturality'_assoc {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor (Mat_ C) D) [F.Additive] {M N : Mat_ C} (f : M ⟶ N) {Z : D} (h : F.obj N ⟶ Z) : CategoryStruct.comp (additiveObjIsoBiproduct F M).inv (CategoryStruct.comp (F.map f) h) = CategoryStruct.comp (Limits.biproduct.matrix fun (i : M.ι) (j : N.ι) => F.map ((embedding C).map (f i j))) (CategoryStruct.comp (additiveObjIsoBiproduct F N).inv h)

def CategoryTheory.Mat_.lift {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] : Functor (Mat_ C) D

Any additive functor C ⥤ D to a category D with finite biproducts extends to a functor Mat_ C ⥤ D.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Mat_.lift_map {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] {X✝ Y✝ : Mat_ C} (f : X✝ ⟶ Y✝) : (lift F).map f = Limits.biproduct.matrix fun (i : X✝.ι) (j : Y✝.ι) => F.map (f i j)

@[simp]

theorem CategoryTheory.Mat_.lift_obj {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] (X : Mat_ C) : (lift F).obj X = ⨁ fun (i : X.ι) => F.obj (X.X i)

instance CategoryTheory.Mat_.lift_additive {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] : (lift F).Additive

def CategoryTheory.Mat_.embeddingLiftIso {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] : (embedding C).comp (lift F) ≅ F

An additive functor C ⥤ D factors through its lift to Mat_ C ⥤ D.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Mat_.embeddingLiftIso_hom_app {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] (X : C) : (embeddingLiftIso F).hom.app X = Limits.biproduct.desc fun (x : PUnit.{1}) => CategoryStruct.id (F.obj X)

@[simp]

theorem CategoryTheory.Mat_.embeddingLiftIso_inv_app {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] (X : C) : (embeddingLiftIso F).inv.app X = Limits.biproduct.lift fun (x : PUnit.{1}) => CategoryStruct.id (F.obj X)

def CategoryTheory.Mat_.liftUnique {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] (F : Functor C D) [F.Additive] (L : Functor (Mat_ C) D) [L.Additive] (α : (embedding C).comp L ≅ F) : L ≅ lift F

Mat_.lift F is the unique additive functor L : Mat_ C ⥤ D such that F ≅ embedding C ⋙ L.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.Mat_.ext {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] {D : Type u₁} [Category.{v₁, u₁} D] [Preadditive D] [Limits.HasFiniteBiproducts D] {F G : Functor (Mat_ C) D} [F.Additive] [G.Additive] (α : (embedding C).comp F ≅ (embedding C).comp G) : F ≅ G

Two additive functors Mat_ C ⥤ D are naturally isomorphic if their precompositions with embedding C are naturally isomorphic as functors C ⥤ D.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.Mat_.equivalenceSelfOfHasFiniteBiproductsAux {C : Type u₁} [Category.{v₁, u₁} C] [Preadditive C] [Limits.HasFiniteBiproducts C] : (embedding C).comp (Functor.id (Mat_ C)) ≅ (embedding C).comp ((lift (Functor.id C)).comp (embedding C))

Natural isomorphism needed in the construction of equivalenceSelfOfHasFiniteBiproducts.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.Mat_.equivalenceSelfOfHasFiniteBiproducts (C : Type (u₁ + 1)) [LargeCategory C] [Preadditive C] [Limits.HasFiniteBiproducts C] : Mat_ C ≌ C

A preadditive category that already has finite biproducts is equivalent to its additive envelope.

Note that we only prove this for a large category; otherwise there are universe issues that I haven't attempted to sort out.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Mat_.equivalenceSelfOfHasFiniteBiproducts_functor {C : Type (u₁ + 1)} [LargeCategory C] [Preadditive C] [Limits.HasFiniteBiproducts C] : (equivalenceSelfOfHasFiniteBiproducts C).functor = lift (Functor.id C)

@[simp]

theorem CategoryTheory.Mat_.equivalenceSelfOfHasFiniteBiproducts_inverse {C : Type (u₁ + 1)} [LargeCategory C] [Preadditive C] [Limits.HasFiniteBiproducts C] : (equivalenceSelfOfHasFiniteBiproducts C).inverse = embedding C

def CategoryTheory.Mat : Type u → Type (u + 1)

A type synonym for Fintype, which we will equip with a category structure where the morphisms are matrices with components in R.

Equations

• CategoryTheory.Mat x✝ = FintypeCat

instance CategoryTheory.instInhabitedMat (R : Type u) : Inhabited (Mat R)

Equations

• CategoryTheory.instInhabitedMat R = id inferInstance

instance CategoryTheory.instCoeSortMatType (R : Type u) : CoeSort (Mat R) (Type u)

Equations

• CategoryTheory.instCoeSortMatType R = CategoryTheory.Bundled.coeSort

instance CategoryTheory.instCategoryMatOfSemiring (R : Type u) [Semiring R] : Category.{u, u + 1} (Mat R)

Equations

• CategoryTheory.instCategoryMatOfSemiring R = CategoryTheory.Category.mk ⋯ ⋯ ⋯

theorem CategoryTheory.Mat.hom_ext {R : Type u} [Semiring R] {X Y : Mat R} (f g : X ⟶ Y) (h : ∀ (i : ↑X) (j : ↑Y), f i j = g i j) : f = g

theorem CategoryTheory.Mat.id_def (R : Type u) [Semiring R] (M : Mat R) : CategoryStruct.id M = fun (i j : ↑M) => if i = j then 1 else 0

theorem CategoryTheory.Mat.id_apply (R : Type u) [Semiring R] (M : Mat R) (i j : ↑M) : CategoryStruct.id M i j = if i = j then 1 else 0

@[simp]

theorem CategoryTheory.Mat.id_apply_self (R : Type u) [Semiring R] (M : Mat R) (i : ↑M) : CategoryStruct.id M i i = 1

@[simp]

theorem CategoryTheory.Mat.id_apply_of_ne (R : Type u) [Semiring R] (M : Mat R) (i j : ↑M) (h : i ≠ j) : CategoryStruct.id M i j = 0

theorem CategoryTheory.Mat.comp_def (R : Type u) [Semiring R] {M N K : Mat R} (f : M ⟶ N) (g : N ⟶ K) : CategoryStruct.comp f g = fun (i : ↑M) (k : ↑K) => ∑ j : ↑N, f i j * g j k

@[simp]

theorem CategoryTheory.Mat.comp_apply (R : Type u) [Semiring R] {M N K : Mat R} (f : M ⟶ N) (g : N ⟶ K) (i : ↑M) (k : ↑K) : CategoryStruct.comp f g i k = ∑ j : ↑N, f i j * g j k

instance CategoryTheory.Mat.instInhabitedHom (R : Type u) [Semiring R] (M N : Mat R) : Inhabited (M ⟶ N)

Equations

• CategoryTheory.Mat.instInhabitedHom R M N = { default := fun (x : ↑M) (x : ↑N) => 0 }

def CategoryTheory.Mat.equivalenceSingleObjInverse (R : Type) [Ring R] : Functor (Mat_ (SingleObj Rᵐᵒᵖ)) (Mat R)

Auxiliary definition for CategoryTheory.Mat.equivalenceSingleObj.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Mat.equivalenceSingleObjInverse_map (R : Type) [Ring R] {X✝ Y✝ : Mat_ (SingleObj Rᵐᵒᵖ)} (f : X✝ ⟶ Y✝) (i : ↑((fun (X : Mat_ (SingleObj Rᵐᵒᵖ)) => FintypeCat.of X.ι) X✝)) (j : ↑((fun (X : Mat_ (SingleObj Rᵐᵒᵖ)) => FintypeCat.of X.ι) Y✝)) : (equivalenceSingleObjInverse R).map f i j = MulOpposite.unop (f i j)

@[simp]

theorem CategoryTheory.Mat.equivalenceSingleObjInverse_obj (R : Type) [Ring R] (X : Mat_ (SingleObj Rᵐᵒᵖ)) : (equivalenceSingleObjInverse R).obj X = FintypeCat.of X.ι

instance CategoryTheory.Mat.instFaithfulMat_SingleObjMulOppositeEquivalenceSingleObjInverse (R : Type) [Ring R] : (equivalenceSingleObjInverse R).Faithful

instance CategoryTheory.Mat.instFullMat_SingleObjMulOppositeEquivalenceSingleObjInverse (R : Type) [Ring R] : (equivalenceSingleObjInverse R).Full

instance CategoryTheory.Mat.instEssSurjMat_SingleObjMulOppositeEquivalenceSingleObjInverse (R : Type) [Ring R] : (equivalenceSingleObjInverse R).EssSurj

instance CategoryTheory.Mat.instIsEquivalenceMat_SingleObjMulOppositeEquivalenceSingleObjInverse (R : Type) [Ring R] : (equivalenceSingleObjInverse R).IsEquivalence

def CategoryTheory.Mat.equivalenceSingleObj (R : Type) [Ring R] : Mat R ≌ Mat_ (SingleObj Rᵐᵒᵖ)

The categorical equivalence between the category of matrices over a ring, and the category of matrices over that ring considered as a single-object category.

Equations

• CategoryTheory.Mat.equivalenceSingleObj R = (CategoryTheory.Mat.equivalenceSingleObjInverse R).asEquivalence.symm

instance CategoryTheory.Mat.instAddCommGroupHom (R : Type) [Ring R] (X Y : Mat R) : AddCommGroup (X ⟶ Y)

Equations

• CategoryTheory.Mat.instAddCommGroupHom R X Y = id inferInstance

@[simp]

theorem CategoryTheory.Mat.add_apply {R : Type} [Ring R] {M N : Mat R} (f g : M ⟶ N) (i : ↑M) (j : ↑N) : (f + g) i j = f i j + g i j

instance CategoryTheory.Mat.instPreadditive {R : Type} [Ring R] : Preadditive (Mat R)

Equations

• CategoryTheory.Mat.instPreadditive = { homGroup := inferInstance, add_comp := ⋯, comp_add := ⋯ }