Typeclasses for S-schemes and S-morphisms #
We define these as thin wrappers around CategoryTheory/Comma/OverClass.
Main definition #
AlgebraicGeometry.Scheme.Over:X.Over SequipsXwith anS-scheme structure.X ↘ S : X ⟶ Sis the structure morphism.AlgebraicGeometry.Scheme.Hom.IsOver:f.IsOver Sasserts thatfis anS-morphism.
@[reducible, inline]
X.Over S is the typeclass containing the data of a structure morphism X ↘ S : X ⟶ S.
Instances For
@[reducible, inline]
X.CanonicallyOver S is the typeclass containing the data of a structure morphism X ↘ S : X ⟶ S,
and that S is (uniquely) inferable from the structure of X.
Instances For
@[simp]
theorem
AlgebraicGeometry.Scheme.Hom.isOver_iff
{X Y : Scheme}
(S : Scheme)
[X.Over S]
[Y.Over S]
{f : X ⟶ Y}
:
IsOver f S ↔ CategoryTheory.CategoryStruct.comp f (Y ↘ S) = X ↘ S
Also note the existence of CategoryTheory.IsOverTower X Y S.