Physlib

Physlib.Relativity.Tensors.Color.Basic

Color

In the context of tensors `Color` is defined as the type of indices of a tensor. For example if `A_μ^ν` is a real Lorentz tensors, we say it has indices of color `[down, up]`. For complex Lorentz Tensors there are six different colors, corresponding to the up and down indices of the Lorentz group, the dotted and undotted Weyl fermion indices.

_Note if you only want to work with tensors, and not understand their implementation you can safely ignore these files._

Overview of directory

**This file**

Let `C` be the type of colors for a given species of tensor. In this file we define the category `OverColor C`. The objects of `OverColor C` correspond to allowed colorings of indices represented as a map `X → C` from a type `X` to `C`. Usually `X` will be `Fin n` for some `n : ℕ`. The morphisms of `OverColor C` correspond to color-preserving permutations of indices.

We also define here a symmetric-monoidal structure on `OverColor C`.

**Discrete**

The file `Discrete` contains some basic properties of the category `Discrete C`.

**Lift**

The file `Lift` we define the lift of a functor `F : Discrete C ⥤ Rep k G` to a symmetric monoidal functor `OverColor C ⥤ Rep k G`, given by taking tensor products.

References

Morphisms in the OverColor category.

The monoidal structure on `OverColor C`.

The category `OverColor C` can, through the disjoint union, be given the structure of a symmetric monoidal category.

Isomorphisms.

49 declarations

definition

The core of the slice category over CC

Given a type CC representing the set of colors (index types) for tensors, OverColor(C)\text{OverColor}(C) is the core of the slice category Type/C\text{Type}/C. The objects of this category are maps f:X→Cf: X \to C, where XX is a type representing a collection of indices and ff assigns a color to each index. The morphisms are the isomorphisms of the slice category, which correspond to color-preserving bijections σ:X≅Y\sigma: X \cong Y such that g∘σ=fg \circ \sigma = f for objects f:X→Cf: X \to C and g:Y→Cg: Y \to C.

instance

OverColor(C)\text{OverColor}(C) is a groupoid

For a given type CC of colors, the category OverColor(C)\text{OverColor}(C) is a groupoid. This means that every morphism in OverColor(C)\text{OverColor}(C)—which represents a color-preserving bijection between two types of indices XX and YY—is an isomorphism. This groupoid structure is derived from the fact that OverColor(C)\text{OverColor}(C) is defined as the core of the slice category Type/C\text{Type}/C.

definition

Object in OverColor(C)\text{OverColor}(C) from f:X→Cf: X \to C

Given a mapping f:X→Cf: X \to C from a type of indices XX to a type of colors CC, this function constructs the corresponding object in the category OverColor(C)\text{OverColor}(C). In the context of tensor indices, this represents the assignment of a specific color to each index in a collection.

abbrev

The underlying map f:X→Cf: X \to C of an object in OverColor(C)\text{OverColor}(C)

For an object ff in the category OverColor(C)\text{OverColor}(C), the function `hom` returns the underlying map f:X→Cf: X \to C that assigns a color in CC to each index in the type XX. In the context of the slice category Type/C\text{Type}/C, this corresponds to the morphism from the domain XX to the base CC.

abbrev

The domain XX of an object f:X→Cf: X \to C in OverColor(C)\text{OverColor}(C)

For an object ff in the category OverColor(C)\text{OverColor}(C), which represents a mapping f:X→Cf: X \to C from a type of indices XX to a type of colors CC, the function returns the underlying type XX of the indices.

theorem

(mk f).hom=f(\text{mk } f).\text{hom} = f

Let XX be a type of indices and CC be a type of colors. For any mapping f:X→Cf: X \to C, the underlying map of the object mk(f)\text{mk}(f) in the category OverColor(C)\text{OverColor}(C), denoted as (mk f).hom(\text{mk } f).\text{hom}, is equal to ff.

theorem

The domain of mk(f)\text{mk}(f) is XX

Let XX be a type of indices and CC be a type of colors. For any mapping f:X→Cf : X \to C, the underlying type of indices associated with the object constructed by mk(f)\text{mk}(f) in the category OverColor(C)\text{OverColor}(C) is equal to XX.

abbrev

Underlying bijection σ:X→Y\sigma: X \to Y of a morphism in OverColor(C)\text{OverColor}(C)

Given objects f:X→Cf: X \to C and g:Y→Cg: Y \to C in the category OverColor(C)\text{OverColor}(C), where XX and YY are types of indices and CC is the type of colors, a morphism m:f→gm: f \to g represents a color-preserving bijection between the indices. The function `hom` extracts the underlying bijection σ:X→Y\sigma: X \to Y associated with mm, which satisfies the property g∘σ=fg \circ \sigma = f.

abbrev

Underlying inverse bijection σ−1:Y→X\sigma^{-1}: Y \to X of a morphism in OverColor(C)\text{OverColor}(C)

Given objects f:X→Cf: X \to C and g:Y→Cg: Y \to C in the category OverColor(C)\text{OverColor}(C), where XX and YY are types of indices and CC is the type of colors, a morphism m:f→gm: f \to g represents a color-preserving bijection. The function `inv` extracts the underlying inverse bijection σ−1:Y→X\sigma^{-1}: Y \to X associated with mm, which satisfies the property f∘σ−1=gf \circ \sigma^{-1} = g.

theorem

m∘m−1=idm \circ m^{-1} = \text{id} for color-preserving index bijections

In the category OverColor(C)\text{OverColor}(C), where objects are mappings f:X→Cf: X \to C representing the assignment of colors to a set of indices XX and morphisms are color-preserving bijections, for any morphism m:f→gm: f \to g, the composition of its forward morphism m.homm.\text{hom} and its inverse m.invm.\text{inv} is the identity morphism 1f\mathbb{1}_f on the object ff.

theorem

m−1∘m=idm^{-1} \circ m = \text{id} for color-preserving index bijections

In the category OverColor(C)\text{OverColor}(C), where objects are mappings f:X→Cf: X \to C and g:Y→Cg: Y \to C representing the assignment of colors to sets of indices XX and YY, and morphisms are color-preserving bijections, for any morphism m:f→gm: f \to g, the composition of its inverse morphism m.invm.\text{inv} and its forward morphism m.homm.\text{hom} is the identity morphism 1g\mathbb{1}_g on the target object gg.

abbrev

Inverse of a color-preserving morphism m:f→gm: f \to g in OverColor(C)\text{OverColor}(C)

In the category OverColor(C)\text{OverColor}(C), an object is defined as a map f:X→Cf : X \to C that assigns a color from the set CC to each index in the set XX. A morphism m:f→gm : f \to g between two such objects f:X→Cf : X \to C and g:Y→Cg : Y \to C represents a color-preserving bijection between the index sets XX and YY. Since OverColor(C)\text{OverColor}(C) is a groupoid, every such morphism is an isomorphism; this definition provides the inverse morphism m−1:g→fm^{-1} : g \to f, corresponding to the inverse bijection of the underlying index sets.

theorem

m.hom=n.hom  ⟹  m=nm.\text{hom} = n.\text{hom} \implies m = n in OverColor(C)\text{OverColor}(C)

In the category OverColor(C)\text{OverColor}(C), let f:X→Cf: X \to C and g:Y→Cg: Y \to C be objects representing the assignment of colors to sets of indices XX and YY. For any two morphisms m,n:f→gm, n : f \to g, if the underlying color-preserving bijections m.homm.\text{hom} and n.homn.\text{hom} (which are the morphisms in the slice category Type/C\text{Type}/C) are equal, then m=nm = n.

theorem

m=n  ⟺  ∀x,m.hom(x)=n.hom(x)m = n \iff \forall x, m.\text{hom}(x) = n.\text{hom}(x) in OverColor(C)\text{OverColor}(C)

In the category OverColor(C)\text{OverColor}(C), let f:X→Cf: X \to C and g:Y→Cg: Y \to C be objects representing the assignment of colors from the set CC to the sets of indices XX and YY. For any two morphisms m,n:f→gm, n : f \to g, representing color-preserving bijections between the index sets, mm and nn are equal if and only if for every index x∈Xx \in X, their underlying functions σm,σn:X→Y\sigma_m, \sigma_n : X \to Y satisfy σm(x)=σn(x)\sigma_m(x) = \sigma_n(x).

definition

The equivalence X≃YX \simeq Y induced by a morphism m:f→gm: f \to g in OverColor(C)\text{OverColor}(C)

For a morphism m:f→gm: f \to g in the category OverColor(C)\text{OverColor}(C), where f:X→Cf: X \to C and g:Y→Cg: Y \to C are objects representing the assignment of colors to sets of indices XX and YY, this function returns the underlying bijection (equivalence) between the types of indices σ:X≃Y\sigma: X \simeq Y. Since OverColor(C)\text{OverColor}(C) is the core of the slice category over CC, the morphism mm uniquely determines a bijection that preserves colors, such that g∘σ=fg \circ \sigma = f.

theorem

The underlying equivalence of 1f\mathbb{1}_f in OverColor(C)\text{OverColor}(C) is the identity equivalence

For any object ff in the category OverColor(C)\text{OverColor}(C), representing a mapping f:X→Cf: X \to C from a type of indices XX to a type of colors CC, the underlying bijection σ:X≃X\sigma: X \simeq X induced by the identity morphism 1f\mathbb{1}_f is the reflexive (identity) equivalence on XX.

theorem

toEquiv(m≫n)=toEquiv(m)∘toEquiv(n)\text{toEquiv}(m \gg n) = \text{toEquiv}(m) \circ \text{toEquiv}(n)

In the category OverColor(C)\text{OverColor}(C), for any objects f,g,hf, g, h and morphisms m:f→gm: f \to g and n:g→hn: g \to h, the equivalence between the underlying types of indices induced by the composition of morphisms m≫nm \gg n is equal to the composition of the individual equivalences induced by mm and nn. That is, toEquiv(m≫n)=toEquiv(m)∘toEquiv(n)\text{toEquiv}(m \gg n) = \text{toEquiv}(m) \circ \text{toEquiv}(n) where toEquiv\text{toEquiv} denotes the function that extracts the underlying color-preserving bijection (equivalence) between the index types of the objects, and ∘\circ denotes the composition of equivalences.

theorem

f(σ−1(i))=g(i)f(\sigma^{-1}(i)) = g(i) for Morphisms in OverColor(C)\text{OverColor}(C)

Let CC be a type of colors. Let f:X→Cf: X \to C and g:Y→Cg: Y \to C be objects in the category OverColor(C)\text{OverColor}(C), and let m:f→gm: f \to g be a morphism. Let σ:X≅Y\sigma: X \cong Y be the bijection between the index types induced by mm. For any index i∈Yi \in Y, the color assigned by ff to the image of ii under the inverse bijection σ−1\sigma^{-1} is equal to the color assigned by gg to ii, i.e., f(σ−1(i))=g(i)f(\sigma^{-1}(i)) = g(i).

theorem

Morphisms in OverColor(C)\text{OverColor}(C) satisfy g∘σ=fg \circ \sigma = f

Let CC be a type representing colors. For any morphism m:f→gm: f \to g in the category OverColor(C)\text{OverColor}(C), where f:X→Cf: X \to C and g:Y→Cg: Y \to C are objects assigning colors to index types XX and YY respectively, let σ:X≅Y\sigma: X \cong Y be the underlying bijection (equivalence) induced by mm. Then the composition of gg with σ\sigma is equal to ff, that is, g∘σ=fg \circ \sigma = f.

theorem

Color Preservation f(σ−1(i))=g(i)f(\sigma^{-1}(i)) = g(i) for Morphisms in OverColor(C)\text{OverColor}(C)

In the category OverColor(C)\text{OverColor}(C), let m:f→gm: f \to g be a morphism between two objects f:X→Cf: X \to C and g:Y→Cg: Y \to C, where XX and YY are sets of indices and CC is the set of colors. Let σ:X≅Y\sigma: X \cong Y be the color-preserving bijection between the index types induced by mm. For any index i∈Yi \in Y, the color assigned to the index σ−1(i)\sigma^{-1}(i) by the map ff is equal to the color assigned to the index ii by the map gg. That is: f(σ−1(i))=g(i)f(\sigma^{-1}(i)) = g(i)

theorem

f(i)=g(σ(i))f(i) = g(\sigma(i)) for morphisms in OverColor(C)\text{OverColor}(C)

Let CC be a type representing colors for tensor indices. In the category OverColor(C)\text{OverColor}(C), let f:X→Cf: X \to C and g:Y→Cg: Y \to C be two objects, and let m:f→gm: f \to g be a morphism between them. Let σ:X≃Y\sigma: X \simeq Y be the color-preserving bijection between the sets of indices induced by mm. For any index i∈Xi \in X, the color assigned to ii by ff is equal to the color assigned to its image σ(i)\sigma(i) by gg, that is: f(i)=g(σ(i)).f(i) = g(\sigma(i)).

definition

Morphism m:f→gm : f \to g as an isomorphism f≅gf \cong g in OverColor(C)\text{OverColor}(C)

Given a morphism m:f→gm: f \to g in the category OverColor(C)\text{OverColor}(C), which represents a color-preserving bijection between two objects f:X→Cf: X \to C and g:Y→Cg: Y \to C, this definition constructs the corresponding categorical isomorphism f≅gf \cong g. The isomorphism is formed using mm as the forward map and its inverse m−1m^{-1} as the backward map.

theorem

(m≫n).hom=m.hom≫n.hom(m \gg n).\text{hom} = m.\text{hom} \gg n.\text{hom}

Let CC be a type representing colors of tensor indices. In the category OverColor(C)\text{OverColor}(C) (the core of the slice category over CC), let m:f→gm: f \to g and n:g→hn: g \to h be morphisms representing color-preserving bijections between sets of indices. The underlying bijection associated with the composite morphism m≫nm \gg n is equal to the composition of the underlying bijections of mm and nn, that is, (m≫n).hom=m.hom≫n.hom(m \gg n).\text{hom} = m.\text{hom} \gg n.\text{hom}.

instance

Monoidal category structure on OverColor(C)\text{OverColor}(C) via disjoint union

For a given type of colors CC, the category OverColor(C)\text{OverColor}(C) (the core of the slice category Type/C\text{Type}/C) is equipped with a monoidal category structure defined using the disjoint union of index sets. - The **tensor product** of two objects f:X→Cf: X \to C and g:Y→Cg: Y \to C is given by the map f⊕g:X⨿Y→Cf \oplus g: X \amalg Y \to C, which applies ff to elements of XX and gg to elements of YY. - The **monoidal unit** is the unique map empty_elim:∅→C\text{empty\_elim} : \emptyset \to C from the empty type. - The **associator**, **left unitor**, and **right unitor** are the isomorphisms in OverColor(C)\text{OverColor}(C) induced by the standard set-theoretic bijections (X⨿Y)⨿Z≅X⨿(Y⨿Z)(X \amalg Y) \amalg Z \cong X \amalg (Y \amalg Z), ∅⨿X≅X\emptyset \amalg X \cong X, and X⨿∅≅XX \amalg \emptyset \cong X, respectively.

instance

OverColor(C)\text{OverColor}(C) is a monoidal category

For a given type of colors CC, the category OverColor(C)\text{OverColor}(C)—defined as the core of the slice category Type/C\text{Type}/C—is a monoidal category. The monoidal structure is defined by: - The **tensor product** of two objects f:X→Cf: X \to C and g:Y→Cg: Y \to C is the map f⊗g:X⨿Y→Cf \otimes g: X \amalg Y \to C, which acts as ff on the first component and gg on the second. - The **monoidal unit** is the unique map 1:∅→C\mathbf{1}: \emptyset \to C from the empty set. - The **associator** αf,g,h:(f⊗g)⊗h≅f⊗(g⊗h)\alpha_{f,g,h}: (f \otimes g) \otimes h \cong f \otimes (g \otimes h), **left unitor** λf:1⊗f≅f\lambda_f: \mathbf{1} \otimes f \cong f, and **right unitor** ρf:f⊗1≅f\rho_f: f \otimes \mathbf{1} \cong f are the isomorphisms induced by the canonical set-theoretic bijections for disjoint unions. This definition provides the proofs that these components satisfy the monoidal category axioms, including the pentagon and triangle identities.

instance

OverColor(C)\text{OverColor}(C) is a braided category

The category OverColor(C)\text{OverColor}(C) is a braided monoidal category. For any two objects f:X→Cf: X \to C and g:Y→Cg: Y \to C, the braiding βf,g:f⊗g≅g⊗f\beta_{f,g}: f \otimes g \cong g \otimes f is the isomorphism in OverColor(C)\text{OverColor}(C) induced by the canonical bijection σ:X⨿Y≅Y⨿X\sigma: X \amalg Y \cong Y \amalg X that swaps the components of the disjoint union. This bijection preserves colors, such that (g⊗f)∘σ=f⊗g(g \otimes f) \circ \sigma = f \otimes g. The definition includes proofs that this braiding is natural and satisfies the hexagon identities.

instance

OverColor(C)\text{OverColor}(C) is a symmetric monoidal category

For a type CC representing colors, the category OverColor(C)\text{OverColor}(C) (defined as the core of the slice category Type/C\text{Type}/C) is a symmetric monoidal category. This symmetry is based on the braided monoidal structure where the braiding βf,g:f⊗g≅g⊗f\beta_{f,g}: f \otimes g \cong g \otimes f for objects f:X→Cf: X \to C and g:Y→Cg: Y \to C is induced by the canonical swap map σ:X⨿Y≅Y⨿X\sigma: X \amalg Y \cong Y \amalg X. The symmetry property ensures that βg,f∘βf,g=idf⊗g\beta_{g,f} \circ \beta_{f,g} = \text{id}_{f \otimes g} for all objects in the category.

theorem

σ=σ′\sigma = \sigma' in OverColor(C)\text{OverColor}(C) if their bijections agree on Fin n\text{Fin } n

Let CC be a type of colors and nn be a natural number. Let f,g:{0,…,n−1}→Cf, g: \{0, \dots, n-1\} \to C be mappings that assign colors to a set of nn indices, defining two objects in the category OverColor(C)\text{OverColor}(C). For any two morphisms σ,σ′:f→g\sigma, \sigma' : f \to g, if their underlying bijections from {0,…,n−1}\{0, \dots, n-1\} to {0,…,n−1}\{0, \dots, n-1\} agree on all indices i∈{0,…,n−1}i \in \{0, \dots, n-1\}, then the morphisms are equal, σ=σ′\sigma = \sigma'.

theorem

The underlying bijection of the braiding βf,g\beta_{f,g} is the swap map X⨿Y≅Y⨿XX \amalg Y \cong Y \amalg X

Let CC be a type of colors and let f:X→Cf: X \to C and g:Y→Cg: Y \to C be mappings representing two objects in the category OverColor(C)\text{OverColor}(C). The underlying bijection between the index sets X⨿YX \amalg Y and Y⨿XY \amalg X induced by the braiding isomorphism βf,g:f⊗g≅g⊗f\beta_{f,g}: f \otimes g \cong g \otimes f is the canonical swap map σ:X⨿Y≅Y⨿X\sigma: X \amalg Y \cong Y \amalg X that interchanges the two components of the disjoint union.

theorem

Equiv(βf,g−1)=Equiv.sumComm(Y,X)\text{Equiv}(\beta_{f,g}^{-1}) = \text{Equiv.sumComm}(Y, X)

Let CC be a type of colors. For any two mappings f:X→Cf: X \to C and g:Y→Cg: Y \to C representing objects in the category OverColor(C)\text{OverColor}(C), the bijection between the index sets Y⨿XY \amalg X and X⨿YX \amalg Y induced by the inverse braiding βf,g−1:g⊗f≅f⊗g\beta_{f,g}^{-1}: g \otimes f \cong f \otimes g is the canonical swap map σ:Y⨿X≅X⨿Y\sigma: Y \amalg X \cong X \amalg Y defined by swapping the order of the components in the disjoint union.

theorem

Equiv(h◃σ)=idZ⨿Equiv(σ)\text{Equiv}(h \triangleleft \sigma) = \text{id}_Z \amalg \text{Equiv}(\sigma)

For any mappings f:X→Cf: X \to C, g:Y→Cg: Y \to C, and h:Z→Ch: Z \to C representing objects in the category OverColor(C)\text{OverColor}(C) and any morphism σ:f→g\sigma : f \to g, the bijection between the index sets Z⨿XZ \amalg X and Z⨿YZ \amalg Y induced by the left whiskering h◃σh \triangleleft \sigma (the tensor product idh⊗σid_h \otimes \sigma) is equal to the disjoint union of the identity bijection on ZZ and the bijection between XX and YY induced by σ\sigma.

theorem

Equiv(σ▹h)=Equiv(σ)⨿idZ\text{Equiv}(\sigma \triangleright h) = \text{Equiv}(\sigma) \amalg \text{id}_Z

For any mappings f:X→Cf: X \to C, g:Y→Cg: Y \to C, and h:Z→Ch: Z \to C representing objects in the category OverColor(C)\text{OverColor}(C) and any morphism σ:f→g\sigma : f \to g, the bijection between the index sets X⨿ZX \amalg Z and Y⨿ZY \amalg Z induced by the right whiskering σ▹h\sigma \triangleright h is equal to the disjoint union of the bijection induced by σ\sigma and the identity bijection on ZZ.

theorem

The underlying map of the associator α\alpha in OverColor(C)\text{OverColor}(C) is the sum associativity bijection

Let CC be a type representing the colors of tensor indices. For any objects f:X→Cf: X \to C, g:Y→Cg: Y \to C, and h:Z→Ch: Z \to C in the category OverColor(C)\text{OverColor}(C), the associator isomorphism of the monoidal structure is denoted by αf,g,h:(f⊗g)⊗h≅f⊗(g⊗h)\alpha_{f,g,h} : (f \otimes g) \otimes h \cong f \otimes (g \otimes h). This theorem states that the underlying bijection (equivalence) of the morphism αf,g,h.hom\alpha_{f,g,h}.\text{hom} is the standard set-theoretic associativity for disjoint unions, (X⨿Y)⨿Z≅X⨿(Y⨿Z)(X \amalg Y) \amalg Z \cong X \amalg (Y \amalg Z).

theorem

The inverse associator in OverColor(C)\text{OverColor}(C) equals the inverse sum associativity.

Let CC be a type of colors and let f:X→Cf: X \to C, g:Y→Cg: Y \to C, and h:Z→Ch: Z \to C be objects in the category OverColor(C)\text{OverColor}(C). The category is equipped with a monoidal structure where the tensor product is given by the disjoint union of index sets. The underlying bijection of the inverse of the associator isomorphism αf,g,h−1:f⊗(g⊗h)→(f⊗g)⊗h\alpha_{f,g,h}^{-1}: f \otimes (g \otimes h) \to (f \otimes g) \otimes h is exactly the inverse of the standard set-theoretic associativity for disjoint unions, (X⨿Y)⨿Z≅X⨿(Y⨿Z)(X \amalg Y) \amalg Z \cong X \amalg (Y \amalg Z).

definition

Equivalence e:X≅Ye : X \cong Y induces an isomorphism c≅c∘e−1c \cong c \circ e^{-1} in OverColor(C)\text{OverColor}(C)

Let CC be a type representing colors of tensor indices. Given a coloring c:X→Cc: X \to C of an index set XX and an equivalence (bijection) e:X≅Ye: X \cong Y between index sets, this definition constructs an isomorphism in the category OverColor(C)\text{OverColor}(C) between the object corresponding to cc and the object corresponding to the reindexed coloring c∘e−1:Y→Cc \circ e^{-1} : Y \to C. This isomorphism represents a color-preserving relabeling of indices from XX to YY.

theorem

The underlying bijection of equivToIso(e)\text{equivToIso}(e) is ee

Let CC be a type representing colors of tensor indices. For a coloring c:X→Cc: X \to C of an index set XX and a bijection e:X≅Ye: X \cong Y between index sets, there is an induced isomorphism equivToIso(e):c≅c∘e−1\text{equivToIso}(e): c \cong c \circ e^{-1} in the category OverColor(C)\text{OverColor}(C). This theorem states that the underlying bijection of the forward morphism of this isomorphism is equal to ee.

theorem

The underlying bijection of the inverse of equivToIso(e)\text{equivToIso}(e) is e−1e^{-1}

Let CC be a type representing colors of tensor indices. For a coloring c:X→Cc: X \to C of an index set XX and a bijection e:X≅Ye: X \cong Y between index sets, there is an induced isomorphism equivToIso(e):c≅c∘e−1\text{equivToIso}(e): c \cong c \circ e^{-1} in the category OverColor(C)\text{OverColor}(C). This theorem states that the underlying bijection of the inverse of this isomorphism is equal to the inverse bijection e−1e^{-1}.

definition

Morphism in OverColor(C)\text{OverColor}(C) from cc to c∘e−1c \circ e^{-1} induced by equivalence ee

Let CC be a type representing the colors of tensor indices. Given a coloring c:X→Cc : X \to C of an index set XX and an equivalence (bijection) e:X≅Ye : X \cong Y between index sets XX and YY, this definition constructs a morphism in the category OverColor(C)\text{OverColor}(C) from the object representing cc to the object representing the reindexed coloring c∘e−1:Y→Cc \circ e^{-1} : Y \to C. This morphism is the color-preserving bijection ee that maps the indices in XX to their corresponding indices in YY.

definition

Isomorphism mk(c)≅mk(c∣X)⊗mk(c∣Y)\text{mk}(c) \cong \text{mk}(c|_X) \otimes \text{mk}(c|_Y) for c:X⨿Y→Cc: X \amalg Y \to C

Given a map c:X⨿Y→Cc: X \amalg Y \to C that assigns colors from a type CC to a disjoint union of index types XX and YY, there exists a natural isomorphism in the category OverColor(C)\text{OverColor}(C) between the object defined by cc and the tensor product of the objects defined by its restrictions to XX and YY. Specifically, mk(c)≅mk(c∘ιX)⊗mk(c∘ιY) \text{mk}(c) \cong \text{mk}(c \circ \iota_X) \otimes \text{mk}(c \circ \iota_Y) where ιX:X→X⨿Y\iota_X: X \to X \amalg Y and ιY:Y→X⨿Y\iota_Y: Y \to X \amalg Y are the canonical injections into the disjoint union. This isomorphism is induced by the identity map on the underlying type X⨿YX \amalg Y, reflecting the monoidal structure of OverColor(C)\text{OverColor}(C) where the tensor product is defined by the disjoint union of index sets.

theorem

The underlying bijection of the morphism (mkSum c).hom(\text{mkSum } c).\text{hom} is the identity equivalence

Let CC be a type representing colors of tensor indices. For any map c:X⨿Y→Cc: X \amalg Y \to C assigning colors to the disjoint union of index sets XX and YY, let mkSum(c)\text{mkSum}(c) be the natural isomorphism mk(c)≅mk(c∘ιX)⊗mk(c∘ιY)\text{mk}(c) \cong \text{mk}(c \circ \iota_X) \otimes \text{mk}(c \circ \iota_Y) in the category OverColor(C)\text{OverColor}(C), where ιX\iota_X and ιY\iota_Y are the canonical injections. The underlying bijection between the index sets induced by the forward morphism of this isomorphism, denoted Hom.toEquiv((mkSum c).hom)\text{Hom.toEquiv}((\text{mkSum } c).\text{hom}), is the identity equivalence on X⨿YX \amalg Y.

theorem

The underlying bijection of (mkSum c)−1(\text{mkSum } c)^{-1} is the identity equivalence

For any map c:X⨿Y→Cc: X \amalg Y \to C assigning colors from a type CC to a disjoint union of index types XX and YY, let mkSum(c)\text{mkSum}(c) be the isomorphism mk(c)≅mk(c∘ιX)⊗mk(c∘ιY)\text{mk}(c) \cong \text{mk}(c \circ \iota_X) \otimes \text{mk}(c \circ \iota_Y) in the category OverColor(C)\text{OverColor}(C), where ιX\iota_X and ιY\iota_Y are the canonical injections. The theorem states that the underlying bijection of the inverse morphism (mkSum(c))−1(\text{mkSum}(c))^{-1} is the identity equivalence on the type X⨿YX \amalg Y.

definition

Isomorphism in OverColor(C)\text{OverColor}(C) from c1=c2c_1 = c_2

Given a type XX and two color-assigning maps c1,c2:X→Cc_1, c_2 : X \to C, if c1=c2c_1 = c_2, there is a canonical isomorphism between the objects mk c1\text{mk } c_1 and mk c2\text{mk } c_2 in the category OverColor(C)\text{OverColor}(C). This isomorphism is induced by the identity bijection on the index type XX.

theorem

The morphism of mkIso(c=c)\text{mkIso}(c=c) is the identity 1\mathbb{1}

For any mapping c:X→Cc: X \to C defining an object in the category OverColor(C)\text{OverColor}(C), the forward morphism of the canonical isomorphism induced by the equality c=cc = c (via reflexivity) is equal to the identity morphism 1mk c\mathbb{1}_{\text{mk } c} in OverColor(C)\text{OverColor}(C).

theorem

The underlying function of mkIso(h)\text{mkIso}(h) is the identity function idX\text{id}_X

Let CC be a type representing colors and XX a type representing indices. For any two color-assigning maps c1,c2:X→Cc_1, c_2 : X \to C such that c1=c2c_1 = c_2, let mkIso(h)\text{mkIso}(h) be the canonical isomorphism between the objects in OverColor(C)\text{OverColor}(C) defined by c1c_1 and c2c_2. The underlying function of the morphism component of this isomorphism, which maps the index set XX to itself, is the identity function idX\text{id}_X.

theorem

The underlying function of mkIso(h)\text{mkIso}(h) is the identity map x↦xx \mapsto x

Let CC be a type of colors and XX a type of indices. For any two color-assigning maps c1,c2:X→Cc_1, c_2 : X \to C such that c1=c2c_1 = c_2, let mkIso(h)\text{mkIso}(h) be the canonical isomorphism between the objects in OverColor(C)\text{OverColor}(C) defined by c1c_1 and c2c_2. For any index x∈Xx \in X, the underlying function of the forward morphism component of this isomorphism applied to xx is equal to xx.

theorem

The underlying bijection of mkIso(h)\text{mkIso}(h) is the identity equivalence

Let CC be a type of colors and XX a type of indices. For any two color-assigning maps c1,c2:X→Cc_1, c_2 : X \to C such that c1=c2c_1 = c_2, let mkIso(h)\text{mkIso}(h) be the canonical isomorphism between the objects represented by c1c_1 and c2c_2 in the category OverColor(C)\text{OverColor}(C). The underlying bijection of indices associated with the morphism component of this isomorphism is the identity equivalence on XX.

theorem

The underlying bijection of (mkIso(h))−1(\text{mkIso}(h))^{-1} is the identity equivalence

Let CC be a type of colors and XX a type of indices. For any two color-assigning maps c1,c2:X→Cc_1, c_2 : X \to C such that h:c1=c2h: c_1 = c_2, let mkIso(h)\text{mkIso}(h) be the canonical isomorphism between the objects represented by c1c_1 and c2c_2 in the category OverColor(C)\text{OverColor}(C). The underlying bijection of indices associated with the inverse morphism (mkIso(h))−1(\text{mkIso}(h))^{-1} is the identity equivalence on XX.

theorem

The underlying function of `equivToHomEq e h` is ee

Let CC be a type of colors, and let XX and YY be types of indices. Suppose we have color-assigning maps c:X→Cc: X \to C and c1:Y→Cc_1: Y \to C representing objects in the category OverColor(C)\text{OverColor}(C). Given a bijection e:X≃Ye: X \simeq Y such that c1(y)=c(e−1(y))c_1(y) = c(e^{-1}(y)) for all y∈Yy \in Y (denoted by the proof hh), the underlying function of the morphism equivToHomEq(e,h)\text{equivToHomEq}(e, h) from cc to c1c_1 is equal to the function ee.

theorem

The underlying bijection of a morphism induced by ee is ee itself

Let CC be a type of colors, and let XX and YY be types representing indices. Given two objects in the category OverColor(C)\text{OverColor}(C) defined by the color-assignment maps c:X→Cc: X \to C and c1:Y→Cc_1: Y \to C, let e:X≃Ye: X \simeq Y be a bijection between the index sets. If ee satisfies the condition that for all x∈Yx \in Y, c1(x)=(c∘e−1)(x)c_1(x) = (c \circ e^{-1})(x), then the underlying bijection of the morphism in OverColor(C)\text{OverColor}(C) induced by ee (denoted by `equivToHomEq e h`) is equal to ee.