Theorems · Theorem · commutative algebra
MvPolynomial.mul_esymm_eq_sum
∀ (σ : Type u_1) [inst : Fintype σ] (R : Type u_2) [inst_1 : CommRing R] (k : ℕ),
↑k * MvPolynomial.esymm σ R k =
(-1) ^ (k + 1) *
∑ a ∈ Finset.HasAntidiagonal.antidiagonal k with a.1 < k,
(-1) ^ a.1 * MvPolynomial.esymm σ R a.1 * MvPolynomial.psum σ R a.2Newton's identities give a recurrence relation for the kth elementary symmetric polynomial in terms of lower degree elementary symmetric polynomials and power sums.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CommRingstatement and proof · cited by 17,173
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Finsuppstatement · cited by 5,255
- Finset.sumstatement and proof · cited by 5,195
- Finset.cardproof · cited by 2,327
- MvPolynomialstatement and proof · cited by 2,140
- add_commproof · cited by 1,535
- sub_eq_add_negproof · cited by 1,023
- Finset.filterstatement and proof · cited by 949
- pow_oneproof · cited by 894
- sub_eq_zeroproof · cited by 407
Cited by1
Results whose statement or proof uses this declaration.
- MvPolynomial.psum_eq_mul_esymm_sub_sumproof · cited by 0