Theorems · Theorem · commutative algebra
MvPolynomial.psum_eq_mul_esymm_sub_sum
∀ (σ : Type u_1) [inst : Fintype σ] (R : Type u_2) [inst_1 : CommRing R] (k : ℕ),
0 < k →
MvPolynomial.psum σ R k =
(-1) ^ (k + 1) * ↑k * MvPolynomial.esymm σ R k -
∑ a ∈ Finset.HasAntidiagonal.antidiagonal k with a.1 ∈ Set.Ioo 0 k,
(-1) ^ a.1 * MvPolynomial.esymm σ R a.1 * MvPolynomial.psum σ R a.2A version of Newton's identities which may be more useful in the case that we know the values of the elementary symmetric polynomials and would like to calculate the values of the power sums.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites34
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- CommRingstatement and proof · cited by 17,173
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.ofPredproof · cited by 6,101
- Finsuppstatement · cited by 5,255
- Finset.sumstatement and proof · cited by 5,195
- Monoidproof · cited by 3,887
- mul_oneproof · cited by 3,885
- one_mulproof · cited by 2,841
- zero_addproof · cited by 2,366
- Finset.sum_congrproof · cited by 2,323
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.