Zulip Chat Archive
Stream: Is there code for X?
Topic: multiplicity of derivative
Eric Rodriguez (Mar 19 2022 at 01:38):
for p : ℝ[X]
, do we have anything like p.derivative.root_multiplicity t = p.root_multiplicity t - 1
? (for t
a root, of course)
Reid Barton (Mar 19 2022 at 10:49):
isn't it also true for t
not a root? :upside_down:
Damiano Testa (Mar 19 2022 at 11:10):
(Most of the times, at least! :wink: )
Eric Rodriguez (Mar 19 2022 at 11:34):
if t
isn't a root but it is a critical point it doesn't hold sadly
Reid Barton (Mar 19 2022 at 11:41):
oh
Damiano Testa (Mar 19 2022 at 11:59):
Actually, one inequality always holds, right? p.root_multiplicity t - 1 ≤ p.derivative.root_multiplicity t
, I think.
Damiano Testa (Mar 19 2022 at 12:31):
I'm never sure whether I like it or not when Lean's -
seems to have better lemmas than the "correct" !
Eric Rodriguez (Mar 19 2022 at 12:33):
∀ n : ℕ, -1 ≤ n
so we're all clear good ;b (e: idioms...)
Damiano Testa (Mar 19 2022 at 12:37):
Very clear! What I haven't really accepted is that in Lean, the inequality is sometimes realized as an equality.
Eric Rodriguez (Mar 20 2022 at 15:41):
Eric Rodriguez said:
for
p : ℝ[X]
, do we have anything likep.derivative.root_multiplicity t = p.root_multiplicity t - 1
? (fort
a root, of course)
"fun" fact - this doesn't hold even for fields, and I should've known it from flt-regular! X^p - 1 = (X - 1)^p
has multiplicity p
in zmod p
, but its derivative pX^(n-1) = 0
has multiplicity zero
Eric Rodriguez (Mar 20 2022 at 15:41):
i'm just going to stick a char-zero assumption and be done with it...
Eric Rodriguez (Mar 21 2022 at 11:57):
Last updated: Dec 20 2023 at 11:08 UTC