Lemma 3.1 — concrete zero-degree counterexample
ProvedPhilipponMultiplicity.lemma_3_1_zero_degree_counterexampleCompiled open theorem statement; proof not yet supplied. Checked locally with Lean 4.33.1 and the proposal’s pinned Mathlib. An independent blind readback is attached.
In complex P²×P¹ take I=(Y₁X₁,Y₁X₂), P=Y₀ of bidegree (0,1). Require the actual quotient regularity, primary intersection and Hilbert polynomials, showing both printed equalities fail without the positive-degree convention.
/- Concrete open counterexample to the unrestricted-zero-degree reading of printed Lemma 3.1. Every ideal, polynomial and degree is explicitly fixed. This is separate from the corrected positive-degree source theorem. -/ import Definitions.Def_PhilipponMultiplicity_SectionThree set_option autoImplicit false open scoped BigOperators
namespace PhilipponMultiplicity
open SectionThree
theorem lemma_3_1_zero_degree_counterexample :
let M := ZeroDegreeBoundary.ambient
let I := ZeroDegreeBoundary.ideal
let P := ZeroDegreeBoundary.polynomial
let D := ZeroDegreeBoundary.equationDegrees
let J := I ⊔ Ideal.span {P}
I = Ideal.span {ZeroDegreeBoundary.secondCoordinate 1} ⊓
Ideal.span {ZeroDegreeBoundary.firstCoordinate 1, ZeroDegreeBoundary.firstCoordinate 2} ∧
IsMultihomogeneousIdeal M I ∧ IsNontrivialIdeal M I ∧
M.IsHomogeneous P D ∧ IsRegular (Ideal.Quotient.mk I P) ∧
idealDimension M I = 2 ∧
Hilbert.hilbertPolynomial ℂ M.factorCount M.ambientDimension I =
ZeroDegreeBoundary.expectedHilbertPolynomial ∧
Hilbert.hilbertPolynomial ℂ M.factorCount M.ambientDimension J = 1 ∧
(∀ d : M.FactorIndex → ℕ, idealDegreeValue M I d = (d (0 : Fin 2) : ℚ) ^ 2) ∧
(∀ d : M.FactorIndex → ℕ, idealDegreeValue M J d = 1) ∧
hypersurfaceCoefficientSum M I D (fun _ => 1) = 0 ∧
idealDegreeValue M J (fun _ => 1) ≠ hypersurfaceCoefficientSum M I D (fun _ => 1) ∧
idealDegreeValue M J D ≠ idealDegreeValue M I D := by sorry
end PhilipponMultiplicityRead-back
What the Lean code literally says, in plain math · gpt-6
There are no variable field, ideal, polynomial, or degree-vector hypotheses in this assertion: work in the fixed ambient space with coordinate ring , let , , , and . For every ideal , write for the rational polynomial chosen to agree, for all coordinatewise sufficiently large natural multidegrees , with the -dimension of the image in of the polynomials of block multidegree ; if no such polynomial exists, set . Put , with the total degree of the zero polynomial taken to be , and , where is its part of total degree and natural entries of are evaluated in . Thus when , including the zero-fallback case, whereas a nonzero constant Hilbert polynomial gives a constant degree value. Multihomogeneity here refers to the separate - and -blocks, and an ideal is multihomogeneous if each block-multihomogeneous component of every one of its elements again belongs to it. With , the theorem asserts all of the following simultaneously: ; is multihomogeneous; ; is multihomogeneous of degree ; multiplication by its residue class on is injective; ; ; ; for every natural vector , including vectors with zero entries, and . It further asserts , , and , where and for those top-degree indices. Subtraction in is truncated natural subtraction, division by zero in the definition of is assigned zero, and zero to the zeroth power is one; the asserted use of is at the strictly positive vector . In particular the last inequalities compare with in each case, and the constant Hilbert polynomial of has total degree zero and degree value even at .