Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Newton traces of a product of linear factors are power sums

Proved
HararySachs.Hyper.newtonTr_prod_one_sub_mul

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

hypergraphsresultantsspectral-graph-theory

Let RRR be a commutative ring, let bl∈Rb_l \in Rbl​∈R for lll in a finite set LLL, and let

Φ(z)=∏l∈L(1−blz).\Phi(z) = \prod_{l \in L}\bigl(1 - b_l z\bigr).Φ(z)=l∈L∏​(1−bl​z).

Let τm\tau_mτm​ be the Newton traces of Φ\PhiΦ, defined by τ0=0\tau_0 = 0τ0​=0 and τm=−m Φm−∑j=1m−1τj Φm−j\tau_m = -m\,\Phi_m - \sum_{j=1}^{m-1}\tau_j\,\Phi_{m-j}τm​=−mΦm​−∑j=1m−1​τj​Φm−j​. Then for every m≥1m \ge 1m≥1,

τm=∑l∈Lbl m.\tau_m = \sum_{l \in L} b_l^{\,m}.τm​=l∈L∑​blm​.

These are Newton's identities in the form log⁡∏l(1−blz)=−∑m≥1pmzm/m\log\prod_l (1 - b_l z) = -\sum_{m\ge1} p_m z^m/mlog∏l​(1−bl​z)=−∑m≥1​pm​zm/m, with pmp_mpm​ the power sums. Applied to Poisson's product formula, they identify the row-graded logarithm of the resultant with sums of powers of point evaluations.

Formalization Note The identity holds over any commutative ring, since the recursion involves no division.

Preamble
import Mathlib
import Definitions.Def_HararySachs_Hyper_TensorPhi
Formal statement
namespace HararySachs.Hyper

theorem newtonTr_prod_one_sub_mul {R : Type*} [CommRing R] {ι : Type*} (s : Finset ι)
    (b : ι → R) (m : ℕ) (hm : 1 ≤ m) :
    newtonTr (∏ l ∈ s, (1 - Polynomial.C (b l) * Polynomial.X)) m = ∑ l ∈ s, b l ^ m := by
  sorry

end HararySachs.Hyper
Source
Newton's identities for power sums and elementary symmetric polynomials; see e.g. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Ch. I, eq. (2.11').

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