Classical.Bundles.Monoid

Bundle bridge for monoids

This is the Classical.Bundles.Monoid module of the Agda Universal Algebra Library.

Here we encode the bidirectional bridge between the Σ-typed core of Classical.Structures.Monoid and the record-typed Algebra.Bundles.Monoid in the standard library.

As with the Semigroup bridge, the round-trip is stated pointwise;¹ the curried laws assoc-law, idˡ-law, idʳ-law arrive ready-made from Monoid-Op, so each direction is a thin record-shuffle. The only addition over the Semigroup bridge is the nullary ε field and the ε-Op clause of the reverse interpretation.

{-# OPTIONS --without-K --exact-split --safe #-}

module Classical.Bundles.Monoid where

-- Imports from the Agda Standard Library -----------------------------------------
open import Algebra.Bundles     using () renaming ( Monoid to stdlib-Monoid )
open import Data.Fin.Patterns   using ( 0F ; 1F ; 2F )
open import Data.Product        using ( _,_ )
open import Function            using ( Func )
open import Level               using ( Level )
open import Relation.Binary     using ( Setoid )
import Relation.Binary.PropositionalEquality as ≡
open Func renaming ( to to _⟨$⟩_ )

-- Imports from the Agda Universal Algebra Library --------------------------------
open import Classical.Signatures.Monoid  using ( Sig-Monoid ; ∙-Op ; ε-Op )
open import Classical.Structures.Monoid  using ( Monoid ; module Monoid-Op )
open import Classical.Theories.Monoid    using ( assoc ; idˡ ; idʳ )
open import Setoid.Algebras.Basic        using ( Algebra ; 𝕌[_] ; 𝔻[_] )
open import Setoid.Signatures            using ( ⟨_⟩ )

private variable α ρ : Level

Core to stdlib bundle

⟨_⟩ᵐᵒ : Monoid α ρ → stdlib-Monoid α ρ
⟨ 𝑴 , eqns ⟩ᵐᵒ = record
  { Carrier  = 𝕌[ 𝑴 ]
  ; _≈_      = _≈_
  ; _∙_      = _∙_
  ; ε        = ε
  ; isMonoid = record
      { isSemigroup = record
          { isMagma = record { isEquivalence = isEquivalence ; ∙-cong = ∙-cong }
          ; assoc   = assoc-law
          }
      ; identity = idˡ-law , idʳ-law
      }
  }
  where
  open Monoid-Op (𝑴 , eqns)
  open Setoid 𝔻[ 𝑴 ]

Stdlib bundle to core

The reverse direction reassembles the bundle's carrier setoid, _∙_, and ε into a Sig-Monoid-algebra and pairs it with a proof of Th-Monoid, each equation extracted from the corresponding record field (assoc, identityˡ, identityʳ) applied to the variables the environment supplies. The interpretation has one clause per operation symbol, and congruence likewise; the nullary ε-Op case is the setoid's reflexivity.

⟪_⟫ᵐᵒ : stdlib-Monoid α ρ → Monoid α ρ
⟪ M ⟫ᵐᵒ = 𝑨 , λ  { assoc ρ → M-assoc (ρ 0F) (ρ 1F) (ρ 2F)
                 ; idˡ   ρ → M-idˡ   (ρ 0F)
                 ; idʳ   ρ → M-idʳ   (ρ 0F) }
  where
  open stdlib-Monoid M using ( setoid ; ∙-cong ) renaming  ( _∙_       to _·_
                                                           ; ε         to e
                                                           ; assoc     to M-assoc
                                                           ; identityˡ to M-idˡ
                                                           ; identityʳ to M-idʳ )

  𝑨 : Algebra {𝑆 = Sig-Monoid} _ _
  𝑨 = record { Domain = setoid ; Interp = interp }
    where
    interp : Func (⟨ Sig-Monoid ⟩ setoid) setoid
    interp ⟨$⟩ (∙-Op , args)                            = args 0F · args 1F
    interp ⟨$⟩ (ε-Op , _)                               = e
    cong interp {∙-Op , _} {.∙-Op , _} (≡.refl , args≈) = ∙-cong (args≈ 0F) (args≈ 1F)
    cong interp {ε-Op , _} {.ε-Op , _} (≡.refl , _)     = Setoid.refl setoid

Pointwise round-trip

Both round-trips are definitional, stated pointwise per operation; the names read core-bundle-core and bundle-core-bundle.

Going core to bundle and back, roundtrip-cbc-∙-mn and roundtrip-cbc-ε-mn say the reassembled _∙_ and ε agree with the originals, and ≈refl discharges both because each side reduces to the same value.

Going bundle to core and back, roundtrip-bcb-∙-mn and roundtrip-bcb-ε-mn state the same agreement on the bundle's own equivalence, discharged by its refl.

module _ {(𝑴 , eqns) : Monoid α ρ} where
  open Monoid-Op (𝑴 , eqns)
  open Setoid 𝔻[ 𝑴 ] using (_≈_) renaming (refl to ≈refl)
  open Monoid-Op ⟪ ⟨ 𝑴 , eqns ⟩ᵐᵒ ⟫ᵐᵒ renaming ( _∙_ to _∙'_ ; ε to ε' )

  roundtrip-cbc-∙-mn : (a b : 𝕌[ 𝑴 ]) → a ∙' b ≈ a ∙ b
  roundtrip-cbc-∙-mn a b = ≈refl

  roundtrip-cbc-ε-mn : ε' ≈ ε
  roundtrip-cbc-ε-mn = ≈refl

module _ {M : stdlib-Monoid α ρ} where
  open stdlib-Monoid M using ( _≈_ ; _∙_ ; ε ; refl ) renaming ( Carrier to A )
  open stdlib-Monoid ⟨ ⟪ M ⟫ᵐᵒ ⟩ᵐᵒ using () renaming ( _∙_ to _∙'_ ; ε to ε' )

  roundtrip-bcb-∙-mn : (a b : A) → a ∙ b ≈ a ∙' b
  roundtrip-bcb-∙-mn a b = refl

  roundtrip-bcb-ε-mn : ε ≈ ε'
  roundtrip-bcb-ε-mn = refl

---

---

1. per ADR-002 v2 §6. ↩