Documentation

Hironaka.Scheme.Smooth.GraphFormal

Completions of the graph: the formal automorphism, the fixed locus, the point (p, p) #

Kollár: "the completion of U_1(p) at (p, p) is the graph of φ_p" ([Kol07, 95], the proof of Theorem 92): the two coordinate projections ψ_p, ψ_p' : U_2(p) ⇉ X induce isomorphisms Ô_{X,p} ≅ Ô_{U_2(p),(p,p)}, and φ := ψ̂' ∘ ψ̂⁻¹ is the formal automorphism x_1 ↦ x_1' of [Kol07, Definition 91]. Włodarczyk adds that φ_u, φ_v coincide on the fixed locus of v − u ([Wlo05, Lemma 2.9.5], step (1) of the proof). The definitions:

noncomputable def AlgebraicGeometry.EtaleNbhdPair.stalkHom {X : Scheme} {p : ↥X} (Q : EtaleNbhdPair X p) :
↑(X.presheaf.stalk p) →+* ↑(Q.W.presheaf.stalk Q.q)

The local homomorphism ψ^* : 𝒪_{X,p} →+* 𝒪_{W,q} of the first map of an étale neighbourhood pair: the stalk map ψ.stalkMap q : 𝒪_{X,ψ(q)} ⟶ 𝒪_{W,q} transported along ψ(q) = p.

Equations
Instances For
    noncomputable def AlgebraicGeometry.EtaleNbhdPair.stalkHom' {X : Scheme} {p : ↥X} (Q : EtaleNbhdPair X p) :
    ↑(X.presheaf.stalk p) →+* ↑(Q.W.presheaf.stalk Q.q)

    The local homomorphism ψ'^* : 𝒪_{X,p} →+* 𝒪_{W,q} of the second map.

    Equations
    Instances For

      The formal automorphism φ := (ψ̂'^*)⁻¹ ∘ ψ̂^* of Ô_{X,p} (the "automorphism φ : X̂ → X̂" of [Kol07, Definition 91]), from the bijectivity of the two maps induced on the 𝔪-adic completions. For the pair of two coordinate systems it sends the completed germ of u_i to that of v_i (the coordinate identity ψ^*(u_i) = ψ'^*(v_i)); Kollár's φ_p^*(x_1', x_2, …) = (x_1, x_2, …) ([Kol07, 95]) is its inverse on functions.

      Equations
      Instances For

        The two projections of the graph are morphisms over k: ψ_u ≫ (U ⟶ X ⟶ Spec k) = ψ_v ≫ (U ⟶ X ⟶ Spec k) (φ_u ψ_u = φ_v ψ_v composed with the structure map of 𝔸ⁿ_k, toAffineSpace_comp_structure).

        noncomputable def AlgebraicGeometry.EtaleCoordinates.fixedLocusIdeal {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) :

        The ideal sheaf of the fixed locus Z = V(ψ_u^*(v_j − u_j) : j) ⊆ W of the graph (Włodarczyk's φ_u^{-1}(V(h)), h := v − u, the proof of [Wlo05, Lemma 2.9.5]; Kollár's x_1 − x_1' ∈ MC(I), [Kol07, 95]): for v = (x_1', x_2, …, x_n) and u = (x_1, x_2, …, x_n) only j = 1 contributes.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          @[reducible, inline]
          noncomputable abbrev AlgebraicGeometry.EtaleCoordinates.fixedLocus {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) :

          The fixed locus Z ⊆ W as a closed subscheme.

          Equations
          Instances For
            @[reducible, inline]
            noncomputable abbrev AlgebraicGeometry.EtaleCoordinates.fixedLocusι {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) :
            c.fixedLocus c' ⟶ c.graph c'

            The closed immersion Z ⟶ W of the fixed locus.

            Equations
            Instances For

              On the fixed locus Z the two projections agree after composing with φ_v, i.e. ψ_u|_Z^*(v_j) = ψ_v|_Z^*(v_j) for every j: on Z, ψ_u^*(v_j) = ψ_u^*(u_j), and ψ_u^*(u_j) = ψ_v^*(v_j) on all of W (the coordinate identity).

              The pair (ψ_u|_Z, ψ_v|_Z) : Z ⟶ U ×_{𝔸ⁿ} U, into the diagonal object of the étale coordinate morphism φ_v.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                @[reducible, inline]
                noncomputable abbrev AlgebraicGeometry.EtaleCoordinates.coincidenceLocus {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) :

                The coincidence locus of ψ_u|_Z and ψ_v|_Z: the preimage of the diagonal Δ : U ⟶ U ×_{𝔸ⁿ} U of the étale φ_v under (ψ_u|_Z, ψ_v|_Z), the equalizer of the two restricted projections (Włodarczyk's locus where "φ_u and φ_v coincide", the proof of [Wlo05, Lemma 2.9.5]).

                Equations
                Instances For
                  @[reducible, inline]
                  noncomputable abbrev AlgebraicGeometry.EtaleCoordinates.coincidenceLocusι {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) :

                  The immersion of the coincidence locus into the fixed locus Z.

                  Equations
                  Instances For
                    noncomputable def AlgebraicGeometry.EtaleCoordinates.graphPoint {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) {p : ↥X} (hpU : p ∈ ↑U) (hc : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) (hc' : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c'.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) :

                    The canonical point (p, p) : Spec κ(p) ⟶ W of the graph when all coordinates of both systems vanish at p (Kollár's "(p, p) ∈ U_2(p)", [Kol07, 95]): the lift of Spec κ(p) ⟶ U along both projections (the construction inside exists_graph_point, GraphPoint.lean).

                    Equations
                    Instances For
                      @[simp]
                      theorem AlgebraicGeometry.EtaleCoordinates.graphPoint_graphFst {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) {p : ↥X} (hpU : p ∈ ↑U) (hc : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) (hc' : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c'.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) :
                      @[simp]
                      theorem AlgebraicGeometry.EtaleCoordinates.graphPoint_graphFst_assoc {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) {p : ↥X} (hpU : p ∈ ↑U) (hc : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) (hc' : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c'.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) {Z : Scheme} (h : ↑↑U ⟶ Z) :
                      @[simp]
                      theorem AlgebraicGeometry.EtaleCoordinates.graphPoint_graphSnd {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) {p : ↥X} (hpU : p ∈ ↑U) (hc : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) (hc' : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c'.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) :
                      @[simp]
                      theorem AlgebraicGeometry.EtaleCoordinates.graphPoint_graphSnd_assoc {k : Type u} [Field k] {X : Scheme} {f : X ⟶ Spec ↧k} {n : ℕ} {U : ↑X.affineOpens} (c c' : EtaleCoordinates f n U) {p : ↥X} (hpU : p ∈ ↑U) (hc : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) (hc' : ∀ (i : Fin n), (CategoryTheory.ConcreteCategory.hom (X.presheaf.germ (↑U) p hpU)) (c'.v i) ∈ IsLocalRing.maximalIdeal ↑(X.presheaf.stalk p)) {Z : Scheme} (h : ↑↑U ⟶ Z) :