[Merged by Bors] - feat(RingTheory/Polynomial/HilbertPoly): the definition and key property of Polynomial.hilbertPoly p d for p : F[X] and d : ℕ, where F is a field.#19303
Conversation
PR summary fe4cf0e8c1Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
d and a polynomial p : ℤ[X]d and a polynomial p : ℤ[X]
d and a polynomial p : ℤ[X]d and a polynomial p : ℤ[X]
d and a polynomial p : ℤ[X]d and a polynomial p : F[X], where F is a field with characteristic 0.
d and a polynomial p : F[X], where F is a field with characteristic 0.Polynomial.hilbert p d for a natural number d and a polynomial p : F[X].
Polynomial.hilbert p d for a natural number d and a polynomial p : F[X].Polynomial.hilbert p d for a natural number d and a polynomial p : F[X], where F is a field.
Polynomial.hilbert p d for a natural number d and a polynomial p : F[X], where F is a field.Polynomial.hilbert p d, where F is a field, p : F[X] and d : ℕ.
|
Thanks a lot for your work on this! maintainer merge |
|
🚀 Pull request has been placed on the maintainer queue by kbuzzard. |
Polynomial.hilbert p d for p : F[X] and d : ℕ, where F is a field.RatFunc.Polynomial.hilbert p d for p : F[X] and d : ℕ, where F is a field.
|
✌️ FMLJohn can now approve this pull request. To approve and merge a pull request, simply reply with |
RatFunc.Polynomial.hilbert p d for p : F[X] and d : ℕ, where F is a field.Polynomial.hilbertPoly p d for p : F[X] and d : ℕ, where F is a field.
Polynomial.hilbertPoly p d for p : F[X] and d : ℕ, where F is a field.Polynomial.hilbertPoly p d for p : F[X] and d : ℕ, where F is a field.
|
bors r+ |
…rty of `Polynomial.hilbertPoly p d` for `p : F[X]` and `d : ℕ`, where `F` is a field. (#19303) Given any field `F`, polynomial `p : F[X]` and natural number `d`, we have defined `Polynomial.hilbertPoly p d : F[X]`. If `F` is of characteristic zero, then for any large enough `n : ℕ`, `PowerSeries.coeff F n (p * (invOneSubPow F d))` equals `(hilbertPoly p d).eval (n : F)` (see `Polynomial.coeff_mul_invOneSubPow_eq_hilbertPoly_eval`).
|
Pull request successfully merged into master. Build succeeded: |
Polynomial.hilbertPoly p d for p : F[X] and d : ℕ, where F is a field.Polynomial.hilbertPoly p d for p : F[X] and d : ℕ, where F is a field.
Given any field
F, polynomialp : F[X]and natural numberd, we have definedPolynomial.hilbertPoly p d : F[X]. IfFis of characteristic zero, then for any large enoughn : ℕ,PowerSeries.coeff F n (p * (invOneSubPow F d))equals(hilbertPoly p d).eval (n : F)(seePolynomial.coeff_mul_invOneSubPow_eq_hilbertPoly_eval).