A Lean Companion to Conceptual Mathematics

Session 15: Objectification of properties in dynamical systems🔗

1. Structure-preserving maps from a cycle to another endomap🔗

Excerpt (p. 176)

We say that an element y in Y^{↻\beta} has period four if {\beta^4(y) = y}. All elements that have period one or two are included in this, because if {\beta(y) = y} or {\beta^2(y) = y}, then also {\beta^4(y) = y}.

theorem period_four_of_period_one {Y : Type} (β : End Y) (y : Y) : β y = y → (β ^ 4) y = y := Y:Typeβ:End Yy:Y⊢ (ConcreteCategory.hom β) y = y → (ConcreteCategory.hom (β ^ 4)) y = y Y:Typeβ:End Yy:Yhβ:(ConcreteCategory.hom β) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = y nth_rw 2 [Y:Typeβ:End Yy:Yhβ:(ConcreteCategory.hom β) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom β) y Y:Typeβ:End Yy:Yhβ:(ConcreteCategory.hom β) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom β) ((ConcreteCategory.hom β) y) Y:Typeβ:End Yy:Yhβ:(ConcreteCategory.hom β) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom β) ((ConcreteCategory.hom β) ((ConcreteCategory.hom β) y)) Y:Typeβ:End Yy:Yhβ:(ConcreteCategory.hom β) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom β) ((ConcreteCategory.hom β) ((ConcreteCategory.hom β) ((ConcreteCategory.hom β) y)))Y:Typeβ:End Yy:Yhβ:(ConcreteCategory.hom β) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom β) ((ConcreteCategory.hom β) ((ConcreteCategory.hom β) ((ConcreteCategory.hom β) y))) All goals completed! 🐙 theorem period_four_of_period_two {Y : Type} (β : End Y) (y : Y) : (β ^ 2) y = y → (β ^ 4) y = y := Y:Typeβ:End Yy:Y⊢ (ConcreteCategory.hom (β ^ 2)) y = y → (ConcreteCategory.hom (β ^ 4)) y = y Y:Typeβ:End Yy:Yhβ2:(ConcreteCategory.hom (β ^ 2)) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = y nth_rw 2 [Y:Typeβ:End Yy:Yhβ2:(ConcreteCategory.hom (β ^ 2)) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom (β ^ 2)) y Y:Typeβ:End Yy:Yhβ2:(ConcreteCategory.hom (β ^ 2)) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom (β ^ 2)) ((ConcreteCategory.hom (β ^ 2)) y)Y:Typeβ:End Yy:Yhβ2:(ConcreteCategory.hom (β ^ 2)) y = y⊢ (ConcreteCategory.hom (β ^ 4)) y = (ConcreteCategory.hom (β ^ 2)) ((ConcreteCategory.hom (β ^ 2)) y) All goals completed! 🐙

2. Naming the elements that have a given period by maps🔗

Exercise 1 (p. 177)

Show that an element which has both period 5 and period 7 must be a fixed point.

Solution: Exercise 1

"If an element has any positive period, it must have a smallest period. In fact, all its periods are multiples of this smallest one" (p. 177). Since 5 and 7 are coprime, their only positive common divisor is 1, and so the only element having both period 5 and period 7 is an element having period 1—that is, a fixed point. We proceed via Bézout's identity, {7 \times 3 − 5 \times 4 = 1}.

open Function example {X : Type} (α : End X) (x : X) : (α ^ 5) x = x ∧ (α ^ 7) x = x → α x = x := X:Typeα:End Xx:X⊢ (ConcreteCategory.hom (α ^ 5)) x = x ∧ (ConcreteCategory.hom (α ^ 7)) x = x → (ConcreteCategory.hom α) x = x X:Typeα:End Xx:Xh5:(ConcreteCategory.hom (α ^ 5)) x = xh7:(ConcreteCategory.hom (α ^ 7)) x = x⊢ (ConcreteCategory.hom α) x = x X:Typeα:End Xx:Xh7:(ConcreteCategory.hom (α ^ 7)) x = xh5:(⇑(ConcreteCategory.hom α))^[5] x = x⊢ (ConcreteCategory.hom α) x = x X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (ConcreteCategory.hom α) x = x nth_rw 1 [X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (ConcreteCategory.hom α) ((⇑(ConcreteCategory.hom α))^[5] x) = x X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (ConcreteCategory.hom α) ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)) = x X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (ConcreteCategory.hom α) ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x))) = x X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (ConcreteCategory.hom α) ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = x X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = xX:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = x nth_rw 2 [X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = (⇑(ConcreteCategory.hom α))^[7] x X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = (⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] x) X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = (⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] x))X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] ((⇑(ConcreteCategory.hom α))^[5] x)))) = (⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] x)) repeat X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1] ((⇑(ConcreteCategory.hom α))^[5 + (5 + (5 + 5))] x) = (⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] x)) X:Typeα:End Xx:Xh5:(⇑(ConcreteCategory.hom α))^[5] x = xh7:(⇑(ConcreteCategory.hom α))^[7] x = x⊢ (⇑(ConcreteCategory.hom α))^[1 + 20] x = (⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] ((⇑(ConcreteCategory.hom α))^[7] x)) repeat All goals completed! 🐙

3. Naming arbitrary elements🔗

We implement the 'successor map' \sigma : \mathbb{N} \rightarrow \mathbb{N} defined by \sigma(n) = n+1 (p. 178) as follows:

def σ : ℕ ⟶ ℕ := ↾(· + 1) def ℕσ : SetWithEndomap := { carrier := ℕ toEnd := σ }
Exercise 2 (p. 178)

Find all the maps from \mathbb{N}^{↻\sigma} to C_4, the cycle of length 4.

Solution: Exercise 2

We define C_4 as follows:

def ς : Fin 4 ⟶ Fin 4 := ↾(· + 1) def C₄ : SetWithEndomap := { carrier := Fin 4 toEnd := ς }

Then there are four distinct maps from \mathbb{N}^{↻\sigma} to C_4. We give these maps below, in each case showing that we can form a valid morphism in the category 𝑺↻.

def f₀_fun : ℕ → Fin 4 | Nat.zero => (0 : Fin 4) -- f(0) = 0 | n + 1 => ς (f₀_fun n) def f₀ : ℕσ.carrier ⟶ C₄.carrier := ↾f₀_fun def f₀' : ℕσ ⟶ C₄ := ⟨ f₀, ⊢ f₀ ⊚ ℕσ.toEnd = C₄.toEnd ⊚ f₀ x:ℕσ.carrier⊢ (ConcreteCategory.hom (f₀ ⊚ ℕσ.toEnd)).toFun x = (ConcreteCategory.hom (C₄.toEnd ⊚ f₀)).toFun x All goals completed! 🐙 ⟩ def f₁_fun : ℕ → Fin 4 | Nat.zero => (1 : Fin 4) -- f(0) = 1 | n + 1 => ς (f₁_fun n) def f₁ : ℕσ.carrier ⟶ C₄.carrier := ↾f₁_fun def f₁' : ℕσ ⟶ C₄ := ⟨ f₁, ⊢ f₁ ⊚ ℕσ.toEnd = C₄.toEnd ⊚ f₁ x:ℕσ.carrier⊢ (ConcreteCategory.hom (f₁ ⊚ ℕσ.toEnd)).toFun x = (ConcreteCategory.hom (C₄.toEnd ⊚ f₁)).toFun x All goals completed! 🐙 ⟩ def f₂_fun : ℕ → Fin 4 | Nat.zero => (2 : Fin 4) -- f(0) = 2 | n + 1 => ς (f₂_fun n) def f₂ : ℕσ.carrier ⟶ C₄.carrier := ↾f₂_fun def f₂' : ℕσ ⟶ C₄ := ⟨ f₂, ⊢ f₂ ⊚ ℕσ.toEnd = C₄.toEnd ⊚ f₂ x:ℕσ.carrier⊢ (ConcreteCategory.hom (f₂ ⊚ ℕσ.toEnd)).toFun x = (ConcreteCategory.hom (C₄.toEnd ⊚ f₂)).toFun x All goals completed! 🐙 ⟩ def f₃_fun : ℕ → Fin 4 | Nat.zero => (3 : Fin 4) -- f(0) = 3 | n + 1 => ς (f₃_fun n) def f₃ : ℕσ.carrier ⟶ C₄.carrier := ↾f₃_fun def f₃' : ℕσ ⟶ C₄ := ⟨ f₃, ⊢ f₃ ⊚ ℕσ.toEnd = C₄.toEnd ⊚ f₃ x:ℕσ.carrier⊢ (ConcreteCategory.hom (f₃ ⊚ ℕσ.toEnd)).toFun x = (ConcreteCategory.hom (C₄.toEnd ⊚ f₃)).toFun x All goals completed! 🐙 ⟩
Exercise 3 (p. 179)

Show that evaluation at 0 and iteration are inverse (to each other).

Solution: Exercise 3

TODO Exercise 15.3

Exercise 4 (p. 179)

For any dynamical system X^{↻\alpha}, show that \alpha is itself a map of dynamical systems {X^{↻\alpha} \xrightarrow{\alpha} X^{↻\alpha}}.

Solution: Exercise 4

Essentially, the exercise is asking for a proof that α ⊚ α = α ⊚ α, which is trivially true.

variable (X : Type) (α : X ⟶ X) def Xα : SetWithEndomap := { carrier := X toEnd := α } example : α ⊚ (Xα X α).toEnd = (Xα X α).toEnd ⊚ α := rfl
Exercise 5 (p. 179)

Show that if {\mathbb{N}^{↻\sigma} \xrightarrow{f} Y^{↻\beta}} corresponds to y, then {\mathbb{N}^{↻\sigma} \xrightarrow{f \circ \sigma} Y^{↻\beta}} corresponds to \beta(y).

Solution: Exercise 5example (Yβ : SetWithEndomap) (f : ℕσ ⟶ Yβ) (y : Yβ.carrier) (hy : f.val (0 : ℕ) = y) : (f.val ⊚ σ) (0 : ℕ) = Yβ.toEnd y := Yβ:SetWithEndomapf:ℕσ ⟶ Yβy:Yβ.carrierhy:(ConcreteCategory.hom ↑f) 0 = y⊢ (ConcreteCategory.hom (↑f ⊚ σ)) 0 = (ConcreteCategory.hom Yβ.toEnd) y Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = y⊢ (ConcreteCategory.hom (↑⟨f, hf_comm⟩ ⊚ σ)) 0 = (ConcreteCategory.hom Yβ.toEnd) y Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom (↑⟨f, hf_comm⟩ ⊚ σ)) 0 = (ConcreteCategory.hom Yβ.toEnd) y Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom (↑⟨f, hf_comm⟩ ⊚ σ)) 0 = (ConcreteCategory.hom Yβ.toEnd) ((ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0) Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom (f ⊚ ↾fun x ↦ x + 1)) 0 = (ConcreteCategory.hom Yβ.toEnd) ((ConcreteCategory.hom f) 0) erw [Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom (f ⊚ ↾fun x ↦ x + 1)) 0 = (ConcreteCategory.hom (Yβ.toEnd ⊚ f)) 0 Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom (f ⊚ ↾fun x ↦ x + 1)) 0 = (ConcreteCategory.hom (f ⊚ ℕσ.toEnd)) 0 Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom f) ((ConcreteCategory.hom (↾fun x ↦ x + 1)) 0) = (ConcreteCategory.hom f) ((ConcreteCategory.hom (↾fun x ↦ x + 1)) 0) Yβ:SetWithEndomapy:Yβ.carrierf:ℕσ.carrier ⟶ Yβ.carrierhf_comm:f ⊚ ℕσ.toEnd = Yβ.toEnd ⊚ fhy:(ConcreteCategory.hom ↑⟨f, hf_comm⟩) 0 = yh0:(ConcreteCategory.hom ℕσ.toEnd) 0 = 1⊢ (ConcreteCategory.hom f) 1 = (ConcreteCategory.hom f) 1All goals completed! 🐙

4. The philosophical role of N🔗

Exercise 6 (p. 181)

Show that the gender map {X^{↻m} \xrightarrow{g} B} is a map in the category 𝑺↻.

Solution: Exercise 6

cf. Session 12, Exercise 3.

inductive B | female | male def β : B ⟶ B := ↾fun | B.female => B.female | B.male => B.female inductive ParentType | isMother structure Person where parentType : ParentType def m : Person ⟶ Person := ↾fun _ ↦ ⟨ParentType.isMother⟩ def Xm : SetWithEndomap := { carrier := Person toEnd := m }

We define the gender map g and show that it commutes (i.e., is a map in the category 𝑺↻).

def g : Xm.carrier ⟶ B := ↾fun | ⟨ParentType.isMother⟩ => B.female example : g ⊚ Xm.toEnd = β ⊚ g := rfl

Equivalently, taking B as an object in the category 𝑺↻, we can show that g forms a valid morphism.

def Bβ : SetWithEndomap := { carrier := B toEnd := β } def g' : Xm ⟶ Bβ := ⟨g, rfl⟩

5. Presentations of dynamical systems🔗

Exercise 7 (p. 185)

Find all the maps from the X^{↻\alpha} [below] to the Y^{↻\beta} [below]. (Unless I made a mistake, there are 14 of them.)

inductive X | a | a₁ | a₂ | a₃ | a₄ | b | c | d | d₁ -- Subscripts correspond to powers of α -- (i.e., the number of applications of α to the element) def α : X ⟶ X := ↾fun | X.a => X.a₁ | X.a₁ => X.a₂ | X.a₂ => X.a₃ | X.a₃ => X.a₄ | X.a₄ => X.a₂ | X.b => X.a₂ | X.c => X.a₃ | X.d => X.d₁ | X.d₁ => X.d inductive Y | l | m | p | q | r | s | t | u | v | w | x | y | z def β : Y ⟶ Y := ↾fun | Y.l => Y.m | Y.m => Y.l | Y.p => Y.r | Y.q => Y.r | Y.r => Y.t | Y.s => Y.t | Y.t => Y.v | Y.u => Y.s | Y.v => Y.u | Y.w => Y.x | Y.x => Y.y | Y.y => Y.w | Y.z => Y.y def Xα : SetWithEndomap := { carrier := X toEnd := α } def Yβ : SetWithEndomap := { carrier := Y toEnd := β }
Solution: Exercise 7

The authors' tongue-in-cheek comment alerts us to the likelihood that there are not, in fact, 14 maps. Following the algorithm given on pp. 182–185, we find only 12 distinct maps. The 12 maps are given below, in each case with a proof that the map forms a valid morphism {X^{↻\alpha} \rightarrow Y^{↻\beta}}.

Map 1:

(i) \bar{a} = w satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = x satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = y satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = l satisfies \beta^2\bar{d} = \bar{d}

def f₁ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.w | X.a₁ => Y.x | X.a₂ => Y.y | X.a₃ => Y.w | X.a₄ => Y.x | X.b => Y.x | X.c => Y.y | X.d => Y.l | X.d₁ => Y.m def f₁' : Xα ⟶ Yβ := ⟨ f₁, ⊢ f₁ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₁ x:Xα.carrier⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun x ⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.b⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.c⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.d⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.b⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.c⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.d⊢ (ConcreteCategory.hom (f₁ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 2:

(i) \bar{a} = w satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = x satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = y satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = m satisfies \beta^2\bar{d} = \bar{d}

def f₂ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.w | X.a₁ => Y.x | X.a₂ => Y.y | X.a₃ => Y.w | X.a₄ => Y.x | X.b => Y.x | X.c => Y.y | X.d => Y.m | X.d₁ => Y.l def f₂' : Xα ⟶ Yβ := ⟨ f₂, ⊢ f₂ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₂ x:Xα.carrier⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun x ⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₁⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₂⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₃⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₄⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.b⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.c⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.d⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₁⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₂⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₃⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.a₄⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.b⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.c⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.d⊢ (ConcreteCategory.hom (f₂ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₂)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 3:

(i) \bar{a} = w satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = z satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = y satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = l satisfies \beta^2\bar{d} = \bar{d}

def f₃ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.w | X.a₁ => Y.x | X.a₂ => Y.y | X.a₃ => Y.w | X.a₄ => Y.x | X.b => Y.z | X.c => Y.y | X.d => Y.l | X.d₁ => Y.m def f₃' : Xα ⟶ Yβ := ⟨ f₃, ⊢ f₃ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₃ x:Xα.carrier⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun x ⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₁⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₂⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₃⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₄⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.b⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.c⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.d⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₁⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₂⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₃⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.a₄⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.b⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.c⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.d⊢ (ConcreteCategory.hom (f₃ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₃)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 4:

(i) \bar{a} = w satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = z satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = y satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = m satisfies \beta^2\bar{d} = \bar{d}

def f₄ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.w | X.a₁ => Y.x | X.a₂ => Y.y | X.a₃ => Y.w | X.a₄ => Y.x | X.b => Y.z | X.c => Y.y | X.d => Y.m | X.d₁ => Y.l def f₄' : Xα ⟶ Yβ := ⟨ f₄, ⊢ f₄ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₄ x:Xα.carrier⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun x ⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₁⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₂⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₃⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₄⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.b⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.c⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.d⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₁⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₂⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₃⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.a₄⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.b⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.c⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.d⊢ (ConcreteCategory.hom (f₄ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₄)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 5:

(i) \bar{a} = x satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = y satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = w satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = l satisfies \beta^2\bar{d} = \bar{d}

def f₅ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.x | X.a₁ => Y.y | X.a₂ => Y.w | X.a₃ => Y.x | X.a₄ => Y.y | X.b => Y.y | X.c => Y.w | X.d => Y.l | X.d₁ => Y.m def f₅' : Xα ⟶ Yβ := ⟨ f₅, ⊢ f₅ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₅ x:Xα.carrier⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun x ⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₁⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₂⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₃⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₄⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.b⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.c⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.d⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₁⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₂⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₃⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.a₄⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.b⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.c⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.d⊢ (ConcreteCategory.hom (f₅ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₅)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 6:

(i) \bar{a} = x satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = y satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = w satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = m satisfies \beta^2\bar{d} = \bar{d}

def f₆ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.x | X.a₁ => Y.y | X.a₂ => Y.w | X.a₃ => Y.x | X.a₄ => Y.y | X.b => Y.y | X.c => Y.w | X.d => Y.m | X.d₁ => Y.l def f₆' : Xα ⟶ Yβ := ⟨ f₆, ⊢ f₆ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₆ x:Xα.carrier⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun x ⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₁⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₂⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₃⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₄⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.b⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.c⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.d⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₁⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₂⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₃⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.a₄⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.b⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.c⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.d⊢ (ConcreteCategory.hom (f₆ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₆)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 7:

(i) \bar{a} = y satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = w satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = x satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = l satisfies \beta^2\bar{d} = \bar{d}

def f₇ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.y | X.a₁ => Y.w | X.a₂ => Y.x | X.a₃ => Y.y | X.a₄ => Y.w | X.b => Y.w | X.c => Y.x | X.d => Y.l | X.d₁ => Y.m def f₇' : Xα ⟶ Yβ := ⟨ f₇, ⊢ f₇ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₇ x:Xα.carrier⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun x ⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₁⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₂⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₃⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₄⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.b⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.c⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.d⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₁⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₂⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₃⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.a₄⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.b⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.c⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.d⊢ (ConcreteCategory.hom (f₇ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₇)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 8:

(i) \bar{a} = y satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = w satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = x satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = m satisfies \beta^2\bar{d} = \bar{d}

def f₈ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.y | X.a₁ => Y.w | X.a₂ => Y.x | X.a₃ => Y.y | X.a₄ => Y.w | X.b => Y.w | X.c => Y.x | X.d => Y.m | X.d₁ => Y.l def f₈' : Xα ⟶ Yβ := ⟨ f₈, ⊢ f₈ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₈ x:Xα.carrier⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun x ⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₁⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₂⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₃⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₄⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.b⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.c⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.d⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₁⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₂⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₃⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.a₄⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.b⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.c⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.d⊢ (ConcreteCategory.hom (f₈ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₈)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 9:

(i) \bar{a} = y satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = w satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = z satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = l satisfies \beta^2\bar{d} = \bar{d}

def f₉ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.y | X.a₁ => Y.w | X.a₂ => Y.x | X.a₃ => Y.y | X.a₄ => Y.w | X.b => Y.w | X.c => Y.z | X.d => Y.l | X.d₁ => Y.m def f₉' : Xα ⟶ Yβ := ⟨ f₉, ⊢ f₉ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₉ x:Xα.carrier⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun x ⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₁⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₂⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₃⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₄⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.b⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.c⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.d⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₁⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₂⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₃⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.a₄⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.b⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.c⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.d⊢ (ConcreteCategory.hom (f₉ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₉)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 10:

(i) \bar{a} = y satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = w satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = z satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = m satisfies \beta^2\bar{d} = \bar{d}

def f₁₀ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.y | X.a₁ => Y.w | X.a₂ => Y.x | X.a₃ => Y.y | X.a₄ => Y.w | X.b => Y.w | X.c => Y.z | X.d => Y.m | X.d₁ => Y.l def f₁₀' : Xα ⟶ Yβ := ⟨ f₁₀, ⊢ f₁₀ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₁₀ x:Xα.carrier⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun x ⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.b⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.c⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.d⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.b⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.c⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.d⊢ (ConcreteCategory.hom (f₁₀ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₀)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 11:

(i) \bar{a} = z satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = y satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = w satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = l satisfies \beta^2\bar{d} = \bar{d}

def f₁₁ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.z | X.a₁ => Y.y | X.a₂ => Y.w | X.a₃ => Y.x | X.a₄ => Y.y | X.b => Y.y | X.c => Y.w | X.d => Y.l | X.d₁ => Y.m def f₁₁' : Xα ⟶ Yβ := ⟨ f₁₁, ⊢ f₁₁ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₁₁ x:Xα.carrier⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun x ⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.b⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.c⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.d⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.b⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.c⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.d⊢ (ConcreteCategory.hom (f₁₁ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₁)).toFun X.d₁ All goals completed! 🐙 ⟩

Map 12:

(i) \bar{a} = z satisfies \beta^5\bar{a} = \beta^2\bar{a}

(ii) \bar{b} = y satisfies \beta\bar{b} = \beta^2\bar{a}

(iii) \bar{c} = w satisfies \beta\bar{c} = \beta^3\bar{a}

(iv) \bar{d} = m satisfies \beta^2\bar{d} = \bar{d}

def f₁₂ : Xα.carrier ⟶ Yβ.carrier := ↾fun | X.a => Y.z | X.a₁ => Y.y | X.a₂ => Y.w | X.a₃ => Y.x | X.a₄ => Y.y | X.b => Y.y | X.c => Y.w | X.d => Y.m | X.d₁ => Y.l def f₁₂' : Xα ⟶ Yβ := ⟨ f₁₂, ⊢ f₁₂ ⊚ Xα.toEnd = Yβ.toEnd ⊚ f₁₂ x:Xα.carrier⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun x = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun x ⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.b⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.c⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.d⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.d₁ ⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₁⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₂ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₂⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₃ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₃⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.a₄ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.a₄⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.b = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.b⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.c = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.c⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.d = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.d⊢ (ConcreteCategory.hom (f₁₂ ⊚ Xα.toEnd)).toFun X.d₁ = (ConcreteCategory.hom (Yβ.toEnd ⊚ f₁₂)).toFun X.d₁ All goals completed! 🐙 ⟩
Exercise 9 (p. 185)

Our procedure treated X^{↻\alpha} and Y^{↻\beta} very differently. Suppose that in addition to a presentation of X^{↻\alpha} you had a presentation of Y^{↻\beta}. Try to find a method to calculate the solutions of the equations (\bar{\mathbf{R}}) without having to draw the picture of Y^{↻\beta}, but just working with a presentation. One can even program a computer to find all the maps f, starting from presentations of X^{↻\alpha} and Y^{↻\beta}.

Solution: Exercise 9

A presentation of Y^{↻\beta} is given below.

(\mathbf{L})

l, \beta l, p, \beta p, \beta^2 p, \beta^3 p, \beta^4 p, \beta^5 p, q, z, \beta z, \beta^2 z, \beta^3 z

(\mathbf{R})

(i) \beta^2 l = l

(ii) \beta^6 p = \beta^2 p

(iii) \beta q = \beta p

(iv) \beta^4 z = \beta z

Exercise 10 (p. 186)

Find a presentation for this system, which continues to the right forever.

Solution: Exercise 10

Let \alpha be the endomap, and label the generators from top to bottom as a, b, and c. Then a presentation is given below.

(\mathbf{L})

a, \alpha a, \alpha^2 a, \ldots, b, c, \alpha c

(\mathbf{R})

(i) \alpha b = \alpha a

(ii) \alpha^2 c = \alpha^2 a

Exercise 12 (p. 186)

A non-autonomous dynamical system S is one in which the 'rule of evolution' {\mathbb{N} \times S \xrightarrow{r} S} itself depends on time. These can be studied by reducing to the ordinary, or autonomous, system on the state space {X = \mathbb{N} \times S} with dynamics given by {\rho(n, s) = \langle n+1, r(n, s) \rangle}. Show that for any r there is exactly one sequence u in S for which {u(n+1) = r(n, u(n))} and for which {u(0) = s_0} is a given starting point. (Hint: Reduce this to the universal property of {\mathbb{N} = (\mathbb{N}, \sigma)} in 𝑺↻.)

Solution: Exercise 12

TODO Exercise 15.12