math / data /lean /OAI /NumberTheory /PowerFree /QuarticComponents.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
18.2 kB
import OAI.NumberTheory.PowerFree.QuarticSurfaces
namespace OAI
namespace QuarticPowerFree
section
open scoped BigOperators
def quarticA (j : Fin 100) : β„• := 101+j.val
def quarticB (j : Fin 100) : β„• := 200-2*j.val
def quarticNumerator (j : Fin 100) (h : β„•) : β„• :=
if j.val < 60 then if h ≀ 2 then 206 else if h=3 then 200 else 191
else if h=1 then 252 else if h=2 then 206 else 175
noncomputable def quarticEnvelope (j : Fin 100) (h : β„•) : ℝ := quarticNumerator j h/1000
noncomputable def quarticU (j : Fin 100) : ℝ := quarticA j/400
noncomputable def quarticV (j : Fin 100) : ℝ := quarticB j/400
noncomputable def quarticStage (j : Fin 100) (i : Fin 5) : ℝ := quarticEnvelope j (5-i.val)
noncomputable def quarticIncrement (j : Fin 100) (i : Fin 5) : ℝ :=
if i.val=0 then quarticStage j i else quarticStage j i-quarticEnvelope j (6-i.val)
lemma quarticA_pos (j : Fin 100) : 0 < quarticA j := by dsimp [quarticA]; omega
lemma quarticB_pos (j : Fin 100) : 0 < quarticB j := by have := j.isLt; dsimp [quarticB]; omega
lemma quarticU_pos (j : Fin 100) : 0 < quarticU j := by dsimp [quarticU]; exact div_pos (Nat.cast_pos.mpr (quarticA_pos j)) (by norm_num)
lemma quarticV_pos (j : Fin 100) : 0 < quarticV j := by dsimp [quarticV]; exact div_pos (Nat.cast_pos.mpr (quarticB_pos j)) (by norm_num)
lemma quarticEnvelope_pos (j : Fin 100) (h : β„•) : 0 < quarticEnvelope j h := by
unfold quarticEnvelope quarticNumerator; split_ifs <;> norm_num
lemma quarticU_le (j : Fin 100) : quarticU j ≀ 1/2 := by
have : quarticA j ≀ 200 := by have := j.isLt; dsimp [quarticA]; omega
dsimp [quarticU]; have : (quarticA j:ℝ) ≀ 200 := by exact_mod_cast this
linarith
lemma quarticV_le (j : Fin 100) : quarticV j ≀ 1/2 := by
have : quarticB j ≀ 200 := by dsimp [quarticB]; omega
dsimp [quarticV]; have : (quarticB j:ℝ) ≀ 200 := by exact_mod_cast this
linarith
lemma quartic_full_nat : βˆ€ j : Fin 100,
(quarticA j)^4*(quarticB j)^4*1000^5 ≀
(2*quarticA j+quarticB j)^3*400^5*(quarticNumerator j 5)^5 := by decide
lemma quartic_generic_nat : βˆ€ (j : Fin 100) (h : Fin 2),
(quarticA j)^(h.val+3)*(quarticB j)^(h.val+3)*1000^(h.val+3) ≀
min (quarticA j) (quarticB j)*(2*quarticA j+quarticB j)^(h.val+2)*400^(h.val+3)*(quarticNumerator j (h.val+3))^(h.val+3) := by decide
lemma quartic_affine_nat : βˆ€ j : Fin 100,
(quarticA j)^2*(quarticB j)^2*1000^2 ≀
min (2*quarticA j) (quarticB j)*(2*quarticA j+quarticB j)*400^2*(quarticNumerator j 2)^2 := by decide
lemma quartic_pole_nat : βˆ€ j : Fin 100,
quarticA j*(quarticB j)^2*1000^2 ≀
(quarticB j+4*quarticA j)*400^2*(quarticNumerator j 2)^2 := by decide
lemma quartic_increment_nonneg (j : Fin 100) (i : Fin 5) : 0 ≀ quarticIncrement j i := by
by_cases hj : j.val < 60 <;> fin_cases i <;>
norm_num [quarticIncrement,quarticStage,quarticEnvelope,quarticNumerator,hj]
lemma quartic_prefix (j : Fin 100) (i : Fin 5) :
quarticStage j i ≀ βˆ‘ l ∈ Finset.univ.filter (fun l : Fin 5 => l.val ≀ i.val), quarticIncrement j l := by
by_cases hj : j.val < 60 <;> fin_cases i <;>
norm_num [quarticIncrement,quarticStage,quarticEnvelope,quarticNumerator,hj,Fin.sum_univ_succ,Finset.sum_filter]
lemma quartic_sum (j : Fin 100) :
(βˆ‘ i : Fin 5, ((5-i.val:β„•):ℝ)*quarticIncrement j i)+1/1000 ≀ 997/1000 := by
by_cases hj : j.val < 60 <;>
norm_num [quarticIncrement,quarticStage,quarticEnvelope,quarticNumerator,hj,Fin.sum_univ_succ]
lemma quartic_generic_rat : βˆ€ (j : Fin 100) (h : Fin 2),
(1:β„š)/((h.val+3).factorial*((quarticNumerator j (h.val+3):β„š)/1000)^(h.val+3)) ≀
min (quarticA j) (quarticB j)*(2*quarticA j+quarticB j:β„•)^(h.val+2)*400^(h.val+3)/
((h.val+3).factorial*(quarticA j:β„š)^(h.val+3)*(quarticB j:β„š)^(h.val+3)) := by decide +kernel
lemma quartic_full_rat : βˆ€ j : Fin 100,
(1:β„š)/(120*((quarticNumerator j 5:β„š)/1000)^5) ≀
(2*quarticA j+quarticB j:β„•)^3*400^5/(120*(quarticA j:β„š)^4*(quarticB j:β„š)^4) := by decide +kernel
lemma quartic_affine_rat : βˆ€ j : Fin 100,
(1:β„š)/(2*((quarticNumerator j 2:β„š)/1000)^2) ≀
min (2*quarticA j) (quarticB j)*(2*quarticA j+quarticB j:β„•)*400^2/(2*(quarticA j:β„š)^2*(quarticB j:β„š)^2) := by decide +kernel
lemma quartic_pole_rat : βˆ€ j : Fin 100,
(1:β„š)/(2*((quarticNumerator j 2:β„š)/1000)^2) ≀
((quarticB j:β„š)/400+4*((quarticA j:β„š)/400))/(2*((quarticA j:β„š)/400)*((quarticB j:β„š)/400)^2) := by decide +kernel
lemma quartic_curve_rat : βˆ€ j : Fin 100,
(1:β„š)/((quarticNumerator j 1:β„š)/1000) ≀
min (2/((quarticA j:β„š)/400)) (max (1/((quarticA j:β„š)/400)) (3/((quarticB j:β„š)/400))) := by decide +kernel
lemma quartic_generic_threshold (j : Fin 100) (h : β„•) (hh : 3 ≀ h) (hh' : h ≀ 4) :
1/((h.factorial:ℝ)*(quarticEnvelope j h)^h) ≀
((min (quarticA j) (quarticB j):β„•):ℝ)*(2*quarticA j+quarticB j:β„•)^(h-1)*400^h/
((h.factorial:ℝ)*(quarticA j:ℝ)^h*(quarticB j:ℝ)^h) := by
have hb := quartic_generic_rat j ⟨h-3,by omega⟩
have he : h-3+3=h := by omega
have he' : h-3+2=h-1 := by omega
dsimp only at hb
rw [he,he'] at hb
dsimp only [quarticEnvelope]
have hb' := (Rat.cast_le (K := ℝ)).mpr hb
push_cast at hb'
simpa only [Nat.cast_min, Nat.cast_add, Nat.cast_mul, Nat.cast_ofNat] using hb'
lemma quartic_full_threshold (j : Fin 100) :
1/(((5:β„•).factorial:ℝ)*(quarticEnvelope j 5)^5) ≀
(2*quarticA j+quarticB j:β„•)^3*(400:ℝ)^5/(((5:β„•).factorial:ℝ)*(quarticA j:ℝ)^4*(quarticB j:ℝ)^4) := by
norm_num only [Nat.factorial]
dsimp only [quarticEnvelope]
have hb := (Rat.cast_le (K := ℝ)).mpr (quartic_full_rat j)
push_cast at hb
norm_num only [Nat.cast_add, Nat.cast_mul, Nat.cast_ofNat] at hb ⊒
exact hb
lemma quartic_affine_threshold (j : Fin 100) :
1/(2*(quarticEnvelope j 2)^2) ≀
((min (2*quarticA j) (quarticB j):β„•):ℝ)*(2*quarticA j+quarticB j:β„•)*(400:ℝ)^2/
(2*(quarticA j:ℝ)^2*(quarticB j:ℝ)^2) := by
dsimp only [quarticEnvelope]
have hb := (Rat.cast_le (K := ℝ)).mpr (quartic_affine_rat j)
push_cast at hb
simpa only [Nat.cast_min, Nat.cast_add, Nat.cast_mul, Nat.cast_ofNat] using hb
lemma quartic_pole_threshold (j : Fin 100) :
1/(2*(quarticEnvelope j 2)^2) ≀
(quarticV j+4*quarticU j)/(2*quarticU j*(quarticV j)^2) := by
dsimp only [quarticEnvelope,quarticU,quarticV]
have hb := (Rat.cast_le (K := ℝ)).mpr (quartic_pole_rat j)
push_cast at hb
exact hb
lemma quartic_curve_threshold (j : Fin 100) :
1/quarticEnvelope j 1 ≀ min (2/quarticU j) (max (1/quarticU j) (3/quarticV j)) := by
dsimp only [quarticEnvelope,quarticU,quarticV]
have hb := (Rat.cast_le (K := ℝ)).mpr (quartic_curve_rat j)
push_cast at hb
exact hb
end
open MvPolynomial
theorem quartic_generic_threshold_uniform {n h : β„•} (j : Fin 100)
(hh : 3 ≀ h) (hh' : h ≀ 4) (E D : β„•) (hD : 0 < D) :
βˆƒ C : ℝ, 0 ≀ C ∧
βˆ€ (I : Ideal (MvPolynomial (Fin n) β„‚)) [I.IsPrime]
(a b : Fin 4 β†’ MvPolynomial (Fin n) β„‚) (q : MvPolynomial (Fin n) β„‚)
(ΞΈ : Fin 4 β†’ β„‚), Function.Injective ΞΈ β†’
(βˆ€ i, Ideal.Quotient.mk I (a i) β‰  0) β†’
(βˆ€ i, Ideal.Quotient.mk I (a i)^2*Ideal.Quotient.mk I (b i) =
Ideal.Quotient.mk I q-algebraMap β„‚ _ (ΞΈ i)) β†’
Algebra.adjoin β„‚ (Set.range a βˆͺ Set.range b) = ⊀ β†’
Transcendental β„‚ (Ideal.Quotient.mk I q) β†’ affineDimension I = h β†’ affineDegree I ≀ E β†’
(βˆ€ i, (a i).totalDegree ≀ D) β†’ q.totalDegree ≀ D β†’
βˆ€ (w : Fin n β†’ β„•), (βˆ€ i, w i β‰  0) β†’
(βˆ€ i, a i ∈ weightedSpace w (quarticA j)) β†’ (βˆ€ i, b i ∈ weightedSpace w (quarticB j)) β†’
βˆ€ (Ο‰ : Fin n β†’ ℝ), (βˆ€ i, 0 < Ο‰ i) β†’ (βˆ€ i, (w i:ℝ) = 400*Ο‰ i) β†’
βˆ€ T : ℝ, 1 ≀ T β†’
T^h/((h.factorial:ℝ)*(quarticEnvelope j h)^h)-C*T^(h-1) ≀ weightedHilbert I Ο‰ T := by
have hsucc : h-1+1 = h := by omega
obtain ⟨C,hC,hbound⟩ := norm_real_hilbert_uniform (n := n) (d := 4) (h := h-1) (K := β„‚)
(k := 2) (by omega) (quarticA j) (quarticB j) (quarticA_pos j) (quarticB_pos j) E D hD 400 (by norm_num)
refine ⟨C,hC,fun I _ a b q ΞΈ hΞΈ ha heq hg hq hdim hdeg hadeg hqdeg w hw haw hbw Ο‰ hΟ‰ hscale T hT => ?_⟩
have hb := hbound I a b q ΞΈ hΞΈ ha heq (quotient_pair_generates a b hg I) hq
(hsucc ▸ hdim) (hsucc ▸ hh') hdeg hadeg hqdeg w hw haw hbw ω hω hscale T hT
rw [hsucc] at hb
have hc := mul_le_mul_of_nonneg_right (quartic_generic_threshold j h hh hh')
(pow_nonneg (by linarith : 0 ≀ T) h)
have hc' : T^h/((h.factorial:ℝ)*(quarticEnvelope j h)^h) ≀
((min (quarticA j) (quarticB j):β„•):ℝ)*(2*quarticA j+quarticB j:β„•)^(h-1)*400^h/
((h.factorial:ℝ)*(quarticA j:ℝ)^h*(quarticB j:ℝ)^h)*T^h := by
simpa only [one_div_mul_eq_div] using hc
linarith only [hb,hc']
theorem quartic_full_threshold_uniform {n : β„•} (j : Fin 100) :
βˆƒ C : ℝ, 0 ≀ C ∧
βˆ€ (I : Ideal (MvPolynomial (Fin n) β„‚)) [I.IsPrime]
(a b : Fin 4 β†’ MvPolynomial (Fin n) β„‚) (q : MvPolynomial (Fin n) β„‚)
(ΞΈ : Fin 4 β†’ β„‚),
(βˆ€ i, Ideal.Quotient.mk I (a i) β‰  0) β†’
(βˆ€ i, Ideal.Quotient.mk I (a i)^2*Ideal.Quotient.mk I (b i) =
Ideal.Quotient.mk I q-algebraMap β„‚ _ (ΞΈ i)) β†’
Algebra.adjoin β„‚ (Set.range a βˆͺ Set.range b) = ⊀ β†’
Transcendental β„‚ (Ideal.Quotient.mk I q) β†’ affineDimension I = 5 β†’
βˆ€ (w : Fin n β†’ β„•), (βˆ€ i, w i β‰  0) β†’
(βˆ€ i, a i ∈ weightedSpace w (quarticA j)) β†’ (βˆ€ i, b i ∈ weightedSpace w (quarticB j)) β†’
βˆ€ (Ο‰ : Fin n β†’ ℝ), (βˆ€ i, 0 < Ο‰ i) β†’ (βˆ€ i, (w i:ℝ) = 400*Ο‰ i) β†’
βˆ€ T : ℝ, 1 ≀ T β†’
T^5/(((5:β„•).factorial:ℝ)*(quarticEnvelope j 5)^5)-C*T^4 ≀ weightedHilbert I Ο‰ T := by
obtain ⟨C,hC,hbound⟩ := norm_full_real_hilbert_uniform (N := n) (n := 3) (K := β„‚)
2 (quarticA j) (quarticB j) (quarticA_pos j) (quarticB_pos j) 400 (by norm_num)
refine ⟨C,hC,fun I _ a b q ΞΈ ha heq hg hq hdim w hw haw hbw Ο‰ hΟ‰ hscale T hT => ?_⟩
have hb := hbound I a b q ΞΈ ha heq (quotient_pair_generates a b hg I) hq
hdim w hw haw hbw ω hω hscale T hT
have hc := mul_le_mul_of_nonneg_right (quartic_full_threshold j) (pow_nonneg (by linarith : 0 ≀ T) 5)
have hc' : T^5/(((5:β„•).factorial:ℝ)*(quarticEnvelope j 5)^5) ≀
(2*quarticA j+quarticB j:β„•)^3*(400:ℝ)^5/(((5:β„•).factorial:ℝ)*(quarticA j:ℝ)^4*(quarticB j:ℝ)^4)*T^5 := by
simpa only [one_div_mul_eq_div] using hc
linarith only [hb,hc']
open MvPolynomial
open scoped Classical BigOperators
theorem quartic_component_alternatives {n h D : β„•} (j : Fin 100)
(hh : 1 ≀ h) (hh' : h ≀ 5) (hD : 0 < D)
(Ο‰ : Fin n β†’ ℝ) (hΟ‰ : βˆ€ i, 0 < Ο‰ i) (hΟ‰W : βˆ€ i, Ο‰ i ≀ 1/2)
(w : Fin n β†’ β„•) (hw : βˆ€ i, w i β‰  0) (hscale : βˆ€ i, (w i:ℝ) = 400*Ο‰ i)
(M : QuarticBoxSystem n D (quarticA j) (quarticB j) (quarticU j) Ο‰ w)
(Cbox : ℝ) (hCbox : 0 < Cbox) (F R E : β„•) (Ξ΅ : ℝ) (hΞ΅ : 0 < Ξ΅) :
βˆƒ K H : ℝ, 1 ≀ K ∧ 0 ≀ H ∧ βˆ€ X : ℝ, 2 ≀ X β†’ βˆ€ S : Finset (Fin n β†’ β„€),
(βˆ€ z ∈ S, βˆ€ i, |(z i:ℝ)| ≀ Cbox*X^(Ο‰ i)) β†’
(βˆ€ t : β„‚, (S.filter (fun z => MvPolynomial.aeval (fun i => (z i:β„‚)) M.q = t)).card ≀ F) β†’
(βˆ€ c : Fin 4 β†’ β„€, (S.filter (fun z => βˆ€ i, z (M.x i) = c i)).card ≀ F) β†’
(βˆ€ zβ‚€ ∈ S, (S.filter (fun z => βˆƒ c : β„‚, βˆ€ i, MvPolynomial.aeval (fun l => (z l:β„‚)) (M.a i)=
c*MvPolynomial.aeval (fun l => (zβ‚€ l:β„‚)) (M.a i))).card ≀ R) β†’
(βˆ€ z ∈ S, βˆ€ i, MvPolynomial.aeval (fun l => (z l:β„‚)) (M.a i) β‰  0) β†’
βˆ€ (I : Ideal (MvPolynomial (Fin n) β„‚)), I.IsPrime β†’ M.ideal ≀ I β†’
affineDimension I = h β†’ affineDegree I ≀ E β†’
(βˆ€ i, Ideal.Quotient.mk I (M.a i) β‰  0) β†’
((S.filter (PointOn I)).card:ℝ) ≀ K*X^Ξ΅ ∨
βˆ€ T : ℝ, 1 ≀ T β†’ T^h/((h.factorial:ℝ)*(quarticEnvelope j h)^h)-H*T^(h-1) ≀ weightedHilbert I Ο‰ T := by
classical
have hsmall (X : ℝ) (hX : 2 ≀ X) (S : Finset (Fin n β†’ β„€)) (I : Ideal (MvPolynomial (Fin n) β„‚))
(K : ℝ) (hKF : ((F+R:β„•):ℝ) ≀ K) (hK : 0 ≀ K) (hcard : (S.filter (PointOn I)).card ≀ F+R) :
((S.filter (PointOn I)).card:ℝ) ≀ K*X^Ξ΅ := by
have hx : 1 ≀ X^Ξ΅ := Real.one_le_rpow (by linarith) hΞ΅.le
calc
_ ≀ ((F+R:β„•):ℝ) := by exact_mod_cast hcard
_ ≀ K := hKF
_ ≀ K*X^Ξ΅ := by nlinarith
have hB : (quarticB j:ℝ)=400*quarticV j := by dsimp [quarticV]; ring
by_cases h1 : h = 1
Β· subst h
obtain ⟨B,H,hB',hH,hcurve⟩ := norm_curve_alternatives (n := n) (d := 4) (by omega)
2 (by omega) ω hω M.x (quarticU j) (quarticV j) (1/2) Cbox (quarticU_pos j) (quarticV_pos j)
(by norm_num) hCbox M.xweight hωW E Ρ hΡ
let K : ℝ := max 1 (max B (F+R:β„•))
have hK : 1 ≀ K := le_max_left _ _
have hKF : ((F+R:β„•):ℝ) ≀ K := (le_max_right _ _).trans (le_max_right _ _)
have hKB : B ≀ K := (le_max_left _ _).trans (le_max_right _ _)
refine ⟨K,H,hK,hH,fun X hX S hbox hnF haF _hr _hn I hI hMI hdim hdeg ha => ?_⟩
let : I.IsPrime := hI
by_cases hq : IsAlgebraic β„‚ (Ideal.Quotient.mk I M.q)
Β· exact Or.inl (hsmall X hX S I K hKF (by linarith) ((algebraic_polynomial_fibre_count S F M.q hnF I hq).trans (by omega)))
by_cases hxa : βˆ€ i, IsAlgebraic β„‚ (Ideal.Quotient.mk I (MvPolynomial.X (M.x i)))
Β· exact Or.inl (hsmall X hX S I K hKF (by linarith) ((algebraic_left_fibre_count S F M.x haF I hxa).trans (by omega)))
push Not at hxa
obtain ⟨s,hs⟩ := hxa
have hsS (z) (hz : z ∈ S.filter (PointOn I)) := (Finset.mem_filter.mp hz).1
have hh := hcurve M.Carrier M.v M.independent M.Οƒ M.ΞΈ M.distinct X hX
(S.filter (PointOn I)) (fun z hz i => hbox z (hsS z hz) i) I hI hdim.le hdeg
(fun z hz => (Finset.mem_filter.mp hz).2) M.b M.q
(M.right_real_weight hω 400 (quarticV j) (by norm_num) (quarticV_pos j).le hB hscale I) hq (M.quotient_equations I hMI) s hs
rcases hh with hc | hHilb
Β· left
exact hc.trans (mul_le_mul_of_nonneg_right hKB (Real.rpow_nonneg (by linarith) _))
Β· right
intro T hT
have hb := hHilb T (by linarith)
have hc := mul_le_mul_of_nonneg_right (quartic_curve_threshold j) (by linarith : 0 ≀ T)
norm_num only [pow_one,Nat.factorial_one,Nat.cast_one,one_mul,Nat.sub_self,pow_zero,mul_one]
have hc' : T/quarticEnvelope j 1 ≀ min (2/quarticU j) (max (1/quarticU j) (3/quarticV j))*T := by
simpa only [one_div_mul_eq_div] using hc
norm_num only [Nat.reduceSub,Nat.reduceMul,Nat.cast_ofNat] at hb
linarith only [hb,hc']
Β· by_cases h2 : h=2
Β· subst h
obtain ⟨H,hH,hSurf⟩ := quartic_surface_alternatives hD (quarticU j) (quarticV j) 400
(quarticU_pos j) (quarticV_pos j) (by norm_num) (by dsimp [quarticU]; ring) hB ω hω w hw hscale M E
let K : ℝ := max 1 (F+R:β„•)
have hK : 1 ≀ K := le_max_left _ _
have hKF : ((F+R:β„•):ℝ) ≀ K := le_max_right _ _
refine ⟨K,H,hK,hH,fun X hX S _ hnF haF hr hn I hI hMI hdim hdeg ha => ?_⟩
let : I.IsPrime := hI
by_cases hq : IsAlgebraic β„‚ (Ideal.Quotient.mk I M.q)
Β· exact Or.inl (hsmall X hX S I K hKF (by linarith) ((algebraic_polynomial_fibre_count S F M.q hnF I hq).trans (by omega)))
have hsub (z) (hz : z ∈ S.filter (PointOn I)) := (Finset.mem_filter.mp hz).1
have hfilt (p : (Fin n β†’ β„€) β†’ Prop) [DecidablePred p] :
((S.filter (PointOn I)).filter p).card ≀ (S.filter p).card :=
Finset.card_le_card (by intro z hz; exact Finset.mem_filter.mpr ⟨hsub z (Finset.mem_filter.mp hz).1,(Finset.mem_filter.mp hz).2⟩)
have hb := hSurf (S.filter (PointOn I)) F R (fun c => (hfilt _).trans (haF c))
(fun z hz => (hfilt _).trans (hr z (hsub z hz))) (fun z hz => hn z (hsub z hz)) I hI hMI
(fun z hz => (Finset.mem_filter.mp hz).2) ha hq hdim hdeg
rcases hb with hc|hb
Β· exact Or.inl (hsmall X hX S I K hKF (by linarith) hc)
Β· right
intro T hT
have hc := mul_le_mul_of_nonneg_right (le_min (quartic_affine_threshold j) (quartic_pole_threshold j)) (sq_nonneg T)
have hb := hb T hT
norm_num only [Nat.factorial_two,Nat.cast_ofNat,Nat.reduceSub,pow_one]
rw [one_div_mul_eq_div] at hc
linarith only [hc,hb]
Β· by_cases hhd : h ≀ 4
· obtain ⟨H,hH,hHilb⟩ := quartic_generic_threshold_uniform (n := n) j (by omega) hhd E D hD
let K : ℝ := max 1 (F+R:β„•)
have hK : 1 ≀ K := le_max_left _ _
have hKF : ((F+R:β„•):ℝ) ≀ K := le_max_right _ _
refine ⟨K,H,hK,hH,fun X hX S _ hnF _ _ _ I hI hMI hdim hdeg ha => ?_⟩
let : I.IsPrime := hI
by_cases hq : IsAlgebraic β„‚ (Ideal.Quotient.mk I M.q)
Β· exact Or.inl (hsmall X hX S I K hKF (by linarith) ((algebraic_polynomial_fibre_count S F M.q hnF I hq).trans (by omega)))
Β· exact Or.inr (hHilb I M.a M.b M.q M.ΞΈ M.distinct ha (M.quotient_equations I hMI)
M.generates hq hdim hdeg M.leftDegree M.qDegree w hw M.leftWeight M.rightWeight ω hω hscale)
Β· have he : h=5 := by omega
subst h
obtain ⟨H,hH,hHilb⟩ := quartic_full_threshold_uniform (n := n) j
let K : ℝ := max 1 (F+R:β„•)
have hK : 1 ≀ K := le_max_left _ _
have hKF : ((F+R:β„•):ℝ) ≀ K := le_max_right _ _
refine ⟨K,H,hK,hH,fun X hX S _ hnF _ _ _ I hI hMI hdim _ ha => ?_⟩
let : I.IsPrime := hI
by_cases hq : IsAlgebraic β„‚ (Ideal.Quotient.mk I M.q)
Β· exact Or.inl (hsmall X hX S I K hKF (by linarith) ((algebraic_polynomial_fibre_count S F M.q hnF I hq).trans (by omega)))
Β· exact Or.inr (hHilb I M.a M.b M.q M.ΞΈ ha (M.quotient_equations I hMI)
M.generates hq hdim w hw M.leftWeight M.rightWeight ω hω hscale)
end QuarticPowerFree
end OAI