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:
EtaleNbhdPair.stalkHom Q,stalkHom' Q: the local homomorphismsψ^*, ψ'^* : 𝒪_{X,p} →+* 𝒪_{W,q}of an étale neighbourhood pair (Graph.lean), the stalk maps atqtransported alongψ(q) = p.EtaleNbhdPair.formalAutomorphism Q ha ha':φ := (ψ̂'^*)⁻¹ ∘ ψ̂^*, an automorphism ofÔ_{X,p}, from the bijectivity of the two induced maps on completions (proved inGraphCompletion.lean).EtaleCoordinates.fixedLocusIdeal c c',fixedLocus,fixedLocusι: the closed subschemeZ = V(ψ_u^*(v_j − u_j) : j)of the graphW = U ×_{𝔸ⁿ} U;coincidenceLocus c c',coincidenceLocusι: the locus ofZwhereψ_uandψ_vcoincide, the preimage of the diagonal ofφ_vunder(ψ_u, ψ_v) : Z ⟶ U ×_{𝔸ⁿ} U.EtaleCoordinates.graphPoint c c' hpU hc hc': the canonical point(p, p) : Spec κ(p) ⟶ Wwhen all coordinates vanish atp(the construction insideexists_graph_pointofGraphPoint.lean, named).
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
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
- Q.formalAutomorphism ha ha' = (RingEquiv.ofBijective (IsLocalRing.completionMap Q.stalkHom) ha).trans (RingEquiv.ofBijective (IsLocalRing.completionMap Q.stalkHom') ha').symm
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).
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
The fixed locus Z ⊆ W as a closed subscheme.
Equations
- c.fixedLocus c' = (c.fixedLocusIdeal c').subscheme
Instances For
The closed immersion Z ⟶ W of the fixed locus.
Equations
- c.fixedLocusι c' = (c.fixedLocusIdeal c').subschemeι
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
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
The immersion of the coincidence locus into the fixed locus Z.
Equations
Instances For
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
- c.graphPoint c' hpU hc hc' = CategoryTheory.Limits.pullback.lift (AlgebraicGeometry.specResidueFieldToOpens hpU) (AlgebraicGeometry.specResidueFieldToOpens hpU) ⋯