A Lean Companion to Conceptual Mathematics

Session 5: Division of maps: Sections and retractions🔗

1. Determination problems🔗

Exercise 1 (p. 70)

(a) Show that if there is a map g for which {h = g \circ f}, then for any pair a_1, a_2 of points {\mathbf{1} \rightarrow A} of the domain A of f (and of h) we have: \text{if}\; fa_1 = fa_2 \;\text{then}\; ha_1 = ha_2. (So, if for some pair of points one has {f a_1 = f a_2} but {h a_1 \ne h a_2}, then h is not determined by f.)

(b) Does the converse hold? That is, if maps (of sets) f and h satisfy the conditions above ('for any pair ... then {h a_1 = h a_2}'), must there be a map {B \xrightarrow{g} C} with {h = g \circ f}?

Solution: Exercise 1

We use types instead of sets here, and we begin by showing that part (a) holds.

example {A B C : Type} {f : A ⟶ B} {h : A ⟶ C} (hg : ∃ g : B ⟶ C, h = g ⊚ f) : ∀ a₁ a₂ : Point A, f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂ := A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ Chg:∃ g, h = g ⊚ f⊢ ∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂ A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ Cg:B ⟶ Chg:h = g ⊚ f⊢ ∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂ A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ Cg:B ⟶ Chg:h = g ⊚ fa₁:Point Aa₂:Point Ahfa:f ⊚ a₁ = f ⊚ a₂⊢ h ⊚ a₁ = h ⊚ a₂ All goals completed! 🐙

For part (b), we first prove the converse in the case when f is surjective.

open ConcreteCategory in example {A B C : Type} {f : A ⟶ B} {h : A ⟶ C} (H : ∀ a₁ a₂ : Point A, f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂) (hfsurj : Function.Surjective f) : ∃ g : B ⟶ C, h = g ⊚ f := A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)⊢ ∃ g, h = g ⊚ f A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)⊢ ∃ g, h = g ⊚ f A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)⊢ h = g ⊚ f A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)α:A⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)α:Aa₁:Point A := ↾fun x ↦ α⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)α:Aa₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ Classical.choose ⋯⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)α:Aa₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ Classical.choose ⋯hfa:f ⊚ a₁ = f ⊚ a₂⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typef:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂hfsurj:Function.Surjective ⇑(hom f)g:B ⟶ C := ↾fun β ↦ (hom h) (Classical.choose ⋯)α:Aa₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ Classical.choose ⋯hfa:f ⊚ a₁ = f ⊚ a₂hha:h ⊚ a₁ = h ⊚ a₂⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α All goals completed! 🐙

Proof in the general case is slightly more complicated and is given below.

open Classical ConcreteCategory in example {A B C : Type} [Nonempty C] {f : A ⟶ B} {h : A ⟶ C} (H : ∀ a₁ a₂ : Point A, f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂) : ∃ g : B ⟶ C, h = g ⊚ f := A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂⊢ ∃ g, h = g ⊚ f -- β : B may or may not be in the image of f, -- so we need to handle both cases A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯⊢ ∃ g, h = g ⊚ f A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯⊢ h = g ⊚ f A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:A⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ α⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_exists⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_existshfa:f ⊚ a₁ = f ⊚ a₂⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_existshfa:f ⊚ a₁ = f ⊚ a₂hha:h ⊚ a₁ = h ⊚ a₂⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_existshfa:f ⊚ a₁ = f ⊚ a₂hha:h ⊚ a₁ = h ⊚ a₂h_eq_h_chosen:(hom h) α = (hom h) (choose β_in_image_exists)⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_existshfa:f ⊚ a₁ = f ⊚ a₂hha:h ⊚ a₁ = h ⊚ a₂h_eq_h_chosen:(hom h) α = (hom h) (choose β_in_image_exists)g_eq_h_chosen:(hom g) ((hom f) α) = (hom h) (choose β_in_image_exists)⊢ (hom h).toFun α = (hom (g ⊚ f)).toFun α A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_existshfa:f ⊚ a₁ = f ⊚ a₂hha:h ⊚ a₁ = h ⊚ a₂h_eq_h_chosen:(hom h) α = (hom h) (choose β_in_image_exists)g_eq_h_chosen:(hom g) ((hom f) α) = (hom h) (choose β_in_image_exists)⊢ (hom h) α = (hom g) ((hom f) α) A:TypeB:TypeC:Typeinst✝:Nonempty Cf:A ⟶ Bh:A ⟶ CH:∀ (a₁ a₂ : Point A), f ⊚ a₁ = f ⊚ a₂ → h ⊚ a₁ = h ⊚ a₂g:B ⟶ C := ↾fun β ↦ if β_in_image : ∃ α, (hom f) α = β then (hom h) (choose β_in_image) else choice ⋯α:Aβ_in_image_exists:∃ α', (hom f) α' = (hom f) α := ···a₁:Point A := ↾fun x ↦ αa₂:Point A := ↾fun x ↦ choose β_in_image_existshfa:f ⊚ a₁ = f ⊚ a₂hha:h ⊚ a₁ = h ⊚ a₂h_eq_h_chosen:(hom h) α = (hom h) (choose β_in_image_exists)g_eq_h_chosen:(hom g) ((hom f) α) = (hom h) (choose β_in_image_exists)⊢ (hom h) α = (hom h) (choose β_in_image_exists) All goals completed! 🐙

2. A special case: Constant maps🔗

Definition: Constant map (p. 71)

A map that can be factored through \mathbf{1} is called a constant map.

We implement IsConstantMap in Lean as follows:

def IsConstantMap {A C : Type} (h : A ⟶ C) := ∃ (f : A ⟶ One) (g : One ⟶ C), h = g ⊚ f

3. Choice problems🔗

Exercise 2 (p. 71)

(a) Show that if there is an f with {g \circ f = h}, then h and g satisfy: For any a in A there is at least one b in B for which {h(a) = g(b)}.

(b) Does the converse hold? That is, if h and g satisfy the condition above, must there be a map f with {h = g \circ f}?

Solution: Exercise 2

We show that part (a) holds.

example {A B C : Type} {g : B ⟶ C} {h : A ⟶ C} (hf : ∃ f : A ⟶ B, g ⊚ f = h) : ∀ a : A, ∃ b : B, h a = g b := A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Chf:∃ f, g ⊚ f = h⊢ ∀ (a : A), ∃ b, (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) b A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Chf:∃ f, g ⊚ f = ha:A⊢ ∃ b, (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) b A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Ca:Af:A ⟶ Bhf:g ⊚ f = h⊢ ∃ b, (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) b A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Ca:Af:A ⟶ Bhf:g ⊚ f = h⊢ (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) ((ConcreteCategory.hom f) a) A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Ca:Af:A ⟶ Bhf:g ⊚ f = h⊢ (ConcreteCategory.hom (g ⊚ f)) a = (ConcreteCategory.hom g) ((ConcreteCategory.hom f) a) All goals completed! 🐙

We show that the converse holds in part (b).

example {A B C : Type} {g : B ⟶ C} {h : A ⟶ C} (H : ∀ a : A, ∃ b : B, h a = g b) : ∃ f : A ⟶ B, g ⊚ f = h := A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ CH:∀ (a : A), ∃ b, (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) b⊢ ∃ f, g ⊚ f = h A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Cf_fun:A → Bh_spec:∀ (a : A), (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) (f_fun a)⊢ ∃ f, g ⊚ f = h A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Cf_fun:A → Bh_spec:∀ (a : A), (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) (f_fun a)⊢ g ⊚ ↾f_fun = h A:TypeB:TypeC:Typeg:B ⟶ Ch:A ⟶ Cf_fun:A → Bh_spec:∀ (a : A), (ConcreteCategory.hom h) a = (ConcreteCategory.hom g) (f_fun a)a:A⊢ (ConcreteCategory.hom (g ⊚ ↾f_fun)).toFun a = (ConcreteCategory.hom h).toFun a All goals completed! 🐙

4. Two special cases of division: Sections and retractions🔗

Definition: Section (p. 72)

{A \xrightarrow{f} B} is a section of {B \xrightarrow{g} A} if {g \circ f = 1_A}.

See the original presentation of this definition of section in Article II.

5. Stacking or sorting🔗

Exercise 3 (p. 75)

Draw the internal diagrams of all the sections of f.

Solution: Exercise 3

We label the elements in the first column of A as a_{11}, a_{12}, a_{13}, a_{14} and the elements in the second column of A as a_{21}, a_{22}; we label the element in the first column of B as b_1 and the element in the second column of B as b_2.

set_option backward.isDefEq.respectTransparency false in inductive A | a₁₁ | a₁₂ | a₁₃ | a₁₄ | a₂₁ | a₂₂ deriving Fintype set_option backward.isDefEq.respectTransparency false in inductive B | b₁ | b₂ deriving Fintype def f : A ⟶ B := ↾fun | A.a₁₁ => B.b₁ | A.a₁₂ => B.b₁ | A.a₁₃ => B.b₁ | A.a₁₄ => B.b₁ | A.a₂₁ => B.b₂ | A.a₂₂ => B.b₂

Then the sections are

def s₁ : B ⟶ A := ↾fun | B.b₁ => A.a₁₁ | B.b₂ => A.a₂₁ example : f ⊚ s₁ = 𝟙 B := ⊢ f ⊚ s₁ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₁)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₁)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₁)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₁)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₁)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₂ : B ⟶ A := ↾fun | B.b₁ => A.a₁₂ | B.b₂ => A.a₂₁ example : f ⊚ s₂ = 𝟙 B := ⊢ f ⊚ s₂ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₂)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₂)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₂)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₂)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₂)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₃ : B ⟶ A := ↾fun | B.b₁ => A.a₁₃ | B.b₂ => A.a₂₁ example : f ⊚ s₃ = 𝟙 B := ⊢ f ⊚ s₃ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₃)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₃)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₃)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₃)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₃)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₄ : B ⟶ A := ↾fun | B.b₁ => A.a₁₄ | B.b₂ => A.a₂₁ example : f ⊚ s₄ = 𝟙 B := ⊢ f ⊚ s₄ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₄)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₄)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₄)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₄)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₄)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₅ : B ⟶ A := ↾fun | B.b₁ => A.a₁₁ | B.b₂ => A.a₂₂ example : f ⊚ s₅ = 𝟙 B := ⊢ f ⊚ s₅ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₅)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₅)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₅)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₅)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₅)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₆ : B ⟶ A := ↾fun | B.b₁ => A.a₁₂ | B.b₂ => A.a₂₂ example : f ⊚ s₆ = 𝟙 B := ⊢ f ⊚ s₆ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₆)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₆)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₆)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₆)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₆)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₇ : B ⟶ A := ↾fun | B.b₁ => A.a₁₃ | B.b₂ => A.a₂₂ example : f ⊚ s₇ = 𝟙 B := ⊢ f ⊚ s₇ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₇)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₇)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₇)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₇)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₇)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙 def s₈ : B ⟶ A := ↾fun | B.b₁ => A.a₁₄ | B.b₂ => A.a₂₂ example : f ⊚ s₈ = 𝟙 B := ⊢ f ⊚ s₈ = 𝟙 B x:B⊢ (ConcreteCategory.hom (f ⊚ s₈)).toFun x = (ConcreteCategory.hom (𝟙 B)).toFun x; ⊢ (ConcreteCategory.hom (f ⊚ s₈)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₈)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ ⊢ (ConcreteCategory.hom (f ⊚ s₈)).toFun B.b₁ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₁⊢ (ConcreteCategory.hom (f ⊚ s₈)).toFun B.b₂ = (ConcreteCategory.hom (𝟙 B)).toFun B.b₂ All goals completed! 🐙