A Lean Companion to Conceptual Mathematics

Session 28: The category of pointed setsπŸ”—

1. An example of a non-distributive categoryπŸ”—

Exercise 1 (p. 298)

Both parts of the distributive law are false in the category of pointed sets:

(a) Find an object A for which the map \mathbf{0} \rightarrow \mathbf{0} \times A is not an isomorphism.

(b) Find objects A, B_1, and B_2 for which the standard map A \times B_1 + A \times B_2 \rightarrow A \times (B_1 + B_2) is not an isomorphism.

Solution: Exercise 1

For part (a), taking A to be

def A : Pointed := { X := Fin 2 point := 0 }

we can show that the map {\mathbf{0} \rightarrow \mathbf{0} \times A} is not an isomorphism, as follows:

example [HasInitial Pointed] [HasBinaryProduct (βŠ₯_ Pointed) A] : IsEmpty ((βŠ₯_ Pointed) β‰… (βŠ₯_ Pointed) β¨― A) := inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) A⊒ IsEmpty (βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― A) inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) A⊒ βˆ€ (a : βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― A), False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― A⊒ False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― Aaβ‚€:βŠ₯_ Pointed ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }⊒ False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― Aaβ‚€:βŠ₯_ Pointed ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }pA:(βŠ₯_ Pointed) β¨― A ⟢ A := prod.snd⊒ False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― Aaβ‚€:βŠ₯_ Pointed ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }pA:(βŠ₯_ Pointed) β¨― A ⟢ A := prod.snds:A ⟢ (βŠ₯_ Pointed) β¨― A := prod.lift { toFun := fun x ↦ (βŠ₯_ Pointed).point, map_point := β‹― } (πŸ™ A)⊒ False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― Aaβ‚€:βŠ₯_ Pointed ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }pA:(βŠ₯_ Pointed) β¨― A ⟢ A := prod.snds:A ⟢ (βŠ₯_ Pointed) β¨― A := prod.lift { toFun := fun x ↦ (βŠ₯_ Pointed).point, map_point := β‹― } (πŸ™ A)h_comm:pA ⊚ e.hom = aβ‚€βŠ’ False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― Aaβ‚€:βŠ₯_ Pointed ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }pA:(βŠ₯_ Pointed) β¨― A ⟢ A := prod.snds:A ⟢ (βŠ₯_ Pointed) β¨― A := prod.lift { toFun := fun x ↦ (βŠ₯_ Pointed).point, map_point := β‹― } (πŸ™ A)h_comm:pA ⊚ e.hom = aβ‚€one:A.X := 1⊒ False inst✝¹:HasInitial Pointedinst✝:HasBinaryProduct (βŠ₯_ Pointed) Ae:βŠ₯_ Pointed β‰… (βŠ₯_ Pointed) β¨― Aaβ‚€:βŠ₯_ Pointed ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }pA:(βŠ₯_ Pointed) β¨― A ⟢ A := prod.snds:A ⟢ (βŠ₯_ Pointed) β¨― A := prod.lift { toFun := fun x ↦ (βŠ₯_ Pointed).point, map_point := β‹― } (πŸ™ A)h_comm:pA ⊚ e.hom = aβ‚€one:A.X := 1h_contra:one = A.point⊒ False All goals completed! πŸ™

For part (b), taking A, B_1, and B_2 to be, respectively,

def A : Pointed := { X := Fin 2 point := 0 } def B₁ : Pointed := { X := Unit point := () } def Bβ‚‚ : Pointed := { X := Unit point := () }

we can use the pigeonhole principle (and grind to aid readability) to show that the map {A \times B_1 + A \times B_2 \rightarrow A \times (B_1 + B_2)} is not an isomorphism, as follows:

instance : OfNat A.X 0 where ofNat := (0 : Fin 2) instance : OfNat A.X 1 where ofNat := (1 : Fin 2) example [HasBinaryProduct A B₁] [HasBinaryProduct A Bβ‚‚] [HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)] [HasBinaryCoproduct B₁ Bβ‚‚] [HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)] : IsEmpty ((A β¨― B₁) β¨Ώ (A β¨― Bβ‚‚) β‰… A β¨― (B₁ β¨Ώ Bβ‚‚)) := inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)⊒ IsEmpty ((A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚) inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)⊒ βˆ€ (a : (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚), False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚βŠ’ False -- Alias longer types for convenience inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚βŠ’ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚βŠ’ False -- Define constant basepoint endomorphism of A inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }⊒ False -- Construct 3 distinct pathways from A to L inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }⊒ False -- Push pathways through isomorphism to obtain 3 target elements inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1⊒ False -- Define 'detector' morphisms inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fst⊒ False -- Evaluate detector compositions for each pathway inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAA⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAA⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ A⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAA⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAA⊒ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ A⊒ False -- Prove all morphisms into Z map to basepoint inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }⊒ False -- Lift element equality to morphism equality for morphisms A ⟢ L inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = b⊒ False -- Apply pigeonhole principle inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh_pigeon:vβ‚€ = v₁ ∨ vβ‚€ = vβ‚‚ ∨ v₁ = vβ‚‚βŠ’ False -- Derive contradiction for each collision inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh01:vβ‚€ = vβ‚βŠ’ Falseinst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh02:vβ‚€ = vβ‚‚βŠ’ Falseinst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh12:v₁ = vβ‚‚βŠ’ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh01:vβ‚€ = vβ‚βŠ’ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh01:vβ‚€ = v₁h_contra:1 = 0⊒ False All goals completed! πŸ™ inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh02:vβ‚€ = vβ‚‚βŠ’ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh02:vβ‚€ = vβ‚‚h_contra:1 = 0⊒ False All goals completed! πŸ™ inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh12:v₁ = vβ‚‚βŠ’ False inst✝⁴:HasBinaryProduct A B₁inst✝³:HasBinaryProduct A Bβ‚‚inst✝²:HasBinaryCoproduct (A β¨― B₁) (A β¨― Bβ‚‚)inst✝¹:HasBinaryCoproduct B₁ Bβ‚‚inst✝:HasBinaryProduct A (B₁ β¨Ώ Bβ‚‚)e:(A β¨― B₁) β¨Ώ A β¨― Bβ‚‚ β‰… A β¨― B₁ β¨Ώ Bβ‚‚L:Pointed := (A β¨― B₁) β¨Ώ A β¨― Bβ‚‚Z:Pointed := B₁ β¨Ώ Bβ‚‚cAA:A ⟢ A := { toFun := fun x ↦ A.point, map_point := β‹― }cAL:A ⟢ L := { toFun := fun x ↦ L.point, map_point := β‹― }j₁:A ⟢ L := coprod.inl ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ B₁.point, map_point := β‹― }jβ‚‚:A ⟢ L := coprod.inr ⊚ prod.lift (πŸ™ A) { toFun := fun x ↦ Bβ‚‚.point, map_point := β‹― }vβ‚€:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ cAL)) 1v₁:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ j₁)) 1vβ‚‚:A.X := (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ jβ‚‚)) 1m10:L ⟢ A := coprod.desc prod.fst (cAA ⊚ prod.fst)m01:L ⟢ A := coprod.desc (cAA ⊚ prod.fst) prod.fsth10β‚€:m10 ⊚ cAL = cAAh01β‚€:m01 ⊚ cAL = cAAh10₁:m10 ⊚ j₁ = πŸ™ Ah01₁:m01 ⊚ j₁ = cAAh10β‚‚:m10 ⊚ jβ‚‚ = cAAh01β‚‚:m01 ⊚ jβ‚‚ = πŸ™ Ah_fXZ:βˆ€ {X : Pointed} (f : X ⟢ Z), f = { toFun := fun x ↦ Z.point, map_point := β‹― }h_fAL:βˆ€ {a b : A ⟢ L}, (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ a)) 1 = (ConcreteCategory.hom (prod.fst ⊚ e.hom ⊚ b)) 1 β†’ a = bh12:v₁ = vβ‚‚h_contra:1 = 0⊒ False All goals completed! πŸ™
Exercise 2 (p. 298)

As we saw, in the category of pointed sets, the (only) map {\mathbf{0} \rightarrow \mathbf{1}} is an isomorphism. Show that the other clause in the definition of linear category fails, i.e. find objects A and B in \mathbf{1}/𝑺 for which the 'identity matrix' A + B \rightarrow A \times B is not an isomorphism.

Solution: Exercise 2

Taking A and B to be, respectively,

def A : Pointed := { X := Fin 2 point := 0 } def B : Pointed := { X := Fin 2 point := 0 }

we can show that the identity matrix is not an isomorphism, as follows:

instance : OfNat A.X 0 where ofNat := (0 : Fin 2) instance : OfNat A.X 1 where ofNat := (1 : Fin 2) instance : OfNat B.X 0 where ofNat := (0 : Fin 2) instance : OfNat B.X 1 where ofNat := (1 : Fin 2) -- Define helper functions lemma eval_zero {X Y : Pointed} [HasZeroMorphisms Pointed] (x : X.X) : (0 : X ⟢ Y) x = Y.point := X:PointedY:Pointedinst✝:HasZeroMorphisms Pointedx:X.X⊒ (ConcreteCategory.hom 0) x = Y.point X:PointedY:Pointedinst✝:HasZeroMorphisms Pointedx:X.Xthis:{ toFun := fun x ↦ Y.point, map_point := β‹― } ⊚ 0 = 0⊒ (ConcreteCategory.hom 0) x = Y.point X:PointedY:Pointedinst✝:HasZeroMorphisms Pointedx:X.Xthis:{ toFun := fun x ↦ Y.point, map_point := β‹― } ⊚ 0 = 0⊒ (ConcreteCategory.hom ({ toFun := fun x ↦ Y.point, map_point := β‹― } ⊚ 0)) x = Y.point; All goals completed! πŸ™ abbrev d11 : Fin 2 β†’ Fin 2 β†’ Fin 2 | 1, 1 => 1 | _, _ => 0 example [HasZeroMorphisms Pointed] [HasBinaryProduct A B] [HasBinaryCoproduct A B] : IsEmpty (IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))) := inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A B⊒ IsEmpty (IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))) inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A B⊒ IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))) β†’ False inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))⊒ False -- Construct identity matrix inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))⊒ False -- Construct morphism v mapping (1, 1) to 1 and everything else to 0 inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }⊒ False -- Construct diagonal morphism mapping 1 to (1, 1) inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }⊒ False -- Evaluate projections on left (a, 0) and right (0, b) axes inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = x⊒ False inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0⊒ False inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0eval_inr_fst:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift 0 (πŸ™ B))) x = 0⊒ False inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0eval_inr_fst:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift 0 (πŸ™ B))) x = 0eval_inr_snd:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift 0 (πŸ™ B))) x = x⊒ False -- Show v acts exactly like zero morphism on left axis inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0eval_inr_fst:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift 0 (πŸ™ B))) x = 0eval_inr_snd:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift 0 (πŸ™ B))) x = xhv_inl:(v ⊚ I) ⊚ coprod.inl = (0 ⊚ I) ⊚ coprod.inl⊒ False -- Show v acts exactly like zero morphism on right axis inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0eval_inr_fst:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift 0 (πŸ™ B))) x = 0eval_inr_snd:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift 0 (πŸ™ B))) x = xhv_inl:(v ⊚ I) ⊚ coprod.inl = (0 ⊚ I) ⊚ coprod.inlhv_inr:(v ⊚ I) ⊚ coprod.inr = (0 ⊚ I) ⊚ coprod.inr⊒ False -- Hence v must be zero morphism inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0eval_inr_fst:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift 0 (πŸ™ B))) x = 0eval_inr_snd:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift 0 (πŸ™ B))) x = xhv_inl:(v ⊚ I) ⊚ coprod.inl = (0 ⊚ I) ⊚ coprod.inlhv_inr:(v ⊚ I) ⊚ coprod.inr = (0 ⊚ I) ⊚ coprod.inrhv_eq:v = 0⊒ False -- Derive 1 = 0 contradiction by evaluating v at (1, 1) inst✝²:HasZeroMorphisms Pointedinst✝¹:HasBinaryProduct A Binst✝:HasBinaryCoproduct A Bh_iso:IsIso (coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B)))I:A β¨Ώ B ⟢ A β¨― B := coprod.desc (prod.lift (πŸ™ A) 0) (prod.lift 0 (πŸ™ B))v:A β¨― B ⟢ A := { toFun := fun x ↦ d11 (prod.fst.toFun x) (prod.snd.toFun x), map_point := β‹― }f11:A ⟢ A β¨― B := prod.lift (πŸ™ A) { toFun := fun x ↦ x, map_point := β‹― }eval_inl_fst:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift (πŸ™ A) 0)) x = xeval_inl_snd:βˆ€ (x : A.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift (πŸ™ A) 0)) x = 0eval_inr_fst:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.fst ⊚ prod.lift 0 (πŸ™ B))) x = 0eval_inr_snd:βˆ€ (x : B.X), (ConcreteCategory.hom (prod.snd ⊚ prod.lift 0 (πŸ™ B))) x = xhv_inl:(v ⊚ I) ⊚ coprod.inl = (0 ⊚ I) ⊚ coprod.inlhv_inr:(v ⊚ I) ⊚ coprod.inr = (0 ⊚ I) ⊚ coprod.inrhv_eq:v = 0h_contra:1 = 0⊒ False All goals completed! πŸ™