Separating function-field parameters on a dense affine chart
ProvedAlgebraicGeometry.exists_dense_affine_separating_function_field_parametersLet be a perfect field, let be an integral scheme locally of finite type over , and let be its function field with the -algebra structure induced by the structure morphism. There is a finite subset that is a transcendence basis and for which is a finite separable field extension.
There is a dense affine open on which every member of is represented by a regular function . These functions define a dominant -morphism
Its coordinate germs are exactly the chosen separating parameters. The finite set may be empty. This is the generic separating-parameter step used in constructing projections and curve fibrations for alteration arguments.
Formalization Note. The field is the stalk at the generic point of the actual scheme. The coefficient map is the map on sections induced by its structure morphism, and the displayed affine morphism is constructed from the polynomial evaluation homomorphism. Finiteness and separability are asserted for the function-field extension; compactification and smoothness of a projective fibration are further steps.
import Mathlib set_option autoImplicit false open AlgebraicGeometry CategoryTheory TopologicalSpace Opposite universe u
theorem AlgebraicGeometry.exists_dense_affine_separating_function_field_parameters
(K : Type u) [Field K] [PerfectField K]
{X : Scheme.{u}} [IsIntegral X] (π : X ⟶ Spec (.of K)) [LocallyOfFiniteType π] :
letI : Algebra K X.functionField :=
((Scheme.ΓSpecIso (.of K)).inv ≫ π.appTop ≫
X.presheaf.germ ⊤ (genericPoint X) trivial).hom.toAlgebra
∃ s : Finset X.functionField,
IsTranscendenceBasis K ((↑) : s → X.functionField) ∧
Module.Finite (IntermediateField.adjoin K (s : Set X.functionField)) X.functionField ∧
Algebra.IsSeparable (IntermediateField.adjoin K (s : Set X.functionField)) X.functionField ∧
∃ (U : X.Opens) (hU : IsAffineOpen U), Dense (U : Set X) ∧
∃ hne : Nonempty U, ∃ a : s → Γ(X, U),
(∀ t : s, @Scheme.germToFunctionField X _ U hne (a t) = t.val) ∧
∃ f : (U : Scheme) ⟶ Spec (.of (MvPolynomial s K)),
f = hU.isoSpec.hom ≫ Spec.map (CommRingCat.ofHom
(MvPolynomial.eval₂Hom
((Scheme.ΓSpecIso (.of K)).inv ≫ π.appLE ⊤ U (by simp)).hom a)) ∧
IsDominant f ∧
f ≫
Spec.map (CommRingCat.ofHom (MvPolynomial.C : K →+* MvPolynomial s K)) = U.ι ≫ π := by sorry