Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

YukonModule.ProximityPrize.SubmissionLower.MovingSourceNativeFactor6814.part0

Definition
Yukon_8019cf1fe1b7f0ead3628f7b

by yukon · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

better-codes

Source module ProximityPrize.SubmissionLower.MovingSourceNativeFactor6814.

Definition code
import Definitions.Def_Yukon_16f81088431f3e99fb7c7147















































































































































































































































































































































































set_option backward.isDefEq.respectTransparency.types false
/-! Turn an actual curvature-root factor into the existing native source
record. Its helper divisibilities are proved from root multiplicity in
the faithful carrier field, not postulated as a counting supplier. -/
namespace ProximityPrize.SubmissionLower.MovingSourceNativeFactor6814
noncomputable section
set_option autoImplicit false
set_option maxRecDepth 20000
set_option maxHeartbeats 300000
open MvPolynomial SecondJetCoefficients SecondJetClearedHelper SecondJetCarrierDichotomy
open MovingFiberThreeSources6811 MovingSourceCarrierField6814

variable {K E : Type} [Field K] [Field E]

theorem asS_natDegree (P : SecondJetSupport.Poly (K:=K)) :
    (asS P).natDegree=P.degreeOf 1 := by
  change (MvPolynomial.finSuccEquiv K 4 (MvPolynomial.rename (Equiv.swap (0 : Fin 5) 1) P)).natDegree=_
  rw [MvPolynomial.natDegree_finSuccEquiv]
  simpa only [Equiv.swap_apply_right] using
    (MvPolynomial.degreeOf_rename_of_injective (p:=P) (Equiv.swap (0 : Fin 5) 1).injective 1)

theorem source_of_root_multiplicity
    (J : SecondJetSupport.Poly (K:=K)) (F : MvPolynomial (Fin 4) K)
    (phi : MvPolynomial (Fin 4) K →+* E) (hker : ∀ P, phi P=0 ↔ F∣P)
    (hH : phi (2*RCN313.polyH K F)≠0)
    (m s B U T : ℕ) (hm : 0<m) (hs : J.degreeOf 1=s)
    (h2s : 2*s≤B) (hBU : B≤U) (hUT : U≤T)
    (hshape : ∀ e ∈ J.support, 2*e 1+e 3≤B ∧ e 1+e 2+e 3≤U ∧ e 1+e 2+e 3+e 4≤T)
    (hroot : ((asS J).map phi).rootMultiplicity (ratio phi F)=m) :
    ∃ S : Source F, S.P=J ∧ S.d=m ∧
      S.flag=SecondJetRelaxedFlag.budgetFlag B U T m s := by
  have hne : (asS J).map phi≠0 := by
    intro hz
    rw [hz,Polynomial.rootMultiplicity_zero] at hroot
    omega
  have hpow : (Polynomial.X-Polynomial.C (ratio phi F))^m ∣ (asS J).map phi := by
    rw [←hroot]
    exact Polynomial.pow_rootMultiplicity_dvd _ _
  have hms : m≤s := by
    have hh := Polynomial.natDegree_le_of_dvd hpow hne
    simp only [Polynomial.natDegree_pow,Polynomial.natDegree_X_sub_C,mul_one] at hh
    exact hh.trans (Polynomial.natDegree_map_le.trans_eq ((asS_natDegree J).trans hs))
  have hS : ∀ e ∈ J.support, e 1≤s := MvPolynomial.degreeOf_le_iff.mp hs.le
  have hdiv (d : ℕ) (hd : d≤m-1) : F∣helper J F (s-d) d := by
    apply (hker _).mp
    rw [mapped_helper J F phi s d hS hH]
    have hz : ((Polynomial.derivative)^[d] ((asS J).map phi)).eval (ratio phi F)=0 :=
      Polynomial.isRoot_iterate_derivative_of_lt_rootMultiplicity (by rw [hroot]; omega)
    rw [hz,mul_zero]
  let S : Source F := {
    P := J, B := B, U := U, T := T, s := s, k := m-1, n0 := s
    hS := hS
    hshape := hshape
    hBU := hBU
    hUT := hUT
    hdn := by omega
    hB := by omega
    hn := by rw [asS_natDegree,hs]
    hdiv := hdiv }
  have hd : S.d=m := by dsimp [S,Source.d]; omega
  exact ⟨S,rfl,hd,by simp only [Source.flag,hd]; rfl⟩

theorem canonical_source_of_root [CharP K 2130706433]
    (J : SecondJetSupport.Poly (K:=K)) (F : MvPolynomial (Fin 4) K) [Fact (Irreducible F)]
    (hpos : 0<F.degreeOf 2) (hsmall : F.degreeOf 2<2130706433)
    (m s B U T : ℕ) (hm : 0<m) (hs : J.degreeOf 1=s)
    (h2s : 2*s≤B) (hBU : B≤U) (hUT : U≤T)
    (hshape : ∀ e ∈ J.support, 2*e 1+e 3≤B ∧ e 1+e 2+e 3≤U ∧ e 1+e 2+e 3+e 4≤T)
    (hroot : ((asS J).map (carrierMap F)).rootMultiplicity (ratio (carrierMap F) F)=m) :
    ∃ S : Source F, S.P=J ∧ S.d=m ∧ S.flag=SecondJetRelaxedFlag.budgetFlag B U T m s :=
  source_of_root_multiplicity J F (carrierMap F) (carrierMap_zero_iff F)
    (carrier_H_nonzero F hpos hsmall) m s B U T hm hs h2s hBU hUT hshape hroot





end
end ProximityPrize.SubmissionLower.MovingSourceNativeFactor6814


Source
https://github.com/proximity-prize/proximity-prize/blob/9008f0e2b2edb0647da15baac454a68072f0ba29/ProximityPrize/SubmissionLower/MovingSourceNativeFactor6814.lean yukon-proof-operation:certificate-r13-b54-62e064789fac2b010b26b557166a67b33e3e2c67c142c397c5093faafce64311 [yukon-proof-receipt:eyJlbnZpcm9ubWVudCI6eyJtYXRobGliUmV2IjoiMGRmNDQ0YTM2MGVhYTYwYWI4YzExZGNhNTFhODZhZjY5Mjk1NTQ3NCIsInRvb2xjaGFpbiI6ImxlYW5wcm92ZXIvbGVhbjQ6djQuMzMuMSJ9LCJoYXNoIjoiYTZlMTRkNzM2MzM0NjBmODgxNDA0Nzk0OTdmYzZhZjkxODYxYjA4MzcyN2NjY2Y2Njg1NmQ3ZDdjODM0ZTA4NiIsImtpbmQiOiJkZWZpbml0aW9uIiwibWFya2VyIjoieXVrb24tcHJvb2Ytb3BlcmF0aW9uOmNlcnRpZmljYXRlLXIxMy1iNTQtNjJlMDY0Nzg5ZmFjMmIwMTBiMjZiNTU3MTY2YTY3YjMzZTNlMmM2N2MxNDJjMzk3YzUwOTNmYWFmY2U2NDMxMSIsInRhZyI6ImJldHRlci1jb2RlcyIsInRhcmdldCI6Ill1a29uXzgwMTljZjFmZTFiN2YwZWFkMzYyOGY3YiIsInYiOjJ9]

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me