Library UniMath.Bicategories.MonoidalCategories.ActionBasedStrength
Definition of tensorial strength between actions over monoidal categories, as introduced
under the name C-categories and C-functors (for C a monoidal category) by Bodo Pareigis (1977).
The concrete definition is close to the paper "Second-Order and Dependently-Sorted Abstract Syntax" by Marcelo Fiore (2008). Notably, the strength itself is not required to be an isomorphism.
To distinguish this from less general approaches, we will speak of action-based strength.
Added by Ralph Matthes in 2021: relative strength of Ahrens and Matthes defined and shown to be an instance of action-based strength, another general definition in the spirit of Janelidze and Kelly
Require Import UniMath.Foundations.PartD.
Require Import UniMath.MoreFoundations.All.
Require Import UniMath.CategoryTheory.Core.Categories.
Require Import UniMath.CategoryTheory.Core.Functors.
Require Import UniMath.CategoryTheory.Core.Isos.
Require Import UniMath.CategoryTheory.Core.NaturalTransformations.
Require Import UniMath.CategoryTheory.PrecategoryBinProduct.
Require Import UniMath.CategoryTheory.FunctorCategory.
Require Import UniMath.CategoryTheory.whiskering.
Require Import UniMath.CategoryTheory.HorizontalComposition.
Require Import UniMath.CategoryTheory.Monoidal.Categories.
Require Import UniMath.CategoryTheory.Monoidal.Functors.
Require Import UniMath.Bicategories.MonoidalCategories.EndofunctorsMonoidal.
Require Import UniMath.Bicategories.MonoidalCategories.Actions.
Require Import UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors.
Require Import UniMath.CategoryTheory.Monoidal.AlternativeDefinitions.MonoidalCategoriesTensored.
Require Import UniMath.CategoryTheory.Monoidal.AlternativeDefinitions.MonoidalFunctorsTensored.
Require Import UniMath.Bicategories.MonoidalCategories.EndofunctorsWhiskeredMonoidal.
Require Import UniMath.Bicategories.Core.Bicat.
Require Import UniMath.Bicategories.Core.Examples.BicatOfCats.
Import MonoidalNotations.
Local Open Scope cat.
Section A.
Context (Mon_V : MonoidalCategoriesTensored.monoidal_cat).
Local Definition I := monoidal_cat_unit Mon_V.
Local Definition tensor := monoidal_cat_tensor Mon_V.
Notation "X ⊗ Y" := (tensor (X ,, Y)).
Section ActionBasedStrengths_Definition.
Context {A A': category}.
Context (actn : action Mon_V A)(actn' : action Mon_V A').
Local Definition ϱ := act_ϱ actn.
Local Definition χ := act_χ actn.
Local Definition ϱ' := act_ϱ actn'.
Local Definition χ' := act_χ actn'.
Section ActionBasedStrengths_Natural_Transformation.
Context (F : A ⟶ A').
Notation "X ⊙ Y" := (act_odot actn (X , Y)) (at level 31).
Notation "f #⊙ g" := (#(act_odot actn) (f #, g)) (at level 31).
Notation "X ⊙' Y" := (act_odot actn' (X , Y)) (at level 31).
Notation "f #⊙' g" := (#(act_odot actn') (f #, g)) (at level 31).
Definition actionbased_strength_dom : A ⊠ Mon_V ⟶ A' :=
functor_composite (pair_functor F (functor_identity _)) (act_odot actn').
Lemma actionbased_strength_dom_ok: functor_on_objects actionbased_strength_dom = λ ax, F (ob1 ax) ⊙' (ob2 ax).
Show proof.
Definition actionbased_strength_codom : A ⊠ Mon_V ⟶ A' :=
functor_composite (act_odot actn) F.
Lemma actionbased_strength_codom_ok: functor_on_objects actionbased_strength_codom = λ ax, F (ob1 ax ⊙ ob2 ax).
Show proof.
Definition actionbased_strength_nat : UU := nat_trans actionbased_strength_dom actionbased_strength_codom.
Definition actionbased_strength_nat_funclass (ϛ : actionbased_strength_nat):
∏ x : ob (A ⊠ Mon_V), actionbased_strength_dom x --> actionbased_strength_codom x
:= pr1 ϛ.
Coercion actionbased_strength_nat_funclass : actionbased_strength_nat >-> Funclass.
Definition actionbased_strength_triangle_eq (ϛ : actionbased_strength_nat) :=
∏ (a : A), (ϛ (a, I)) · (#F (ϱ a)) = ϱ' (F a).
Definition actionbased_strength_pentagon_eq (ϛ : actionbased_strength_nat): UU := ∏ (a : A), ∏ (v w : Mon_V),
(χ' ((F a, v), w)) · ϛ (a, v ⊗ w) =
(ϛ (a, v)) #⊙' (id w) · (ϛ (a ⊙ v, w)) · (#F (χ ((a, v), w))).
the notion in Fiore's LICS'08 paper
Definition actionbased_strength_pentagon_eq_variant1 (ϛ : actionbased_strength_nat): UU := ∏ (a : A), ∏ (v w : Mon_V),
ϛ (a, v ⊗ w) =
(nat_z_iso_to_trans_inv χ' ((F a, v), w)) · (ϛ (a, v)) #⊙' (id w) · (ϛ (a ⊙ v, w)) · (#F (χ ((a, v), w))).
ϛ (a, v ⊗ w) =
(nat_z_iso_to_trans_inv χ' ((F a, v), w)) · (ϛ (a, v)) #⊙' (id w) · (ϛ (a ⊙ v, w)) · (#F (χ ((a, v), w))).
the notion that fits with the definition of relative strength in the TYPES'15 post-proceedings paper by Ahrens and Matthes
Definition actionbased_strength_pentagon_eq_variant2 (ϛ : actionbased_strength_nat): UU := ∏ (a : A), ∏ (v w : Mon_V),
ϛ (a, v ⊗ w) · (#F (nat_z_iso_to_trans_inv χ ((a, v), w))) =
(nat_z_iso_to_trans_inv χ' ((F a, v), w)) · (ϛ (a, v)) #⊙' (id w) · (ϛ (a ⊙ v, w)).
ϛ (a, v ⊗ w) · (#F (nat_z_iso_to_trans_inv χ ((a, v), w))) =
(nat_z_iso_to_trans_inv χ' ((F a, v), w)) · (ϛ (a, v)) #⊙' (id w) · (ϛ (a ⊙ v, w)).
as expected, the notions are logically equivalent
Lemma actionbased_strength_pentagon_eq_tovariant1 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq ϛ -> actionbased_strength_pentagon_eq_variant1 ϛ.
Show proof.
Lemma actionbased_strength_pentagon_eq_fromvariant1 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq_variant1 ϛ -> actionbased_strength_pentagon_eq ϛ.
Show proof.
Lemma actionbased_strength_pentagon_eq_variant1variant2 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq_variant1 ϛ -> actionbased_strength_pentagon_eq_variant2 ϛ.
Show proof.
Lemma actionbased_strength_pentagon_eq_variant2variant1 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq_variant2 ϛ -> actionbased_strength_pentagon_eq_variant1 ϛ.
Show proof.
Lemma isaprop_actionbased_strength_triangle_eq (ϛ : actionbased_strength_nat) : isaprop (actionbased_strength_triangle_eq ϛ).
Show proof.
Lemma isaprop_actionbased_strength_pentagon_eq (ϛ : actionbased_strength_nat) : isaprop (actionbased_strength_pentagon_eq ϛ).
Show proof.
End ActionBasedStrengths_Natural_Transformation.
Definition actionbased_strength (F : A ⟶ A') : UU := ∑ (ϛ : actionbased_strength_nat F),
(actionbased_strength_triangle_eq F ϛ) × (actionbased_strength_pentagon_eq F ϛ).
Lemma actionbased_strength_eq {F : A ⟶ A'} (sη sη': actionbased_strength F) :
pr1 sη = pr1 sη' -> sη = sη'.
Show proof.
Definition actionbased_strength_to_nat {F : A ⟶ A'} (FF : actionbased_strength F) :
actionbased_strength_nat F
:= pr1 FF.
Coercion actionbased_strength_to_nat : actionbased_strength >-> actionbased_strength_nat.
Identity Coercion actionbased_strength_nat_to_nat_trans : actionbased_strength_nat >-> nat_trans.
Definition ab_strength_triangle {F : A ⟶ A'} (FF : actionbased_strength F) :
actionbased_strength_triangle_eq F FF
:= pr1 (pr2 FF).
Definition ab_strength_pentagon {F : A ⟶ A'} (FF : actionbased_strength F) :
actionbased_strength_pentagon_eq F FF
:= pr2 (pr2 FF).
End ActionBasedStrengths_Definition.
Definition ab_strength_identity_functor {A : category} (actn : action Mon_V A) :
actionbased_strength actn actn (functor_identity A).
Show proof.
Definition ab_strength_composition {A1 A2 A3 : category}
{actn1 : action Mon_V A1} {actn2 : action Mon_V A2} {actn3 : action Mon_V A3}
{F : A1 ⟶ A2} {F' : A2 ⟶ A3} :
actionbased_strength actn1 actn2 F -> actionbased_strength actn2 actn3 F' ->
actionbased_strength actn1 actn3 (F ∙ F').
Show proof.
Definition actionbased_strong_functor {A A' : category} (actn : action Mon_V A)(actn' : action Mon_V A') : UU
:= ∑ (F : A ⟶ A'), actionbased_strength actn actn' F.
Definition actionbased_strong_functor_to_functor (A A' : category) (actn : action Mon_V A)(actn' : action Mon_V A') (FF : actionbased_strong_functor actn actn') : A ⟶ A' := pr1 FF.
Coercion actionbased_strong_functor_to_functor : actionbased_strong_functor >-> functor.
Definition ab_strong_functor_strength {A A' : category} (actn : action Mon_V A)(actn' : action Mon_V A')
(FF : actionbased_strong_functor actn actn') : actionbased_strength_nat actn actn' FF
:= pr1 (pr2 FF).
Definition tensorial_strength : Mon_V ⟶ Mon_V → UU := actionbased_strength (tensorial_action Mon_V) (tensorial_action Mon_V).
Section Alternative_Definition.
Show proof.
intros Heq a v w.
red in Heq.
apply pathsinv0.
unfold nat_z_iso_to_trans_inv; cbn.
unfold is_z_isomorphism_mor.
do 2 rewrite <- assoc.
apply (z_iso_inv_on_right _ _ _ (make_z_iso _ _ (pr2 χ' ((F a, v), w)))).
apply pathsinv0.
rewrite assoc.
cbn.
apply Heq.
red in Heq.
apply pathsinv0.
unfold nat_z_iso_to_trans_inv; cbn.
unfold is_z_isomorphism_mor.
do 2 rewrite <- assoc.
apply (z_iso_inv_on_right _ _ _ (make_z_iso _ _ (pr2 χ' ((F a, v), w)))).
apply pathsinv0.
rewrite assoc.
cbn.
apply Heq.
Lemma actionbased_strength_pentagon_eq_fromvariant1 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq_variant1 ϛ -> actionbased_strength_pentagon_eq ϛ.
Show proof.
intros Heq a v w.
red in Heq.
unfold nat_z_iso_to_trans_inv in Heq; cbn in Heq.
unfold is_z_isomorphism_mor in Heq.
apply pathsinv0.
apply (z_iso_inv_to_left _ _ _ (make_z_iso _ _ (pr2 χ' ((F a, v), w)))).
cbn.
apply pathsinv0.
do 2 rewrite assoc.
apply Heq.
red in Heq.
unfold nat_z_iso_to_trans_inv in Heq; cbn in Heq.
unfold is_z_isomorphism_mor in Heq.
apply pathsinv0.
apply (z_iso_inv_to_left _ _ _ (make_z_iso _ _ (pr2 χ' ((F a, v), w)))).
cbn.
apply pathsinv0.
do 2 rewrite assoc.
apply Heq.
Lemma actionbased_strength_pentagon_eq_variant1variant2 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq_variant1 ϛ -> actionbased_strength_pentagon_eq_variant2 ϛ.
Show proof.
intros Heq a v w.
red in Heq.
etrans.
{ unfold nat_z_iso_to_trans_inv. cbn.
apply maponpaths.
apply pathsinv0.
apply functor_on_inv_from_z_iso'.
}
apply pathsinv0.
apply (z_iso_inv_on_left _ _ _ _ (make_z_iso (# F (χ ((a, v), w)))
(is_z_isomorphism_mor (functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))
(functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))).
apply Heq.
red in Heq.
etrans.
{ unfold nat_z_iso_to_trans_inv. cbn.
apply maponpaths.
apply pathsinv0.
apply functor_on_inv_from_z_iso'.
}
apply pathsinv0.
apply (z_iso_inv_on_left _ _ _ _ (make_z_iso (# F (χ ((a, v), w)))
(is_z_isomorphism_mor (functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))
(functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))).
apply Heq.
Lemma actionbased_strength_pentagon_eq_variant2variant1 (ϛ : actionbased_strength_nat): actionbased_strength_pentagon_eq_variant2 ϛ -> actionbased_strength_pentagon_eq_variant1 ϛ.
Show proof.
intros Heq a v w.
red in Heq.
apply pathsinv0.
apply (z_iso_inv_to_right _ _ _ _ (make_z_iso (# F (χ ((a, v), w)))
(is_z_isomorphism_mor (functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))
(functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))).
etrans.
{ apply pathsinv0.
apply Heq. }
clear Heq.
apply maponpaths.
apply pathsinv0.
apply (functor_on_inv_from_z_iso' _ (pr2 χ ((a, v), w))).
red in Heq.
apply pathsinv0.
apply (z_iso_inv_to_right _ _ _ _ (make_z_iso (# F (χ ((a, v), w)))
(is_z_isomorphism_mor (functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))
(functor_on_is_z_isomorphism F (pr2 χ ((a, v), w))))).
etrans.
{ apply pathsinv0.
apply Heq. }
clear Heq.
apply maponpaths.
apply pathsinv0.
apply (functor_on_inv_from_z_iso' _ (pr2 χ ((a, v), w))).
Lemma isaprop_actionbased_strength_triangle_eq (ϛ : actionbased_strength_nat) : isaprop (actionbased_strength_triangle_eq ϛ).
Show proof.
Lemma isaprop_actionbased_strength_pentagon_eq (ϛ : actionbased_strength_nat) : isaprop (actionbased_strength_pentagon_eq ϛ).
Show proof.
End ActionBasedStrengths_Natural_Transformation.
Definition actionbased_strength (F : A ⟶ A') : UU := ∑ (ϛ : actionbased_strength_nat F),
(actionbased_strength_triangle_eq F ϛ) × (actionbased_strength_pentagon_eq F ϛ).
Lemma actionbased_strength_eq {F : A ⟶ A'} (sη sη': actionbased_strength F) :
pr1 sη = pr1 sη' -> sη = sη'.
Show proof.
intro Heq.
apply subtypePath; trivial.
intro ϛ. apply isapropdirprod.
+ apply isaprop_actionbased_strength_triangle_eq.
+ apply isaprop_actionbased_strength_pentagon_eq.
apply subtypePath; trivial.
intro ϛ. apply isapropdirprod.
+ apply isaprop_actionbased_strength_triangle_eq.
+ apply isaprop_actionbased_strength_pentagon_eq.
Definition actionbased_strength_to_nat {F : A ⟶ A'} (FF : actionbased_strength F) :
actionbased_strength_nat F
:= pr1 FF.
Coercion actionbased_strength_to_nat : actionbased_strength >-> actionbased_strength_nat.
Identity Coercion actionbased_strength_nat_to_nat_trans : actionbased_strength_nat >-> nat_trans.
Definition ab_strength_triangle {F : A ⟶ A'} (FF : actionbased_strength F) :
actionbased_strength_triangle_eq F FF
:= pr1 (pr2 FF).
Definition ab_strength_pentagon {F : A ⟶ A'} (FF : actionbased_strength F) :
actionbased_strength_pentagon_eq F FF
:= pr2 (pr2 FF).
End ActionBasedStrengths_Definition.
Definition ab_strength_identity_functor {A : category} (actn : action Mon_V A) :
actionbased_strength actn actn (functor_identity A).
Show proof.
use tpair.
- use make_nat_trans.
+ intro av. apply identity.
+ intros av av' fg.
cbn. rewrite id_left. apply id_right.
- split.
+ intro a. cbn. apply id_left.
+ intros a v w. cbn. rewrite binprod_id. do 2 rewrite id_right.
etrans.
2: {apply cancel_postcomposition. apply pathsinv0, functor_id. }
apply pathsinv0, id_left.
- use make_nat_trans.
+ intro av. apply identity.
+ intros av av' fg.
cbn. rewrite id_left. apply id_right.
- split.
+ intro a. cbn. apply id_left.
+ intros a v w. cbn. rewrite binprod_id. do 2 rewrite id_right.
etrans.
2: {apply cancel_postcomposition. apply pathsinv0, functor_id. }
apply pathsinv0, id_left.
Definition ab_strength_composition {A1 A2 A3 : category}
{actn1 : action Mon_V A1} {actn2 : action Mon_V A2} {actn3 : action Mon_V A3}
{F : A1 ⟶ A2} {F' : A2 ⟶ A3} :
actionbased_strength actn1 actn2 F -> actionbased_strength actn2 actn3 F' ->
actionbased_strength actn1 actn3 (F ∙ F').
Show proof.
intros ζ ζ'.
use tpair.
- use make_nat_trans.
+ intro av. induction av as [a v].
exact (ζ' (F a,, v) · # F' (ζ (a,, v))).
+ intros av av' fg. induction av as [a v]. induction av' as [a' v']. induction fg as [f g].
cbn.
assert (ζisnatinst := nat_trans_ax ζ (a,, v) (a',, v') (f,, g)).
assert (ζ'isnatinst := nat_trans_ax ζ' (F a,, v) (F a',, v') (# F f,, g)).
rewrite assoc.
etrans.
{ apply cancel_postcomposition.
apply ζ'isnatinst. }
do 2 rewrite <- assoc.
apply maponpaths.
cbn.
do 2 rewrite <- functor_comp.
apply maponpaths.
apply ζisnatinst.
- split.
+ intro a. cbn.
assert (ζtriangleeqinst := ab_strength_triangle _ _ ζ a).
assert (ζ'triangleeqinst := ab_strength_triangle _ _ ζ' (F a)).
rewrite <- assoc.
rewrite <- functor_comp.
etrans.
{ do 2 apply maponpaths. exact ζtriangleeqinst. }
exact ζ'triangleeqinst.
+ intros a v w. cbn.
assert (ζpentagoneqinst := ab_strength_pentagon _ _ ζ a v w).
assert (ζ'pentagoneqinst := ab_strength_pentagon _ _ ζ' (F a) v w).
etrans.
{ rewrite assoc. apply cancel_postcomposition. exact ζ'pentagoneqinst. }
clear ζ'pentagoneqinst.
etrans.
2: { rewrite <- (id_right (id w)).
rewrite binprod_comp.
do 2 apply cancel_postcomposition.
apply pathsinv0, functor_comp. }
repeat rewrite <- assoc.
apply maponpaths.
etrans.
{ apply maponpaths.
apply pathsinv0.
apply (functor_comp F' (χ actn2 ((F a, v), w)) (ζ (a,, v ⊗ w))).
}
etrans.
{ do 2 apply maponpaths. apply ζpentagoneqinst. }
clear ζpentagoneqinst.
etrans.
{ do 2 rewrite functor_comp. repeat rewrite assoc. apply idpath. }
repeat rewrite assoc.
do 2 apply cancel_postcomposition.
assert (ζ'natinst := nat_trans_ax ζ' (act_odot actn2 (F a, v),, w)
(F(act_odot actn1 (a, v)),, w)
(ζ (a,, v),, id w)).
cbn in ζ'natinst.
etrans.
2 : { apply pathsinv0, ζ'natinst. }
apply idpath.
use tpair.
- use make_nat_trans.
+ intro av. induction av as [a v].
exact (ζ' (F a,, v) · # F' (ζ (a,, v))).
+ intros av av' fg. induction av as [a v]. induction av' as [a' v']. induction fg as [f g].
cbn.
assert (ζisnatinst := nat_trans_ax ζ (a,, v) (a',, v') (f,, g)).
assert (ζ'isnatinst := nat_trans_ax ζ' (F a,, v) (F a',, v') (# F f,, g)).
rewrite assoc.
etrans.
{ apply cancel_postcomposition.
apply ζ'isnatinst. }
do 2 rewrite <- assoc.
apply maponpaths.
cbn.
do 2 rewrite <- functor_comp.
apply maponpaths.
apply ζisnatinst.
- split.
+ intro a. cbn.
assert (ζtriangleeqinst := ab_strength_triangle _ _ ζ a).
assert (ζ'triangleeqinst := ab_strength_triangle _ _ ζ' (F a)).
rewrite <- assoc.
rewrite <- functor_comp.
etrans.
{ do 2 apply maponpaths. exact ζtriangleeqinst. }
exact ζ'triangleeqinst.
+ intros a v w. cbn.
assert (ζpentagoneqinst := ab_strength_pentagon _ _ ζ a v w).
assert (ζ'pentagoneqinst := ab_strength_pentagon _ _ ζ' (F a) v w).
etrans.
{ rewrite assoc. apply cancel_postcomposition. exact ζ'pentagoneqinst. }
clear ζ'pentagoneqinst.
etrans.
2: { rewrite <- (id_right (id w)).
rewrite binprod_comp.
do 2 apply cancel_postcomposition.
apply pathsinv0, functor_comp. }
repeat rewrite <- assoc.
apply maponpaths.
etrans.
{ apply maponpaths.
apply pathsinv0.
apply (functor_comp F' (χ actn2 ((F a, v), w)) (ζ (a,, v ⊗ w))).
}
etrans.
{ do 2 apply maponpaths. apply ζpentagoneqinst. }
clear ζpentagoneqinst.
etrans.
{ do 2 rewrite functor_comp. repeat rewrite assoc. apply idpath. }
repeat rewrite assoc.
do 2 apply cancel_postcomposition.
assert (ζ'natinst := nat_trans_ax ζ' (act_odot actn2 (F a, v),, w)
(F(act_odot actn1 (a, v)),, w)
(ζ (a,, v),, id w)).
cbn in ζ'natinst.
etrans.
2 : { apply pathsinv0, ζ'natinst. }
apply idpath.
Definition actionbased_strong_functor {A A' : category} (actn : action Mon_V A)(actn' : action Mon_V A') : UU
:= ∑ (F : A ⟶ A'), actionbased_strength actn actn' F.
Definition actionbased_strong_functor_to_functor (A A' : category) (actn : action Mon_V A)(actn' : action Mon_V A') (FF : actionbased_strong_functor actn actn') : A ⟶ A' := pr1 FF.
Coercion actionbased_strong_functor_to_functor : actionbased_strong_functor >-> functor.
Definition ab_strong_functor_strength {A A' : category} (actn : action Mon_V A)(actn' : action Mon_V A')
(FF : actionbased_strong_functor actn actn') : actionbased_strength_nat actn actn' FF
:= pr1 (pr2 FF).
Definition tensorial_strength : Mon_V ⟶ Mon_V → UU := actionbased_strength (tensorial_action Mon_V) (tensorial_action Mon_V).
Section Alternative_Definition.
we continue in the spirit of the definition of actions given by Janelidze and Kelly, however we are not aware
of this definition in the literature
Context (A A' : category).
Let Mon_EndA : monoidal_cat := monoidal_cat_of_endofunctors A.
Let Mon_EndA' : monoidal_cat := monoidal_cat_of_endofunctors A'.
Context (FA: strong_monoidal_functor Mon_V Mon_EndA).
Context (FA': strong_monoidal_functor Mon_V Mon_EndA').
Section Param_Distr.
Context (F : [A, A']).
Local Definition precompF := pre_composition_functor _ A' A' F.
Local Definition postcompF {C: category} := post_composition_functor C A A' F.
a parameterized form of distributivity as strength
Definition param_distributivity_dom : functor Mon_V [A, A'] :=
functor_compose (pr11 FA') precompF.
Goal ∏ v, param_distributivity_dom v = functor_compose F (FA' v).
Show proof.
Definition param_distributivity_codom : functor Mon_V [A, A'] :=
functor_compose (pr11 FA) postcompF.
Goal ∏ v, param_distributivity_codom v = functor_compose (FA v) F.
Show proof.
Definition parameterized_distributivity_nat : UU := param_distributivity_dom ⟹ param_distributivity_codom.
Definition parameterized_distributivity_nat_funclass (δ : parameterized_distributivity_nat):
∏ v : ob (Mon_V), param_distributivity_dom v --> param_distributivity_codom v
:= pr1 δ.
Coercion parameterized_distributivity_nat_funclass : parameterized_distributivity_nat >-> Funclass.
Section The_Laws.
Context (δ : parameterized_distributivity_nat).
Definition param_distr_triangle_eq : UU :=
# precompF (lax_monoidal_functor_ϵ FA') · (δ I) = # postcompF (lax_monoidal_functor_ϵ FA).
functor_compose (pr11 FA') precompF.
Goal ∏ v, param_distributivity_dom v = functor_compose F (FA' v).
Show proof.
Definition param_distributivity_codom : functor Mon_V [A, A'] :=
functor_compose (pr11 FA) postcompF.
Goal ∏ v, param_distributivity_codom v = functor_compose (FA v) F.
Show proof.
Definition parameterized_distributivity_nat : UU := param_distributivity_dom ⟹ param_distributivity_codom.
Definition parameterized_distributivity_nat_funclass (δ : parameterized_distributivity_nat):
∏ v : ob (Mon_V), param_distributivity_dom v --> param_distributivity_codom v
:= pr1 δ.
Coercion parameterized_distributivity_nat_funclass : parameterized_distributivity_nat >-> Funclass.
Section The_Laws.
Context (δ : parameterized_distributivity_nat).
Definition param_distr_triangle_eq : UU :=
# precompF (lax_monoidal_functor_ϵ FA') · (δ I) = # postcompF (lax_monoidal_functor_ϵ FA).
the type of the following def. is the same as that of δ I, as seen from the definition that comes
directly afterwards
Definition param_distr_triangle_eq_variant0_RHS :
[A, A'] ⟦ precompF (FA' (MonoidalFunctorsTensored.I_C Mon_V)), postcompF (FA (MonoidalFunctorsTensored.I_C Mon_V)) ⟧ :=
# precompF (strong_monoidal_functor_ϵ_inv FA') · # postcompF (lax_monoidal_functor_ϵ FA).
Definition param_distr_triangle_eq_variant0 : UU := δ I = param_distr_triangle_eq_variant0_RHS.
Definition param_distr_triangle_eq_variant : UU :=
(δ I) · (# postcompF (strong_monoidal_functor_ϵ_inv FA)) =
# precompF (strong_monoidal_functor_ϵ_inv FA').
Definition postwhisker_with_ϵ_inv_z_iso :
z_iso (postcompF (FA (MonoidalFunctorsTensored.I_C Mon_V))) (postcompF (MonoidalFunctorsTensored.I_D Mon_EndA)).
Show proof.
Definition prewhisker_with_ϵ_inv_z_iso :
z_iso (precompF (FA' (MonoidalFunctorsTensored.I_C Mon_V))) (precompF (MonoidalFunctorsTensored.I_D Mon_EndA')).
Show proof.
Lemma param_distr_triangle_eq_variant0_follows :
param_distr_triangle_eq -> param_distr_triangle_eq_variant0.
Show proof.
Lemma param_distr_triangle_eq_variant0_implies :
param_distr_triangle_eq_variant0 -> param_distr_triangle_eq.
Show proof.
Lemma param_distr_triangle_eq_variant_follows :
param_distr_triangle_eq -> param_distr_triangle_eq_variant.
Show proof.
Lemma param_distr_triangle_eq_variant_implies :
param_distr_triangle_eq_variant -> param_distr_triangle_eq.
Show proof.
[A, A'] ⟦ precompF (FA' (MonoidalFunctorsTensored.I_C Mon_V)), postcompF (FA (MonoidalFunctorsTensored.I_C Mon_V)) ⟧ :=
# precompF (strong_monoidal_functor_ϵ_inv FA') · # postcompF (lax_monoidal_functor_ϵ FA).
Definition param_distr_triangle_eq_variant0 : UU := δ I = param_distr_triangle_eq_variant0_RHS.
Definition param_distr_triangle_eq_variant : UU :=
(δ I) · (# postcompF (strong_monoidal_functor_ϵ_inv FA)) =
# precompF (strong_monoidal_functor_ϵ_inv FA').
Definition postwhisker_with_ϵ_inv_z_iso :
z_iso (postcompF (FA (MonoidalFunctorsTensored.I_C Mon_V))) (postcompF (MonoidalFunctorsTensored.I_D Mon_EndA)).
Show proof.
apply functor_on_z_iso.
use tpair.
- exact (strong_monoidal_functor_ϵ_inv FA).
- cbn beta in |- *.
apply is_z_isomorphism_inv.
use tpair.
- exact (strong_monoidal_functor_ϵ_inv FA).
- cbn beta in |- *.
apply is_z_isomorphism_inv.
Definition prewhisker_with_ϵ_inv_z_iso :
z_iso (precompF (FA' (MonoidalFunctorsTensored.I_C Mon_V))) (precompF (MonoidalFunctorsTensored.I_D Mon_EndA')).
Show proof.
apply functor_on_z_iso.
use tpair.
- exact (strong_monoidal_functor_ϵ_inv FA').
- cbn beta in |- *.
apply is_z_isomorphism_inv.
use tpair.
- exact (strong_monoidal_functor_ϵ_inv FA').
- cbn beta in |- *.
apply is_z_isomorphism_inv.
Lemma param_distr_triangle_eq_variant0_follows :
param_distr_triangle_eq -> param_distr_triangle_eq_variant0.
Show proof.
intro Hyp.
red.
unfold param_distr_triangle_eq_variant0_RHS.
apply pathsinv0 in Hyp.
apply (z_iso_inv_to_left _ _ _ prewhisker_with_ϵ_inv_z_iso).
apply pathsinv0.
exact Hyp.
red.
unfold param_distr_triangle_eq_variant0_RHS.
apply pathsinv0 in Hyp.
apply (z_iso_inv_to_left _ _ _ prewhisker_with_ϵ_inv_z_iso).
apply pathsinv0.
exact Hyp.
Lemma param_distr_triangle_eq_variant0_implies :
param_distr_triangle_eq_variant0 -> param_distr_triangle_eq.
Show proof.
intro Hyp.
red in Hyp.
unfold param_distr_triangle_eq_variant0_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ prewhisker_with_ϵ_inv_z_iso) in Hyp.
red.
exact Hyp.
red in Hyp.
unfold param_distr_triangle_eq_variant0_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ prewhisker_with_ϵ_inv_z_iso) in Hyp.
red.
exact Hyp.
Lemma param_distr_triangle_eq_variant_follows :
param_distr_triangle_eq -> param_distr_triangle_eq_variant.
Show proof.
intro Hyp.
red.
apply (z_iso_inv_to_right _ _ _ _ postwhisker_with_ϵ_inv_z_iso).
apply (z_iso_inv_to_left _ _ _ prewhisker_with_ϵ_inv_z_iso).
exact Hyp.
red.
apply (z_iso_inv_to_right _ _ _ _ postwhisker_with_ϵ_inv_z_iso).
apply (z_iso_inv_to_left _ _ _ prewhisker_with_ϵ_inv_z_iso).
exact Hyp.
Lemma param_distr_triangle_eq_variant_implies :
param_distr_triangle_eq_variant -> param_distr_triangle_eq.
Show proof.
intro Hyp.
red in Hyp.
apply pathsinv0 in Hyp.
apply (z_iso_inv_on_left _ _ _ _ postwhisker_with_ϵ_inv_z_iso) in Hyp.
apply (z_iso_inv_on_right _ _ _ prewhisker_with_ϵ_inv_z_iso) in Hyp.
exact Hyp.
red in Hyp.
apply pathsinv0 in Hyp.
apply (z_iso_inv_on_left _ _ _ _ postwhisker_with_ϵ_inv_z_iso) in Hyp.
apply (z_iso_inv_on_right _ _ _ prewhisker_with_ϵ_inv_z_iso) in Hyp.
exact Hyp.
we also abstract over the constituent distributivities
Definition param_distr_pentagon_eq_body_RHS (v w : Mon_V)
(dv: [A, A'] ⟦ param_distributivity_dom v, param_distributivity_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity_dom w, param_distributivity_codom w ⟧) :
[A, A']
⟦ precompF (monoidal_functor_map_dom Mon_V Mon_EndA' FA' (v,, w)),
postcompF (monoidal_functor_map_codom Mon_V Mon_EndA FA (v,, w))⟧.
Show proof.
Definition param_distr_pentagon_eq_body (v w : Mon_V) : UU.
Show proof.
Definition param_distr_pentagon_eq : UU := ∏ (v w : Mon_V), param_distr_pentagon_eq_body v w.
Definition param_distr_pentagon_eq_body_variant_RHS (v w : Mon_V)
(dv: [A, A'] ⟦ param_distributivity_dom v, param_distributivity_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity_dom w, param_distributivity_codom w ⟧) :
[A, A'] ⟦ param_distributivity_dom (v ⊗ w), param_distributivity_codom (v ⊗ w) ⟧.
Show proof.
Definition param_distr_pentagon_eq_body_variant (v w : Mon_V): UU :=
δ (v ⊗ w) = param_distr_pentagon_eq_body_variant_RHS v w (δ v) (δ w).
Definition prewhisker_with_μ_inv_z_iso (v w : Mon_V):
z_iso (precompF (monoidal_functor_map_codom Mon_V Mon_EndA' FA' (v,, w)))
(precompF (monoidal_functor_map_dom Mon_V Mon_EndA' FA' (v,, w))).
Show proof.
Lemma param_distr_pentagon_eq_body_variant_follows (v w : Mon_V):
param_distr_pentagon_eq_body v w -> param_distr_pentagon_eq_body_variant v w.
Show proof.
Lemma param_distr_pentagon_eq_body_variant_implies (v w : Mon_V):
param_distr_pentagon_eq_body_variant v w -> param_distr_pentagon_eq_body v w.
Show proof.
Lemma isaprop_param_distr_triangle_eq : isaprop param_distr_triangle_eq.
Show proof.
Lemma isaprop_param_distr_pentagon_eq : isaprop param_distr_pentagon_eq.
Show proof.
End The_Laws.
Definition parameterized_distributivity : UU := ∑ (δ : parameterized_distributivity_nat),
(param_distr_triangle_eq δ) × (param_distr_pentagon_eq δ).
Lemma parameterized_distributivity_eq (sδ sδ': parameterized_distributivity) :
pr1 sδ = pr1 sδ' -> sδ = sδ'.
Show proof.
Definition parameterized_distributivity_to_nat (sδ : parameterized_distributivity) :
parameterized_distributivity_nat
:= pr1 sδ.
Coercion parameterized_distributivity_to_nat : parameterized_distributivity >-> parameterized_distributivity_nat.
Identity Coercion parameterized_distributivity_nat_to_nat_trans : parameterized_distributivity_nat >-> nat_trans.
Context (sδ : parameterized_distributivity).
Let δ_triangle_eq : param_distr_triangle_eq (pr1 sδ) := pr1 (pr2 sδ).
Let δ_pentagon_eq : param_distr_pentagon_eq (pr1 sδ) := pr2 (pr2 sδ).
Let actionA : action Mon_V A := action_from_alt Mon_V A FA.
Let actionA' : action Mon_V A':= action_from_alt Mon_V A' FA'.
Definition strength_nat_from_alt_aux_dom :
actionbased_strength_dom actionA' F ⟹ uncurry_functor _ _ _ param_distributivity_dom.
Show proof.
Definition strength_nat_from_alt_aux_codom :
uncurry_functor _ _ _ param_distributivity_codom ⟹ actionbased_strength_codom actionA F.
Show proof.
Definition strength_nat_from_alt : actionbased_strength_nat actionA actionA' F.
Show proof.
Lemma triangle_eq_from_alt : actionbased_strength_triangle_eq actionA actionA' F strength_nat_from_alt.
Show proof.
Lemma pentagon_eq_from_alt : actionbased_strength_pentagon_eq actionA actionA' F strength_nat_from_alt.
Show proof.
Definition actionbased_strong_functor_from_alt : actionbased_strong_functor actionA actionA'.
Show proof.
End Param_Distr.
End Alternative_Definition.
End A.
Section Alternative_Definition_Whiskered.
Import BifunctorNotations.
Import MonoidalNotations.
Context {V : category}.
Context (Mon_V : monoidal V).
Notation "X ⊗ Y" := (X ⊗_{ Mon_V } Y).
Context (A A' : category).
Let Mon_EndA : monoidal (cat_of_endofunctors A) := monoidal_of_endofunctors A.
Let Mon_EndA' : monoidal (cat_of_endofunctors A') := monoidal_of_endofunctors A'.
Context {FA: functor V (cat_of_endofunctors A)}.
Context {FA': functor V (cat_of_endofunctors A')}.
Context (FAm: fmonoidal Mon_V Mon_EndA FA).
Context (FA'm: fmonoidal Mon_V Mon_EndA' FA').
Section Param_Distr.
Context (F : [A, A']).
(dv: [A, A'] ⟦ param_distributivity_dom v, param_distributivity_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity_dom w, param_distributivity_codom w ⟧) :
[A, A']
⟦ precompF (monoidal_functor_map_dom Mon_V Mon_EndA' FA' (v,, w)),
postcompF (monoidal_functor_map_codom Mon_V Mon_EndA FA (v,, w))⟧.
Show proof.
set (aux1 := # (post_comp_functor (FA' w)) dv).
set (aux2 := # (pre_comp_functor (FA v)) dw).
set (aux3 := # postcompF (lax_monoidal_functor_μ FA (v,,w))).
set (auxr := aux1 · aux2).
exact (auxr · aux3).
set (aux2 := # (pre_comp_functor (FA v)) dw).
set (aux3 := # postcompF (lax_monoidal_functor_μ FA (v,,w))).
set (auxr := aux1 · aux2).
exact (auxr · aux3).
Definition param_distr_pentagon_eq_body (v w : Mon_V) : UU.
Show proof.
set (aux := # precompF (lax_monoidal_functor_μ FA' (v,,w))).
exact (aux · δ (v ⊗ w) = param_distr_pentagon_eq_body_RHS v w (δ v) (δ w)).
exact (aux · δ (v ⊗ w) = param_distr_pentagon_eq_body_RHS v w (δ v) (δ w)).
Definition param_distr_pentagon_eq : UU := ∏ (v w : Mon_V), param_distr_pentagon_eq_body v w.
Definition param_distr_pentagon_eq_body_variant_RHS (v w : Mon_V)
(dv: [A, A'] ⟦ param_distributivity_dom v, param_distributivity_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity_dom w, param_distributivity_codom w ⟧) :
[A, A'] ⟦ param_distributivity_dom (v ⊗ w), param_distributivity_codom (v ⊗ w) ⟧.
Show proof.
set (aux1inv := # precompF (strong_monoidal_functor_μ_inv FA' (v,,w))).
exact (aux1inv · (param_distr_pentagon_eq_body_RHS v w dv dw)).
exact (aux1inv · (param_distr_pentagon_eq_body_RHS v w dv dw)).
Definition param_distr_pentagon_eq_body_variant (v w : Mon_V): UU :=
δ (v ⊗ w) = param_distr_pentagon_eq_body_variant_RHS v w (δ v) (δ w).
Definition prewhisker_with_μ_inv_z_iso (v w : Mon_V):
z_iso (precompF (monoidal_functor_map_codom Mon_V Mon_EndA' FA' (v,, w)))
(precompF (monoidal_functor_map_dom Mon_V Mon_EndA' FA' (v,, w))).
Show proof.
use tpair.
- exact (# precompF (strong_monoidal_functor_μ_inv FA' (v,,w))).
- cbn beta in |- *.
apply functor_on_is_z_isomorphism.
apply is_z_isomorphism_inv.
- exact (# precompF (strong_monoidal_functor_μ_inv FA' (v,,w))).
- cbn beta in |- *.
apply functor_on_is_z_isomorphism.
apply is_z_isomorphism_inv.
Lemma param_distr_pentagon_eq_body_variant_follows (v w : Mon_V):
param_distr_pentagon_eq_body v w -> param_distr_pentagon_eq_body_variant v w.
Show proof.
intro Hyp.
red.
unfold param_distr_pentagon_eq_body_variant_RHS.
apply (z_iso_inv_to_left _ _ _ (prewhisker_with_μ_inv_z_iso v w)).
exact Hyp.
red.
unfold param_distr_pentagon_eq_body_variant_RHS.
apply (z_iso_inv_to_left _ _ _ (prewhisker_with_μ_inv_z_iso v w)).
exact Hyp.
Lemma param_distr_pentagon_eq_body_variant_implies (v w : Mon_V):
param_distr_pentagon_eq_body_variant v w -> param_distr_pentagon_eq_body v w.
Show proof.
intro Hyp.
red in Hyp.
unfold param_distr_pentagon_eq_body_variant_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ (prewhisker_with_μ_inv_z_iso v w)) in Hyp.
exact Hyp.
red in Hyp.
unfold param_distr_pentagon_eq_body_variant_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ (prewhisker_with_μ_inv_z_iso v w)) in Hyp.
exact Hyp.
Lemma isaprop_param_distr_triangle_eq : isaprop param_distr_triangle_eq.
Show proof.
Lemma isaprop_param_distr_pentagon_eq : isaprop param_distr_pentagon_eq.
Show proof.
End The_Laws.
Definition parameterized_distributivity : UU := ∑ (δ : parameterized_distributivity_nat),
(param_distr_triangle_eq δ) × (param_distr_pentagon_eq δ).
Lemma parameterized_distributivity_eq (sδ sδ': parameterized_distributivity) :
pr1 sδ = pr1 sδ' -> sδ = sδ'.
Show proof.
intro Heq.
apply subtypePath; trivial.
intro δ. apply isapropdirprod.
- apply isaprop_param_distr_triangle_eq.
- apply isaprop_param_distr_pentagon_eq.
apply subtypePath; trivial.
intro δ. apply isapropdirprod.
- apply isaprop_param_distr_triangle_eq.
- apply isaprop_param_distr_pentagon_eq.
Definition parameterized_distributivity_to_nat (sδ : parameterized_distributivity) :
parameterized_distributivity_nat
:= pr1 sδ.
Coercion parameterized_distributivity_to_nat : parameterized_distributivity >-> parameterized_distributivity_nat.
Identity Coercion parameterized_distributivity_nat_to_nat_trans : parameterized_distributivity_nat >-> nat_trans.
Context (sδ : parameterized_distributivity).
Let δ_triangle_eq : param_distr_triangle_eq (pr1 sδ) := pr1 (pr2 sδ).
Let δ_pentagon_eq : param_distr_pentagon_eq (pr1 sδ) := pr2 (pr2 sδ).
Let actionA : action Mon_V A := action_from_alt Mon_V A FA.
Let actionA' : action Mon_V A':= action_from_alt Mon_V A' FA'.
Definition strength_nat_from_alt_aux_dom :
actionbased_strength_dom actionA' F ⟹ uncurry_functor _ _ _ param_distributivity_dom.
Show proof.
use make_nat_trans.
- intro av.
apply identity.
- intros av av' fg.
cbn.
rewrite id_left, id_right.
apply idpath.
- intro av.
apply identity.
- intros av av' fg.
cbn.
rewrite id_left, id_right.
apply idpath.
Definition strength_nat_from_alt_aux_codom :
uncurry_functor _ _ _ param_distributivity_codom ⟹ actionbased_strength_codom actionA F.
Show proof.
use make_nat_trans.
- intro av.
apply identity.
- intros av av' fg.
cbn.
rewrite id_left, id_right.
apply pathsinv0.
apply functor_comp.
- intro av.
apply identity.
- intros av av' fg.
cbn.
rewrite id_left, id_right.
apply pathsinv0.
apply functor_comp.
Definition strength_nat_from_alt : actionbased_strength_nat actionA actionA' F.
Show proof.
red.
refine (nat_trans_comp _ _ _ strength_nat_from_alt_aux_dom _).
refine (nat_trans_comp _ _ _ _ strength_nat_from_alt_aux_codom).
exact (uncurry_nattrans _ _ _ sδ).
refine (nat_trans_comp _ _ _ strength_nat_from_alt_aux_dom _).
refine (nat_trans_comp _ _ _ _ strength_nat_from_alt_aux_codom).
exact (uncurry_nattrans _ _ _ sδ).
Lemma triangle_eq_from_alt : actionbased_strength_triangle_eq actionA actionA' F strength_nat_from_alt.
Show proof.
red.
intro a.
apply param_distr_triangle_eq_variant_follows in δ_triangle_eq.
red in δ_triangle_eq.
apply (maponpaths pr1) in δ_triangle_eq.
apply toforallpaths in δ_triangle_eq.
assert (δ_triangle_eq_inst := δ_triangle_eq a).
clear δ_triangle_eq δ_pentagon_eq.
cbn in δ_triangle_eq_inst.
unfold strength_nat_from_alt, actionA, actionA'.
cbn.
do 3 rewrite id_left.
rewrite id_right.
exact δ_triangle_eq_inst.
intro a.
apply param_distr_triangle_eq_variant_follows in δ_triangle_eq.
red in δ_triangle_eq.
apply (maponpaths pr1) in δ_triangle_eq.
apply toforallpaths in δ_triangle_eq.
assert (δ_triangle_eq_inst := δ_triangle_eq a).
clear δ_triangle_eq δ_pentagon_eq.
cbn in δ_triangle_eq_inst.
unfold strength_nat_from_alt, actionA, actionA'.
cbn.
do 3 rewrite id_left.
rewrite id_right.
exact δ_triangle_eq_inst.
Lemma pentagon_eq_from_alt : actionbased_strength_pentagon_eq actionA actionA' F strength_nat_from_alt.
Show proof.
red.
intros a v w.
clear δ_triangle_eq.
assert (Hyp := δ_pentagon_eq v w).
red in Hyp.
apply (maponpaths pr1) in Hyp.
apply toforallpaths in Hyp.
assert (Hypinst := Hyp a).
clear Hyp.
cbn in Hypinst.
unfold strength_nat_from_alt, actionA, actionA'.
cbn.
do 5 rewrite id_left.
do 5 rewrite id_right.
assert (aux := functor_id FA' w).
apply (maponpaths pr1) in aux.
apply toforallpaths in aux.
rewrite aux.
rewrite id_right.
exact Hypinst.
intros a v w.
clear δ_triangle_eq.
assert (Hyp := δ_pentagon_eq v w).
red in Hyp.
apply (maponpaths pr1) in Hyp.
apply toforallpaths in Hyp.
assert (Hypinst := Hyp a).
clear Hyp.
cbn in Hypinst.
unfold strength_nat_from_alt, actionA, actionA'.
cbn.
do 5 rewrite id_left.
do 5 rewrite id_right.
assert (aux := functor_id FA' w).
apply (maponpaths pr1) in aux.
apply toforallpaths in aux.
rewrite aux.
rewrite id_right.
exact Hypinst.
Definition actionbased_strong_functor_from_alt : actionbased_strong_functor actionA actionA'.
Show proof.
exists F. exists strength_nat_from_alt.
split.
- exact triangle_eq_from_alt.
- exact pentagon_eq_from_alt.
split.
- exact triangle_eq_from_alt.
- exact pentagon_eq_from_alt.
End Param_Distr.
End Alternative_Definition.
End A.
Section Alternative_Definition_Whiskered.
Import BifunctorNotations.
Import MonoidalNotations.
Context {V : category}.
Context (Mon_V : monoidal V).
Notation "X ⊗ Y" := (X ⊗_{ Mon_V } Y).
Context (A A' : category).
Let Mon_EndA : monoidal (cat_of_endofunctors A) := monoidal_of_endofunctors A.
Let Mon_EndA' : monoidal (cat_of_endofunctors A') := monoidal_of_endofunctors A'.
Context {FA: functor V (cat_of_endofunctors A)}.
Context {FA': functor V (cat_of_endofunctors A')}.
Context (FAm: fmonoidal Mon_V Mon_EndA FA).
Context (FA'm: fmonoidal Mon_V Mon_EndA' FA').
Section Param_Distr.
Context (F : [A, A']).
the expected definitions:
Local Definition precomp'F := pre_composition_functor _ A' A' F.
Local Definition postcomp'F {C: category} := post_composition_functor C A A' F.
the definitions that are more compatible with the bicategorical scenario
Local Definition precomp'F := functor_fix_fst_arg _ (functorial_composition _ A') F.
Local Definition postcomp'F {C: category} := functor_fix_snd_arg _ (functorial_composition C _ A') F.
the definitions that force full compatibility with the bicategorical scenario
Local Definition precomp'F := UniMath.Bicategories.Core.Bicat.lwhisker_functor(C:=UniMath.Bicategories.Core.Examples.BicatOfCats.bicat_of_cats)(c:=A') F.
Local Definition postcomp'F {C: category} := UniMath.Bicategories.Core.Bicat.rwhisker_functor(C:=UniMath.Bicategories.Core.Examples.BicatOfCats.bicat_of_cats)(a:=C)(c:=A') F.
Local Definition postcomp'F {C: category} := UniMath.Bicategories.Core.Bicat.rwhisker_functor(C:=UniMath.Bicategories.Core.Examples.BicatOfCats.bicat_of_cats)(a:=C)(c:=A') F.
a parameterized form of distributivity as strength
Definition param_distributivity'_dom : functor V [A, A'] :=
functor_compose FA' precomp'F.
Goal ∏ v, param_distributivity'_dom v = functor_compose F (FA' v).
Show proof.
Definition param_distributivity'_codom : functor V [A, A'] :=
functor_compose FA postcomp'F.
Goal ∏ v, param_distributivity'_codom v = functor_compose (FA v) F.
Show proof.
Definition parameterized_distributivity'_nat : UU := param_distributivity'_dom ⟹ param_distributivity'_codom.
Definition parameterized_distributivity'_nat_funclass (δ : parameterized_distributivity'_nat):
∏ v : V, param_distributivity'_dom v --> param_distributivity'_codom v
:= pr1 δ.
Coercion parameterized_distributivity'_nat_funclass : parameterized_distributivity'_nat >-> Funclass.
Section The_Laws.
Context (δ : parameterized_distributivity'_nat).
Definition param_distr'_triangle_eq : UU :=
# precomp'F (fmonoidal_preservesunit FA'm) · (δ I_{Mon_V}) = # postcomp'F (fmonoidal_preservesunit FAm).
functor_compose FA' precomp'F.
Goal ∏ v, param_distributivity'_dom v = functor_compose F (FA' v).
Show proof.
Definition param_distributivity'_codom : functor V [A, A'] :=
functor_compose FA postcomp'F.
Goal ∏ v, param_distributivity'_codom v = functor_compose (FA v) F.
Show proof.
Definition parameterized_distributivity'_nat : UU := param_distributivity'_dom ⟹ param_distributivity'_codom.
Definition parameterized_distributivity'_nat_funclass (δ : parameterized_distributivity'_nat):
∏ v : V, param_distributivity'_dom v --> param_distributivity'_codom v
:= pr1 δ.
Coercion parameterized_distributivity'_nat_funclass : parameterized_distributivity'_nat >-> Funclass.
Section The_Laws.
Context (δ : parameterized_distributivity'_nat).
Definition param_distr'_triangle_eq : UU :=
# precomp'F (fmonoidal_preservesunit FA'm) · (δ I_{Mon_V}) = # postcomp'F (fmonoidal_preservesunit FAm).
the type of the following def. is the same as that of δ I_{Mon_V}, as seen from the definition that comes
directly afterwards
Definition param_distr'_triangle_eq_variant0_RHS :
[A, A'] ⟦ precomp'F (FA' I_{ Mon_V}), postcomp'F (FA I_{ Mon_V}) ⟧ :=
# precomp'F (pr1 (fmonoidal_preservesunitstrongly FA'm)) · # postcomp'F (fmonoidal_preservesunit FAm).
Definition param_distr'_triangle_eq_variant0 : UU := δ I_{Mon_V} = param_distr'_triangle_eq_variant0_RHS.
Definition prewhisker_with_ϵ_inv_z_iso' :
z_iso (precomp'F (FA' I_{Mon_V})) (precomp'F (I_{Mon_EndA'})).
Show proof.
Lemma param_distr'_triangle_eq_variant0_follows :
param_distr'_triangle_eq -> param_distr'_triangle_eq_variant0.
Show proof.
Lemma param_distr'_triangle_eq_variant0_implies :
param_distr'_triangle_eq_variant0 -> param_distr'_triangle_eq.
Show proof.
[A, A'] ⟦ precomp'F (FA' I_{ Mon_V}), postcomp'F (FA I_{ Mon_V}) ⟧ :=
# precomp'F (pr1 (fmonoidal_preservesunitstrongly FA'm)) · # postcomp'F (fmonoidal_preservesunit FAm).
Definition param_distr'_triangle_eq_variant0 : UU := δ I_{Mon_V} = param_distr'_triangle_eq_variant0_RHS.
Definition prewhisker_with_ϵ_inv_z_iso' :
z_iso (precomp'F (FA' I_{Mon_V})) (precomp'F (I_{Mon_EndA'})).
Show proof.
apply functor_on_z_iso.
use tpair.
- exact (pr1 (fmonoidal_preservesunitstrongly FA'm)).
- cbn beta in |- *.
apply is_z_isomorphism_inv.
use tpair.
- exact (pr1 (fmonoidal_preservesunitstrongly FA'm)).
- cbn beta in |- *.
apply is_z_isomorphism_inv.
Lemma param_distr'_triangle_eq_variant0_follows :
param_distr'_triangle_eq -> param_distr'_triangle_eq_variant0.
Show proof.
intro Hyp.
red.
unfold param_distr'_triangle_eq_variant0_RHS.
apply pathsinv0 in Hyp.
apply (z_iso_inv_to_left _ _ _ prewhisker_with_ϵ_inv_z_iso').
apply pathsinv0.
exact Hyp.
red.
unfold param_distr'_triangle_eq_variant0_RHS.
apply pathsinv0 in Hyp.
apply (z_iso_inv_to_left _ _ _ prewhisker_with_ϵ_inv_z_iso').
apply pathsinv0.
exact Hyp.
Lemma param_distr'_triangle_eq_variant0_implies :
param_distr'_triangle_eq_variant0 -> param_distr'_triangle_eq.
Show proof.
intro Hyp.
red in Hyp.
unfold param_distr'_triangle_eq_variant0_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ prewhisker_with_ϵ_inv_z_iso') in Hyp.
red.
exact Hyp.
red in Hyp.
unfold param_distr'_triangle_eq_variant0_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ prewhisker_with_ϵ_inv_z_iso') in Hyp.
red.
exact Hyp.
we also abstract over the constituent distributivities
Definition param_distr'_pentagon_eq_body_RHS (v w : V)
(dv: [A, A'] ⟦ param_distributivity'_dom v, param_distributivity'_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity'_dom w, param_distributivity'_codom w ⟧) :
[A, A'] ⟦ precomp'F ((FA' v) ⊗_{Mon_EndA'} (FA' w)), postcomp'F (FA (v ⊗_{Mon_V} w))⟧.
Show proof.
Definition param_distr'_pentagon_eq_body (v w : V) : UU.
Show proof.
Definition param_distr'_pentagon_eq : UU := ∏ (v w : V), param_distr'_pentagon_eq_body v w.
Definition param_distr'_pentagon_eq_body_variant_RHS (v w : V)
(dv: [A, A'] ⟦ param_distributivity'_dom v, param_distributivity'_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity'_dom w, param_distributivity'_codom w ⟧) :
[A, A'] ⟦ param_distributivity'_dom (v ⊗ w), param_distributivity'_codom (v ⊗ w) ⟧.
Show proof.
Definition param_distr'_pentagon_eq_body_variant (v w : V): UU :=
δ (v ⊗ w) = param_distr'_pentagon_eq_body_variant_RHS v w (δ v) (δ w).
Definition param_distr'_pentagon_eq_variant: UU :=
∏ (v w : V), param_distr'_pentagon_eq_body_variant v w.
Definition prewhisker_with_μ_inv_z_iso' (v w : V):
z_iso (precomp'F (FA' (v ⊗ w)))
(precomp'F ((FA' v) ⊗_{Mon_EndA'} (FA' w))).
Show proof.
Lemma param_distr'_pentagon_eq_body_variant_follows (v w : V):
param_distr'_pentagon_eq_body v w -> param_distr'_pentagon_eq_body_variant v w.
Show proof.
Lemma param_distr'_pentagon_eq_body_variant_implies (v w : V):
param_distr'_pentagon_eq_body_variant v w -> param_distr'_pentagon_eq_body v w.
Show proof.
Lemma isaprop_param_distr'_triangle_eq : isaprop param_distr'_triangle_eq.
Show proof.
Lemma isaprop_param_distr'_pentagon_eq : isaprop param_distr'_pentagon_eq.
Show proof.
End The_Laws.
Definition parameterized_distributivity' : UU := ∑ (δ : parameterized_distributivity'_nat),
(param_distr'_triangle_eq δ) × (param_distr'_pentagon_eq δ).
Lemma parameterized_distributivity'_eq (sδ sδ': parameterized_distributivity') :
pr1 sδ = pr1 sδ' -> sδ = sδ'.
Show proof.
Definition parameterized_distributivity'_to_nat (sδ : parameterized_distributivity') :
parameterized_distributivity'_nat
:= pr1 sδ.
Coercion parameterized_distributivity'_to_nat : parameterized_distributivity' >-> parameterized_distributivity'_nat.
Identity Coercion parameterized_distributivity'_nat_to_nat_trans : parameterized_distributivity'_nat >-> nat_trans.
End Param_Distr.
End Alternative_Definition_Whiskered.
Section B.
(dv: [A, A'] ⟦ param_distributivity'_dom v, param_distributivity'_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity'_dom w, param_distributivity'_codom w ⟧) :
[A, A'] ⟦ precomp'F ((FA' v) ⊗_{Mon_EndA'} (FA' w)), postcomp'F (FA (v ⊗_{Mon_V} w))⟧.
Show proof.
set (aux1 := # (post_comp_functor (FA' w)) dv).
set (aux2 := # (pre_comp_functor (FA v)) dw).
set (aux3 := # postcomp'F (fmonoidal_preservestensordata FAm v w)).
set (auxr := aux1 · aux2).
exact (auxr · aux3).
set (aux2 := # (pre_comp_functor (FA v)) dw).
set (aux3 := # postcomp'F (fmonoidal_preservestensordata FAm v w)).
set (auxr := aux1 · aux2).
exact (auxr · aux3).
Definition param_distr'_pentagon_eq_body (v w : V) : UU.
Show proof.
set (aux := # precomp'F (fmonoidal_preservestensordata FA'm v w)).
exact (aux · δ (v ⊗ w) = param_distr'_pentagon_eq_body_RHS v w (δ v) (δ w)).
exact (aux · δ (v ⊗ w) = param_distr'_pentagon_eq_body_RHS v w (δ v) (δ w)).
Definition param_distr'_pentagon_eq : UU := ∏ (v w : V), param_distr'_pentagon_eq_body v w.
Definition param_distr'_pentagon_eq_body_variant_RHS (v w : V)
(dv: [A, A'] ⟦ param_distributivity'_dom v, param_distributivity'_codom v ⟧)
(dw: [A, A'] ⟦ param_distributivity'_dom w, param_distributivity'_codom w ⟧) :
[A, A'] ⟦ param_distributivity'_dom (v ⊗ w), param_distributivity'_codom (v ⊗ w) ⟧.
Show proof.
set (aux1inv := # precomp'F (pr1 (fmonoidal_preservestensorstrongly FA'm v w))).
exact (aux1inv · (param_distr'_pentagon_eq_body_RHS v w dv dw)).
exact (aux1inv · (param_distr'_pentagon_eq_body_RHS v w dv dw)).
Definition param_distr'_pentagon_eq_body_variant (v w : V): UU :=
δ (v ⊗ w) = param_distr'_pentagon_eq_body_variant_RHS v w (δ v) (δ w).
Definition param_distr'_pentagon_eq_variant: UU :=
∏ (v w : V), param_distr'_pentagon_eq_body_variant v w.
Definition prewhisker_with_μ_inv_z_iso' (v w : V):
z_iso (precomp'F (FA' (v ⊗ w)))
(precomp'F ((FA' v) ⊗_{Mon_EndA'} (FA' w))).
Show proof.
use tpair.
- exact (# precomp'F (pr1 (fmonoidal_preservestensorstrongly FA'm v w))).
- cbn beta in |- *.
apply functor_on_is_z_isomorphism.
apply is_z_isomorphism_inv.
- exact (# precomp'F (pr1 (fmonoidal_preservestensorstrongly FA'm v w))).
- cbn beta in |- *.
apply functor_on_is_z_isomorphism.
apply is_z_isomorphism_inv.
Lemma param_distr'_pentagon_eq_body_variant_follows (v w : V):
param_distr'_pentagon_eq_body v w -> param_distr'_pentagon_eq_body_variant v w.
Show proof.
intro Hyp.
red.
unfold param_distr'_pentagon_eq_body_variant_RHS.
apply (z_iso_inv_to_left _ _ _ (prewhisker_with_μ_inv_z_iso' v w)).
exact Hyp.
red.
unfold param_distr'_pentagon_eq_body_variant_RHS.
apply (z_iso_inv_to_left _ _ _ (prewhisker_with_μ_inv_z_iso' v w)).
exact Hyp.
Lemma param_distr'_pentagon_eq_body_variant_implies (v w : V):
param_distr'_pentagon_eq_body_variant v w -> param_distr'_pentagon_eq_body v w.
Show proof.
intro Hyp.
red in Hyp.
unfold param_distr'_pentagon_eq_body_variant_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ (prewhisker_with_μ_inv_z_iso' v w)) in Hyp.
exact Hyp.
red in Hyp.
unfold param_distr'_pentagon_eq_body_variant_RHS in Hyp.
apply (z_iso_inv_on_right _ _ _ (prewhisker_with_μ_inv_z_iso' v w)) in Hyp.
exact Hyp.
Lemma isaprop_param_distr'_triangle_eq : isaprop param_distr'_triangle_eq.
Show proof.
Lemma isaprop_param_distr'_pentagon_eq : isaprop param_distr'_pentagon_eq.
Show proof.
End The_Laws.
Definition parameterized_distributivity' : UU := ∑ (δ : parameterized_distributivity'_nat),
(param_distr'_triangle_eq δ) × (param_distr'_pentagon_eq δ).
Lemma parameterized_distributivity'_eq (sδ sδ': parameterized_distributivity') :
pr1 sδ = pr1 sδ' -> sδ = sδ'.
Show proof.
intro Heq.
apply subtypePath; trivial.
intro δ. apply isapropdirprod.
- apply isaprop_param_distr'_triangle_eq.
- apply isaprop_param_distr'_pentagon_eq.
apply subtypePath; trivial.
intro δ. apply isapropdirprod.
- apply isaprop_param_distr'_triangle_eq.
- apply isaprop_param_distr'_pentagon_eq.
Definition parameterized_distributivity'_to_nat (sδ : parameterized_distributivity') :
parameterized_distributivity'_nat
:= pr1 sδ.
Coercion parameterized_distributivity'_to_nat : parameterized_distributivity' >-> parameterized_distributivity'_nat.
Identity Coercion parameterized_distributivity'_nat_to_nat_trans : parameterized_distributivity'_nat >-> nat_trans.
End Param_Distr.
End Alternative_Definition_Whiskered.
Section B.
following the TYPES'15 post-proceedings paper by Ahrens and Matthes - will be identified as an instance of the previous
Context {Mon_W Mon_V : monoidal_cat}.
Local Definition timesV := monoidal_cat_tensor Mon_V.
Local Definition lambda := monoidal_cat_left_unitor Mon_V.
Local Definition alpha := monoidal_cat_associator Mon_V.
Local Definition timesW := monoidal_cat_tensor Mon_W.
Context (U : strong_monoidal_functor Mon_W Mon_V).
Section RelativeStrengths_Natural_Transformation.
Context (F: Mon_V ⟶ Mon_V).
Notation "X ⊗V Y" := (timesV (X , Y)) (at level 31).
Notation "X •W Y" := (timesW (X , Y)) (at level 31).
Notation "f #⊗V g" := (#timesV (f #, g)) (at level 31).
Notation "f #•W g" := (#timesW (f #, g)) (at level 31).
Definition rel_strength_dom : Mon_W ⊠ Mon_V ⟶ Mon_V :=
functor_composite (pair_functor U F) timesV.
Lemma rel_strength_dom_ok: functor_on_objects rel_strength_dom = λ ax, U (ob1 ax) ⊗V F (ob2 ax).
Show proof.
Definition rel_strength_codom : Mon_W ⊠ Mon_V ⟶ Mon_V :=
functor_composite (functor_composite (pair_functor U (functor_identity _)) timesV) F.
Lemma rel_strength_codom_ok: functor_on_objects rel_strength_codom = λ ax, F (U (ob1 ax) ⊗V ob2 ax).
Show proof.
Definition rel_strength_nat : UU := nat_trans rel_strength_dom rel_strength_codom.
Definition rel_strength_nat_funclass (ϛ : rel_strength_nat):
∏ x : ob (Mon_W ⊠ Mon_V), rel_strength_dom x --> rel_strength_codom x
:= pr1 ϛ.
Coercion rel_strength_nat_funclass : rel_strength_nat >-> Funclass.
the following looks like a pentagon but is of the nature of a triangle equation
Definition rel_strength_pentagon_eq (ϛ : rel_strength_nat) :=
∏ (v : Mon_V), ϛ (monoidal_cat_unit Mon_W, v) · #F (strong_monoidal_functor_ϵ_inv U #⊗V identity v) · #F (lambda v) =
strong_monoidal_functor_ϵ_inv U #⊗V identity (F v) · lambda (F v).
∏ (v : Mon_V), ϛ (monoidal_cat_unit Mon_W, v) · #F (strong_monoidal_functor_ϵ_inv U #⊗V identity v) · #F (lambda v) =
strong_monoidal_functor_ϵ_inv U #⊗V identity (F v) · lambda (F v).
the following looks like a rectangle in the paper but is of the nature of a pentagon equation
Definition rel_strength_rectangle_eq (ϛ : rel_strength_nat): UU := ∏ (w w' : Mon_W), ∏ (v : Mon_V),
ϛ (w •W w', v) · #F (strong_monoidal_functor_μ_inv U (w, w') #⊗V identity v) · #F (alpha ((U w, U w'), v)) =
strong_monoidal_functor_μ_inv U (w, w') #⊗V identity (F v) · alpha ((U w, U w'), F v) ·
identity (U w) #⊗V ϛ (w', v) · ϛ (w, U w' ⊗V v).
End RelativeStrengths_Natural_Transformation.
Definition rel_strength (F : Mon_V ⟶ Mon_V): UU :=
∑ (ϛ : rel_strength_nat F), (rel_strength_pentagon_eq F ϛ) × (rel_strength_rectangle_eq F ϛ).
Definition rel_strength_to_rel_strength_nat {F : Mon_V ⟶ Mon_V} (str : rel_strength F) :
rel_strength_nat F
:= pr1 str.
Coercion rel_strength_to_rel_strength_nat : rel_strength >-> rel_strength_nat.
Identity Coercion rel_strength_nat_to_nat_trans : rel_strength_nat >-> nat_trans.
Definition rel_strength_pentagon {F : Mon_V ⟶ Mon_V} (str : rel_strength F) :
rel_strength_pentagon_eq F str
:= pr1 (pr2 str).
Definition rel_strength_rectangle {F : Mon_V ⟶ Mon_V} (str : rel_strength F) :
rel_strength_rectangle_eq F str
:= pr2 (pr2 str).
Section RelativeStrength_Is_An_ActionBasedStrength.
Context (F: Mon_V ⟶ Mon_V) (str: rel_strength F).
Local Definition pentagon := rel_strength_pentagon str.
Local Definition rectangle := rel_strength_rectangle str.
Local Definition Mon_W' := swapping_of_monoidal_cat Mon_W.
Local Definition timesW' := monoidal_cat_tensor Mon_W'.
Local Definition Mon_V' := swapping_of_monoidal_cat Mon_V.
Local Definition timesV' := monoidal_cat_tensor Mon_V'.
Local Definition U' := swapping_of_strong_monoidal_functor U: strong_monoidal_functor Mon_W' Mon_V'.
Local Definition phiinv' := pre_whisker binswap_pair_functor (strong_monoidal_functor_μ_inv U).
Local Definition UAct := U_action Mon_W' U': action Mon_W' Mon_V'.
Local Definition ϛ' := pre_whisker binswap_pair_functor str.
Definition actionbased_strength_from_relative_strength: actionbased_strength Mon_W' UAct UAct F.
Show proof.
End RelativeStrength_Is_An_ActionBasedStrength.
Section ActionBasedStrength_Instantiates_To_RelativeStrength.
Context (F: Mon_V ⟶ Mon_V) (ab_str: actionbased_strength Mon_W' UAct UAct F).
Local Definition θ' : rel_strength_nat F := pre_whisker binswap_pair_functor ab_str.
Lemma relative_strength_from_actionbased_strength_laws : rel_strength_pentagon_eq F θ' × rel_strength_rectangle_eq F θ'.
Show proof.
Definition relative_strength_from_actionbased_strength: rel_strength F.
Show proof.
End ActionBasedStrength_Instantiates_To_RelativeStrength.
End B.
Arguments ab_strength_triangle {_ _ _ _ _} _.
Arguments ab_strength_pentagon {_ _ _ _ _} _.
Arguments ab_strong_functor_strength {_ _ _ _} _.
ϛ (w •W w', v) · #F (strong_monoidal_functor_μ_inv U (w, w') #⊗V identity v) · #F (alpha ((U w, U w'), v)) =
strong_monoidal_functor_μ_inv U (w, w') #⊗V identity (F v) · alpha ((U w, U w'), F v) ·
identity (U w) #⊗V ϛ (w', v) · ϛ (w, U w' ⊗V v).
End RelativeStrengths_Natural_Transformation.
Definition rel_strength (F : Mon_V ⟶ Mon_V): UU :=
∑ (ϛ : rel_strength_nat F), (rel_strength_pentagon_eq F ϛ) × (rel_strength_rectangle_eq F ϛ).
Definition rel_strength_to_rel_strength_nat {F : Mon_V ⟶ Mon_V} (str : rel_strength F) :
rel_strength_nat F
:= pr1 str.
Coercion rel_strength_to_rel_strength_nat : rel_strength >-> rel_strength_nat.
Identity Coercion rel_strength_nat_to_nat_trans : rel_strength_nat >-> nat_trans.
Definition rel_strength_pentagon {F : Mon_V ⟶ Mon_V} (str : rel_strength F) :
rel_strength_pentagon_eq F str
:= pr1 (pr2 str).
Definition rel_strength_rectangle {F : Mon_V ⟶ Mon_V} (str : rel_strength F) :
rel_strength_rectangle_eq F str
:= pr2 (pr2 str).
Section RelativeStrength_Is_An_ActionBasedStrength.
Context (F: Mon_V ⟶ Mon_V) (str: rel_strength F).
Local Definition pentagon := rel_strength_pentagon str.
Local Definition rectangle := rel_strength_rectangle str.
Local Definition Mon_W' := swapping_of_monoidal_cat Mon_W.
Local Definition timesW' := monoidal_cat_tensor Mon_W'.
Local Definition Mon_V' := swapping_of_monoidal_cat Mon_V.
Local Definition timesV' := monoidal_cat_tensor Mon_V'.
Local Definition U' := swapping_of_strong_monoidal_functor U: strong_monoidal_functor Mon_W' Mon_V'.
Local Definition phiinv' := pre_whisker binswap_pair_functor (strong_monoidal_functor_μ_inv U).
Local Definition UAct := U_action Mon_W' U': action Mon_W' Mon_V'.
Local Definition ϛ' := pre_whisker binswap_pair_functor str.
Definition actionbased_strength_from_relative_strength: actionbased_strength Mon_W' UAct UAct F.
Show proof.
exists ϛ'.
split.
- red.
cbn.
intro v.
change (str (monoidal_cat_unit Mon_W, v) · # F (# timesV (strong_monoidal_functor_ϵ_inv U #, id v) · lambda v) =
# timesV (strong_monoidal_functor_ϵ_inv U #, id F v) · lambda (F v)).
rewrite <- pentagon.
rewrite assoc'. rewrite functor_comp.
apply idpath.
- cbn.
apply actionbased_strength_pentagon_eq_fromvariant1.
apply actionbased_strength_pentagon_eq_variant2variant1.
red.
intros v w' w.
unfold ϛ', Mon_W', Mon_V', U'.
cbn.
unfold is_z_isomorphism_mor, pre_whisker_on_nat_z_iso.
cbn.
assert (Hyp := rectangle w w' v).
fold timesV.
fold timesW.
fold alpha.
change (str (timesW (w, w'), v)
· # F (# timesV (strong_monoidal_functor_μ_inv U (w, w') #, id v) · alpha ((U w, U w'), v)) =
# timesV (strong_monoidal_functor_μ_inv U (w, w') #, id F v) · alpha ((U w, U w'), F v)
· # timesV (# U (id w) #, str (w', v)) · str (w, timesV (U w', v))).
rewrite functor_id.
rewrite functor_comp.
rewrite assoc.
exact Hyp.
split.
- red.
cbn.
intro v.
change (str (monoidal_cat_unit Mon_W, v) · # F (# timesV (strong_monoidal_functor_ϵ_inv U #, id v) · lambda v) =
# timesV (strong_monoidal_functor_ϵ_inv U #, id F v) · lambda (F v)).
rewrite <- pentagon.
rewrite assoc'. rewrite functor_comp.
apply idpath.
- cbn.
apply actionbased_strength_pentagon_eq_fromvariant1.
apply actionbased_strength_pentagon_eq_variant2variant1.
red.
intros v w' w.
unfold ϛ', Mon_W', Mon_V', U'.
cbn.
unfold is_z_isomorphism_mor, pre_whisker_on_nat_z_iso.
cbn.
assert (Hyp := rectangle w w' v).
fold timesV.
fold timesW.
fold alpha.
change (str (timesW (w, w'), v)
· # F (# timesV (strong_monoidal_functor_μ_inv U (w, w') #, id v) · alpha ((U w, U w'), v)) =
# timesV (strong_monoidal_functor_μ_inv U (w, w') #, id F v) · alpha ((U w, U w'), F v)
· # timesV (# U (id w) #, str (w', v)) · str (w, timesV (U w', v))).
rewrite functor_id.
rewrite functor_comp.
rewrite assoc.
exact Hyp.
End RelativeStrength_Is_An_ActionBasedStrength.
Section ActionBasedStrength_Instantiates_To_RelativeStrength.
Context (F: Mon_V ⟶ Mon_V) (ab_str: actionbased_strength Mon_W' UAct UAct F).
Local Definition θ' : rel_strength_nat F := pre_whisker binswap_pair_functor ab_str.
Lemma relative_strength_from_actionbased_strength_laws : rel_strength_pentagon_eq F θ' × rel_strength_rectangle_eq F θ'.
Show proof.
split.
- red.
cbn.
intro v.
assert (Hyp := ab_strength_triangle _ _ _ ab_str v).
cbn in Hyp. fold timesV in Hyp.
etrans.
2: exact Hyp.
clear Hyp.
rewrite <- assoc.
apply maponpaths.
apply pathsinv0.
apply functor_comp.
- red. cbn. intros w w' v.
assert (Hyp := actionbased_strength_pentagon_eq_variant1variant2 _ _ _ _ ab_str
(actionbased_strength_pentagon_eq_tovariant1 _ _ _ _ ab_str
(ab_strength_pentagon _ _ _ ab_str)) v w' w).
cbn in Hyp.
unfold is_z_isomorphism_mor, pre_whisker_on_nat_z_iso in Hyp.
cbn in Hyp.
unfold is_z_isomorphism_mor.
rewrite functor_id in Hyp.
rewrite functor_comp in Hyp.
rewrite assoc in Hyp.
exact Hyp.
- red.
cbn.
intro v.
assert (Hyp := ab_strength_triangle _ _ _ ab_str v).
cbn in Hyp. fold timesV in Hyp.
etrans.
2: exact Hyp.
clear Hyp.
rewrite <- assoc.
apply maponpaths.
apply pathsinv0.
apply functor_comp.
- red. cbn. intros w w' v.
assert (Hyp := actionbased_strength_pentagon_eq_variant1variant2 _ _ _ _ ab_str
(actionbased_strength_pentagon_eq_tovariant1 _ _ _ _ ab_str
(ab_strength_pentagon _ _ _ ab_str)) v w' w).
cbn in Hyp.
unfold is_z_isomorphism_mor, pre_whisker_on_nat_z_iso in Hyp.
cbn in Hyp.
unfold is_z_isomorphism_mor.
rewrite functor_id in Hyp.
rewrite functor_comp in Hyp.
rewrite assoc in Hyp.
exact Hyp.
Definition relative_strength_from_actionbased_strength: rel_strength F.
Show proof.
End ActionBasedStrength_Instantiates_To_RelativeStrength.
End B.
Arguments ab_strength_triangle {_ _ _ _ _} _.
Arguments ab_strength_pentagon {_ _ _ _ _} _.
Arguments ab_strong_functor_strength {_ _ _ _} _.