Typeclasses for S-objects and S-morphisms

Warning: This is not usually how typeclasses should be used. This is only a sensible approach when the morphism is considered as a structure on X, typically in algebraic geometry.

This is analogous to to how we view ringhoms as structures via the Algebra typeclass.

For other applications use unbundled arrows or CategoryTheory.Over.

Main definition

• CategoryTheory.OverClass: OverClass X S equips X with a morphism into S. X ↘ S : X ⟶ S is the structure morphism.
• CategoryTheory.HomIsOver: HomIsOver f S asserts that f commutes with the structure morphisms.

class CategoryTheory.OverClass {C : Type u} [CategoryTheory.Category.{v, u} C] (X S : C) : Type v

OverClass X S is the typeclass containing the data of a structure morphism X ↘ S : X ⟶ S.

• ofHom :: (
• hom : X ⟶ S

  The structure morphism. Use X ↘ S instead.

• )

def CategoryTheory.over {C : Type u} [CategoryTheory.Category.{v, u} C] (X S : C) : autoParam (CategoryTheory.OverClass X S) _auto✝ → (X ⟶ S)

The structure morphism X ↘ S : X ⟶ S given OverClass X S. The instance argument is an optParam instead so that it appears in the discrimination tree.

Equations

• CategoryTheory.over X S x = CategoryTheory.OverClass.hom

def CategoryTheory.«term_↘_» : Lean.TrailingParserDescr

The structure morphism X ↘ S : X ⟶ S given OverClass X S.

Equations

• CategoryTheory.«term_↘_» = Lean.ParserDescr.trailingNode `CategoryTheory.«term_↘_» 90 90 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ↘ ") (Lean.ParserDescr.cat `term 90))

def CategoryTheory.OverClass.Simps.over {C : Type u} [CategoryTheory.Category.{v, u} C] (X S : C) [CategoryTheory.OverClass X S] : X ⟶ S

See Note [custom simps projection]

Equations

• CategoryTheory.OverClass.Simps.over X S = X ↘ S

class CategoryTheory.CanonicallyOverClass {C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) (S : semiOutParam C) extends CategoryTheory.OverClass X S : Type v

X.CanonicallyOverClass S is the typeclass containing the data of a structure morphism X ↘ S : X ⟶ S, and that S is (uniquely) inferrable from the structure of X.

• hom : X ⟶ S

def CategoryTheory.CanonicallyOverClass.Simps.over {C : Type u} [CategoryTheory.Category.{v, u} C] (X S : C) [CategoryTheory.CanonicallyOverClass X S] : X ⟶ S

See Note [custom simps projection]

Equations

• CategoryTheory.CanonicallyOverClass.Simps.over X S = X ↘ S

@[instance 100]

instance CategoryTheory.instOverClass {C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} : CategoryTheory.OverClass X X

Equations

• CategoryTheory.instOverClass = { hom := CategoryTheory.CategoryStruct.id X }

@[simp]

theorem CategoryTheory.instOverClass_over {C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} : X ↘ X = CategoryTheory.CategoryStruct.id X

@[instance 900]

instance CategoryTheory.instOverClassOfCanonicallyOverClass {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (S : C) [CategoryTheory.CanonicallyOverClass X Y] [CategoryTheory.OverClass Y S] : CategoryTheory.OverClass X S

Equations

• CategoryTheory.instOverClassOfCanonicallyOverClass S = { hom := CategoryTheory.CategoryStruct.comp (X ↘ Y) (Y ↘ S) }

@[simp]

theorem CategoryTheory.instOverClassOfCanonicallyOverClass_over {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (S : C) [CategoryTheory.CanonicallyOverClass X Y] [CategoryTheory.OverClass Y S] : X ↘ S = CategoryTheory.CategoryStruct.comp (X ↘ Y) (Y ↘ S)

class CategoryTheory.HomIsOver {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (S : C) [CategoryTheory.OverClass X S] [CategoryTheory.OverClass Y S] : Prop

Given OverClass X S and OverClass Y S and f : X ⟶ Y, HomIsOver f S is the typeclass asserting f commutes with the structure morphisms.

• comp_over : CategoryTheory.CategoryStruct.comp f (Y ↘ S) = X ↘ S

@[simp]

theorem CategoryTheory.comp_over {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (S : C) [CategoryTheory.OverClass X S] [CategoryTheory.OverClass Y S] [CategoryTheory.HomIsOver f S] : CategoryTheory.CategoryStruct.comp f (Y ↘ S) = X ↘ S

@[simp]

theorem CategoryTheory.comp_over_assoc {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (S : C) [CategoryTheory.OverClass X S] [CategoryTheory.OverClass Y S] [CategoryTheory.HomIsOver f S] {Z : C} (h : S ⟶ Z) : CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp (Y ↘ S) h) = CategoryTheory.CategoryStruct.comp (X ↘ S) h

@[reducible, inline]

abbrev CategoryTheory.IsOverTower {C : Type u} [CategoryTheory.Category.{v, u} C] (X Y S : C) [CategoryTheory.OverClass X S] [CategoryTheory.OverClass Y S] [CategoryTheory.OverClass X Y] : Prop

Scheme.IsOverTower X Y S is the typeclass asserting that the structure morphisms X ↘ Y, Y ↘ S, and X ↘ S commute.

Equations

• CategoryTheory.IsOverTower X Y S = CategoryTheory.HomIsOver (X ↘ Y) S

instance CategoryTheory.instIsOverTower {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (S : C) [CategoryTheory.CanonicallyOverClass X Y] [CategoryTheory.OverClass Y S] : CategoryTheory.IsOverTower X Y S

Equations

• ⋯ = ⋯

theorem CategoryTheory.homIsOver_of_isOverTower {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (S S' : C) [CategoryTheory.OverClass X S] [CategoryTheory.OverClass X S'] [CategoryTheory.OverClass Y S] [CategoryTheory.OverClass Y S'] [CategoryTheory.OverClass S S'] [CategoryTheory.IsOverTower X S S'] [CategoryTheory.IsOverTower Y S S'] [CategoryTheory.HomIsOver f S] : CategoryTheory.HomIsOver f S'

instance CategoryTheory.instHomIsOverOfIsOverTower {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (S S' : C) [CategoryTheory.CanonicallyOverClass X S] [CategoryTheory.OverClass X S'] [CategoryTheory.OverClass Y S] [CategoryTheory.OverClass Y S'] [CategoryTheory.OverClass S S'] [CategoryTheory.IsOverTower X S S'] [CategoryTheory.IsOverTower Y S S'] [CategoryTheory.HomIsOver f S] : CategoryTheory.HomIsOver f S'

Equations

• ⋯ = ⋯

instance CategoryTheory.instHomIsOverOfIsOverTower_1 {C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (S S' : C) [CategoryTheory.OverClass X S] [CategoryTheory.OverClass X S'] [CategoryTheory.CanonicallyOverClass Y S] [CategoryTheory.OverClass Y S'] [CategoryTheory.OverClass S S'] [CategoryTheory.IsOverTower X S S'] [CategoryTheory.IsOverTower Y S S'] [CategoryTheory.HomIsOver f S] : CategoryTheory.HomIsOver f S'

Equations

• ⋯ = ⋯

def CategoryTheory.OverClass.asOver {C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (S : C) [CategoryTheory.OverClass X S] : CategoryTheory.Over S

Bundle X with an OverClass X S instance into Over S.

Equations

• CategoryTheory.OverClass.asOver S = CategoryTheory.Over.mk (X ↘ S)