def
Holor.reindex
{ds₂ : List ℕ}
{ds₁ : List ℕ}
{α : Type u_1}
(ix : HolorIndex ds₂ → HolorIndex ds₁)
(h : Holor α ds₁)
:
Holor α ds₂
Reindexing is contravariant in the index
Equations
- Holor.reindex ix h ix₂ = h (ix ix₂)
Instances For
theorem
Holor.reindex_functorial
{ds₂ : List ℕ}
{ds₁ : List ℕ}
{ds₃ : List ℕ}
{α : Type u_1}
(ix : HolorIndex ds₂ → HolorIndex ds₁)
(iy : HolorIndex ds₃ → HolorIndex ds₂)
(h : Holor α ds₁)
:
Holor.reindex iy (Holor.reindex ix h) = Holor.reindex (ix ∘ iy) h
instance
instCommSemiringHolor_sSA
{α : Type u_1}
{ds : List ℕ}
[CommSemiring α]
:
CommSemiring (Holor α ds)
instance
instAlgebraHolor_sSA
{R : Type u_1}
{A : Type u_2}
{ds : List ℕ}
[CommSemiring R]
[Semiring A]
[Algebra R A]
:
Equations
- instAlgebraHolor_sSA = Pi.algebra (HolorIndex ds) fun (a : HolorIndex ds) => A