import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open UInt64 renaming le_iff_toNat_le→γ,toNat_add→η,lt_iff_toNat_lt→θ,toNat_sub_of_le→μ,toNat_shiftRight→ξ,toNat_inj→ο,toNat_shiftLeft→ς,toNat_sub→τ,toNat_mul→Ν,toNat_toUInt32→ϐ,le_trans→ϔ,toNat_ofNat_of_lt'→Ϛ,toNat_and→ϛ,toNat_ofNat→ϝ,toNat_zero→Ϡ,toNat_toBitVec→Ϲ open Nat renaming mod_eq_of_lt→ε,shiftRight_eq_div_pow→ζ,shiftLeft_eq→κ,and_two_pow_sub_one_eq_mod→ν,pow_le_pow_right→υ,mul_le_mul_right→χ,mul_lt_mul_of_pos_right→ψ,zero_add→Κ,mod_lt→Λ,add_mul_mod_self_right→ϊ,mul_lt_mul''→ϋ,mul_assoc→ό,add_zero→ύ,two_pow_add_eq_or_of_lt→ώ,add_mul_div_right→ϑ,add_comm→ϒ,mul_comm→ϓ,div_eq_of_lt→ϕ,two_pow_pos→Ϙ,mul_le_mul_left→Ϣ,log2_self_le→ϥ,lt_log2_self→Ϧ,div_add_mod→ϩ,div_lt_of_lt_mul→Ϫ,zero_mul→ϫ,mul_one→ϰ,log2_lt→ϱ,succ_mul→ϲ,div_div_eq_div_mul→ϳ,add_right_comm→ϵ,toUInt64_eq→Ϸ,div_lt_iff_lt_mul→ϸ,pow_lt_pow_right→ϻ open USize renaming lt_iff_toNat_lt→ι,le_size→Ο,toNat_add→Υ,toNat_zero→Ϝ,toNat_one→϶ open Bool renaming false_eq_true→Α,and_eq_true→Ε,eq_iff_iff→ϗ,or_eq_true→Ϩ open UInt32 renaming toNat_inj→Β,toNat_toUInt64→Ι,lt_iff_toNat_lt→Μ,toNat_and→Χ,toNat_shiftRight→ϟ,toNat_ofNat_of_lt'→ϧ,toNat_ofNat'→ϭ,toNat_add→ϯ,le_iff_toNat_le→ϴ open Finset renaming sum_congr→Ζ,sum_range_succ→Η,sum_eq_sum_Ico_succ_bot→Θ,mem_range→Ϗ,sum_mul→ϖ,Ico_eq_empty_of_le→ϙ,sum_range_succ'→ϣ,sum_add_distrib→Ϥ open BitVec renaming toInt_eq_toNat_cond→Ξ open Model renaming isNaN_eq_false_of_toDyadic?_some→Ρ,isInf_eq_false_of_toDyadic?_some→Ϟ,roundDyadicGeneral_eq_roundDyadic→Ϻ open Array renaming getElem_ofFn→Τ,size_ofFn→ϡ open Model.Reduction.Internal renaming dotState_exact_toRat→Ϭ open Int.ModEq renaming add_right→Ϯ local notation "А" => by omega local notation "Б" => by decide local notation "В" => by positivity local notation "Г" => by norm_num local notation "Д" => UInt64 local notation "Е" => UInt32 local postfix:max "а"=>UInt64.toNat local postfix:max "б"=>USize.toNat local postfix:max "в"=>UInt32.toNat local postfix:max "г"=>Array.size local postfix:max "д"=>Nat.toUSize local postfix:max "е"=>Nat.toUInt64 local postfix:max "ж"=>UInt64.toUInt32 local postfix:max "з"=>Nat.log2 local postfix:max "и"=>UInt32.toUInt64 local postfix:max "й"=>Fin.val local postfix:max "к"=>Int.toNat local postfix:max "л"=>Nat.toUInt32 local postfix:max "м"=>UInt32.toUSize open UInt64 renaming reduceToNat→lC,toNat→l6,toNat_or→mM,toNat_div→n2 open ExactRuntime renaming idxOf→lE,expOf→lH,Word→lI,mantOf→lK,toDyadic_ofUInt32→lL,mantOf_lt_24→lT,signOf→lV,decodeD_toRat→lY,fracOf→l8,finishWord_of_ne→mE,stableNormDomain→mG,expOf_toNat_lt→mS,conv2dSpec→mX,windowAt→mY,toWord→nn,sqrtRational→ns,rowMean→nt,oneW→nD,idxOf_le→nK,avgpoolSpec→nN,avgpoolWith→nO,poolAt→nW,decodeD→n0,ofW→n4 open FloatLib.Numerics renaming shiftRightJam→lF,roundQuotientEven→lQ,roundShiftRightEven_shiftRightJam→mu,binaryRadix→mL open Finset renaming range→lG,range_eq_Ico→l9,sum_range_zero→mD,sum_empty→nd,sum_sub_distrib→np,mul_sum→nI open USize renaming size→lJ,size_eq_two_pow→mC open Nat renaming reduceMod→lM,reducePow→lO,mul_lt_mul_of_lt_of_le→lZ,mul_le_mul→l5,one_le_two_pow→md,pos_of_ne_zero→mf,add_sub_cancel_left→mj,add_mul→mq,pow_add→mH,mul_pos→mK,log2_eq_iff→mN,add_one_mul→mO,mod_two_eq_zero_or_one→mT,sub_add_cancel→mV,lt_of_mul_lt_mul_right→mZ,one_shiftLeft→m6,one_mul→m7,cast_sub→no,mod_add_mod→nx,le_div_iff_mul_le→nA,mul_div_mul_right→nC,le_log2→nF,sub_le_sub_right→nH,add_le_add_right→nJ,eq_add_of_sub_eq→nL,div_eq_of_lt_le→nP,div_mul_le_self→nS,zero_le→n3 open Array renaming ofFn→lN,getElem?_eq_getElem→l7,getElem_push→me,getElem?_eq_none→mA,ext→mQ,emptyWithCapacity→nj,getElem_push_lt→nE,size_map→nG,getElem?_ofFn→nQ open Float.Model renaming totalExponent→lP open FloatLib.Numerics.RationalBinary renaming floorLog2→lR,scaleByPowerOfTwo→mB,scaleByPowerOfTwo_ofNat→mJ,lessThanPowerOfTwo→mR,atLeastPowerOfTwo→m4 open FloatLib.Numerics.FixedWord renaming roundShiftRightEven→lU open Prod.Lex renaming right→lW,left→m9 open Float.Model.UnpackedFloat.ExtendedMantissa renaming shiftRightOne→lX open FloatLib.Floats.Formats.BinaryInterchange.Model renaming roundedMantissa_shift_quotient→mc,roundDyadic→mv,pow2→n6 open Float.Model.UnpackedFloat renaming accuracyOfFraction→mh,roundWithAccuracy→m8,round→nR open FloatLib.Floats.Formats.Flocq renaming bpow→mi open UInt32 renaming ofNat→mw,toNat_shiftLeft→my,toNat_sub_of_le→mz,toBitVec_toInt32→na,toNat_or→nw,toNat_toBitVec→nB open ZMod renaming natCast_mod→mF open OfNat renaming ofNat→mI open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice→mP,finiteDotSlice→ny open Int renaming bmod_eq_of_le_mul_two→m5,ModEq→ni open System.Platform renaming numBits→nf open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec→nk open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled→nm,toUInt32_ofFields→nM,roundRatScaled→nU open FloatLib.Numerics.Dyadic renaming toRat_eq_zero_iff→nr,cast_toRat→nT,add_toRat→nV open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState→nY,State→n1 open MulZeroClass renaming zero_mul→nZ open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div→n5 local notation "н"=>Nat local notation "о"=>Int local notation "п"=>Array local notation "р"=>Word local notation "с"=>USize local notation "т"=>Bool structure Acc where pos:п н neg:п н special:т negZero:т def Acc.lB (acc:Acc):о:=(limbVal acc.pos.toList:о)-limbVal acc.neg.toList @[inline] def Acc.add (acc:Acc) (m idx:н) (neg:т):Acc:= match acc with | ⟨pos,ng,sp,nz⟩=> if m=0 then ⟨pos,ng,sp,nz&&neg⟩ else if neg then ⟨pos,addLimbs64 ng mе idx,sp,false⟩ else ⟨addLimbs64 pos mе idx,ng,sp,false⟩ section open FloatLib.Numerics lemma dI (s:т) (m:н) (e:о) (j:н) (h:j+25<= mз): mv Fmt ⟨s,lF m j,e+j⟩=mv Fmt ⟨s,m,e⟩:=by have d:m≠0:=by rintro rfl;simp at h have i:2^mз<= m:=ϥ d;have r:2^(j+1)<= m:=le_trans (υ Г А) i;have b:(lF m j)з=mз-j:=log2_shiftRightJam m j r have q:lF m j≠0:= shiftRightJam_ne_zero m j (le_trans (υ Г А) r) rw[<- Ϻ,<- Ϻ];unfold Model.roundDyadicGeneral;simp only[q,d,beq_iff_eq,ite_false,b];have o:((mз-j:н):о)+(e+j)=(mз:о)+e:=А;rw[o];have p:Fmt.fracWidth=23:=rfl;have l:Fmt.minSubnormalExponent=-149:=rfl;have g:Fmt.minNormalExponent=-126:=rfl;rw[p,l,g];split_ifs with h1 h2 h3 h4<;>try omega .rfl .congr 1 obtain ⟨a,ha⟩:∃a:н,e- -149=Int.negSucc a:=⟨(-(e+149)-1)к,by omega⟩ have hb:e+j- -149=Int.negSucc (a-j):=А;rw[ha,hb];dsimp only;rw[show a-j+1=(a+1)-j by omega] exact mu m j (a+1) А .congr 1 rw[show mз-j-23=(mз-23)-j by omega] exact mu m j _ А end lemma ar (n:н) (f:н-> Е) (k:н) (hk:kf iй)[k]! =f k:=by rw[getElem!_pos _ k (by simpa using hk),Τ] namespace Core def tm (a b:р):о:=sv a*sv b*2^(idxOf a+idxOf b) def aN (n:н) (fa fb:н-> р):о:=∑k∈Finset.range n,tm (fa k) (fb k) def gO (n:н) (fa fb:н-> р):Prop:=∀k,k expOf (fa k)≠255/\expOf (fb k)≠255 lemma eg (n:н) (b d:н-> lI): aN (n+1) b d=aN n b d+tm (b n) (d n):=by unfold aN;rw[Η] lemma jk (A B:п Е) (i c:н): dsum A B i c=∑k∈lG c,tm A[i+k]! B[i+k]!:=by induction c generalizing i with | zero=>simp[dsum] | succ c b=> rw[dsum,b (i+1),ϣ,add_comm];exact congrArg₂ _ (Ζ rfl λk _=>by rw[show i+1+k=i+(k+1) by omega]) rfl lemma d7 (n:н) (b d:н-> lI): dsum (lN (n:=n) λi=>b iй) (lN (n:=n) λi=>d iй) 0 n= aN n b d:=by rw[jk,aN] exact Ζ rfl λk hk=>by rw[Ϗ] at hk;simp only[Κ,ar n b k hk,ar n d k hk] lemma fx (n:н) (l o:н-> lI) (r:gO n l o) (v:aN n l o≠0): dotOf n l o=finishWord (aN n l o) (-298) false:=by unfold dotOf;set A:=lN (n:=n) λi=>l iй with p set B:=lN (n:=n) λi=>o iй with hB have g:∀k,k lH A[k]!≠255/\lH B[k]!≠255:=λk hk=>by rw[p,hB,ar n l k hk,ar n o k hk];exact r k hk have u:∀X:п р,X.size=n->(∀k,k expOf X[k]!≠255) -> ∀k (hk:k<(X.map (Model.ofUInt32 (fmt:=Fmt))).size), Model.isFinite (X.map (Model.ofUInt32 (fmt:=Fmt)))[k]=true:=by intro X hX h k hk;have t:k(g k hk).1 have e:=u B (by simp[hB]) λk hk=>(g k hk).2 have b:ny L R 0 Lг (by simp) (by simp[j])=(aN n l o:ℚ)*2^(-298:ℤ):= (finiteDotSlice_eq A B 0 L.size (by simp[q]) (by simp[q,p,hB]) λk _ y=>g k (by simpa[q,p] using y)).trans (by simp[q,p,hB,d7]) unfold dotSpec Model.dot rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero Fmt L R .nearestEven j d e (by rw[mP L R j];intro h;injection h with h;rw[b] at h;simp at h;exact v h)] exact (mE _ (aN n l o) (-298) false v (by rw[Ϭ (destination:=Fmt) L R j d e,b])).symm @[inline] def i5 (w:Е):Д:=if (w>>>23)&&&0xFF!=0 then 1 else 0 @[inline] def mW (w:Е):Д:=(w&&&0x7FFFFF)и ||| (i5 w<<<23) @[inline] def iW (w:Е):Д:=((w>>>23)&&&0xFF)и-i5 w @[inline] def sW (w:Е):Д:=if w>>>31!=0 then (0:Д)-mW w else mW w def ab (x:Д):о:=x.toBitVec.toInt lemma fO (w:Е):(w&&&0x7FFFFF)в<2^23:=by rw[Χ];exact lt_of_le_of_lt Nat.and_le_right Б lemma am (w:Е):(mW w)а=lK w:=by have e:=fO w;unfold mW i5 lK lH l8;by_cases b:(w>>>23)&&&0xFF=0 .simp[b] .have d:((w>>>23)&&&0xFF!=0)=true:=by simpa using b simp only[d,b,ite_true,ite_false] rw[mM,Ι,show ((1:Д)<<<23)а=2^23*1 from rfl,Nat.or_comm, <- ώ e,ϰ,ϒ] lemma ap (w:Е):(iW w)а=lE w:=by unfold iW i5 lE lH;have e:=mS w;unfold lH at e;by_cases d:(w>>>23)&&&0xFF=0 .simp[d] .have b:1<=((w>>>23)&&&0xFF)в:= Nat.one_le_iff_ne_zero.2 λh=>d (Β.mp (by simpa using h)) simp only[show ((w>>>23)&&&0xFF!=0)=true by simpa using d,d,ite_true,ite_false] rw[μ _ _ (γ.mpr (by rw[Ι];simpa using b)), Ι] rfl lemma a5 (w:Е):lV w=true↔2^31<= wв:=by unfold lV;have b:=w.toNat_lt;have h1:(w&&&0x80000000)в=wв&&&2^31:=by rw[Χ];rfl rw[Nat.and_two_pow,Nat.testBit_eq_decide_div_mod_eq] at h1;simp only[bne_iff_ne,ne_eq,<- Β,h1];by_cases h:wв/2^31%2=1<;>simp[h]<;>omega lemma bq (w:Е):(w>>>31!=0)=lV w:=by have h2:(w>>>31)в=wв/2^31:=by rw[ϟ];simp[ζ] have:=w.toNat_lt;rw[ϗ,bne_iff_ne,ne_eq,<- Β,h2,a5];simp<;>omega lemma bg (w:Е):ab (sW w)=sv w:=by have b:=am w;have d:=lT w;unfold sW ab sv;rw[bq];cases lV w<;>simp only[Α,ite_false,ite_true]<;>rw[Ξ] .rw[show (mW w).toBitVec.toNat=lK w from b];simp;omega .rw[show ((0:Д)-mW w).toBitVec.toNat=(2^64-lK w)%2^64 by show ((0:Д)-mW w)а=_;rw[τ,b];simp] simp only[lO];split<;>omega @[inline] def sx (k x:Д):Д:=bif x>>>k==0 then x else x>>>k @[inline] def sr (k x r:Д):Д:=bif x>>>k==0 then r else r+k @[inline] def aV (x0:Д):Д:= let x1:=sx 32 x0 let r1:=sr 32 x0 0 let x2:=sx 16 x1 let r2:=sr 16 x1 r1 let x3:=sx 8 x2 let r3:=sr 8 x2 r2 let x4:=sx 4 x3 let r4:=sr 4 x3 r3 let x5:=sx 2 x4 let r5:=sr 2 x4 r4 sr 1 x5 r5 @[inline] def i8 (value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then quotient+1 else if (quotient&&&1)==0 then quotient else quotient+1 @[inline] def fe (value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then 1 else 0) @[inline] def bJ (value shift:Д):Д:= if shift==0 then value else if shift<64 then fe value shift else if shift==64 then (if value>0x8000000000000000 then 1 else 0) else 0 @[inline] def eZ (sign:т) (e f:Е):Е:= (if sign then (0x80000000:Е) else 0) ||| ((e&&&0xff)<<<23) ||| (f&&&0x007fffff) @[inline] def gj (n:Д):Е:= (if n<0x800000 then 0 else n-0x800000)ж @[inline] def aX (sign:т) (product scale:Д):Е:= if product==0 then if sign then 0x80000000 else 0 else let leading:=aV product let position:=leading+scale if position<172 then let fraction:= if scale<149 then bJ product (149-scale) else product<<<(scale-149) if fraction==0 then (if sign then 0x80000000 else 0) else if fraction==0x800000 then eZ sign 1 0 else eZ sign 0 fractionж else let roundedMantissa:= if leading<23 then product<<<(23-leading) else bJ product (leading-23) let carry:=roundedMantissa==0x1000000 let normalizedPosition:=if carry then position+1 else position if normalizedPosition>425 then (if sign then 0xff800000 else 0x7f800000) else let normalizedMantissa:=if carry then 0x800000 else roundedMantissa eZ sign (normalizedPosition-171)ж (gj normalizedMantissa) open Model.NativeBinary32 in lemma dF (n k:н) (h:n>>>k≠0):nз=k+(n>>>k)з:=by rw[ζ] at h⊢;have h1:=(nA (Ϙ k)).1 (ϥ h);have h2:=(ϸ (Ϙ k)).1 (Ϧ (n:=n/2^k));rw[mN (by rintro rfl;simp at h)] simp only[Nat.pow_succ,mH] at h2⊢;constructor<;>nlinarith lemma gn (x:Д):xаз<64:=by by_cases h:xа=0 .simp[h] .exact (ϱ h).mpr x.toNat_lt lemma cm (g r x k:Д) (hk:kа<=32) (j:0>>k)а=xа>>>kа:=by rw[ξ,ε А] unfold sx sr;by_cases e:x>>>k=0 .simp only[e,beq_self_eq_true,Bool.cond_true] exact ⟨b,by simpa[d,ζ,Nat.div_eq_zero_iff] using congrArg l6 e⟩ .simp only[show (x>>>k==0)=false by simpa using e,Bool.cond_false] have l:=dF xа kа λh=>e (ο.mp (by simpa[d] using h)) have i:=gn g;refine ⟨by rw[η,ε А,d];omega,?_⟩ rw[d,ζ];exact Ϫ (by rw[<- mH];exact lt_of_lt_of_eq hb (by congr 1;omega)) lemma fB (n:н) (h:n<2):nз=0:=by rw[Nat.log2_def,if_neg А] lemma a6 (x:Д):aV x=x.log2:=by apply ο.mp;rw[show x.log2а=xаз from rfl];have b:xа<2^(2*(32:Д)а):=x.toNat_lt;obtain ⟨l,d⟩:=cm x 0 x 32 Б Б (by simp) b obtain ⟨o,e⟩:=cm x _ _ 16 Б Б l (by simpa using d) obtain ⟨p,g⟩:=cm x _ _ 8 Б Б o (by simpa using e) obtain ⟨q,h⟩:=cm x _ _ 4 Б Б p (by simpa using g) obtain ⟨r,i⟩:=cm x _ _ 2 Б Б q (by simpa using h) obtain ⟨t,j⟩:=cm x _ _ 1 Б Б r (by simpa using i) rw[fB (sx 1 (sx 2 (sx 4 (sx 8 (sx 16 (sx 32 x))))))а (by simpa using j)] at t unfold aV;dsimp only;omega lemma jy (v s:Д) (i:s≠0) (h:s<64):fe v s=i8 v s:=by have e:sа<64:=h have g:(2:н)^sа<18446744073709551616:= lt_of_lt_of_le (ϻ Г e) Г have d:(v&&&((1<<simp[γ, ε e,m6,ε g,ν,md] have b:((v>>>s)&&&1)а=(v>>>s)а%2:=by simp[ϛ,Nat.and_one_is_mod] have j:=Λ vа (show 0<2^sа by positivity) have ha:((v&&&((1<<>>s)&&&1))а=vа%2^sа+(v>>>s)а%2:=by rw[η,d,b,ε А] have hb:((v>>>s)&&&1==0)=decide ((v>>>s)а%2=0):=by rw[<- b,ϗ,beq_iff_eq,decide_eq_true_iff,<- ο,Ϡ] unfold fe i8;simp only[gt_iff_lt,θ,ha,d,hb,decide_eq_true_eq];split_ifs<;>first | rfl | omega | simp lemma g6 (e d:Д): bJ e d=lU e dа:=by have hB:bJ e d=(if d==0 then e else if d<64 then i8 e d else if d==64 then (if e>0x8000000000000000 then 1 else 0) else 0):=by unfold bJ;split_ifs with a b<;>first | rfl | exact jy _ _ (by simpa using a) b rw[hB];unfold i8 lU;have o:=d.toNat_lt;by_cases g:d=0 .subst g;rfl .have i:dа≠0:=λh=>g (ο.mp (by simpa using h)) simp only[g,beq_iff_eq,i,reduceIte] have l:UInt64.ofNat (dа-1)=d-1:=by apply ο.mp;rw[μ _ _ (by rw[γ];simp;omega)];simp;omega have j:(d<64)↔dа<64:=θ;simp only[UInt64.ofNat_toNat,l,<- j,show d=64↔dа=64 by rw[<- ο];rfl] open Model.NativeBinary32 in lemma gV (b:т) (e f:н): eZ b (mw e) (mw f)=mkBits b e f:=by unfold eZ mkBits;cases b<;>rfl lemma df (x:Д):xж=mw xа:=by rfl lemma eT (n:Д):gj n=mw (nа-0x800000):=by unfold gj;split<;>rename_i h<;>rw[θ] at h<;>simp only[df] .rw[show nа-0x800000=0 by simp at h;omega];rfl .rw[μ _ _ (by rw[γ];simp at h⊢;omega)];rfl open Model.NativeBinary32 in lemma cr (e:т) (b d:Д): aX e b d=roundProduct e b d:=by unfold aX roundProduct;simp only[a6,g6,eT,df];rw[show (1:Е)=mw 1 from rfl,show (0:Е)=mw 0 from rfl];simp only[gV] open Model.NativeBinary32 in lemma cq (w:Е):nn (ofUInt32 w)=w:=by have h:=toUInt32_ofUInt32 w;unfold toUInt32 at h;unfold toWord;conv_rhs=>rw[<- h] exact Β.mp (ε (BitVec.isLt _)) open Model.NativeBinary32 in lemma cM (d:т) (m b:Д) (g:b.toNat<=506): aX d m b=toWord (Model.roundDyadic Fmt ⟨d,m.toNat,(b.toNat:о)-298⟩):=by rw[cr,roundProduct_eq_roundDyadic _ _ _ g] have e:Model.roundDyadic Fmt ⟨d,m.toNat,(b.toNat:о)-298⟩= ofUInt32 (roundDyadic ⟨d,m.toNat,Int.ofNat b.toNat-298⟩):= (ofUInt32_roundDyadic _).symm rw[e,cq] def ae (hi lo:Д):о:=ab hi*2^64+loа @[inline] def aS (hi lo:Д):Д:=if hi>>>63!=0 then (0:Д)-lo else lo @[inline] def bA (hi lo:Д):Д:= if hi>>>63!=0 then (if lo==0 then (0:Д)-hi else ~~~hi) else hi lemma fW (b:Д):(b>>>63!=0)=decide (2^63<= bа):=by have h2:(b>>>63)а=bа/2^63:=by rw[ξ];simp[ζ] have:=b.toNat_lt;rw[ϗ,bne_iff_ne,ne_eq,<- ο,h2,decide_eq_true_iff];simp lemma cU (b d:Д): ae b d=(bа*2^64+dа:о)-(if 2^63<= bа then 2^128 else 0):=by unfold ae ab;rw[Ξ,Ϲ];split<;>split<;>push_cast<;>omega lemma iG (d b:Д): (ae d b).natAbs=(bA d b)а*2^64+(aS d b)а /\ decide (ae d b<0)=(d>>>63!=0):=by have j:=d.toNat_lt;have l:=b.toNat_lt;unfold bA aS;rw[cU,fW];by_cases g:2^63<= dа .simp only[g,decide_true,ite_true] by_cases e:b=0 .subst e simp only[beq_self_eq_true,ite_true,Ϡ];rw[τ];simp;constructor<;>omega .have i:bа≠0:=λh=>e (ο.mp (by simpa using h)) simp only[show (b==0)=false by simpa using e,Α,ite_false] rw[τ,UInt64.toNat_not];simp;constructor<;>omega .simp only[g,decide_false,Α,ite_false];simp;omega @[inline] def af (hi lo B:Д):Д:= if hi==0&&lo==0 then 0x100000000 else if B>442 then 0x100000000 else let neg:=hi>>>63!=0 let au:=aS hi lo let aB:=bA hi lo if aB==0 then (aX neg au B)и else if aB>>>32==0 then let q:=(aB<<<32)+(au>>>32) (aX neg (if au&&&0xFFFFFFFF==0 then q else q ||| 1) (B+32))и else (aX neg (if au==0 then aB else aB ||| 1) (B+64))и lemma toUInt32_toUInt64 (x:Е):xиж=x:=by apply Β.mp;simp lemma kF (d b:Д) (h:dа<2^32): (if b&&&0xFFFFFFFF==0 then (d<<<32)+(b>>>32) else ((d<<<32)+(b>>>32)) ||| 1)а= lF (dа*2^64+bа) 32:=by have g:=b.toNat_lt have i:((d<<<32)+(b>>>32))а=dа*2^32+bа/2^32:=by simp[η,κ,ζ];omega have e:(b&&&0xFFFFFFFF)а=bа%2^32:=by rw[ϛ];exact ν _ 32 unfold lF simp only[show (dа*2^64+bа)/2^32=dа*2^32+bа/2^32 by omega, show (dа*2^64+bа)%2^32=bа%2^32 by omega, show (b&&&0xFFFFFFFF==0)=decide (bа%2^32=0) by rw[<- e,ϗ,beq_iff_eq,decide_eq_true_iff,<- ο,Ϡ]] split_ifs<;>simp_all[mM] lemma kG (d b:Д): (if b==0 then d else d ||| 1)а= lF (dа*2^64+bа) 64:=by have i:=b.toNat_lt;have e:(dа*2^64+bа)/2^64=dа:=А;have g:(dа*2^64+bа)%2^64=bа:=А;unfold lF;simp only[e,g];by_cases h:bа=0<;>simp[h,mM,<- ο] lemma e8 (s:т) (q B J:Д) (M:н) (d:qа=lF M Jа) (hB:Bа<=442) (g:Jа<=64) (b:2^(J.toNat+25)<= M): aX s q (B+J)=toWord (Model.roundDyadic Fmt ⟨s,M,(B.toNat:о)-298⟩):=by have e:(B+J)а=Bа+Jа:=by rw[η];simp;omega rw[cM _ _ _ А,d,e,<- dI s M _ Jа ((nF (Nat.pos_iff_ne_zero.1 (lt_of_lt_of_le В b))).2 b)] congr 3;push_cast;ring lemma dc (b d B:Д) (h:af b d B<0x100000000): ae b d≠0/\Bа<=442 /\ (af b d B).toUInt32= toWord (Model.roundDyadic Fmt (ofIntDyadic (ae b d) ((B.toNat:о)-298))):=by obtain ⟨i,j⟩:=iG b d;have v:=d.toNat_lt;have u:=b.toNat_lt;unfold af at h⊢;by_cases o:(b==0&&d==0)=true .simp[o] at h .simp only[o,Α,ite_false] at h⊢ have t:ae b d≠0:=λg=>o (by rw[cU] at g;simp only[Ε,beq_iff_eq,<- ο,Ϡ];split at g<;>omega) by_cases hB:B>442 .simp[hB] at h .simp only[hB,ite_false] at h⊢ have e:Bа<=442:=by simpa[θ] using hB refine ⟨t,e,?_⟩;unfold ofIntDyadic;rw[j,i];have r:=ξ (bA b d) 32;simp only[ζ] at r;split .rename_i g rw[(by simpa using congrArg l6 (beq_iff_eq.mp g):(bA b d).toNat=0),ϫ,Κ, toUInt32_toUInt64,cM _ _ _ А] .rename_i g have q:(bA b d)а≠0:=λh1=>g (by simp[<- ο,h1]) split .rename_i h1 have l:(bA b d)а<2^32:=by have:=congrArg l6 (beq_iff_eq.mp h1);simp at this r;omega rw[toUInt32_toUInt64];exact e8 _ _ _ 32 _ (kF _ _ l) e Б (by simp;omega) .rename_i h1 have p:2^32<=(bA b d)а:=by by_contra h3;apply h1;simp[<- ο];simp at r;omega rw[toUInt32_toUInt64];exact e8 _ _ _ 64 _ (kG _ _) e Б (by simp;omega) lemma aR (n:н) (d e:н-> lI) (i j B:Д) (g:gO n d e) (b:aN n d e=ae i j*2^B.toNat) (h:af i j B<0x100000000):dotOf n d e=(af i j B).toUInt32:=by obtain ⟨p,hB,o⟩:=dc i j B h;have l:aN n d e≠0:=by rw[b];exact mul_ne_zero p В rw[fx n d e g l,o];refine mE _ _ _ _ l ?_;rw[toRat_ofIntDyadic,b];push_cast;rw[zpow_sub₀ two_ne_zero,zpow_natCast];field_simp @[inline] def aT (N:Д):Д:=(N+(0x3FFFFFFFFF:Д)+((N>>>39)&&&1))>>>39 @[inline] def aZ (lb v B:Д):Д:= let m:=aS v v let L:=aV m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then ((v>>>63)<<<31)+((E<<<23)+aT (m<<<(62-L))) else 0x100000000 @[inline] def cZ (hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63) then aZ 1 lo B else 0x100000000 if r=0x100000000 then af hi lo B else r lemma jq (n:т) (e f:Е): (eZ n e f)в=(if n then 2^31 else 0)+eв%2^8*2^23+fв%2^23:=by have h3:=Λ fв (show 0<2^23 by omega) have d:=Λ eв (show 0<2^8 by omega) have h1:((e&&&0xff)<<<23)в=2^23*(eв%2^8):=by rw[my,Χ,show (0xff:Е)в=2^8-1 from rfl, ν,κ,ϓ] exact ε (by simp;omega) have b:((e&&&0xff)<<<23 ||| (f&&&0x007fffff))в=2^23*(eв%2^8)+fв%2^23:=by rw[nw,h1,Χ,show (0x007fffff:Е)в=2^23-1 from rfl, ν,<- ώ h3] unfold eZ;rw[UInt32.or_assoc];cases n .simp only[Α,ite_false,UInt32.zero_or,b];omega .simp only[ite_true,nw,b] rw[show (0x80000000:Е)в=2^31*1 from rfl,<- ώ А];omega lemma g2 (n:т) (N e:Д) (h1:2^62<= Nа) (h2:Nа<2^63) (q:110<= eа) (p:eа<363): (aX n N e)в=(if n then 2^31 else 0)+((eа-110)*2^23+(aT N)а) /\ 2^23<=(aT N)а/\(aT N)а<=2^24:=by have h:(N>>>39)а=Nа/2^39:=by simp[ζ] have hb:((N>>>39)&&&1)а=Nа/2^39%2:=by simp[h,Nat.and_one_is_mod] have i:(aT N)а=Nа/2^39+if 2^38omega have b:2^23<= Nа/2^39/\Nа/2^39<2^24:=by clear*-h1 h2;omega have d:2^23<=(aT N)а/\(aT N)а<=2^24:=by rw[i];clear*-b;split<;>omega have g:(bJ N (62-23))а=(aT N)а:=by have ha:(N&&&0x7FFFFFFFFF)а=Nа%2^39:=by rw[ϛ];exact ν _ 39 rw[i];show (fe N 39)а=_;unfold fe simp only[show ((1:Д)<<<39)-1=0x7FFFFFFFFF from rfl,show (1:Д)<<<(39-1)=0x4000000000 from rfl,gt_iff_lt,θ,η,ha,hb,h,apply_ite l6,lC] clear*-b;split_ifs<;>omega have j:aV N=62:=by rw[a6];apply ο.mp;rw[show N.log2а=Nаз from rfl,mN А];simp;omega refine ⟨?_,d⟩;unfold aX;have l:(N==0)=false:=by simp[<- ο];omega simp only[j,l,show ¬62+e<172 by simp[θ];omega,show ¬(62:Д)<23 by decide, ite_false,Α] generalize bJ N (62-23)=R at g⊢;have o:2^23<= Rа/\Rа<=2^24:=by rw[g];exact d rw[<- g];clear h hb i g j h1 h2 b d cases n<;>split_ifs<;>simp (disch:=first | omega | (simp[γ];omega)) only[beq_iff_eq, <- ο,gt_iff_lt,θ,jq,eT,ϐ, ϭ,η,lC,ε,μ,ite_true, ite_false,Α,not_true_eq_false] at*<;>omega lemma e9 (n:т) (M σ:Д) (d:M.toNat≠0) (b:σ.toNat<=506): aX n M σ=finishWord ((if n then-(M.toNat:о) else M.toNat)*2^σ.toNat) (-298) false:=by rw[cM _ _ _ b];refine (finishWord_of_ne _ _ _ _ (mul_ne_zero (by split<;>omega) В) ?_).symm cases n<;>simp[FloatLib.Numerics.Dyadic.toRat,FloatLib.Numerics.Dyadic.signedSignificand,zpow_sub₀]<;>field_simp lemma gu (v:Д):(v>>>63=0/\vа<2^63)\/(v>>>63=1/\2^63<= vа):=by have:=v.toNat_lt;simp only[<- ο,ξ];simp[ζ];omega lemma ce (j v B:Д) (p:1<= jа) (b:jа<=2^63) (h:aZ j v B≠0x100000000): jа<=(aS v v)а/\(aS v v)а<2^63/\110<= Bа/\Bа<=424 /\ aZ j v B=(aX (v>>>63!=0) (aS v v) B)и:=by unfold aZ at h⊢;dsimp only at h⊢;split at h .rename_i D rw[if_pos D];obtain ⟨E,o⟩:=D;generalize aS v v=m at E o⊢ have g:jа<= mа/\mа<2^63:=by have:=m.toNat_lt;simp[θ,τ] at E;omega have i:mа≠0:=А;have p:(aV m)а=mаз:=by rw[a6];rfl have q:=ϥ i;have b:=@Ϧ mа;have z:=(ϱ i).2 g.2;generalize aV m=L at p o⊢;generalize mаз=l at p q b z have u:(L+B-172)а=l+Bа-172/\172<= l+Bа/\l+Bа<425:=by rw[θ] at o;simp only[τ,η,p] at o⊢;have:=B.toNat_lt;simp at o⊢;omega refine ⟨g.1,g.2,by omega,by omega,?_⟩ have A:(62-L)а=62-l:=by simp[τ,p];omega have y:mа*2^(62-l)<2^63:= lt_of_lt_of_le (ψ b В) (by rw[<- pow_add];exact υ Г А) have t:(m<<<(62-L))а=mа*2^(62-l):=by rw[ς,A,κ,ε (by omega:62-l<64),ε А] have w:2^62<= mа*2^(62-l):= le_trans (le_of_eq (by rw[<- pow_add];congr 1;omega)) (χ _ q) have r:(B-(62-L))а=Bа-(62-l):=by rw[μ _ _ (by rw[γ,A];omega),A] obtain ⟨I,J,K⟩:=g2 (v>>>63!=0) (m<<<(62-L)) (B-(62-L)) (t ▸ w) (t ▸ y) (by rw[r];omega) (by rw[r];omega) rw[<- ο,Ι] have F:aX (v>>>63!=0) m B=aX (v>>>63!=0) (m<<<(62-L)) (B-(62-L)):=by rw[e9 _ m B i А,e9 _ (m<<<(62-L)) (B-(62-L)) (by rw[t];positivity) (by rw[r];omega),t,r];congr 1 obtain ⟨d,H⟩:∃d,Bа=62-l+d:=⟨Bа-(62-l),by omega⟩ rw[H,mj];push_cast;split<;>ring rw[F,I,r] have G:((v>>>63)<<<31)а=(if (v>>>63!=0) then 2^31 else 0):=by rcases gu v with ⟨e,-⟩ | ⟨e,-⟩<;>rw[e]<;>rfl have hX:((L+B-172)<<<23)а=(l+Bа-172)*2^23:=by rw[ς,u.1];simp only[lC,lM,κ];exact ε А rw[η,η,G,hX];split<;>omega .exact absurd rfl h lemma iv (b v B:Д) (j:1<= bа) (g:bа<=2^63) (h:aZ b v B≠0x100000000): aZ b v B=af ((0:Д)-(v>>>63)) v B:=by obtain ⟨h1,-,-,hB,e⟩:=ce b v B j g h;rw[e];have i:v≠0:=by rintro rfl;exact absurd h1 (by show ¬bа<=0;omega) have d:¬B>442:=by simp[θ];omega symm;unfold af bA aS;rcases gu v with ⟨e,-⟩ | ⟨e,-⟩ .simp[e,i,d] .rw[e,show (0:Д)-1=18446744073709551615 from rfl] simp[i,d,show (18446744073709551615:Д)>>>63=1 from rfl, show ~~~(18446744073709551615:Д)=0 from rfl] lemma dC (e b B:Д):cZ e b B=af e b B:=by unfold cZ;dsimp only;by_cases d:e=(0:Д)-(b>>>63) .rw[if_pos d];split .rfl .rename_i h;rw[d];exact iv 1 b B Б Б h .rw[if_neg d,if_pos rfl] lemma iF (n:н):n ||| 1=n/2*2+1:=by have h2:n%2 ||| 1=1:=by rcases mT n with h | h<;>rw[h]<;>rfl have b:n=2^1*(n/2) ||| n%2:=by rw[<- ώ (Λ n Б)];omega conv_lhs=>rw[b] rw[Nat.or_assoc,h2,<- ώ (by decide:1<2^1)];omega lemma jZ (T:Д) (J r:н) (p:Prop) [Decidable p] (v:r<2^J) (w:p↔r=0): (aS (T ||| (if p then 0 else 1)) (T ||| (if p then 0 else 1)))а= lF (ab T*2^J+r).natAbs J /\ ((T ||| (if p then 0 else 1))>>>63!=0)=decide (ab T*2^J+r<0):=by have A:=T.toNat_lt;have l:=Ϙ J have i:∀q s,s<2^J->(s+q*2^J)/2^J=q/\(s+q*2^J)%2^J=s:=λq s j=> ⟨by rw[ϑ _ _ l,ϕ j,Κ], by rw[ϊ,ε j]⟩ have b:(T ||| (if p then 0 else 1))а=if r=0 then Tа else Tа/2*2+1:=by rw[mM];by_cases d:r=0<;>simp[d,w,iF] have o:ab T=if Tа<2^63 then (Tа:о) else-((2^64-Tа:н):о):=by unfold ab;rw[Ξ];have e:T.toBitVec.toNat=Tа:=rfl;split<;>split<;>omega generalize T ||| (if p then 0 else 1)=x at b⊢;unfold aS lF;dsimp only;rw[fW,o,show (2:о)^J=((2^J:н):о) by push_cast;rfl] generalize 2^J=P at v l i⊢;by_cases t:Tа<2^63 .obtain ⟨g,h⟩:=i Tа r v rw[if_pos t,show ((Tа:о)*P+r).natAbs=r+Tа*P by omega,g,h] simp only[show ¬2^63<= xа by split at b<;>omega,decide_false,Α,ite_false, show ¬(Tа:о)*P+r<0 from not_lt.2 В,and_true] rw[b];by_cases d:r=0<;>simp[d,iF] .rw[if_neg t,neg_mul] generalize y:2^64-Tа=u have j:((0:Д)-x)а=2^64-xа:=by rw[τ];have:=x.toNat_lt;simp;split at b<;>omega have z:(u-1)*P+P=u*P:=by rw[<- ϲ,Nat.succ_eq_add_one,Nat.sub_add_cancel А] simp only[show 2^63<= xа by split at b<;>omega,decide_true,ite_true,j] refine ⟨?_,by simp;omega⟩ by_cases d:r=0 .subst d;obtain ⟨g,h⟩:=i u 0 l rw[show (-((u:о)*P)+((0:н):о)).natAbs=0+u*P by omega,g,h] simp at b⊢;omega .obtain ⟨g,h⟩:=i (u-1) (P-r) А rw[show (-((u:о)*P)+r).natAbs=P-r+(u-1)*P by omega,g,h] simp only[d,ite_false,show (P-r==0)=false by simp;omega,Α,iF] at b⊢ omega lemma gN (d e B:Д) (j:ae d e≠0) (hB:Bа<=442):af d e B<0x100000000:=by have i:(d==0&&e==0)=false:=by rw[Bool.eq_false_iff];intro h;simp only[Ε,beq_iff_eq] at h;exact j (by rw[h.1,h.2];rfl) have b:¬B>442:=by simp[θ];omega have g:∀w:Е,wи<0x100000000:=λw=>by rw[θ,Ι];exact w.toNat_lt unfold af;simp only[i,b,Α,ite_false];split_ifs<;>exact g _ lemma ea (x B J H L:Д) (l:Jа<=64) (g:(aS x x)а=lF (ae H L).natAbs Jа /\ (x>>>63!=0)=decide (ae H L<0)) (h:aZ 0x2000000 x (B+J)≠0x100000000): aZ 0x2000000 x (B+J)=af H L B:=by obtain ⟨h1,-,h3,q,e⟩:=ce _ x (B+J) Б Б h have j:(B+J)а=Bа+Jа:=by rw[η] at h3⊢;have:=B.toNat_lt;simp at h3⊢;omega have hB:Bа<=442:=А have d:2^(Jа+25)<=(ae H L).natAbs:=by have e:=FloatLib.Numerics.shiftRightJam_div_pow (ae H L).natAbs Jа 25 Б;rw[<- g.1] at e;simp at h1;exact (Nat.one_le_div_iff (Ϙ _)).1 (e ▸ (Nat.one_le_div_iff Б).2 h1) have o:ae H L≠0:=by intro i;rw[i] at d;simp at d rw[e,e8 _ _ _ _ _ g.1 hB l d];have b:=gN H L B o hB;obtain ⟨-,-,p⟩:=dc H L B b rw[show af H L B=(af H L B)жи by apply ο.mp;simp[θ] at b⊢;omega,p,g.2] rfl lemma dD (T B J H L:Д) (r:н) (p:Prop) [Decidable p] (b:Jа<=64) (g:r<2^Jа) (e:p↔r=0) (d:ae H L=ab T*2^Jа+r) (h:aZ 0x2000000 (T ||| if p then 0 else 1) (B+J)≠0x100000000): aZ 0x2000000 (T ||| if p then 0 else 1) (B+J)=af H L B:= ea (T ||| if p then 0 else 1) B J H L b (by rw[d];exact jZ T Jа r p g e) h end Core open Core lemma gy (w:lI):nn (n4 w)=w:=by apply Β.mp;simp only[nn,n4,Model.toNatBits,ofUInt32_bits,ϭ];exact ε w.toBitVec.isLt lemma gp (z:Model Fmt):ofW (toWord z)=z:=by have h:z.toNatBits<2^32:=Model.toNatBits_lt_two_pow z;simp only[n4,nn,Model.ofUInt32,ϭ,ε h];exact Model.ofNatBits_toNatBits z namespace Dense lemma an {k n:с} (h:ksplit<;>push_cast<;>omega @[inline] def ao (x:Е):Д:=x.toInt32.toInt64.toUInt64 def ai (x:Е):о:=x.toBitVec.toInt lemma aC (x:Е):ab (ao x)=ai x:=by unfold ao ab ai;show (x.toBitVec.signExtend 64).toInt=_;rw[BitVec.toInt_signExtend_of_le А] lemma bK (x:Е):ai x=(xв:о)-(if 2^31<= xв then 2^32 else 0):=by unfold ai;rw[Ξ,nB];split<;>split<;>push_cast<;>omega lemma cN (x:Е): |ai x| <= 2^31:=by have:=x.toNat_lt;rw[bK,abs_le];split<;>omega lemma bM (v:Д) (h: |ab v| <2^31):ai vж=ab v:=by have:=v.toNat_lt;rw[abs_lt,aG] at h;rw[bK,aG,show vжв=vа%2^32 by simp];split_ifs at h⊢<;>omega lemma bN (a b:Д) (h: |ab a*ab b| <2^63): ab (a*b)=ab a*ab b:=by unfold ab at*;show (a.toBitVec*b.toBitVec).toInt=_;rw[BitVec.toInt_mul];rw[abs_lt] at h;apply m5<;>push_cast<;>omega def nv (hi lo:Д):о:=(hiа:о)*2^64+loа @[inline] def aQ (hi lo p:Д):Д:= hi+((0:Д)-(p>>>63))+(if lo+psimp_all only[θ,η]<;>simp<;>omega lemma kg (p:Д):((0:Д)-(p>>>63))а=if 2^63<= pа then 2^64-1 else 0:=by have:=p.toNat_lt;rw[τ,ξ];simp[ζ];split<;>omega lemma gW (d b p:Д): nv (aQ d b p) (b+p)%2^128=(nv d b+ab p)%2^128:=by rw[ka _ _ _ _ (by unfold aQ;simp only[η,nx,cy];rfl) (η _ _), kg,aG] unfold nv;split_ifs .exact Int.modEq_iff_dvd.mpr ⟨-1,by push_cast;omega⟩ .exact Int.modEq_iff_dvd.mpr ⟨0,by push_cast;omega⟩ lemma js (d b:Д): nv ((d<<<8)+(b>>>56)) (b<<<8)%2^128=nv d b*256%2^128:=by have:=b.toNat_lt;have:=d.toNat_lt unfold nv;simp only[η,ς,ξ,lC, lM,κ,ζ] push_cast;omega lemma fu (b d:Д) (S:о) (h:nv b d%2^128=S%2^128) (h1: |S| <2^127):ae b d=S:=by have:=b.toNat_lt;have:=d.toNat_lt;rw[cU];unfold nv at h;rw[abs_lt] at h1;split<;>omega @[inline] def ak (x:Е):Е:=x&&&0x7FFFFFFF lemma bk (x:Е):(ak x)в=xв%2^31:=by unfold ak;rw[Χ];exact ν _ 31 lemma bn (x:Е):(lH x)в=(ak x)в/2^23:=by have:(lH x)в=xв/2^23%2^8:=by unfold expOf;rw[Χ,ϟ];simp only[UInt32.reduceToNat,Nat.reduceMod,ζ];exact ν _ 8 rw[this,bk,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] lemma gh (x:Е):lH x=0↔(ak x)в<2^23:=by rw[<- Β,bn];simp;try omega lemma jY (x:Е):lE x=(ak x)в/2^23-1:=by have:=bn x;unfold lE;split<;>rename_i h .have:=(gh x).mp h;omega .have:=mt (gh x).mpr h;omega lemma dR (x:Е):lE x=(lH x)в-1:=by rw[jY,bn] lemma gC (w:Е):wв/2^23=(lH w)в+256*(wв/2^31):=by rw[bn,bk];have:=w.toNat_lt;omega lemma jU (x:Е):(lH x)в<256:=by rw[bn,bk];omega lemma jV (x:Е) (h:(ak x)в<0x7F800000):lH x≠255:=by intro e;have:=bn x;rw[e] at this;simp at this;omega lemma iz (w:Е):(w&&&0x7FFFFF)в=wв%2^23:=by rw[Χ];exact ν _ 23 lemma dL (x:Е) (h:ak x=0):sv x=0:=by have h1:=bk x;rw[h] at h1;have:lH x=0:=(gh x).mpr (by rw[h];simp) unfold sv lK l8;simp only[this,if_true,iz];simp at h1;simp;omega lemma dM (w:Е): |sv w| <2^24:=by have:=lT w;unfold sv;split<;>simp<;>omega @[inline] def gE (top:Д) (x:Е):Д:=(top-Core.iW x)>>>3 @[inline] def dv (top:Д) (x:Е):Е:= (Core.sW x*(1<<<(7-((top-Core.iW x)&&&7))))ж lemma km (b:Д) (x:Е) (h:lE x<= bа): (b-iW x)а=bа-lE x:=by rw[μ _ _ (by rw[γ,ap];exact h),ap] lemma dg (b:Д) (x:Е) (h:lE x<= bа): (gE b x)а=(bа-lE x)/8:=by unfold gE;rw[ξ,km b x h];simp[ζ] lemma iP (b:Д) (x:Е) (h:lE x<= bа): ai (dv b x)=sv x*2^(7-(bа-lE x)%8):=by have ha:((b-iW x)&&&7)а=(bа-lE x)%8:=by rw[ϛ,km b x h];exact ν _ 3 set r:=7-(bа-lE x)%8 have g:(7-((b-iW x)&&&7))а=r:=by rw[μ _ _ (by rw[γ,ha];simp;omega),ha];rfl have i:(2:н)^r<=2^7:=υ Г А have e:ab (1<<<(7-((b-iW x)&&&7)):Д)=2^r:=by rw[aG,ς,g,UInt64.toNat_one,ε (a:=r) А, κ,one_mul,ε А,if_neg А];simp have hb: |sv x*2^r| <2^31:=by rw[abs_mul,abs_pow,abs_two];have:(2:о)^r<=2^7:=by exact_mod_cast i have:=mul_le_mul_of_nonneg_left this (abs_nonneg (sv x));have:=dM x;omega have d:ab (sW x*(1<<<(7-((b-iW x)&&&7))))=sv x*2^r:=by rw[bN,bg,e];rw[bg,e];omega unfold dv;rw[bM _ (by rw[d];exact hb),d] def a7 (k:н):Е:= if 256<= k/\k<264 then UInt32.ofNat (2^(k-256)) else if 512<= k/\k<520 then UInt32.ofNat (2^32-2^(k-512)) else 0 @[irreducible] def c5 (n:н):п Е:=Array.ofFn (n:=n) λk=>a7 kй @[irreducible] def bI:п Е:=c5 768 lemma ef:bI=c5 768:=by unfold bI;rfl lemma fD:bIг=768:=by rw[ef];unfold c5;exact ϡ lemma de (i:с) (h:iбa7 kй) (h:iб>>23)м+c)б=wв/2^23+cб:=by have e:(w>>>23)в=wв/2^23:=by rw[ϟ];simp[ζ] have:=w.toNat_lt;have:=Ο;rw[br (by rw[ax,e];omega),ax,e] @[inline] def i7 (c:с) (w:Е) (hc:cб<256):Е:= bI.uget ((w>>>23)м+c) (by rw[iL w c hc,fD];have:=w.toNat_lt;omega) @[inline] def aP (c:с) (w:Е) (hc:cб<256):Д:= ((w&&&0x7FFFFF)+0x800000)и*ao (i7 c w hc) lemma dH (k d:н) (b:d<8): (k=256+d-> ai (a7 k)=2^d)/\(k=512+d-> ai (a7 k)=-2^d):=by have:2^d<2^8:=ϻ Г b;have:1<=2^d:=md;constructor<;>intro hk<;>subst hk<;>unfold a7 .rw[if_pos А,show 256+d-256=d by omega,bK,ϭ, ε А,if_neg А];push_cast;ring .rw[if_neg А,if_pos А,show 512+d-512=d by omega,bK, ϭ,ε А,if_pos А,no А] push_cast;ring lemma dW (c:с) (w:Е) (b:cб<256) (q:о) (e:ai (a7 (wв/2^23+cб))=q) (hb: |q| <= 128): ab (aP c w b)=(wв%2^23+2^23:н)*q:=by have d:ab ((w&&&0x7FFFFF)+0x800000)и=(wв%2^23+2^23:н):=by have:((w&&&0x7FFFFF)+0x800000)иа=wв%2^23+2^23:=by rw[Ι,ϯ,iz,show (0x800000:Е)в=2^23 from rfl];have:=w.toNat_lt;omega rw[aG,this];split<;>omega unfold aP i7;rw[de,iL w c b,bN,aC,d,e];rw[aC,d,e,abs_mul,abs_of_nonneg В];have:((wв%2^23+2^23:н):о)<2^24:=by push_cast;omega nlinarith def bt (K eb:н) (w:Е):Prop:= ak w=0\/(eb<=(expOf w)в/\(expOf w)в<= eb+K) lemma bc (c:с) (w:Е) (h:cб<256) (eb:н) (e:cб=256-eb) (h1:1<= eb) (h2:eb<=248) (z:bt 7 eb w): ab (aP c w h)*2^(eb-1)=sv w*2^lE w /\ |ab (aP c w h)| <2^31:=by have t:=w.toNat_lt;have A:=bn w;have ha:=bk w;have y:=dR w;have j:lV w=true↔2^31<= wв:=a5 w;rcases z with u | ⟨b,o⟩ .rw[dW c w h 0 (by rw[e,gC,show (lH w)в=0 by rw[bn,u];rfl];clear*-h1 h2 t unfold a7;rw[if_neg А,if_neg А];rfl) Г,dL w u];simp set d:=(lH w)в-eb;have r:d<8:=by clear*-b o;omega have i:lE w=d+(eb-1):=by rw[y];exact (Nat.sub_add_sub_cancel b h1).symm have g:lK w=2^23+wв%2^23:=by unfold lK l8;rw[if_neg (mt (gh w).mp А),iz] have q:(2:о)^d<=2^7:=pow_le_pow_right₀ Г А;have v:((wв%2^23+2^23:н):о)<2^24:=by clear*-;push_cast;omega have hb:((wв%2^23+2^23:н):о)*2^d<2^31:=by have:=mul_le_mul_of_nonneg_left q (Int.natCast_nonneg (wв%2^23+2^23));clear*-this v;omega have p: |(2:о)^d| <= 128:=by rw[abs_of_pos В];exact q unfold sv;rw[g,i,pow_add];by_cases l:lV w=true .rw[dW c w h _ ((dH _ d r).2 (by rw[e,gC];have:=j.mp l;clear*-b h2 t this;omega)) (by rwa[abs_neg]), if_pos l] refine ⟨by push_cast;ring,?_⟩ rw[mul_neg,abs_neg,abs_of_nonneg В];exact hb .rw[dW c w h _ ((dH _ d r).1 (by rw[e,gC];have:=mt j.mpr l;clear*-b h2 this;omega)) p,if_neg l] refine ⟨by push_cast;ring,?_⟩ rw[abs_of_nonneg В];exact hb @[inline] def bT (a b:Е):Е:=if a>b then a else b @[inline] def bU (a b:Е):Е:=if arename_i h<;>simp only[gt_iff_lt,Μ] at h<;>omega lemma fs (a b:Е):(bU a b).toNat=min a.toNat b.toNat:=by unfold bU;split<;>rename_i h<;>simp only[Μ] at h<;>omega def Sc (M L:н) (v:Е):Prop:=vв<= M/\L<=(v-1)в lemma k6 {M L d b:н} {v:Е} (h:Sc M L v) (h1:M<= d:=by simp only[max_le_iff];simp only[le_max_iff,le_refl,true_or,or_true,and_self]) (h2:b<= L:=by simp only[le_min_iff];simp only[min_le_iff,le_refl,true_or,or_true,and_self]):Sc d b v:=⟨h.1.trans h1,h2.trans h.2⟩ lemma u4 {k n:с} (hk:kб<= nб) (b:nб<2^30): (k+1)б=kб+1/\(k+2)б=kб+2/\(k+3)б=kб+3 /\ (k+4)б=kб+4:=by have:=Ο;have:=mC;refine ⟨?_,?_,?_,?_⟩<;>rw[Υ]<;>simp<;>rw[ε А] lemma ci (X:п Е) (b s n t:с) (hb:bб+(nб-1)*sб>>32)ж,qж) lemma kP (a b:Е):up (aи*0x100000000+bи)=(a,b):=by have:=a.toNat_lt;have:=b.toNat_lt;simp[up,<- Β,ζ];omega def dr (hn:nб<2^30) (k:с) (hk:kб<= nб) (m0 m1 m2 m3 l0 l1 l2 l3:Е):Д:= if h:k+4<= n then have e:=u4 hk hn have h4:kб+4<= nб:=by rw[<- e.2.2.2];exact USize.le_iff_toNat_le.mp h let v0:=rx X xo s n hb hs k (by clear*-h4;omega) let v1:=rx X xo s n hb hs (k+1) (by clear*-e h4;omega) let v2:=rx X xo s n hb hs (k+2) (by clear*-e h4;omega) let v3:=rx X xo s n hb hs (k+3) (by clear*-e h4;omega) dr hn (k+4) (by rw[e.2.2.2];exact h4) (bT v0 m0) (bT v1 m1) (bT v2 m2) (bT v3 m3) (bU (v0-1) l0) (bU (v1-1) l1) (bU (v2-1) l2) (bU (v3-1) l3) else if h1:k Е) (r:∀t,t ak X[xoб+t*sб]! =z t) (I:∀tby rw[e] at h;exact absurd h Б lemma lc (v:Е) (h:v+1≠0):(v+1).toNat=v.toNat+1:=by have:v.toNat≠2^32-1:=λe=>h (Β.mp (by rw[ϯ,e];rfl)) rw[ϯ,UInt32.toNat_one];have:=v.toNat_lt;omega lemma k5 {M L:Е} {x:Е} (h:Sc Mв Lв (ak x)) (p:M<0x7F800000): (lH x)в<=(lH M)в/\(lH M)в<255 /\ (ak x≠0-> L+1≠0->(lH (L+1))в<=(lH x)в):=by have h1:=bn x;have h2:=bn M;have h3:=bk M;have i:=lj (ak x);have j:=(ak x).toNat_lt;have l:=Μ.mp p;rw[show (0x7F800000:Е)в=2139095040 from rfl] at l;unfold Sc at h;refine ⟨by omega,by omega,λg o=>?_⟩ have b:=lc L o;rw[bn,bk,h1];refine Nat.div_le_div_right ((Nat.mod_le _ _).trans ?_);have d:(ak x).toNat≠0:=λe=>g (Β.mp (by rw[e];rfl)) clear*-h i j b d;omega @[inline] def eV (top b:Д) (x:Е):т:=ak x !=0&&gE top x==b def aK (top b:Д) (k:с) (gi gx:п Е): п Е×п Е:= if hk:k о):о:= ∑m∈Finset.range giг,ai gx[m]!*rv gi[m]!в def bS (xf:н-> Е) (top b:Д) (rv:н-> о) (k n:н):о:= ∑t∈Finset.Ico k n,if eV top b (xf t) then ai (dv top (xf t))*rv t else 0 lemma jX (a:п Е) (v:Е) (m:н):(a.push v)[m]! =if m=aг then v else a[m]!:=by rw[getElem!_def,getElem!_def,Array.getElem?_push];by_cases h:m=aг<;>simp[h] lemma kJ (b d:п Е) (h:dг=bг) (a c:Е) (e:н-> о): tS (b.push a) (d.push c) e=tS b d e+ai c*e aв:=by unfold tS;rw[Array.size_push,Η];simp only[jX,h,if_true];congr 1;exact Ζ rfl λm g=>by simp[(Ϗ.mp g).ne] lemma co (z:nб<2^30) (d b:Д) (k:с) (g i:п Е) (j:iг=gг) (hk:gг<= kб) (v:kб<= nб) (u:∀m,m g[m]!в (aK X xo s n hb hs d b k g i).1[m]!вX[xoб+t*sб]!) d b l kб nб:=by fun_induction aK .rename_i k g i h x o p have e:=an h;have h2:=ι.mp h;have y:k.toUInt32в=kб:=by simp;omega rw[e] at p obtain ⟨h1,h3,q,r⟩:=p (by simp[j]) (by simp;omega) А (λm w=>by simp at w;rw[jX];split<;>[omega;exact u m А]) refine ⟨h1,h3,q,λl=>?_⟩ rw[r,kJ g i j,y];unfold bS;rw[Θ h2];simp only[x,gA] at o⊢;rw[if_pos o];ring .rename_i k g i h x o p have e:=an h;have h2:=ι.mp h;rw[e] at p;obtain ⟨h1,h3,q,r⟩:=p j А А u;refine ⟨h1,h3,q,λl=>?_⟩ rw[r];unfold bS;rw[Θ h2];simp only[x,gA] at o⊢;rw[if_neg o];ring .rename_i k g i h have:=USize.lt_iff_toNat_lt.not.mp h;dsimp only;exact ⟨j,by omega,u,λl=>by simp[bS,ϙ (by omega:n.toNat<= k.toNat)]⟩ end @[inline] def sl (a b:Е):т:=a.toInt32rename_i h<;>simp only[decide_eq_true_eq,Μ,not_lt] at h<;>omega lemma kT (a b:Е) (ha:a.toNat<2^31) (hb:b.toNat<2^31):(jM a b).toNat=min a.toNat b.toNat:=by unfold jM;rw[sm a b ha hb];split<;>rename_i h<;>simp only[decide_eq_true_eq,Μ,not_lt] at h<;>omega def fI (W:п Е) (n:с) (hn:nб<= Wг) (k:с) (m l:Е):Е×Е:= if h:kby simp at p) generalize fI W _ _ _ _ _=r at d h⊢;split at h<;>rename_i b swap;. exact absurd rfl h rw[if_pos b];refine ⟨g.2,b.2.2.1,b.2.2.2.2,λi=>?_⟩ by_cases j:iby have:=sp.2.2.1 m hm;rwa[getElem!_pos _ m hm,e] at this⟩ lemma gI (X:п Е) (h s g:с) (hb:hб+(gб-1)*sбX[h.toNat+t*s.toNat]!) d b l 0 n:=by have o:=co X h s g hb j i d b 0 (Array.mkEmpty n) (Array.mkEmpty (n+1)) rfl (by simp) (by simp) (by simp) exact ⟨o.2.1.trans (le_of_eq e),λl=>(o.2.2.2 l).trans (by rw[e];simp[tS])⟩ structure cs (n:н) where top:Д bs:п (dh n) def eC {n:н} (r:cs n) (xf:н-> Е):Prop:= n<2^20/\r.bsг<=6/\r.topа<256 /\ (∀t,t expOf (xf t)≠255/\(ak (xf t)≠0 -> idxOf (xf t)<= r.topа/\(r.topа-idxOf (xf t))/8>>3)+1 if r.1<0x7F800000/\r.2+1≠0/\nb<=6 then ⟨top,(Array.range nbа).map λb=> f9 X xoд sд nд hb h.2.2.2.2 hn n e.2.2 top bе⟩ else ⟨0,#[]⟩ else ⟨0,#[]⟩ lemma iC (x:Е):lE x<256:=by have:=jY x;have:=bk x;have:=x.toNat_lt;omega lemma bm (X:п Е) (d s n:н) (g:0<(aq X d s n).bs.size): eC (aq X d s n) (λt=>X[d+t*s]!):=by unfold aq at g⊢;by_cases h:0ak X[d+t*s]!) (λt _=>by rw[e.1,e.2.1]) (λt v=>by simp at v) generalize up (dr X _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _)=r at i g⊢;split at g<;>rename_i y swap;. simp at g rw[if_pos y];unfold eC;dsimp only;simp only[nG,Array.size_range] at g⊢;obtain ⟨o,p,u⟩:=y;have w:=ap r.1;have hB:=ap (r.2+1);have D:=iC r.1;have E:=iC (r.2+1);have A:=γ.mp u;refine ⟨h.2.1,?_,?_,λt v=>?_,λb B=>?_⟩ .simpa using A .omega .have q:=k5 (i t (by rw[e.2.2];exact v)) o refine ⟨dG (q.1.trans_lt q.2.1),λG=>?_⟩ have j:=nH q.1 1;rw[<- dR,<- dR] at j;have l:=nH (q.2.2 G p) 1;rw[<- dR,<- dR] at l;have F:iW (r.2+1)<= iW r.1:=by rw[γ,w,hB];exact l.trans j rw[η,ξ,μ _ _ F];simp[ζ];rw[w,hB,ε (by clear*-D;omega)] exact ⟨j,Nat.lt_succ_of_le (Nat.div_le_div_right (Nat.sub_le_sub_left l _))⟩ .rw[Array.getElem_map,Array.getElem_range] have q:=gI X dд sд nд hb h.2.2.2.2 z n e.2.2 (iW r.1) (b:н)е exact ⟨by have:=q.1;omega,λH=>by rw[q.2,e.1,e.2.1]⟩ @[inline] def fH (hi lo v d:Д):Д:= hi+((v>>>1)>>>(63-d))+(((0:Д)-(v>>>63))<<>>1)>>>(63-d))а=vа*2^D/2^64:=by have e:(63-d)а=63-D:=by rw[μ _ _ (by rw[γ];simp;omega)];simp;omega simp only[ξ,e,ζ,ϳ];rw[<- o,nC _ _ В,<- pow_add];congr 2;simp;omega have l:(((0:Д)-(v>>>63))<<omega unfold fH eD;rw[ka _ _ _ _ (by simp only[η,nx,cy];rfl) (η _ _)] have h:=Nat.mod_add_div (vа*2^D) (2^64);unfold nv;rw[aG,b,i,j,l,show (2:о)^D=((2^D:н):о) by push_cast;rfl] generalize 2^D=P at* generalize vа*P%2^64=R at*;generalize vа*P/2^64=Q at* have t:(vа:о)*P=R+2^64*Q:=by exact_mod_cast h.symm clear o i j l h r b;simp only[sub_mul,t];split_ifs .exact Int.modEq_iff_dvd.mpr ⟨-1,by push_cast;omega⟩ .exact Int.modEq_iff_dvd.mpr ⟨0,by push_cast;omega⟩ lemma fk (v d:Д) (i:dа<64) (h: |ab v*2^dа| <2^63): ab (v<<push_cast<;>ring⟩ generalize ab v*P=S at h e⊢;generalize vа*P=Q at e⊢;rw[abs_lt] at h;clear*-h e;split_ifs<;>omega structure BI where hi:Д lo:Д ok:т @[inline] def a8 (B:Д) (bw:Е):BI:= if ak bw==0 then ⟨0,0,true⟩ else let d:=Core.iW bw+149-B if ak bw>=0x7F800000 || Core.iW bw+149100 then ⟨0,0,false⟩ else if d<64 then ⟨fH 0 0 (Core.sW bw) d,eD 0 (Core.sW bw) d,true⟩ else ⟨fH 0 0 (Core.sW bw<<<37) (d-37),eD 0 (Core.sW bw<<<37) (d-37),true⟩ lemma f8 (B:Д) (b:Е) (h:(a8 B b).ok=true): lH b≠255 /\ ∃d:н,d<=101/\sv b*2^(lE b+149)=sv b*2^d*2^Bа /\ nv (a8 B b).hi (a8 B b).lo%2^128=sv b*2^d%2^128:=by unfold a8 at h⊢;by_cases o:ak b=0 .rw[if_pos (by simp[o])] refine ⟨dG (by have:=bn b;rw[o] at this;simp at this;omega),0,by norm_num,?_,?_⟩<;> rw[dL b o]<;>simp[nv] rw[if_neg (by simpa using o)] at h⊢ dsimp only at h⊢;split at h<;>rename_i p .simp at h rw[if_neg p];simp only[Ϩ,decide_eq_true_eq,not_or] at p;obtain ⟨⟨i,j⟩,l⟩:=p;have hi:=ap b;have t:=iC b;rw[ge_iff_le,ϴ] at i;rw[θ,η] at j;simp at i j have e:(iW b+149-B)а=lE b+149-Bа:=by rw[μ _ _ (by rw[γ,η];simp;omega), η];simp;omega rw[gt_iff_lt,θ,e] at l;simp at l;refine ⟨jV b А,?_⟩ have r:sv b*2^(lE b+149)=sv b*2^(lE b+149-Bа)*2^Bа:=by rw[mul_assoc,<- pow_add,mV А] split<;>rename_i q<;>rw[θ,e] at q<;>simp at q .exact ⟨_,by omega,r,by rw[ev _ _ _ _ (by rw[e];omega),bg,e];simp[nv]⟩ .have g:(iW b+149-B-37)а=lE b+149-Bа-37:=by rw[μ _ _ (by rw[γ,e];simp;omega),e];rfl have hb: |ab (sW b)*2^(37:Д)а| <2^63:=by rw[bg,abs_mul];norm_num;linarith[dM b] refine ⟨_,by omega,r,?_⟩ rw[ev _ _ _ _ (by rw[g];omega),fk _ 37 Б hb,bg,g,mul_assoc,<- pow_add, show (37:Д)а+(lE b+149-Bа-37)=lE b+149-Bа by simp;omega] simp[nv] @[inline] def k7 (L:Д):Д:=if L&&&0xFFFFFFFF=0 then 0 else 1 def lz (y n:Д):Д:=if y=0 then n else lz (y>>>1) (n+1) termination_by yа decreasing_by have:yа≠0:=λe=>by simp_all[<- ο] rw[ξ];simp[ζ];omega abbrev bl (k:н):н:=if k=0 then 0 else kз+1 lemma iT (y:Д):bl yа<=64:=by unfold bl;split;. omega rename_i h;have:=(ϱ h).mpr y.toNat_lt;omega lemma gv (y:Д):(y>>>1)а=yа/2:=by rw[ξ];simp[ζ] lemma fJ (k:н):bl (k/2)=kз:=by unfold bl;rw[Nat.log2_def k];by_cases h2:2<= k .rw[if_neg А,if_pos h2] .rw[if_pos А,if_neg h2] lemma dU (y n:Д) (h:nа+bl yа<=64):(lz y n)а=nа+bl yа:=by rw[lz];by_cases b:y=0 .rw[if_pos b];subst b;simp .rw[if_neg b] have d:yа≠0:=λe=>b (ο.mp (by simpa using e)) have hb:bl yа=bl (yа/2)+1:=by rw[fJ];simp[bl,d] have g:(n+1)а=nа+1:=by rw[η];simp;omega rw[dU (y>>>1) (n+1) (by rw[g,gv];omega),g,gv];omega termination_by yа decreasing_by rw[gv];omega @[inline] def lg (x:Д):Д:=lz (x>>>1) 0 lemma kH (x:Д):lg x=x.log2:=by apply ο.mp;rw[lg,dU _ _ (by have:=iT (x>>>1);simpa using this),gv,fJ,Ϡ,Κ];rfl @[inline] def cx (lb v B:Д):Д:= let m:=Core.aS v v let L:=lg m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then ((v>>>63)<<<31)+((E<<<23)+Core.aT (m<<<(62-L))) else 0x100000000 lemma cB:cx=aZ:=by funext b v B;simp only[cx,aZ,a6,kH] @[inline] def cd (hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63) then cx 1 lo B else 0x100000000 if r=0x100000000 then Core.af hi lo B else r lemma c9:cd=cZ:=by funext b d B;simp only[cd,cZ,cB] @[noinline] def iy (H L B:Д):Д:= if H=(0:Д)-(L>>>63) then cd H L B else if H+0x80000000<0x100000000 then let r:=cx 0x2000000 ((H<<<32+L>>>32) ||| k7 L) (B+32) if r=0x100000000 then Core.af H L B else r else Core.af H L B lemma jl:iy=af:=by funext H L B;unfold iy;dsimp only;simp only[cB];split<;>rename_i l .rw[c9];exact dC H L B split<;>rename_i d swap;. rfl split<;>rename_i g .rfl have j:=L.toNat_lt;have e:=H.toNat_lt;rw[θ,η] at d;simp only[lC] at d have b:(L&&&0xFFFFFFFF)а=Lа%2^32:=by rw[ϛ];exact ν _ 32 have i:ae H L=ab (H<<<32+L>>>32)*2^32+(L&&&0xFFFFFFFF)а:=by unfold ae ab rw[b,Ξ,Ξ,Ϲ,Ϲ, η,ς,ξ] simp only[κ,ζ,lC,lM,lO];split<;>split<;>push_cast<;>omega refine ea _ B 32 H L Б ?_ g;rw[i];unfold k7 exact jZ _ 32 _ _ (by rw[b];exact Λ _ Б) ⟨λh=>by rw[h];rfl,λh=>ο.mp (by rw[h];rfl)⟩ @[inline] def iw (lo hi B:Д) (bi:BI):Д:= if bi.ok then iy (hi+bi.hi+(if lo+bi.lorename_i g swap;. exact absurd h Б obtain ⟨j,d,p,o,l⟩:=f8 B b g;rw[if_pos g];refine ⟨j,_,_,d,rfl,p,o,?_⟩;rw[<- Int.add_emod_emod,<- l,Int.add_emod_emod];generalize (a8 B b).hi=q;generalize (a8 B b).lo=r;rw[ka _ _ _ _ (by simp only[η,nx,cy];rfl) (η _ _)] unfold nv;push_cast;ring_nf lemma fj (a b:Д) (h: |ab a+ab b| <2^63): ab (a+b)=ab a+ab b:=by unfold ab at*;show (a.toBitVec+b.toBitVec).toInt=_;rw[BitVec.toInt_add];rw[abs_lt] at h;apply m5<;>push_cast<;>omega lemma ko (x:Е) (w:Д) (v:о) (b:ab w=v) (d: |v| <2^31): ab (ao x*w)=ai x*v /\ |ai x*v| <2^62:=by have:=cN x;have hb: |ai x*v| <2^62:=by rw[abs_mul];nlinarith[abs_nonneg (ai x),abs_nonneg v] exact ⟨by rw[bN _ _ (by rw[aC,b];linarith),aC,b],hb⟩ lemma lk (x y:Е) (w g:Д) (v b:о) (l:ab w=v) (e:ab g=b) (j: |v| <2^31) (d: |b| <2^31): ab (ao x*w+ao y*g)=ai x*v+ai y*b:=by obtain ⟨h,o⟩:=ko x w v l j;obtain ⟨i,p⟩:=ko y g b e d;rw[fj _ _ (by rw[h,i];rw[abs_lt] at*;constructor<;>linarith),h,i] lemma k8 {H L:Д} (h l p:Д) (a S P R:о) (b:ab p=a) (e:nv H L%2^128=((nv (aQ h l p) (l+p)+S)*P+R)%2^128): nv H L%2^128=((nv h l+(a+S))*P+R)%2^128:=by rw[e,<- add_assoc,<- b];exact ((Ϯ _ (gW h l p)).mul_right _).add_right _ lemma aF {k:с} {a:п Е} (h:k tб Д) (bs:п (dh n)) (B:Д) (bw:Е) (b:н) (gi gx:п Е) (hsz:gxг=giг) (hgi:∀m (h:m>>56)) else aJ lo hi B bw termination_by (bsг-b,giг-kб) decreasing_by .refine lW _ ?_;have:=aF hk2;rw[an hk2];rw[an hk] at this⊢;omega .exact lW _ (by rw[an hk];have:=aF hk;omega) .exact m9 _ _ А lemma ep {n:н} (K:(t:с)-> tб Д) (i:п (dh n)) (B:Д) (H:Е) (F G:н-> о) (y:∀t h,ab (K t h)=F tб) (z:∀t,|F t| <2^31) (J:∀c (h:c< iг),i[c].giг<2^20/\tS i[c].gi i[c].gx F=G c) (b:н) (gi gx:п Е) (o:gxг=giг) (l:∀m (h:m.trans (congrArg (.%2^128) (by ring))) .rename_i b gi gx o l k v u d j have h1:=gz (by have:=Ο;omega) d refine ⟨u,v,rfl,?_⟩ rw[ϙ h1,ϙ (by omega:i.size<= b+1), show iг-1-b=0 by omega];simp @[inline] def cK {n:н} (rd:(t:с)-> tб Д) (gi:п Е) (hgi:∀m (h:m tб Д) (bs:п (dh n)) (B:Д) (w0 w1 w2 w3:Е) (b:н) (gi gx:п Е) (hsz:gxг=giг) (hgi:∀m (h:m>>56)) (l1<<<8) ((h1<<<8)+(l1>>>56)) (l2<<<8) ((h2<<<8)+(l2>>>56)) (l3<<<8) ((h3<<<8)+(l3>>>56)) else ⟨aJ l0 h0 B w0,aJ l1 h1 B w1,aJ l2 h2 B w2,aJ l3 h3 B w3⟩ termination_by (bsг-b,giг-kб) decreasing_by .refine lW _ ?_;have:=aF hk2;rw[an hk2];rw[an hk] at this⊢;omega .exact lW _ (by rw[an hk];have:=aF hk;omega) .exact m9 _ _ А lemma eY {n:н} (y z A D:(t:с)-> tб Д) (j:п (dh n)) (B:Д) (E F G H:Е) (b:н) (d i:п Е) (g:iг=dг) (e:∀m (h:maW r j B w b d i g e k l h;⟨f y E p o,f z F q h1,f A G u h2,f D H v h3⟩:=by fun_induction bf<;>(try (rename_i I;rw[I]))<;>(conv_rhs=>unfold aW)<;>dsimp only<;> (repeat (split<;>try contradiction))<;>rfl lemma dK (s:Finset н) (f:н-> о) (K:о) (h:∀i∈s,|f i| <= K): |∑i∈s,f i| <= s.card*K:= (Finset.abs_sum_le_sum_abs _ _).trans ((Finset.sum_le_sum h).trans (by simp)) lemma dl (d:Д) (b:н) (x:Е) (hb:b<8) (e:ak x≠0-> lE x<= dа): eV d bе x=true↔ak x≠0/\(dа-lE x)/8=b:=by unfold eV;simp only[Ε,bne_iff_ne,ne_eq,beq_iff_eq];constructor .rintro ⟨h1,h2⟩;refine ⟨h1,?_⟩;rw[<- dg d x (e h1),h2];simp;omega .rintro ⟨h1,h2⟩;refine ⟨h1,ο.mp ?_⟩;rw[dg d x (e h1),h2];simp;omega lemma dd (d u:н-> Е) (n e:н) (b:Д) (q:н-> о) (r B:н) (v:e<=6) (y:∀t,t ak (d t)≠0 -> lE (d t)<= bа/\(bа-lE (d t))/8 q t*2^r=sv (u t)*2^lE (u t)): (∑c∈lG e,256^(e-1-c)*bS d b cе q 0 n)*2^B= aN n d u:=by unfold bS aN;simp only[nI,ϖ];rw[Finset.sum_comm,<- l9];refine Ζ rfl λt p=>?_ rw[Ϗ] at p;by_cases g:ak (d t)=0 .rw[Finset.sum_eq_zero λc j=>by rw[if_neg (by rw[dl _ _ _ (by simp at j;omega) (λh=>absurd g h)];tauto)];simp] unfold tm;rw[dL _ g];simp obtain ⟨l,i⟩:=y t p g;rw[Finset.sum_eq_single ((bа-lE (d t))/8)] .rw[if_pos ((dl _ _ _ А (λ_=>l)).mpr ⟨g,rfl⟩),iP _ _ l] have:(256:о)^(e-1-(bа-lE (d t))/8)*2^(7-(bа-lE (d t))%8)* 2^B=2^(lE (d t)+r):=by rw[show (256:о)=2^8 by norm_num,<- pow_mul,<- pow_add,<- pow_add];congr 1;omega unfold tm;linear_combination (sv (d t)*2^lE (d t))*o t p+(sv (d t)*q t)*this .intro c j w rw[if_neg (by rw[dl _ _ _ (by simp at j;omega) (λ_=>l)];omega)];simp .intro h;exact absurd (Ϗ.mpr i) h lemma cD (g:н-> Е) (n d:н) (b:Д) (e:н-> о) (i:d<=6) (q:n<2^20) (j:∀t,|e t| <2^31): |∑c∈lG d,256^(d-1-c)*bS g b cе e 0 n| <= 2^125:=by have r:(n:о)<=2^20:=by exact_mod_cast q.le have l:(d:о)<=6:=by exact_mod_cast i have o:∀c:н,|bS g b cе e 0 n| <= 2^20*2^62:=λc=>by refine (dK _ _ (2^62) λt _=>?_).trans (by simp;nlinarith) split .rw[abs_mul];have:=cN (dv b (g t));have:=j t nlinarith[abs_nonneg (ai (dv b (g t))),abs_nonneg (e t)] .simp refine (dK _ _ (2^40*(2^20*2^62)) λc p=>?_).trans (by simp;nlinarith) have h:(256:о)^(d-1-c)<=2^40:=by rw[show (2:о)^40=256^5 by norm_num] exact pow_le_pow_right₀ Г (by simp at p;omega) rw[abs_mul,abs_pow,abs_of_pos (by norm_num:(0:о)<256)] exact mul_le_mul h (o c) (abs_nonneg _) В lemma dQ (p o B:Д) (b:Е) (S T:о) (v: |S| <= 2^125) (w:S*2^Bа=T) (t:nv o p%2^128=S%2^128) (h:aJ p o B b<0x100000000): lH b≠255 /\ ∃e j,aJ p o B b=af e j B /\ T+sv b*2^(lE b+149)=ae e j*2^Bа:=by obtain ⟨q,g,l,d,r,y,u,i⟩:=fy p o B b h have hb: |sv b*2^d| <= 2^24*2^101:=by rw[abs_mul,abs_pow,abs_two];exact mul_le_mul (dM b).le (pow_le_pow_right₀ Г y) В Г refine ⟨q,g,l,r,?_⟩ rw[<- w,u,fu g l (S+sv b*2^d) (i.trans (Ϯ _ t)) (by rw[abs_lt];rw[abs_le] at v hb;constructor<;>linarith)] ring @[inline] def aO {n:н} (rd:(t:с)-> tб Д) (ac:cs n) (wb:н) (bw:Е):Д:= if h:0 tб Д) (b:cs n) (q A:н-> Е) (d:н) (i:н-> о) (l:Е) (P:0 eC b q) (Q:d<2^32) (I:∀t h,ab (z t h)=i tб) (j:∀t,|i t| <2^31) (J:∀t,t i t*2^d=sv (A t)*2^lE (A t)) (h:aO z b d l<0x100000000): (∀t,t lH (q t)≠255)/\lH l≠255 /\ ∃w y B,aO z b d l= af w y B/\aN n q A+sv l*2^(lE l+149)=ae w y*2^Bа:=by unfold aO at h⊢;split at h<;>rename_i p swap;. exact absurd h Б rw[dif_pos p];obtain ⟨O,r,N,v,e⟩:=P p;dsimp only at h⊢;split at h<;>rename_i L .exact absurd h Б rw[if_neg L];have o:((b.bsг-1)е*8+7)а=8*(b.bsг-1)+7:=by simp;omega have g:(b.top+dе)а=b.topа+d:=by rw[η];simp;omega rw[θ,g,o] at L have D:(b.top+dе-((b.bsг-1)е*8+7))а+8*(b.bsг-1)+7= b.topа+d:=by rw[μ _ _ (by rw[γ,g,o];omega),g,o];omega generalize b.top+d.toUInt64-((b.bs.size-1).toUInt64*8+7)=B at h D⊢ obtain ⟨G,K,H,u⟩:=ep z b.bs B l i (λc=>bS q b.top c.toUInt64 i 0 n) I j (λc M=>⟨(e c M).1,(e c M).2 i⟩) 0 b.bs[0].gi b.bs[0].gx b.bs[0].hsz b.bs[0].hgi 0 0 0 p (e 0 p).1 (by simp) rw[H] at h⊢ obtain ⟨E,w,y,F,g⟩:=dQ K G B l _ _ (cD q n _ b.top i r O j) (dd q A n _ b.top i d Bа r (λt g R=>(v t g).2 R) А J) (u.trans (congrArg (.%2^128) (by have:=(e 0 p).2 i;unfold tS at this;rw[l9,Θ p,Ϝ,<- l9,this];simp[nv,mul_comm]))) h exact ⟨λt g=>(v t g).1,E,w,y,B,F,g⟩ @[inline] def dp {n:н} (r0 r1 r2 r3:(t:с)-> tб Д) (ac:cs n) (wb:н) (w0 w1 w2 w3:Е):Q4:= if h:0 tб Д) (b:cs n) (d:н) (o p q r:Е):dp g i j l b d o p q r=⟨aO g b d o,aO i b d p,aO j b d q,aO l b d r⟩:=by unfold dp aO;dsimp only;by_cases h:0 tб Д:= λt ht=>aP c (W.uget (ou+t) (by rw[br А];omega)) hc def ee (W:п Е) (c:с) (hc:cб<256) (_:Wгa.push (aP c w hc)ж) (.mkEmpty Wг) lemma cj (W:п Е) (c:с) (b:cб<256) (e:Wг(ee W c b e)[i]! =(aP c W[i]! b)ж:= ⟨by simp[ee],λi d=>by rw[getElem!_pos _ i (by simp[ee];exact d),getElem!_pos W i d];simp[ee]⟩ def eB (W:п Е) (n wb:н) (rdo:(ou:с)-> ouб+n<= Wг->(t:с)-> tб Д):Prop:= ∃rvf:н-> н-> о,(∀ou hw t ht,Core.ab (rdo ou hw t ht)=rvf ouб tб) /\ (∀o t,|rvf o t| <2^31)/\(∀o t,rvf o t*2^wb=sv W[o+t]!*2^idxOf W[o+t]!) lemma gq (W:п Е) (n eb:н) (c:с) (e:cб<256) (b:cб=256-eb) (h1:1<= eb) (h2:eb<=248) (j:∀i:н,bt 7 eb W[i]!) (d:(g:с)-> gб+n<= Wг->(t:с)-> tб Д) (h:∀g p t l,ab (d g p t l)=ab (aP c W[gб+tб]! e)): eB W n (eb-1) d:= ⟨λo t=>ab (aP c W[o+t]! e),h,λ_ _=>(bc c _ e eb b h1 h2 (j _)).2, λ_ _=>(bc c _ e eb b h1 h2 (j _)).1⟩ @[noinline] def aI (n:н) (relu:т) (X W b:п р) (xo s j:н):р:= act relu (dotOf (n+1) (λt=>if tif tA[(β*m+i)*k+t]!) (λt=>B[(β*k+t)*n+j]!) @[inline] def iK (n:н) (relu:т) (X W b:п р) (xo s j:н) (r:Д):р:= if r<0x100000000 then act relu rж else aI n relu X W b xo s j @[inline] def bQ (n:н) (relu:т) (X W b:п р) (eb:н) (hs:Wг ouб+n<= Wг->(t:с)-> tб Д) (ac:cs n) (xo s j:н):р:= iK n relu X W b xo s j <| if hw:j*n+n<= Wг then aO (rdo (j*n)д (by rw[aa А];exact hw)) ac (eb-1) b[j]! else 0x100000000 lemma dV {j n W:н} (b:(j+3)*n+n<= W) (c:Fin 4):(j+c)*n+n<= W:= (nJ (χ n (Nat.add_le_add_left (Nat.le_of_lt_succ c.isLt) j)) n).trans b @[inline] def ga (n:н) (relu:т) (X W b:п р) (eb:н) (hs:Wг ouб+n<= Wг->(t:с)-> tб Д) (ac:cs n) (xo s j:н):р×р×р×р:= if hw:(j+3)*n+n<= Wг then have h0:j*n+n<= Wг:=dV hw 0 have h1:(j+1)*n+n<= Wг:=dV hw 1 have h2:(j+2)*n+n<= Wг:=dV hw 2 let r:=dp (rdo (j*n)д (by rw[aa А];exact h0)) (rdo ((j+1)*n)д (by rw[aa А];exact h1)) (rdo ((j+2)*n)д (by rw[aa А];exact h2)) (rdo ((j+3)*n)д (by rw[aa А];exact hw)) ac (eb-1) b[j]! b[j+1]! b[j+2]! b[j+3]! let p:=iK n relu X W b xo s (p j r.a,p (j+1) r.b,p (j+2) r.c,p (j+3) r.d) else let c:=bQ n relu X W b eb hs rdo ac xo s (c j,c (j+1),c (j+2),c (j+3)) lemma ip (n:н) (d:т) (X W b:п lI) (eb:н) (h:Wг pб+n<= Wг->(t:с)-> tб Д) (g:cs n) (i s j:н):ga n d X W b eb h e g i s j=(bQ n d X W b eb h e g i s j,bQ n d X W b eb h e g i s (j+1),bQ n d X W b eb h e g i s (j+2),bQ n d X W b eb h e g i s (j+3)):=by unfold ga;split<;>rename_i l swap;. rfl have o:j*n+n<= Wг:=dV l 0;have h1:(j+1)*n+n<= Wг:=dV l 1;have h2:(j+2)*n+n<= Wг:=dV l 2;dsimp only;rw[fC];unfold bQ;rw[dif_pos o,dif_pos h1,dif_pos h2,dif_pos l] lemma dT (n:н) (l j:н-> Е) (b:Е) (d e B:Д) (o:∀t,t lH (l t)≠255/\lH (j t)≠255) (i:lH b≠255) (q:aN n l j+sv b*2^(lE b+149)=ae d e*2^Bа) (p:af d e B<0x100000000): (af d e B).toUInt32=dotOf (n+1) (λt=>if tif tby simp[Ϗ.mp h] .ring lemma fK (n:н) (d:т) (X W b:п lI) (eb:н) (G:Wг Iб+n<= Wг->(t:с)-> tб Д) (A:∀i:н,lH W[i]!≠255) (o:eB W n (eb-1) h) (E:eb<=248) (e s j:н): bQ n d X W b eb G h (aq X e s n) e s j= act d (dotOf (n+1) (λt=>if tif trename_i q swap;. rfl congr 1;obtain ⟨y,r,u,v⟩:=o;have p:(j*n)дб=j*n:=aa А obtain ⟨w,l,F,H,B,D,g⟩:=cJ _ _ (λt=>X[e+t*s]!) (λt=>W[j*n+t]!) (eb-1) (y (j*n)) b[j]! (bm X e s n) А (λt g=>(r _ _ t g).trans (by rw[p])) (u _) (λt _=>v _ t) q rw[D] at q⊢;exact dT n (λt=>X[e+t*s]!) (λt=>W[j*n+t]!) b[j]! F H B (λt g=>⟨w t g,A _⟩) l g q @[inline] def dk (k:н) (A B:п р) (eb:н) (hs:Aг ouб+k<= Aг->(t:с)-> tб Д) (ac:cs k) (β i j m n:н):р:= let r:Д:= if hw:(β*m+i)*k+k<= Aг then aO (rdo ((β*m+i)*k)д (by rw[aa А];exact hw)) ac (eb-1) 0 else 0x100000000 if r<0x100000000 then rж else iY k A B β i j m n lemma fA (k:н) (A B:п lI) (eb:н) (G:Aг Iб+k<= Aг->(t:с)-> tб Д) (z:∀i:н,lH A[i]!≠255) (g:eB A k (eb-1) b) (E:eb<=248) (β i j m n:н): dk k A B eb G b (aq B (β*k*n+j) n k) β i j m n= dotOf k (λt=>A[(β*m+i)*k+t]!) (λt=>B[(β*k+t)*n+j]!):=by unfold dk iY;dsimp only;by_cases w:(β*m+i)*k+k<= A.size swap;. rw[dif_neg w,if_neg Б] rw[dif_pos w];split<;>rename_i o swap;. rfl obtain ⟨v,p,q,r⟩:=g;have l:((β*m+i)*k)дб=(β*m+i)*k:=aa А;have e:∀t,β*k*n+j+t*n=(β*k+t)*n+j:=λt=>by ring obtain ⟨u,-,F,H,y,D,d⟩:=cJ _ _ (λt=>B[β*k*n+j+t*n]!) (λt=>A[(β*m+i)*k+t]!) (eb-1) (v ((β*m+i)*k)) 0 (bm B _ n k) А (λt d=>(p _ _ t d).trans (by rw[l])) (q _) (λt _=>r _ t) o rw[D] at o⊢;symm;apply aR _ _ _ F H y _ _ o .intro t h;exact ⟨z _,by simpa[e] using u t h⟩ .rw[dL 0 Б,nZ,add_zero] at d;rw[<- d] exact Ζ rfl λt _=>by unfold tm;simp only[e];ring lemma fP {α:Type} (N:н) (f:н-> α) (d:α) (i:н) (h:i α) (g:α-> н-> н-> р) (i j:н) (r:α) (acc:п р):п р:= if j α) (g:α-> н-> н-> lI) (i j:н) (r:α) (d:п lI) (v:r=o i) (y:ig (o (q/b)) (q/b) (q%b):=by fun_induction bp .rename_i i j r d e u refine u v y А (by simp[t];omega) λq z=>?_ rw[me];split .exact p q _ .simp at z;obtain rfl:q=i*b+j:=А have w:(i*b+j)/b=i:=by rw[ϒ,ϑ _ _ А,ϕ e,Κ] rw[w,ϒ,ϊ,ε e,v] .rename_i i j r d e l u exact u rfl l А (by rw[t,ϲ];omega) p .rename_i i j r d e l refine mQ (by rw[ϡ,t,show a=i+1 by omega,ϲ];omega) λq h1 _=>by rw[Τ];exact p q h1 @[specialize] def c0 {α:Type} (a b:н) (ro:н-> α) (g:α-> н-> н-> р) (g4:α-> н-> н-> р×р×р×р) (i j:н) (r:α) (acc:п р):п р:= if j+4<= b then let q:=g4 r i j c0 a b ro g g4 i (j+4) r ((((acc.push q.1).push q.2.1).push q.2.2.1).push q.2.2.2) else if j α) (g:α-> н-> н-> lI) (p:α-> н-> н-> lI×lI×lI×lI) (u:∀r i j,p r i j=(g r i j,g r i (j+1),g r i (j+2),g r i (j+3))) (i j:н) (r:α) (d:п lI):c0 a b t g p i j r d=bp a b t g i j r d:=by fun_induction c0 .rename_i i j r d l q h rw[h];simp only[q,u];conv_rhs=>rw[bp,if_pos (by omega:jrw[bp,if_pos e] .rename_i i j r d l e o h rw[h];conv_rhs=>rw[bp,if_neg e,if_pos o] .rename_i i j r d l e o rw[bp,if_neg e,if_neg o] @[inline] def eu (rows inW outW:н) (relu:т) (X W b:п р) (eb:н) (hs:Wг ouб+inW<= Wг->(t:с)-> tб< inW-> Д):п р:= if 0aq X (i*inW) 1 inW) (λr i j=>bQ inW relu X W b eb hs rdo r (i*inW) 1 j) (λr i j=>ga inW relu X W b eb hs rdo r (i*inW) 1 j) 0 0 (aq X (0*inW) 1 inW) (Array.mkEmpty (rows*outW)) else #[] lemma eW (g d l:н) (e:т) (X W b:п lI) (eb:н) (u:Wг wб+d<= Wг->(t:с)-> tб Д) (v:∀i:н,expOf W[i]!≠255) (p:eB W d (eb-1) h) (o:eb<=248): eu g d l e X W b eb u h=linearSpec g d l e X W b:=by unfold eu linearSpec linearWith;split .rw[iB _ _ _ _ _ (λr i j=>ip d e X W b eb u h r (i*d) 1 j), ec _ _ _ _ _ _ _ _ rfl А А (by simp) (by simp)] apply congrArg;funext q;rw[fK d e X W b eb u h v p o];simp only[ϰ] .simp[show g=0 by omega] def gl (rows inW outW:н) (relu:т) (X W b:п р):п р:= if heb:aj 7 W=0 then linearSpec rows inW outW relu X W b else have hsp:=ay 7 W heb have hs:Wг ao (Wd.uget (ou+t) (by rw[br А];omega)) else eu rows inW outW relu X W b (aj 7 W) hs (ez W _ hc inW hs) def iA (batch m k n:н) (A B:п р):п р:= if heb:aj 7 A=0 then gemmSpec batch m k n A B else have hsp:=ay 7 A heb have hs:Aг(Array.range n).map λj=>aq B (β*k*n+j) n k if 0(cols.getD (r/m) #[],r/m,r%m)) (λc _ j=>dk k A B (aj 7 A) hs (λou hw t ht=>ao (Ad.uget (ou+t) (by rw[br А];omega))) (c.1.getD j ⟨0,#[]⟩) c.2.1 c.2.2 j m n) 0 0 (cols.getD (0/m) #[],0/m,0%m) (Array.mkEmpty (batch*m*n)) else #[] lemma gZ (W:п Е) (n eb:н) (d:Wгao ((ee W _ b d).uget (g+t) (by rw[br А];have:=(cj W _ b d).1;omega)):=by refine gq W n eb _ b (a9 eb h1) h1 h2 e _ λg j t h=>?_ have l:=cj W _ b d;rw[aw,br А,aC,l.2 _ А];exact bM _ (bc _ _ b eb (a9 eb h1) h1 h2 (e _)).2 lemma fU:gl=linearSpec:=by funext p g l o X W b unfold gl;split;. rfl rename_i h;have d:=ay 7 W h;have q:Wг(d.2.2.2 i).1 have e:=λi=>(d.2.2.2 i).2 dsimp only;split .exact eW _ _ _ _ _ _ _ _ _ _ e (gZ W g _ q d.2.1 d.2.2.1 j _) d.2.2.1 .exact eW _ _ _ _ _ _ _ _ _ _ e (gq W g _ _ _ (a9 _ d.2.1) d.2.1 d.2.2.1 j _ λv u t r=>by simp only[ez];rw[aw,br А]) d.2.2.1 lemma jn:iA=gemmSpec:=by funext d m k n A B unfold iA;split;. rfl rename_i e;have b:=ay 7 A e;have l:Aгby subst h;simp at g rw[ϳ,ϓ n m, fP _ _ _ _ (Ϫ (lt_of_lt_of_eq g (ϓ _ _))), fP _ _ _ _ (Λ _ j)] exact fA k A B _ _ _ (λi=>(b.2.2.2 i).2) (gZ A k _ l b.2.1 b.2.2.1 (λi=>(b.2.2.2 i).1) _) b.2.2.1 _ _ _ _ _ .rename_i h;rw[<- ό,Nat.eq_zero_of_not_pos h,ϫ];rfl def dA (dx W:п Е) (c:с) (hc:cб<256) (ou:с) (hw:ouб+dxг<= Wг) (hs:Wг t< iг-> bt 7 eb W[gб+t]! /\ lH W[gб+t]!≠255) /\ ∃b d,dA i W c j g I H B y k r l=aJ d b B y/\nv b d%2^128= (nv l r+∑m∈Finset.Ico k.toNat i.size,ai i[m]!*ab (aP c W[g.toNat+m]! j))%2^128:=by fun_induction dA .exact absurd h Б .rename_i k r l h1 w q E p Q have J:bt 7 eb w/\lH w≠255:=by have ha:=bk w;have N:=bn w;have:=w.toNat_lt;simp only[Ε,beq_iff_eq,bne_iff_ne,ne_eq,not_and,not_not] at E;unfold bt;by_cases e:q=0 .exact ⟨Or.inl (E e),dG (by rw[N,E e];decide)⟩ .simp only[q,i7,de,iL w c j] at e;rw[gC,v] at e;unfold a7 at e have:=jU w;clear*-e u z this;split_ifs at e<;>first | exact ⟨Or.inr ⟨by omega,by omega⟩,dG А⟩ | exact absurd rfl e have R:=aF h1;have L:=an h1;obtain ⟨A,b,d,K,F⟩:=Q h;have G:w=W[gб+kб]!:=by simp only[w];rw[aw,br А] refine ⟨λt D o=>?_,b,d,K,?_⟩ .by_cases P:t=kб .rw[P,<- G];exact J .exact A t А o .have O:ab p=ai i[kб]!*ab (aP c W[gб+kб]! j):=by have M:=(bc c w j eb v u А J.1).2;rw[<- G];simp only[p,q];rw[aw];show ab (ao _*aP c w j)=_;rw[bN,aC];rw[aC,abs_mul];exact (mul_le_mul_of_nonneg_right (cN _) (abs_nonneg _)).trans_lt (by clear*-M;omega) rw[L] at F;rw[Θ R] exact F.trans ((Ϯ _ (gW l r p)).trans (congrArg (.%2^128) (by rw[O];ring))) .rename_i k r l h1 have hk:=gz А h1;refine ⟨λt D o=>absurd o А,l,r,rfl,?_⟩ rw[ϙ hk,nd,add_zero] def ir (X:п Е) (n:н) (top:Д):п Е:= Array.ofFn (n:=n) λt=>if eV top 0 X[tй]! then dv top X[tй]! else 0 @[inline] def gb (n:н) (relu:т) (X W b:п р) (hs:Wг(d.2.2.2 i).2) (gq W n _ _ _ (a9 _ d.2.1) d.2.1 d.2.2.1 (λi=>(d.2.2.2 i).1) _ λr q t p=>by simp only[ez];rw[aw,br А]) d.2.2.1 0 1 j def xr (X:п р):н-> н-> Е-> Е-> н-> Е×Е | 0,_,lo,hi,_=>(lo,hi) | k+1,i,lo,hi,z=> let w:=X.getD i 0 if w<<<1==0 then if z<3 then (1,0) else xr X k (i+1) lo hi (z-3) else let e:=(w>>>23)&&&255;let lo:=min lo e;let hi:=max hi e if hi-lo<8 then xr X k (i+1) lo hi (z+1) else (1,0) def it (W:п р) (n:н):н:= let r:=xr W n 0 255 0 (4*n) if r.2-r.1<8 then (r.1в+r.2в-6)/2 else 0 def eX (rows inW outW:н) (relu:т) (X W b:п р):п р:= let p:=xr X inW 0 255 0 32 if rows=1/\p.2-p.1<8 then let ac:=aq X 0 1 inW let eb:=it W inW if h:ac.bsг=1/\inW*3<=(ac.bs[0]?.map λ(bd:dh inW)=>bd.giг).getD 0*4/\1<= eb/\eb<=247 /\ 8<= ac.topа+eb/\Wгaj 7 W Array.ofFn (n:=rows*outW) λj=> let r:=if hw:j.1*inW+dxг<= Wг then dA dx W _ hc (j.1*inW)д (by rw[aa А];exact hw) h.2.2.2.2.2 B b[j.1]! 0 0 0 else 0x100000000 if r<0x100000000 then act relu rж else gb inW relu X W b h.2.2.2.2.2 ac g.get rfl j else gl rows inW outW relu X W b else gl rows inW outW relu X W b lemma gS:eX=linearSpec:=by funext I d p r X W b;unfold eX;dsimp only;split .rename_i i;obtain ⟨rfl,-⟩:=i;split .rename_i h obtain ⟨K,-,h1,h2,L,S⟩:=h;have e:=a9 _ h1;have M:(256-it W d).toUSize.toNat<256:=by rw[e];omega unfold linearSpec linearWith;congr 1;funext q;have H:qйrename_i U swap;. exact (if_neg Б).trans (eL ..) split<;>rename_i i swap;. exact eL .. unfold aI;congr 1;obtain ⟨g,A,E,J,F⟩:=gf _ _ _ _ _ _ _ _ _ _ e h1 h2 _ _ _ i;have B:(q.1*d)дб=q.1*d:=aa А;have y:(ir X d (aq X 0 1 d).top)г=d:=ϡ;rw[B,y,Ϝ] at g F;let u:н-> о:=λt=>if tX[0+t*1]!) d 1 (aq X 0 1 d).top u А P λt=>by simp only[u];split;exact (bc _ _ _ _ e h1 А (g t t.zero_le ‹_›).1).2;simp) (dd _ (λt=>W[q.1*d+t]!) d 1 (aq X 0 1 d).top u (it W d-1) _ А (λt v Q=>(j t v).2 Q) (by simp;clear*-h1 h2 L o;omega) λt v=>by simp only[u,if_pos v];exact (bc _ _ _ _ e h1 А (g t t.zero_le v).1).1) (by rw[F,Finset.sum_range_one,show (0:н)е=0 from rfl,show nv 0 0=0 by simp[nv]] congr 1;simp only[Nat.sub_self,pow_zero,one_mul,zero_add];unfold bS ir;refine Ζ rfl λm O=>?_ have l:=(Finset.mem_Ico.mp O).2;rw[getElem!_pos _ m (by simpa using l),Τ] simp only[u,if_pos l,ϰ];split_ifs<;>simp[ai]) i rw[z] at i⊢;exact dT d _ _ _ N R _ (λt G=>⟨(j t G).1,(g t t.zero_le G).2⟩) w D i .rw[fU] .rw[fU] lemma du:ab 0=0:=rfl lemma iO (x:Е):ab xи=xв:=by have:=x.toNat_lt;rw[aG,Ι];split<;>omega lemma kB (x:Е) (h:xв<2^31):x&&&0x7FFFFFFF=x:=by apply Β.1;rw[Χ];exact (ν _ 31).trans (ε h) @[inline] def d0 (c:Д) (x:Е):Д:=Core.sW x<<<(Core.iW x-c) @[inline] def gm (c:Д) (x:Е):Е:=(d0 c x)ж&&&0x7FFFFFF @[inline] def gk (c:Д) (x:Е):Е:=(d0 c x>>>27)ж lemma gY (c:Д) (x:Е) (j:ak x≠0-> cа<= lE x/\lE x<= cа+30): (((gm c x)в:о)+ai (gk c x)*2^27)*2^cа=sv x*2^lE x /\ |((gm c x)в:о)| <= 2^27 /\ |ai (gk c x)| <= 2^27:=by have h1:ab (d0 c x)*2^cа=sv x*2^lE x /\ |ab (d0 c x)| <2^54:=by unfold d0;by_cases h:ak x=0 .have i:sW x=0:=by have:=(sW x).toNat_lt;have e:=bg x;rw[dL x h,aG] at e;apply ο.mp;simp;split at e<;>omega rw[i,dL x h];simp[du] obtain ⟨h1,h2⟩:=j h have g:(iW x-c)а=lE x-cа:=by rw[μ _ _ (by rw[γ,ap];exact h1),ap] have hb: |sv x*2^(lE x-cа)| <2^54:=by have:(2:о)^(lE x-cа)<=2^30:=pow_le_pow_right₀ Г А;rw[abs_mul,abs_pow,abs_two];have:=mul_le_mul_of_nonneg_left this (abs_nonneg (sv x));have:=dM x;omega rw[fk _ _ (by rw[g];omega) (by rw[g,bg];omega),g,bg] refine ⟨?_,hb⟩;rw[mul_assoc,<- pow_add,mV h1] unfold gm gk;rw[<- h1.1];have h2:=h1.2;generalize d0 c x=V at h2⊢;have:=V.toNat_lt have b:(Vж&&&0x7FFFFFF)в=Vа%2^27:=by rw[Χ,ϐ,show (0x7FFFFFF:Е)в=2^27-1 from rfl, ν];omega have d:(V>>>27)жв=Vа/2^27%2^32:=by rw[ϐ,ξ];simp[ζ] have k:((Vж&&&0x7FFFFFF)в:о)+ai (V>>>27)ж*2^27=ab V:=by rw[aG,abs_lt] at h2;rw[aG,bK,b,d];clear h1 b d;split_ifs at h2⊢<;>omega rw[b] at k⊢;rw[k,abs_le,abs_le];rw[abs_lt] at h2;clear h1 b d this;exact ⟨rfl,⟨by omega,by omega⟩,by omega,by omega⟩ @[inline] def bX (n:н) (relu:т) (X W b:п р) (o:н) (P p:с) (B:Д) (bi:BI) (a0 a1:Д):р:= let r:=iw (eD (eD 0 a0 0) a1 27) (fH (fH 0 0 a0 0) (eD 0 a0 0) a1 27) B bi if r<0x100000000 then act relu rж else aI n relu X W b pб Pб o lemma ml {a b:н} (c:н) (h:a((Z.push a).push b)[i]! =Z[i]!) /\ ((Z.push a).push b)[Zг]! =a/\((Z.push a).push b)[Zг+1]! =b:=by refine ⟨λi d=>?_,?_,?_⟩ .have h1:i<(Z.push a)г:=by simp;omega have h2:i<((Z.push a).push b)г:=by simp;omega rw[getElem!_pos ((Z.push a).push b) i h2,getElem!_pos Z i d];simp only[nE h1,nE d] .rw[getElem!_pos ((Z.push a).push b) _ (by simp)];simp[me] .rw[getElem!_pos ((Z.push a).push b) _ (by simp)];simp[me] @[specialize] def aY (g:н-> Е) (wo:н) (P:Е) (k:н) (ag:Е) (Z:п Е): п Е:= match k with | 0=>Z | k+1=>let ag:=ag-P;let w:=g (wo+k) aY g wo P k ag (if w=0 then Z else (Z.push ag).push w) def dw (N Pn:н) (Z:п Е):Prop:= Zг%2=0/\Zг<=62 /\ ∀j,2*j+1 Z[2*j]!в+Pn<= N lemma gd (g:н-> Е) (d:н) (P:Е) (N k:н): ∀(b:Е) (Z:п Е),bв=k*Pв-> k*Pв<= N-> Zг%2=0 -> (∀j,2*j+1 Z[2*j]!в+Pв<= N) -> (aY g d P k b Z)г%2=0/\(aY g d P k b Z)г<= Zг+2*k /\ (∀j,2*j+1<(aY g d P k b Z)г->(aY g d P k b Z)[2*j]!в+Pв<= N) /\ ∀f:н-> о,∑j∈lG ((aY g d P k b Z)г/2), ai (aY g d P k b Z)[2*j+1]!*f (aY g d P k b Z)[2*j]!в= ∑j∈lG (Zг/2),ai Z[2*j+1]!*f Z[2*j]!в+ ∑t∈lG k,ai (g (d+t))*f (t*Pв):=by induction k with | zero=>intro b Z _ _ h1 h2;exact ⟨h1,by simp[aY],h2,λf=>by simp[aY]⟩ | succ k y=> intro b Z e A h1 h2;rw[mq,m7] at e A;have B:P<= b:=by rw[ϴ];omega have i:(b-P)в=k*Pв:=by rw[mz _ _ B];omega simp only[aY];by_cases u:g (d+k)=0 .obtain ⟨l,w,o,p⟩:=y (b-P) Z i А h1 h2 simp only[u,ite_true];refine ⟨l,by omega,o,λf=>?_⟩ rw[p f,Η,u,show ai 0=0 from rfl];simp .simp only[u,ite_false] obtain ⟨v,z,D⟩:=pp Z (b-P) (g (d+k)) obtain ⟨l,w,o,p⟩:=y (b-P) ((Z.push (b-P)).push (g (d+k))) i А (by simp;omega) (λj q=>by simp at q;by_cases r:2*j+1?_⟩ have h:∑j∈lG (Zг/2),ai ((Z.push (b-P)).push (g (d+k)))[2*j+1]!* f ((Z.push (b-P)).push (g (d+k)))[2*j]!в= ∑j∈lG (Zг/2),ai Z[2*j+1]!*f Z[2*j]!в:= Ζ rfl λj q=>by simp at q;rw[v _ А,v _ А] rw[p f,show ((Z.push (b-P)).push _)г/2=Zг/2+1 by simp;omega,Η, Η,show 2*(Zг/2)=Zг by omega,z,D,i,h] ring @[inline] def cz (W:п Е) (c:с) (hc:cб<256) (nu m:н) (Pw:Е):п (п Е):= Array.ofFn λo:Fin m=>aY (λi=>(aP c W[i]! hc)ж) (oй*nu) Pw nu (Pw*nuл) (.mkEmpty (2*nu)) lemma jg (W:п Е) (c:с) (g:cб<256) (b m:н) (d:Е) (q:b*dв<2^32) (p:b<=31): (∀o,o< m-> dw (b*dв) dв (cz W c g b m d)[o]!) /\ ∀o,o< m-> ∀f:н-> о,∑j∈lG ((cz W c g b m d)[o]!г/2), ai ((cz W c g b m d)[o]!)[2*j+1]!*f ((cz W c g b m d)[o]!)[2*j]!в= ∑t∈lG b,ai (aP c W[o*b+t]! g)ж*f (t*dв):=by have h:=λo (l:o< m)=>gd (λi=>(aP c W[i]! g)ж) (o*b) d (b*dв) b (d*bл) (.mkEmpty (2*b)) (by rw[UInt32.toNat_mul,ϧ (Nat.lt_of_le_of_lt p Б),ϓ];exact ε q) le_rfl (by simp) (by simp) have e:∀o,o< m->(cz W c g b m d)[o]! = aY (λi=>(aP c W[i]! g)ж) (o*b) d b (d*bл) (.mkEmpty (2*b)):=λo l=>by rw[getElem!_pos (cz W c g b m d) o (by simp[cz];exact l)];simp[cz] refine ⟨λo l=>?_,λo l f=>?_⟩<;>rw[e o l] .exact ⟨(h o l).1,(h o l).2.1.trans (by simp;omega),(h o l).2.2.1⟩ .rw[(h o l).2.2.2 f];simp @[inline] def cp (P p:с):с:=if p+1

assumption lemma lm {N b:н} {Z:п Е} (d:dw N b Z) {e j:с} (h:eб=Zг/2) (g:j о) (hk:k<=30) (d:∀m≤k,|g m| <= 2^58) (ha:ab a=∑m∈lG k,g m) (h:ab w*ab x=g k): ab (a+w*x)=∑m∈lG (k+1),g m:=by have i:=dK (lG k) g (2^58) λm l=>d m (by simp at l;omega) have b:=d k le_rfl;have j:((lG k).card:о)<=30:=by simp;exact_mod_cast hk have e:ab (w*x)=g k:=by rw[bN _ _ (by rw[h];exact lt_of_le_of_lt b Г),h] rw[fj _ _ (by rw[e,ha];rw[abs_lt];rw[abs_le] at i b;constructor<;>nlinarith),e,ha, Η] lemma g0 (b:п lI) (f:н-> lI) (p q N:н) (d:q=p+1) (h:pf (q+jй))= b++lN (n:=N-p) (λj=>f (p+jй)):=by subst d;refine mQ (by simp;omega) λi h1 h2=>?_ simp only[Array.getElem_append,me,Τ,Array.size_push];split_ifs<;>first | rfl | (congr 1;omega) section variable (n:н) (relu:т) (X W b E0 E1:п lI) (Zs:п (п lI)) (P:с) (m:н) (hE:n*Pб<= E0г) (hE1:E1г=E0г) (hs:E0г dw (n*Pб) Pб Zs[o]!) (hm:Zsг=m/\m(q+ag)бby have:=jT E0 (Zo.uget (2*j) А) hE hs hq (by rw[aw,hz.1];exact hz.2.2.2) simp only[ag];omega let w:=ao (Zo.uget (2*j+1) А) b7 o ho Zo hZo je hje bi p p1 (j+1) hp hp1 (a0+w*(E0.uget (p+ag) (hq p hp).1&&&0x7FFFFFFF)и) (a1+w*ao (E1.uget (p+ag) (hq p hp).2)) (b0+w*(E0.uget (p1+ag) (hq p1 h1).1&&&0x7FFFFFFF)и) (b1+w*ao (E1.uget (p1+ag) (hq p1 h1).2)) acc else let acc:=acc.push (bX n relu X W b o P p B bi a0 a1) let acc:=if p+1

Е) (hX:∀i ∀f:н-> о,∑j∈lG (Zs[o]!г/2), ai (Zs[o]!)[2*j+1]!*f (Zs[o]!)[2*j]!в=∑t∈lG n,ai (wv (o*n+t))*f (t*Pб)) (o:н) (D:o< m) (K:п lI) (a3:K=Zs[o]!) (y:с) (d:yб=Kг/2) (O:BI) (p p1 j:с) (J:paI n relu X W b ((pб+o*Pб+i)%Pб) Pб ((pб+o*Pб+i)/Pб):=by have ah:∀i,i |(E0[i]!в:о)| <= 2^27 /\ |ai E1[i]!| <= 2^27:= λi M=>⟨(hX i M).2.1,(hX i M).2.2.1⟩ have hc:∀o (D:o< m) (y:с),yб=Zs[o]!г/2-> ∀(q:с) (R:q bX n relu X W b o P q B (a8 B b[o]!) g l= aI n relu X W b ((qб+o*Pб)%Pб) Pб ((qб+o*Pб)/Pб):=by intro o D y d q R g l ha;have h3:=ι.mp R;have e0:=hZf o D λG=>(E0[qб+G]!в:о) have Y:=hZf o D λG=>ai E1[qб+G]! obtain ⟨al,as⟩:=ha;rw[d,e0] at al;rw[d,Y] at as rw[ϊ,ε h3,ϑ _ _ А,ϕ h3, Κ] have:=ml n D;have hx:=λt (v:thX (qб+t*Pб) (by have:=ml Pб v;omega) have hw:=λt (v:thWd (o*n+t) А have hb:=λt (v:t (⟨mb _ _ (hw t v).2.1.le (hx t v).2.1,mb _ _ (hw t v).2.1.le (hx t v).2.2.1⟩:_/\_) unfold bX aI;dsimp only;split<;>rename_i U swap;. rfl congr 1 set S:=∑t∈lG n,ai (wv (o*n+t))* ((E0[qб+t*Pб]!в:о)+ai E1[qб+t*Pб]!*2^27) with hS have a2: |S| <= 31*(2^58+2^85):=by refine (dK _ _ (2^58+2^85) λt v=>?_).trans (by simp;omega) obtain ⟨H,I⟩:=hb t (Ϗ.mp v);rw[mul_add,<- mul_assoc];refine (abs_add_le _ _).trans ?_;rw[abs_mul _ (2^27:о),abs_of_pos (by norm_num:(0:о)<2^27)];omega obtain ⟨bb,M,lo,az,v⟩:=dQ _ _ B b[o]! S _ (a2.trans Г) rfl (by refine Int.ModEq.trans (ev _ _ l 27 Б) (Int.ModEq.trans (Ϯ _ (ev 0 0 g 0 Б)) ?_) rw[show nv 0 0=0 by simp[nv],show (0:Д).toNat=0 from rfl,show (27:Д).toNat=27 from rfl, al,as,zero_add] congr 1;rw[hS,ϖ,ϖ,<- Ϥ];exact Ζ rfl λm _=>by ring) U simp only[aJ] at az;rw[az] at U⊢ exact dT _ _ _ _ M lo B (λt h=>⟨(hx t h).2.2.2,(hw t h).2.2⟩) bb (by rw[<- v,hB,hS,ϖ,add_left_inj];unfold aN;refine Ζ rfl λm hm=>?_ have:=congrArg₂ (.*·) (hx m (Ϗ.mp hm)).1 (hw m (Ϗ.mp hm)).1 unfold tm;rw[pow_add,pow_add];linear_combination-this) U have z:∀K q,Acc K E0 E1 q 0 0 0:=λK q=>⟨by simp[du],by simp[du]⟩ fun_induction b7 .rename_i o D y O p j J g l H I E _ _ N d hz G R w h1 ih have U:dw (n*Pб) Pб Zs[o]!:=hZ o D;have:=ι.mp N;have:=U.2.1 have cm:∀(q:с),q ∀g l (g3:(q+G)б Acc Zs[o]! E0 E1 q (j+1) (g+w*(E0.uget (q+G) g3&&&0x7FFFFFFF)и) (l+w*ao (E1.uget (q+G) g4)):=λq R g l g3 g4 ha=>by rw[kB (E0.uget (q+G) g3) (by have:=(ah _ g3).1;rw[aw];rw[abs_le] at this;omega)] have bz:=ι.mp R;obtain ⟨e,-⟩:=jT E0 (Zs[o]!.uget (2*j) А) hE hs R (by rw[aw,hz.1];exact hz.2.2.2) simp only[aw,hz.1] at e have hb:∀t,t<= jб-> |ai (Zs[o]!)[2*t+1]!*(E0[qб+(Zs[o]!)[2*t]!в]!в:о)| <= 2^58 /\ |ai (Zs[o]!)[2*t+1]!*ai E1[qб+(Zs[o]!)[2*t]!в]!| <= 2^58:=λt v=>by have:=U.2.2 t А;have M:=ah (qб+(Zs[o]!)[2*t]!в) А;exact ⟨mb _ _ (cN _) M.1,mb _ _ (cN _) M.2⟩ unfold Acc;rw[an N] refine ⟨jb _ _ _ _ _ А (λt v=>(hb t v).1) ha.1 ?_, jb _ _ _ _ _ А (λt v=>(hb t v).2) ha.2 ?_⟩<;> simp only[w,G,aC,iO,aw,hz.1,hz.2.1]<;>rw[e] exact ih hbi (by rw[an N];omega) (cm p J _ _ _ _ ha) (cm (cp P p) h1 _ _ _ _ hb) on_goal 1=>rename_i o D y O p j J g l H I E _ _ N r F d u ih on_goal 2=>rename_i o D y O p j J g l H I E _ _ N r F aL d K u ih on_goal 3=>rename_i o D y O p j J g l H I E _ _ N r F aL d u all_goals subst hbi have aH:j=y:=USize.toNat_inj.mp (by have:=USize.lt_iff_toNat_lt.not.mp N;omega) have a4:Acc Zs[o]! E0 E1 p y g l:=aH ▸ ha have ba:Acc Zs[o]! E0 E1 (cp P p) y H I:=aH ▸ hb obtain ⟨V,bo⟩:=u2 J hPs have bw:=ι.mp J have bs:=ml Pб D have Q:pб+o*Pб< m*Pб:=А have L:=λ(A:п lI)=>g0 A λq=>aI n relu X W b (q%Pб) Pб (q/Pб) have Y:=hc o D y d p J g l a4 have e2:p+1 bX n relu X W b o P (cp P p) B (a8 B b[o]!) H I=aI n relu X W b ((pб+o*Pб+1)%Pб) Pб ((pб+o*Pб+1)/Pб):=λh=>by rw[hc o D y d (cp P p) (gX J) H I ba,cp,if_pos h,V,ϵ] .rw[ih rfl (by simp) (z _ _) (z _ _)] simp only[u,r,Y];have:=ι.mp F;have h2:p+1 т-> п р-> п р-> п р-> п р) (s:ConvShape) (relu:т) (inp wts b:п р):п р:= if h:s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\0 dw (s.cin*(s.h*s.w)лв) (s.h*s.w)лв Zs[o]!:= (jg wts _ hc s.cin s.cout (s.h*s.w)л (by rw[hPw];omega) А).1 let Z0:=Zs.uget 0 (by simp[Zs,cz];omega) b7 s.cin relu inp wts b (inp.map (gm c)) (inp.map (gk c)) Zs (s.h*s.w)д s.cout (by rw[Array.size_map,hP];omega) (by simp) (by simp;omega) (by rw[hP];omega) (by rw[hP,<- hPw];exact hZ) (by simp[Zs,cz];omega) B 0 h.2.2.2.2.2.2.1 Z0 (by simp only[Z0];rw[jd,Ϝ]) (Z0.usize/2) (by have:=(hZ 0 h.2.2.2.2.2.2.1).2.1;simp only[Z0,Array.usize] rw[USize.toNat_div,uc,jd,Ϝ,aa А]) (a8 B b[0]!) 0 (cp _ 0) 0 (ι.mpr (by rw[Ϝ,hP];exact Nat.mul_pos h.2.2.2.2.1 h.2.2.2.2.2.1)) rfl 0 0 0 0 (Array.mkEmpty (s.cout*(s.h*s.w))) else fb s relu inp wts b lemma ll (s:ConvShape) (b:п lI) (h1:s.kh=1) (h2:s.kw=1) (h3:s.stride=1) (e:s.pad=0) (g:0 т-> п lI-> п lI-> п lI-> п lI) (B:G=mX):e7 G=mX:=by funext s L d e b unfold e7;split;swap;. rw[B] rename_i h;obtain ⟨h1,h2,h3,y,I,K,O,P,M,hX,N,A,D,H⟩:=h;have g:=ay 7 e A;have t:=ay 30 d D;have:=Ο;have U:eг Е) i,i(d.map f)[i]! =f d[i]!:=λf i u=>by simp[getElem!_pos,u] rw[fE (c:=aj 30 d-1) (eb:=aj 7 e) (hn31:=P) (hB:=by simp;omega) (wv:=λi=>(aP (256-aj 7 e)д e[i]! z)ж) (hbi:=rfl) (hk:=by simp) (ha:=⟨by simp[du],by simp[du]⟩) (hb:=⟨by simp[du],by simp[du]⟩) (hX:=λi u=>by have r:iby have q:=bc _ e[i]! z (aj 7 e) (a9 _ g.2.1) g.2.1 g.2.2.1 (g.2.2.2 i).1;rw[bM _ q.2];exact ⟨q.1,q.2,(g.2.2.2 i).2⟩) (hZf:=λo ho f=>by rw[(jg e _ z s.cin s.cout (s.h*s.w)л (by rw[l];have:=t.1;omega) А).2 o ho f,l,j])] unfold mX conv2dWith aI;dsimp only;simp only[Array.mkEmpty_eq,Array.empty_append,ϫ,ύ,j,E,F,h1,h2,ϰ];simp only[ll s d h1 h2 h3 y I K,Ϝ,Κ];exact mQ (by simp only[ϡ,j,E,F];simp) λi _ _=>by simp only[Τ] end Dense namespace Bn lemma et (a b:Д) (h:aа+bа<2^64):(a+b)а=aа+bа:=by rw[η,ε h] def sg (n:т) (m:н):о:=if n then-(m:о) else m lemma gP (x s t:lI) (o:lH x≠255) (j:lH s≠255) (l:lH t≠255) (V:о) (i:V=sv x*sv s*2^(idxOf x+idxOf s)+sv t*2^(idxOf t+149)) (h:V≠0): toWord (Model.fma (ofW x) (ofW s) (ofW t))=finishWord V (-298) false:=by have e:=lL x o;have b:=lL s j;have d:=lL t l;rw[Model.Proof.fma_eq_spec];unfold Model.Spec.fma have g:Model.chooseNaN3 (n4 x) (n4 s) (n4 t)=none:= (Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨Ρ e, Ρ b,Ρ d⟩ simp only[n4] at g⊢;rw[g] simp only[Ϟ e,Ϟ b, Ϟ d,Bool.or_false,Α,ite_false,e,b,d] refine (mE _ V _ _ h ?_).symm;rw[Model.addDyadic,FloatLib.Numerics.Dyadic.add_toRat];erw[FloatLib.Numerics.Dyadic.mul_toRat (decodeD x) (decodeD s)];rw[lY,lY,lY,i];push_cast;simp[zpow_sub₀];field_simp;ring lemma gH (a b:lI) (ha:lH a≠255) (hb:lH b≠255) (V:о) (h:V=sv a*2^(idxOf a+149)+sv b*2^(idxOf b+149)) (g:V≠0): toWord (Model.add (ofW a) (ofW b))=finishWord V (-298) false:=by have d:=lL a ha;have e:=lL b hb;rw[Model.Proof.add_eq_spec];unfold Model.Spec.add;simp only[n4] at d e⊢;rw[d,e];refine (mE _ V _ _ g ?_).symm;rw[Model.addDyadic,nV,lY,lY,h];push_cast;simp[zpow_sub₀];field_simp;ring lemma jw (n:т) (M σ:Д) (V:о) (b:Mа≠0) (e:σа<=506) (d:V=sg n Mа*2^σа): aX n M σ=finishWord V (-298) false:=by subst d;exact e9 n M σ b e lemma cQ (w:lI):sv w=sg (w>>>31!=0) (lK w):=by rw[bq];rfl lemma dz (w:Е):w>>>31=0\/w>>>31=1:=by have:=w.toNat_lt;simp only[<- Β,ϟ];simp[ζ];omega lemma ki (a b:т) (x y:н):sg a x*sg b y=sg (a ^^ b) (x*y):=by unfold sg;cases a<;>cases b<;>simp lemma iM (b:т) (o g:Е) (X:н) (d:g=0\/g=1) (hX:X<255*2^23) (e:oв=gв*2^31+X): o*((g&&&(if b then 1 else 0))^^^1)=act b o:=by have i:(o&&&0x80000000!=0)=decide (2^31<= oв):=by rw[ϗ,decide_eq_true_iff];exact a5 o have h:=Dense.jV o (by rw[Dense.bk];rcases d with rfl | rfl<;>simp at e<;>omega) unfold act reluW rcases d with rfl | rfl<;>cases b<;>simp only[i,h]<;>simp at e⊢<;> omega lemma lx (P T:Д) (c:т) (i:Pа<2^62) (j:Tа<2^62): let D:=if c then P+T else P-T let f:=D>>>63 let M:=if f==0 then D else 0-D (f=0\/f=1)/\Mа<2^63 /\ (if c then (Pа:о)+Tа else (Pа:о)-Tа)=sg (f !=0) Mа:=by intro D f M;have:=D.toNat_lt have d:(Dа:о)=(if c then (Pа:о)+Tа else (Pа:о)-Tа)+ if c\/Tа<= Pа then 0 else 2^64:=by cases c<;>simp only[D,ite_true,Α,ite_false,true_or,false_or,η, τ]<;>(try split)<;>omega have e:-2^62<(if c then (Pа:о)+Tа else (Pа:о)-Tа) /\ (if c then (Pа:о)+Tа else (Pа:о)-Tа)<2^63:=by split<;>omega generalize (if c then (Pа:о)+Tа else (Pа:о)-Tа)=V at d e⊢ have g:f=0/\Dа<2^63\/f=1/\2^63<= Dа:=by simp only[f,<- ο,ξ];simp[ζ];omega rcases g with ⟨b,h⟩ | ⟨b,h⟩<;>simp[M,b,sg,UInt64.size]<;>split at d<;>omega @[noinline] def kW (relu:т) (w s t:р):р:=act relu (toWord (Model.fma (ofW w) (ofW s) (ofW t))) def kK (s t:р):н:=idxOf t+164-idxOf s def ed (s t:р):н:=max 1 (kK s t-51) def iE (s t:р):н:= if expOf s≠255/\expOf t≠255 then min 254 (kK s t)+1-ed s t else 0 @[inline] def cw (rb sp st:Е) (P T σ:Д) (slow:Unit-> р):р:= let D:=if sp^^^st==0 then P+T else P-T let f:=D>>>63 let M:=if f==0 then D else 0-D let g:=sp^^^fж if M !=0 then let L:=Dense.lz M 0 let E:=σ+L-173 if E<253 then ((Eж<<<23)+(Core.aT (M<<<(63-L)))ж+(g<<<31))*((g&&&rb)^^^1) else slow () else slow () @[inline] def el (rb st ss lo cnt ms:Е) (mt kc c1:Д) (w:р) (slow:Unit-> р):р:= let ex:=(w>>>23)&&&0xFF if ex-lo>>31)^^^ss) st ((((w&&&0x7FFFFF) ||| 0x800000)и*msи)<<<(14+m-sh)) (mt<< р):р:= let ma:=Core.mW a let mb:=Core.mW b let ia:=if ma==0 then Core.iW b else Core.iW a let ib:=if mb==0 then Core.iW a else Core.iW b if (a>>>23)&&&0xFF!=255&&(b>>>23)&&&0xFF!=255&&ia-ib+38<77 then let hi:=if ia< ib then ib else ia cw rb (a>>>31) (b>>>31) (ma<<<(ia+38-hi)) (mb<<<(ib+38-hi)) (hi+111) slow else slow () lemma kp (n:н) (h:n<2^32):nлв=n:=ϧ h lemma kq (n:н) (h:n<2^64):nеа=n:=Ϛ h lemma fZ (a k:Д) (hk:kа<64) (h:aа*2^kа<2^64): (a<<push_cast<;>ring lemma li (b d:Е) (h:b=0\/b=1) (i:d=0\/d=1) (f:Д) (g:f=0\/f=1) (P T M:н) (e:(if b^^^d==0 then (P:о)+T else (P:о)-T)=sg (f !=0) M): sg (b !=0) P+sg (d !=0) T=sg (b^^^fж!=0) M /\ (b^^^fж=0\/b^^^fж=1):=by rcases h with rfl | rfl<;>rcases i with rfl | rfl<;>rcases g with rfl | rfl<;> simp[sg] at e⊢<;>omega lemma bx (a b:Е) (ha:a=0\/a=1) (hb:b=0\/b=1): ((a^^^b)!=0)=((a !=0) ^^ (b !=0))/\(a^^^b=0\/a^^^b=1):=by rcases ha with rfl | rfl<;>rcases hb with rfl | rfl<;>simp lemma fN (b:т) (u w:Е) (R:u=0\/u=1) (S:w=0\/w=1) (P T σ:Д) (X:Pа<2^62) (Y:Tа<2^62) (hσ:σа<=506) (y:lI) (v:Unit-> lI) (J:v ()=y) (hy:∀V:о,V=sg (u !=0) Pа*2^σа+sg (w !=0) Tа*2^σа -> V≠0-> y=act b (finishWord V (-298) false)): cw (if b then 1 else 0) u w P T σ v=y:=by unfold cw;dsimp only;obtain ⟨p,e,r⟩:=lx P T (u^^^w==0) X Y;generalize (if u^^^w==0 then P+T else P-T)=D at p e r⊢;generalize D>>>63=f at p e r⊢;generalize (if f==0 then D else 0-D)=M at e r⊢;obtain ⟨I,i⟩:=li u w R S f p _ _ _ r;generalize u^^^fж=g at I i⊢ have hV:sg (u !=0) Pа*2^σа+sg (w !=0) Tа*2^σа= sg (g !=0) Mа*2^σа:=by rw[<- add_mul,I] have ah:((if b then (1:Е) else 0)!=0)=b:=by cases b<;>rfl have U:=λh:Mа≠0=>hy _ hV.symm (mul_ne_zero (by unfold sg;split<;>omega) В) split;swap;. exact J rename_i W split;swap;. exact J rename_i q .simp only[bne_iff_ne,ne_eq] at W have t:Mа≠0:=λh=>W (ο.mp (by rw[h];rfl)) have K:(Dense.lz M 0)а=Mаз+1:=by rw[Dense.dU _ _ (by have:=Dense.iT M;simpa using this)];simp[Dense.bl,t] have B:=ϥ t;have E:=@Ϧ Mа;have Q:=(ϱ t).2 e;generalize Dense.lz M 0=L at K q⊢;generalize Mаз=l at K B E Q;have o:(63-L)а=62-l:=by simp[τ,K];omega generalize 63-L=z at o⊢;generalize hZ:62-l=Z at o have A:(M<<simp<;>clear*-q G H<;>omega have hX:(aX (g !=0) (M<<simp have O:(σа-Z-110)*2^23+(aT (M<< р) (F:o ()=act i (toWord (Model.fma (ofW w) (ofW s) (ofW t)))): el (if i then 1 else 0) (t>>>31) (s>>>31) (ed s t)л (iE s t)л (mW s).toUInt32 (mW t) (kK s t).toUInt64 (iW t+149) w o= act i (toWord (Model.fma (ofW w) (ofW s) (ofW t))):=by unfold el;dsimp only split;swap;. exact F rename_i b;unfold iE at b split at b;swap;. simp at b rename_i Y;obtain ⟨hs,ht⟩:=Y;have O:=nK s hs;have v:=nK t ht;have hK:kK s t=lE t+164-lE s:=rfl;have hL:ed s t=max 1 (kK s t-51):=rfl;have B:((w>>>23)&&&0xFF).toNat<256:=Dense.jU w;rw[Μ,UInt32.toNat_sub,kp _ А,kp _ А] at b;generalize N:(w>>>23)&&&0xFF=l at B b⊢;have p:lH w=l:=N have g:1<= lв/\lв<=254/\kK s t<= lв+51/\lв<= kK s t:=by have J:1<= ed s t/\kK s t<= ed s t+51/\ed s t<=400:=by rw[hL,hK];clear*-O v;omega generalize ed s t=L at b J have K:L<= l.toNat/\l.toNat<= min 254 (kK s t):=by have hM:=min_le_left 254 (kK s t);have:=J.2.2;generalize min 254 (kK s t)=M at b hM⊢;clear*-b B hM this;omega exact ⟨J.1.trans K.1,K.2.trans (min_le_left _ _),J.2.1.trans (nJ K.1 51), K.2.trans (min_le_right _ _)⟩ have q:lH w≠255/\lH w≠0:=by rw[p];constructor<;>intro h<;>simp[h] at g have G:=q.2;have X:lK w=2^23+(w&&&0x7FFFFF)в:=by unfold lK l8;rw[if_neg G] have P:lE w=lв-1:=by unfold lE;rw[if_neg G,p] have S:(((w&&&0x7FFFFF) ||| 0x800000)и)а=lK w:=by rw[Ι,nw,show (0x800000:Е)в=2^23*1 from rfl,Nat.lor_comm, <- ώ (fO w),X];ring have U:=am s;have W:=am t;have r:=ap t;have R:=lT w;have D:=lT s;have Q:=lT t have j:((kK s t)е-lи)а=kK s t-lв:=by rw[μ _ _ (by rw[γ,kq _ А,Ι];omega), kq _ А,Ι] generalize (kK s t)е-lи=y at j⊢;generalize hu:kK s t-l.toNat=u at j have d:(if y<37 then y else 37).toNat=min u 37:=by split<;>rename_i h<;>rw[θ,j] at h<;>simp[j] at h⊢<;>omega generalize (if y<37 then y else 37)=m at d⊢ have z:(14+m-y).toNat=14+min u 37-u:=by have e:(14+m).toNat=14+min u 37:=by rw[et _ _ (by rw[d];simp;clear*-;omega),d];rfl rw[μ _ _ (by rw[γ,e,j];clear*-hu g;omega),e,j] have hσ:(iW t+149-m).toNat=idxOf t+149-min u 37:=by have e:(iW t+149)а=lE t+149:=by rw[et _ _ (by rw[r];simp;clear*-v;omega),r];rfl rw[μ _ _ (by rw[γ,e,d];clear*-;omega),e,d] have A:lK w*lK s<2^48:=(ϋ R D:) have E:(mW s)жиа=lK s:=by rw[Ι,ϐ,U];exact ε (D.trans Б) have hm:(((w&&&0x7FFFFF) ||| 0x800000)и*(mW s)жи)а=lK w*lK s:=by rw[Ν,S,E];clear*-A;omega have H:=eA _ (14+m-y) _ 48 hm A (by rw[z];clear*-;omega) have I:=eA _ m _ 24 W Q (by rw[d];clear*-;omega) rw[z] at H;rw[d] at I;obtain ⟨b1,b3⟩:=bx _ _ (dz w) (dz s) refine fN i _ _ b3 (dz t) _ _ _ (H.1 ▸ H.2) (I.1 ▸ I.2) (by rw[hσ];clear*-v;omega) _ o F λV hV h0=>?_ rw[gP w s t q.1 hs ht V ?_ h0];rw[hV];symm rw[b1,cQ w,cQ s,cQ t,ki,hσ,H.1,I.1,<- cO,<- cO,mul_assoc, mul_assoc,<- pow_add,<- pow_add] have k1:=nL g.2.2.2 hu;have k2:=nL g.1 P.symm;have k3:kK s t+lE s=lE t+164:=by have:=g.1.trans g.2.2.2;clear*-hK this;omega rw[show 14+min u 37-u+(lE t+149-min u 37)=lE w+lE s by clear*-k1 k2 k3 g;omega, Nat.add_sub_cancel' ((Nat.min_le_right u 37).trans А)] @[specialize] def dZ (stop:с) (f:(i:с)-> iб р-> р) (i:с) (x:п р) (h:stopб<= xг):п р:= if hi:i iб lI-> lI) (F:н-> lI-> lI) (p:∀i d w,f i d w=F iб w) (i:с) (x:п lI) (h:bб<= xг): (dZ b f i x h)г=xг /\ ∀j,(dZ b f i x h)[j]?=if iб<= j/\j have o:iб?_⟩ rw[g,Dense.an d,Array.uset_eq_set,Array.getElem?_set o];by_cases l:iб=j .subst l rw[if_neg А,if_pos rfl,if_pos А,l7 o,Option.map_some,p];rfl .rw[if_neg l];split_ifs<;>first | rfl | omega .next i x h d=>exact ⟨rfl,λj=>by rw[if_neg (by rw[ι] at d;omega)]⟩ def cu (relu:т) (hw c:н) (s t:п р) (ch:н) (x:п р):п р:= if ch>>31 let ss:=sc>>>31 let lo:=(ed sc tc)л let cnt:=(iE sc tc)л let ms:=(Core.mW sc)ж let mt:=Core.mW tc let kc:=(kK sc tc)е let c1:=Core.iW tc+149 cu relu hw c s t (ch+1) (if h:stopб<= xг then dZ stop (λ_ _ w=>el rb st ss lo cnt ms mt kc c1 w λ_=>kW relu w sc tc) (ch*hw)д x h else x) else x termination_by c-ch lemma fw (e:т) (d c:н) (s t:п lI) (b:н) (x:п lI) (o:xг=c*d) (q:c*dact e (toWord (Model.fma (ofW w) (ofW s[j/d]!) (ofW t[j/d]!)))) else x[j]?:=by induction hk:c-b generalizing b x with | zero=> unfold cu;rw[if_neg А];split .have:c*d<= b*d:=χ _ А rw[mA А];rfl .rfl | succ k u=> have p:bact e (toWord (Model.fma (ofW w) (ofW s[b]!) (ofW t[b]!)))) (λ_ _ w=>kE e s[b]! t[b]! w (λ_=>kW e w s[b]! t[b]!) rfl) (b*d)д x (by rw[g];omega) rw[u (b+1) _ (by rw[i,o]) А,l,h,g, show (b+1)*d=b*d+d by ring] split_ifs<;>first | omega | rw[nP (k:=b) А (by rw[ϲ];omega)] | rfl def ck (relu:т) (c hw:н) (x s t:п р):п р:= if xг=c*hw/\c*hw lI) (v:i ()=act e (nn (Model.add (n4 a) (n4 b)))): ad (if e then 1 else 0) a b i=act e (nn (Model.add (n4 a) (n4 b))):=by unfold ad;dsimp only;have B:=am a;have D:=am b;have z:=lT a;have A:=lT b;have p:=kX a b;have hB:=kX b a;generalize (if mW a==0 then iW b else iW a)=j at p⊢;generalize (if mW b==0 then iW a else iW b)=l at hB⊢;generalize F:(if jrename_i h<;>rw[θ] at h<;>omega replace p:=p.1;replace hB:=hB.1;clear d F;have t:=k4 j g А o.2.1;have u:=k4 l g А o.2.2.2.1;have w:=eA _ (j+38-g) _ 24 B z (by rw[t];omega) have y:=eA _ (l+38-g) _ 24 D A (by rw[u];omega) rw[t] at w;rw[u] at y;have H:(g+111)а=gа+111:=et _ _ (by simp only[lC];omega) refine fN e _ _ (dz a) (dz b) _ _ _ (w.1 ▸ w.2) (y.1 ▸ y.2) (by rw[H];omega) _ i v λV J I=>?_ rw[gH a b q r V ?_ I];rw[J,w.1,y.1,H,cQ a,cQ b,f2 _ _ _ _ _ p o.1 o.2.1,f2 _ _ _ _ _ hB o.2.2.1 o.2.2.2.1] @[noinline] def lf (relu:т) (x y:р):р:=act relu (toWord (Model.add (ofW x) (ofW y))) def dO (relu:т) (a b:п р):п р:= if h:aг<= bг/\aг let y:=b.uget i (by rw[Dense.aa h.2] at hi;omega) ad rb x y λ_=>lf relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b lemma f6:dO=addReluSpec:=by funext d a b;unfold dO;dsimp only;split .rename_i h have g:aгдб=aг:=Dense.aa h.2;apply Array.ext_getElem?;intro j rw[(ek _ _ (λj x=>act d (nn (Model.add (n4 x) (n4 b[j]!)))) (λi l x=>?_) 0 a _).2 j, addReluSpec,nQ] .by_cases e:j т) (fa:н-> lI) (bx:Д) (s:ConvShape) (J:т) (I K b:п lI) (D:т) (nc Y:н) (r d:lI) (x:Д) (v:о) (B a:Д) (m:н) (e j:с) (bw:Д) (u:Е) {α:Type} lemma mo {a b:н} (h:arw[h]<;>norm_num lemma fR {n:н} (h:n<2^32):n%2^nf=n:=mo (lt_of_lt_of_le h ft) lemma cE (h:c<2^32):(mI c:с)б=c:=fR h lemma j8 (a:с) (c:н) (b:c<2^32) (h:a< mI c):aб>>31!=0 then o-x else o+x @[inline] def eQ:Е:=(c7 0x80000000 bw u)ж+0x80000000 @[inline] def wv:Д:=Dense.ao u @[inline] def ok (w:Е):т:= expOf w !=255&&(mW w==0 || iW w-E<= C) @[inline] def cF (a:п Е):Д:= a.foldl (λm w=>if mW w !=0&&iW w< m then iW w else m) 255 @[inline] def au:Д:=if S<25 then (V<<>>25 else V<<<(S-25) @[inline] def cv:Д:= let l:=au (mW u) (iW u-bx) if u>>>31!=0 then (0x2000000-l)&&&0x1FFFFFF else l @[inline] def bY:Д:= let s:=iW u-bx if u>>>31!=0 then 0x2000000000000-aB (mW u) s-(if au (mW u) s !=0 then 1 else 0) else 0x2000000000000+aB (mW u) s @[reducible,inline] def nl:н:=if t then 3 else 2 @[inline] def sU:с:=if t then 3 else 2 @[inline] def cW:с:=if t then 11 else 8 @[inline] def be (l:н):Е:= if t then (if l=0 then (cv bx u+0x1000000)ж else if l=1 then ((bY bx u&&&0x1FFFFFF)+0x1000000)ж else (bY bx u>>>25)ж) else let e:=c7 0x2000000000000 bx u if l=0 then ((e&&&0x1FFFFFF)+0x1000000)ж else (e>>>25)ж @[inline] def bu (h l:Д):Д:=(h<<<25)+l @[inline] def cC (h l:Д):Д:= ((h+0x8000000000000000)>>>(39:Д))-(0x1000000:Д)-(l>>>(63:Д))+ (if bu h l>>25)-0x4000000000 @[noinline] def eS (b c:Д):Д:= if t then let m:=b+aM a af ((cC c m<<<25)+(bu c m>>>39)) ((bu c m<<<25)+(a&&&0x1FFFFFF)) B else af (cC b a) (bu b a) B @[inline] def c8 (b c:Д):Д:= let m:=b+aM a let r:=if (b+0x4000000000000000)>>>63=0/\(c+0x4000000000000000)>>>63=0 then Dense.cx 0x2000000 ((if t then c+aM m else m) ||| (if (if t then m&&&0x1FFFFFF==0&&a&&&0x1FFFFFF==0 else a&&&0x1FFFFFF==0) then 0 else 1)) (B+if t then 50 else 25) else 0x100000000 if r=0x100000000 then eS t B a b c else r @[inline] def sg (m:Д):Д:=if u>>>31!=0 then 0-m else m @[inline] def ct (k:Д-> Д-> Д):Д:= let s:=iW u+149-B let v:=mW u if expOf u==255 || (v !=0&&s>62) then 0x100000000 else if u>>>31!=0 then k (0-au v s) (0-aB v s) else k (au v s) (aB v s) @[specialize] def lp (H:н) (f:н-> н-> п Е-> п Е): н-> н-> н-> п Е-> п Е | 0,_,_,a=>a | n+1,o,y,a=> let a:=f o y a if y+1 с-> Е) (s:с) (x:н):н-> с-> п Е-> п Е | 0,_,a=>a | m+1,e,a=>fY f s (x+1) m (e+s) (a.push (f x e)) @[inline] def hv (f:н-> Е) (v:Д) (x i:н):Е:= if v=0xFFFFFFFFFFFFFFFF then f (x+i) else (if i=0 then v else v>>>32)ж @[specialize] def fc (f:н-> Е) (g:н-> с-> Д) (s:с) (x:н):н-> с-> п Е-> п Е | 0,_,a=>a | m+1,e,a=>let v:=g x e match m with | 0=>a.push (hv f v x 0) | m+1=>fc f g s (x+2) m (e+s+s) ((a.push (hv f v x 0)).push (hv f v x 1)) @[inline] def f3 (O H W:н) (f:н-> н-> н-> Е):п Е:= if 0fY (λx _=>f o y x) 0 0 W 0) (O*H) 0 0 (Array.emptyWithCapacity (O*(H*W))) else #[] @[inline] def bC (c y x:н):Е:= if y<1\/x<1\/y-1>= h\/x-1>= w then 0 else I[(c*h+(y-1))*w+(x-1)]! lemma uL {a:п Е} {i:с} (h:i>>25)ж else let e:=c7 0x2000000000000 bx v ul (ul a q ((e&&&0x1FFFFFF)+0x1000000)ж) (q+1) (e>>>25)ж @[specialize] def i6 (px:с-> п Е-> Е-> п Е) (s:с) (f:н-> Е) (i:н): н-> с-> п Е-> п Е | 0,_,a=>a | m+1,q,a=>i6 px s f (i+1) m (q+s) (px q a (f i)) @[inline] def iD (c y:н) (a:п Е): п Е:= if y<1\/y-1>= h then a else i6 (ke t bx) (sU t) (λi=>I[i]!) ((c*h+(y-1))*w) w (nl t*((c*(h+2)+y)*(w+2))+nl t)д a @[inline] def gQ:п Е:= lp (h+2) (iD t h w bx I) (n*(h+2)) 0 0 (Array.replicate (nl t*(n*((h+2)*(w+2)))+3) 0x1000000) def dY (W:п Е) (j:н):н-> Д | 0=>0 | m+1=>wv W[j]!+dY W (j+1) m abbrev Kc:=Д-> Д-> Д-> Д-> Д-> Д-> Д lemma b8:(sU t)б=nl t:=by cases t<;>exact cE _ Б @[inline] def fm (zk:т) (h:eб+nl t+2 fm t P W (e+sU t) (j+1) zk ⟨by omega,by rw[(ix W j 1 Б h.2).1];omega⟩ a b c a' b' c' λa b c a' b' c'=> fm t P W (e+sU t+sU t) (j+2) zk ⟨by omega,by rw[(ix W j 2 Б h.2).1];omega⟩ a b c a' b' c' k abbrev G9 (R i j:с):Prop:=i<0x40000000/\R<0x10000000/\j<0x40000000/\i+R+R+cW texact cE _ Б have e:(i+R)б=iб+Rб:=by rw[Υ];exact mo А have g:(i+R+R)б=iб+2*Rб:=by rw[Υ,e];exact (mo А).trans А have p:(i+R+R+cW t)б=iб+2*Rб+(3*nl t+2):=by rw[Υ,g,o];exact mo (by cases t<;>simp[nl]<;>omega) have b:∀c,c<9->(j+mI c)б=jб+c:=λc q=>by rw[Υ,cE c А];exact mo А rw[b 8 Б] at d;exact ⟨h1,h3,e,g,by omega,b 3 Б,b 6 Б,d⟩ @[inline] def cn (zk:т) (R i j:с) (a b c a' b' c':Д) (k:Kc):Д:= if h:G9 t P W R i j then have h:=la h ac t P W i j zk А a b c a' b' c' λa b c a' b' c'=> ac t P W (i+R) (j+3) zk А a b c a' b' c' λa b c a' b' c'=> ac t P W (i+R+R) (j+6) zk А a b c a' b' c' k else 0xFFFFFFFFFFFFFFFF @[specialize] def bR (win:с-> с-> Д-> Д-> Д-> Д-> Д-> Д-> Kc-> Д) (fn:Kc) (n di dj k i j:с) (a b c a' b' c':Д):Д:= if h:kbR win fn n di dj (k+1) (i+di) (j+dj) a b c a' b' c' else fn a b c a' b' c' termination_by nб-kб decreasing_by have h1:=ι.mp h rw[Υ,϶,mo (lt_of_le_of_lt h1 n.toNat_lt_size)] omega @[noinline] def d9 (kk k cb o y x:н):р:= dotOf (k+1) (λi=>if iif il @[inline] def bH (bo:р):Д:=ct B bo λ_ h=>h @[inline] def cw (J:т) (a b c a' b' c':Д):Д:= let r:=c8 t B a b c let r':=c8 t B a' b' c' if r<0x100000000/\r'<0x100000000 then (act J rж)и+((act J r'ж)и<<<32) else 0xFFFFFFFFFFFFFFFF @[inline] def eO (J zk:т) (l h:Д) (R pl ncU i0 j0:с) (sw:Д):Д:= if l=0x100000000 then 0xFFFFFFFFFFFFFFFF else let a:=l-(sw<<<24) let b:=h-(sw<<<24) let c:=if t then (0:Д)-(sw<<<24) else 0 if ncU=1 then cn t P W zk R i0 j0 a b c a b c (cw t B J) else bR (cn t P W zk R) (cw t B J) ncU pl 9 0 i0 j0 a b c a b c def dS:п р:= if D then depthwiseSpec s J I K b else conv2dSpec s J I K b abbrev cG (H V:н):Prop:=bx<=255/\bw<=255/\K.all (ok 7 bw)/\k<=95/\0dY W (oй*k) k let B:=bx+bw let BL:п Д:=Array.ofFn (n:=Y) λo=>bL B b[oй]! let BH:п Д:=Array.ofFn (n:=Y) λo=>bH B b[oй]! let HV:=H*V let R:=(nl t*V)д let pl:=(nl t*HV)д let ncU:=ncд let kU:=kд lp s.h (λo y=> let cb:=if D then o else 0 let l:=BL[o]! let h:=BH[o]! let sw:=SW[o]! let j:=oд*kU fc (λx=>act J (d9 s I K b 9 k cb o y x)) (λ_ e=>eO t P W B J zk l h R pl ncU e j sw) (sU t) 0 s.w (nl t*(cb*HV+y*V))д) (Y*s.h) 0 0 (Array.emptyWithCapacity (Y*(s.h*s.w))) else dS s J I K b D @[noinline] def lv (bx:Д) (h:I.all (ok 50 bx)=true):п р:=gL true s J I K b D nc Y false bx h def iV:п р:= let bx:=cF I if s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1 then if h:I.all (ok 25 bx)=true then gL false s J I K b D nc Y false bx h else if h:I.all (ok 50 bx)=true then lv s J I K b D nc Y bx h else dS s J I K b D else dS s J I K b D def jQ:п р:= let bx:=cF I if h:s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1/\I.all (ok 25 bx)=true then gL false s J I K b D nc Y true bx h.2.2.2.2 else iV s J I K b D nc Y def iU:п р:= if K.any (λu=>mW u==0) then jQ s J I K b D nc Y else iV s J I K b D nc Y def eM:п р:= iU s J I K b false s.cin s.cout def d6:п р:= iU s J I K b true 1 s.cin @[inline] def sk:Е:= if u<0x80000000 then u+0x80000000 else if u==0x80000000 then 0x80000000 else 0xFFFFFFFF-u @[inline] def mx:р:= if expOf y≠255/\expOf z≠255/\(sk y р-> α) (I:п р) (w k:н):н-> н-> н-> α-> α | 0,_,_,acc=>acc | n+1,i,dx,acc=> let acc:=g acc I[i]! if dx+1 let U:=(ch*h+y*k)*w+x*k wl mx I w k (k*k) U 0 I[U]! else maxpoolSpec c h w k I @[inline] def iq:р:= let q:=expOf d-127 if fracOf d=0/\127<= expOf d/\q Д):=wl λ(a:Д) x=>a+f x @[reducible] def wa:=wl λ(b:т) x=>b&&Q x @[noinline] def iS (ch y x:н):р:= dotOf (k*k) (poolAt h w k I ch y x) λ_=>oneW @[inline] def wo (A H:Д) (g:Unit-> т) (fb:Unit-> р) (d:р):р:= if A=0/\H=0 then (if g () then 0x80000000 else 0) else let r:=Dense.cd (cC H A) (bu H A) (B+149) iq (if r<0x100000000 then rж else fb ()) d @[inline] def aA (w:р):Д:=if mW w !=0 then iW w else 255 @[reducible] def kx:=wl λ(m:Д) x=>min m (aA x) @[inline] def iX:Д:=bY B u-0x2000000000000 def wq (ch y x:н):р:= let U:=(ch*h+y*k)*w+x*k let B:=kx I w k (k*k) U 0 255 if B<=255/\wa (ok 50 B) I w k (k*k) U 0 true=true then wo B (eJ (cv B) I w k (k*k) U 0 0) (eJ (iX B) I w k (k*k) U 0 0) (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>iS h w k I ch y x) d else toWord (Model.div (ofW (iS h w k I ch y x)) (ofW d)) @[inline] def eH (x0 x1 x2 x3:р):т:=Q x0&&Q x1&&Q x2&&Q x3 @[inline] def eF (u:р):Д:=((u>>>23)&&&0xFF)и @[inline] def jJ (ch y x:н) (e:с):р:= let v:=wд if hb:eeH (.==0x80000000) x0 x1 x2 x3) (λ_=>iS h w 2 I ch y x) d else wq h w 2 I d ch y x else wq h w 2 I d ch y x abbrev DQ:Prop:=signOf d=false/\expOf d≠0/\expOf d<255 def f7:п р:= let d:=natW (k*k) if 0fY (jJ h w I d o y) 2 0 (w/2) ((o*h+y*2)*w)д) (c*(h/2)) 0 0 (Array.emptyWithCapacity (c*(h/2*(w/2)))) else let bx:=cF I if bx<=255/\I.all (ok 25 bx)=true then f3 c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k wo bx (eJ (t1 bx) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>iS h w k I ch y x) d else f3 c (h/k) (w/k) (wq h w k I d) else avgpoolSpec c h w k I lemma b9:ab x=(xа:о)-2^64*(xа/2^63:н):=by unfold ab;rw[Ξ];have e:x.toBitVec.toNat=xа:=rfl;have:=x.toNat_lt;split<;>omega lemma k9 (h:(xа:о) ≡ v [ZMOD2^64]) (h1:-2^63<= v) (h2:v<2^63):ab x=v:=by rw[b9];have:=x.toNat_lt;unfold ni at h;omega def Z:ZMod (2^64):=xа lemma iI:(xа:о) ≡ v [ZMOD2^64]↔Z x=v:=by unfold Z rw[show ((xа:ℕ):ZMod (2^64))=(((xа:ℤ)):ZMod (2^64)) by push_cast;rfl, ZMod.intCast_eq_intCast_iff] rfl lemma sZ (h:Z x=v) (h1:-2^63<= v) (h2:v<2^63): ab x=v:=k9 x v ((iI x v).mpr h) h1 h2 lemma cY (b:Д):Z (a+b)=Z a+Z b:=by unfold Z;rw[η,mF];push_cast;ring lemma f5 (b:Д):Z (a*b)=Z a*Z b:=by unfold Z;rw[Ν,mF];push_cast;ring lemma es (b:Д):Z (a-b)=Z a-Z b:=by have hb:=b.toNat_lt;unfold Z;rw[τ,mF,Nat.cast_add,no А];rw[show ((2^64:н):ZMod (2^64))=0 from ZMod.natCast_self _];ring lemma jH:Z (wv u)=((Dense.ai u:о):ZMod (2^64)):= (iI (Dense.ao u) _).mp (by rw[<- Dense.aC,b9];unfold ni;omega) lemma kz:Z (a<<<(24:Д))=Z a*2^24:=by unfold Z;rw[ς,mF];simp only[κ,ϝ,lO,lM];push_cast;ring lemma bV:Z 0=0:=by simp[Z] lemma cR {B:Д} (h:B<=255):Bа<=255:=by simpa using γ.mp h def aD (e:н) (w:Е):о:=sv w*2^(idxOf w-e) lemma f1 (h:lK u=0):sv u=0:=by unfold sv;simp[h] lemma dX (b:Д) (hb:bа<= aа):(a-b)а=aа-bа:=by rw[τ];have:=a.toNat_lt;omega lemma k0 (h:lK u=0):mW u=0:= ο.mp (by rw[am,h];rfl) lemma bD (w:Е) (g:Eа<=255) (e:Cа<=62) (h:ok C E w=true): lH w≠255/\(lK w=0\/(Eа<= lE w/\lE w<= Eа+Cа /\ (iW w-E)а=lE w-Eа)):=by simp only[ok,Ε,bne_iff_ne,ne_eq,Ϩ,beq_iff_eq] at h;refine ⟨h.1,?_⟩;rcases h.2 with b | h1 .left;have:=am w;rw[b] at this;simp at this;omega .right;have d:=ap w;have h2:=γ.mp (of_decide_eq_true h1);have:=nK w h.1;rw[τ,d] at h2⊢;omega lemma pw (v s c:н) (d:v<2^24) (b:s<= c):v*2^s<2^(24+c):=by rw[pow_add];exact lZ d (υ Г b) В lemma ff (e:Д) (w:Е) (c:н) (i:c<=39) (h:lK w=0\/(eа<= lE w/\lE w<= eа+c /\ (iW w-e)а=lE w-eа)): (mW w<<<(iW w-e))а=lK w*2^(lE w-eа) /\ lK w*2^(lE w-eа)<2^(24+c):=by have d:=lT w;rcases h with b | ⟨h1,h2,g⟩ .rw[k0 w b,b];simp .have h3:=pw _ _ c d (show lE w-eа<= c by omega);refine ⟨?_,h3⟩ rw[ς,am,g,κ, mo (a:=lE w-eа) А] exact mo (lt_of_lt_of_le h3 (υ Г А)) lemma eR (o c e:Д) (w:Е) (N P:н) (l:oа=N) (hb:eа<=255) (i:cа<=39) (g:2^(24+cа)<= P/\P<= N/\N+P<=2^64) (h:ok c e w=true): ((c7 o e w)а:о)=N+aD eа w /\ |aD eа w| simp only[fT,ite_false,ite_true,neg_mul,hX,abs_lt] .rw[η,b];omega .rw[dX _ _ А,b];omega lemma d8 (hb:bwа<=255) (h:ok 7 bw u=true): Dense.ai (eQ bw u)=aD bwа u /\ |aD bwа u| <2^31:=by obtain ⟨h1,h2⟩:=eR 0x80000000 7 bw u (2^31) (2^31) rfl hb Б Б h;rw[abs_lt] at h2;refine ⟨?_,abs_lt.2 h2⟩;rw[Dense.bK,eQ,ϯ,ϐ];simp only[UInt32.reduceToNat];split<;>omega lemma bF:(x&&&0x1FFFFFF)а=xа%2^25:=by rw[ϛ,show (0x1FFFFFF:Д)а=2^25-1 from rfl, ν] lemma ik:((x&&&0x1FFFFFF)а:о)=ab x%2^25:=by rw[bF,b9];omega lemma dJ:(x>>>25)а=xа/2^25:=by simp[ζ] lemma gU (b:Vа<2^24) (h:V=0\/Sа<=62): (au V S)а=Vа*2^Sа%2^25 /\ (aB V S)а=Vа*2^Sа/2^25:=by unfold au aB;rcases h with rfl | h .split<;>simp split .rename_i h1 have h1:Sа<25:=by simpa using θ.mp h1 have e:(V<<simp only[fT,ite_false,ite_true,neg_mul,l] .simp;clear*-o p g e d;omega .have v:(if j !=0 then (1:Д) else 0)а=if jа=0 then 0 else 1:=by by_cases b:j=0<;>simp[b];intro h1;exact b (ο.mp (by simpa using h1)) rw[bF,dX _ _ (by simp;omega),dX _ _ (by rw[v,dX _ _ (by simp;omega)];simp;split<;>omega), dX _ _ (by simp;omega),v] simp;split<;>rename_i B<;>(clear*-o p g e d B;omega) lemma ks (h:xа<2^32):xжв=xа:=by exact mo h lemma jI (h:xа<2^25):(x+0x1000000)жв=xа+2^24:=by simp;omega lemma dn (hb:bxа<=255) (h:ok (if t then 50 else 25) bx u=true): (∀lsimp only[nl,fT,ite_true,ite_false] at h⊢ .obtain ⟨h1,h2⟩:=eR 0x2000000000000 25 bx u (2^49) (2^49) rfl hb Б Б h;rw[abs_lt] at h2;have b:(be false bx u 0)в=(c7 0x2000000000000 bx u)а%2^25+2^24:=by show ((c7 0x2000000000000 bx u&&&0x1FFFFFF)+0x1000000)жв=_;rw[jI _ (by rw[bF];omega),bF] have d:(be false bx u 1)в=(c7 0x2000000000000 bx u)а/2^25:=by show (c7 0x2000000000000 bx u>>>25)жв=_;rw[ks _ (by rw[dJ];omega),dJ] refine ⟨λl g=>?_,by rw[b,d];omega⟩ interval_cases l<;>simp only[b,d]<;>omega .obtain ⟨h1,h2,h3⟩:=fM bx u hb h;have b:(be true bx u 0)в=(cv bx u)а+2^24:=by show (cv bx u+0x1000000)жв=_;rw[jI _ А] have d:(be true bx u 1)в=(bY bx u)а%2^25+2^24:=by show ((bY bx u&&&0x1FFFFFF)+0x1000000)жв=_;rw[jI _ (by rw[bF];omega),bF] have e:(be true bx u 2)в=(bY bx u)а/2^25:=by show (bY bx u>>>25)жв=_;rw[ks _ (by rw[dJ];omega),dJ] refine ⟨λl g=>?_,by rw[b,d,e];omega⟩ interval_cases l<;>simp only[b,d,e]<;>omega lemma gw:-2^63<= ab x/\ab x<2^63:=by rw[b9];have:=x.toNat_lt;omega lemma ld (b:Д):((a+b)а:о) ≡ (aа:о)+bа [ZMOD2^64]:=by unfold ni;rw[η];omega lemma jN (b:Д):((a-b)а:о) ≡ (aа:о)-bа [ZMOD2^64]:=by have:=b.toNat_lt;unfold ni;rw[τ];omega lemma kM: (((a+(0x8000000000000000:Д))>>>(39:Д))а:о)= (aа/2^39:н)+(if aа<2^63 then 2^24 else-2^24):=by have ha:=a.toNat_lt;rw[ξ,η];simp only[ζ,ϝ,lO,lM];split<;>omega lemma cV (b d:Д): ae (cC b d) (bu b d)=ab b*2^25+ab d:=by have e:=b.toNat_lt;have hB:=d.toNat_lt;have i:(bu b d)а=((bа%2^39)*2^25+dа)%2^64:=by unfold bu;rw[η,ς];simp only[κ,ϝ,lO,lM];omega set c:о:=if bu b d=2^64 then 1 else 0:=by rw[g];simp only[θ,i];split_ifs<;>omega set l:о:=(bа/2^39:н)+(if bа<2^63 then 0 else-2^25)- (dа/2^63:н)+c with h2 have h3:((cC b d)а:о) ≡ l [ZMOD2^64]:=by unfold cC refine (ld _ _).trans (Int.ModEq.add ((jN _ _).trans (Int.ModEq.sub ((jN _ _).trans ?_) (by rw[ξ];simp only[ζ,ϝ,lO,lM];rfl))) ?_) .rw[kM];have:((0x1000000:Д)а:о)=2^24:=rfl;rw[this] split<;>(unfold ni;ring_nf) .rw[g];split<;>rfl have j:0<= c/\c<=1:=by rw[g];split<;>decide have o:=k9 _ l h3 (by rw[h2];clear*-e hB j;split<;>omega) (by rw[h2];clear*-e hB j;split<;>omega) unfold ae;rw[o,b9,b9,i,h2,h1];clear*-e hB;split_ifs<;>omega lemma gs:ab (aM a)=ab a/2^25:=by have:=a.toNat_lt;unfold aM;rw[b9,b9];simp only[τ,ξ,η, ζ,ϝ,lO,lM];omega lemma gB (d b r:Д) (e:rа<2^25) (hb:-2^101<= ae d b/\ae d b<2^101): ae ((d<<<(25:Д))+(b>>>(39:Д))) ((b<<<(25:Д))+r)= ae d b*2^25+rа:=by have:=b.toNat_lt;have:=d.toNat_lt;simp only[ae,b9,η,ς,ξ, κ,ζ,ϝ,lO,lM] at hb⊢;omega lemma ij (b:Д) (d:-2^63<= ab b+ab a/2^25/\ab b+ab a/2^25<2^63): ab (b+aM a)=ab b+ab a/2^25:=by rw[<- gs] at d⊢;have:=b.toNat_lt;have:=(aM a).toNat_lt;simp only[b9,η] at d⊢;omega lemma kV (h:(x+0x4000000000000000)>>>63=0):-2^62<= ab x/\ab x<2^62:=by have:=x.toNat_lt;have b:((x+0x4000000000000000)>>>63)а=0:=by rw[h];rfl simp only[ξ,η,ζ,ϝ,lO, lM] at b;rw[b9];omega lemma io (y:Д):(y==0)=true↔yа=0:=by simp[<- ο] lemma kY (m n:Д):(m&&&0x1FFFFFF)а*2^25+(n&&&0x1FFFFFF)а<2^50 /\ (((m&&&0x1FFFFFF==0&&n&&&0x1FFFFFF==0)=true)↔(m&&&0x1FFFFFF)а*2^25+(n&&&0x1FFFFFF)а=0):=by rw[Ε,io,io,bF,bF];have:=Λ mа (show 0<2^25 by decide) have:=Λ nа (show 0<2^25 by decide);omega lemma jz (A P C:о):A+P*2^25+C*2^50= (C+(P+A/2^25)/2^25)*2^50+((P+A/2^25)%2^25*2^25+A%2^25):=by omega lemma iu (b c:Д) (g:-2^63<= ab b+ab a/2^25/\ab b+ab a/2^25<2^63): ∃H L,(∀B,eS t B a b c=af H L B) /\ ae H L=ab a+ab b*2^25+(if t then ab c*2^50 else 0):=by cases t .refine ⟨cC b a,bu b a,λB=>by unfold eS;rw[if_neg Bool.false_ne_true],?_⟩;rw[cV];simp only[fT,ite_false,add_zero];ring refine ⟨(cC c (b+aM a)<<<25)+(bu c (b+aM a)>>>39), (bu c (b+aM a)<<<25)+(a&&&0x1FFFFFF),λB=>by unfold eS;rw[if_pos rfl],?_⟩ have e:=ij a b g;have d:=cV c (b+aM a);have:=gw c;have:=gw a;have i:(a&&&0x1FFFFFF)а<2^25:=by rw[bF];omega rw[gB _ _ _ i ?_,d,ik,if_pos rfl] .omega rw[d];constructor<;>omega lemma gR {X S Y Z:Д} (b:Y=Z) (hX:X≠S-> X=Z):(if X=S then Y else X)=Z:=by by_cases h:X=S .rw[if_pos h,b] .rw[if_neg h,hX h] lemma jW (b c H L:Д) (e:∀B,eS t B a b c=af H L B) (i:ae H L=ab a+ab b*2^25+(if t then ab c*2^50 else 0)) (B:Д): c8 t B a b c=af H L B:=by have e:=e B;unfold c8;dsimp only;rw[Dense.cB];by_cases g:(b+0x4000000000000000)>>>63=0/\(c+0x4000000000000000)>>>63=0 .rw[if_pos g] have hb:=kV b g.1;have o:=kV c g.2;have:=gw a;have j:=ij a b (by constructor<;>omega) have d:=ik a;cases t .simp only[Α,ite_false,add_zero] at i⊢ refine gR e λh=>dD (b+aM a) B 25 H L _ _ Б (by rw[bF];exact Λ _ Б) (io _) ?_ h show _=_*2^25+_;rw[i,j,d];omega .simp only[ite_true] at i⊢ have l:=ij (b+aM a) c (by rw[j];constructor<;>omega) refine gR e λh=>dD (c+aM (b+aM a)) B 50 H L _ _ Б (kY _ _).1 (kY _ _).2 ?_ h show _=_*2^50+_;push_cast;rw[i,l,ik,d,j];exact jz _ _ _ .rw[if_neg g,if_pos rfl,e] def aU (a b c:α):н-> α | 0=>a | 1=>b | _=>c lemma fp (a b:Е) (d e:н) (ha:lK a=0\/d<= lE a) (hb:lK b=0\/e<= lE b):tm a b=aD d a*aD e b*2^(d+e):=by unfold tm aD;rcases ha with ha | ha .simp[f1 a ha] rcases hb with hb | hb .simp[f1 b hb] rw[show lE a+lE b=(lE a-d)+(lE b-e)+(d+e) by omega,pow_add,pow_add];ring lemma kn:tm nD u=sv u*2^(lE u+149):=by unfold tm;rw[show sv nD=2^23 by decide,show lE nD=126 by decide, show lE u+149=23+(126+lE u) by omega,pow_add,ϒ 126];ring lemma cP (f:н-> о) (M:о) (h:∀th t (mr b)).trans (by simp)) lemma jj (d:н-> lI) (j e:н) (B:Д) (hB:Bа=j+e) (hk:k<=95) (A:∀i н-> о) (Y:∀l<3,∀i ∀i(abs_mul _ _).trans_le (mul_le_mul (Y l I i g) (hW i g).le (abs_nonneg _) Г)).trans (mul_le_mul_of_nonneg_right (show (k:о)<=95 by exact_mod_cast hk) Г) have R: |aU p o 0 l| <2^61:=by match l with | 0=>exact F.trans Г | 1=>exact G | _+2=>simp[aU] have:=abs_le.mp h1;have:=abs_lt.mp R;exact ⟨sZ _ _ (hz l I) (by linarith) (by linarith),h1⟩ obtain ⟨r,N⟩:=q 0 Б;obtain ⟨u,O⟩:=q 1 Б;obtain ⟨M,-⟩:=q 2 Б;simp only[aU] at r u M;have:=abs_le.mp N;have:=abs_le.mp O;have:=abs_lt.mp F;have:=abs_lt.mp G;obtain ⟨H,v,hf,K⟩:=iu t a b c (by rw[r,u];constructor<;>omega);rw[jW t a b c H v hf K] at J⊢;refine aR (k+1) fa d H v B (λi g=>?_) ?_ J .rcases Nat.lt_or_ge i k with h | h .exact ⟨(A i h).1,(h3 i h).1⟩ .rw[show i=k by omega,D];exact ⟨by decide,U⟩ have hc:(if t then ab c*2^50 else 0)=(∑i∈lG k,L 2 i*aD e (d i))*2^50:=by cases t .rw[Finset.sum_eq_zero λi g=>by rw[h2 rfl i (mr g),nZ]];simp .simp[M] rw[K,r,u,hc,eg,D,kn,X,hB];unfold aN rw[Ζ rfl λi g=>by rw[fp _ _ j e (A i (mr g)).2 (h3 i (mr g)).2, <- hX i (mr g)]] rw[Ζ rfl λi _=>show (L 0 i+L 1 i*2^25+L 2 i*2^50)*aD e (d i)* 2^(j+e)=L 0 i*aD e (d i)*2^(j+e)+L 1 i*aD e (d i)*(2^25*2^(j+e))+ L 2 i*aD e (d i)*(2^50*2^(j+e)) by ring] rw[Ϥ,Ϥ,<- ϖ,<- ϖ,<- ϖ];ring abbrev aE (g:н-> Е):п Е:=Array.ofFn (n:=m) λq=>g qй lemma bB (g:н-> Е):(aE m g).push (g m)=aE (m+1) g:=by simp[aE];rw[Array.ofFn_succ (f:=λq:Fin (m+1)=>g qй)];rfl lemma gM (o y x H W:н) (d:y н-> п Е-> п Е) (S:н-> п Е-> Prop) (d:∀o y a,y S (o*H+y) a-> S (o*H+y+1) (f o y a)): ∀n o y a,y S (o*H+y) a-> S (o*H+y+n) (lp H f n o y a):=by intro n;induction n with | zero=>intro o y a _ h;exact h | succ n b=> intro o y a e h;have h1:=d o y a e h;simp[lp];split_ifs with h2 .rw[show o*H+y+(n+1)=o*H+(y+1)+n by ring];exact b _ _ _ h2 h1 .obtain rfl:H=y+1:=А rw[show o*(y+1)+y+(n+1)=(o+1)*(y+1)+0+n by ring];exact b _ _ _ А (by rw[show (o+1)*(y+1)+0=o*(y+1)+y+1 by ring];exact h1) lemma kZ (H W n c:н) (b:н-> н-> п Е-> п Е) (F:н-> н-> н-> Е) (p:0 o*H+y(∀j b o y (aE M g)=aE (M+W) g): lp H b n 0 0 (nj c)=aE (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W):=by have:=gT H b (λk a=>k<= n-> a=aE (W*k) λq=>F (q/(H*W)) (q/W%H) (q%W)) (λo y a d ha hk=>by rw[ha А];exact r _ _ _ _ d А λj u=>by obtain ⟨e,i,l⟩:=gM o y j H W d u;simp[show W*(o*H+y)+j=(o*H+y)*W+j by ring,e,i,l,Κ]) n 0 0 _ p λ_=>rfl simp[Nat.mul_zero,ϫ,Κ,ϓ W n] at this;exact this lemma jx (f:н-> Е) (g:н-> с-> Д) (G:н-> Е) (s:с) (m x:н) (E:н-> с) (M:н) (e:∀p,E (p+1)=E p+s+s) (b:∀j< m,G (M+j)=hv f (g (x+j/2*2) (E (j/2))) (x+j/2*2) (j%2)): fc f g s x m (E 0) (aE M G)=aE (M+m) G:=by induction m using Nat.twoStepInduction generalizing x E M with | zero=>rfl | one=>have:=b 0 Б;simp at this;rw[fc,<- this,bB] | more m i _=> have d:=b 0 А;have h1:=b 1 А;simp at d h1 rw[fc,<- d,bB,<- h1,bB,<- e,i _ (λp=>E (p+1)) _ (λp=>e _) λj l=>by rw[show M+1+1+j=M+(j+2) by omega,b (j+2) А,show (j+2)/2=j/2+1 by omega, show (j+2)%2=j%2 by omega,show x+(j/2+1)*2=x+2+j/2*2 by omega]] congr 1;omega lemma kf (f:н-> с-> Е) (g:н-> Е) (s:с):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jд))-> fY f s x m e (aE M g)=aE (M+m) g:=by intro m;induction m with | zero=>intro _ _ _ _;rfl | succ m i=> intro x e M d;have b:=d 0 А;rw[ύ,ύ,show (0:н)д=0 from rfl,USize.mul_zero,USize.add_zero] at b rw[fY,<- b,bB,i _ _ _ λj l=>by rw[show M+1+j=M+(j+1) by omega,d _ А,show x+(j+1)=x+1+j by omega, show (j+1)д=jд+1 from USize.ofNat_add j 1,USize.mul_add,USize.mul_one, USize.add_assoc,USize.add_comm (s*_)]];congr 1;omega lemma i1 (H W n c:н) (s:с) (E:н-> н-> с) (F:н-> н-> н-> с-> Е) (b:0fY (F o y) s 0 W (E o y)) n 0 0 (nj c)= aE (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)д):= kZ H W n c _ (λo y x=>F o y x (E o y+s*xд)) b λ_ _ _ _ _ _ d=> kf _ _ _ _ _ _ _ λj e=>by rw[d j e,Κ] lemma ic (O H W:н) (f:н-> н-> н-> Е): f3 O H W f=aE (O*(H*W)) λq=>f (q/(H*W)) (q/W%H) (q%W):=by unfold f3;split_ifs with h .rw[i1 _ _ _ _ 0 (λ_ _=>0) (λo y x _=>f o y x) h,ό] .simp[aE,show H=0 by omega] lemma kQ (g:α-> lI-> α) (I:п lI) (w k U:н): ∀n e d b,d wl g I w k n (U+e*w+d) d b= (List.range' (e*k+d) n).foldl (λb t=>g b I[U+t/k*w+t%k]!) b:=by intro n;induction n with | zero=>intro e d b _;rfl | succ n j=> intro e d b i;have l:(e*k+d)/k=e:=by rw[ϒ,ϑ _ _ А,ϕ i,Κ] have o:(e*k+d)%k=d:=by rw[ϒ,ϊ,mo i] rw[List.range'_succ,List.foldl_cons];simp only[wl,l,o];split_ifs with h .exact j e (d+1) _ h .obtain rfl:k=d+1:=А rw[show U+e*w+d+w+1-(d+1)=U+(e+1)*w+0 by rw[mO];omega, j (e+1) 0 _ А];congr 2;ring lemma ku (g:α-> р-> α) (I:п р) (w k U n:н) (b:α) (hk:0g b I[U+t/k*w+t%k]!) b:=by have:=kQ g I w k U n 0 0 b hk;simp[ϫ,ύ,<- List.range_eq_range'] at this;exact this lemma aa (h:n<2^32):nдб=n:=fR h lemma bZ:0decide abbrev c6 (N M:н) (g:н-> Е) (a:п Е):Prop:= aг=N+3 /\ ∀q Е} {a:п Е} (q:с) (v:Е) (p:N<2^30) (e:qб=M) (ha:c6 N M g a) (o:M?_⟩;rw[getElem!_pos _ i (by simp[Array.uset];omega)];simp only[Array.uset,Array.getElem_set] by_cases h1:qб=i .rw[if_pos h1,if_pos А,<- h1,e,l] .rw[if_neg h1,<- getElem!_pos a i А,d i b];split_ifs<;>first | rfl | omega lemma kj {N M m:н} {g:н-> Е} {a:п Е} (ha:c6 N M g a) (b:∀j< m,∀l?_⟩;rw[ha.2 q d];by_cases h1:q Е} {a:п Е} (b:N<2^30) (ha:c6 N M g a) (j:M+nl t<= N) (d:∀l(Mд+mI c)б=M+c:=λc p=>by rw[Υ,aa _ А,cE c А];exact fR А have o:=fq _ _ b (aa M А) ha (by have:=bZ t;omega) (d 0 (bZ t));have i:=fq _ _ b (e 1 Б) o (by cases t<;>simp[nl] at j<;>omega) (d 1 (by cases t<;>decide));cases t .exact i .exact fq _ _ b (e 2 Б) i (by simp[nl] at j;omega) (d 2 Б) lemma ju (f g:н-> Е) {N:н} (o:N<2^30): ∀m i M a,c6 N M g a-> M+nl t*m<= N->(∀j< m,∀l c6 N (M+nl t*m) g (i6 (ke t bx) (sU t) f i m Mд a):=by intro m;induction m with | zero=>intro _ _ _ ha _ _;exact ha | succ m p=> intro i M a ha e d;rw[Nat.mul_succ] at e⊢ rw[i6,show M.toUSize+sU t=(M+nl t).toUSize by show USize.ofNat M+_=USize.ofNat _;rw[USize.ofNat_add];cases t<;>rfl,<- Nat.add_assoc,ϵ] exact p _ _ _ (jt t bx _ o ha А λl b=>by simpa using d 0 А l b) А λj q l b=>by rw[show M+nl t+nl t*j+l=M+nl t*(j+1)+l by ring,d _ А l b, show i+(j+1)=i+1+j by omega] lemma jp (r:nl t*(n*((h+2)*(w+2)))<2^30): c6 (nl t*(n*((h+2)*(w+2)))) (nl t*(n*((h+2)*(w+2)))) (eU t h w bx I) (gQ t h w n bx I):=by have g:∀c y x l,(y<1\/y-1>= h\/x<1\/x-1>= w)-> l be t bx (bC h w I c y x) l=0x1000000:=λc y x l h b=>by unfold bC;rw[if_pos А];have v:mW 0=0:=Б rcases (show l=0\/l=1\/(l=2/\t=true) by cases t<;>simp[nl] at b⊢<;>omega) with rfl | rfl | ⟨rfl,rfl⟩<;>(try cases t)<;>simp[be,c7,cv,bY,au,aB,v]<;>decide have:=gT (h+2) (iD t h w bx I) (λk a=>k<= n*(h+2) -> c6 (nl t*(n*((h+2)*(w+2)))) (nl t*(w+2)*k) (eU t h w bx I) a) (λc y a u ha hk=>by have e:∀j l,j l eU t h w bx I (nl t*((c*(h+2)+y)*(w+2))+nl t*j+l)=be t bx (bC h w I c y j) l:= λj l d b=>by rw[<- fQ t h w bx I c y j l u d b];congr 1;ring have hb:nl t*((c*(h+2)+y)*(w+2))+nl t+nl t*w+nl t*1 <= nl t*(n*((h+2)*(w+2))):= calc _=nl t*((c*(h+2)+y+1)*(w+2)):=by ring _<= nl t*((n*(h+2))*(w+2)):=Ϣ _ (χ _ hk) _=_:=by ring have ha:=ha А;rw[show nl t*(w+2)*(c*(h+2)+y)=nl t*((c*(h+2)+y)*(w+2)) by ring] at ha rw[show nl t*(w+2)*(c*(h+2)+y+1)=nl t*((c*(h+2)+y)*(w+2))+ nl t+nl t*w+nl t*1 by ring] unfold iD;generalize nl t*((c*(h+2)+y)*(w+2))=M at* split .rw[show M+nl t+nl t*w+nl t*1=M+nl t*(w+2) by ring] exact kj t ha λj d l b=>by rw[e j l d b,g c y j l А b] .have o:=kj t (m:=1) ha λj d l b=>by rw[e j l А b,g c y j l А b] rw[ϰ] at o have p:=ju t bx (λi=>I[i]!) _ r w ((c*h+(y-1))*w) _ _ o А λj d l b=>by rw[show M+nl t+nl t*j+l=M+nl t*(j+1)+l by ring,e (j+1) l А b] unfold bC;rw[if_neg А,Nat.add_sub_cancel] exact kj t p λj d l b=>by rw[show M+nl t+nl t*w+nl t*j+l=M+nl t*(1+w+j)+l by ring, e (1+w+j) l А b,g c y _ l А b]) (n*(h+2)) 0 0 (Array.replicate (nl t*(n*((h+2)*(w+2)))+3) 0x1000000) А λ_=>⟨by simp,λq A=>by rw[if_neg (by simp),getElem!_pos _ q (by rw[Array.size_replicate];omega)];simp⟩ simp only[ϫ,Κ] at this;rw[show nl t*(w+2)*(n*(h+2))=nl t*(n*((h+2)*(w+2))) by ring] at this;exact this (le_refl _) lemma jo (c y x l:н) (d:csimp[dY,Z] | succ m b=> rw[dY,cY,jH,b,ϣ];simp only[wI,ύ,show ∀t,j+1+t=j+(t+1) from λt=>А];push_cast;ring lemma ca:Z x=((xа:о):ZMod (2^64)):=by unfold Z;norm_cast lemma ii:Z x=((ab x:о):ZMod (2^64)):= (iI x _).mp (by rw[b9];unfold ni;omega) lemma kN (m:Д) (h:mа<2^62): ab (sg u m)=if lV u then-(mа:о) else mа:=by unfold sg;rw[bq];cases lV u<;>simp only[fT,ite_true,ite_false] .exact sZ _ _ (ca m) А А .exact sZ _ _ (by rw[es,bV,ca];push_cast;ring) А А lemma gJ (hB:Bа<=510) (h:bL B u≠0x100000000): lH u≠255 /\ ∃g e:о,|g| <2^25 /\ |e| <2^61 /\ Z (bL B u)=g/\Z (bH B u)=e/\sv u*2^(lE u+149)=(e*2^25+g)*2^Bа:=by simp only[bL,bH,ct] at h⊢;split at h .exact absurd rfl h rename_i h3;simp only[if_neg h3] simp only[Ϩ,beq_iff_eq,Ε,bne_iff_ne,ne_eq,not_or,not_and, decide_eq_true_eq] at h3 obtain ⟨i,A⟩:=h3;have r:=lT u;have d:=ap u;have G:=nK u i;have D:=B.toNat_lt;have v:(iW u+149-B)а=(2^64-Bа+(lE u+149)%2^64)%2^64:=by rw[τ,η,d];rfl have j:mW u=0\/((iW u+149-B)а<=62 /\ (iW u+149-B)а=lE u+149-Bа/\Bа<= lE u+149):=by by_cases b:mW u=0 .exact .inl b have:(iW u+149-B)а<=62:=γ.mp (UInt64.not_lt.mp (A b));rw[v] at this⊢;right;clear*-this hB G D;omega obtain ⟨o,l⟩:=gU _ _ (by rw[am];exact r) (j.imp id (·.1));have hX:(lK u:о)*2^(lE u+149)= ((mW u)а*2^(iW u+149-B)а:н)*2^Bа:=by rcases j with b | ⟨-,h1,h2⟩ .simp[show lK u=0 by rw[<- am,b];rfl,b] .rw[am,h1];push_cast;rw[mul_assoc,<- pow_add,show lE u+149-Bа+Bа=lE u+149 by omega] have F:(mW u)а*2^(iW u+149-B)а<2^86:=by rcases j with b | ⟨b,-⟩ .simp[b] .exact pw _ _ 62 (by rw[am];exact r) b rw[bq];generalize (mW u)а*2^(iW u+149-B)а=X at o l hX F;generalize au (mW u) (iW u+149-B)=p at o⊢;generalize aB (mW u) (iW u+149-B)=d at l⊢;have q:(X:о)=dа*2^25+pа:=by rw[o,l];omega unfold sv;cases lV u<;>simp only[fT,ite_false,ite_true] .exact ⟨i,pа,dа,by rw[abs_lt];omega,by rw[abs_lt];omega,ca _,ca _,by rw[hX,q]⟩ .refine ⟨i,-(pа:о),-(dа:о),by rw[abs_lt];omega,by rw[abs_lt];omega,?_,?_, by rw[neg_mul,hX,q];ring⟩<;>(rw[es,bV,ca];push_cast;ring) def pv (q l:н):о:=if l Д) (a b c a' b' c':Д) (F G:н-> о):Prop:= ∃a1 b1 c1 a2 b2 c2,(∀k,f k=k a1 b1 c1 a2 b2 c2)/\(∀l<3,Z (aU a1 b1 c1 l)=Z (aU a b c l)+(F l:ZMod (2^64))) /\ ∀l<3,Z (aU a2 b2 c2 l)=Z (aU a' b' c' l)+(G l:ZMod (2^64)) lemma cl {f:Kc-> Д} {g:Д-> Д-> Д-> Д-> Д-> Д-> Kc-> Д} {a b c d e i:Д} {F G o p:н-> о} (O:St f a b c d e i F G) (R:∀a b c d e i,St (g a b c d e i) a b c d e i o p): St (λk=>f λa b c d e i=>g a b c d e i k) a b c d e i (λl=>F l+o l) λl=>G l+p l:=by obtain ⟨q,A,I,r,B,J,M,Y,U⟩:=O;obtain ⟨u,D,K,v,H,L,N,z2,X⟩:=R q A I r B J;exact ⟨u,D,K,v,H,L,λk=>by simp[M,N],λl j=>by rw[z2 l j,Y l j];push_cast;ring,λl j=>by rw[X l j,U l j];push_cast;ring⟩ lemma fg {f:Kc-> Д} {a b c j o p:Д} {F G g i:н-> о} (h:St f a b c j o p F G) (e:∀l,F l=g l) (D:∀l,G l=i l):St f a b c j o p g i:=by obtain ⟨q,u,A,r,v,B,h1,h2,h3⟩:=h;exact ⟨q,u,A,r,v,B,h1,λl d=>by rw[h2 l d,e],λl d=>by rw[h3 l d,D]⟩ lemma kR (a b:с) (h:aб+bб<2^32):(a+b)б=aб+bб:=fR h lemma ug (h:eбdecide)];rw[cY,f5,ug,uw,h1.1];push_cast;ring .cases t .simp[aU,pv,nl] .simp only[aU,pv,nl,ite_true,show (2:н)<3 from by decide];rw[cY,f5,ug,uw,h2.1];push_cast;ring lemma fo (h:eб+nl t+2pv t P eб l*wI W jб) λl=>pv t P (eб+nl t) l*wI W jб:=by have p:(e+sU t)б=eб+nl t:=by rw[eG _ _ P.usize (by rw[b8];omega),b8] have o:jбrfl,t3 t P W j e А o a b c,λl q=>by rw[<- p];exact t3 t P W j (e+sU t) А o d g i l q⟩ lemma fd (h:eб+3*nl t+2 ∑d∈lG 3,pv t P (eб+nl t*d) l*wI W (jб+d)) λl=> ∑d∈lG 3,pv t P (eб+nl t+nl t*d) l*wI W (jб+d):=by have p:=b8 t;have h1:(e+sU t)б=eб+nl t:=by rw[eG _ _ P.usize А,p] have h2:(e+sU t+sU t)б=eб+nl t*2:=by rw[eG _ _ P.usize А,h1,p];ring have q:(j+1)б=jб+1:=(ix W j 1 Б h.2).1;have r:(j+2)б=jб+2:=(ix W j 2 Б h.2).1 have:=cl (fo t P W e j А a b c g i o) λa b c g i o=> cl (fo t P W (e+sU t) (j+1) А a b c g i o) λa b c g i o=> fo t P W (e+sU t+sU t) (j+2) А a b c g i o refine fg this (λl=>?_) λl=>?_<;> simp only[h1,h2,q,r,Η,mD,Nat.mul_zero,ύ, ϰ,zero_add]<;>ring_nf def ag (R n d:н):н:=d/3*R+n*(d%3) lemma kC (d:с-> с-> Д-> Д-> Д-> Д-> Д-> Д-> Kc-> Д) (o:Kc) (n p q i j:с) (a b c e g l:Д): (if n=1 then d i j a b c e g l o else bR d o n p q 0 i j a b c e g l)=bR d o n p q 0 i j a b c e g l:=by split .subst_vars;rw[bR,dif_pos (ι.mpr (by simp))];congr;funext a b c e g l;rw[bR,dif_neg (by simp)] .rfl lemma gK (r:с-> с-> Д-> Д-> Д-> Д-> Д-> Д-> Kc-> Д) (I:Kc) (n o p:с) (G J:н-> н-> н-> о) (hd:oб<2^30/\pб<2^30) (hw:∀i j a b c d e g,(∀k,r i j a b c d e g k=0xFFFFFFFFFFFFFFFF) \/ (iб<2^30/\jб<2^30/\St (λk=>r i j a b c d e g k) a b c d e g (λl=>G l iб jб) λl=>J l iб jб)): ∀m k i j a b c d e g,nб-kб=m-> bR r I n o p k i j a b c d e g≠0xFFFFFFFFFFFFFFFF -> ∃v B F A D H,bR r I n o p k i j a b c d e g=I v B F A D H /\ (∀l<3,Z (aU v B F l)=Z (aU a b c l)+ ((∑q∈lG m,G l (iб+q*oб) (jб+q*pб):о):ZMod (2^64))) /\ ∀l<3,Z (aU A D H l)=Z (aU d e g l)+ ((∑q∈lG m,J l (iб+q*oб) (jб+q*pб):о):ZMod (2^64)):=by intro m;induction m with | zero=> intro k i j a b c d e g hm h1;have hk:¬kby simp,λl _=>by simp⟩ | succ m ih=> intro k i j a b c d e g hm h1;have hk:kby rw[kR _ _ А];ring have Y:∀q,(j+p)б+q*pб=jб+(q+1)*pб:=λq=>by rw[kR _ _ А];ring refine ⟨K,M,O,L,N,R,h3,λl u=>?_,λl u=>?_⟩<;> [rw[hz l u,z1 l u];rw[hy l u,y1 l u]]<;> simp only[X,Y]<;>rw[ϣ _ m]<;>simp only[ϫ,ύ]<;>push_cast<;>ring lemma bE:ok C E 0=true:=rfl lemma bW (a:п Е) (p:Е-> т) (h:a.all p=true) (d:p 0=true) (q:н): p a[q]! =true:=by by_cases b:q о): ∑q∈lG n,∑d∈lG m,F (q*m+d)=∑u∈lG (n*m),F u:=by induction n with | zero=>simp | succ n b=>rw[Η,b,ϲ,Finset.sum_range_add] lemma ws (R:с): ∀i j a b c e g o,(∀k,cn t P W false R i j a b c e g o k=0xFFFFFFFFFFFFFFFF)\/(iб<2^30/\jб<2^30 /\ St (λk=>cn t P W false R i j a b c e g o k) a b c e g o (λl=> ∑d∈lG 9,pv t P (iб+ag Rб (nl t) d) l*wI W (jб+d)) λl=> ∑d∈lG 9,pv t P (iб+nl t+ag Rб (nl t) d) l*wI W (jб+d)):=by intro i j a b c e g o;by_cases h:G9 t P W R i j .obtain ⟨r,u,p,q,B,v,A,D⟩:=la h;refine .inr ⟨r,u,?_⟩ have:=cl (fd t P W i j А a b c e g o) λa b c e g o=> cl (fd t P W (i+R) (j+3) А a b c e g o) λa b c e g o=> fd t P W (i+R+R) (j+6) А a b c e g o simp only[cn,dif_pos h];refine fg this (λl=>?_) λl=>?_<;> simp only[p,q,v,A,Η,mD,ag]<;>ring_nf .exact .inl λk=>by unfold cn;exact dif_neg h lemma pk (x y:Е):(xи+(yи<<<32))ж=x/\((xи+(yи<<<32))>>>32)ж=y:=by have b:=x.toNat_lt;have d:=y.toNat_lt have e:(xи+(yи<<<32))а=xв+yв*2^32:=by rw[η,ς];simp[κ];omega constructor<;>apply Β.mp<;>simp[e,ξ,ζ]<;>omega lemma kd (hs:s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1) (g:Д) (h0:I.all (ok (if t then 50 else 25) g)=true) {G Y p o y x k H V:н} {r L lo hi:Д} {W:п Е} (hH:H=s.h+2) (hV:V=s.w+2) (h3:k=G*9) (hW:W=K.map (eQ r)) (h4:L=dY W (o*k) k) (el:lo=bL (g+r) b[o]!) (eh:hi=bH (g+r) b[o]!) (hg:cG k g s K Y r H V) (ho:oact J (d9 s I K b 9 k p o y x)) v x 0=act J (d9 s I K b 9 k p o y x) /\ (x+1 hv (λx=>act J (d9 s I K b 9 k p o y x)) v x 1=act J (d9 s I K b 9 k p o y (x+1))):=by by_cases A:v=0xFFFFFFFFFFFFFFFF .simp[hv,A] unfold hv;rw[if_neg A,if_neg A];subst al;obtain ⟨h5,h6,h7,hk,-,-,hh,hw,h8,h9,hA⟩:=hg;have hC:=cR h5;have hD:=cR h6;generalize hP:gQ t s.h s.w s.cin g I=P at A⊢;have hE:(g+r)а=gа+rа:=by rw[η];omega have hF:nl t<=3:=by cases t<;>decide have hG:H*V<=4097*4097:=l5 А А;have:=Ϣ (nl t) hG;have:p*(H*V)<= s.cin*(H*V):=χ _ А;have hJ:(o+1)*k<= Y*k:=χ _ ho;rw[mO] at hJ;have hK:G<=95:=А have hI:∀xby have:=χ V (show y+1<= H by omega);rw[mO] at this;omega have:=hI x R have u1:=aa (nl t*(p*(H*V)+y*V+x)) (by have:=Ϣ (nl t) (show p*(H*V)+y*V+x<=2^27 by omega);omega) have u2:=aa (nl t*(H*V)) А;have u3:=aa (nl t*V) (by have:=Ϣ (nl t) (show V<=4097 by omega);omega);have u4:=aa (o*k) А;have u5:(9:с)б=9:=cE 9 Б;have u6:=aa G А have D:lo≠0x100000000:=λe=>by simp[eO,e] at A obtain ⟨hL,Lb,Hb,ah,hN,hO,hQ,hR⟩:=gJ _ _ А (el ▸ D:) have aA:∀x (F:н-> н-> н) (M N O:Д),x (∀q d,F q d=nl t*(p*(H*V)+y*V+x)+q*(nl t*(H*V))+ag (nl t*V) (nl t) d) -> (∀l<3,Z (aU M N O l)=Z (aU (lo-(L<<<24)) (hi-(L<<<24)) (if t then (0:Д)-(L<<<24) else 0) l)+ ((∑q∈lG G,∑d∈lG 9,pv t P (F q d) l*wI W (o*k+q*9+d):о):ZMod (2^64))) -> c8 t (g+r) M N O<0x100000000->(c8 t (g+r) M N O)ж=d9 s I K b 9 k p o y x:=by intro x F M N O R hq X hr;have:=hI x R simp only[hq] at X;have hU:∀u,ok (if t then 50 else 25) g (mY s I y x (p*9+u))=true:= λu=>kb _ _ s I h0 y x _ have hX:∀uА have hY:∀l,∑q∈lG G,∑d∈lG 9, pv t P (nl t*(p*(H*V)+y*V+x)+q*(nl t*(H*V))+ag (nl t*V) (nl t) d) l* wI W (o*k+q*9+d)= ∑u∈lG k,(if lΖ rfl λd hd=>?_ have hq:=mr hq;have hd:=mr hd;have B:q*9+d?_) (λu B=>?_) (by simp) (by simpa using hL) (λl u=>(if l?_) (λht u _=>?_) (λu B=>?_) (λu B=>?_) Lb Hb ah hN (by simpa using hR) M N O (λl D=>?_) hr).symm .simp only[if_pos B];obtain ⟨h1,h2⟩:=bD _ g _ hC (by cases t<;>decide) (hU u);exact ⟨h1,by omega⟩ .simp only[if_pos B];obtain ⟨h1,h2⟩:=bD 7 _ _ hD Б (bW K _ h7 (bE _ _) _);exact ⟨h1,by omega⟩ .split_ifs with D .have:=(dn t g _ hC (hU u)).1 l D;rw[abs_le];constructor<;>omega .simp .subst ht;simp[nl] .have:=(dn t g _ hC (hU u)).2 simp only[if_pos B];cases t<;>simp+decide only[ite_true,ite_false] at this⊢<;>omega .simp only[if_pos B];have:=(d8 _ _ hD (bW K _ h7 (bE _ _) (o*k+u))).2;exact this .beta_reduce;rw[X l D,hY l] have hS:Z L=((∑u∈lG k, aD rа (if uby rw[if_pos (mr B)];exact ig K _ hD h7 _ (hX u (mr B)) simp only[sub_mul,np,<- nI] interval_cases l<;>cases t<;> simp+decide only[aU,ite_true,ite_false,es,kz,bV,el,eh,hO,hQ,hS, Int.cast_add,Int.cast_sub,Int.cast_mul,Int.cast_pow,Int.cast_ofNat,Int.cast_zero,nZ, sub_zero]<;>ring unfold eO at A⊢;simp only[if_neg D] at A⊢;rw[kC] at A⊢ obtain ⟨a1,b1,c1,a2,b2,c2,hT,X,U⟩:=gK _ _ _ _ _ (λl i j=>∑d∈lG 9, pv t P (i+ag (nl t*V)дб (nl t) d) l*wI W (j+d)) (λl i j=>∑d∈lG 9, pv t P (i+nl t+ag (nl t*V)дб (nl t) d) l*wI W (j+d)) (by rw[u2,u5];omega) (ws t P _ _) G 0 _ _ _ _ _ _ _ _ (by rw[u6];rfl) A rw[hT] at A⊢;simp only[u1,u2,u3,u4,u5] at X U;unfold cw at A⊢;dsimp only at A⊢;split at A swap;. exact absurd rfl A rename_i hc;rw[if_pos hc];obtain ⟨p1,p2⟩:=pk (act J (c8 t (g+r) a1 b1 c1)ж) (act J (c8 t (g+r) a2 b2 c2)ж) refine ⟨by rw[if_pos (by trivial),p1,aA x _ a1 b1 c1 R (λq d=>rfl) X hc.1], λas=>by rw[if_neg Б,p2,aA (x+1) _ a2 b2 c2 as (λq d=>by ring) U hc.2]⟩ lemma cI [Inhabited α] (n:н) (f:Fin n-> α) (i:н) (h:iby rcases u with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp<;>omega rw[kZ _ _ _ _ _ (λo y x=>act J (d9 s I K b 9 (nc*9) (if D then o else 0) o y x)) A λo y M g G ho i=>by have ho:o(nl t*((if D then o else 0)*((s.h+2)*(s.w+2))+y*(s.w+2)+p*2))д) _ (λp=>by rw[show nl t*((if D then o else 0)*((s.h+2)*(s.w+2))+y*(s.w+2)+(p+1)*2)= nl t*((if D then o else 0)*((s.h+2)*(s.w+2))+y*(s.w+2)+p*2)+nl t+nl t by ring,ua,ua];cases t<;>rfl) λj F=>?_ rw[i j F,mU,cI _ _ _ ho,cI _ _ _ ho,cI _ _ _ ho];simp only[Fin.val_mk,Κ];obtain ⟨H,L⟩:=kd t s J I K b d e l (x:=j/2*2) rfl rfl rfl rfl rfl rfl rfl v ho G А (B o ho) _ rfl;rcases mT j with h | h<;>rw[h] .conv_lhs=>rw[show j=j/2*2 by omega] exact H.symm .conv_lhs=>rw[show j=j/2*2+1 by omega] exact (L А).symm] rcases u with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp only[dS,fT,ite_true,ite_false]<;>rw[ό _ s.h s.w] all_goals simp only[mX,conv2dWith,depthwiseSpec,depthwiseWith,r,hB] refine mQ (by simp[r,hB]) λq h1 _=>?_ rw[ϡ] at h1 simp only[aE,Τ] congr 1 unfold d9;simp only[d.1,d.2.1,ό,m7,ϫ,Κ,ite_true,ite_false] lemma jR (d:D=false/\nc=s.cin/\Y=s.cout\/D=true/\nc=1/\Y=s.cin): iV s J I K b D nc Y= dS s J I K b D:=by unfold iV;dsimp only;split;rename_i e;split;exact eN false s J I K b D nc Y _ _ _ e d;split;exact eN true s J I K b D nc Y _ _ _ e d;all_goals rfl lemma fL (e:D=false/\nc=s.cin/\Y=s.cout\/D=true/\nc=1/\Y=s.cin): iU s J I K b D nc Y=dS s J I K b D:=by unfold iU jQ;dsimp only;split;split;rename_i d;exact eN false s J I K b D nc Y _ _ _ ⟨d.1,d.2.1,d.2.2.1,d.2.2.2.1⟩ e;all_goals exact jR s J I K b D nc Y e lemma d5:eM=mX:=by funext s J I K b;exact fL s J I K b false s.cin s.cout (.inl ⟨rfl,rfl,rfl⟩) lemma eP:d6=depthwiseSpec:=by funext s J I K b;exact fL s J I K b true 1 s.cin (.inr ⟨rfl,rfl,rfl⟩) lemma bP:(lH u)в=uв/2^23%256:=by unfold lH rw[Χ,ϟ,show (0xFF:Е)в=2^8-1 from rfl, ν] simp[ζ] lemma bv:(l8 u)в=uв%2^23:=by unfold l8;rw[Χ,show (0x7FFFFF:Е)в=2^23-1 from rfl,ν] def Kf:н:= (if m/2^23=0 then m%2^23 else 2^23+m%2^23)*2^(if m/2^23=0 then 0 else m/2^23-1) lemma j9:mantOf u*2^idxOf u=Kf (u.toNat%2^31):=by have h1:uв%2^31/2^23=(lH u)в:=by rw[bP];omega have h2:uв%2^31%2^23=(l8 u)в:=by rw[bv];exact Nat.mod_mod_of_dvd _ Б unfold mantOf idxOf Kf;rw[h1,h2];simp only[<- Β,UInt32.toNat_zero] lemma ky:Kf m<2^(m/2^23+23):=by unfold Kf;split_ifs with h .rw[h];simpa using Λ m (show 0<2^23 by norm_num) .have:=ψ (show 2^23+m%2^23<2^24 by omega) (Ϙ (m/2^23-1));rwa[<- pow_add,show 24+(m/2^23-1)=m/2^23+23 by omega] at this lemma fG (d b:н) (h:dpush_cast<;>ring lemma g8: (sk u)в=if uв<2^31 then uв+2^31 else if uв=2^31 then 2^31 else 2^32-1-uв:=by have:=u.toNat_lt;unfold sk;split_ifs<;>simp_all[Μ,<- Β,UInt32.toNat_sub]<;>omega lemma ja (a b:Е) (h:sk a Kf m⟨fG m n,by constructor<;>intro e;. subst e;decide .have:=fG 0 m;by_contra;have:Kf 0=0:=Б omega⟩ have ha:=a.toNat_lt;have hb:=b.toNat_lt;have:=F (aв%2^31) (bв%2^31);have:=F (bв%2^31) (aв%2^31);split_ifs at h⊢<;>omega lemma jO:Model.cmpDyadic (n0 y) (n0 z)=compare (kv y) (kv z):=by have b:∀w,(n0 w).toReal=(kv w:ℝ)*2^(-149:о):=λw=>by rw[<- nT,lY];unfold kv;push_cast;rw[zpow_sub₀ two_ne_zero,zpow_natCast];ring have d:(0:ℝ)<2^(-149:о):=zpow_pos two_pos _;cases h:compare (kv y) (kv z) .rw[Model.cmpDyadic_lt_iff,b,b];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_lt_iff_lt.mp h) d .rw[Model.cmpDyadic_eq_iff,b,b,compare_eq_iff_eq.mp h] .rw[Model.cmpDyadic_gt_iff,b,b];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_gt_iff_gt.mp h) d lemma dN (d:lK u=0):u=0\/u=0x80000000:=by have ha:=u.toNat_lt;unfold lK at d;split_ifs at d with e .have b:=bP u;have g:=bv u;rw[e] at b;rw[<- Β,<- Β];simp at b⊢;omega .omega lemma jr:n4 (mx y z)=Model.maximum (n4 y) (n4 z):=by unfold mx;split .rename_i h;have ha:=lL y h.1;have hb:=lL z h.2.1;have b:Model.compare (n4 y) (n4 z)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ ha hb;rw[jO] at b;have e:Model.chooseNaN2 (n4 y) (n4 z)=none:=(Model.chooseNaN2_eq_none_iff _ _).2 ⟨Ρ ha,Ρ hb⟩ unfold Model.maximum;rw[Model.withNaNSelection_of_none _ _ e];rw[Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ b];rcases h.2.2 with h1 | h1 | rfl .rw[if_pos h1,compare_lt_iff_lt.mpr (ja y z h1)] .rw[if_neg (UInt32.lt_asymm h1),compare_gt_iff_gt.mpr (ja z y h1)] .rw[if_neg (UInt32.lt_irrefl _),compare_eq_iff_eq.mpr rfl] by_cases d:lK y=0 .rcases dN y d with rfl | rfl<;>decide .have g:Model.isZero (n4 y)=false:=by unfold n4;rw[Model.isZero_eq_beq_zero_of_toDyadic?_some ha,decodeD_sig_zero];simpa using d simp[g] .exact gp _ lemma iH (w k U n:н) (hk:0Model.maximum m (ofW I[U+t/k*w+t%k]!)) (ofW b):=by rw[ku _ _ _ _ _ _ _ hk,List.foldl_hom n4];exact λ_ _=>(jr _ _).symm lemma iJ:go=maxpoolSpec:=by funext c h w k I;unfold go;split .rename_i hk;rw[ic] refine mQ (by simp[maxpoolSpec]) λq _ _=>?_ simp only[aE,Τ,maxpoolSpec];rw[<- gy (wl _ _ _ _ _ _ _ _),iH I w k _ (k*k) hk.1];simp only[nW];congr 2 .funext b t;congr 2;ring .congr 1;simp only[Nat.zero_div,Nat.zero_mod];ring .rfl lemma kr: Model.NativeBinary32.toUInt32 (Model.ofUInt32 u:Model Fmt)=u:=by show UInt32.ofBitVec (Model.ofUInt32 u:Model Fmt).bits=u;rw[ofUInt32_bits] lemma bG (b:lH u≠0): n0 u=⟨lV u,2^23+(l8 u)в,((lH u)в:о)-150⟩:=by unfold n0;rw[if_neg b] lemma en (f:н) (b:f<2^23): lR (2^23+f) (2^23)=0:=by have h1:(2^23+f)з=23:=by rw[mN А];constructor<;>omega unfold lR;rw[h1,Nat.log2_two_pow] simp[mR,m4, κ]<;>omega lemma g5:lQ (m*2^23) (2^23)=m:=by unfold lQ;simp lemma jP (q:Е) (l:l8 d=0) (h1:lV d=false) (I:(lH d)в=qв+127) (h2:lH d≠255) (h3:q.toNat<(expOf r).toNat) (g:expOf r≠255): toWord (Model.div (ofW r) (ofW d))=r-(q<<<23):=by have J:=bP r;have K:=bv r;have L:(lH r)в≠255:=λh=>g (Β.mp (by simpa using h)) have o:lH r≠0:=λh=>by simp[h] at h3 have p:lH d≠0:=λh=>by simp[h] at I have H:=fracOf_toNat_lt r;rw[nk];unfold n5 n4 rw[lL r g,lL d h2,bG r o,bG d p, l,h1] have i:((2:н)^23==0)=false:=Б;have hB:(2^23+(l8 r)в==0)=false:=by simp simp only[UInt32.toNat_zero,ύ,Bool.xor_false,i,hB,fT,ite_false] change nn (Model.roundRatScaled FloatFormat.binary32 (lV r) (2^23+(l8 r)в) (2^23) _)=_ rw[<- nm, cq] unfold nU;rw[en _ H];simp only[i,hB,fT,ite_false,zero_add,sub_zero];rw[if_neg А,if_neg А,if_neg А];have u:(2^23+(l8 r)в).shiftLeft 23=(2^23+(l8 r)в)*2^23:= κ _ _ rw[show ((23:о))=Int.ofNat 23 from rfl, mJ] simp only[u,g5];have G:((2^23+(l8 r)в:н)==n6 24)=false:=by simp[n6];omega simp only[G,fT,ite_false];rw[if_neg А];set b:=r-(q<<<23) with v;have j:(q<<<23)в=qв*2^23:=by rw[my];simp[κ];omega have e:bв=rв-qв*2^23:=by rw[v,mz _ _ (by rw[ϴ,j];omega),j] rw[<- nM];conv_rhs=>rw[<- kr b,ofUInt32_eq_ofFields] have B:lV b=lV r:=by rw[ϗ,a5,a5,e];omega have D:(lH b)в=(lH r)в-qв:=by rw[bP b,e];omega have F:(l8 b)в=(l8 r)в:=by rw[bv b,e];omega have A:Int.toNat (((lH r)в:о)-150-(((lH d)в:о)-150)+127)= (lH r)в-qв:=А rw[B,D,F,A,show n6 23=2^23 by decide,mj];rfl lemma kI (s:lI) (h:s&&&0x7FFFFFFF=0):s=0\/s=0x80000000:=by have b:=s.toNat_lt;have h1:(s&&&0x7FFFFFFF)в=sв%2^31:=by rw[Χ,show (0x7FFFFFFF:Е)в=2^31-1 from rfl, ν] rw[h] at h1;rw[<- Β,<- Β];simp at h1⊢;omega lemma dB (b:r=0\/r=0x80000000) (e:expOf d≠0) (h1:expOf d≠255) (h2:signOf d=false): toWord (Model.div (ofW r) (ofW d))=r:=by have h3:lH r≠255:=by rcases b with rfl | rfl<;>decide have i:n0 r=⟨lV r,0,0⟩:=by rcases b with rfl | rfl<;>rfl rw[nk];unfold n5 n4;rw[lL r h3,lL d h1,bG d e,h2,i];have g:(2^23+(l8 d)в==0)=false:=by simp simp[g,fT,ite_false,beq_self_eq_true,ite_true,Bool.xor_false];rcases b with rfl | rfl<;>rfl lemma bO {a b:Е} (h:aby have:=Μ.mp h;rw[e] at this;omega abbrev av:р:=toWord (Model.div (ofW (dotOf n fa λ_=>oneW)) (ofW d)) lemma ji (o:DQ d):iq r d=toWord (Model.div (ofW r) (ofW d)):=by obtain ⟨b,h1,h2⟩:=o;have e:lH d≠255:=bO h2;unfold iq;dsimp only;split .obtain ⟨j,g,h3,i⟩:=‹_/\_›;have l:(lH d)в=(lH d-127)в+127:=by rw[mz _ _ g];have:=ϴ.mp g;simp at this⊢;omega exact (jP r d _ j b l e (Μ.mp h3) (bO i)).symm split .exact (dB r d (kI r ‹_›) h1 e b).symm .rfl lemma jm (g:н-> Д) (m:н):∀b:Д, Z ((List.range m).foldl (λb t=>b+g t) b)=Z b+∑t∈range m,Z (g t):=by induction m with | zero=>intro b;simp | succ m d=> intro b;rw[List.range_succ,List.foldl_append,List.foldl_cons,List.foldl_nil,cY,d,Η];ring lemma dL:ab 0=0:=by rw[b9];rfl lemma jA: (decide (lK u*lK nD=0)&&Bool.xor (lV u) (lV nD))=(u==0x80000000):=by by_cases b:lK u=0 .rcases dN u b with rfl | rfl<;>decide .have:(u==0x80000000)=false:=by rw[beq_eq_false_iff_ne];rintro rfl;exact b Б rw[this,show lK nD=2^23 by decide,show lV nD=false by decide];simp[b] lemma gg (c:н):∀i,i+c<= n -> (dallNZ (lN (n:=n) λj=>fa jй) (lN (n:=n) λ_=>nD) i c=true↔ ∀t,i<= t-> t< i+c-> fa t=0x80000000):=by induction c with | zero=>intro i _;simp[dallNZ];intro t h1 h2;omega | succ c b=> intro i d rw[dallNZ,ar n fa i А,ar n (λ_=>nD) i А, jA,Ε,b (i+1) А,beq_iff_eq] constructor .rintro ⟨h1,h2⟩ t h3 e rcases Nat.eq_or_lt_of_le h3 with h | h .subst h;exact h1 .exact h2 t А А .intro h;exact ⟨h i (le_refl _) А,λt h1 h2=>h t А А⟩ lemma im (I:0oneW)=0) (g:т) (G:g=true↔∀toneW)=if g then 0x80000000 else 0:=by have u:=d7 n fa (λ_=>nD);have v:=gg n fa n 0 А;have r:=ar n fa have hB:=ar n λ_=>nD have h3:=ϡ (f:=λi:Fin n=>fa iй);have j:=ϡ (f:=λ_:Fin n=>nD);unfold dotOf dotSpec Model.dot;generalize (lN (n:=n) λi=>fa iй)=A at* generalize (Array.ofFn (n:=n) λ_:Fin n=>oneW)=B at* have b:∀k,0<= k-> k<0+(A.map (Model.ofUInt32 (fmt:=Fmt))).size -> lH A[k]!≠255/\lH B[k]!≠255:=λk _ hk=>by simp only[nG,h3] at hk;rw[r k А,hB k А];exact ⟨q k А,by decide⟩ have l:∀(X:п Е),X.size=n->(∀k ∀k (hk:k<(X.map (Model.ofUInt32 (fmt:=Fmt))).size),Model.isFinite (X.map (Model.ofUInt32 (fmt:=Fmt)))[k]=true:=by intro X hX F k hk;simp only[Array.size_map] at hk;have h1:=F k А;rw[getElem!_pos X k hk] at h1;simp[isFinite_ofUInt32,h1] have d:(A.map (Model.ofUInt32 (fmt:=Fmt))).size=(B.map (Model.ofUInt32 (fmt:=Fmt))).size:=by simp[h3,j] have o:=l A h3 λk hk=>(b k А (by simp[h3];omega)).1 have p:=l B j λk hk=>(b k А (by simp[h3];omega)).2 have e:=Ϭ (destination:=Fmt) _ _ d o p;rw[finiteDotSlice_eq A B 0 _ (by simp) (by rw[<- d];simp) b] at e;simp only[Array.size_map,h3,u,D,Int.cast_zero,zero_mul] at e rw[Model.Reduction.dotWithStatus_eq_zero_of_finite Fmt _ _ .nearestEven d o p ((nr _).1 e)] obtain ⟨h1,h2⟩:=dotStateLoop_flags A B ({}:n1 Fmt) 0 _ (by simp) (by rw[<- d];simp) b unfold nY;rw[h1,h2];have hb:dallNZ A B 0 n=g:=by rw[ϗ,v,G];exact ⟨λh t H=>h t А А,λh t _ H=>h t А⟩ simp only[nG,h3,hb];cases g<;>simp[show n≠0 by omega]<;>rfl lemma fv (w k U m:н) (hk:0simp | succ m d=> simp only[List.range_succ,List.foldl_append,List.foldl_cons,List.foldl_nil,Ε,d] exact ⟨λ⟨h1,h2⟩ t b=>(Nat.lt_succ_iff_lt_or_eq.mp b).elim (h1 t) λe=>e ▸ h2, λh=>⟨λt b=>h t А,h m А⟩⟩ lemma ci (b y x t:н): I[(b*h+y*k)*w+x*k+t/k*w+t%k]! =nW h w k I b y x t:=by congr 1;ring lemma gD (B c A H:Д) (hB:Bа<=255) (u:cа<=62) (D:0 Д) (L M:о) (T:∀t т) (v:g ()=true↔∀t lI) (h2:o ()=dotOf n fa λ_=>nD) (d:lI) (j:DQ d): wo B A H g o d=av n fa d:=by have hk:=λt b=>bD c B (fa t) hB u (h1 t b) have F:=abs_le.mp (cP n _ _ λt b=>(T t b).2.1);have G:=abs_le.mp (cP n _ _ λt b=>(T t b).2.2);have l:aN n fa (λ_=>nD)=(∑t∈lG n,aD Bа (fa t))*2^(Bа+149):=by rw[ϖ];refine Ζ rfl λt b=>?_ rw[fp (fa t) nD _ 126 ((hk t (mr b)).2.imp_right (·.1)) (Or.inr Б), show aD 126 nD=2^23 by decide,show Bа+149=Bа+126+23 by omega,pow_add _ (Bа+126)] ring rw[<- Ζ rfl λt b=>(T t (mr b)).1,Ϥ,<- ϖ, <- sZ A (∑t∈lG n,ab (i (fa t))) (by rw[q];push_cast;simp only[ii]) (by linarith) (by linarith),<- sZ H (∑t∈lG n,ab (e (fa t))) (by rw[r];push_cast;simp only[ii]) (by linarith) (by linarith)] at l unfold wo av;split .rename_i p;rw[p.1,p.2,dL] at l rw[im n fa D (λt b=>(hk t b).1) (by rw[l];ring) _ v, dB _ d (by split<;>simp) j.2.1 (bO j.2.2) j.1] .rw[ji _ d j];refine congrArg (λs=>toWord (Model.div (ofW s) (ofW d))) ?_;rw[Dense.c9,dC];split .refine (aR n fa _ _ _ _ (λt b=>⟨(hk t b).1,by decide⟩) ?_ ‹_›).symm;rw[l,cV,show (B+149)а=Bа+149 by rw[η];simp;omega] .exact h2 lemma jc (c:Д) (x:lI) (hB:Bа<=255) (i:cа<=37) (h:ok c B x=true): ab 0*2^25+ab (t1 B x)=aD Bа x /\ |ab (t1 B x)| <= 2^(24+cа)-1 /\ |ab 0| <= 0:=by obtain ⟨-,d⟩:=bD c B x hB А h;obtain ⟨g,b⟩:=ff B x cа А d;have:2^(24+cа)<=2^61:=υ Г А;have e:ab (t1 B x)=aD Bа x:=by unfold t1 aD sv;rw[kN _ _ А,g];cases lV x<;>simp only[fT,ite_true,ite_false,neg_mul]<;>push_cast<;>ring rw[dL,e];refine ⟨by ring,?_,by simp⟩;unfold aD sv cases lV x<;>simp only[fT,ite_true,ite_false,neg_mul,abs_neg]<;> rw[abs_of_nonneg В]<;>exact Int.le_sub_one_of_lt (by exact_mod_cast b) lemma eK (f:lI-> Д) (h w k:н) (I:п lI) (b y x:н) (hk:0by rw[<- ci];exact (fv _ _ _ _ _ _ hk).1 h2 t e have:((k*k:н):о)<16384:=by exact_mod_cast g exact gD _ _ _ 50 _ _ (cR h1) Б (mK hk hk) h3 (cv B) (iX B) (2^25) (2^49) (λt e=>by obtain ⟨l,o,p⟩:=fM B _ (cR h1) (h3 t e) rw[sZ (cv B _) _ (ca _) А А,sZ (iX B _) ((bY B (nW h w k I b y x t))а-2^49) (by rw[iX,es,ca,show Z 0x2000000000000=((2^49:о):ZMod (2^64)) by unfold Z;norm_num];push_cast;ring) А А,abs_le,abs_le] omega) (by linarith) (by linarith) (eK _ h w k I b y x hk) (eK _ h w k I b y x hk) _ (by simp[fv _ _ _ _ _ _ hk,ci,beq_iff_eq]) _ rfl d i .rfl lemma eI: eH Q (fa 0) (fa 1) (fa 2) (fa 3)=true↔∀t<2*2,Q (fa t)=true:=by simp only[eH,Ε] exact ⟨λ⟨⟨⟨a,b⟩,c⟩,e⟩ t d=>by interval_cases t<;>assumption, λH=>⟨⟨⟨H 0 Б,H 1 Б⟩,H 2 Б⟩,H 3 Б⟩⟩ lemma jS:(eF u)а=(lH u)в:=by unfold eF lH;simp lemma j4 (x:lI):aA x<=255:=by unfold aA;split .rw[γ,ap];unfold lE;have:=mS x;split<;>simp<;>omega .exact UInt64.le_refl _ lemma mn (a b:Д):(min a b).toNat=min a.toNat b.toNat:=by show (if a<= b then a else b)а=_;split<;>rename_i h .have:=γ.mp h;omega .have:=mt γ.mpr h;omega lemma fV (a b:Д):min a b<= a:=γ.mpr (by rw[mn];omega) lemma i2 (a b:Д):min a b<= b:=γ.mpr (by rw[mn];omega) lemma i3 (a b:Д):a<= max a b:=by show a<= if a<= b then b else a;split<;>simp_all lemma i4 (a b:Д):b<= max a b:=by show b<= if a<= b then b else a;split<;>rename_i h<;>simp_all[γ];omega lemma ey (x:р) (B M:Д) (hk:B<= aA x) (j:eF x<= M) (i:M<= min (B+37) 254) (hB:B<=255):ok 37 B x=true:=by have d:=jS x;have b:=ap x;have l:=mS x;have h1:=γ.mp j;have h2:=γ.mp i;have hb:=γ.mp hB;rw[mn,η] at h2;simp only[lC] at h2 hb;simp only[ok,Ε,bne_iff_ne,ne_eq,Ϩ,beq_iff_eq];refine ⟨λe=>by rw[e] at d;simp at d;omega,?_⟩ by_cases g:mW x=0 .exact Or.inl g .right;unfold aA at hk;rw[if_pos (by simpa using g)] at hk have hk:=γ.mp hk;rw[b] at hk;apply decide_eq_true;rw[γ,μ _ _ (γ.mpr (by rw[b];omega)),b] unfold lE at hk⊢;split<;>simp<;>omega lemma lA (b d e g:р) (h:max (max (eF b) (eF d)) (max (eF e) (eF g))<= min (min (min (aA b) (aA d)) (min (aA e) (aA g))+37) 254): min (min (aA b) (aA d)) (min (aA e) (aA g))<=255 /\ eH (ok 37 (min (min (aA b) (aA d)) (min (aA e) (aA g)))) b d e g=true:=by have hB:min (min (aA b) (aA d)) (min (aA e) (aA g))<=255:= ϔ (ϔ (fV _ _) (fV _ _)) (j4 b) refine ⟨hB,?_⟩;simp only[eH,Ε] exact ⟨⟨⟨ey _ _ _ (ϔ (fV _ _) (fV _ _)) (ϔ (i3 _ _) (i3 _ _)) h hB, ey _ _ _ (ϔ (fV _ _) (i2 _ _)) (ϔ (i4 _ _) (i3 _ _)) h hB⟩, ey _ _ _ (ϔ (i2 _ _) (fV _ _)) (ϔ (i3 _ _) (i4 _ _)) h hB⟩, ey _ _ _ (ϔ (i2 _ _) (i2 _ _)) (ϔ (i4 _ _) (i4 _ _)) h hB⟩ lemma jK (B:DQ d) (b y x:н) (e:с) (D:eб=(b*h+y*2)*w+x*2) (hb:(b*h+y*2)*w+x*2+w+1<2^31): jJ h w I d b y x e=av (2*2) (nW h w 2 I b y x) d:=by have q:=ci h w 2 I b y x;have p:=q 0;have r:=q 1;have u:=q 2;have v:=q 3;simp only[Nat.reduceDiv,lM,nZ,one_mul,add_zero] at p r u v;have l:=jf h w 2 I d Б Б B b y x;have:=ft;have g:∀i o,I.uget i o=I[iб]!:=λi o=>(getElem!_pos I _ o).symm unfold jJ;dsimp only;split swap;. exact l simp (disch:=omega) only[g,Υ,϶,aa,mo,D,p,r,u,v];split .rename_i j;have j:=lA _ _ _ _ j;have A:=(eI _ (poolAt h w 2 I b y x)).1 j.2;exact gD _ _ _ 37 _ _ (cR j.1) Б Б A _ (λ_=>0) _ 0 (λt F=>jc _ _ _ (cR j.1) Б (A t F)) Б Б (by simp only[cY,show 2*2=4 from rfl,Η,mD,zero_add]) (by simp[bV]) _ (by rw[eI];simp only[beq_iff_eq]) _ rfl d B .exact l lemma f4 (f:н-> н-> н-> lI) (d:∀b y x,f b y x=av (k*k) (nW h w k I b y x) (natW (k*k))): f3 c (h/k) (w/k) f=nN c h w k I:=by rw[ic];unfold nN;refine mQ (by simp[nO]) λq _ _=>?_ simp only[aE,Τ,nO];exact d _ _ _ lemma il:f7=nN:=by funext c h w k I;unfold f7;dsimp only;split .rename_i b;obtain ⟨hk,g,l,i,e⟩:=b;split .rename_i h2;obtain ⟨rfl,v⟩:=h2;rw[i1 _ _ _ _ _ _ _ g,ό];unfold nN refine mQ (by simp[nO]) λq h1 _=>?_ simp only[aE,Τ,nO,ϡ] at h1⊢;have r:=(ϸ (mK g l)).mpr h1;have:=Λ (q/(w/2)) g;have:=Λ q l;have o:q/(h/2*(w/2))*h+q/(w/2)%(h/2)*2+1<= c*h:=by have:=χ h (Nat.succ_le_of_lt r);rw[ϲ] at this;omega have p:=χ w o;rw[Nat.add_one_mul] at p;refine jK h w I _ e _ _ _ _ ?_ А rw[show (2:с)=USize.ofNat 2 from rfl,<- USize.ofNat_mul,<- USize.ofNat_add,ϓ 2, <- Nat.toUSize_eq,aa _ А] .split .rename_i b refine f4 _ _ _ _ _ _ λd y x=>?_ have j:∀tbW I _ b.2 (bE _ _) _ have:((k*k:н):о)<16384:=by exact_mod_cast i exact gD _ _ _ 25 _ _ (cR b.1) Б (mK hk hk) j _ (λ_=>0) _ 0 (λt u=>jc _ _ _ (cR b.1) Б (j t u)) (by simp;linarith) (by simp) (eK _ h w k I d y x hk) (by simp[bV]) _ (by simp only[fv _ _ _ _ _ _ hk,ci,beq_iff_eq]) _ rfl _ e .exact f4 _ _ _ _ _ _ λd y x=>jf h w k I _ hk i e d y x .rfl end Conv section open Float.Model.UnpackedFloat local notation "ZA" => rationalWord local notation "ZB" => Array Word local notation "ZC" => Core.mW local notation "ZD" => Core.iW local notation "ZE" => FloatFormat.toModel Fmt local notation "ZF" => zpow_natCast local notation "ZG" => UInt64.toNat_ofNat' local notation "ZH" => decide_eq_true_eq local notation "ZI" => Core.am local notation "ZJ" => Nat.div_eq_zero_iff_lt local notation "ZK" => sqrtLower local notation "ZL" => zpow_add₀ local notation "ZM" => Finset.range local notation "ZO" => mantOf_lt_24 local notation "ZQ" => two_ne_zero local notation "ZR" => Core.aV local notation "ZS" => Core.ap local notation "ZT" => roundRational local notation "ZU" => Nat.div_add_mod' local notation "ZV" => Nat.div_le_self local notation "ZW" => mantOf local notation "ZX" => signOf local notation "ZY" => beq_iff_eq local notation "ZZ" => idxOf local notation "XA" => ite_false local notation "XB" => zpow_sub₀ local notation "XC" => two_ne_zero' local notation "XD" => mul_assoc local notation "XE" => ExtendedMantissa.ofMantissaAndAccuracy local notation "XF" => UInt64.ofNat local notation "XG" => Bool.xor local notation "XH" => rowVariance local notation "XI" => (А) local notation "XJ" => (В) local notation "XK" => (by simp) namespace Elem lemma VV (w:lI):(ZC w)а<2^24:=by rw[ZI];exact ZO w lemma YB (a b:lI):(ZC a*ZC b)а=ZW a*ZW b:=by rw[Ν,ZI,ZI];exact ε (mul_mant_lt a b) @[specialize] def Y6 (f:н->р) (i stop:н) (out:ZB):ZB:= if iр) (i b:н) (d:ZB): (Y6 f i b d).toList=d.toList++(List.range' i (b-i)).map f:=by induction h:b-i generalizing i d with | zero=> unfold Y6;rw[if_neg XI];simp | succ k e=> unfold Y6;rw[if_pos XI,e (i+1) _ XI,List.range'_succ];simp end Elem open Elem namespace Norm def Ya:Accuracy->н | .exact=>0 | .inexact _=>1 lemma Yc {α:Type} (f:α->α) (n:н) (a:α): Nat.repeat f (n+1) a=Nat.repeat f n (f a):=by induction n generalizing a with | zero=>rfl | succ n b=>exact congrArg f (b a) lemma QA (R k:н) (b:Accuracy): XE (2*R+Ya b) .exact>>>(k+2)= XE R b>>>(k+1):=by show Nat.repeat lX (k+2) _= Nat.repeat lX (k+1) _ rw[Yc,Yc,Yc];congr 1;rcases b with _ | ⟨_ | _ | _⟩<;> simp[ExtendedMantissa.ofMantissaAndAccuracy,lX,Ya]<;>omega open FloatLib.Numerics in lemma VY (q r D t:н) (d:0rfl,<-h, show (q*D+r)/D=q by rw[ϒ,ϑ _ _ d,ϕ b,zero_add], show (q*D+r)%D=r by rw[ϒ,ϊ,ε b]] lemma Y5 (e:о):Model.bpow e=(2:ℝ)^e:=by cases e with | ofNat n=>rw[Int.ofNat_eq_natCast,Model.bpow_natCast,ZF] | negSucc n=> rfl lemma Vi (q b:н) (d:q≠0) (hb:b<=1):(2*q+b)з=qз+1:=by have h1:=ϥ d;have h2:=Ϧ (n:=q);rw[mN XI];constructor<;>omega open FloatLib.Numerics in lemma V0 (s:т) (P b:н) (j:P≠0) (h:b≠0) (q r D:н) (t:0omega have d:=Vi q _ h3 hb;have A:(r:ℝ)/D<1:=by rw[div_lt_one XJ];exact_mod_cast o have y:(0:ℝ)<=r/D:=XJ;push_cast at h1 h2;have p:lR P b=(qз:о)+e:=by apply Model.floorLog2_eq_of_bounds P b _ j h .rw[g,Y5,ZL ZQ,ZF];gcongr;linarith .rw[g,Y5,show (qз:о)+e+1=((qз+1:н):о)+e by push_cast;ring,ZL ZQ,ZF];gcongr;linarith have l:lQ (mB P b (23-((qз:о)+e))).1 (mB P b (23-((qз:о)+e))).2= roundShiftRightEven (2*q+if r=0 then 0 else 1) ((2*q+if r=0 then 0 else 1)з-23):=by rw[roundShiftRightEven_eq_roundQuotientEven,d,show qз+1-23=(qз-23)+1 by clear*-i d;omega,<-VY q r D _ t o XI] apply Model.roundQuotientEven_eq_of_rat_eq _ _ _ _ (RationalBinary.scaleByPowerOfTwo_snd_ne_zero _ _ _ h) XJ rw[Model.scaleByPowerOfTwo_real];unfold Model.scaledRatToReal;rw[g,Y5,XD,<-ZL ZQ, show e+(23-((qз:о)+e))=-((qз-23:н):о) by clear*-i d;omega, zpow_neg,ZF] push_cast;field_simp generalize z:2*q+(if r=0 then 0 else 1)=J at d l⊢;rw[Model.roundDyadic,ite_eq_left Б,Model.ieeeRoundDyadic_eq_ieeeRoundDyadicImpl];simp only[Model.roundRat,Model.roundRatScaled,show Fmt.isIEEE=true by decide,↓reduceDIte, Model.ieeeRoundRatScaled,Model.ieeeRoundDyadicImpl,ZY,j,h,XA,p, Int.add_zero,Int.ofNat_eq_natCast,d,show (FloatFormat.ieeeMaxNormalExponent Fmt:о)=127 by decide, show FloatFormat.ieeeMinNormalExponent Fmt=-126 by decide, show (FloatFormat.normalMantissaExpOffset Fmt:о)=150 by decide, show Fmt.fracWidth=23 by decide,show J≠0 by omega, show ((qз+1:н):о)+(e-1)=(qз:о)+e by push_cast;ring, show¬((qз:о)+e>127) by omega,show¬((qз:о)+e< -150) by omega, show¬((qз:о)+e< -126) by omega,show 23<=qз+1 by omega,ite_true, Nat.cast_ofNat,l] lemma Yp:ZT 0=0:=by decide lemma Y8 (v:ℚ) (o:v≠0) (s:т) (l:decide (v<0)=s) (q:н) (ρ:ℚ) (h:0<=ρ) (d:ρ<1) (e:о) (h1:|v|=((q:ℚ)+ρ)*(2:ℚ)^e) (i:2^25<=q) (h2:-126<=(qз:о)+e) (h3:(qз:о)+e<=126): ZT v= nn (mv Fmt ⟨s,2*q+(if ρ=0 then 0 else 1),e-1⟩):=by have g:ρ=(ρ.numк:ℚ)/ρ.den:=by conv_lhs=>rw[<-Rat.num_div_den ρ] congr 1;exact_mod_cast (Int.toNat_of_nonneg (Rat.num_nonneg.mpr h)).symm have b:=ρ.den_pos;generalize ρ.den=D,ρ.numк=r at g b;subst g;have j:r(z:ℝ)) h1;rw[Rat.abs_def,Rat.divInt_eq_div] at this;push_cast at this;rwa[Nat.cast_natAbs,Int.cast_abs] lemma Q7 (R:н) (s:о) (h:2^25<=R): -s+1<=(ZE).targetExponent (lP R (-s)):=by have:=(nF XI).2 h;have:(ZE).mantissaBits<=25:=Б;unfold Float.Model.Format.targetExponent lP;omega lemma Vd (v:ℚ) (j:0simp lemma YN (w:lI):(sv w:ℚ)=0↔ZW w=0:=by unfold sv;split_ifs<;>simp lemma Vr (w:lI):(sv w:ℚ)=(if ZX w then-1 else 1)*ZW w:=by unfold sv;split_ifs<;>simp lemma Y7 (x:Д):(ZR x)а=xаз:=by rw[a6];rfl @[specialize] def Yh (x:ZB) (i stop u:н):н:= if ih (by rw[<-ZI,b];rfl) simp[this,h] lemma Yi (x:ZB) (b:н): ∀k i u,b-i=k->Yh x i b u<=u/\ ∀j,i<=j->jZW x[j]! =0\/Yh x i b u<= ZZ x[j]!:=by intro k;induction k<;>intro i u h<;>unfold Yh .rw[if_neg XI];exact ⟨le_rfl,λ_ _ _=>by omega⟩ .rename_i g;rw[if_pos XI];dsimp only;rw[YK,ZS];obtain ⟨h1,h2⟩:=g (i+1) (if decide (ZW x[i]! =0)=true then u else min u (ZZ x[i]!)) XI refine ⟨le_trans h1 (by split_ifs<;>omega),?_⟩;intro j l e;by_cases h3:j=i .subst h3;by_cases d:ZW x[j]! =0 .exact Or.inl d .simp only[d,decide_false,Α,XA] at h1⊢;omega .exact h2 j XI e def VJ (x:ZB) (u j:н):н:= (ZW x[j]!*ZW x[j]!)<<<(2*(ZZ x[j]!-u)) @[specialize] def Yl (x:ZB) (u i stop:н) (l h:Д) (c big:н):н:= if i>>1)>>>(63-k) else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l'>>1)>>>(63-kе) else b<<<(kе-64))а*2^64=bа*2^k/\ (if kе<64 then (b>>>1)>>>(63-kе) else b<<<(kе-64))а<2^62:=by have hk:kеа=k:=by rw[Ϸ,ZG,ε XI] by_cases h:k<64 .have d:kе<64:=by rw[θ,hk];simpa simp only[d,ite_true,ς,ξ,μ _ _ (show kе<=63 by rw[γ,hk];simp;omega),hk,lC, κ,ζ,ε h, ε (show 63-k<64 by omega),lM,ϳ] have e:2^1*2^(63-k)=2^(64-k):=by rw[<-pow_add];congr 1;omega have g:2^64=2^(64-k)*2^k:=by rw[<-pow_add];congr 1;omega rw[e,g,Nat.mul_mod_mul_right,<-ό,<-mq,Nat.mod_add_div'];exact ⟨rfl,lt_of_le_of_lt (ZV _ _) XI⟩ .have d:¬kе<64:=by rw[θ,hk];simp;omega have hb:bа*2^(k-64)<2^62:= calc _<2^48*2^14:= lZ i (υ XJ XI) XJ _=_:=rfl simp only[d,XA,Ϡ,Κ,ς,μ _ _ (show (64:Д)<=kе by rw[γ,hk];simp;omega),hk, lC,ε (show k-64<64 by omega),κ, ε (show bа*2^(k-64)<2^64 by omega)] refine ⟨?_,hb⟩;rw[ό,<-pow_add];congr 2;omega lemma Vb (x:ZB) (u b:н): ∀k i (l h:Д) c big,b-i=k-> Yl x u i b l h c big=big+lа+hа*2^64+c*2^128+ ∑j∈ZM k,VJ x u (i+j):=by intro k;induction k<;>intro i l h c big hk<;>unfold Yl .rw[if_neg XI];simp only[κ,Finset.range_zero,nd];ring .rename_i p;rw[if_pos XI,ϣ];have e:∀j,VJ x u (i+(j+1))=VJ x u (i+1+j):=λj=>by rw[ϵ];rfl simp only[e,ύ];have o:VJ x u i=(ZC x[i]!*ZC x[i]!)а* 2^(2*((ZD x[i]!)а-u)):=by unfold VJ;rw[κ,YB,ZS] have q:(ZC x[i]!*ZC x[i]!)а<2^48:=by rw[YB];have:=ZO x[i]! calc _<2^24*2^24:=ϋ this this _=_:=rfl rw[o];generalize (ZD x[i]!)а-u=d at* generalize ZC x[i]!*ZC x[i]! =g at* by_cases r:d<=39 .have:=VL g (2*d) q XI;generalize (if (2*d)е<64 then g<<<(2*d)е else 0)=t at* generalize (if (2*d)е<64 then (g>>>1)>>>(63-(2*d)е) else g<<<((2*d)е-64))=v at* rw[p (i+1) _ _ _ _ XI];clear hk o;have:=l.toNat_lt;have:=h.toNat_lt;have:=t.toNat_lt;simp only[η,θ,apply_ite l6,lC];split_ifs<;>omega .rw[if_neg r,p (i+1) _ _ _ _ XI,κ];ring lemma Yk (n:н) (f:н->ℚ) (a:ℚ): (List.range n).foldl (λt j=>t+f j) a=a+∑j∈ZM n,f j:=by induction n generalizing a with | zero=>simp | succ n b=> rw[List.range_succ,List.foldl_append,b,Η];simp;ring lemma VG (b u:н) (h:u<= b): ((2:ℚ)^((b:о)-149))^2=(2:ℚ)^(2*(b-u))*(2:ℚ)^(2*(u:о)-298):=by rw[<-ZF ((2:ℚ)^((b:о)-149)) 2,<-zpow_mul, <-ZF (2:ℚ) (2*(b-u)),<-ZL ZQ] congr 1;omega lemma Ye (w:lI) (u:н) (h:ZW w=0\/u<= ZZ w): ZA w^2= (((ZW w*ZW w)<<<(2*(ZZ w-u)):н):ℚ)*2^(2*(u:о)-298):=by rw[Y1,κ];rcases h with h | h .rw[(YN w).2 h,h];simp .rw[mul_pow,show (sv w:ℚ)^2=(ZW w:ℚ)*ZW w by rw[<-sq_abs,VT];ring,VG _ _ h];push_cast;ring def Yf (num den:н) (s:о):р:= toWord (Model.ofModel Fmt (roundWithAccuracy (ZE) .positive (ZK num den) (-s) (sqrtAccuracy num den))) open Float.Model in lemma Q4 (b:Format) (g:Sign) (R:н) (e:о) (d:Accuracy) (i:R≠0) (hk:e+1<= b.targetExponent (lP R e)): m8 b g R e d=nR b g (2*R+Ya d) (e-1):=by have hb:Ya d<=1:=by cases d<;>simp[Ya] have h1:lP (2*R+Ya d) (e-1)=lP R e:=by unfold lP;rw[Vi R _ i hb];push_cast;ring unfold nR decreaseExponent;simp only[h1];rw[show (e-1-b.targetExponent (lP R e))к=0 by omega];simp;unfold m8 shiftToTargetExponent shiftToExponent;rw[h1];generalize j:b.targetExponent (lP R e)=T at* obtain ⟨k,h⟩:∃k,(T-e)к=k+1:=⟨(T-e)к-1,XI⟩;dsimp only;rw[h,show (T-(e-1))к=k+2 by omega,QA,show e-1+((k+2:н):о)=e+((k+1:н):о) by push_cast;ring] lemma Vh (d b:н): Ya (sqrtAccuracy d b)=if d=ZK d b^2*b then 0 else 1:=by unfold sqrtAccuracy;dsimp only;split_ifs<;>rfl lemma V9 (d b:н) (s:о) (j:33554432<= ZK d b) (h1:ZK d b>>>31=0) (h:-209<= s) (i:s<=297): Yf d b s=aX false (XF (2*ZK d b+ (if d=ZK d b*ZK d b*b then 0 else 1))) (XF (297-s)к):=by set R:=ZK d b with e have h3:(XF (297-s)к)а=(297-s)к:=by rw[ZG,ε XI] have l:(if d=R*R*b then 0 else 1)<=1:=by split_ifs<;>omega have g:(XF (2*R+(if d=R*R*b then 0 else 1)))а= 2*R+(if d=R*R*b then 0 else 1):=by rw[ZG,ε XI] rw[cM _ _ _ (by rw[h3];omega),h3,g];unfold Yf;rw[<-e,Q4 _ _ R (-s) _ XI (Q7 R s XI),Vh,<-e,sq, show (((297-s)к:н):о)-298=-s-1 by omega] rfl @[inline] def YG (num den R:н) (s:о):р:= if R>>>31==0&&-209<= s&&s<=297 then Core.aX false (XF (2*R+(if num==R*R*den then 0 else 1))) (XF (297-s)к) else Yf num den s lemma Vc (d b:н) (s:о) (e:33554432<= ZK d b): YG d b (ZK d b) s=Yf d b s:=by unfold YG;split next h=> simp at h;rw[V9 d b s e h.1.1 h.1.2 h.2];simp next=>rfl def V8 (B:н) (c:о):н:=if 0<=c then B<<rw[κ] .refine ⟨d,?_⟩;push_cast;rw[<-ZF (2:ℚ) cк,show ((cк:н):о)=c by omega];ring .refine ⟨XJ,?_⟩;push_cast;rw[<-ZF (2:ℚ) (-c)к,show (((-c)к:н):о)=-c by omega];have:(2:ℚ)^(-c)≠0:=XJ;rw[zpow_neg];field_simp def V5 (A Dn u:н) (eps:р):р:= let E:=ZW eps let ie:=ZZ eps let w0:=min (2*u) (ie+149) let B:=(A<<<(2*u-w0))+((Dn*E)<<<(ie+149-w0)) let s:о:=(352-(w0:о)-((Bз:о)-(Dnз:о)))/2 let c:о:=(w0:о)-298+2*s let num:=V8 B c let den:=YF Dn c let R:=ZK num den if 33554432<=R then YG num den R s else sqrtRational ((A:ℚ)*2^(2*(u:о)-298)/Dn+ZA eps) lemma YW (A d u:н) (b:lI) (h3:0 (2:ℚ)^j=2^k*2^((e:о)-298):=by intro k j h;rw[h,<-ZF,<-ZL ZQ];ring_nf have:=congrArg (λz:ℚ=>(z:ℝ)) (p.trans (by rw[<-hB,ZL ZQ,h2 (2*u-e) (2*(u:о)-298) XI, h2 (g+149-e) ((g:о)-149) XI,κ,κ] push_cast;field_simp: _=((A:ℚ)*2^(2*(u:о)-298)/d+E*2^((g:о)-149))*2^(2*s))) push_cast at this⊢;exact this .rfl @[inline] def VO (x k:н):н:= if k<63&&x>>>(63-k)==0 then (xе<<>>63==0 then (ZR xе)а else xз lemma Qh (x:н):Q2 x=xз:=by unfold Q2;split_ifs with h .simp at h;rw[Y7,Ϸ,ZG,ε XI] .rfl @[inline] def VK (Z:н) (k:о):н:=if k<=0 then Z>>>(-k)к else VO Z kк @[inline] def Vx (Z W:н) (fz:т) (k:о):т:= if k<=0 then fz || (VO W (-k)к!=Z) else fz @[inline] def V2 (r:н) (st:т):н:=if r !=0 || st then 1 else 0 @[noinline] def Vq (s:т) (Z:н) (fz:т) (Dd:н) (e0:о):Д:= let k:о:=(Q2 Dd:о)+27-(Q2 Z:о) let W:=VK Z k let st:=Vx Z W fz k let e:о:=e0-k let q:=W/Dd let r:=W-Dd*q let lq:=Q2 q let T:о:=(lq:о)+e if (k<=0 || !fz)&&33554432<=q&&lq<62&&-126<=T&&T<=126 then (Core.aX s (XF (2*q+V2 r st)) (XF (e+297)к))и else 4294967296 @[inline] def Yg (s:т) (Z:н) (fz:т) (Dd:н) (e0:о) (slow:Unit->р):р:= let c:=Vq s Z fz Dd e0 if c<4294967296 then cж else slow () lemma Qo (p:Prop) [Decidable p] (x:Е) (y:Е): (if (if p then xи else 4294967296)<4294967296 then (if p then xи else 4294967296)ж else y)=if p then x else y:=by by_cases b:p .simp only[b,ite_true,show xи<4294967296 from x.toNat_lt,UInt32.toUInt32_toUInt64] .simp[b] lemma ln (T t:н):((T>>>t)<<simp[h]<;>rw[ϓ]<;>omega lemma VI (N M:н) (b:0decide (v<0)=s) (l:0<=δ) (h1:δ<1) (q:d=true↔δ≠0) (r:0simp_all .omega lemma YC (s:т) (Z:н) (h:т) (d:н) (g:о) (b:Unit->lI) (v δ:ℚ) (G:v≠0->decide (v<0)=s) (z:0<=δ) (y:δ<1) (h3:h=true↔δ≠0) (B:0omega)]) (by rw[ZG,ε XI];omega) .exact u @[specialize] def Ym (x:ZB) (u i stop P N:н):н×н:= if i ((Ym x u i b P N).1:о)-(Ym x u i b P N).2= (P:о)-N+∑j∈ZM k,YS x u (i+j):=by intro k;induction k<;>intro i P N h<;>unfold Ym .rw[if_neg XI];simp .rename_i d;rw[if_pos XI];simp only[Yz,ZI,ZS,ϣ];have e:∀j,YS x u (i+(j+1))=YS x u (i+1+j):=λj=>by rw[ϵ];rfl simp only[e,ύ];rw[YS];split_ifs<;>rw[d (i+1) _ _ XI]<;>push_cast<;>ring lemma Yx (x:ZB) (u j:н) (h:ZW x[j]! =0\/u<= ZZ x[j]!): ZA x[j]! =(YS x u j:ℚ)*2^((u:о)-149):=by rw[Y1];unfold YS;rcases h with h | h .rw[(YN _).2 h,h];simp .rw[show (2:ℚ)^((ZZ x[j]!:о)-149)=(2:ℚ)^(ZZ x[j]!-u)*2^((u:о)-149) by rw[<-ZF,<-ZL ZQ];congr 1;omega,Vr,κ];split_ifs<;>push_cast<;>ring lemma VW (n:н) (x:ZB) (r u:н) (b:∀j,r*n<=j->jZW x[j]! =0\/u<= ZZ x[j]!): (∑j∈ZM n,ZA x[r*n+j]! = ((((Ym x u (r*n) (r*n+n) 0 0).1:о)-(Ym x u (r*n) (r*n+n) 0 0).2:о):ℚ)* 2^((u:о)-149))/\ (∑j∈ZM n,ZA x[r*n+j]!^2= ((Yl x u (r*n) (r*n+n) 0 0 0 0:н):ℚ)*2^(2*(u:о)-298)):=by rw[VN x u _ n _ 0 0 XI,Vb x u _ n _ 0 0 0 0 XI];push_cast[sub_zero,zero_add,Ϡ,ϫ,ύ,Κ,ϖ];constructor<;>refine Ζ rfl λj d=>?_<;>rw[Ϗ] at d;exacts [Yx x u _ (b _ XI XI),Ye _ u (b _ XI XI)] lemma YA (n:н) (x:ZB) (r u:н) (b:∀j,r*n<=j->jZW x[j]! =0\/u<= ZZ x[j]!): XH n x r 0= ((Yl x u (r*n) (r*n+n) 0 0 0 0:н):ℚ)*2^(2*(u:о)-298)/n:=by unfold rowVariance;rw[Yk,zero_add];simp only[sub_zero];rw[(VW n x r u b).2] @[inline] def Y0 (a b:н):н:=if b<=a then a-b else b-a lemma YO (a b:н):((Y0 a b*Y0 a b:н):ℚ)=((a:ℚ)-b)^2:=by unfold Y0;split_ifs with h .push_cast[h];ring .push_cast[show a<=b by omega];ring lemma VF (n:н) (x:ZB) (r u:н) (p:0jZW x[j]! =0\/u<= ZZ x[j]!): let pn:=Ym x u (r*n) (r*n+n) 0 0 let Q:=Yl x u (r*n) (r*n+n) 0 0 0 0 nt n x r=((pn.1:ℚ)-pn.2)*2^((u:о)-149)/n/\ XH n x r (nt n x r)= ((n*Q-Y0 pn.1 pn.2*Y0 pn.1 pn.2:н):ℚ)* 2^(2*(u:о)-298)/((n*n:н):ℚ):=by intro pn Q;obtain ⟨h1,h2⟩:=VW n x r u l;push_cast at h1 have d:nt n x r=((pn.1:ℚ)-pn.2)*2^((u:о)-149)/n:=by unfold nt;rw[Yk,zero_add,h1] set c:ℚ:=2^((u:о)-149) with i;have g:(2:ℚ)^(2*(u:о)-298)=c^2:=by rw[i,<-ZF,<-zpow_mul];push_cast;ring set S:ℚ:=(pn.1:ℚ)-pn.2 with h3;have e:XH n x r (nt n x r)= ((n:ℚ)*Q-S^2)*c^2/((n:ℚ)*n):=by unfold rowVariance;rw[Yk,zero_add,d,Ζ rfl λj _=>show (ZA x[r*n+j]!-S*c/n)^2= ZA x[r*n+j]!^2-2*(S*c/n)*ZA x[r*n+j]!+(S*c/n)^2 by ring,Ϥ,np, <-nI,h1,h2,g,Finset.sum_const,Finset.card_range,nsmul_eq_mul] field_simp;ring have o:(0:ℚ)<=(n:ℚ)*Q-S^2:=by have b:0<=XH n x r (nt n x r):=by unfold rowVariance;rw[Yk,zero_add];positivity rw[e,le_div_iff₀ XJ,nZ] at b;exact (mul_nonneg_iff_of_pos_right XJ).1 b have h:Y0 pn.1 pn.2*Y0 pn.1 pn.2<=n*Q:=(Nat.cast_le (α:=ℚ)).1 (by rw[YO];push_cast;linarith) refine ⟨d,?_⟩;rw[e,no h,YO,<-h3,g];push_cast;ring def sg (s:т) (M:ℚ):ℚ:=if s then-M else M lemma Vm (s:т) (M:ℚ) (d:0<=M) (e:о) (b:н) (g:0decide (sg s M*2^e/b<0)=s):=by unfold sg;cases s .simp only[Α,XA];exact ⟨abs_of_nonneg XJ,λ_=>by simp;positivity⟩ .simp only[ite_true];refine ⟨by rw[neg_mul,neg_div,abs_neg,abs_of_nonneg XJ],λh=>?_⟩ simp only[ZH];have:0ring lemma Yn (a b:н):sg (decide (a>>(F-k) @[inline] def Q5 (c k F G:н):н:=if F<=k then 0 else VO (c&&&(VO 1 (F-k)-1)) (k-G) lemma Qu (c k F G:н) (hk:G<=k) (b:G<=F): c*2^k=(Ql c k F*2^(F-G)+Q5 c k F G)*2^G:=by have e:c*2^(k-G)=Ql c k F*2^(F-G)+Q5 c k F G:=by unfold Ql Q5;simp only[Yz,κ,one_mul,ν, ζ] split_ifs .rw[add_zero,XD,<-mH,show k-F+(F-G)=k-G by omega] .rw[show F-G=F-k+(k-G) by omega,mH,<-XD,<-mq,ZU] rw[<-e,XD,<-mH,mV hk] @[inline] def Qw {α:Type} (pH pL qH qL w:н) (K:т->н->н->α):α:= let M:=VO 1 w let a:=pH+(pL>>>w) let b:=pL&&&(M-1) let c:=qH+(qL>>>w) let d:=qL&&&(M-1) let s:=asimp at h⊢<;>rw[h]<;> push_cast<;>ring lemma Qc {α:Type} (i e j g w:н) (K:т->н->н->α) (R:α) (h:∀s H L,L<2^w->((i*2^w+e:н):ℚ)-(j*2^w+g:н)= sg s (H*2^w+L:н)->K s H L=R): Qw i e j g w K=R:=by unfold Qw;simp only[Yz,m6,ν,ζ];have l:=ZU e (2^w);have p:=ZU g (2^w);have q:=Λ e (Ϙ w);have r:=Λ g (Ϙ w);generalize e/2^w=x,e%2^w=b,g/2^w=y,g%2^w=d at* subst l p;apply h .split_ifs<;>omega .apply Qp;rcases Nat.lt_trichotomy (i+x) (j+y) with o | o | o<;> [have:=χ (2^w) o;have:=congrArg (.*2^w) o; have:=χ (2^w) o]<;> split_ifs at*<;>simp only[Ϩ,ZH,Ε,ZY, Nat.succ_eq_add_one,Nat.sub_mul,mq,one_mul] at*<;>omega @[inline] def tw {α:Type} (s1:т) (A B k r:н) (s2:т) (C k2 F G:н) (K:т->н->н->α):α:= let aH:=Ql A (k+r) F+Ql B k F let aL:=Q5 A (k+r) F G+Q5 B k F G let cH:=Ql C k2 F let cL:=Q5 C k2 F G Qw ((if s1 then 0 else aH)+(if s2 then 0 else cH)) ((if s1 then 0 else aL)+(if s2 then 0 else cL)) ((if s1 then aH else 0)+(if s2 then cH else 0)) ((if s1 then aL else 0)+(if s2 then cL else 0)) (F-G) K lemma Q8 {α:Type} (d:т) (A B k r:н) (e:т) (C b F G:н) (K:т->н->н->α) (R:α) (h1:G<=k) (h2:G<=b) (h3:G<=F) (h:∀s H L,L<2^(F-G)->sg d (A*2^(k+r)+B*2^k:н)+sg e (C*2^b:н)= sg s (H*2^(F-G)+L:н)*2^G->K s H L=R): tw d A B k r e C b F G K=R:=by apply Qc;intro s H L g i;apply h s H L g;rw[Qu A (k+r) F G XI h3,Qu B k F G h1 h3,Qu C b F G h2 h3,<-i];cases d<;>cases e<;>simp only[sg,ite_true,XA,Α]<;>push_cast<;>ring lemma Qm (s:т) (H L w d:н) (e:о) (b:Unit->lI) (V:ℚ) (g:0push_cast<;>field_simp obtain ⟨ha,h⟩:=Vm s (H+L/2^w) XJ _ d g;rw[<-h1] at ha h;exact YC _ _ _ _ _ _ _ _ h XJ ((div_lt_one XJ).2 (mod_cast j)) XK g ha i lemma QD (s t:т) (a b c k r:н): sg (XG s t) (a*c*2^(k+r)+b*c*2^k:н)=sg s (a*2^r+b:н)*sg t c*2^k:=by unfold sg;cases s<;>cases t<;>simp<;>ring lemma Yv (s:т) (a b:ℚ):sg s (a*b)=sg s a*b:=by unfold sg;split_ifs<;>ring @[inline] def Qv {α:Type} (n u r:н) (sS:т) (Sh Sl:н) (x:р) (K:т->н->н->α):α:= if r=0 then let X:=VO ((ZC x)а*n) ((ZD x)а-u) let p:=(if ZX x then 0 else X)+(if sS then Sh+Sl else 0) let q:=(if ZX x then X else 0)+(if sS then 0 else Sh+Sl) K (decide (pн->н->α) (R:α) (h:∀s H L,sg (!sS) (Sh*2^r+Sl:н)+sg (ZX x) (ZW x*n*2^(ZZ x-u):н)= sg s (H*2^r+L:н)->K s H L=R): Qv n u r sS Sh Sl x K=R:=by unfold Qv;simp only[ZI,ZS,Yz,κ];by_cases hr:r=0 .subst hr;apply h;simp only[pow_zero,mul_one,add_zero,Yn];unfold sg;cases sS<;>cases ZX x<;>simp<;>ring .rw[if_neg hr];apply Q8 (h1:=n3 _) (h2:=n3 _) (h3:=n3 _);intro s H L _ h';apply h;simpa using h' @[inline] def V4 (n u r:н) (sS:т) (Sh Sl:н) (x g b d:р) (slow:Unit->р):р:= if !ZX d&&ZC d !=0 then Qv n u r sS Sh Sl x λsD Dh Dl=> let mg:=(ZC g)а let Dd:=n*(ZC d)а let T1h:=Dh*mg let T1l:=Dl*mg let T2:=(ZC b)а*Dd let e1:=u+(ZD g)а let e2:=(ZD b)а+(ZD d)а let G:=min e1 e2 let F:=max (max ((if T1h==0 then Q2 T1l else Q2 T1h+r)+e1) (Q2 T2+e2)-61) G tw (XG sD (ZX g)) T1h T1l e1 r (ZX b) T2 e2 F G λs H L=> Yg s H (L !=0) Dd ((G:о)-149-(ZD d)а+(F-G:н)) slow else slow () lemma Vz (n u r:н) (sS:т) (Sh Sl:н) (x g b d:lI) (m:ℚ) (slow:Unit->lI) (hn:0simp, show ∀M,sg false M=M from λ_=>rfl] simp only[XB (XC ℚ),ZL (XC ℚ),ZF,pow_add];field_simp;ring .exact h0 lemma dE (w:lI):lE w<= 254:=by have:=mS w;unfold lE;split_ifs<;>omega @[inline] def Yu (v k a:Д):Д:=if 61<=k+a then v>>>(k+a-61) else v<<<(61-a-k) @[inline] def gr (s:т) (p σ:Д):Е:= let r:=Core.aZ 1 (if s then 0-p else p) σ if r==0x100000000 then Core.aX s p σ else rж lemma iN (s:т) (p σ:Д) (h:pа<2^63):gr s p σ=aX s p σ:=by unfold gr;dsimp only;generalize d:(if s then 0-p else p)=v;split;rfl;rename_i i;obtain ⟨h1,-,-,-,e⟩:=ce 1 v σ Б Б (by simpa using i) rw[e,toUInt32_toUInt64];unfold aS at* rcases gu v with ⟨b,g⟩|⟨b,g⟩<;>rw[b] at h1⊢<;>cases s<;>simp only[ite_true,Α,ite_false] at d<;>subst d<;> simp at*<;>simp only[UInt64.size] at*<;>omega @[inline] def Q0 (s1:т) (B:Д) (s2:т) (C d σ Dd:Д) (slow:Unit->р):р:= let c:=C>>>d let Z:=if s1==s2 then B+c else B-c let q:=Z/Dd let r:=Z-q*Dd if d<64&&(s1==s2 || c>>25!=0&&q>>>62==0&& 146<=σ&&σ<=362 then gr s1 (2*q+1) σ else slow () lemma QB {g i:т} {B C:ℚ} {b e d:н} (h:C=0\/e+d=b) {k:о} {D:ℚ}: (sg g B*2^((b:о)-62)+sg i C*2^((e:о)-62))*2^k/D= (sg g B+sg i (C/2^d))*2^((b:о)-62+k)/D:=by rcases h with h | h<;>subst h<;>unfold sg<;>push_cast<;>simp only[ZL (XC ℚ),XB (XC ℚ),ZF]<;>split_ifs<;>field_simp<;>ring lemma Qf (s t:т) (a b:ℚ):sg (XG s t) (a*b)=sg s a*sg t b:=by unfold sg;cases s<;>cases t<;>simp @[inline] def Qt (s0:т) (B a w Dd lD id:Д) (g b:р) (slow:Unit->р):р:= let E1:=w+ZD g+a let T:=(ZC b*Dd)<<<(37-lD) let E2:=ZD b+id+24+lD let s1:=XG s0 (ZX g) if ZC b==0 || E2<=E1 then Q0 s1 B (ZX b) T (if ZC b==0 then 0 else E1-E2) (E1+87-id) Dd slow else Q0 (ZX b) T s1 B (E2-E1) (E2+87-id) Dd slow @[inline] def Qr (sx sS:т) (nX Xl fb S L w Dd lD id:Д) (g b:р) (slow:Unit->р):р:= let Sh:=S>>>L let p:=(if sx then 0 else nX)+(if sS then Sh else 0) let q:=(if sx then nX else 0)+(if sS then 0 else Sh) let s0:=decide (p>>63==0&&L<=38&&A>>>38==0&&24<=a then let cX:=Yu (Xl*ZC g) fb a let cS:=Yu ((S&&&((1<<р):р:= let ix:=ZD x let m:=ZC x*n let K:=λ(_:Unit)=> let w:=max u (max (ix+ZR m) (u+lS)-36) let fb:=if m==0 || w<= ix then 0 else w-ix if fb<64&&(m==0 || w>ix || ix-w<=27) then Qr (ZX x) sS (if w<= ix then m<<<(ix-w) else m>>>fb) (m&&&((1<<>>38==0&&(m==0 || ix-u<=27) then Qr (ZX x) sS (m<<<(ix-u)) 0 0 S 0 u Dd lD id g b K else K () lemma QK {α:Type} {c:Prop} [Decidable c] {B T:α} {F:(Unit->α)->α} (h:B=T) (h1:B=T->c->F (λ_=>B)=T): (if c then F (λ_=>B) else B)=T:=by split;exact h1 h ‹_›;exact h lemma YX (v k a:Д) (G:н) (hk:kа<64) (ha:24<=aа) (h3:aа<=61) (i:G<2^24) (d:vа<2^kа*G): ((Yu v k a)а:ℚ)<=vа*2^(61-aа)/2^kа/\ (vа*2^(61-aа)/2^kа:ℚ)<(Yu v k a)а+1/\ (Yu v k a)аrename_i h<;>rw[γ,b] at h<;>simp at h .have h1:(k+a-61)а=kа+aа-61:=by rw[τ,b];simp only[lC];omega rw[ξ,h1,ε XI,ζ,<-nC _ _ (show 0<2^(61-aа) by positivity),<-pow_add];congr 2;omega .have h1:(61-a-k)а=61-aа-kа:=by rw[τ,τ];simp only[lC];omega have e:vа*2^(61-aа)/2^kа=vа*2^(61-aа-kа):= Nat.div_eq_of_eq_mul_left XJ (by rw[ό,<-pow_add];congr 2;omega) rw[ς,h1,ε (show 61-aа-kа<64 by omega),κ, e] exact ε (lt_of_lt_of_le (ψ d XJ) (by rw[ϓ (2^_) G,ό,<-pow_add,show kа+(61-aа-kа)=61-aа by omega];omega)) rw[j];have l:0<2^kа:=XJ;refine ⟨by rw[le_div_iff₀ XJ];exact_mod_cast nS _ _,by rw[div_lt_iff₀' XJ];exact_mod_cast Nat.lt_mul_div_succ _ l,?_,g⟩ exact Ϫ (by rw[<-ό];exact ψ d XJ) lemma QE (h i:т) (b g d B:Д) (l j:ℚ) (h1:B=b+(if h then g else 0)+(if i then d else 0)-((if h then 0 else g)+(if i then 0 else d))) (hX:(gа:ℚ)<=l) (r:lsimp[τ,η]<;>omega refine ⟨o.2,?_⟩;have e:=o.1;qify at e;clear*-e hX r p q;rw[e,abs_lt];split_ifs<;>constructor<;>linarith lemma Vs (s1:т) (B:Д) (s2:т) (C d σ Dd:Д) (slow:Unit->lI) (X Y v:ℚ) (e:о) (hB:Bа<2^63) (hC:Cа<2^63) (hH:Ddа<2^63) (hX:|X-Bа|<2) (hY:|Y-Cа|<2) (hσ:σа<=506->(σа:о)=e+297) (hv:v=(sg s1 X+sg s2 (Y/2^dа))*2^e/Ddа) (h2:slow ()=ZT v): Q0 s1 B s2 C d σ Dd slow=ZT v:=by unfold Q0;dsimp only;generalize hn:C>>>d=c;generalize ht:(if s1==s2 then B+c else B-c)=Z;generalize ho:Z/Dd=q;generalize hu:Z-q*Dd=r;split;rename_i hk;simp[γ,θ,<-ο,ζ,and_assoc] at hk obtain ⟨hd,h0,h8,hp,hj,hg,hL,hJ⟩:=hk;rw[iN _ _ _ (by rw[η,Ν];simp;omega)];have hc:cа=Cа/2^dа:=by rw[<-hn,ξ,ε hd,ζ] have hy:cа<=Cа:=by rw[hc];exact ZV _ _ have hb:=ZU Zа Ddа;have hF:=Z.toNat_lt;have hq:qа=Zа/Ddа:=by rw[<-ho,n2] have hr:rа=Zа%Ddа:=by rw[<-hu,τ,Ν,hq];clear*-hb hF;omega have hD:0linarith obtain ⟨Yt,he,hf⟩:∃Yt:ℚ,v=sg s1 Yt*2^e/Ddа/\|Yt-Zа|<4:=by clear*-hX hi ht hv h0 hB hC hy;rw[abs_lt] at hX hi;subst ht;by_cases hs:s1=s2;refine ⟨X+Y/2^dа,by rw[hv,<-hs];unfold sg;split<;>ring,?_⟩;rw[if_pos (by simpa using hs),η,ε XI];push_cast on_goal 2=>have:=h0.resolve_left hs;refine ⟨X-Y/2^dа,by rw[hv,Bool.eq_not_of_ne (Ne.symm hs)];unfold sg;cases s1<;>simp<;>ring,?_⟩;rw[if_neg (by simpa using hs),μ _ _ (γ.2 XI),no XI] all_goals rw[abs_lt];constructor<;>linarith rw[hr] at h8 hp;have:=Λ Zа hD;generalize hQ:Zа/Ddа=Q at* generalize Zа%Ddа=R at* have hz:(Q:ℚ)*Ddа+R=Zа:=by exact_mod_cast hb clear hB hC hc hy hF hb hd h0 hn ht ho hu hr;have hK:(4:ℚ)<=R:=by exact_mod_cast h8 have hE:(R:ℚ)+4lI) (V Q:ℚ) (n:н) (G:jа=n*ZW d) (h2:4<=jа) (t:jа<2^34) (o:eа=jаз) (hb:id=ZD d) (L:ZX d=false) (R:wа<=293) (ha:aа<=61) (hB:Bа<2^63) (hX:|Q*ZW g*2^(61-aа)-Bа|<2) (I:V=sg r Q*2^((wа:о)-149)/n*ZA g/ZA d+ZA b) (h3:l ()=ZT V): Qt r B a w j e id g b l=ZT V:=by have y:=ZO b;have N:=dE g;have O:=dE b;have z:=dE d;have v:=@Ϧ jа;rw[<-o] at v;have M:eа<34:=by rw[o];exact (ϱ XI).2 t unfold Qt;dsimp only;generalize J:ZC b*j=T;have q:Tа=ZW b*jа:=by have:=ϋ y t;rw[<-J,Ν,ZI];exact ε XI have p:(T<<<(37-e))а=Tа*2^(37-eа)/\Tа*2^(37-eа)<2^63:=by have K:(37-e)а=37-eа:=by simp[τ];omega have:Tа*2^(37-eа)<2^63:=lt_of_lt_of_le (ψ (by rw[q];exact ϋ y v) XJ) (by rw[<-pow_add,<-pow_add];exact υ XJ XI) rw[ς,K,ε (show 37-eа<64 by omega),κ];exact ⟨ε XI,this⟩ have h1:(w+ZD g+a)а=wа+ZZ g+aа:=by simp[η,ZS];clear*-R ha N;omega have i:(ZD b+id+24+e)а=ZZ b+ZZ d+24+eа:=by simp[η,ZS,hb];clear*-o O z M;omega generalize w+ZD g+a=D at h1⊢;generalize ZD b+id+24+e=F at i⊢;generalize T<<<(37-e)=U at p⊢ have u:V=(sg (XG r (ZX g)) (Q*ZW g*2^(61-aа))* 2^((Dа:о)-62)+sg (ZX b) (Uа:ℚ)* 2^((Fа:о)-62))*2^(-148-(ZZ d:о))/jа:=by rw[p.1,q,h1,i,XD Q,Qf,I,Y2 g,Y2 d,Y2 b,L,G];obtain ⟨W,S⟩:=Nat.mul_ne_zero_iff.1 (show n*ZW d≠0 by omega) push_cast;simp only[Yv];rw[show sg false (ZW d:ℚ)=ZW d from rfl,pow_sub₀ (2:ℚ) ZQ ha,pow_sub₀ (2:ℚ) ZQ (show eа<=37 by omega)];simp only[XB (XC ℚ),ZL (XC ℚ),ZF,zpow_neg];field_simp have A:∀E:Д,Eа<999->(E+87-id)а<=506->((E+87-id)а:о)=Eа-62+(-148-(ZZ d:о))+297:=λE H h=>by rw[τ,η,hb,ZS] at h⊢;simp only[lC] at h⊢;clear*-h H z;omega split .rename_i hk;simp[γ,h1,i] at hk;refine Vs _ _ _ _ _ _ _ _ _ (Uа) V _ hB XI XI hX XK (A _ XI) ?_ h3 rw[u,QB ?_];split<;>rename_i h .left;rw[p.1,q,<-ZI,show ZC b=0 by simpa using h];simp .have P:=hk.resolve_left (by simpa using h);rw[μ _ _ (γ.2 XI),h1,i];right;clear*-o h1 i P;omega .rename_i hk;simp[γ,h1,i] at hk refine Vs _ _ _ _ _ _ _ _ (Uа) _ V _ XI hB XI XK hX (A _ XI) ?_ h3;rw[u,add_comm,QB ?_];right;rw[μ _ _ (by rw[γ,h1,i];clear*-o h1 i hk;omega),h1,i];clear*-o h1 i hk;omega lemma Vt (v s:Д) (b:sа<64):(v&&&((1<<simp[γ,ε b,m6,ε d,ν,md] lemma Qz {d b:т} {M S j e p q:ℕ} {i g:ℚ} {l u w:ℤ} {o:ℚ} (r:o=sg d (M*2^l)*2^(-149:ℤ)) (v:(M:ℚ)*2^l=(j+i)*2^w) (t:(S:ℚ)*2^u=(e+g)*2^w) (y:p=(if d then 0 else j)+(if b then e else 0)) (z:q=(if d then j else 0)+(if b then 0 else e)): o-sg b S*2^(u-149)=sg (decide (pring,t] have h:=Yn p q;generalize decide (pcases b<;>cases B<;>simp[sg] at h⊢<;>linear_combination-(2^w/2^149:ℚ)*h lemma Qi (j:т) (i o y S L w r W id:Д) (x g b d:lI) (e:Unit->lI) (V:ℚ) (n u:н) (hn:0ring unfold Qr;dsimp only;generalize hi:S>>>L=l;generalize hr:(if ZX x then 0 else i)+(if j then l else 0)=p;generalize hz:(if ZX x then i else 0)+(if j then 0 else l)=q;generalize hy:(if decide (psplit<;>simp<;>omega have hA:Aа=Y0 pа qа:=by rw[<-hy];clear*-;unfold Y0;split<;>rename_i h<;>simp only[ZH,θ] at h<;>rw[μ _ _ (γ.2 XI)]<;>split<;>omega have hb:Aа<2^38:=XI;have z:=ZO g;have hh:Aа*ZW g<2^62:=by have:=ϋ hb z;omega have J:∀X:Д,Xа<2^38->(X*ZC g)а=Xа*ZW g:=λX h=>by rw[Ν,ZI];exact ε (by have:=ϋ h z;omega) have O:=J A hb;have U:(ZR (A*ZC g))а=(Aа*ZW g)з:=by rw[Y7,O] have I:Aа*ZW g≠0:=by intro h;rw[U,h] at t;simp at t have h1:=Ϧ (n:=Aа*ZW g);have hB:=ϥ I;have h2:=Nat.le_of_lt_succ ((ϱ I).2 hh);rw[<-U] at h1 hB h2;generalize A*ZC g=N at* generalize ZR N=a at* have hj:Aа*ZW g*2^(61-aа)<2^62:=lt_of_lt_of_le (ψ h1 XJ) (by rw[<-pow_add];exact υ XJ XI) have Q:(N<<<(61-a))а=Aа*ZW g*2^(61-aа):=by have:(61-a)а=61-aа:=by simp[τ];omega rw[ς,this,ε (show 61-aа<64 by clear*-;omega),κ,O] exact ε XI have K:=mf (right_ne_zero_of_mul I);have hs:1ring;exact h3 lemma Qq (m b w:Д) (M i:н) (g:mа=M) (l:M<2^34) (d:bа=i) (o:i<=254) (hb:wа<=255) (h:m=0\/(b-w)а<=27): (M:ℚ)*2^(i:ℤ)=(m<<<(b-w))а*2^(wа:ℤ)/\(m<<<(b-w))а<2^61:=by rcases h with h | h .subst h g;simp rw[τ,d] at h have hb:=lZ l (υ (n:=2) XI (show i-wа<=27 by omega)) XJ;have e:(m<<<(b-w))а=M*2^(i-wа):=by rw[ς,μ _ _ (γ.2 XI),d,g, ε (show i-wа<64 by omega),κ];exact ε XI refine ⟨?_,XI⟩;have j:(2:ℚ)^(i:ℤ)=2^(i-wа)*2^(wа:ℤ):=by rw[<-ZF,<-ZL ZQ];congr 1;omega rw[e,j];push_cast;ring lemma Qj (n u S O:Д) (D:т) (l B id:Д) (x g b d:lI) (j:Unit->lI) (V:ℚ) (M:nа<1024) (J:lа=nа*ZW d) (ha:4<=lа) (hr:Bа=lаз) (hp:id=ZD d) (hq:ZX d=false) (A:uа<=255) (I:V=(ZA x-sg D Sа*2^((uа:о)-149)/nа)* ZA g/ZA d+ZA b) (F:j ()=ZT V): Qy n u S O D l B id x g b j=ZT V:=by have N:=dE x;have hk:lа<2^34:=by have:=ϋ M (ZO d);omega have W:0Qi D t v i S L w l B id x g b d sl V nа uа W J ha hk hr hp hq unfold Qy;dsimp only;generalize X:ZC x*n=m;have r:mа=ZW x*nа:=by rw[<-X,Ν,ZI];exact ε XI have h3:=ZS x;refine QK ?_ λR q=>?_ .generalize Y:max u (max (ZD x+ZR m) (u+O)-36)=w;have hl:uа<=wа:=by rw[<-Y,UInt64.toNat_max];omega generalize K:(if (m==0 || w<= ZD x) then 0 else w-ZD x)=i;split;rename_i q;simp[θ,h3,γ] at q;obtain ⟨z,hs⟩:=q;have o:(m&&&((1<<>>i)=t;obtain ⟨ho,ht⟩:((ZW x*nа:ℕ):ℚ)*2^(ZZ x:ℤ)= (tа+(vа:ℚ)/2^iа)*2^(wа:ℤ)/\tа<2^61:=by by_cases p:wа<= ZZ x .have U:iа=0:=by rw[<-K,if_pos (by simp[γ,h3,p])];rfl rw[o,U,<-G,if_pos (by rw[γ,h3];exact p)];obtain ⟨P,Q⟩:=Qq m _ w _ _ r y h3 N XI (hs.imp_left (·.resolve_right XI)) exact ⟨by rw[P];simp[Nat.mod_one],Q⟩ have e:tа=ZW x*nа/2^iа:=by rw[<-G,if_neg (by rw[γ,h3];exact p),ξ,r, ε z,ζ] refine ⟨?_,by rw[e];exact lt_of_le_of_lt (ZV _ _) XI⟩;rw[e,o];by_cases E:ZW x*nа=0 .simp[E] have hv:iа=wа-ZZ x:=by rw[<-K,if_neg (by simp[γ,h3,p,<-ο,r,E]), μ _ _ (γ.2 XI),h3] rw[show (wа:ℤ)=ZZ x+iа by clear*-h3 p hv;omega,ZL ZQ,ZF (2:ℚ) iа];field_simp;exact_mod_cast (ZU _ _).symm exact H _ _ _ (w-u) _ _ (by rw[μ _ _ (γ.2 hl)];omega) A ht z (by rw[o];exact Λ _ XJ) (by rw[o];exact lt_of_le_of_lt (Nat.mod_le _ _) y) ho I F exact F simp[γ] at q;obtain ⟨h1,h2⟩:=Qq m _ u _ _ r y h3 N A q.2;exact H _ 0 0 0 u _ XK A h2 XK XK XK (by simpa using h1) I R def Yy (n:н) (eps:р) (x:ZB) (r:н):р:= let lo:=r*n let u:=Yh x lo (lo+n) 255 V5 (Yl x u lo (lo+n) 0 0 0 0) n u eps lemma V7 (n:н) (b:lI) (x:ZB) (r:н) (e:0н->р) (n rows r:н) (out:ZB): ZB:= if rн->lI) (n b r:н) (d:ZB): (Yb F n b r d).toList=d.toList++ (List.range' (r*n) ((b-r)*n)).map (λi=>F (i/n) i):=by induction h:b-r generalizing r d<;>unfold Yb .rw[if_neg XI];simp .rename_i k g;rw[if_pos XI,g (r+1) _ XI,Y9,List.append_assoc];congr 1;rw[mj,add_one_mul, add_one_mul,ϒ (k*n),<-List.range'_append_1,List.map_append] congr 1;apply List.map_congr_left;intro i e;rw[List.mem_range'_1] at e;rw[nP e.1 (add_one_mul r n▸e.2)] @[inline] def rE (a g d:р) (D l:Д):р:= let F:=λ(_:Unit)=>ZT (ZA a*ZA g/ZA d) if ZC a*ZC g==0 then 0 else if 4<=D&&!ZX d then Qr (ZX a) false (ZC a) 0 0 0 0 (ZD a) D l (ZD d) g 0 F else F () lemma kL (a g d:lI):rE a g d (ZC d) (ZR (ZC d))=ZT (ZA a*ZA g/ZA d):=by unfold rE;dsimp only;split_ifs with b h1 .rw[Y2 a,Y2 g];rcases Nat.mul_eq_zero.1 (show ZW a*ZW g=0 by rw[<-YB,show ZC a*ZC g=0 by simpa using b];rfl) with h|h<;>simp[h,sg,Yp] .simp only[Ε,ZH,Bool.not_eq_true',γ,lC] at h1 exact Qi false _ 0 0 0 0 _ _ _ _ a g 0 d _ _ 1 (ZZ a) XI (by simp[ZI]) h1.1 (by rw[ZI];have:=ZO d;omega) (Y7 _) rfl h1.2 (by simp[ZS]) (by have:=dE a;omega) (by rw[ZI];have:=ZO a;omega) XK XK XK (by simp[ZI,ZS]) (by rw[Y2 0,show ZW (0:lI)=0 by rfl];simp[sg]) rfl .rfl structure ls where l:Д h:Д c:н big:н P:н N:н @[inline] def cA (P:н) (q p:Д):н:=if q

omega lemma lw (P:н) (p:Д):cA P p p=P:=by simp[cA] lemma lu (w:lI) (b:н) (h:b<=39):(ZC w<<>>1)>>>(63-k) else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l' let s:=d4 x u i b l h c big P N e d s.big+s.lа+(s.hа+s.c<<<64)<<<64=Yl x u i b l h c big/\(s.P,s.N)=Ym x u i b (P+eа) (N+dа):=by intro k;induction k<;>intro i l h c big P N e d hk<;>dsimp only<;>unfold d4 Yl Ym .simp only[show ¬irefine ⟨(g _ _ _ _ _ _ _ _ _ XI).1,(g _ _ _ _ _ _ _ _ _ XI).2.trans ?_⟩<;> simp (disch:=assumption) only[lw,cy,lu,ϵ _ (VO _ _)] @[inline] def bj (a b:Д):Д×Д:= let a0:=a%4294967296;let a1:=a/4294967296;let b0:=b%4294967296;let b1:=b/4294967296 let p00:=a0*b0;let p01:=a0*b1;let p10:=a1*b0 let m:=p00/4294967296+p01%4294967296+p10%4294967296 (a1*b1+p01/4294967296+p10/4294967296+m/4294967296,m%4294967296*4294967296+p00%4294967296) lemma cg (a b:Д):(bj a b).1а*2^64+(bj a b).2а=aа*bа:=by unfold bj;simp only[η,Ν,n2,UInt64.toNat_mod,lC];have:=a.toNat_lt;have:=b.toNat_lt;generalize aа=A,bа=B at* have e:A*B=A/4294967296*(B/4294967296)*2^64+(A%4294967296*(B/4294967296)+A/4294967296*(B%4294967296))*2^32+ A%4294967296*(B%4294967296):=by conv_lhs=>rw[<-ϩ A 4294967296,<-ϩ B 4294967296] ring obtain ⟨d,g,h,i⟩:A%4294967296<=4294967295/\B%4294967296<=4294967295/\A/4294967296<=4294967295/\B/4294967296<=4294967295:=А;have:=l5 d g;have:=l5 d i;have:=l5 h g;have:=l5 h i;omega @[inline] def eE (ah al mm:Д) (k:н):Д×Д:= let K:=kе let bl:=al+(if K<64 then mm<<>>1)>>>(63-K) else mm<<<(K-64))+(if bl>>1)>>>(63-kе) else b<<<(kе-64))=j at* have:=e.toNat_lt;have:=i.toNat_lt;simp only[η,θ,apply_ite l6,lC];split_ifs<;>omega @[inline] def iZ (bh bl:Д):Д:=if bh !=0 then 64+ZR bh else ZR bl lemma j7 (b d:Д):(iZ b d)а=(bа*2^64+dа)з:=by have:=d.toNat_lt;unfold iZ;split_ifs with h .have e:(bа*2^64+dа)>>>64=bа:=by rw[ζ];omega have g:bа≠0:=by simpa[<-ο] using h rw[dF (bа*2^64+dа) 64 (by rw[e];exact g),e,η,Y7] have:=(ϱ g).2 b.toNat_lt;simp;omega .simp only[bne_iff_ne,ne_eq,Decidable.not_not] at h;subst h;simp[Y7] @[inline] def iR (ah al:Д) (Dn u:н) (eps:р) (slow:Unit->р):р:= let sE:=ZZ eps+149-2*u let b:=eE ah al (Dnе*ZC eps) sE let S2:=(1376+(ZR Dnе)а-(2*u+(iZ b.1 b.2)а))/2 let k:=1322-(2*u+2*S2) let den:=Dnе<<simp only[τ,θ,γ,<-ο,lC] at*<;>omega lemma gF (N O:Д) (g u:н) (d:lI) (r:Unit->lI) (A:н) (hA:Nа*2^64+Oа=A) (hs:r ()=V5 A g u d):iR N O g u d r=V5 A g u d:=by unfold iR;dsimp only;generalize hE:ZZ d+149-2*u=sE;generalize X:eE N O _ sE=b;generalize U:(iZ _ _)а=L;generalize F:(1376+_-(2*u+L))/2=z;generalize Y:1322-(2*u+2*z)=k;generalize j:gе<<(m*m)а=mа*mа:=λm h=>by rw[Ν];apply ε;have:=l5 h h;clear*-this;omega rw[hq _ e.le,o] at l;rw[hq _ (D▸e),D,o] at y;have M:=p.2.toNat_lt;have as:=q.2.toNat_lt;simp only[θ,γ,<-ο] at J I;have j:0>>31==0&&decide (-209<= (z:о)-512)&&decide ((z:о)-512<=297))=true by simp only[Ε,ZY,ZH];clear*-e G H;omega), show (p.1==b.1&&p.2==b.2)=(B==Rа*Rа*(g*2^k)) by apply ϗ.2;simp only[Ε,ZY,<-ο];clear*-hB l w M;omega] congr 1 .apply ο.1;rw[ZG,η,Ν] split<;>simp<;>clear*-e<;>omega .congr 1;clear*-H;omega def jF (n:н) (eps:р) (x:ZB) (r:н):р:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let st:=d4 x u lo (lo+n) 0 0 0 0 0 0 0 0 let F:=λ(_:Unit)=>V5 (st.big+st.lа+(st.hа+st.c<<<64)<<<64) n u eps if st.c=0/\st.big=0 then iR st.h st.l n u eps F else F () lemma jG (n:н) (b:lI) (x:ZB) (r:н):jF n b x r=Yy n b x r:=by unfold jF Yy;dsimp only;obtain ⟨h1,-⟩:=gG x (Yh x (r*n) (r*n+n) 255) (r*n+n) n (r*n) 0 0 0 0 0 0 0 0 А;rw[<-h1];generalize d4 x (Yh x (r*n) (r*n+n) 255) (r*n) (r*n+n) 0 0 0 0 0 0 0 0=h;split;swap;rfl;rename_i g;obtain ⟨e,d⟩:=g;apply gF _ _ _ _ _ _ _ _ rfl;rw[e,d];simp[κ];ring def Yo (rows n:н) (eps:р) (x g:ZB):ZB:= let den:=Array.ofFn (n:=rows) λr=>jF n eps x rй Yb (λr i=>rE x[i]! g[i-r*n]! den[r]! (ZC den[r]!) (ZR (ZC den[r]!))) n rows 0 (Array.mkEmpty (rows*n)) lemma YE (i n:н):i-i/n*n=i%n:=by rw[Nat.mod_def,ϓ] lemma Qg {α:Type} [Inhabited α] {m k:н} (f:Fin m->α) (h:k< m): (lN f)[k]! =f ⟨k,h⟩:=by rw[getElem!_pos _ k (by simpa using h),Τ] lemma Ys (F:н->н->lI) (n b:н) (f:Fin (b*n)->lI) (h:∀i (h:isimp;exact h lemma YP (d n:н) (b:lI) (x g:ZB) (h:00&&n>0&&xг==rows*n&&gг==n&&x.all finiteWord&&g.all finiteWord&&finiteWord eps&&(!ZX eps&&ZC eps !=0) lemma iQ (d n:н) (b:lI) (x g:ZB):SN d n b x g=mG d n b x g:=by unfold SN mG;congr 1;rw[Q6,Y2];have:(0:ℚ)<2^((ZZ b:о)-149):=XJ;unfold sg;cases ZX b<;>simp[this,Nat.pos_iff_ne_zero] def dq (rows n:н) (eps:р) (x g:ZB):ZB:= if SN rows n eps x g then Yo rows n eps x g else rmsnormSpec rows n eps x g lemma fF:dq=rmsnormSpec:=by funext b n d x g;unfold dq;split_ifs with h .rw[iQ] at h;unfold rmsnormSpec rmsnormWith;rw[if_pos h];simp only[mG,Ε,ZH,gt_iff_lt] at h;exact YP b n d x g h.1.1.1.1.1.1.2 h.2 .rfl def YU (n:н) (eps:р) (x:ZB) (r:н):н×н×т×н×н×р:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let Q:=Yl x u lo (lo+n) 0 0 0 0 let pn:=Ym x u lo (lo+n) 0 0 let S:=Y0 pn.1 pn.2 let k:=Q2 (max pn.1 pn.2)-30 (u,k,decide (pn.1>>k,S&&&(VO 1 k-1),V5 (n*Q-S*S) (n*n) u eps) lemma Vn (n:н) (b:lI) (x:ZB) (r:н) (d:0jZW x[j]! =0\/t.1<= ZZ x[j]!):=by have e:=(Yi x (r*n+n) n (r*n) 255 XI).2;obtain ⟨h,i⟩:=VF n x r _ d e;refine ⟨?_,?_,e⟩ .rw[h,<-Yn];simp only[YU,Yz,κ,one_mul,ν, ζ,ZU] .simp only[YU];rw[YW _ _ _ _ (mK d d) g,i] def jC (n:н) (eps:р) (x:ZB) (r:н):н×н×т×н×н×р:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let st:=d4 x u lo (lo+n) 0 0 0 0 0 0 0 0 let S:=Y0 st.P st.N let k:=Q2 (max st.P st.N)-30 (u,k,decide (st.P>>k,S&&&(VO 1 k-1), let F:=λ(_:Unit)=>V5 (n*(st.big+st.lа+(st.hа+st.c<<<64)<<<64)-S*S) (n*n) u eps let nq:=bj nе st.l let nh:=nq.1+nе*st.h let ss:=bj Sе Sе if st.c=0/\st.big=0/\S<2^63/\st.h<1125899906842624/\n<1024/\(ss.1ZT ((ZA x[i]!-rowMean n x r)*ZA g[j]!/ZA t.2.2.2.2.2+ZA b[j]!) structure lr where t:н×н×т×н×н×р ok:т S:Д Dd:Д lD:Д lS:Д u:Д sS:т di:Д deriving Inhabited def Yw (rows n:н) (eps:р) (x g b:ZB):ZB:= let st:=Array.ofFn (n:=rows) λr=> let t:=jC n eps x rй let S:=(t.2.2.2.1<< let e:=st[r]! let j:=i-r*n if e.ok then Qy nе e.u e.S e.lS e.sS e.Dd e.lD e.di x[i]! g[j]! b[j]! λ_=>jE n x g b e.t r i else jE n x g b e.t r i) n rows 0 (Array.mkEmpty (rows*n)) lemma V3 (h n:н) (e:lI) (x g b:ZB) (o:0ZT _) o (A i (nS i n) (Nat.lt_div_mul_add o)) r rfl;split_ifs with q .simp[and_assoc] at q;obtain ⟨E,h1,v,h2⟩:=q;have j:∀m:н,m<2^64->mеа=m:=λ_=>Ϛ have l:l6 (nе*ZC d)=n*ZW d:=by have:=ϋ h1 (ZO d);rw[Ν,j n XI,ZI,ε XI] rw[γ,l] at h2;rw[Qj _ _ _ _ _ _ _ _ _ _ _ _ _ _ (by rwa[j n XI]) (by rw[l,j n XI]) (by rw[l];simpa using h2) (Y7 _) rfl v (by rw[j u XI];exact h3) (by rw[r,j _ XI,j u XI,j n XI,κ]) p] .exact p def cf (rows n:н) (eps:р) (x g b:ZB):ZB:= if SN rows n eps x g&&bг==n&&b.all finiteWord then Yw rows n eps x g b else layernormSpec rows n eps x g b lemma eo:cf=layernormSpec:=by funext d n e x g b;unfold cf;split_ifs with h .rw[iQ] at h;unfold layernormSpec layernormWith;rw[if_pos h];simp only[mG,Ε,ZH,gt_iff_lt] at h;exact V3 d n e x g b h.1.1.1.1.1.1.1.1.2 h.1.1.2 .rfl end Norm end def dP (s:ConvShape) (relu:т) (inp wts b:п р):п р:= if s.kh==1&&s.kw==1&&s.stride==1&&s.pad==0 then Dense.e7 Conv.eM s relu inp wts b else Conv.eM s relu inp wts b lemma gc:dP=mX:=by funext s d e g b;unfold dP;split .rw[Dense.g1 _ Conv.d5] .rw[Conv.d5] def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.eX,Dense.iA⟩ conv:=⟨dP,Conv.d6⟩ elem:=⟨Conv.f7,Conv.go,Bn.dO,Bn.ck⟩ norm:=⟨Norm.dq,Norm.cf⟩ theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm, Dense.gS,Dense.jn,gc,Conv.eP,Conv.iJ,Conv.il, Bn.f6,Bn.er,Norm.fF,Norm.eo] end Submission