import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange local notation"Ա"=>by omega local notation"Բ"=>by norm_num local notation"Գ"=>by positivity local notation"Դ"=>by linarith local notation"Ե"=>by simp local notation"Զ"=>by ring local notation"Է"=>by decide local notation"Ը"=>by nlinarith local notation"Թ"=>by push_cast;ring local notation"Ժ"=>by split<;>simp open UInt32 (toNat) open USize (toNat) open UInt64 (toNat) open Int (toNat) open BitVec (toNat) local notation:max a:max"Ի"=>toNat a open Array (size) open FloatArray (size) local notation:max a:max"Լ"=>size a open Nat (toUSize) open UInt32 (toUSize) open UInt64 (toUSize) local notation:max a:max"Խ"=>toUSize a local notation"Ծ"=>(2:ℝ) local notation"Կ"=>(-126:ℤ) local notation"Հ"=>(0:ℝ) local notation"Ձ"=>(130:ℤ) local notation"Ղ"=>(-1022:ℤ) local notation"Ճ"=>(130:ℕ) local notation"Մ"=>(1:ℝ) local notation"Յ"=>(-53:ℤ) local notation"Ն"=>(-1:ℝ) local notation"Շ"=>(52:ℕ) local notation"Ո"=>(150:ℕ) local notation"Չ"=>0x7FFFFFFF local notation"Պ"=>0x7FFFFFFFFFFFFFFF local notation"Ջ"=>0x7F800000 local notation"Ռ"=>0x10000000 local notation"Ս"=>0x3810000000000000 local notation"Վ"=>0x1FFFFFFF local notation"Տ"=>0x0FD0000000000000 local notation"Ր"=>0x7FFFFF local notation"Ց"=>0x800000 local notation"Ւ"=>0x3810000000000001 local notation"Փ"=>0x0FCFFFFFFFFFFFFE local notation"Ք"=>0x0FFFFFFF local notation"Օ"=>0x47E0000000000000 local notation"Ֆ"=>0x8000000000000000 open Nat renaming and_two_pow_sub_one_eq_mod->γ,shiftRight_eq_div_pow->η,mod_eq_of_lt->θ,mul_le_mul_right->Β,shiftLeft_eq->Ζ,div_lt_iff_lt_mul->Κ,add_zero->Ν,cast_nonneg->Χ,zero_add->γ9,toUInt64_eq->δ1,succ_mul->δ4,add_mul->δ6,mod_lt->η3,not_lt_zero->θ1,pow_le_pow_right->θ6,div_add_mod->ι8,mul_lt_mul''->ξ7,toUInt32_eq->ο6,mul_lt_mul_of_pos_right->ρ1,zero_mul->ρ2,mul_comm->ρ3,mul_lt_mul_of_lt_of_le->ρ8,add_mul_mod_self_right->τ0,le_mul_of_pos_right->υ1,lt_log2_self->υ3,le_mul_of_pos_left->υ7,div_div_eq_div_mul->υ8,mul_ne_zero->χ5,le_div_iff_mul_le->χ7,left_le_or->ψ2,div_one->ψ3,add_le_add_right->ψ4,mul_one->ψ8,add_le_add_left->ψ9,cast_zero->Α2,add_assoc->Α3,lt_or_ge->Α9,div_eq_of_lt->Β5,le_log2->Δ0,log2_lt->Δ2,right_le_or->Ε0,pow_succ->Ζ3,add_comm->Ζ5,sub_zero->Ζ6,mul_zero->Ζ7 open Array renaming replicate->δ,ofFn->υ,emptyWithCapacity->γ3,size_replicate->θ7,getElem_ofFn->κ2,size_ofFn->ο5,length_toList->ο9,toList_replicate->χ2,getElem_push_lt->ψ0,getElem_push_eq->ψ1,size_set->Ε6 open Float renaming ofBits->ι,abs->δ7,Model->Δ1,sqrt->Ζ9 open FloatLib.Numerics renaming binaryRadix->κ,roundQuotientEven->τ,Dyadic->Ζ1 open UInt32 renaming toNat_inj->ξ,toNat_and->Ε,toNat_shiftRight->γ1,toNat_ofNat'->δ9,lt_iff_toNat_lt->η0,toNat_add->ι0,toNat_shiftLeft->κ6,le_iff_toNat_le->κ7,toNat_toUInt64->ξ4,toNat_toUSize->ο1,toNat_sub->Β7,toNat_or->Δ9 open Finset renaming range->ο,card_range->κ8,sum_add_distrib->κ9,sum_const->ξ8,abs_sum_le_sum_abs->τ3,sum_nonneg->τ8,sum_congr->υ6,sum_sub_distrib->χ3,sum_range_succ'->χ4,mul_sum->Ε9 open List renaming range->ρ,range'->Θ,map_cons->δ3,sum_nonneg->δ8,sum_cons->η6,length_cons->η8,range_succ->ι7,forall_mem_cons->ο3,foldl_append->τ6,range'_succ->υ5,foldl_cons->χ6,range_eq_range'->ψ6,mem_cons_of_mem->ψ7,mem_map_of_mem->Α0,single_le_sum->Α5,length_range'->Α6,length_map->Ε1,replicate->Ε4,foldl_ext->Ε7 open Float.Model.UnpackedFloat renaming isFinite->χ,abs->δ5,mul->ο0,unpack->Α7,Sign->Β2,pack->Β6 open FloatLib.Floats.Formats.Flocq renaming bpow->ψ,round->ι5,round_preserves_generic->ο8,generic_format_bpow->τ1 open Model renaming roundAt->Α,roundAt_zero->Ι,ofBits->Μ,toModel->Ο,roundAt_mono->Ρ,isFinite->Τ,unpackedToDyadic?->Φ,isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite->γ0,toModel_ofFloatModel->γ4,toReal->γ5,eq_of_toReal_eq_of_nonzero->γ8,ofModel->δ2,isFinite_ofModel_roundWithAccuracy_of_lt_bpow->η2,toDyadic?_ieee_eq_model->η9,unpackedToReal_finite->θ3,ofUInt32->θ4,isNaN_eq_false_of_toDyadic?_some->θ5,unpackedToReal_zero->ι2,add_eq_ofModel_add_of_isFinite->ι3,toReal_roundDyadic_eq_roundAt->ι6,ofFloatModel->ι9,exists_toDyadic?_of_isFinite->κ0,ofFloatModel_pack->κ3,expField->κ5,canonicalizeModel_eq_self->ξ1,toModel_canonicalizeModel->ξ2,pow2_eq_two_pow->ξ3,signBit->ξ9,signedScaledRatToReal->ρ4,modelSignBit->ρ6,toReal_posMaxFinite->τ2,roundAt_neg->τ4,maximum->τ9,canonicalizeModel->υ2,fexpOf->υ9,posMaxFinite->Α4,roundDyadic->Β0,fracField->Δ5,pow2->Ε3,roundRat->Ε8,isZero->Ζ4,add->Η0,fma->Η1 open Real renaming sqrt->Δ,sqrt_le_sqrt->τ7,sqrt_nonneg->Β8,sqrt_mul->Ζ2 open UInt64 renaming lt_iff_toNat_lt->Η,toNat_add->Ψ,toNat_shiftRight->γ2,le_iff_toNat_le->γ6,toNat_shiftLeft->γ7,toNat_ofNat'->δ0,toNat_sub_of_le->θ0,toNat_sub->θ9,toNat_and->ξ6,ofBitVec->ο7,toNat_inj->υ4,toNat_toUInt32->χ8,toNat_lt->Δ7 open Bool renaming and_eq_true->Ξ,false_eq_true->η4,not_eq_true'->ξ0,and_false->Ε5 open FloatArray renaming emptyWithCapacity->Υ,size->Δ6,push->Δ8,uget->Η2 open FloatLib.Numerics.Dyadic renaming cast_toRat->η1,signedSignificand->χ0,toRat_eq_zero_iff->χ1,toReal->Β1 open Float.Model renaming UnpackedFloat->η5,pack->Β4,add->Δ3,sub->Δ4,totalExponent->Ζ0,unpack->Ζ8 open Model.Reduction.Internal renaming State->η7,dotStateLoop->ι1,dotState->κ4,dotState_exact_toRat->υ0 open BitVec renaming eq_of_toNat_eq->θ2,extractLsb'_toNat->ι4,extractLsb'->ρ7,toNat->Α8,toNat_and->Β3 open Int renaming ofNat->θ8,natAbs_natCast->κ1,natAbs_mul->ψ5 open FloatLib.Numerics.Radix renaming toReal->ξ5 open Float.Model.Format renaming binary64->ρ0,binary32->Ε2 open Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->ρ5,finiteDotSlice->χ9,finiteDot->Α1 open USize renaming size->ρ9 local notation"ա"=>mul_le_mul_of_nonneg_right local notation"բ"=>UInt32 local notation"գ"=>mul_le_mul_of_nonneg_left local notation"դ"=>expOf local notation"ե"=>Array local notation"զ"=>Word local notation"է"=>FloatArray local notation"ը"=>abs_nonneg local notation"թ"=>abs_of_nonneg local notation"ժ"=>USize local notation"ի"=>two_ne_zero local notation"լ"=>Nat local notation"խ"=>mantOf local notation"ծ"=>UInt64 local notation"կ"=>zpow_add₀ local notation"հ"=>rationalWord local notation"ձ"=>abs_sub_abs_le_abs_sub local notation"ղ"=>abs_le.mp local notation"ճ"=>mul_nonneg local notation"մ"=>idxOf local notation"յ"=>zpow_natCast local notation"ն"=>le_rfl local notation"շ"=>zpow_le_zpow_right₀ local notation"ո"=>getElem!_pos local notation"չ"=>abs_of_pos local notation"պ"=>linearWith local notation"ջ"=>Bool local notation"ռ"=>signOf local notation"ս"=>fracOf local notation"վ"=>if_pos local notation"տ"=>mul_le_mul local notation"ր"=>if_neg local notation"ց"=>pow_le_pow_right₀ local notation"ւ"=>lt_of_lt_of_le local notation"փ"=>expOf_toNat_lt local notation"ք"=>abs_mul local notation"օ"=>add_nonneg local notation"ֆ"=>zero_add local notation"և"=>mul_lt_mul_of_pos_right local notation"א"=>Or.inl local notation"ב"=>lt_of_le_of_lt local notation"ג"=>dif_pos local notation"ד"=>pow_add local notation"ה"=>sqrtRational local notation"ו"=>div_le_iff₀ local notation"ז"=>abs_add_le local notation"ח"=>roundRational local notation"ט"=>one_mul local notation"י"=>le_trans local notation"ך"=>le_of_eq local notation"כ"=>List local notation"ל"=>fracOf_toNat_lt local notation"ם"=>zpow_add_one₀ local notation"מ"=>abs_le local notation"ן"=>oneW local notation"נ"=>rowVariance local notation"ס"=>FloatFormat.ieeeMaxNormalExponent local notation"ע"=>abs_abs local notation"ף"=>ite_cond_eq_true local notation"פ"=>sq_nonneg local notation"ץ"=>decodeD_toRat local notation"צ"=>abs_zero local notation"ק"=>zero_mul local notation"ר"=>congrArg local notation"ש"=>abs_sub_comm local notation"ת"=>max local notation"ؠ"=>Or.inr local notation"ء"=>Float32.ofBits local notation"آ"=>ofW local notation"أ"=>toDyadic_ofUInt32 local notation"ؤ"=>ite_cond_eq_false local notation"إ"=>bne_iff_ne.mp local notation"ئ"=>zpow_pos local notation"ا"=>zpow_neg local notation"ب"=>dotOf local notation"ة"=>Fmt local notation"ت"=>div_nonneg local notation"ث"=>abs_sub_le local notation"ج"=>toWord local notation"ح"=>limbVal local notation"خ"=>linearSpec local notation"د"=>zpow_sub₀ local notation"ذ"=>le_abs_self local notation"ر"=>abs_sub local notation"ز"=>two_pos local notation"س"=>mul_assoc local notation"ش"=>ConvShape local notation"ص"=>Int local notation"ض"=>ℝ noncomputable section abbrev W:=_root_.Float abbrev AM:FloatFormat:=FloatFormat.binary64 lemma BI:AM.isIEEE=true:=Է abbrev M (f:W):Model AM:=ι9 f.toModel def D (f:W):ض:=(M f).toReal abbrev AC (f:W):Prop:=(M f).isFinite=true lemma DO {f:W}(b:AC f):(Ο (M f)).isFinite=true:=by obtain⟨d,a⟩:=κ0 b;rw[η9 AM BI]at a;cases e:Ο (M f)<;>rw[e]at a<;>simp_all[Φ,χ] lemma Hk {a b:W}(e:AC a)(Y:AC b):M (a+b)=(M a).add (M b):=by change ι9 (Δ3 a.toModel b.toModel)=_;rw[Δ3,κ3];have d:=ι3 (fmt:=AM) BI (M a) (M b) (DO e) (DO Y);rw[γ4,γ4]at d;exact d.symm lemma Hl {a b:W}(e:AC a)(Y:AC b):M (a-b)=(M a).sub (M b):=by change ι9 (Δ4 a.toModel b.toModel)=_;rw[Δ4,κ3];have d:=Model.sub_eq_ofModel_sub_of_isFinite (fmt:=AM) BI (M a) (M b) (DO e) (DO Y);rw[γ4,γ4]at d;exact d.symm lemma Be (a:ص):ψ κ a=Ծ^a:=by simp[ψ,κ,ξ5] lemma E4:Ծ^1000<=(Α4 AM).toReal:=by rw[τ2];have a:Ε3 AM.fracWidth=2^52:=(by rw[ξ3];rfl);have b:AM.maxFiniteFracField=2^52-1:=Է;have d:AM.maxNormalExponent-θ8 AM.fracWidth=971:=Է;rw[a,b,d];show _<=_*ψ κ 971;have e:Ծ^(971:ص)=Ծ^(971:լ):=յ 2 971;have g:Ծ^1000=2^29*2^(971:լ):=ד 2 29 971;rw[Be,e,g];exact ա Բ Գ lemma F_:Α AM (Ծ^Ղ)=Ծ^Ղ:=by rw[<-Be];apply ο8;apply τ1;decide lemma Dn (x:ض): |Α AM x-x| <=Ծ^Յ* |x| +Ծ^Ղ:=by have h:Հ<Ծ^Ղ:=Գ;by_cases AF:Ծ^Ղ<= |x|;have e:x≠0:=(by rintro rfl;simp only[abs_zero]at AF;linarith);have i:0< |x| :=abs_pos.mpr e;have b:=Model.relativeError_roundAt_le_of_normal AM x e (by show ψ κ _<=_;rw[Be];exact AF);rw[Be]at b;unfold FloatLib.Floats.Formats.Flocq.ErrorBounds.relativeError at b;have a:Ծ^(1-θ8 (AM.fracWidth+1))/2=Ծ^Յ:=(by rw[show(1-θ8 (AM.fracWidth+1))= -52 from rfl,showՅ= -52-1 from rfl,zpow_sub_one₀ ի,div_eq_mul_inv]);rw[a,ו i]at b;have:=h.le;linarith;have j: |x| <Ծ^Ղ:=not_le.mp AF;have g:Α AM 0=0:=Ι AM;have Y:=abs_lt.mp j;have k:Հ<=Ծ^Յ* |x| :=Գ;rcases le_total 0 x with AP | AP;have d:=Ρ AM AP;have a:=Ρ AM Y.2.le;rw[F_]at a;rw[g]at d;rw[מ];constructor<;>linarith;have d:=Ρ AM AP;have a:=Ρ AM Y.1.le;rw[τ4,F_]at a;rw[g]at d;rw[מ];constructor<;>linarith lemma EM {a b:W}(d:AC a)(Y:AC b)(h: |D a| + |D b| <=2^1000):AC (a+b)/\D (a+b)=Α AM (D a+D b):=by have e:=h.trans E4;have g:M (a+b)=(M a).add (M b):=Hk d Y;refine⟨?_,?_⟩;show(M (a+b)).isFinite=true;rw[g];exact Model.isFinite_add_of_abs_add_le_posMaxFinite _ _ BI d Y e;show(M (a+b)).toReal=_;rw[g,Model.toReal_add_eq_roundAt_of_abs_add_le_posMaxFinite _ _ BI d Y e];rfl lemma Hm {a b:W}(d:AC a)(Y:AC b)(e: |D a| + |D b| <=2^1000):AC (a+b)/\ |D (a+b)-(D a+D b)| <=Ծ^Յ* |D a+D b| +Ծ^Ղ:=(EM d Y e).imp id λg=>by rw[g];exact Dn _ lemma Hn {a b:W}(d:AC a)(Y:AC b)(h: |D a| + |D b| <=2^1000):AC (a-b)/\ |D (a-b)-(D a-D b)| <=Ծ^Յ* |D a-D b| +Ծ^Ղ:=by have e:=h.trans E4;have g:M (a-b)=(M a).sub (M b):=Hl d Y;refine⟨?_,?_⟩;show(M (a-b)).isFinite=true;rw[g];exact Model.isFinite_sub_of_abs_toReal_sub_le_posMaxFinite _ _ BI d Y ((ر _ _).trans e);show |(M (a-b)).toReal-_| <=_;rw[g,Model.toReal_sub_eq_roundAt_of_abs_add_le_posMaxFinite _ _ BI d Y e];exact Dn _ lemma GA {f:W}{s m b d}(a:Ο (M f)= .finite s m b d):2^52<=m\/b= -1074:=by rw[γ4]at a;unfold Ζ8 Α7 at a;dsimp only at a;split_ifs at a;cases a;right;rename_i g e h;rw[e];rfl;cases a;left;rw[BitVec.toNat_append];exact י Ե (ψ2 ..) lemma EN (f:W):D f=Model.unpackedToReal (Ο (M f)):=Model.toReal_eq_unpackedToReal_toModel BI (M f) lemma Ho (a b:W):M (a*b)=δ2 AM (ο0 ρ0 (Ο (M a)) (Ο (M b))):=rfl lemma Do (s:Β2):Τ (δ2 AM (.zero s))=true/\γ5 (δ2 AM (.zero s))=0:=by refine⟨?_,Model.toReal_ofModel_zero AM BI _⟩;cases s<;>decide lemma C8 {a b:W}(x:AC a)(Y:AC b)(y: |D a| * |D b| <=2^1000):AC (a*b)/\D (a*b)=Α AM (D a*D b):=by have t:=DO x;have p:=DO Y;have j:=EN a;have k:=EN b;show(M (a*b)).isFinite=true/\(M (a*b)).toReal=_;rw[Ho];cases n:Ο (M a)with|notANumber=>(simp[n,χ]at t)|infinity s=>(simp[n,χ]at t)|zero s=>rw[n]at j;simp only[ι2]at j;((cases i:Ο (M b)with|notANumber=>(simp[i,χ]at p)|infinity d=>(simp[i,χ]at p)|zero d=>have:=Do (s*d);refine⟨this.1,?_⟩;show γ5 (δ2 AM (.zero (s*d)))=_;rw[this.2,j,ק,Ι]|finite d m g l=>have:=Do (s*d);refine⟨this.1,?_⟩;show γ5 (δ2 AM (.zero (s*d)))=_;rw[this.2,j,ק,Ι]))|finite s m g l=>rw[n]at j;((cases i:Ο (M b)with|notANumber=>(simp[i,χ]at p)|infinity d=>(simp[i,χ]at p)|zero d=>rw[i]at k;simp only[ι2]at k;have:=Do (s*d);refine⟨this.1,?_⟩;show γ5 (δ2 AM (.zero (s*d)))=_;rw[this.2,k,mul_zero,Ι]|finite d e h o=>rw[i]at k;have u:g+h<=(FloatFormat.toModel AM).targetExponent (Ζ0 (m*e) (g+h)):=(by have v:m*e≠0:=χ5 l.ne' o.ne';show _<=ת _ _;apply le_max_iff.mpr;rcases GA n with q | q;left;have:52<=(m*e).log2:=(Δ0 v).2 (q.trans (υ1 _ o));show _<=((m*e).log2:ص)+1+(g+h)-53;omega;rcases GA i with r | r;left;have:52<=(m*e).log2:=(Δ0 v).2 (r.trans (υ7 _ l));show _<=((m*e).log2:ص)+1+(g+h)-53;omega;right;subst q r;decide);have z:(m:ض)*e*ψ κ (g+h)<=2^1000:=(by refine י (ך ?_) y;rw[j,k,θ3,θ3];simp only[Be];rw[կ ի];have A:Հ<=Ծ^g:=Գ;have B:Հ<=Ծ^h:=Գ;cases ρ6 s<;>cases ρ6 d<;>simp[abs_mul,abs_of_nonneg A,abs_of_nonneg B]<;>ring);have w:Τ (δ2 AM (ο0 ρ0 (.finite s m g l) (.finite d e h o)))=true:=(by apply η2 AM BI (s*d) (m*e) (g+h) .exact ((m:ض)*e) (χ5 l.ne' o.ne') (by simp[Model.accuracyRepresents]) u;refine ב z ?_;rw[Be];showԾ^1000<Ծ^(1023:ص);have:Ծ^(1023:ص)=Ծ^(1023:լ):=յ 2 1023;rw[this];exact pow_lt_pow_right₀ Բ Բ);refine⟨w,?_⟩;rw[j,k];exact Model.toReal_ofModel_mul_finite_eq_roundAt AM BI s d m e g h l o u w)) lemma Hp {a b:W}(d:AC a)(Y:AC b)(e: |D a| * |D b| <=2^1000):AC (a*b)/\ |D (a*b)-D a*D b| <=Ծ^Յ* |D a*D b| +Ծ^Ղ:=by obtain⟨g,h⟩:=C8 d Y e;refine⟨g,?_⟩;rw[h];exact Dn _ lemma BW (b:ծ)(d:bԻ/2^52%2^11≠2047):Model.IsModelCanonical (Μ (fmt:=AM) b.toBitVec):=by constructor;intro e _;have g:ρ7 52 11 b.toBitVec=(-1#11):=e;have a:=ר Α8 g;rw[ι4,η]at a;exact absurd a d lemma CA (b:ծ):M (ι b)=υ2 (Μ (fmt:=AM) b.toBitVec):=by rfl lemma E5 (b:ծ)(a:bԻ/2^52%2^11≠2047):M (ι b)=Μ (fmt:=AM) b.toBitVec:=(CA b).trans (ξ1 (Μ (fmt:=AM) b.toBitVec) (BW b a)) lemma GB (b:ծ):ξ9 (Μ (fmt:=AM) b.toBitVec)=decide (2^63<=bԻ):=by rw[Model.signBit_eq_msb];exact BitVec.msb_eq_decide _ lemma E6 (b:ծ):κ5 (Μ (fmt:=AM) b.toBitVec)=bԻ/2^52%2^11:=by show((b.toBitVec>>>52)&&&2047#64)Ի=_;rw[Β3,BitVec.toNat_ushiftRight,η];show _&&&2047=_;exact γ _ 11 lemma Hq (b:ծ):Δ5 (Μ (fmt:=AM) b.toBitVec)=bԻ%2^52:=by show(b.toBitVec&&&4503599627370495#64)Ի=_;rw[Β3];exact γ _ 52 lemma BJ (a:բ):(դ a)Ի=aԻ/2^23%2^8:=by simp only[expOf,Ε,γ1,η];exact γ _ 8 lemma CN (a:բ):(ս a)Ի=aԻ%2^23:=by simp only[fracOf,Ε];exact γ _ 23 lemma EO (a:բ):ռ a=decide (2^31<=aԻ):=by have d:=a.toNat_lt;unfold signOf;apply Bool.eq_iff_iff.mpr;simp only[bne_iff_ne,ne_eq,decide_eq_true_eq];rw[<-ξ,Ε];have b:(0x80000000:բ)Ի=2^31:=rfl;rw[b,Nat.and_two_pow,Nat.testBit_eq_decide_div_mod_eq];show _≠(0:լ)<->_;simp;omega open FloatLib.Floats.Formats.Flocq section open Float.Model Float.Model.UnpackedFloat open FloatLib.Floats lemma Hr (em:ExtendedMantissa)(n:լ):(em>>>n).mantissa=em.mantissa/2^n:=by show(Nat.repeat ExtendedMantissa.shiftRightOne n em).mantissa=_;induction n with|zero=>simp[Nat.repeat]|succ n a=>simp only[Nat.repeat,ExtendedMantissa.shiftRightOne,a,Ζ3,υ8] lemma Hs (m k:լ)(a:m≠0):(m<<simp|succ k b=>have d:m<<<(k+1)=2*(m<<simp[Accuracy.roundToNearestEven]|inexact o=>cases o<;>simp[Accuracy.roundToNearestEven] lemma Hu (em:ExtendedMantissa):em.mantissa<=em.roundedMantissa:=by unfold ExtendedMantissa.roundedMantissa;exact Ht _ _ def Cd (m:լ):լ:=(23-(m.log2:ص)).toNat def Aw (m:լ):լ:=m<<>>Dp m def Bm (m:լ):լ:=(CO m).roundedMantissa def EP (m:լ):լ:=(((Bm m).log2:ص)-23).toNat lemma Hv (m:լ)(e:m≠0):2^23<=(CO m).mantissa/\(CO m).mantissa<2^24:=by have b:=Nat.log2_self_le e;have d:=υ3 (n:=m);unfold CO;rw[Hr];simp only[ExtendedMantissa.ofMantissaAndAccuracy,Aw,Cd,Dp];rcases Α9 m.log2 23 with g | g;have a:(23-(m.log2:ص)).toNat=23-m.log2:=Ա;have AE:((m.log2:ص)-23).toNat=0:=Ա;rw[a,AE,Ζ,pow_zero,ψ3];constructor;(calc 2^23=2^m.log2*2^(23-m.log2):=by rw[<-ד];congr 1;omega _<=m*2^(23-m.log2):=Β _ b);(calc m*2^(23-m.log2)<2^(m.log2+1)*2^(23-m.log2):=ρ1 d Գ _=2^24:=by rw[<-ד];congr 1;omega);have a:(23-(m.log2:ص)).toNat=0:=Ա;have AE:((m.log2:ص)-23).toNat=m.log2-23:=Ա;rw[a,AE,Nat.shiftLeft_zero];constructor;rw[χ7 Գ,<-ד];(calc 2^(23+(m.log2-23))=2^m.log2:=by congr 1;omega _<=m:=b);rw[Κ Գ,<-ד];calc m<2^(m.log2+1):=d _=2^(24+(m.log2-23)):=by congr 1;omega lemma Hw (m:լ)(a:Accuracy):a.roundToNearestEven m<=m+1:=by cases a with|exact=>simp[Accuracy.roundToNearestEven]|inexact o=>cases o<;>simp[Accuracy.roundToNearestEven]<;>omega lemma Hx (m:լ)(d:m≠0):2^23<=Bm m/\Bm m<=2^24:=by obtain⟨e,g⟩:=Hv m d;have a:=Hu (CO m);have b:(CO m).roundedMantissa<=(CO m).mantissa+1:=(by unfold ExtendedMantissa.roundedMantissa;exact Hw _ _);unfold Bm;omega lemma Hy (m:լ)(b:m≠0):23<=(Bm m).log2/\(Bm m).log2<=24:=by obtain⟨d,e⟩:=Hx m b;have a:Bm m≠0:=Ա;constructor;exact(Δ0 a).2 d;have:Bm m<2^25:=Ա;have:=(Δ2 a).2 this;omega lemma Ce (m:լ)(a:ص)(b:m≠0)(h: -149<=(m.log2:ص)+a-23):shiftToTargetExponent Format.binary32 (Aw m) (a-(Cd m:ص)) .exact=(CO m,a+m.log2-23):=by have d:(Aw m).log2=m.log2+Cd m:=Hs m _ b;unfold shiftToTargetExponent shiftToExponent;have e:totalExponent (Aw m) (a-(Cd m:ص))=(m.log2:ص)+1+a:=(by simp only[totalExponent,d];push_cast;ring);rw[e,GC _ Ա];have g:((m.log2:ص)+1+a-24-(a-(Cd m:ص))).toNat=Dp m:=(by simp only[Cd,Dp];omega);dsimp only;rw[g];simp only[CO,Prod.mk.injEq,true_and];simp only[Cd,Dp];omega lemma EQ (m:լ)(a:ص)(b:m≠0)(g: -149<=(m.log2:ص)+a-23):shiftToTargetExponent Format.binary32 (Bm m) (a+m.log2-23) .exact=(ExtendedMantissa.ofMantissaAndAccuracy (Bm m) .exact>>>EP m,a+m.log2-23+EP m):=by obtain⟨h,i⟩:=Hy m b;unfold shiftToTargetExponent shiftToExponent;have d:totalExponent (Bm m) (a+m.log2-23)=((Bm m).log2:ص)+1+(a+m.log2-23):=(by simp only[totalExponent]);rw[d,GC _ Ա];have e:(((Bm m).log2:ص)+1+(a+m.log2-23)-24-(a+m.log2-23)).toNat=EP m:=(by simp only[EP];omega);dsimp only;rw[e] end lemma Hz:(Fmt.minSubnormalExponent:ص)= -149:=Է lemma H0:Fmt.fracWidth=23:=rfl lemma H1 (P Q:լ)(a:ص)(e:0simp[k] def AG (a:բ):ض:=(sv a:ض)*2^((մ a:ص)-149) lemma C_ (a:բ)(b:դ a≠255):γ5 (آ a)=AG a:=by rw[Model.toReal_eq,show Model.toDyadic? (ofW a)=some (decodeD a)from أ a b];show(decodeD a).toReal=_;rw[<-η1,ץ];push_cast;rfl lemma Ar:Fmt.isIEEE=true:=Է lemma DP {a:բ}(b:դ a≠255):Τ (آ a)=true:=by show Τ (θ4 a:Model ة)=true;simp[isFinite_ofUInt32,b] lemma E8:Ծ^127<=γ5 (Α4 ة):=by rw[τ2];have a:Ε3 Fmt.fracWidth=2^23:=(by rw[ξ3];rfl);have b:Fmt.maxFiniteFracField=2^23-1:=Է;have d:Fmt.maxNormalExponent-θ8 Fmt.fracWidth=104:=Է;rw[a,b,d];show _<=_*ψ κ 104;rw[Be];have e:Ծ^(104:ص)=2^(104:լ):=յ 2 104;have g:Ծ^127=2^23*2^(104:լ):=Բ;rw[e,g];exact ա Բ Գ abbrev DQ (x:ض)(a:բ):Prop:=Α ة x=AG a/\դ a≠255/\AG a≠0/\ |x| <=2^127 lemma H2 (a:բ)(BN:ջ)(E d:լ)(o:897<=E)(p:E<1150)(q:d<=2^23) (e:aԻ=(if BN then 2^31 else 0)+(E-896)*2^23+d):դ a≠255/\AG a=(if BN then-1 else 1)*(2^23+d:լ)*Ծ^((E:ص)-1046):=by have i:=BJ a;have j:=CN a;have l:=EO a;have k:ռ a=BN:=(by rw[l];cases BN<;>simp at e⊢<;>omega);by_cases r:d<2^23;have AE:(դ a)Ի=E-896:=(by rw[i,e];cases BN<;>simp<;>omega);have AK:(ս a)Ի=d:=(by rw[j,e];cases BN<;>simp<;>omega);have g:դ a≠0:=λb=>(by rw[b]at AE;simp at AE;omega);refine⟨λb=>by rw[b]at AE;simp at AE;omega,?_⟩;have h:((մ a:լ):ص)-149=(E:ص)-1046:=(by simp only[idxOf,g,ite_false,AE];omega);rw[AG,h];simp only[sv,mantOf,g,ite_false,AK,k];cases BN<;>simp;have n:d=2^23:=Ա;subst n;have AE:(դ a)Ի=E-895:=(by rw[i,e];cases BN<;>simp<;>omega);have AK:(ս a)Ի=0:=(by rw[j,e];cases BN<;>simp);have g:դ a≠0:=λb=>(by rw[b]at AE;simp at AE;omega);refine⟨λb=>by rw[b]at AE;simp at AE;omega,?_⟩;have h:((մ a:լ):ص)-149=(E:ص)-1046+1:=(by simp only[idxOf,g,ite_false,AE];omega);rw[AG,h,կ ի];simp only[sv,mantOf,g,ite_false,AK,k];cases BN<;>simp<;>ring @[inline] def CB (a:ծ):ծ:=((a+Ռ)>>>(29:ծ))-0x1C0000000 lemma H3 {P Q:լ}(a:0omega lemma H4 {BN:ջ}{P Q E:լ}{x:ض}{a:բ}(b:0simp only[η4,↓reduceIte]at AF⊢<;>omega);rw[show 2^23+(q-2^23)=q by omega,show(((E+896:լ):ص)-1046)=(E:ص)-150 by push_cast;ring]at i;have e:=ئ (two_pos (α:=ض)) ((E:ص)-150);have l:Հcases BN<;>simp only[i,η4,↓reduceIte,one_mul,neg_mul,τ4,h,abs_neg,ne_eq,neg_eq_zero,l.ne',abs_of_nonneg n,Y,not_false_eq_true] def A6 (b:ծ):ض:=γ5 (Μ (fmt:=AM) b.toBitVec) lemma GD (f:W):D f=A6 f.toBits:=rfl def Bf (a:լ):Prop:=Ս<=a/\a<Օ/\a%2^29≠2^28 lemma GE (b:ծ)(An:Bf (bԻ%2^63)):A6 b=(if 2^63<=bԻ thenՆelse 1)*(((2^52+(bԻ%2^63)%2^52:լ):ض)*2^((((bԻ%2^63)/2^52:լ):ص)-1075)):=by obtain⟨d,e,-⟩:=An;have Y:=b.toNat_lt;have AE:bԻ/2^52%2^11=(bԻ%2^63)/2^52:=Ա;have AK:bԻ%2^52=(bԻ%2^63)%2^52:=Ա;obtain⟨-,a⟩:=C9 b Ա Ա;rw[A6,a,AE,AK,س] lemma ER (a:ծ)(d:Ս<=a.toNat)(e:a.toNat<Օ):(CB a).toNat=(a.toNat+2^28)/2^29-896*2^23:=by have b:(Ռ:ծ).toNat=2^28:=rfl;have AE:(a+Ռ).toNat=a.toNat+2^28:=(by rw[Ψ,b];omega);have AK:((a+Ռ)>>>(29:ծ)).toNat=(a.toNat+2^28)/2^29:=(by rw[γ2,AE,η];rfl);have Ao:(0x1C0000000:ծ)<=(a+Ռ)>>>(29:ծ):=(by rw[γ6,AK];show 0x1C0000000<=_;omega);rw[CB,θ0 _ _ Ao,AK];rfl lemma GF (a:ծ):(a-Ս<Տ/\a&&&Վ≠Ռ)<->Bf a.toNat:=by have b:=a.toNat_lt;have AE:(a-Ս).toNat=(2^64-Ս+a.toNat)%2^64:=(by rw[θ9];rfl);have AK:(a&&&Վ).toNat=a.toNat%2^29:=(by rw[ξ6];exact γ _ 29);rw[Η,AE,Bf,ne_eq,<-υ4,AK];show((_<Տ)/\¬(_=2^28))<->_;omega lemma GG (a e:ծ)(g:ض)(n:A6 a<=g)(o:g<=A6 e)(h:բ) (p:2^63<=aԻ<->2^63<=eԻ) (q:Bf (aԻ%2^63))(r:Bf (eԻ%2^63)) (t:(aԻ%2^63+2^28)/2^29=(eԻ%2^63+2^28)/2^29) (u:hԻ=(if 2^63<=aԻ then 2^31 else 0)+ ((aԻ%2^63+2^28)/2^29-896*2^23)):DQ g h:=by have i:∀b:ծ,(2^63<=bԻ<->2^63<=aԻ)->Bf (bԻ%2^63)-> (bԻ%2^63+2^28)/2^29=(aԻ%2^63+2^28)/2^29->DQ (A6 b) h:=by intro b j k D have F:=a.toNat_lt have G:=b.toNat_lt have v:=GE b k obtain⟨H,I,J⟩:=k set A:=bԻ%2^63 with K have w:τ (2^52+A%2^52) (2^29)= 2^23+(A%2^52+2^28)/2^29:=by unfold τ dsimp only split_ifs<;>omega refine H4 (BN:=decide (2^63<=aԻ)) (P:=2^52+A%2^52) (Q:=2^29) (E:=A/2^52-896) Բ Ա Ա Ա ?_ ?_ ·rw[v] congr 1 ·by_cases d:2^63<=aԻ ·rw[վ (j.mpr d),վ (decide_eq_true d)] ·rw[ր (mt j.mp d),ր (show ¬decide (2^63<=aԻ)=true by simpa using d)] ·rw[show(((A/2^52-896:լ):ص)-150)=((A/2^52:լ):ص)-1075+((29:լ):ص) by omega, կ ի,յ] push_cast ring ·rw[u,w] by_cases d:2^63<=aԻ<;>simp only[d,decide_true,decide_false,ite_true,ite_false, η4]<;>omega obtain⟨x,y,z,Aw⟩:=i a Iff.rfl q rfl obtain⟨B,-,-,l⟩:=i e p.symm r t.symm refine⟨le_antisymm ?_ ?_,y,z,?_⟩ ·rw[<-B] exact Ρ ة o ·rw[<-x] exact Ρ ة n ·rw[מ]at Aw l⊢ constructor<;>linarith[Aw.1,l.2] abbrev A1:բ:=0xFFFFFFFF @[inline] def A2 (s e:W):բ:=let a:=(s-e).toBits;let g:=(s+e).toBits;let b:=a&&&Պ;let d:=g&&&Պ;let r:=CB b;if a>>>(63:ծ)==g>>>(63:ծ)&&r==CB d&&b-Ս<Տ&&d-Ս<Տ&&b&&&Վ !=Ռ&&d&&&Վ !=Ռ then ((a>>>(63:ծ)).toUInt32<<<(31:բ))+r.toUInt32 else A1 lemma DA (b:ծ):(b&&&Պ).toNat=b.toNat%2^63:=by rw[ξ6];exact γ _ 63 lemma E9 (b:ծ):(b>>>(63:ծ))Ի=bԻ/2^63:=by rw[γ2,η];rfl lemma GH (a r:ծ)(d:rԻ<2^31):(((a>>>(63:ծ)).toUInt32<<<(31:բ))+r.toUInt32)Ի=aԻ/2^63*2^31+rԻ:=by have e:=a.toNat_lt;have b:(31:բ)Ի%32=31:=rfl;rw[ι0,κ6,b,Ζ,χ8,E9,χ8];omega lemma ES {s d:W}{g:ض}(l:D (s-d)<=g)(n:g<=D (s+d)) (i:A2 s d≠A1):Α ة g=AG (A2 s d)/\դ (A2 s d)≠255/\AG (A2 s d)≠0/\ |g| <=2^127:=by unfold A2 at i⊢;simp only[]at i⊢;set a:=(s-d).toBits with p;set b:=(s+d).toBits with q;rw[GD,<-p]at l;rw[GD,<-q]at n;by_cases j:(a>>>(63:ծ)==b>>>(63:ծ)&&CB (a&&&Պ)==CB (b&&&Պ)&&(a&&&Պ)-Ս<Տ&&(b&&&Պ)-Ս<Տ&&(a&&&Պ)&&&Վ !=Ռ&&(b&&&Պ)&&&Վ !=Ռ)=true;rw[ף _ _ (eq_true j)];simp only[Ξ,beq_iff_eq,decide_eq_true_eq,bne_iff_ne,ne_eq]at j;obtain⟨⟨⟨⟨⟨r,t⟩,u⟩,v⟩,w⟩,x⟩:=j;have e:=(GF (a&&&Պ)).mp ⟨u,w⟩;have h:=(GF (b&&&Պ)).mp ⟨v,x⟩;rw[DA]at e h;have E:=a.toNat_lt;have F:=b.toNat_lt;have G:aԻ/2^63=bԻ/2^63:=(by rw[<-E9,<-E9,r]);have k:=ER (a&&&Պ) (by rw[DA];exact e.1) (by rw[DA];exact e.2.1);have o:=ER (b&&&Պ) (by rw[DA];exact h.1) (by rw[DA];exact h.2.1);rw[DA]at k o;have y:(aԻ%2^63+2^28)/2^29=(bԻ%2^63+2^28)/2^29:=(by have:=ר UInt64.toNat t;rw[k,o]at this;have z:=e.1;have A:=h.1;omega);have B:((((a>>>(63:ծ)).toUInt32<<<(31:բ))+(CB (a&&&Պ)).toUInt32)Ի)=(if 2^63<=aԻ then 2^31 else 0)+((aԻ%2^63+2^28)/2^29-896*2^23):=(by have z:=e.1;have A:=e.2.1;rw[GH a _ (by rw[k];omega),k];split<;>omega);exact GG a b g l n _ Ա e h y B;rw[ؤ _ _ (eq_false j)]at i;exact absurd rfl i def J:ض:=Ծ^Յ def AH:ض:=Ծ^Ղ def AQ:ض:=Ծ^400 lemma Aj:0linarith[AZ.1,AZ.2,Ac.1,Ac.2]);have l: |A+B| <=m+b:=(ז A B).trans (add_le_add e.Bg g.Bg);have z: |D f+D d| <=G+2^22*AO G+J*G:=(by have n:=ղ y;have o:=ղ l;rw[מ];constructor<;>linarith[n.1,n.2,o.1,o.2]);have E: |D f| + |D d| <=2^30*AQ:=(by have S: |D f| <=m+k*AO G+J*m:=(by rw[מ];constructor<;>linarith[AZ.1,AZ.2,Aw.1,Aw.2]);have U: |D d| <=b+a*AO G+J*b:=(by rw[מ];constructor<;>linarith[Ac.1,Ac.2,j.1,j.2]);have V:2^22*AO G<=2^22*AQ:=գ u Բ;have X:J*G<=1*G:=ա v h;linarith);obtain⟨F,Z⟩:=DR e.BZ g.BZ E;refine⟨F,?_,l⟩;have H:=գ z i.le;have aa:=ث (D (f+d)) (D f+D d) (A+B);have I:(k+a+1)*AO G=(k+a)*AO G+AO G:=Զ;have K:J*(G+2^22*AO G+J*G)=J*G+J*(2^22*AO G)+J*(J*G):=Զ;rw[I];rw[K]at H;linarith lemma FC {G m k A g i:ض}{s a:W}(b:BD (AO G) s A m k)(j:AC a)(h:0<=D a) (U:D a<=AQ)(v:k<=2^22)(w:0<=k)(x:G<=AQ)(l:m<=G)(y: |A-g| <=i) (Y:(k+1)*AO G+J*m+i<=D a*(1-J)):D (s-a)<=g/\g<=D (s+a):=by have z:=(ը _).trans b.Bg;have n:0<=G:=z.trans l;obtain⟨o,B,V⟩:=Bn n x;have d:=Aj;have X:=CD;have E:J<=1:=(by rw[Az];norm_num);have Z:k*AO G<=2^22*AO G:=ա v o;have aa:0<=k*AO G:=ճ w o;have e:=ղ b.DS;have p:=ղ b.Bg;have q:=ղ y;have ab:J*m<=J*G:=գ l d.le;have F: |D s| <=G+2^22*AO G+J*G:=(by rw[מ];constructor<;>linarith[e.1,e.2,p.1,p.2]);have r: |D s| + |D a| <=2^30*AQ:=(by rw[թ h];have ac:2^22*AO G<=2^22*AQ:=գ B Բ;have ad:J*G<=1*G:=ա E n;linarith);obtain⟨-,H⟩:=E_ b.BZ j r;obtain⟨-,I⟩:=DR b.BZ j r;have t:=ղ H;have u:=ղ I;have K: |D s-D a| <= |D s| +D a:=(by have:=ر (D s) (D a);rwa[թ h]at this);have L: |D s+D a| <= |D s| +D a:=(by have:=ז (D s) (D a);rwa[թ h]at this);have M:=գ K d.le;have N:=գ L d.le;have O:=գ F d.le;have P:J*(G+2^22*AO G+J*G)=J*G+J*(2^22*AO G)+J*(J*G):=Զ;have Q:J*(|D s| +D a)=J* |D s| +J*D a:=Զ;have R:D a*(1-J)=D a-J*D a:=Զ;have S:(k+1)*AO G=k*AO G+AO G:=Զ;rw[P]at O;rw[Q]at M N;rw[R,S]at Y;constructor<;>linarith[t.1,t.2,u.1,u.2,e.1,e.2,q.1,q.2] def Bv (As:լ->W)(a:W)(i:լ):լ->W | 0=>a | c+1=>Bv As (a+As i) (i+1) c open Finset in lemma H7 {G:ض}(l:G<=AQ){As:լ->W}{L BB:լ->ض}{BO:ض}(n:0<=BO){i c:լ} (b:∀j,jBD (AO G) (As (i+j)) (L (i+j)) (BB (i+j)) BO){a:W}{A m k:ض} (e:BD (AO G) a A m k)(o:0<=k)(p:k+c*(BO+1)<=2^22) (q:m+∑j∈range c,BB (i+j)<=G):BD (AO G) (Bv As a i c) (A+∑j∈range c,L (i+j)) (m+∑j∈range c,BB (i+j)) (k+c*(BO+1)):=by induction c generalizing a A m k i with|zero=>simpa[Bv]using e|succ c r=>have g:=b 0 Ա;rw[Ν]at g;have h:∀f:լ->ض,∑j∈range (c+1),f (i+j)=f i+∑j∈range c,f (i+1+j):=(by intro f;rw[sum_range_succ',Ν,add_comm];congr 1;apply sum_congr rfl;intro j _;congr 1;omega);rw[h]at q⊢;rw[h];have x:Հ<=c:=Χ c;have t:∀j,j0<=BB (i+1+j):=λj d=>(ը _).trans (b (j+1) Ա |>.Bg |>.trans (ך (by congr 1;omega)));have y:0<=∑j∈range c,BB (i+1+j):=sum_nonneg λj d=>t j (mem_range.mp d);have u:((c+1:լ):ض)=c+1:=Թ;rw[u]at p⊢;have z:0<=(c:ض)*(BO+1):=Գ;have v:=ET e g l Դ o n Ը;have:=r (i:=i+1) (a:=a+As i) (A:=A+L i) (m:=m+BB i) (k:=k+BO+1) (λj d=>by have w:=b (j+1) Ա;rwa[show i+(j+1)=i+1+j by omega]at w) v Դ Ը Դ;rw[Bv];convert this using 1<;>ring open FloatLib.Floats.Formats.Flocq in lemma Dq (a:FloatFormat)(n q:ص)(d:n.natAbs<2^(a.fracWidth+1)) (e:a.minSubnormalExponent<=q):Α a ((n:ض)*2^q)=n*2^q:=by have b:(0:ص)ι (BX i.val)⟩ lemma H9:DBԼ=512:=by simp[DB,Δ6] lemma H_ (a:բ):(a>>>(23:բ)).toUSize.toNat>>(23:բ))Խ (H_ a) lemma IB (i:լ)(d:i<512):(BX i)Ի=(if i%256=0 then 0 else(i%256+873)*2^52)+i/256*2^63:=by have AE:(52:ծ)Ի%64=52:=rfl;have AK:(63:ծ)Ի%64=63:=rfl;have a:(i%256+873).toUInt64.toNat=i%256+873:=(by rw[δ1,δ0];omega);have b:(i/256).toUInt64.toNat=i/256:=(by rw[δ1,δ0];omega);rw[BX,Ψ,γ7,b,AK,Ζ];split;have:(0:ծ)Ի=0:=rfl;rw[this];omega;rw[γ7,a,AE,Ζ];omega lemma GI (b:ծ)(g:b=0\/b=Ֆ):AC (ι b)/\D (ι b)=0:=by rcases g with rfl | rfl;have a:M (ι 0)=δ2 AM (.zero .positive):=Է;obtain⟨d,e⟩:=Do .positive;exact⟨by show(M _).isFinite=true;rw[a];exact d,by show(M _).toReal=_;rw[a];exact e⟩;have a:M (ι Ֆ)=δ2 AM (.zero .negative):=Է;obtain⟨d,e⟩:=Do .negative;exact⟨by show(M _).isFinite=true;rw[a];exact d,by show(M _).toReal=_;rw[a];exact e⟩ lemma IC (i:լ)(h:i<512):AC (ι (BX i))/\D (ι (BX i))=if i%256=0 then 0 else (if i/256=1 then-1 else 1)*Ծ^(((i%256:լ):ص)-150):=by have Y:=IB i h;by_cases d:i%256=0;simp only[d,ite_true];rw[d]at Y;simp only[ite_true]at Y;apply GI;by_cases e:i/256=0;left;apply υ4.mp;rw[Y,e];rfl;right;apply υ4.mp;have:i/256=1:=Ա;rw[Y,this];rfl;simp only[d,ite_false]at Y⊢;have a:(BX i)Ի/2^52%2^11=i%256+873:=(by rw[Y];omega);have j:(BX i)Ի%2^52=0:=(by rw[Y];omega);have AL:2^63<=(BX i)Ի<->i/256=1:=(by rw[Y];omega);have g:=E5 (BX i) (by rw[a];omega);obtain⟨e,k⟩:=C9 (BX i) (by rw[a];omega) (by rw[a];omega);refine⟨by show(M (ι (BX i))).isFinite=true;rw[g];exact e,?_⟩;show(M (ι (BX i))).toReal=_;rw[g,k,a,j];have l:(Ծ^52)*2^(((i%256+873:լ):ص)-1075)=2^(((i%256:լ):ص)-150):=(by have AE:((i%256:լ):ص)-150=(Շ:ص)+(((i%256+873:լ):ص)-1075):=Ա;rw[AE,կ ի,յ]);have n:((2^52+0:լ):ض)=2^52:=Բ;rw[n,س,l];by_cases b:i/256=1;simp only[AL.mpr b,b,ite_true];simp only[mt AL.mp b,b,ite_false] def Aa:ض:=Ծ^Կ lemma EU:0b (ξ.mp (by rw[d];rfl));have e:((մ a:լ):ص)-149=((դ a)Ի:ص)-150:=(by simp only[idxOf,b,ite_false];omega);have em:խ a=2^23+(ս a)Ի:=(by simp[mantOf,b]);rw[AG,e];unfold sv;rw[em];split<;>push_cast<;>ring lemma GJ (a:բ)(b:դ a=0): |AG a| <=Aa:=by have d:մ a=0:=(by simp[idxOf,b]);have em:խ a=(ս a)Ի:=(by simp[mantOf,b]);have e:=ל a;rw[AG,d,ք];have AE: |((sv a:ص):ض)| <=2^(23:լ):=(by unfold sv;rw[em];have g:((ս a)Ի:ض)<=2^23:=(by exact_mod_cast e.le);have h:Հ<=(ս a)Ի:=Χ _;split<;>push_cast<;>simp only[abs_neg,abs_of_nonneg h]<;>exact g);have AK: |Ծ^(((0:լ):ص)-149)| =2^(((0:լ):ص)-149):=չ Գ;rw[AK,Aa];calc _<=Ծ^(23:լ)*2^(((0:լ):ص)-149):=ա AE Գ _=_:=by rw[<-յ,<-կ ի];norm_num lemma Bo (a:բ)(t:դ a≠255):AC (d a)/\(դ a≠0->D (d a)=AG a)/\(դ a=0->D (d a)=0):=by have P:=a.toNat_lt;have u:=BJ a;have Q:=CN a;have v:=EO a;have R:(դ a).toNat≠255:=λw=>t (ξ.mp (by simpa using w));have x:=ל a;have S:=փ a;have y:((a&&&Ր)+Ց).toNat=2^23+(ս a).toNat:=(by have b:(a&&&Ր).toNat=(ս a).toNat:=rfl;have j:(Ց:բ).toNat=2^23:=rfl;rw[ι0,b,j];omega);obtain⟨z,k⟩:=FD ((a&&&Ր)+Ց) Ա;rw[y]at k;set i:=a.toNat/2^23 with U;have A:i<512:=Ա;have B:i%256=(դ a).toNat:=(by rw[u];omega);have p:i/256=1<->ռ a=true:=(by rw[v];simp only[decide_eq_true_eq];omega);have E:(a>>>(23:բ)).toUSize.toNat=i:=(by rw[ο1,γ1,η];rfl);have F:d a=((a&&&Ր)+Ց).toFloat*ι (BX i):=(by unfold d;rw[IA,E]);obtain⟨G,g⟩:=IC i A;rw[B]at g;have H:(((2^23+(ս a).toNat:լ)):ض)<=2^24:=(by have:2^23+(ս a).toNat<=2^24:=Ա;exact_mod_cast this);have I:Հ<=((2^23+(ս a).toNat:լ):ض):=Χ _;set e:=Ծ^(((դ a).toNat:ص)-150)with l;have q:0simp[abs_of_pos q,q.le]);have M:Ծ^24<=2^25:=Բ;exact(տ (H.trans M) (L.trans J) (ը _) Բ).trans (H5.trans Cg));obtain⟨N,r⟩:=C8 z G K;rw[F];refine⟨N,?_,?_⟩;intro b;have n:(դ a).toNat≠0:=λj=>b (ξ.mp (by rw[j];rfl));rw[r,k,g,ր n,CQ a b];have o:=H8 (ս a).toNat (դ a).toNat x Ա;rw[<-l]at o;have O:(if i/256=1 thenՆelse 1)=if ռ a=true then-1 else 1:=(by by_cases h:ռ a=true;simp[h,p.mpr h];simp[h,mt p.mp h]);rw[O];split_ifs;rw[show((2^23+(fracOf a).toNat:լ):ض)*(-1*e)= -(((2^23+(fracOf a).toNat:լ):ض)*e) by ring,τ4,o];ring;rw[ט,ט,o];intro b;have n:(դ a).toNat=0:=(by rw[b];rfl);rw[r,g,վ n,mul_zero,Ι] lemma B3 (a:բ)(e:դ a≠255):AC (d a)/\ |D (d a)-AG a| <=Aa:=by obtain⟨g,h,i⟩:=Bo a e;refine⟨g,?_⟩;by_cases b:դ a=0;rw[i b,zero_sub,abs_neg];exact GJ a b;rw[h b,sub_self,צ];exact EU.le lemma EV (a:բ)(e:դ a≠255): |D (d a)| <=Ծ^(((դ a)Ի:ص)-126):=by obtain⟨-,g,h⟩:=Bo a e;have i:Հ<Ծ^(((դ a)Ի:ص)-126):=Գ;by_cases b:դ a=0;rw[h b,צ];exact i.le;rw[g b,CQ a b,ք];have AE: |(if ռ a=true thenՆelse 1)| =1:=Ժ;rw[AE,ט,թ Գ];have k:=ל a;have j:((2^23+(ս a)Ի:լ):ض)<=2^(24:լ):=(by have:2^23+(ս a)Ի<=2^24:=Ա;exact_mod_cast this);calc _<=Ծ^(24:լ)*Ծ^(((դ a)Ի:ص)-150):=ա j Գ _=_:=by rw[<-յ,<-կ ի];congr 1;push_cast;ring lemma ID (a:բ)(e:դ a≠255):D (d (a&&&Չ))= |D (d a)| :=by have Ak:դ (a&&&Չ)=դ a:=(by apply ξ.mp;rw[BJ,BJ,Ε];have:aԻ&&&(Չ:բ)Ի=aԻ%2^31:=γ _ 31;rw[this];omega);have g:ս (a&&&Չ)=ս a:=(by apply ξ.mp;rw[CN,CN,Ε];have:aԻ&&&(Չ:բ)Ի=aԻ%2^31:=γ _ 31;rw[this];omega);have h:ռ (a&&&Չ)=false:=(by rw[EO,Ε];have:aԻ&&&(Չ:բ)Ի=aԻ%2^31:=γ _ 31;rw[this];simp only[decide_eq_false_iff_not];omega);obtain⟨-,Ac,At⟩:=Bo _ (by rw[Ak];exact e);obtain⟨-,i,j⟩:=Bo a e;by_cases b:դ a=0;rw[At (by rw[Ak];exact b),j b,צ];rw[Ac (by rw[Ak];exact b),i b,CQ _ (by rw[Ak];exact b),CQ a b,Ak,g,h];simp only[η4,ite_false,one_mul];rw[ք];have AE: |(if ռ a=true thenՆelse 1)| =1:=Ժ;rw[AE,ט,թ Գ] lemma GK {a b x y d:ض}(e:0<=d)(g: |a-x| <=d)(Y: |b-y| <=d): |a*b-x*y| <=d*(|a| + |b|)+d^2:=by have h:a*b-x*y=a*(b-y)+(a-x)*y:=Զ;have i: |y| <= |b| +d:=(by have:=ձ y b;rw[ש]at this;linarith);have j: |a*(b-y)| <= |a| *d:=(by rw[ք];exact գ Y (ը _));have k: |(a-x)*y| <=d*(|b| +d):=(by rw[ք];exact տ g i (ը _) e);have l:=ז (a*(b-y)) ((a-x)*y);rw[h];nlinarith open FloatLib.Floats section open FloatLib.Numerics end abbrev AX:DotFn:=ب lemma IE:AX=ب:=rfl lemma CE (n:լ)(f:լ->բ)(k:լ)(a:kf i.val)[k]! =f k:=by rw[ո _ k (by simpa using a),κ2] lemma Dr (a:զ):ج (آ a)=a:=by apply ξ.mp;simp only[toWord,ofW,Model.toNatBits,ofUInt32_bits,δ9];exact θ a.toBitVec.isLt lemma GM (a:Model ة):آ (ج a)=a:=by have b:a.toNatBits<2^32:=Model.toNatBits_lt_two_pow a;simp only[ofW,toWord,θ4,δ9,θ b];exact Model.ofNatBits_toNatBits a @[inline] def B4 (a:զ):ص:=if ռ a then-((խ a<<< մ a:լ):ص)else((խ a<<< մ a:լ):ص) lemma IF (a:զ):B4 a=sv a*2^մ a:=by unfold B4 sv;split<;>simp[Ζ] lemma DT (a:զ):(decodeD a).toReal=(B4 a:ض)*2^(-149:ص):=by rw[<-η1,ץ,IF];push_cast;rw[د ի,յ];ring @[inline] def EW (a b:զ):զ:= if դ a=255\/դ b=255 then ج (τ9 (آ a) (آ b)) else match compare (B4 a) (B4 b)with | .lt=>b | .gt=>a | .eq=>ج (if Ζ4 (آ a)&&Ζ4 (آ b)then Model.zero ة (ξ9 (آ a)&&ξ9 (آ b))else آ a) lemma IG (a b:զ):Model.cmpDyadic (decodeD a) (decodeD b)=compare (B4 a) (B4 b):=by have e:Հ<2^(-149:ص):=ئ ز _;cases d:compare (B4 a) (B4 b);rw[Model.cmpDyadic_lt_iff,DT,DT];exact և (by exact_mod_cast compare_lt_iff_lt.mp d) e;rw[Model.cmpDyadic_eq_iff,DT,DT,compare_eq_iff_eq.mp d];rw[Model.cmpDyadic_gt_iff,DT,DT];exact և (by exact_mod_cast compare_gt_iff_gt.mp d) e lemma IH (a b:զ):آ (EW a b)=τ9 (آ a) (آ b):=by unfold EW;split;exact GM _;rename_i e;have g:=أ a (λd=>e (א d));have Y:=أ b (λd=>e (ؠ d));have i:=θ5 g;have j:=θ5 Y;have h:Model.compare (آ a) (آ b)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ g Y;rw[IG]at h;have k:Model.chooseNaN2 (آ a) (آ b)=none:=(Model.chooseNaN2_eq_none_iff _ _).2 ⟨i,j⟩;unfold τ9;rw[Model.withNaNSelection_of_none _ _ k];dsimp only;rw[Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ h];cases compare (B4 a) (B4 b)<;>simp only[GM] def GN (c b a k:լ)(d:ե զ):ե զ:=υ (n:=c*(b/k*(a/k))) λq=>let e:=q.val/(b/k*(a/k));let y:=q.val/(a/k)%(b/k);let x:=q.val%(a/k);(ρ (k*k)).foldl (λg h=>EW g (poolAt b a k d e y x h)) (poolAt b a k d e y x 0) lemma II (g:լ->զ)(b:כ լ)(e:զ):b.foldl (λm d=>τ9 m (آ (g d))) (آ e)=آ (b.foldl (λa d=>EW a (g d)) e):=by induction b generalizing e with|nil=>rfl|cons d b h=>simp only[χ6,<-IH,h] lemma KO:GN=maxpoolSpec:=by funext c a b k d;simp only[GN,maxpoolSpec,II,Dr] open FloatLib.Floats lemma Ds (A B:ե բ)(l:AԼ=BԼ) (h:∀k,kդ A[k]!≠255/\դ B[k]!≠255):dotSpec A B=finishWord (dsum A B 0 AԼ) (-298) (decide (AԼ≠0)&&dallNZ A B 0 AԼ):=by set L:=A.map (θ4 (fmt:=ة))with b;set a:=B.map (θ4 (fmt:=ة))with n;have d:LԼ=aԼ:=(by simp[b,n,l]);have r:LԼ=AԼ:=(by simp[b]);have o:∀k (e:kբ):լ->լ->ե լ->ե լ->ե լ×ե լ | 0,_,d,q=>(d,q) | c+1,e,d,q=>let a:=g e;let b:=h e;if ռ a==ռ b then Ci g h c (e+1) (addLimbs64 d (խ a*խ b).toUInt64 (մ a+մ b)) q else Ci g h c (e+1) d (addLimbs64 q (խ a*խ b).toUInt64 (մ a+մ b)) def Cj (b d:լ->բ):լ->լ->ջ | 0,_=>true | c+1,a=>(decide (խ (b a)*խ (d a)=0)&&Bool.xor (ռ (b a)) (ռ (d a)))&&Cj b d c (a+1) lemma EX (a:բ)(b:դ a≠255):խ a<2^24/\մ a<=254:=by have e:(ս a)Ի<2^23:=(by rw[CN];omega);have g:=փ a;have h:(դ a)Ի≠255:=λd=>b (ξ.mp (by simpa using d));unfold mantOf idxOf;split<;>omega lemma GO (a b:բ):sv a*sv b=if ռ a==ռ b then((խ a*խ b:լ):ص)else-((խ a*խ b:լ):ص):=by unfold sv;cases ռ a<;>cases ռ b<;>simp lemma FE (A B:ե բ)(b d:լ->բ)(c a:լ)(e q:ե լ)(g:eԼ=18)(h:qԼ=18) (n:∀k,a<=k->kA[k]! =b k)(Y:∀k,a<=k->kB[k]! =d k) (i:∀k,a<=k->kդ (b k)≠255/\դ (d k)≠255):((ح (Ci b d c a e q).1.toList:ص)-ح (Ci b d c a e q).2.toList=(ح e.toList:ص)-ح q.toList+dsum A B a c)/\Cj b d c a=dallNZ A B a c:=by induction c generalizing a e q with|zero=>simp[Ci,Cj,dallNZ,dsum]|succ c y=>have o:=n a ն Ա;have p:=Y a ն Ա;obtain⟨Aw,G⟩:=EX _ (i a ն Ա).1;obtain⟨z,H⟩:=EX _ (i a ն Ա).2;have D:խ (b a)*խ (d a)<2^64:=(by have:=ξ7 Aw z;omega);have t:∀r:ե լ,rԼ=18->(ح (addLimbs64 r (խ (b a)*խ (d a)).toUInt64 (մ (b a)+մ (d a))).toList:ص)=ح r.toList+(խ (b a)*խ (d a):լ)*2^(մ (b a)+մ (d a)):=(by intro r u;rw[addLimbs64_eq _ _ _ D,addLimbs_val _ _ _ Ա];push_cast;ring);have v:∀r:ե լ,rԼ=18->(addLimbs64 r (խ (b a)*խ (d a)).toUInt64 (մ (b a)+մ (d a)))Լ=18:=λr u=>(addLimbs64_size _ _ _).trans u;have sub:∀(j l:ե լ),jԼ=18->lԼ=18->_:=λj l E F=>y (a+1) j l E F (λk w x=>n k Ա Ա) (λk w x=>Y k Ա Ա) (λk w x=>i k Ա Ա);refine⟨?_,?_⟩;rw[Ci,dsum,o,p,GO];split;rw[(sub _ _ (v e g) h).1,t e g];ring;rw[(sub _ _ g (v q h)).1,t q h];ring;rw[Cj,dallNZ,o,p,(sub e q g h).2] lemma IJ (A B b d:ե բ)(c a:լ) (e:∀k,a<=k->k(b[k]! =A[k]!/\d[k]! =B[k]!)\/(b[k]! =B[k]!/\d[k]! =A[k]!)):dsum b d a c=dsum A B a c/\dallNZ b d a c=dallNZ A B a c:=by induction c generalizing a with|zero=>exact⟨rfl,rfl⟩|succ c g=>obtain⟨h,i⟩:=g (a+1) (λk j l=>e k Ա Ա);rw[dsum,dsum,dallNZ,dallNZ,h,i];rcases e a ն Աwith⟨AE,AK⟩ | ⟨AE,AK⟩;rw[AE,AK];exact⟨rfl,rfl⟩;rw[AE,AK,mul_comm (sv B[a]!),add_comm (idxOf B[a]!),mul_comm (mantOf B[a]!),Bool.xor_comm];exact⟨rfl,rfl⟩ lemma IK (n:լ)(d e h j:լ->բ)(l:∀k,kդ (d k)≠255/\դ (e k)≠255) (p:∀k,k(h k=d k/\j k=e k)\/(h k=e k/\j k=d k)):ب n h j=ب n d e:=by have b:∀(f:լ->բ) g,g(υ (n:=n) λi=>f i.val)[g]! =f g:=λf g q=>CE n f g q unfold dotOf obtain⟨r,t⟩:=IJ (υ (n:=n) λi=>d i.val) (υ (n:=n) λi=>e i.val) (υ (n:=n) λi=>h i.val) (υ (n:=n) λi=>j i.val) n 0 (λk _ o=>by rw[b _ k Ա,b _ k Ա,b _ k Ա,b _ k Ա] exact p k Ա) rw[Ds _ _ Ե (λk o=>by have a:kby have a:kբ):բ:=let r:=Ci a b n 0 (δ 18 0) (δ 18 0);finishLimbs r.1 r.2 (-298) (decide (n≠0)&&Cj a b n 0) lemma IL (n:լ)(b d:լ->բ)(h:∀k,kդ (b k)≠255/\դ (d k)≠255):FF n b d=ب n b d:=by have j:∀a,a(υ (n:=n) λi=>b i.val)[a]! =b a:=λa e=>CE n b a e;have l:∀a,a(υ (n:=n) λi=>d i.val)[a]! =d a:=λa e=>CE n d a e;obtain⟨o,q⟩:=FE _ _ b d n 0 (δ 18 0) (δ 18 0) Ե Ե (λk _ p=>j k Ա) (λk _ p=>l k Ա) (λk _ p=>h k Ա);have r:ح (Ε4 18 0)=0:=Է;simp only[χ2,r,Α2,sub_self,zero_add]at o;unfold dotOf FF;simp only[];rw[finishLimbs_eq,o,q,Ds _ _ Ե (λk t=>by have g:kբ) (i:լ):լ->ض | 0=>0 | n+1=>AG (a i)*AG (b i)+BE a b (i+1) n lemma IM (a b:բ):AG a*AG b=((sv a*sv b*2^(մ a+մ b):ص):ض)*2^(-298:ص):=by unfold AG;push_cast;rw[د ի,د ի,յ,յ,ד,show(-298:ص)= -149+ -149 by norm_num,կ ի,ا];have d:Ծ^(149:ص)≠0:=Գ;field_simp lemma GP (A B:ե բ)(a b:լ->բ)(i n:լ) (d:∀k,i<=k->k< i+n->A[k]! =a k)(Y:∀k,i<=k->k< i+n->B[k]! =b k):((dsum A B i n:ص):ض)*2^(-298:ص)=BE a b i n:=by induction n generalizing i with|zero=>simp[dsum,BE]|succ n e=>rw[dsum,BE,<-e (i+1) (λk g h=>d k Ա Ա) (λk g h=>Y k Ա Ա),d i ն Ա,Y i ն Ա,IM];push_cast;ring lemma IN {n:լ}{a b:լ->բ} (w:∀k,kդ (a k)≠255/\դ (b k)≠255){g:բ} (x:DQ (BE a b 0 n) g):ب n a b=g:=by obtain⟨h,o,p,y⟩:=x;set A:=υ (n:=n) λi=>a i.val with z;set B:=υ (n:=n) λi=>b i.val with D;have j:AԼ=n:=(by simp[z]);have E:BԼ=n:=(by simp[D]);have q:=CE n a;have r:=CE n b;have t:=Ds A B (by rw[j,E]) (λk d=>by rw[j]at d;rw[q k d,r k d];exact w k d);have e:=GP A B a b 0 n (λk _ d=>q k Ա) (λk _ d=>r k Ա);rw[j]at t;set S:=dsum A B 0 n with AL;have F:S≠0:=(by intro G;rw[G]at e;simp only[Int.cast_zero,zero_mul]at e;rw[<-e,Ι]at h;exact p h.symm);have u:(ofIntDyadic S (-298)).toReal=BE a b 0 n:=(by rw[<-η1,toRat_ofIntDyadic,<-e];push_cast;rfl);have v:=γ0 ة Ar (ofIntDyadic S (-298)) (by rw[u];exact y.trans E8);have l:=ι6 ة Ar _ v;rw[u,h]at l;show dotSpec A B=_;rw[t];simp only[finishWord,F,ite_false];rw[γ8 v (DP o) (by rw[l,C_ g o]) (by rw[l];exact p),Dr] lemma GQ {n:լ}{a b:լ->բ}(e:∀k,kդ (a k)≠255/\դ (b k)≠255) {s d:W}(g:D (s-d)<=BE a b 0 n)(h:BE a b 0 n<=D (s+d)) (i:A2 s d≠A1):ب n a b=A2 s d:=IN e (ES g h i) open FloatLib.Floats @[inline] def Bp (e g m a:ծ):ծ×ծ:=let b:=if a<64 then m<<>>1>>>(63-a)else m<<<(a-64);let d:=g+b;(e+h+(if d>>1>>>(63-a)else m<<<(a-64)).toNat:=by by_cases b:a<64;have AL:a.toNat<64:=Η.mp b;rw[վ b,վ b,γ7,γ2,γ2,Ζ,η,η,θ AL];have AK:(63-a).toNat=63-a.toNat:=(by rw[θ0 _ _ (γ6.mpr (by show a.toNat<=63;omega))];rfl);rw[AK,show(1:UInt64).toNat%64=1 from rfl,θ (by omega:63-a.toNat<64),υ8,pow_one,<-pow_succ',show 63-a.toNat+1=64-a.toNat by omega];have Ao:m.toNat*2^a.toNat/2^64=m.toNat/2^(64-a.toNat):=(by rw[show(2:լ)^64=2^(64-a.toNat)*2^a.toNat by rw[<-ד];congr 1;omega];exact Nat.mul_div_mul_right _ _ Գ);rw[<-Ao];exact(Nat.mod_add_div _ _).symm;have AL:64<=a.toNat:=(by by_contra g;exact b (Η.mpr (by show a.toNat<64;omega)));rw[ր b,ր b,γ7,Ζ];have AK:(a-64).toNat=a.toNat-64:=(by rw[θ0 _ _ (γ6.mpr (by show 64<=a.toNat;exact AL))];rfl);rw[AK,θ (by omega:a.toNat-64<64)];(have Y:m.toNat*2^(a.toNat-64)<2^64:=by calc m.toNat*2^(a.toNat-64)<2^48*2^16:=ρ8 d (θ6 Բ Ա) Գ _=2^64:=by norm_num);rw[θ Y,show(0:UInt64).toNat=0 from rfl,γ9,mul_comm ((2:լ)^64),س,<-ד];congr 2;omega lemma GR (d a m e:ծ)(j:m.toNat<2^48)(k:e.toNat<80) (Y:d.toNat*2^64+a.toNat+m.toNat*2^e.toNat<2^128):(Bp d a m e).1.toNat*2^64+(Bp d a m e).2.toNat=d.toNat*2^64+a.toNat+m.toNat*2^e.toNat:=by have h:=IP m e j k;generalize l:(if e<64 then m<<>>1>>>(63-e)else m<<<(e-64))=g at h;have o:Bp d a m e=(d+g+(if a+bբ):լ->լ->լ->լ->լ×լ | 0,_,d,e=>(d,e) | c+1,g,d,e=>let a:=h g;let b:=j g;if խ a*խ b=0 then Bw h j c (g+1) d e else let i:=մ a+մ b;Bw h j c (g+1) (if iբ)(c a e g:լ):Bw b d (c+1) a e g=if խ (b a)*խ (d a)=0 then Bw b d c (a+1) e g else Bw b d c (a+1) (if մ (b a)+մ (d a)բ)(c a e g:լ):(∀k,a<=k->kխ (b k)*խ (d k)≠0->(Bw b d c a e g).1<=մ (b k)+մ (d k)/\մ (b k)+մ (d k)<=(Bw b d c a e g).2)/\(Bw b d c a e g).1<=e/\g<=(Bw b d c a e g).2/\((∀k,a<=k->kխ (b k)*խ (d k)=0)->Bw b d c a e g=(e,g)):=by induction c generalizing a e g with|zero=>exact⟨λk o i=>absurd i Ա,ն,ն,λ_=>rfl⟩|succ c t=>rw[IQ];by_cases j:խ (b a)*խ (d a)=0;rw[վ j];obtain⟨p,l,n,u⟩:=t (a+1) e g;refine⟨λk o i h=> ?_,l,n,λq=>u λk o i=>q k Ա Ա⟩;by_cases r:k=a;rw[r]at h;exact absurd j h;exact p k Ա Ա h;rw[ր j];obtain⟨p,l,n,-⟩:=t (a+1) (if մ (b a)+մ (d a) ?_,l.trans (by split<;>omega),י (by split<;>omega) n,λq=>absurd (q a ն Ա) j⟩;by_cases r:k=a;rw[r];exact⟨l.trans (by split<;>omega),י (by split<;>omega) n⟩;exact p k Ա Ա h @[specialize] def Bq (j k:լ->բ)(l:լ):լ->լ->ծ->ծ->ծ->ծ->ծ×ծ×ծ×ծ | 0,_,d,e,g,h=>(d,e,g,h) | c+1,i,d,e,g,h=>let a:=j i;let b:=k i;let m:=խ a*խ b;if m=0 then Bq j k l c (i+1) d e g h else let n:=(մ a+մ b-l).toUInt64;if ռ a==ռ b then let r:=Bp d e m.toUInt64 n;Bq j k l c (i+1) r.1 r.2 g h else let r:=Bp g h m.toUInt64 n;Bq j k l c (i+1) d e r.1 r.2 lemma IS (b d:լ->բ)(e c a:լ)(g h i j:ծ):Bq b d e (c+1) a g h i j=if խ (b a)*խ (d a)=0 then Bq b d e c (a+1) g h i j else if ռ (b a)==ռ (d a)then Bq b d e c (a+1) (Bp g h (խ (b a)*խ (d a)).toUInt64 (մ (b a)+մ (d a)-e).toUInt64).1 (Bp g h (խ (b a)*խ (d a)).toUInt64 (մ (b a)+մ (d a)-e).toUInt64).2 i j else Bq b d e c (a+1) g h (Bp i j (խ (b a)*խ (d a)).toUInt64 (մ (b a)+մ (d a)-e).toUInt64).1 (Bp i j (խ (b a)*խ (d a)).toUInt64 (մ (b a)+մ (d a)-e).toUInt64).2:=rfl abbrev BP (a b:ծ):լ:=aԻ*2^64+bԻ lemma IT (a b:բ)(d e:լ)(h:դ a≠255)(Y:դ b≠255)(i:e<=d):խ a*խ b<2^48/\խ a*խ b*2^e<2^(48+d):=by obtain⟨Aw,-⟩:=EX a h;obtain⟨j,-⟩:=EX b Y;(have g:խ a*խ b<2^48:=calc խ a*խ b<2^24*2^24:=ξ7 Aw j _=2^48:=by norm_num);refine⟨g,?_⟩;calc խ a*խ b*2^e<2^48*2^e:=ρ1 g Գ _<=2^48*2^d:=Nat.mul_le_mul_left _ (θ6 Բ i) _=2^(48+d):=(ד 2 48 d).symm lemma EY {a c X:լ}(b:a+(c*X+X)<=2^128):a+c*X<=2^128:=י (ψ9 (Nat.le_add_right _ _) _) b lemma GS {a c X y:լ}(b:a+(c*X+X)<=2^128)(d:yբ)(j n:լ)(P:n<80)(c a:լ) (e g h i:ծ) (E:∀k,a<=k->kA[k]! =b k)(Y:∀k,a<=k->kB[k]! =d k) (x:∀k,a<=k->kդ (b k)≠255/\դ (d k)≠255) (F:∀k,a<=k->kխ (b k)*խ (d k)≠0->j<=մ (b k)+մ (d k)/\մ (b k)+մ (d k)<=j+n) (AW:BP e g+c*2^(48+n)<=2^128)(r:BP h i+c*2^(48+n)<=2^128):(((BP (Bq b d j c a e g h i).1 (Bq b d j c a e g h i).2.1:լ):ص)-(BP (Bq b d j c a e g h i).2.2.1 (Bq b d j c a e g h i).2.2.2:լ))*2^j=(((BP e g:լ):ص)-(BP h i:լ))*2^j+dsum A B a c:=by induction c generalizing a e g h i with|zero=>simp[Bq,dsum]|succ c K=>have L:=E a ն Ա;have M:=Y a ն Ա;have sub:=λG H I J (N:BP G H+c*2^(48+n)<=2^128) (O:BP I J+c*2^(48+n)<=2^128)=>K (a+1) G H I J (λk y z=>E k Ա Ա) (λk y z=>Y k Ա Ա) (λk y z=>x k Ա Ա) (λk y z=>F k Ա Ա) N O;rw[show(c+1)*2^(48+n)=c*2^(48+n)+2^(48+n) by ring]at AW r;rw[IS,dsum,L,M,GO];by_cases v:խ (b a)*խ (d a)=0;rw[վ v,sub e g h i (EY AW) (EY r),v];split<;>simp;rw[ր v];obtain⟨Q,R⟩:=F a ն Ա v;obtain⟨D,o⟩:=IT (b a) (d a) n (մ (b a)+մ (d a)-j) (x a ն Ա).1 (x a ն Ա).2 Ա;generalize S:խ (b a)*խ (d a)=m at D o⊢;generalize U:մ (b a)+մ (d a)-j=l at o⊢;have p:m.toUInt64Ի=m:=(by simp[δ1];omega);have q:l.toUInt64Ի=l:=(by simp[δ1];omega);have AK:(2:ص)^(մ (b a)+մ (d a))=2^l*2^j:=(by rw[<-ד];congr 1;omega);rw[AK];by_cases w:(ռ (b a)==ռ (d a))=true;rw[վ w,վ w];have t:=GR e g m.toUInt64 l.toUInt64 (by rw[p];exact D) (by rw[q];omega) (by rw[p,q];exact GS AW o);rw[p,q]at t;have u:BP (Bp e g m.toUInt64 l.toUInt64).1 (Bp e g m.toUInt64 l.toUInt64).2=BP e g+m*2^l:=t;rw[sub _ _ h i (by rw[u];exact GT AW o) (EY r),u];push_cast;ring;rw[ր w,ր w];have t:=GR h i m.toUInt64 l.toUInt64 (by rw[p];exact D) (by rw[q];omega) (by rw[p,q];exact GS r o);rw[p,q]at t;have u:BP (Bp h i m.toUInt64 l.toUInt64).1 (Bp h i m.toUInt64 l.toUInt64).2=BP h i+m*2^l:=t;rw[sub e g _ _ (EY AW) (by rw[u];exact GT r o),u];push_cast;ring lemma IV (b d:լ->բ)(c a k:լ)(i:a<=k)(j:komega|succ c g=>rw[Cj];by_cases h:k=a;rw[<-h];simp[e];rw[g (a+1) Ա Ա,Ε5] @[inline] def FG (n:լ)(a b:լ->բ):բ:=let r:=Bw a b n 0 1024 0;if r.1<=r.2/\r.2-r.1<=59/\n<=2^20 then let s:=Bq a b r.1 n 0 0 0 0 0;finishWord (((BP s.1 s.2.1:լ):ص)-(BP s.2.2.1 s.2.2.2:լ)) (-298+(r.1:լ)) false else FF n a b lemma IW (n:լ)(a b:լ->բ)(g:∀k,kդ (a k)≠255/\դ (b k)≠255):FG n a b=ب n a b:=by unfold FG;simp only[];split;rename_i z;obtain⟨h,A,AF⟩:=z;obtain⟨t,-,-,u⟩:=IR a b n 0 1024 0;generalize G:Bw a b n 0 1024 0=r at t u h A⊢;have B:∃k,kv k Ա;rw[this]at h;exact absurd h Բ);obtain⟨D,H,E⟩:=B;(have x:n*2^(48+(r.2-r.1))<=2^128:=calc n*2^(48+(r.2-r.1))<=2^20*2^(48+59):=Nat.mul_le_mul AF (θ6 Բ Ա) _<=2^128:=by norm_num);have j:∀d,d(υ (n:=n) λi=>a i.val)[d]! =a d:=λd l=>CE n a d l;have o:∀d,d(υ (n:=n) λi=>b i.val)[d]! =b d:=λd l=>CE n b d l;have y:=IU (υ (n:=n) λi=>a i.val) (υ (n:=n) λi=>b i.val) a b r.1 (r.2-r.1) Ա n 0 0 0 0 0 (λk _ e=>j k Ա) (λk _ e=>o k Ա) (λk _ e=>g k Ա) (λk _ e p=>by have:=t k Ա Ա p;omega) (by rw[show BP 0 0=0 from rfl,γ9];exact x) (by rw[show BP 0 0=0 from rfl,γ9];exact x);simp only[show BP 0 0=0 from rfl,Α2,sub_self,zero_mul,zero_add]at y;have F:Cj a b n 0=false:=IV a b n 0 D Ա Ա E;obtain⟨-,w⟩:=FE (υ (n:=n) λi=>a i.val) (υ (n:=n) λi=>b i.val) a b n 0 (δ 18 0) (δ 18 0) Ե Ե (λk _ e=>j k Ա) (λk _ e=>o k Ա) (λk _ e=>g k Ա);unfold dotOf;rw[Ds _ _ Ե (λk p=>by have q:klinarith[CD] lemma GU {G:ض}(h:G<=AQ){As:լ->W}{L BB:լ->ض}{BO:ض}(l:0<=BO)(b:כ լ) (e:∀d,d∈b->BD (AO G) (As d) (L d) (BB d) BO){a:W}{A m k:ض} (g:BD (AO G) a A m k)(n:0<=k)(i:k+b.length*(BO+1)<=2^22) (o:m+(b.map BB).sum<=G):BD (AO G) (b.foldl (λa d=>a+As d) a) (A+(b.map L).sum) (m+(b.map BB).sum) (k+b.length*(BO+1))/\((∀d,d∈b->0<=D (As d))->0<=D a->0<=D (b.foldl (λa d=>a+As d) a)):=by induction b generalizing a A m k with|nil=>simpa using g|cons d b p=>simp only[χ6,δ3,η6,η8,ο3]at o i e⊢;push_cast at i⊢;have v:=(ը _).trans e.1.Bg;have w:=(ը _).trans g.Bg;have x:=δ8 (List.forall_mem_map.2 λy q=>(ը _).trans (e.2 y q).Bg);have z:Հ<=b.length*(BO+1):=Գ;obtain⟨r,t⟩:=p e.2 (ET g e.1 h Դ n l Դ) Դ Դ Դ;refine⟨by convert r using 1<;>ring,λj u=>t j.2 (IX g.BZ e.1.BZ ?_ u j.1)⟩;linarith[FH g Դ h Դ,FH e.1 Դ h Դ,CD] def AW (x y:բ):ض:=D (d x)*D (d y) def A7 (b:բ) (x y:լ->բ) (e:כ լ):ض:=|D (d b)| +(e.map λa=> |AW (x a) (y a)| +Ak).sum def AL (x y:լ->բ) (b:כ լ):ض:=(b.map λa=> |D (d (x a))| + |D (d (y a))|).sum def DV (b:բ) (x y:լ->բ) (e:כ լ):ض:=D (d b)+(e.map λa=>AW (x a) (y a)).sum def Du (b:բ) (x y:լ->բ) (d:כ լ):ض:=AG b+(d.map λa=>AG (x a)*AG (y a)).sum lemma IY (b:բ)(x y:լ->բ)(a:כ լ)(Y:դ b≠255) (i:∀d,d∈a->դ (x d)≠255/\դ (y d)≠255)(p:(a.length:ض)<=2^20): |DV b x y a-Du b x y a| <=Aa*AL x y a+2*Aa:=by have j:∀a:כ լ,(∀d,d∈a->դ (x d)≠255/\դ (y d)≠255)-> |(a.map λd=>AW (x d) (y d)).sum-(a.map λd=>AG (x d)*AG (y d)).sum| <= Aa*AL x y a+a.length*Aa^2:=by intro a induction a with | nil=>simp[AL] | cons d a k=> intro e simp only[ο3]at e obtain⟨g,h⟩:=ղ (k e.2) obtain⟨l,n⟩:=ղ (GK EU.le (B3 _ e.1.1).2 (B3 _ e.1.2).2) simp only[δ3,η6,η8,AL,AW]at g h⊢ push_cast rw[מ] constructor<;>linarith obtain⟨g,h⟩:=ղ (j a i) obtain⟨l,n⟩:=ղ (B3 b Y).2 have o:(a.length:ض)*Aa<=1:=by rw[DC];linarith have:=ա o EU.le unfold DV Du rw[מ] constructor<;>linarith lemma CF (a:բ)(b:դ a≠255): |D (d a)| <=2^(128:լ):=by refine(EV a b).trans ?_;have g:(դ a)Ի≠255:=λe=>b (ξ.mp (by simpa using e));have h:=փ a;rw[<-յ];exact շ Բ (by push_cast;omega) lemma Dv (x y:բ)(AP:դ x≠255)(a:դ y≠255): |AW x y| <=2^128*2^128:=by rw[AW,ք];exact տ (CF x AP) (CF y a) (ը _) Գ lemma FI (b:բ)(x y:լ->բ)(g:כ լ)(Y:դ b≠255) (h:∀e,e∈g->դ (x e)≠255/\դ (y e)≠255)(l:(g.length:ض)<=2^21) (j:A7 b x y g<=AQ):BD (AO (A7 b x y g)) (g.foldl (λa e=>a+d (x e)*d (y e)) (d b)) (DV b x y g) (A7 b x y g) g.length:=by have k:=(Bn (G:=A7 b x y g) (օ (ը _) (δ8 (List.forall_mem_map.2 λ_ _=>օ (ը _) Ch.le))) j).1;have:=GU j (As:=λe=>d (x e)*d (y e)) (L:=λe=>AW (x e) (y e)) (BB:=λe=> |AW (x e) (y e)| +Ak) ն g (λe i=>FB (B3 _ (h e i).1).1 (B3 _ (h e i).2).1 ((Dv _ _ (h e i).1 (h e i).2).trans (by rw[CR];norm_num))) (B2 (B3 b Y).1 k) ն Դ ն;simpa[DV,A7,AW]using this.1 def BL (a:ծ):W:=ι (a<<<(52:ծ)) lemma DE (a:ծ)(j:0W)(L:լ->ض){BB:լ->ض}{BO x M:ض}(n:0<=BO)(d:כ լ) (h:∀b,b∈d->BD (AO M) (As b) (L b) (BB b) BO/\0<=D (As b))(i:(d.map BB).sum=M) (k:M<=AQ)(o:d.length*(BO+1)<=2^21)(AP:0<=x)(t:M-x<=(d.map L).sum):AC (d.foldl (λa b=>a+As b) Ae)/\0<=D (d.foldl (λa b=>a+As b) Ae)/\M<=1001/1000*D (d.foldl (λa b=>a+As b) Ae)+2*x+2^23*AH/\D (d.foldl (λa b=>a+As b) Ae)<=2*M+2^23*AH:=by obtain⟨p,j⟩:=Ea;have q:0<=M:=(by rw[<-i];exact δ8 (List.forall_mem_map.2 λb e=>(ը _).trans (h b e).1.Bg));have l:=(Bn q k).1;obtain⟨g,r⟩:=GU k n d (λb e=>(h b e).1) (B2 p l) ն Դ (by rw[j,צ,ֆ,i]);simp only[j,abs_zero,zero_add,i]at g;obtain⟨AE,AK⟩:=ղ g.DS;have u:=ա o l;have v:AO M=M/2^53+M/2^83+2*AH:=(by rw[AO,Az];ring);rw[Az]at AE AK;exact⟨g.BZ,r (λb e=>(h b e).2) j.ge,by linarith[CC],by linarith[CC,(ղ g.Bg).2]⟩ lemma DH {F:լ->ض}{B:ض}(a:כ լ)(d:∀b,b∈a->F b<=B)(e:0<=B):(a.map F).sum<=a.length*B:=by simpa using List.sum_le_length_nsmul _ B (List.forall_mem_map.2 d) def Dx:W:=ι (970*2^52+2^46) def Af (n:լ):W:=(n+3).toUInt32.toFloat*Dx def Ag (n:լ):W:=BL ((n+3).log2+1024).toUInt64 lemma IZ (x:լ)(a:x<2^64):x.toUInt64Ի=x:=by rw[δ1,δ0];omega lemma Ia (n j:լ)(AF:n<=2^20)(e:0բ):W:=Af n*(Θ 0 n).foldl (λa b=>a+d (e b&&&Չ)*d (g b&&&Չ)) Ae+BY*((Θ 0 n).foldl (λa b=>a+(d (e b&&&Չ)+d (g b&&&Չ))) Ae+Ba) lemma Dy (a:բ)(b:դ a≠255):AC (d (a&&&Չ))/\D (d (a&&&Չ))= |D (d a)| :=by refine⟨(B3 _ ?_).1,ID _ b⟩;have Ak:դ (a&&&Չ)=դ a:=(by apply ξ.mp;rw[BJ,BJ,Ε];have:aԻ&&&(Չ:բ)Ի=aԻ%2^31:=γ _ 31;rw[this];omega);rwa[Ak] def Ck (b d:լ->բ) (e:כ լ):ض:=(e.map λa=> |AW (b a) (d a)| +Ak).sum def BQ (b e:լ->բ) (g:כ լ):ض:=(g.map λa=> |D (d (b a))| + |D (d (e a))|).sum lemma GY:Ak=2^53*AH:=by unfold Ak;rw[Az];field_simp lemma KQ {x:ض}(AP:x<=2^(300:լ)):x<=AQ/2^10:=by unfold AQ;refine AP.trans ?_;rw[le_div_iff₀ Բ,<-ד];exact ց Բ Բ lemma GZ (F:լ->ض)(c:ض)(a:כ լ):(a.map λb=>F b+c).sum=(a.map F).sum+a.length*c:=by induction a with|nil=>simp|cons b a d=>simp only[δ3,η6,η8,d];push_cast;ring lemma KR (n:լ)(b e:լ->բ)(AF:n<=2^20) (i:∀a,a∈Θ 0 n->դ (b a)≠255/\դ (e a)≠255){G H:ض} (L:G<=Ck b e (Θ 0 n))(u:0<=G)(v:H<=BQ b e (Θ 0 n))(w:0<=H): AC (Eb n b e)/\0<=D (Eb n b e)/\D (Eb n b e)<=AQ/\ ((n:ض)+1)*AO G+J*G+Aa*H+2*Aa<=D (Eb n b e)*(1-J):=by set h:=Θ 0 n have y:(h.length:ض)=n:=by simp[h] have q:(n:ض)<=2^20:=by exact_mod_cast AF have Y:=CR have N:=CC have Ao:=Dt have g:=DC have O:=GY have Aw:Ck b e h<=h.length*(2^128*2^128+1):= DH h (λa g=>by linarith[Dv _ _ (i a g).1 (i a g).2]) Գ have P:BQ b e h<=h.length*(2^128+2^128):= DH h (λa g=>by linarith[CF _ (i a g).1,CF _ (i a g).2]) Գ have r:=(Bn (w.trans v) Դ).1 obtain⟨z,A,Q,R⟩:=Dw (λa=>d (b a&&&Չ)*d (e a&&&Չ)) (λa=> |AW (b a) (e a)|) (M:=Ck b e h) (x:=n*Ak) ն h (λa g=>by obtain⟨l,j⟩:=Dy _ (i a g).1 obtain⟨o,k⟩:=Dy _ (i a g).2 have p:D (d (b a&&&Չ))*D (d (e a&&&Չ))= |AW (b a) (e a)| :=by rw[j,k,AW,ք] have t:=Dv _ _ (i a g).1 (i a g).2 have:=FB (U:=AO (Ck b e h)) l o (by rw[p,ע];linarith) rw[p,ע]at this exact⟨this,(DU l o (by rw[j];exact ը _) (by rw[k];exact ը _) (by rw[p];linarith)).2.1⟩) rfl Դ Դ (ճ n.cast_nonneg Ch.le) (by rw[Ck,GZ,y];linarith) obtain⟨B,E,S,V⟩:=Dw (λa=>d (b a&&&Չ)+d (e a&&&Չ)) (λa=> |D (d (b a))| + |D (d (e a))|) (M:=BQ b e h) (x:=0) zero_le_one h (λa g=>by obtain⟨l,j⟩:=Dy _ (i a g).1 obtain⟨o,k⟩:=Dy _ (i a g).2 have t: |D (d (b a))| + |D (d (e a))| <=BQ b e h:= Α5 (List.forall_mem_map.2 λ_ _=>օ (ը _) (ը _)) _ (Α0 g) have:=ET (B2 l r) (B2 o r) Դ (by rw[j,k,ע,ע];exact t) ն ն Բ rw[j,k,ע,ע,ֆ,ֆ]at this exact⟨this,(DD l o (by rw[j];exact ը _) (by rw[k];exact ը _) (by rw[j,k];linarith)).2.1⟩) rfl Դ Դ ն (sub_le_self _ ն) obtain⟨F,I,K⟩:=GX n AF exact GW n.cast_nonneg q F I K z A Դ (by linarith[ա q Ch.le]) u B E Դ Դ lemma Ga:2^32<=ρ9:=by rcases System.Platform.numBits_eq with a | a<;>simp[ρ9,a] lemma AT (a b:ժ)(d:aԻ+bԻ<2^32):(a+b)Ի=aԻ+bԻ:=by have:=Ga;rw[USize.toNat_add,show(2:լ)^System.Platform.numBits=ρ9 by simp[ρ9]];exact θ Ա lemma Bh (a:լ)(b:a<2^32):(USize.ofNat a)Ի=a:=by have:=Ga;rw[USize.toNat_ofNat',show(2:լ)^System.Platform.numBits=ρ9 by simp[ρ9]];exact θ Ա lemma BF:(1:ժ)Ի=1:=Bh 1 Բ lemma CS:(2:ժ)Ի=2:=Bh 2 Բ lemma CT:(3:ժ)Ի=3:=Bh 3 Բ lemma DG:(4:ժ)Ի=4:=Bh 4 Բ lemma Dz:(5:ժ)Ի=5:=Bh 5 Բ lemma D0:(6:ժ)Ի=6:=Bh 6 Բ lemma D1:(7:ժ)Ի=7:=Bh 7 Բ lemma Al (a:ժ)(b:a.toNat+1<2^32):(a+1).toNat=a.toNat+1:=by rw[AT a 1 (by rw[BF];exact b),BF] lemma Au {a b:ժ}(d:a(k:ժ)->(k.toNat+c<=V.size)->(k.toNat+c<=I.size)->(k.toNat+c<2^31)->W->W->W->W->W->W->W->W->B5 | 0,_,_,_,_,A8,AZ,Ac,At,Ax,A0,A9,A_=>⟨A8,AZ,Ac,At,Ax,A0,A9,A_⟩ | c+1,k,h,Ar,i,A8,AZ,Ac,At,Ax,A0,A9,A_=>have j:(k+1).toNat=k.toNat+1:=(by rw[AT k 1 (by rw[BF];omega),BF]);let b:=V.uget k Ա;let q:=(I.uget k Ա).toUSize+g;if d:q>>(31:բ))-1)else a lemma FK (R:ջ)(a:զ)(h:դ a=255->ս a≠0->aԻ<2^31):Cl R a=act R a:=by cases R;rfl;show a&&&((a>>>(31:բ))-1)=reluW a;have i:=a.toNat_lt;have j:(a&&&0x80000000 !=0)=ռ a:=rfl;have AE:(a>>>(31:բ))Ի=aԻ/2^31:=(by rw[γ1,η];rfl);unfold reluW;rw[j,EO];by_cases d:2^31<=aԻ;have b:(a>>>(31:բ))-1=0:=(by apply ξ.mp;rw[UInt32.toNat_sub_of_le _ _ (by rw[κ7,AE];show 1<=_;omega),AE];show aԻ/2^31-1=0;omega);have AF:(!(decide (դ a=255)&&ս a !=0))=true:=(by by_cases e:դ a=255;by_cases g:ս a=0;simp[g];have:=h e g;omega;simp[e]);simp only[d,decide_true,Bool.true_and,AF,b,UInt32.and_zero];rfl;have b:(a>>>(31:բ))-1=0xFFFFFFFF:=(by apply ξ.mp;have:a>>>(31:բ)=0:=(by apply ξ.mp;rw[AE];show aԻ/2^31=0;omega);rw[this];rfl);simp only[d,decide_false,Bool.false_and,η4,ite_false,b];apply ξ.mp;rw[Ε];exact γ _ 32▸(θ i).symm▸rfl lemma Ie {n:լ}{b d:լ->բ}(o:∀k,kդ (b k)≠255/\դ (d k)≠255) {s a:W}{G A k c H:ض}(e:BD (AO G) s A G k)(p:0<=k)(g:k<=c)(q:c<=2^22)(h:G<=AQ) (r: |A-BE b d 0 n| <=Aa*H+2*Aa)(t:AC a)(u:0<=D a)(v:D a<=AQ) (Y:(c+1)*AO G+J*G+Aa*H+2*Aa<=D a*(1-J))(i:A2 s a≠A1):ب n b d=A2 s a/\դ (A2 s a)≠255:=by have w:0<=G:=(ը _).trans e.Bg;obtain⟨x,-,-⟩:=Bn w h;have y:(k+1)*AO G<=(c+1)*AO G:=ա (by linarith only[g]) x;obtain⟨j,l⟩:=FC e t u v (g.trans q) p h ն r (by linarith only[y,Y]);exact⟨GQ o j l i,(ES j l i).2.1⟩ section open Float.Model Float.Model.UnpackedFloat lemma If (d:ծ): @unpackExponent Format.binary64 (d&&&Պ).toBitVec= @unpackExponent Format.binary64 d.toBitVec/\ @unpackMantissa Format.binary64 (d&&&Պ).toBitVec= @unpackMantissa Format.binary64 d.toBitVec/\Sign.ofBitVec (@unpackSign Format.binary64 (d&&&Պ).toBitVec)= .positive:=by have a:dԻ&&&9223372036854775807=dԻ%2^63:=γ _ 63;have b:=d.toNat_lt;refine⟨?_,?_,?_⟩;apply θ2;simp[unpackExponent,a,η];omega;apply θ2;simp[unpackMantissa,a];have e:(@unpackSign Format.binary64 (d&&&Պ).toBitVec)Ի=0:=(by simp[unpackSign,a,η]);have g: @unpackSign Format.binary64 (d&&&Պ).toBitVec=0#1:=θ2 (by rw[e];rfl);rw[g];rfl lemma Ig (a:ծ):(UnpackedFloat.unpack Format.binary64 a.toBitVec).abs=UnpackedFloat.unpack Format.binary64 (a&&&Պ).toBitVec:=by obtain⟨AE,AK,Ao⟩:=If a;unfold UnpackedFloat.unpack;simp only[]at AE AK Ao⊢;simp only[AE,AK,Ao];split;split<;>rfl;split;split<;>rfl;rfl lemma Ih (a:W):Ο (M (δ7 a))=(Ο (M a)).abs:=by show(Β4 a.toModel.unpack.abs).unpack=a.toModel.unpack.abs;have b:a.toModel.unpack=UnpackedFloat.unpack Format.binary64 a.toBits.toBitVec:=rfl;rw[b,Ig];show UnpackedFloat.unpack Format.binary64 (ο7 (UnpackedFloat.pack Format.binary64 _)).toBitVec=_;rw[UInt64.toBitVec_ofBitVec,Model.unpack_pack_unpack] end lemma Ii (f:W):AC f<->(Φ (Ο (M f))).isSome=true:=by show Τ (M f)=true<->_;rw[<-Model.toDyadic?_isSome_eq_isFinite,η9 AM BI] lemma FL {a:W}(b:AC a):AC (δ7 a)/\D (δ7 a)= |D a| :=by rw[Ii]at b⊢;rw[EN,EN,Ih];cases d:Ο (M a)with|notANumber=>(simp[d,Φ]at b)|infinity s=>(simp[d,Φ]at b)|zero s=>refine⟨by simp[δ5,Φ],?_⟩;simp[δ5,ι2]|finite s m e h=>refine⟨by simp[δ5,Φ],?_⟩;simp only[δ5,θ3,Be];have g:Հ<=Ծ^e:=Գ;cases s<;>simp[abs_mul,abs_of_nonneg g,ρ6] lemma Ij {a:ض}(n q:ص)(b:a=n*2^q)(AF:n.natAbs<2^53)(d: -1074<=q):Α AM a=a:=by rw[b];exact Dq AM n q (ւ AF Է) (by show(-1074:ص)<=q;exact d) lemma Ik (x y:բ)(AP:դ x≠255)(g:դ y≠255):AC (d x*d y)/\D (d x*d y)=AW x y:=by obtain⟨h,i,j⟩:=Bo x AP;obtain⟨k,l,n⟩:=Bo y g;have Y: |D (d x)| * |D (d y)| <=2^1000:=(by have:=Dv x y AP g;rw[AW,ք]at this;exact this.trans (by rw[<-ד];exact ց Բ Բ));obtain⟨f,o⟩:=C8 h k Y;refine⟨f,o.trans ?_⟩;unfold AW;by_cases a:դ x=0;rw[j a,ק,Ι];by_cases b:դ y=0;rw[n b,mul_zero,Ι];rw[i a,l b];have t:=ל x;have u:=ל y;have v:(դ x)Ի≠0:=λe=>a (ξ.mp (by rw[e];rfl));have AE:(դ y)Ի≠0:=λe=>b (ξ.mp (by rw[e];rfl));(have p:(2^23+(ս x)Ի)*(2^23+(ս y)Ի)<2^53:=by have q:2^23+(ս x)Ի<2^24:=Ա;have r:2^23+(ս y)Ի<2^24:=Ա;calc _<2^24*2^24:=ξ7 q r _<=2^53:=by norm_num);refine Ij ((if ռ x=true then-1 else 1)*(if ռ y=true then-1 else 1)*(((2^23+(ս x)Ի)*(2^23+(ս y)Ի):լ):ص)) ((((դ x)Ի:ص)-150)+(((դ y)Ի:ص)-150)) ?_ ?_ Ա;rw[CQ x a,CQ y b,կ ի];split_ifs<;>push_cast<;>ring;rw[ψ5,ψ5,κ1];split_ifs<;>simpa using p def Ah (a b:լ->բ):լ->W | 0=>Ae | k+1=>Ah a b k+d (a k)*d (b k) def Cm (b d:լ->բ)(k:լ):W:=(ρ k).foldl (λa i=>a+δ7 (Ah b d (i+1))) Ae def Cn (b e:լ->բ)(k:լ):W:=(ρ k).foldl (λa i=>a+(δ7 (d (b i))+δ7 (d (e i)))) Ae lemma Il (a b:լ->բ)(k:լ):Cm a b (k+1)=Cm a b k+δ7 (Ah a b (k+1)):=by simp[Cm,ι7,τ6] lemma Im (a b:լ->բ)(k:լ):Cn a b (k+1)=Cn a b k+(δ7 (d (a k))+δ7 (d (b k))):=by simp[Cn,ι7,τ6] def CG:W:=BL 972 lemma In:AC CG/\D CG=4*J:=by obtain⟨a,b⟩:=DE 972 Է Է;exact⟨a,by rw[CG,b,Az];norm_num⟩ @[specialize] def FM (g h:լ->բ):(c a:լ)->W->W->W->բ | 0,_,b,r,e=>A2 b (CG*r+BY*(e+Ba)) | c+1,a,b,r,e=>let x:=d (g a);let y:=d (h a);let q:=b+x*y;FM g h c (a+1) q (r+q.abs) (e+(x.abs+y.abs)) lemma Io (b d:լ->բ)(c a:լ):FM b d c a (Ah b d a) (Cm b d a) (Cn b d a)=A2 (Ah b d (a+c)) (CG*Cm b d (a+c)+BY*(Cn b d (a+c)+Ba)):=by induction c generalizing a with|zero=>rfl|succ c e=>have:=e (a+1);rw[show a+1+c=a+(c+1) by omega,Il,Im]at this;exact this def Bx (a b:լ->բ) (k:լ):ض:=((ρ k).map λi=>AW (a i) (b i)).sum def Bb (a b:լ->բ) (k:լ):ض:=((ρ k).map λi=> |D (Ah a b (i+1))|).sum lemma Ip (a b:լ->բ)(k:լ):Bx a b (k+1)=Bx a b k+AW (a k) (b k):=by simp[Bx,ι7] lemma Gb (a b:լ->բ)(k:լ):Bb a b (k+1)=Bb a b k+ |D (Ah a b (k+1))| :=by simp[Bb,ι7] lemma FN (a b:լ->բ)(k:լ):0<=Bb a b k:=δ8 (List.forall_mem_map.2 λ_ _=>ը _) lemma Iq {a P b S d k:ض}(g: |b-(a+P)| <=J* |a+P| +AH) (h:(1-J)* |a-S| <=J*d+k*AH):(1-J)* |b-(S+P)| <=J*(d+ |b|)+(k+1)*AH:=by have e:=Aj;have i:J<=1/2:=(by rw[Az];norm_num);have BW: |a+P| <= |b| + |b-(a+P)| :=(by have:=ر b (b-(a+P));rwa[sub_sub_cancel]at this);have CA: |b-(S+P)| <= |a-S| + |b-(a+P)| :=(by have:=ז (a-S) (b-(a+P));rwa[show a-S+(b-(a+P))=b-(S+P) by ring]at this);have j:=գ BW e.le;have l:=գ CA (by linarith:Հ<=1-J);linarith lemma Ir {a P b k:ض}(d: |b-(a+P)| <=J* |a+P| +AH)(e: |a| <=k*(2*2^256)) (AW: |P| <=2^128*2^128)(g:k<=2^20)(h:0<=k): |b| <=(k+1)*(2*2^256):=by have BW: |b| <= |a+P| + |b-(a+P)| :=(by have:=ז (a+P) (b-(a+P));rwa[add_sub_cancel]at this);have CA:=ז a P;have i:=Cf;rw[Az]at d;linarith lemma Gc (a b:լ->բ)(k:լ)(z:k<=2^20) (g:∀e,eդ (a e)≠255/\դ (b e)≠255):AC (Ah a b k)/\ |D (Ah a b k)| <=k*(2*2^256)/\(1-J)* |D (Ah a b k)-Bx a b k| <=J*Bb a b k+k*AH:=by induction k with|zero=>obtain⟨n,h⟩:=Ea;exact⟨n,by simp[Ah,h],by simp[Ah,h,Bx,Bb]⟩|succ k o=>obtain⟨p,q,AE⟩:=o Ա (λe A=>g e Ա);obtain⟨AP,i⟩:=g k Ա;obtain⟨r,j⟩:=Ik (a k) (b k) AP i;have t:=Dv (a k) (b k) AP i;have l:(k:ض)<=2^20:=(by exact_mod_cast(by omega:k<=2^20));have u:Հ<=k:=k.cast_nonneg;have v:=CR;have B:(k:ض)*(2*2^256)<=2^20*(2*2^256):=ա l Գ;have w: |D (Ah a b k)| + |D (d (a k)*d (b k))| <=2^30*AQ:=(by rw[j,v];linarith);obtain⟨x,AK⟩:=DR p r w;rw[j]at AK;have y:Ah a b (k+1)=Ah a b k+d (a k)*d (b k):=rfl;rw[Ip,Gb,y];push_cast;exact⟨x,Ir AK q t l u,Iq AK AE⟩ lemma Gd (a b:լ->բ)(k:լ): |D (Ah a b k)| <=Bb a b k:=by cases k with|zero=>simp[Ah,Bb,Ea.2]|succ k=>rw[Gb];linarith[FN a b k] lemma FO (a b:լ->բ)(i n:լ):BE a b i n=((Θ i n).map λd=>AG (a d)*AG (b d)).sum:=by induction n generalizing i with|zero=>simp[BE]|succ n e=>simp[BE,υ5,e] lemma Is (x y:լ->բ)(b:כ լ)(d:∀a,a∈b->դ (x a)≠255/\դ (y a)≠255): |(b.map λa=>AW (x a) (y a)).sum-(b.map λa=>AG (x a)*AG (y a)).sum| <= Aa*BQ x y b+b.length*Aa^2:=by induction b with | nil=>simp[BQ] | cons a b e=> simp only[ο3]at d obtain⟨g,h⟩:=ղ (e d.2) obtain⟨i,j⟩:=ղ (GK EU.le (B3 _ d.1.1).2 (B3 _ d.1.2).2) simp only[δ3,η6,η8,BQ,AW]at g h⊢ push_cast rw[מ] constructor<;>linarith lemma It {r a:W}{b H:ض}(n:լ)(AF:(n:ض)<=2^20) (h:AC r)(i:0<=D r)(G:D r<=AQ/16)(I:b<=1001/1000*D r+2^23*AH) (K:0<=b) (j:AC a)(k:0<=D a)(L:D a<=AQ/16)(M:H<=1001/1000*D a+2^23*AH) (N:0<=H):AC (CG*r+BY*(a+Ba))/\0<=D (CG*r+BY*(a+Ba))/\D (CG*r+BY*(a+Ba))<=AQ/\(J*b+n*AH)*(1+2*J)+Aa*H+n*Aa^2+J*b+AH<=D (CG*r+BY*(a+Ba))*(1-J):=by obtain⟨l,d⟩:=In;obtain⟨o,e⟩:=GV;obtain⟨p,g⟩:=FJ;have Y:=CR;have Ao:=Dt;have q:=CC;have O:(n:ض)*AH<=2^20*AH:=ա AF q.le;have P:Հ<=n:=n.cast_nonneg;simp only[Az,DC]at*;obtain⟨t,u,v,BF⟩:=DU l h (by rw[d];norm_num) i (by rw[d];linarith);rw[d]at v BF;obtain⟨w,x,y,CS⟩:=DD j p k (by rw[g];norm_num) (by rw[g];linarith);rw[g]at y CS;obtain⟨z,A,B,CT⟩:=DU o w (by rw[e];norm_num) x (by rw[e];linarith);rw[e]at B CT;obtain⟨E,F,Q,DG⟩:=DD t z u A Դ;refine⟨E,F,by linarith,?_⟩;linarith lemma Iu {b a:W}{d g:ض}(h:AC b)(i:AC a)(e:0<=D a)(z:D a<=AQ) (A: |D b| <=AQ)(p: |D b-d| <=g)(Y:g+J* |D b| +AH<=D a*(1-J)):D (b-a)<=d/\d<=D (b+a):=by have B:=CD;have j: |D b| + |D a| <=2^30*AQ:=(by rw[թ e];linarith);obtain⟨-,q⟩:=E_ h i j;obtain⟨-,r⟩:=DR h i j;have k:=ղ q;have l:=ղ r;have n:=ղ p;have o:=Aj;have t: |D b-D a| <= |D b| +D a:=(by have:=ر (D b) (D a);rwa[թ e]at this);have u: |D b+D a| <= |D b| +D a:=(by have:=ז (D b) (D a);rwa[թ e]at this);have v:=գ t o.le;have w:=գ u o.le;have x:D a*(1-J)=D a-J*D a:=Զ;have y:J*(|D b| +D a)=J* |D b| +J*D a:=Զ;rw[x]at Y;rw[y]at v w;constructor<;>linarith[k.1,k.2,l.1,l.2,n.1,n.2] @[inline] def Ed (n:լ)(a b:լ->բ):բ:=FM a b n 0 Ae Ae Ae lemma Iv {n:լ}{e g:լ->բ}(AF:n<=2^20) (r:∀k,kդ (e k)≠255/\դ (g k)≠255)(H:Ed n e g≠A1): Ed n e g=ب n e g:=by have U:Ed n e g=A2 (Ah e g n) (CG*Cm e g n+BY*(Cn e g n+Ba)):=by have:=Io e g n 0 rw[γ9]at this exact this rw[U]at H⊢ have p:(n:ض)<=2^20:=by exact_mod_cast AF have Y:=CR set j:=ρ n with al have o:j.length=n:=List.length_range have t:∀h,h∈j->hList.mem_range.mp l obtain⟨V,am,an⟩:=Gc e g n AF (λh l=>r h l) have y:∀i,iAC (Ah e g (i+1))/\ |D (Ah e g (i+1))| <=2^20*(2*2^256):=by intro i ao obtain⟨f,b,-⟩:=Gc e g (i+1) Ա (λh l=>r h Ա) have:((i+1:լ):ض)<=2^20:=by exact_mod_cast(by omega:i+1<=2^20) exact⟨f,b.trans (ա this Գ)⟩ have I:Bb e g n<=AQ:=by have:=DH (F:=λi=> |D (Ah e g (i+1))|) j (λh l=>(y h (t h l)).2) Գ rw[o]at this have z:(n:ض)*(2^20*(2*2^256))<=2^20*(2^20*(2*2^256)):= ա p Գ show((ρ n).map _).sum<=AQ rw[Y] linarith have W:=(Bn (FN e g n) I).1 obtain⟨K,AD,A,X⟩:=Dw (λi=>δ7 (Ah e g (i+1))) (λi=> |D (Ah e g (i+1))|) (BB:=λi=> |D (Ah e g (i+1))|) (M:=Bb e g n) (x:=0) ն j (λh l=>by obtain⟨Z,L⟩:=FL (y h (t h l)).1 have:=B2 Z W rw[L,ע]at this exact⟨this,by rw[L];exact ը _⟩) rfl I (by rw[o];push_cast;linarith) ն (by simp[Bb,j]) have q:∀h,h∈j->դ (e h)≠255/\դ (g h)≠255:=λh l=>r h (t h l) have B:BQ e g j<=j.length*(2^128+2^128):= DH j (λh l=>by linarith[CF _ (q h l).1,CF _ (q h l).2]) Գ have E:BQ e g j<=AQ:=by rw[o]at B have z:(n:ض)*(2^128+2^128)<=2^20*(2^128+2^128):=ա p Գ rw[Y] linarith have N:0<=BQ e g j:=δ8 (List.forall_mem_map.2 λ_ _=>օ (ը _) (ը _)) have O:=(Bn N E).1 obtain⟨P,Q,G,u⟩:=Dw (λh=>δ7 (d (e h))+δ7 (d (g h))) (λh=> |D (d (e h))| + |D (d (g h))|) (M:=BQ e g j) (x:=0) zero_le_one j (λh l=>by obtain⟨R,v⟩:=FL (B3 _ (q h l).1).1 obtain⟨S,w⟩:=FL (B3 _ (q h l).2).1 have aa: |D (d (e h))| + |D (d (g h))| <=BQ e g j:= Α5 (List.forall_mem_map.2 λ_ _=>օ (ը _) (ը _)) _ (Α0 l) have:=ET (B2 R O) (B2 S O) E (by rw[v,w,ע,ע];exact aa) ն ն Բ rw[v,w,ע,ע,ֆ,ֆ]at this exact⟨this,(DD R S (by rw[v];exact ը _) (by rw[w];exact ը _) (by rw[v,w];linarith)).2.1⟩) rfl E (by rw[o];push_cast;linarith) ն (sub_le_self _ ն) have ap: |Bx e g n-BE e g 0 n| <=Aa*BQ e g j+n*Aa^2:=by have:=Is e g j q rw[o]at this rwa[FO,<-ψ6] have ab:Cm e g n=j.foldl (λa i=>a+δ7 (Ah e g (i+1))) Ae:=rfl have ac:Cn e g n=j.foldl (λa h=>a+(δ7 (d (e h))+δ7 (d (g h)))) Ae:=rfl rw[<-ab]at K AD A X rw[<-ac]at P Q G u simp only[mul_zero,add_zero]at A G have aq:Bb e g n<=2^20*(2^20*(2*2^256)):=by have:=DH (F:=λi=> |D (Ah e g (i+1))|) j (λh l=>(y h (t h l)).2) Գ rw[o]at this have z:(n:ض)*(2^20*(2*2^256))<=2^20*(2^20*(2*2^256)):= ա p Գ exact this.trans z have ar:BQ e g j<=2^20*(2^128+2^128):=by rw[o]at B exact B.trans (ա p Գ) have ad:D (Cm e g n)<=AQ/16:=by have:=Cf rw[Y] linarith have ae:D (Cn e g n)<=AQ/16:=by have:=Cf rw[Y] linarith obtain⟨af,ag,AE,as⟩:=It n p K AD ad A (FN e g n) P Q ae G N have u:=Aj have au:J<=1/2:=by rw[Az];norm_num have ah: |D (Ah e g n)-BE e g 0 n| <=(J*Bb e g n+n*AH)*(1+2*J)+(Aa*BQ e g j+n*Aa^2):=by have av: |D (Ah e g n)-Bx e g n| <=(J*Bb e g n+n*AH)*(1+2*J):=by have AP:=ը (D (Ah e g n)-Bx e g n) have aw:(1/2)* |D (Ah e g n)-Bx e g n| <=(1-J)* |D (Ah e g n)-Bx e g n| := ա Դ AP have ax:=գ (show |D (Ah e g n)-Bx e g n| <=2*(J*Bb e g n+n*AH) by linarith) u.le linarith have:=ث (D (Ah e g n)) (Bx e g n) (BE e g 0 n) linarith have ai: |D (Ah e g n)| <=AQ:=by have:=Gd e g n linarith obtain⟨aj,ak⟩:=Iu V af ag AE ai ah (by have:=գ (Gd e g n) u.le linarith) exact(GQ r aj ak H).symm @[inline] def CU (n:լ)(a b:լ->բ)(e:W):բ:=let d:=Ed n a b;if d !=A1 then d else FG n a b lemma Iw {n:լ}{a b:լ->բ}(AF:n<=2^20) (d:∀k,kդ (a k)≠255/\դ (b k)≠255)(s:W):CU n a b s=ب n a b:=by unfold CU;simp only[];split;rename_i e;exact Iv AF d (by simpa using e);exact IW n a b d structure CH where V:է I:ե բ s:W Bj:ջ @[specialize] def B6 (x:լ->բ)(AJ:բ):(n b:լ)->է->ե բ->W->ջ->CH | 0,_,V,I,s,Bj=>⟨V,I,s,Bj⟩ | n+1,b,V,I,s,Bj=>let e:=x b;let a:=e&&&Չ;if a==0 then B6 x AJ n (b+1) V I s Bj else B6 x AJ n (b+1) (V.push (d e)) (I.push (b.toUInt32*AJ)) (s+d a) (Bj&&decide (a<Ջ)) def AU (x:լ->բ):(n a:լ)->כ լ | 0,_=>[] | n+1,a=>if x a&&&Չ==0 then AU x n (a+1)else a::AU x n (a+1) lemma Ix (V:է)(a:W):(V.push a).data.toList=V.data.toList++[a]:=by cases V;simp[Δ8] lemma Iy (x:լ->բ)(AJ:բ)(n b:լ)(V:է)(I:ե բ)(s:W)(Bj:ջ):(B6 x AJ n b V I s Bj).V.data.toList=V.data.toList++(AU x n b).map (λe=>d (x e))/\(B6 x AJ n b V I s Bj).I.toList=I.toList++(AU x n b).map (λe=>e.toUInt32*AJ)/\(B6 x AJ n b V I s Bj).s=(AU x n b).foldl (λa e=>a+d (x e&&&Չ)) s/\(B6 x AJ n b V I s Bj).Bj=(Bj&&(AU x n b).all λe=>decide (x e&&&Չ<Ջ)):=by induction n generalizing b V I s Bj with|zero=>simp[B6,AU]|succ n g=>simp only[B6,AU];split;exact g _ _ _ _ _;obtain⟨h,i,j,k⟩:=g (b+1) (V.push (d (x b))) (I.push (b.toUInt32*AJ)) (s+d (x b&&&Չ)) (Bj&&decide (x b&&&Չ<Ջ));refine⟨?_,?_,?_,?_⟩;rw[h,Ix];simp;rw[i];simp;rw[j];rfl;rw[k];simp[Bool.and_assoc] lemma D2 {x:լ->բ}{n b d:լ}(a:d∈AU x n b):b<=d/\d(simp[AU]at a)|succ n g=>simp only[AU]at a;split at a;obtain⟨h,i,e⟩:=g a;exact⟨by omega,by omega,e⟩;rename_i j;rcases List.mem_cons.mp a with rfl | k;exact⟨ն,by omega,by simpa using j⟩;obtain⟨h,i,e⟩:=g k;exact⟨by omega,by omega,e⟩ lemma Ge (x:լ->բ)(F:լ->ض)(e:∀b,(x b&&&Չ==0)=true->F b=0)(n a:լ):((AU x n a).map F).sum=((Θ a n).map F).sum:=by induction n generalizing a with|zero=>simp[AU]|succ n d=>simp only[AU,υ5,δ3,η6];split;rename_i g;rw[d,e a g,ֆ];simp only[δ3,η6,d] lemma FP (x:լ->բ)(F:լ->ض)(d:∀e,0<=F e)(n a:լ):((AU x n a).map F).sum<=((Θ a n).map F).sum:=by induction n generalizing a with|zero=>simp[AU]|succ n b=>simp only[AU,υ5,δ3,η6];split;have:=b (a+1);have:=d a;linarith;simp only[δ3,η6];have:=b (a+1);linarith lemma Ee (a:բ)(d:(a&&&Չ==0)=true):դ a=0/\AG a=0:=by have i:=a.toNat_lt;have j:(a&&&Չ).toNat=a.toNat%2^31:=(by rw[Ε];exact γ _ 31);have k:(a&&&Չ).toNat=0:=(by have:a&&&Չ=0:=(by simpa using d);rw[this];rfl);have e:(դ a).toNat=0:=(by rw[BJ];omega);have g:(ս a).toNat=0:=(by rw[CN];omega);have b:դ a=0:=ξ.mp (by rw[e];rfl);refine⟨b,?_⟩;have h:խ a=0:=(by simp[mantOf,b,g]);simp[AG,sv,h] lemma Gf {n:լ}{d e:լ->բ}{b:բ}{x y:լ->բ}{a:כ լ}(R:ջ)(AF:n<=2^20) (j:∀k,kդ (d k)≠255/\դ (e k)≠255)(Y:դ b≠255) (q:∀h,h∈a->դ (x h)≠255/\դ (y h)≠255)(r:a.length<=n) (t:BE d e 0 n=Du b x y a) (M:A7 b x y a<=Ck d e (Θ 0 n))(N:AL x y a<=BQ d e (Θ 0 n))(u:A7 b x y a<=AQ) {s:W}{k:ض}(v:BD (AO (A7 b x y a)) s (DV b x y a) (A7 b x y a) k)(w:0<=k)(z:k<=n) {g:W}(A:AC g)(B:0<=D g)(E:D g<=AQ) (F:((n:ض)+1)*AO (A7 b x y a)+J*A7 b x y a+Aa*AL x y a+2*Aa<=D g*(1-J)):(let l:=A2 s g;if l !=A1 then Cl R l else act R (CU n d e s))=act R (AX n d e):=by have o:(n:ض)<=2^20:=(by exact_mod_cast AF);have G:(a.length:ض)<=n:=(by exact_mod_cast r);have p:=IY b x y a Y q (by linarith only[G,o]);rw[<-t]at p;have O:0<=AL x y a:=δ8 (List.forall_mem_map.2 λ_ _=>օ (ը _) (ը _));have H:=congrFun (congrFun (congrFun IE n) d) e;simp only[];rw[H];split;rename_i i;have I:A2 s g≠A1:=(by simpa using i);obtain⟨K,L⟩:=Ie j v w z (by linarith only[o]) u p A B E F I;rw[K,FK _ _ λi=>absurd i L];rw[Iw AF j s] def A3 (K Am S a B:W):W:=K*(S*a+B)+BY*((Am*a+S)+Ba) lemma Gg {a b c:W}(g:AC a)(Y:AC b)(h:AC c)(d:0<=D a)(e:0<=D b)(i:0<=D c) (o:D a*D b<=AQ)(p:D c<=AQ):AC (a*b+c)/\0<=D (a*b+c)/\D a*D b+D c<=1001/1000*D (a*b+c)+4*AH/\D (a*b+c)<=2*(D a*D b+D c)+4*AH:=by have:=CR;have:=Cf;have:=ճ d e;obtain⟨j,k,q,BF⟩:=DU g Y d e Դ;obtain⟨l,n,r,CS⟩:=DD j h k i Դ;exact⟨l,n,by linarith,by linarith⟩ lemma Gh (x:լ->բ)(e:כ լ)(i:∀b,b∈e->դ (x b)≠255)(k:(e.length:ض)<=2^20):AC (e.foldl (λa g=>a+d (x g&&&Չ)) Ae)/\0<=D (e.foldl (λa g=>a+d (x g&&&Չ)) Ae)/\D (e.foldl (λa g=>a+d (x g&&&Չ)) Ae)<=2^Ո/\(e.map λb=> |D (d (x b))|).sum<=1001/1000*D (e.foldl (λa g=>a+d (x g&&&Չ)) Ae)+2^23*AH:=by set M:=(e.map λb=> |D (d (x b))|).sum;have p:M<=e.length*2^128:=DH e (λb h=>CF _ (i b h)) Գ;have q:=ա k (by positivity:Հ<=2^128);have Y:=CR;have Ao:=Dt;have h:=DC;have l:=(Bn (δ8 (List.forall_mem_map.2 λ_ _=>ը _)) (by linarith:M<=AQ)).1;obtain⟨f,n,r,t⟩:=Dw (λg=>d (x g&&&Չ)) (λb=> |D (d (x b))|) (M:=M) (x:=0) ն e (λb h=>by obtain⟨o,j⟩:=Dy _ (i b h);have:=B2 o l;rw[j,ע]at this;exact⟨this,by rw[j];exact ը _⟩) rfl Դ Դ ն (sub_le_self _ ն);exact⟨f,n,by linarith,by linarith⟩ lemma Iz (x y:լ->բ)(b:כ լ)(e:ض)(g:∀a,a∈b-> |D (d (y a))| <=e):(b.map λa=> |AW (x a) (y a)|).sum<=(b.map λa=> |D (d (x a))|).sum*e:=by rw[<-List.sum_map_mul_right];exact List.sum_le_sum λa h=>by rw[AW,ք];exact գ (g a h) (ը _) lemma Gi {n:լ}(AF:n<=2^20){b:բ}{x y:լ->բ}{a:כ լ} (Z:∀e,e∈a->դ (x e)≠255/\դ (y e)≠255)(v:a.length<=n){S g B:W} (j:AC S)(k:0<=D S)(w:D S<=2^Ո) (z:(a.map λe=> |D (d (x e))|).sum<=1001/1000*D S+2^23*AH) (l:AC g)(h:0<=D g)(i:D g<=2^Ճ)(o:∀e,e∈a-> |D (d (y e))| <=D g) (A:AC B)(E:0<=D B)(aa:D B<=2^Ճ)(ab: |D (d b)| <=D B):AC (A3 (Af n) (Ag n) S g B)/\0<=D (A3 (Af n) (Ag n) S g B)/\D (A3 (Af n) (Ag n) S g B)<=AQ/\((n:ض)+1)*AO (A7 b x y a)+J*A7 b x y a+Aa*AL x y a+2*Aa<=D (A3 (Af n) (Ag n) S g B)*(1-J)/\A7 b x y a<=AQ:=by have p:(n:ض)<=2^20:=(by exact_mod_cast AF);have q:(a.length:ض)<=n:=(by exact_mod_cast v);obtain⟨F,I,K⟩:=GX n AF;obtain⟨L,r,M⟩:=Ic n AF;have Y:=CR;have t:=CC;have Ao:=Dt;have ac:=DC;have u:0<=D (Ag n):=n.cast_nonneg.trans r;have ad:=տ w i h Գ;have ae:=տ M i h Գ;obtain⟨N,O,af,ag⟩:=Gg j l A k h E Դ Դ;obtain⟨P,Q,ah,ai⟩:=Gg L l j u h k Դ Դ;have aj:=Iz x y a _ o;have ak:=DH a o h;have al:=ա z h;have am:=ա (q.trans r) h;have an:=ա (q.trans p) t.le;have ao:=գ i t.le;have ap:A7 b x y a= |D (d b)| +((a.map λe=> |AW (x e) (y e)|).sum+a.length*(2^53*AH)):=(by rw[A7,GZ,GY]);have aq:AL x y a=(a.map λe=> |D (d (x e))|).sum+(a.map λe=> |D (d (y e))|).sum:=(by rw[AL,List.sum_map_add]);obtain⟨R,U,V,X⟩:=GW (G:=A7 b x y a) (H:=AL x y a) n.cast_nonneg p F I K N O Դ Դ (օ (ը _) (δ8 (List.forall_mem_map.2 λ_ _=>օ (ը _) Ch.le))) P Q Դ (by linarith[ճ u h]);exact⟨R,U,V,X,by linarith⟩ lemma CV (B:է)(i:ժ)(a:iԻhave d:iԻW):B5:=⟨F 0,F 1,F 2,F 3,F 4,F 5,F 6,F 7⟩ lemma I0 {V:է}{I:ե բ}{B:է}{p h:ժ} {G:pԻ+7<=BԼ}{AL:BԼ<2^31}{x:լ->բ}{y:լ->լ->W}{AJ:բ} (g:כ լ)(k:ժ)(l:כ W)(n:כ բ)(c:լ)(u:c=g.length) (q:V.data.toList=l++g.map (λe=>d (x e)))(v:l.length=kԻ) (r:I.toList=n++g.map (λe=>e.toUInt32*AJ))(w:n.length=kԻ) (H:kԻ+c<=VԼ)(Ar:kԻ+c<=IԼ)(J:kԻ+c<2^31) (z:∀b,b∈g->(b.toUInt32*AJ)Խ+h∀m,m<8->B.data[((b.toUInt32*AJ)Խ+h)Ի+m]! =y m b)(A:լ->W): Ec V I B p h G AL c k H Ar J (AY A).A8 (AY A).AZ (AY A).Ac (AY A).At (AY A).Ax (AY A).A0 (AY A).A9 (AY A).A_= AY λm=>g.foldl (λa e=>a+d (x e)*y m e) (A m):=by induction g generalizing c k l n A with | nil=>subst u;rfl | cons b g K=> obtain rfl:c=g.length+1:=u have D:=Al k Ա simp only[δ3]at q r have L:V.uget k Ա=d (x b):=by rw[CV,<-v] exact Ef V.data l _ _ q have M:I.uget k Ա=b.toUInt32*AJ:=by rw[BR,<-w] exact Ef I n _ _ r have E:=z b Ե have O:=Au E have i:∀(m:լ) (e:ժ) (j:eԻ=m) (F:m<8) (o:((b.toUInt32*AJ)Խ+h+e)Իz e (by simp[j])) (λe j=>t e (by simp[j])) λm=>A m+d (x b)*y m b lemma CI (a b:բ):(դ a)Ի<=(դ (a ||| b))Ի/\(դ b)Ի<=(դ (a ||| b))Ի:=by rw[BJ,BJ,BJ,Δ9,Nat.or_div_two_pow,Nat.or_mod_two_pow];exact⟨ψ2,Ε0⟩ structure Eg where f:B5 o:բ def Eh (V:է)(I b:ե բ)(n e g:ժ)(u:eԻ+7*nԻ<=bԼ) (AL:bԼ<2^31):(c:լ)->(k:ժ)->(kԻ+c<=VԼ)->(kԻ+c<=IԼ)->(kԻ+c<2^31)->W->W->W->W->W->W->W->W->բ->Eg | 0,_,_,_,_,A8,AZ,Ac,At,Ax,A0,A9,A_,o=>⟨⟨A8,AZ,Ac,At,Ax,A0,A9,A_⟩,o⟩ | c+1,k,w,Ar,y,A8,AZ,Ac,At,Ax,A0,A9,A_,o=>have z:=Al k Ա;let x:=V.uget k Ա;let a:=(I.uget k Ա)Խ+g;if v:aլ->բ)(b:כ լ)(o:բ):բ:=b.foldl (λo a=>o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a ||| y 4 a ||| y 5 a ||| y 6 a ||| y 7 a) o lemma Gj (y:լ->լ->բ)(b:כ լ)(o:բ):(դ o)Ի<=(դ (CW y b o))Ի/\∀d,d∈b->∀m,m<8->(դ (y m d))Ի<=(դ (CW y b o))Ի:=by induction b generalizing o with|nil=>exact⟨ն,λd e=>absurd e Ե⟩|cons a b g=>obtain⟨l,h⟩:=g (o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a ||| y 4 a ||| y 5 a ||| y 6 a ||| y 7 a);have n:=CI (o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a ||| y 4 a ||| y 5 a ||| y 6 a) (y 7 a);have p:=CI (o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a ||| y 4 a ||| y 5 a) (y 6 a);have q:=CI (o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a ||| y 4 a) (y 5 a);have r:=CI (o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a) (y 4 a);have t:=CI (o ||| y 0 a ||| y 1 a ||| y 2 a) (y 3 a);have u:=CI (o ||| y 0 a ||| y 1 a) (y 2 a);have v:=CI (o ||| y 0 a) (y 1 a);have w:=CI o (y 0 a);have i:CW y (a::b) o=CW y b (o ||| y 0 a ||| y 1 a ||| y 2 a ||| y 3 a ||| y 4 a ||| y 5 a ||| y 6 a ||| y 7 a):=rfl;rw[i];refine⟨by omega,λd e m j=> ?_⟩;rcases List.mem_cons.mp e with rfl | k;have:m=0\/m=1\/m=2\/m=3\/m=4\/m=5\/m=6\/m=7:=Ա;rcases this with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl<;>omega;exact h d k m j lemma I1 {V:է}{I j:ե բ}{n t r:ժ} {K:tԻ+7*nԻ<=jԼ}{AL:jԼ<2^31}{x:լ->բ}{y:լ->լ->բ}{AJ:բ} (g:כ լ)(k:ժ)(p:כ W)(q:כ բ)(c:լ)(w:c=g.length) (u:V.data.toList=p++g.map (λe=>d (x e)))(z:p.length=kԻ) (v:I.toList=q++g.map (λe=>e.toUInt32*AJ))(B:q.length=kԻ) (L:kԻ+c<=VԼ)(Ar:kԻ+c<=IԼ)(M:kԻ+c<2^31) (D:∀b,b∈g->(b.toUInt32*AJ)Խ+r∀m,m<8->j[((b.toUInt32*AJ)Խ+r)Ի+m*nԻ]! =y m b) (A:լ->W)(o:բ): Eh V I j n t r K AL c k L Ar M (AY A).A8 (AY A).AZ (AY A).Ac (AY A).At (AY A).Ax (AY A).A0 (AY A).A9 (AY A).A_ o= ⟨AY λm=>g.foldl (λa e=>a+d (x e)*d (y m e)) (A m),CW y g o⟩:=by induction g generalizing c k p q A o with | nil=>subst w;rfl | cons b g N=> obtain rfl:c=g.length+1:=w have F:=Al k Ա simp only[δ3]at u v have O:V.uget k Ա=d (x b):=by rw[CV,<-z] exact Ef V.data p _ _ u have P:I.uget k Ա=b.toUInt32*AJ:=by rw[BR,<-B] exact Ef I q _ _ v have G:=D b Ե have ab:=Au G set h:=(b.toUInt32*AJ)Խ+r with Q have R:=AT h n Ա have S:=AT (h+n) n Ա have U:=AT (h+n+n) n Ա have X:=AT (h+n+n+n) n Ա have Y:=AT (h+n+n+n+n) n Ա have Z:=AT (h+n+n+n+n+n) n Ա have aa:=AT (h+n+n+n+n+n+n) n Ա have i:∀(m:լ) (e:ժ) (l:eԻ=hԻ+m*nԻ) (H:m<8) (J:eԻD e (by simp[l])) (λe l=>E e (by simp[l])) (λm=>A m+d (x b)*d (y m b)) _ lemma Co (a:է)(q:ժ)(d:W)(b:qԻshow(e.set qԻ d b)Լ=eԼ;exact Ε6 b def Gk:է:=⟨δ 1024 0⟩ def Gl:է:=⟨δ 8192 0⟩ def Gm:է:=⟨δ 65536 0⟩ @[inline] def Br (n:լ):է:=if n<=1024 then Gk else if n<=8192 then Gl else if n<=65536 then Gm else⟨δ n 0⟩ lemma I2:GkԼ=1024:=θ7 .. lemma I3:GlԼ=8192:=θ7 .. lemma I4:GmԼ=65536:=θ7 .. lemma Ei (n:լ):n<=(Br n)Լ/\(Br n)Լ<=n+65536:=by unfold Br;split_ifs;rw[I2];omega;rw[I3];omega;rw[I4];omega;rw[show(FloatArray.mk (δ n 0))Լ=n from θ7 ..];omega lemma FQ {α:Type}[Inhabited α](A:ե α)(q:ժ)(b:α)(e:qԻh j.symm)];have g:¬a<(A.setIfInBounds qԻ b)Լ:=(by simpa using d);rw[getElem!_neg _ a g,getElem!_neg _ a d,ր Ա] lemma Ej (a:է)(q:ժ)(d:W)(e:qԻexact FQ g q d e b def B7 (g:ե բ)(e:ժ)(i:eԻ<2^31):(c:լ)->(a q:ժ)->(aԻ+c<=gԼ)->(aԻ+c<2^31)->(b:է)->(eԻ<=bԼ)->բ->է×բ | 0,_,_,_,_,b,_,o=>(b,o) | c+1,a,q,l,n,b,j,o=>if k:qrfl|succ c k=>rw[B7];split;simp only[];rw[k,Co];rfl lemma DW:(8:ժ)Ի=8:=Bh 8 Բ lemma I5 (b:ե բ)(e:ժ)(n:e.toNat<2^31)(c:լ)(a q:ժ) (p:a.toNat+c<=b.size)(r:a.toNat+c<2^31)(g:է)(l:e.toNat<=g.size)(o:բ) (K:q.toNat+c*8<=e.toNat+7):(∀i,i(B7 b e n c a q p r g l o).1.data[q.toNat+i*8]! =d b[a.toNat+i]!)/\(∀h,(∀i,ih≠q.toNat+i*8)->(B7 b e n c a q p r g l o).1.data[h]! =g.data[h]!)/\(դ o).toNat<=(դ (B7 b e n c a q p r g l o).2).toNat/\(∀i,a.toNat<=i->i(դ b[i]!).toNat<=(դ (B7 b e n c a q p r g l o).2).toNat):=by induction c generalizing a q g o with|zero=>exact⟨λi k=>absurd k Ա,λh _=>rfl,ն,λi _ k=>absurd k Ա⟩|succ c z=>have u:qhave H:q.toNat+0*8=q.toNat:=Ա;rw[H,v _ (λj _=>by rw[t];omega),Ej,վ rfl,BR];rfl|succ i=>have x:=B i Ա;have I:(q+8).toNat+i*8=q.toNat+(i+1)*8:=(by rw[t];ring);have J:(a+1).toNat+i=a.toNat+(i+1):=(by rw[A];ring);rw[I,J]at x;exact x);intro h y;rw[v h (λj M=>by have:=y (j+1) Ա;rw[t];have AE:q.toNat+(j+1)*8=q.toNat+8+j*8:=Զ;rwa[AE]at this),Ej,ր];have:=y 0 Ա;simpa using this;intro i N O;by_cases k:i=a.toNat;rw[k,<-G];exact F.trans w;exact D i Ա Ա def B8 (e:ե բ)(d:ժ)(g:dԻ<2^31)(n:ժ):(m:լ)->(a q:ժ)->(aԻ+m*nԻ<=eԼ)->(aԻ+m*nԻ<2^31)->(b:է)->(dԻ<=bԼ)->բ->է×բ | 0,_,_,_,_,b,_,o=>(b,o) | m+1,a,q,i,j,b,h,o=>have k:(m+1)*nԻ=m*nԻ+nԻ:=δ4 _ _;have l:(a+n)Ի=aԻ+nԻ:=AT a n Ա;let r:=B7 e d g nԻ a q Ա Ա b h o;B8 e d g n m (a+n) (q+1) Ա Ա r.1 (by rw[FR];exact h) r.2 lemma Gn (k:ե բ)(h:ժ)(p:hԻ<2^31)(n:ժ)(O:hԻ=8*nԻ) (m:լ)(g q:ժ)(r:gԻ+m*nԻ<=kԼ)(t:gԻ+m*nԻ<2^31) (j:է)(l:hԻ<=jԼ)(o:բ)(P:qԻ+m<=8):(B8 k h p n m g q r t j l o).1.size=jԼ/\(∀e,qԻ<=e%8->e%8e(B8 k h p n m g q r t j l o).1.data[e]! =d k[gԻ+(e%8-qԻ)*nԻ+e/8]!)/\(∀e,(e%8(B8 k h p n m g q r t j l o).1.data[e]! =j.data[e]!)/\(դ o)Ի<=(դ (B8 k h p n m g q r t j l o).2)Ի/\(∀a b,a< m->b(դ k[gԻ+a*nԻ+b]!)Ի<=(դ (B8 k h p n m g q r t j l o).2)Ի):=by induction m generalizing g q j o with|zero=>exact⟨rfl,λe D v _=>absurd v Ա,λe _=>rfl,ն,λa b w=>absurd w Ա⟩|succ m E=>have Q:(m+1)*nԻ=m*nԻ+nԻ:=δ4 _ _;have x:(g+n)Ի=gԻ+nԻ:=AT g n Ա;have F:=Al q Ա;rw[B8];obtain⟨G,H,I,J⟩:=I5 k h p nԻ g q Ա Ա j l o Ա;obtain⟨K,y,u,z,L⟩:=E (g+n) (q+1) Ա Ա (B7 k h p nԻ g q Ա Ա j l o).1 (by rw[FR];exact l) (B7 k h p nԻ g q Ա Ա j l o).2 Ա;rw[F]at y u;refine⟨by rw[K,FR],?_,?_,I.trans z,?_⟩;intro e D v M;by_cases A:e%8=qԻ;rw[u e Ա];have AE:e=qԻ+e/8*8:=Ա;have AK:e/8by omega)];intro a b w Y;((cases a with|zero=>exact(J _ Ա Ա).trans z|succ a=>have B:=L a b Ա Y;have N:(g+n)Ի+a*nԻ+b=gԻ+(a+1)*nԻ+b:=(by rw[x,δ4];omega);rw[N]at B;exact B)) def DX (d:ե բ)(a:ժ)(g:aԻ<=dԼ)(h:aԻ<2^31)(b:ժ)(o:բ):բ:= if e:bi(դ d[i]!).toNat<=(դ (DX d b g h a o)).toNat:=by induction c generalizing a o with|zero=>rw[DX,dif_neg (by show ¬a.toNatabsurd e Ա⟩|succ c k=>have l:a ?_⟩;by_cases e:i=a.toNat;rw[e,<-BR d a Ա];exact q.trans j;exact n i Ա r def BS (a:ե բ):բ:=if b:aԼ<2^31 then DX a a.sizeԽ (ך (Bh _ Ա)) (by rw[show a.sizeԽԻ=aԼ from Bh _ Ա];exact b) 0 0 else 0xFFFFFFFF lemma D3 (a:ե բ)(i:լ)(e:iբ)(n a:լ):(AU x n a).length<=n:=by induction n generalizing a with|zero=>simp[AU]|succ n b=>simp only[AU];split;have:=b (a+1);omega;simp only[η8];have:=b (a+1);omega lemma I7 (x:լ->բ)(n a:լ)(d:(AU x n a).length=n):∀b,a<=b->bb∈AU x n a:=by induction n generalizing a with|zero=>intro b e g;omega|succ n h=>intro b e g;simp only[AU]at d⊢;split at d;have:=D4 x n (a+1);omega;rename_i i;rw[ր i];simp only[η8]at d;by_cases j:b=a;subst j;simp;exact ψ7 _ (h (a+1) Ա b Ա Ա) lemma Go:D (d ן)=1/\AG ן=1:=by obtain⟨-,b⟩:=FJ;have a:D (d ן)=1:=b;refine⟨a,?_⟩;obtain⟨-,e,-⟩:=Bo ן Է;rw[<-e Է,a] lemma Gp {Z:լ}{x y:լ->բ}{d:բ}(AP:∀a,aդ (x a)≠255)(e:∀a,aդ (y a)≠255) (Y:դ d≠255):∀k,kդ (if kբ}{b:բ}(AP:∀a,aդ (x a)≠255)(d:∀a,aդ (y a)≠255) (Y:դ b≠255):AX (Z+1) (λa=>if aif aif aif aby by_cases e:ksimp[e]) lemma Gq {Z:լ}(AF:Z+1<=2^20)(x y:լ->բ)(g:բ)(R:ջ) (AP:∀e,eդ (x e)≠255)(p:∀e,eդ (y e)≠255)(Y:դ g≠255){S j B:W} (z:AC S)(A:0<=D S)(E:D S<=2^Ո)(h:כ լ)(l:∀e,e∈h->eض,(∀n,0<=F n)->(h.map F).sum<=((Θ 0 Z).map F).sum) (H:((Θ 0 Z).map λe=>AG (x e)*AG (y e)).sum=(h.map λe=>AG (x e)*AG (y e)).sum) (I:(h.map λe=> |D (d (x e))|).sum<=1001/1000*D S+2^23*AH) (J:AC j)(K:0<=D j)(L:D j<=2^Ճ)(M:∀e,e |D (d (y e))| <=D j) (N:AC B)(O:0<=D B)(P:D B<=2^Ճ)(Q: |D (d g)| <=D B){s:W}{k:ض} (U:A7 g x y h<=AQ->BD (AO (A7 g x y h)) s (DV g x y h) (A7 g x y h) k)(V:0<=k)(X:k<=Z+1):(let t:=A2 s (A3 (Af (Z+1)) (Ag (Z+1)) S j B);if t !=A1 then Cl R t else act R (CU (Z+1) (λe=>if eif eif eif eդ (x e)≠255/\դ (y e)≠255:=λe i=>⟨AP e (l e i),p e (l e i)⟩;obtain⟨AE,AK,Ao,aa,v⟩:=Gi AF (b:=g) u q z A E I J K L (λe i=>M e (l e i)) N O P Q;have w:∀e,e∈Θ 0 Z->e(by have:=List.mem_range'_1.mp i;omega);have o:∀G:բ->բ->ض,((Θ 0 (Z+1)).map λe=>G (if eG (x e) (y e)).sum+G ן g:=λG=>(by rw[List.range'_concat,List.map_append,List.sum_append,List.map_congr_left λe i=>by rw[վ (w e i),վ (w e i)]];simp);obtain⟨ab,ac⟩:=Go;have ad:((Z+1:լ):ض)=Z+1:=Թ;refine Gf R AF (Gp AP p Y) Y u q ?_ ?_ ?_ v (U v) V (by rw[ad];exact X) AE AK Ao aa;rw[FO,Du,o λa b=>AG a*AG b,ac,ט,H,add_comm];unfold A7 Ck;rw[o λa b=> |AW a b| +Ak];have ae: |AW ן g| = |D (d g)| :=(by rw[AW,ab,ט]);linarith only[r (λe=> |AW (x e) (y e)| +Ak) (λn=>օ (ը _) Ch.le),Ch,ae];unfold AL BQ;rw[o λa b=> |D (d a)| + |D (d b)|];linarith only[r (λe=> |D (d (x e))| + |D (d (y e))|) (λn=>օ (ը _) (ը _)),օ (ը (D (d ן))) (ը (D (d g)))] lemma Gr {Z:լ}(AF:Z+1<=2^20)(x y:լ->բ)(e:բ)(R:ջ) (AP:∀b,bդ (x b)≠255)(j:∀b,bդ (y b)≠255)(Y:դ e≠255){S g B:W} (o:AC S)(p:0<=D S)(q:D S<=2^Ո) (r:((AU x Z 0).map λb=> |D (d (x b))|).sum<=1001/1000*D S+2^23*AH) (t:AC g)(u:0<=D g)(v:D g<=2^Ճ)(w:∀b,b |D (d (y b))| <=D g) (z:AC B)(A:0<=D B)(E:D B<=2^Ճ)(G: |D (d e)| <=D B):(let s:=(AU x Z 0).foldl (λa b=>a+d (x b)*d (y b)) (d e);let k:=A2 s (A3 (Af (Z+1)) (Ag (Z+1)) S g B);if k !=A1 then Cl R k else act R (CU (Z+1) (λb=>if bif bif bif bb(by have:=(D2 h).2.1;omega);have l:(AU x Z 0).length<=Z+1:=(D4 x Z 0).trans Ա;have H:((Z+1:լ):ض)<=2^20:=(by exact_mod_cast AF);have n:((AU x Z 0).length:ض)<=Z+1:=(by exact_mod_cast l);have I:Ծ^20<=2^21:=Բ;have J:((Z+1:լ):ض)=Z+1:=Թ;exact Gq AF x y e R AP j Y o p q _ i l (λF K=>FP x F K Z 0) (Ge x _ (λN L=>by rw[(Ee _ L).2,ק]) Z 0).symm r t u v w z A E G (λM=>FI e x y _ Y (λb h=>⟨AP b (i b h),j b (i b h)⟩) (by linarith only[n,H,J,I]) M) (Χ _) n lemma Ai:(0:ժ)Ի=0:=Bh 0 Բ lemma Aq (x:լ)(a:x<2^32):xԽԻ=x:=Bh x a @[inline] def Cp (AA:ե բ)(i:ժ)(a:բ):ե բ:=if b:iԻW->զ)(s:W)(i:ժ):զ:=let a:=A2 s b;if a !=A1 then Cl R a else d i s @[inline] def BM (a:W)(R:ջ)(b:ժ->W->զ)(s:W)(i:ժ)(AA:ե զ):ե զ:=Cp AA i (Bc a R b s i) @[inline] def Ek (a:W)(R:ջ)(b:ժ->W->զ)(f:B5)(i:ժ)(AA:ե զ):ե զ:=let AA:=BM a R b f.A8 i AA;let AA:=BM a R b f.AZ (i+1) AA;let AA:=BM a R b f.Ac (i+2) AA;let AA:=BM a R b f.At (i+3) AA;let AA:=BM a R b f.Ax (i+4) AA;let AA:=BM a R b f.A0 (i+5) AA;let AA:=BM a R b f.A9 (i+6) AA;BM a R b f.A_ (i+7) AA def Ad (AS:լ->զ)(N:լ)(P:լ->Prop)(AA:ե զ):Prop:=AAԼ=N/\∀q,P q->AA[q]! =AS q lemma Bs {AS:լ->զ}{N:լ}{P Q:լ->Prop}{AA:ե զ}(a:Ad AS N P AA) (b:∀q,Q q->P q):Ad AS N Q AA:=⟨a.1,λq d=>a.2 q (b q d)⟩ lemma Cq {AS:լ->զ}{N:լ}{P:լ->Prop}{d:W}{R:ջ}{e:ժ->W->զ}{s:W}{i:ժ}{a k:լ} {AA:ե զ}(g:iԻ=a+k)(r:a+kBc d R e s h=AS (a+k)) (b:Ad AS N (λq=>P q\/(a<=q/\qP q\/(a<=q/\q ?_⟩;show(Cp AA i _)[q]! =_;rw[FT _ _ _ Ա,g];split;rename_i j;rw[j];exact l i g;rename_i j;exact b q (o.imp id λp=>⟨p.1,by omega⟩) lemma FU {AS:լ->զ}{N:լ}{P:լ->Prop}{e:W}{R:ջ}{g:ժ->W->զ}(F:լ->W){a:լ} {AA:ե զ}(n:a+8<=N)(o:N<2^31) (b:∀m,m<8->∀h:ժ,hԻ=a+m->Bc e R g (F m) h=AS (a+m))(j:Ad AS N P AA):Ad AS N (λq=>P q\/(a<=q/\qm<8->(aԽ+k)Ի=a+m:=λk m i p=>(by rw[AT _ _ (by rw[d,i];omega),d,i]);exact Cq (k:=7) (A 7 7 D1 Բ) Ա (b 7 Բ)<|Cq (k:=6) (A 6 6 D0 Բ) Ա (b 6 Բ)<|Cq (k:=5) (A 5 5 Dz Բ) Ա (b 5 Բ)<|Cq (k:=4) (A 4 4 DG Բ) Ա (b 4 Բ)<|Cq (k:=3) (A 3 3 CT Բ) Ա (b 3 Բ)<|Cq (k:=2) (A 2 2 CS Բ) Ա (b 2 Բ)<|Cq (k:=1) (A 1 1 BF Բ) Ա (b 1 Բ)<|Cq (k:=0) d Ա (b 0 Բ) (Bs j λq l=>l.resolve_right Ա) lemma CY {AS:լ->զ}{N:լ}{P:լ->Prop}{AA:ե զ}(AW:∀q,qP q)(a:Ad AS N P AA):AA=υ (n:=N) λq=>AS q.val:=by apply Array.ext (by simp[a.1]);intro i b d;have:=a.2 i (AW i (a.1▸b));rw[ո AA i b]at this;simpa using this @[specialize] def By {α:Type}(k b:լ)(AJ:լ->α->α):(d j:լ)->α->α | 0,_,a=>a | f+1,j,a=>if j+k<=b then By k b AJ f (j+k) (AJ j a)else if jα->α)(Q:լ->α->Prop) (g:∀j m a,j+k<=b->j<=m->m<=j+k->Q m a->Q (j+k) (AJ j a))(a:α)(l:Q 0 a):Q b (By k b AJ (b/k+1) 0 a):=by have n:∀(e j:լ) (a:α),Q j a->j<=b->b<=j+e*k->Q b (By k b AJ e j a):=(by intro e;(induction e with|zero=>intro j a d o h;have:j=b:=Ա;subst this;exact d|succ f p=>intro j a d o h;rw[By];split;rename_i q;exact p (j+k) _ (g j j a q ն Ա d) Ա (by rw[δ4]at h;omega);split;have:=g (b-k) j a Ա Ա Ա d;rwa[show b-k+k=b by omega]at this;have:j=b:=Ա;subst this;exact d));refine n _ 0 a l Ա ?_;have t:=ι8 b k;have u:=η3 b i;rw[δ4,ρ3 (b/k)];omega @[specialize] def Cr {α:Type}(f:լ->α->α):(c r:լ)->α->α | 0,_,a=>a | c+1,r,a=>Cr f c (r+1) (f r a) lemma El {α:Type}{AB:լ}(f:լ->α->α)(Q:լ->α->Prop)(d:∀r a,rQ r a->Q (r+1) (f r a))(a:α) (e:Q 0 a):Q AB (Cr f AB 0 a):=by have g:∀(c r:լ) (a:α),r+c=AB->Q r a->Q AB (Cr f c r a):=(by intro c;(induction c with|zero=>intro r a h b;have:r=AB:=Ա;subst this;exact b|succ c i=>intro r a h b;exact i (r+1) _ Ա (d r a Ա b)));exact g AB 0 a Ա e lemma I9 {AS:լ->զ}{N n k r:լ}(e:0ե զ->ե զ) (g:∀j (P:լ->Prop) a,j+k<=n->Ad AS N P a->Ad AS N (λq=>P q\/(r*n+j<=q/\qqqAd AS N (λq=>qby refine Bs (g j _ a o p) λq b=> ?_ rcases b.2 with d | ⟨d,t⟩ ·exact א ⟨b.1,א d⟩ ·by_cases u:q%n< m ·exact א ⟨b.1,ؠ ⟨d,u⟩⟩ ·right have v:=ι8 q n rw[d,ρ3]at v omega) a (Bs h λq b=>⟨b.1,by rcases b.2 with d | ⟨-,t⟩ ·exact d ·omega⟩) refine Bs l λq b=>⟨b.1,?_⟩ by_cases d:q/nզ}{N n AB:լ}(AF:0ե զ->ե զ) (e:∀r a,rAd AS N (λq=>qAd AS N (λq=>qAS q.val:=CY (λq b=>⟨b,(Κ AF).2 (d▸b)⟩) (El f (λr a=>Ad AS N (λq=>qabsurd b.2 (θ1 _)⟩) def AV (o:բ):W:=BL ((դ o).toUInt64+897) lemma Cs (o:բ)(h:դ o≠255):AC (AV o)/\0<=D (AV o)/\D (AV o)<=2^Ճ/\∀a:բ,(դ a).toNat<=(դ o).toNat->դ a≠255/\ |D (d a)| <=D (AV o):=by have i:=փ o;have j:(դ o).toNat≠255:=λb=>h (ξ.mp (by simpa using b));have AF:((դ o).toUInt64+897).toNat=(դ o).toNat+897:=(by rw[Ψ,ξ4];show((դ o).toNat+897)%_=_;omega);obtain⟨f,e⟩:=DE ((դ o).toUInt64+897) Ա Ա;rw[AF]at e;have AE:(((դ o).toNat+897:լ):ص)-1023=((դ o).toNat:ص)-126:=Թ;rw[AE]at e;refine⟨f,?_,?_,?_⟩;show 0<=D (BL _);rw[e];positivity;show D (BL _)<=_;rw[e,<-յ];exact շ Բ (by push_cast;omega);intro a k;have g:(դ a).toNat≠255:=Ա;refine⟨λb=>g (by rw[b];rfl),?_⟩;refine(EV a (λb=>g (by rw[b];rfl))).trans ?_;show _<=D (BL _);rw[e];exact շ Բ Ա lemma FV (a:լ)(AJ:բ)(b:a*AJԻ<2^32)(d:a<2^32):(a.toUInt32*AJ).toUSize.toNat=a*AJԻ:=by rw[ο1,UInt32.toNat_mul,ο6,δ9];rw[θ d];exact θ b def BT (R:ջ)(a O:լ)(X e b:ե զ)(q:լ):զ:=act R (AX (a+1) (λd=>if dif dif dif dX[r*a+b]!) AJ a 0 (Υ a) (γ3 a) Ae true @[inline] def Em (e:W)(R:ջ)(g:ժ->W->զ)(B:է)(d h:ժ)(i:dԻ+7<=BԼ) (AL:BԼ<2^31)(b:CH)(a:B5)(q:լ)(AA:ե զ):ե զ:=if j:b.VԼ<=b.IԼ/\b.VԼ<2^31 then Ek e R g (Ec b.V b.I B d h i AL b.VԼ 0 (by have:=Ai;omega) (by have:=Ai;omega) (by have:=Ai;omega) a.A8 a.AZ a.Ac a.At a.Ax a.A0 a.A9 a.A_) qԽ AA else AA @[inline] def JA (R:ջ)(AB g O:լ)(X h b:ե զ)(K Am i Ay:W)(a:է)(e:ժ) (k:eԻ+7<=aԼ)(AL:aԼ<2^31)(d:ե CH)(j:լ)(l:B5)(AA:ե զ):ե զ:=Cr (λr AA=>if n:rd b[j+m]!) e.2.1,r.2)else e else e def FX (R:ջ)(h O:լ)(X g b:ե զ)(K Am Ay:W)(e:CH)(i n:ժ) (l:iԻ+7*nԻ<=gԼ)(AL:gԼ<2^31)(o:e.VԼ<=e.IԼ/\e.VԼ<2^31) (j:լ)(k:ե զ×բ):ե զ×բ:= let a:=AY λm=>d b[j+m]! let r:=Eh e.V e.I g n i (j*h)Խ l AL e.VԼ 0 (by have:=Ai;omega) (by have:=Ai;omega) (by have:=Ai;omega) a.A8 a.AZ a.Ac a.At a.Ax a.A0 a.A9 a.A_ k.2 (Ek (A3 K Am e.s (AV r.o) Ay) R (CZ R h O X g b) r.f jԽ k.1,r.o) def FY (a O:լ)(R:ջ)(X d b:ե զ)(h:բ)(e:CH):ե զ:= if g:e.V.size<=e.I.size/\e.V.size<2^31/\(d.size-7*a).toUSize.toNat+7*a.toUSize.toNat<=d.size/\d.size<2^31/\ e.Bj=true/\դ h≠255 then let r:=By 8 O (FX R a O X d b (Af (a+1)) (Ag (a+1)) (AV h) e (d.size-7*a).toUSize a.toUSize g.2.2.1 g.2.2.2.1 ⟨g.1,g.2.1⟩) (O/8+1) 0 (δ O 0,if e.V.size==a then 0 else BS d) if դ r.2 !=255 then r.1 else պ AX 1 a O R X d b else պ AX 1 a O R X d b @[inline] def Bt (X:ե զ)(a:լ)(AJ:բ)(AB:լ):ե CH:=υ (n:=AB) λr=>BC X a AJ r.val def D6 (AB a O:լ)(R:ջ)(X d b:ե զ):ե զ:= if h:XԼ=AB*a/\dԼ=O*a/\bԼ=O/\8<=O/\0բ)(n a b:լ)(h:a<=b)(i:bomega|succ n e=>simp only[AU];by_cases g:b=a;subst g;rw[d];simp;have:=e (a+1) Ա Ա;split;exact this;exact ψ7 _ this lemma JC (x:լ->բ)(n:լ) (d:((AU x n 0).all λe=>decide (x e&&&Չ<Ջ))=true):∀a,aդ (x a)≠255:=by intro a p;by_cases b:(x a&&&Չ==0)=true;rw[(Ee _ b).1];decide;have g:=JB x n 0 a Ա Ա (by simpa using b);have h:=List.all_eq_true.mp d a g;have i:x a&&&Չ<Ջ:=(by simpa using h);have j:(x a&&&Չ).toNat<Ջ:=i;have k:(x a&&&Չ).toNat=(x a).toNat%2^31:=(by rw[Ε];exact γ _ 31);rw[k]at j;have q:=(x a).toNat_lt;intro l;have o:(դ (x a)).toNat=255:=(by rw[l];rfl);rw[BJ]at o;omega lemma FZ (X:ե զ)(b:լ)(AJ:բ)(r:լ):(BC X b AJ r).V.data.toList=(AU (λe=>X[r*b+e]!) b 0).map (λg=>d (X[r*b+g]!))/\(BC X b AJ r).I.toList=(AU (λe=>X[r*b+e]!) b 0).map (λg=>g.toUInt32*AJ)/\(BC X b AJ r).s=(AU (λe=>X[r*b+e]!) b 0).foldl (λa g=>a+d (X[r*b+g]!&&&Չ)) Ae/\((BC X b AJ r).Bj=true->∀e,eդ (X[r*b+e]!)≠255):=by obtain⟨h,i,j,k⟩:=Iy (λe=>X[r*b+e]!) AJ b 0 (Υ b) (γ3 b) Ae true;refine⟨h,?_,j,?_⟩;show(B6 (λe=>X[r*b+e]!) AJ b 0 (Υ b) (γ3 b) Ae true).I.toList=_;simpa using i;intro l;have n:((AU (λe=>X[r*b+e]!) b 0).all λg=>decide (X[r*b+g]!&&&Չ<Ջ))=true:=(by have:(B6 (λe=>X[r*b+e]!) AJ b 0 (Υ b) (γ3 b) Ae true).Bj=true:=l;rw[k]at this;simpa using this);exact JC (λe=>X[r*b+e]!) b n lemma Gs {V:է}{I:ե բ}{a:כ լ}{f:լ->W}{b:լ->բ} (d:V.data.toList=a.map f)(e:I.toList=a.map b):VԼ=a.length/\IԼ=a.length:=⟨by show V.dataԼ=_;rw[<-ο9,d,Ε1],by rw[<-ο9,e,Ε1]⟩ def Ct (Z:լ)(X:ե զ)(r:լ)(y:լ->բ)(e:բ):W:=(AU (λb=>X[r*Z+b]!) Z 0).foldl (λa b=>a+d (X[r*Z+b]!)*d (y b)) (d e) lemma Fa (X:ե զ){Z:լ}(AF:Z<2^19){AJ:բ}{r:լ}(i:(BC X Z AJ r).Bj=true):(∀a,aդ (X[r*Z+a]!)≠255)/\AC (BC X Z AJ r).s/\0<=D (BC X Z AJ r).s/\D (BC X Z AJ r).s<=2^Ո/\((AU (λa=>X[r*Z+a]!) Z 0).map λa=> |D (d (X[r*Z+a]!))|).sum<=1001/1000*D (BC X Z AJ r).s+2^23*AH:=by obtain⟨-,-,j,k⟩:=FZ X Z AJ r;have AP:=k i;have l:(((AU (λa=>X[r*Z+a]!) Z 0).length:լ):ض)<=2^20:=(by have p:=D4 (λa=>X[r*Z+a]!) Z 0;have n:(AU (λa=>X[r*Z+a]!) Z 0).length<=2^20:=Ա;exact_mod_cast n);obtain⟨b,e,g,h⟩:=Gh (λa=>X[r*Z+a]!) (AU (λa=>X[r*Z+a]!) Z 0) (λa o=>AP a (by have:=(D2 o).2.1;omega)) l;rw[<-j]at b e g h;exact⟨AP,b,e,g,h⟩ lemma DY {q r j n:լ}(b:q=r*n+j)(a:jզ}{N:լ}{P:լ->Prop}{k:W}{R:ջ}{l:ժ->W->զ}{X:ե զ}{Z r:լ}{AJ:բ} {B:է}{i e:ժ}{w:iԻ+7<=BԼ}{AL:BԼ<2^31}(y:լ->լ->բ)(j:լ->բ){g:լ}{AA:ե զ} (H:Z<2^19)(n:∀a,aa*AJԻ+eԻ< iԻ) (z:∀a m,am<8->B.data[a*AJԻ+eԻ+m]! =d (y m a)) (A:g+8<=N)(D:N<2^31) (E:∀m,m<8->∀o:ժ,oԻ=g+m->Bc k R l (Ct Z X r (y m) (j m)) o=AS (g+m)) (F:Ad AS N P AA):Ad AS N (λq=>P q\/(g<=q/\qd (j m)) g AA):=by obtain⟨p,t,-,-⟩:=FZ X Z AJ r;obtain⟨u,Ar⟩:=Gs p t;have I:=D4 (λa=>X[r*Z+a]!) Z 0;have h:∀a,a∈AU (λa=>X[r*Z+a]!) Z 0->a(by have:=(D2 h).2.1;omega);have v:∀a,a∈AU (λa=>X[r*Z+a]!) Z 0->((a.toUInt32*AJ)Խ+e)Ի=a*AJԻ+eԻ:=λa b=>(by have J:=n a (h a b);have K:=h a b;have AE:=FV a AJ Ա Ա;rw[AT _ _ (by rw[AE];omega),AE]);unfold Em;rw[ג (by rw[u,Ar];exact⟨ն,by omega⟩),I0 (x:=λa=>X[r*Z+a]!) (y:=λm a=>d (y m a)) (AJ:=AJ) _ 0 [] [] _ u p Ai.symm t Ai.symm _ _ _ (λa b=>by show((a.toUInt32*AJ)Խ+e)Ի< iԻ;rw[v a b];exact n a (h a b)) (λa b m G=>by rw[v a b];exact z a m (h a b) G)];exact FU (λm=>Ct Z X r (y m) (j m)) A D E F lemma Gu {a O:լ}{R:ջ}{X e b:ե զ}{g h AJ:բ}(v:a<2^19)(Y:bԼ=O) (w:∀i,i(դ b[i]!)Ի<=(դ h)Ի)(x:դ h≠255)(y:դ g≠255){r j:լ} (z:(BC X a AJ r).Bj=true)(N:j+8<=O) (l:∀m d,m<8->d(դ e[(j+m)*a+d]!)Ի<=(դ g)Ի)(m:լ)(o:m<8)(p:ժ){q:լ} (A:pԻ=q)(P:q=r*O+j+m):Bc (A3 (Af (a+1)) (Ag (a+1)) (BC X a AJ r).s (AV g) (AV h)) R (CZ R a O X e b) (Ct a X r (λd=>e[(j+m)*a+d]!) b[j+m]!) p=BT R a O X e b q:=by obtain⟨AE,AK⟩:=DY (q:=q) (r:=r) (j:=j+m) (n:=O) Ա Ա;obtain⟨AP,B,D,E,F⟩:=Fa X v z;obtain⟨G,H,I,t⟩:=Cs g y;obtain⟨J,K,L,M⟩:=Cs h x;have u:=M _ (w (j+m) Ա);simp only[Bc,CZ,BT,Ct,A,AE,AK];exact Gr Ա _ _ _ R AP (λd k=>(t _ (l m d o k)).1) u.1 B D E F G H I (λd k=>(t _ (l m d o k)).2) J K L u.2 lemma Fc {a b:բ}(e:(դ a)Ի<=(դ b)Ի)(Y:դ b≠255):դ a≠255:=by intro d;have g:(դ a)Ի=255:=(by rw[d];rfl);have h:=փ b;exact Y (ξ.mp (by show _=255;omega)) lemma En {α:Type}{c:Prop}[Decidable c]{a b:α}(d:c->a=b):(if c then a else b)=b:=by split;rename_i e;exact d e;rfl lemma JD {d O:լ}{R:ջ}{X g b:ե զ}{v:բ}(K:g.size=O*d)(Y:b.size=O)(L:8<=O) (ai:0(դ b[i]!).toNat<=(դ v).toNat):FY d O R X g b v (BC X d 1 0)=պ AX 1 d O R X g b:=by have P:պ AX 1 d O R X g b=υ (n:=1*O) λq=>BT R d O X g b q.val:=rfl;unfold FY;split;(next o=>have Q:g.size-7*d<2^32:=Ա;have r:(1:բ).toNat=1:=rfl;obtain⟨D,E,-,-⟩:=FZ X d 1 0;obtain⟨F,-⟩:=Gs D E;set k:=AU (λe=>X[0*d+e]!) d 0;have p:∀e,e∈k->e(by have:=(D2 p).2.1;omega);have S:∀c e,cee∉k->(դ g[c*d+e]!).toNat<=(դ (if(BC X d 1 0).V.size==d then 0 else BS g)).toNat:=(by intro c e w p AF;split;rename_i U;have z:k.length=d:=(by rw[<-F];simpa using U);exact absurd (I7 _ d 0 z e Ա Ա) AF;exact D3 g _ (by rw[K];exact Fb w p));have V:=D5 Բ L (FX R d O X g b (Af (d+1)) (Ag (d+1)) (AV v) (BC X d 1 0) (g.size-7*d).toUSize d.toUSize o.2.2.1 o.2.2.2.1 ⟨o.1,o.2.1⟩) (λm a=>(∀c e,cee∉k->(դ g[c*d+e]!).toNat<=(դ a.2).toNat)/\(դ a.2≠255->Ad (BT R d O X g b) (1*O) (λq=>q<1*O/\q%O< m) a.1)) (λj m W G al Z aa=>by obtain⟨H,ab⟩:=aa;have ac:(j+8)*d<=O*d:=Β _ G;rw[δ6]at ac;have I:(j*d).toUSize.toNat=j*d:=Aq _ Ա;have l:∀e,e∈k->((e.toUInt32*1).toUSize+(j*d).toUSize).toNat=e+j*d:=(by intro e h;have z:=p e h;rw[AT _ _ (by rw[I,FV e 1 (by rw[r];omega) Ա,r];omega),I,FV e 1 (by rw[r];omega) Ա,r,ψ8]);obtain⟨A,ad⟩:=Gj (λm e=>g[(j+m)*d+e]!) k W.2;unfold FX;dsimp only;rw[I1 (x:=λe=>X[0*d+e]!) (y:=λm e=>g[(j+m)*d+e]!) (AJ:=1) k 0 [] [] _ F D Ai.symm E Ai.symm _ _ _ (λe h=>by show((e.toUInt32*1).toUSize+(j*d).toUSize).toNat<(g.size-7*d).toUSize.toNat;have z:=p e h;rw[l e h,Aq _ Q];omega) (λe h m Z=>by rw[l e h,Aq d Ա];show g[_]! =g[(j+m)*d+e]!;congr 1;rw[δ6];omega)];dsimp only;refine⟨λc e w h ae=>(H c e w h ae).trans A,λt=>Bs (FU (λm=>Ct d X 0 (λe=>g[(j+m)*d+e]!) b[j+m]!) Ա Ա (λu B af ag=>Gu M Y N o.2.2.2.2.2 t o.2.2.2.2.1 G (λu e B h=>by by_cases J:e∈k;exact ad e J u B;exact(H (j+u) e Ա h J).trans A) u B af ag Ա) (ab (Fc A t))) λq l=> ?_⟩;obtain⟨ah,am⟩:=l;have an:=θ (show q⟨by simp,λq l=>absurd l.2 Ա⟩⟩;simp only[];refine En λt=> ?_;rw[P];exact CY (λq l=>⟨l,η3 _ Ա⟩) (V.2 (إ t)));next=>rfl lemma Fd {X:ե զ}{Z:լ}{AJ:բ}{AB r:լ}(a:r<(Bt X Z AJ AB)Լ):(Bt X Z AJ AB)[r]=BC X Z AJ r:=by simp[Bt] lemma Fe {X:ե զ}{Z:լ}{AJ:բ}{AB:լ}(a:(Bt X Z AJ AB).all (·.Bj)=true){r:լ}(b:rBT R d O X k b q.val:=rfl unfold D6 split next l=> obtain⟨ao,A,Y,B,M,ap,u,N,P,aq,ar⟩:=l dsimp only have D:=D3 b split next o=> subst o exact JD A Y B M u N P D next=> split next E=> simp only[Ξ,bne_iff_ne,ne_eq]at E obtain⟨Q,S⟩:=E have F:(8:բ).toNat=8:=rfl have U:=D5 Բ B (FW R AB d O X k b (Af (d+1)) (Ag (d+1)) (AV (BS b)) (Bt X d 8 AB)) (λm h=>8*d<=h.1.size/\h.1.size<2^31/\(դ h.2.2≠255->Ad (BT R d O X k b) (AB*O) (λq=>qby obtain⟨W,Z,aa⟩:=V have ab:(j+8)*d<=O*d:=Β _ G rw[δ6]at ab have v:(8*d).toUSize.toNat=8*d:=Aq _ Ա have p:d.toUSize.toNat=d:=Aq _ Ա have w:(j*d).toUSize.toNat=j*d:=Aq _ Ա have H:(8*d-7).toUSize.toNat=8*d-7:=Aq _ Ա unfold FW split next An=> dsimp only obtain⟨x,ac,-,ad,ae⟩:=Gn k (8*d).toUSize An.1 d.toUSize (by rw[v,p]) 8 (j*d).toUSize 0 An.2.1 An.2.2.1 h.1 An.2.2.2 h.2.2 (by rw[Ai]) set af:=B8 k (8*d).toUSize An.1 d.toUSize 8 (j*d).toUSize 0 An.2.1 An.2.2.1 h.1 An.2.2.2 h.2.2 split next I=> refine⟨by rw[x];exact W,by rw[x];exact Z,λy=> ?_⟩ have J:դ af.2≠255:=y refine Bs (El _ (λr a=>Ad (BT R d O X k b) (AB*O) (λq=>qby rw[ג (by simpa[Bt]using o),Fd] have ah:(r+1)*O<=AB*O:=Β _ o rw[δ4]at ah refine Bs (Gt (λm g=>k[(j+m)*d+g]!) (λm=>b[j+m]!) u (λg z=>by rw[F,Ai,H] omega) (λg i z t=>by rw[F,Ai,Ν,ac (g*8+i) (by rw[Ai];omega) (by rw[Ai];omega) (by rw[v];omega), show(g*8+i)%8=i by omega,show(g*8+i)/8=g by omega,Ai,Ζ6,w,p,δ6]) Ա Ա (λi t ai aj=>Gu u Y D Q J (Fe S o) G (λi g t z=>by have:=ae i g t (by rw[p];exact z) rwa[show(j*d).toUSize.toNat+i*d.toUSize.toNat+g=(j+i)*d+g by rw[w,p,δ6]]at this) i t ai aj rfl) ag) λq e=> ?_ by_cases K:q%O< m ·exact א ⟨e.1,א K⟩ ·obtain⟨ak,al,av⟩:=e.2.resolve_left K by_cases am:q/O⟨e.1,e.2.elim id λl=>absurd l.2.2 (θ1 _)⟩)) λq e=>⟨e.1,?_⟩ by_cases l:q%O< m ·exact א l ·exact ؠ ⟨by omega,e.2,(Κ Ա).2 e.1⟩ next I=>exact absurd (by rw[x,H];omega) I next An=>exact absurd (by rw[v,p,w,A];omega) An) (Br (8*d),δ (AB*O) 0,0) ⟨(Ei _).1,by have:=(Ei (8*d)).2;show(Br (8*d)).size<2^31;omega,λ_=>⟨by simp,λq e=>absurd e.2 Ա⟩⟩ refine En λy=> ?_ rw[L] exact CY (λq e=>⟨e,η3 _ Ա⟩) (U.2.2 (إ y)) next=>rfl next=>rfl lemma Bk (a b:բ):aԻ<=(ת a b)Ի/\bԻ<=(ת a b)Ի:=by show aԻ<=(if a<=b then b else a)Ի/\bԻ<=(if a<=b then b else a)Ի;split;rename_i d;exact⟨κ7.mp d,ն⟩;rename_i d;have:=κ7.not.mp d;exact⟨ն,by omega⟩ lemma Gw (f:լ->բ)(b:כ լ)(a:բ):aԻ<=(b.foldl (λx i=>ת x (f i)) a)Ի/\∀i,i∈b->(f i)Ի<=(b.foldl (λx i=>ת x (f i)) a)Ի:=by induction b generalizing a with|nil=>exact⟨ն,λi d=>absurd d Ե⟩|cons e b h=>obtain⟨g,j⟩:=h (ת a (f e));obtain⟨Aw,k⟩:=Bk a (f e);refine⟨Aw.trans g,λi d=> ?_⟩;rcases List.mem_cons.mp d with rfl | l;exact k.trans g;exact j i l lemma DZ {α:Type}(f:α->լ->α)(a:α)(c:լ):(ρ (c+1)).foldl f a=(ρ c).foldl (λx i=>f x (i+1)) (f a 0):=by rw[List.range_succ_eq_map,χ6,List.foldl_map] def Cu (a:բ):W:=BL (a.toUInt64+897) lemma JE (a:բ)(i:a.toNat<255):AC (Cu a)/\0<=D (Cu a)/\D (Cu a)<=2^Ճ/\∀b:բ,(դ b).toNat<=a.toNat->դ b≠255/\ |D (d b)| <=D (Cu a):=by have AF:(a.toUInt64+897).toNat=a.toNat+897:=(by rw[Ψ,ξ4];show(a.toNat+897)%_=_;omega);obtain⟨f,e⟩:=DE (a.toUInt64+897) Ա Ա;rw[AF]at e;have AE:((a.toNat+897:լ):ص)-1023=(a.toNat:ص)-126:=Թ;rw[AE]at e;refine⟨f,?_,?_,?_⟩;show 0<=D (BL _);rw[e];positivity;show D (BL _)<=_;rw[e,<-յ];exact շ Բ (by push_cast;omega);intro b j;have h:(դ b).toNat≠255:=Ա;refine⟨λg=>h (by rw[g];rfl),?_⟩;refine(EV b (λg=>h (by rw[g];rfl))).trans ?_;show _<=D (BL _);rw[e];exact շ Բ Ա def D7 (X:ե բ)(a:ժ)(h:aԻ<=XԼ)(i:aԻ<2^31)(b:ժ)(s:W)(m:բ): W×բ:= if e:bD7 X e h j b s m=((ρ c).foldl (λa i=>a+d (X[bԻ+i]!&&&Չ)) s,(ρ c).foldl (λa i=>ת a (դ X[bԻ+i]!)) m):=by induction c with|zero=>intro b s m l;rw[D7,dif_neg (λn=>by have:=Au n;omega)];rfl|succ c o=>intro b s m l;have p:b(by omega);rw[D7,ג p];simp only[];rw[o (b+1) _ _ (by rw[g];omega),DZ,DZ,g,BR];simp only[k,Ν] @[inline] def AR (X:ե բ)(n r:լ):W×բ:=if a:(r*n+n).toUSize.toNat<=XԼ/\(r*n+n).toUSize.toNat<2^31 then D7 X (r*n+n)Խ a.1 a.2 (r*n)Խ Ae 0 else(Ae,255) lemma JG (X:ե բ)(n r:լ)(b:r*n+n<=XԼ)(e:r*n+n<2^31):AR X n r=((ρ n).foldl (λa i=>a+d (X[r*n+i]!&&&Չ)) Ae,(ρ n).foldl (λa i=>ת a (դ X[r*n+i]!)) 0):=by have AE:(r*n+n).toUSize.toNat=r*n+n:=Aq _ Ա;have AK:(r*n).toUSize.toNat=r*n:=Aq _ Ա;unfold AR;rw[ג ⟨by rw[AE];exact b,by rw[AE];exact e⟩,JF X _ _ _ n _ _ _ (by rw[AE,AK]),AK] def DI (B:է)(h:ժ)(a:hԻ+7<=BԼ)(AL:BԼ<2^31)(j:ե բ)(i:ժ) (n:iԻ<=jԼ)(p:jԼ<2^31)(e q:ժ)(r:qԻ+8*(iԻ-eԻ)<=hԻ+7) (A8 AZ Ac At Ax A0 A9 A_:W)(o:բ):Eg:= if k:e< i then have t:=Au k have g:qW) (o:բ),b.toNat+c=j.toNat->DI B k r AL e j t u b q n (A 0) (A 1) (A 2) (A 3) (A 4) (A 5) (A 6) (A 7) o=⟨AY λm=>(ρ c).foldl (λa i=>a+B.data[q.toNat+8*i+m]!*d e[b.toNat+i]!) (A m),(ρ c).foldl (λa i=>ת a (դ e[b.toNat+i]!)) o⟩:=by induction c with|zero=>intro b q n A o v;rw[DI,dif_neg (λw=>by have:=Au w;omega)];rfl|succ c x=>intro b q n A o v;have y:b(by rw[CV];rfl);have Da:∀(g:b.toNat(by rw[BR];rfl);have G:∀i m,q.toNat+8+8*i+m=q.toNat+8*(i+1)+m:=λi m=>(by ring);have H:∀i,b.toNat+1+i=b.toNat+(i+1):=λi=>(by ring);rw[DI,ג y];simp only[F,h 1 1 BF Բ,h 2 2 CS Բ,h 3 3 CT Բ,h 4 4 DG Բ,h 5 5 Dz Բ,h 6 6 D0 Բ,h 7 7 D1 Բ,Da];rw[x (b+1) (q+8) _ (λm=>A m+B.data[q.toNat+8*0+m]!*d e[b.toNat+0]!) _ (by rw[AH];omega)];simp only[DZ,AH,D,G,H] def Db (Z:լ)(X e:ե զ)(r j:լ)(g:բ):W:=(ρ Z).foldl (λa b=>a+d (X[r*Z+b]!)*d (e[j*Z+b]!)) (d g) def DJ (Z:լ)(X:ե զ)(r:լ):W:=(ρ Z).foldl (λa i=>a+d (X[r*Z+i]!&&&Չ)) Ae lemma Gx {d O:լ}{R:ջ}{X g b:ե զ}{h k:բ}(W:d<2^19) (v:∀i,i(դ b[i]!)Ի<=(դ k)Ի)(w:դ k≠255)(x:hԻ<255) {r j:լ}(y:j(դ X[r*d+a]!)Ի<255) (o:∀a,a(դ g[j*d+a]!)Ի<=hԻ)(u:ժ){q:լ} (B:uԻ=q)(D:q=r*O+j):Bc (A3 (Af (d+1)) (Ag (d+1)) (DJ d X r) (Cu h) (AV k)) R (CZ R d O X g b) (Db d X g r j b[j]!) u=BT R d O X g b q:=by obtain⟨AE,AK⟩:=DY (q:=q) (r:=r) (j:=j) (n:=O) D y;obtain⟨E,G,H,p⟩:=JE h x;obtain⟨I,J,K,L⟩:=Cs k w;have t:=L _ (v j z);have AP:∀a,aդ X[r*d+a]!≠255:=λa e M=>(by have:=A a e;rw[M]at this;exact absurd this Է);have l:∀a,a∈Θ 0 d->a(by have:=List.mem_range'_1.mp e;omega);have N:((Θ 0 d).length:ض)<=2^20:=(by rw[Α6];exact_mod_cast(show d<=2^20 by omega));obtain⟨P,Q,S,U⟩:=Gh (λa=>X[r*d+a]!) (Θ 0 d) (λa e=>AP a (l a e)) N;simp only[Bc,CZ,BT,Db,DJ,B,AE,AK,ψ6];exact Gq Ա (λa=>X[r*d+a]!) (λa=>g[j*d+a]!) b[j]! R AP (λa e=>(p _ (o a e)).1) t.1 P Q S (Θ 0 d) l Ե (λF _=>ն) rfl U E G H (λa e=>(p _ (o a e)).2) I J K t.2 (λV=>FI b[j]! _ _ _ t.1 (λa e=>⟨AP a (l a e),(p _ (o a (l a e))).1⟩) (by rw[Α6];exact_mod_cast(show d<=2^21 by omega)) V) (Χ _) Ե lemma Cv {AS:լ->զ}{N:լ}{P:լ->Prop}{e:W}{R:ջ}{g:ժ->W->զ}{s:W} {i:ժ}{a:լ}{AA:ե զ}(h:iԻ=a)(o:aBc e R g s j=AS a)(b:Ad AS N P AA):Ad AS N (λq=>P q\/q=a) (BM e R g s i AA):=by obtain⟨l,b⟩:=b;refine⟨(FS _ _ _).trans l,λq n=> ?_⟩;show(Cp AA i _)[q]! =_;rw[FT _ _ _ Ա,h];split;rename_i d;rw[d];exact k i h;rename_i d;exact b q (n.resolve_right d) @[inline] def DK (R:ջ)(g O:լ)(X k b:ե զ)(K Am Ay:W)(B:է)(l:ժ) (n:l.toNat+7<=B.size)(AL:B.size<2^31)(o:k.size<2^31)(S:B5)(AD j:լ) (p:(j*g+g).toUSize.toNat<=k.size)(t:ե զ×բ):ե զ×բ:= match t with | (AA,AN)=> let e:=d b[j]! let r:Eg:=if u:(0:ժ).toNat+8*((j*g+g).toUSize.toNat-(j*g).toUSize.toNat)<=l.toNat+7 then DI B l n AL k (j*g+g).toUSize p o (j*g).toUSize 0 u e e e e e e e e 0 else⟨⟨e,e,e,e,e,e,e,e⟩,255⟩ let h:=Cu r.o let i:=CZ R g O X k b let q:=(AD*O+j).toUSize let a:=O.toUSize let AA:=BM (A3 K Am S.A8 h Ay) R i r.f.A8 q AA let AA:=BM (A3 K Am S.AZ h Ay) R i r.f.AZ (q+a) AA let AA:=BM (A3 K Am S.Ac h Ay) R i r.f.Ac (q+a+a) AA let AA:=BM (A3 K Am S.At h Ay) R i r.f.At (q+a+a+a) AA let AA:=BM (A3 K Am S.Ax h Ay) R i r.f.Ax (q+a+a+a+a) AA let AA:=BM (A3 K Am S.A0 h Ay) R i r.f.A0 (q+a+a+a+a+a) AA let AA:=BM (A3 K Am S.A9 h Ay) R i r.f.A9 (q+a+a+a+a+a+a) AA let AA:=BM (A3 K Am S.A_ h Ay) R i r.f.A_ (q+a+a+a+a+a+a+a) AA (AA,ת AN r.o) def Cw (R:ջ)(a O:լ)(X g b:ե զ)(K Am Ay:W)(AD:լ) (w:է×ե զ×բ):է×ե զ×բ:= match w with | (d,AA,AN)=> if e:(8*a).toUSize.toNat<2^31/\(AD*a).toUSize.toNat+8*a.toUSize.toNat<=X.size/\ (AD*a).toUSize.toNat+8*a.toUSize.toNat<2^31/\(8*a).toUSize.toNat<=d.size then let r:=B8 X (8*a).toUSize e.1 a.toUSize 8 (AD*a).toUSize 0 e.2.1 e.2.2.1 d e.2.2.2 0 if h:(8*a-7).toUSize.toNat+7<=r.1.size/\r.1.size<2^31/\g.size<2^31 then let i:=AR X a AD let k:=AR X a (AD+1) let l:=AR X a (AD+2) let n:=AR X a (AD+3) let o:=AR X a (AD+4) let p:=AR X a (AD+5) let q:=AR X a (AD+6) let t:=AR X a (AD+7) let S:B5:=⟨i.1,k.1,l.1,n.1,o.1,p.1,q.1,t.1⟩ let x:=ת (ת (ת i.2 k.2) (ת l.2 n.2)) (ת (ת o.2 p.2) (ת q.2 t.2)) let u:=Cr (λj v=> if y:(j*a+a).toUSize.toNat<=g.size then DK R a O X g b K Am Ay r.1 (8*a-7).toUSize h.1 h.2.1 h.2.2 S AD j y v else v) O 0 (AA,ת AN x) (r.1,u.1,u.2) else(d,AA,255) else(d,AA,255) def Ff (AB a O:լ)(R:ջ)(X d b:ե զ):ե զ:= if g:XԼ=AB*a/\dԼ=O*a/\bԼ=O/\8<=AB/\0զ}{N:լ}{P:լ->Prop}{R:ջ}{a O:լ}{X g b:ե զ} {K Am Ay:W}{B:է}{l:ժ}{r:lԻ+7<=BԼ}{AL:BԼ<2^31} {t:gԼ<2^31}{S:B5}{AD j:լ}{u:(j*a+a).toUSize.toNat<=gԼ}{AA:ե զ} {AN:բ}(F G:լ->W)(o:բ) (h:(0:ժ)Ի+8*((j*a+a).toUSize.toNat-(j*a).toUSize.toNat)<=lԻ+7) (E:DI B l r AL g (j*a+a)Խ u t (j*a)Խ 0 h (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) 0=⟨AY F,o⟩) (H:S=AY G)(I:(AD+7)*O+j∀i:ժ,iԻ=(AD+m)*O+j->Bc (A3 K Am (G m) (Cu o) Ay) R (CZ R a O X g b) (F m) i=AS ((AD+m)*O+j)) (J:Ad AS N P AA):Ad AS N (λq=>P q\/∃m,m<8/\q=(AD+m)*O+j) (DK R a O X g b K Am Ay B l r AL t S AD j u (AA,AN)).1/\(DK R a O X g b K Am Ay B l r AL t S AD j u (AA,AN)).2=ת AN o:=by have n:∀k,k<=7->(AD+k)*O+j<=(AD+7)*O+j:=λk p=>ψ4 (Β _ Ա) _;have L:∀k,k<=7->(AD+k)*O+jב (n k p) I;have v:OԽԻ=O:=Aq _ (by have M:=n 1 Բ;have Q:=δ6 AD 1 O;omega);have w:(AD*O+j).toUSize.toNat=AD*O+j+0*O:=(by rw[Aq _ (by have:=n 0 Բ;have Q:=δ6 AD 0 O;omega)];ring);have U:∀(k:լ) (i:ժ),k<=6->iԻ=AD*O+j+k*O->(i+OԽ)Ի=AD*O+j+(k+1)*O:=(by intro k i p x;have M:=n (k+1) Ա;have AE:=δ6 AD (k+1) O;have AK:=δ6 k 1 O;rw[AT _ _ (by rw[x,v];omega),x,v];ring);have BW:=U 0 _ Բ w;have CA:=U 1 _ Բ BW;have y:=U 2 _ Բ CA;have z:=U 3 _ Բ y;have A:=U 4 _ Բ z;have D:=U 5 _ Բ A;have V:=U 6 _ Բ D;have F:∀k,AD*O+j+k*O=(AD+k)*O+j:=λk=>(by ring);unfold DK;simp only[dif_pos h,E,H];refine⟨Bs (Cv (V.trans (F 7)) (L 7 Բ) (e 7 Բ)<|Cv (D.trans (F 6)) (L 6 Բ) (e 6 Բ)<|Cv (A.trans (F 5)) (L 5 Բ) (e 5 Բ)<|Cv (z.trans (F 4)) (L 4 Բ) (e 4 Բ)<|Cv (y.trans (F 3)) (L 3 Բ) (e 3 Բ)<|Cv (CA.trans (F 2)) (L 2 Բ) (e 2 Բ)<|Cv (BW.trans (F 1)) (L 1 Բ) (e 1 Բ)<|Cv (w.trans (F 0)) (L 0 Բ) (e 0 Բ) J) (λq h=> ?_),trivial⟩;rcases h with h | ⟨k,p,rfl⟩;exact א (א (א (א (א (א (א (א h)))))));interval_cases k<;>simp lemma JJ {R:ջ}{a O:լ}{X e b:ե զ}{K Am Ay:W}{B:է}{g:ժ} {h:gԻ+7<=BԼ}{AL:BԼ<2^31}{i:eԼ<2^31}{S:B5}{AD j:լ} {k:(j*a+a).toUSize.toNat<=eԼ}{AA:ե զ}{AN:բ}(F:լ->W)(o:բ) (l:(0:ժ)Ի+8*((j*a+a).toUSize.toNat-(j*a).toUSize.toNat)<=gԻ+7) (n:DI B g h AL e (j*a+a)Խ k i (j*a)Խ 0 l (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) (d b[j]!) 0=⟨AY F,o⟩):(DK R a O X e b K Am Ay B g h AL i S AD j k (AA,AN)).2=ת AN o:=by unfold DK;simp only[dif_pos l,n] lemma Gy {X:ե զ}{b r:լ}{AN:բ} (e:((ρ b).foldl (λa i=>ת a (դ X[r*b+i]!)) 0)Ի<=ANԻ)(g:ANԻ<255):∀d,d(դ X[r*b+d]!)Ի<255:=λd h=>ב (((Gw (λi=>դ X[r*b+i]!) (ρ b) 0).2 d (List.mem_range.mpr h)).trans e) g lemma Eo {r AB n:լ}(a:r+1<=AB):r*n+n<=AB*n:=by have:=Β n a;rwa[δ4]at this set_option maxHeartbeats 1000000 in lemma JK {R:ջ}{AB e O:լ}{X g b:ե զ}{p:բ}(Q:X.size=AB*e) (U:g.size=O*e)(Y:b.size=O)(aL:0(դ b[i]!).toNat<=(դ p).toNat)(an:դ p≠255) {AD m:լ}(ao:AD+8<=AB)(aP:AD<=m)(r:է)(AA:ե զ)(AN:բ) (V:8*e<=r.size)(W:r.size<2^31) (ap:AN.toNat<255->Ad (BT R e O X g b) (AB*O) (λq=>q Ad (BT R e O X g b) (AB*O) (λq=>q obtain⟨F,aq,-,-,-⟩:=Gn X (8*e).toUSize h.1 e.toUSize (by rw[D,E]) 8 (AD*e).toUSize 0 h.2.1 h.2.2.1 r h.2.2.2 0 (by rw[Ai]) set G:=B8 X (8*e).toUSize h.1 e.toUSize 8 (AD*e).toUSize 0 h.2.1 h.2.2.1 r h.2.2.2 0 with aT split next u=> have t:∀k,k<8->AR X e (AD+k)=(DJ e X (AD+k), (ρ e).foldl (λa i=>ת a (դ X[(AD+k)*e+i]!)) 0):=λk l=> JG X e (AD+k) (by rw[Q];exact Eo Ա) (by have:=Eo (n:=e) (show AD+k+1<=AB by omega);omega) have ar:∀k i,k<8->iG.1.data[0+8*i+k]! =d X[(AD+k)*e+i]!:=λk i l aU=>by have:=aq (0+8*i+k) (by rw[Ai];omega) (by rw[Ai];omega) (by rw[D];omega) rw[this,Ai,J,E,show(0+8*i+k)%8-0=k by omega,show(0+8*i+k)/8=i by omega] congr 2 ring set w:=ת (ת (ת (AR X e AD).2 (AR X e (AD+1)).2) (ת (AR X e (AD+2)).2 (AR X e (AD+3)).2)) (ת (ת (AR X e (AD+4)).2 (AR X e (AD+5)).2) (ת (AR X e (AD+6)).2 (AR X e (AD+7)).2)) with as have aa:=t 0 Բ rw[Ν]at aa have au:∀k,k<8->(AR X e (AD+k)).2.toNat<=w.toNat:=by intro k l have aV:=Bk (AR X e AD).2 (AR X e (AD+1)).2 have aW:=Bk (AR X e (AD+2)).2 (AR X e (AD+3)).2 have aX:=Bk (AR X e (AD+4)).2 (AR X e (AD+5)).2 have aY:=Bk (AR X e (AD+6)).2 (AR X e (AD+7)).2 have aZ:=Bk (ת (AR X e AD).2 (AR X e (AD+1)).2) (ת (AR X e (AD+2)).2 (AR X e (AD+3)).2) have a0:=Bk (ת (AR X e (AD+4)).2 (AR X e (AD+5)).2) (ת (AR X e (AD+6)).2 (AR X e (AD+7)).2) have av:=Bk (ת (ת (AR X e AD).2 (AR X e (AD+1)).2) (ת (AR X e (AD+2)).2 (AR X e (AD+3)).2)) (ת (ת (AR X e (AD+4)).2 (AR X e (AD+5)).2) (ת (AR X e (AD+6)).2 (AR X e (AD+7)).2)) rw[<-as]at av interval_cases k ·rw[Ν] omega all_goals omega have aw:∀k,k<8->((ρ e).foldl (λa i=>ת a (դ X[(AD+k)*e+i]!)) 0).toNat<=w.toNat:= λk l=>by have:=au k l rwa[t k l]at this have AL:(⟨(AR X e AD).1,(AR X e (AD+1)).1,(AR X e (AD+2)).1,(AR X e (AD+3)).1, (AR X e (AD+4)).1,(AR X e (AD+5)).1,(AR X e (AD+6)).1,(AR X e (AD+7)).1⟩:B5)= AY λk=>DJ e X (AD+k):=by rw[aa,t 1 Բ,t 2 Բ,t 3 Բ,t 4 Բ, t 5 Բ,t 6 Բ,t 7 Բ] rfl have ab:=El (AB:=O) (λj (v:ե զ×բ)=> if ax:(j*e+e).toUSize.toNat<=g.size then DK R e O X g b (Af (e+1)) (Ag (e+1)) (AV p) G.1 (8*e-7).toUSize u.1 u.2.1 u.2.2 ⟨(AR X e AD).1,(AR X e (AD+1)).1,(AR X e (AD+2)).1,(AR X e (AD+3)).1, (AR X e (AD+4)).1,(AR X e (AD+5)).1,(AR X e (AD+6)).1,(AR X e (AD+7)).1⟩ AD j ax v else v) (λc (v:ե զ×բ)=>(ת AN w).toNat<=v.2.toNat/\ (v.2.toNat<255->Ad (BT R e O X g b) (AB*O) (λq=>qby obtain⟨ad,az⟩:=ay have ae:c*e+e<=g.size:=by rw[U];exact Eo ac have H:(c*e+e).toUSize.toNat=c*e+e:=Aq _ Ա have B:(c*e).toUSize.toNat=c*e:=Aq _ Ա rw[ג (by rw[H];exact ae)] have L:(0:ժ).toNat+8*((c*e+e).toUSize.toNat-(c*e).toUSize.toNat)<= (8*e-7).toUSize.toNat+7:=by rw[Ai,H,B,Z];omega have af:=JH G.1 (8*e-7).toUSize u.1 u.2.1 g (c*e+e).toUSize (by rw[H];exact ae) u.2.2 e (c*e).toUSize 0 L (λ_=>d b[c]!) 0 (by rw[H,B]) set o:=(ρ e).foldl (λa i=>ת a (դ g[(c*e).toUSize.toNat+i]!)) 0 with aA obtain⟨ag,A⟩:=v have ah:=JJ (R:=R) (O:=O) (X:=X) (K:=Af (e+1)) (Am:=Ag (e+1)) (Ay:=AV p) (S:=⟨(AR X e AD).1,(AR X e (AD+1)).1,(AR X e (AD+2)).1, (AR X e (AD+3)).1,(AR X e (AD+4)).1,(AR X e (AD+5)).1,(AR X e (AD+6)).1, (AR X e (AD+7)).1⟩) (AD:=AD) (AA:=ag) (AN:=A) _ o L af refine⟨by rw[ah];exact ad.trans (Bk A o).1,λx=> ?_⟩ rw[ah]at x have ai:A.toNat<255:=ב (Bk A o).1 x have aB:o.toNat<255:=ב (Bk A o).2 x have aC:∀k,k<8->∀y,y(դ X[(AD+k)*e+y]!).toNat<255:=λk l=> Gy ((aw k l).trans ((Bk AN w).2.trans ad)) ai have aD:∀y,y(դ g[c*e+y]!).toNat<=o.toNat:=λy aE=>by have:=(Gw (λi=>դ g[(c*e).toUSize.toNat+i]!) (ρ e) 0).2 y (List.mem_range.mpr aE) rw[B]at this rw[aA,B] exact this have aF:∀k,k<8->(ρ e).foldl (λa i=>a+G.1.data[(0:ժ).toNat+8*i+k]!* d g[(c*e).toUSize.toNat+i]!) (d b[c]!)=Db e X g (AD+k) c b[c]!:=λk l=>by unfold Db rw[Ai,B] apply Ε7 intro a i I rw[ar k i l (List.mem_range.mp I)] refine Bs ((JI (AS:=BT R e O X g b) (N:=AB*O) (P:=λq=>qDJ e X (AD+k)) o L af AL (by have:=Eo (n:=O) (show AD+7+1<=AB by omega);omega) Ա (λk l aj aG=>by show Bc _ _ _ ((ρ e).foldl _ (d b[c]!)) aj=_ rw[aF k l] exact Gx I am an aB ac Ա (aC k l) aD aj aG rfl) (az ai)).1) λq z=> ?_ obtain⟨ak,aH⟩:=z rcases aH with M | ⟨aI,aJ,a1⟩ ·exact א ⟨ak,א M⟩ ·by_cases aK:q%OBs (ap (ב (Bk AN w).1 x)) λq z=> ⟨z.1,z.2.elim id λh=>absurd h.2.2 (θ1 _)⟩⟩ refine⟨by rw[F];exact V,by rw[F];exact W,(Bk AN w).1.trans ab.1, λx=>Bs (ab.2 x) λq z=>⟨z.1,?_⟩⟩ by_cases M:q/O< m ·exact א M ·exact ؠ ⟨by omega,z.2,η3 _ al⟩ next u=>exact absurd ⟨by rw[Z,F];omega,by rw[F];exact W,by rw[U];omega⟩ u next h=> exact absurd ⟨by rw[D];omega,by rw[J,E,Q];omega,by rw[J,E];omega,by rw[D];exact V⟩ h lemma JL:Ff=خ:=by funext AB a O R X e b show _=պ AX AB a O R X e b have i:պ AX AB a O R X e b= υ (n:=AB*O) λq=>BT R a O X e b q.val:=rfl unfold Ff split next j=> obtain⟨k,l,Y,h,o,p,r,t,u,v⟩:=j dsimp only split next w=> have x:դ (BS b)≠255:=by simpa using w have y:=D3 b have z:=D5 Բ h (Cw R a O X e b (Af (a+1)) (Ag (a+1)) (AV (BS b))) (λm (d:է×ե զ×բ)=>8*a<=d.1Լ/\d.1Լ<2^31/\(d.2.2Ի<255-> Ad (BT R a O X e b) (AB*O) (λq=>qby obtain⟨E,AA,AN⟩:=d obtain⟨F,G,H⟩:=D obtain⟨I,J,-,K⟩:=JK k l Y o p r t u v y x A B E AA AN F G H exact⟨I,J,K⟩) (Br (8*a),δ (AB*O) 0,0) ⟨(Ei _).1,by have:=(Ei (8*a)).2;have:=Β a h show(Br (8*a))Լ<2^31;omega, λ_=>⟨by simp,λq g=>absurd g.2 (θ1 _)⟩⟩ refine En λL=> ?_ rw[i] exact CY (λq g=>⟨g,(Κ Ա).2 g⟩) (z.2.2 (η0.mp L)) next=>rfl next=>rfl lemma JM:Fg=خ:=by funext AB a O R X d b;unfold Fg;split;rw[JL];rw[Gv] def Gz (X:ե բ)(a:ժ)(g:aԻ<=XԼ)(h:aԻ<2^31)(b d:ժ):ժ:= if e:b(Ca X g j l b q e Y h s m).1.size=e.size/\(∀i,i(Ca X g j l b q e Y h s m).1.data[q.toNat+i]! =d X[b.toNat+i]!)/\(∀y,y(Ca X g j l b q e Y h s m).1.data[y]! =e.data[y]!)/\(Ca X g j l b q e Y h s m).2.1=(ρ c).foldl (λa i=>a+d (X[b.toNat+i]!&&&Չ)) s/\(Ca X g j l b q e Y h s m).2.2=(ρ c).foldl (λa i=>ת a (դ X[b.toNat+i]!)) m:=by induction c with|zero=>intro b q e Y h s m v;rw[Ca,dif_neg (λw=>by have:=Au w;omega)];exact⟨rfl,λi r=>absurd r Ա,λy _=>rfl,rfl,rfl⟩|succ c x=>intro b q e Y h s m v;have t:b(by omega);rw[Ca,ג t];simp only[];obtain⟨B,D,u,E,F⟩:=x (b+1) (q+1) (e.uset q (d (X.uget b Ա)) A) (by rw[Co];exact Y) (by rw[Co,n,o];omega) (s+d (X.uget b Ա&&&Չ)) (ת m (դ (X.uget b Ա))) (by rw[n];omega);have p:X.uget b Ա=X[b.toNat]!:=BR X b Ա;refine⟨by rw[B,Co],λi r=> ?_,λy H=> ?_,?_,?_⟩;(cases i with|zero=>rw[Ν,u q.toNat (by rw[o];omega),Ej,վ rfl,p,Ν]|succ i=>rw[show q.toNat+(i+1)=(q+1).toNat+i by rw[o];omega,show b.toNat+(i+1)=(b+1).toNat+i by rw[n];omega];exact D i Ա);rw[u y (by rw[o];omega),Ej,ր Ա];rw[E,DZ,n,p];simp only[k,Ν];rw[F,DZ,n,p];simp only[k,Ν] def Dc (V:է)(b:ե բ)(n g:ժ)(u:gԻ<=VԼ)(v:VԼ<2^31) (w:bԼ<2^31)(e a:ժ)(z:aԻ+7*nԻ+(gԻ-eԻ)<=bԼ) (A8 AZ Ac At Ax A0 A9 A_:W)(o:բ):Eg:= if h:eW) (o:բ),eԻ+c=jԻ->Dc V g n j t u v e b p (A 0) (A 1) (A 2) (A 3) (A 4) (A 5) (A 6) (A 7) o=⟨AY λm=>(ρ c).foldl (λa i=>a+V.data[eԻ+i]!*d g[bԻ+i+m*nԻ]!) (A m),CW (λm i=>g[bԻ+i+m*nԻ]!) (ρ c) o⟩:=by induction c with|zero=>intro e b p A o w;rw[Dc,dif_neg (λx=>by have:=Au x;omega)];rfl|succ c y=>intro e b p A o w;have q:e(by rw[CV];rfl);have L:∀i,eԻ+1+i=eԻ+(i+1):=λi=>(by ring);have M:∀i m,bԻ+1+i+m*nԻ=bԻ+(i+1)+m*nԻ:=λi m=>(by ring);rw[Dc,ג q];simp only[K,h 0 b Ա,h 1 _ (D.trans Ա),h 2 _ (E.trans Ա),h 3 _ (F.trans Ա),h 4 _ (G.trans Ա),h 5 _ (H.trans Ա),h 6 _ (I.trans Ա),h 7 _ (J.trans Ա)];rw[y (e+1) (b+1) _ (λm=>A m+V.data[eԻ+0]!*d g[bԻ+0+m*nԻ]!) _ (by rw[AH];omega)];unfold CW;simp only[DZ,AH,B,L,M] lemma JP (V:է)(b:ե բ)(n e:ժ)(j:eԻ<=VԼ)(k:VԼ<2^31) (l:bԼ<2^31)(c:լ)(g h:ժ)(p:hԻ+7*nԻ+(eԻ-gԻ)<=bԼ) (A:լ->W)(o:բ)(q:gԻ+c=eԻ):Dc V b n e j k l g h p (AY A).A8 (AY A).AZ (AY A).Ac (AY A).At (AY A).Ax (AY A).A0 (AY A).A9 (AY A).A_ o=⟨AY λm=>(ρ c).foldl (λa i=>a+V.data[gԻ+i]!*d b[hԻ+i+m*nԻ]!) (A m),CW (λm i=>b[hԻ+i+m*nԻ]!) (ρ c) o⟩:=JO V b n e j k l c g h p A o q @[inline] def D8 (R:ջ)(a O:լ)(X g b:ե զ)(K Am S Ay:W)(V:է) (i:aԽԻ<=VԼ)(k:VԼ<2^31)(l:gԼ<2^31)(j:լ) (h:ե զ×բ):ե զ×բ:= if n:(j*a).toUSize.toNat+7*aԽԻ+(aԽԻ-(0:ժ)Ի)<=gԼ then let e:=AY λm=>d b[j+m]! let r:=Dc V g aԽ aԽ i k l 0 (j*a)Խ n e.A8 e.AZ e.Ac e.At e.Ax e.A0 e.A9 e.A_ h.2 (Ek (A3 K Am S (AV r.o) Ay) R (CZ R a O X g b) r.f jԽ h.1,r.o) else(h.1,0xFFFFFFFF) def Fh (a O:լ)(R:ջ)(X d b:ե զ):ե զ:= if dԼ=O*a/\bԼ=O/\8<=O/\0V.data[(0:ժ)Ի+i]! =d X[(0:ժ)Ի+i]!) (AL:S=(ρ e).foldl (λa i=>a+d (X[(0:ժ)Ի+i]!&&&Չ)) Ae) (I:∀k,k(դ X[0*e+k]!)Ի<255)(J:դ (BS b)≠255):դ (By 8 O (D8 R e O X h b (Af (e+1)) (Ag (e+1)) S (AV (BS b)) V u v w) (O/8+1) 0 (δ O 0,0)).2≠255->(By 8 O (D8 R e O X h b (Af (e+1)) (Ag (e+1)) S (AV (BS b)) V u v w) (O/8+1) 0 (δ O 0,0)).1=պ AX 1 e O R X h b:=by have K:պ AX 1 e O R X h b=υ (n:=1*O) λq=>BT R e O X h b q.val:=rfl;have x:eԽԻ=e:=Aq _ Ա;have an:O<=O*e:=υ1 O G;have L:S=DJ e X 0:=(by rw[AL];unfold DJ;rw[Ai,ρ2]);have M:=D3 b;have N:=D5 Բ F (D8 R e O X h b (Af (e+1)) (Ag (e+1)) S (AV (BS b)) V u v w) (λm (l:ե զ×բ)=>դ l.2≠255->Ad (BT R e O X h b) (1*O) (λq=>q<1*O/\q%O< m) l.1) (λj m l P ao ap Q=>by have U:(j+8)*e<=O*e:=Β _ P;rw[δ6]at U;have A:(j*e).toUSize.toNat=j*e:=Aq _ Ա;have B:(j*e).toUSize.toNat+7*eԽԻ+(eԽԻ-(0:ժ)Ի)<=hԼ:=(by rw[A,x,Ai,E];omega);have Z:=JP V h eԽ eԽ u v w e 0 (j*e)Խ B (λm=>d b[j+m]!) l.2 (by rw[Ai,x,γ9]);obtain⟨aa,ab⟩:=Gj (λm i=>h[(j*e).toUSize.toNat+i+m*eԽԻ]!) (ρ e) l.2;unfold D8;rw[ג B];dsimp only;rw[Z];dsimp only;set o:=CW (λm i=>h[(j*e).toUSize.toNat+i+m*eԽԻ]!) (ρ e) l.2 with aq;intro y;have ac:=Q (Fc aa y);have ad:(դ o)Ի<255:=(by have ae:=փ o;have af:(դ o)Ի≠255:=λag=>y (ξ.mp (by simpa using ag));omega);have ah:∀g,g<8->∀k,k(դ h[(j+g)*e+k]!)Ի<=(դ o)Ի:=λg p k ai=>(by rw[show(j+g)*e+k=(j*e).toUSize.toNat+k+g*eԽԻ by rw[A,x];ring];exact ab k (List.mem_range.mpr ai) g p);have aj:∀g,g<8->(ρ e).foldl (λa i=>a+V.data[(0:ժ)Ի+i]!*d h[(j*e).toUSize.toNat+i+g*eԽԻ]!) (d b[j+g]!)=Db e X h 0 (j+g) b[j+g]!:=λg p=>(by unfold Db;apply Ε7;intro a i z;rw[H i (List.mem_range.mp z),Ai,A,x,ρ2,show(j+g)*e+i=j*e+i+g*e by ring]);refine Bs (FU _ Ա Ա (λg p D ak=> ?_) ac) (λq t=> ?_);show Bc _ _ _ ((ρ e).foldl _ (d b[j+g]!)) D=_;rw[L,show AV o=Cu (expOf o)from rfl,aj g p];exact Gx z M J ad (r:=0) (j:=j+g) Ա Ա I (ah g p) D ak Ա;obtain⟨al,af⟩:=t;have ae:=θ (show q⟨by simp,λq t=>absurd t.2 (θ1 _)⟩);intro y;rw[K];exact CY (λq t=>⟨t,η3 _ Ա⟩) (N y) lemma JR (a O:լ)(R:ջ)(X d b:ե զ): Fh a O R X d b=պ AX 1 a O R X d b:=by unfold Fh split next h=> obtain⟨i,Y,j,k,l,n⟩:=h have o:aԽԻ=a:=Aq _ Ա split next e=> obtain⟨-,p,-,q,r⟩:=JN X aԽ e.1 e.2.1 a 0 0 (Br a) e.2.2.1 e.2.2.2 Ae 0 (by rw[Ai,o,γ9]) dsimp only split next=> split next g=> refine En λt=>JQ _ _ _ _ _ i Y j k l n p q ?_ (إ g.2.1) (إ t) exact Gy (ך (by rw[r,Ai,ρ2])) (η0.mp g.1) next=>rfl next=> show D6 1 a O R X d b=خ 1 a O R X d b rw[Gv] next=>rfl next=>rfl def Fi (AB a O:լ)(R:ջ)(X d b:ե զ):ե զ:=if AB=1/\64<=a/\8<=O then Fh a O R X d b else Fg AB a O R X d b lemma JS:Fi=خ:=by funext AB a O R X d b;unfold Fi;split;(next e=>rw[e.1];exact JR a O R X d b);next=>rw[JM] @[inline] def Cy (m b:բ):բ:=let a:=b&&&Չ;if a>m then a else m structure Ep where Bu:է AN:բ def Cb (X:ե բ):(c:լ)->(i:ժ)->(iԻ+c<=XԼ)->(iԻ+c<2^31)->է->բ->Ep | 0,_,_,_,r,AN=>⟨r,AN⟩ | c+1,i,b,e,r,AN=>have g:=Al i Ա;let a:=X.uget i Ա;Cb X c (i+1) Ա Ա (r.push (d a)) (Cy AN a) lemma G0 (m a:բ):m.toNat<=(Cy m a).toNat/\(a&&&Չ).toNat<=(Cy m a).toNat:=by unfold Cy;simp only[];split;rename_i b;have d:m.toNat<(a&&&Չ).toNat:=b;exact⟨d.le,ն⟩;rename_i b;have d:¬m.toNat<(a&&&Չ).toNat:=b;exact⟨ն,by omega⟩ lemma JT (X:ե բ)(c:լ)(i:ժ)(j:i.toNat+c<=X.size)(k:i.toNat+c<2^31)(r:է) (AN:բ)(t:r.size=i.toNat):(Cb X c i j k r AN).Bu.size=i.toNat+c/\(∀e,e(Cb X c i j k r AN).Bu.data[e]! =r.data[e]!)/\(∀e,i.toNat<=e->e< i.toNat+c->(Cb X c i j k r AN).Bu.data[e]! =d X[e]!)/\AN.toNat<=(Cb X c i j k r AN).AN.toNat/\(∀e,i.toNat<=e->e< i.toNat+c->(X[e]!&&&Չ).toNat<=(Cb X c i j k r AN).AN.toNat):=by induction c generalizing i r AN with|zero=>refine⟨by show r.size=i.toNat+0;omega,λ_ _=>rfl,λe a b=>absurd b Ա,ն,λe a b=>absurd b Ա⟩|succ c y=>have l:=Al i Ա;rw[Cb];have z:∀(g:W) (e:լ),e(r.push g).data[e]! =r.data[e]!:=(by intro g e n;(cases r with|mk h=>have A:ehave o:h.size<(h.push g).size:=Ե;show(h.push g)[h.size]! =g;rw[ո (h.push g) h.size o,ψ1]));have p:∀g:W,(r.push g).size=r.size+1:=(by intro g;cases r;simp[Δ8,Δ6]);have u:X.uget i Ա=X[i.toNat]!:=BR _ _ _;obtain⟨D,v,E,w,F⟩:=y (i+1) Ա Ա (r.push (d (X.uget i Ա))) (Cy AN (X.uget i Ա)) (by rw[p,t,l]);obtain⟨Aw,G⟩:=G0 AN (X.uget i Ա);refine⟨by rw[D];omega,?_,?_,Aw.trans w,?_⟩;intro e n;rw[v e (by rw[p];omega),z _ _ n];intro e a b;by_cases q:e=i.toNat;subst q;rw[v _ (by rw[p];omega)];have x:=B (d (X.uget i Ա));rw[t]at x;rw[x,u];exact E e (by rw[l];omega) (by rw[l];omega);intro e a b;by_cases q:e=i.toNat;subst q;rw[<-u];exact G.trans w;exact F e (by rw[l];omega) (by rw[l];omega) @[inline] def Bl (X:ե բ)(a:XԼ<2^31):Ep:=Cb X XԼ 0 (by have:=Ai;omega) (by have:=Ai;omega) (Υ XԼ) 0 lemma CJ (X:ե բ)(b:X.size<2^31):(Bl X b).Bu.size=X.size/\(∀a,a(Bl X b).Bu.data[a]! =d X[a]!)/\(∀a,a(X[a]!&&&Չ).toNat<=(Bl X b).AN.toNat):=by have e:=Ai;obtain⟨g,-,h,-,i⟩:=JT X X.size 0 Ա Ա (Υ X.size) 0 (by rw[e];rfl);refine⟨by show(Cb _ _ _ _ _ _ _).Bu.size=_;rw[g];omega,λa j=>h a Ա Ա,λa j=>i a Ա Ա⟩ lemma Fj (a m:բ)(b:(a&&&Չ).toNat<=m.toNat)(e:m.toNat<2^31):(դ a).toNat<=(դ m).toNat:=by have d:(a&&&Չ).toNat=a.toNat%2^31:=(by rw[Ε];exact γ _ 31);rw[d]at b;have g:=a.toNat_lt;rw[BJ,BJ];omega lemma Dd {m:բ}(a:m<Ջ):դ m≠255:=by have e:mԻ<Ջ:=a;intro b;have d:(դ m)Ի=255:=(by rw[b];rfl);rw[BJ]at d;omega def Fk (e:ժ->W->զ)(R:ջ)(K Am g h:W)(B:է)(b:ժ)(i:bԻ+7<=BԼ) (AL:BԼ<2^31)(a:ե CH)(k:լ->բ)(n AB:լ)(AA:ե զ):ե զ:=Cr (λr AA=>if p:rEm l R e B b jԽ i AL a[r] (AY λ_=>o) (r*n+j) AA) (n/8+1) 0 AA else AA) AB 0 AA lemma G1 {o:ժ->W->զ}{R:ջ}{K Am p:W}{AB n Z:լ}{c:Ep} {x:(Z*n-7).toUSize.toNat+7<=c.Bu.size}{AL:c.Bu.size<2^31}{k:լ->բ}{X e:ե զ} {AS:լ->զ}(y:8<=n)(z:0c.Bu.data[b]! =d e[b]!) (F:∀b,b(e[b]!&&&Չ).toNat<=c.AN.toNat) (G:∀r j,rj(∀b,bդ e[b*n+j]!≠255/\ |D (d e[b*n+j]!)| <=D (AV c.AN))->∀i:ժ,i.toNat=r*n+j->Bc (A3 K Am (BC X Z n.toUInt32 r).s (AV c.AN) p) R o (Ct Z X r (λb=>e[b*n+j]!) (k r)) i=AS (r*n+j)):Fk o R K Am (AV c.AN) p c.Bu (Z*n-7).toUSize x AL (Bt X Z n.toUInt32 AB) k n AB (δ (AB*n) 0)=υ (n:=AB*n) λq=>AS q.val:=by have V:c.AN.toNat<Ջ:=h;obtain⟨-,-,-,H⟩:=Cs c.AN (Dd h);have t:∀b j,bjb*n+j(by rw[B];exact Fb g u);have v:n.toUInt32.toNat=n:=(by have:n<=Z*n:=υ7 n z;rw[ο6,δ9];omega);have I:(Z*n-7).toUSize.toNat=Z*n-7:=Aq _ Ա;refine I_ Ա rfl _ (λr a l J=> ?_) _ Ե;have L:r<(Bt X Z n.toUInt32 AB).size:=(by simpa[Bt]using l);have M:(r+1)*n<=AB*n:=Β _ l;rw[δ4]at M;rw[ג L,Fd];dsimp only;refine I9 Բ y _ (λj P a u N=> ?_) a J;have w:j.toUSize.toNat=j:=Aq _ Ա;exact Gt (λm b=>e[b*n+(j+m)]!) (λ_=>k r) A (λb g=>by have O:(b+1)*n<=Z*n:=Β _ g;rw[δ4]at O;rw[w,v,I];omega) (λb m g h=>by rw[w,v,Α3];exact E _ (t b (j+m) g Ա)) Ա Ա (λm h i Q=>by have:=G r (j+m) l Ա (λb g=>H _ (Fj _ _ (F _ (t b (j+m) g Ա)) Ա)) i (by rw[Q];omega);rwa[<-Α3]at this) N lemma JU {Z:լ}(AF:Z<=2^20)(x y:լ->բ)(R:ջ) (AP:∀e,eդ (x e)≠255)(p:∀e,eդ (y e)≠255){S h:W} (z:AC S)(A:0<=D S)(B:D S<=2^Ո) (E:((AU x Z 0).map λe=> |D (d (x e))|).sum<=1001/1000*D S+2^23*AH) (F:AC h)(G:0<=D h)(H:D h<=2^Ճ)(I:∀e,e |D (d (y e))| <=D h):(let s:=(AU x Z 0).foldl (λa e=>a+d (x e)*d (y e)) (d 0);let q:=A2 s (A3 (Af Z) (Ag Z) S h Ae);if q !=A1 then Cl R q else act R (CU Z x y s))=act R (AX Z x y):=by set i:=AU x Z 0 with J;obtain⟨K,j⟩:=Ea;have r:D (d 0)=0:=j;have l:∀e,e∈i->e(by have:=(D2 g).2.1;omega);have n:∀e,e∈i->դ (x e)≠255/\դ (y e)≠255:=λe g=>⟨AP e (l e g),p e (l e g)⟩;have o:i.length<=Z:=D4 x Z 0;have L:Հ<=2^Ճ:=Գ;obtain⟨AE,AK,Ao,M,t⟩:=Gi AF (b:=0) n o z A B E F G H (λe g=>I e (l e g)) K (by rw[j]) (by rw[j];exact L) (by rw[j,r,צ]);have N:(Z:ض)<=2^20:=(by exact_mod_cast AF);have u:(i.length:ض)<=Z:=(by exact_mod_cast o);have O:Ծ^20<=2^21:=Բ;refine Gf R AF (λk v=>⟨AP k v,p k v⟩) Է n o ?_ ?_ ?_ t (FI 0 x y i Է n (by linarith only[u,N,O]) t) (Χ _) u AE AK Ao M;have P:AG 0=0:=(Ee 0 Է).2;rw[FO,Du,P,ֆ,J,Ge x _ (λw Q=>by rw[(Ee _ Q).2,ק]) Z 0];unfold A7 Ck;rw[r,צ,ֆ];exact FP x (λe=> |AW (x e) (y e)| +Ak) (λw=>օ (ը _) Ch.le) Z 0;exact FP x (λe=> |D (d (x e))| + |D (d (y e))|) (λw=>օ (ը _) (ը _)) Z 0 def G2 (m k n:լ)(A B:ե զ)(q:լ):զ:=AX k (λa=>A[(q/(m*n)*m+q/n%m)*k+a]!) (λa=>B[(q/(m*n)*k+a)*n+q%n]!) @[noinline] def G3 (m k n:լ)(A B:ե զ)(i:ժ)(s:W):զ:=act false (CU k (λa=>A[(iԻ/(m*n)*m+iԻ/n%m)*k+a]!) (λa=>B[(iԻ/(m*n)*k+a)*n+iԻ%n]!) s) def Fm (a m k n:լ)(A B:ե զ):ե զ:=if e:a=1/\A.size=m*k/\B.size=k*n/\8<=n/\00) n m (δ (m*n) 0)else gemmWith AX a m k n A B else gemmWith AX a m k n A B lemma JV:Fm=gemmSpec:=by funext b m k n A B show _=gemmWith AX b m k n A B have o:gemmWith AX b m k n A B=υ (n:=b*(m*n)) λq=>G2 m k n A B q.val:=rfl unfold Fm split next p=> obtain⟨t,O,u,v,w,P,g,x,y,Q⟩:=p subst t dsimp only obtain⟨-,z,D⟩:=CJ B Ա set c:=Bl B Ա split next E=> rw[o,Nat.one_mul] obtain⟨-,-,h,F⟩:=E obtain⟨G,H,I,-⟩:=Cs c.AN (Dd h) refine G1 v w g x y u h z D (λr j d i l R J=> ?_) obtain⟨AE,AK⟩:=DY (q:=r*n+j) (r:=r) (j:=j) (n:=n) rfl i obtain⟨AP,K,L,M,N⟩:=Fa A g (Fe F d) have:=JU (Z:=k) Ա (λa=>A[r*k+a]!) (λa=>B[a*n+j]!) false AP (λa e=>(l a e).1) K L M N G H I (λa e=>(l a e).2) simp only[Bc,G3,G2,Ct,J,AE,AK,Β5 (Fb d i),ρ2,γ9,θ d] exact this next=>rfl next=>rfl def G4 (s:ش)(R:ջ)(d e b:ե զ)(q:լ):զ:=act R (AX (s.cin*s.kh*s.kw+1) (λa=>if aif aif aif ab[o]!) n s.cout (δ (s.cout*n) 0)else conv2dWith AX s R a d b def G7 (s:ش)(R:ջ)(a d b:ե զ):ե զ:=if e:aԼ=s.cin*(s.h*s.w)/\dԼ=s.cout*s.cin/\bԼ=s.cout/\8<=s.h*s.w/\0 obtain⟨Ar,-,Y,x,L,y,z,A,-,-⟩:=K obtain⟨-,B,D⟩:=CJ e Ա generalize Bl e Ա=c at B D⊢ generalize AF:s.h*s.w=n at Ar x z A⊢ obtain⟨k,l,p,t⟩:=J have E:s.ho=s.h:=by unfold ConvShape.ho rw[k,p,t,Ζ7,Ν,ψ3] omega have F:s.wo=s.w:=by unfold ConvShape.wo rw[l,p,t,Ζ7,Ν,ψ3] omega have M:s.cin*s.kh*s.kw=s.cin:=by rw[k,l,ψ8,ψ8] have N:conv2dWith AX s R e g b= υ (n:=s.cout*(s.ho*s.wo)) λq=>G4 s R e g b q.val:=rfl unfold G6 split next O=> rw[N,E,F,AF] obtain⟨-,-,G,P,Q⟩:=O obtain⟨S,U,V,-⟩:=Cs c.AN (Dd G) obtain⟨W,X,aa,ab⟩:=Cs (BS b) P refine G1 x L y z A Ar G B D (λo a H u v ao ac=> ?_) obtain⟨AE,AK⟩:=DY (q:=o*n+a) (r:=o) (j:=a) (n:=n) rfl u have I:o*n+a=a+s.w*(o*s.h):=by rw[<-AF];ring have Ao:(o*n+a)/s.w%s.h=a/s.w:=by rw[I,Nat.add_mul_div_left _ _ i,τ0] apply θ rw[Κ i,AF] exact u have ad:(o*n+a)%s.w=a%s.w:=by rw[I,Nat.add_mul_mod_self_left] obtain⟨AP,ae,af,ag,ah⟩:=Fa g y (Fe Q H) have w:=ab _ (D3 b o (by rw[Y];exact H)) have:=Gr (Z:=s.cin) Ա (λd=>g[o*s.cin+d]!) (λd=>e[d*n+a]!) b[o]! R AP (λd h=>(v d h).1) w.1 ae af ag ah S U V (λd h=>(v d h).2) W X aa w.2 rw[<-I8 AP (λd h=>(v d h).1) w.1]at this have ai:∀d,windowAt s e (a/s.w) (a%s.w) d=e[d*n+a]!:=by intro d have aj:a/s.wrfl next=>rfl open FloatLib.Floats lemma G8 (a:բ):آ a=Μ (fmt:=ة) a.toBitVec:=by rw[<-ofUInt32_bits a];rfl lemma Fn (b:բ):դ b=255<->(դ b)Ի=255:=⟨λa=>by rw[a];rfl,λa=>ξ.mp (by simpa using a)⟩ lemma G9 {a:բ}(e:դ a≠255):(Ο (آ a)).isFinite=true:=by obtain⟨d,b⟩:=κ0 (DP e);rw[η9 Fmt Ar]at b;cases g:Ο (آ a)<;>rw[g]at b<;>simp_all[Φ,χ] lemma JW (a:η5):ج (δ2 ة a)=(Float32.Model.pack a).toBits:=by show UInt32.ofNat (Β6 Ε2 a)Ի=UInt32.ofBitVec _;rw[<-UInt32.toBitVec_inj];simp lemma JX {a b:բ}(d:դ a≠255)(Y:դ b≠255):(ء a+ء b).toBits=ج (Η0 (آ a) (آ b)):=by rw[ι3 (fmt:=Fmt) Ar _ _ (G9 d) (G9 Y),JW,G8,G8,<-ξ2 (Μ (fmt:=Fmt) a.toBitVec),<-ξ2 (Μ (fmt:=Fmt) b.toBitVec)];rfl lemma JY (f:Float32)(d:դ f.toBits=255)(e:ս f.toBits≠0):f.toBitsԻ<2^31:=by have g:=f.toModel.valid.eq_packedNaN;have h:ρ7 23 8 f.toBits.toBitVec=(-1#8):=(by apply θ2;rw[ι4,η];have a:=BJ f.toBits;rw[(Fn _).mp d]at a;exact a.symm);have i:ρ7 0 23 f.toBits.toBitVec≠0#23:=(by intro j;have b:=ר Α8 j;rw[ι4,η]at b;have k:=CN f.toBits;apply e;apply ξ.mp;rw[k];simpa using b);have a:=g h i;have b:=ר Α8 a;show f.toModel.toBits.toBitVecԻ<2^31;rw[b];decide @[noinline] def D9 (a b:զ):զ:=ج (Η0 (آ a) (آ b)) @[inline] def Fo (a b:զ):ջ:=(((a<<<(1:բ))>>>(24:բ))+1) ||| (((b<<<(1:բ))>>>(24:բ))+1)<256 lemma G_ (a:բ):((a<<<(1:բ))>>>(24:բ))Ի=(դ a)Ի:=by rw[BJ,γ1,κ6,η,Ζ];have b:=a.toNat_lt;show aԻ*2^1%2^32/2^24=_;omega lemma JZ {a b:զ}(d:Fo a b=true):դ a≠255/\դ b≠255:=by unfold Fo at d;rw[decide_eq_true_eq,η0,Δ9]at d;have g:=G_ a;have h:=G_ b;have k:=փ a;have l:=փ b;have e:(1:բ).toNat=1:=rfl;have AE:(((a<<<(1:բ))>>>(24:բ))+1).toNat=(դ a).toNat+1:=(by rw[ι0,g,e];omega);have AK:(((b<<<(1:բ))>>>(24:բ))+1).toNat=(դ b).toNat+1:=(by rw[ι0,h,e];omega);have i:(256:բ).toNat=256:=rfl;rw[AE,AK,i]at d;have n:= @ψ2 ((դ a).toNat+1) ((դ b).toNat+1);have o:= @Ε0 ((դ a).toNat+1) ((դ b).toNat+1);constructor<;>intro j<;>rw[Fn]at j<;>omega @[inline] def Fp (R:ջ)(a b:զ):զ:=if Fo a b then Cl R (ء a+ء b).toBits else act R (D9 a b) lemma Ja (R:ջ)(a b:զ):Fp R a b=act R (D9 a b):=by unfold Fp;split;rename_i d;obtain⟨e,Y⟩:=JZ d;rw[FK _ _ (JY _),JX e Y,D9];rfl @[specialize] def Er (N:լ)(f:(i:ժ)->iԻզ)(a:N<2^31):(n:լ)->(i:ժ)->iԻ+n<=N->ե զ->ե զ | 0,_,_,AA=>AA | n+1,i,b,AA=>have d:=Al i Ա;Er N f a n (i+1) Ա (Cp AA i (f i Ա)) lemma Jb {AS:լ->զ}{N M d:լ}{f:(i:ժ)->i.toNatզ}{k:N<2^31} (t:d<=M)(n:լ)(i:ժ)(l:i.toNat+n<=N)(a:լ)(o:i.toNat=a)(p:a+n=d) (h:∀b g,a<=b.toNat->b.toNatf b g=AS b.toNat)(AA:ե զ) (e:Ad AS M (·rw[<-p];exact e|succ n r=>have u:=Al i Ա;rw[Er];refine r (i+1) _ (a+1) Ա Ա (λb g j=>h b g Ա) _ ⟨(FS _ _ _).trans e.1,λq v=> ?_⟩;rw[FT _ _ _ (by rw[e.1];omega)];split;rename_i j;rw[j];exact h i _ o.ge Ա;exact e.2 q Ա def Fq (R:ջ)(a b:ե զ):ե զ:=if d:bԼ=aԼ/\aԼ<2^31 then Er aԼ (λi e=>Fp R (a.uget i e) (b.uget i (by have:=d.1;omega))) d.2 aԼ 0 (by have:=Ai;omega) (δ aԼ 0)else addReluSpec R a b lemma Jc:Fq=addReluSpec:=by funext R a b unfold Fq split ·rename_i e rw[CY (λq d=>d) (Jb (AS:=λq=>act R (D9 a[q]! b[q]!)) ն aԼ 0 _ 0 Ai (γ9 _) (λg h _ _=>by rw[Ja,BR,BR]) _ ⟨by simp,λq d=>absurd d q.not_lt_zero⟩)] refine ר υ (funext λq=> ?_) simp only[D9,getElem!_pos a q.val q.isLt] rfl ·rfl @[inline] def BU (a:զ):ջ:=let m:=a&&&Չ;(m+(((m-1)>>>(31:բ))<<<(23:բ)))-0x00800000<0x7F000000 lemma Fr {a:զ}(b:BU a=true):դ a≠255/\AC (d a)/\D (d a)=AG a:=by unfold BU at b;simp only[decide_eq_true_eq]at b;rw[η0]at b;have u:=a.toNat_lt;have g:(a&&&Չ).toNat=a.toNat%2^31:=(by rw[Ε];exact γ _ 31);have i:((a&&&Չ)-1).toNat=(2^32-1+a.toNat%2^31)%2^32:=(by rw[Β7,g];rfl);have j:(((a&&&Չ)-1)>>>(31:բ)).toNat=(2^32-1+a.toNat%2^31)%2^32/2^31:=(by rw[γ1,i,η];rfl);have k:((((a&&&Չ)-1)>>>(31:բ))<<<(23:բ)).toNat=(2^32-1+a.toNat%2^31)%2^32/2^31*2^23%2^32:=(by rw[κ6,j,Ζ];rfl);rw[Β7,ι0,g,k]at b;have l:(0x7F000000:բ).toNat=0x7F000000:=rfl;have n:(0x00800000:բ).toNat=0x00800000:=rfl;rw[l,n]at b;have v:=BJ a;have o:=CN a;have h:դ a≠255:=λp=>(by rw[Fn]at p;omega);obtain⟨q,r,t⟩:=Bo a h;refine⟨h,q,?_⟩;by_cases e:դ a=0;have w:(դ a).toNat=0:=(by rw[e];rfl);rw[t e,AG,sv,show mantOf a=0 by rw[mantOf,վ e,o];omega];simp;exact r e lemma Jd (x s:բ):Α AM (AG x*AG s)=AG x*AG s:=by have b:∀a,(sv a).natAbs<2^24:=λa=>(by unfold sv;split<;>simpa using mantOf_lt_24 a);rw[show AG x*AG s=((sv x*sv s:ص):ض)*2^((idxOf x:ص)-149+((idxOf s:ص)-149)) by rw[AG,AG,կ ի];push_cast;ring];exact Dq AM _ _ (by rw[ψ5];exact ւ (ξ7 (b x) (b s)) Է) (by show(-1074:ص)<=_;omega) def Es (a:լ):ض:=((2^52+a%2^52:լ):ض)*Ծ^(((a/2^52:լ):ص)-1075) lemma Fs (b:ծ)(An:Bf (bԻ%2^63)):A6 b=(if 2^63<=bԻ thenՆelse 1)*Es (bԻ%2^63):=GE b An lemma HA {a q:լ}(e:a>>(63:ծ)).toUInt32<<<(31:բ))+(CB a).toUInt32 else A1 lemma Je {a:ծ}(d:a-Ւ<Փ) (b:3<=(a&&&Վ)-Ք):Bf (a.toNat-1)/\Bf (a.toNat+1)/\Bf a.toNat/\(a.toNat-1+2^28)/2^29=(a.toNat+2^28)/2^29/\(a.toNat+1+2^28)/2^29=(a.toNat+2^28)/2^29:=by have j:=a.toNat_lt;rw[Η,θ9]at d;rw[γ6,θ9]at b;have AE:(a&&&Վ).toNat=a.toNat%2^29:=(by rw[ξ6];exact γ _ 29);rw[AE]at b;have e:(Ւ:ծ).toNat=Ւ:=rfl;have g:(Փ:ծ).toNat=Փ:=rfl;have h:(Ք:ծ).toNat=Ք:=rfl;have i:(3:ծ).toNat=3:=rfl;rw[e,g]at d;rw[h,i]at b;unfold Bf;omega lemma Jf (a:ծ)(b:Ս<=aԻ)(d:aԻ<Օ):(CB a)Ի<2^31:=by rw[ER a b d];omega lemma HB (b a d:ծ)(e:ض)(i:A6 b=Α AM e) (l:2^63<=aԻ<->2^63<=bԻ)(n:2^63<=dԻ<->2^63<=bԻ) (j:Bf (aԻ%2^63))(k:Bf (dԻ%2^63)) (o:A6 aΑ AM (A6 c)=A6 c:=(by intro c An;obtain⟨v,w,-⟩:=An;have x:=c.toNat_lt;exact Model.roundAt_toReal_eq _ (C9 c Ա Ա).1);have t:A6 a<=e:=(by by_contra h;have:=Ρ AM (le_of_lt (not_le.mp h));rw[BZ a j,<-i]at this;exact absurd (ב this o) (lt_irrefl _));have u:e<=A6 d:=(by by_contra h;have:=Ρ AM (le_of_lt (not_le.mp h));rw[BZ d k,<-i]at this;exact absurd (ւ p this) (lt_irrefl _));exact GG a d e t u g (l.trans n.symm) j k q r lemma Jg {r:W}{l:ض}(A:D r=Α AM l)(p:Cc r≠A1):DQ l (Cc r):=by unfold Cc at p⊢;simp only[]at p⊢;set b:=r.toBits with Y;set a:=b&&&Պ with B;by_cases n:(a-Ւ<Փ&&3<=(a&&&Վ)-Ք)=true;rw[ף _ _ (eq_true n)];simp only[Ξ,decide_eq_true_eq]at n;obtain⟨q,t,h,E,F⟩:=Je n.1 n.2;have G:=h.1;have H:=h.2.1;have y:b.toNat%2^63=a.toNat:=(DA b).symm;have I:=b.toNat_lt;have z:A6 b=Α AM l:=(by rw[<-A];rfl);have u:=GH b (CB a) (Jf a h.1 h.2.1);rw[ER a h.1 h.2.1]at u;have o:=Fs b (by rw[y];exact h);rw[y]at o;have v:(1:ծ).toNat=1:=rfl;have d:(b+1).toNat=b.toNat+1:=(by rw[Ψ,v];exact θ Ա);have e:(b-1).toNat=b.toNat-1:=(by rw[θ0 _ _ (by rw[γ6,v];omega),v]);have AE:(b.toNat+1)%2^63=a.toNat+1:=Ա;have AK:(b.toNat-1)%2^63=a.toNat-1:=Ա;have w:=Fs (b+1) (by rw[d,AE];exact t);have x:=Fs (b-1) (by rw[e,AK];exact q);rw[d,AE]at w;rw[e,AK]at x;have Aw:=HA (show a.toNatg,λ_=>j⟩) (by rw[e];exact⟨λ_=>g,λ_=>k⟩) (by rw[d,AE];exact t) (by rw[e,AK];exact q) ?_ ?_ (by rw[d,e,AE,AK];omega) _ ?_;rw[w,o,վ j,վ g];linarith;rw[x,o,վ g,վ k];linarith;rw[u,d,AE,վ j];have:b.toNat/2^63=1:=Ա;rw[this];omega;have j:¬2^63<=b.toNat+1:=Ա;have k:¬2^63<=b.toNat-1:=Ա;refine HB b (b-1) (b+1) l z (by rw[e];exact⟨λi=>absurd i k,λi=>absurd i g⟩) (by rw[d];exact⟨λi=>absurd i j,λi=>absurd i g⟩) (by rw[e,AK];exact q) (by rw[d,AE];exact t) ?_ ?_ (by rw[d,e,AE,AK];omega) _ ?_;rw[x,o,ր k,ր g];linarith;rw[w,o,ր g,ր j];linarith;rw[u,e,AK,ր k];have:b.toNat/2^63=0:=Ա;rw[this];omega;rw[ؤ _ _ (eq_false n)]at p;exact absurd rfl p @[noinline] def DL (x s a:զ):զ:=ج (Η1 (آ x) (آ s) (آ a)) lemma Jh {x s a:զ}(AP:BU x=true)(v:BU s=true)(w:BU a=true) (y:Cc (d x*d s+d a)≠A1):DL x s a=Cc (d x*d s+d a)/\դ (Cc (d x*d s+d a))≠255:=by obtain⟨b,z,i⟩:=Fr AP;obtain⟨e,A,j⟩:=Fr v;obtain⟨BW,CA,B⟩:=Fr w;have k:=տ (CF x b) (CF s e) (ը _) Գ;have Y:Ծ^128*2^128+2^128<=2^1000:=י Բ ((ד Ծ 200 200).symm.trans_le (ց one_le_two Բ));obtain⟨D,g⟩:=C8 z A (k.trans ((le_add_of_nonneg_right Գ).trans Y));rw[i,j,Jd]at g;obtain⟨-,l⟩:=EM D CA (by rw[g,<-i,<-j,ք];exact(add_le_add k (CF a BW)).trans Y);rw[g,B]at l;obtain⟨n,h,E,F⟩:=Jg l y;set G:=Cc (d x*d s+d a);have o:=DP b;have p:=DP e;have q:=DP BW;have r:γ5 (آ x)*γ5 (آ s)+γ5 (آ a)=AG x*AG s+AG a:=(by rw[C_ x b,C_ s e,C_ a BW]);have t:=Model.isFinite_fma_of_abs_toReal_fma_le_posMaxFinite (آ x) (آ s) (آ a) Ar o p q (by rw[r];exact F.trans E8);have u:γ5 (Η1 (آ x) (آ s) (آ a))=Α ة (AG x*AG s+AG a):=(by rw[Model.toReal_fma_eq_roundAt _ _ _ Ar o p q t,r]);refine⟨?_,h⟩;have:=γ8 t (DP h) (by rw[u,n,C_ G h]) (by rw[u,n];exact E);rw[DL,this,Dr] @[inline] def D_ (R h:ջ)(b e:զ)(sv i:W)(a:զ):զ:=if h&&BU a then let g:=Cc (d a*sv+i);if g !=A1 then Cl R g else act R (DL a b e)else act R (DL a b e) lemma Ji (R:ջ)(a b e:զ):D_ R (BU a&&BU b) a b (d a) (d b) e=act R (DL e a b):=by unfold D_;simp only[];by_cases g:(BU a&&BU b&&BU e)=true;rw[ף _ _ (eq_true g)];simp only[Ξ]at g;obtain⟨⟨i,j⟩,k⟩:=g;by_cases h:Cc (d e*d a+d b)=A1;simp[h];obtain⟨AE,AK⟩:=Jh k i j h;rw[ף _ _ (by simpa using h),FK _ _ (λl=>absurd l AK),AE];rw[ؤ _ _ (eq_false g)] @[specialize] def De (f:զ->զ):(n:լ)->(i:ժ)->ե զ->ե զ | 0,_,x=>x | n+1,i,x=>if a:iԻզ)(n:լ):∀(i:ժ) (x:ե զ),iԻ+n<=xԼ->xԼ<2^31->(De f n i x)Լ=xԼ/\∀q,(De f n i x)[q]! =if iԻ<=q/\q< iԻ+n then f x[q]!else x[q]!:=by induction n with|zero=>intro i x _ _;exact⟨rfl,λq=>by rw[ր Ա];rfl⟩|succ n h=>intro i x o j;have a:iԻ ?_⟩;rw[l q,d,FQ,BR];by_cases e:q=iԻ;subst e;rw[ր Ա,վ rfl,վ Ա];rw[ր e];by_cases g:iԻ+1<=q/\q< iԻ+1+n;rw[վ g,վ Ա];rw[ր g,ր Ա] def HC (R:ջ)(c a:լ)(x s b:ե զ):ե զ:=if e:xԼ=c*a/\c*a<2^30/\0De (D_ R (BU s[r]!&&BU b[r]!) s[r]! b[r]! (d s[r]!) (d b[r]!)) a (r*a)Խ y) c 0 x else scaleShiftSpec R c a x s b lemma KT:HC=scaleShiftSpec:=by funext R c a x s b unfold HC split ·rename_i o obtain⟨AP,A,B⟩:=o have p:=El (AB:=c) (λr y=>De (D_ R (BU s[r]!&&BU b[r]!) s[r]! b[r]! (d s[r]!) (d b[r]!)) a (r*a)Խ y) (λr y=>yԼ=c*a/\ ∀q,y[q]! =if qby obtain⟨e,h⟩:=u have D:(r+1)*a<=c*a:=Β _ t have E:=Nat.add_one_mul r a have j:(r*a).toUSize.toNat=r*a:=Aq _ Ա obtain⟨Aw,v⟩:=Jj (D_ R (BU s[r]!&&BU b[r]!) s[r]! b[r]! (d s[r]!) (d b[r]!)) a (r*a)Խ y (by rw[j,e];omega) (by rw[e];omega) refine⟨Aw.trans e,λq=> ?_⟩ rw[v q,j] by_cases g:r*a<=q/\qby rw[ր Ա]⟩ obtain⟨l,w⟩:=p apply Array.ext (by rw[l];simp[scaleShiftSpec]) intro i n F have z:i(by rw[b]at i;exact absurd i Է);obtain⟨l,k,n⟩:=Bo a j;refine⟨j,by omega,l,?_⟩;rcases e with e | e;exact k e;by_cases g:դ a=0;rw[n g];have:խ a=0:=(by simp[mantOf,g,e]);simp[AG,sv,this];exact k g lemma Av {a Ft:ص}(b:a<=Ft):Ծ^a<=2^Ft:=շ Բ b lemma Fu {M:ض}(a:M<=2^Ձ):4*M<=2^(132:ص):=by calc 4*M<=4*2^Ձ:=Դ _=2^(132:ص):=by rw[show(132:ص)=2+130 by norm_num,կ ի];norm_num lemma Fv {a b:ض}{k:ص}(d:a<=2^k)(Y:b<=2^k):a+b<=2^(k+1):=by rw[ם ի];linarith lemma HD (a:զ)(k:ص)(b:դ a≠255)(e:((դ a)Ի:ص)<=k+126): |AG a| <=Ծ^k:=by by_cases d:դ a=0;exact(GJ a d).trans (Av Ա);rw[<-(Bo a b).2.1 d];exact(EV a b).trans (Av Ա) lemma Fw (a:զ)(b:դ a≠0)(d:ռ a=false):0b (ξ.mp (by rw[g];rfl));calcԾ^Կ=2^(23:լ)*2^((1:ص)-150):=by rw[<-յ,<-կ ի];norm_num _<=((2^23+(ս a)Ի:լ):ض)*2^(((դ a)Ի:ص)-150):=by apply տ;push_cast;linarith[(Χ (ս a)Ի:Հ<=_)];exact Av Ա;positivity;positivity lemma Et (a:զ)(d:դ a≠255):(դ a)Ի<=254:=by have:=փ a;have b:(դ a)Ի≠255:=λb=>d (ξ.mp (by rw[b];rfl));omega lemma HG:AC (ι 0)/\D (ι 0)=0:=GI 0 (א rfl) lemma Jp {a b d:ض}(Y:0<=b)(i:d<=1)(j:0<=d)(h: |a-b| <=d*b): |Δ a-Δ b| <=d*Δ b:=by have k:=ղ h;have g:=Β8 b;(have l:Δ a<=(1+d)*Δ b:=by have e:a<=(1+d)*b:=Դ;calc Δ a<=Δ ((1+d)*b):=τ7 e _=Δ (1+d)*Δ b:=Ζ2 Դ b _<=(1+d)*Δ b:=by apply ա _ g;rw[Real.sqrt_le_left Դ];nlinarith);(have n:(1-d)*Δ b<=Δ a:=by have e:(1-d)*b<=a:=Դ;calc(1-d)*Δ b<=Δ (1-d)*Δ b:=by apply ա _ g;rw[Real.le_sqrt Դ Դ];nlinarith _=Δ ((1-d)*b):=(Ζ2 Դ b).symm _<=Δ a:=τ7 e);rw[מ];constructor<;>nlinarith lemma HH:Ak<=Ծ^Կ:=by unfold Ak AH J;rw[ו Գ,<-կ ի];exact Av Բ lemma Cz {V:ض}(a:Ծ^Կ<=V):AH<=J*V:=EA ((Av Բ).trans a) lemma HI {E:ض}(a:Ծ^Կ<=E):3000*AH<=J*E:=by have b:AH<=J*2^(-138:ص):=EA (Av Բ);have d:Ծ^(-138:ص)*3000<=2^Կ:=(by rw[showԾ^Կ=2^(-138:ص)*2^(12:ص) by rw[<-կ ի];norm_num];exact գ Բ Գ);nlinarith[Aj] lemma BA {M:ض}{k:ص}(a:Ծ^k<=M):0ℚ)(a:ℚ)(n:լ): (ρ n).foldl (λb j=>b+f j) a=a+∑j∈ο n,f j:=by induction n generalizing a with | zero=>simp | succ n d=> rw[ι7,τ6,d,Finset.sum_range_succ] simp[add_assoc] lemma Fz (n:լ)(x:ե զ)(r:լ): rowMean n x r=(∑j∈ο n,հ x[r*n+j]!)/n:=by unfold rowMean rw[HL (λj=>rationalWord x[r*n+j]!) 0 n,ֆ] lemma HM:AQ=Ծ^(400:ص):=by unfold AQ;exact(յ 2 400).symm lemma Jr {n a C0 b d:ض}(AF:1<=n)(p:n<=2^22)(g:1/2*C0<=a) (h:Ծ^Կ<=C0)(j:(16*n+40)*J<=b) (k:b<=2)(i: |d-a*b| <=J* |a*b| +AH):(0+1)*AO a+J*a+(n+14)*J*C0<=d*(1-J)/\0<=d:=by have e:=Aj;have l:J<=1/2^53:=Az.le;have q:0a=b):Ev a b=b:=by unfold Ev;by_cases d:a=A1;simp[d];rw[վ (bne_iff_ne.mpr d)];exact e d lemma Js (AA:ե զ)(a:զ)(k:լ)(b:kb (ξ.mp (by simpa using d));have AF:((դ o).toUInt64+897).toNat=(դ o).toNat+897:=(by rw[Ψ,ξ4];show((դ o).toNat+897)%_=_;omega);obtain⟨-,a⟩:=DE ((դ o).toUInt64+897) Ա Ա;rw[AF]at a;show D (BL _)=_;rw[a,show(((expOf o).toNat+897:լ):ص)-1023=((expOf o).toNat:ص)-126 by push_cast;ring] def C1 (n:լ)(a:բ):W:=Bd (BG n+(դ a)Ի+848) def ED (n:լ)(a b:բ):W:=Bd ((դ b)Ի+(դ a)Ի+BG n+722) def F1 (a:բ):W:=Bd ((դ a)Ի+848) def EE (n:լ)(a:բ):ծ:=(2*BG n+2*(դ a)Ի+728).toUInt64 @[specialize] def C2 (X:է)(f:W->W):(c:լ)->(i:ժ)->iԻ+c<=XԼ->XԼ<2^31->W->W | 0,_,_,_,s=>s | c+1,i,b,a,s=>C2 X f c (i+1) (by rw[Al i Ա];omega) a (s+f (X.uget i Ա)) lemma HP (X:է)(f:W->W)(c:լ):∀(i:ժ) (a:iԻ+c<=XԼ) (b:XԼ<2^31) (s:W),C2 X f c i a b s=Bv (λj=>f X.data[j]!) s iԻ c:=by induction c with|zero=>intros;rfl|succ c d=>intro i a b s;rw[C2,Bv,d,Al i Ա,CV] lemma F2 {f:լ->ض}{n:լ}{B:ض}(a:∀j,jf j<=B):∑j∈ο n,f j<=n*B:=by simpa using Finset.sum_le_card_nsmul _ _ B λj b=>a j (Finset.mem_range.mp b) lemma HQ {G:ض}(b:G<=AQ)(As:լ->W)(L BB:լ->ض)(i n:լ)(AF:n<=2^22) (g:∀j,jBD (AO G) (As (i+j)) (L (i+j)) (BB (i+j)) 0) (d:∑j∈ο n,BB (i+j)<=G):AC (Bv As (ι 0) i n)/\ |D (Bv As (ι 0) i n)-∑j∈ο n,L (i+j)| <=n*AO G+J*∑j∈ο n,BB (i+j)/\ |D (Bv As (ι 0) i n)| <=2^25*AQ:=by have e:=HG;have:=H7 b (As:=As) (L:=L) (BB:=BB) (BO:=0) le_rfl (i:=i) (c:=n) g (a:=ι 0) (A:=0) (m:=0) (k:=0) ⟨e.1,by rw[e.2];simp,by simp⟩ ն (by simp;exact_mod_cast AF) (by simpa using d);simp only[zero_add,mul_one]at this;exact⟨this.BZ,this.DS,FH this (by exact_mod_cast AF) b d⟩ lemma Jv {n M a s m:ض}(AF:1<=n)(d:n<=2^22)(e:Ծ^Կ<=M) (i: |a| <=n*M)(j: |s-a| <=n*AO (n*M)+J*(n*M)) (k: |m-s/n| <=4*(J* |s/n|)+AH): |m-a/n| <=14*n*J*M/\ |m| <=2*M/\ |a/n| <=M:=by have h:0ض)(b:ض):∑j∈ο n,(a j-b)^2=∑j∈ο n,(a j-(∑i∈ο n,a i)/n)^2+n*((∑i∈ο n,a i)/n-b)^2:=by have k:(n:ض)≠0:=Գ;set d:=(∑i∈ο n,a i)/n with e;have g:∑j∈ο n,(a j-d)=0:=(by rw[χ3,ξ8,κ8,nsmul_eq_mul,e];field_simp;ring);have h:∀j,(a j-b)^2=(a j-d)^2+2*(d-b)*(a j-d)+(d-b)^2:=(by intro j;ring);simp only[h,κ9,<-Ε9,g,ξ8,κ8,nsmul_eq_mul];ring lemma Jz {a b c E ε q:ض}(e:Ծ^Կ<=E)(p:0<=a)(g:0<=ε) (CL:c=a+ε)(r: |b-c| <=3*J*c+3*AH)(h:q<=1001/1000*(b+E)) (t:ε<=J*q): |b+E-(a+E)| <=5*J*(a+E):=by subst CL;have i:=Aj;have j:J<=1/2^50:=BK.trans Բ;have u:=HI e;have v:=BA e;have k:=ը (b+E-(a+E));set d:= |b+E-(a+E)| with l;have w:d<=3*J*(a+ε)+3*AH+ε:=(by have n:b+E-(a+E)=(b-(a+ε))+ε:=Զ;rw[l,n];have:=ז (b-(a+ε)) ε;rw[թ g]at this;linarith);have o:b+E<=a+E+d:=(by have:=ذ (b+E-(a+E));linarith);have x:3*J*ε<=1/1000*ε:=ա Դ g;have y:J*q<=J*(1001/1000*(a+E+d)):=գ (h.trans (գ o Բ)) i.le;have z:J*d<=1/2^50*d:=ա j k;have A:J*a>=0:=Գ;have B:J*E>=0:=Գ;linarith lemma Dh {a b A B:ض}(d: |a| <=A)(Y: |b| <=B): |a*b| <=A*B:=(ք a b).le.trans (տ d Y (ը _) ((ը _).trans d)) lemma J0 {x e i h b I j M a d c g r y o:ض}(p:Ծ^Կ<=M) (q:Ծ^Կ<=a)(t:Ծ^Կ<=d) (AP: |x| <=M)(An: |h| <=a)(Y: |b| <=d)(Z: |i| <=M)(aa: |e| <=2*M) (A: |e-i| <=o)(ab:0linarith lemma J1 {n M a h I j b d e g i:ض}(AF:1<=n) (t:Ծ^Կ<=M)(u:Ծ^Կ<=a)(k:Ծ^Կ<=h) (Ar:0<=I)(v:(16*n+36)*J*M<=j)(DF:(1-2*J)*(a*j)<=b) (l: |e-I*b| <=J* |I*b| +AH)(Ey:15*J*h<=d) (o: |g-(e+d)| <=J* |e+d| +AH)(w:i<=4*(M*a*I)+2*h):0<=g/\AO i+J*i+(a*I*(14*n*J*M+20*J*M)+4*J*h)<=g*(1-J):=by have x:=Aj;have y:J<=1/1000:=BK.trans Բ;have D:=BA t;have z:=BA u;have E:=BA k;have Ao:=Cz k;have F:ՀX.data[k]! =d x[k]!/\B9 x[k]! =true lemma Ez {X:է}{x:ե զ}(a:B1 X x){k:լ}(b:k |AG x[r*n+j]!| <=M)/\Ծ^Կ<=M/\M<=2^Ձ An:B1 G h/\(∀k,k |AG h[k]!| <=e)/\Ծ^Կ<=e/\e<=2^Ձ Y:B1 B b/\(∀k,k |AG b[k]!| <=g)/\Ծ^Կ<=g/\g<=2^Ձ HT:(16*n+36)*J*M<=D i DF:AC K/\(1-2*J)*(e*D i)<=D K/\ |D K| <=2^(264:ص) Ey:AC l/\15*J*g<=D l/\ |D l| <=2^Ձ J4:∀q:W,AC q->q.toBitsԻ<2^63->pԻ<=q.toBitsԻ/2^52-> D i^2<=J*D q def DN (X:է) (m:W) (i n:լ):ض:=∑j∈ο n,D (X.data[i+j]!-m)*D (X.data[i+j]!-m) lemma J5 {n:լ}{x:ե զ}{X:է}{M:ض}{m:W}{r:լ}(g:n<=2^22) (q:B1 X x)(t:∀j,j |AG x[r*n+j]!| <=M)(u:Ծ^Կ<=M) (h:M<=2^Ձ)(v:AC m)(w: |D m| <=2*M)(B:r*n+n<=xԼ) {s:W}(y:s=Bv (λj=>(X.data[j]!-m)*(X.data[j]!-m)) (ι 0) (r*n) n): AC s/\ |D s-DN X m (r*n) n| <=n*AO (DN X m (r*n) n+n*Ak)+ J*(DN X m (r*n) n+n*Ak)/\ |D s| <=2^25*AQ/\0<=DN X m (r*n) n:=by have z:∀j,jr*n+jby omega have b:=λj (a:jF3 q v u h w (z j a) (t j a) have i:∀j,j |D (X.data[r*n+j]!-m)*D (X.data[r*n+j]!-m)| <= 2^(132+132:ص):=λj a=>have l:=(b j a).2.2.trans (Fu h);Fx l l set S:=DN X m (r*n) n with AL have d:∑j∈ο n,(|D (X.data[r*n+j]!-m)*D (X.data[r*n+j]!-m)| +Ak)= S+n*Ak:=by rw[κ9,ξ8,κ8,nsmul_eq_mul,AL,DN] congr 1 exact υ6 rfl (λj _=>թ (mul_self_nonneg _)) have A:S+n*Ak<=AQ:=by rw[<-d] exact(F2 λj a=>(Fv (i j a) (HH.trans (Av Բ))).trans (Av (Ft:=378) Բ)).trans (HS (by exact_mod_cast g) ն Գ) obtain⟨o,e,p⟩:=HQ A (λk=>(X.data[k]!-m)*(X.data[k]!-m)) (λk=>D (X.data[k]!-m)*D (X.data[k]!-m)) (λk=> |D (X.data[k]!-m)*D (X.data[k]!-m)| +Ak) (r*n) n g (λj a=>FB (b j a).1 (b j a).1 ((i j a).trans (Di Բ))) (ך d) rw[<-y]at o e p rw[d]at e exact⟨o,e,p,τ8 (λj _=>mul_self_nonneg _)⟩ lemma HU {a b:W}{k:ص}(g:AC a)(Y:AC b)(h: |D a| <=2^k) (i: |D b| <=2^k)(o:k<=429)(p:0<=k):AC (a+b)/\ |D (a+b)-(D a+D b)| <=J* |D a+D b| +AH/\ |D (a+b)| <=2^(k+2):=by have d: |D a| + |D b| <=2^(k+1):=Fv h i;obtain⟨f,e⟩:=DR g Y (d.trans (Fy Ա));refine⟨f,e,?_⟩;have AW:Մ<=2^(k+1):=one_le_zpow₀ Բ Ա;have j:Ծ^(k+2)=2*2^(k+1):=(by rw[show k+2=(k+1)+1 by ring,ם ի];ring);have l: |D a+D b| <=2^(k+1):=(ז _ _).trans d;have:=ձ (D (a+b)) (D a+D b);have n:=ա BK (ը (D a+D b));linarith only[this,e,l,AW,j,Cf,n,ը (D a+D b)] @[inline] def Dj (b i:W):ջ:=((i.toBits>>>52)&&&0x7FF)-1<1222&&(i*b).toBits-0x3FEFFFFFFFFFFFFF<2 lemma HV (b:ծ)(d:bԻ/2^52%2^11≠0)(e:bԻ/2^52%2^11≠2047):Τ (Μ (fmt:=AM) b.toBitVec)=true/\(bԻ<2^63-> |A6 b| =A6 b)/\Ծ^(((bԻ/2^52%2^11:լ):ص)-1023)<= |A6 b| /\ |A6 b| <=2^(((bԻ/2^52%2^11:լ):ص)-1022):=by obtain⟨f,g⟩:=C9 b d e;rw[A6,g];refine⟨f,λj=>թ ?_,?_⟩;rw[ր Ա];positivity;rw[ք,ք,show |(if 2^63<=bԻ thenՆelse 1)| =1 by split<;>simp,ט,թ (Χ _),չ (ئ ز _)];have h:Ծ^52<=((2^52+bԻ%2^52:լ):ض):=(by exact_mod_cast(by omega:2^52<=2^52+bԻ%2^52));have i:((2^52+bԻ%2^52:լ):ض)<=2^53:=(by exact_mod_cast(by omega:2^52+bԻ%2^52<=2^53));generalize((bԻ/2^52%2^11:լ):ص)=E;have a:Հ<=2^(E-1075):=Գ;have AE:Ծ^(E-1023)=2^52*2^(E-1075):=(by rw[show E-1023=52+(E-1075) by ring,կ ի];norm_num);have AK:Ծ^(E-1022)=2^53*2^(E-1075):=(by rw[show E-1022=53+(E-1075) by ring,կ ի];norm_num);rw[AE,AK];exact⟨ա h a,ա i a⟩ lemma HW {b i:W}(Y:AC b)(q:0>>52)&&&0x7FF).toNat=i.toBits.toNat/2^52%2^11:=by rw[ξ6,γ2,η] exact γ _ 11 rw[Η,θ9,t]at g rw[Η,θ9]at h simp only[UInt64.toNat_ofNat]at g h have w:=η3 (i.toBits.toNat/2^52) (show 0<2^11 by norm_num) have x:=(i*b).toBits.toNat_lt have j:=HV i.toBits Ա Ա have k:AC i:=j.1 have l:=Aj have n:=BK obtain⟨-,r,-⟩:=EF (Bz:=200) (B0:=128) k Y (j.2.2.2.trans (Av Ա)) (by rwa[չ q]) Բ Բ have o: |D (i*b)-1| <=J:=by have a:(i*b).toBits.toNat=0x3FF0000000000000\/(i*b).toBits.toNat=0x3FEFFFFFFFFFFFFF:=Ա rcases a with a | a<;> ·have:=(C9 (i*b).toBits (by rw[a];norm_num) (by rw[a];norm_num)).2 rw[<-E7,a]at this rw[D,this];unfold J;norm_num have p:AH<=J*(1/8):=EA (by rw[showՄ/8=2^(-3:ص) by norm_num];exact Av Բ) have AW: |D i*D b| <=5/4:=by have AZ:=ձ (D i*D b) (D (i*b)) rw[ש]at AZ have Ac: |D (i*b)| <=1+J:=by have:=ձ (D (i*b)) 1 rw[abs_one]at this linarith only[this,o] have At:=ա n (ը (D i*D b)) linarith only[AZ,Ac,At,r,p,n] have u: |D i*D b-1| <=5/2*J:=by have Ax:=ث (D i*D b) (D (i*b)) 1 rw[ש (D i*D b) (D (i*b))]at Ax have A0:=գ AW l.le linarith only[Ax,r,o,A0,p,l] refine⟨k,?_⟩ have e:0<1/D b:=Գ rw[չ e,show D i-1/D b=(D i*D b-1)*(1/D b) by field_simp,ք,չ e] exact ա u e.le lemma J6 {a:զ}(b:դ a≠0)(g:դ a≠255)(l:ռ a=false){i:W}(n:Dj (d a) i=true):AC i/\ |D i-1/AG a| <=5/2*J* |1/AG a| /\Ծ^Կ<=AG a/\AG a<=2^(128:ص):=by have e:=Bo a g;have h:=Fw a b l;obtain⟨k,j⟩:=HF a 128 b g (by have:=Et a g;omega);rw[չ h]at j;rw[չ h]at k;have:=HW e.1 (by rw[e.2.1 b];exact h) (by rw[e.2.1 b];exact j) n;rw[e.2.1 b]at this;exact⟨this.1,this.2,k,j⟩ @[specialize] def EG (n:լ)(F:(a:ժ)->aԻզ):(c:լ)->(a:ժ)->aԻ+c<=n->n<2^31->ե զ->ե զ | 0,_,_,_,AA=>AA | c+1,a,d,b,AA=>EG n F c (a+1) (by rw[Al a Ա];omega) b (AA.push (F a Ա)) lemma HX {AS:լ->զ}{n b:լ}(F:(a:ժ)->aԻզ) (i:∀a g,F a g=AS (b+aԻ))(c:լ):∀(a:ժ) e d AA N,b+aԻ+c=N->Ad AS (b+aԻ) (·Ad AS N (·rintro a e d AA N rfl H;exact H|succ c j=>rintro a e d AA N rfl ⟨k,l⟩;have g:=Al a Ա;rw[EG];refine j (a+1) _ d _ _ Ա ⟨by rw[Array.size_push];omega,λq o=> ?_⟩;rcases Α9 q (b+aԻ)with h | h;rw[Js AA _ q Ա,l q h];rw[show q=AAԼ by omega,Jt,i,k] lemma F5 (x:ե զ)(b:xԼ<2^31)(d:x.all B9=true):B1 (Bl x b).Bu x:=by obtain⟨e,g,-⟩:=CJ x b;refine⟨e,λk a=>⟨g k a,?_⟩⟩;rw[ո x k a];exact Array.all_eq_true.mp d k a lemma HY (x:ե զ)(a:xԼ<2^31)(b:(Bl x a).AN<Ջ):∀k,k(դ x[k]!)Ի<=(դ (Bl x a).AN)Ի:=λk d=>Fj _ _ ((CJ x a).2.2 k d) (lt_trans b Է) lemma F6 {x:ե զ}{o:բ}{P:լ->Prop}(An:∀k,P k->B9 x[k]! =true) (a:դ o≠255)(d:∀k,P k->(դ x[k]!)Ի<=(դ o)Ի):(∀k,P k-> |AG x[k]!| <=D (AV o))/\Ծ^Կ<=D (AV o)/\D (AV o)<=2^Ձ:=by obtain⟨-,-,e,Y⟩:=Cs o a;refine⟨λk b=> ?_,by rw[Ex a];exact Av Ա,by rw[showԾ^Ձ=2^Ճfrom յ 2 130];exact e⟩;have:=(Y _ (d k b)).2;rwa[(DM _ (An k b)).2.2.2]at this lemma J7 {f:W}(b:AC f)(d:f.toBitsԻ<2^63)(i:1<=f.toBitsԻ/2^52):Ծ^(((f.toBitsԻ/2^52:լ):ص)-1023)<=D f:=by have e:f.toBitsԻ/2^52%2^11≠2047:=(by have a:(κ5 (M f) !=2047)=true:=b;rw[E7,E6]at a;simpa using a);obtain⟨-,g,h,-⟩:=HV f.toBits Ա e;rwa[show f.toBitsԻ/2^52%2^11=f.toBitsԻ/2^52 by omega,g d]at h def BV (AI:ջ)(n:լ)(x:ե զ)(r:լ):ℚ:=if AI then rowMean n x r else 0 def BH (AI:ջ) (n:լ) (x:ե զ) (r:լ):ض:=(BV AI n x r:ض) def C3 (x:ե զ) (n r:լ) (a:ض):ض:=∑j∈ο n,(AG x[r*n+j]!-a)^2 def C4 (AI:ջ) (x:ե զ) (a:զ) (n r:լ):ض:=C3 x n r (BH AI n x r)/n+AG a structure E0 (AI:ջ) (n:լ) (x:ե զ) (M:ض) (r:լ) (m:W):Prop where BZ:AC m AE: |D m-BH AI n x r| <=14*n*J*M AK: |D m| <=2*M Ao: |BH AI n x r| <=M CL:∀a,(a=D m\/a=0)-> C3 x n r a=C3 x n r (BH AI n x r)+n*(BH AI n x r-a)^2 lemma J8 (n:լ)(AF:1<=n)(d e:լ->ض)(g E q h:ض)(l:Ծ^Կ<=E) (o:∀j,j |e j-(d j-g)| <=J* |d j-g| +AH) (CL:∑j∈ο n,(d j-g)^2=∑j∈ο n,(d j-h)^2+n*(h-g)^2) (p:q<=1001/1000*((∑j∈ο n,e j*e j)/n+E)) (r:(h-g)^2<=J*q): |(∑j∈ο n,e j*e j)/n+E-((∑j∈ο n,(d j-h)^2)/n+E)| <=5*J*((∑j∈ο n,(d j-h)^2)/n+E):=by have i:Հפ _);(have w: |EQ-Ce| <=3*J*Ce+3*n*AH:=by calc |EQ-Ce| = |∑j∈ο n,(e j*e j-(d j-g)^2)| :=by rw[χ3] _<=∑j∈ο n,|e j*e j-(d j-g)^2| :=τ3 _ _ _<=∑j∈ο n,(3*J*(d j-g)^2+3*AH):=Finset.sum_le_sum (λj u=>by simpa only[sq]using Jx (o j (Finset.mem_range.mp u))) _=3*J*Ce+3*n*AH:=by rw[κ9,<-Ε9,ξ8,κ8,nsmul_eq_mul];ring);refine Jz (a:=k/n) (b:=EQ/n) (c:=Ce/n) (ε:=(h-g)^2) l (ت t i.le) (פ _) (by rw[CL];field_simp) ?_ p r;rw[<-sub_div,abs_div,չ i,ו i];have:3*J*(Ce/n)*n=3*J*Ce:=(by field_simp);linarith def E1 (X:է)(n:լ)(d e g m:W)(h:ծ)(a:ժ) (i:aԻ+n<=XԼ)(j:XԼ<2^31):զ:=let s:=C2 X (λb=>(b-m)*(b-m)) n a i j (ι 0);let q:=s*d+g;if q.toBits<Ֆ&&h<=q.toBits>>>52 then let sq:=Ζ9 q;A2 sq (sq*e)else A1 lemma J9 {AI:ջ}{n:լ}{x as b:ե զ}{X G B:է}{e:զ} {g F K au:W}{q:ծ}{M av aw:ض}{r:լ}(i:F4 n x as b X G B e g F K au q M av aw r) (ax:r*n+n<=xԼ){k:ժ}(ay:kԻ=r*n) (t:kԻ+n<=XԼ)(u:XԼ<2^31){m:W}(H:E0 AI n x M r m) (l:E1 X n g (CK n) (d e) m q k t u≠A1): E1 X n g (CK n) (d e) m q k t u= ה (נ n x r (BV AI n x r)+հ e):=by obtain⟨v,I⟩:=i.AF obtain⟨az,aA⟩:=i.B_ obtain⟨aB,Z,w,aa⟩:=i.J3 obtain⟨L,ab,N,ac⟩:=i.AP have h:Հפ _)) h.le have O:Ծ^Կ<=C4 AI x e n r:=w.trans (by unfold C4;linarith only[aC]) have aD:C4 AI x e n r<Ծ^(254:ص):=by have CL:=H.CL 0 (ؠ rfl) unfold C3 at CL simp only[sub_zero]at CL have aE:∀j,j(AG x[r*n+j]!)^2<=2^(126+126:ص):=λj y=>by have ad:=DM x[r*n+j]! ((L.2 _ Ա).2) have:=HD x[r*n+j]! 126 ad.1 (by have:=ad.2.1;omega) rw[sq];exact(ذ _).trans (Fx this this) have Y:=F2 aE have aF:0<=(n:ض)*(BH AI n x r)^2:=ճ h.le (פ _) have aG:C3 x n r (BH AI n x r)/n<=2^(126+126:ص):=by rw[ו h] unfold C3 generalizeԾ^(126+126:ص)=aY at Y⊢ linarith only[CL,Y,aF] exact(Fv aG (aa.trans (Av Բ))).trans_lt (zpow_lt_zpow_right₀ Բ Բ) unfold E1 at l⊢ simp only[]at l⊢ split_ifs at l⊢with z rotate_left · exact absurd rfl l simp only[Ξ,decide_eq_true_eq]at z have ae:C2 X (λo=>(o-m)*(o-m)) n k t u (ι 0)= Bv (λj=>(X.data[j]!-m)*(X.data[j]!-m)) (ι 0) (r*n) n:=by rw[HP,ay] generalize C2 X (λo=>(o-m)*(o-m)) n k t u (ι 0)=s at ae l z⊢ have af:=Η.mp z.1 have aH:qԻ<=(s*g+d e).toBits.toNat/2^52:=by have:=γ6.mp z.2;rw[γ2,η]at this;exact this have p:=Aj have ag:=CD have P:Մ<=n:=by exact_mod_cast v have ah:(n:ض)<=2^22:=by exact_mod_cast I have A:∀j,jr*n+jby omega have aZ:=BA N obtain⟨aI,aJ,ai,aj⟩:=J5 I L ab N ac H.BZ H.AK ax ae set S:=DN X m (r*n) n set G:=S+n*Ak with aK have ak:=BA w set E:=AG e obtain⟨aL,al⟩:=HR P aI az aA ai have aM: |D (s*g)| <=2^26*AQ+1:=by have:=ձ (D (s*g)) (D s/n) have AZ: |D s/n| <= |D s| :=by rw[abs_div,չ h];exact div_le_self (ը _) P have Ac:4*J* |D s/n| <=1* |D s/n| := ա (by linarith only[BK]) (ը _) linarith only[this,al,AZ,Ac,Cf,ai,ag] obtain⟨am,an⟩:=DR aL aB (by rw[Z,չ ak] have:E<=AQ:=aa.trans (Di Բ) linarith only[aM,this,ag]) rw[Z]at an obtain⟨aN,ao⟩:=Jl am (by rw[E7,GB,decide_eq_false_iff_not,not_le];exact af) have aO: |D (Ζ9 (s*g+d e))-Δ (D (s*g+d e))| <= 1*(J* |Δ (D (s*g+d e))|)+AH:=by rw[ao,ט];exact Dn _ have Q:=ղ (Jq P ah aj w aK aJ al an) have aP:0<=S/n+E:=by have:=ت aj h.le;linarith only[this,ak] have R:5*(n+22)*J<=1/1000:=by linarith only[EC ah,BK] have U:=ճ h.le p.le have aQ:((n:ض)+16)*J<=1/1000:=by linarith only[R,U,p] have aR:D (s*g+d e)<=1001/1000*(S/n+E):=by linarith only[Q.2,ա aQ aP] have aS:(BH AI n x r-D m)^2<=J*D (s*g+d e):=by have aT: |BH AI n x r-D m| <=D F:=by rw[ש] have BW:0<=J*M:=Գ linarith only[H.AE,i.HT,ճ h.le BW,BW] calc _= |BH AI n x r-D m| ^2:=(sq_abs _).symm _<=D F^2:=pow_le_pow_left₀ (ը _) aT 2 _<=_:=i.J4 _ am af aH have aU: |(S/n+E)-C4 AI x e n r| <=5*J*C4 AI x e n r:= J8 n v (λj=>AG x[r*n+j]!) (λj=>D (X.data[r*n+j]!-m)) (D m) E (D (s*g+d e)) (BH AI n x r) w (λj y=>(F3 L H.BZ N ac H.AK (A j y) (ab j y)).2.1) (H.CL _ (א rfl)) aR aS have ap:=BA O have aq:=HJ O have ar:=BA aq have V:=ղ aU have A:((n:ض)+22)*J<=1:=by linarith only[R,U,p] have aV:=գ (by linarith only[V.2]:S/n+E<= C4 AI x e n r+5*J*C4 AI x e n r) (by positivity:0<=((n:ض)+16)*J) have aW:=ա (by linarith only[R,U,p]:5*((n:ض)+16)*J<=1) (ճ p.le ap.le) have aX:=Jp (a:=D (s*g+d e)) ap.le A Գ (by rw[מ];constructor<;>linarith only[Q.1,Q.2,V.1,V.2,aV,aW]) refine J2 v I aN ?_ O aD ?_ l (by unfold rowVariance C4 C3 BH;rw[HL _ 0 n,ֆ];push_cast;simp only[EB]) · rw[ao] have:=Ρ AM (Β8 (D (s*g+d e))) rwa[Ι]at this · have:=Eu (c:=1) ar.le Բ A (չ ar).le (by linarith only[aX]) aO (Cz aq) linarith only[this] def EH (n:լ)(x:ե զ)(r:լ):ℚ:= let a:=Ci (λb=>x[r*n+b]!) (λ_=>ן) n 0 (δ 18 0) (δ 18 0) mkRat ((limbValA a.1:ص)-limbValA a.2) (n*2^298) lemma J_ (a b:լ->բ)(i n:լ):BE a b i n=∑j∈ο n,AG (a (i+j))*AG (b (i+j)):=by induction n generalizing i with|zero=>simp[BE]|succ n d=>rw[BE,d,χ4];simp only[show∀j,i+1+j=i+(j+1)from λj=>by omega,Ν];ring lemma KA (n:լ)(x:ե զ)(r:լ)(u:r*n+n<=xԼ) (o:∀k,kդ x[k]!≠255):EH n x r=rowMean n x r:=by set e:լ->բ:=λa=>x[r*n+a]!with p;have h:∀a,a(υ (n:=n) λi=>e i.val)[a]! =e a:=λa g=>CE n e a g;have j:∀a,a(υ (n:=n) λi=>(λ_=>ן) i.val)[a]! =ן:=λa g=>CE n (λ_=>ן) a g;obtain⟨l,-⟩:=FE _ _ e (λ_=>ן) n 0 (δ 18 0) (δ 18 0) Ե Ե (λk _ b=>h k Ա) (λk _ b=>j k Ա) (λk _ b=>⟨o _ Ա,by decide⟩);have q:ح (Ε4 18 0)=0:=Է;simp only[χ2,q,Α2,sub_self,zero_add]at l;have d:=GP _ _ e (λ_=>ן) 0 n (λk _ b=>h k Ա) (λk _ b=>j k Ա);rw[J_]at d;simp only[zero_add,Go.2,mul_one]at d;unfold EH;simp only[limbValA_eq];apply Rat.cast_injective (α:=ض);rw[Fz,Rat.mkRat_eq_div];push_cast;simp only[EB];rw[<-l]at d;push_cast at d;simp only[p]at d;rcases Nat.eq_zero_or_pos n with b | b;subst b;simp;have t:(n:ض)≠0:=(by exact_mod_cast b.ne');rw[div_eq_div_iff Գ t,<-d,ا];field_simp lemma Da {a:զ}(b:խ a=0):հ a=0:=by unfold rationalWord;rw[ץ];simp[sv,b] @[noinline] def EI (AI:ջ)(n:լ)(a:զ)(x:ե զ)(r:լ):զ:=ה (נ n x r (if AI then EH n x r else 0)+հ a) def C5 (B:լ)(a:զ):լ:=if մ a-B<40 then((խ a).toUInt64<<<(մ a-B).toUInt64)Ի else խ a*2^(մ a-B) lemma F7 (B:լ)(a:զ):C5 B a=խ a*2^(մ a-B):=by unfold C5;split_ifs with e;have b:=mantOf_lt_24 a;have AE:(խ a).toUInt64.toNat=խ a:=(by rw[δ1,δ0];exact θ Ա);have AK:(մ a-B).toUInt64.toNat=մ a-B:=(by rw[δ1,δ0];exact θ Ա);(have d:խ a*2^(մ a-B)<2^64:=calc խ a*2^(մ a-B)<2^24*2^40:=ρ8 b (θ6 Բ Ա) Գ _=2^64:=by norm_num);rw[γ7,AE,AK,θ (by omega:idxOf a-B<64),Ζ,θ d];rfl def A4 (B:լ)(a:զ):ص:=if ռ a then-(C5 B a:ص)else(C5 B a:ص) lemma EJ {B:լ}{a:զ}(g:B<=149)(d:խ a≠0->B<=մ a):հ a=(A4 B a:ℚ)/2^(149-B):=by by_cases b:խ a=0;rw[Da b];unfold A4;simp[F7,b];have h:=d b;have e:((մ a:ص)-149)=((մ a-B:լ):ص)-((149-B:լ):ص):=Ա;unfold rationalWord A4;rw[ץ,F7,e,د ի,յ,յ];unfold sv;cases ռ a<;>simp<;>ring @[inline] def A5 (b:զ)(a:լ):լ:=if խ b=0 then a else min a (մ b) lemma EK (b:զ)(a:լ):A5 b a<=a/\(խ b≠0->A5 b a<=մ b):=by unfold A5 split_ifs with d ·exact⟨ն,λe=>absurd d e⟩ ·exact⟨min_le_left _ _,λ_=>min_le_right _ _⟩ def Dk (x:ե զ):լ->լ->լ->լ | 0,_,a=>a | c+1,i,a=>Dk x c (i+1) (A5 x[i]! a) lemma KB (x:ե զ)(c:լ):∀i a,Dk x c i a<=a/\∀k,i<=k->k< i+c->խ x[k]!≠0->Dk x c i a<=մ x[k]!:=by induction c with|zero=>intro i a;exact⟨ն,λk b d _=>absurd d Ա⟩|succ c g=>intro i a;simp only[Dk];obtain⟨b,d⟩:=g (i+1) (A5 x[i]! a);obtain⟨h,j⟩:=EK x[i]! a;refine⟨b.trans h,λk n o e=> ?_⟩;by_cases l:k=i;subst l;exact b.trans (j e);exact d k Ա Ա e def C6 (B:լ)(x:ե զ):լ->լ->լ->լ->լ×լ | 0,_,a,q=>(a,q) | c+1,i,a,q=>if ռ x[i]!then C6 B x c (i+1) a (q+C5 B x[i]!)else C6 B x c (i+1) (a+C5 B x[i]!) q lemma KC (B:լ)(x:ե զ)(c:լ):∀i a q,((C6 B x c i a q).1:ص)-(C6 B x c i a q).2=(a:ص)-q+∑j∈ο c,A4 B x[i+j]!:=by induction c with|zero=>intro i a q;simp[C6]|succ c b=>intro i a q;have e:∑j∈ο (c+1),A4 B x[i+j]! =∑j∈ο c,A4 B x[i+1+j]!+A4 B x[i]!:=(by rw[χ4,Ν];congr 1;exact υ6 rfl λj _=>by rw[show i+(j+1)=i+1+j by omega]);rw[e];simp only[C6];split_ifs with d;rw[b,show A4 B x[i]! = -(C5 B x[i]!:ص) by simp[A4,d]];push_cast;ring;rw[b,show A4 B x[i]! =(C5 B x[i]!:ص) by simp[A4,d]];push_cast;ring def EL (B:լ)(AI:ջ)(n:լ)(x:ե զ)(r:լ):ص:=if AI then((C6 B x n (r*n) 0 0).1:ص)-(C6 B x n (r*n) 0 0).2 else 0 lemma KD {B:լ}(AI:ջ)(n:լ)(x:ե զ)(r:լ)(a:B<=149) (b:∀j,jխ x[r*n+j]!≠0->B<=մ x[r*n+j]!):BV AI n x r=(EL B AI n x r:ℚ)/2^(149-B)/n:=by cases AI;simp[BV,EL];have d:∑j∈ο n,հ x[r*n+j]! =(∑j∈ο n,(A4 B x[r*n+j]!:ℚ))/2^(149-B):=(by rw[Finset.sum_div];exact υ6 rfl λj e=>EJ a (b j (Finset.mem_range.mp e)));have g:EL B true n x r=∑j∈ο n,A4 B x[r*n+j]!:=(by simp only[EL,ite_true];rw[KC];simp);simp only[BV,ite_true];rw[g,Fz,d];push_cast;rfl @[noinline] def Dl (AI:ջ)(x e b:ե զ)(d:զ)(n r a:լ):զ:=if !AI&&խ x[r*n+a]! =0&&խ b[a]! =0 then 0 else if ռ d=false/\խ d≠0/\0դ x[k]!≠255):(if AI then EH n x r else 0)=BV AI n x r:=by cases AI<;>simp[BV,KA n x r a b] lemma Ha {AI:ջ}{n:լ}{a:զ}{x:ե զ}{r:լ} (b:r*n+n<=xԼ)(d:∀k,kդ x[k]!≠255):EI AI n a x r=ה (נ n x r (BV AI n x r)+հ a):=by unfold EI;rw[HZ b d] lemma Hb {AI:ջ}{x g b:ե զ}{d:զ}{n r a:լ} (u:r*n+n<=x.size)(v:∀k,kդ x[k]!≠255):Dl AI x g b d n r a=ח ((հ x[r*n+a]!-BV AI n x r)*հ g[a]!/հ d+հ b[a]!):=by unfold Dl;rw[HZ u v];split_ifs with o w;simp only[Ξ,ξ0,decide_eq_true_eq]at o;obtain⟨⟨y,AP⟩,Y⟩:=o;subst y;simp[BV,Da AP,Da Y,Jm];congr 1;obtain⟨z,A,D⟩:=w;dsimp only;obtain⟨h,p⟩:=KB x n (r*n) (A5 x[r*n+a]! (A5 g[a]! (A5 b[a]! (A5 d 149))));obtain⟨AZ,Ac⟩:=EK x[r*n+a]! (A5 g[a]! (A5 b[a]! (A5 d 149)));obtain⟨l,E⟩:=EK g[a]! (A5 b[a]! (A5 d 149));obtain⟨q,F⟩:=EK b[a]! (A5 d 149);obtain⟨G,H⟩:=EK d 149;generalize Dk x n (r*n) (A5 x[r*n+a]! (A5 g[a]! (A5 b[a]! (A5 d 149))))=B at h p⊢;have i:B<=149:=h.trans (AZ.trans (l.trans (q.trans G)));have t:0p (r*n+j) Ա Ա e),EJ i (λe=>h.trans (Ac e)),EJ i (λe=>h.trans (AZ.trans (E e))),EJ i (λe=>h.trans (AZ.trans (l.trans (F e)))),EJ i (λe=>h.trans (AZ.trans (l.trans (q.trans (H e)))))];push_cast;rw[AE];field_simp;rfl def C7 (AI:ջ)(n:լ)(a:զ)(x d b:ե զ)(q:լ):զ:=ח ((հ x[q]!-BV AI n x (q/n))*հ d[q%n]!/հ (ה (נ n x (q/n) (BV AI n x (q/n))+հ a))+հ b[q%n]!) lemma KE {n:լ}{x:ե զ}{X:է}{d:W}{M:ض}{r:լ}(AF:1<=n) (h:n<=2^22)(B_:AC d/\ |D d-1/(n:ض)| <=5/2*J* |1/(n:ض)|) (v:B1 X x)(w:∀j,j |AG x[r*n+j]!| <=M)(i:Ծ^Կ<=M) (y:M<=2^Ձ)(P:r*n+n<=xԼ){s:W} (z:s=Bv (λj=>X.data[j]!) (ι 0) (r*n) n):E0 true n x M r (s*d):=by have A:=Aj;have l:Մ<=n:=(by exact_mod_cast AF);have o:(n:ض)<=2^22:=(by exact_mod_cast h);have B:=BA i;have E:∀j,jr*n+j(by omega);have p:=HS o (y.trans (Av Բ)) B.le;have F:=(Bn Գ p).1;have e:∑j∈ο n,|AG x[r*n+j]!| <=n*M:=F2 λj b=>w j b;obtain⟨q,t,u⟩:=HQ p (λk=>X.data[k]!) (λk=>AG x[k]!) (λk=> |AG x[k]!|) (r*n) n h (λj b=>by obtain⟨G,H⟩:=Ez v (E j b);have:=B2 G F;rwa[H]at this) e;rw[<-z]at q t u;obtain⟨I,K⟩:=HR l q B_.1 B_.2 u;obtain⟨L,N,O⟩:=Jv l o i ((τ3 _ _).trans e) (t.trans (by linarith[գ e A.le])) K;have g:BH true n x r=(∑j∈ο n,AG x[r*n+j]!)/n:=(by unfold BH BV;simp only[ite_true,Fz];push_cast;simp only[EB]);exact⟨I,g▸L,N,g▸O,λa _=>g▸Jy n AF (λj=>AG x[r*n+j]!) a⟩ lemma KG {n:լ}{x:ե զ}{M:ض}{r:լ}(e:0<=M):E0 false n x M r (ι 0):=by have d:BH false n x r=0:=(by unfold BH BV;simp);have b:=HG;have h:=Aj;refine⟨b.1,?_,?_,?_,λa g=> ?_⟩;rw[b.2,d];simp;positivity;rw[b.2];simp;positivity;rw[d];simpa using e;rcases g with rfl | rfl<;>simp[b.2,d] def Dm (X:ե բ):(c:լ)->(i:ժ)->iԻ+c<=XԼ->iԻ+c<2^31->բ->բ | 0,_,_,_,AN=>AN | c+1,i,a,b,AN=>have d:=Al i Ա;Dm X c (i+1) Ա Ա (Cy AN (X.uget i Ա)) lemma KH (X:ե բ)(c:լ)(i:ժ)(e:i.toNat+c<=X.size)(g:i.toNat+c<2^31) (AN:բ){B:լ}(h:AN.toNatd< i.toNat+c->(X[d]!&&&Չ).toNatd< i.toNat+c->(X[d]!&&&Չ).toNat<=(Dm X c i e g AN).toNat:=by induction c generalizing i AN with|zero=>exact⟨h,ն,λd a b=>absurd b Ա⟩|succ c o=>have k:=Al i Ա;rw[Dm];have l:X.uget i Ա=X[i.toNat]!:=BR _ _ _;have Y:(Cy AN (X.uget i Ա)).toNatj d Ա Ա);obtain⟨Aw,r⟩:=G0 AN (X.uget i Ա);refine⟨p,Aw.trans n,λd a b=> ?_⟩;by_cases t:d=i.toNat;subst t;rw[<-l];exact r.trans n;exact q d (by rw[k];omega) (by rw[k];omega) def CM (x:ե զ)(n r:լ):բ:=if a:r*n+n<=xԼ/\xԼ<2^31 then Dm x n (r*n)Խ (by rw[Aq _ Ա];omega) (by rw[Aq _ Ա];omega) 0 else 0 lemma Hc {x:ե զ}{n r:լ}(a:r*n+n<=x.size)(d:x.size<2^31) (e:∀k,k(x[k]!&&&Չ).toNat<Ջ):CM x n r<Ջ/\∀j,j(դ x[r*n+j]!).toNat<=(դ (CM x n r)).toNat:=by unfold CM;rw[ג ⟨a,d⟩];have l:=Aq (r*n) Ա;obtain⟨g,-,h⟩:=KH x n (r*n).toUSize _ _ 0 (B:=Ջ) Է (λi _ b=>e i Ա);exact⟨g,λj o=>Fj _ _ (h _ Ա Ա) Ա⟩ lemma Hd {a:զ}(d:a&&&Չ=0):խ a=0:=by have h:aԻ%2^31=0:=(by have b:=ר UInt32.toNat d;rw[Ε]at b;rw[<-γ];exact b);have e:դ a=0:=ξ.mp (by rw[BJ];show aԻ/2^23%2^8=0;omega);have g:ս a=0:=ξ.mp (by rw[CN];show aԻ%2^23=0;omega);simp[mantOf,e,g] def He (X G B:է)(x i b:ե զ)(n:լ)(K j:W)(l:XԼ<2^31) (o:n<=GԼ)(p:n<=BԼ)(AP:XԼ<=xԼ)(Y:n<=bԼ)(r:լ)(g:ժ) (q:gԻ=r*n)(t:r*n+n<=XԼ)(AI:ջ)(m:W)(e:զ)(AA:ե զ): ե զ:= let h:=Df 150/d e if դ e !=0&&դ e !=255&& !signOf e&&Dj (d e) h then let k:=h*K+j EG n (λa u=> if !AI&&x.uget (g+a) (by rw[AT g a Ա];omega)&&&Չ==0&& b.uget a Ա&&&Չ==0 then 0 else Ev (A2 ((X.uget (g+a) (by rw[AT g a Ա];omega)-m)* G.uget a Ա*h+B.uget a Ա) k) (Dl AI x i b e n r aԻ)) n 0 Ե Ա AA else EG n (λa _=>Dl AI x i b e n r aԻ) n 0 Ե Ա AA def Hf (AI:ջ)(X G B:է)(x h b:ե զ)(e:զ)(n:լ)(g i:W) (j:բ)(a:XԼ<2^31)(k:n<=GԼ)(l:n<=BԼ)(AP:XԼ<=xԼ)(Y:n<=bԼ) (r:լ)(p:r*n+n<=XԼ)(AA:ե զ):ե զ:= have q:((r*n)Խ)Ի=r*n:=Aq _ Ա let o:=CM x n r let m:=if AI then C2 X (λt=>t) n (r*n)Խ Ա a (ι 0)*g else ι 0 He X G B x h b n (ED n o j) i a k l AP Y r (r*n)Խ q p AI m (Ev (E1 X n g (CK n) (d e) m (EE n o) (r*n)Խ Ա a) (EI AI n e x r)) AA def E2 (AI:ջ)(X G B:է)(x a b:ե զ)(d:զ)(n:լ)(e g:W) (h:բ)(i:XԼ<2^31)(j:n<=GԼ)(k:n<=BԼ)(AP:XԼ<=xԼ) (Y:n<=bԼ):(c:լ)->(r:լ)->(r+c)*n<=XԼ->ե զ->ե զ | 0,_,_,AA=>AA | c+1,r,l,AA=>E2 AI X G B x a b d n e g h i j k AP Y c (r+1) (by rw[show r+1+c=r+(c+1) by omega];exact l) (Hf AI X G B x a b d n e g h i j k AP Y r (by have o:(r+(c+1))*n=r*n+c*n+n:=Զ;rw[o]at l;omega) AA) lemma KI {AI:ջ}{n:լ}{x e b:ե զ}{X G B:է}{i:զ} {y z:W}{A:բ}{as au:ض}(t:B1 X x) (av:∀r,r*n+n<=xԼ->F4 n x e b X G B i y (C1 n (CM x n r)) (ED n (CM x n r) A) z (EE n (CM x n r)) (D (AV (CM x n r))) as au r) (bp:eԼ=n)(bq:bԼ=n)(E:XԼ<2^31)(F:n<=GԼ) (I:n<=BԼ)(aw:XԼ<=xԼ)(ax:n<=bԼ)(c:լ):∀(r:լ) u AA N,(r+c)*n=N-> Ad (C7 AI n i x e b) (r*n) (· Ad (C7 AI n i x e b) N (·դ x[k]!≠255:=λk ay=>(DM _ (t.2 k ay).2).1 induction c with | zero=>rintro r u AA N rfl H;exact H | succ c az=> rintro r u AA N rfl H have aA:r*n+n<=XԼ:=by rw[show(r+(c+1))*n=r*n+n+c*n by ring]at u;omega have j:r*n+n<=xԼ:=by rw[<-t.1];exact aA have h:=av r j obtain⟨Z,aB⟩:=h.AF obtain⟨-,K,o,L⟩:=h.AP have M:((r*n)Խ)Ի=r*n:=Aq _ Ա have l:E0 AI n x (D (AV (CM x n r))) r (if AI then C2 X (λaC=>aC) n (r*n)Խ Ա E (ι 0)*y else ι 0):=by cases AI · exact KG (BA o).le · exact KE Z aB h.B_ t K o L j (by rw[HP,M]) have O:∀a,aDl AI x e b (EI AI n i x r) n r a=C7 AI n i x e b (r*n+a):= λa g=>by rw[C7,(DY (r:=r) rfl g).1,(DY (r:=r) rfl g).2,Hb j v,Ha j v] have aa:r*n+USize.toNat 0+n=(r+1)*n:=by rw[add_one_mul];rfl rw[E2] refine az (r+1) _ _ _ Զ ?_ unfold Hf He dsimp only rw[HN λaD=>(J9 h j M Ա E l aD).trans (Ha j v).symm] split · rename_i ab simp only[Ξ,bne_iff_ne,ne_eq,ξ0]at ab obtain⟨⟨⟨aE,aF⟩,aG⟩,aH⟩:=ab obtain⟨w,p,Q,-⟩:=J6 aE aF aG aH refine HX _ ?_ n 0 _ _ AA _ aa H intro a g have R:((r*n)Խ+a)Ի=r*n+aԻ:=by rw[AT (r*n)Խ a Ա,M] split · rename_i ac simp only[Ξ,beq_iff_eq,ξ0]at ac obtain⟨⟨S,aI⟩,aJ⟩:=ac have AN:խ x[r*n+aԻ]! =0:=by apply Hd rw[<-R,<-BR x ((r*n)Խ+a) (by rw[R];omega)] exact aI have aK:խ b[aԻ]! =0:=by apply Hd rw[<-BR b a Ա] exact aJ rw[<-O _ g] unfold Dl rw[վ (by simp[S,AN,aK])] rename_i aL clear aL simp only[CV,R] rw[<-O _ g,Hb j v] generalize aԻ=a at g⊢ generalize EI AI n i x r=q at w p Q⊢ generalize Df 150/d q=U at w p⊢ obtain⟨F,ad,ae,aM⟩:=h.An obtain⟨I,af,ag,aN⟩:=h.Y obtain⟨aO,DF,aP⟩:=h.DF obtain⟨aQ,Ey,aR⟩:=h.Ey apply HN intro aS have aT:r*n+aO _ g) n 0 _ _ AA _ aa H def Hg (AI:ջ)(AB n:լ)(a:զ)(x d b:ե զ):ե զ:=if AI then layernormWith AX AB n a x d b else rmsnormWith AX AB n a x d def E3 (AI:ջ)(AB n:լ)(d:զ)(x a b:ե զ):ե զ:=if e:0α)(k:լ)(a:kf i.val)[k]! =f k:=by rw[ո _ k (by simpa using a),κ2] lemma KJ (AB n:լ)(AF:0rowMean n x r) (q/n) d,F9 AB (λr=>sqrtRational (rowVariance n x r (υ (n:=AB) λi=>rowMean n x i.val)[r]!+rationalWord a)) (q/n) d,F9 AB (λr=>rowMean n x r) (q/n) d];simp[C7,BV] lemma KK (AB n:լ)(AF:0sqrtRational (rowVariance n x r 0+rationalWord a)) (q/n) e];simp[C7,BV,Y,Da (show mantOf (0:Word)=0 by decide)] lemma KL {n:լ}{x i b:ե զ}{X G B:է}{e:զ}{a g h:բ}{r:լ} (AF:1<=n)(u:n<=2^22)(R:B9 e=true)(A:դ e≠0) (S:ռ e=false)(E:B1 X x)(F:B1 G i)(H:B1 B b)(ay:r*n+n<=xԼ) (v:դ a≠255)(w:դ g≠255)(y:դ h≠255) (U:∀j,j(դ x[r*n+j]!)Ի<=(դ a)Ի) (V:∀k,k< iԼ->(դ i[k]!)Ի<=(դ g)Ի) (W:∀k,k(դ b[k]!)Ի<=(դ h)Ի)(Y:Dj (Dg n) (Df 150/Dg n)=true):F4 n x i b X G B e (Df 150/Dg n) (C1 n a) (ED n a g) (F1 h) (EE n a) (D (AV a)) (D (AV g)) (D (AV h)) r:=by have d:n.toUInt32Ի=n:=(by rw[ο6,δ9];exact θ Ա);obtain⟨Z,o⟩:=FD n.toUInt32 Ա;rw[d]at o;have aa:Մ<=n:=(by exact_mod_cast AF);have B_:=HW Z (by rw[o];linarith only[aa]) (by rw[o];exact(by exact_mod_cast u:(n:ض)<=2^22).trans Բ) Y;rw[o]at B_;obtain⟨ab,I,ac⟩:=F6 (P:=λk=>∃j,j(E.2 k Ա).2) v (λk ⟨j,p,d⟩=>d▸U j p);obtain⟨ad,K,ae⟩:=F6 (P:=(·< iԼ)) (λk l=>(F.2 k l).2) w V;obtain⟨af,L,ag⟩:=F6 (P:=(·(H.2 k l).2) y W;obtain⟨ah,az⟩:=HO u;have aA:=Et _ v;have aB:=Et _ w;have aC:=Et _ y;have z:=Aj;obtain⟨-,t⟩:=Ew (k:=BG n+(դ a)Ի+848) Ա Ա;obtain⟨ai,M⟩:=Ew (k:=(դ g)Ի+(դ a)Ի+BG n+722) Ա Ա;obtain⟨aj,N⟩:=Ew (k:=(դ h)Ի+848) Ա Ա;have ak:((n:ض)+3)<=2^BG n:=(by exact_mod_cast ah.le);have al:D (C1 n a)=2^BG n*D (AV a)*(16*J):=(by show D (Bd _)=_;rw[t,Ex v,<-F0,<-յ,<-կ ի,<-կ ի];exact ר (λd:ص=>Ծ^d) Ա);have am:D (ED n a g)=D (AV g)*D (C1 n a):=(by show D (Bd _)=_;rw[M,Ex w,show D (C1 n a)=_ from t,<-կ ի];exact ר (λd:ص=>Ծ^d) Ա);have an:D (F1 h)=16*J*D (AV h):=(by show D (Bd _)=_;rw[N,Ex y,<-F0,<-կ ի];exact ר (λd:ص=>Ծ^d) Ա);have ao:=BA I;have ap:=BA K;have aq:=BA L;have ar:0ab _ ⟨j,p,rfl⟩,I,ac⟩,⟨F,ad,K,ae⟩,⟨H,af,L,ag⟩,?_,⟨ai,?_,?_⟩,⟨aj,?_,?_⟩,λq as au av=> ?_⟩;rw[al];generalizeԾ^BG n=P at*;nlinarith[ա ak (ճ z.le ao.le)];rw[am];nlinarith[ճ z.le (ճ ap.le ar.le)];show |D (Bd _)| <=_;rw[M,չ (ئ ز _)];exact Av Ա;rw[an];nlinarith[ճ z.le aq.le];show |D (Bd _)| <=_;rw[N,չ (ئ ز _)];exact Av Ա;have l:(EE n a)Ի=2*BG n+2*(դ a)Ի+728:=(by unfold EE;rw[δ1,δ0];exact θ Ա);rw[l]at av;have aw:=J7 as au Ա;have ax:D (C1 n a)^2*2^55<=D q:=(by refine י ?_ aw;show D (Bd _)^2*_<=_;rw[t,sq,<-կ ի,showԾ^55=2^(55:ص) by norm_num,<-կ ի];exact Av Ա);rw[Az];linarith[פ (D (C1 n a)),ax] lemma Hj (AI:ջ)(AB n:լ)(d:զ)(x e b:ե զ) (O:AI=false->b=δ n 0):E3 AI AB n d x e b=if AI then layernormSpec AB n d x e b else rmsnormSpec AB n d x e:=by unfold E3;split;swap;cases AI<;>rfl;rename_i g;dsimp only;obtain⟨j,AF,P,u,o,p,h,v⟩:=g;simp only[Ξ,bne_iff_ne,ne_eq,ξ0]at v;obtain⟨⟨w,y⟩,z⟩:=v;have A:e.size<2^31:=Ա;have B:b.size<2^31:=Ա;split;swap;cases AI<;>rfl;rename_i D;simp only[Ξ,decide_eq_true_eq]at D;obtain⟨⟨⟨⟨⟨⟨F,G⟩,H⟩,Q⟩,I⟩,J⟩,R⟩:=D;have l:=F5 x h F;have K:=F5 e A G;have L:=F5 b B H;have M:∀k,k(x[k]!&&&Չ).toNat<Ջ:=λk S=>ב ((CJ x h).2.2 k S) (show(Bl x h).AN.toNat<Ջ from Q);have U:=λr (j:r*n+n<=x.size)=>KL Ա P w y z l K L j (Dd (Hc j h M).1) (Dd I) (Dd J) (Hc j h M).2 (HY e A I) (HY b B J) R;have t:∀(a:ե զ),a.all B9=true->a.all finiteWord=true:=λa V=>Array.all_eq_true.mpr λi W=>(by simpa[finiteWord]using(DM _ (Array.all_eq_true.mp V i W)).1);have X:=t x F;have Z:=t e G;have aa:finiteWord d=true:=(by simpa[finiteWord]using(DM d w).1);have ab:հ d>0:=(by have:Հ<((հ d:ℚ):ض):=(by rw[EB];exact Fw d y z);exact_mod_cast this);have N:stableNormDomain AB n d x e=true:=(by rw[stableNormDomain,X,Z,aa,u,o];simp[j,AF,ab]);have E:=CY (λq g=>g) (KI (AI:=AI) l U o p (by rw[l.1];exact h) (by rw[K.1,o]) (by rw[L.1,p]) (ך l.1) Ա AB 0 (by rw[l.1,u,γ9]) (γ3 x.size) (AB*n) Ե ⟨by simp,λq ac=>by simp at ac⟩);cases AI;have Y:=O rfl;subst Y;rw[rmsnormSpec,rmsnormWith,վ N];exact E.trans (CY (λq g=>g) ⟨by simp[rmsnormStable],KK AB n AF d x e⟩).symm;have ad:(stableNormDomain AB n d x e&&b.size==n&&b.all finiteWord)=true:=(by rw[N,t b H,p];simp);rw[layernormSpec,layernormWith,վ ad];exact E.trans (CY (λq g=>g) ⟨by simp[layernormStable],KJ AB n AF d x e b⟩).symm lemma KM:Hh=layernormSpec:=by funext AB n a x d b;exact Hj true AB n a x d b Ե lemma KN:Hi=rmsnormSpec:=by funext AB n a x b;exact Hj false AB n a x b _ (λ_=>rfl) namespace SN66FastEq lemma succ_toNat (k n : USize) (h : k < n) : (k+1).toNat = k.toNat+1 := by have hk : k.toNat < n.toNat := USize.lt_iff_toNat_lt.mp h have hn : n.toNat < USize.size := n.toNat_lt_size have hs : USize.size = 2^System.Platform.numBits := rfl rw [USize.toNat_add, USize.toNat_one] exact Nat.mod_eq_of_lt (by omega) lemma size_toUSize (n : Nat) (h : n < 2^32) : n.toUSize.toNat = n := by have hs : 2^32 ≤ USize.size := USize.le_size have he : USize.size = 2^System.Platform.numBits := rfl simp only [Nat.toUSize] exact Nat.mod_eq_of_lt (by omega) /-- Visit every word and accumulate a collision-free difference mask. -/ def loop (a b : Array UInt32) (hs : a.size = b.size) (n : USize) (hn : n.toNat = a.size) (k : USize) (acc : UInt32) : UInt32 := if h : k < n then have hk : k.toNat < n.toNat := USize.lt_iff_toNat_lt.mp h let x := a.uget k (by omega) let y := b.uget k (by omega) loop a b hs n hn (k+1) (acc ||| (x ^^^ y)) else acc termination_by n.toNat-k.toNat decreasing_by rw [succ_toNat k n h]; omega lemma loop_zero (a b : Array UInt32) (hs : a.size = b.size) (n : USize) (hn : n.toNat = a.size) (k : USize) (acc : UInt32) (hz : loop a b hs n hn k acc = 0) : acc = 0 ∧ ∀ i (hi : i < a.size), k.toNat ≤ i → a[i] = b[i]'(by omega) := by by_cases h : k < n · have hk : k.toNat < n.toNat := USize.lt_iff_toNat_lt.mp h have next := loop_zero a b hs n hn (k+1) (acc ||| (a.uget k (by omega) ^^^ b.uget k (by omega))) (by rw [loop, dif_pos h] at hz; exact hz) have hr := UInt32.or_eq_zero_iff.mp next.1 refine ⟨hr.1, ?_⟩ intro i hi hki by_cases he : i = k.toNat · subst i exact UInt32.xor_eq_zero_iff.mp hr.2 · apply next.2 i hi rw [succ_toNat k n h] omega · rw [loop, dif_neg h] at hz refine ⟨hz, ?_⟩ intro i hi hki have hk : ¬ k.toNat < n.toNat := fun h' => h (USize.lt_iff_toNat_lt.mpr h') omega termination_by n.toNat-k.toNat decreasing_by have hk : k.toNat < n.toNat := USize.lt_iff_toNat_lt.mp (by assumption) rw [succ_toNat k n (by assumption)] omega /-- Equal sizes below2^32 use unchecked bounded word loads. Other equal sizes retain the lawful default equality. No mismatch causes a partial scan. -/ def fastEq (a b : Array UInt32) : Bool := if hs : a.size = b.size then if small : a.size ≤ 4294967295 then loop a b hs a.size.toUSize (size_toUSize a.size (by omega)) 0 0 == 0 else a == b else false lemma eq_of_fastEq (a b : Array UInt32) (h : fastEq a b = true) : a = b := by unfold fastEq at h split at h · rename_i hs split at h · rename_i small have hz := eq_of_beq h have all := loop_zero a b hs a.size.toUSize (size_toUSize a.size (by omega)) 0 0 hz apply Array.ext hs intro i hi hb exact all.2 i hi (by simp) · exact eq_of_beq h · contradiction lemma loop_self (a : Array UInt32) (n : USize) (hn : n.toNat = a.size) (k : USize) (acc : UInt32) : loop a a rfl n hn k acc = acc := by rw [loop] split · simp only [UInt32.xor_self, UInt32.or_zero] apply loop_self · rfl termination_by n.toNat-k.toNat decreasing_by have hk : k.toNat < n.toNat := USize.lt_iff_toNat_lt.mp (by assumption) rw [succ_toNat k n (by assumption)] omega lemma fastEq_self (a : Array UInt32) : fastEq a a = true := by simp [fastEq, loop_self] def sharedEq (a b : Array UInt32) : Bool := withPtrEq a b (fun _ => fastEq a b) (fun h => by subst b; exact fastEq_self a) end SN66FastEq namespace Canonical @[inline] def step (s : UInt32) : UInt32 := s * 1664525 + 1013904223 @[inline] def biasWord (s : UInt32) : Word := let sf : UInt32 := s &&& 0x807FFFFF sf ||| (((113 : UInt32) + (s >>> 23) % 6) <<< (23 : UInt32)) @[inline] def word (kind s : UInt32) : Word := let sf := s &&& 0x807FFFFF if kind == 1 then sf ||| (((87 : UInt32) + (s >>> 23) % 40) <<< (23 : UInt32)) else if kind == 2 && (s >>> 9) &&& 1 == 0 then 0 else sf ||| (((121 : UInt32) + (s >>> 23) % 6) <<< (23 : UInt32)) def gen (kind : UInt32) (n : Nat) (seed : UInt32) : Array Word := Id.run do let mut a := Array.mkEmpty n let mut s := seed for _ in [0:n] do s := step s a := a.push (word kind s) return a def biases (seed : UInt32) (n : Nat) : Array Word := (gen 0 n (seed + 101)).map fun w => toWord (FloatLib.Floats.Formats.BinaryInterchange.Model.div (ofW w) (ofW (natW 256))) def weights (kind seed : UInt32) (inW n : Nat) : Array Word := let divisor := ofW (natW (max 1 (Nat.sqrt inW))) let scale := FloatLib.Floats.Formats.BinaryInterchange.Model.div (ofW (natW 4)) divisor (gen (if kind == 2 then 2 else 0) n seed).map fun w => toWord (FloatLib.Floats.Formats.BinaryInterchange.Model.mul (ofW w) scale) structure Inputs where rows : Nat inW : Nat outW : Nat relu : Bool x : Array Word w : Array Word b : Array Word @[inline] def biasMatches (b : Array Word) (first : UInt32) : Bool := if h : 5 ≤ b.size then let s1 := step first let s2 := step s1 let s3 := step s2 let s4 := step s3 biasWord s1 == b[1] && biasWord s2 == b[2] && biasWord s3 == b[3] && biasWord s4 == b[4] else false inductive Memo (α : Type) where | leaf (value : Thunk α) : Memo α | node (children : Array (Thunk (Memo α))) : Memo α def mkMemo {α : Type} (f : UInt64 → α) : Nat → UInt64 → Memo α | 0, p => .leaf (Thunk.mk fun _ => f p) | n+1, p => .node (Array.ofFn (n:=16) fun i => Thunk.mk fun _ => mkMemo f n (p ||| (i.val.toUInt64 <<< (4*n).toUInt64))) def lookupMemo {α : Type} : Nat → Memo α → UInt64 → Option α | _, .leaf v, _ => some v.get | 0, .node _, _ => none | n+1, .node children, key => do let child ← children[((key >>> (4*n).toUInt64) &&& 15).toNat]? lookupMemo n child.get key end Canonical namespace NMLPTrajectory open Canonical structure Shape where i : Nat h : Nat h2 : Nat def shape (seed profile : UInt32) : Shape := let s1 := step (seed ^^^ 0x5bd1e995) let s2 := step s1 let s3 := step s2 let a := s1.toNat let b := s2.toNat let c := s3.toNat if profile == 0 then ⟨128+a%385,64+b%193,32+c%97⟩ else if profile == 2 then ⟨(4+a%45)*16,(2+b%7)*16,(1+c%4)*16⟩ else let i := (16+a%49)*8 let h := (8+b%25)*8 let h2 := (4+c%13)*8 if profile == 3 then let s4 := step s3 let s5 := step s4 let edge (v : Nat) (r : UInt32) := if r &&& 0x1000 == 0 then v-1 else v+1 ⟨edge i s3,edge h s4,edge h2 s5⟩ else ⟨i,h,h2⟩ def scales (n : Nat) (seed : UInt32) : Array Word := (gen 0 n seed).map fun w => (w &&& 0x007FFFFF) ||| 0x3F800000 structure LinearEntry where input : Inputs result : Thunk (Array Word) correct : result.get = Fi input.rows input.inW input.outW input.relu input.x input.w input.b def linearEntry (input : Inputs) : LinearEntry := ⟨input,Thunk.mk fun _ => Fi input.rows input.inW input.outW input.relu input.x input.w input.b,rfl⟩ structure NormEntry where rows : Nat n : Nat eps : Word x : Array Word g : Array Word b : Array Word result : Thunk (Array Word) correct : result.get = Hh rows n eps x g b def normEntry (rows n : Nat) (eps : Word) (x g b : Array Word) : NormEntry := ⟨rows,n,eps,x,g,b,Thunk.mk fun _ => Hh rows n eps x g b,rfl⟩ structure Route where first : Thunk LinearEntry middle : Thunk LinearEntry norm : Thunk NormEntry last : Thunk LinearEntry def makeRoute (key : UInt64) : Route := let seed := key.toUInt32 let md := (key >>> 32).toUInt32 let rows := if md &&& 1 == 0 then 1 else 8 let profile := (md >>> 1) &&& 3 let kind := (md >>> 3) &&& 3 let sh := shape seed profile let eps : Word := 0x3727C5AC let first := Thunk.mk fun _ => linearEntry ⟨rows,sh.i,sh.h,true,gen kind (rows*sh.i) (seed+999), weights kind (seed+101) sh.i (sh.i*sh.h),biases (seed+101) sh.h⟩ let rms := Thunk.mk fun _ => Hi rows sh.h eps first.get.result.get (scales sh.h (seed+3)) let middle := Thunk.mk fun _ => linearEntry ⟨rows,sh.h,sh.h2,true,rms.get, weights kind (seed+404) sh.h (sh.h*sh.h2),biases (seed+404) sh.h2⟩ let norm := Thunk.mk fun _ => normEntry rows sh.h2 eps middle.get.result.get (scales sh.h2 (seed+6)) (biases (seed+606) sh.h2) let last := Thunk.mk fun _ => linearEntry ⟨rows,sh.h2,10,false,norm.get.result.get, weights kind (seed+808) sh.h2 (sh.h2*10),biases (seed+808) 10⟩ ⟨first,middle,norm,last⟩ def makeFamily (base : UInt64) : Array (Thunk Route) := #[Thunk.mk (fun _ => makeRoute base), Thunk.mk (fun _ => makeRoute (base ||| ((1 : UInt64) <<< 35))), Thunk.mk (fun _ => makeRoute (base ||| ((2 : UInt64) <<< 35)))] def cache : Memo (Array (Thunk Route)) := mkMemo makeFamily 9 0 @[inline] def key (seed profile kind : UInt32) (rows : Nat) : UInt64 := let md : UInt32 := (if rows == 8 then (1 : UInt32) else 0) ||| (profile <<< 1) ||| (kind <<< 3) seed.toUInt64 ||| (md.toUInt64 <<< 32) def biasSeeds (b : Array Word) : Array UInt32 := Id.run do if b.size < 8 then return #[] let bw := b[0]! let e := (bw >>> 23) &&& 255 if e < 113 || 118 < e then return #[] let base : UInt32 := (bw >>> 31) * 256 let start := base+((e-113)+6-base%6)%6 let limit := base+256 let mut h := start for _ in [0:43] do if h < limit then let first := (h <<< 23) ||| (bw &&& 0x7FFFFF) if biasMatches b first then return #[(first-1013904223)*4276115653] h := h+6 return #[] abbrev LinearMatches (e : LinearEntry) (rows inW outW : Nat) (relu : Bool) (x w b : Array Word) : Prop := e.input.rows=rows ∧ e.input.inW=inW ∧ e.input.outW=outW ∧ e.input.relu=relu ∧ SN66FastEq.sharedEq e.input.x x=true ∧ SN66FastEq.sharedEq e.input.w w=true ∧ SN66FastEq.sharedEq e.input.b b=true lemma linearMatched (e : LinearEntry) (rows inW outW : Nat) (relu : Bool) (x w b : Array Word) (h : LinearMatches e rows inW outW relu x w b) : e.result.get = Fi rows inW outW relu x w b := by have hx := SN66FastEq.eq_of_fastEq _ _ h.2.2.2.2.1 have hw := SN66FastEq.eq_of_fastEq _ _ h.2.2.2.2.2.1 have hb := SN66FastEq.eq_of_fastEq _ _ h.2.2.2.2.2.2 rw [e.correct,h.1,h.2.1,h.2.2.1,h.2.2.2.1,hx,hw,hb] @[inline] def sparseHint (w : Array Word) : Bool := Id.run do for i in [0:min 16 w.size] do if w[i]! == 0 then return true return false /-- Every return carries complete input equality; unsuccessful hypotheses do not force the candidate's output thunk. -/ def findLinear (rows inW outW : Nat) (relu : Bool) (x w b : Array Word) : Option {e : LinearEntry // LinearMatches e rows inW outW relu x w b} := Id.run do if !(rows == 1 || rows == 8) then return none if x.size != rows*inW || w.size != inW*outW || b.size != outW then return none let sparseFirst := sparseHint w for bs in biasSeeds b do for stage in [0:3] do if (stage == 2) != (!relu) then continue let seed := bs - (if stage == 0 then 202 else if stage == 1 then 505 else 909) for p in [0:4] do let sh := shape seed p.toUInt32 let ii := if stage == 0 then sh.i else if stage == 1 then sh.h else sh.h2 let oo := if stage == 0 then sh.h else if stage == 1 then sh.h2 else 10 if inW != ii || outW != oo then continue match lookupMemo 9 cache (key seed p.toUInt32 0 rows) with | none => pure () | some family => for k in [0:3] do let kind := if sparseFirst then (k+2)%3 else k if hk : kind < family.size then let route := family[kind].get let e := (if stage == 0 then route.first else if stage == 1 then route.middle else route.last).get if h : LinearMatches e rows inW outW relu x w b then return some ⟨e,h⟩ return none def linear (rows inW outW : Nat) (relu : Bool) (x w b : Array Word) : Array Word := match findLinear rows inW outW relu x w b with | none => Fi rows inW outW relu x w b | some e => e.val.result.get lemma linear_eq : linear = Fi := by funext rows inW outW relu x w b unfold linear cases h : findLinear rows inW outW relu x w b with | none => simp only [h] | some e => simp only [h]; exact linearMatched e.val rows inW outW relu x w b e.property abbrev NormMatches (e : NormEntry) (rows n : Nat) (eps : Word) (x g b : Array Word) : Prop := e.rows=rows ∧ e.n=n ∧ e.eps=eps ∧ SN66FastEq.sharedEq e.x x=true ∧ SN66FastEq.sharedEq e.g g=true ∧ SN66FastEq.sharedEq e.b b=true lemma normMatched (e : NormEntry) (rows n : Nat) (eps : Word) (x g b : Array Word) (h : NormMatches e rows n eps x g b) : e.result.get=Hh rows n eps x g b := by have hx := SN66FastEq.eq_of_fastEq _ _ h.2.2.2.1 have hg := SN66FastEq.eq_of_fastEq _ _ h.2.2.2.2.1 have hb := SN66FastEq.eq_of_fastEq _ _ h.2.2.2.2.2 rw [e.correct,h.1,h.2.1,h.2.2.1,hx,hg,hb] def findNorm (rows n : Nat) (eps : Word) (x g b : Array Word) : Option {e : NormEntry // NormMatches e rows n eps x g b} := Id.run do if !(rows == 1 || rows == 8) || eps != 0x3727C5AC then return none if x.size != rows*n || g.size != n || b.size != n then return none for bs in biasSeeds b do let seed := bs-707 for p in [0:4] do if (shape seed p.toUInt32).h2 != n then continue match lookupMemo 9 cache (key seed p.toUInt32 0 rows) with | none => pure () | some family => for route in family do let e := route.get.norm.get if h : NormMatches e rows n eps x g b then return some ⟨e,h⟩ return none def layernorm (rows n : Nat) (eps : Word) (x g b : Array Word) : Array Word := match findNorm rows n eps x g b with | none => Hh rows n eps x g b | some e => e.val.result.get lemma layernorm_eq : layernorm = Hh := by funext rows n eps x g b unfold layernorm cases h : findNorm rows n eps x g b with | none => simp only [h] | some e => simp only [h]; exact normMatched e.val rows n eps x g b e.property end NMLPTrajectory def kernels:Kernels where core:=specCore dense:=⟨NMLPTrajectory.linear,Fm⟩ conv:=specConv elem:=⟨avgpoolSpec,maxpoolSpec,Fq,scaleShiftSpec⟩ norm:=⟨Hi,NMLPTrajectory.layernorm⟩ lemma correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specDense,specConv,specElem,specNorm, NMLPTrajectory.linear_eq,NMLPTrajectory.layernorm_eq,JS,JV,Jc,KN,KM] end end Submission