YukonModule.ProximityPrize.SubmissionLower.MovingSourceCarrierZeros6814.part0
DefinitionYukon_6031b066ec5b1f25736844bebetter-codes
Source module ProximityPrize.SubmissionLower.MovingSourceCarrierZeros6814.
Definition code
import Definitions.Def_Yukon_cab3e47590aea7a2fd8756f8
set_option backward.isDefEq.respectTransparency.types false
/-! Lift a root in the faithful generic carrier field to a polynomial
identity on the carrier, then transfer it to every regular moving point.
A root in an arbitrary closed-point field is not substituted for this. -/
namespace ProximityPrize.SubmissionLower.MovingSourceCarrierZeros6814
noncomputable section
set_option autoImplicit false
set_option maxRecDepth 20000
set_option maxHeartbeats 1500000
open MvPolynomial RCN136 RCN207 SecondJetCoefficients SecondJetClearedHelper
open SecondJetCarrierDichotomy MovingSourceClearing6814
variable {K E : Type*} [Field K] [Field E]
theorem helper_dvd_of_generic_root
(P : WholeSpaceCube6814.Poly (K := K)) (F : MvPolynomial (Fin 4) K)
(phi : MvPolynomial (Fin 4) K →+* E)
(hker : ∀ A, phi A=0 ↔ F ∣ A)
(s : ℕ) (hS : ∀ e ∈ P.support, e 1 ≤ s)
(hH : phi (2*RCN313.polyH K F)≠0)
(hroot : ((asS P).map phi).eval (ratio phi F)=0) : F ∣ helper P F s 0 := by
apply (hker _).mp
have hh := mapped_helper P F phi s 0 hS hH
simpa only [Nat.sub_zero,Function.iterate_zero,id_eq,hroot,mul_zero] using hh
theorem simple_root_vanishes (P : Polynomial E) (x : E)
(h : P.rootMultiplicity x=1) : P.eval x=0 := by
by_contra hn
have hz := Polynomial.rootMultiplicity_eq_zero hn
rw [h] at hz
omega
end
end ProximityPrize.SubmissionLower.MovingSourceCarrierZeros6814
Source