Commutative squares #
This file provide an API for commutative squares in categories.
If top, left, right and bottom are four morphisms which are the edges
of a square, CommSq top left right bottom is the predicate that this
square is commutative.
The structure CommSq is extended in CategoryTheory/Shapes/Limits/CommSq.lean
as IsPullback and IsPushout in order to define pullback and pushout squares.
Future work #
Refactor LiftStruct from Arrow.lean and lifting properties using CommSq.lean.
structure
CategoryTheory.CommSq
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{W : C}
{X : C}
{Y : C}
{Z : C}
(f : W ⟶ X)
(g : W ⟶ Y)
(h : X ⟶ Z)
(i : Y ⟶ Z)
:
The proposition that a square
W ---f---> X
| |
g h
| |
v v
Y ---i---> Z
is a commuting square.
The square commutes.
Instances For
theorem
CategoryTheory.CommSq.w_assoc
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{W : C}
{X : C}
{Y : C}
{Z : C}
{f : W ⟶ X}
{g : W ⟶ Y}
{h : X ⟶ Z✝}
{i : Y ⟶ Z✝}
(self : CategoryTheory.CommSq f g h✝ i)
{Z : C}
(h : Z✝ ⟶ Z)
:
theorem
CategoryTheory.CommSq.flip
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{W : C}
{X : C}
{Y : C}
{Z : C}
{f : W ⟶ X}
{g : W ⟶ Y}
{h : X ⟶ Z}
{i : Y ⟶ Z}
(p : CategoryTheory.CommSq f g h i)
:
CategoryTheory.CommSq g f i h
theorem
CategoryTheory.CommSq.of_arrow
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{f : CategoryTheory.Arrow C}
{g : CategoryTheory.Arrow C}
(h : f ⟶ g)
:
CategoryTheory.CommSq f.hom h.left h.right g.hom
theorem
CategoryTheory.CommSq.op
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{W : C}
{X : C}
{Y : C}
{Z : C}
{f : W ⟶ X}
{g : W ⟶ Y}
{h : X ⟶ Z}
{i : Y ⟶ Z}
(p : CategoryTheory.CommSq f g h i)
:
CategoryTheory.CommSq i.op h.op g.op f.op
The commutative square in the opposite category associated to a commutative square.
theorem
CategoryTheory.CommSq.unop
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{W : Cᵒᵖ}
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
{Z : Cᵒᵖ}
{f : W ⟶ X}
{g : W ⟶ Y}
{h : X ⟶ Z}
{i : Y ⟶ Z}
(p : CategoryTheory.CommSq f g h i)
:
CategoryTheory.CommSq i.unop h.unop g.unop f.unop
The commutative square associated to a commutative square in the opposite category.
theorem
CategoryTheory.Functor.map_commSq
{C : Type u_1}
[CategoryTheory.Category.{u_3, u_1} C]
{D : Type u_2}
[CategoryTheory.Category.{u_4, u_2} D]
(F : CategoryTheory.Functor C D)
{W : C}
{X : C}
{Y : C}
{Z : C}
{f : W ⟶ X}
{g : W ⟶ Y}
{h : X ⟶ Z}
{i : Y ⟶ Z}
(s : CategoryTheory.CommSq f g h i)
:
CategoryTheory.CommSq (F.toPrefunctor.map f) (F.toPrefunctor.map g) (F.toPrefunctor.map h) (F.toPrefunctor.map i)
theorem
CategoryTheory.CommSq.map
{C : Type u_1}
[CategoryTheory.Category.{u_3, u_1} C]
{D : Type u_2}
[CategoryTheory.Category.{u_4, u_2} D]
(F : CategoryTheory.Functor C D)
{W : C}
{X : C}
{Y : C}
{Z : C}
{f : W ⟶ X}
{g : W ⟶ Y}
{h : X ⟶ Z}
{i : Y ⟶ Z}
(s : CategoryTheory.CommSq f g h i)
:
CategoryTheory.CommSq (F.toPrefunctor.map f) (F.toPrefunctor.map g) (F.toPrefunctor.map h) (F.toPrefunctor.map i)
Alias of CategoryTheory.Functor.map_commSq.
theorem
CategoryTheory.CommSq.LiftStruct.ext
{C : Type u_1}
:
∀ {inst : CategoryTheory.Category.{u_2, u_1} C} {A B X Y : C} {f : A ⟶ X} {i : A ⟶ B} {p : X ⟶ Y} {g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g} (x y : CategoryTheory.CommSq.LiftStruct sq), x.l = y.l → x = y
theorem
CategoryTheory.CommSq.LiftStruct.ext_iff
{C : Type u_1}
:
∀ {inst : CategoryTheory.Category.{u_2, u_1} C} {A B X Y : C} {f : A ⟶ X} {i : A ⟶ B} {p : X ⟶ Y} {g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g} (x y : CategoryTheory.CommSq.LiftStruct sq), x = y ↔ x.l = y.l
structure
CategoryTheory.CommSq.LiftStruct
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
Type u_2
Now we consider a square:
A ---f---> X
| |
i p
| |
v v
B ---g---> Y
The datum of a lift in a commutative square, i.e. an up-right-diagonal morphism which makes both triangles commute.
- l : B ⟶ X
The lift.
- fac_left : CategoryTheory.CategoryStruct.comp i self.l = f
The upper left triangle commutes.
- fac_right : CategoryTheory.CategoryStruct.comp self.l p = g
The lower right triangle commutes.
Instances For
@[simp]
theorem
CategoryTheory.CommSq.LiftStruct.op_l
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g}
(l : CategoryTheory.CommSq.LiftStruct sq)
:
(CategoryTheory.CommSq.LiftStruct.op l).l = l.l.op
def
CategoryTheory.CommSq.LiftStruct.op
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g}
(l : CategoryTheory.CommSq.LiftStruct sq)
:
CategoryTheory.CommSq.LiftStruct (_ : CategoryTheory.CommSq g.op p.op i.op f.op)
A LiftStruct for a commutative square gives a LiftStruct for the
corresponding square in the opposite category.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
CategoryTheory.CommSq.LiftStruct.unop_l
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : Cᵒᵖ}
{B : Cᵒᵖ}
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g}
(l : CategoryTheory.CommSq.LiftStruct sq)
:
(CategoryTheory.CommSq.LiftStruct.unop l).l = l.l.unop
def
CategoryTheory.CommSq.LiftStruct.unop
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : Cᵒᵖ}
{B : Cᵒᵖ}
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g}
(l : CategoryTheory.CommSq.LiftStruct sq)
:
CategoryTheory.CommSq.LiftStruct (_ : CategoryTheory.CommSq g.unop p.unop i.unop f.unop)
A LiftStruct for a commutative square in the opposite category
gives a LiftStruct for the corresponding square in the original category.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
CategoryTheory.CommSq.LiftStruct.opEquiv_apply
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
(l : CategoryTheory.CommSq.LiftStruct sq)
:
@[simp]
theorem
CategoryTheory.CommSq.LiftStruct.opEquiv_symm_apply
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
(l : CategoryTheory.CommSq.LiftStruct (_ : CategoryTheory.CommSq g.op p.op i.op f.op))
:
def
CategoryTheory.CommSq.LiftStruct.opEquiv
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
CategoryTheory.CommSq.LiftStruct sq ≃ CategoryTheory.CommSq.LiftStruct (_ : CategoryTheory.CommSq g.op p.op i.op f.op)
Equivalences of LiftStruct for a square and the corresponding square
in the opposite category.
Equations
- One or more equations did not get rendered due to their size.
Instances For
def
CategoryTheory.CommSq.LiftStruct.unopEquiv
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : Cᵒᵖ}
{B : Cᵒᵖ}
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
CategoryTheory.CommSq.LiftStruct sq ≃ CategoryTheory.CommSq.LiftStruct (_ : CategoryTheory.CommSq g.unop p.unop i.unop f.unop)
Equivalences of LiftStruct for a square in the oppositive category and
the corresponding square in the original category.
Equations
- One or more equations did not get rendered due to their size.
Instances For
instance
CategoryTheory.CommSq.subsingleton_liftStruct_of_epi
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[CategoryTheory.Epi i]
:
Equations
- (_ : Subsingleton (CategoryTheory.CommSq.LiftStruct sq)) = (_ : Subsingleton (CategoryTheory.CommSq.LiftStruct sq))
instance
CategoryTheory.CommSq.subsingleton_liftStruct_of_mono
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[CategoryTheory.Mono p]
:
Equations
- (_ : Subsingleton (CategoryTheory.CommSq.LiftStruct sq)) = (_ : Subsingleton (CategoryTheory.CommSq.LiftStruct sq))
class
CategoryTheory.CommSq.HasLift
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
The assertion that a square has a LiftStruct.
- exists_lift : Nonempty (CategoryTheory.CommSq.LiftStruct sq)
Square has a
LiftStruct.
Instances
theorem
CategoryTheory.CommSq.HasLift.mk'
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
{sq : CategoryTheory.CommSq f i p g}
(l : CategoryTheory.CommSq.LiftStruct sq)
:
theorem
CategoryTheory.CommSq.HasLift.iff
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
theorem
CategoryTheory.CommSq.HasLift.iff_op
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
CategoryTheory.CommSq.HasLift sq ↔ CategoryTheory.CommSq.HasLift (_ : CategoryTheory.CommSq g.op p.op i.op f.op)
theorem
CategoryTheory.CommSq.HasLift.iff_unop
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : Cᵒᵖ}
{B : Cᵒᵖ}
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
:
CategoryTheory.CommSq.HasLift sq ↔ CategoryTheory.CommSq.HasLift (_ : CategoryTheory.CommSq g.unop p.unop i.unop f.unop)
noncomputable def
CategoryTheory.CommSq.lift
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[hsq : CategoryTheory.CommSq.HasLift sq]
:
B ⟶ X
A choice of a diagonal morphism that is part of a LiftStruct when
the square has a lift.
Equations
- CategoryTheory.CommSq.lift sq = (Nonempty.some (_ : Nonempty (CategoryTheory.CommSq.LiftStruct sq))).l
Instances For
@[simp]
theorem
CategoryTheory.CommSq.fac_left_assoc
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[hsq : CategoryTheory.CommSq.HasLift sq]
{Z : C}
(h : X ⟶ Z)
:
@[simp]
theorem
CategoryTheory.CommSq.fac_left
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[hsq : CategoryTheory.CommSq.HasLift sq]
:
@[simp]
theorem
CategoryTheory.CommSq.fac_right_assoc
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[hsq : CategoryTheory.CommSq.HasLift sq]
{Z : C}
(h : Y ⟶ Z)
:
@[simp]
theorem
CategoryTheory.CommSq.fac_right
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
{A : C}
{B : C}
{X : C}
{Y : C}
{f : A ⟶ X}
{i : A ⟶ B}
{p : X ⟶ Y}
{g : B ⟶ Y}
(sq : CategoryTheory.CommSq f i p g)
[hsq : CategoryTheory.CommSq.HasLift sq]
: