Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Macaulay's determinant: a multiple of the resultant restricting to tMt^MtM, M≤∏j≠iDjM\le\prod_{j\ne i}D_jM≤∏j=i​Dj​, on the diagonal line

Proved
MvResultant.exists_macaulay

by milia · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrycommutative-algebraresultants

Let n≥1n\ge1n≥1 and D1,…,Dn≥1D_1,\dots,D_n\ge1D1​,…,Dn​≥1. Consider nnn homogeneous forms Fj=∑∣α∣=Djuj,αxαF_j=\sum_{|\alpha|=D_j}u_{j,\alpha}x^\alphaFj​=∑∣α∣=Dj​​uj,α​xα in nnn variables with indeterminate coefficients uj,αu_{j,\alpha}uj,α​. Fix i∈[n]i\in[n]i∈[n].

Statement. There is a polynomial Q∈C[uj,α]Q\in\mathbb{C}[u_{j,\alpha}]Q∈C[uj,α​] with two properties:

  1. QQQ vanishes at the coefficient vector of every system (F1,…,Fn)(F_1,\dots,F_n)(F1​,…,Fn​) that has a common nonzero zero in Cn\mathbb{C}^nCn;
  2. on the diagonal line (x1D1,…,t xiDi,…,xnDn)\big(x_1^{D_1},\dots,t\,x_i^{D_i},\dots,x_n^{D_n}\big)(x1D1​​,…,txiDi​​,…,xnDn​​), QQQ restricts to tMt^{M}tM for some M≤∏j≠iDjM\le\prod_{j\ne i}D_jM≤∏j=i​Dj​.

The intended witness is Macaulay's determinant. Put D=∑j(Dj−1)+1D=\sum_j(D_j-1)+1D=∑j​(Dj​−1)+1, and index rows and columns by the monomials xβx^\betaxβ of degree DDD:

  • each row monomial xβx^\betaxβ is assigned to the first form FjF_jFj​ with xjDj∣xβx_j^{D_j}\mid x^\betaxjDj​​∣xβ, scanning the indices j≠ij\ne ij=i first and taking j=ij=ij=i last;
  • the row lists the coefficients of (xβ/xjDj) Fj(x^\beta/x_j^{D_j})\,F_j(xβ/xjDj​​)Fj​.

The two properties then hold as follows:

  • Vanishing: if p≠0p\ne0p=0 is a common zero, the vector (pγ)γ(p^\gamma)_\gamma(pγ)γ​ is a nonzero kernel vector, so det⁡=0\det=0det=0.
  • Restriction: on the diagonal line the matrix is diagonal, with entry ttt on the rows assigned to FiF_iFi​ and 111 elsewhere. Those rows are the monomials with βj<Dj\beta_j<D_jβj​<Dj​ for all j≠ij\neq ij=i, and there are at most ∏j≠iDj\prod_{j\ne i}D_j∏j=i​Dj​ of them.

Combined with divisibility from the Nullstellensatz, this bounds the block degree of the resultant: MvResultant.blockDegree_le.

Preamble
import Mathlib
import Definitions.Def_HararySachs_Hyper_CharPoly

open HararySachs.Hyper
Formal statement
namespace MvResultant

theorem exists_macaulay {n : ℕ} {D : Fin n → ℕ} (hD : ∀ j, 1 ≤ D j) (i : Fin n) :
    ∃ Q : MvPolynomial (ResVar n D) ℂ,
      (∀ F : Fin n → MvPolynomial (Fin n) ℂ, (∀ j, (F j).IsHomogeneous (D j)) →
        (∃ x : Fin n → ℂ, x ≠ 0 ∧ ∀ j, MvPolynomial.eval x (F j) = 0) →
        MvPolynomial.aeval (fun v : ResVar n D => MvPolynomial.coeff v.2.1 (F v.1)) Q = 0) ∧
      ∃ M ≤ ∏ j ∈ Finset.univ.erase i, D j,
        MvPolynomial.aeval (fun v : ResVar n D =>
          if v.2.1 = Finsupp.single v.1 (D v.1) then
            (if v.1 = i then (Polynomial.X : Polynomial ℂ) else 1) else 0) Q =
          Polynomial.X ^ M := by sorry

end MvResultant
Source
F. S. Macaulay, Some formulae in elimination, Proc. London Math. Soc. 35 (1902) 3–27; Cox–Little–O'Shea, Using Algebraic Geometry, Ch. 3 §4 (Macaulay's formula); Gelfand–Kapranov–Zelevinsky, Ch. 13.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me