Documentation

LeanPool.CCDN.Projection.BoundedClosureElimination

A bounded elimination step whose affine projection and projective closure projection are both integral. The latter map fixes X₀.

theorem CCDN.exists_fin_integer_closure_elimination_step {n m : ℕ} (I : Ideal (MvPolynomial (Fin (n + 1)) ℚ)) [I.IsPrime] (d : ℕ) (hdimdeg : HasProjectiveDimensionDegree I m d) (hcodim : m < n) :
∃ (c : Fin n → Fin (n + 1) → ℤ) (e : ℕ), (∀ (i : Fin n) (j : Fin (n + 1)), |c i j| ≤ ↑d + 1) ∧ 0 < e ∧ e ≤ d ∧ have a := fun (i : Fin n) => integerLinearForm (c i); have ψ := projectionCoordinateMap I a; ψ.IsIntegral ∧ (RingHom.ker ψ).IsPrime ∧ HasProjectiveDimensionDegree (RingHom.ker ψ) m e ∧ (projectionCoordinateMap (projectiveClosureIdeal I) (closureProjectionCoordinates a)).IsIntegral

One step of bounded linear elimination: for a prime ideal I in n + 1 variables of projective dimension m < n and degree d, there are integer linear forms in n coordinates with coefficients of absolute value at most d + 1 whose projection is integral, with prime kernel of projective dimension m and some degree e with 0 < e ≤ d, and such that the associated projection of the projective closure of I is integral as well.