Skip to content

chore: Fix stuff from #578 #579

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ncfavier merged 2 commits into from
Jan 3, 2026
Merged

chore: Fix stuff from #578 #579

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3391718
fixup: Fix some stuff from #578
jajaperson Jan 3, 2026
a5fb338
fixup: Typo
jajaperson Jan 3, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/1Lab/Path.lagda.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -681,7 +681,7 @@ all functions: if we have $f : A \to B$, and $x = y : A$, then also
$f(x) = f(y)$. In our homotopical setting, we must generalise this to
talking about *paths* $p : x \is y$, and we must also name the resulting
$f(x) \is f(y)$. In cubical type theory, our homotopical intuition for
paths provides the both the interpretation *and* implementation of this
paths provides both the interpretation *and* implementation of this
principle: it is the *composition* of a path $p : x \is y$ with a
*continuous* function $f : A \to B$.

Expand Down
10 changes: 5 additions & 5 deletions src/Cat/Functor/Bifunctor/Duality.lagda.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ open import Cat.Prelude

```agda
module Cat.Functor.Bifunctor.Duality
{o₁ h₁ o₂ h₂ o₃ h₃}
{o₁ h₁ o₂ h₂ o₃ h₃ : _}
{C : Precategory o₁ h₁}
{D : Precategory o₂ h₂}
{E : Precategory o₃ h₃}
Expand All @@ -31,11 +31,11 @@ private
# Duality {defines="opposite-bifunctor"}

When considering the `opposite functor`{.Agda ident="Functor.op"} of a bifunctor,
$\cC \times \cD \to \cE$ we would prefer to get a bifunctor
$\cC \times \cD \to \cE$ we would prefer to get a bifunctor
$\cC\op \times \cD\op \to \cE\op$ (see also [[opposite product category]]).

```agda
bop : Functor (C ^op ×ᶜ D ^op) (E ^op)
bop : Functor ((C ^op) ×ᶜ (D ^op)) (E ^op)
bop .Functor.F₀ = F.F₀
bop .Functor.F₁ = F.F₁
bop .Functor.F-id = F.F-id
Expand All @@ -45,9 +45,9 @@ bop .Functor.F-∘ (f , f') (g , g') = F.F-∘ (g , g') (f , f')
This is compatible with fixing objects in the following sense:

```agda
bop-Left : ∀ {d : D.Ob} → Functor.op (F.Left d) ≡ Left bop d
bop-Left : ∀ {d : D.Ob} → Functor.op (F.Left d) ≡ (Left bop) d
bop-Left = Functor-path (λ x → refl) (λ f → refl)

bop-Right : ∀ {c : C.Ob} → Functor.op (F.Right c) ≡ Right bop c
bop-Right : ∀ {c : C.Ob} → Functor.op (F.Right c) ≡ (Right bop) c
bop-Right = Functor-path (λ x → refl) (λ f → refl)
```
3 changes: 0 additions & 3 deletions src/Cat/Monoidal/Opposite.lagda.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -59,9 +59,6 @@ _^mop .unitor-r = to-natural-iso record where
natural x y f = Isoⁿ.from C.unitor-r .is-natural y x f

_^mop .associator = to-natural-iso record where
iso : (x y z : C.Ob) → (x C.⊗ y) C.⊗ z C.≅ x C.⊗ (y C.⊗ z)
iso x y z = (isoⁿ→iso C.associator) (x , y , z)

eta (x , y , z) = C.α← x y z
inv (x , y , z) = C.α→ x y z
eta∘inv (x , y , z) = C.invl C.α≅
Expand Down
Loading