Physlib.Relativity.Tensors.Color.Basic
49 declarations
The core of the slice category over
#OverColorGiven a type representing the set of colors (index types) for tensors, is the core of the slice category . The objects of this category are maps , where is a type representing a collection of indices and assigns a color to each index. The morphisms are the isomorphisms of the slice category, which correspond to color-preserving bijections such that for objects and .
is a groupoid
#instGroupoidOverColorFor a given type of colors, the category is a groupoid. This means that every morphism in —which represents a color-preserving bijection between two types of indices and —is an isomorphism. This groupoid structure is derived from the fact that is defined as the core of the slice category .
Object in from
#mkGiven a mapping from a type of indices to a type of colors , this function constructs the corresponding object in the category . In the context of tensor indices, this represents the assignment of a specific color to each index in a collection.
The underlying map of an object in
#homFor an object in the category , the function `hom` returns the underlying map that assigns a color in to each index in the type . In the context of the slice category , this corresponds to the morphism from the domain to the base .
The domain of an object in
#leftFor an object in the category , which represents a mapping from a type of indices to a type of colors , the function returns the underlying type of the indices.
Let be a type of indices and be a type of colors. For any mapping , the underlying map of the object in the category , denoted as , is equal to .
The domain of is
#mk_leftLet be a type of indices and be a type of colors. For any mapping , the underlying type of indices associated with the object constructed by in the category is equal to .
Underlying bijection of a morphism in
#homGiven objects and in the category , where and are types of indices and is the type of colors, a morphism represents a color-preserving bijection between the indices. The function `hom` extracts the underlying bijection associated with , which satisfies the property .
Underlying inverse bijection of a morphism in
#invGiven objects and in the category , where and are types of indices and is the type of colors, a morphism represents a color-preserving bijection. The function `inv` extracts the underlying inverse bijection associated with , which satisfies the property .
for color-preserving index bijections
#hom_inv_idIn the category , where objects are mappings representing the assignment of colors to a set of indices and morphisms are color-preserving bijections, for any morphism , the composition of its forward morphism and its inverse is the identity morphism on the object .
for color-preserving index bijections
#inv_hom_idIn the category , where objects are mappings and representing the assignment of colors to sets of indices and , and morphisms are color-preserving bijections, for any morphism , the composition of its inverse morphism and its forward morphism is the identity morphism on the target object .
Inverse of a color-preserving morphism in
#symmIn the category , an object is defined as a map that assigns a color from the set to each index in the set . A morphism between two such objects and represents a color-preserving bijection between the index sets and . Since is a groupoid, every such morphism is an isomorphism; this definition provides the inverse morphism , corresponding to the inverse bijection of the underlying index sets.
in
#extIn the category , let and be objects representing the assignment of colors to sets of indices and . For any two morphisms , if the underlying color-preserving bijections and (which are the morphisms in the slice category ) are equal, then .
in
#ext_iffIn the category , let and be objects representing the assignment of colors from the set to the sets of indices and . For any two morphisms , representing color-preserving bijections between the index sets, and are equal if and only if for every index , their underlying functions satisfy .
The equivalence induced by a morphism in
#toEquivFor a morphism in the category , where and are objects representing the assignment of colors to sets of indices and , this function returns the underlying bijection (equivalence) between the types of indices . Since is the core of the slice category over , the morphism uniquely determines a bijection that preserves colors, such that .
The underlying equivalence of in is the identity equivalence
#toEquiv_idFor any object in the category , representing a mapping from a type of indices to a type of colors , the underlying bijection induced by the identity morphism is the reflexive (identity) equivalence on .
In the category , for any objects and morphisms and , the equivalence between the underlying types of indices induced by the composition of morphisms is equal to the composition of the individual equivalences induced by and . That is, where denotes the function that extracts the underlying color-preserving bijection (equivalence) between the index types of the objects, and denotes the composition of equivalences.
for Morphisms in
#toEquiv_symm_applyLet be a type of colors. Let and be objects in the category , and let be a morphism. Let be the bijection between the index types induced by . For any index , the color assigned by to the image of under the inverse bijection is equal to the color assigned by to , i.e., .
Morphisms in satisfy
#toEquiv_comp_homLet be a type representing colors. For any morphism in the category , where and are objects assigning colors to index types and respectively, let be the underlying bijection (equivalence) induced by . Then the composition of with is equal to , that is, .
Color Preservation for Morphisms in
#toEquiv_comp_inv_applyIn the category , let be a morphism between two objects and , where and are sets of indices and is the set of colors. Let be the color-preserving bijection between the index types induced by . For any index , the color assigned to the index by the map is equal to the color assigned to the index by the map . That is:
for morphisms in
#toEquiv_comp_applyLet be a type representing colors for tensor indices. In the category , let and be two objects, and let be a morphism between them. Let be the color-preserving bijection between the sets of indices induced by . For any index , the color assigned to by is equal to the color assigned to its image by , that is:
Morphism as an isomorphism in
#toIsoGiven a morphism in the category , which represents a color-preserving bijection between two objects and , this definition constructs the corresponding categorical isomorphism . The isomorphism is formed using as the forward map and its inverse as the backward map.
Let be a type representing colors of tensor indices. In the category (the core of the slice category over ), let and be morphisms representing color-preserving bijections between sets of indices. The underlying bijection associated with the composite morphism is equal to the composition of the underlying bijections of and , that is, .
Monoidal category structure on via disjoint union
#instMonoidalCategoryStructFor a given type of colors , the category (the core of the slice category ) is equipped with a monoidal category structure defined using the disjoint union of index sets. - The **tensor product** of two objects and is given by the map , which applies to elements of and to elements of . - The **monoidal unit** is the unique map from the empty type. - The **associator**, **left unitor**, and **right unitor** are the isomorphisms in induced by the standard set-theoretic bijections , , and , respectively.
is a monoidal category
#instMonoidalCategoryFor a given type of colors , the category —defined as the core of the slice category —is a monoidal category. The monoidal structure is defined by: - The **tensor product** of two objects and is the map , which acts as on the first component and on the second. - The **monoidal unit** is the unique map from the empty set. - The **associator** , **left unitor** , and **right unitor** 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.
is a braided category
#instBraidedCategoryThe category is a braided monoidal category. For any two objects and , the braiding is the isomorphism in induced by the canonical bijection that swaps the components of the disjoint union. This bijection preserves colors, such that . The definition includes proofs that this braiding is natural and satisfies the hexagon identities.
is a symmetric monoidal category
#instSymmetricCategoryFor a type representing colors, the category (defined as the core of the slice category ) is a symmetric monoidal category. This symmetry is based on the braided monoidal structure where the braiding for objects and is induced by the canonical swap map . The symmetry property ensures that for all objects in the category.
in if their bijections agree on
#fin_extLet be a type of colors and be a natural number. Let be mappings that assign colors to a set of indices, defining two objects in the category . For any two morphisms , if their underlying bijections from to agree on all indices , then the morphisms are equal, .
The underlying bijection of the braiding is the swap map
#β_hom_toEquivLet be a type of colors and let and be mappings representing two objects in the category . The underlying bijection between the index sets and induced by the braiding isomorphism is the canonical swap map that interchanges the two components of the disjoint union.
Let be a type of colors. For any two mappings and representing objects in the category , the bijection between the index sets and induced by the inverse braiding is the canonical swap map defined by swapping the order of the components in the disjoint union.
For any mappings , , and representing objects in the category and any morphism , the bijection between the index sets and induced by the left whiskering (the tensor product ) is equal to the disjoint union of the identity bijection on and the bijection between and induced by .
For any mappings , , and representing objects in the category and any morphism , the bijection between the index sets and induced by the right whiskering is equal to the disjoint union of the bijection induced by and the identity bijection on .
The underlying map of the associator in is the sum associativity bijection
#α_hom_toEquivLet be a type representing the colors of tensor indices. For any objects , , and in the category , the associator isomorphism of the monoidal structure is denoted by . This theorem states that the underlying bijection (equivalence) of the morphism is the standard set-theoretic associativity for disjoint unions, .
The inverse associator in equals the inverse sum associativity.
#α_inv_toEquivLet be a type of colors and let , , and be objects in the category . 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 is exactly the inverse of the standard set-theoretic associativity for disjoint unions, .
Equivalence induces an isomorphism in
#equivToIsoLet be a type representing colors of tensor indices. Given a coloring of an index set and an equivalence (bijection) between index sets, this definition constructs an isomorphism in the category between the object corresponding to and the object corresponding to the reindexed coloring . This isomorphism represents a color-preserving relabeling of indices from to .
The underlying bijection of is
#equivToIso_homToEquivLet be a type representing colors of tensor indices. For a coloring of an index set and a bijection between index sets, there is an induced isomorphism in the category . This theorem states that the underlying bijection of the forward morphism of this isomorphism is equal to .
The underlying bijection of the inverse of is
#equivToIso_inv_homToEquivLet be a type representing colors of tensor indices. For a coloring of an index set and a bijection between index sets, there is an induced isomorphism in the category . This theorem states that the underlying bijection of the inverse of this isomorphism is equal to the inverse bijection .
Morphism in from to induced by equivalence
#equivToHomLet be a type representing the colors of tensor indices. Given a coloring of an index set and an equivalence (bijection) between index sets and , this definition constructs a morphism in the category from the object representing to the object representing the reindexed coloring . This morphism is the color-preserving bijection that maps the indices in to their corresponding indices in .
Isomorphism for
#mkSumGiven a map that assigns colors from a type to a disjoint union of index types and , there exists a natural isomorphism in the category between the object defined by and the tensor product of the objects defined by its restrictions to and . Specifically, where and are the canonical injections into the disjoint union. This isomorphism is induced by the identity map on the underlying type , reflecting the monoidal structure of where the tensor product is defined by the disjoint union of index sets.
The underlying bijection of the morphism is the identity equivalence
#mkSum_homToEquivLet be a type representing colors of tensor indices. For any map assigning colors to the disjoint union of index sets and , let be the natural isomorphism in the category , where and are the canonical injections. The underlying bijection between the index sets induced by the forward morphism of this isomorphism, denoted , is the identity equivalence on .
The underlying bijection of is the identity equivalence
#mkSum_inv_homToEquivFor any map assigning colors from a type to a disjoint union of index types and , let be the isomorphism in the category , where and are the canonical injections. The theorem states that the underlying bijection of the inverse morphism is the identity equivalence on the type .
Isomorphism in from
#mkIsoGiven a type and two color-assigning maps , if , there is a canonical isomorphism between the objects and in the category . This isomorphism is induced by the identity bijection on the index type .
The morphism of is the identity
#mkIso_refl_homFor any mapping defining an object in the category , the forward morphism of the canonical isomorphism induced by the equality (via reflexivity) is equal to the identity morphism in .
The underlying function of is the identity function
#mkIso_hom_hom_leftLet be a type representing colors and a type representing indices. For any two color-assigning maps such that , let be the canonical isomorphism between the objects in defined by and . The underlying function of the morphism component of this isomorphism, which maps the index set to itself, is the identity function .
The underlying function of is the identity map
#mkIso_hom_hom_left_applyLet be a type of colors and a type of indices. For any two color-assigning maps such that , let be the canonical isomorphism between the objects in defined by and . For any index , the underlying function of the forward morphism component of this isomorphism applied to is equal to .
The underlying bijection of is the identity equivalence
#equivToIso_mkIso_homLet be a type of colors and a type of indices. For any two color-assigning maps such that , let be the canonical isomorphism between the objects represented by and in the category . The underlying bijection of indices associated with the morphism component of this isomorphism is the identity equivalence on .
The underlying bijection of is the identity equivalence
#equivToIso_mkIso_invLet be a type of colors and a type of indices. For any two color-assigning maps such that , let be the canonical isomorphism between the objects represented by and in the category . The underlying bijection of indices associated with the inverse morphism is the identity equivalence on .
The underlying function of `equivToHomEq e h` is
#equivToHomEq_hom_leftLet be a type of colors, and let and be types of indices. Suppose we have color-assigning maps and representing objects in the category . Given a bijection such that for all (denoted by the proof ), the underlying function of the morphism from to is equal to the function .
The underlying bijection of a morphism induced by is itself
#equivToHomEq_toEquivLet be a type of colors, and let and be types representing indices. Given two objects in the category defined by the color-assignment maps and , let be a bijection between the index sets. If satisfies the condition that for all , , then the underlying bijection of the morphism in induced by (denoted by `equivToHomEq e h`) is equal to .
