Theorems · Definition · category theory

CategoryTheory.HomOrthogonal.matrixDecompositionAddEquiv

{C : Type u} →
  [inst : CategoryTheory.Category.{v, u} C] →
    {ι : Type u_1} →
      {s : ι → C} →
        [inst_1 : CategoryTheory.Preadditive C] →
          [inst_2 : CategoryTheory.Limits.HasFiniteBiproducts C] →
            CategoryTheory.HomOrthogonal s →
              {α β : Type} →
                [inst_3 : Finite α] →
                  [inst_4 : Finite β] →
                    {f : α → ι} →
                      {g : β → ι} →
                        ((⨁ fun a => s (f a)) ⟶ ⨁ fun b => s (g b)) ≃+
                          ((i : ι) → Matrix (↑(g ⁻¹' {i})) (↑(f ⁻¹' {i})) (CategoryTheory.End (s i)))

HomOrthogonal.matrixDecomposition as an additive equivalence.

Defined in

Mathlib.CategoryTheory.Preadditive.HomOrthogonal

Cited by

4 results in Mathlib

Foundations

Depth 47 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.PreadditiveCategoryTheory.Limits.HasFiniteBiproductsFiniteFinite