Lemma 2.6(3) — variable scaling
ProvedResultantVNP.lemma_2_6_3algebraic-complexityp2o-gran-per-chapterp2o-plan-paperp2o-v1resultantsvnp
Let and let be homogeneous forms of degrees . For every complex matrix , writing for with replaced by ,
Differences from the source:
- encoding: the multivariate resultant Res, the unique integral polynomial with the three properties of Definition 2.1 (existence and uniqueness cited from [GKZ94]) → an arbitrary ResultantSystem 𝓡 (integral polynomials satisfying the three properties for n ≥ 1 and positive degrees), quantified universally; reason: existence is cited, not proved in the paper; by uniqueness every resultant system is the resultant on every admissible degree vector, so the statement is the paper's
- encoding: standing assumptions of Definition 2.1 (positive integer degrees, n forms in n variables) → hypotheses n ≥ 1 and positive degrees d_i; reason: Definition 2.1 assumes them; the resultant is undefined otherwise (no resultant exists for n = 0)
- encoding: Res(f₁, …, fₙ) of homogeneous forms → resOf 𝓡 d f: Res_d evaluated at the coefficients [x^e] f_i, |e| = d_i, with each f_i assumed homogeneous of degree d_i; reason: the notation of Definition 2.1 (evaluation at the coefficients of the forms)
- encoding: indices [n] = {1, …, n} → Fin n (0-based); reason: Lean convention; same instances
Preamble
import Mathlib import Definitions.Def_ResultantVNP_resOf
Formal statement
namespace ResultantVNP
/-- **Lemma 2.6(3) (Variable scaling).** Let `f₁, …, fₙ` be homogeneous forms of degrees `d₁, …, dₙ`.
For every `n × n` matrix `Q`, `Res(f₁(Qx), …, fₙ(Qx)) = (det Q)^{∏_j d_j} Res(f₁, …, fₙ)`.
Bhargav–Curticapean–Jindal–Shukla, *Multivariate Resultants: Complexity and Applications to Real Feasibility*, STOC 2027 submission manuscript (sha256 8827709b…7f8271), Lemma 2.6(3), p.12.
**Formalization Note** The resultant is taken from an arbitrary `ResultantSystem` `𝓡`; by the uniqueness in Definition 2.1 it is the multivariate resultant wherever the paper uses it. `f_i(Qx)` substitutes `x_k ↦ ∑_j Q_{kj} x_j`. `n ≥ 1`, degrees positive. -/
theorem lemma_2_6_3 (𝓡 : ResultantSystem) {n : ℕ} (hn : 1 ≤ n) (d : Fin n → ℕ)
(hd : ∀ i, 0 < d i) (f : Fin n → MvPolynomial (Fin n) ℂ) (hf : ∀ i, (f i).IsHomogeneous (d i))
(Q : Matrix (Fin n) (Fin n) ℂ) :
resOf 𝓡 d (fun i => MvPolynomial.aeval
(fun k => ∑ j, MvPolynomial.C (Q k j) * MvPolynomial.X j) (f i)) =
Q.det ^ (∏ j, d j) * resOf 𝓡 d f := by sorry
end ResultantVNP
Source
Bhargav–Curticapean–Jindal–Shukla, Multivariate Resultants: Complexity and Applications to Real Feasibility, STOC 2027 submission (manuscript sha256 8827709b…7f8271), Lemma 2.6(3), p.12
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.