import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Floats.ExecFloat.Binary local notation"А"=>USize.lt_iff_toNat_lt local notation"Б"=>FloatArray.emptyWithCapacity local notation"В"=>0x7FFFFFFF local notation"Г"=>mul_le_mul_of_nonneg_right local notation"Д"=>0xFFFFFFFF local notation"Е"=>Nat.and_two_pow_sub_one_eq_mod local notation"Ж"=>USize.ofNat local notation"З"=>Nat.zero_add local notation"И"=>UInt32.le_iff_toNat_le local notation"Й"=>Nat.mod_eq_of_lt local notation"К"=>Array.replicate local notation"Л"=>dite_eq_left local notation"М"=>rationalWord local notation"Н"=>Nat.mul_le_mul_right local notation"О"=>UInt64.lt_iff_toNat_lt local notation"П"=>UInt64.le_iff_toNat_le local notation"Р"=>dite_eq_right local notation"С"=>abs_sub_abs_le_abs_sub local notation"Т"=>UInt64.toNat_add local notation"У"=>UInt64.toNat_shiftRight local notation"Ф"=>zpow_le_zpow_right₀ local notation"Х"=>two_ne_zero local notation"Ц"=>mul_le_mul_of_nonneg_left local notation"Ч"=>UInt32.toNat_inj local notation"Ш"=>0x7F800000 local notation"Щ"=>ite_eq_right local notation"Ъ"=>Nat.cast_nonneg local notation"Ы"=>UInt32.lt_iff_toNat_lt local notation"Ь"=>mul_lt_mul_of_pos_right local notation"Э"=>List.range local notation"Ю"=>Nat.add_assoc local notation"Я"=>Model.roundDyadic local notation"а"=>toDyadic_ofUInt32 local notation"б"=>zpow_add₀ local notation"в"=>getElem!_pos local notation"г"=>if_neg local notation"д"=>Bool.and_eq_true_iff local notation"е"=>if_pos local notation"ж"=>Nat.mul_comm local notation"з"=>ite_eq_left local notation"и"=>abs_of_nonneg local notation"й"=>FloatLib.Numerics.Dyadic.cast_toRat local notation"к"=>UInt32.toNat_toUSize local notation"л"=>UInt64.toNat_sub local notation"м"=>USize.toNat_one local notation"н"=>Model.modelSign local notation"о"=>Nat.div_eq_of_lt local notation"п"=>Nat.mod_lt local notation"р"=>UInt32.toNat_and local notation"с"=>UInt64.toNat_and local notation"т"=>Finset.range local notation"у"=>Nat.div_lt_of_lt_mul local notation"ф"=>abs_nonneg local notation"х"=>Float.ofBits local notation"ц"=>Model.toReal local notation"ч"=>mul_nonneg local notation"ш"=>Nat.pos_of_ne_zero local notation"щ"=>zpow_pos local notation"ъ"=>Model.isFinite local notation"ы"=>Nat.add_zero local notation"ь"=>zpow_natCast local notation"э"=>UInt32.ofNat local notation"ю"=>UInt32.toNat_ofNat' local notation"я"=>List.mem_range local notation"ذ"=>Nat.shiftLeft_eq local notation"ر"=>mul_le_mul local notation"ز"=>Nat.succ_mul local notation"س"=>Nat.not_lt_zero local notation"ش"=>Finset.sum_congr local notation"ص"=>Nat.shiftRight_eq_div_pow local notation"ض"=>UInt32.le_trans local notation"ط"=>0x80000000 local notation"ظ"=>Model.modelSignBit local notation"ع"=>abs_le local notation"غ"=>Nat.le_mul_of_pos_right local notation"ػ"=>getElem!_neg local notation"ؼ"=>UInt32.toNat_sub_of_le local notation"ؽ"=>Float.Model.UnpackedFloat.unpack local notation"ؾ"=>Finset.mem_range local notation"ؿ"=>Model.roundAt local notation"ـ"=>List.range_eq_range' local notation"ف"=>Nat.add_mul local notation"ق"=>FloatLib.Numerics.binaryRadix local notation"ك"=>List.foldl_cons local notation"ل"=>Nat.mul_add_div local notation"م"=>Nat.mul_add_mod local notation"ن"=>abs_add_le local notation"ه"=>Model.toModel_ofFloatModel local notation"و"=>Nat.one_mul local notation"ى"=>zpow_sub₀ local notation"ي"=>List.nodup_range local notation"Ա"=>List.range'_succ local notation"Բ"=>FloatLib.Numerics.Dyadic.toRat_eq_zero_iff local notation"Գ"=>List.mem_of_getElem? local notation"Դ"=>Model.toReal_eq_unpackedToReal_toModel local notation"ה"=>(by decide) local notation"ו"=>(by positivity) local notation"ז"=>(by simp;omega) local notation"ח"=>(by rfl) local notation"ט"=>(by rw[А];omega) open FloatLib.Numerics.Dyadic (signedSignificand toRat_eq_zero_iff add_toRat mul_toRat mulFields) open UInt64 (toNat_sub_of_le) open Bool (false_eq_true and_eq_true or_eq_true) local notation"א"=>by omega local notation"ב"=>by norm_num local notation"ג"=>by simp local notation"ד"=>by linarith local notation"ѐ"=>Array UInt32 local notation"ё"=>Array Word local notation"ђ"=>FloatArray local notation"ѓ"=>UInt32 local notation"є"=>USize local notation"ѕ"=>Float local notation"і"=>UInt64 local notation"ї"=>Array Nat local notation"ј"=>Bool local notation"љ"=>List Nat local notation"њ"=>Word local notation"ћ"=>Nat open USize (toNat) open UInt32 (toNat) open UInt64 (toNat) local notation:max"Ѡ"x:max=>toNat x open Array (size) open FloatArray (size) local notation:max"ѡ"x:max=>size x open Nat (toUSize) open UInt32 (toUSize) local notation:max"Ѣ"x:max=>toUSize x local notation:max"ѣ"x:max=>List.length x section open FloatLib.Numerics end lemma Ba (n:ћ) (f:ћ->ѓ) (k:ћ) (hk:k< n):(Array.ofFn (n:=n) λi=>f i.val)[k]! = f k:=by rw[в _ k (by simpa using hk),Array.getElem_ofFn] lemma Lx (w:њ):toWord (ofW w)=w:=by apply Ч.mp;simp only[toWord,ofW,Model.toNatBits,ofUInt32_bits,UInt32.toNat_ofNat'];exact Й w.toBitVec.isLt lemma Lf (z:Model Fmt):ofW (toWord z)=z:=by have h:z.toNatBits<2^32:=Model.toNatBits_lt_two_pow z;simp only[ofW,toWord,Model.ofUInt32,UInt32.toNat_ofNat',Nat.mod_eq_of_lt h];exact Model.ofNatBits_toNatBits z @[inline] def keyOf (w:њ):Int:= if signOf w then -((mantOf w <<< idxOf w:ћ):Int) else ((mantOf w <<< idxOf w:ћ):Int) lemma Rz (w:њ):keyOf w=sv w*2^idxOf w:=by unfold keyOf sv;split<;>simp[Nat.shiftLeft_eq] lemma Bh (w:њ):(decodeD w).toReal=(keyOf w:ℝ)*2^(-149:Int):=by rw[<-й,decodeD_toRat,Rz];push_cast;rw[ى Х,ь];ring @[inline] def maxW (a b:њ):њ:= if expOf a=255∨expOf b=255 then toWord (Model.maximum (ofW a) (ofW b)) else match compare (keyOf a) (keyOf b) with | .lt=>b | .gt=>a | .eq=>toWord (if Model.isZero (ofW a) && Model.isZero (ofW b) then Model.zero Fmt (Model.signBit (ofW a) && Model.signBit (ofW b)) else ofW a) lemma So (a b:њ):Model.cmpDyadic (decodeD a) (decodeD b)=compare (keyOf a) (keyOf b):=by have hs:(0:ℝ)<2^(-149:Int):=щ two_pos _;cases h:compare (keyOf a) (keyOf b);. rw[Model.cmpDyadic_lt_iff,Bh,Bh];exact Ь (by exact_mod_cast compare_lt_iff_lt.mp h) hs . rw[Model.cmpDyadic_eq_iff,Bh,Bh,compare_eq_iff_eq.mp h] . rw[Model.cmpDyadic_gt_iff,Bh,Bh];exact Ь (by exact_mod_cast compare_gt_iff_gt.mp h) hs lemma Rv (a b:њ):ofW (maxW a b)=Model.maximum (ofW a) (ofW b):=by unfold maxW;split;. exact Lf _ . rename_i hs;have ha:=а a (λh=>hs (Or.inl h));have hb:=а b (λh=>hs (Or.inr h));have Tk:=Model.isNaN_eq_false_of_toDyadic?_some ha;have Tj:=Model.isNaN_eq_false_of_toDyadic?_some hb;have hc:Model.compare (ofW a) (ofW b)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ ha hb;rw[So] at hc;have Eh:Model.chooseNaN2 (ofW a) (ofW b)=none:=(Model.chooseNaN2_eq_none_iff _ _).2 ⟨Tk,Tj⟩;unfold Model.maximum;rw[Model.withNaNSelection_of_none _ _ Eh];dsimp only;rw[Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ hc];cases compare (keyOf a) (keyOf b)<;>simp only[Lf] def maxpoolW (c h w k:ћ) (inp:ё):ё:= Array.ofFn (n:=c*(h/k*(w/k))) λq=> let ch:=q.val/(h/k*(w/k)) let y:=q.val/(w/k)%(h/k) let x:=q.val%(w/k) (Э (k*k)).foldl (λacc t=>maxW acc (poolAt h w k inp ch y x t)) (poolAt h w k inp ch y x 0) lemma Si (p:ћ->њ) (l:љ) (acc:њ): l.foldl (λm t=>Model.maximum m (ofW (p t))) (ofW acc)=ofW (l.foldl (λa t=>maxW a (p t)) acc):=by induction l generalizing acc with | nil=>rfl | cons t l ih=>simp only[List.foldl_cons,<-Rv,ih] lemma Sq:maxpoolW=maxpoolSpec:=by funext c h w k inp;simp only[maxpoolW,maxpoolSpec,Si,Lx] lemma Bm {w:ѓ} (h:expOf w≠255):ъ (ofW w)=true:=by simp[ofW,isFinite_ofUInt32,h] lemma Jw (A B:ѐ) (hB:ѡB=ѡA) (Cr:∀ k,k< ѡA->expOf A[k]!≠255∧expOf B[k]!≠255):finishWord (dsum A B 0 ѡA) (-298) (ѡA≠0 && dallNZ A B 0 ѡA)=dotSpec A B:=by set L:=A.map (Model.ofUInt32 (fmt:=Fmt)) with hL;set R:=B.map (Model.ofUInt32 (fmt:=Fmt)) with hR;have Eu:ѡL=ѡR:=by simp[hL,hR,hB] have hS:ѡL=ѡA:=by simp[hL] have Hz:∀ k (hk:k< ѡL),ъ L[k]=true:=λk hk=>by simpa [hL,ofW] using Bm (getElem!_pos A k א ▸ (Cr k א).1) have Hq:∀ k (hk:k< ѡR),ъ R[k]=true:=λk hk=>by simpa [hR,ofW] using Bm (getElem!_pos B k א ▸ (Cr k א).2) have f k (_:0<=k) (h:k<0+ѡL):=Cr k א;have s:=(finiteDotSlice_eq A B 0 ѡL (by simp[hL]) (by simp[hL,hB]) f).trans (by rw[hS]);have x:=(Model.Reduction.Internal.dotState_exact_toRat (destination:=Fmt) L R Eu Hz Hq).trans s;unfold dotSpec Model.dot;by_cases h0:dsum A B 0 ѡA=0;. rw[Model.Reduction.dotWithStatus_eq_zero_of_finite Fmt L R .nearestEven Eu Hz Hq ((Բ _).1 (by simp[x,h0])),h0,finishWord_zero];obtain ⟨h1,h2⟩:=dotStateLoop_flags A B {} 0 ѡL (by simp[hL]) (by simp[hL,hB]) f;simp only[Except.map,Model.Reduction.Internal.dotState];rw[h1,h2];simp[hS] . rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero Fmt L R .nearestEven Eu Hz Hq (by rw[Model.Reduction.Semantics.finiteDot_toList_eq_slice L R Eu,s] simpa using h0)] exact finishWord_of_ne _ _ _ _ h0 x structure Acc where (pos neg:ї) (special negZero:ј) def Acc.total (acc:Acc):Int:=(limbVal acc.pos.toList:Int)-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.toUInt64 idx,sp,false⟩ else ⟨addLimbs64 pos m.toUInt64 idx,ng,sp,false⟩ lemma Acc.add_spec (acc:Acc) (m idx:ћ) (neg:ј) (hp:acc.pos.size=18) (hn:acc.neg.size=18) (hm:m<2^64) (hi:idx/32+1<18):(acc.add m idx neg).pos.size=18∧(acc.add m idx neg).neg.size=18 ∧ (acc.add m idx neg).special=acc.special ∧ (acc.add m idx neg).negZero=(acc.negZero && (decide (m=0) && neg)) ∧ (acc.add m idx neg).total=acc.total+(if neg then -(m:Int) else m)*2^idx:=by obtain ⟨pos,ng,sp,nz⟩:=acc;simp only at hp hn;by_cases Cy:m=0;. simp[Acc.add,Acc.total,Cy,hp,hn] . cases neg;. refine ⟨by simp[Acc.add,Cy,addLimbs64_size,hp],by simp[Acc.add,Cy,hn],by simp[Acc.add,Cy],by simp[Acc.add,Cy],?_⟩;simp only[Acc.add,Cy,ite_false,false_eq_true,addLimbs64_eq _ _ _ hm,Acc.total];rw[addLimbs_val _ _ _ א];push_cast;ring . refine ⟨by simp[Acc.add,Cy,hp],by simp[Acc.add,Cy,addLimbs64_size,hn],by simp[Acc.add,Cy],by simp[Acc.add,Cy],?_⟩;simp only[Acc.add,Cy,ite_false,ite_true,addLimbs64_eq _ _ _ hm,Acc.total];rw[addLimbs_val _ _ _ א];push_cast;ring @[inline] def dotStep (acc:Acc) (wa wb:ѓ):Acc:= if expOf wa=255∨expOf wb=255 then ⟨acc.pos,acc.neg,true,acc.negZero⟩ else acc.add (mantOf wa*mantOf wb) (idxOf wa+idxOf wb) (Bool.xor (signOf wa) (signOf wb)) @[specialize] def dotLoop (fa fb:ћ->ѓ) (pos neg:ї) (sp nz:ј) (index:ћ):ћ->Acc | 0=>⟨pos,neg,sp,nz⟩ | count+1=> match dotStep ⟨pos,neg,sp,nz⟩ (fa index) (fb index) with | ⟨p,n,s,z⟩=>dotLoop fa fb p n s z (index+1) count lemma Sx (fa fb:ћ->ѓ) (pos neg:ї) (nz:ј) (index count:ћ):(dotLoop fa fb pos neg true nz index count).special=true:=by induction count generalizing pos neg nz index with | zero=>rfl | succ count ih=> rw[dotLoop];have hs:(dotStep ⟨pos,neg,true,nz⟩ (fa index) (fb index)).special=true:=by unfold dotStep Acc.add;split_ifs<;>rfl generalize dotStep ⟨pos,neg,true,nz⟩ (fa index) (fb index)=r at hs ⊢;obtain ⟨p,q,s,z⟩:=r;simp only at hs;subst hs;exact ih .. lemma Ss (fa fb:ћ->ѓ) (A B:ѐ) (n:ћ) (hA:∀ k,k< n->A[k]! = fa k) (hB:∀ k,k< n->B[k]! = fb k) (acc:Acc) (index remaining:ћ) (h:index+remaining<=n) (hp:acc.pos.size=18) (hn:acc.neg.size=18) (Bz:(dotLoop fa fb acc.pos acc.neg acc.special acc.negZero index remaining).special =false): (dotLoop fa fb acc.pos acc.neg acc.special acc.negZero index remaining).pos.size=18 ∧ (dotLoop fa fb acc.pos acc.neg acc.special acc.negZero index remaining).neg.size=18 ∧ acc.special=false ∧ (∀ k,index<=k->k< index+remaining->expOf A[k]!≠255∧expOf B[k]!≠255) ∧ (dotLoop fa fb acc.pos acc.neg acc.special acc.negZero index remaining).total=acc.total+dsum A B index remaining ∧ (dotLoop fa fb acc.pos acc.neg acc.special acc.negZero index remaining).negZero=(acc.negZero && dallNZ A B index remaining):=by induction remaining generalizing acc index with | zero=>obtain ⟨p,n,s,z⟩:=acc;simp_all [dotLoop,dsum,dallNZ] | succ count ih=> obtain ⟨p,q,s,z⟩:=acc simp only at hp hn have ha:=hA index א have hb:=hB index א by_cases he:expOf (fa index)=255∨expOf (fb index)=255 . exfalso;rw[dotLoop] at Bz;have hs:(dotStep ⟨p,q,s,z⟩ (fa index) (fb index)).special=true:=by simp[dotStep,he] generalize dotStep ⟨p,q,s,z⟩ (fa index) (fb index)=r at hs Bz;obtain ⟨p',q',s',z'⟩:=r;simp only at hs;subst hs;rw[Sx] at Bz;exact Bool.noConfusion Bz . have he':=not_or.mp he obtain ⟨h1,h2,h3,h4,h5⟩:= Acc.add_spec ⟨p,q,s,z⟩ (mantOf (fa index)*mantOf (fb index)) (idxOf (fa index)+idxOf (fb index)) (Bool.xor (signOf (fa index)) (signOf (fb index))) hp hn (mul_mant_lt _ _) (by have:=idxOf_le _ he'.1;have:=idxOf_le _ he'.2;omega) have Eg:dotStep ⟨p,q,s,z⟩ (fa index) (fb index)= Acc.add ⟨p,q,s,z⟩ (mantOf (fa index)*mantOf (fb index)) (idxOf (fa index)+idxOf (fb index)) (Bool.xor (signOf (fa index)) (signOf (fb index))):=by simp[dotStep,he] rw[dotLoop,Eg] at Bz ⊢;obtain ⟨hP,hN,hs,Cr,hD,hz⟩:=ih _ (index+1) א h1 h2 Bz;refine ⟨hP,hN,by rw[<-h3,hs],?_,?_,?_⟩ . intro k k1 k2;rcases Nat.lt_or_ge k (index+1) with hk | hk;. have:k=index:=א;subst this;rw[ha,hb];exact he' . exact Cr k hk א . have sv2:(if Bool.xor (signOf (fa index)) (signOf (fb index)) then -((mantOf (fa index)*mantOf (fb index):ћ):Int) else ((mantOf (fa index)*mantOf (fb index):ћ):Int))=sv (fa index)*sv (fb index):=by unfold sv;cases signOf (fa index)<;>cases signOf (fb index)<;>simp rw[hD,h5,dsum,ha,hb,sv2];ring . rw[hz,h4,dallNZ,ha,hb];simp[Bool.and_assoc] def Y_low (p q:ї) (k:ћ):ћ->ћ | 0=>k | f+1=>if p[k]! = 0 && q[k]! = 0 then Y_low p q (k+1) f else k lemma Sd (p q:ї):∀ f k,(∀ j,j< k->p[j]! = 0∧q[j]! = 0) → ∀ j,j< Y_low p q k f->p[j]! = 0∧q[j]! = 0:=by intro f;induction f with | zero=>exact λk h j hj=>h j hj | succ f ih=> intro k h j hj;unfold Y_low at hj;split at hj . rename_i hk;simp only[and_eq_true,decide_eq_true_eq] at hk;refine ih (k+1) (λi hi=>?_) j hj;rcases Nat.lt_or_ge i k with h1 | h1;. exact h i h1 . have:i=k:=א;subst this;exact hk . exact h j hj lemma Pr (L:љ):∀ l,(∀ j,j< l->L[j]! = 0) → limbVal L=2^(32*l)*limbVal (L.drop l):=by induction L with | nil=>simp[limbVal] | cons x xs ih=> intro l h;cases l with | zero=>simp | succ l=> have h0:x=0:=by simpa using h 0 א have:=ih l (λj hj=>by simpa using h (j+1) א);simp only[limbVal,List.drop_succ_cons,h0,this];rw[Nat.mul_add 32 l 1,pow_add];ring lemma Jl (A:ї) (l:ћ) (h:∀ j,j< l->A[j]! = 0):limbVal A.toList=2^(32*l)*limbValA (A.extract l ѡA):=by rw[limbValA_eq,Array.toList_extract,List.extract_eq_drop_take,<-Array.length_toList];rw[List.take_of_length_le ג];refine Pr _ l λj hj=>?_;have:=h j hj;rw[getElem!_def] at this;simp only[Array.getElem!_toList,getElem!_def] at *;cases e:A[j]?<;>simp_all lemma Oe (S:Int) (l:ћ) (e:Int) (z:ј):finishWord S (e+32*l) z=finishWord (2^(32*l)*S) e z:=by by_cases hS:S=0;. simp[hS,finishWord] have h2:(2:Int)^(32*l)*S≠0:=mul_ne_zero ו hS rw[finishWord_of_ne (ofIntDyadic (2^(32*l)*S) e) S (e+32*l) z hS (by rw[toRat_ofIntDyadic,б ב,show (32:ℤ)*l=((32*l:ℕ):ℤ) by push_cast;ring,ь];push_cast;ring)] simp[finishWord,h2] @[inline] def dotFn (n:ћ) (fa fb:ћ->ѓ):ѓ:= let acc:=dotLoop fa fb (К 18 0) (К 18 0) false true 0 n if acc.special then dotSpec (Array.ofFn (n:=n) λi=>fa i) (Array.ofFn (n:=n) λi=>fb i) else let l:=Y_low acc.pos acc.neg 0 18 finishWord ((limbValA (acc.pos.extract l 18):Int)-limbValA (acc.neg.extract l 18)) (-298+32*l) (n≠0 && acc.negZero) lemma Bt:dotFn=dotOf:=by funext n fa fb;unfold dotFn dotOf;set A:=Array.ofFn (n:=n) λi=>fa i with hA;set B:=Array.ofFn (n:=n) λi=>fb i with hB;set acc:=dotLoop fa fb (К 18 0) (К 18 0) false true 0 n with hacc;by_cases De:acc.special=true;. simp[De] have hsp':acc.special=false:=by simpa using De have hF:=Ss fa fb A B n (Ba n fa) (Ba n fb) ⟨К 18 0,К 18 0,false,true⟩ 0 n א ג ג hsp';obtain ⟨hP,hN,-,Cr,hD,hz⟩:=hF;have hAs:ѡA=n:=by simp[hA] have hBs:ѡB=n:=by simp[hB] have hL:=Sd acc.pos acc.neg 18 0 (λj hj=>absurd hj (س _));simp only[hsp',false_eq_true,ite_false];have e0:(⟨К 18 0,К 18 0,false,true⟩:Acc).total=0:=by decide rw[e0,Int.zero_add] at hD;rw[Bool.true_and] at hz;generalize Y_low acc.pos acc.neg 0 18=l at hL ⊢;have h1:=Jl acc.pos l (λj hj=>(hL j hj).1);have h2:=Jl acc.neg l (λj hj=>(hL j hj).2);rw[hP] at h1;rw[hN] at h2;rw[Oe,<-Jw A B א (λk hk=>Cr k א א),hAs,<-hD,<-hz];congr 1;have:acc.total=(limbVal acc.pos.toList:Int)-limbVal acc.neg.toList:=rfl;rw[this,h1,h2];push_cast;ring lemma Bg (t n:є) (h:t< n):(t+1).toNat=Ѡt+1:=by have h1:Ѡt< Ѡn:=А.mp h;have h2:Ѡn< USize.size:=n.toNat_lt_size;have h3:USize.size=2^System.Platform.numBits:=rfl;rw[USize.toNat_add,м];exact Й א lemma Bu (a b:є) (h:Ѡa+Ѡb<2^32):(a+b).toNat=Ѡa+Ѡb:=by have h1:2^32<=USize.size:=USize.le_size;have h3:USize.size=2^System.Platform.numBits:=rfl;rw[USize.toNat_add];exact Й א lemma uk (k:ћ) (h:k<2^32):(Ж k).toNat=k:=by have h1:2^32<=USize.size:=USize.le_size;have h3:USize.size=2^System.Platform.numBits:=rfl;rw[USize.toNat_ofNat'];exact Й א lemma Sm (a:ђ) (i:є) (h:i< a.usize):Ѡi< ѡa:=by have h1:=А.mp h;have h2:a.usize.toNat<=ѡa:=by simp only[FloatArray.usize,Nat.toUSize_eq,USize.toNat_ofNat'];exact Nat.mod_le _ _ omega lemma Bw (a:ѐ) (i:є) (h:i< a.usize):Ѡi< ѡa:=by have h1:=А.mp h;have h2:a.usize.toNat<=ѡa:=by simp only[Array.usize,Nat.toUSize_eq,USize.toNat_ofNat'];exact Nat.mod_le _ _ omega @[inline] def rdW (a:ѐ) (i:є):ѓ:= if h:i< a.usize then a.uget i (Bw a i h) else 0 @[inline] def wrF (a:ђ) (i:є) (v:ѕ):ђ:= if h:i< a.usize then a.uset i v (Sm a i h) else a @[inline] def wrW (a:ѐ) (i:є) (v:ѓ):ѐ:= if h:i< a.usize then a.uset i v (Bw a i h) else a def pwEntry (i:ћ):ѕ:= let e:=(i%256).toUInt64 let s:і:=if i ≥ 256 then 0x8000000000000000 else 0 if e== 0 then х s else х (s ||| ((e+873) <<< (52:і))) def pw:ђ:= (Э 512).foldl (λa i=>a.push (pwEntry i)) (Б 512) lemma Jy:pw.data=(Э 512).toArray.map pwEntry:=by have key:∀ (l:љ) (a:ђ),(l.foldl (λa i=>a.push (pwEntry i)) a).data=a.data ++ (l.toArray.map pwEntry):=by intro l;induction l with | nil=>intro a;simp | cons x l ih=> intro a;simp only[List.foldl_cons,ih];simp[FloatArray.push] simp only[pw,key];simp[FloatArray.emptyWithCapacity] lemma Qq:ѡpw=512:=by simp[FloatArray.size,Jy] lemma Eo (w:ѓ):(w >>> (23:ѓ)).toUSize.toNat< ѡpw:=by rw[Qq];have h:=w.toNat_lt_size;simp only[UInt32.toNat_toUSize,UInt32.toNat_shiftRight];norm_num [Nat.shiftRight_eq_div_pow] at h ⊢;omega def pwEntryN (i:ћ):ѕ:= if i%256== 0 || i%256== 255 then х 0x7FF8000000000000 else pwEntry i def pwN:ђ:= (Э 512).foldl (λa i=>a.push (pwEntryN i)) (Б 512) lemma Kl:pwN.data=(Э 512).toArray.map pwEntryN:=by have key:∀ (l:љ) (a:ђ),(l.foldl (λa i=>a.push (pwEntryN i)) a).data=a.data ++ (l.toArray.map pwEntryN):=by intro l;induction l with | nil=>intro a;simp | cons x l ih=> intro a;simp only[List.foldl_cons,ih];simp[FloatArray.push] simp only[pwN,key];simp[FloatArray.emptyWithCapacity] lemma Ga (w:ѓ):(w >>> (23:ѓ)).toUSize.toNat< ѡpwN:=by have e:ѡpwN=512:=by simp[FloatArray.size,Kl] rw[e];have h:=w.toNat_lt_size;simp only[UInt32.toNat_toUSize,UInt32.toNat_shiftRight];norm_num [Nat.shiftRight_eq_div_pow] at h ⊢;omega @[inline] def dvN (w:ѓ):ѕ:= ((w &&& 0x7FFFFF) ||| 0x800000).toFloat*pwN.uget (w >>> (23:ѓ)).toUSize (Ga w) @[inline] def dv (w:ѓ):ѕ:= ((w &&& 0x7FFFFF) ||| 0x800000).toFloat*pw.uget (w >>> (23:ѓ)).toUSize (Eo w) @[inline] def dvB (v:ѕ) (w:ѓ):ѕ:= (v*pw.uget (w >>> (23:ѓ)).toUSize (Eo w))*((w &&& 0x7FFFFF) ||| 0x800000).toFloat @[inline] def good (w:ѓ):ј:= let v:=w &&& В v== 0 || v-(0x00800000:ѓ)<=(0x7EFFFFFF:ѓ) def scan (A:ѐ) (n i:є) (hn:Ѡn<=ѡA) (lo hi:ѓ):ѓ:= if h:i< n then have ht:=А.mp h let v:=A.uget i א &&& В let u:=v-1 scan A n (i+1) hn (if u< lo then u else lo) (if hi< v then v else hi) else if 0x007FFFFF<=lo∧hi<Ш then hi else Д termination_by Ѡn-Ѡi decreasing_by rw[Bg i n h];omega def scanF (A:ѐ) (n i:є) (hn:Ѡn<=ѡA) (o s:ѓ):ѓ:= if h:i< n then have ht:=А.mp h let v:=A.uget i א &&& В scanF A n (i+1) hn (o ||| v) (s &&& (v-1)) else if 0x7FFFFF<=s∧o<Ш then o else Д termination_by Ѡn-Ѡi decreasing_by rw[Bg i n h];omega lemma Cc (a:ѐ):a.usize.toNat<=ѡa:=by simp only[Array.usize,Nat.toUSize_eq,USize.toNat_ofNat'];exact Nat.mod_le _ _ @[inline] def scanH (A:ѐ):ѓ:= let h:=scanF A A.usize 0 (Cc A) 0 Д if h== Д then scan A A.usize 0 (Cc A) Д 0 else h def pushZ (n k:є) (a:ђ):ђ:= if h:k< n then pushZ n (k+1) (a.push 0) else a termination_by Ѡn-Ѡk decreasing_by rw[Bg k n h];have:=А.mp h;omega @[inline] def zivW (A B:і):ѓ:= let x:і:=(A+(0x0FFFFFFF:і)) >>> (29:і) let y:і:=(B+(0x0FFFFFFF:і)) >>> (29:і) let ex:і:=(x >>> (23:і)) &&& (0x7FF:і) if x== y && ex-(897:і)<(254:і) then (((x >>> (34:і)) <<< (31:і)) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< (23:і)))).toUInt32 else Д @[inline] def zivS (s:ѕ):ѓ:= let a:=s.toBits zivW (a+2) (a-2) @[inline] def ziv (s e:ѕ):ѓ:= zivW (s+e).toBits (s-e).toBits @[inline] def zivT (th:і) (s:ѕ):ѓ:= let a:=s.toBits if th<=a <<< (1:і) then zivW (a+0x100000) (a-0x100000) else Д def thOf (e:ѕ):і:= let E:=(e.toBits >>> (52:і)) &&& 0x7FF if E-1<1900 then (E+37) <<< (53:і) else 0xFFFFFFFFFFFFFFFF @[inline] def zivC (x:і):ѓ:= (((x >>> (34:і)) <<< (31:і)) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< (23:і)))).toUInt32 def loOf (e:ѕ):і:= let th:=thOf e if th<0x7040000000000000 then 0x7040000000000000 else th def spOf (lo:і):і:= if lo<0x8FA0000000000000 then 0x8FA0000000000000-lo else 0 def spR (relu:ј) (lo:і):і:=if relu then 0 else spOf lo @[noinline] def slowOut (inW:ћ) (relu:ј) (X W b:ё) (i j:ћ):њ:= act relu (dotFn (inW+1) (λt=>if t< inW then X[i*inW+t]! else oneW) (λt=>if t< inW then W[j*inW+t]! else b[j]!)) @[inline] def fin (inW:ћ) (relu:ј) (X W b:ё) (i j:ћ) (s nf t:ѕ) (bw:ѓ):ѓ:= let bv:=dv bw let r:=ziv (s+bv) (nf*(t+bv.abs)) if r== Д then slowOut inW relu X W b i j else act relu r structure F1 where (s t:ѕ) def tightGo (X W:ѐ) (xo wo n t:є) (s a:ѕ):F1:= if h:t< n then let q:=dv (rdW X (xo+t))*dv (rdW W (wo+t)) tightGo X W xo wo n (t+1) (s+q) (a+q.abs) else ⟨s,a⟩ termination_by Ѡn-Ѡt decreasing_by rw[Bg t n h];have:=А.mp h;omega @[inline] def fin8 (inW:ћ) (relu:ј) (X W b:ё) (i j:ћ) (s nf a:ѕ) (hx bw:ѓ) (n:є):ѓ:= let bv:=dv bw let r:=ziv (s+bv) (nf*(dv hx*a+bv.abs)) if r== Д then let q:=tightGo X W (i*inW).toUSize (j*inW).toUSize n 0 0 0 fin inW relu X W b i j q.s nf q.t bw else act relu r structure R1 where (ix:ѐ) (buf:ђ) (c:є) (l:ѕ) def decR (X:ѐ) (o n t:є) (ix:ѐ) (buf:ђ) (c:є) (l:ѕ):R1:= if h:t< n then let w:=rdW X (o+t) if w &&& В== 0 then decR X o n (t+1) ix buf c l else let v:=dv w decR X o n (t+1) (wrW ix c t.toUInt32) (wrF buf c v) (c+1) (l+v.abs) else ⟨ix,buf,c,l⟩ termination_by Ѡn-Ѡt decreasing_by all_goals (rw[Bg t n h];have:=А.mp h;omega) lemma wi (w i m:є) (W:ѐ) (hw:Ѡw+Ѡm<=ѡW) (hs:ѡW<2^32) (hi:Ѡi< Ѡm):(w+i).toNat< ѡW:=by rw[Bu _ _ א];omega structure F4 where (a b c d:ѕ) def go4B (x:ђ) (ix W:ѐ) (w0 w1 w2 w3 m n t:є) (hx:Ѡn<=ѡx) (hi:Ѡn<=ѡix) (hs:ѡW<2^32) (h0:Ѡw0+Ѡm<=ѡW) (h1:Ѡw1+Ѡm<=ѡW) (h2:Ѡw2+Ѡm<=ѡW) (h3:Ѡw3+Ѡm<=ѡW) (a b c d:ѕ):F4:= if h:t< n then have ht:=А.mp h let v:=x.uget t א let i:=(ix.uget t א).toUSize if hm:i< m then have Db:=А.mp hm let q0:=v*dv (W.uget (w0+i) (wi w0 i m W h0 hs Db)) let q1:=dvB v (W.uget (w1+i) (wi w1 i m W h1 hs Db)) let q2:=v*dv (W.uget (w2+i) (wi w2 i m W h2 hs Db)) let q3:=dvB v (W.uget (w3+i) (wi w3 i m W h3 hs Db)) go4B x ix W w0 w1 w2 w3 m n (t+1) hx hi hs h0 h1 h2 h3 (a+q0) (b+q1) (c+q2) (d+q3) else go4B x ix W w0 w1 w2 w3 m n (t+1) hx hi hs h0 h1 h2 h3 a b c d else ⟨a,b,c,d⟩ termination_by Ѡn-Ѡt decreasing_by all_goals (rw[Bg t n h];omega) def go1 (x:ђ) (ix W:ѐ) (w0 m n t:є) (hx:Ѡn<=ѡx) (hi:Ѡn<=ѡix) (hs:ѡW<2^32) (h0:Ѡw0+Ѡm<=ѡW) (a:ѕ):ѕ:= if h:t< n then have ht:=А.mp h let i:=(ix.uget t א).toUSize if hm:i< m then have Db:=А.mp hm let q:=x.uget t א*dv (W.uget (w0+i) (wi w0 i m W h0 hs Db)) go1 x ix W w0 m n (t+1) hx hi hs h0 (a+q) else go1 x ix W w0 m n (t+1) hx hi hs h0 a else a termination_by Ѡn-Ѡt decreasing_by all_goals (rw[Bg t n h];omega) def go4D (x wd:ђ) (ix W:ѐ) (w0 w1 w2 w3 m n t:є) (hx:Ѡn<=ѡx) (hi:Ѡn<=ѡix) (hs:ѡW<2^32) (h0:Ѡw0+Ѡm<=ѡW) (h1:Ѡw1+Ѡm<=ѡW) (h2:Ѡw2+Ѡm<=ѡW) (h3:Ѡw3+Ѡm<=ѡW) (hd:ѡwd=ѡW) (a b c d:ѕ):F4:= if h:t< n then have ht:=А.mp h let v:=x.uget t א let i:=(ix.uget t א).toUSize if hm:i< m then have Db:=А.mp hm go4D x wd ix W w0 w1 w2 w3 m n (t+1) hx hi hs h0 h1 h2 h3 hd (a+v*wd.uget (w0+i) (hd ▸ wi w0 i m W h0 hs Db)) (b+v*wd.uget (w1+i) (hd ▸ wi w1 i m W h1 hs Db)) (c+v*wd.uget (w2+i) (hd ▸ wi w2 i m W h2 hs Db)) (d+v*wd.uget (w3+i) (hd ▸ wi w3 i m W h3 hs Db)) else go4D x wd ix W w0 w1 w2 w3 m n (t+1) hx hi hs h0 h1 h2 h3 hd a b c d else ⟨a,b,c,d⟩ termination_by Ѡn-Ѡt decreasing_by all_goals (rw[Bg t n h];omega) lemma Cz {n:ћ} (h:n<=4294967295):n<2^32:=א def cols1 (inW outW:ћ) (relu:ј) (X W b:ѐ) (i:ћ) (ix:ѐ) (x wd:ђ) (nf a:ѕ) (hx:ѓ) (m n:є) (j:ћ) (base:є) (out:ѐ):ѐ:= if h4:j+4<=outW then let ju:=Ѣj let w0:=ju*m let w1:=(ju+1)*m let w2:=(ju+2)*m let w3:=(ju+3)*m if hg:Ѡn<=ѡx∧Ѡn<=ѡix∧ѡW<=4294967295∧Ѡw0+Ѡm<=ѡW ∧ Ѡw1+Ѡm<=ѡW∧Ѡw2+Ѡm<=ѡW∧Ѡw3+Ѡm<=ѡW then let r:=if hd:ѡwd=ѡW then go4D x wd ix W w0 w1 w2 w3 m n 0 hg.1 hg.2.1 (Cz hg.2.2.1) hg.2.2.2.1 hg.2.2.2.2.1 hg.2.2.2.2.2.1 hg.2.2.2.2.2.2 hd 0 0 0 0 else go4B x ix W w0 w1 w2 w3 m n 0 hg.1 hg.2.1 (Cz hg.2.2.1) hg.2.2.2.1 hg.2.2.2.2.1 hg.2.2.2.2.2.1 hg.2.2.2.2.2.2 0 0 0 0 let o0:=fin8 inW relu X W b i j r.a nf a hx (rdW b ju) m let o1:=fin8 inW relu X W b i (j+1) r.b nf a hx (rdW b (ju+1)) m let o2:=fin8 inW relu X W b i (j+2) r.c nf a hx (rdW b (ju+2)) m let o3:=fin8 inW relu X W b i (j+3) r.d nf a hx (rdW b (ju+3)) m let out:=wrW out (base+ju) o0 let out:=wrW out (base+ju+1) o1 let out:=wrW out (base+ju+2) o2 let out:=wrW out (base+ju+3) o3 cols1 inW outW relu X W b i ix x wd nf a hx m n (j+4) base out else out else if h1:j< outW then let ju:=Ѣj let w0:=ju*m if hg:Ѡn<=ѡx∧Ѡn<=ѡix∧ѡW<=4294967295∧Ѡw0+Ѡm<=ѡW then let r:=go1 x ix W w0 m n 0 hg.1 hg.2.1 (Cz hg.2.2.1) hg.2.2.2 0 let o:=fin8 inW relu X W b i j r nf a hx (rdW b ju) m cols1 inW outW relu X W b i ix x wd nf a hx m n (j+1) base (wrW out (base+ju) o) else out else out termination_by outW-j def rows1 (rows inW outW:ћ) (relu:ј) (X W b:ѐ) (wd:ђ) (nf:ѕ) (hv:ѓ) (m:є) (i:ћ) (ix:ѐ) (buf:ђ) (out:ѐ):ѐ:= if h:i< rows then let r:=decR X (i*inW).toUSize m 0 ix buf 0 0 let out:=cols1 inW outW relu X W b i r.ix r.buf wd nf r.l hv m r.c 0 (i*outW).toUSize out rows1 rows inW outW relu X W b wd nf hv m (i+1) r.ix r.buf out else out termination_by rows-i structure F8 where (u:UInt8) (s0 s1 s2 s3 s4 s5 s6 s7:ѕ) @[inline] def f8 (r:F8):ћ->ѕ | 0=>r.s0 | 1=>r.s1 | 2=>r.s2 | 3=>r.s3 | 4=>r.s4 | 5=>r.s5 | 6=>r.s6 | _=>r.s7 lemma Cd (a b:є) (h:Ѡa*Ѡb<2^32):(a*b).toNat=Ѡa*Ѡb:=by have h1:2^32<=USize.size:=USize.le_size;have h3:USize.size=2^System.Platform.numBits:=rfl;rw[USize.toNat_mul];exact Й א lemma xi (xs:ђ) (t n:є) (k:ћ) (hk:k<8) (ht:Ѡt< Ѡn) (hx:8*Ѡn<=ѡxs) (hs:ѡxs<2^32):(Ж 8*t+Ж k).toNat< ѡxs:=by have e2:=uk 8 ב;have e3:=uk k (א:k<2^32);have e:=Cd (Ж 8) t (by rw[e2];omega);rw[Bu _ _ (by rw[e,e2,e3];omega),e,e2,e3];omega def go8 (xs:ђ) (W:ѐ) (wo n t:є) (hx:8*Ѡn<=ѡxs) (Cw:ѡxs<2^32) (hs:ѡW<2^32) (hw:Ѡwo+Ѡn<=ѡW) (s0 s1 s2 s3 s4 s5 s6 s7:ѕ) (r:F8):F8:= if h:t< n then have ht:=А.mp h let v:=dv (W.uget (wo+t) (wi wo t n W hw hs ht)) go8 xs W wo n (t+1) hx Cw hs hw (s0+xs.uget (Ж 8*t+Ж 0) (xi xs t n 0 א ht hx Cw)*v) (s1+xs.uget (Ж 8*t+Ж 1) (xi xs t n 1 א ht hx Cw)*v) (s2+xs.uget (Ж 8*t+Ж 2) (xi xs t n 2 א ht hx Cw)*v) (s3+xs.uget (Ж 8*t+Ж 3) (xi xs t n 3 א ht hx Cw)*v) (s4+xs.uget (Ж 8*t+Ж 4) (xi xs t n 4 א ht hx Cw)*v) (s5+xs.uget (Ж 8*t+Ж 5) (xi xs t n 5 א ht hx Cw)*v) (s6+xs.uget (Ж 8*t+Ж 6) (xi xs t n 6 א ht hx Cw)*v) (s7+xs.uget (Ж 8*t+Ж 7) (xi xs t n 7 א ht hx Cw)*v) r else match r with | ⟨u,_,_,_,_,_,_,_,_⟩=>⟨u,s0,s1,s2,s3,s4,s5,s6,s7⟩ termination_by Ѡn-Ѡt decreasing_by rw[Bg t n h];omega def lnSum (x:ё) (base n i:є) (s t:ѕ):F1:= if h:i< n then let v:=dv (rdW x (base+i)) lnSum x base n (i+1) (s+v) (t+v.abs) else ⟨s,t⟩ termination_by Ѡn-Ѡi decreasing_by rw[Bg i n h];have:=А.mp h;omega def mkL (X:ѐ) (n:є):F8:= ⟨0,(lnSum X (0*n) n 0 0 0).t,(lnSum X (1*n) n 0 0 0).t,(lnSum X (2*n) n 0 0 0).t,(lnSum X (3*n) n 0 0 0).t, (lnSum X (4*n) n 0 0 0).t,(lnSum X (5*n) n 0 0 0).t,(lnSum X (6*n) n 0 0 0).t,(lnSum X (7*n) n 0 0 0).t⟩ def out8 (inW outW:ћ) (relu:ј) (X W b:ѐ) (nf:ѕ) (hv:ѓ) (l r:F8) (j:ћ) (bw:ѓ) (n:є) (k:ћ) (out:ѐ):ѐ:= if k<8 then out8 inW outW relu X W b nf hv l r j bw n (k+1) (wrW out (k*outW+j).toUSize (fin8 inW relu X W b k j (f8 r k) nf (f8 l k) hv bw n)) else out termination_by 8-k def cols8 (inW outW:ћ) (relu:ј) (X W b:ѐ) (xs:ђ) (l:F8) (nf:ѕ) (hv:ѓ) (n:є) (j:ћ) (r0:F8) (out:ѐ):ѐ:= if hj:j< outW then let ju:=Ѣj let wo:=ju*n if hg:8*Ѡn<=ѡxs∧ѡxs<=4294967295∧ѡW<=4294967295∧Ѡwo+Ѡn<=ѡW then let r:=go8 xs W wo n 0 hg.1 (Cz hg.2.1) (Cz hg.2.2.1) hg.2.2.2 0 0 0 0 0 0 0 0 r0 cols8 inW outW relu X W b xs l nf hv n (j+1) r (out8 inW outW relu X W b nf hv l r j (rdW b ju) n 0 out) else out else out termination_by outW-j def wdQ (X:ѐ) (n e q:є) (a:ђ):ђ:= if h:q< e then wdQ X n e (q+1) (a.push (dv (rdW X (q%Ж 8*n+q/Ж 8)))) else a termination_by Ѡe-Ѡq decreasing_by rw[Bg q e h];have:=А.mp h;omega def linF (rows inW outW:ћ) (relu:ј) (X W b:ѐ):ѐ:= let hw:=scanH W if rows*inW=ѡX∧outW*inW=ѡW∧outW=ѡb∧0< inW∧0< outW∧inW<2^20 ∧ ѡX<=4294967295∧ѡW<=4294967295∧ѡb<=4294967295∧rows*outW<=4294967295 ∧ scanH X≠Д∧hw≠Д∧scanH b≠Д then let n:=ѢinW let nf:ѕ:=(inW.toUInt64+8).toFloat*х 0x3CA0000000000000 let out:ѐ:=К (rows*outW) 0 if 8<=rows∧rows<11 then rows1 rows inW outW relu X W b (Б 0) nf hw n 8 (К inW 0) (pushZ n 0 (Б inW)) (cols8 inW outW relu X W b (wdQ X n (Ж 8*n) 0 (Б (8*inW))) (mkL X n) nf hw n 0 ⟨0,0,0,0,0,0,0,0,0⟩ out) else let wd:=if 8< rows then W.foldl (λa w=>a.push (dv w)) (Б ѡW) else Б 0 rows1 rows inW outW relu X W b wd nf hw n 0 (К inW 0) (pushZ n 0 (Б inW)) out else linearWith dotFn rows inW outW relu X W b section local notation:max x:max "ᶠ"=>Float.isFinite x=true local notation "⟡"=>FloatFormat.binary64 local notation "⟠"=>Float.Model.Format.binary64 noncomputable def R (f:ѕ):ℝ:=ц (toModel (ofFloat f)) noncomputable def wv (w:ѓ):ℝ:=ц (ofW w) noncomputable def exactS (n:ћ) (xw ww:ћ->ѓ) (bw:ѓ):ℝ:= (т n).sum (λt=>wv (xw t)*wv (ww t))+wv bw def nfOf (n:ћ):ѕ:=(n.toUInt64+8).toFloat*х 0x3CA0000000000000 lemma Ce:⟡.isIEEE=true:=by decide lemma Ls (a:Model ⟡):ъ a=(Model.toModel a).isFinite:=by rw[<-Model.toDyadic?_isSome_eq_isFinite,Model.toDyadic?_ieee_eq_model _ Ce];cases Model.toModel a<;>rfl abbrev A_M (x:ѕ):Model ⟡:=Model.ofFloatModel x.toModel lemma Em (x:ѕ):R x=ц (A_M x):=rfl lemma Cg (x:ѕ):ъ (A_M x)=x.isFinite:=by rw[Ls,ه];rfl lemma Ch {x:ѕ} (h:xᶠ):ъ (A_M x)=true:=(Cg x).trans h lemma Ci (e:ℤ):Formats.Flocq.bpow ق e=(2:ℝ)^e:=by simp[Formats.Flocq.bpow,FloatLib.Numerics.binaryRadix,FloatLib.Numerics.Radix.toReal] lemma Cj:(2:ℝ)^(1000:ℤ)<=ц (Model.posMaxFinite ⟡):=by rw[Model.toReal_posMaxFinite,show Model.pow2 ⟡.fracWidth + ⟡.maxFiniteFracField=2^53-1 by decide +kernel, show ⟡.maxNormalExponent-Int.ofNat ⟡.fracWidth=971 by decide +kernel,Model.bpow,Ci,show (1000:ℤ)=29+971 from rfl,б Х] exact Г ב ו open Float.Model.UnpackedFloat in lemma La {b:BitVec 64} {s m e h} (a:unpack ⟠ b=.finite s m e h):2^52<=m∨e=-1074:=by unfold Float.Model.UnpackedFloat.unpack at a;simp only at a;rw[show (⟠.exponentBias:ℤ)=1023 by decide] at a;split_ifs at a with h1 h2 h3;. injection a with _ _ he;rw[show (unpackExponent (spec:=⟠) b).toNat=0 by simp[h3]] at he;omega . injection a with _ hm;rw[<-hm,BitVec.toNat_append];exact .inl (le_trans (by simp[Nat.shiftLeft_eq]) Nat.left_le_or) open Float.Model.UnpackedFloat in lemma Pf {s₁ s₂ m₁ m₂ e₁ e₂ h₁ h₂} {f g:BitVec 64} (e:unpack ⟠ f=.finite s₁ m₁ e₁ h₁) (b:unpack ⟠ g=.finite s₂ m₂ e₂ h₂): e₁+e₂<=⟠.targetExponent (Float.Model.totalExponent (m₁*m₂) (e₁+e₂)):=by have a:2^52<=m₁*m₂->52<=(m₁*m₂).log2:=(Nat.le_log2 (Nat.mul_ne_zero h₁.ne' h₂.ne')).2 simp only[Float.Model.Format.targetExponent,Float.Model.totalExponent,Float.Model.Format.mantissaBits,Float.Model.Format.minExponent] norm_num rcases La e with c | c . have:=a (c.trans (غ _ h₂));omega rcases La b with d | d . have:=a (d.trans (Nat.le_mul_of_pos_left _ h₁));omega omega lemma Lt (x y:ѕ) (a:xᶠ) (b:yᶠ):A_M (x*y)=Model.mul (A_M x) (A_M y):=by change Model.ofFloatModel (Float.Model.mul x.toModel y.toModel)=_;rw[Float.Model.mul,Model.ofFloatModel_pack,Model.Proof.mul_eq_spec,Model.Spec.mul];simp only[Model.toDyadic?_ieee_eq_model _ Ce,Model.toModel_ofFloatModel];change x.toModel.unpack.isFinite=true at a;change y.toModel.unpack.isFinite=true at b;have c:∀ s t:Float.Model.UnpackedFloat.Sign,Model.ofModel ⟡ (.zero (s*t))=Model.zero _ (ظ s ^^ ظ t):=λs t=>by cases s<;>cases t<;>simp[Model.modelSignBit] <;>first | exact (Model.negZero_eq_ofModel_zero _).symm | exact (Model.posZero_eq_ofModel_zero _).symm cases Mg:x.toModel.unpack<;>cases Md:y.toModel.unpack <;>simp only[Mg,Md,Float.Model.UnpackedFloat.isFinite,false_eq_true] at a b case finite.finite s₁ m₁ e₁ h₁ s₂ m₂ e₂ h₂=> have d:(m₁== 0 || m₂== 0)=false:=by simp[h₁.ne',h₂.ne'] have e:н (ظ s₁ ^^ ظ s₂)=s₁*s₂:=by cases s₁<;>cases s₂<;>rfl simp only[Model.unpackedToDyadic?,Float.Model.UnpackedFloat.mul];rw[Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ (Pf Mg Md),d];simp only[false_eq_true,ite_false,Model.roundDyadic,Ce,ite_true,Model.ieeeRoundDyadic,e];rfl all_goals simp[Model.unpackedToDyadic?,Float.Model.UnpackedFloat.mul,c] lemma Ic (z:ѕ) {a:Model ⟡} {c:ℝ} (h:A_M z=a) (b:ъ a=true) (d:ц a=ؿ ⟡ c):zᶠ∧R z=ؿ ⟡ c:=by subst h;exact ⟨(Cg z).symm.trans b,d⟩ lemma Cl (x y:ѕ) (hx:xᶠ) (hy:yᶠ) (hb:|R x| * |R y| ≤ 2^(1000:ℤ)): (x*y)ᶠ ∧ R (x*y)=ؿ ⟡ (R x*R y):= Ic _ (Lt x y hx hy) (Model.isFinite_mul_of_abs_mul_le_posMaxFinite _ _ Ce (Ch hx) (Ch hy) (hb.trans Cj)) (Model.toReal_mul_eq_roundAt_of_abs_mul_le_posMaxFinite _ _ Ce (Ch hx) (Ch hy) (hb.trans Cj)) noncomputable def A_z:ℝ:=2^(-1021:ℤ) noncomputable def A_B:ℝ:=2^(300:ℤ) lemma Cm:0< A_z:=by unfold A_z;positivity lemma Ew (a b c d:ℤ) (h:a+b<=c+d):(2:ℝ)^a*2^b<=2^c*2^d:=by rw[<-б Х,<-б Х];exact Ф one_le_two h lemma Cn:A_z<=1/2^200*(1/2^200):=by simpa [A_z] using Ew (-1021) 0 (-200) (-200) ב lemma Co:0< A_B:=by unfold A_B;positivity lemma Cp:(2:ℝ)^256*2^42<=A_B:=by simpa [A_B] using Ew 256 42 300 0 ב lemma Cq:(2:ℝ)^128<=A_B:=(by norm_num:(2:ℝ)^128<=2^256*2^42).trans Cp lemma Fb {k:ℕ} (h:k<=2^128):(k:ℝ)<=A_B:=(show (k:ℝ)<=2^128 by exact_mod_cast h).trans Cq lemma Ke:A_B*2<=2^(1000:ℤ):=by simpa [A_B] using Ew 300 1 1000 0 ב lemma Fw:A_B*A_B<=2^(1000:ℤ):=by simpa [A_B] using Ew 300 300 1000 0 ב lemma Nx (x:ℝ): |ؿ ⟡ x-x| ≤ 1/2^53*(|x| + A_z):=by rw[show (1/2^53*(|x| + A_z):ℝ)=2^(-53:ℤ) * |x| + 2^(-1074:ℤ) by rw[show (1/2^53:ℝ)=2^(-53:ℤ) by norm_num,show (-1074:ℤ)=-53+-1021 from rfl,б Х (-53),mul_add] rfl] by_cases a:x=0 . rw[a,Model.roundAt_zero,sub_self,abs_zero];positivity refine (Model.abs_roundAt_sub_le _ x).trans ?_ change Formats.Flocq.ulp _ (Model.fexpOf ⟡) x/2<=_ rw[Formats.Flocq.ulp.of_ne_zero _ _ x a] simp only[Formats.Flocq.cexp,Model.fexpOf,Formats.Flocq.fltExp] have b:=Formats.Flocq.bpow_magnitude_sub_one_le ق x a rw[Ci] at b rw[Ci,show ((⟡.fracWidth:ℤ)+1)=53 from rfl,show ⟡.minSubnormalExponent=-1074 from rfl] generalize Formats.Flocq.magnitude ق x=M at b ⊢ have d:(0:ℝ)<=2^(-53:ℤ) * |x|:=by positivity have c:(0:ℝ)<2^(-1074:ℤ):=by positivity rcases le_total (-1074) (M-53) with h | h . rw[max_eq_left h,show (2:ℝ)^(M-53)/2=2^(-53:ℤ)*2^(M-1) by rw[<-б Х,show (-53:ℤ)+(M-1)=M-53-1 by ring,ى Х _ 1,zpow_one]] linarith [Ц b (show (0:ℝ)<=2^(-53:ℤ) by positivity)] . rw[max_eq_right h];exact (half_le_self c.le).trans (le_add_of_nonneg_left d) lemma Ct {z:ѕ} {c:ℝ} (h:zᶠ∧R z=ؿ ⟡ c):zᶠ∧|R z-c| ≤ 1/2^53*(|c| + A_z):=⟨h.1,h.2 ▸ Nx c⟩ lemma Cu {a b:ℝ} (d:|a| ≤ A_B) (c:|b| ≤ A_B): |a| + |b| ≤ ц (Model.posMaxFinite ⟡):=by have:=Ke have:=Cj linarith section variable (x y:ѕ) (hx:xᶠ) (hy:yᶠ) (h1:|R x| ≤ A_B) (h2:|R y| ≤ A_B) include x y hx hy h1 h2 lemma Dn:(x+y)ᶠ∧|R (x+y)-(R x+R y)| ≤ 1/2^53*(|R x+R y| + A_z):= Ct (Ic _ (toModel_ofFloat_add_of_isFinite x y hx hy) (Model.isFinite_add_of_abs_add_le_posMaxFinite _ _ Ce (Ch hx) (Ch hy) (Cu h1 h2)) (Model.toReal_add_eq_roundAt_of_abs_add_le_posMaxFinite _ _ Ce (Ch hx) (Ch hy) (Cu h1 h2))) lemma Js:(x-y)ᶠ∧|R (x-y)-(R x-R y)| ≤ 1/2^53*(|R x-R y| + A_z):= Ct (Ic _ (toModel_ofFloat_sub_of_isFinite x y hx hy) (Model.isFinite_sub_of_abs_add_le_posMaxFinite _ _ Ce (Ch hx) (Ch hy) (Cu h1 h2)) (Model.toReal_sub_eq_roundAt_of_abs_add_le_posMaxFinite _ _ Ce (Ch hx) (Ch hy) (Cu h1 h2))) lemma Ft:(x*y)ᶠ∧|R (x*y)-R x*R y| ≤ 1/2^53*(|R x*R y| + A_z):=Ct (Cl x y hx hy ((ر h1 h2 (ф _) Co.le).trans Fw)) end lemma Hf (m k:ℤ) (hm:m.natAbs<2^53) (hk:-1074<=k):ؿ ⟡ ((m:ℝ)*2^k)=(m:ℝ)*2^k:=by apply Formats.Flocq.round_preserves_generic;exact (Formats.Flocq.generic_format_FLT_iff (⟡.minSubnormalExponent) (⟡.fracWidth+1) ה _).2 ⟨by decide,⟨m,k⟩,by simp[Formats.Flocq.toReal,Ci],hm,hk⟩ lemma Gu (x:ѕ):R x=Model.unpackedToReal x.toModel.unpack:=by rw[Em,Դ Ce,ه] lemma Rp {f:ѕ} {s m e h} (c:f.toModel.unpack=.finite s m e h):(Model.ofModel ⟡ (.finite .positive m e h)).toModel=.finite .positive m e h:=by have a:Model.toModel (A_M f)=.finite s m e h:=(ه _).trans c;cases s;. have b:=Model.toModel_neg_of_isFinite Ce (A_M f) (by rw[a];rfl);rw[a] at b;change _=Float.Model.UnpackedFloat.finite .positive m e h at b;rw[<-b];exact Model.toModel_canonicalizeModel _ . rw[<-a];exact Model.toModel_canonicalizeModel _ lemma Fl (f:ѕ) (hf:fᶠ):f.absᶠ∧R f.abs= |R f|:=by have a:A_M f.abs=Model.ofModel ⟡ f.toModel.unpack.abs:=Model.ofFloatModel_pack _;change f.toModel.unpack.isFinite=true at hf;cases hu:f.toModel.unpack with | notANumber | infinity _=>simp[hu,Float.Model.UnpackedFloat.isFinite] at hf | zero s=> rw[hu] at a;refine ⟨by rw[<-Cg,a];exact Model.isFinite_ofModel_zero _ Ce _,?_⟩;rw[Em f.abs,a,Gu f,hu];simp[Float.Model.UnpackedFloat.abs,Model.toReal_ofModel_zero _ Ce] | finite s m e h=> have b:=Rp hu;rw[hu] at a;have c:A_M f.abs=Model.ofModel ⟡ (.finite .positive m e h):=a;refine ⟨by rw[<-Cg,c,Ls,b];rfl,?_⟩;rw[Em f.abs,c,Gu f,hu,Դ Ce,b];simp only[Model.unpackedToReal_finite,Ci];cases s<;>simp[Model.modelSignBit,abs_of_nonneg (by positivity:(0:ℝ)<=(m:ℝ)*2^e)] lemma Gd (f:ѕ) (k:ℕ) (g:k<2^53) (e:f.toModel=Float.Model.pack (Float.Model.UnpackedFloat.ofNat ⟠ k)):fᶠ∧R f=k:=by obtain ⟨d,b,c⟩:∃ d,A_M f=Я ⟡ d∧d.toReal=k:=by refine ⟨.ofScaledInt k 0,?_,?_⟩;. change Model.ofFloatModel f.toModel=_;rw[e,Model.ofFloatModel_pack];exact Model.ofModel_ofInt_eq_roundDyadic _ Ce (k:ℤ) . rw[<-й,FloatLib.Numerics.Dyadic.ofScaledInt_toRat];simp have a:ъ (A_M f)=true:=by rw[b];apply Model.isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite _ Ce;rw[c,и (Ъ _)];exact ((Fb (א:k<=2^128)).trans ((le_mul_of_one_le_right Co.le one_le_two).trans Ke)).trans Cj refine ⟨(Cg f).symm.trans a,?_⟩;rw[Em,b,Model.toReal_roundDyadic_eq_roundAt _ Ce _ (b ▸ a),c];simpa using Hf k 0 (by simpa using g) ב lemma Py (m:і) (h:Ѡm<2^53):m.toFloatᶠ∧R m.toFloat=Ѡm:=Gd _ _ h rfl lemma Id:(0:ѕ)ᶠ∧R 0=0:=by simpa using Gd 0 0 ב rfl def A_bits (i:ℕ):і:= let e:=(i%256).toUInt64 let s:і:=if i ≥ 256 then 0x8000000000000000 else 0 if e== 0 then s else s ||| ((e+873) <<< (52:і)) lemma Lb (i:ℕ):pwEntry i=х (A_bits i):=by unfold pwEntry A_bits;dsimp only;split<;>rfl def A_chk (i:ℕ):ј:= match ؽ ⟠ (A_bits i).toBitVec with | .finite s m e _=>(ظ s== decide (256<=i)) && m== 2^52 && e== ((i%256:ℕ):ℤ)-202 && (i%256 != 0) | .zero _=>i%256== 0 | _=>false lemma Rj:∀ i,i<512->A_chk i=true:=by decide +kernel lemma Df (i:ℕ) (b:i<512): (pwEntry i)ᶠ∧R (pwEntry i)=if i%256=0 then 0 else (if 256<=i then -1 else 1)*2^(((i%256:ℕ):ℤ)-150):=by have a:=Rj i b unfold A_chk at a rw[Lb,Gu] change (х (A_bits i)).toModel.unpack.isFinite=true∧_ rw[show (х (A_bits i)).toModel.unpack=ؽ ⟠ (A_bits i).toBitVec from Model.unpack_pack_unpack _ _] generalize ؽ ⟠ (A_bits i).toBitVec=u at a cases u with | notANumber | infinity _=>simp at a | zero s=> simp only[beq_iff_eq] at a exact ⟨rfl,by simp[a]⟩ | finite s m e h=> simp only[and_eq_true,beq_iff_eq,bne_iff_ne] at a obtain ⟨⟨⟨g,d⟩,f⟩,c⟩:=a refine ⟨rfl,?_⟩ rw[Model.unpackedToReal_finite,Ci,f,g,d,mul_assoc, show ((2^52:ℕ):ℝ)*2^(((i%256:ℕ):ℤ)-202)=2^(((i%256:ℕ):ℤ)-150) by rw[Nat.cast_pow,Nat.cast_ofNat,<-ь,<-б Х] congr 1 push_cast ring] simp only[decide_eq_true_eq,c,↓reduceIte] lemma Lp (i:ℕ) (a:i<512):∃ σ:ℤ,σ.natAbs<=1 ∧ R (pwEntry i)=σ*2^(((i%256:ℕ):ℤ)-150):=by rw[(Df i a).2];split_ifs;exacts [⟨0,by norm_num,by simp⟩,⟨-1,by norm_num,by simp⟩,⟨1,by norm_num,by simp⟩] lemma Fy (f:ѕ) (i:ℕ) (g:i<512) (q:fᶠ) (c k:ℤ) (r:c.natAbs<2^53) (s:-900<=k) (m:|R f| ≤ A_B) (l:R f=c*2^k):(f*pwEntry i)ᶠ∧R (f*pwEntry i)=R f*R (pwEntry i):=by obtain ⟨b,a,d⟩:=Lp i g;have o:((i%256:ℕ):ℤ)-150<=128∧-150<=((i%256:ℕ):ℤ)-150:=א;generalize ((i%256:ℕ):ℤ)-150=E at o d;have p:|(b:ℝ)| ≤ 1:=by rw[<-Int.cast_abs,<-Nat.cast_natAbs];exact_mod_cast a have e:=щ (two_pos (α:=ℝ)) E;have h:|R (pwEntry i)| ≤ A_B:=by rw[d,abs_mul,abs_of_pos e,<-one_mul A_B];exact ر p (Ф one_le_two א) e.le zero_le_one obtain ⟨j,n⟩:=Cl f _ q (Df i g).1 ((ر m h (ф _) Co.le).trans Fw);refine ⟨j,?_⟩ have:=Hf (c*b) (k+E) (by rw[Int.natAbs_mul];have:=Nat.mul_le_mul_left c.natAbs a omega) א rw[б Х] at this;push_cast at this;rw[n,d,l,show (c:ℝ)*2^k*(b*2^E)=c*b*(2^k*2^E) by ring];exact this lemma Kp (i:є) (h:Ѡi< ѡpw):pw.uget i h=pwEntry Ѡi:=by simp[FloatArray.uget,Jy] section variable (w:ѓ) include w lemma Di:(w &&& В).toNat=Ѡw%2^31:=by rw[р];exact Е Ѡw 31 lemma Dj:(w &&& 0x7FFFFF).toNat=Ѡw%2^23:=by rw[р];exact Е Ѡw 23 lemma Ff:(w >>> 23).toNat=Ѡw/2^23:=by rw[UInt32.toNat_shiftRight,ص];rfl lemma Dl:(expOf w).toNat=Ѡw/2^23%2^8:=by unfold expOf;rw[р,Ff];exact Е _ 8 lemma Jq:signOf w=decide (2^31<=Ѡw):=by have b:=w.toNat_lt;unfold signOf;have h:((w &&& ط).toNat)=(Ѡw/2^31%2)*2^31:=by rw[р];show Ѡw &&& 2^31=_;rw[Nat.and_two_pow,Nat.testBit_eq_decide_div_mod_eq];have a:Ѡw/2^31%2=0∨Ѡw/2^31%2=1:=א;rcases a with a | a<;>rw[a]<;>rfl rw[Bool.eq_iff_iff];simp only[bne_iff_ne,ne_eq,decide_eq_true_eq];rw[<-Ч,h];simp only[UInt32.toNat_zero];omega lemma Pt:((w &&& 0x7FFFFF) ||| 0x800000).toNat=2^23+Ѡw%2^23:=by rw[UInt32.toNat_or,Dj,Nat.or_comm];simpa using (Nat.two_pow_add_eq_or_of_lt (Nat.mod_lt Ѡw (by positivity:2^23 > 0)) 1).symm lemma Dm (h:good w=true):Ѡw%2^31=0∨(2^23<=Ѡw%2^31∧Ѡw%2^31<Ш):=by have a:=Di w;have b:=(w &&& В).toNat_lt;unfold good at h;simp only[or_eq_true,beq_iff_eq,decide_eq_true_eq] at h;rcases h with h | h;. left;rw[<-a,h];rfl . right;rw[И,UInt32.toNat_sub] at h;rw[<-a];generalize (w &&& В).toNat=v at *;simp at h;omega lemma Do (h:good w=true):expOf w≠255:=by intro he;have a:=Dl w;rw[he] at a;change 255=_ at a;have:=Dm w h;have:=w.toNat_lt;omega end noncomputable def A_mag (v:ℕ):ℝ:= if v=0 then 0 else ((2^23+v%2^23:ℕ):ℝ)*2^(((v/2^23:ℕ):ℤ)-150) lemma Gz (v:ℕ):0<=A_mag v:=by unfold A_mag;split_ifs<;>positivity lemma Dp (w:ѓ) (hg:good w=true):wv w=(if 2^31<=Ѡw then -1 else 1)*A_mag (Ѡw%2^31):=by have g:=w.toNat_lt;have:=Dm w hg;have a:=Dl w;have d:(fracOf w).toNat=Ѡw%2^23:=Dj w;have f:wv w=(decodeD w).toReal:=by unfold wv ofW;rw[Model.toReal_eq,а w (Do w hg)] rw[f];unfold decodeD A_mag;by_cases c:Ѡw%2^31=0;. have b:expOf w=0:=Ч.mp (by rw[a];show _=0;omega);have e:fracOf w=0:=Ч.mp (by rw[d];show _=0;omega);simp only[b,e,c,↓reduceIte];simp[FloatLib.Numerics.Dyadic.toReal,signedSignificand] . have b:expOf w≠0:=λh=>by rw[h] at a;change 0=_ at a;omega simp only[b,c,↓reduceIte];rw[show Ѡw%2^31%2^23=(fracOf w).toNat by rw[d];omega,show Ѡw%2^31/2^23=(expOf w).toNat by rw[a];omega];simp only[FloatLib.Numerics.Dyadic.toReal,signedSignificand,Jq];simp;split_ifs<;>ring lemma Qu (v:ℕ) (h:v<Ш):A_mag v<=2^128:=by unfold A_mag;split_ifs with h0;. positivity . exact (ر (show ((2^23+v%2^23:ℕ):ℝ)<=((2^24:ℕ):ℝ) from Nat.cast_le.2 א) (Ф one_le_two (by omega:_<=(104:ℤ))) ו ו).trans_eq ב lemma Ly (a b:ℕ) (hab:a<=b) (ha:a=0∨2^23<=a):A_mag a<=A_mag b:=by rcases ha with rfl | ha;. simpa [A_mag] using Gz b unfold A_mag;simp only[show ¬ a=0 by omega,show ¬ b=0 by omega,↓reduceIte];have c:a/2^23<=b/2^23:=Nat.div_le_div_right hab;rcases c.eq_or_lt with d | g;. rw[d];exact Г (Nat.cast_le.2 א) ו . have e:(2:ℝ)^(((a/2^23:ℕ):ℤ)-150)*2<=2^(((b/2^23:ℕ):ℤ)-150):=by rw[<-zpow_add_one₀ Х];exact Ф one_le_two א have f:((2^23:ℕ):ℝ)<=((2^23+b%2^23:ℕ):ℝ):=Nat.cast_le.2 א calc _<=((2^23*2:ℕ):ℝ)*2^(((a/2^23:ℕ):ℤ)-150):= Г (Nat.cast_le.2 א) ו _=((2^23:ℕ):ℝ)*(2^(((a/2^23:ℕ):ℤ)-150)*2):=by push_cast;ring _<=_:=ر f e ו ו abbrev A_mf (w:ѓ):ѕ:=((w &&& 0x7FFFFF) ||| 0x800000).toFloat lemma Fm (w:ѓ):pw.uget (w >>> 23).toUSize (Eo w)=pwEntry (Ѡw/2^23)∧Ѡw/2^23<512∧(A_mf w)ᶠ ∧ (A_mf w*pwEntry (Ѡw/2^23))ᶠ ∧ R (A_mf w*pwEntry (Ѡw/2^23))=R (A_mf w)*R (pwEntry (Ѡw/2^23)) ∧ R (A_mf w)=((2^23+Ѡw%2^23:ℕ):ℝ):=by have g:=w.toNat_lt;have c:=Pt w;obtain ⟨d,a⟩:=Gd (A_mf w) _ (by rw[c];omega) rfl;rw[c] at a;have b:Ѡw/2^23<512:=א obtain ⟨f,e⟩:=Fy _ _ b d ((2^23+Ѡw%2^23:ℕ):ℤ) 0 א ב (by rw[a,и (Ъ _)] exact Fb א) (by rw[a,zpow_zero,mul_one,Int.cast_natCast]) refine ⟨?_,b,d,f,e,a⟩;rw[Kp,к,Ff] lemma Ds (w:ѓ) (hg:good w=true):(dv w)ᶠ∧R (dv w)=wv w:=by obtain ⟨g,a,-,e,d,c⟩:=Fm w;have j:=w.toNat_lt;unfold dv;rw[g];refine ⟨e,?_⟩;rw[d,c,(Df _ a).2,Dp w hg];have b:=Dm w hg;generalize Ѡw=v at *;rcases b with h | ⟨l,k⟩;. rw[h];simp only[show v/2^23%256=0 by omega,↓reduceIte,mul_zero,show A_mag 0=0 by simp[A_mag]] . have f:(256<=v/2^23) ↔ 2^31<=v:=א;unfold A_mag;rw[(א:v%2^31/2^23=v/2^23%256),(א:v%2^31%2^23=v%2^23),г (א:¬ v/2^23%256=0),г (א:¬ v%2^31=0)];by_cases i:2^31<=v<;>simp only[f,i,↓reduceIte]<;>ring def A_fsum (l:List ѕ):ѕ:=l.foldl (.+·) 0 noncomputable def A_sa (l:List ѕ):ℝ:=(l.map λq=>|R q|).sum noncomputable def A_sr (l:List ѕ):ℝ:=(l.map R).sum lemma Fr {a:Type} (l:List a) (f:a->ℝ):0<=(l.map λq=>|f q|).sum:=List.sum_nonneg (by simp only[List.mem_map];rintro _ ⟨q,_,rfl⟩;exact ф _) lemma Du (l:List ѕ):0<=A_sa l:=Fr l R lemma Om (l:List ѕ) (q:ѕ):A_sa (l ++ [q])=A_sa l + |R q| ∧ A_sr (l ++ [q])=A_sr l+R q∧A_fsum (l ++ [q])=A_fsum l+q:=by simp[A_sa,A_sr,A_fsum] lemma Ll (l:List ѕ):|A_sr l| ≤ A_sa l:=by induction l with | nil=>simp[A_sa,A_sr] | cons q l ih=> simp only[A_sa,A_sr,List.map_cons,List.sum_cons] at ih ⊢;exact (ن _ _).trans ד lemma Og:A_z<=1:=Cn.trans ב section variable (l:List ѕ) (hf:∀ q∈l,qᶠ) (Da:ѣl<=2^21) (hb:A_sa l<=A_B/4) include l hf Da hb lemma Kq: (A_fsum l)ᶠ ∧ |R (A_fsum l)-A_sr l| ≤ (1+1/2^22)*ѣl*(1/2^53*(A_sa l+A_z)):=by induction l using List.reverseRecOn with | nil=>exact ⟨Id.1,by simp[A_fsum,Id.2,A_sr]⟩ | append_singleton l q ih=> obtain ⟨e,f,n⟩:=Om l q rw[e] at hb rw[List.length_append,List.length_singleton] at Da have t:=Du l have j:=ф (R q) obtain ⟨h,v⟩:=ih (λx i=>hf x (by simp[i])) א ד have u:(ѣl:ℝ)+1<=2^21:=by exact_mod_cast Da have d:(0:ℝ)<=ѣl:=Ъ _ have y:=Ll l have o:=Cm have m:=Og have p:=Cq have s:=С (R (A_fsum l)) (A_sr l) have w:=Г (show (ѣl:ℝ)<=2^21 by linarith) (ד:0<=A_sa l+A_z) obtain ⟨b,z⟩:=Dn _ q h (hf q ג) ד ד rw[n,e,f,List.length_append,List.length_singleton] refine ⟨b,?_⟩ push_cast generalize R (A_fsum l)=r at * generalize R q=a at * generalize A_sa l=P at * generalize A_sr l=S at * generalize (ѣl:ℝ)=k at * obtain ⟨W,g⟩:∃ W:ℝ,W=1/2^53*(P + |a| + A_z):=⟨_,rfl⟩ have c:0<=W:=ד rw[<-g] refine (abs_sub_le _ (r+a) (S+a)).trans ?_ rw[add_sub_add_right_eq_sub] linarith [ن r a,Ц (show 1/2^53*(P+A_z)<=W by linarith) d,Г (ד:k<=2^21) c] lemma Sp: (A_fsum l)ᶠ ∧ |R (A_fsum l)-A_sr l| ≤ 2*ѣl*(1/2^53*(A_sa l+A_z)):=by obtain ⟨a,b⟩:=Kq l hf Da hb have c:=ч (Nat.cast_nonneg (α:=ℝ) ѣl) (add_nonneg (Du l) Cm.le) exact ⟨a,b.trans ד⟩ end lemma Lh (l:List ѕ) (c:∀ q∈l,qᶠ) (d:ѣl<=2^21) (f:A_sa l<=A_B/4): (A_fsum (l.map Float.abs))ᶠ ∧ |R (A_fsum (l.map Float.abs))-A_sa l| ≤ 2*ѣl*(1/2^53*(A_sa l+A_z)):=by have a:A_sa (l.map Float.abs)=A_sa l∧A_sr (l.map Float.abs)=A_sa l:=by constructor<;>simp only[A_sa,A_sr,List.map_map]<;>congr 1 <;>exact List.map_congr_left λq b=>by simp[(Fl q (c q b)).2] have:=Sp (l.map Float.abs) (λq b=>by obtain ⟨x,e,rfl⟩:=List.mem_map.mp b exact (Fl x (c x e)).1) (by simpa) (a.1.symm ▸ f) rwa [a.1,a.2,List.length_map] at this lemma Nf (n:ℕ) (g:n<2^20):(nfOf n)ᶠ∧R (nfOf n)=((n:ℝ)+8)/2^53:=by have b:(n.toUInt64+8).toNat=n+8:=by have c:(8:і).toNat=8:=rfl;simp[UInt64.toNat_add,c];omega obtain ⟨f,a⟩:=Py (n.toUInt64+8) (by rw[b];omega);rw[b] at a obtain ⟨e,d⟩:=Fy _ 97 ב f ((n+8:ℕ):ℤ) 0 א ב (by rw[a,и (Ъ _)] exact Fb א) (by rw[a];simp) push_cast at a;rw[show nfOf n=(n.toUInt64+8).toFloat*pwEntry 97 by rw[nfOf,Lb];rfl];refine ⟨e,?_⟩;rw[d,a,(Df 97 ב).2];norm_num;ring lemma Qn {n:ℕ} (l:n<2^20) {s t:ѕ} (k:sᶠ) (m:tᶠ) {X Y:ℝ} (e:0<=Y) (v:Y<=A_B/8) (y:|R s-X| ≤ ((n:ℝ)+4)*(1/2^53*Y)+1/2^250) (u:|R t-Y| ≤ Y/2^30+1/2^250) (I:|R s| ≤ 2*Y) (c:(2:ℝ)^(-127:ℤ) ≤ |R (s+nfOf n*t)|):R (s-nfOf n*t)< X∧X< R (s+nfOf n*t):=by have w:(8:ℝ)<=A_B:=(by norm_num:(8:ℝ)<=2^128).trans Cq;have A:(n:ℝ)+1<=2^20:=by exact_mod_cast l have o:(0:ℝ)<=n:=Ъ n;obtain ⟨h,b⟩:=Nf n l;have E:=Cm;have B:=Cn;have a:0<=((n:ℝ)+8)/2^53:=by positivity have C:=С (R t) Y;rw[и e] at C;have i:|R t| ≤ 2*Y+1/2^250:=ד;have x:|R (nfOf n)*R t| ≤ 1/2^30*(2*Y+1/2^250):=by rw[abs_mul,b,и a];exact ر ד i (ф _) ב obtain ⟨d,f⟩:=Ft _ _ h m (by rw[b,и a];linarith) ד;have D:=С (R (nfOf n*t)) (R (nfOf n)*R t);obtain ⟨z,j⟩:=Dn s _ k d ד ד;obtain ⟨r,g⟩:=Js s _ k d ד ד;have H:=С (R (s+nfOf n*t)) (R s+R (nfOf n*t));have q:=ن (R s) (R (nfOf n*t));have p:=abs_sub (R s) (R (nfOf n*t));rw[show (2:ℝ)^(-127:ℤ)=1/2^127 by norm_num] at c;have G:=Ц (ع.mp u).1 a;have M:=Г (show (n:ℝ)<=2^20 by linarith) e;rw[b] at f x D;obtain ⟨K,J⟩:=ع.mp y;obtain ⟨O,N⟩:=ع.mp j;obtain ⟨F,L⟩:=ع.mp g;obtain ⟨P,-⟩:=ع.mp f;constructor<;>linarith lemma Pq (g h:ℕ->ѕ) (l:List ℕ) (a b:ѕ): l.foldl (λ(d:F1) t=>F1.mk (d.s+g t) (d.t+h t)) ⟨a,b⟩ =⟨l.foldl (λ(c:ѕ) t=>c+g t) a,l.foldl (λ(c:ѕ) t=>c+h t) b⟩:=by induction l generalizing a b with | nil=>rfl | cons x l ih=>simp only[List.foldl_cons,ih] lemma Lk (a:List ℕ) (f:ℕ->ℝ) (M:ℝ) (h:∀ t∈a,f t<=M):(a.map f).sum<=ѣa*M:=by simpa using List.sum_le_sum h section variable (w:ѓ) (hg:good w=true) include w hg lemma Gw:|wv w| = A_mag (Ѡw%2^31):=by rw[Dp w hg,abs_mul,и (Gz _)];split_ifs<;>simp lemma Ec:|wv w| ≤ 2^128:=by rw[Gw w hg];apply Qu;rcases Dm w hg with h | h<;>omega lemma Gx (h:w &&& В=0):wv w=0:=by rw[Dp w hg,<-Di w,h];simp[A_mag] end lemma Ki (a b:ѓ) (ha:good a=true) (hb:good b=true): (dv a*dv b)ᶠ ∧ |R (dv a*dv b)-wv a*wv b| ≤ 1/2^53*(|wv a*wv b| + A_z) ∧ |wv a*wv b| ≤ 2^256:=by obtain ⟨j,g⟩:=Ds a ha obtain ⟨i,d⟩:=Ds b hb have c:=Ec a ha have e:=Ec b hb obtain ⟨h,f⟩:=Ft _ _ j i (g ▸ c.trans Cq) (d ▸ e.trans Cq) rw[g,d] at f exact ⟨h,f,by rw[abs_mul] exact (ر c e (ф _) ו).trans_eq ב⟩ lemma Gn {n:ℕ} {a b:ℕ->ѓ} {f:ѓ} (g:∀ t,t< n->good (a t)=true) (j:∀ t,t< n->good (b t)=true) {l:List ℕ} (k:l.Nodup) (d:∀ t∈l,t< n) (i:∀ t,t< n->t∉l->a t &&& В=0∨b t &&& В=0):exactS n a b f=(l.map λt=>wv (a t)*wv (b t)).sum+wv f:=by unfold exactS;congr 1;rw[<-List.sum_toFinset _ k];refine (Finset.sum_subset (λt c=>by simpa using d t (by simpa using c)) λt c h=>?_).symm;have e:=ؾ.mp c;rcases i t e (by simpa using h) with h | h;. simp[Gx (a t) (g t e) h] . simp[Gx (b t) (j t e) h] lemma Ee {n:ℕ} {l:List ℕ} (b:l.Nodup) (a:∀ t∈l,t< n):ѣl<=n:=by simpa using (b.subperm λt h=>List.mem_range.2 (a t h)).length_le abbrev A_G (ts:List ℕ) (g:ℕ->ѕ) (p:ℕ->ℝ):Prop:= ∀ t∈ts,(g t)ᶠ∧|R (g t)-p t| ≤ 1/2^53*(|p t| + A_z)∧|p t| ≤ 2^256 lemma Fa {b c:ℕ->ѓ} {l:List ℕ} {n:ℕ} (a:∀ t∈l,t< n) (e:∀ t,t< n->good (b t)=true) (f:∀ t,t< n->good (c t)=true):A_G l (λt=>dv (b t)*dv (c t)) λt=>wv (b t)*wv (c t):=λt d=>Ki _ _ (e t (a t d)) (f t (a t d)) lemma Gc {a:List ℕ} {g:ℕ->ѕ} {p:ℕ->ℝ} (b:ѕ) (c:A_G a g p):let A:=(a.map λt=>|p t|).sum let L:=a.map g ++ [b] |A_sr L-((a.map p).sum+R b)| ≤ 1/2^53*(A+ѣa*A_z) ∧ A_sa L<=A + |R b| + 1/2^53*(A+ѣa*A_z)∧A<=2*A_sa L+ѣa*A_z:=by induction a with | nil=>simp[A_sa,A_sr] | cons x a ih=> obtain ⟨d,i,j⟩:=ih (λt e=>c t (by simp[e])) have f:=(c x ג).2.1 simp only[A_sa,A_sr,List.map_cons,List.sum_cons,List.length_cons,List.cons_append] at d i j ⊢ have m:=Cm obtain ⟨o,r⟩:=ع.mp f obtain ⟨n,q⟩:=ع.mp d have k:=ф (p x) have h:=С (p x) (R (g x)) have l:=С (R (g x)) (p x) rw[abs_sub_comm] at h refine ⟨ع.mpr ⟨?_,?_⟩,?_,?_⟩<;>push_cast<;>linarith lemma Iy (l:List ℕ) (g:ℕ->ѕ) (b:ѕ):((l.map g ++ [b]).length:ℝ)=ѣl+1:=by simp lemma If {a:List ℕ} {g:ℕ->ѕ} {p:ℕ->ℝ} {b:ѕ} (d:A_G a g p) (c:bᶠ):∀ q∈a.map g ++ [b],qᶠ:=by simp only[List.mem_append,List.mem_map,List.mem_singleton];rintro q (⟨t,e,rfl⟩ | rfl);. exact (d t e).1 . exact c lemma Gb {a:ѓ} (d:good a=true) (h:a<=В): 0<=wv a∧wv a<=2^128 ∧ ∀ w,good w=true->w &&& В<=a->|wv w| ≤ wv a:=by have g:Ѡa<=2147483647:=И.mp h have b:wv a=A_mag Ѡa:=by rw[Dp a d,Й א] simp only[show ¬ 2^31<=Ѡa by omega,↓reduceIte,one_mul] refine ⟨b ▸ Gz _,(le_abs_self _).trans (Ec a d),λw c f=>?_⟩ have e:=И.mp f rw[Di] at e rw[Gw _ c,b] exact Ly _ _ e ((Dm _ c).imp_right (·.1)) section variable {n:ℕ} {ts:List ℕ} {g:ℕ->ѕ} {p:ℕ->ℝ} {bw hh:ѓ} {X Y J:ℝ} {s t a e:ѕ} (A:n<2^20) (B:ѣts<=n) (C:A_G ts g p) (D:good bw=true) (E:X=(ts.map p).sum+wv bw) (F:s=ts.foldl (λ(c:ѕ) t=>c+g t) 0+dv bw) (G:(2:ℝ)^(-127:ℤ) ≤ |R (s+e)|) include A B C D E F G lemma Kg (k:tᶠ) (b:Y<=A_B/8) (o:A_sa (ts.map g ++ [dv bw])+A_z<=(1+1/2^22)*Y) (u:(1+1/2^22)*((ѣts:ℝ)+1)*(A_sa (ts.map g ++ [dv bw])+A_z) + ((ts.map λt=>|p t|).sum+ѣts*A_z)<=((ѣts:ℝ)+4)*Y+1/2^240) (m:|R t-Y| ≤ Y/2^30+1/2^250) (h:e=nfOf n*t): R (s-e)< X∧X< R (s+e):=by subst h obtain rfl:s=A_fsum (ts.map g ++ [dv bw]):=by simp[F,A_fsum,List.foldl_map] obtain ⟨c,d⟩:=Ds bw D obtain ⟨j,-,-⟩:=Gc (dv bw) C rw[d,<-E] at j have i:=Du (ts.map g ++ [dv bw]) have r:=Cm have l:(ѣts:ℝ)<=n:=by exact_mod_cast B have q:(n:ℝ)+1<=2^20:=by exact_mod_cast A have a:0<=Y:=ד obtain ⟨f,h⟩:=Kq _ (If C c) ז ד rw[Iy] at h generalize ts.map g ++ [dv bw]=L at * have x:=Ll L have y:=Г l a have v:=ر (show (ѣts:ℝ)+1<=2^20 by linarith) o ד ב have w:=abs_sub_le (R (A_fsum L)) (A_sr L) X have z:=С (R (A_fsum L)) (A_sr L) exact Qn A f k a b ד m ד G lemma Sz (P:good hh=true) (hp:hh<=В) (U:(ts.map λt=>|p t|).sum<=wv hh*J) (m:aᶠ) (d:0<=J) (z:J<=2^149) (v:|R a-J| ≤ (J+A_z)/2^32) (he:e=nfOf n*(dv hh*a+(dv bw).abs)):R (s-e)< X∧X< R (s+e):=by obtain ⟨b,h,-⟩:=Gb P hp;obtain ⟨Q,N⟩:=Ds hh P;obtain ⟨q,j⟩:=Ds bw D;obtain ⟨-,K,-⟩:=Gc (dv bw) C;rw[j] at K;have S:=Ec bw D;generalize wv hh=H at *;have hk:(ѣts:ℝ)+1<=2^20:=by exact_mod_cast (by omega:ѣts+1<=2^20) have L:(0:ℝ)<=ѣts:=Ъ _;have M:=Cm;have x:=Cn;have r:=Fr ts p;have hBl:=Cp;have T:=Cq;have u:=С (R a) J;rw[и d] at u;obtain ⟨e1,W⟩:=ع.mp v;have e3:=Ц e1 b;have e4:=Ц W b;have e5:=ر h x M.le ב;have e6:|H*R a| ≤ H*(J+(J+A_z)/2^32):=by rw[abs_mul,и b];exact Ц ד b have hW:=ч b d;have hHJ:H*J<=2^128*2^149:=ر h z d ב;obtain ⟨o,i⟩:=Ft _ a Q m (by rw[N,и b];linarith) ד;rw[N] at i;have e7:=С (R (dv hh*a)) (H*R a);obtain ⟨w,f⟩:=Fl (dv bw) q;rw[j] at f;obtain ⟨y,k⟩:=Dn _ _ o w ד (by rw[f,abs_abs];linarith);rw[f] at k;have e8:=ن (R (dv hh*a)) |wv bw|;rw[abs_abs] at e8;obtain ⟨e9,Z⟩:=ع.mp i;obtain ⟨e11,V⟩:=ع.mp k;have hkz:=Г (show (ѣts:ℝ)<=2^20 by linarith) M.le;have O:=ф (wv bw);obtain ⟨Y,hY⟩:∃ Y,Y=H*J + |wv bw| + A_z:=⟨_,rfl⟩;have c:A_sa (ts.map g ++ [dv bw])+A_z<=(1+1/2^22)*Y:=ד;have I:(ts.map λt=>|p t|).sum+A_z<=Y:=ד;have l:|R (dv hh*a+(dv bw).abs)-Y| ≤ Y/2^30+1/2^250:=ع.mpr ⟨by linarith,by linarith⟩;refine Kg A B C D E F G y ד c ?_ l he;have h3:=Ц c (show 0<=(ѣts:ℝ)+1 by linarith);have h4:=Г (show (ѣts:ℝ)<=2^20 by linarith) (ד:0<=Y);linarith lemma Lv {a:ℕ->ѓ} (u:good hh=true) (w:hh<=В) (i:∀ t∈ts,good (a t)=true) (o:∀ t∈ts,|p t| ≤ wv hh * |wv (a t)|) (r:e=nfOf n*(dv hh*ts.foldl (λ(c:ѕ) t=>c+(dv (a t)).abs) 0+(dv bw).abs)):R (s-e)< X∧X< R (s+e):=by have f:(ѣts:ℝ)<=2^20:=by exact_mod_cast (by omega:ѣts<=2^20) have k:A_sa (ts.map λt=>dv (a t))=(ts.map λt=>|wv (a t)|).sum:=by simp only[A_sa,List.map_map];congr 1;exact List.map_congr_left λt d=>by simp[(Ds _ (i t d)).2] have h:=(Lk ts _ _ λt d=>Ec _ (i t d)).trans (Г f ב);rw[<-k] at h;have m:=Cp obtain ⟨j,b⟩:=Lh _ (λq v=>by obtain ⟨t,d,rfl⟩:=List.mem_map.mp v exact (Ds _ (i t d)).1) ז ד rw[List.length_map] at b;have g:=Du (ts.map λt=>dv (a t));have l:=Cm;refine Sz A B C D E F G u w ?_ j g (h.trans ב) ?_ (r.trans (by simp[A_fsum,List.foldl_map]));. rw[k,<-List.sum_map_mul_left];exact List.sum_le_sum o . refine b.trans ?_;have:=Г f (add_nonneg g l.le);linarith end section variable (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (l:љ) (hl:l.Nodup) (Bo:∀ t∈l,t< n) include n hn xw ww bw hx hw hb l hl Bo lemma Ma (hz:∀ t,t< n->t∉l->xw t &&& В=0∨ww t &&& В=0) (s e:ѕ) (hs:let r:=l.foldl (λ(acc:F1) t=>let q:=dv (xw t)*dv (ww t) F1.mk (acc.s+q) (acc.t+q.abs)) ⟨0,0⟩;s=r.s+dv bw∧e=nfOf n*(r.t+(dv bw).abs)) (Bk:(2:ℝ)^(-127:ℤ) ≤ |R (s+e)|): R (s-e)< exactS n xw ww bw∧exactS n xw ww bw< R (s+e):=by simp only[Pq] at hs obtain ⟨hs,E⟩:=hs have a:=Fa Bo hx hw have f:=Ee hl Bo obtain ⟨h,i⟩:=Ds bw hb obtain ⟨-,m,y⟩:=Gc (dv bw) a rw[i] at m have b:=Du (l.map (λt=>dv (xw t)*dv (ww t)) ++ [dv bw]) have k:=Lk l _ _ λt u=>(a t u).2.2 have v:(ѣl:ℝ)+1<=2^20:=by exact_mod_cast (by omega:ѣl+1<=2^20) have o:(0:ℝ)<=ѣl:=Ъ _ have d:=Cm have D:=Cn have w:=Ec bw hb have z:=Cp have A:=Fr l λt=>wv (xw t)*wv (ww t) have p:=k.trans (Г (show (ѣl:ℝ)<=2^20 by linarith) ב) have C:=Г (show (ѣl:ℝ)<=2^20 by linarith) d.le have g:A_sa (l.map (λt=>dv (xw t)*dv (ww t)) ++ [dv bw])+A_z<=A_B/8:=ד obtain ⟨j,c⟩:=Lh _ (If a h) ז ד rw[Iy] at c have B:=ч o b have x:=Г v (add_nonneg b d.le) obtain ⟨G,F⟩:=ع.mp c exact Kg hn f a hb (Gn hx hw hl Bo hz) hs Bk j g ד ד (ع.mpr ⟨by linarith,by linarith⟩) (E.trans (by simp[A_fsum,List.foldl_map])) lemma Sh (hz:∀ t,t< n->t∉l->xw t &&& В=0) (s e:ѕ) (hs:let r:=l.foldl (λ(acc:F1) t=>let q:=dv (xw t)*dv (ww t) F1.mk (acc.s+q) (acc.t+q.abs)) ⟨0,0⟩;s=r.s+dv bw∧e=nfOf n*(r.t+(dv bw).abs)) (Bk:(2:ℝ)^(-127:ℤ) ≤ |R (s+e)|): R (s-e)< exactS n xw ww bw∧exactS n xw ww bw< R (s+e):= Ma n hn xw ww bw hx hw hb l hl Bo (λt b a=>.inl (hz t b a)) s e hs Bk end lemma Sr (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw hv:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (Mk:good hv=true) (Tl:∀ t,t< n->ww t &&& В<=hv) (Mi:hv<=В) (l:љ) (hl:l.Nodup) (Bo:∀ t∈l,t< n) (hz:∀ t,t< n->t∉l->xw t &&& В=0) (s e:ѕ) (hs:s=l.foldl (λ(acc:ѕ) t=>acc+dv (xw t)*dv (ww t)) 0+dv bw ∧ e=nfOf n*(dv hv*(l.foldl (λ(acc:ѕ) t=>acc+(dv (xw t)).abs) 0)+(dv bw).abs)) (Bk:(2:ℝ)^(-127:ℤ) ≤ |R (s+e)|): R (s-e)< exactS n xw ww bw∧exactS n xw ww bw< R (s+e):=by obtain ⟨hs,b⟩:=hs obtain ⟨-,-,c⟩:=Gb Mk Mi exact Lv hn (Ee hl Bo) (Fa Bo hx hw) hb (Gn hx hw hl Bo λt i z=>.inl (hz t i z)) hs Bk Mk Mi (λt a=>hx t (Bo t a)) (λt a=>by rw[abs_mul,mul_comm] exact Г (c _ (hw t (Bo t a)) (Tl t (Bo t a))) (ф _)) b lemma Lu (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw hh:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (hg:good hh=true) (hm:∀ t,t< n->xw t &&& В<=hh) (hp:hh<=В) (l:љ) (hl:l.Nodup) (Bo:∀ t∈l,t< n) (hz:∀ t,t< n->t∉l->xw t &&& В=0∨ww t &&& В=0) (s e:ѕ) (hs:s=l.foldl (λ(acc:ѕ) t=>acc+dv (xw t)*dv (ww t)) 0+dv bw ∧ e=nfOf n*(dv hh*(l.foldl (λ(acc:ѕ) t=>acc+(dv (ww t)).abs) 0)+(dv bw).abs)) (Bk:(2:ℝ)^(-127:ℤ) ≤ |R (s+e)|): R (s-e)< exactS n xw ww bw∧exactS n xw ww bw< R (s+e):=by obtain ⟨hs,b⟩:=hs obtain ⟨-,-,c⟩:=Gb hg hp exact Lv hn (Ee hl Bo) (Fa Bo hx hw) hb (Gn hx hw hl Bo hz) hs Bk hg hp (λt a=>hw t (Bo t a)) (λt a=>by rw[abs_mul] exact Г (c _ (hx t (Bo t a)) (hm t (Bo t a))) (ф _)) b end section local notation:max x:max "ᶠ"=>Float.isFinite x=true noncomputable def A_r (b:ј):ℝ:=if b then -1 else 1 lemma Rd (s t:ј):A_r (s ^^ t)=A_r s*A_r t:=by cases s<;>cases t<;>simp[A_r] lemma Qa (S T:ј) (X Y:ℝ) (a:0< X) (b:0< Y) (h:A_r S*X=A_r T*Y):S=T:=by cases S<;>cases T<;>simp[A_r] at h ⊢<;>linarith section variable (d:FloatLib.Numerics.Dyadic) include d lemma En:d.toReal=A_r d.negative*((d.significand:ℝ)*2^d.exponent):=by obtain ⟨n,m,e⟩:=d;cases n<;>simp[FloatLib.Numerics.Dyadic.toReal,signedSignificand,A_r] lemma Ev:d.toReal=0 ↔ d.significand=0:=by have h:(2:ℝ)^d.exponent≠0:=zpow_ne_zero _ Х;rw[En];cases d.negative<;>simp[A_r,h] lemma Ez (h:d.significand≠0):0<(d.significand:ℝ)*2^d.exponent:=mul_pos (Nat.cast_pos.mpr (ш h)) (щ two_pos _) end lemma Oa (a b:ѕ) (h:A_M a=A_M b):a=b:=by have:=Model.ofFloatModel_injective h;cases a;cases b;simp_all lemma Ep (f:ѕ) (h:fᶠ):∃ d,Model.toDyadic? (A_M f)=some d∧d.toReal=R f:=by obtain ⟨d,a⟩:=Model.exists_toDyadic?_of_isFinite ((Cg f).trans h);exact ⟨d,a,by rw[Em,Model.toReal_eq,a]⟩ lemma Fz {a b:ѕ} {x y:FloatLib.Numerics.Dyadic} (f:Model.toDyadic? (A_M a)=some x) (d:Model.toDyadic? (A_M b)=some y) (e:aᶠ) (c:bᶠ): A_M (a*b)=if x.significand*y.significand=0 then Model.zero _ (x.negative ^^ y.negative) else Я _ ⟨x.negative ^^ y.negative,x.significand*y.significand,x.exponent+y.exponent⟩:=by rw[Lt a b e c,Model.Proof.mul_eq_spec,Model.Spec.mul,f,d] simp lemma Ig {a b:ѕ} {x y z:FloatLib.Numerics.Dyadic} (m:Model.toDyadic? (A_M a)=some x) (n:Model.toDyadic? (A_M b)=some y) (e:Model.toDyadic? (A_M (a*b))=some z) (k:aᶠ) (l:bᶠ) (c:z.toReal=x.toReal*y.toReal):z.negative=(x.negative ^^ y.negative):=by by_cases g:x.significand*y.significand=0;. have d:=Fz m n k l;simp only[g,↓reduceIte] at d;rw[d,Model.toDyadic?_zero] at e;cases e;show Model.signBit _=_;cases x.negative<;>cases y.negative<;>simp[Model.zero] . obtain ⟨f,i⟩:=Nat.mul_ne_zero_iff.mp g;have j:z.significand≠0:=λh=>by rw[(Ev z).2 h] at c;exact mul_ne_zero (mt (Ev x).1 f) (mt (Ev y).1 i) c.symm rw[En z,En x,En y,mul_mul_mul_comm,<-Rd] at c;exact Qa _ _ _ _ (Ez z j) (mul_pos (Ez x f) (Ez y i)) c lemma Qo (v m p:ѕ) (f:vᶠ) (i:mᶠ) (h:pᶠ) (u:(v*p)ᶠ) (s:(m*p)ᶠ) (q:R (v*p)=R v*R p) (r:R (m*p)=R m*R p):v*p*m=v*(m*p):=by obtain ⟨a,o,n⟩:=Ep v f;obtain ⟨b,y,k⟩:=Ep p h;obtain ⟨c,w,A⟩:=Ep m i;obtain ⟨d,t,B⟩:=Ep _ u;obtain ⟨e,l,x⟩:=Ep _ s;have D:=Ig o y t f h (by rw[B,n,k,q]);have E:=Ig w y l i h (by rw[x,A,k,r]);have C:(d.negative ^^ c.negative)=(a.negative ^^ e.negative):=by rw[D,E];cases a.negative<;>cases b.negative<;>cases c.negative<;>rfl have j:d.toReal*c.toReal=a.toReal*e.toReal:=by rw[B,A,n,x,q,r];ring have g:d.significand*c.significand=0 ↔ a.significand*e.significand=0:=by simp only[Nat.mul_eq_zero,<-Ev,<-mul_eq_zero,j] apply Oa;rw[Fz t w u i,Fz o l f s];by_cases z:d.significand*c.significand=0;. simp only[z,g.1 z,↓reduceIte,C] . simp only[z,mt g.2 z,↓reduceIte];refine ExactRuntime.roundDyadic_congr _ Ce _ _ z (mt g.2 z) (Rat.cast_injective (α:=ℝ) ?_);rw[й,й,Model.Dyadic.toReal_mul,Model.Dyadic.toReal_mul,j] lemma Ph (x w:ѓ) (hx:good x=true):dvB (dv x) w=dv x*dv w:=by obtain ⟨e,o⟩:=Ds x hx;obtain ⟨p,f,j,q,g,-⟩:=Fm w;obtain ⟨d,a,-,-,l,b⟩:=Fm x;obtain ⟨m,c,k⟩:=Lp _ a;have r:=x.toNat_lt;have h:R (dv x)=(((2^23+Ѡx%2^23:ℕ)*m:ℤ):ℝ) * 2^(((Ѡx/2^23%256:ℕ):ℤ)-150):=by unfold dv;rw[d,l,b,k,Int.cast_mul,Int.cast_natCast,mul_assoc] obtain ⟨n,i⟩:=Fy (dv x) _ f e _ _ (by rw[Int.natAbs_mul,Int.natAbs_natCast];have:=Nat.mul_le_mul_left (2^23+Ѡx%2^23) c omega) א (by rw[o];exact (Ec x hx).trans Cq) h show dv x*pw.uget _ _*_=dv x*(_*pw.uget _ _);rw[p];exact Qo _ _ _ e j (Df _ f).1 n q i g end section section open Float.Model Float.Model.UnpackedFloat lemma Ks (H a b:ћ) (hb:b< H):(H*a+b)/H=a∧(H*a+b)%H=b:=by have c:0< H:=א;constructor;. rw[ل c,о hb,ы] . rw[م,Й hb] lemma Jb (t:Int):Format.binary32.targetExponent t=max (t-24) (-149):=by simp[Format.targetExponent,Format.mantissaBits,Format.minExponent] lemma Mx (a b:ℤ) (n:ℕ) (h:a=n+b):(2:ℝ)^a=2^n*2^b:=by rw[h,б Х,ь] lemma Fx (m L:ћ) (h1:2^L<=m) (h2:m<2^(L+1)):m.log2=L:=(Nat.log2_eq_iff (by have:=Nat.two_pow_pos L;omega)).2 ⟨h1,h2⟩ lemma Fc (M:ћ) (e T:Int) (K r:ћ) (d:T=e+(K+1:ћ)) (c:0< r) (f:2*(r*2^K)< M+2^K) (g:M<2*(r*2^K)+2^K):Model.roundMantissaAtExponentEven M e T=r:=by have b:r <<< (K+1)=2*(r*2^K):=by rw[ذ,Nat.pow_succ];ring have a:Model.pow2 (K+1-1)=2^K:=Model.pow2_eq_two_pow K;rw[Model.roundMantissaAtExponentEven,з א,show (T-e).toNat=K+1 by omega];rcases le_total (2*(r*2^K)) M with h | h;. have:=Model.roundShiftRightEven_shiftLeft_add_of_lt_half r (M-2*(r*2^K)) (K+1) א (by rw[a];omega);rwa [b,Nat.add_sub_cancel' h] at this . have:=Model.roundShiftRightEven_shiftLeft_sub_of_lt_half r (2*(r*2^K)-M) (K+1) c א (by rw[a];omega);rwa [b,Nat.sub_sub_self h] at this lemma Ey (s:Sign) (P:ћ) (E:Int) (h1:2^23<=P) (h2:P<2^24) (hE:-149<=E) (hp:0< P):Model.finishRoundedMantissa Format.binary32 s (P,E)=.finite s P E hp:=by have:=Model.finishRoundedMantissa_normalized FloatFormat.binary32 s P (E+23) h1 h2 (by show -126<=E+23;omega) rwa [show E+23-(FloatFormat.binary32.fracWidth:ℤ)=E from Int.add_sub_cancel E 23] at this lemma Mb (neg:ј) (m:ћ) (e:Int): Я Fmt ⟨neg,m,e⟩ =Model.ofModel Fmt (UnpackedFloat.round Format.binary32 (н neg) m e):=by simp[Model.roundDyadic,Model.ieeeRoundDyadic] rfl lemma Lw (s:Sign) (M:ћ) (E:Int) (h:0< M) (hM1:2^23<=M) (Mq:M<2^24) (Mn:1<=E+150) (hb2:E+150<=254): (UnpackedFloat.pack Format.binary32 (.finite s M E h)).toNat=(if s=.negative then 2^31 else 0)+(E+150).toNat*2^23+M%2^23:=by simp only[UnpackedFloat.pack,Fx M 23 hM1 Mq] rw[show (E+↑Format.binary32.exponentBias + ↑Format.binary32.mantissaBitsWithoutImplicit).toNat=(E+150).toNat by simp only[Format.exponentBias];norm_num;ring_nf] have c:¬ (2^Format.binary32.exponentBits<=(E+150).toNat+1):=by show ¬ (2^8<=(E+150).toNat+1);omega have a:(23+1=Format.binary32.mantissaBits):=rfl have b:s.toBitVec.toNat=if s=.negative then 1 else 0:=by cases s<;>rfl simp only[c,ite_false,a,ite_true,packComponents,BitVec.toNat_append,b,BitVec.toNat_ofNat] rw[Й (by omega:(E+150).toNat<2^8), <-Nat.shiftLeft_add_eq_or_of_lt (by omega:(E+150).toNat<2^8), <-Nat.shiftLeft_add_eq_or_of_lt (п _ ו:M%2^23<2^23)] split_ifs<;>simp[Nat.shiftLeft_eq] omega lemma On (neg:ј) (m:ћ) (e:Int) (P:ћ) (E:Int) (hm:m≠0) (Mp:2^23<=P) (Mo:P<2^24) (hE:-149<=E) (hE2:E+150<=254) (Bs:2*((m:ℝ)*2^e)<(2*P+1)*2^E) (Dt:P≠2^23->(2*P-1)*2^E<2*((m:ℝ)*2^e)) (Dr:P=2^23->33554431*2^E<4*((m:ℝ)*2^e)): toWord (Я Fmt ⟨neg,m,e⟩)=э ((if neg then 2^31 else 0)+(E+150).toNat*2^23+P%2^23):=by have l:0< P:=א obtain ⟨k,F⟩:∃ k:ћ,e-E+2<=k:=⟨(e-E+2).toNat,by omega⟩ obtain ⟨g,z⟩:∃ g:ћ,(e-k)+(g+2:ћ)=E:=⟨(E-(e-k)-2).toNat,by omega⟩ have u:(0:ℝ)<2^(e-k):=щ two_pos _ have s:(m:ℝ)*2^e=((m*2^k:ћ):ℝ)*2^(e-k):=by push_cast rw[mul_assoc,<-Mx e _ k א] have i:(2:ℝ)^E=4*((2^g:ћ):ℝ)*2^(e-k):=by rw[Mx E (e-k) (g+2) א] push_cast ring rw[Mb,<-ExactRuntime.round_scale _ _ m e k hm] have p:m*2^k≠0:=Nat.mul_ne_zero hm ו rw[s,i] at Bs rw[s,i] at Dt Dr have H:0<2^g:=by positivity generalize m*2^k=M at * generalize e-k=q at * generalize (2:ℝ)^q=b at * have f:∀ A B:ℕ,(A:ℝ)*b< B*b->A< B:=λA B h=>by exact_mod_cast lt_of_mul_lt_mul_right h u.le push_cast at Bs Dt Dr have G:M<4*(P*2^g)+2*2^g:=f _ _ (by push_cast;linarith) have t:P≠2^23->4*(P*2^g)< M+2*2^g:=λh=>f _ _ (by push_cast;linarith [Dt h]) have y:P=2^23->33554431*2^g< M:=λh=>f _ _ (by push_cast;linarith [Dr h]) have C:P*2^g<=(2^24-1)*2^g:=Н _ א have r:2*(P*2^(g+1))=4*(P*2^g):=by rw[Nat.pow_succ];ring have n:2^(g+1)=2*2^g:=by rw[Nat.pow_succ];ring have w:UnpackedFloat.round Format.binary32 (н neg) M q=.finite (н neg) P E l:=by rw[Model.round_exact_eq_finishRoundedMantissa _ _ _ _ p] have o:∀ (L:ℕ) (T:ℤ),2^L*2^g<=M->M<2^L*2^g*2 → max (((L+g:ℕ):ℤ)+1+q-24) (-149)=T → Format.binary32.targetExponent (totalExponent M q)=T:=λL T a c d=>by rw[<-Nat.pow_add] at a c simp only[totalExponent,Fx M _ a c,Jb];exact d by_cases v:2^25*2^g<=M . rw[o 25 E v א א,Fc M q E (g+1) P א l ?_ (by rw[r,n];omega)];. exact Ey _ P E Mp Mo hE l . rw[r,n];by_cases j:P=2^23;. subst j;omega . have:=t j;omega have j:P=2^23:=by by_contra Ei have:=t Ei have:(2^23+1)*2^g<=P*2^g:=Н _ א omega have D:=y j subst j by_cases x:-148<=E . rw[o 24 (E-1) א א א,Fc M q (E-1) g (2^24) א ב א א];have:=Model.finishRoundedMantissa_normalized_carry FloatFormat.binary32 (н neg) (E-1+23) (by show -126<=E-1+23;omega);rw[show (FloatFormat.binary32.fracWidth:ℤ)=23 from rfl] at this;rwa [(א:E-1+23-23=E-1),(א:E-1+23+1-23=E)] at this . rw[o 24 E א א א,Fc M q E (g+1) (2^23) א ב (by rw[n];omega) (by rw[n];omega)];exact Ey _ _ E ב ב hE l rw[w] simp only[toWord,Model.toNatBits,Model.ofModel,Model.ofModelBits] congr 1 show (UnpackedFloat.pack Format.binary32 _).toNat=_ rw[Lw _ _ _ _ Mp Mo א א] cases neg<;>simp[Model.modelSign] end abbrev B_D:=ExecFloat.Binary.format (exponentBits:=11) (fractionBits:=52) lemma Nj (f:ѕ):Model.signBit (toModel (ofFloat f))=decide (2^63<=f.toBits.toNat):=by rw[Model.signBit_eq_msb];show f.toBits.toBitVec.msb=_;rw[BitVec.msb_eq_decide];rfl lemma El (f:ѕ) (s:ј) (E F:ћ) (Mt:1<=E) (hE:E<2047) (hF:F<2^52) (h:f.toBits.toNat=(if s then 2^63 else 0)+E*2^52+F): f.isFinite=true ∧ R f=(if s then -1 else 1)*((2^52+F:ћ):ℝ)*2^((E:Int)-1075):=by have g:Model.expField (toModel (ofFloat f))=f.toBits.toNat/2^52%2^11:=by show ((f.toBits.toBitVec >>> 52) &&& BitVec.ofNat 64 2047).toNat=_ rw[BitVec.toNat_and,BitVec.toNat_ushiftRight,BitVec.toNat_ofNat,ص] exact Е _ 11 have e:Model.fracField (toModel (ofFloat f))=f.toBits.toNat%2^52:=by show (f.toBits.toBitVec &&& BitVec.ofNat 64 (2^52-1)).toNat=_ rw[BitVec.toNat_and,BitVec.toNat_ofNat] exact Е _ 52 have i:Model.signBit (toModel (ofFloat f))=s:=(Nj f).trans (by cases s<;>simp at h ⊢<;>omega) have c:=Model.ofFields_signBit_expField_fracField (toModel (ofFloat f)) rw[g,e,i,show f.toBits.toNat/2^52%2^11=E by split at h<;>omega,show f.toBits.toNat%2^52=F by split at h<;>omega] at c have b:E<2^11:=א have a:ъ (Model.ofFields B_D s E F)=true:=by rw[Model.isFinite_ofFields B_D _ _ _ b hF] show (E != 2047)=true simp;omega have d:=Model.toDyadic?_ofFields_of_isFinite B_D _ _ _ b hF a rw[c,г (א:¬ E=0)] at d rw[c] at a refine ⟨(Cg f).symm.trans a,?_⟩ rw[R,Model.toReal_eq,d] simp only[show Model.pow2 B_D.fracWidth=2^52 from rfl, show Int.ofNat E-Int.ofNat B_D.exponentBias-Int.ofNat B_D.fracWidth=(E:ℤ)-1075 by show (E:ℤ)-1023-52=_;omega] cases s<;>simp[FloatLib.Numerics.Dyadic.toReal,signedSignificand] def B_near (A:ћ) (S:ј) (ex fr:ћ):Prop:= ∃ M,A=(if S then 2^63 else 0)+M∧(ex*2^23+fr)*2^29< M+2^28 ∧ M<=(ex*2^23+fr)*2^29+2^28 lemma My (A:і) (x:і) (hx:(A+0x0FFFFFFF) >>> 29=x) (h1:897<=Ѡx/2^23%2^11) (h2:Ѡx/2^23%2^11<1151): Ѡx<2^35∧B_near ѠA (decide (2^34<=Ѡx)) (Ѡx/2^23%2^11) (Ѡx%2^23):=by have a:=A.toNat_lt have e:Ѡx=(ѠA+268435455)%2^64/2^29:=by rw[<-hx,У,Т] norm_num [Nat.shiftRight_eq_div_pow] refine ⟨by omega,?_⟩ unfold B_near by_cases h:2^34<=Ѡx . simp only[h,decide_true,ite_true];exact ⟨ѠA-2^63,by omega,by omega,by omega⟩ . simp only[h,decide_false,false_eq_true,ite_false];exact ⟨ѠA,by omega,by omega,by omega⟩ lemma Fp (x:і) (hx:Ѡx<2^35) (h1:897<=Ѡx/2^23%2^11) (h2:Ѡx/2^23%2^11<1151): (((x >>> 34) <<< 31) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< 23))).toUInt32= э ((if decide (2^34<=Ѡx) then 2^31 else 0) + (Ѡx/2^23%2^11-896)*2^23+Ѡx%2^23):=by have b:((x >>> 34) <<< 31).toNat=(Ѡx/2^34)*2^31:=by rw[UInt64.toNat_shiftLeft,У] norm_num [Nat.shiftRight_eq_div_pow,Nat.shiftLeft_eq] omega have a:(x &&& (0x3FFFFFFFF:і)).toNat=Ѡx%2^34:=by rw[с] exact Е _ 34 have d:((x &&& (0x3FFFFFFFF:і))-((896:і) <<< 23)).toNat=Ѡx%2^34-896*2^23:=by rw[show ((896:і) <<< 23)=7516192768 by decide,toNat_sub_of_le,a] . rfl . rw[П,a];norm_num;omega have c:(Ѡx/2^34)*2^31 ||| (Ѡx%2^34-896*2^23)=(Ѡx/2^34)*2^31+(Ѡx%2^34-896*2^23):=by rw[ж (Ѡx/2^34)] exact (Nat.two_pow_add_eq_or_of_lt א _).symm apply Ч.mp rw[UInt64.toNat_toUInt32,UInt64.toNat_or,b,d,c,ю] simp only[decide_eq_true_eq] split_ifs<;>omega lemma Fd (A B:і) (h:zivW A B≠Д): ∃ (S:ј) (ex fr:ћ),897<=ex∧ex<1151∧fr<2^23 ∧ zivW A B=э ((if S then 2^31 else 0)+(ex-896)*2^23+fr) ∧ B_near ѠA S ex fr∧B_near ѠB S ex fr:=by unfold zivW at h ⊢ dsimp only at h ⊢ generalize hx:(A+(0x0FFFFFFF:і)) >>> (29:і)=x at h ⊢ generalize hy:(B+(0x0FFFFFFF:і)) >>> (29:і)=y at h ⊢ have To:((x >>> (23:і)) &&& (0x7FF:і)).toNat=Ѡx/2^23%2^11:=by rw[с,У] have:=Е (Ѡx >>> 23) 11 norm_num [Nat.shiftRight_eq_div_pow] at this ⊢ exact this generalize (x >>> (23:і)) &&& (0x7FF:і)=ex at h To ⊢ split at h . rename_i hc;have Dz:=hc;obtain ⟨Hg,hc⟩:=д.mp hc;have Hg:x=y:=by simpa using Hg subst Hg;have hc:ex-(897:і)<(254:і):=by simpa using hc rw[О,л] at hc;have hv:=ex.toNat_lt;norm_num at hc hv;have h1:897<=Ѡx/2^23%2^11:=א;have h2:Ѡx/2^23%2^11<1151:=א;simp only[Dz,ite_true];obtain ⟨hx35,ha⟩:=My A x hx h1 h2;exact ⟨_,_,_,h1,h2,by omega,Fp x hx35 h1 h2,ha,(My B x hy h1 h2).2⟩ . exact absurd rfl h lemma Lg (s e:ѕ) (h:ziv s e≠Д): ∃ (S:ј) (ex fr:ћ),897<=ex∧ex<1151∧fr<2^23 ∧ ziv s e=э ((if S then 2^31 else 0)+(ex-896)*2^23+fr) ∧ B_near (s+e).toBits.toNat S ex fr∧B_near (s-e).toBits.toNat S ex fr:= Fd (s+e).toBits (s-e).toBits h set_option maxRecDepth 8192 in lemma Fg (f:ѕ) (S:ј) (ex fr:ћ) (h1:897<=ex) (h2:ex<1151) (Ek:fr<2^23) (hn:B_near f.toBits.toNat S ex fr): f.isFinite=true∧∃ v:ℝ,R f=(if S then -v else v) ∧ v<=(2^53+fr*2^30+2^29)*2^((ex:Int)-1076) ∧ (fr≠0->(2^53+fr*2^30-2^29)*2^((ex:Int)-1076)< v) ∧ (2^53-2^28)*2^((ex:Int)-1076)< v:=by obtain ⟨M,k,o,n⟩:=hn have d:M%2^52<2^52:=п _ ב have b:M=(M/2^52)*2^52+M%2^52:=א generalize M/2^52=E at b generalize M%2^52=F at b d subst b have c:(0:ℝ)<2^((ex:Int)-1076):=щ ב _ have m:E=ex∨(E+1=ex∧fr=0):=א obtain ⟨a,l⟩:=El f S E F א א d (by rw[k,Ю]) obtain ⟨w,j,i,e,g⟩:∃ w:ℕ,((2^52+F:ћ):ℝ)*2^((E:Int)-1075)=w*2^((ex:Int)-1076)∧w<=2^53+fr*2^30+2^29 ∧ (fr≠0->2^53+fr*2^30< w+2^29)∧2^53< w+2^28:=by rcases m with rfl | ⟨rfl,rfl⟩ . refine ⟨2*(2^52+F),?_,by omega,by omega,by omega⟩;rw[show (E:Int)-1075=1+((E:Int)-1076) by ring,б Х,zpow_one];push_cast;ring . exact ⟨2^52+F,by congr 2;push_cast;ring,by omega,by omega,by omega⟩ refine ⟨a,(w:ℝ)*2^((ex:Int)-1076),?_,Г ?_ c.le,λh=>Ь ?_ c,Ь ?_ c⟩ . rw[l,mul_assoc,j];cases S<;>simp . exact_mod_cast i . rw[sub_lt_iff_lt_add];exact_mod_cast e h . rw[sub_lt_iff_lt_add];exact_mod_cast g lemma Fh (s e:ѕ) (h:ziv s e≠Д):(s+e).isFinite=true∧(s-e).isFinite=true∧(2:ℝ)^(-127:ℤ) ≤ |R (s+e)|:=by obtain ⟨S,f,c,b,d,a,-,j,k⟩:=Lg s e h;obtain ⟨g,v,i,-,-,l⟩:=Fg _ S f c b d a j;refine ⟨g,(Fg _ S f c b d a k).1,?_⟩ exact (show (2:ℝ)^(-127:ℤ)<=(2^53-2^28)*2^(-179:ℤ) by norm_num).trans ((Ц (Ф one_le_two א) ב).trans (l.le.trans (by rw[i];cases S<;>simp[le_abs_self]))) lemma Fi (w:ѓ) (h:expOf w≠255):wv w=(М w:ℝ):=by rw[wv,Model.toReal_eq,ofW,а w h];simp only[rationalWord,FloatLib.Numerics.Dyadic.cast_toRat] lemma Rs (a b:ѐ) (start n:ћ): (dsum a b start n:ℚ)*2^(-298:Int)=∑ j∈т n,М a[start+j]! * М b[start+j]!:=by have c:∀ a b:ѓ,((sv a:ℚ)*sv b*(2:ℚ)^(idxOf a+idxOf b))*2^(-298:Int)=М a*М b:=λa b=>by simp only[rationalWord,decodeD_toRat] rw[show (-298:Int)=-149+-149 by norm_num,б Х] rw[ى Х,ى Х,ь,ь,pow_add] norm_num [zpow_neg,zpow_natCast] ring induction n generalizing start with | zero=>simp[dsum] | succ n ih=> rw[dsum,Int.cast_add,Int.cast_mul,Int.cast_mul,Int.cast_pow,Int.cast_ofNat,add_mul,ih,Finset.sum_range_succ',ы,c,add_comm] congr 1 apply ش rfl intro j _ rw[Ю,Nat.add_comm 1 j] lemma Fk (n:ћ) (fa fb:ћ->ѓ) (hf:∀ j,j< n->expOf (fa j)≠255∧expOf (fb j)≠255) (hn:(∑ j∈т n,М (fa j)*М (fb j))≠0): ∃ d:FloatLib.Numerics.Dyadic, d.toRat=(∑ j∈т n,М (fa j)*М (fb j)) ∧ dotOf n fa fb=toWord (Я Fmt d):=by let a:=Array.ofFn (n:=n) λi=>fa i let b:=Array.ofFn (n:=n) λi=>fb i have e:ѡa=n:=by simp[a] have g:ѡb=n:=by simp[b] have c:(dsum a b 0 n:ℚ)*2^(-298:Int)=∑ j∈т n,М (fa j)*М (fb j):=by rw[Rs] refine ش rfl λj m=>?_ have h:=ؾ.mp m rw[З,Ba n fa j h,Ba n fb j h] have l:dsum a b 0 n≠0:=λh=>hn (by rw[<-c,h];simp) have Z:=Jw a b (by rw[e,g]) λk f=>by rw[e] at f rw[Ba n fa k f,Ba n fb k f];exact hf k f rw[e] at Z refine ⟨ofIntDyadic (dsum a b 0 n) (-298),by rw[toRat_ofIntDyadic,c],?_⟩ show dotSpec a b=_ rw[<-Z];simp[finishWord,l] lemma Jk:М oneW=1:=by norm_num [rationalWord,decodeD,show expOf oneW=127 by decide,show fracOf oneW=0 by decide,show signOf oneW=false by decide,FloatLib.Numerics.Dyadic.toRat,signedSignificand] lemma Jm (n:ћ) (xw ww:ћ->ѓ) (bw:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true): ((∑ j∈т (n+1),М (if j< n then xw j else oneW) * М (if j< n then ww j else bw):ℚ):ℝ)=exactS n xw ww bw:=by rw[Finset.sum_range_succ] simp only[lt_self_iff_false,ite_false,Jk,one_mul] rw[Rat.cast_add,Rat.cast_sum,exactS,Fi bw (Do bw hb)] congr 1 refine ش rfl λt b=>?_ have a:=ؾ.mp b simp only[a,ite_true] rw[Fi _ (Do _ (hx t a)),Fi _ (Do _ (hw t a)),Rat.cast_mul] section variable (s e:ѕ) (V:ℝ) (Bv:R (s-e)< V) (Bs:V< R (s+e)) (h:ziv s e≠Д) include s e V Bv Bs h lemma Ju: ∃ (S:ј) (ex fr:ћ) (W:ℝ),897<=ex∧ex<1151∧fr<2^23 ∧ ziv s e=э ((if S then 2^31 else 0)+(ex-896)*2^23+fr) ∧ V=(if S then -W else W) ∧ W<(2^53+fr*2^30+2^29)*2^((ex:Int)-1076) ∧ (fr≠0->(2^53+fr*2^30-2^29)*2^((ex:Int)-1076)< W) ∧ (2^53-2^28)*2^((ex:Int)-1076)< W:=by obtain ⟨S,ex,fr,h1,h2,h3,hz,ha,hb'⟩:=Lg s e h obtain ⟨-,va,hva,hia,loa1,loa⟩:=Fg _ S ex fr h1 h2 h3 ha obtain ⟨-,vb,hvb,hib,lob1,lob⟩:=Fg _ S ex fr h1 h2 h3 hb' rw[hva] at Bs rw[hvb] at Bv refine ⟨S,ex,fr,if S then -V else V,h1,h2,h3,hz,?_,?_,?_,?_⟩ all_goals cases S all_goals simp only[false_eq_true,ite_false,ite_true,neg_neg] at Bs Bv ⊢ . exact lt_of_lt_of_le Bs hia . linarith . exact λh=>(lob1 h).trans Bv . exact λh=>by linarith [loa1 h] . exact lob.trans Bv . linarith lemma Ie:V≠0:=by obtain ⟨S,ex,fr,W,-,-,-,-,hV,-,-,Er⟩:=Ju s e V Bv Bs h;have Dc:(0:ℝ)<2^((ex:Int)-1076):=щ ב _;have hA:(0:ℝ)<=(2^53-2^28)*2^((ex:Int)-1076):=ч ב Dc.le;intro h0;rw[h0] at hV;cases S;. simp only[false_eq_true,ite_false] at hV;linarith . simp only[ite_true] at hV;linarith end lemma Fq (d:FloatLib.Numerics.Dyadic) (S:ј) (ex fr:ћ) (h1:897<=ex) (h2:ex<1151) (h3:fr<2^23) (W:ℝ) (hd:(d.toRat:ℝ)=if S then -W else W) (Et:W<(2^53+fr*2^30+2^29)*2^((ex:Int)-1076)) (Hp:fr≠0->(2^53+fr*2^30-2^29)*2^((ex:Int)-1076)< W) (Er:(2^53-2^28)*2^((ex:Int)-1076)< W): toWord (Я Fmt d)=э ((if S then 2^31 else 0)+(ex-896)*2^23+fr):=by have Dc:(0:ℝ)<2^((ex:Int)-1076):=щ ב _ have hE:(2:ℝ)^((ex:Int)-1046)=2^30*2^((ex:Int)-1076):=by rw[<-ь,<-б Х] congr 1;push_cast;ring have hW0:0< W:=lt_of_le_of_lt (ч ב Dc.le) Er obtain ⟨neg,m,q⟩:=d have Ml:(FloatLib.Numerics.Dyadic.mk neg m q).toReal=if S then -W else W:=by rw[<-й,hd] have hq:(0:ℝ)<2^q:=щ ב _ have Cy:(0:ℝ)<=m:=Ъ _ have hmq:=ч Cy hq.le have Eb:(m:ℝ)*2^q=W∧neg=S:=by simp only[FloatLib.Numerics.Dyadic.toReal,signedSignificand] at Ml cases neg<;>cases S <;> simp only[false_eq_true,ite_false,ite_true,Int.ofNat_eq_natCast,Int.cast_neg,Int.cast_natCast] at Ml . exact ⟨by linarith,rfl⟩ . exfalso;linarith . exfalso;linarith . exact ⟨by linarith,rfl⟩ obtain ⟨Eb,rfl⟩:=Eb have hm:m≠0:=by rintro rfl simp at Eb linarith have Ef:=On neg m q (2^23+fr) ((ex:Int)-1046) hm א א א א (by rw[Eb,hE];push_cast;linarith) (by intro Ek have hfr':fr≠0:=by intro h0;exact Ek א have:=Hp hfr' rw[Eb,hE];push_cast;linarith) (by intro _ rw[Eb,hE];linarith) have e1:((ex:Int)-1046+150).toNat=ex-896:=א have e2:(2^23+fr)%2^23=fr:=א rw[Ef,e1,e2] lemma Io (s e:ѕ) (d:FloatLib.Numerics.Dyadic) (Bv:R (s-e)<(d.toRat:ℝ)) (Bs:(d.toRat:ℝ)< R (s+e)) (h:ziv s e≠Д):ziv s e=toWord (Я Fmt d):=by obtain ⟨S,ex,fr,W,h1,h2,h3,hz,hV,Et,Hp,Er⟩:=Ju s e _ Bv Bs h;rw[hz];exact (Fq d S ex fr h1 h2 h3 W hV Et Hp Er).symm lemma Ge (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (s e:ѕ) (Bv:R (s-e)< exactS n xw ww bw) (Bs:exactS n xw ww bw< R (s+e)) (h:ziv s e≠Д): ziv s e=dotOf (n+1) (λt=>if t< n then xw t else oneW) (λt=>if t< n then ww t else bw):=by have Bx:=Jm n xw ww bw hx hw hb obtain ⟨d,hd,hw'⟩:=Fk (n+1) (λt=>if t< n then xw t else oneW) (λt=>if t< n then ww t else bw) (λj _=>by by_cases hj:j< n . simp only[hj,ite_true];exact ⟨Do _ (hx j hj),Do _ (hw j hj)⟩ . simp only[hj,ite_false] exact ⟨by decide,Do _ hb⟩) λh0=>Ie s e _ Bv Bs h (by rw[<-Bx,h0,Rat.cast_zero]) have q:(d.toRat:ℝ)=exactS n xw ww bw:=by rw[hd,Bx] rw[hw'] exact Io s e d (by rw[q];exact Bv) (by rw[q];exact Bs) h end section lemma Lr (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (l:љ) (hl:l.Nodup) (Bo:∀ t∈l,t< n) (hz:∀ t,t< n->t∉l->xw t &&& В=0∨ww t &&& В=0) (s e:ѕ) (hs:let r:=l.foldl (λ(acc:F1) t=>let q:=dv (xw t)*dv (ww t) F1.mk (acc.s+q) (acc.t+q.abs)) ⟨0,0⟩;s=r.s+dv bw∧e=nfOf n*(r.t+(dv bw).abs)) (h:ziv s e≠Д): ziv s e=dotOf (n+1) (λt=>if t< n then xw t else oneW) (λt=>if t< n then ww t else bw):=by obtain ⟨-,-,Bk⟩:=Fh s e h obtain ⟨Bv,Bs⟩:=Ma n hn xw ww bw hx hw hb l hl Bo hz s e hs Bk exact Ge n hn xw ww bw hx hw hb s e Bv Bs h lemma Sy (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw hh:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (hg:good hh=true) (hm:∀ t,t< n->xw t &&& В<=hh) (hp:hh<=В) (l:љ) (hl:l.Nodup) (Bo:∀ t∈l,t< n) (hz:∀ t,t< n->t∉l->xw t &&& В=0∨ww t &&& В=0) (s e:ѕ) (hs:s=l.foldl (λ(acc:ѕ) t=>acc+dv (xw t)*dv (ww t)) 0+dv bw ∧ e=nfOf n*(dv hh*(l.foldl (λ(acc:ѕ) t=>acc+(dv (ww t)).abs) 0)+(dv bw).abs)) (h:ziv s e≠Д): ziv s e=dotOf (n+1) (λt=>if t< n then xw t else oneW) (λt=>if t< n then ww t else bw):=by obtain ⟨-,-,Bk⟩:=Fh s e h obtain ⟨Bv,Bs⟩:=Lu n hn xw ww bw hh hx hw hb hg hm hp l hl Bo hz s e hs Bk exact Ge n hn xw ww bw hx hw hb s e Bv Bs h end section lemma Pl (A P Q T g:ћ) (hg:g=0∨g=2^63) (ha:A<2^64) (e1:(A+1048576)%2^64=g+P) (e2:(2^64-1048576+A)%2^64=g+Q) (t1:2^61<=T) (t2:T<2^63-2^60) (l1:T< P+2^28) (u1:P<=T+2^28) (l2:T< Q+2^28) (u2:Q<=T+2^28): A=g+(Q+1048576)∧T+1048576< Q+1048576+2^28 ∧ Q+1048576+1048576<=T+2^28:=by omega lemma Ob (G f F:ћ) (hl:G+f+1048576< G+F+2^28) (hu:G+F+1048576<=G+f+2^28):F+1048576<=f+2^28∧f+1048576< F+2^28:=by omega lemma Jp (th:і) (s:ѕ) (h:zivT th s≠Д): th<=s.toBits <<< (1:і)∧∃ (S:ј) (ex fr M:ћ),897<=ex∧ex<1151∧fr<2^23 ∧ zivT th s=э ((if S then 2^31 else 0)+(ex-896)*2^23+fr) ∧ s.toBits.toNat=(if S then 2^63 else 0)+M ∧ (ex*2^23+fr)*2^29+1048576< M+2^28 ∧ M+1048576<=(ex*2^23+fr)*2^29+2^28:=by unfold zivT at h ⊢ dsimp only at h ⊢ split at h . rename_i ht;rw[е ht];refine ⟨ht,?_⟩;obtain ⟨S,ex,fr,h1,h2,h3,hz,⟨P,e1,l1,u1⟩,⟨Q,e2,l2,u2⟩⟩:=Fd _ _ h;rw[Т] at e1;rw[л] at e2;obtain ⟨a,b,c⟩:=Pl _ P Q ((ex*2^23+fr)*2^29) _ (by cases S<;>simp) s.toBits.toNat_lt e1 e2 א א l1 u1 l2 u2;exact ⟨S,ex,fr,Q+1048576,h1,h2,h3,hz,a,b,c⟩ . exact absurd rfl h lemma Nz (v W z u:ℝ) (hu:0< u) (hz:z<=u) (h0:0<=v) (hv:v<=2^53*u) (h:|v-W| ≤ 1/2^34*(|W| + z)):v-2^20*u< W∧W< v+2^20*u:=by have h1:|W| ≤ v + |v-W|:=by have a:=С W v;rw[abs_sub_comm W v,и h0] at a;linarith have h2:=abs_lt.mp (ד:|v-W| < 2^20*u);constructor<;>linarith [h2.1,h2.2] set_option maxRecDepth 8192 in lemma Nh (ex fr E F:ћ) (h1:897<=ex) (h2:ex<1151) (Ek:fr<2^23) (hF:F<2^52) (hl:(ex*2^23+fr)*2^29+1048576< E*2^52+F+2^28) (hu:E*2^52+F+1048576<=(ex*2^23+fr)*2^29+2^28) (W:ℝ) (h:|((2^52+F:ћ):ℝ)*2^((E:Int)-1075)-W| ≤ 1/2^34*(|W| + A_z)): W<(2^53+fr*2^30+2^29)*2^((ex:Int)-1076) ∧ (fr≠0->(2^53+fr*2^30-2^29)*2^((ex:Int)-1076)< W) ∧ (2^53-2^28)*2^((ex:Int)-1076)< W:=by have hE:E=ex∨(E+1=ex∧fr=0):=א have Cv:(0:ℝ)<2^((E:Int)-1075):=щ ב _ have hz:A_z<=2^((E:Int)-1075):=by have e:A_z=2^(-1021:ℤ):=rfl rw[e] exact Ф ב א have hN:((2^52+F:ћ):ℝ)<=2^53:=by have:2^52+F<=2^53:=א exact_mod_cast this have Hy:(0:ℝ)<=((2^52+F:ћ):ℝ):=Ъ _ obtain ⟨a,b⟩:=Nz _ W A_z _ Cv hz (ч Hy Cv.le) (Г hN Cv.le) h push_cast at a b rcases hE with rfl | ⟨rfl,rfl⟩ . have e:(2:ℝ)^((E:Int)-1075)=2*2^((E:Int)-1076):=by rw[show (E:Int)-1075=1+((E:Int)-1076) by ring,б Х,zpow_one] rw[e] at a b;have hb:(0:ℝ)<2^((E:Int)-1076):=щ ב _;generalize (2:ℝ)^((E:Int)-1076)=c at a b hb ⊢;have e1:(E*2^23+fr)*2^29=E*2^52+fr*2^29:=by ring rw[e1] at hl hu;obtain ⟨n3,n4⟩:=Ob _ _ _ hl hu;have h3:(F:ℝ)+1048576<=fr*2^29+2^28:=by exact_mod_cast n3 have h4:(fr:ℝ)*2^29+1048576< F+2^28:=by exact_mod_cast n4 have h5:(0:ℝ)<=F:=Ъ _;have h6:(0:ℝ)<=fr:=Ъ _;have h7:=Г h3 hb.le;have h8:=Ь h4 hb;have h9:=ч h5 hb.le;have Dx:=ч h6 hb.le;refine ⟨?_,?_,?_⟩;. linarith . intro _;linarith . linarith . have e:(2:ℝ)^(((E+1:ћ):Int)-1076)=2^((E:Int)-1075):=by congr 1;push_cast;ring rw[e];generalize (2:ℝ)^((E:Int)-1075)=c at a b Cv ⊢;have h3:(F:ℝ)<=2^52:=by exact_mod_cast hF.le have h4:(2:ℝ)^52+1048576< F+2^28:=by exact_mod_cast (by omega:2^52+1048576< F+2^28) have h7:=Г h3 Cv.le;have h8:=Ь h4 Cv;refine ⟨?_,?_,?_⟩;. simp only[Nat.cast_zero,zero_mul,add_zero];linarith . intro h0;exact absurd rfl h0 . linarith lemma Oz (th:і) (s:ѕ) (d:FloatLib.Numerics.Dyadic) (hV:|R s-(d.toRat:ℝ)| ≤ 1/2^34*(|(d.toRat:ℝ)| + A_z)) (h:zivT th s≠Д):zivT th s=toWord (Я Fmt d):=by obtain ⟨-,S,ex,fr,M,h1,h2,h3,hz,hb,hl,hu⟩:=Jp th s h;have hM:M=(M/2^52)*2^52+M%2^52:=א;have hF:M%2^52<2^52:=п _ ב;generalize M/2^52=E at hM;generalize M%2^52=F at hM hF;subst hM;obtain ⟨-,hR⟩:=El s S E F א א hF (by rw[hb,Ю]);rw[hR] at hV obtain ⟨W,hVW,hW⟩:∃ W:ℝ,(d.toRat:ℝ)=(if S then -W else W) ∧ |((2^52+F:ћ):ℝ)*2^((E:Int)-1075)-W| ≤ 1/2^34*(|W| + A_z):=by cases S . simp only[false_eq_true,ite_false,one_mul] at hV ⊢;exact ⟨_,rfl,hV⟩ . simp only[ite_true] at hV ⊢;refine ⟨-(d.toRat:ℝ),by simp,?_⟩;rw[abs_neg,show ((2^52+F:ћ):ℝ)*2^((E:Int)-1075) - -(d.toRat:ℝ)=-(-1*((2^52+F:ћ):ℝ)*2^((E:Int)-1075)-(d.toRat:ℝ)) by ring,abs_neg];exact hV obtain ⟨a,b,c⟩:=Nh ex fr E F h1 h2 h3 hF א א W hW;rw[hz];exact (Fq d S ex fr h1 h2 h3 W hVW a b c).symm lemma Nk (x:і):((x >>> (52:і)) &&& (0x7FF:і)).toNat=Ѡx/2^52%2^11:=by rw[с,У];have:=Е (Ѡx >>> 52) 11;norm_num [Nat.shiftRight_eq_div_pow] at this ⊢;exact this lemma Jh (b:ј) (x y:ℝ) (hx:0<=x) (hy:0<=y): |(if b=true then (-1:ℝ) else 1)*x*y| = x*y:=by have h:=и (ч hx hy) cases b . rw[show (if false=true then (-1:ℝ) else 1)*x*y=x*y by simp];exact h . rw[show (if true=true then (-1:ℝ) else 1)*x*y=-(x*y) by simp,abs_neg];exact h lemma Ns (a:і) (S:ј) (M:ћ) (hM:M<2^63) (h:Ѡa=(if S then 2^63 else 0)+M):(a <<< (1:і)).toNat=2*M:=by rw[UInt64.toNat_shiftLeft,h];norm_num [Nat.shiftLeft_eq];cases S<;>simp<;>omega lemma Pv (e s:ѕ) (S:ј) (M:ћ) (Mq:M<2047*2^52) (hs:s.toBits.toNat=(if S then 2^63 else 0)+M) (h:thOf e<=s.toBits <<< (1:і)):e.isFinite=true∧|R e| ≤ 1/2^36 * |R s|:=by have hl:=Ns s.toBits S M א hs;unfold thOf at h;dsimp only at h;have hx:=Nk e.toBits;generalize (e.toBits >>> (52:і)) &&& (0x7FF:і)=E at h hx;rw[П,hl] at h;split at h . rename_i hc;rw[О,л] at hc;rw[UInt64.toNat_shiftLeft,Т] at h;have hA:=e.toBits.toNat_lt;norm_num [Nat.shiftLeft_eq] at hc h hA;obtain ⟨sg,hsg⟩:∃ sg:ј,e.toBits.toNat=(if sg then 2^63 else 0)+ѠE*2^52+e.toBits.toNat%2^52:=by refine ⟨decide (2^63<=e.toBits.toNat),?_⟩;by_cases h6:2^63<=e.toBits.toNat<;>simp only[h6,decide_true,decide_false,ite_true,ite_false,false_eq_true]<;>omega have Ms:e.toBits.toNat%2^52<2^52:=п _ ב;generalize e.toBits.toNat%2^52=Fe at hsg Ms;have Mt:1<=ѠE∧ѠE<=1900:=א;have Ia:M=(M/2^52)*2^52+M%2^52:=א;have Mr:M%2^52<2^52:=п _ ב;generalize M/2^52=Es at Ia;generalize M%2^52=Fs at Ia Mr;subst Ia;have Ej:ѠE+37<=Es:=א;obtain ⟨fe,re⟩:=El e sg ѠE Fe Mt.1 א Ms hsg;obtain ⟨-,rs⟩:=El s S Es Fs א א Mr (by rw[hs,Ю]);refine ⟨fe,?_⟩;have Dz:(0:ℝ)<2^((ѠE:Int)-1075):=щ ב _;have h1:(2:ℝ)^((ѠE:Int)+37-1075)<=2^((Es:Int)-1075):=Ф ב א;have h2:(2:ℝ)^((ѠE:Int)+37-1075)=2^37*2^((ѠE:Int)-1075):=by rw[show (ѠE:Int)+37-1075=37+((ѠE:Int)-1075) by ring,б Х];norm_num have Tr:|R e| = ((2^52+Fe:ћ):ℝ)*2^((ѠE:Int)-1075):=by rw[re];exact Jh _ _ _ (Ъ _) Dz.le have Tq:|R s| = ((2^52+Fs:ћ):ℝ)*2^((Es:Int)-1075):=by rw[rs];exact Jh _ _ _ (Ъ _) (щ ב _).le rw[Tr,Tq];have n1:((2^52+Fe:ћ):ℝ)<=2^53:=by have:2^52+Fe<=2^53:=א;exact_mod_cast this have n2:(2:ℝ)^52<=((2^52+Fs:ћ):ℝ):=by have:2^52<=2^52+Fs:=א;exact_mod_cast this generalize (2:ℝ)^((ѠE:Int)-1075)=c at *;generalize (2:ℝ)^((Es:Int)-1075)=d at *;rw[h2] at h1;have n3:=Г n1 Dz.le;have n0:0<=d:=ד;have n4:=Ц (Г n2 n0) (by norm_num:(0:ℝ)<=1/2^36);have n5:(2:ℝ)^53*c<=1/2^36*(2^52*d):=ד;exact n3.trans (n5.trans n4) . exfalso;norm_num at h;omega lemma Oy (s e:ѕ) (V:ℝ) (fs:s.isFinite=true) (fe:e.isFinite=true) (Cx:|R e| ≤ 1/2^36 * |R s|) (hB:|R s| ≤ 2^(130:ℤ)) (Bv:R (s-e)< V) (Bs:V< R (s+e)):|R s-V| ≤ 1/2^34*(|V| + A_z):=by have hA:(2:ℝ)^(130:ℤ)<=A_B:=by unfold A_B;exact Ф ב ב have h1:|R e| ≤ A_B:=by refine le_trans Cx (le_trans ?_ (hB.trans hA));have:=ф (R s);nlinarith [this] obtain ⟨-,p⟩:=Dn s e fs fe (hB.trans hA) h1;obtain ⟨-,m⟩:=Js s e fs fe (hB.trans hA) h1;have p2:=(ع.mp p).2;have m2:=(ع.mp m).1;have q1:=ن (R s) (R e);have q2:=abs_sub (R s) (R e);have a1:|R s| ≤ |V| + |R s-V|:=by have:=С (R s) V;linarith have a2:=le_abs_self (R e);have a3:=neg_abs_le (R e);have hz:(0:ℝ)<=A_z:=by unfold A_z;positivity have hQ:|R s-V| ≤ |R e| + 1/2^53*(|R s| + |R e| + A_z):=by rw[ع];constructor<;>linarith have h0:=ф (R s);linarith lemma Mu (T M:ћ) (h1:T+1048576< M+2^28) (h2:M+1048576<=T+2^28):T< M+2^28∧M<=T+2^28:=by omega set_option maxRecDepth 8192 in lemma Pm (e s:ѕ) (h:zivT (thOf e) s≠Д): s.isFinite=true∧e.isFinite=true∧|R e| ≤ 1/2^36 * |R s|∧|R s| ≤ 2^(130:ℤ) ∧ (2:ℝ)^(-127:ℤ) ≤ |R (s+e)|∧(2:ℝ)^(-127:ℤ) ≤ |R s|:=by obtain ⟨ht,S,ex,fr,M,h1,h2,h3,-,hbt,hl',hu'⟩:=Jp _ s h have Tg:B_near s.toBits.toNat S ex fr:=⟨M,hbt,(Mu _ _ hl' hu').1,(Mu _ _ hl' hu').2⟩ obtain ⟨fs,v,hv,hv1,-,hv3⟩:=Fg _ S ex fr h1 h2 h3 Tg obtain ⟨fe,Cx⟩:=Pv e s S M א hbt ht have Dc:(2:ℝ)^(-179:ℤ)<=2^((ex:Int)-1076):=Ф ב א have Mn:(2:ℝ)^((ex:Int)-1076)<=2^(74:ℤ):=Ф ב א have Tf:(0:ℝ)<2^(-179:ℤ):=щ ב _ have e179:(2:ℝ)^(-127:ℤ)=2^52*2^(-179:ℤ):=by rw[show (-127:ℤ)=52+(-179) by norm_num,б Х];norm_num have e130:(2:ℝ)^(130:ℤ)=2^56*2^(74:ℤ):=by rw[show (130:ℤ)=56+74 by norm_num,б Х];norm_num have Dz:(0:ℝ)<2^((ex:Int)-1076):=щ ב _ have hv0:(2^53-2^28:ℝ)*2^(-179:ℤ)<=v:=(Ц Dc ב).trans hv3.le have Ek:(fr:ℝ)<=2^23:=by exact_mod_cast h3.le have Tn:(0:ℝ)<=fr:=Ъ _ have hzs:A_z<=2^(-179:ℤ):=by have e':A_z=2^(-1021:ℤ):=rfl rw[e'];exact Ф ב ב generalize (2:ℝ)^(-179:ℤ)=u at * have Dd:0< v:=ד have Ea:|R s| = v:=by rw[hv];cases S . simp[abs_of_pos Dd] . simp[abs_of_pos Dd] have hF:(2^53+(fr:ℝ)*2^30+2^29)<=2^56:=ד have hB:|R s| ≤ 2^(130:ℤ):=by rw[Ea,e130] exact hv1.trans ((Г hF Dz.le).trans (Ц Mn ב)) have hA:(2:ℝ)^(130:ℤ)<=A_B:=by unfold A_B;exact Ф ב ב have hR:|R e| ≤ 1/2^36*v:=by rw[<-Ea];exact Cx have Tc:v<=A_B:=by rw[<-Ea];exact hB.trans hA have Bz:|R s| ≤ A_B:=by rw[Ea];exact Tc obtain ⟨-,p⟩:=Dn s e fs fe Bz (hR.trans ד) have q2:|R s| - |R e| ≤ |R s+R e|:=by have:=С (R s) (-R e) rwa [abs_neg,sub_neg_eq_add] at this have q1:=ن (R s) (R e) have q3:=С (R s+R e) (R (s+e)) rw[abs_sub_comm] at q3 rw[Ea] at q1 q2 refine ⟨fs,fe,Cx,hB,?_,?_⟩ . rw[e179];linarith [ф (R e)] . rw[Ea,e179];linarith lemma Oh (s:ѕ) (V:ℝ) (hV:|R s-V| ≤ 1/2^34*(|V| + A_z)) (h2:(2:ℝ)^(-127:ℤ) ≤ |R s|):V≠0:=by rintro rfl;rw[abs_zero,zero_add,sub_zero] at hV;have e':A_z=2^(-1021:ℤ):=rfl;have Ej:(2:ℝ)^(-1021:ℤ)<=2^(-127:ℤ):=Ф ב ב;have h0:(0:ℝ)<2^(-1021:ℤ):=щ ב _;rw[e'] at hV;linarith lemma St (n:ћ) (hn:n<2^20) (xw ww:ћ->ѓ) (bw hh:ѓ) (hx:∀ t,t< n->good (xw t)=true) (hw:∀ t,t< n->good (ww t)=true) (hb:good bw=true) (hg:good hh=true) (hm:∀ t,t< n->xw t &&& В<=hh) (hp:hh<=В) (l:љ) (hl:l.Nodup) (Bo:∀ t∈l,t< n) (hz:∀ t,t< n->t∉l->xw t &&& В=0∨ww t &&& В=0) (s e:ѕ) (hs:s=l.foldl (λ(acc:ѕ) t=>acc+dv (xw t)*dv (ww t)) 0+dv bw ∧ e=nfOf n*(dv hh*(l.foldl (λ(acc:ѕ) t=>acc+(dv (ww t)).abs) 0)+(dv bw).abs)) (h:zivT (thOf e) s≠Д): zivT (thOf e) s=dotOf (n+1) (λt=>if t< n then xw t else oneW) (λt=>if t< n then ww t else bw):=by obtain ⟨fs,fe,Cx,hB,Bk,hl2'⟩:=Pm e s h obtain ⟨Bv,Bs⟩:=Lu n hn xw ww bw hh hx hw hb hg hm hp l hl Bo hz s e hs Bk have hV:=Oy s e _ fs fe Cx hB Bv Bs have Bx:=Jm n xw ww bw hx hw hb have Ei:(∑ j∈т (n+1),М (if j< n then xw j else oneW) * М (if j< n then ww j else bw):ℚ)≠0:=by intro h0 rw[h0,Rat.cast_zero] at Bx exact Oh s _ hV hl2' Bx.symm obtain ⟨d,hd,hw'⟩:=Fk (n+1) (λt=>if t< n then xw t else oneW) (λt=>if t< n then ww t else bw) (by intro j _ have Hm:expOf oneW≠255:=by decide by_cases hj:j< n . simp only[hj,ite_true];exact ⟨Do _ (hx j hj),Do _ (hw j hj)⟩ . simp only[hj,ite_false] exact ⟨Hm,Do _ hb⟩) Ei rw[hw'] refine Oz _ s d ?_ h rw[hd,Bx] exact hV lemma Ky (lo t:і) (h:t-lo< spOf lo):lo<=t∧t<0x8FA0000000000000:=by unfold spOf at h;split at h<;>rename_i hl . have a:=lo.toNat_lt;have b:=t.toNat_lt;rw[О,л,л] at h;rw[О] at hl;norm_num at h hl a b;constructor;. rw[П];omega . rw[О];norm_num;omega . exact absurd h ג lemma Os (a:і) (h0:(0x7040000000000000:і)<=a <<< (1:і)) (h1:a <<< (1:і)<0x8FA0000000000000) (h2:(a+0x0FEFFFFF) &&& 0x1FFFFFFF<0x1FE00000): zivW (a+0x100000) (a-0x100000)=zivC ((a+0x0FEFFFFF) >>> (29:і)) ∧ zivC ((a+0x0FEFFFFF) >>> (29:і))≠Д:=by have ha:=a.toNat_lt have e0:(a <<< (1:і)).toNat=Ѡa*2%2^64:=by rw[UInt64.toNat_shiftLeft];norm_num [Nat.shiftLeft_eq] rw[П,e0] at h0 rw[О,e0] at h1 norm_num at h0 h1 ha have eu:(a+0x0FEFFFFF).toNat=Ѡa+267386879:=by rw[Т];norm_num;omega have em:((a+0x0FEFFFFF) &&& 0x1FFFFFFF).toNat=(Ѡa+267386879)%2^29:=by rw[с,eu] have:=Е (Ѡa+267386879) 29 norm_num at this ⊢ exact this rw[О,em] at h2 norm_num at h2 generalize hx:(a+0x0FEFFFFF) >>> (29:і)=x have ex:Ѡx=(Ѡa+267386879)/2^29:=by rw[<-hx,У,eu];norm_num [Nat.shiftRight_eq_div_pow] have e1:(a+0x100000+0x0FFFFFFF) >>> (29:і)=x:=by apply UInt64.toNat_inj.mp rw[ex,У,Т,Т] norm_num [Nat.shiftRight_eq_div_pow] omega have e2:(a-0x100000+0x0FFFFFFF) >>> (29:і)=x:=by apply UInt64.toNat_inj.mp rw[ex,У,Т,л] norm_num [Nat.shiftRight_eq_div_pow] omega have hE:((x >>> (23:і)) &&& (0x7FF:і)).toNat=Ѡx/2^23%2^11:=by rw[с,У] have:=Е (Ѡx >>> 23) 11 norm_num [Nat.shiftRight_eq_div_pow] at this ⊢ exact this have r1:898<=Ѡx/2^23%2^11:=by rw[ex];norm_num;omega have r2:Ѡx/2^23%2^11<1151:=by rw[ex];norm_num;omega have r3:Ѡx<2^35:=by rw[ex];norm_num;omega constructor . unfold zivW zivC;dsimp only;rw[e1,e2];have hc:((x >>> (23:і)) &&& (0x7FF:і))-(897:і)<(254:і):=by rw[О,л,hE];norm_num;norm_num at r1 r2;omega simp[hc] . unfold zivC;rw[show ((x >>> (34:і)) <<< (31:і)) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< (23:і)))=((x >>> 34) <<< 31) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< 23)) from rfl,Fp x r3 א r2];intro h;have h':=congrArg UInt32.toNat h;rw[ю] at h';have f:=п Ѡx (ב:0<2^23);split at h'<;>norm_num at h' f r1 r2<;>omega lemma Po (e s:ѕ) (h1:(s.toBits <<< (1:і))-loOf e< spOf (loOf e)) (h2:(s.toBits+0x0FEFFFFF) &&& 0x1FFFFFFF<0x1FE00000): zivT (thOf e) s=zivC ((s.toBits+0x0FEFFFFF) >>> (29:і)) ∧ zivT (thOf e) s≠Д:=by obtain ⟨l1,l2⟩:=Ky _ _ h1 have l3:thOf e<=s.toBits <<< (1:і)∧(0x7040000000000000:і)<=s.toBits <<< (1:і):=by unfold loOf at l1 dsimp only at l1 rw[П] at l1 ⊢ split at l1<;>rename_i hc . rw[О] at hc;constructor;. omega . exact l1 . rw[О] at hc;constructor;. exact l1 . rw[П];omega have b:=Os s.toBits l3.2 l2 h2 have e1:zivT (thOf e) s=zivC ((s.toBits+0x0FEFFFFF) >>> (29:і)):=by unfold zivT dsimp only rw[е l3.1] exact b.1 exact ⟨e1,e1 ▸ b.2⟩ lemma Pd (a:і) (h0:(0x7040000000000000:і)<=a <<< (1:і)) (h1:a <<< (1:і)<0x8FA0000000000000) (h2:(a+0x0FFFFFFD) &&& 0x1FFFFFFF<0x1FFFFFFC): zivW (a+2) (a-2)=zivC ((a+0x0FFFFFFD) >>> (29:і)) ∧ zivC ((a+0x0FFFFFFD) >>> (29:і))≠Д:=by have ha:=a.toNat_lt have e0:(a <<< (1:і)).toNat=Ѡa*2%2^64:=by rw[UInt64.toNat_shiftLeft];norm_num [Nat.shiftLeft_eq] rw[П,e0] at h0 rw[О,e0] at h1 norm_num at h0 h1 ha have eu:(a+0x0FFFFFFD).toNat=Ѡa+268435453:=by rw[Т];norm_num;omega have em:((a+0x0FFFFFFD) &&& 0x1FFFFFFF).toNat=(Ѡa+268435453)%2^29:=by rw[с,eu] have:=Е (Ѡa+268435453) 29 norm_num at this ⊢ exact this rw[О,em] at h2 norm_num at h2 generalize hx:(a+0x0FFFFFFD) >>> (29:і)=x have ex:Ѡx=(Ѡa+268435453)/2^29:=by rw[<-hx,У,eu];norm_num [Nat.shiftRight_eq_div_pow] have e1:(a+2+0x0FFFFFFF) >>> (29:і)=x:=by apply UInt64.toNat_inj.mp rw[ex,У,Т,Т] norm_num [Nat.shiftRight_eq_div_pow] omega have e2:(a-2+0x0FFFFFFF) >>> (29:і)=x:=by apply UInt64.toNat_inj.mp rw[ex,У,Т,л] norm_num [Nat.shiftRight_eq_div_pow] omega have hE:((x >>> (23:і)) &&& (0x7FF:і)).toNat=Ѡx/2^23%2^11:=by rw[с,У] have:=Е (Ѡx >>> 23) 11 norm_num [Nat.shiftRight_eq_div_pow] at this ⊢ exact this have r1:898<=Ѡx/2^23%2^11:=by rw[ex];norm_num;omega have r2:Ѡx/2^23%2^11<1151:=by rw[ex];norm_num;omega have r3:Ѡx<2^35:=by rw[ex];norm_num;omega constructor . unfold zivW zivC;dsimp only;rw[e1,e2];have hc:((x >>> (23:і)) &&& (0x7FF:і))-(897:і)<(254:і):=by rw[О,л,hE];norm_num;norm_num at r1 r2;omega simp[hc] . unfold zivC;rw[show ((x >>> (34:і)) <<< (31:і)) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< (23:і)))=((x >>> 34) <<< 31) ||| ((x &&& (0x3FFFFFFFF:і))-((896:і) <<< 23)) from rfl,Fp x r3 א r2];intro h;have h':=congrArg UInt32.toNat h;rw[ю] at h';have f:=п Ѡx (ב:0<2^23);split at h'<;>norm_num at h' f r1 r2<;>omega lemma Jo (s:ѕ) (h1:(s.toBits <<< (1:і))-0x7040000000000000<0x1F60000000000000) (h2:(s.toBits+0x0FFFFFFD) &&& 0x1FFFFFFF<0x1FFFFFFC):zivS s=zivC ((s.toBits+0x0FFFFFFD) >>> (29:і))∧zivS s≠Д:=by have sp0:spOf 0x7040000000000000=0x1F60000000000000:=by decide obtain ⟨l1,l2⟩:=Ky _ _ (sp0.symm ▸ h1);have b:=Pd s.toBits l1 l2 h2;have e1:zivS s=zivC ((s.toBits+0x0FFFFFFD) >>> (29:і)):=b.1;exact ⟨e1,e1 ▸ b.2⟩ end section lemma Ck:(0:є).toNat=0:=rfl lemma Gi (k:ћ) (h:k<2^32):k.toUSize.toNat=k:=by rw[Nat.toUSize_eq];exact uk k h lemma Gh (a b:є) (h:Ѡa*Ѡb<2^32):(a*b).toNat=Ѡa*Ѡb:=Cd a b h lemma Gk {α:Type} (a:Array α) (h:ѡa<2^32):a.usize.toNat=ѡa:=Gi _ h lemma Gl (a:ѐ) (i:є) (hs:ѡa<2^32):rdW a i=a[Ѡi]!:=by unfold rdW;split;. rename_i h;have h2:=Bw a i h;rw[в a Ѡi h2];rfl . rename_i h;have h':¬ Ѡi< ѡa:=by intro h2;apply h;rw[А,Gk a hs];exact h2 rw[ػ a Ѡi h'];rfl lemma Gm (a:ѐ) (i:є) (v:ѓ):(wrW a i v).size=ѡa:=by unfold wrW;split<;>simp lemma Jc {α:Type} [Inhabited α] (a:Array α) (i q:ћ) (v:α) (hi:i< ѡa):(a.set i v hi)[q]! = if q=i then v else a[q]!:=by by_cases hq:q< ѡa . rw[в _ q (by simpa using hq),getElem!_pos a q hq,Array.getElem_set];by_cases e:q=i;. simp[e] . rw[Щ e,Щ (λh=>e h.symm)] . rw[ػ _ q (by simpa using hq),getElem!_neg a q hq,ite_eq_right א] lemma Go (a:ѐ) (i:є) (v:ѓ) (q:ћ) (hs:ѡa<2^32) (hi:Ѡi< ѡa):(wrW a i v)[q]! = if q=Ѡi then v else a[q]!:=by have h:i< a.usize:=by rw[А,Gk a hs];exact hi unfold wrW;rw[Л h];exact Jc a _ q v hi def C_Inv (N:ћ) (sp:ћ->њ) (S:ћ->Prop) (out:ё):Prop:= ѡout=N∧∀ q,q< N->S q->out[q]! = sp q section variable {N:ћ} {sp:ћ->њ} include N sp lemma Lj {S:ћ->Prop} {out:ё} (hN:N<2^32) (h:C_Inv N sp S out) {u:є} {p:ћ} {v:њ} (hu:Ѡu=p) (hp:p< N) (hv:v=sp p):C_Inv N sp (λq=>q=p∨S q) (wrW out u v):=by obtain ⟨h1,h2⟩:=h;refine ⟨by rw[Gm,h1],λq hq hS=>?_⟩;rw[Go _ _ _ _ א א,hu];by_cases e:q=p;. rw[з e,e,hv] . rw[Щ e];exact h2 q hq (hS.resolve_left e) lemma Gp {S S':ћ->Prop} {out:ё} (h:C_Inv N sp S out) (hS:∀ q,q< N->S' q->S q):C_Inv N sp S' out:=⟨h.1,λq hq h'=>h.2 q hq (hS q hq h')⟩ lemma Gg {S:ћ->Prop} {out:ё} (h:C_Inv N sp S out) (hS:∀ q,q< N->S q):out=Array.ofFn (n:=N) λq=>sp q.val:=by obtain ⟨h1,h2⟩:=h;apply Array.ext;. simp[h1] . intro q h3 h4;have h5:q< N:=א;have:=h2 q h5 (hS q h5);rw[в out q h3] at this;simp[this] end lemma Rk (v:ѓ) (h1:(0x7FFFFF:ѓ)<=v-1) (h2:v<Ш):(v== 0 || v-(0x00800000:ѓ)<=(0x7EFFFFFF:ѓ))=true:=by have a1:(0x7FFFFF:ѓ).toNat=0x7FFFFF:=rfl;have a2:(Ш:ѓ).toNat=Ш:=rfl;have a3:(0x00800000:ѓ).toNat=0x00800000:=rfl;have a4:(0x7EFFFFFF:ѓ).toNat=0x7EFFFFFF:=rfl;have a5:(1:ѓ).toNat=1:=rfl;by_cases h0:v=0;. simp[h0] . have h3:(1:ѓ)<=v:=by rw[И];have:Ѡv≠0:=λh=>h0 (Ч.mp h);omega rw[И,ؼ _ _ h3] at h1;rw[Ы] at h2;have h4:(0x00800000:ѓ)<=v:=by rw[И];omega simp only[or_eq_true,decide_eq_true_eq];right;rw[И,ؼ _ _ h4];omega lemma Nl (c u lo:ѓ) (h:c<=if u< lo then u else lo):c<=u∧c<=lo:=by simp only[UInt32.le_iff_toNat_le,UInt32.lt_iff_toNat_lt] at *;split at h<;>omega lemma Pj (c v hi:ѓ) (h:(if hi< v then v else hi)< c):v< c∧hi< c:=by simp only[UInt32.lt_iff_toNat_lt] at *;split at h<;>omega lemma Sw (w:ѓ) (h:good w=true):good (w &&& В)=true:=by have e:(w &&& В) &&& В=w &&& В:=by rw[UInt32.and_assoc,UInt32.and_self] unfold good at h ⊢;simpa only [e] using h lemma Ln {h:ѓ} (h1:h<Ш):h<=В:=by have a1:(Ш:ѓ).toNat=Ш:=rfl;have a2:(В:ѓ).toNat=В:=rfl;rw[Ы] at h1;rw[И];omega def C_Hv (A:ё) (h:њ):Prop:= good h=true∧h<=В∧(∀ k,k< ѡA->good A[k]! = true) ∧ ∀ k,k< ѡA->A[k]! &&& В<=h lemma Sb (r v hi:ѓ) (h:(if hi< v then v else hi)<=r):v<=r∧hi<=r:=by simp only[UInt32.le_iff_toNat_le,UInt32.lt_iff_toNat_lt] at *;split at h<;>omega lemma Ot (A:ѐ) (n:є) (hn:Ѡn<=ѡA) (d:ћ): ∀ (i:є) (lo hi:ѓ),Ѡi+d=Ѡn->scan A n i hn lo hi≠Д → (0x7FFFFF:ѓ)<=lo∧hi<Ш∧hi<=scan A n i hn lo hi ∧ scan A n i hn lo hi<Ш∧(good hi=true->good (scan A n i hn lo hi)=true) ∧ ∀ k,Ѡi<=k->k< Ѡn → good A[k]! = true∧A[k]! &&& В<=scan A n i hn lo hi:=by induction d with | zero=> intro i lo hi he h have e:scan A n i hn lo hi=if 0x007FFFFF<=lo∧hi<Ш then hi else Д:=by rw[scan,Р ט] rw[e] at h ⊢ by_cases c:0x007FFFFF<=lo∧hi<Ш . rw[з c];exact ⟨c.1,c.2,UInt32.le_refl _,c.2,id,λk h1 h2=>by omega⟩ . rw[Щ c] at h;exact absurd rfl h | succ d ih=> intro i lo hi he h have hi':i< n:=by rw[А];omega have hb:Ѡi< ѡA:=א have e:scan A n i hn lo hi=scan A n (i+1) hn (if (A.uget i hb &&& В)-1< lo then (A.uget i hb &&& В)-1 else lo) (if hi< A.uget i hb &&& В then A.uget i hb &&& В else hi):=by rw[scan,Л hi'] rw[e] at h ⊢ obtain ⟨h1,h2,h3,h4,h5,h6⟩:=ih (i+1) _ _ (by rw[Bg i n hi'];omega) h obtain ⟨h7,h8⟩:=Nl _ _ _ h1 obtain ⟨h9,Dx⟩:=Pj _ _ _ h2 obtain ⟨h11,h12⟩:=Sb _ _ _ h3 have hg:good (A.uget i hb)=true:=Rk _ h7 h9 refine ⟨h8,Dx,h12,h4,λg0=>h5 ?_,λk hk1 hk2=>?_⟩ . split;. exact Sw _ hg . exact g0 . by_cases e2:k=Ѡi;. subst e2;rw[в A Ѡi hb];exact ⟨hg,h11⟩ . exact h6 k (by rw[Bg i n hi'];omega) hk2 lemma Gs (A:ѐ) (hs:ѡA<2^32) (h:scan A A.usize 0 (Cc A) Д 0≠Д):C_Hv A (scan A A.usize 0 (Cc A) Д 0):=by have e:=Gk A hs;have h0:(0:є).toNat=0:=rfl;obtain ⟨-,-,-,h4,h5,h6⟩:=Ot A A.usize (Cc A) ѡA 0 _ _ (by rw[h0,e];omega) h;have h7:∀ k,k< ѡA->good A[k]! = true ∧ A[k]! &&& В<=scan A A.usize 0 (Cc A) Д 0:=λk hk=>h6 k א א;exact ⟨h5 rfl,Ln h4,λk hk=>(h7 k hk).1,λk hk=>(h7 k hk).2⟩ lemma Qb (a b:ѓ):a<=a ||| b∧b<=a ||| b:=by rw[И,И,UInt32.toNat_or];exact ⟨Nat.left_le_or,Nat.right_le_or⟩ lemma Gq (v:ѓ) (h1:v=0∨0x800000<=v) (h2:v<Ш):(v== 0 || v-(0x00800000:ѓ)<=(0x7EFFFFFF:ѓ))=true:=by rcases h1 with rfl | h1;. rfl . have a1:(Ш:ѓ).toNat=Ш:=rfl;have a2:(0x00800000:ѓ).toNat=0x00800000:=rfl;have a3:(0x7EFFFFFF:ѓ).toNat=0x7EFFFFFF:=rfl;simp only[or_eq_true,decide_eq_true_eq];right;rw[И,ؼ _ _ h1];rw[Ы] at h2;rw[И] at h1;omega lemma Rg (a b:ѓ):a &&& b<=a∧a &&& b<=b:=by rw[И,И,р];exact ⟨Nat.and_le_left,Nat.and_le_right⟩ lemma Qd (v:ѓ) (h:0x7FFFFF<=v-1):v=0∨0x800000<=v:=by by_cases z:v=0;. exact .inl z . right;have a1:(0x7FFFFF:ѓ).toNat=0x7FFFFF:=rfl;have a2:(0x800000:ѓ).toNat=0x800000:=rfl;have a3:(1:ѓ).toNat=1:=rfl;have a4:Ѡv≠0:=λe=>z (Ч.mp (by rw[e];rfl));have a5:=v.toNat_lt;have h1:=И.mp h;rw[a1,UInt32.toNat_sub,a3] at h1;rw[И,a2];omega lemma Px (A:ѐ) (n:є) (hn:Ѡn<=ѡA) (d:ћ): ∀ (i:є) (o s:ѓ),Ѡi+d=Ѡn->scanF A n i hn o s≠Д → o<=scanF A n i hn o s∧scanF A n i hn o s<Ш∧0x7FFFFF<=s ∧ ((o=0∨0x800000<=o)->scanF A n i hn o s=0∨0x800000<=scanF A n i hn o s) ∧ ∀ k,Ѡi<=k->k< Ѡn → good A[k]! = true∧A[k]! &&& В<=scanF A n i hn o s:=by induction d with | zero=> intro i o s he h rw[scanF,Р ט] at h ⊢ by_cases c:0x7FFFFF<=s∧o<Ш . rw[з c];exact ⟨UInt32.le_refl _,c.2,c.1,id,λk h1 h2=>by omega⟩ . rw[Щ c] at h;exact absurd rfl h | succ d ih=> intro i o s he h have hi':i< n:=by rw[А];omega have hb:Ѡi< ѡA:=א rw[scanF,Л hi'] at h ⊢ obtain ⟨h1,h2,h3,h4,h5⟩:=ih (i+1) _ _ (by rw[Bg i n hi'];omega) h obtain ⟨h6,h7⟩:=Qb o _ obtain ⟨h8,h9⟩:=Rg s ((A.uget i hb &&& В)-1) have hv:=Qd _ (ض h3 h9) have hl:=ض h7 h1 refine ⟨ض h6 h1,h2,ض h3 h8,λg0=>h4 ?_,λk hk1 hk2=>?_⟩ . rcases hv with hv | hv . rcases g0 with g0 | g0;. left;rw[g0,hv];rfl . right;exact ض g0 h6 . right;exact ض hv h7 . by_cases e2:k=Ѡi;. subst e2;rw[в A Ѡi hb];exact ⟨Gq _ hv (UInt32.lt_of_le_of_lt hl h2),hl⟩ . exact h5 k (by rw[Bg i n hi'];omega) hk2 lemma Sv (A:ѐ) (hs:ѡA<2^32) (h:scanF A A.usize 0 (Cc A) 0 Д≠Д):C_Hv A (scanF A A.usize 0 (Cc A) 0 Д):=by have e:=Gk A hs;have h0:(0:є).toNat=0:=rfl;obtain ⟨-,h2,-,h4,h5⟩:=Px A A.usize (Cc A) ѡA 0 _ _ (by rw[h0,e];omega) h;generalize scanF A A.usize 0 (Cc A) 0 Д=S at *;have hp:=Ln h2;have hm:S &&& В=S:=by have a:(В:ѓ).toNat=2^31-1:=rfl;apply Ч.mp;rw[И,a] at hp;rw[р,a,Е];omega have hg:good S=true:=by unfold good;dsimp only;rw[hm];exact Gq _ (h4 (Or.inl rfl)) h2 exact ⟨hg,hp,λk hk=>(h5 k א א).1,λk hk=>(h5 k א א).2⟩ lemma Ha (A:ѐ) (hs:ѡA<2^32) (h:scanH A≠Д):C_Hv A (scanH A):=by revert h;unfold scanH;dsimp only;split;. exact Gs A hs . exact Sv A hs def C_out (I:ћ) (Y:ј) (X W b:ё) (i j:ћ):њ:= act Y (dotOf (I+1) (λt=>if t< I then X[i*I+t]! else oneW) (λt=>if t< I then W[j*I+t]! else b[j]!)) structure C_G (R I O:ћ) (X W b:ё):Prop where hX:R*I=ѡX hW:O*I=ѡW hb:O=ѡb pi:0< I po:0< O ni:I<2^20 sX:ѡX<2^32 sW:ѡW<2^32 sb:ѡb<2^32 sO:R*O<2^32 gX:∀ q,q< ѡX->good X[q]! = true gW:∀ q,q< ѡW->good W[q]! = true gb:∀ q,q< ѡb->good b[q]! = true lemma Hc {R I i t:ћ} (hi:i< R) (ht:t< I):i*I+t< R*I:=by have h:(i+1)*I<=R*I:=Н _ hi;rw[ف,و] at h;omega lemma He {R I i t:ћ} (hi:i< R) (ht:t<=I):i*I+t<=R*I:=by have h:(i+1)*I<=R*I:=Н _ hi;rw[ف,و] at h;omega section variable {R I O:ћ} {X W b:ё} section variable (G:C_G R I O X W b) include G lemma C_G.gx {i:ћ} (hi:i< R):∀ t,t< I->good X[i*I+t]! = true:=λ_ ht=>G.gX _ (by rw[<-G.hX];exact Hc hi ht) lemma C_G.gw {j:ћ} (hj:j< O):∀ t,t< I->good W[j*I+t]! = true:=λ_ ht=>G.gW _ (by rw[<-G.hW];exact Hc hj ht) lemma Nr (Y:ј) {i j:ћ} (hi:i< R) (hj:j< O) {s e:ѕ} (hs:let r:=(Э I).foldl (λ(acc:F1) t=> let q:=dv X[i*I+t]! * dv W[j*I+t]! F1.mk (acc.s+q) (acc.t+q.abs)) ⟨0,0⟩;s=r.s∧e=r.t): fin I Y X W b i j s (nfOf I) e b[j]! = C_out I Y X W b i j:=by obtain ⟨h1,h2⟩:=hs unfold fin dsimp only split . unfold slowOut C_out;rw[Bt] . rename_i h;unfold C_out;congr 1;exact Lr I G.ni (λt=>X[i*I+t]!) (λt=>W[j*I+t]!) b[j]! (G.gx hi) (G.gw hj) (G.gb j (by rw[<-G.hb];exact hj)) _ ي (λt ht=>я.mp ht) (λt ht h3=>absurd (я.mpr ht) h3) _ _ ⟨by rw[h1],by rw[h2]⟩ (by simpa using h) end lemma Ru {X W:ѐ} {xo wo n:є} (hX:ѡX<2^32) (hW:ѡW<2^32) (h1:Ѡxo+Ѡn<=ѡX) (h2:Ѡwo+Ѡn<=ѡW) (d:ћ):∀ (t:є) (s a:ѕ),Ѡt+d=Ѡn → tightGo X W xo wo n t s a=(List.range' Ѡt d).foldl (λ(acc:F1) k=>let q:=dv X[Ѡxo+k]! * dv W[Ѡwo+k]! F1.mk (acc.s+q) (acc.t+q.abs)) ⟨s,a⟩:=by induction d with | zero=> intro t s a he rw[tightGo,Р ט] rfl | succ d ih=> intro t s a he have ht:t< n:=by rw[А];omega rw[tightGo,Л ht,Ա,ك] dsimp only rw[Gl _ _ hX,Gl _ _ hW,Bu _ _ א,Bu _ _ א] rw[ih (t+1) _ _ (by rw[Bg t n ht];omega),Bg t n ht] section variable (G:C_G R I O X W b) (Y:ј) {i j:ћ} (hi:i< R) (hj:j< O) include G Y i j hi hj lemma Qm {s a:ѕ} {hh:њ} (hc:ziv (s+dv b[j]!) (nfOf I*(dv hh*a+(dv b[j]!).abs))≠Д → ziv (s+dv b[j]!) (nfOf I*(dv hh*a+(dv b[j]!).abs))= dotOf (I+1) (λt=>if t< I then X[i*I+t]! else oneW) (λt=>if t< I then W[j*I+t]! else b[j]!)): fin8 I Y X W b i j s (nfOf I) a hh b[j]! ѢI=C_out I Y X W b i j:=by have Mj:I<2^32:=lt_trans G.ni ב have hX1:i*I+I<=ѡX:=by rw[<-G.hX];exact He hi (le_refl _) have Et:j*I+I<=ѡW:=by rw[<-G.hW];exact He hj (le_refl _) have sX:=G.sX have sW:=G.sW have e1:(i*I).toUSize.toNat=i*I:=Gi _ א have e2:(j*I).toUSize.toNat=j*I:=Gi _ א have e3:I.toUSize.toNat=I:=Gi _ Mj unfold fin8 dsimp only split . have e:=Ru (xo:=(i*I).toUSize) (wo:=(j*I).toUSize) (n:=ѢI) G.sX G.sW (by rw[e1,e3];exact hX1) (by rw[e2,e3];exact Et) I 0 0 0 (by rw[e3,Ck,З]);rw[Ck,e1,e2,<-ـ] at e;rw[Nr G Y hi hj (s:=(tightGo X W (i*I).toUSize (j*I).toUSize ѢI 0 0 0).s) (e:=(tightGo X W (i*I).toUSize (j*I).toUSize ѢI 0 0 0).t) ⟨by rw[e],by rw[e]⟩] . rename_i h;unfold C_out;congr 1;exact hc (by simpa using h) lemma Kw {s:ѕ} {hv:њ} (g1:good hv=true) (g2:hv<=В) (g4:∀ t,t< I->W[j*I+t]! &&& В<=hv) (L:љ) (hl:L.Nodup) (Bo:∀ t∈L,t< I) (hz:∀ t,t< I->t∉L->X[i*I+t]! &&& В=0) (hs:s=L.foldl (λ(acc:ѕ) t=>acc+dv X[i*I+t]! * dv W[j*I+t]!) 0): fin8 I Y X W b i j s (nfOf I) (L.foldl (λ(a:ѕ) t=>a+(dv X[i*I+t]!).abs) 0) hv b[j]! ѢI=C_out I Y X W b i j:=by have gb:=G.gb j (by rw[<-G.hb];exact hj) exact Qm G Y hi hj λh=>by obtain ⟨-,-,k⟩:=Fh _ _ h obtain ⟨c1,c2⟩:=Sr I G.ni (λt=>X[i*I+t]!) (λt=>W[j*I+t]!) b[j]! hv (G.gx hi) (G.gw hj) gb g1 g4 g2 L hl Bo hz _ _ ⟨by rw[hs],rfl⟩ k exact Ge I G.ni _ _ _ (G.gx hi) (G.gw hj) gb _ _ c1 c2 h end end lemma Hi (x:ђ) (i:є) (h:Ѡi< ѡx):x.uget i h=x.data[Ѡi]!:=by obtain ⟨ds⟩:=x;have h':Ѡi< ѡds:=h;rw[в ds Ѡi h'];rfl lemma Dk (a:ѐ) (i:є) (h:Ѡi< ѡa):a.uget i h=a[Ѡi]!:=by rw[в a Ѡi h];rfl lemma Gt (a:ђ) (i:є) (v:ѕ):(wrF a i v).size=ѡa:=by unfold wrF;split;. obtain ⟨ds⟩:=a;exact Array.size_uset _ . rfl lemma Gj (a:ђ) (i:є) (v:ѕ) (q:ћ) (hs:ѡa<2^32) (hi:Ѡi< ѡa):(wrF a i v).data[q]! = if q=Ѡi then v else a.data[q]!:=by have h:i< a.usize:=by rw[А,FloatArray.usize];rwa [Gi _ hs] unfold wrF;rw[Л h];obtain ⟨ds⟩:=a;exact Jc ds _ q v hi def C_keep (xw:ћ->њ) (t:ћ):љ:= (Э t).filter (λp=>xw p &&& В != 0) section variable (xw:ћ->њ) (t:ћ) include xw t lemma Eq:(C_keep xw t).length<=t:=by have h:=List.length_filter_le (λp=>xw p &&& В != 0) (Э t);simpa [C_keep] using h lemma Lz (h:xw t &&& В=0):C_keep xw (t+1)=C_keep xw t:=by simp[C_keep,List.range_succ,List.filter_append,h] lemma Ld (h:¬ xw t &&& В=0):C_keep xw (t+1)=C_keep xw t ++ [t]:=by simp[C_keep,List.range_succ,List.filter_append,h] end def C_Dec (xw:ћ->њ) (sz t:ћ) (ix:ѐ) (buf:ђ) (c:є) (l:ѕ):Prop:= Ѡc=(C_keep xw t).length∧ѡix=sz∧ѡbuf=sz ∧ (∀ k p:ћ,(C_keep xw t)[k]?=some p → (ix[k]!:ѓ).toNat=p∧buf.data[k]! = dv (xw p)) ∧ l=(C_keep xw t).foldl (λ(a:ѕ) p=>a+(dv (xw p)).abs) 0 lemma Qk {X:ѐ} {o n:є} (xw:ћ->њ) (hn:Ѡn<2^32) (Hh:∀ t:є,t< n->rdW X (o+t)=xw Ѡt) (hg:∀ t,t< Ѡn->good (xw t)=true) (d:ћ): ∀ (t:є) (ix:ѐ) (buf:ђ) (c:є) (hh:ѕ),Ѡt+d=Ѡn->C_Dec xw Ѡn Ѡt ix buf c hh → C_Dec xw Ѡn Ѡn (decR X o n t ix buf c hh).ix (decR X o n t ix buf c hh).buf (decR X o n t ix buf c hh).c (decR X o n t ix buf c hh).l:=by induction d with | zero=> intro t ix buf c hh he H rw[decR,Р ט] have e:Ѡt=Ѡn:=א rw[e] at H;exact H | succ d ih=> intro t ix buf c hh he H have ht:t< n:=by rw[А];omega have hu:=Bg t n ht rw[decR,Л ht] dsimp only rw[Hh t ht] obtain ⟨h1,h2,h3,h4,h5⟩:=H by_cases hz:xw Ѡt &&& В=0 . rw[з (by simpa using hz)];apply ih (t+1) _ _ _ _ א;rw[hu,C_Dec,Lz xw _ hz];exact ⟨h1,h2,h3,h4,h5⟩ . rw[Щ (by simpa using hz)];apply ih (t+1) _ _ _ _ א;have hk:=Eq xw Ѡt;have hc:Ѡc< Ѡt+1:=א;rw[hu,C_Dec,Ld xw _ hz];have Tp:Ѡc< Ѡn:=א;refine ⟨?_,by rw[Gm];exact h2,by rw[Gt];exact h3,λk p hk2=>?_,by rw[List.foldl_append,<-h5];rfl⟩;. rw[Bu _ _ (by rw[м];omega),м,h1];simp . rw[Go _ _ _ _ א א,Gj _ _ _ _ א א];rw[List.getElem?_append,<-h1] at hk2;by_cases e:k=Ѡc;. subst e;simp at hk2;subst hk2;simp;omega . rw[Щ e,Щ e];by_cases e2:k< Ѡc;. rw[з e2] at hk2;exact h4 k p hk2 . rw[Щ e2] at hk2;obtain ⟨m,hm⟩:∃ m,k-Ѡc=m+1:=⟨k-Ѡc-1,by omega⟩;rw[hm] at hk2;simp at hk2 lemma Gy (a:ђ) (v:ѕ):(a.push v).size=ѡa+1:=by obtain ⟨ds⟩:=a;exact Array.size_push _ lemma Gf (n:є) (d:ћ):∀ (k:є) (a:ђ),Ѡk+d=Ѡn → (pushZ n k a).size=ѡa+d:=by induction d with | zero=> intro k a he;rw[pushZ,Р ט];rfl | succ d ih=> intro k a he;have ht:k< n:=by rw[А];omega rw[pushZ,Л ht,ih (k+1) _ (by rw[Bg k n ht];omega),Gy];omega lemma Nv {x:ђ} {ix W:ѐ} {w0 m n:є} (hx:Ѡn<=ѡx) (hi:Ѡn<=ѡix) (hs:ѡW<2^32) (h0:Ѡw0+Ѡm<=ѡW) (xf:ћ->ѕ) (ww:ћ->њ) (Hk:∀ p,p< Ѡm->W[Ѡw0+p]! = ww p) (L:љ):∀ (t:є) (a:ѕ),Ѡt+ѣL=Ѡn → (∀ k p:ћ,L[k]?=some p->p< Ѡm∧(ix[Ѡt+k]!:ѓ).toNat=p ∧ x.data[Ѡt+k]! = xf p) → go1 x ix W w0 m n t hx hi hs h0 a=L.foldl (λ(acc:ѕ) p=>acc+xf p*dv (ww p)) a:=by induction L with | nil=> intro t a he _ rw[go1,Р (by rw[А];simp at he;omega)] rfl | cons p L ih=> intro t a he H simp only[List.length_cons] at he have ht:t< n:=by rw[А];omega have Dq:Ѡt< Ѡn:=א obtain ⟨h1,h2,h3⟩:=H 0 p rfl rw[ы] at h2 h3 have hit:Ѡt< ѡix:=א have e0:(ix.uget t hit).toUSize.toNat=p:=by rw[к,Dk];exact h2 have hm:(ix.uget t hit).toUSize< m:=by rw[А,e0];exact h1 have e1:x.uget t א=xf p:=by rw[Hi,h3] have e2:∀ pf,W.uget (w0+(ix.uget t hit).toUSize) pf=ww p:=by intro pf rw[Dk,Bu _ _ (by rw[e0];omega),e0,Hk p h1] rw[go1,Л ht] dsimp only rw[Л hm] rw[e1,e2,ih (t+1) _ (by rw[Bg t n ht];omega),ك] intro k q hq have:=H (k+1) q (by simpa using hq) rw[Bg t n ht,show Ѡt+1+k=Ѡt+(k+1) by omega] exact this def C_Dw (wd:ђ) (W:ё):Prop:= ѡwd=ѡW->∀ q,q< ѡW->wd.data[q]! = dv W[q]! section variable {x:ђ} {ix W:ѐ} {w0 w1 w2 w3 m n:є} (hx:Ѡn<=ѡx) (hi:Ѡn<=ѡix) (hs:ѡW<2^32) (h0:Ѡw0+Ѡm<=ѡW) (h1:Ѡw1+Ѡm<=ѡW) (h2:Ѡw2+Ѡm<=ѡW) (h3:Ѡw3+Ѡm<=ѡW) lemma Nm (hv:∀ j,j< Ѡn->∃ w,good w=true∧x.data[j]! = dv w) (k:ћ): ∀ (t:є) (a b c d:ѕ),Ѡt+k=Ѡn → go4B x ix W w0 w1 w2 w3 m n t hx hi hs h0 h1 h2 h3 a b c d= ⟨go1 x ix W w0 m n t hx hi hs h0 a,go1 x ix W w1 m n t hx hi hs h1 b,go1 x ix W w2 m n t hx hi hs h2 c,go1 x ix W w3 m n t hx hi hs h3 d⟩:=by induction k with | zero=> intro t a b c d he have hn:¬ t< n:=by rw[А];omega unfold go4B go1 simp only[dite_eq_right hn] | succ k ih=> intro t a b c d he have ht:t< n:=by rw[А];omega have Dq:Ѡt< Ѡn:=א unfold go4B go1 simp only[dite_eq_left ht] obtain ⟨w,g,e⟩:=hv _ Dq have B:∀ (u:ѓ) p0,dvB (x.uget t p0) u=x.uget t p0*dv u:=by intro u p0 rw[Hi,e] exact Ph w u g have J:=λa b c d=>ih (t+1) a b c d (by rw[Bg t n ht];omega) split<;>simp only[B,J] lemma Ps {wd:ђ} (hd:ѡwd=ѡW) (hv:C_Dw wd W) (k:ћ): ∀ (t:є) (a b c d:ѕ),Ѡt+k=Ѡn → go4D x wd ix W w0 w1 w2 w3 m n t hx hi hs h0 h1 h2 h3 hd a b c d= ⟨go1 x ix W w0 m n t hx hi hs h0 a,go1 x ix W w1 m n t hx hi hs h1 b,go1 x ix W w2 m n t hx hi hs h2 c,go1 x ix W w3 m n t hx hi hs h3 d⟩:=by induction k with | zero=> intro t a b c d he have hn:¬ t< n:=by rw[А];omega unfold go4D go1 simp only[dite_eq_right hn] | succ k ih=> intro t a b c d he have ht:t< n:=by rw[А];omega have Dq:Ѡt< Ѡn:=א unfold go4D go1 simp only[dite_eq_left ht] have B:∀ (u:є) p1,dv (W.uget u p1)=wd.uget u (hd ▸ p1):=λu p1=>by rw[Hi,hv hd _ p1,Dk] have J:=λa b c d=>ih (t+1) a b c d (by rw[Bg t n ht];omega) split<;>simp only[B,J] end def C_sp (I O:ћ) (Y:ј) (X W b:ё) (q:ћ):њ:= C_out I Y X W b (q/O) (q%O) lemma Kt (I O:ћ) (Y:ј) (X W b:ё) {i j:ћ} (hj:j< O):C_sp I O Y X W b (i*O+j)=C_out I Y X W b i j:=by unfold C_sp;have h0:0< O:=א;rw[ж i O,ل h0,م,о hj,Й hj,ы] lemma Ht {N:ћ} {sp:ћ->њ} {p:ћ} {out:ё} (hN:N<2^32) (h:C_Inv N sp (λq=>q< p) out) {u:є} {v:њ} (hu:Ѡu=p) (hp:p< N) (hv:v=sp p):C_Inv N sp (λq=>q< p+1) (wrW out u v):= Gp (Lj hN h hu hp hv) (λq _ (hq:q< p+1)=>(by omega:q=p∨q< p)) lemma Is {u:є} {p:ћ} (hu:Ѡu=p) (h:p+3<2^32): (u+1).toNat=p+1∧(u+2).toNat=p+2∧(u+3).toNat=p+3 ∧ (p+4<2^32->(u+4).toNat=p+4):=by have l:∀ k,k<5->p+k<2^32->(u+Ж k).toNat=p+k:=λk hk h=>by rw[Bu _ _ (by rw[uk k א];omega),uk k א,hu] exact ⟨l 1 א א,l 2 א א,l 3 א א,l 4 א⟩ lemma Pb {N:ћ} {sp:ћ->њ} {p:ћ} {out:ё} (hN:N<2^32) (h:C_Inv N sp (λq=>q< p) out) {u:є} {v0 v1 v2 v3:њ} (hu:Ѡu=p) (hp:p+4<=N) (h0:v0=sp p) (h1:v1=sp (p+1)) (h2:v2=sp (p+2)) (h3:v3=sp (p+3)):C_Inv N sp (λq=>q< p+4) (wrW (wrW (wrW (wrW out u v0) (u+1) v1) (u+2) v2) (u+3) v3):=by obtain ⟨a1,a2,a3,-⟩:=Is hu א exact Ht hN (Ht hN (Ht hN (Ht hN h hu א h0) a1 א h1) a2 א h2) a3 א h3 lemma Ov {X:ѐ} {a n:ћ} (hX:ѡX<2^32) (hn:a+n<=ѡX) (hg:∀ t,t< n->good X[a+t]! = true) {ix:ѐ} {buf:ђ} (h1:ѡix=n) (h2:ѡbuf=n): C_Dec (λp=>X[a+p]!) n n (decR X Ѣa Ѣn 0 ix buf 0 0).ix (decR X Ѣa Ѣn 0 ix buf 0 0).buf (decR X Ѣa Ѣn 0 ix buf 0 0).c (decR X Ѣa Ѣn 0 ix buf 0 0).l:=by have eo:a.toUSize.toNat=a:=Gi _ א have ek:n.toUSize.toNat=n:=Gi _ א have D:=Qk (X:=X) (o:=Ѣa) (n:=Ѣn) (λp=>X[a+p]!) (by rw[ek];omega) (λt ht=>by have h4:=А.mp ht rw[ek] at h4 rw[Gl _ _ hX,Bu _ _ (by rw[eo];omega),eo]) (λt ht=>hg t (by rwa [ek] at ht)) n 0 ix buf 0 0 (by rw[Ck,ek,З]) ⟨by simp[C_keep],by rw[ek];exact h1,by rw[ek];exact h2,λk p hk=>by simp[C_keep] at hk,by simp[C_keep]⟩ rw[ek] at D exact D lemma Ku (xw:ћ->њ) (n:ћ):(C_keep xw n).Nodup∧(∀ t∈C_keep xw n,t< n) ∧ ∀ t,t< n->t∉C_keep xw n->xw t &&& В=0:= ⟨ي.filter _,λt ht=>я.mp (List.mem_filter.mp ht).1, λt ht hn=>by by_contra hc exact hn (List.mem_filter.mpr ⟨я.mpr ht,by simpa using hc⟩)⟩ structure C_Row (I:ћ) (X:ё) (i:ћ) (ix:ѐ) (x:ђ) (c:є) (L:љ) (l:ѕ):Prop where len:Ѡc=ѣL cle:ѣL<=I six:ѡix=I sx:ѡx=I nd:L.Nodup lt:∀ t∈L,t< I hz:∀ t,t< I->t∉L->X[i*I+t]! &&& В=0 rd:∀ k p:ћ,L[k]?=some p → (ix[k]!:ѓ).toNat=p∧x.data[k]! = dv X[i*I+p]! ok:l=L.foldl (λ(a:ѕ) t=>a+(dv X[i*I+t]!).abs) 0 section variable {R I O:ћ} {X W b:ё} section variable (G:C_G R I O X W b) include G lemma C_G.nm:I.toUSize.toNat=I:=Gi _ (lt_trans G.ni ב) lemma C_G.wj {j:ћ} {u:є} (hu:Ѡu=j) (hj:j< O):(u*ѢI).toNat=j*I ∧ (u*ѢI).toNat+I.toUSize.toNat<=ѡW:=by have h1:j*I+I<=O*I:=He hj (le_refl _) have h2:=G.hW have h3:=G.sW have e:(u*ѢI).toNat=j*I:=by rw[Gh _ _ (by rw[hu,G.nm];omega),hu,G.nm] exact ⟨e,by rw[e,G.nm];omega⟩ lemma Ed (Y:ј) {i j:ћ} (hi:i< R) (hj:j< O) {hv:њ} (Hv:C_Hv W hv) {ix:ѐ} {x:ђ} {c:є} {L:љ} {l:ѕ} (Rw:C_Row I X i ix x c L l) {u:є} (hu:Ѡu=j) (hx:Ѡc<=ѡx) (hi':Ѡc<=ѡix) (hs:ѡW<2^32) (h0:(u*ѢI).toNat+I.toUSize.toNat<=ѡW): fin8 I Y X W b i j (go1 x ix W (u*ѢI) ѢI c 0 hx hi' hs h0 0) (nfOf I) l hv (rdW b u) ѢI=C_out I Y X W b i j:=by have e:=Nv hx hi' hs h0 (λp=>dv X[i*I+p]!) (λp=>W[j*I+p]!) (λp _=>by rw[(G.wj hu hj).1]) L 0 0 (by rw[Ck,З];exact Rw.len.symm) (λk p hk=>by have h1:=Rw.rd k p hk rw[Ck,З,G.nm] exact ⟨Rw.lt p (Գ hk),h1⟩) rw[Gl _ _ G.sb,hu,Rw.ok] exact Kw G Y hi hj Hv.1 Hv.2.1 (λt ht=>Hv.2.2.2 _ (by rw[<-G.hW];exact Hc hj ht)) L Rw.nd Rw.lt Rw.hz e lemma Rc (Y:ј) {i:ћ} (hi:i< R) {hv:њ} (Hv:C_Hv W hv) {ix:ѐ} {x wd:ђ} {c:є} {L:љ} {l:ѕ} (Rw:C_Row I X i ix x c L l) {base:є} (hb:Ѡbase=i*O) (Hd:C_Dw wd W) (d:ћ):∀ (j:ћ) (out:ё),j+d=O → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q< i*O+j) out → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q< i*O+O) (cols1 I O Y X W b i ix x wd (nfOf I) l hv ѢI c j base out):=by induction d using Nat.strong_induction_on with | _ d ih=> intro j out he H have hN:=G.sO have sW:ѡW<=4294967295:=by have:=G.sW;omega have Mm:=G.sb have hob:=G.hb have Ej:=Rw.cle have Dw:Ѡc<=ѡx:=by rw[Rw.sx,Rw.len];exact Ej have Dv:Ѡc<=ѡix:=by rw[Rw.six,Rw.len];exact Ej have De:∀ k,j+k< O->C_out I Y X W b i (j+k)=C_sp I O Y X W b (i*O+j+k):=λk hk=>by rw[Ю];exact (Kt I O Y X W b hk).symm by_cases h4:j+4<=O . have hP:=Hc hi (א:j+3< O);have e0:j.toUSize.toNat=j:=Gi _ א;obtain ⟨e1,e2,e3,-⟩:=Is e0 א;have g0:=(G.wj e0 א).2;have g1:=(G.wj e1 א).2;have g2:=(G.wj e2 א).2;have g3:=(G.wj e3 א).2;have a0:(base+Ѣj).toNat=i*O+j:=by rw[Bu _ _ (by rw[hb,e0];omega),hb,e0] have o0:=Ed G Y hi (א:j< O) Hv Rw e0 Dw Dv G.sW g0;have o1:=Ed G Y hi (א:j+1< O) Hv Rw e1 Dw Dv G.sW g1;have o2:=Ed G Y hi (א:j+2< O) Hv Rw e2 Dw Dv G.sW g2;have o3:=Ed G Y hi (א:j+3< O) Hv Rw e3 Dw Dv G.sW g3;rw[cols1,Л h4];dsimp only;rw[Л ⟨Dw,Dv,sW,g0,g1,g2,g3⟩];split;rename_i hd;rw[Ps _ _ _ _ _ _ _ hd Hd Ѡc 0 _ _ _ _ (З _)];swap rw[Nm _ _ _ _ _ _ _ (λj hj=>by rw[Rw.len] at hj;have hp:=List.getElem?_eq_getElem hj exact ⟨_,G.gx hi _ (Rw.lt _ (Գ hp)),(Rw.rd j _ hp).2⟩) Ѡc 0 _ _ _ _ (З _)] all_goals dsimp only;rw[o0,o1,o2,o3];refine ih (d-4) א (j+4) _ א ?_;rw[show i*O+(j+4)=i*O+j+4 by omega];exact Pb hN H a0 א (De 0 א) (De 1 א) (De 2 א) (De 3 א) . by_cases h1:j< O . have hP:=Hc hi h1;have e0:j.toUSize.toNat=j:=Gi _ א;have g0:=(G.wj e0 h1).2;have a0:(base+Ѣj).toNat=i*O+j:=by rw[Bu _ _ (by rw[hb,e0];omega),hb,e0] have o0:=Ed G Y hi h1 Hv Rw e0 Dw Dv G.sW g0;rw[cols1,Р h4,Л h1];dsimp only;rw[Л ⟨Dw,Dv,sW,g0⟩];rw[o0];exact ih (d-1) א (j+1) _ א (Ht hN H a0 hP (De 0 א)) . rw[cols1,Р h4,Р h1];have e:j=O:=א;rw[e] at H;exact H lemma Kx (Y:ј) {hv:њ} (Hv:C_Hv W hv) {wd:ђ} (Hd:C_Dw wd W) (d:ћ):∀ (i:ћ) (ix:ѐ) (buf:ђ) (out:ё),i+d=R->ѡix=I->ѡbuf=I → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q< i*O) out → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q< R*O) (rows1 R I O Y X W b wd (nfOf I) hv ѢI i ix buf out):=by induction d with | zero=> intro i ix buf out he _ _ H rw[rows1,Р א] have e:i=R:=א rw[e] at H;exact H | succ d ih=> intro i ix buf out he h1 h2 H have hi:i< R:=א have Mj:I<2^32:=lt_trans G.ni ב have hN:=G.sO have sX:=G.sX have hX:=G.hX have hP:i*I+I<=R*I:=He hi (le_refl _) have Mm:(i*O).toUSize.toNat=i*O:=by have h3:i*O+O<=R*O:=He hi (le_refl _) exact Gi _ א obtain ⟨d1,d2,d3,d4,d5⟩:=Ov sX א (G.gx hi) h1 h2 obtain ⟨k1,k2,k3⟩:=Ku (λp=>X[i*I+p]!) I have Rw:=C_Row.mk d1 (Eq _ _) d2 d3 k1 k2 k3 d4 d5 rw[rows1,Л hi] dsimp only refine ih (i+1) _ _ _ א d2 d3 ?_ have h5:=Rc G Y hi Hv Rw Mm Hd O 0 out א (by rw[ы];exact H) rw[show (i+1)*O=i*O+O by rw[ف,و]] exact h5 end end lemma Fo (xs:ђ) (v:ѕ) (q:ћ):(xs.push v).data[q]! = if q=ѡxs then v else xs.data[q]!:=by obtain ⟨ds⟩:=xs;show (ds.push v)[q]! = if q=ѡds then v else ds[q]!;by_cases hq:q< ѡds . have h3:q<(ds.push v).size:=by simp;omega rw[в _ q h3,в ds q hq,Щ א,Array.getElem_push_lt] . by_cases e:q=ѡds . subst e;have h3:ѡds<(ds.push v).size:=by simp rw[в (ds.push v) ѡds h3,з rfl,Array.getElem_push_eq] . have h3:¬ q<(ds.push v).size:=by simp;omega rw[ػ _ q h3,ػ ds q hq,Щ e] lemma Im (l:List ѓ) (a:ђ):(l.foldl (λa w=>a.push (dv w)) a).data=a.data ++ (l.map dv).toArray:=by induction l generalizing a with | nil=>simp | cons w l ih=> rw[ك,ih];simp[FloatArray.push] lemma Ni (A:ѐ) (hs:ѡA<2^32): (A.foldl (λa w=>a.push (dv w)) (Б ѡA)).size=ѡA∧∀ q,q< ѡA → (A.foldl (λa w=>a.push (dv w)) (Б ѡA)).data[q]! = dv A[q]!:=by rw[<-Array.foldl_toList] constructor . have e:=Im A.toList (Б ѡA);show (A.toList.foldl (λa w=>a.push (dv w)) (Б ѡA)).data.size=ѡA;rw[e];simp[FloatArray.emptyWithCapacity] . intro q hq;rw[Im];simp[hq,FloatArray.emptyWithCapacity] lemma Mz (X:ѐ) (n e:є) (hs:ѡX<2^32) (he:Ѡe<=8*Ѡn) (hl:8*Ѡn<2^32) (d:ћ):∀ (q:є) (a:ђ),Ѡq+d=Ѡe → ѡa=Ѡq->(∀ p,p< Ѡq->a.data[p]! = dv X[p%8*Ѡn+p/8]!) → (wdQ X n e q a).size=Ѡe ∧ ∀ p,p< Ѡe->(wdQ X n e q a).data[p]! = dv X[p%8*Ѡn+p/8]!:=by induction d with | zero=> intro q a h1 h2 h3 rw[wdQ,Р ט] exact ⟨by omega,λp hp=>h3 p א⟩ | succ d ih=> intro q a h1 h2 h3 have hq:q< e:=by rw[А];omega have hu:=Bg q e hq have u8:=uk 8 ב have m1:(q%Ж 8).toNat=Ѡq%8:=by rw[USize.toNat_mod,u8] have d1:(q/Ж 8).toNat=Ѡq/8:=by rw[USize.toNat_div,u8] have c0:Ѡq%8*Ѡn<=7*Ѡn:=Н _ א have c1:Ѡq/8< Ѡn:=א have e0:=Cd (q%Ж 8) n (by rw[m1];omega) have e1:(q%Ж 8*n+q/Ж 8).toNat=Ѡq%8*Ѡn+Ѡq/8:=by rw[Bu _ _ (by rw[e0,m1,d1];omega),e0,m1,d1] rw[wdQ,Л hq] have s1:∀ (b:ђ) (v:ѕ),(b.push v).size=ѡb+1:=λb v=>by cases b;simp[FloatArray.push,FloatArray.size] refine ih (q+1) _ (by rw[hu];omega) (by rw[s1,hu,h2]) λp hp=>?_ rw[hu] at hp rw[Fo] split . rename_i c;rw[Gl _ _ hs,e1,c,h2] . exact h3 p א section variable {I O:ћ} {X W b:ё} lemma Oo (x:ѐ) (hx:ѡx<2^32) (base nu:є) (hb:Ѡbase+Ѡnu<2^32) (d:ℕ) (i:є) (s t:ѕ) (h:Ѡi+d=Ѡnu): lnSum x base nu i s t= ⟨((List.range' Ѡi d).map λj=>dv x[Ѡbase+j]!).foldl (.+·) s,((List.range' Ѡi d).map λj=>(dv x[Ѡbase+j]!).abs).foldl (.+·) t⟩:=by induction d generalizing i s t with | zero=> rw[lnSum,dif_neg ט];simp | succ d ih=> have hn:i< nu:=by rw[А];omega have e1:=Bg i nu hn rw[lnSum,dif_pos hn,ih (i+1) _ _ (by rw[e1];omega),e1,Gl x _ hx,Bu base i א] simp[List.range'_succ] lemma No (hs:ѡX<2^32) (hX:8*I<=ѡX) (hI:I.toUSize.toNat=I) (k:ћ) (hk:k<8):f8 (mkL X ѢI) k=(Э I).foldl (λ(a:ѕ) t=>a+(dv X[k*I+t]!).abs) 0:=by have key:∀ (u:є),Ѡu=k->(lnSum X (u*ѢI) ѢI 0 0 0).t=(Э I).foldl (λ(a:ѕ) t=>a+(dv X[k*I+t]!).abs) 0:=λu hu=>by have h1:(k+1)*I<=8*I:=Н _ hk;rw[ف,و] at h1;have e:(u*ѢI).toNat=k*I:=by rw[Gh _ _ (by rw[hu,hI];omega),hu,hI] rw[Oo X hs _ _ (by rw[e,hI];omega) I 0 0 0 (by rw[Ck,hI,З])];simp only[Ck,e,<-List.range_eq_range',List.foldl_map] interval_cases k<;>exact key _ (uk _ ב) lemma Nc {xs:ђ} {t n:є} {xf:ћ->ћ->ѕ} (Hj:∀ r k:ћ,r<8->k< Ѡn->xs.data[8*k+r]! = xf r k) (ht:Ѡt< Ѡn) (Cw:ѡxs<2^32) (hx:8*Ѡn<=ѡxs) (r:ћ) (hr:r<8) (pf:(Ж 8*t+Ж r).toNat< ѡxs):xs.uget (Ж 8*t+Ж r) pf=xf r Ѡt:=by have e2:=uk 8 ב;have e3:=uk r (א:r<2^32);have e:=Cd (Ж 8) t (by rw[e2];omega);rw[Hi,Bu _ _ (by rw[e,e2,e3];omega),e,e2,e3,Hj r _ hr ht] lemma Nn {xs:ђ} {W:ѐ} {wo n:є} (hx:8*Ѡn<=ѡxs) (Cw:ѡxs<2^32) (hs:ѡW<2^32) (hw:Ѡwo+Ѡn<=ѡW) (xf:ћ->ћ->ѕ) (ww:ћ->њ) (Hj:∀ r k:ћ,r<8->k< Ѡn->xs.data[8*k+r]! = xf r k) (Hk:∀ k,k< Ѡn->W[Ѡwo+k]! = ww k) (d:ћ): ∀ (t:є) (s0 s1 s2 s3 s4 s5 s6 s7:ѕ) (r0:F8),Ѡt+d=Ѡn->∀ r,r<8 → f8 (go8 xs W wo n t hx Cw hs hw s0 s1 s2 s3 s4 s5 s6 s7 r0) r= (List.range' Ѡt d).foldl (λ(acc:ѕ) k=>acc+xf r k*dv (ww k)) (f8 ⟨0,s0,s1,s2,s3,s4,s5,s6,s7⟩ r):=by induction d with | zero=> intro t s0 s1 s2 s3 s4 s5 s6 s7 r0 he r hr rw[go8,Р ט] cases r0 interval_cases r<;>rfl | succ d ih=> intro t s0 s1 s2 s3 s4 s5 s6 s7 r0 he r hr have ht:t< n:=by rw[А];omega have Dq:Ѡt< Ѡn:=א have hu:=Bg t n ht have e:dv (W.uget (wo+t) (wi wo t n W hw hs Dq))=dv (ww Ѡt):=by rw[Dk,Bu _ _ א,Hk _ Dq] rw[go8,Л ht] dsimp only have Q:=Nc Hj Dq Cw hx rw[e,Q 0 א,Q 1 א,Q 2 א,Q 3 א,Q 4 א,Q 5 א,Q 6 א,Q 7 א] rw[ih (t+1) _ _ _ _ _ _ _ _ _ א r hr,hu,Ա,ك] interval_cases r<;>rfl section variable {R:ћ} (G:C_G R I O X W b) (h8:8<=R) (Y:ј) {hv:њ} (Hv:C_Hv W hv) include R G h8 Y hv Hv lemma Pc {l r:F8} {j:ћ} (hj:j< O) (Hl:∀ k,k<8->f8 l k=(Э I).foldl (λ(a:ѕ) t=>a+(dv X[k*I+t]!).abs) 0) (Hr:∀ k,k<8->f8 r k=(Э I).foldl (λ(acc:ѕ) t=>acc+dv X[k*I+t]! * dv W[j*I+t]!) 0) (d:ћ): ∀ (k:ћ) (out:ё),k+d=8 → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q<8*O∧(q%O< j∨(q%O=j∧q/O< k))) out → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q<8*O∧q%O< j+1) (out8 I O Y X W b (nfOf I) hv l r j b[j]! ѢI k out):=by have pO:=G.po induction d with | zero=> intro k out he H rw[out8,г א] refine Gp H λq _ h=>⟨h.1,?_⟩ have h3:q/O<8:=у (by rw[ж];exact h.1) by_cases c:q%O< j . exact .inl c . exact .inr ⟨by omega,by omega⟩ | succ d ih=> intro k out he H have hk:k<8:=א rw[out8,е hk] refine ih (k+1) _ א ?_ have hN:=G.sO have hp:k*O+j< R*O:=Hc א hj have W1:=Lj hN H (u:=(k*O+j).toUSize) (p:=k*O+j) (Gi _ א) hp (v:=fin8 I Y X W b k j (f8 r k) (nfOf I) (f8 l k) hv b[j]! ѢI) (by rw[Kt I O Y X W b hj,Hl k hk] exact Kw G Y א hj Hv.1 Hv.2.1 (λt ht=>Hv.2.2.2 _ (by rw[<-G.hW];exact Hc hj ht)) (Э I) ي (λt ht=>я.1 ht) (λt ht hn=>absurd (я.2 ht) hn) (Hr k hk)) refine Gp W1 λq _ h=>?_ rcases h.2 with h2 | ⟨h1,h2⟩ . exact .inr ⟨h.1,.inl h2⟩ . by_cases c:q/O=k;. left;have e:=Nat.div_add_mod' q O;rw[c,h1] at e;exact e.symm . exact .inr ⟨h.1,.inr ⟨h1,by omega⟩⟩ lemma Qg {xs:ђ} {l:F8} (Mf:ѡxs=8*I) (Hx:∀ r t,r<8->t< I->xs.data[8*t+r]! = dv X[r*I+t]!) (Hl:∀ k,k<8->f8 l k=(Э I).foldl (λ(a:ѕ) t=>a+(dv X[k*I+t]!).abs) 0) (d:ћ):∀ (j:ћ) (r0:F8) (out:ё),j+d=O → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q<8*O∧q%O< j) out → C_Inv (R*O) (C_sp I O Y X W b) (λq=>q<8*O∧q%O< O) (cols8 I O Y X W b xs l (nfOf I) hv ѢI j r0 out):=by have Hn:=G.nm induction d with | zero=> intro j r0 out he H rw[cols8,Р א] have e:j=O:=א rw[e] at H;exact H | succ d ih=> intro j r0 out he H have hj:j< O:=א have hN:=G.sO have hO8:8*O<=R*O:=Н _ h8 have e0:j.toUSize.toNat=j:=Gi _ א obtain ⟨w1,w2⟩:=G.wj e0 hj have hx:8*I.toUSize.toNat<=ѡxs:=by rw[Hn,Mf] have hX:=G.hX have Ej:8*I<=R*I:=Н _ h8 have sX:=G.sX have sW:=G.sW have sx:ѡxs<=4294967295:=by rw[Mf];omega have sw:ѡW<=4294967295:=א rw[cols8,Л hj] dsimp only rw[Л ⟨hx,sx,sw,w2⟩] refine ih (j+1) _ _ א ?_ rw[Gl _ _ G.sb,e0] refine Pc G h8 Y Hv hj Hl (λk hk=>?_) 8 0 out rfl (Gp H λq _ h=>⟨h.1,h.2.resolve_right λh2=>absurd h2.2 (س _)⟩) have L:=Nn hx (Cz sx) (Cz sw) w2 (λr k=>dv X[r*I+k]!) (λk=>W[j*I+k]!) (λr k hr hk=>by rw[Hn] at hk;exact Hx r k hr hk) (λk _=>by rw[w1]) I.toUSize.toNat 0 0 0 0 0 0 0 0 0 r0 (by rw[Ck,З]) k hk refine L.trans ?_ have Z:f8 ⟨0,0,0,0,0,0,0,0,0⟩ k=0:=by interval_cases k<;>rfl rw[Ck,Hn,<-ـ,Z] end end lemma Rq:linF=linearSpec:=by funext rows inW outW relu X W b;unfold linF;dsimp only;have Hs:=Ha W;generalize scanH W=hw at Hs ⊢;split . rename_i h;obtain ⟨h1,h2,h3,h4,h5,h6,h7,h8,h9,Dx,h11,h12,h13⟩:=h;replace h7:=Cz h7;replace h8:=Cz h8;replace h9:=Cz h9;replace Dx:=Cz Dx have G0:=λ(A:∀ q,q< ѡW->good W[q]! = true)=> (⟨h1,h2,h3,h4,h5,h6,h7,h8,h9,Dx,(Ha X h7 h11).2.2.1,A,(Ha b h9 h13).2.2.1⟩:C_G rows inW outW X W b) have e:linearSpec rows inW outW relu X W b=Array.ofFn (n:=rows*outW) λq=>C_sp inW outW relu X W b q.val:=rfl;have Ti:(inW.toUInt64+8).toFloat*х 0x3CA0000000000000=nfOf inW:=rfl;rw[e,Ti];split . rename_i hr;obtain ⟨r1,r2⟩:=hr;have Hv:=Hs h8 h12;have G:=G0 Hv.2.2.1;have H0:C_Inv (rows*outW) (C_sp inW outW relu X W b) (λq=>q<8*outW∧q%outW<0) (К (rows*outW) 0):=⟨by simp,λq _ h=>absurd h.2 (س _)⟩;have eI:inW.toUSize.toNat=inW:=Gi _ א;have u8:=uk 8 ב;have hl:8*inW<=ѡX:=by rw[<-h1];exact Н _ r1 have e8:(Ж 8*ѢinW).toNat=8*inW:=by rw[Cd _ _ (by rw[u8,eI];omega),u8,eI] have K:=Mz X ѢinW (Ж 8*ѢinW) h7 (by rw[e8,eI]) (by rw[eI];omega) (8*inW) 0 (Б (8*inW)) (by rw[e8,show (0:є).toNat=0 from rfl,З]) (by simp[FloatArray.size,FloatArray.emptyWithCapacity]) λp hp=>absurd hp (س _);have P0:(pushZ ѢinW 0 (Б inW)).size=inW:=by rw[Gf ѢinW inW 0 _ (by rw[G.nm,Ck,З])];exact З _ refine Gg (Kx G relu Hv (λh q hq=>?_) (rows-8) 8 _ _ _ א ג P0 ?_) (λq hq=>hq);. have e:0=ѡW:=h;omega . refine Gp (Qg G r1 relu Hv (K.1.trans e8) (λr t hr ht=>?_) (No h7 hl (Gi _ א)) outW 0 _ _ (З _) H0) λq _ h=>⟨h,п _ h5⟩;have Q:=K.2 (8*t+r) (by rw[e8];omega);rwa [show (8*t+r)%8=r by omega,show (8*t+r)/8=t by omega,eI] at Q . have Hv:=Hs h8 h12;have G:=G0 Hv.2.2.1;have H0:C_Inv (rows*outW) (C_sp inW outW relu X W b) (λq=>q<0*outW) (К (rows*outW) 0):=⟨by simp,λq _ h=>by rw[Nat.zero_mul] at h;exact absurd h (س _)⟩;have P0:(pushZ ѢinW 0 (Б inW)).size=inW:=by rw[Gf ѢinW inW 0 _ (by rw[G.nm,Ck,З])];exact З _ refine Gg (Kx G relu Hv ?_ rows 0 _ _ _ א ג P0 H0) (λq hq=>hq);split;. intro _ q hq;exact (Ni W h8).2 q hq . intro h q hq;have e:0=ѡW:=h;omega . rw[Bt];rfl end lemma Su:linF=linearSpec:=Rq section structure D_Sc where (lo hi:ѓ) def D_scan (A:ѐ) (n i:є) (hn:Ѡn<=ѡA) (lo hi:ѓ):D_Sc:= if h:i< n then have ht:=А.mp h let v:=A.uget i א &&& В let u:=v-1 D_scan A n (i+1) hn (if u< lo then u else lo) (if hi< v then v else hi) else ⟨lo,hi⟩ termination_by Ѡn-Ѡi decreasing_by rw[Bg i n h];omega def D_fill (v:ѕ) (n k:є) (a:ђ):ђ:= if h:k< n then D_fill v n (k+1) (a.push v) else a termination_by Ѡn-Ѡk decreasing_by rw[Bg k n h];have:=А.mp h;omega def D_copy (X:ѐ) (o n t:є) (hs:ѡX<2^32) (ho:Ѡo+Ѡn<=ѡX) (a:ђ):ђ:= if h:t< n then D_copy X o n (t+1) hs ho (a.push (dv (X.uget (o+t) (wi o t n X ho hs (А.mp h))))) else a termination_by Ѡn-Ѡt decreasing_by rw[Bg t n h];have:=А.mp h;omega def D_z0:ђ:=D_fill (dv 0) 512 0 (Б 512) def D_z1:ђ:=D_fill (dv 0) 1024 0 (Б 1024) def D_z2:ђ:=D_fill (dv 0) 2048 0 (Б 2048) def D_z3:ђ:=D_fill (dv 0) 4096 0 (Б 4096) def D_z4:ђ:=D_fill (dv 0) 8192 0 (Б 8192) def D_z5:ђ:=D_fill (dv 0) 16384 0 (Б 16384) @[inline] def D_zs (n:ћ):ђ:= if n<=512 then D_z0 else if n<=1024 then D_z1 else if n<=2048 then D_z2 else if n<=4096 then D_z3 else if n<=8192 then D_z4 else D_z5 def D_cpz (X:ѐ) (o n t q:є) (hs:ѡX<2^32) (ho:Ѡo+Ѡn<=ѡX) (a:ђ):ђ:= if h:t< n then D_cpz X o n (t+1) (q+1) hs ho (wrF a q (dv (X.uget (o+t) (wi o t n X ho hs (А.mp h))))) else a termination_by Ѡn-Ѡt decreasing_by rw[Bg t n h];have:=А.mp h;omega def D_imz (s:ConvShape) (X:ѐ) (hs:ѡX<2^32) (wp R r:ћ) (a:ђ):ђ:= if hr:r< R then let hp:=s.h+2*s.pad let yy:=r%hp let o:=((r/hp*s.h+(yy-s.pad))*s.w).toUSize if hg:s.pad<=yy∧yy-s.pad< s.h∧Ѡo+s.w.toUSize.toNat<=ѡX then D_imz s X hs wp R (r+1) (D_cpz X o s.w.toUSize 0 (r*wp+s.pad).toUSize hs hg.2.2 a) else D_imz s X hs wp R (r+1) a else a termination_by R-r def D_tq (k kw kh hp wp t c r q:ћ) (a:ѐ):ѐ:= if t< k then let a:=a.push ((c*hp+r)*wp+q).toUInt32 if q+1< kw then D_tq k kw kh hp wp (t+1) c r (q+1) a else if r+1< kh then D_tq k kw kh hp wp (t+1) c (r+1) 0 a else D_tq k kw kh hp wp (t+1) (c+1) 0 0 a else a termination_by k-t def D_img (s:ConvShape) (X:ѐ) (hs:ѡX<2^32) (z:ѕ) (R r:ћ) (a:ђ):ђ:= if hr:r< R then let hp:=s.h+2*s.pad let yy:=r%hp let o:=((r/hp*s.h+(yy-s.pad))*s.w).toUSize let pu:=s.pad.toUSize if hg:s.pad<=yy∧yy-s.pad< s.h∧Ѡo+s.w.toUSize.toNat<=ѡX then D_img s X hs z R (r+1) (D_fill z pu 0 (D_copy X o s.w.toUSize 0 hs hg.2.2 (D_fill z pu 0 a))) else D_img s X hs z R (r+1) (D_fill z (s.w+2*s.pad).toUSize 0 a) else a termination_by R-r @[inline] def D_xs (s:ConvShape) (X:ѐ) (hs:ѡX<2^32) (wp R:ћ):ђ:= if R*wp+7<=16384 then D_imz s X hs wp R 0 (D_zs (R*wp+7)) else pushZ 7 0 (D_img s X hs (dv 0) R 0 (Б (R*wp+7))) def D_off (s:ConvShape) (t:ћ):ћ:= (t/(s.kh*s.kw)*(s.h+2*s.pad)+t/s.kw%s.kh)*(s.w+2*s.pad)+t%s.kw structure D_C where (dw relu f4:ј) (s:ConvShape) (X W b:ѐ) (k C ho wo wp:ћ) (step:є) (hi:ѓ) (xd:ђ) (nf:ѕ) (tab:ѐ) structure D_P where (g:D_C) (wd:ђ) (off:ѐ) (e l1 l8:є) (e0 bv ze:ѕ) (he:Ѡe<=ѡoff) (hw:Ѡe<=ѡwd) (hs:g.xd.size<2^32) (h1:∀ b:є,b< l1->∀ j (h:j< ѡoff),Ѡb+off[j].toNat+0< g.xd.size) (h8:∀ b:є,b< l8->∀ j (h:j< ѡoff),Ѡb+off[j].toNat+7< g.xd.size) (hz:ze=0) lemma In {n d:ћ} (b:є) (u:ѓ) (hs:n<2^32) (h:Ѡb+Ѡu+d< n):(b+Ѣu).toNat+d< n:=by rw[Bu _ _ (by rw[к];omega),к];exact h lemma Dg {n:ћ} (p:є) (k:ћ) (hs:n<2^32) (h:Ѡp+k< n):(p+Ж k).toNat< n:=by rw[Bu _ _ (by rw[uk k א];omega),uk k א];exact h structure D_R where (t:UInt8) (A B C D E F G I:ѕ) def D_go8R (xd wd:ђ) (off:ѐ) (b e i:є) (he:Ѡe<=ѡoff) (hw:Ѡe<=ѡwd) (hs:ѡxd<2^32) (hb:∀ j (h:j< ѡoff),Ѡb+off[j].toNat+7< ѡxd) (A B C D E F G I:ѕ) (r:D_R):D_R:= if h:i< e then have ht:=А.mp h let p:=b+(off.uget i א).toUSize have hp:Ѡp+7< ѡxd:=In _ _ hs (hb Ѡi א) let v:=wd.uget i א D_go8R xd wd off b e (i+1) he hw hs hb (A+xd.uget p א*v) (B+xd.uget (p+Ж 1) (Dg p 1 hs א)*v) (C+xd.uget (p+Ж 2) (Dg p 2 hs א)*v) (D+xd.uget (p+Ж 3) (Dg p 3 hs א)*v) (E+xd.uget (p+Ж 4) (Dg p 4 hs א)*v) (F+xd.uget (p+Ж 5) (Dg p 5 hs א)*v) (G+xd.uget (p+Ж 6) (Dg p 6 hs א)*v) (I+xd.uget (p+Ж 7) (Dg p 7 hs א)*v) r else match r with | ⟨t,_,_,_,_,_,_,_,_⟩=>⟨t,A,B,C,D,E,F,G,I⟩ termination_by Ѡe-Ѡi decreasing_by rw[Bg i e h];omega def D_goT (xd wd:ђ) (off:ѐ) (b e i:є) (he:Ѡe<=ѡoff) (hw:Ѡe<=ѡwd) (hs:ѡxd<2^32) (hb:∀ j (h:j< ѡoff),Ѡb+off[j].toNat+0< ѡxd) (a t:ѕ):F1:= if h:i< e then have ht:=А.mp h let q:=xd.uget (b+(off.uget i א).toUSize) (In (d:=0) _ _ hs (hb Ѡi א))*wd.uget i א D_goT xd wd off b e (i+1) he hw hs hb (a+q) (t+q.abs) else ⟨a,t⟩ termination_by Ѡe-Ѡi decreasing_by rw[Bg i e h];omega @[noinline] def D_slow (g:D_C) (o y x:ћ):ѓ:= act g.relu (dotFn (g.k+1) (λt=>if t< g.k then windowAt g.s g.X y x ((if g.dw then o*g.k else 0)+t) else oneW) (λt=>if t< g.k then g.W[o*g.k+t]! else g.b[o]!)) @[noinline] def D_finT (c:D_P) (o y x:ћ) (b:є):ѓ:= if hb:b< c.l1 then let q:=D_goT c.g.xd c.wd c.off b c.e 0 c.he c.hw c.hs (c.h1 b hb) c.ze c.ze let r:=ziv (q.s+c.bv) (c.g.nf*(q.t+c.bv.abs)) if r== Д then D_slow c.g o y x else act c.g.relu r else D_slow c.g o y x @[inline] def D_fin (c:D_P) (o y x:ћ) (b:є) (a:ѕ):ѓ:= let r:=ziv (a+c.bv) c.e0 if r== Д then D_finT c o y x b else act c.g.relu r @[noinline] def D_finK (c:D_P) (o y x k:ћ) (b:є) (a:ѕ):ѓ:= D_fin c o y (x+k) (b+Ж k) a @[inline] def D_w (c:D_P) (lo sp:і) (o y x:ћ) (b:є) (k:ћ) (a:ѕ):ѓ:= let w:=(a+c.bv).toBits let u:=w+0x0FEFFFFF if (w <<< (1:і))-lo< sp && u &&& 0x1FFFFFFF<0x1FE00000 then zivC (u >>> (29:і)) else D_finK c o y x k b a @[inline] def D_l (c:D_P) (lo sp:і) (o y x:ћ) (b q n:є) (k:ћ) (a:ѕ) (out:ѐ): ѐ:= if Ж k< n then wrW out (q+Ж k) (D_w c lo sp o y x b k a) else out def D_cols (c:D_P) (lo sp:і) (o y x:ћ) (b q:є) (rr:D_R) (out:ѐ): ѐ:= if h8:x< c.g.wo∧c.g.f4=true∧b< c.l8 then let r:=D_go8R c.g.xd c.wd c.off b c.e 0 c.he c.hw c.hs (c.h8 b h8.2.2) c.ze c.ze c.ze c.ze c.ze c.ze c.ze c.ze rr let n:=(c.g.wo-x).toUSize let out:=D_l c lo sp o y x b q n 0 r.A out let out:=D_l c lo sp o y x b q n 1 r.B out let out:=D_l c lo sp o y x b q n 2 r.C out let out:=D_l c lo sp o y x b q n 3 r.D out let out:=D_l c lo sp o y x b q n 4 r.E out let out:=D_l c lo sp o y x b q n 5 r.F out let out:=D_l c lo sp o y x b q n 6 r.G out let out:=D_l c lo sp o y x b q n 7 r.I out D_cols c lo sp o y (x+8) (b+8) (q+8) r out else if x< c.g.wo then D_cols c lo sp o y (x+1) (b+c.g.step) (q+1) rr (wrW out q (D_finT c o y x b)) else out termination_by c.g.wo-x def D_rows (c:D_P) (lo sp:і) (o y:ћ) (q:є) (out:ѐ):ѐ:= if y< c.g.ho then D_rows c lo sp o (y+1) (q+c.g.wo.toUSize) (D_cols c lo sp o y 0 (Ѣy*c.g.step*c.g.wp.toUSize) q ⟨0,0,0,0,0,0,0,0,0⟩ out) else out termination_by c.g.ho-y lemma Jf {n m:ћ} (d:ћ) (off:ѐ) (hs:n<2^32) (hm:∀ j (h:j< ѡoff),off[j].toNat<=m) (b:є) (hb:b<(n-(m+d)).toUSize) (j:ћ) (h:j< ѡoff):Ѡb+off[j].toNat+d< n:=by have h1:=А.1 hb;rw[Gi _ א] at h1;have:=hm j h;omega lemma Of {off:ѐ} {m f:ѓ} {c:є} (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm):∀ j (h:j<(wrW off c f).size),(wrW off c f)[j].toNat<=(if m< f then f else m).toNat:=by intro j h;have e:(if m< f then f else m).toNat=max Ѡm Ѡf:=by split<;>rename_i hc<;>rw[Ы] at hc<;>omega rw[e];by_cases hc:c< off.usize . have e2:wrW off c f=off.uset c f (Bw off c hc):=by unfold wrW;rw[Л hc] have h0:j< ѡoff:=by rw[e2] at h;simpa using h have g:=hm j h0;simp only[e2,Array.uset,Array.getElem_set];split<;>omega . have e2:wrW off c f=off:=by unfold wrW;rw[Р hc] have h0:j< ѡoff:=by rw[e2] at h;exact h have g:=hm j h0;simp only[e2];omega lemma Ii (k:ћ):∀ j (h:j<(К k (0:ѓ)).size),(К k (0:ѓ))[j].toNat<=(0:ѓ).toNat:=by intro j h;simp structure R2 where (off:ѐ) (buf:ђ) (c:є) (l:ѕ) (m:ѓ) (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm) def D_dec (tab W:ѐ) (base:ѓ) (o n t:є) (off:ѐ) (buf:ђ) (c:є) (l:ѕ) (m:ѓ) (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm):R2:= if h:t< n then let w:=rdW W (o+t) if w &&& В== 0 then D_dec tab W base o n (t+1) off buf c l m hm else let v:=dv w let f:=base+rdW tab t D_dec tab W base o n (t+1) (wrW off c f) (wrF buf c v) (c+1) (l+v.abs) (if m< f then f else m) (Of hm) else ⟨off,buf,c,l,m,hm⟩ termination_by Ѡn-Ѡt decreasing_by all_goals (rw[Bg t n h];have:=А.mp h;omega) def D_outs (g:D_C) (hs:g.xd.size<2^32) (o:ћ) (q:є) (off:ѐ) (buf:ђ) (m:ѓ) (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm) (out:ѐ):ѐ:= if o< g.C then let r:=D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) (o*g.k).toUSize g.k.toUSize 0 off buf 0 0 m hm if h:r.c.toNat<=r.off.size∧r.c.toNat<=r.buf.size then let c:D_P:=⟨g,r.buf,r.off,r.c,(g.xd.size-(r.m.toNat+0)).toUSize, (g.xd.size-(r.m.toNat+7)).toUSize,g.nf*(dv g.hi*r.l+(dv (rdW g.b Ѣo)).abs), dv (rdW g.b Ѣo),0,h.1,h.2,hs, Jf 0 r.off hs r.hm,Jf 7 r.off hs r.hm,rfl⟩ D_outs g hs (o+1) (q+(g.ho*g.wo).toUSize) r.off r.buf r.m r.hm (D_rows c (loOf c.e0) (spR c.g.relu (loOf c.e0)) o 0 q out) else out else out termination_by g.C-o def D_F (dw:ј) (s:ConvShape) (relu:ј) (X W b:ѐ) (k C:ћ): ѐ:= let hp:=s.h+2*s.pad let wp:=s.w+2*s.pad let rx:=D_scan X X.usize 0 (Cc X) Д 0 if hg:ѡX<2^32∧0x007FFFFF<=rx.lo∧rx.hi<Ш∧ѡX=s.cin*s.h*s.w ∧ ѡW=C*k∧ѡb=C∧0< s.stride∧s.stride<2^32∧0< k∧k<2^20 ∧ s.kh<=hp∧s.kw<=wp∧hp<2^32∧wp<2^32∧ѡW<2^32∧ѡb<2^32 ∧ C*(s.ho*s.wo)<2^32∧s.cin*hp*wp<2^32 ∧ scanH W≠Д ∧ scanH b≠Д then let tight:=(rx.hi >>> (23:ѓ))-((rx.lo+1) >>> (23:ѓ)) > 99 let R:=s.cin*hp let xd:=D_xs s X hg.1 wp R if hs:ѡxd<2^32 then let g:D_C:=⟨dw,relu,s.stride== 1 && !tight,s,X,W,b,k,C,s.ho,s.wo,wp, s.stride.toUSize,rx.hi,xd,(k.toUInt64+8).toFloat*х 0x3CA0000000000000, D_tq k s.kw s.kh hp wp 0 0 0 0 (Array.emptyWithCapacity k)⟩ D_outs g hs 0 0 (К k 0) (pushZ Ѣk 0 (Б k)) 0 (Ii k) (К (C*(s.ho*s.wo)) 0) else if dw then depthwiseWith dotFn s relu X W b else conv2dWith dotFn s relu X W b else if dw then depthwiseWith dotFn s relu X W b else conv2dWith dotFn s relu X W b def convF (s:ConvShape) (relu:ј) (X W b:ѐ):ѐ:= D_F false s relu X W b (s.cin*s.kh*s.kw) s.cout def depthF (s:ConvShape) (relu:ј) (X W b:ѐ):ѐ:= D_F true s relu X W b (s.kh*s.kw) s.cin def D_px (s:ConvShape) (X:ё) (c yy xx:ћ):њ:= if yy< s.pad∨xx< s.pad∨yy-s.pad ≥ s.h∨xx-s.pad ≥ s.w then 0 else X[(c*s.h+(yy-s.pad))*s.w+(xx-s.pad)]! def D_Fx (s:ConvShape) (X:ё) (q:ћ):ѕ:= dv (D_px s X (q/(s.w+2*s.pad)/(s.h+2*s.pad)) (q/(s.w+2*s.pad)%(s.h+2*s.pad)) (q%(s.w+2*s.pad))) def D_Pre (F:ћ->ѕ) (m:ћ) (a:ђ):Prop:= ѡa=m∧∀ q,q< m->a.data[q]! = F q lemma Le {F:ћ->ѕ} {m:ћ} {a:ђ} {v:ѕ} (h:D_Pre F m a) (hv:v=F m):D_Pre F (m+1) (a.push v):=by refine ⟨by rw[Gy,h.1],λq hq=>?_⟩;rw[Fo,h.1];split<;>rename_i e;. rw[e,hv] exact h.2 q א lemma Iq (m d:ћ):m+(d+1)=m+1+d:=א def D_Sp (F:ћ->ѕ) (m:ћ) (a:ђ):Prop:= m<=ѡa∧∀ q,q< m->a.data[q]! = F q lemma Oj {F:ћ->ѕ} {m:ћ} (n:є) (d:ћ):∀ (k:є) (a:ђ),Ѡk+d=Ѡn->D_Sp F m a->D_Sp F m (pushZ n k a):=by induction d with | zero=> intro k a h H;rw[pushZ,Р ט];exact H | succ d ih=> intro k a h H;have ht:k< n:=by rw[А];omega rw[pushZ,Л ht];refine ih (k+1) _ (by rw[Bg k n ht];omega) ⟨by rw[Gy];have:=H.1;omega,λq hq=>?_⟩;have:=H.1;rw[Fo,г א];exact H.2 q hq lemma Ir {i e:є} (h:Ѡe<=Ѡi):¬i< e:=mt А.1 (Nat.not_lt.2 h) lemma Dh {i e:є} {d:ћ} (h:Ѡi+(d+1)=Ѡe):i< e∧(i+1).toNat+d=Ѡe:=by have t:=А.2 (א:Ѡi< Ѡe);exact ⟨t,by rw[Bg i e t];omega⟩ lemma Li {F:ћ->ѕ} {v:ѕ} {n:є} (d:ћ): ∀ (k:є) (m:ћ) (a:ђ),Ѡk+d=Ѡn->D_Pre F m a → (∀ i,m<=i->i< m+d->F i=v)->D_Pre F (m+d) (D_fill v n k a):=by induction' d with d ih<;>intro k m a he H hv . rw[D_fill,Р (Ir he.ge)];exact H obtain ⟨ht,hu⟩:=Dh he rw[D_fill,Л ht,Iq] exact ih (k+1) (m+1) _ hu (Le H (hv m א א).symm) λi h1 h2=>hv i א א lemma Sg {F:ћ->ѕ} {X:ѐ} {o n:є} (hs:ѡX<2^32) (ho:Ѡo+Ѡn<=ѡX) (d:ћ): ∀ (t:є) (m:ћ) (a:ђ),Ѡt+d=Ѡn->D_Pre F m a → (∀ j,j< d->F (m+j)=dv X[Ѡo+Ѡt+j]!) → D_Pre F (m+d) (D_copy X o n t hs ho a):=by induction' d with d ih<;>intro t m a he H hv . rw[D_copy,Р (Ir he.ge)];exact H obtain ⟨ht,hu⟩:=Dh he rw[D_copy,Л ht,Iq] refine ih (t+1) (m+1) _ hu (Le H ?_) λj hj=>?_ . rw[Dk,Bu _ _ א];exact (hv 0 א).symm simpa only [Bg t n ht,Nat.add_assoc,Nat.add_comm 1] using hv (j+1) א lemma Iu {c:ћ} (a:ћ) {b:ћ} (h:b< c):(a*c+b)/c=a∧(a*c+b)%c=b:=by rw[ж a c,ل א,م,о h,Й h];exact ⟨rfl,rfl⟩ lemma Iv (s:ConvShape) (X:ё) (r:ћ) {i:ћ} (hi:i< s.w+2*s.pad): D_Fx s X (r*(s.w+2*s.pad)+i)=dv (D_px s X (r/(s.h+2*s.pad)) (r%(s.h+2*s.pad)) i):=by simp only[D_Fx,Iu r hi] lemma Ex {F:ћ->ѕ} {v:ѕ} {n:є} {m d:ћ} {a:ђ} (hn:Ѡn=d) (H:D_Pre F m a) (hv:∀ u,u< d->F (m+u)=v):D_Pre F (m+d) (D_fill v n 0 a):= Li d 0 m a (by rw[hn];exact З d) H λi h1 h2=>by obtain ⟨u,rfl⟩:=Nat.exists_eq_add_of_le h1 exact hv u א lemma Iw (m p w:ћ):m+(w+2*p)=m+p+w+p:=א lemma Sl (s:ConvShape) (X:ѐ) (hs:ѡX<2^32) (hX:ѡX=s.cin*s.h*s.w) (hh:s.h+2*s.pad<2^32) (hw:s.w+2*s.pad<2^32) {R:ћ} (hR:R=s.cin*(s.h+2*s.pad)) (d:ћ): ∀ (r:ћ) (a:ђ),r+d=R → D_Pre (D_Fx s X) (r*(s.w+2*s.pad)) a → D_Pre (D_Fx s X) (R*(s.w+2*s.pad)) (D_img s X hs (dv 0) R r a):=by induction' d with d ih<;>intro r a he H . rw[D_img,Р א,<-he];exact H have hr:r< R:=א have hc:=у (hr.trans_eq (hR.trans (ж _ _))) have ep:=Gi s.pad א have ew:=Gi s.w א have hO:=λg:r%(s.h+2*s.pad)-s.pad< s.h=>He (Hc hc g) (Nat.le_refl s.w) rw[D_img,Л hr] dsimp only split<;>rename_i g . obtain ⟨g1,g2,g3⟩:=g;have:=hO g2;apply ih (r+1) _ א;rw[ز,Iw];refine Ex ep (Sg hs g3 s.w 0 _ _ (by rw[ew];exact З _) (Ex ep H λu hu=>?_) λj hj=>?_) λu hu=>?_;. rw[Iv _ _ _ א,D_px,е א] . rw[Ю,Iv _ _ _ א,D_px,г א,Nat.add_sub_cancel_left,Gi _ א];rfl . rw[Ю,Ю,Iv _ _ _ א,D_px,е א] apply ih (r+1) _ א rw[ز] exact Ex (Gi _ hw) H λu hu=>by rw[Iv _ _ _ hu,D_px,е] by_contra n have:=hO א exact g ⟨by omega,by omega,by rw[Gi _ א,ew,hX];exact this⟩ def D_t0 (g:D_C) (o:ћ):ћ:=if g.dw then o*g.k else 0 def D_xw (g:D_C) (o y x t:ћ):њ:=windowAt g.s g.X y x (D_t0 g o+t) def D_out (g:D_C) (o y x:ћ):њ:= act g.relu (dotOf (g.k+1) (λt=>if t< g.k then D_xw g o y x t else oneW) (λt=>if t< g.k then g.W[o*g.k+t]! else g.b[o]!)) lemma Lc (g:D_C) (o y x:ћ):D_slow g o y x=D_out g o y x:=by unfold D_slow D_out D_xw D_t0;rw[Bt] def D_B (g:D_C) (y x:ћ):ћ:=y*g.s.stride*g.wp+x*g.s.stride structure D_Ok (g:D_C):Prop where hk:g.k=if g.dw then g.s.kh*g.s.kw else g.s.cin*g.s.kh*g.s.kw hC:g.C=if g.dw then g.s.cin else g.s.cout ho:g.ho=g.s.ho wo:g.wo=g.s.wo wp:g.wp=g.s.w+2*g.s.pad st:g.step.toNat=g.s.stride nf:g.nf=nfOf g.k f4:g.f4=true->g.s.stride=1 p0:0< g.s.stride pk:0< g.k nk:g.k<2^20 kh:g.s.kh<=g.s.h+2*g.s.pad kw:g.s.kw<=g.s.w+2*g.s.pad xd:D_Sp (D_Fx g.s g.X) (g.s.cin*(g.s.h+2*g.s.pad)*(g.s.w+2*g.s.pad)) g.xd xs:g.xd.size<2^32 Hx:C_Hv g.X g.hi HW:∀ q:ћ,good g.W[q]! = true Hb:∀ q:ћ,good g.b[q]! = true sW:g.W.size=g.C*g.k sW2:g.W.size<2^32 sb:g.b.size<2^32 sN:g.C*(g.ho*g.wo)<2^32 wp2:g.wp<2^32 tb:g.tab=Array.ofFn (n:=g.k) λt=>(D_off g.s t.val).toUInt32 lemma Kh {A:ё} {h:њ}:good (0:њ)=true∧(0:њ) &&& В<=h:=⟨rfl,И.2 (Nat.zero_le _)⟩ lemma Ji {A:ё} (H:∀ k:ћ,k< ѡA->good A[k]! = true) (q:ћ):good A[q]! = true:=by by_cases h:q< ѡA;. exact H q h rw[ػ A q h];rfl lemma Iz {s:ConvShape} {X:ё} {hi:њ} (H:C_Hv X hi) (c yy xx:ћ):good (D_px s X c yy xx)=true∧D_px s X c yy xx &&& В<=hi:=by unfold D_px;split;. exact Kh (A:=X) generalize (c*s.h+(yy-s.pad))*s.w+(xx-s.pad)=n;by_cases h:n< ѡX;. exact ⟨H.2.2.1 n h,H.2.2.2 n h⟩ rw[ػ X n h];exact Kh (A:=X) lemma Ix {g:D_C} (ok:D_Ok g) {o t:ћ} (hC:o< g.C) (ht:t< g.k):D_t0 g o+t< g.s.cin*(g.s.kh*g.s.kw):=by have h1:=ok.hk;have h2:=ok.hC;unfold D_t0;cases hd:g.dw<;>simp[hd] at h1 h2 ⊢;. rwa [<-Nat.mul_assoc,<-h1] exact h1 ▸ Hc (h2 ▸ hC) (h1 ▸ ht) lemma Ih {n a b c:ћ} (h:n< a*(b*c)):0< b∧0< c:=by constructor<;>refine ш λe=>?_<;>simp[e] at h lemma Jn {a b st n m:ћ} (h0:0< st) (hk:b<=a) (hy:n<(a-b)/st+1) (hm:m< b):n*st+m< a:=by have:=Н st (show n<=(a-b)/st by omega);have:=Nat.div_mul_le_self (a-b) st;omega lemma Nb (a p w v u y x:ћ):v*w+u+((a*p+y)*w+x)=(a*p+(v+y))*w+(u+x):=by ring lemma Jd {g:D_C} (ok:D_Ok g) {o y x t:ћ} (hC:o< g.C) (hy:y< g.ho) (hx:x< g.wo) (ht:t< g.k): D_B g y x+D_off g.s (D_t0 g o+t)< g.xd.size ∧ g.xd.data[D_B g y x+D_off g.s (D_t0 g o+t)]! = dv (D_xw g o y x t):=by have hb:=Ix ok hC ht have hk:=Ih hb unfold D_xw generalize D_t0 g o+t=u at hb ⊢ have Mc:=Jn ok.p0 ok.kh (hy.trans_eq ok.ho) (п (u/g.s.kw) hk.1) have Me:=Jn ok.p0 ok.kw (hx.trans_eq ok.wo) (п u hk.2) have hq:=Hc (Hc (у (hb.trans_eq (ж _ _))) Mc) Me rw[D_B,D_off,ok.wp,Nb] refine ⟨Nat.lt_of_lt_of_le hq ok.xd.1,?_⟩ rw[ok.xd.2 _ hq] simp only[D_Fx,Iu _ Me,Iu _ Mc] rfl lemma Je {u v:є} {a b:ћ} (hu:Ѡu=a) (hv:Ѡv=b) (h:a+b<2^32):(u+v).toNat=a+b:=by rw[Bu _ _ א,hu,hv] lemma It {n d:ћ} {b i:є} {off:ѐ} (hs:n<2^32) (hb:∀ j (h:j< ѡoff),Ѡb+off[j].toNat+d< n) (hi:Ѡi< ѡoff): (b+(off.uget i hi).toUSize).toNat=Ѡb+(off[Ѡi]!:ѓ).toNat ∧ Ѡb+(off[Ѡi]!:ѓ).toNat+d< n:=by have h:Ѡb+(off.uget i hi).toNat+d< n:=hb _ hi rw[<-Dk _ _ hi] exact ⟨Je rfl (к _) א,h⟩ lemma Qs {c:D_P} {b:є} (hb:∀ j (h:j< c.off.size),Ѡb+c.off[j].toNat+0< c.g.xd.size) (xf wf:ћ->ѕ) (L:љ):∀ (i:є) (a t:ѕ),Ѡi+ѣL=c.e.toNat → (∀ j p:ћ,L[j]?=some p->c.g.xd.data[Ѡb+(c.off[Ѡi+j]!:ѓ).toNat]! = xf p ∧ c.wd.data[Ѡi+j]! = wf p) → D_goT c.g.xd c.wd c.off b c.e i c.he c.hw c.hs hb a t=L.foldl (λ(acc:F1) p=>let q:=xf p*wf p F1.mk (acc.s+q) (acc.t+q.abs)) ⟨a,t⟩:=by have:=c.he induction' L with p L ih<;>intro i a t h0 H . rw[D_goT,Р (Ir h0.ge)];rfl rw[List.length_cons] at h0 obtain ⟨ht,hu⟩:=Dh h0 have h1:=H 0 p rfl rw[ы] at h1 rw[D_goT,Л ht] simp only[Hi] rw[(It c.hs hb א).1,h1.1,h1.2,ih (i+1) _ _ hu,@List.foldl_cons] intro j q hq rw[Bg i _ ht,Nat.add_right_comm,Ю] exact H (j+1) q hq def D_ff (xf:ћ->ћ->ѕ) (wf:ћ->ѕ) (L:љ) (k:ћ) (a:ѕ):ѕ:= L.foldl (λacc p=>acc+xf k p*wf p) a lemma Sa {c:D_P} {b:є} (hb:∀ j (h:j< c.off.size),Ѡb+c.off[j].toNat+7< c.g.xd.size) (r:D_R) (xf:ћ->ћ->ѕ) (wf:ћ->ѕ) (L:љ):∀ (i:є) (A B C D E F G I:ѕ),Ѡi+ѣL=c.e.toNat → (∀ j p:ћ,L[j]?=some p->c.wd.data[Ѡi+j]! = wf p∧∀ d,d<8 → c.g.xd.data[Ѡb+(c.off[Ѡi+j]!:ѓ).toNat+d]! = xf d p) → D_go8R c.g.xd c.wd c.off b c.e i c.he c.hw c.hs hb A B C D E F G I r=⟨r.t,D_ff xf wf L 0 A,D_ff xf wf L 1 B,D_ff xf wf L 2 C,D_ff xf wf L 3 D,D_ff xf wf L 4 E,D_ff xf wf L 5 F,D_ff xf wf L 6 G,D_ff xf wf L 7 I⟩:=by have:=c.he have:=c.hs induction' L with p L ih<;>intro i A B C D E F G I h0 J . rw[D_go8R,Р (Ir h0.ge)];cases r;rfl rw[List.length_cons] at h0 obtain ⟨ht,hu⟩:=Dh h0 obtain ⟨h1,h2⟩:=J 0 p rfl rw[ы] at h1 h2 obtain ⟨ep,hbd⟩:=It c.hs hb (א:Ѡi< c.off.size) have U:=λ(k:ћ) (hk:k<8)=>(Je ep (uk k א) א).symm ▸ h2 k hk rw[D_go8R,Л ht] simp only[Hi] rw[ep,h1,U 1 א,U 2 א,U 3 א,U 4 א,U 5 א,U 6 א,U 7 א,<-ы (_+_),h2 0 א] refine ih (i+1) _ _ _ _ _ _ _ _ hu λj q hq=>?_ rw[Bg i _ ht,Nat.add_right_comm,Ю] exact J (j+1) q hq structure D_PO (c:D_P) (o:ћ) (L:љ):Prop where ok:D_Ok c.g hC:o< c.g.C len:c.e.toNat=ѣL nd:L.Nodup lt:∀ t∈L,t< c.g.k hz:∀ t,t< c.g.k->t∉L->c.g.W[o*c.g.k+t]! &&& В=0 rd:∀ j p:ћ,L[j]?=some p → (c.off[j]!:ѓ).toNat=D_off c.g.s (D_t0 c.g o+p) ∧ c.wd.data[j]! = dv c.g.W[o*c.g.k+p]! e0:c.e0=nfOf c.g.k*(dv c.g.hi*L.foldl (λacc t=>acc+(dv c.g.W[o*c.g.k+t]!).abs) 0 + (dv c.g.b[o]!).abs) bv:c.bv=dv c.g.b[o]! section variable {c:D_P} {o:ћ} {L:љ} (h:D_PO c o L) {y x:ћ} {b:є} (hy:y< c.g.ho) (hx:x< c.g.wo) (hb:Ѡb=D_B c.g y x) include c o L h y x b hy hx hb lemma Lq:D_finT c o y x b=D_out c.g o y x:=by unfold D_finT;split<;>rename_i hl;swap;. exact Lc .. have e:=Qs (c.h1 b hl) (dv ∘ D_xw c.g o y x) (λp=>dv c.g.W[o*c.g.k+p]!) L 0 0 0 ((З _).trans h.len.symm) λj p hj=>by have h1:=h.rd j p hj;rw[Ck,З,h1.1,hb];exact ⟨(Jd h.ok h.hC hy hx (h.lt p (Գ hj))).2,h1.2⟩ simp only[c.hz,e,h.bv,h.ok.nf];split<;>rename_i hz;. exact Lc .. exact congrArg (act _) (Lr c.g.k h.ok.nk _ _ _ (λt _=>(Iz h.ok.Hx _ _ _).1) (λt _=>h.ok.HW _) (h.ok.Hb _) L h.nd h.lt (λt a b=>.inr (h.hz t a b)) _ _ ⟨rfl,rfl⟩ (by simpa using hz)) lemma Qw {a:ѕ} (ha:a=L.foldl (λacc t=>acc+dv (D_xw c.g o y x t)*dv c.g.W[o*c.g.k+t]!) 0):D_fin c o y x b a=D_out c.g o y x:=by subst ha;simp only[D_fin,h.bv,h.e0];split<;>rename_i hz;. exact Lq h hy hx hb exact congrArg (act _) (Sy c.g.k h.ok.nk _ _ _ _ (λt _=>(Iz h.ok.Hx _ _ _).1) (λt _=>h.ok.HW _) (h.ok.Hb _) h.ok.Hx.1 (λt _=>(Iz h.ok.Hx _ _ _).2) h.ok.Hx.2.1 L h.nd h.lt (λt a b=>.inr (h.hz t a b)) _ _ ⟨rfl,rfl⟩ (by simpa using hz)) end lemma Op {c:D_P} {o:ћ} {L:љ} (h:D_PO c o L) {y x k:ћ} {b:є} (hy:y< c.g.ho) (hx:x+k< c.g.wo) (hb:(b+Ж k).toNat=D_B c.g y (x+k)) {a:ѕ} (ha:a=L.foldl (λacc t=>acc+dv (D_xw c.g o y (x+k) t)*dv c.g.W[o*c.g.k+t]!) 0):D_w c (loOf c.e0) (spR c.g.relu (loOf c.e0)) o y x b k a=D_out c.g o y (x+k):=by unfold D_w;dsimp only;split<;>rename_i hc . obtain ⟨h1,h2⟩:=д.mp hc;have h1:((a+c.bv).toBits <<< (1:і))-loOf c.e0< spR c.g.relu (loOf c.e0):=by simpa using h1 have hr:c.g.relu=false:=by cases hq:c.g.relu;. rfl . rw[hq] at h1;exact absurd h1 (by simp[spR]) rw[hr] at h1;have h1:((a+c.bv).toBits <<< (1:і))-loOf c.e0< spOf (loOf c.e0):=by simpa [spR] using h1 have h2:((a+c.bv).toBits+0x0FEFFFFF) &&& 0x1FFFFFFF<0x1FE00000:=by simpa using h2 obtain ⟨e1,e2⟩:=Po _ _ h1 h2;rw[<-e1];refine (show act c.g.relu (zivT (thOf c.e0) (a+c.bv))=zivT (thOf c.e0) (a+c.bv) by rw[hr];rfl).symm.trans ?_;subst ha;simp only[h.bv,h.e0] at e2 ⊢;exact congrArg (act _) (St c.g.k h.ok.nk _ _ _ _ (λt _=>(Iz h.ok.Hx _ _ _).1) (λt _=>h.ok.HW _) (h.ok.Hb _) h.ok.Hx.1 (λt _=>(Iz h.ok.Hx _ _ _).2) h.ok.Hx.2.1 L h.nd h.lt (λt a b=>.inr (h.hz t a b)) _ _ ⟨rfl,rfl⟩ e2) . unfold D_finK;exact Qw h hy hx hb ha def D_sp (g:D_C) (q:ћ):њ:= D_out g (q/(g.ho*g.wo)) (q/g.wo%g.ho) (q%g.wo) lemma Qp (g:D_C) {o y x:ћ} (hy:y< g.ho) (hx:x< g.wo):D_out g o y x=D_sp g ((o*g.ho+y)*g.wo+x):=by simp only[D_sp,Nat.mul_comm g.ho g.wo,<-Nat.div_div_eq_div_mul,Iu _ hx,Iu _ hy] lemma Jj {g:D_C} (ok:D_Ok g) {o y x:ћ} (hC:o< g.C) (hy:y< g.ho) (hx:x< g.wo):D_B g y x<2^32:=by have h:=(Jd ok hC hy hx ok.pk).1;have:=ok.xs;omega lemma Ik (g:D_C) (y x k:ћ):D_B g y (x+k)=D_B g y x+k*g.s.stride:=by unfold D_B;rw[ف];omega def D_xf (c:D_P) (o:ћ) (b:є) (k p:ћ):ѕ:= c.g.xd.data[Ѡb+D_off c.g.s (D_t0 c.g o+p)+k]! def D_I (c:D_P) (Q x:ћ) (out:ё):Prop:= C_Inv (c.g.C*(c.g.ho*c.g.wo)) (D_sp c.g) (λp=>p< Q+min x c.g.wo) out lemma Sk {c:D_P} {o:ћ} {L:љ} (h:D_PO c o L) {y Q:ћ} (hy:y< c.g.ho) (hQ:Q=(o*c.g.ho+y)*c.g.wo) (hN:Q+c.g.wo<=c.g.C*(c.g.ho*c.g.wo)) (d:ћ): ∀ (x:ћ) (b q:є) (rr:D_R) (out:ё),c.g.wo-x=d → (x< c.g.wo->Ѡb=D_B c.g y x)->(x< c.g.wo->Ѡq=Q+x)->D_I c Q x out → C_Inv (c.g.C*(c.g.ho*c.g.wo)) (D_sp c.g) (λp=>p< Q+c.g.wo) (D_cols c (loOf c.e0) (spR c.g.relu (loOf c.e0)) o y x b q rr out):=by induction' d using Nat.strong_induction_on with d ih intro x b q rr out he hb hq H have sN:=h.ok.sN have S:∀ x',x'< c.g.wo->D_out c.g o y x'=D_sp c.g (Q+x'):=λ_ hx=>hQ ▸ Qp c.g hy hx rw[D_cols] split<;>rename_i h8 . obtain ⟨hx,hf,hl⟩:=h8;have Dc:=hb hx;have Te:=hq hx;have hB:=λk=>(Ik c.g y x k).trans (by rw[h.ok.f4 hf,Nat.mul_one]);have G:=λk (hk:x+k< c.g.wo)=>Je Dc (uk k א) (hB k ▸ Jj h.ok h.hC hy hk);have V:=λk (hk:x+k<=c.g.wo)=>(Je Te (uk k א) א).trans (Ю Q x k) have R:=Sa (c.h8 b hl) rr (D_xf c o b) (λp=>dv c.g.W[o*c.g.k+p]!) L 0 0 0 0 0 0 0 0 0 ((З _).trans h.len.symm) λj p hj=>by have h1:=h.rd j p hj;rw[Ck,З,h1.1];exact ⟨h1.2,λ_ _=>rfl⟩ have wL:c.g.wo<2^32:=by have:=Nat.le_mul_of_pos_left c.g.wo (א:0< c.g.ho);have:=Nat.le_mul_of_pos_left (c.g.ho*c.g.wo) (show 0< c.g.C by have:=h.hC;omega);omega have A:∀ k,k<8->∀ u,D_I c Q (x+k) u->D_I c Q (x+k+1) (D_l c (loOf c.e0) (spR c.g.relu (loOf c.e0)) o y x b q (c.g.wo-x).toUSize k (D_ff (D_xf c o b) (λp=>dv c.g.W[o*c.g.k+p]!) L k 0) u):=λk k8 u H=>by have hN:(Ж k<(c.g.wo-x).toUSize) ↔ x+k< c.g.wo:=by rw[А,uk k א,Gi _ א];omega unfold D_l D_I at *;simp only[hN];split<;>rename_i hk;. rw[Nat.min_eq_left hk.le] at H;rw[Nat.min_eq_left hk];refine Ht sN H (V k א) א ((Op h hy hk ((G k hk).trans (hB k).symm) (List.foldl_ext _ _ _ λ_ p hp=>?_)).trans (S _ hk));simp only[D_xf];rw[Nat.add_right_comm,Dc,<-hB,(Jd h.ok h.hC hy hk (h.lt p hp)).2] . rw[Nat.min_eq_right (Nat.not_lt.1 hk)] at H;rwa [Nat.min_eq_right א] simp only[c.hz,R];exact ih (c.g.wo-(x+8)) א (x+8) _ _ _ _ rfl (λhk=>(G 8 hk).trans (hB 8).symm) (λhk=>V 8 hk.le) (A 7 א _ (A 6 א _ (A 5 א _ (A 4 א _ (A 3 א _ (A 2 א _ (A 1 א _ (A 0 א _ H)))))))) split<;>rename_i h1 . have Dc:=hb h1;unfold D_I at *;rw[Nat.min_eq_left h1.le] at H;refine ih (c.g.wo-(x+1)) א (x+1) _ _ _ _ rfl (λhx=>?_) (λ_=>(Je (hq h1) м א).trans rfl) ?_;. have:=Jj h.ok h.hC hy hx;rw[Ik,و] at this ⊢;exact Je Dc h.ok.st this . rw[Lq h hy h1 Dc,Nat.min_eq_left h1];exact Ht sN H (hq h1) א (S _ h1) unfold D_I at H rwa [Nat.min_eq_right א] at H lemma Il {u v:є} {a b:ћ} (hu:Ѡu=a) (hv:Ѡv=b) (h:a*b<2^32):(u*v).toNat=a*b:=by rw[Gh _ _ (by rw[hu,hv];exact h),hu,hv] lemma Rl {c:D_P} {o:ћ} {L:љ} (h:D_PO c o L) (hN:(o*c.g.ho+c.g.ho)*c.g.wo<=c.g.C*(c.g.ho*c.g.wo)) (d:ћ): ∀ (y:ћ) (q:є) (out:ё),y+d=c.g.ho → Ѡq=(o*c.g.ho+y)*c.g.wo → C_Inv (c.g.C*(c.g.ho*c.g.wo)) (D_sp c.g) (λp=>p<(o*c.g.ho+y)*c.g.wo) out → C_Inv (c.g.C*(c.g.ho*c.g.wo)) (D_sp c.g) (λp=>p<(o*c.g.ho+c.g.ho)*c.g.wo) (D_rows c (loOf c.e0) (spR c.g.relu (loOf c.e0)) o y q out):=by induction' d with d ih<;>intro y q out he hq H . rw[D_rows,Щ א];rwa [(א:y=c.g.ho)] at H have hy:y< c.g.ho:=א have sN:=h.ok.sN have hA:=He (א:o*c.g.ho+y< o*c.g.ho+c.g.ho) (Nat.le_refl c.g.wo) have eW:=Gi c.g.wo א have bB:=Jj h.ok h.hC hy (x:=0) (h.ok.wo ▸ Nat.succ_pos _) have Ta:0< c.g.wp:=h.ok.wp ▸ (Ih (Ix h.ok h.hC h.ok.pk)).2.trans_le h.ok.kw simp[D_B] at bB have:=غ (y*c.g.s.stride) Ta have:=غ y h.ok.p0 rw[D_rows,з hy] refine ih (y+1) _ _ א ?_ ?_<;>rw[<-Ю,Nat.add_one_mul] . exact Je hq eW א exact Sk h hy rfl א c.g.wo 0 _ _ _ _ (Nat.sub_zero _) (λ_ =>(Il (Il (Gi y א) h.ok.st א) (Gi _ h.ok.wp2) bB).trans (by simp[D_B])) (λ_=>hq) (by unfold D_I;rw[Nat.zero_min];exact H) lemma Pu (s:ConvShape) (o:ћ) {p:ћ} (hp:p< s.kh*s.kw): D_off s (o*(s.kh*s.kw)+p)=o*((s.h+2*s.pad)*(s.w+2*s.pad))+D_off s p:=by unfold D_off rw[(Iu o hp).1,о hp,<-Nat.mul_assoc,Nat.add_comm (o*s.kh*s.kw),Nat.add_mul_div_right _ _ (Nat.pos_of_mul_pos_left (Nat.zero_lt_of_lt hp)),Nat.add_mul_mod_self_right,Nat.add_mul_mod_self_right] ring lemma Pk (a b:ћ):a.toUInt32+b.toUInt32=(a+b).toUInt32:=(UInt32.ofNat_add a b).symm lemma Qh {g:D_C} (ok:D_Ok g) (o:ћ) {t:є} (hp:Ѡt< g.k): (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0)+rdW g.tab t=(D_off g.s (D_t0 g o+Ѡt)).toUInt32:=by have h2:=ok.nk rw[Gl _ _ (by simp[ok.tb];omega),ok.tb] generalize Ѡt=p at hp ⊢ rw[в _ p (by simpa using hp),Array.getElem_ofFn] have h1:=ok.hk unfold D_t0 cases hd:g.dw . simp simp only[hd,if_true] at h1 ⊢ rw[h1,Pu g.s o (h1 ▸ hp),ok.wp,Pk] def D_Dc (g:D_C) (o:ћ) (xw:ћ->њ) (sz t:ћ) (off:ѐ) (buf:ђ) (c:є) (l:ѕ):Prop:= Ѡc=(C_keep xw t).length∧ѡoff=sz∧ѡbuf=sz ∧ (∀ k p:ћ,(C_keep xw t)[k]?=some p → (off[k]!:ѓ)=(D_off g.s (D_t0 g o+p)).toUInt32∧buf.data[k]! = dv (xw p)) ∧ l=(C_keep xw t).foldl (λ(a:ѕ) p=>a+(dv (xw p)).abs) 0 section variable {g:D_C} (ok:D_Ok g) include g ok lemma Oq {o' n:є} (o:ћ) (xw:ћ->њ) (hk:Ѡn=g.k) (hn:Ѡn<2^32) (Hh:∀ t:є,t< n->rdW g.W (o'+t)=xw Ѡt) (d:ћ): ∀ (t:є) (off:ѐ) (buf:ђ) (c:є) (l:ѕ) (m:ѓ) (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm),Ѡt+d=Ѡn->D_Dc g o xw Ѡn Ѡt off buf c l → D_Dc g o xw Ѡn Ѡn (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) o' n t off buf c l m hm).off (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) o' n t off buf c l m hm).buf (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) o' n t off buf c l m hm).c (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) o' n t off buf c l m hm).l:=by induction d with | zero=> intro t off buf c l m hm he H rw[D_dec,Р ט] have e:Ѡt=Ѡn:=א rw[e] at H;exact H | succ d ih=> intro t off buf c l m hm he H have ht:t< n:=by rw[А];omega have hu:=Bg t n ht rw[D_dec,Л ht] dsimp only rw[Hh t ht] obtain ⟨h1,h2,h3,h4,h5⟩:=H by_cases hz:xw Ѡt &&& В=0 . rw[з (by simpa using hz)];apply ih (t+1) _ _ _ _ _ _ א;rw[hu,D_Dc,Lz xw _ hz];exact ⟨h1,h2,h3,h4,h5⟩ . rw[Щ (by simpa using hz)];apply ih (t+1) _ _ _ _ _ _ א;have hl:=Eq xw Ѡt;have hc:Ѡc< Ѡt+1:=א;rw[hu,D_Dc,Ld xw _ hz];have Tp:Ѡc< Ѡn:=א;refine ⟨?_,by rw[Gm];exact h2,by rw[Gt];exact h3,λk p hk2=>?_,by rw[List.foldl_append,<-h5];rfl⟩;. rw[Bu _ _ (by rw[м];omega),м,h1];simp . rw[Go _ _ _ _ א א,Gj _ _ _ _ א א];rw[List.getElem?_append,<-h1] at hk2;by_cases e:k=Ѡc;. subst e;simp at hk2;subst hk2;rw[е rfl,е rfl];exact ⟨Qh ok o א,rfl⟩ . rw[г e,г e];by_cases e2:k< Ѡc;. rw[з e2] at hk2;exact h4 k p hk2 . rw[Щ e2] at hk2;obtain ⟨z,hz'⟩:∃ z,k-Ѡc=z+1:=⟨k-Ѡc-1,by omega⟩;rw[hz'] at hk2;simp at hk2 lemma Qj {o:ћ} (hC:o< g.C) {off:ѐ} {buf:ђ} (h2:ѡoff=g.k) (h3:ѡbuf=g.k) (m:ѓ) (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm): D_Dc g o (λp=>g.W[o*g.k+p]!) g.k g.k (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) (o*g.k).toUSize g.k.toUSize 0 off buf 0 0 m hm).off (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) (o*g.k).toUSize g.k.toUSize 0 off buf 0 0 m hm).buf (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) (o*g.k).toUSize g.k.toUSize 0 off buf 0 0 m hm).c (D_dec g.tab g.W (if g.dw then (o*((g.s.h+2*g.s.pad)*g.wp)).toUInt32 else 0) (o*g.k).toUSize g.k.toUSize 0 off buf 0 0 m hm).l:=by have hX:=ok.sW2 have hP:=(He hC (Nat.le_refl g.k)).trans_eq ok.sW.symm have eo:(o*g.k).toUSize.toNat=o*g.k:=Gi _ א have ek:g.k.toUSize.toNat=g.k:=Gi _ א have D:=Oq (o':=(o*g.k).toUSize) (n:=g.k.toUSize) ok o (λp=>g.W[o*g.k+p]!) ek (by rw[ek];omega) (λt ht=>by have h4:=А.mp ht rw[ek] at h4 rw[Gl _ _ hX,Bu _ _ (by rw[eo];omega),eo]) g.k 0 off buf 0 0 m hm (by rw[Ck,ek,З]) ⟨by simp[C_keep],by rw[ek];exact h2,by rw[ek];exact h3,λk p hk=>by simp[C_keep] at hk,by simp[C_keep]⟩ rw[ek] at D exact D lemma Rt (hs:g.xd.size<2^32) (d:ћ): ∀ (o:ћ) (q:є) (off:ѐ) (buf:ђ) (m:ѓ) (hm:∀ j (h:j< ѡoff),off[j].toNat<=Ѡm) (out:ё),o+d=g.C->Ѡq=o*(g.ho*g.wo)->ѡoff=g.k->ѡbuf=g.k → C_Inv (g.C*(g.ho*g.wo)) (D_sp g) (λp=>p< o*(g.ho*g.wo)) out → C_Inv (g.C*(g.ho*g.wo)) (D_sp g) (λp=>p< g.C*(g.ho*g.wo)) (D_outs g hs o q off buf m hm out):=by induction' d with d ih<;>intro o q off buf m hm out he hq h2 h3 H . rw[D_outs,Щ א];rwa [(א:o=g.C)] at H have hC:o< g.C:=א have hkn:=ok.nk have sW2:=ok.sW2 have sN:=ok.sN have hP:=(He hC (Nat.le_refl g.k)).trans_eq ok.sW.symm have hO:=He hC (Nat.le_refl (g.ho*g.wo)) have eB:rdW g.b Ѣo=g.b[o]!:=by rw[Gl _ _ ok.sb,Gi _ (by have:=غ o ok.pk;omega)] obtain ⟨d1,d2,d3,d4,d5⟩:=Qj ok hC h2 h3 m hm obtain ⟨k1,k2,k3⟩:=Ku (λp=>g.W[o*g.k+p]!) g.k have Da:=d1.trans_le (Eq _ _) rw[D_outs,з hC] dsimp only rw[Л א,eB] refine ih (o+1) _ _ _ _ _ _ א (Nat.add_one_mul o _ ▸ Je hq (Gi _ א) א) d2 d3 ?_ have E:(o*g.ho+g.ho)*g.wo=o*(g.ho*g.wo)+g.ho*g.wo:=by ring rw[Nat.add_one_mul,<-E] rw[<-Nat.mul_assoc o] at hq H refine Rl (L:=C_keep _ g.k) ⟨ok,hC,d1,k1,k2,k3,λj p hj=>?_,by dsimp only;rw[ok.nf,d5],rfl⟩ (by dsimp only;omega) g.ho 0 q out (З _) hq H have hjl:=(List.getElem?_eq_some_iff.mp hj).1 refine ⟨?_,(d4 j p hj).2⟩ dsimp only rw[(d4 j p hj).1] simpa using Nat.mod_eq_of_lt ((Nat.lt_of_add_left_lt (Jd ok hC (y:=0) (x:=0) (ok.ho ▸ Nat.succ_pos _) (ok.wo ▸ Nat.succ_pos _) (k2 _ (List.mem_of_getElem? hj))).1).trans ok.xs) end lemma Ro (A:ѐ) (n:є) (hn:Ѡn<=ѡA) (d:ћ): ∀ (i:є) (lo hi:ѓ),Ѡi+d=Ѡn->scan A n i hn lo hi= if 0x007FFFFF<=(D_scan A n i hn lo hi).lo∧(D_scan A n i hn lo hi).hi<Ш then (D_scan A n i hn lo hi).hi else Д:=by induction' d with d ih<;>intro i lo hi he<;>rw[scan,D_scan] . simp only[dite_eq_right (Ir he.ge)] simp only[dite_eq_left (Dh he).1] exact ih (i+1) _ _ (Dh he).2 lemma Rx (s:ConvShape) {c r q:ћ} (hr:r< s.kh) (hq:q< s.kw):D_off s ((c*s.kh+r)*s.kw+q)=(c*(s.h+2*s.pad)+r)*(s.w+2*s.pad)+q:=by have k0:0< s.kw:=א;have h0:0< s.kh:=א;have e1:((c*s.kh+r)*s.kw+q)/s.kw=c*s.kh+r:=by rw[Nat.add_comm,Nat.add_mul_div_right _ _ k0,о hq,З] have e2:((c*s.kh+r)*s.kw+q)%s.kw=q:=by rw[Nat.add_comm,Nat.add_mul_mod_self_right,Й hq] have e3:(c*s.kh+r)%s.kh=r:=by rw[Nat.add_comm,Nat.add_mul_mod_self_right,Й hr] have e4:(c*s.kh+r)/s.kh=c:=by rw[Nat.add_comm,Nat.add_mul_div_right _ _ h0,о hr,З] unfold D_off;rw[ж s.kh s.kw,<-Nat.div_div_eq_div_mul,e1,e4,e3,e2] lemma Qe (s:ConvShape) (k d:ћ):∀ (t c r q:ћ) (a:ѐ),t+d=k → t=(c*s.kh+r)*s.kw+q->r< s.kh->q< s.kw → a=(Array.ofFn (n:=t) λi=>(D_off s i.val).toUInt32) → D_tq k s.kw s.kh (s.h+2*s.pad) (s.w+2*s.pad) t c r q a=Array.ofFn (n:=k) λi=>(D_off s i.val).toUInt32:=by induction d with | zero=> intro t c r q a h1 _ _ _ h5 have e:t=k:=h1 subst e rw[D_tq,г (Nat.lt_irrefl _)] exact h5 | succ d ih=> intro t c r q a h1 h2 h3 h4 h5 have hp:a.push ((c*(s.h+2*s.pad)+r)*(s.w+2*s.pad)+q).toUInt32=Array.ofFn (n:=t+1) λi=>(D_off s i.val).toUInt32:=by rw[<-Rx s h3 h4,<-h2,h5,Array.ofFn_succ] rfl rw[D_tq,е א] dsimp only rw[hp] split . exact ih (t+1) c r (q+1) _ א א h3 (by assumption) rfl split . have e:(c*s.kh+(r+1))*s.kw=(c*s.kh+r)*s.kw+s.kw:=by ring exact ih (t+1) c (r+1) 0 _ א א (by assumption) א rfl . have e2:s.kh=r+1:=א;have e:((c+1)*s.kh+0)*s.kw=(c*s.kh+r)*s.kw+s.kw:=by rw[e2];ring exact ih (t+1) (c+1) 0 0 _ א א א א rfl lemma Qi {g:D_C} (ok:D_Ok g) (hs:g.xd.size<2^32): D_outs g hs 0 0 (К g.k 0) (pushZ g.k.toUSize 0 (Б g.k)) 0 (Ii g.k) (К (g.C*(g.ho*g.wo)) 0)=if g.dw then depthwiseSpec g.s g.relu g.X g.W g.b else conv2dSpec g.s g.relu g.X g.W g.b:=by refine (Gg (Rt ok hs g.C 0 0 _ _ _ _ _ (З _) ג ג ((Gf g.k.toUSize g.k 0 _ ((З _).trans (Gi g.k (ok.nk.trans ב)).symm)).trans (З _)) ⟨by simp,λq _ h=>א⟩) λq h=>h).trans ?_ obtain ⟨dw,_,_,s,_,_,_,k,C,ho,wo⟩:=g obtain ⟨h1,h2,h3,h4⟩:=ok cases dw<;>simp at h1 h2 h3 h4<;>subst h1 h2 h3 h4 <;>refine congrArg (Array.ofFn (n:=_)) (funext λq=>?_)<;>simp[D_sp,D_out,D_xw,D_t0] def D_Zs (F:ћ->ѕ) (S m:ћ) (a:ђ):Prop:= ѡa=S∧S<2^32∧∀ q,q< S->a.data[q]! = if q< m then F q else dv 0 section variable {F:ћ->ѕ} {S m:ћ} {a:ђ} include F S m a lemma Gr (d:ћ) (H:D_Zs F S m a) (hv:∀ u,u< d->F (m+u)=dv 0):D_Zs F S (m+d) a:=by refine ⟨H.1,H.2.1,λq hq=>?_⟩;rw[H.2.2 q hq];by_cases h1:q< m;. rw[е h1,е (Nat.lt_add_right d h1)] rw[г h1];by_cases h2:q< m+d;. have e:=hv (q-m) א;rw[Nat.add_sub_cancel' (Nat.not_lt.1 h1)] at e;rw[е h2,e] rw[г h2] lemma Rb (H:D_Zs F S m a) (i:є) (hi:Ѡi=m) (hm:m< S):D_Zs F S (m+1) (wrF a i (F m)):=by have hz:ѡa<2^32:=H.1 ▸ H.2.1;refine ⟨(Gt ..).trans H.1,H.2.1,λq hq=>?_⟩;rw[Gj _ _ _ _ hz (by rw[hi,H.1];exact hm),hi];by_cases e:q=m;. rw[е e,е א,e] rw[г e,H.2.2 q hq];by_cases h:q< m;. rw[е h,е א] rw[г h,г א] end lemma Ri {F:ћ->ѕ} {S:ћ} {X:ѐ} {o n:є} (hs:ѡX<2^32) (ho:Ѡo+Ѡn<=ѡX) (d:ћ): ∀ (t q:є) (m:ћ) (a:ђ),Ѡt+d=Ѡn->Ѡq=m->m+d<=S → D_Zs F S m a->(∀ j,j< d->F (m+j)=dv X[Ѡo+Ѡt+j]!) → D_Zs F S (m+d) (D_cpz X o n t q hs ho a):=by induction' d with d ih<;>intro t q m a he hq hm H hv . rw[D_cpz,Р (Ir he.ge)];exact H obtain ⟨ht,hu⟩:=Dh he rw[D_cpz,Л ht,Iq] have hS:=H.2.1 have e:∀ h',dv (X.uget (o+t) h')=F m:=λh'=>by rw[Dk,Bu _ _ א];exact (hv 0 א).symm rw[e] refine ih (t+1) (q+1) (m+1) _ hu ?_ א (Rb H q hq א) λj hj=>?_ . exact (Bu q 1 (by rw[м];omega)).trans (by rw[м,hq]) simpa only [Bg t n ht,Nat.add_assoc,Nat.add_comm 1] using hv (j+1) א lemma Sj (s:ConvShape) (X:ѐ) (hs:ѡX<2^32) (hX:ѡX=s.cin*s.h*s.w) (hh:s.h+2*s.pad<2^32) (hw:s.w+2*s.pad<2^32) {R S:ћ} (hR:R=s.cin*(s.h+2*s.pad)) (hS:R*(s.w+2*s.pad)<=S) (d:ћ): ∀ (r:ћ) (a:ђ),r+d=R → D_Zs (D_Fx s X) S (r*(s.w+2*s.pad)) a → D_Zs (D_Fx s X) S (R*(s.w+2*s.pad)) (D_imz s X hs (s.w+2*s.pad) R r a):=by induction' d with d ih<;>intro r a he H . rw[D_imz,Р א,<-he];exact H have hr:r< R:=א have hc:=у (hr.trans_eq (hR.trans (ж _ _))) have ep:=Gi s.pad א have ew:=Gi s.w א have hO:=λg:r%(s.h+2*s.pad)-s.pad< s.h=>He (Hc hc g) (Nat.le_refl s.w) have hT:=H.2.1 rw[D_imz,Л hr] dsimp only split<;>rename_i g . obtain ⟨g1,g2,g3⟩:=g;have:=hO g2;have hl:(r+1)*(s.w+2*s.pad)<=R*(s.w+2*s.pad):=Н _ hr;rw[ز,Iw] at hl;apply ih (r+1) _ א;rw[ز,Iw];refine Gr s.pad (Ri hs g3 s.w 0 _ _ _ (by rw[ew];exact З _) (Gi _ א) א (Gr s.pad H λu hu=>?_) λj hj=>?_) λu hu=>?_;. rw[Iv _ _ _ א,D_px,е א] . rw[Ю,Iv _ _ _ א,D_px,г א,Nat.add_sub_cancel_left,Gi _ א];rfl . rw[Ю,Ю,Iv _ _ _ א,D_px,е א] apply ih (r+1) _ א rw[ز] exact Gr _ H λu hu=>by rw[Iv _ _ _ hu,D_px,е] by_contra n have:=hO א exact g ⟨by omega,by omega,by rw[Gi _ א,ew,hX];exact this⟩ lemma Dy (F:ћ->ѕ) {S:ћ} (N:є) (c:ћ) (hN:ѠN=S) (hS:S<2^32):D_Zs F S 0 (D_fill (dv 0) N 0 (Б c)):=by have h:=Li (F:=λ_=>dv 0) (v:=dv 0) (n:=N) S 0 0 (Б c) (by rw[Ck,hN,З]) ⟨rfl,λq hq=>absurd hq (س q)⟩ λ_ _ _=>rfl;rw[З] at h;exact ⟨h.1,hS,λq hq=>by rw[г (س q)];exact h.2 q hq⟩ lemma Rf (F:ћ->ѕ) (n:ћ) (h:n<=16384):∃ S,n<=S∧D_Zs F S 0 (D_zs n):=by unfold D_zs;split;. exact ⟨512,‹_›,Dy F 512 512 (uk 512 ב) ב⟩ split;. exact ⟨1024,‹_›,Dy F 1024 1024 (uk 1024 ב) ב⟩ split;. exact ⟨2048,‹_›,Dy F 2048 2048 (uk 2048 ב) ב⟩ split;. exact ⟨4096,‹_›,Dy F 4096 4096 (uk 4096 ב) ב⟩ split;. exact ⟨8192,‹_›,Dy F 8192 8192 (uk 8192 ב) ב⟩ exact ⟨16384,h,Dy F 16384 16384 (uk 16384 ב) ב⟩ lemma Ra (s:ConvShape) (X:ѐ) (a:ѡX<2^32) (e:ѡX=s.cin*s.h*s.w) (p:s.h+2*s.pad<2^32) (q:s.w+2*s.pad<2^32): D_Sp (D_Fx s X) (s.cin*(s.h+2*s.pad)*(s.w+2*s.pad)) (D_xs s X a (s.w+2*s.pad) (s.cin*(s.h+2*s.pad))):=by unfold D_xs split<;>rename_i hz . obtain ⟨S,h1,h2⟩:=Rf (D_Fx s X) _ hz;have P:=Sj s X a e p q (S:=S) rfl א _ 0 _ (З _) (by rw[Nat.zero_mul];exact h2);exact ⟨by rw[P.1];omega,λt ht=>by rw[P.2.2 t א,е ht]⟩ have Pz:=Sl s X a e p q rfl _ 0 (Б (s.cin*(s.h+2*s.pad)*(s.w+2*s.pad)+7)) (З _) ⟨by rw[Nat.zero_mul];rfl,λq hq=>א⟩ exact Oj 7 7 0 _ (by rw[Ck,З];exact (uk 7 ב).symm) ⟨Nat.le_of_eq Pz.1.symm,Pz.2⟩ lemma Kj (dw:ј) (s:ConvShape) (relu:ј) (X W b:ѐ) {k C:ћ} (hk:k=if dw then s.kh*s.kw else s.cin*s.kh*s.kw) (hC:C=if dw then s.cin else s.cout): D_F dw s relu X W b k C=if dw then depthwiseSpec s relu X W b else conv2dSpec s relu X W b:=by unfold D_F dsimp only rw[Bt] split;swap;rfl split;swap;rfl rename_i hg hs obtain ⟨a,c,d,e,f,-,i,j,l,m,n,o,p,q,r,t,u,-,v,x⟩:=hg have y:=Ro X X.usize (Cc X) X.usize.toNat 0 Д 0 (З _) rw[з ⟨c,d⟩] at y have Hx:=y ▸ Gs X a (by rw[y];intro h;rw[h] at d;exact absurd d ה) refine (Qi ?_ _).trans ?_ have Ho:k≠0:=א rw[hk] at Ho have k1:0< s.kh:=ш λz=>Ho (by rw[z];simp) have k2:0< s.kw:=ш λz=>Ho (by rw[z];simp) exact ⟨hk,hC,rfl,rfl,rfl,Gi _ j,rfl,λh=>beq_iff_eq.1 (д.1 h).1,i,l,m,n,o,Ra s X a e p q,hs,Hx,Ji (Ha W r v).2.2.1,Ji (Ha b t x).2.2.1,f,r,t,u,q,Qe s k k 0 0 0 0 _ (З _) ג k1 k2 (by simp[Array.emptyWithCapacity_eq])⟩ rfl lemma Sf:convF=conv2dSpec:=by funext s r X W b;exact Kj false s r X W b rfl rfl lemma Sn:depthF=depthwiseSpec:=by funext s r X W b;exact Kj true s r X W b rfl rfl end @[inline] def sm (w:ѓ):ј:=good w && (w &&& В)<=0x70FFFFFF section open Float.Model Float.Model.UnpackedFloat def T_r (N:ћ):ћ:= N/2^39+if 2^38< N%2^39∨(N%2^39=2^38∧(N/2^39)%2=1) then 1 else 0 lemma Nq (N:ћ):FloatLib.Numerics.roundShiftRightEven N 39=T_r N:=by have a:Nat.shiftRight N 39=N/2^39:=ص N 39;have b:N-Nat.shiftLeft (N/2^39) 39=N%2^39:=by rw[show Nat.shiftLeft (N/2^39) 39=N/2^39*2^39 from ذ _ _];omega rw[FloatLib.Numerics.roundShiftRightEven_def];simp only[show (39== 0)=false from rfl,false_eq_true,ite_false,a,b,beq_iff_eq];unfold T_r;split_ifs<;>omega set_option maxRecDepth 8192 in lemma Ow (neg:ј) (N:ћ) (e':Int) (Hw:2^62<=N) (Hu:N<2^63) (h1:-148<=e'+39) (h2:e'+39+150<=253): toWord (Model.ofModel Fmt (UnpackedFloat.round Format.binary32 (н neg) N e'))=э ((if neg then 2^31 else 0)+(e'+39+149).toNat*2^23+T_r N):=by have Mh:2^23<=T_r N:=by unfold T_r;split<;>omega have hr2:T_r N<=2^24:=by unfold T_r;split<;>omega have hT:Format.binary32.targetExponent (totalExponent N e')=e'+39:=by simp only[totalExponent,Fx N 62 Hw Hu,Jb];omega have K:∀ (P:ћ) (E:Int) (hp:0< P),2^23<=P->P<2^24->-149<=E->E<=104 → (E+150).toNat*2^23+P%2^23=(e'+39+149).toNat*2^23+T_r N → toWord (Model.ofModel Fmt (.finite (н neg) P E hp))=э ((if neg then 2^31 else 0)+(e'+39+149).toNat*2^23+T_r N):=by intro P E hp a b c d e simp only[toWord,Model.toNatBits,Model.ofModel,Model.ofModelBits] congr 1 show (UnpackedFloat.pack Format.binary32 _).toNat=_ rw[Lw _ _ _ _ a b א א] cases neg<;>simp[Model.modelSign]<;>omega rw[Model.round_exact_eq_finishRoundedMantissa _ _ _ _ א,hT,Model.roundMantissaAtExponentEven,з א,show (e'+39-e').toNat=39 by omega,Nq] by_cases hc:T_r N=2^24 . have h:=Model.finishRoundedMantissa_normalized_carry FloatFormat.binary32 (н neg) (e'+39+23) (by show -126<=e'+39+23;omega);rw[show e'+39+23-(FloatFormat.binary32.fracWidth:ℤ)=e'+39 by show e'+39+23-23=_;omega,show e'+39+23+1-(FloatFormat.binary32.fracWidth:ℤ)=e'+40 by show e'+39+23+1-23=_;omega] at h;rw[show Model.finishRoundedMantissa Format.binary32 (н neg) (T_r N,e'+39)=.finite (н neg) (2^23) (e'+40) ב by rw[hc];exact h] exact K (2^23) (e'+40) ב le_rfl ב א א (by rw[hc,show (e'+40+150).toNat=(e'+39+149).toNat+2 by omega];omega) . rw[Ey _ _ _ Mh א א א] exact K _ _ _ Mh א א א (by rw[show (e'+39+150).toNat=(e'+39+149).toNat+1 by omega];omega) @[inline] def T_rd (neg:ј) (mag e0 L:і):ѓ:= let n:=mag <<< (62-L) let q:=n >>> 39 let rm:=n &&& 0x7FFFFFFFFF let w:=((e0+L-24) <<< 23)+q + (if rm > 0x4000000000 || (rm== 0x4000000000 && q &&& 1== 1) then 1 else 0) (if neg then w ||| ط else w).toUInt32 lemma Qz (neg:ј) (mag e0:і) (h0:Ѡmag≠0) (h1:Ѡmag<2^63) (h2:24< Ѡe0+mag.toNat.log2) (h3:Ѡe0+mag.toNat.log2<277):T_rd neg mag e0 mag.log2=toWord (Я Fmt ⟨neg,Ѡmag,(Ѡe0:Int)-150⟩):=by have l0:=Nat.log2_self_le h0;have l1:Ѡmag<2^(mag.toNat.log2+1):=Nat.lt_log2_self;have hL:mag.toNat.log2<=62:=Nat.lt_succ_iff.1 ((Nat.log2_lt h0).2 h1);obtain ⟨L,hLd⟩:∃ L,L=mag.toNat.log2:=⟨_,rfl⟩;rw[<-hLd] at l0 l1 hL h2 h3;have eL:mag.log2.toNat=L:=hLd.symm;obtain ⟨N,hN⟩:∃ N,N=Ѡmag*2^(62-L):=⟨_,rfl⟩;have p:2^L*2^(62-L)=2^62:=by rw[<-Nat.pow_add];congr 1;omega have Hw:2^62<=N:=by rw[hN,<-p];exact Н _ l0 have Hu:N<2^63:=by have:=Nat.mul_lt_mul_of_pos_right l1 (Nat.two_pow_pos (62-L));rwa [<-hN,<-Nat.pow_add,show L+1+(62-L)=63 by omega] at this rw[Mb,<-ExactRuntime.round_scale _ _ _ _ (62-L) h0,<-hN,Ow neg N _ Hw Hu א א];have eT:((Ѡe0:Int)-150-((62-L:ћ):Int)+39+149).toNat=Ѡe0+L-24:=by omega rw[eT];unfold T_rd;dsimp only;have e1:(62-mag.log2).toNat=62-L:=by rw[toNat_sub_of_le _ _ (П.2 (by rw[eL];exact hL)),eL];rfl have a1:(mag <<< (62-mag.log2)).toNat=N:=by rw[UInt64.toNat_shiftLeft,e1,Й (by omega:62-L<64),ذ,<-hN,Й א] generalize mag <<< (62-mag.log2)=n at a1;have a2:(n >>> 39).toNat=N/2^39:=by rw[У,a1];simp[Nat.shiftRight_eq_div_pow] have a3:(n &&& 0x7FFFFFFFFF).toNat=N%2^39:=by rw[с,a1];exact Е N 39 generalize n >>> 39=q at a2;generalize n &&& 0x7FFFFFFFFF=rm at a3;have a4:(q &&& 1).toNat=Ѡq%2:=by rw[с];exact Е _ 1 have a5:(e0+mag.log2-24).toNat=Ѡe0+L-24:=by rw[toNat_sub_of_le _ _ (П.2 (by rw[Т,eL,Й א];show 24<=_;omega)), Т,eL,Й א] rfl have a6:((e0+mag.log2-24) <<< 23).toNat=(Ѡe0+L-24)*2^23:=by rw[UInt64.toNat_shiftLeft,a5,ذ];show _*2^23%_=_;rw[Й א] generalize (e0+mag.log2-24) <<< 23=hi at a6;have Td:(decide (rm > 0x4000000000) || (rm== 0x4000000000 && q &&& 1== 1))=decide (2^38< N%2^39∨(N%2^39=2^38∧(N/2^39)%2=1)):=by apply Bool.eq_iff_iff.2;simp only[or_eq_true,and_eq_true,decide_eq_true_eq,beq_iff_eq,gt_iff_lt,UInt64.lt_iff_toNat_lt,<-UInt64.toNat_inj,a3,a4,a2];rfl rw[Td];obtain ⟨c,hc⟩:∃ c,c=decide (2^38< N%2^39∨(N%2^39=2^38∧(N/2^39)%2=1)):=⟨_,rfl⟩;rw[<-hc];have hr:T_r N=N/2^39+if c=true then 1 else 0:=by rw[hc,T_r];simp only[decide_eq_true_eq] have hq:N/2^39<2^24:=א;have hw:(hi+q+(if c=true then (1:і) else 0)).toNat=(Ѡe0+L-24)*2^23+T_r N:=by rw[Т,Т,a6,a2,hr];cases c<;>simp only[false_eq_true,ite_false,ite_true] <;>(try rw[show (1:і).toNat=1 from rfl])<;>(try rw[show (0:і).toNat=0 from rfl])<;>omega generalize hi+q+(if c=true then (1:і) else 0)=w at hw;have Tb:Ѡw<2^31:=by rw[hw,hr];split<;>omega apply Ч.mp;rw[ю];cases neg;. simp only[false_eq_true,ite_false,UInt64.toNat_toUInt32,Nat.zero_add,hw] . simp only[ite_true,UInt64.toNat_toUInt32,UInt64.toNat_or];have h5:Ѡw ||| (2147483648:і).toNat=2^31+Ѡw:=by have:=Nat.two_pow_add_eq_or_of_lt Tb 1;simp only[Nat.mul_one] at this;rw[this,Nat.or_comm];rfl rw[h5];congr 1;omega lemma Nd (w:ѓ) (h:(w &&& В)=0):М w=0:=by have h1:=Di w;rw[h] at h1;have h2:=w.toNat_lt have h3:w=0∨w=ط:=by have:Ѡw=0∨Ѡw=2147483648:=by simp at h1;omega rcases this with e | e;. exact Or.inl (Ч.mp (by simpa using e)) . exact Or.inr (Ч.mp (by simpa using e)) have h4:expOf w=0∧fracOf w=0:=by rcases h3 with rfl | rfl<;>decide simp[rationalWord,decodeD,h4,toRat_eq_zero_iff] @[inline] def T_e (w:ѓ):і:= if w &&& В== 0 then 255 else (expOf w).toUInt64 @[inline] def T_m (w:ѓ):і:= if w &&& В== 0 then 0 else (fracOf w+0x800000).toUInt64 @[inline] def T_s (e0:і) (w:ѓ):і:=T_m w <<< (T_e w-e0) @[inline] def T_ok (e0:і) (w:ѓ):ј:= good w && (w &&& В== 0 || (e0<=T_e w && T_e w-e0<=37)) @[inline] def T_p (e0:і) (w:ѓ) (p:і):і:= if signOf w then p else p+T_s e0 w @[inline] def T_n (e0:і) (w:ѓ) (n:і):і:= if signOf w then n+T_s e0 w else n lemma Nw (e0:і) (w:ѓ) (h:T_ok e0 w=true): (T_s e0 w).toNat<2^61∧М w= (if signOf w then -((T_s e0 w).toNat:ℚ) else ((T_s e0 w).toNat:ℚ)) * 2^((Ѡe0:Int)-150):=by unfold T_ok at h simp only[and_eq_true,or_eq_true,beq_iff_eq,decide_eq_true_eq] at h obtain ⟨hg,hz⟩:=h by_cases h0:w &&& В=0 . have hs:T_s e0 w=0:=by unfold T_s T_m;simp[h0] rw[hs,Nd w h0];simp . obtain ⟨h1,h2⟩:=hz.resolve_left h0;have g:=Dm w hg;have a0:(w &&& В).toNat≠0:=λe=>h0 (Ч.mp (by simpa using e));rw[Di] at a0;have hx:=Dl w;have hf:(fracOf w).toNat=Ѡw%2^23:=Dj w;have hl:=w.toNat_lt;have x1:1<=(expOf w).toNat:=א;have x2:(expOf w).toNat<=254:=א;have f1:(fracOf w).toNat<2^23:=א;have ee:(T_e w).toNat=(expOf w).toNat:=by unfold T_e;simp[h0] have em:(T_m w).toNat=2^23+(fracOf w).toNat:=by unfold T_m;simp only[h0,beq_iff_eq,if_false,UInt32.toNat_toUInt64];rw[UInt32.toNat_add,Й (by show _+8388608< _;omega)];show _+8388608=_;omega have l1:=П.1 h1;have l2:=П.1 h2;rw[toNat_sub_of_le _ _ h1,ee] at l2;rw[ee] at l1;have l3:(expOf w).toNat-Ѡe0<=37:=l2 have es:(T_s e0 w).toNat=(2^23+(fracOf w).toNat)*2^((expOf w).toNat-Ѡe0):=by unfold T_s;have sh:(T_e w-e0).toNat%64=(expOf w).toNat-Ѡe0:=by rw[toNat_sub_of_le _ _ h1,ee];exact Й א rw[UInt64.toNat_shiftLeft,em,sh,ذ];apply Й;have:2^((expOf w).toNat-Ѡe0)<=2^37:=Nat.pow_le_pow_right ב l3;have:(2^23+(fracOf w).toNat)*2^((expOf w).toNat-Ѡe0)<=2^24*2^37:=Nat.mul_le_mul א this;omega refine ⟨?_,?_⟩;. have a:2^((expOf w).toNat-Ѡe0)<=2^37:=Nat.pow_le_pow_right ב l3;have b:(2^23+(fracOf w).toNat)*2^((expOf w).toNat-Ѡe0)<=(2^24-1)*2^37:=Nat.mul_le_mul א a;rw[es];omega . have nz:expOf w≠0:=λe=>by rw[e] at x1;simp at x1 have ew:(2:ℚ)^(((expOf w).toNat:Int)-150)=2^((expOf w).toNat-Ѡe0)*2^((Ѡe0:Int)-150):=by rw[<-ь,<-б Х];congr 1;omega rw[es];simp only[rationalWord,decodeD,nz,ite_false,FloatLib.Numerics.Dyadic.toRat,signedSignificand,ew];cases signOf w<;>simp<;>ring lemma Ka (e0:і) (w:ѓ) (p n:і) (V:ℚ) (B C:ћ) (hC:C=2^61-1) (hB:B+C<2^63) (hw:T_ok e0 w=true) (hp:Ѡp<=B) (hn:Ѡn<=B) (hV:V=((Ѡp:ℚ)-Ѡn)*2^((Ѡe0:Int)-150)): (T_p e0 w p).toNat<=B+C∧(T_n e0 w n).toNat<=B+C ∧ V+М w=(((T_p e0 w p).toNat:ℚ)-(T_n e0 w n).toNat) * 2^((Ѡe0:Int)-150):=by obtain ⟨h1,h2⟩:=Nw e0 w hw have h3:(T_s e0 w).toNat<=C:=א unfold T_p T_n rw[h2,hV] cases signOf w . simp only[false_eq_true,ite_false];have e:(p+T_s e0 w).toNat=Ѡp+(T_s e0 w).toNat:=by rw[Т];exact Й א rw[e];refine ⟨by omega,by omega,?_⟩;push_cast;ring . simp only[ite_true];have e:(n+T_s e0 w).toNat=Ѡn+(T_s e0 w).toNat:=by rw[Т];exact Й א rw[e];refine ⟨by omega,by omega,?_⟩;push_cast;ring @[inline] def T_fin (p n e0:і) (f:Unit->ѓ):ѓ:= if p== n then f () else let mag:=if p< n then n-p else p-n let L:=mag.log2 if e0+L<=24 || e0+L ≥ 277 then f () else T_rd (decide (p< n)) mag e0 L lemma Lm (p n e0:і) (f:Unit->ѓ) (hp:Ѡp<2^63) (hn:Ѡn<2^63) (he:Ѡe0<=255) (R:ѓ) (hf:f ()=R) (hR:p≠n->∃ d:FloatLib.Numerics.Dyadic, d.toRat=((Ѡp:ℚ)-Ѡn)*2^((Ѡe0:Int)-150) ∧ R=toWord (Я Fmt d)):T_fin p n e0 f=R:=by unfold T_fin split . exact hf . rename_i Ei;have hne':p≠n:=λe=>Ei (by simp[e]);have Th:Ѡp≠Ѡn:=λe=>hne' (UInt64.toNat_inj.mp e);obtain ⟨d,hd,hR⟩:=hR hne';dsimp only;obtain ⟨mag,hm⟩:∃ m,m=if p< n then n-p else p-n:=⟨_,rfl⟩;rw[<-hm] have Tm:Ѡmag≠0∧Ѡmag<2^63 ∧ (((if decide (p< n)=true then -(Ѡmag:ℚ) else (Ѡmag:ℚ)))=(Ѡp:ℚ)-Ѡn):=by by_cases c:p< n . have c':=О.1 c;have:Ѡmag=Ѡn-Ѡp:=by rw[hm,е c,toNat_sub_of_le _ _ (П.2 c'.le)] refine ⟨by omega,by omega,?_⟩;rw[this,Nat.cast_sub c'.le];simp[c] . have c':Ѡn<=Ѡp:=by have:=О.not.1 c;omega have:Ѡmag=Ѡp-Ѡn:=by rw[hm,г c,toNat_sub_of_le _ _ (П.2 c')] refine ⟨by omega,by omega,?_⟩;rw[this,Nat.cast_sub c'];simp[c] obtain ⟨m0,m1,m2⟩:=Tm;split;. exact hf . rename_i hb;simp only[or_eq_true,decide_eq_true_eq,not_or,ge_iff_le] at hb;obtain ⟨b1,b2⟩:=hb;have eL:mag.log2.toNat=mag.toNat.log2:=rfl;have hL:mag.toNat.log2<=62:=by have:=(Nat.log2_lt m0).2 m1;omega have eA:(e0+mag.log2).toNat=Ѡe0+mag.toNat.log2:=by rw[Т,eL];exact Й א have b3:¬ (e0+mag.log2).toNat<=(24:і).toNat:=λh=>b1 (П.2 h);have b4:¬ (277:і).toNat<=(e0+mag.log2).toNat:=λh=>b2 (П.2 h);rw[eA] at b3 b4;have t1:(24:і).toNat=24:=rfl;have t2:(277:і).toNat=277:=rfl;rw[Qz _ _ _ m0 m1 א א,hR];congr 1 have s0:d.significand≠0:=by intro h0;have:d.toRat=0:=(Բ d).2 h0;rw[hd] at this;have q:(Ѡp:ℚ)-Ѡn≠0:=by rw[sub_ne_zero];exact_mod_cast Th exact (mul_ne_zero q (zpow_ne_zero _ Х)) this refine roundDyadic_congr Fmt ה _ _ m0 s0 ?_;rw[hd,<-m2];simp only[FloatLib.Numerics.Dyadic.toRat,signedSignificand];cases decide (p< n)<;>simp lemma Jr (w:ѓ):(T_e w).toNat<=255:=by unfold T_e;split;. decide . have:=Dl w;simp only[UInt32.toNat_toUInt64];omega @[inline] def T_min (x y:і):і:=if x< y then x else y lemma Gv (x y:і):(T_min x y).toNat<=Ѡx:=by unfold T_min;split;. exact le_rfl . have:=О.not.1 ‹_›;omega lemma Kz (e0:і) (w0 w1:ѓ) (h0:T_ok e0 w0=true) (h1:T_ok e0 w1=true): (T_p e0 w1 (T_p e0 w0 0)).toNat<=2*(2^61-1)∧(T_n e0 w1 (T_n e0 w0 0)).toNat<=2*(2^61-1) ∧ М w0+М w1=(((T_p e0 w1 (T_p e0 w0 0)).toNat:ℚ) - (T_n e0 w1 (T_n e0 w0 0)).toNat)*2^((Ѡe0:Int)-150):=by obtain ⟨a1,a2,a3⟩:=Ka e0 w0 0 0 0 0 _ rfl ב h0 ג ג ג obtain ⟨b1,b2,b3⟩:=Ka e0 w1 _ _ _ _ _ rfl ב h1 a1 a2 a3 rw[zero_add] at b3 exact ⟨by omega,by omega,b3⟩ lemma Ry (e0:і) (w0 w1:ѓ) (p n:і) (V:ℚ) (hp:Ѡp<=2*(2^61-1)) (hn:Ѡn<=2*(2^61-1)) (hV:V=((Ѡp:ℚ)-Ѡn)*2^((Ѡe0:Int)-150)) (h0:T_ok e0 w0=true) (h1:T_ok e0 w1=true): (T_p e0 w1 (T_p e0 w0 p)).toNat<2^63∧(T_n e0 w1 (T_n e0 w0 n)).toNat<2^63 ∧ V+М w0+М w1=(((T_p e0 w1 (T_p e0 w0 p)).toNat:ℚ) - (T_n e0 w1 (T_n e0 w0 n)).toNat)*2^((Ѡe0:Int)-150):=by obtain ⟨a1,a2,a3⟩:=Ka e0 w0 p n V _ _ rfl ב h0 hp hn hV obtain ⟨b1,b2,b3⟩:=Ka e0 w1 _ _ _ _ _ rfl ב h1 a1 a2 a3 exact ⟨by omega,by omega,b3⟩ lemma Kf (e0:і) (w:ѓ) (h:T_ok e0 w=true):expOf w≠255:=by unfold T_ok at h;simp only[and_eq_true] at h;exact Do w h.1 end @[noinline] def addSlow (relu:ј) (x y:њ):њ:= act relu (toWord (FloatLib.Floats.Formats.BinaryInterchange.Model.add (ofW x) (ofW y))) section open Float.Model Float.Model.UnpackedFloat @[noinline] def addT (relu:ј) (x y:њ):њ:= let e0:=T_min (T_e x) (T_e y) if T_ok e0 x && T_ok e0 y then act relu (T_fin (T_p e0 y (T_p e0 x 0)) (T_n e0 y (T_n e0 x 0)) e0 λ_=>toWord (FloatLib.Floats.Formats.BinaryInterchange.Model.add (ofW x) (ofW y))) else addSlow relu x y lemma Pw (relu:ј) (x y:њ):addT relu x y=addSlow relu x y:=by unfold addT;dsimp only;split . rename_i hc;simp only[and_eq_true] at hc;obtain ⟨hx,hy⟩:=hc;obtain ⟨p1,n1,v⟩:=Kz _ x y hx hy;have ex:=Kf _ x hx;have ey:=Kf _ y hy;unfold addSlow;congr 1 refine Lm _ _ _ _ א א ((Gv _ _).trans (Jr x)) _ rfl λ_ =>⟨Model.addDyadic (decodeD x) (decodeD y),?_,?_⟩ . rw[Model.addDyadic,add_toRat];exact v . rw[Model.Proof.add_eq_spec];have e:=а x ex;have f:=а y ey;simp only[Model.Spec.add,ofW,e,f] . rfl end @[inline] def E_act (relu:ј) (r:ѓ):ѓ:= if relu && signOf r then 0 else r @[inline] def addOne (relu:ј) (x y:њ):њ:= if sm x && sm y then let a:=(dv x+dv y).toBits let u:=a+0x0FFFFFFD if (a <<< (1:і))-0x7040000000000000<0x1F60000000000000 && u &&& 0x1FFFFFFF<0x1FFFFFFC then E_act relu (zivC (u >>> (29:і))) else addT relu x y else addSlow relu x y section lemma Oc (w:ѓ) (h0:expOf w≠0) (h1:expOf w≠255):wv w≠0:=by have:sv w≠0:=by unfold sv mantOf;split<;>simp[h0]<;>omega simp[Fi w h1,rationalWord,decodeD_toRat,this,zpow_ne_zero] lemma Ij (w:ѓ) (h:sm w=true):good w=true∧|wv w| ≤ 2^99:=by obtain ⟨hg,hl⟩:=д.1 h;have h1:=И.1 (of_decide_eq_true hl);rw[Di] at h1;have h2:=Dm w hg;rw[Gw w hg];refine ⟨hg,(Ly _ _ h1 א).trans ?_⟩;unfold A_mag;norm_num lemma Ny (A P Q T g:ћ) (hg:g=0∨g=2^63) (ha:A<2^64) (e1:(A+2)%2^64=g+P) (e2:(2^64-2+A)%2^64=g+Q) (t1:2^61<=T) (t2:T<2^63-2^60) (l1:T< P+2^28) (u1:P<=T+2^28) (l2:T< Q+2^28) (u2:Q<=T+2^28):A=g+(Q+2)∧T+2< Q+2+2^28∧Q+2+2<=T+2^28:=by omega lemma Ne (G f F:ћ) (hl:G+f+2< G+F+2^28) (hu:G+F+2<=G+f+2^28):F+2<=f+2^28∧f+2< F+2^28:=by omega lemma Kk (s:ѕ) (h:zivS s≠Д): ∃ (S:ј) (ex fr M:ћ),897<=ex∧ex<1151∧fr<2^23 ∧ zivS s=э ((if S then 2^31 else 0)+(ex-896)*2^23+fr) ∧ s.toBits.toNat=(if S then 2^63 else 0)+M ∧ (ex*2^23+fr)*2^29+2< M+2^28 ∧ M+2<=(ex*2^23+fr)*2^29+2^28:=by obtain ⟨S,ex,fr,h1,h2,h3,hz,⟨P,e1,l1,u1⟩,⟨Q,e2,l2,u2⟩⟩:=Fd _ _ h rw[Т] at e1 rw[л] at e2 obtain ⟨a,b,c⟩:=Ny _ P Q ((ex*2^23+fr)*2^29) _ (by cases S<;>simp) s.toBits.toNat_lt e1 e2 א א l1 u1 l2 u2 exact ⟨S,ex,fr,Q+2,h1,h2,h3,hz,a,b,c⟩ lemma Pg (v W z u:ℝ) (hu:0< u) (hz:z<=u) (h0:0<=v) (hv:v<=2^53*u) (h:|v-W| ≤ 1/2^53*(|W| + z)):v-2*u< W∧W< v+2*u:=by have h1:|W| ≤ v + |v-W|:=by have:=ن (v-(v-W)) (-(v-W)+(v-W));have e:W=v-(v-W):=by ring have a:=С W v;rw[abs_sub_comm W v,и h0] at a;linarith have h2:=abs_lt.mp (show |v-W| < 2*u by nlinarith);constructor<;>linarith [h2.1,h2.2] set_option maxRecDepth 8192 in lemma Oi (ex fr E F:ћ) (h1:897<=ex) (h2:ex<1151) (Ek:fr<2^23) (hF:F<2^52) (hl:(ex*2^23+fr)*2^29+2< E*2^52+F+2^28) (hu:E*2^52+F+2<=(ex*2^23+fr)*2^29+2^28) (W:ℝ) (h:|((2^52+F:ћ):ℝ)*2^((E:Int)-1075)-W| ≤ 1/2^53*(|W| + A_z)): W<(2^53+fr*2^30+2^29)*2^((ex:Int)-1076) ∧ (fr≠0->(2^53+fr*2^30-2^29)*2^((ex:Int)-1076)< W) ∧ (2^53-2^28)*2^((ex:Int)-1076)< W:=by have hE:E=ex∨(E+1=ex∧fr=0):=א have Cv:(0:ℝ)<2^((E:Int)-1075):=щ ב _ have hz:A_z<=2^((E:Int)-1075):=by have e:A_z=2^(-1021:ℤ):=rfl rw[e] exact Ф ב א have hN:((2^52+F:ћ):ℝ)<=2^53:=by have:2^52+F<=2^53:=א exact_mod_cast this have Hy:(0:ℝ)<=((2^52+F:ћ):ℝ):=Ъ _ obtain ⟨a,b⟩:=Pg _ W A_z _ Cv hz (ч Hy Cv.le) (Г hN Cv.le) h push_cast at a b rcases hE with rfl | ⟨rfl,rfl⟩ . have e:(2:ℝ)^((E:Int)-1075)=2*2^((E:Int)-1076):=by rw[show (E:Int)-1075=1+((E:Int)-1076) by ring,б Х,zpow_one] rw[e] at a b;have hb:(0:ℝ)<2^((E:Int)-1076):=щ ב _;generalize (2:ℝ)^((E:Int)-1076)=c at a b hb ⊢;have e1:(E*2^23+fr)*2^29=E*2^52+fr*2^29:=by ring rw[e1] at hl hu;obtain ⟨n3,n4⟩:=Ne _ _ _ hl hu;have h3:(F:ℝ)+2<=fr*2^29+2^28:=by exact_mod_cast n3 have h4:(fr:ℝ)*2^29+2< F+2^28:=by exact_mod_cast n4 have h5:(0:ℝ)<=F:=Ъ _;have h6:(0:ℝ)<=fr:=Ъ _;have h7:=Г h3 hb.le;have h8:=Ь h4 hb;have h9:=ч h5 hb.le;have Dx:=ч h6 hb.le;refine ⟨?_,?_,?_⟩;. nlinarith . intro _;nlinarith . nlinarith . have e:(2:ℝ)^(((E+1:ћ):Int)-1076)=2^((E:Int)-1075):=by congr 1;push_cast;ring rw[e];generalize (2:ℝ)^((E:Int)-1075)=c at a b Cv ⊢;have h3:(F:ℝ)<=2^52:=by exact_mod_cast hF.le have h4:(2:ℝ)^52+2< F+2^28:=by exact_mod_cast (by omega:2^52+2< F+2^28) have h7:=Г h3 Cv.le;have h8:=Ь h4 Cv;refine ⟨?_,?_,?_⟩;. nlinarith . intro h0;exact absurd rfl h0 . nlinarith lemma Fv (s:ѕ) (d:FloatLib.Numerics.Dyadic) (hV:|R s-(d.toRat:ℝ)| ≤ 1/2^53*(|(d.toRat:ℝ)| + A_z)) (h:zivS s≠Д):zivS s=toWord (Я Fmt d):=by obtain ⟨S,ex,fr,M,h1,h2,h3,hz,hb,hl,hu⟩:=Kk s h;have hM:M=(M/2^52)*2^52+M%2^52:=א;have hF:M%2^52<2^52:=п _ ב;generalize M/2^52=E at hM;generalize M%2^52=F at hM hF;subst hM;obtain ⟨-,hR⟩:=El s S E F א א hF (by rw[hb,Ю]);rw[hR] at hV obtain ⟨W,hVW,hW⟩:∃ W:ℝ,(d.toRat:ℝ)=(if S then -W else W) ∧ |((2^52+F:ћ):ℝ)*2^((E:Int)-1075)-W| ≤ 1/2^53*(|W| + A_z):=by cases S . simp only[false_eq_true,ite_false,one_mul] at hV ⊢;exact ⟨_,rfl,hV⟩ . simp only[ite_true] at hV ⊢;refine ⟨-(d.toRat:ℝ),by simp,?_⟩;rw[abs_neg,show ((2^52+F:ћ):ℝ)*2^((E:Int)-1075) - -(d.toRat:ℝ)=-(-1*((2^52+F:ћ):ℝ)*2^((E:Int)-1075)-(d.toRat:ℝ)) by ring,abs_neg];exact hV obtain ⟨a,b,c⟩:=Oi ex fr E F h1 h2 h3 hF א א W hW;rw[hz];exact (Fq d S ex fr h1 h2 h3 W hVW a b c).symm lemma Jt (w:ѓ) (hg:good w=true):∃ (m k:ℤ),wv w=(m:ℝ)*2^k∧m.natAbs<2^25∧-160<=k:=by have hN:=w.toNat_lt;rw[Dp w hg];unfold A_mag;by_cases h0:Ѡw%2^31=0;. exact ⟨0,0,by rw[е h0];simp,by norm_num,by norm_num⟩ . simp only[h0,ite_false];have hk:-160<=(((Ѡw%2^31/2^23:ℕ):ℤ)-150):=א;have hM:2^23+Ѡw%2^31%2^23<2^25:=א;generalize ((Ѡw%2^31/2^23:ℕ):ℤ)-150=k at hk ⊢;generalize 2^23+Ѡw%2^31%2^23=M at hM ⊢;by_cases hs:2^31<=Ѡw;. exact ⟨-(M:ℤ),k,by rw[е hs];push_cast;ring,by simpa using hM,hk⟩ . exact ⟨(M:ℤ),k,by rw[г hs];push_cast;ring,by simpa using hM,hk⟩ lemma Ox (a b:ѓ) (ha:good a=true) (hb:good b=true):(dv a*dv b).isFinite=true∧R (dv a*dv b)=wv a*wv b:=by obtain ⟨fa,ra⟩:=Ds a ha;obtain ⟨fb,rb⟩:=Ds b hb;have la:=(Ec a ha).trans Cq;have lb:=(Ec b hb).trans Cq obtain ⟨h1,h2⟩:=Cl _ _ fa fb (by rw[ra,rb] exact (ر la lb (ф _) Co.le).trans Fw) refine ⟨h1,?_⟩;obtain ⟨m,k,e1,h3,h4⟩:=Jt a ha;obtain ⟨n,l,e2,h5,h6⟩:=Jt b hb;have e:wv a*wv b=((m*n:ℤ):ℝ)*2^(k+l):=by rw[e1,e2,б Х];push_cast;ring rw[h2,ra,rb,e];refine Hf _ _ ?_ א;rw[Int.natAbs_mul];have:=Nat.mul_lt_mul'' h3 h5;omega lemma Mw (x y z:ѓ) (hx:good x=true) (hy:good y=true) (hz:good z=true) (d:FloatLib.Numerics.Dyadic) (hd:(d.toRat:ℝ)=wv x*wv y+wv z): |R (dv x*dv y+dv z)-(d.toRat:ℝ)| ≤ 1/2^53*(|(d.toRat:ℝ)| + A_z):=by obtain ⟨f1,r1⟩:=Ox x y hx hy obtain ⟨-,-,l⟩:=Ki x y hx hy obtain ⟨f2,r2⟩:=Ds z hz have Ib:(2:ℝ)^256<=A_B:=by have:(2:ℝ)^256<=2^256*2^42:=ב linarith [Cp] obtain ⟨-,he⟩:=Dn _ _ f1 f2 (by rw[r1];exact l.trans Ib) (by rw[r2];exact (Ec z hz).trans Cq) rw[r1,r2] at he rw[hd] exact he lemma Qy (relu:ј) (r:ѓ) (hf:expOf r≠255):E_act relu r=act relu r:=by cases relu<;>simp[E_act,act,reluW,hf,signOf] lemma Ko (relu:ј) (s:ѕ) (h:zivS s≠Д):E_act relu (zivS s)=act relu (zivS s):=by apply Qy;obtain ⟨S,ex,fr,h1,h2,h3,hz,-,-⟩:=Fd _ _ h;have hz':zivS s=_:=hz;intro h0;have h4:(expOf (zivS s)).toNat=255:=by rw[h0];rfl rw[Dl,hz',ю] at h4;split at h4<;>omega lemma Lo (relu:ј) (x y:њ):addOne relu x y=act relu (toWord (Model.add (ofW x) (ofW y))):=by unfold addOne;split . rename_i hc;simp only[and_eq_true] at hc;obtain ⟨gx,-⟩:=Ij x hc.1;obtain ⟨gy,-⟩:=Ij y hc.2;dsimp only;split;swap;. exact Pw relu x y . rename_i hr;obtain ⟨h8,h9⟩:=д.1 hr;obtain ⟨e9,hn⟩:=Jo (dv x+dv y) (by simpa using h8) (by simpa using h9);rw[<-e9,Ko _ _ hn];have ex:=Do _ gx;have ey:=Do _ gy;have hd:((Model.addDyadic (decodeD x) (decodeD y)).toRat:ℝ)=wv x+wv y:=by rw[Model.addDyadic,add_toRat,Fi x ex,Fi y ey];simp only[rationalWord,Rat.cast_add] obtain ⟨fx,rx⟩:=Ds x gx;obtain ⟨fy,ry⟩:=Ds y gy;obtain ⟨-,he⟩:=Dn _ _ fx fy (by rw[rx];exact (Ec x gx).trans Cq) (by rw[ry];exact (Ec y gy).trans Cq);rw[rx,ry,<-hd] at he;rw[Fv _ _ he hn];congr 2;rw[Model.Proof.add_eq_spec];have e:=а x ex;have f:=а y ey;simp only[Model.Spec.add,ofW,e,f] . rfl lemma Jz {L:є->ѐ->ѐ} (f:є->ѓ->ѓ) {e:є} (hL:∀ i x,L i x=if i< e then L (i+1) (wrW x i (f i (rdW x i))) else x) (d:ћ): ∀ (i:є) (x:ѐ),Ѡi+d=Ѡe->Ѡe<=ѡx->ѡx<2^32 → (L i x).size=ѡx∧∀ q,(L i x)[q]! =if Ѡi<=q∧q< Ѡe then f (Ж q) x[q]! else x[q]!:=by induction d with | zero=> intro i x h1 _ _ rw[hL,г ט] exact ⟨rfl,λq=>(г א).symm⟩ | succ d ih=> intro i x h1 h2 h3 have hi:i< e:=А.2 א have hs:=Gm x i (f i (rdW x i)) rw[hL,е hi] obtain ⟨h4,h5⟩:=ih (i+1) (wrW x i (f i (rdW x i))) (by rw[Bg i e hi];omega) א א refine ⟨h4.trans hs,λq=>?_⟩ rw[h5,Go _ _ _ _ h3 א,Bg i e hi,Gl _ _ h3] by_cases h6:q=Ѡi . subst h6;rw[г א,е rfl,е א,USize.ofNat_toNat] . rw[г h6];exact if_congr א rfl rfl def addGo (relu:ј) (y:ё) (e i:є) (x:ё): ё:= if h:i< e then addGo relu y e (i+1) (wrW x i (addOne relu (rdW x i) (rdW y i))) else x termination_by Ѡe-Ѡi decreasing_by rw[Bg i e h];have:=А.mp h;omega def addF (relu:ј) (a b:ё):ё:= if ѡa=ѡb∧ѡa<2^32 then addGo relu b a.usize 0 a else Array.ofFn (n:=ѡa) λi=>addOne relu a[i] b[i.val]! lemma Qv:addF=addReluSpec:=by funext relu a b;unfold addF;split . rename_i h;obtain ⟨h1,h2⟩:=h;have hu:a.usize.toNat=ѡa:=Gi _ h2;have hg:=Jz (L:=addGo relu b a.usize) (λi w=>addOne relu w (rdW b i)) (λ_ _=>by rw[addGo];rfl) ѡa 0 a (by rw[hu,show (0:є).toNat=0 from rfl,З]) א h2;apply Array.ext (by rw[hg.1];simp[addReluSpec]);intro i h3 h4;have hi:i< ѡa:=by rwa [hg.1] at h3 rw[<-в _ i h3,hg.2 i,е ⟨Nat.zero_le _,by omega⟩,Lo,в a i hi,Gl _ _ א,uk i א];simp[addReluSpec] . simp only[addReluSpec,Lo] end section @[noinline] def E_fma (relu:ј) (w sw tw:ѓ):ѓ:= act relu (toWord (Model.fma (ofW w) (ofW sw) (ofW tw))) @[noinline] def E_fz (relu g:ј) (sw tw:ѓ) (y z:ѕ) (w:ѓ):ѓ:= if g && good w then let r:=zivS (dv w*y+z) if r== Д then E_fma relu w sw tw else E_act relu r else E_fma relu w sw tw @[inline] def E_el (relu g:ј) (sw tw:ѓ) (y z:ѕ) (w:ѓ):ѓ:= let a:=(dvN w*y+z).toBits let u:=a+0x0FFFFFFD if g && (a <<< (1:і))-0x7040000000000000<0x1F60000000000000 && u &&& 0x1FFFFFFF<0x1FFFFFFC then E_act relu (zivC (u >>> (29:і))) else E_fz relu g sw tw y z w @[specialize] def E_map (f:ѓ->ѓ) (e i:є) (x:ѐ):ѐ:= if h:i< e then E_map f e (i+1) (wrW x i (f (rdW x i))) else x termination_by Ѡe-Ѡi decreasing_by rw[Bg i e h];have:=А.mp h;omega def E_chs (relu:ј) (c hw:ћ) (s t:ѐ) (ch:ћ) (x:ѐ):ѐ:= if ch< c then let sw:=s[ch]! let tw:=t[ch]! let y:=dv sw let z:=dv tw E_chs relu c hw s t (ch+1) (E_map (E_el relu (good sw && good tw) sw tw y z) ((ch+1)*hw).toUSize (ch*hw).toUSize x) else x termination_by c-ch def scaleF (relu:ј) (c hw:ћ) (x s t:ѐ):ѐ:= if ѡx=c*hw∧ѡx<2^32 then E_chs relu c hw s t 0 x else scaleShiftSpec relu c hw x s t @[noinline] def E_dot (X:ѐ) (b:є) (k w:ћ):ѓ:= dotFn (k*k) (λt=>X[Ѡb+(t/k*w+t%k)]!) (λ_=>oneW) section open Float.Model Float.Model.UnpackedFloat def E_dotT (X:ѐ) (b:є) (k w:ћ):ѓ:= if k=2 then let i:=Ѡb let a0:=X[i]! let a1:=X[i+1]! let a2:=X[i+w]! let a3:=X[i+(w+1)]! let e0:=T_min (T_min (T_e a0) (T_e a1)) (T_min (T_e a2) (T_e a3)) if T_ok e0 a0 && T_ok e0 a1 && T_ok e0 a2 && T_ok e0 a3 then T_fin (T_p e0 a3 (T_p e0 a2 (T_p e0 a1 (T_p e0 a0 0)))) (T_n e0 a3 (T_n e0 a2 (T_n e0 a1 (T_n e0 a0 0)))) e0 λ_=>E_dot X b k w else E_dot X b k w else E_dot X b k w lemma Rm (X:ѐ) (b:є) (k w:ћ):E_dotT X b k w=E_dot X b k w:=by unfold E_dotT;split;swap;rfl;subst_vars;dsimp only;split;swap;rfl;rename_i hc;simp at hc;obtain ⟨⟨⟨h0,h1⟩,h2⟩,h3⟩:=hc;obtain ⟨p1,n1,v⟩:=Kz _ _ _ h0 h1;obtain ⟨p2,n2,v⟩:=Ry _ _ _ _ _ _ p1 n1 v h2 h3;refine Lm _ _ _ _ p2 n2 ((Gv _ _).trans ((Gv _ _).trans (Jr _))) _ rfl λe=>?_;have B:=Fk (2*2) (λj=>X[Ѡb+(j/2*w+j%2)]!) (λ_=>oneW) λj g=>⟨by interval_cases j<;>simp[Kf _ _ h0,Kf _ _ h1,Kf _ _ h2,Kf _ _ h3],by decide⟩;simp[Finset.sum_range_succ,Jk] at B;rw[v] at B;rw[E_dot,Bt];exact B (mul_ne_zero (sub_ne_zero.2 λh=>e (UInt64.toNat_inj.1 (Nat.cast_injective h))) (zpow_ne_zero _ Х)) end @[noinline] def E_div (n:ћ) (s:ѓ):ѓ:= toWord (Model.div (ofW s) (ofW (natW n))) @[inline] def E_quo (n:ћ) (j s:ѓ):ѓ:= if j< expOf s∧expOf s≠255 then s-(j <<< (23:ѓ)) else E_div n s @[inline] def E_tl (X:ѐ) (b:є) (k w n:ћ) (j z:ѓ) (nf zb s a:ѕ) (o:ѓ):ѓ:= if o=0 then z else let r:=ziv (s+zb) (nf*(a+zb.abs)) E_quo n j (if r== Д then E_dotT X b k w else r) def E_win (X off:ѐ) (k w n:ћ) (j z:ѓ) (u nf zb:ѕ) (b m t:є) (s a:ѕ) (o:ѓ):ѓ:= if h:t< m then let v:=rdW X (b+(rdW off t).toUSize) let d:=dv v*u E_win X off k w n j z u nf zb b m (t+1) (s+d) (a+d.abs) (o ||| v) else E_tl X b k w n j z nf zb s a o termination_by Ѡm-Ѡt decreasing_by rw[Bg t m h];have:=А.mp h;omega @[specialize] def G_x (f:є->ѓ) (sx:є) (W x:ћ) (b q:є) (out:ѐ):ѐ:= if x< W then G_x f sx W (x+1) (b+sx) (q+1) (wrW out q (f b)) else out termination_by W-x @[specialize] def G_y (f:є->ѓ) (sy sx:є) (W H y:ћ) (b q:є) (out:ѐ):ѐ:= if y< H then G_y f sy sx W H (y+1) (b+sy) (q+ѢW) (G_x f sx W 0 b q out) else out termination_by H-y @[specialize] def G_c (f:є->ѓ) (sc sy sx:є) (W H c ch:ћ) (b q:є) (out:ѐ):ѐ:= if ch< c then G_c f sc sy sx W H c (ch+1) (b+sc) (q+(H*W).toUSize) (G_y f sy sx W H 0 b q out) else out termination_by c-ch def E_off (k w:ћ):ѐ:= Array.ofFn (n:=k*k) λt=>(t.val/k*w+t.val%k).toUInt32 @[noinline] def E_grid (c h w k n:ћ) (X off:ѐ) (j z:ѓ) (u nf zb zr:ѕ): ѐ:= G_c (λb=>E_win X off k w n j z u nf zb b Ѣn 0 zr zr 0) (h*w).toUSize (k*w).toUSize Ѣk (w/k) (h/k) c 0 0 0 (К (c*(h/k*(w/k))) 0) @[inline] def E_w4 (X:ѐ) (k w n:ћ) (j z:ѓ) (u nf zb zr:ѕ) (a0 a1 a2 a3 b:є):ѓ:= let v0:=rdW X (b+a0) let d0:=dv v0*u let v1:=rdW X (b+a1) let d1:=dv v1*u let v2:=rdW X (b+a2) let d2:=dv v2*u let v3:=rdW X (b+a3) let d3:=dv v3*u E_tl X b k w n j z nf zb (zr+d0+d1+d2+d3) (zr+d0.abs+d1.abs+d2.abs+d3.abs) (0 ||| v0 ||| v1 ||| v2 ||| v3) @[noinline] def E_gridK (c h w k n:ћ) (X off:ѐ) (j z:ѓ) (u nf zb zr:ѕ): ѐ:= if k== 2 then let a0:=(rdW off 0).toUSize let a1:=(rdW off (0+1)).toUSize let a2:=(rdW off (0+1+1)).toUSize let a3:=(rdW off (0+1+1+1)).toUSize G_c (λb=>E_w4 X k w n j z u nf zb zr a0 a1 a2 a3 b) (h*w).toUSize (k*w).toUSize Ѣk (w/k) (h/k) c 0 0 0 (К (c*(h/k*(w/k))) 0) else E_grid c h w k n X off j z u nf zb zr def avgF (c h w k:ћ) (X:ѐ):ѐ:= if c*h*w<=ѡX∧ѡX<2^32∧k*k<2^20 ∧ scan X X.usize 0 (Cc X) Д 0≠Д then let n:=k*k let off:=E_off k w let j:ѓ:=if n=4 then 2 else if n=64 then 6 else 255 let z:ѓ:=if 0< k∧k<17 then 0 else E_div n (dotFn n (λ_=>0) (λ_=>oneW)) E_gridK c h w k n X off j z (dv oneW) (nfOf n) (dv 0) 0 else avgpoolSpec c h w k X def E_d (x y z:ѓ):FloatLib.Numerics.Dyadic:= Model.addDyadic ⟨Bool.xor (decodeD x).negative (decodeD y).negative, (decodeD x).significand*(decodeD y).significand, (decodeD x).exponent+(decodeD y).exponent⟩ (decodeD z) section variable (x y z:ѓ) (hx:expOf x≠255) (hy:expOf y≠255) (hz:expOf z≠255) include x y z hx hy hz lemma Km:Model.fma (ofW x) (ofW y) (ofW z)=Я Fmt (E_d x y z):=by rw[Model.Proof.fma_eq_spec];have e:=а x hx;have f:=а y hy;have g:=а z hz;simp[Model.Spec.fma,ofW,(Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨Model.isNaN_eq_false_of_toDyadic?_some e,Model.isNaN_eq_false_of_toDyadic?_some f,Model.isNaN_eq_false_of_toDyadic?_some g⟩,Model.isInf_eq_false_of_toDyadic?_some e,Model.isInf_eq_false_of_toDyadic?_some f,Model.isInf_eq_false_of_toDyadic?_some g,e,f,g];rfl lemma Jx:((E_d x y z).toRat:ℝ)=wv x*wv y+wv z:=by have j:=mul_toRat (decodeD x) (decodeD y);simp only[FloatLib.Numerics.Dyadic.mul,mulFields] at j;rw[E_d,Model.addDyadic,add_toRat,j,Fi x hx,Fi y hy,Fi z hz];simp[rationalWord] end section open Float.Model Float.Model.UnpackedFloat local notation:max x:max "ᶠ"=>Float.isFinite x=true lemma Fj (s:Sign):(Float.Model.pack (UnpackedFloat.infinity s)).unpack.isFinite=false:=by cases s<;>decide +kernel lemma Kv:(Float.Model.pack UnpackedFloat.notANumber).unpack.isFinite=false:=by decide +kernel lemma Ja (x y:ѕ) (h:(x*y)ᶠ):xᶠ∧yᶠ:=by change (Float.Model.mul x.toModel y.toModel).unpack.isFinite=true at h;change x.toModel.unpack.isFinite=true∧y.toModel.unpack.isFinite=true;rw[Float.Model.mul] at h;cases a:x.toModel.unpack<;>cases b:y.toModel.unpack <;>simp only[a,b,UnpackedFloat.mul,Fj,Kv,false_eq_true] at h<;>exact ⟨rfl,rfl⟩ lemma Pn (x y:ѕ) (h:(x+y)ᶠ):xᶠ∧yᶠ:=by change (Float.Model.add x.toModel y.toModel).unpack.isFinite=true at h;change x.toModel.unpack.isFinite=true∧y.toModel.unpack.isFinite=true;rw[Float.Model.add] at h cases a:x.toModel.unpack<;>cases b:y.toModel.unpack <;>simp only[a,b,UnpackedFloat.add,Fj,Kv,false_eq_true] at h <;> first | exact ⟨rfl,rfl⟩ | (split at h<;>simp only[Fj,Kv,false_eq_true] at h) lemma Pi:(х 0x7FF8000000000000).isFinite=false:=by decide +kernel lemma Jg (i:є) (h:Ѡi< ѡpwN):pwN.uget i h=pwEntryN Ѡi:=by simp[FloatArray.uget,Kl] def N_ok (w:ѓ):Prop:=0x800000<=w &&& В∧w &&& В<Ш lemma Pp {w:ѓ} (h:N_ok w):good w=true:=Gq _ (Or.inr h.1) h.2 lemma N_w (w:ѓ) (h:(pwN.uget (w >>> (23:ѓ)).toUSize (Ga w))ᶠ): pwN.uget (w >>> (23:ѓ)).toUSize (Ga w)=pw.uget (w >>> (23:ѓ)).toUSize (Eo w) ∧ N_ok w:=by have s:=Ff w rw[Jg,к,s] at h rw[Jg,Kp,к,s] unfold pwEntryN at h ⊢ have e:=Di w have g:=w.toNat_lt by_cases c:(Ѡw/2^23%256== 0 || Ѡw/2^23%256== 255)=true . rw[е c,Pi] at h;exact absurd h ה . rw[г c];simp only[or_eq_true,beq_iff_eq,not_or] at c;refine ⟨rfl,?_,?_⟩;. rw[И,e,show (0x800000:ѓ).toNat=0x800000 from rfl];omega . rw[Ы,e,show (Ш:ѓ).toNat=Ш from rfl];omega lemma Ng {w:ѓ} (h:(dvN w)ᶠ):dvN w=dv w∧N_ok w:=by obtain ⟨e,o⟩:=N_w w (Ja _ _ h).2;exact ⟨by unfold dvN dv;rw[e],o⟩ end lemma Mv (T M:ћ) (h1:T+2< M+2^28) (h2:M+2<=T+2^28):T< M+2^28∧M<=T+2^28:=by omega lemma Np (s:ѕ) (h:zivS s≠Д):s.isFinite=true:=by obtain ⟨S,ex,fr,M,h1,h2,h3,-,hb,hl,hu⟩:=Kk s h;exact (Fg _ S ex fr h1 h2 h3 ⟨M,hb,(Mv _ _ hl hu).1,(Mv _ _ hl hu).2⟩).1 section variable (relu g:ј) (sw tw w:ѓ) (hg:g=true->good sw=true∧good tw=true) include relu g sw tw w hg lemma Qf:E_fz relu g sw tw (dv sw) (dv tw) w=E_fma relu w sw tw:=by unfold E_fz;split;swap;rfl;rename_i hc;obtain ⟨h1,h2⟩:=д.1 hc;obtain ⟨h3,h4⟩:=hg h1;dsimp only;split;rfl;rename_i hr;have r:=mt beq_iff_eq.2 hr;have hf:=Do _ h2;have g1:=Do _ h3;have g2:=Do _ h4;rw[Ko _ _ r,Fv _ (E_d w sw tw) (Mw w sw tw h2 h3 h4 _ (Jx _ _ _ hf g1 g2)) r,E_fma,Km _ _ _ hf g1 g2] lemma Ql:E_el relu g sw tw (dv sw) (dv tw) w=E_fma relu w sw tw:=by unfold E_el;dsimp only;split;. rename_i hc;obtain ⟨hA,h9⟩:=д.1 hc;obtain ⟨h1,h8⟩:=д.1 hA;obtain ⟨h3,h4⟩:=hg h1;obtain ⟨e9,hr0⟩:=Jo (dvN w*dv sw+dv tw) (by simpa using h8) (by simpa using h9);rw[<-e9];obtain ⟨e,o⟩:=Ng (Ja _ _ (Pn _ _ (Np _ hr0)).1).1;rw[e] at hr0 ⊢;have hr':=hr0;have h2:=Pp o;have hf:=Do _ h2;have g1:=Do _ h3;have g2:=Do _ h4;rw[Ko _ _ hr',Fv _ (E_d w sw tw) (Mw w sw tw h2 h3 h4 _ (Jx _ _ _ hf g1 g2)) hr',E_fma,Km _ _ _ hf g1 g2] . exact Qf relu g sw tw w hg end lemma Se (relu:ј) (c hw:ћ) (s t:ѐ) (d:ћ):∀ (ch:ћ) (x:ѐ),ch+d=c->ѡx=c*hw->ѡx<2^32 → (E_chs relu c hw s t ch x).size=ѡx∧∀ q,q< c*hw → (E_chs relu c hw s t ch x)[q]! =if ch*hw<=q then E_fma relu x[q]! s[q/hw]! t[q/hw]! else x[q]!:=by induction d with | zero=> rintro ch x rfl _ _ rw[E_chs,г א] exact ⟨rfl,λq hq=>(г (by simpa using hq)).symm⟩ | succ d ih=> intro ch x h1 h2 h3 rw[E_chs,е א] dsimp only have h4:=Н hw (א:ch+1<=c) have h5:=Nat.add_one_mul ch hw have e1:=Gi ((ch+1)*hw) א have e0:=Gi (ch*hw) א obtain ⟨h6,h7⟩:=Jz (λ_=>E_el relu (good s[ch]! && good t[ch]!) s[ch]! t[ch]! (dv s[ch]!) (dv t[ch]!)) (L:=E_map _ ((ch+1)*hw).toUSize) (λ_ _=>by rw[E_map];rfl) hw (ch*hw).toUSize x א א h3 obtain ⟨h8,h9⟩:=ih (ch+1) _ א (h6.trans h2) א refine ⟨h8.trans h6,λq hq=>?_⟩ rw[h9 q hq,h7,e0,e1,Ql _ _ _ _ _ д.1] by_cases a:(ch+1)*hw<=q . rw[е a,г א,е א] . rw[г a];by_cases b:ch*hw<=q;. rw[е א,е b,Nat.div_eq_of_lt_le b א] . rw[г א,г b] lemma Rr:scaleF=scaleShiftSpec:=by funext relu c hw x s t;unfold scaleF;split . rename_i h;obtain ⟨h1,h2⟩:=h;obtain ⟨h3,h4⟩:=Se relu c hw s t c 0 x א h1 h2;apply Array.ext;. simp[scaleShiftSpec,h3,h1] . intro i hi hj;have hi':i< c*hw:=by rwa [h3,h1] at hi rw[<-в _ i hi,h4 i hi',е ג];simp[scaleShiftSpec,E_fma] . rfl lemma Fu (w:ѓ) (h:expOf w≠255):ц (ofW w)=(sv w:ℝ)*2^((idxOf w:ℤ)-149):=by simp[show Model.toReal (ofW w)=wv w from rfl,Fi w h,rationalWord,decodeD_toRat] lemma Nu (s j:ѓ) (hj:Ѡj<=6) (a:Ѡj<(expOf s).toNat): (expOf (s-(j <<< (23:ѓ)))).toNat=(expOf s).toNat-Ѡj ∧ fracOf (s-(j <<< (23:ѓ)))=fracOf s ∧ signOf (s-(j <<< (23:ѓ)))=signOf s:=by rw[Dl] at a have hs:=s.toNat_lt have e:(j <<< (23:ѓ)).toNat=Ѡj*2^23:=by rw[UInt32.toNat_shiftLeft,ذ] exact Й ז generalize j <<< (23:ѓ)=J at e ⊢ have d:=ؼ s J (by rw[И,e];omega) rw[e] at d simp only[Dl,fracOf,<-UInt32.toNat_inj,Dj,Jq,d,decide_eq_decide] omega lemma Rn (s y j:ѓ) (f:Ѡj<=6) (a:expOf s≠255) (b:Ѡj<(expOf s).toNat) (d:expOf y≠255) (g:signOf y=false) (e:mantOf y=2^23) (k:idxOf y=126+Ѡj):toWord (Model.div (ofW s) (ofW y))=s-(j <<< (23:ѓ)):=by have B:Model.isZero (ofW y)=false:=by rw[ofW,Model.isZero_eq_beq_zero_of_toDyadic?_some (а y d),decodeD_sig_zero,e];decide obtain ⟨C,D,E⟩:=Nu s j f b;generalize s-(j <<< (23:ѓ))=r at C D E ⊢;have N:=expOf_toNat_lt s;have O:=mt Ч.1 a;simp at O;have l:expOf r≠255:=λh=>by simp[h] at C;omega have q:expOf r≠0:=λh=>by simp[h] at C;omega have t:expOf s≠0:=λh=>by simp[h] at b have x:ц (ofW y)=2^Ѡj:=by rw[Fu _ d,sv,g,e,k];push_cast;rw[show (126+Ѡj-149:ℤ)=Ѡj-23 by ring,ى Х,ь];field_simp;norm_num have I:ц (ofW r)=ц (ofW s)/ц (ofW y):=by rw[x,Fu _ l,Fu _ a,show sv r=sv s by unfold sv mantOf;rw[E,D,г q,г t],show (idxOf r:ℤ)=idxOf s-Ѡj by unfold idxOf;rw[г q,г t,C];omega,sub_right_comm,ى Х,ь,mul_div_assoc] have o:=Bm a;have u:=Bm d;have v:=Bm l;have z:=Model.isFinite_div_of_abs_div_le_posMaxFinite _ _ ה o u B (I ▸ Model.abs_toReal_le_posMaxFinite_of_isIEEE_of_isFinite _ ה v);have p:=Model.toReal_div_eq_roundAt _ _ ה o u B z;rw[<-I,Model.roundAt_toReal_eq _ v] at p;rw[Model.eq_of_toReal_eq_of_nonzero z v p (p ▸ Oc r q l),Lx] lemma Rh (n:ћ) (j s:ѓ) (hj:j=255∨(j=2∧n=4)∨(j=6∧n=64)):E_quo n j s=E_div n s:=by unfold E_quo;split;swap;rfl;rename_i h;have h1:=Ы.1 h.1;have h3:=expOf_toNat_lt s;rcases hj with rfl | ⟨rfl,rfl⟩ | ⟨rfl,rfl⟩;. simp at h1;omega all_goals exact (Rn s _ _ ה h.2 h1 ה ה ה ה).symm def E_f (xw:ћ->ѓ) (l:љ) (c:F1):F1:= l.foldl (λ(acc:F1) t=>let q:=dv (xw t)*dv oneW F1.mk (acc.s+q) (acc.t+q.abs)) c lemma Qx (X off:ѐ) (k w n:ћ) (j z:ѓ) (u nf zb zr:ѕ) (b:є) (hn:n.toUSize.toNat=4): E_win X off k w n j z u nf zb b Ѣn 0 zr zr 0=E_w4 X k w n j z u nf zb zr (rdW off 0).toUSize (rdW off (0+1)).toUSize (rdW off (0+1+1)).toUSize (rdW off (0+1+1+1)).toUSize b:=by have h0:(0:є)< Ѣn:=by rw[А,hn];decide have e1:=Bg _ _ h0 have h1:(0+1:є)< Ѣn:=by rw[А,hn,e1];decide have e2:=Bg _ _ h1 have h2:(0+1+1:є)< Ѣn:=by rw[А,hn,e2,e1];decide have e3:=Bg _ _ h2 have h3:(0+1+1+1:є)< Ѣn:=by rw[А,hn,e3,e2,e1];decide have e4:=Bg _ _ h3 have h4:¬ (0+1+1+1+1:є)< Ѣn:=by rw[А,hn,e4,e3,e2,e1];decide rw[E_win,Л h0] dsimp only rw[E_win,Л h1] dsimp only rw[E_win,Л h2] dsimp only rw[E_win,Л h3] dsimp only rw[E_win,Р h4] rfl lemma Sc (c h w k:ћ) (X off:ѐ) (j z:ѓ) (u nf zb zr:ѕ):E_gridK c h w k (k*k) X off j z u nf zb zr=E_grid c h w k (k*k) X off j z u nf zb zr:=by unfold E_gridK;split;. rename_i hk;have hk:=eq_of_beq hk;subst hk;have e:(λb=>E_w4 X 2 w (2*2) j z u nf zb zr (rdW off 0).toUSize (rdW off (0+1)).toUSize (rdW off (0+1+1)).toUSize (rdW off (0+1+1+1)).toUSize b)=λb=>E_win X off 2 w (2*2) j z u nf zb b (2*2).toUSize 0 zr zr 0:=funext λb=>(Qx X off 2 w (2*2) j z u nf zb zr b (Gi _ ב)).symm;dsimp only;rw[e,E_grid] . rfl lemma Qt (X off:ѐ) (k w n:ћ) (j z:ѓ) (nf zb:ѕ) (b m:є) (xw:ћ->ѓ) (hx:∀ t:є,t< m->rdW X (b+(rdW off t).toUSize)=xw Ѡt) (d:ћ):∀ (t:є) (s a:ѕ) (o:ѓ),Ѡt+d=Ѡm → E_win X off k w n j z (dv oneW) nf zb b m t s a o=E_tl X b k w n j z nf zb (E_f xw (List.range' Ѡt d) ⟨s,a⟩).s (E_f xw (List.range' Ѡt d) ⟨s,a⟩).t ((List.range' Ѡt d).foldl (λc i=>c ||| xw i) o):=by induction d with | zero=> intro t s a o h rw[E_win,dif_neg ט] rfl | succ d ih=> intro t s a o h have ht:t< m:=А.2 א rw[E_win,dif_pos ht] dsimp only rw[hx t ht,ih (t+1) _ _ _ (by rw[Bg t m ht];omega),Bg t m ht,Ա] rfl lemma Ok (xw:ћ->ѓ) (l:љ):∀ o:ѓ,l.foldl (λc i=>c ||| xw i) o=0->o=0∧∀ i∈l,xw i=0:=by induction l with | nil=>simp | cons i l ih=> intro o h;obtain ⟨h1,h2⟩:=ih _ h;obtain ⟨h3,h4⟩:=UInt32.or_eq_zero_iff.1 h1;exact ⟨h3,List.forall_mem_cons.2 ⟨h4,h2⟩⟩ lemma Pa (n:ћ) (hn:n<2^20) (xw:ћ->ѓ) (hg:∀ t,t< n->good (xw t)=true) (r:ziv ((E_f xw (Э n) ⟨0,0⟩).s+dv 0) (nfOf n*((E_f xw (Э n) ⟨0,0⟩).t+(dv 0).abs))≠Д): ziv ((E_f xw (Э n) ⟨0,0⟩).s+dv 0) (nfOf n*((E_f xw (Э n) ⟨0,0⟩).t+(dv 0).abs))=dotOf n xw (λ_=>oneW):=by obtain ⟨-,-,Bk⟩:=Fh _ _ r obtain ⟨Bv,Bs⟩:=Sh n hn xw (λ_=>oneW) 0 hg (λ_ _=>by decide) ה (Э n) ي ג (λt h1 h2=>absurd (я.mpr h1) h2) _ _ ⟨rfl,rfl⟩ Bk have Bx:((∑ j∈т n,М (xw j)*М oneW:ℚ):ℝ)=exactS n xw (λ_=>oneW) 0:=by rw[exactS,Gx 0 ה ה,add_zero,Rat.cast_sum] refine ش rfl λt ht=>?_ rw[Rat.cast_mul,Fi _ (Do _ (hg t (ؾ.mp ht))),Fi oneW ה] obtain ⟨d,hd,hw⟩:=Fk n xw (λ_=>oneW) (λj hj=>⟨Do _ (hg j hj),by decide⟩) λh=>Ie _ _ _ Bv Bs r (by rw[<-Bx,h,Rat.cast_zero]) have q:(d.toRat:ℝ)=exactS n xw (λ_=>oneW) 0:=by rw[hd,Bx] rw[hw] exact Io _ _ d (by rw[q];exact Bv) (by rw[q];exact Bs) r lemma Re (X:ѐ) (b:є) (k w n:ћ) (hn:n<2^20) (j:ѓ) (hj:j=255∨(j=2∧n=4)∨(j=6∧n=64)) (xw:ћ->ѓ) (hg:∀ t,t< n->good (xw t)=true) (hs:E_dot X b k w=dotOf n xw (λ_=>oneW)): E_tl X b k w n j (E_div n (dotFn n (λ_=>0) (λ_=>oneW))) (nfOf n) (dv 0) (E_f xw (Э n) ⟨0,0⟩).s (E_f xw (Э n) ⟨0,0⟩).t ((Э n).foldl (λc i=>c ||| xw i) 0)=E_div n (dotOf n xw (λ_=>oneW)):=by unfold E_tl split next h1=> rw[Bt] unfold dotOf congr 3 funext i exact ((Ok xw _ _ h1).2 _ (я.2 i.2)).symm . dsimp only;rw[Rh _ _ _ hj];congr 1;split;. rwa [Rm] next hr=>exact Pa _ hn xw hg (mt beq_iff_eq.2 hr) lemma Jv {c h w k ch y x t:ћ} (hc:ch< c) (hy:y< h/k) (hx:x< w/k) (ht:t< k*k):(ch*h+y*k+t/k)*w+x*k+t%k< c*h*w:=by have hk:0< k:=ш (by rintro rfl;omega);have h1:=у ht;have h2:=п t hk;have h3:=(Nat.le_div_iff_mul_le hk).1 hy;have h4:=(Nat.le_div_iff_mul_le hk).1 hx;have h5:=Н h hc;rw[ز] at h3 h4 h5;have h6:=Н w (א:ch*h+y*k+t/k+1<=c*h);rw[ز] at h6;omega def G_P (N:ћ) (sp:ћ->ѓ) (out:ѐ) (p:ћ):Prop:= ѡout=N∧N<2^32∧∀ i,i< p->out[i]! = sp i lemma Od {N p:ћ} {sp:ћ->ѓ} {out:ѐ} (h:G_P N sp out p) (hp:p< N) (q:є) (hq:Ѡq=p):G_P N sp (wrW out q (sp p)) (p+1):=by obtain ⟨h1,h2,h3⟩:=h;refine ⟨(Gm _ _ _).trans h1,h2,λi hi=>?_⟩;rw[Go _ _ _ _ א א,hq];by_cases e:i=p;. rw[е e,e] . rw[г e];exact h3 i א lemma Ip (a s i:ћ):(a+(i+1)*s).toUSize=(a+i*s).toUSize+Ѣs:=by rw[show a+(i+1)*s=a+i*s+s by ring];simp only[Nat.toUSize_eq,USize.ofNat_add] lemma Fn {L:ћ->є->є->ѐ->ѐ} {g:є->є->ѐ->ѐ} {sb S n N q0 b0:ћ} {sp:ћ->ѓ} (hL:∀ i b q o,L i b q o=if i< n then L (i+1) (b+Ѣsb) (q+ѢS) (g b q o) else o) (hs:∀ i o,i< n->G_P N sp o (q0+i*S) → G_P N sp (g (b0+i*sb).toUSize (q0+i*S).toUSize o) (q0+(i+1)*S)) (d:ћ): ∀ i o,i+d=n->G_P N sp o (q0+i*S) → G_P N sp (L i (b0+i*sb).toUSize (q0+i*S).toUSize o) (q0+n*S):=by induction d with | zero=> intro i o h1 h2 rw[hL,г א,<-h1] exact h2 | succ d ih=> intro i o h1 h2 rw[hL,е א,<-Ip,<-Ip] exact ih (i+1) _ א (hs i o א h2) lemma Ou {f:є->ѓ} {sc sy sx W H c N:ћ} {sp:ћ->ѓ} (hN:c*(H*W)=N) (hs:∀ ch y t,ch< c->y< H->t< W → f (ch*sc+y*sy+t*sx).toUSize=sp (ch*(H*W)+y*W+t)) (o:ѐ) (ho:G_P N sp o 0): G_P N sp (G_c f Ѣsc Ѣsy Ѣsx W H c 0 0 0 o) N:=by have:=Fn (L:=G_c f Ѣsc Ѣsy Ѣsx W H c) (sb:=sc) (S:=H*W) (n:=c) (N:=N) (q0:=0) (b0:=0) (sp:=sp) (λ_ _ _ _=>by rw[G_c]) (λch o a1 h=>by have h4:(ch+1)*(H*W)<=N:=hN ▸ Н _ a1 have:=Fn (L:=G_y f Ѣsy Ѣsx W H) (sb:=sy) (S:=W) (n:=H) (N:=N) (q0:=ch*(H*W)) (b0:=ch*sc) (sp:=sp) (λ_ _ _ _=>by rw[G_y]) (λy o a2 h=>by have h5:(y+1)*W<=H*W:=Н _ a2 rw[ز] at h4 h5 have:=Fn (L:=G_x f Ѣsx W) (g:=λb q o=>wrW o q (f b)) (sb:=sx) (S:=1) (n:=W) (N:=N) (q0:=ch*(H*W)+y*W) (b0:=ch*sc+y*sy) (sp:=sp) (λ_ _ _ _=>by rw[G_x];rfl) (λi o a3 h=>by have e1:ch*(H*W)+y*W+(i+1)*1=ch*(H*W)+y*W+i*1+1:=א have e2:ch*(H*W)+y*W+i=ch*(H*W)+y*W+i*1:=א rw[e1,hs ch y i a1 a2 a3,e2] exact Od h א _ (Gi _ (by have:=h.2.1;omega))) W 0 o א (by simpa using h) simpa [Nat.succ_mul,Nat.add_assoc] using this) H 0 o א (by simpa using h) simpa [Nat.succ_mul,Nat.add_assoc] using this) c 0 o א (by simpa using ho) simp only[Nat.zero_mul,Nat.zero_add,Nat.add_zero,hN] at this exact this lemma Pe {c H W q:ћ} (hq:q< c*(H*W)):q/(H*W)< c∧q/W%H< H∧q%W< W:=by have hp:0< H*W:=ш (by rintro e;simp[e] at hq);exact ⟨у (by rwa [ж]),п _ (Nat.pos_of_mul_pos_right hp),п _ (Nat.pos_of_mul_pos_left hp)⟩ lemma Ol (f:є->ѓ) (c h w k:ћ) (hs:c*h*w<2^32): G_c f (h*w).toUSize (k*w).toUSize Ѣk (w/k) (h/k) c 0 0 0 (К (c*(h/k*(w/k))) 0)= Array.ofFn (n:=c*(h/k*(w/k))) λq=>let ch:=q.val/(h/k*(w/k)) let y:=q.val/(w/k)%(h/k) let x:=q.val%(w/k) f ((ch*h+y*k)*w+x*k).toUSize:=by have hN:c*(h/k*(w/k))<2^32:=by have h1:h/k*(w/k)<=h*w:=Nat.mul_le_mul (Nat.div_le_self _ _) (Nat.div_le_self _ _) exact lt_of_le_of_lt ((Nat.mul_le_mul_left c h1).trans (Nat.mul_assoc c h w).symm.le) hs generalize hH:h/k=H at * generalize hW:w/k=W at * have hp:=Ou (f:=f) (sc:=h*w) (sy:=k*w) (sx:=k) (W:=W) (H:=H) (c:=c) (sp:=λq=>f ((q/(H*W)*h+q/W%H*k)*w+q%W*k).toUSize) rfl (λch y t h1 h2 h3=>by obtain ⟨d1,d2⟩:=Ks W (H*ch+y) t h3 obtain ⟨d3,d4⟩:=Ks H ch y h2 have e:ch*(H*W)+y*W+t=W*(H*ch+y)+t:=by ring rw[e,d2,ж H W,<-Nat.div_div_eq_div_mul,d1,d3,d4] congr 2 ring) (К (c*(H*W)) 0) ⟨by simp,hN,by simp⟩ apply Array.ext (by rw[hp.1,Array.size_ofFn]) intro i h1 h2 rw[<-в _ i h1,hp.2.2 i (by simpa using h2),Array.getElem_ofFn] lemma Qr {c h w k ch y x:ћ} {X:ѐ} (h1:c*h*w<2^32) (h2:ѡX<2^32) (h3:k*k<2^32) (hc:ch< c) (hy:y< h/k) (hx:x< w/k) (t:є) (ht:Ѡt< k*k): rdW X (((ch*h+y*k)*w+x*k).toUSize+(rdW (E_off k w) t).toUSize)=poolAt h w k X ch y x Ѡt:=by have e0:=ف (ch*h+y*k) (Ѡt/k) w have h4:=Jv hc hy hx ht rw[Gl _ _ h2,Gl _ _ (by rwa [E_off,Array.size_ofFn]),E_off,Ba _ (λt=>(t/k*w+t%k).toUInt32) _ ht,poolAt] generalize hu:Ѡt/k*w+Ѡt%k=u have e1:u.toUInt32.toUSize.toNat=u:=by rw[к,Nat.toUInt32_eq,ю,Й א] rw[Bu _ _ (by rw[e1,Gi _ א];omega),e1,Gi _ א] congr 1 omega lemma Nt {c h w k ch y x:ћ} {X:ѐ} (h1:c*h*w<=ѡX) (h2:ѡX<2^32) (h3:k*k<2^20) (hg:∀ i,i< ѡX->good X[i]! = true) (hc:ch< c) (hy:y< h/k) (hx:x< w/k) (j:ѓ) (hj:j=255∨(j=2∧k*k=4)∨(j=6∧k*k=64)): E_win X (E_off k w) k w (k*k) j (E_div (k*k) (dotFn (k*k) (λ_=>0) (λ_=>oneW))) (dv oneW) (nfOf (k*k)) (dv 0) ((ch*h+y*k)*w+x*k).toUSize (k*k).toUSize 0 0 0 0= E_div (k*k) (dotOf (k*k) (poolAt h w k X ch y x) (λ_=>oneW)):=by have hn:=Gi (k*k) א have hk:0< k:=ш (by rintro rfl;simp at hy) have hI t (ht:t< k*k):=Jv hc hy hx ht have e2:=Gi ((ch*h+y*k)*w+x*k) (by have:=hI 0 (Nat.mul_pos hk hk);simp at this;omega) rw[Qt X _ k w (k*k) j _ _ _ _ _ (poolAt h w k X ch y x) (λt ht=>Qr א h2 א hc hy hx t (hn ▸ А.1 ht)) (k*k) 0 0 0 0 ((З _).trans hn.symm),USize.toNat_zero,<-ـ] refine Re X _ k w _ h3 j hj _ (λt ht=>hg _ (by have:=hI t ht;omega)) ?_ rw[E_dot,Bt] congr 1 funext t rw[e2,poolAt] congr 1 ring lemma Na:∀ k,k<17->0< k->E_div (k*k) (dotFn (k*k) (λ_=>0) (λ_=>oneW))=0:=by decide +kernel lemma Qc:avgF=avgpoolSpec:=by funext c h w k X;unfold avgF;split . rename_i hc;obtain ⟨h1,h2,h3,h4⟩:=hc;simp only[avgpoolSpec,avgpoolWith] rw[show (if 0< k∧k<17 then (0:ѓ) else E_div (k*k) (dotFn (k*k) (λ_=>0) (λ_=>oneW)))=E_div (k*k) (dotFn (k*k) (λ_=>0) (λ_=>oneW)) by split;. rename_i e;exact (Na k e.2 e.1).symm . rfl] rw[Sc,E_grid,Ol _ c h w k א];apply congrArg Array.ofFn;funext ⟨q,hq⟩;obtain ⟨a1,a2,a3⟩:=Pe hq;dsimp only;refine Nt h1 h2 h3 (Gs X h2 h4).2.2.1 a1 a2 a3 _ ?_;split_ifs with e1 e2;. exact Or.inr (Or.inl ⟨rfl,e1⟩) . exact Or.inr (Or.inr ⟨rfl,e2⟩) . exact Or.inl rfl . rfl end def baseKernels:Kernels where core:=specCore dense:=⟨linF,gemmWith dotFn⟩ conv:=⟨convF,depthF⟩ elem:=⟨avgF,maxpoolW,addF,scaleF⟩ norm:=⟨rmsnormWith dotFn,layernormWith dotFn⟩ theorem Cf:Obligation baseKernels:=by simp only[Obligation,baseKernels,specKernels,specDense,specConv,specElem,specNorm,avgpoolSpec,rmsnormSpec,layernormSpec,Su,gemmSpec,Sf,Sn,Qv,Rr,Qc,Sq,Bt] open ExactRuntime local notation "VV" => (Void.mk ()) local notation "RG" => ST.Prim.Ref.get local notation "RS" => ST.Prim.Ref.swap local notation "RN" => ST.Prim.mkRef local notation "RT" => ST.Ref Unit local notation "BK" => baseKernels local notation "CS" => ConvShape class Ab (α:Type) where eq:α→α→ј ok:∀ {a b:α},eq a b= true→a= b local instance:Ab ћ:=⟨(·==·),eq_of_beq⟩ local instance:Ab ј:=⟨(·==·),eq_of_beq⟩ local instance:Ab њ:=⟨(·==·),eq_of_beq⟩ namespace StringArrayView def nibble (n:Nat):Char:= Char.ofUInt8 (n % 16).toUInt8 lemma Bj (n:Nat):(nibble n).toNat=n%16:= by have h:n%16<16:=Nat.mod_lt _ (by decide) simp [nibble,Char.toNat,Char.ofUInt8,Nat.mod_eq_of_lt (by omega:n%16<256)] lemma By (n:Nat):(nibble n).utf8Size=1:= by apply Char.utf8Size_eq_one_iff.mpr rw [UInt32.le_iff_toNat_le] change (nibble n).toNat≤127 rw [Bj] have:= Nat.mod_lt n (by decide:0<16) omega def digits:Nat→Nat→List Char | 0,_ => [] | n+1,v=> nibble v::digits n (v/16) lemma Bf (n v:Nat):(digits n v).length=n:= by induction n generalizing v with | zero=> rfl | succ n ih=> simp [digits,ih] lemma Cb (n v:Nat):(digits n v).utf8Encode.size=n:= by induction n generalizing v with | zero=> simp [digits] | succ n ih=> rw [digits,List.utf8Encode_cons] simp [List.utf8Encode_singleton,By,ih,Nat.add_comm] lemma Bq (n:Nat) (x y:Nat) (hx:x<16^n) (hy:y<16^n) (h:digits n x=digits n y):x=y:= by induction n generalizing x y with | zero=> simp at hx hy;omega | succ n ih=> have hh:=List.cons.inj h have hm:=congrArg Char.toNat hh.1 rw [Bj,Bj] at hm have hx':x/16<16^n:= by simp only [Nat.pow_succ] at hx;omega have hy':y/16<16^n:= by simp only [Nat.pow_succ] at hy;omega have hd:=ih (x/16) (y/16) hx' hy' hh.2 omega def encodeChars:List UInt32→List Char | []=> [] | w::ws=> digits 8 w.toNat++encodeChars ws lemma Ca (ws:List UInt32):(encodeChars ws).utf8Encode.size=8*ws.length:= by induction ws with | nil=> simp [encodeChars] | cons w ws ih=> simp [encodeChars,Cb,ih,Nat.mul_add,Nat.add_comm] lemma Bi:Function.Injective encodeChars:= by intro xs induction xs with | nil=> intro ys h cases ys with | nil=> rfl | cons y ys=> have hl:=congrArg List.length h simp [encodeChars,Bf] at hl omega | cons x xs ih=> intro ys h cases ys with | nil=> have hl:=congrArg List.length h simp [encodeChars,Bf] at hl | cons y ys=> have hd:=congrArg (List.take 8) h have ht:=congrArg (List.drop 8) h simp only [encodeChars] at hd ht have dx:=Bf 8 x.toNat have dy:=Bf 8 y.toNat have dh:digits 8 x.toNat=digits 8 y.toNat:= by simpa [List.take_append,dx,dy] using hd have dt:encodeChars xs=encodeChars ys:= by simpa [List.drop_append,dx,dy] using ht have hx:x.toNat<16^8:=by simpa using x.toNat_lt have hy:y.toNat<16^8:=by simpa using y.toNat_lt have xy:=UInt32.toNat_inj.mp (Bq 8 _ _ hx hy dh) exact congrArg₂ List.cons xy (ih dt) def encode (ws:List UInt32):String:=String.ofList (encodeChars ws) lemma Bp:Function.Injective encode:= by intro a b h exact Bi (String.ofList_injective h) lemma Bn (ws:List UInt32):(encode ws).utf8ByteSize=8*ws.length:= by simpa [encode,←String.size_toByteArray] using Ca ws def retag {α β:Type} (r:ST.Ref Unit α) (h:Nonempty β):ST.Ref Unit β:=⟨r.ref,h⟩ @[noinline] private def view (a:@& Array UInt32):{s:String//s=encode a.toList.tail}:= let cell:=ST.Prim.mkRef a (Void.mk ()) (ST.Prim.Ref.get (retag cell.val ⟨⟨encode a.toList.tail,rfl⟩⟩) cell.state).val @[inline] private def fullCmp (a b:@& String) (n:Nat) (ha:n=a.utf8ByteSize) (hb:n=b.utf8ByteSize):Bool:= String.Slice.Pattern.Internal.memcmpStr a b ⟨0⟩ ⟨0⟩ ⟨n⟩ (by simpa [String.Pos.Raw.le_iff,ha]) (by simpa [String.Pos.Raw.le_iff,hb]) lemma Cs (a b:String) (n:Nat) (ha:n=a.utf8ByteSize) (hb:n=b.utf8ByteSize): fullCmp a b n ha hb=true ↔ a=b:= by rw [fullCmp,String.Slice.Pattern.Internal.memcmpStr_eq_true_iff] simp only [String.Pos.Raw.byteIdx_offsetBy,Nat.zero_add] have hA:a.toByteArray.extract 0 n=a.toByteArray:=by rw [ha];exact ByteArray.extract_zero_size have hB:b.toByteArray.extract 0 n=b.toByteArray:=by rw [hb];exact ByteArray.extract_zero_size rw [hA,hB,String.toByteArray_inj] @[noinline] private def tailCmp (a b:@& Array UInt32) (hs:a.size=b.size):Bool:= let x:=view a let y:=view b fullCmp x.val y.val (8*(a.size-1)) (by rw [x.property,Bn];simp) (by rw [y.property,Bn];simp [hs]) lemma Br (a b:Array UInt32) (hs:a.size=b.size): tailCmp a b hs=true ↔ a.toList.tail=b.toList.tail:= by unfold tailCmp rw [Cs,(view a).property,(view b).property] exact ⟨fun h=>Bp h,congrArg encode⟩ lemma Bl (a b:Array UInt32) (ha:0h (USize.lt_iff_toNat_lt.mpr h') omega termination_by n.toNat-k.toNat decreasing_by have hk:k.toNatAD x y) (fun h=>by subst h;simp [AD,FE.ls,StringArrayView.Br]) local instance:Ab (ё):=⟨Ah,fun h=>AZ _ _ h⟩ local instance {α β:Type} [Ab α] [Ab β]:Ab (α×β) where eq p q:=Ab.eq p.1 q.1&&Ab.eq p.2 q.2 ok h:=by simp only [Bool.and_eq_true] at h exact Prod.ext (Ab.ok h.1) (Ab.ok h.2) local instance:Ab CS where eq s t:=withPtrEq s t (fun _=>s.cin==t.cin&&s.h==t.h&&s.w==t.w&&s.cout==t.cout&&s.kh==t.kh&& s.kw==t.kw&&s.stride==t.stride&&s.pad==t.pad) (fun h=>by subst h;simp) ok {s t} h:= by dsimp only [withPtrEq] at h cases s; cases t simp only [Bool.and_eq_true,beq_iff_eq] at h obtain ⟨⟨⟨⟨⟨⟨⟨h1,h2⟩,h3⟩,h4⟩,h5⟩,h6⟩,h7⟩,h8⟩:=h subst h1 h2 h3 h4 h5 h6 h7 h8; rfl structure Aa {α β:Type} (f:α→β) where key:α val:β ok:val=f key structure Kc where s:CS v:ј x:ё w:ё b:ё local instance:Ab Kc where eq a b:=Ab.eq a.s b.s&&(Ab.eq a.v b.v&&(Ab.eq a.x b.x&&(Ab.eq a.w b.w&&Ab.eq a.b b.b))) ok {a b} h:=by cases a;cases b;simp only [Bool.and_eq_true] at h obtain ⟨h1,h2,h3,h4,h5⟩:=h cases Ab.ok h1;cases Ab.ok h2;cases Ab.ok h3;cases Ab.ok h4;cases Ab.ok h5;rfl structure Kb where v:ј c:ћ n:ћ x:ё s:ё t:ё local instance:Ab Kb where eq a b:=Ab.eq a.v b.v&&(Ab.eq a.c b.c&&(Ab.eq a.n b.n&&(Ab.eq a.x b.x&&(Ab.eq a.s b.s&&Ab.eq a.t b.t)))) ok {a b} h:=by cases a;cases b;simp only [Bool.and_eq_true] at h obtain ⟨h1,h2,h3,h4,h5,h6⟩:=h cases Ab.ok h1;cases Ab.ok h2;cases Ab.ok h3;cases Ab.ok h4;cases Ab.ok h5;cases Ab.ok h6;rfl structure Kd where r:ћ i:ћ o:ћ v:ј x:ё w:ё b:ё local instance:Ab Kd where eq a b:=Ab.eq a.r b.r&&(Ab.eq a.i b.i&&(Ab.eq a.o b.o&&(Ab.eq a.v b.v&&(Ab.eq a.x b.x&&(Ab.eq a.w b.w&&(Ab.eq a.b b.b)))))) ok {a b} h:=by cases a;cases b;simp only[Bool.and_eq_true] at h obtain ⟨h1,h2,h3,h4,h5,h6,h7⟩:=h cases Ab.ok h1;cases Ab.ok h2;cases Ab.ok h3;cases Ab.ok h4;cases Ab.ok h5;cases Ab.ok h6;cases Ab.ok h7;rfl structure Kr where r:ћ n:ћ e:њ x:ё g:ё local instance:Ab Kr where eq a b:=Ab.eq a.r b.r&&(Ab.eq a.n b.n&&(Ab.eq a.e b.e&&(Ab.eq a.x b.x&&(Ab.eq a.g b.g)))) ok {a b} h:=by cases a;cases b;simp only[Bool.and_eq_true] at h obtain ⟨h1,h2,h3,h4,h5⟩:=h cases Ab.ok h1;cases Ab.ok h2;cases Ab.ok h3;cases Ab.ok h4;cases Ab.ok h5;rfl structure Kn where r:ћ n:ћ e:њ x:ё g:ё b:ё local instance:Ab Kn where eq a b:=Ab.eq a.r b.r&&(Ab.eq a.n b.n&&(Ab.eq a.e b.e&&(Ab.eq a.x b.x&&(Ab.eq a.g b.g&&(Ab.eq a.b b.b))))) ok {a b} h:=by cases a;cases b;simp only[Bool.and_eq_true] at h obtain ⟨h1,h2,h3,h4,h5,h6⟩:=h cases Ab.ok h1;cases Ab.ok h2;cases Ab.ok h3;cases Ab.ok h4;cases Ab.ok h5;cases Ab.ok h6;rfl def AK(a:Kd):ё:=(BK).dense.linear a.r a.i a.o a.v a.x a.w a.b def AF:ћ×ћ×ћ×ћ×ё×ё→ё | (m,k,n,p,x,a)=>(BK).dense.gemm m k n p a x def At (a:Kc):ё:=(BK).conv.conv2d a.s a.v a.x a.w a.b def Az (a:Kc):ё:=(BK).conv.depthwise a.s a.v a.x a.w a.b def Aj:ћ×ћ×ћ×ћ×ё→ё | (c,h,w,k,x)=>(BK).elem.avgpool c h w k x def AU:ћ×ћ×ћ×ћ×ё→ё | (c,h,w,k,x)=>(BK).elem.maxpool c h w k x def Ad:ј×ё×ё→ё | (v,x,s)=>(BK).elem.addRelu v x s def Ao (a:Kb):ё:=(BK).elem.scaleShift a.v a.c a.n a.x a.s a.t def Bb(a:Kr):ё:=(BK).norm.rmsnorm a.r a.n a.e a.x a.g def AP(a:Kn):ё:=(BK).norm.layernorm a.r a.n a.e a.x a.g a.b @[noinline] def AN:RT (List (Aa AK)):=(RN [] VV).val @[noinline] def AI:RT (Array (Aa AF)):=(RN #[] VV).val @[noinline] def Aw:RT (Array (Aa At)):=(RN #[] VV).val @[noinline] def AC:RT (Array (Aa Az)):=(RN #[] VV).val @[noinline] def Am:RT (Array (Aa Aj)):=(RN #[] VV).val @[noinline] def AX:RT (Array (Aa AU)):=(RN #[] VV).val @[noinline] def Ag:RT (Array (Aa Ad)):=(RN #[] VV).val @[noinline] def Ar:RT (Array (Aa Ao)):=(RN #[] VV).val @[noinline] def Be:RT (List (Aa Bb)):=(RN [] VV).val @[noinline] def AS:RT (List (Aa AP)):=(RN [] VV).val @[noinline] def Ax {α β:Type} (f:α→β):α→β:= f @[noinline] def Z3:RT (List (Aa AK)):= (RN (Ax (fun (_:Unit)=>([]:List (Aa AK))) ()) VV).val class FW (α:Type) where words:α→ћ local instance:FW ћ:=⟨fun _=>0⟩ local instance:FW ј:=⟨fun _=>0⟩ local instance:FW њ:=⟨fun _=>0⟩ local instance:FW CS:=⟨fun _=>0⟩ local instance:FW ё:=⟨Array.size⟩ local instance {α β:Type}[FW α][FW β]:FW (α×β):=⟨fun p=>FW.words p.1+FW.words p.2⟩ local instance:FW Kc:=⟨fun a=>a.x.size+a.w.size+a.b.size⟩ local instance:FW Kb:=⟨fun a=>a.x.size+a.s.size+a.t.size⟩ local instance:FW Kd:=⟨fun a=>a.x.size+(a.w.size+a.b.size)⟩ local instance:FW Kr:=⟨fun a=>a.x.size+a.g.size⟩ local instance:FW Kn:=⟨fun a=>a.x.size+(a.g.size+a.b.size)⟩ @[noinline] def FB:RT ћ:=(RN 0 VV).val @[noinline] def FH(n:ћ):ћ:= let old:=(RG FB VV).val (RS FB (min 33554433 (old+n)) VV).val @[noinline] def IC:RT (List ё):=(RN [] VV).val def ID (a:ё) (st:@& List ё):Option {y:ё//y=a}:= match st with | []=>none | b::tail=>if h:Ab.eq b a=true then some ⟨b,Ab.ok h⟩ else ID a tail @[noinline] def IE (a:ё):{y:ё//y=a}:= if a.size>65536 then ⟨a,rfl⟩ else let st:=(RG IC VV).val match ID a st with | some q=>q | none=> let old:=(RS IC (a::(if st.length<4096 then st else [])) VV).val if old.length<999999999 then ⟨a,rfl⟩ else ⟨a.extract 0 a.size,by simp⟩ @[noinline] def AY {α:Type} [Ab α] [FW α] {f:α→ё} (r:RT (Array (Aa f))) (a:α) (st:Array (Aa f)):{y // y = f a}:= let q:=IE (f a) let y:=q.val let st':=(if st.size<64 then st else #[]).push ⟨a,y,q.property⟩ let old:=(RS r st' VV).val if old.size<999999999&&FH (FW.words a+y.size)<999999999 then ⟨y,q.property⟩ else ⟨Ax f a,rfl⟩ @[noinline] def AE:RT ћ:=(RN 1001 VV).val @[noinline] def As:RT ћ:=(RN 1002 VV).val @[noinline] def Ay:RT ћ:=(RN 1003 VV).val @[noinline] def Ai:RT ћ:=(RN 1004 VV).val @[noinline] def AT:RT ћ:=(RN 1005 VV).val @[noinline] def Ac:RT ћ:=(RN 1006 VV).val @[noinline] def An:RT ћ:=(RN 1007 VV).val def KR {α β:Type}(r:RT α)(h:Nonempty β):RT β:=⟨r.ref,h⟩ @[noinline] def KT:Void Unit:=Void.mk () @[noinline] def KC:RT (Array (RT Unit×RT ћ)):= (RN #[(KR AN ⟨()⟩,AE),(KR AI ⟨()⟩,AE),(KR Aw ⟨()⟩,As),(KR AC ⟨()⟩,Ay),(KR Am ⟨()⟩,Ai),(KR AX ⟨()⟩,AT),(KR Ag ⟨()⟩,Ac),(KR Ar ⟨()⟩,An),(KR Be ⟨()⟩,AE),(KR AS ⟨()⟩,AE),(KR Z3 ⟨()⟩,AE)] VV).val @[noinline] def KV {α:Type}(n:ћ):Array ((α×Unit)×(ћ×Unit)):= if n<999999999 then (RG (KR KC ⟨#[]⟩) KT).val else #[] @[inline] def KP {α β:Type}[Inhabited α](i n:ћ)(f:α→ћ→β):β:= let v:Array ((α×Unit)×(ћ×Unit)):=KV n if h:iST.Out.val (RG FS (FK k)) local notation:max "Q1[" b "," n "]"=>if nif nif nif nif nif nif nif nif nSubtype.ext (p.2.trans q.2.symm) withPtrAddr a (fun u=>withPtrAddr b (fun v=>withPtrAddr c (fun w=>withPtrAddr d (fun z=>if u==v&&w==z then hit () else miss ()) (fun _ _=>eqv _ _)) (fun _ _=>eqv _ _)) (fun _ _=>eqv _ _)) (fun _ _=>eqv _ _) @[noinline] def PL(r i o:ћ)(v:ј)(x w b:ё)(st:List (Aa AK)):{y//y=AK ⟨r,i,o,v,x,w,b⟩}:= Z2 (if v then AN else Z3) (!v) ⟨r,i,o,v,x,w,b⟩ st @[noinline] def PN(r n:ћ)(e:њ)(x g b:ё)(st:List (Aa AP)):{y//y=AP ⟨r,n,e,x,g,b⟩}:= Z2 AS false ⟨r,n,e,x,g,b⟩ st @[noinline] def PG(m k n p:ћ)(x a:ё):ё:=Ax AF (m,k,n,p,x,a) @[noinline] def Z4 (r i o:ћ) (v:ј) (x w b:@& ё) (hit:@& Aa AK):ј:= let k:=hit.key Ab.eq k.r r&&(Ab.eq k.i i&&(Ab.eq k.o o&&(Ab.eq k.v v&&(Ab.eq k.x x&&(Ab.eq k.w w&&(Ab.eq k.b b)))))) namespace F inductive H where | a:UInt64→UInt64→H | b:UInt64→UInt64→H structure O where val:H flag:UInt8 @[noinline] def o (h:H):O:=⟨h,0⟩ @[noinline] def i (h:H):UInt64:= match h with | .a a b=> let box:=o h match box.val with | .a x y=> x+y | .b x y=> x+y | .b a b=> a ^^^ b def t {α β:Type} (r:ST.Ref Unit α) (h:Nonempty β):ST.Ref Unit β:=⟨r.ref,h⟩ @[noinline] def v (a:ё):H:= let r:=(ST.Prim.mkRef a (Void.mk ())).val (ST.Prim.Ref.get (t r ⟨H.b 0 0⟩) (Void.mk ())).val @[noinline] def c (a:ё):UInt64:= if System.Platform.numBits=64 then i (v a) else a.size.toUInt64 @[noinline] def f (a y:ё):{out:ё // out=y}:= if c a=18446744073709551615 then ⟨y.extract 0 y.size,by simp⟩ else ⟨y,rfl⟩ end F namespace P abbrev C:=RT ё @[noinline] def V {α β:Type} (a:α) (h:Nonempty β):β:= let r:=(ST.Prim.mkRef a (Void.mk ())).val (ST.Prim.Ref.get (F.t r h) (Void.mk ())).val @[noinline] def D (a:Array (Option C)):і:= F.c (V a ⟨(#[]:ё)⟩) @[noinline] def M (r:C):ByteArray:= let a:Array (Option C):=#[some r,none,none,none,none,none,none,none] let src:ByteArray:=V a ⟨ByteArray.empty⟩ let dst:=src.copySlice 0 ByteArray.empty 0 8 if D a=18446744073709551615 then dst.extract 0 dst.size else dst def O:ByteArray:= if System.Platform.numBits=64 then M ((ST.Prim.mkRef (#[]:ё) (Void.mk ())).val) else ByteArray.empty def O2:ByteArray:= if System.Platform.numBits=64 then M ((ST.Prim.mkRef (#[(0:ѓ)]:ё) (Void.mk ())).val) else ByteArray.empty structure B where n0:Nat n1:Nat slot:Option C def A:B:=V O ⟨⟨0,0,none⟩⟩ def A2:B:=V O2 ⟨⟨0,0,none⟩⟩ @[noinline] def Q (a:@& B):C:= match a.slot with | some r=> r | none=> (ST.Prim.mkRef (#[]:ё) (Void.mk ())).val @[noinline] def R (h:@& B):C:= Q h @[noinline] def Y (h:@& B) (a:ё):ё:= let r:=R h (ST.Prim.Ref.swap r a (Void.mk ())).val structure H where size:і z:і @[noinline] def z (a:@& ё):і:= let h:H:=V a ⟨⟨0,0⟩⟩ h.z @[noinline] def f (a y:ё):{out:ё // out=y}:= if System.Platform.numBits=64 then if z a ≤ 65536 then F.f (Y A a) y else F.f a y else F.f a y @[noinline] def s (p:@& B) (a y:ё):{out:ё//out=y}:= if System.Platform.numBits=64 && a.size≤65536 then let r:=R p let old:=(RS r a VV).val let h:H:=(RG (F.t r ⟨⟨0,0⟩⟩) VV).val if h.z≤65536 then F.f old y else F.f ((RS r old VV).val) y else F.f a y end P namespace F @[noinline] def h(x:ё)(held:@& ё)(y:ё):{z:ё//z=y}:= let eqv:=fun (a b:{z:ё//z=y})=>Subtype.ext (a.2.trans b.2.symm) withPtrAddr x (fun a=>withPtrAddr held (fun b=>if a==b then ⟨y,rfl⟩ else P.s P.A2 x y) (fun _ _=>eqv _ _)) (fun _ _=>eqv _ _) end F def AL (r i o:ћ) (v:ј) (x w b:ё) (st all:@& List (Aa AK)): {out:ё//out=AK ⟨r,i,o,v,x,w,b⟩}:= match st with | []=> PL r i o v x w b all | hit::tail=> let next:=fun ()=>AL r i o v x w b tail all PP hit.key.w w hit.key.b b (fun ()=> if hk:Z4 r i o v x w b hit=true then let y:=F.h x hit.key.x hit.val ⟨y.val,y.2.trans (hit.ok.trans (congrArg AK (Ab.ok hk)))⟩ else next ()) next @[inline] def AM (r i o:ћ) (v:ј) (x w b:ё):{y//y=AK ⟨r,i,o,v,x,w,b⟩}:= KP (if v then 0 else 10) x.size (fun st _=>AL r i o v x w b st st) def AG (m k n p:ћ) (x a:ё) (st:Array (Aa AF)) (j:ћ) (z:ј):{y // y= AF (m,k,n,p,x,a)}:= let miss:=fun ()=>AY AI (m,k,n,p,x,a) st let next:=fun ()=>if z then if j=0 then miss () else AG m k n p x a st (j-1) true else AG m k n p x a st (st.size-1) true if hj:j if hk:((Ab.eq key.1 m&&(Ab.eq key.2.1 k&&(Ab.eq key.2.2.1 n&&(Ab.eq key.2.2.2.1 p&&(Ab.eq key.2.2.2.2.1 x&&Ab.eq key.2.2.2.2.2 a))))))=true then let old:=(RS AE (j+1) VV).val if old<999999999 then ⟨st[j].val,by rw [st[j].ok]; congr 1; exact Ab.ok hk⟩ else ⟨PG m k n p x a,rfl⟩ else next ()) next else if z then miss () else AG m k n p x a st (st.size-1) true termination_by if z then j+1 else st.size+2 decreasing_by all_goals simp_all all_goals omega @[inline] def AH (m k n p:ћ) (x a:ё):= KP 1 x.size (fun st j=>AG m k n p x a st j false) @[noinline] def PC{f:Kc→ё}(s:@& CS)(v:ј)(x w b:@& ё)(hit:@& Aa f):ј:= let key:=hit.key Ab.eq key.s s&&(Ab.eq key.v v&&(Ab.eq key.x x&&(Ab.eq key.w w&&Ab.eq key.b b))) @[noinline] def PB(v:ј)(c n:ћ)(x s t:@& ё)(hit:@& Aa Ao):ј:= let key:=hit.key Ab.eq key.v v&&(Ab.eq key.c c&&(Ab.eq key.n n&&(Ab.eq key.x x&&(Ab.eq key.s s&&Ab.eq key.t t)))) @[noinline] def PX(s:CS)(v:ј)(x w b:ё):ё:=Ax At ⟨s,v,x,w,b⟩ @[noinline] def PD(s:CS)(v:ј)(x w b:ё):ё:=Ax Az ⟨s,v,x,w,b⟩ @[noinline] def PY(v:ј)(c n:ћ)(x s t:ё):ё:=Ax Ao ⟨v,c,n,x,s,t⟩ def Au (s:CS) (v:ј) (x w b:ё) (st:Array (Aa At)) (j:ћ) (z:ј):{y // y = At ⟨s,v,x,w,b⟩}:= let miss:=fun ()=>AY Aw ⟨s,v,x,w,b⟩ st let next:=fun ()=>if z then if j=0 then miss () else Au s v x w b st (j-1) true else Au s v x w b st (st.size-1) true if hj:j if hk:PC s v x w b st[j]=true then let old:=(RS As (j+1) VV).val if old<999999999 then let q:=F.h x key.x st[j].val ⟨q.val,q.2.trans (by rw [st[j].ok]; congr 1; exact Ab.ok hk)⟩ else ⟨PX s v x w b,rfl⟩ else next ()) next else if z then miss () else Au s v x w b st (st.size-1) true termination_by if z then j+1 else st.size+2 decreasing_by all_goals simp_all all_goals omega @[inline] def Av (s:CS) (v:ј) (x w b:ё):{y//y=At ⟨s,v,x,w,b⟩}:= KP 2 x.size (fun st j=>Au s v x w b st j false) def AA (s:CS) (v:ј) (x w b:ё) (st:Array (Aa Az)) (j:ћ) (z:ј):{y // y = Az ⟨s,v,x,w,b⟩}:= let miss:=fun ()=>AY AC ⟨s,v,x,w,b⟩ st let next:=fun ()=>if z then if j=0 then miss () else AA s v x w b st (j-1) true else AA s v x w b st (st.size-1) true if hj:j if hk:PC s v x w b st[j]=true then let old:=(RS Ay (j+1) VV).val if old<999999999 then ⟨st[j].val,by rw [st[j].ok]; congr 1; exact Ab.ok hk⟩ else ⟨PD s v x w b,rfl⟩ else next ()) next else if z then miss () else AA s v x w b st (st.size-1) true termination_by if z then j+1 else st.size+2 decreasing_by all_goals simp_all all_goals omega @[inline] def AB (s:CS) (v:ј) (x w b:ё):= KP 3 x.size (fun st j=>AA s v x w b st j false) def Ak (c h w k:ћ) (x:ё) (st:Array (Aa Aj)) (j:ћ) (z:ј):{y // y= Aj (c,h,w,k,x)}:= let miss:=fun ()=>AY Am (c,h,w,k,x) st if hj:jAk c h w k x st j false) def AV (c h w k:ћ) (x:ё) (st:Array (Aa AU)) (j:ћ) (z:ј):{y // y= AU (c,h,w,k,x)}:= let miss:=fun ()=>AY AX (c,h,w,k,x) st if hj:jAV c h w k x st j false) def Ae (v:ј) (x s:ё) (st:Array (Aa Ad)) (j:ћ) (z:ј):{y // y= Ad (v,x,s)}:= let miss:=fun ()=>AY Ag (v,x,s) st if hj:jAe v x s st j false) def Ap (v:ј) (c n:ћ) (x s t:ё) (st:Array (Aa Ao)) (j:ћ) (z:ј):{y // y = Ao ⟨v,c,n,x,s,t⟩}:= let miss:=fun ()=>AY Ar ⟨v,c,n,x,s,t⟩ st let next:=fun ()=>if z then if j=0 then miss () else Ap v c n x s t st (j-1) true else Ap v c n x s t st (st.size-1) true if hj:j if hk:PB v c n x s t st[j]=true then let old:=(RS An (j+1) VV).val if old<999999999 then ⟨st[j].val,by rw [st[j].ok]; congr 1; exact Ab.ok hk⟩ else ⟨PY v c n x s t,rfl⟩ else next ()) next else if z then miss () else Ap v c n x s t st (st.size-1) true termination_by if z then j+1 else st.size+2 decreasing_by all_goals simp_all all_goals omega @[inline] def Aq (v:ј) (c n:ћ) (x s t:ё):= KP 7 x.size (fun st j=>Ap v c n x s t st j false) @[noinline] def Z5 (r n:ћ) (e:њ) (x g:@& ё) (hit:@& Aa Bb):ј:= let k:=hit.key Ab.eq k.r r&&(Ab.eq k.n n&&(Ab.eq k.e e&&(Ab.eq k.x x&&(Ab.eq k.g g)))) def Bc (r n:ћ) (e:њ) (x g:ё) (st:@& List (Aa Bb)): {out:ё//out.isEmpty=true ∨ out=Bb ⟨r,n,e,x,g⟩}:= match st with | []=> ⟨#[],Or.inl rfl⟩ | hit::tail=> if hk:Z5 r n e x g hit=true then ⟨hit.val,Or.inr (hit.ok.trans (congrArg Bb (Ab.ok hk)))⟩ else Bc r n e x g tail @[inline] def Bd (r n:ћ) (e:њ) (x g:ё):{y//y=Bb ⟨r,n,e,x,g⟩}:= KP 8 x.size (fun st _=> let q:=Bc r n e x g st if h:q.val.isEmpty=true then Z2 Be false ⟨r,n,e,x,g⟩ st else ⟨q.val,q.property.resolve_left h⟩) @[noinline] def Z6 (r n:ћ) (e:њ) (x g b:@& ё) (hit:@& Aa AP):ј:= let k:=hit.key Ab.eq k.r r&&(Ab.eq k.n n&&(Ab.eq k.e e&&(Ab.eq k.x x&&(Ab.eq k.g g&&(Ab.eq k.b b))))) def AQ (r n:ћ) (e:њ) (x g b:ё) (st all:@& List (Aa AP)): {out:ё//out=AP ⟨r,n,e,x,g,b⟩}:= match st with | []=> PN r n e x g b all | hit::tail=> let next:=fun ()=>AQ r n e x g b tail all PP hit.key.g g hit.key.b b (fun ()=> if hk:Z6 r n e x g b hit=true then let y:=PP hit.key.x x hit.key.x x (fun ()=>⟨hit.val,rfl⟩) (fun ()=>P.f x hit.val) ⟨y.val,y.2.trans (hit.ok.trans (congrArg AP (Ab.ok hk)))⟩ else next ()) next @[inline] def AR (r n:ћ) (e:њ) (x g b:ё):{y//y=AP ⟨r,n,e,x,g,b⟩}:= KP 9 x.size (fun st _=>AQ r n e x g b st st) def kernels:Kernels where core:=(BK).core dense:= { linear:= fun r i o v x w b=> (AM r i o v x w b).val, gemm:=fun m k n p a x=>(AH m k n p x a).val} conv:= { conv2d:= fun s v x w b=> (Av s v x w b).val, depthwise:=fun s v x w b=>(AB s v x w b).val} elem:= { avgpool:= fun c h w k x=> (Al c h w k x).val, maxpool:=fun c h w k x=>(AW c h w k x).val, addRelu:=fun v x s=>(Af v x s).val, scaleShift:=fun v c n x s t=>(Aq v c n x s t).val} norm:= { rmsnorm:= fun r n e x g=> (Bd r n e x g).val, layernorm:=fun r n e x g b=>(AR r n e x g b).val} theorem correct:Obligation kernels:=by have h:kernels=BK:=by change kernels=⟨(BK).core, ⟨(BK).dense.linear,(BK).dense.gemm⟩, ⟨(BK).conv.conv2d,(BK).conv.depthwise⟩, ⟨(BK).elem.avgpool,(BK).elem.maxpool,(BK).elem.addRelu,(BK).elem.scaleShift⟩, ⟨(BK).norm.rmsnorm,(BK).norm.layernorm⟩⟩ simp only [kernels,Kernels.mk.injEq,DenseKernels.mk.injEq,ConvKernels.mk.injEq,ElementKernels.mk.injEq,NormKernels.mk.injEq,true_and] refine ⟨⟨?_,?_⟩,⟨?_,?_⟩,⟨?_,?_,?_,?_⟩,⟨?_,?_⟩⟩ · funext r i o v x w b; exact (AM r i o v x w b).2 · funext m k n p a x; exact (AH m k n p x a).2 · funext s v x w b; exact (Av s v x w b).2 · funext s v x w b; exact (AB s v x w b).2 · funext c h w k x; exact (Al c h w k x).2 · funext c h w k x; exact (AW c h w k x).2 · funext v x s; exact (Af v x s).2 · funext v c n x s t; exact (Aq v c n x s t).2 · funext r n e x g; exact (Bd r n e x g).2 · funext r n e x g b; exact (AR r n e x g b).2 exact h.trans Cf end Submission