Products of finite sequences of elements in semigroups
Content created by Louis Wasserman.
Created on 2026-04-29.
Last modified on 2026-04-29.
module group-theory.products-of-finite-sequences-of-elements-semigroups where
Imports
open import elementary-number-theory.addition-natural-numbers open import elementary-number-theory.natural-numbers open import foundation.action-on-identifications-functions open import foundation.coproduct-types open import foundation.function-extensionality open import foundation.function-types open import foundation.homotopies open import foundation.identity-types open import foundation.unit-type open import foundation.universe-levels open import foundation.whiskering-homotopies-composition open import group-theory.semigroups open import linear-algebra.finite-sequences-in-semigroups open import univalent-combinatorics.coproduct-types open import univalent-combinatorics.standard-finite-types
Idea
The
product operation¶
extends the binary operation on a semigroup G to
any nonempty finite sequence of elements of G.
Definition
product-fin-sequence-type-Semigroup : {l : Level} (G : Semigroup l) (n : ℕ) → fin-sequence-type-Semigroup G (succ-ℕ n) → type-Semigroup G product-fin-sequence-type-Semigroup G zero-ℕ f = f (inr star) product-fin-sequence-type-Semigroup G (succ-ℕ n) f = mul-Semigroup G ( product-fin-sequence-type-Semigroup G n (f ∘ inl-Fin (succ-ℕ n))) ( f (inr star))
Properties
Products are homotopy invariant
module _ {l : Level} (G : Semigroup l) where abstract htpy-product-fin-sequence-type-Semigroup : (n : ℕ) → {f g : fin-sequence-type-Semigroup G (succ-ℕ n)} → f ~ g → product-fin-sequence-type-Semigroup G n f = product-fin-sequence-type-Semigroup G n g htpy-product-fin-sequence-type-Semigroup n f~g = ap (product-fin-sequence-type-Semigroup G n) (eq-htpy f~g)
Splitting products of succ-ℕ n + succ-ℕ m elements into a product of succ-ℕ n elements and a product of succ-ℕ m elements
abstract split-product-fin-sequence-type-Semigroup : {l : Level} (G : Semigroup l) (n m : ℕ) (f : fin-sequence-type-Semigroup G (succ-ℕ n +ℕ succ-ℕ m)) → product-fin-sequence-type-Semigroup G (succ-ℕ n +ℕ m) f = mul-Semigroup G ( product-fin-sequence-type-Semigroup G n ( f ∘ inl-coproduct-Fin (succ-ℕ n) (succ-ℕ m))) ( product-fin-sequence-type-Semigroup G m ( f ∘ inr-coproduct-Fin (succ-ℕ n) (succ-ℕ m))) split-product-fin-sequence-type-Semigroup G n zero-ℕ f = refl split-product-fin-sequence-type-Semigroup G n (succ-ℕ m) f = ap-mul-Semigroup G ( split-product-fin-sequence-type-Semigroup G n m (f ∘ inl)) ( refl) ∙ associative-mul-Semigroup G _ _ _
Recent changes
- 2026-04-29. Louis Wasserman. Use multiplicative over additive terminology for products in semigroups, monoids, groups (#1945).