Documentation

Mathlib.AlgebraicGeometry.Birational.Composition

Composition of rational maps #

This file defines composition for partial maps and rational maps between schemes.

Main definitions #

Main statements #

noncomputable def AlgebraicGeometry.Scheme.PartialMap.comp {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] (f : X.PartialMap Y) [IsDominant f.hom] (g : Y.PartialMap Z) :

Composition of partial maps. The domain of f.comp g is the preimage of g.domain under f, viewed as an open subscheme of X. Requires f.hom to be dominant so that the domain is dense.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem AlgebraicGeometry.Scheme.PartialMap.comp_restrict_left {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] (f : X.PartialMap Y) [IsDominant f.hom] (U : X.Opens) (hU : Dense U) (hU' : U f.domain) (g : Y.PartialMap Z) :
    theorem AlgebraicGeometry.Scheme.PartialMap.comp_restrict_right {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] (f : X.PartialMap Y) [IsDominant f.hom] (g : Y.PartialMap Z) (V : Y.Opens) (hV : Dense V) (hV' : V g.domain) :
    theorem AlgebraicGeometry.Scheme.PartialMap.comp_equiv_of_equiv_left {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] {f₁ f₂ : X.PartialMap Y} [IsDominant f₁.hom] [IsDominant f₂.hom] (h : f₁.equiv f₂) (g : Y.PartialMap Z) :
    (f₁.comp g).equiv (f₂.comp g)

    Composition respects equivalence of partial maps on the left.

    theorem AlgebraicGeometry.Scheme.PartialMap.comp_equiv_of_equiv_right {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] (f : X.PartialMap Y) [IsDominant f.hom] {g₁ g₂ : Y.PartialMap Z} (h : g₁.equiv g₂) :
    (f.comp g₁).equiv (f.comp g₂)

    Composition respects equivalence of partial maps on the right.

    theorem AlgebraicGeometry.Scheme.PartialMap.comp_equiv_of_equiv {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] (f₁ f₂ : X.PartialMap Y) [IsDominant f₁.hom] [IsDominant f₂.hom] (hf : f₁.equiv f₂) (g₁ g₂ : Y.PartialMap Z) (hg : g₁.equiv g₂) :
    (f₁.comp g₁).equiv (f₂.comp g₂)

    Composition respects equivalence of partial maps in both arguments.

    @[simp]
    theorem AlgebraicGeometry.Scheme.PartialMap.comp_assoc {X₁ X₂ X₃ Y : Scheme} [PreirreducibleSpace X₁] [IrreducibleSpace X₂] [Nonempty X₃] (f : X₁.PartialMap X₂) [IsDominant f.hom] (g : X₂.PartialMap X₃) [IsDominant g.hom] (h : X₃.PartialMap Y) :
    (f.comp g).comp h = f.comp (g.comp h)
    noncomputable def AlgebraicGeometry.Scheme.RationalMap.comp {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] (f : X.RationalMap Y) [f.IsDominant] (g : Y.RationalMap Z) :

    Composition of rational maps. Requires f to be dominant, so that we may choose a dominant representative.

    Equations
    Instances For
      theorem AlgebraicGeometry.Scheme.RationalMap.comp_assoc {X₁ X₂ X₃ Y : Scheme} [PreirreducibleSpace X₁] [IrreducibleSpace X₂] [Nonempty X₃] (f₁ : X₁.RationalMap X₂) [f₁.IsDominant] (f₂ : X₂.RationalMap X₃) [f₂.IsDominant] (f₃ : X₃.RationalMap Y) :
      (f₁.comp f₂).comp f₃ = f₁.comp (f₂.comp f₃)
      instance AlgebraicGeometry.Scheme.RationalMap.isOver_comp {X Y Z : Scheme} [PreirreducibleSpace X] [Nonempty Y] {S : Scheme} [IrreducibleSpace Y] [Nonempty Z] [X.Over S] [Y.Over S] [Z.Over S] (f : X.RationalMap Y) [f.IsDominant] [IsOver S f] (g : Y.RationalMap Z) [g.IsDominant] [IsOver S g] :
      IsOver S (f.comp g)