import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open ExactRuntime renaming idxOf->γ,Word->δ,mantOf->ε,oneW->ζ,signOf->η,expOf->θ,ofW->ι,Fmt->κ,toWord->π,finishWord->ρ,rationalWord->ς,ConvShape->σ,dotOf->Β,windowAt->Δ,decodeD->Ο,sqrtLower->Ψ,limbVal->Ϗ,decodeD_toRat->ϕ,mantOf_lt_24->ϖ,addLimbs64->ϗ,toDyadic_ofUInt32->Ϟ,sqrtAccuracy->Ϭ,rowVariance->ϭ,finishWord_scale->ἄ,sqrtRational->ἆ,isFinite_ofUInt32->ἐ,decodeD_negative->ἑ open Nat renaming mod_eq_of_lt->ν,shiftLeft_eq->υ,two_pow_pos->ψ,shiftRight_eq_div_pow->ω,mul_le_mul_right->Ε,pow_le_pow_right->Η,pow_add->Θ,zero_add->Λ,le_trans->Μ,mod_lt->Χ,lt_of_le_of_lt->ϊ,mul_comm->ό,mul_pos->ύ,div_eq_of_lt->ϑ,pos_of_ne_zero->ϒ,and_two_pow_sub_one_eq_mod->Ϙ,add_mul_div_right->ϙ,lt_of_lt_of_le->ϛ,mul_zero->Ϝ,add_comm->ϝ,le_mul_of_pos_right->ϟ,div_div_eq_div_mul->Ϡ,mul_assoc->ϡ,add_mul->Ϣ,add_mul_mod_self_right->Ϧ,zero_mul->Ϫ,one_mul->ϫ,lt_of_le_of_ne->ϰ,log2_self_le->ϲ,le_add_right->ϳ,div_lt_of_lt_mul->Ϸ,mul_eq_zero->ϸ,eq_zero_or_pos->Ϲ,div_add_mod'->Ϻ,cast_sub->ἂ,mul_lt_mul_of_pos_right->ἇ,le_mul_of_pos_left->Ἀ,lt_log2_self->Ἂ,toUInt64_eq->Ἄ,log2_eq_iff->Ἅ,add_le_add->Ἆ,add_zero->Ἇ,mul_lt_mul_of_lt_of_le->ἕ,le_div_iff_mul_le->Ἑ,div_lt_iff_lt_mul->Ἒ,lt_succ_iff->Ἔ,lt_or_eq_of_le->Ἕ,div_add_mod->ἦ,mul_le_mul->Ἢ,cast_ofNat->Ἣ,pos_iff_ne_zero->Ἧ,div_mul_le_self->ἲ,le_one_iff_eq_zero_or_eq_one->ἷ open UInt64 renaming toNat_add->ξ,toNat_inj->ο,toNat_sub_of_le->Α,toNat_shiftRight->Ζ,lt_iff_toNat_lt->Ι,le_iff_toNat_le->Κ,toNat_shiftLeft->Ρ,toNat_sub->Φ,le_iff_toNat_le->ϐ,toNat_zero->ϔ,toNat_lt_size->Ϛ,toNat_toUInt32->ϧ,toNat_lt->Ϩ,le_iff_toNat_le->Ϯ,toNat_mul->ϱ,toNat_inj->ἡ,toNat_and->ἢ,toNat->Ἡ,toNat_ofNat'->ἱ open USize renaming lt_iff_toNat_lt->τ,le_size->φ,size->Ξ,lt_iff_toNat_lt->ϋ,toNat_one->ϻ,toNat_sub_of_le->ἰ,toNat_inj->ἶ open Bool renaming false_eq_true->χ,xor->Γ,and_eq_true->ϓ,or_eq_true->ἀ,eq_iff_iff->ἁ,not_eq_true'->ἠ,false_ne_true->ἳ open UInt32 renaming toNat_inj->Ν,ofNat->ϣ,toNat_toUInt64->ϯ,toNat_shiftRight->϶,toNat_lt_size->Ἁ,le_iff_toNat_le->Ἐ,toNat_ofNat'->Ἓ,toNat_and->ἣ,toNat_toUSize->ἥ,toNat_inj->Ἥ,lt_iff_toNat_lt->Ἦ open List renaming range->Τ,range'_succ->ϴ,ext_getElem->ἤ,foldl_cons->ἧ open Array renaming replicate->Υ,getElem_ofFn->Ἃ,size_ofFn->Ἠ,ofFn->Ἲ open Or renaming inl->Ω open FloatFormat renaming toModel->ώ open Model.NativeBinary32 renaming mkBits->Ϥ open Model renaming toReal->ϥ,roundDyadicGeneral->ἒ,addDyadic->ἓ,isFinite->ἔ,roundDyadicGeneral_eq_roundDyadic->Ἤ open Int renaming add_emod->ϩ,negSucc->ἃ open Int64 renaming ofInt->ϵ open FloatLib.Numerics renaming roundQuotientEven->ἅ,roundShiftRightEven->ἵ,shiftRightJam->Ἰ open Float.Model renaming totalExponent->ἴ open Model.Reduction.Internal renaming State->Ἱ local notation:max x:max "˟"=>UInt64.toNat (x :) local notation:max x:max "߷"=>USize.toNat (x :) local notation:max x:max "؟"=>UInt32.toNat (x :) local notation:max x:max "۞"=>Nat.toUSize (x :) local notation:max x:max "۩"=>Nat.log2 (x :) local notation:max x:max "܁"=>Fin.val (x :) local notation:max x:max "܆"=>Array.size (x :) local notation:max x:max "܋"=>ExactRuntime.ConvShape.stride (x :) local notation:max x:max "܌"=>UInt32.toUInt64 (x :) local notation:max x:max "߾"=>UInt64.toNat_lt (x :) local notation:max x:max "֍"=>Array.toList (x :) local notation:max x:max "؉"=>FloatLib.Floats.Formats.BinaryInterchange.FloatFormat.fracWidth (x :) local notation:max x:max "؛"=>UInt64.toUInt32 (x :) local notation:max x:max "؝"=>Nat.toUInt64 (x :) local notation:max x:max "٪"=>Int.toNat (x :) local notation"א"=>by omega local notation"ב"=>by norm_num local notation"ג"=>by simp local notation"ד"=>by decide local notation"ה"=>by positivity local notation"ו"=>by simp;omega local notation"ז"=>by grind local notation"ח"=>by ring local notation"ט"=>by simp_all local notation"߿"=>0x80000000 local notation"ר"=>0x100000000 local notation"ש"=>0x7FFFFFFF local notation"ת"=>ite_true local notation"ؠ"=>ite_false local notation"ء"=>decide_eq_true_eq local notation"ا"=>zpow_natCast local notation"ث"=>decide_eq_true_iff local notation"ذ"=>getElem!_pos local notation"غ"=>Fmt.minSubnormalExponent local notation"ق"=>UInt64 local notation"ك"=>UInt32 local notation"ل"=>Array local notation"م"=>USize local notation"ه"=>Bool local notation"ٽ"=>Nat local notation"پ"=>Int local notation"ٿ"=>Model.isNaN_eq_false_of_toDyadic?_some local postfix:max"چ"=>Array.size local postfix:max"ڇ"=>UInt64.toNat local postfix:max"ڇ"=>USize.toNat local postfix:max"ڇ"=>UInt32.toNat local postfix:max"ڇ"=>Int.toNat local postfix:max"ڈ"=>Nat.toUSize local postfix:max"ڈ"=>UInt64.toUSize local postfix:max"ڈ"=>UInt32.toUSize local notation:max"ډ"k:max=>Array.ofFn (n:=k) structure Acc where pos:ل ٽ neg:ل ٽ special:ه negZero:ه def Acc.empty:Acc:=⟨Υ 18 0,Υ 18 0,false,true⟩ def Acc.total (acc:Acc):پ:=(Ϗ acc.pos.toList:پ)-Ϗ 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,ϗ ng m.toUInt64 idx,sp,false⟩ else ⟨ϗ pos m.toUInt64 idx,ng,sp,false⟩ @[inline] def Acc.markSpecial (acc:Acc):Acc := match acc with | ⟨pos,ng,_,nz⟩=>⟨pos,ng,true,nz⟩ lemma Acc.add_spec (a:Acc) (m d:ٽ) (b:ه) (e:a.posچ=18) (f:a.negچ=18) (g:m<2^64) (h:d/32+1<18) : (a.add m d b).posچ=18/\(a.add m d b).negچ=18 /\ (a.add m d b).special=a.special /\ (a.add m d b).negZero=(a.negZero&&(decide (m=0)&&b)) /\ (a.add m d b).total=a.total+(if b then -(m:پ) else m)*2^d:=by obtain⟨pos,k,l,n⟩:=a;simp only at e f;by_cases j:m=0 . simp[Acc.add,Acc.total,j,e,f] . cases b . refine⟨by simp[Acc.add,j,addLimbs64_size,e],by simp[Acc.add,j,f],by simp[Acc.add,j],by simp[Acc.add,j],?_⟩ simp only[Acc.add,j,ؠ,χ,addLimbs64_eq _ _ _ g,Acc.total];rw[addLimbs_val _ _ _ א];push_cast;ring . refine⟨by simp[Acc.add,j,e],by simp[Acc.add,j,addLimbs64_size,f],by simp[Acc.add,j],by simp[Acc.add,j],?_⟩ simp only[Acc.add,j,ؠ,ת,addLimbs64_eq _ _ _ g,Acc.total];rw[addLimbs_val _ _ _ א];push_cast;ring lemma Acc.total_empty:Acc.empty.total=0:=ד section open FloatLib.Numerics lemma ZbF (s:ه) (m:ٽ) (e:پ) (j:ٽ) (h:j+25<=m۩):Model.roundDyadic κ ⟨s,shiftRightJam m j,e+j⟩=Model.roundDyadic κ ⟨s,m,e⟩:=by have d:m≠0:=by rintro rfl;simp at h have f:2^m۩<=m:=ϲ d;have b:2^(j+1)<=m:=le_trans (Η ב א) f have g:(shiftRightJam m j)۩=m۩-j:=log2_shiftRightJam m j b;have q:shiftRightJam m j≠0:=shiftRightJam_ne_zero m j (le_trans (Η ב א) b) rw[<- Ἤ,<- Ἤ];unfold Model.roundDyadicGeneral;simp only[beq_iff_eq,ؠ,g];have r:((m۩-j:ٽ):پ)+(e+j)=(m۩:پ)+e:=א have k:κ؉=23:=rfl;have l:غ = -149:=rfl;have n:Fmt.minNormalExponent = -126:=rfl;rw[k,l,n];split_ifs with t u v w<;>try omega . rfl . congr 1;obtain⟨a,o⟩:∃ a:ٽ,e - -149=ἃ a:=⟨(-(e+149)-1)٪,by omega⟩ have p:e+j - -149=ἃ (a-j):=א rw[o,p];dsimp only;rw[show a-j+1=(a+1)-j by omega] exact roundShiftRightEven_shiftRightJam m j (a+1) א . congr 1;rw[show m۩-j-23=(m۩-23)-j by omega];exact roundShiftRightEven_shiftRightJam m j _ א def Yg (a:ل ٽ) (i:ٽ):ٽ -> ٽ | 0=>0 | k+1=>a[i]! + 2^32*Yg a (i+1) k lemma Zv (a:ل ٽ) (i k m:ٽ):Yg a i (k+m)=Yg a i k+2^(32*k)*Yg a (i+k) m:=by induction k generalizing i with | zero=>simp[Yg] | succ k b=>rw[show k+1+m=(k+m)+1 by omega,Yg,Yg,b,show i+1+k=i+(k+1) by omega];ring lemma ZbG (a b:ل ٽ) (i j k:ٽ) (h:∀ t,t a[i+t]! = b[j+t]!):Yg a i k=Yg b j k:=by induction k generalizing i j with | zero=>rfl | succ k d=>rw[Yg,Yg,d (i+1) (j+1) (λ t e=>by rw[show i+1+t=i+(t+1) by omega,show j+1+t=j+(t+1) by omega];exact h (t+1) א),show a[i]! = b[j]! from by simpa using h 0 א] lemma Zw (a:ل ٽ) (i k:ٽ):Yg a i k=0↔∀ t,t a[i+t]! = 0:=by induction k generalizing i with | zero=>simp[Yg] | succ k d => rw[Yg,Nat.add_eq_zero_iff,Nat.mul_eq_zero,d (i+1)];have e:(2:ℕ)^32≠0:=ג constructor . rintro ⟨f,b | b⟩ t g . exact absurd b e . rcases t with _ | t . simpa using f . rw[show i+(t+1)=i+1+t by omega];exact b t א . intro h;refine⟨by simpa using h 0 א,Or.inr λ t g=>?_⟩ rw[show i+1+t=i+(t+1) by omega];exact h (t+1) א lemma ZbH (a:ل ٽ) (i k:ٽ) (h:∀ t,t a[i+t]! < 2^32):Yg a i k<2^(32*k):=by induction k generalizing i with | zero=>simp[Yg] | succ k b => have d:=h 0 א;have e:=b (i+1) (λ t f=>by rw[show i+1+t=i+(t+1) by omega];exact h (t+1) א) simp at d;rw[Yg,show 32*(k+1)=32+32*k by ring,pow_add];linarith lemma M0 (a:ل ٽ) (t:ٽ) (h:a܆<=t):a[t]! = 0:=ט lemma ZbI (a:ل ٽ) (i k:ٽ) (h:a܆<=i+k):Yg a i k=Ϗ (a֍.drop i):=by induction k generalizing i with | zero=>simp[Yg,List.drop_of_length_le (by simpa using h:a.toList.length<=i),limbVal] | succ k b => rw[Yg,b (i+1) א];by_cases d:i a[t]! = 0) (e:∀ t,b+n<=t -> a[t]! = 0) : Ϗ a֍=2^(32*b)*Yg a b n:=by rw[<- List.drop_zero (l:=a֍),<- ZbI a 0 (b+(n+a܆)) א,Zv,Zv] rw[(Zw a 0 b).2 (λ t f=>by simpa using d t f),(Zw a (0+b+n) a܆).2 (λ t _=>e _ א)] simp def YP (a b:ل ٽ) (i ca cb br:ٽ) (out:ل ٽ) : ٽ -> ل ٽ × ٽ × ٽ × ٽ | 0=>(out,ca,cb,br) | k+1 => let ta:=a[i]! + ca let tb:=b[i]! + cb let t:=ta%4294967296+4294967296-tb%4294967296-br YP a b (i+1) (ta/4294967296) (tb/4294967296) (1-t/4294967296) (out.push (t%4294967296)) k lemma L9 (a b:ل ٽ) (i f g e:ٽ) (d:ل ٽ) (k:ٽ) (j:e<=1) (h:∀ t,t d[t]! < 2^32) : let r:=YP a b i f g e d k r.1چ=d܆+k/\(∀ t,t r.1[t]! < 2^32) /\ (Yg r.1 0 r.1چ:پ)+2^(32*(d܆+k))*(r.2.1-r.2.2.1-r.2.2.2:پ)=Yg d 0 d܆+2^(32*d܆)*((Yg a i k:پ)-Yg b i k+f-g-e):=by induction k generalizing i f g e d with | zero=>exact⟨by simp[YP],by simpa [YP] using h,by simp[YP,Yg]⟩ | succ k q => simp only[YP];set n:=a[i]! + f;set o:=b[i]! + g;set t:=n%4294967296+4294967296-o%4294967296-e;have u:t%4294967296<2^32:=א have v:∀ s,s < (d.push (t%4294967296))܆ -> (d.push (t%4294967296))[s]! < 2^32:=by intro s l;simp only[Array.size_push]at l;rcases Ἕ (Ἔ.mp l) with l | rfl . rw[ذ _ s ו,Array.getElem_push_lt l,<- ذ d s l];exact h s l . rw[ذ _ _ ג,Array.getElem_push_eq];exact u obtain⟨w,x,p⟩:=q (i+1) (n/4294967296) (o/4294967296) (1-t/4294967296) (d.push (t%4294967296)) א v refine⟨by simp[w];omega,x,?_⟩;have y:Yg (d.push (t%4294967296)) 0 (d܆+1)=Yg d 0 d܆+2^(32*d܆)*(t%4294967296):=by rw[Zv,ZbG _ d 0 0 d܆ (λ s l=>by rw[ذ _ _ ו,Array.getElem_push_lt א,<- ذ d _ א])] simp only[Yg,Λ,Ϝ,Ἇ];rw[ذ _ _ ג,Array.getElem_push_eq] simp only[Array.size_push]at p ⊢;rw[show d܆+(k+1)=d܆+1+k by omega];rw[p,y,Yg,Yg];have z:((t%4294967296:ٽ):پ)+4294967296*((n/4294967296:ٽ)-(o/4294967296:ٽ)-(1-t/4294967296:ٽ))=(a[i]! : پ)-b[i]! + f-g-e:=א simp only[Nat.cast_add,Nat.cast_mul,Nat.cast_pow,Ἣ];linear_combination (2:پ)^(32*d܆)*z def YW (r:ل ٽ):ٽ -> Option ٽ | 0=>none | k+1=>if r[k]! != 0 then some k else YW r k def YX (r:ل ٽ):ٽ -> ه | 0=>false | k+1=>r[k]! != 0||YX r k lemma ZbK (r:ل ٽ) (k:ٽ) (h:YW r k=none):∀ t,t r[t]! = 0:=by induction k with | zero=>intro t a;omega | succ k b => simp only[YW]at h;split at h . cases h . rename_i d;intro t a;rcases Ἕ (Ἔ.mp a) with a | rfl . exact b h t a . simpa using d lemma L8 (r:ل ٽ) (k h:ٽ) (d:YW r k=some h):h t r[t]! = 0:=by induction k with | zero=>simp[YW]at d | succ k j => simp only[YW]at d;split at d . rename_i f;cases d;exact⟨by omega,by simpa using f,λ t g e=>by omega⟩ . rename_i f;obtain⟨a,b,c⟩:=j d;refine⟨by omega,b,λ t g e=>?_⟩;rcases Ἕ (Ἔ.mp e) with e | rfl . exact c t g e . simpa using f lemma L7 (r:ل ٽ) (k:ٽ):YX r k=false↔∀ t,t r[t]! = 0:=by induction k with | zero=>simp[YX] | succ k b => simp only[YX,Bool.or_eq_false_iff,bne_eq_false_iff_eq,b];constructor . rintro ⟨d,e⟩ t a;rcases Ἕ (Ἔ.mp a) with a | rfl . exact e t a . exact d . intro h;exact⟨h k א,λ t a=>h t א⟩ lemma ZbL (r:ل ٽ) (k:ٽ):YX r k=(Yg r 0 k != 0):=by have a:=Zw r 0 k;simp at a;cases h:YX r k . rw[a.2 ((L7 r k).1 h)];rfl . have:Yg r 0 k≠0:=λ b=>by have:=(L7 r k).2 (a.1 b);simp_all simp[this] lemma ZbM (a x y h:ٽ) (b:a<2^(32*h)):shiftRightJam (a+2^(32*h)*(x+2^32*y)) (32*h+2)=if x%4 != 0||a != 0 then (y*1073741824+x/4)|||1 else y*1073741824+x/4:=by have k:2^(32*h+2)=4*2^(32*h):=ז have q:x%4<4:=Χ x ב have f:a+2^(32*h)*(x%4)<4*2^(32*h):=by nlinarith have l:a+2^(32*h)*(x+2^32*y)=(a+2^(32*h)*(x%4))+4*2^(32*h)*(y*1073741824+x/4):=by have n:=Nat.mod_add_div x 4;conv_lhs=>rw[<- n] ring have g:a+2^(32*h)*(x%4)=0↔¬(x%4≠0\/a≠0):=by constructor . intro d;have o:=Nat.eq_zero_of_add_eq_zero d;rcases ϸ.mp o.2 with p | p<;>omega . intro d;simp at d;simp[d.1,d.2] unfold shiftRightJam;dsimp only;rw[k,l,Nat.add_mul_div_left _ _ א,ϑ f,Λ,Nat.add_mul_mod_self_left,ν f] by_cases j:x%4≠0\/a≠0 . have:¬ (a+2^(32*h)*(x%4)=0):=λ d=>g.mp d j;have e:(x%4 != 0||a != 0)=true:=ז simp only[beq_iff_eq,this,ؠ,e,ת] . have:a+2^(32*h)*(x%4)=0:=g.mpr j;have e:(x%4 != 0||a != 0)=false:=ז simp only[beq_iff_eq,this,ת,e];rfl def Yas (neg:ه) (r:ل ٽ) (e:پ) (negZero:ه):ك := match YW r rچ with | none=>ρ 0 e negZero | some 0=>ρ (if neg then -(r[0]! : پ) else r[0]!) e negZero | some (h+1) => let x:=r[h]! let v:=r[h+1]! * 1073741824+x/4 let m:=if x%4 != 0||YX r h then v|||1 else v π (Model.roundDyadic κ ⟨neg,m,e+((32*h+2:ٽ):پ)⟩) lemma ZbN (b:ه) (R:ٽ) (e:پ) (a:ه) (d:R≠0):ρ (if b then -(R:پ) else R) e a=π (Model.roundDyadic κ ⟨b,R,e⟩):=by have f:(0:پ)simp[finishWord,ofIntDyadic,d,not_lt.mpr f.le,ϒ d] lemma L6 (b:ه) (r:ل ٽ) (e:پ) (a:ه) (d:∀ t,t r[t]! < 2^32) : Yas b r e a=ρ (if b then -(Yg r 0 r܆:پ) else Yg r 0 r܆) e a:=by unfold Yas;split . rename_i o;rw[(Zw r 0 r܆).2 (λ t f=>by simpa using ZbK r _ o t f)];simp . rename_i g;obtain⟨p,j,k⟩:=L8 r _ 0 g;rw[show r܆=1+(r܆-1) by omega,Zv,(Zw r (0+1) (r܆-1)).2 (λ t f=>k _ א א)] simp[Yg] . rename_i h g;obtain⟨p,j,k⟩:=L8 r _ (h+1) g;have l:Yg r 0 r܆=Yg r 0 h+2^(32*h)*(r[h]! + 2^32*r[h+1]!):=by rw[show r܆=h+(2+(r܆-h-2)) by omega,Zv,Zv,(Zw r (0+h+2) _).2 (λ t f=>k _ א א)] simp[Yg] have q:Yg r 0 h<2^(32*h):=ZbH r 0 h (λ t f=>d _ א);have n:Yg r 0 r܆≠0:=by rw[l];have:0<2^(32*h)*(r[h]! + 2^32*r[h+1]!):=by have:=ϒ j;positivity omega have s:32*h+2+25<=(Yg r 0 r܆)۩:=by rw[Nat.le_log2 n,l];have:1<=r[h+1]! := ϒ j;calc 2^(32*h+2+25)<=2^(32*h)*2^32:=by rw[<- pow_add];exact Η ב א _<=2^(32*h)*(r[h]! + 2^32*r[h+1]!):=by gcongr;linarith _<=_:=א rw[ZbN b _ e a n,<- ZbF b _ e _ s,l,ZbM _ _ _ h q,ZbL] def Yab (pos neg:ل ٽ):ٽ -> ٽ | 0=>0 | k+1=>if pos[k]! != 0||neg[k]! != 0 then k+1 else Yab pos neg k lemma ZbO (a b:ل ٽ) (k:ٽ):∀ t,Yab a b k<=t -> t a[t]! = 0/\b[t]! = 0:=by induction k with | zero=>intro t _ h;omega | succ k f => intro t d e;simp only[Yab]at d;split at d . omega . rename_i g;rcases Ἕ (Ἔ.mp e) with e | rfl . exact f t d e . simpa [ἀ,bne_iff_ne,not_or] using g def YaL (pos neg:ل ٽ) (e:پ) (negZero:ه):ك := let lo:=lowLimb pos neg posچ 0 let n:=Yab pos neg (max posچ negچ)+1-lo let e':=e+((32*lo:ٽ):پ) let d:=YP pos neg lo 0 0 0 (Array.emptyWithCapacity n) n if d.2.1=0/\d.2.2.1=0/\d.2.2.2=0 then Yas false d.1 e' negZero else let d':=YP neg pos lo 0 0 0 (Array.emptyWithCapacity n) n if d'.2.1=0/\d'.2.2.1=0/\d'.2.2.2=0 then Yas true d'.1 e' negZero else finishLimbs pos neg e negZero lemma O2 (b d:ل ٽ) (e:پ) (f:ه):YaL b d e f=ρ ((Ϗ b֍:پ)-Ϗ d֍) e f:=by unfold YaL;dsimp only;set g:=lowLimb b d b܆ 0;set n:=Yab b d (max b܆ d܆)+1-g;have o:=lowLimb_zero b d b܆ 0;have p:=ZbO b d (max b܆ d܆);have q (a:ل ٽ) (h:a=b\/a=d):Ϗ a֍=2^(32*g)*Yg a g n:=by apply ZbJ a g n . intro t j;rcases h with rfl | rfl . exact(o t א j).1 . exact(o t א j).2 . intro t j;by_cases r:t < max b܆ d܆ . rcases h with rfl | rfl . exact(p t א r).1 . exact(p t א r).2 . rcases h with rfl | rfl<;>exact M0 _ t א have s:=q b (Ω rfl);have u:=q d (Or.inr rfl);rw[show(Array.emptyWithCapacity n:ل Nat)=#[] from rfl];have v:=L9 b d g 0 0 0 #[] n א ג;have w:=L9 d b g 0 0 0 #[] n א ג;have z:Yg (#[]:ل ٽ) 0 0=0:=rfl;simp only[List.size_toArray,List.length_nil,Ϝ,pow_zero,one_mul,z,Nat.cast_zero,zero_add]at v w obtain⟨-,A,x⟩:=v;obtain⟨-,B,y⟩:=w;split_ifs with k l . rw[L6 false _ _ _ A,ἄ,s,u];simp;congr 1;rw[k.1,k.2.1,k.2.2]at x;linear_combination (2:پ)^(32*g)*x . rw[L6 true _ _ _ B,ἄ,s,u];simp;congr 1;rw[l.1,l.2.1,l.2.2]at y;linear_combination (-(2:پ)^(32*g))*y . exact finishLimbs_eq b d e f end @[inline] def Yy (acc:Acc) (wa wb:ك):Acc := if θ wa=255\/θ wb=255 then acc.markSpecial else acc.add (ε wa*ε wb) (γ wa+γ wb) (Γ (η wa) (η wb)) @[specialize] def Yw (fa fb:ٽ -> ك) (pos neg:ل ٽ) (sp nz:ه) (index:ٽ):ٽ -> Acc | 0=>⟨pos,neg,sp,nz⟩ | count+1 => match Yy ⟨pos,neg,sp,nz⟩ (fa index) (fb index) with | ⟨p,n,s,z⟩=>Yw fa fb p n s z (index+1) count @[inline] def Yn (n:ٽ) (fa fb:ٽ -> ك):ك := let acc:=Yw fa fb (Υ 18 0) (Υ 18 0) false true 0 n if acc.special then dotSpec (ډ n λ i=>fa i) (ډ n λ i=>fb i) else YaL acc.pos acc.neg (-298) (n≠0&&acc.negZero) lemma Zn (a b:ك):(if Γ (η a) (η b) then -((ε a*ε b:ٽ):پ) else ((ε a*ε b:ٽ):پ))=sv a*sv b:=by unfold sv;cases η a<;>cases η b<;>simp lemma ZbP (g h:ٽ -> ك) (d e:ل ٽ) (f:ه) (a b:ٽ):(Yw g h d e true f a b).special=true:=by induction b generalizing d e f a with | zero=>rfl | succ b k => rw[Yw];have j:(Yy ⟨d,e,true,f⟩ (g a) (h a)).special=true:=by unfold Yy Acc.markSpecial Acc.add;split_ifs<;>rfl generalize Yy ⟨d,e,true,f⟩ (g a) (h a)=r at j ⊢;obtain⟨p,q,s,z⟩:=r;subst j;exact k .. lemma O1 (e f:ٽ -> ك) (A B:ل ك) (n:ٽ) (j:∀ k,k A[k]! = e k) (l:∀ k,k B[k]! = f k) (d:Acc) (a b:ٽ) (h:a+b<=n) (o:d.posچ=18) (t:d.negچ=18) (g:(Yw e f d.pos d.neg d.special d.negZero a b).special =false) : d.special=false /\ (∀ k,a<=k -> k < a+b -> θ A[k]! ≠ 255/\θ B[k]! ≠ 255) /\ (Yw e f d.pos d.neg d.special d.negZero a b).total=d.total+dsum A B a b /\ (Yw e f d.pos d.neg d.special d.negZero a b).negZero=(d.negZero&&dallNZ A B a b):=by induction b generalizing d a with | zero=>obtain⟨p,n,s,z⟩:=d;simp_all[Yw,dsum,dallNZ] | succ count D => obtain⟨p,q,s,z⟩:=d;have v:=j a א;have w:=l a א;by_cases x:θ (e a)=255\/θ (f a)=255 . exfalso;rw[Yw]at g;have u:(Yy ⟨p,q,s,z⟩ (e a) (f a)).special=true:=by simp[Yy,x,Acc.markSpecial] generalize Yy ⟨p,q,s,z⟩ (e a) (f a)=r at u g;obtain⟨N,O,P,Q⟩:=r;subst u;rw[ZbP]at g;exact Bool.noConfusion g . have y:=not_or.mp x obtain⟨E,F,G,H,I⟩:=Acc.add_spec ⟨p,q,s,z⟩ (ε (e a)*ε (f a)) (γ (e a)+γ (f a)) (Γ (η (e a)) (η (f a))) o t (mul_mant_lt _ _) (by have:=idxOf_le _ y.1;have:=idxOf_le _ y.2;omega) have J:Yy ⟨p,q,s,z⟩ (e a) (f a)=Acc.add ⟨p,q,s,z⟩ (ε (e a)*ε (f a)) (γ (e a)+γ (f a)) (Γ (η (e a)) (η (f a))):=by simp[Yy,x] rw[Yw,J]at g ⊢;obtain⟨u,K,L,M⟩:=D _ (a+1) א E F g;refine⟨by rw[<- G,u],?_,?_,?_⟩ . intro k R S;rcases Nat.lt_or_ge k (a+1) with C | C . have:k=a:=א subst this;rw[v,w];exact y . exact K k C א . rw[L,I,dsum,v,w,Zn];ring . rw[M,H,dallNZ,v,w];simp[Bool.and_assoc] lemma Ze (n:ٽ) (f:ٽ -> ك) (k:ٽ) (a:kf i܁)[k]! = f k:=ט lemma Z5 (n:ٽ) (a b:ٽ -> ك):Yn n a b=dotSpec (ډ n λ i=>a i) (ډ n λ i=>b i):=by unfold Yn;set A:=ډ n λ i=>a i with C;set B:=ډ n λ i=>b i with D;set d:=Yw a b (Υ 18 0) (Υ 18 0) false true 0 n with O;by_cases E:d.special=true . simp[E] . have v:d.special=false:=ז obtain⟨-,g,l,o⟩:=O1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א (by simp[Acc.empty]) (by simp[Acc.empty]) v have l:d.total=dsum A B 0 n:=by have:=l;simp only[Acc.total_empty,Int.zero_add]at this;exact this have o:d.negZero=dallNZ A B 0 n:=by have:=o;exact this simp only[v,χ,ؠ];rw[O2,show((limbVal d.pos.toList:Int)-limbVal d.neg.toList)=d.total from rfl] have w:Aچ=n:=by simp[C] have x:Bچ=n:=by simp[D] set L:=A.map (Model.ofUInt32 (fmt:=κ)) with f set R:=B.map (Model.ofUInt32 (fmt:=κ)) with F have e:Lچ=Rچ:=ז have y:Lچ=n:=ז have p:∀ k (q:ka[i܁]!)=a:=by subst h;apply Array.ext ג;intro i d b;rw[Ἃ,ذ a i b] lemma ZbQ (n:ٽ) (c:ك):(ډ n λ _=>c)=Υ n c:=by apply Array.ext ג;simp def YaM (a b:ل ك):ك := if aچ=bچ then Yn aچ (λ i=>a[i]!) (λ i=>b[i]!) else dotSpec a b def YaN (x:ل ك):ك:=Yn xچ (λ i=>x[i]!) (λ _=>ζ) lemma ZbR (a b:ل ك):YaM a b=dotSpec a b:=by unfold YaM;split . rename_i h;rw[Z5,Z6 a _ rfl,Z6 b _ h] . rfl lemma ZbS (x:ل ك):YaN x=sumSpec x:=by rw[YaN,Z5,Z6 x _ rfl,ZbQ,sumSpec] lemma Zi:Yn=Β:=funext λ n=>funext λ a=>funext λ b=>Z5 n a b lemma O0 (w:δ):π (ι w)=w:=by apply Ν.mp;simp only[toWord,ofW,Model.toNatBits,ofUInt32_bits];exact ν w.toBitVec.isLt lemma N9 (z:Model κ):ι (π z)=z:=by have h:z.toNatBits<2^32:=Model.toNatBits_lt_two_pow z;simp only[ofW,toWord,Model.ofUInt32,Ἓ,ν h];exact Model.ofNatBits_toNatBits z @[inline] def Yz (w:δ):پ := if η w then -((ε w<<<γ w:ٽ):پ) else ((ε w<<<γ w:ٽ):پ) lemma ZbT (w:δ):Yz w=sv w*2^γ w:=by unfold Yz sv;split<;>simp[υ] lemma Zx (w:δ):(Ο w).toReal=(Yz w:ℝ)*2^(-149:پ):=by rw[<- FloatLib.Numerics.Dyadic.cast_toRat,ϕ,ZbT];push_cast;rw[zpow_sub₀ two_ne_zero,ا];ring lemma ZH (w:ك):(θ w)؟=w؟/2^23%256:=by simp only[expOf,ἣ,϶,ω];exact Ϙ _ 8 lemma ZR (w:ك):(fracOf w)؟=w؟%2^23:=by exact Ϙ _ 23 @[inline] def Yac (w:δ):پ:=let m:پ:=(wڇ%2147483648:ٽ);if η w then -m else m def mg (n:ٽ):ٽ:=if n/2^23%256=0 then n%2^23 else (2^23+n%2^23)*2^(n/2^23%256-1) lemma I0 (w:δ):ε w<<<γ w=mg w؟:=by unfold mantOf idxOf mg;simp only[<- UInt32.toNat_inj,UInt32.toNat_zero,ZH,ZR,υ];split<;>simp lemma ZS (a b:ٽ) (h:a%2^31nlinarith [Nat.one_le_two_pow (n:=A-1)] lemma ZbU (a b:δ):compare (Yac a) (Yac b)=compare (Yz a) (Yz b):=by have e:∀ a b:ٽ,a%2^31=b%2^31 -> mg a=mg b:=λ a b h=>by unfold mg;rw[show a/2^23%256=b/2^23%256 by omega,show a%2^23=b%2^23 by omega] have:=ZS a؟ b؟;have:=ZS b؟ a؟;have:=e a؟ b؟;have:=ZS 0 b؟;have:=e b؟ 0;have:mg 0=0:=rfl;unfold Yac Yz;rw[I0,I0];simp only[compare,compareOfLessAndEq,Nat.reducePow]at *;generalize a؟%2147483648=A at *;generalize b؟%2147483648=B at *;split_ifs<;>first|rfl|omega lemma ZbV (a:δ) (b:θ a≠255):ι a=(if Model.isZero (ι a)&&Model.isZero (ι a) then Model.zero κ (Model.signBit (ι a)&&Model.signBit (ι a)) else ι a):=by simp only[Bool.and_self];split . rename_i d;obtain⟨e,f⟩:=(Model.isZero_iff_fields_of_isFinite (by simp[ofW,ἐ,b])).1 d conv_lhs=>rw[<- Model.ofFields_signBit_expField_fracField (ofW a),e,f] cases Model.signBit (ι a)<;>decide . rfl @[inline] def YQ (a b:δ):δ := if θ a=255\/θ b=255 then π (Model.maximum (ι a) (ι b)) else match compare (Yac a) (Yac b) with | .lt=>b | .gt=>a | .eq=>if a=b then a else π (if Model.isZero (ι a)&&Model.isZero (ι b) then Model.zero κ (Model.signBit (ι a)&&Model.signBit (ι b)) else ι a) lemma ZbW (a b:δ):Model.cmpDyadic (Ο a) (Ο b)=compare (Yz a) (Yz b):=by have d:(0:ℝ)<2^(-149:پ):=zpow_pos two_pos _;cases h:compare (Yz a) (Yz b) . rw[Model.cmpDyadic_lt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_lt_iff_lt.mp h) d . rw[Model.cmpDyadic_eq_iff,Zx,Zx,compare_eq_iff_eq.mp h] . rw[Model.cmpDyadic_gt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_gt_iff_gt.mp h) d lemma ZbX (a b:δ):ι (YQ a b)=Model.maximum (ι a) (ι b):=by unfold YQ;split . exact N9 _ . rename_i d;rw[ZbU];have e:=Ϟ a (λ h=>d (Ω h));have f:=Ϟ b (λ h=>d (Or.inr h));have j:=ٿ e;have k:=ٿ f;have g:Model.compare (ι a) (ι b)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e f;rw[ZbW]at g;have l:Model.chooseNaN2 (ι a) (ι b)=none:=(Model.chooseNaN2_eq_none_iff _ _).2 ⟨j,k⟩;unfold Model.maximum;rw[Model.withNaNSelection_of_none _ _ l];rw[Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ g];cases compare (Yz a) (Yz b)<;>simp only[N9,apply_ite ofW];by_cases h:a=b . subst h;rw[if_pos rfl];exact ZbV a (λ h=>d (Ω h)) . rw[if_neg h] def Yad (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=>YQ acc (poolAt h w k inp ch y x t)) (poolAt h w k inp ch y x 0) lemma ZbY (p:ٽ -> δ) (l:List ٽ) (b:δ):l.foldl (λ m t=>Model.maximum m (ι (p t))) (ι b)=ι (l.foldl (λ a t=>YQ a (p t)) b):=by induction l generalizing b with | nil=>rfl | cons t l d=>simp only[ἧ,<- ZbX,d] lemma N8:Yad=maxpoolSpec:=by funext c h w k a;simp only[Yad,maxpoolSpec,ZbY,O0] def kernels0:Kernels where core:=⟨YaN,YaM⟩ dense:=⟨linearWith Yn,gemmWith Yn⟩ conv:=⟨conv2dWith Yn,depthwiseWith Yn⟩ elem:=⟨avgpoolWith Yn,Yad,addReluSpec,scaleShiftSpec⟩ norm:=⟨rmsnormWith Yn,layernormWith Yn⟩ lemma ZbZ:Obligation kernels0:=by simp only[Obligation,kernels0,specKernels,specCore,specDense,specConv,specElem,specNorm,linearSpec,gemmSpec,conv2dSpec,depthwiseSpec,avgpoolSpec,rmsnormSpec,layernormSpec,N8,Zi,funext ZbS,funext λ a=>funext (ZbR a)] def Yo (fa fb:ٽ -> ك) (i:ٽ):ٽ -> پ | 0=>0 | r+1=>sv (fa i)*sv (fb i)*2^(γ (fa i)+γ (fb i))+Yo fa fb (i+1) r def Yq (fa fb:ٽ -> ك) (i:ٽ):ٽ -> ه | 0=>true | r+1=>(decide (ε (fa i)*ε (fb i)=0)&&Γ (η (fa i)) (η (fb i))) && Yq fa fb (i+1) r lemma Zb0 (n:ٽ) (a b:ٽ -> ك) (i r:ٽ) (h:i+r<=n):dsum (ډ n λ k=>a k܁) (ډ n λ k=>b k܁) i r=Yo a b i r:=by induction r generalizing i with | zero=>rfl | succ r d=>rw[dsum,Yo,Ze n a i א,Ze n b i א,d (i+1) א] lemma Zb1 (n:ٽ) (a b:ٽ -> ك) (i r:ٽ) (h:i+r<=n):dallNZ (ډ n λ k=>a k܁) (ډ n λ k=>b k܁) i r=Yq a b i r:=by induction r generalizing i with | zero=>rfl | succ r d=>rw[dallNZ,Yq,Ze n a i א,Ze n b i א,d (i+1) א] lemma Zb2 (f g:ٽ -> ك) (d e:ل ٽ) (j:ه) (a b:ٽ) (l:∀ k,a<=k -> k < a+b -> θ (f k)≠255/\θ (g k)≠255) : (Yw f g d e false j a b).special=false:=by induction b generalizing d e j a with | zero=>rfl | succ count t => rw[Yw];have n:=l a le_rfl א;have o:(Yy ⟨d,e,false,j⟩ (f a) (g a)).special=false:=by have u:¬(θ (f a)=255\/θ (g a)=255):=by rintro (h | h) . exact n.1 h . exact n.2 h unfold Yy;unfold Acc.add;split_ifs<;>rfl generalize Yy ⟨d,e,false,j⟩ (f a) (g a)=r at o ⊢;obtain⟨p,q,s,z⟩:=r;subst o;exact t _ _ _ _ (λ k v w=>l k א א) lemma Zy (n:ٽ) (a b:ٽ -> ك) (d:∀ k,k θ (a k)≠255/\θ (b k)≠255) : Β n a b=ρ (Yo a b 0 n) (-298) (decide (n≠0)&&Yq a b 0 n):=by rw[<- Zi];unfold Yn;set A:=ډ n λ i=>a i܁ with o;set B:=ډ n λ i=>b i܁ with p;set e:=Yw a b (Υ 18 0) (Υ 18 0) false true 0 n with q;have f:e.special=false:=Zb2 a b _ _ true 0 n (λ k _ r=>d k א) obtain⟨-,-,g,h⟩:=O1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א (by simp[Acc.empty]) (by simp[Acc.empty]) f have j:e.total=Yo a b 0 n:=by have:=g;simp only[Acc.total_empty,Int.zero_add]at this;rw[<- Zb0 n a b 0 n א];exact this have l:e.negZero=Yq a b 0 n:=by have:=h;rw[<- Zb1 n a b 0 n א];exact this simp only[f,χ,ؠ];rw[O2,show((limbVal e.pos.toList:Int)-limbVal e.neg.toList)=e.total from rfl,j,l] def YC (w2 w1 w0:ق):پ := ((w2ڇ*2^128+w1ڇ*2^64+w0ڇ:ٽ):پ) - (if w2ڇ<2^63 then 0 else 2^192) def Ym (w:ق):پ:=(wڇ:پ)-(if wڇ<2^63 then 0 else 2^64) lemma Zb3 (s:ه) (E F:ٽ) (b:E<256) (a:F<2^23):(Model.ofFields κ s E F).toNatBits=(if s then 2^31 else 0)+E*2^23+F:=by rw[Model.ofFields_eq_ofFieldsImpl];simp only[Model.ofFieldsImpl,Model.mkBitsImpl,Model.ofBits,Model.toNatBits,BitVec.toNat_ofNatLT];have d:E&&&Fmt.expAllOnesNat=E:=Nat.and_two_pow_sub_one_of_lt_two_pow (n:=8) b;have e:F&&&Fmt.fracMaskNat=F:=Nat.and_two_pow_sub_one_of_lt_two_pow (n:=23) a;rw[d,e,show E.shiftLeft Fmt؉=E<<<23 from rfl,Nat.or_assoc,<- Nat.shiftLeft_add_eq_or_of_lt a] have f:E<<<23+F<2^31:=א cases s . simp[υ] . simp only[ת];rw[show Nat.shiftLeft 1 (Fmt.expWidth+Fmt؉)=1<<<31 from rfl,<- Nat.shiftLeft_add_eq_or_of_lt f];simp;omega @[inline] def Yv (neg:ه) (E F:ك):ك:=(if neg then (0x80000000:ك) else 0)+(E<<<23)+F lemma ZT (a:ه) (E F:ك) (b:E؟<256) (d:F؟<2^23):Yv a E F=π (Model.ofFields κ a E؟ F؟):=by unfold toWord;rw[Zb3 a _ _ b d];apply UInt32.toNat_inj.mp;unfold Yv;cases a<;>simp<;>omega lemma N7 (a:ه):Yv a 255 0=π (Model.nativeOverflow κ a):=by rw[Model.nativeOverflow_eq_signedInf_of_isIEEE Fmt ד];cases a<;>decide lemma Zb4 (a:ه):Yv a 0 0=π (Model.zero κ a):=by cases a<;>decide @[inline] def YH (x r d:ق):ق:=if x>>>(r+d) != 0 then r+d else r @[inline] def Yj (x:ق):ق := YH x (YH x (YH x (YH x (YH x (YH x 0 32) 16) 8) 4) 2) 1 lemma Zz (x r d:ق) (D:ٽ) (a:d˟=D) (f:1<=D) (g:r˟+2*D<=64) (b:2^r˟<=x˟) (e:x˟<2^(r˟+2*D)) : (YH x r d)˟+D<=64/\2^(YH x r d)˟<=x˟ /\ x˟<2^((YH x r d)˟+D):=by subst a;have k:(r+d)˟=r˟+d˟:=by rw[ξ];omega have l:(x>>>(r+d))˟=x˟/2^(r˟+d˟):=by rw[Ζ,k,ν א,ω] unfold YH;by_cases j:x>>>(r+d) != 0 . simp only[j,ת,k];have:x˟/2^(r˟+d˟)≠0:=by intro h;apply(bne_iff_ne.mp j);apply ο.mp;rw[l,h];rfl refine⟨by omega,?_,by rw[show r˟+d˟+d˟=r˟+2*d˟ by omega];exact e⟩;exact(Ἑ (ψ _)).mp (Nat.one_le_iff_ne_zero.mpr this) |>.trans' ג . simp only[j,ؠ,χ];have n:x>>>(r+d)=0:=ז have:x˟/2^(r˟+d˟)=0:=by rw[<- l,n];rfl refine⟨by omega,b,?_⟩ exact(Nat.div_eq_zero_iff_lt (ψ _)).mp this lemma Zj (x:ق) (a:x≠0):(Yj x)˟=x˟۩:=by have b:1<=x˟:=Nat.one_le_iff_ne_zero.mpr λ h=>a (ο.mp (by simpa using h));have d:=x߾;obtain⟨t,e,f⟩:=Zz x 0 32 32 rfl ד ד (by simpa using b) (by simpa using d);obtain⟨u,g,j⟩:=Zz x _ 16 16 rfl ד א e (by simpa using f);obtain⟨v,k,l⟩:=Zz x _ 8 8 rfl ד א g (by simpa using j);obtain⟨w,n,o⟩:=Zz x _ 4 4 rfl ד א k (by simpa using l);obtain⟨y,p,q⟩:=Zz x _ 2 2 rfl ד א n (by simpa using o);obtain⟨z,r,s⟩:=Zz x _ 1 1 rfl ד א p (by simpa using q);exact((Ἅ א).mpr ⟨r,s⟩).symm @[inline] def Ybm (m:ق) (e:پ):ق := match e+149 with | .ofNat k=>m<<FloatLib.Numerics.FixedWord.roundShiftRightEven m (k+1) @[inline] def YaO (neg:ه) (m:ق) (e:پ):ك := let fr:=Ybm m e if fr==0 then Yv neg 0 0 else if (0x800000:ق)<=fr then Yv neg 1 0 else Yv neg 0 fr.toUInt32 lemma Zb5 (a:ه) (m:ق) (e:پ) (b:m˟≠0) (h:(m˟۩:پ)+e < -126) : YaO a m e=π (Model.packRoundedSubnormal κ a (Model.zero κ a) (match e-غ with | Int.ofNat shift=>m˟<<ἵ m˟ (shift+1))):=by have j:m˟<2^(m˟۩+1):=Ἂ;rw[show e-Fmt.minSubnormalExponent=e+149 by rw[show Fmt.minSubnormalExponent = -149 from rfl];omega];unfold YaO Ybm;generalize o:e+149=s;suffices H:∀ (d:ق) (F:ٽ),d˟=F -> F<=2^23 -> (if d==0 then Yv a 0 0 else if (0x800000:ق)<=d then Yv a 1 0 else Yv a 0 d؛)=π (Model.packRoundedSubnormal κ a (Model.zero κ a) F) by cases s with | ofNat k => have l:(k:پ)=e+149:=ז have t:m˟*2^k<2^23:=by calc m˟*2^k<2^(m˟۩+1)*2^k:=ἇ j (ψ k) _=2^(m˟۩+1+k):=by rw[<- Θ] _<=2^23:=Η ב א apply H _ (m˟<< have l:ἃ k=e+149:=by rw[o] apply H _ _ (FloatLib.Numerics.FixedWord.roundShiftRightEven_toNat m (k+1));have u:m˟/2^(k+1)<2^23:=by rw[Ἒ (ψ _)];calc m˟<2^(m˟۩+1):=j _<=2^(23+(k+1)):=Η ב (by rw[Int.negSucc_eq]at l;omega) _=2^23*2^(k+1):=by rw[Θ] have:=FloatLib.Numerics.roundShiftRightEven_le_succ m˟ (k+1);omega intro d F q v;subst q;unfold Model.packRoundedSubnormal;by_cases g:d=0 . subst g;exact Zb4 a have r:(d˟==0)=false:=by simpa using λ h=>g (ο.mp (by simpa using h)) simp only[show(d==0)=false by simpa using g,r,χ,ؠ];by_cases f:d˟>=2^23 . have:(0x800000:ق)<=d:=by rw[Κ];simpa using f simp only[this,ת,show d˟>=Model.pow2 Fmt؉ from f] exact ZT a 1 0 ד ד . have:¬ (0x800000:ق)<=d:=by rw[Κ];simpa using f simp only[this,ؠ,show ¬ d˟>=Model.pow2 Fmt؉ from f] have n:d؛؟=d˟:=by rw[ϧ];omega rw[ZT a 0 _ ד (by rw[n];omega),n];rfl @[inline] def YK (m L:ق):ق := if 23<=L then FloatLib.Numerics.FixedWord.roundShiftRightEven m (L-23).toNat else m<<<(23-L) @[inline] def Yae (neg:ه) (m L:ق) (t:پ):ك := let rm:=YK m L if rm==0x1000000 then (if t+1>127 then Yv neg 255 0 else Yv neg (t+128).toNat.toUInt32 0) else Yv neg (t+127).toNat.toUInt32 (rm.toUInt32-0x800000) lemma Z7 (m:ق) (a:m≠0):(YK m (Yj m))˟=(if κ؉<=m˟۩ then ἵ m˟ (m˟۩-κ؉) else m˟<<<(κ؉-m˟۩)) /\ 2^23<=(YK m (Yj m))˟/\(YK m (Yj m))˟<=2^24:=by have j:m˟≠0:=λ h=>a (ο.mp (by simpa using h));have b:=Zj m a;have f:2^m˟۩<=m˟:=ϲ j;have g:m˟<2^(m˟۩+1):=Ἂ;rw[show Fmt؉=23 from rfl];unfold YK;generalize Yj m=L at b ⊢;generalize n:m˟۩=N at * by_cases h:23<=N . have d:(23:ق)<=L:=by rw[Κ,b];simp;omega have e:(L-23)˟=N-23:=ט simp only[d,ת,h,e,FloatLib.Numerics.FixedWord.roundShiftRightEven_toNat];have o:2^23<=m˟/2^(N-23):=by rw[Ἑ (ψ _),<- Θ,show 23+(N-23)=N by omega] exact f have p:m˟/2^(N-23)<2^24:=by rw[Ἒ (ψ _),<- Θ,show 24+(N-23)=N+1 by omega];exact g have:=FloatLib.Numerics.div_two_pow_le_roundShiftRightEven m˟ (N-23);have:=FloatLib.Numerics.roundShiftRightEven_le_succ m˟ (N-23);refine⟨trivial,by omega,by omega⟩ . have d:¬ (23:ق)<=L:=by rw[Κ,b];simp;omega have e:(23-L)˟=23-N:=by rw[Α _ _ (by rw[Κ,b];simp;omega),b];rfl simp only[d,ؠ,h];have k:2^23<=m˟*2^(23-N):=by calc 2^23=2^N*2^(23-N):=by rw[<- Θ];congr 1;omega _<=m˟*2^(23-N):=Ε _ f have q:m˟*2^(23-N)<2^24:=by calc m˟*2^(23-N)<2^(N+1)*2^(23-N):=ἇ g (ψ _) _=2^24:=by rw[<- Θ];congr 1;omega have l:(m<<<(23-L))˟=m˟*2^(23-N):=by rw[Ρ,e,ν (show 23-N<64 by omega),υ];exact ν א rw[l,υ];exact⟨rfl,k,by omega⟩ lemma C4 (n:ٽ) (h:n<2^32):n.toUInt32؟=n:=by rw[Nat.toUInt32_eq,Ἓ,ν h] lemma Zb6 (a:ه) (m:ق) (e:پ) (b:m≠0) (d:¬ ((m˟۩:پ)+e>127)) (f:¬ ((m˟۩:پ)+e < -126)) : Yae a m (Yj m) ((m˟۩:پ)+e)=π (Model.packRoundedNormal κ a (Model.nativeOverflow κ a) (↑m˟۩+e) (if κ؉<=m˟۩ then ἵ m˟ (m˟۩-κ؉) else m˟<<<(κ؉-m˟۩))):=by obtain⟨q,r,s⟩:=Z7 m b;rw[<- q];unfold Yae Model.packRoundedNormal;generalize YK m (Yj m)=g at r s ⊢;generalize (m˟۩:پ)+e=t at d f ⊢;simp only[Model.pow2_eq_two_pow,show Fmt؉=23 from rfl,show Fmt.maxNormalExponent=127 from rfl,show Fmt.exponentBias=127 from rfl,show Fmt.maxFiniteExpField=254 from rfl,show Fmt.maxFiniteFracField=8388607 from rfl,Nat.reducePow,Nat.reduceAdd,Int.ofNat_eq_natCast,Ἣ] by_cases k:g˟=16777216 . have l:(g==0x1000000)=true:=by rw[beq_iff_eq];apply ο.mp;rw[k];rfl simp only[l,ת,k,BEq.rfl,Nat.reduceSub];by_cases o:t+1>127 . simp only[o,ת];exact N7 a . simp only[o,ؠ];have j:((t+128)٪.toUInt32)؟=(t+1+127)٪:=by rw[C4 (t+128)٪ א];omega have n:((t+1+127)٪>254||((t+1+127)٪==254&&decide (0>8388607)))=false:=ז simp only[n,χ,ؠ];rw[ZT a _ 0 (by rw[j];omega) ד,j];rfl . have l:(g==0x1000000)=false:=by rw[beq_eq_false_iff_ne];intro h;apply k;rw[h];rfl have u:(g˟==16777216)=false:=ז simp only[l,u,χ,ؠ,show ¬ t>127 by omega] have j:=C4 (t+127)٪ א have p:(g؛-0x800000)؟=g˟-8388608:=by rw[UInt32.toNat_sub_of_le _ _ (by rw[Ἐ,ϧ];simp;omega),ϧ];simp;omega have n:((t+127)٪>254||((t+127)٪==254&&decide (g˟-8388608>8388607)))=false:=ז simp only[n,χ,ؠ];rw[ZT a _ _ (by rw[j];omega) (by rw[p];omega),j,p] @[inline] def YA (neg:ه) (m:ق) (e:پ):ك := let L:=Yj m let t:پ:=(Lڇ:پ)+e if t>127 then Yv neg 255 0 else if t < -126 then YaO neg m e else Yae neg m L t lemma ZU (a:ه) (m:ق) (e:پ) (b:m≠0):YA a m e=π (ἒ κ ⟨a,m˟,e⟩):=by have g:m˟≠0:=λ h=>b (ο.mp (by simpa using h));have j:=Zj m b;unfold YA Model.roundDyadicGeneral;simp only[show(m˟==0)=false by simpa using g,χ,ؠ,j,show Fmt.maxNormalExponent=127 from rfl,show Fmt.minNormalExponent = -126 from rfl] by_cases f:(m˟۩:پ)+e>127 . simp only[f,ת];exact N7 a . simp only[f,ؠ];by_cases d:(m˟۩:پ)+e < -126 . simp only[d,ת];exact Zb5 a m e g d . simp only[d,ؠ];exact Zb6 a m e b f d @[noinline] def Ybn (neg:ه) (m:ق) (e:پ):ك:=YA neg m e @[noinline] def Yat (neg:ه) (m:ق) (e:پ) (L c:ق):ك := YA neg m (e+((Lڇ+cڇ:ٽ):پ)) @[inline] def YY (n:ق):ق := let q:=n>>>40 q+(((n&&&0xFFFFFFFFFF)+0x7FFFFFFFFF+(q&&&1))>>>40) lemma Zb7 (n:ق):(YY n)˟=ἵ n˟ 40:=by rw[FloatLib.Numerics.roundShiftRightEven_eq_guard_sticky _ _ ד];have j:=n߾;have b:(n>>>40)˟=n˟/2^40:=by rw[Ζ,ω];rfl have d:(n&&&0xFFFFFFFFFF)˟=n˟%2^40:=by rw[ἢ,show(0xFFFFFFFFFF:ق)˟=2^40-1 from rfl,Ϙ] have e:((n>>>40)&&&1)˟=n˟/2^40%2:=ט have f:n˟/2^(40-1)%2=n˟%2^40/2^39:=by rw[show(2:Nat)^40=2^39*2 by norm_num,Nat.mod_mul_right_div_self] have g:n˟%2^(40-1)=n˟%2^40%2^39:=by rw[show(2:Nat)^40=2^39*2 by norm_num,Nat.mod_mul_right_mod] have k:=Χ n˟ (show 0<2^40 by decide);have l:n˟/2^40<2^24:=by rw[Ἒ ד];exact j unfold YY;simp only[ξ,Ζ,b,d,e,Nat.testBit_eq_decide_div_mod_eq,f,g];clear b d e f g;generalize n˟%2^40=R at *;simp only[UInt64.reduceToNat,Nat.reduceMod,Nat.reducePow,ω]at *;split . rename_i h;simp at h;generalize n˟/1099511627776=Q at *;rw[Nat.mod_eq_of_lt (a:=R+549755813887) א,Nat.mod_eq_of_lt (a:=R+549755813887+Q%2) א,show(R+549755813887+Q%2)/1099511627776=1 by omega];exact ν א . rename_i h;simp at h;generalize n˟/1099511627776=Q at *;rw[Nat.mod_eq_of_lt (a:=R+549755813887) א,Nat.mod_eq_of_lt (a:=R+549755813887+Q%2) א,show(R+549755813887+Q%2)/1099511627776=0 by omega];exact ν א lemma Z8 (a:ه) (E F:ك) (h:E؟*2^23+F؟<2^31):(Yv a E F)؟=(if a then 2^31 else 0)+E؟*2^23+F؟:=by unfold Yv;cases a<;>simp<;>omega @[inline] def YZ (neg:ه) (u n:ق):ك := (if neg then (0x80000000:ك) else 0)+((u<<<23)+YY n).toUInt32 lemma Zb8 (a:ه) (u n:ق) (b:u˟<=253) (d:(YY n)˟<=2^24):(YZ a u n)؟=(if a then 2^31 else 0)+u˟*2^23+(YY n)˟:=by have e:(u<<<23)˟=u˟*2^23:=by rw[Ρ];simp;omega unfold YZ;cases a<;>simp<;>omega lemma N6 (a:ه) (m:ق) (e:پ) (u:ق) (b:m≠0) (d:(u˟:پ)=(m˟۩:پ)+e+126) (f:u˟<=253) : YZ a u (m<<<(63-Yj m))=YA a m e:=by have r:m˟≠0:=λ h=>b (ο.mp (by simpa using h));have k:=Zj m b;obtain⟨s,v,w⟩:=Z7 m b;have B:m˟۩<64:=(Nat.log2_lt r).mpr m߾;have x:m˟<2^(m˟۩+1):=Ἂ;have n:(YY (m<<<(63-Yj m)))˟=(YK m (Yj m))˟:=by rw[Zb7,s];have y:(63-Yj m)˟=63-m˟۩:=by rw[Α _ _ (by rw[Κ,k];simp;omega -splitDisjunctions),k];rfl have z:(m<<<(63-Yj m))˟=m˟*2^(63-m˟۩):=by rw[Ρ,y,ν (show 63-m˟۩<64 by omega),υ];apply ν calc m˟*2^(63-m˟۩)<2^(m˟۩+1)*2^(63-m˟۩):=ἇ x (ψ _) _=2^64:=by rw[<- Θ,show m˟۩+1+(63-m˟۩)=64 by omega] rw[z,show Fmt؉=23 from rfl];split . rw[show(40:Nat)=(m˟۩-23)+(63-m˟۩) by omega,FloatLib.Numerics.roundShiftRightEven_mul_two_pow] . rw[FloatLib.Numerics.roundShiftRightEven_mul_two_pow_of_le _ _ _ א,υ,show 63-m˟۩-40=23-m˟۩ by omega] have A:(YY (m<<<(63-Yj m)))˟<=2^24:=א rw[show YA a m e=Yae a m (Yj m) ((m˟۩:Int)+e) by unfold YA;simp only[k,show ¬ ((m˟۩:Int)+e>127) by omega -splitDisjunctions,show ¬ ((m˟۩:Int)+e < -126) by omega -splitDisjunctions,ؠ]] apply Ν.mp;rw[Zb8 a u _ f A,n];unfold Yae;generalize YK m (Yj m)=g at n v w ⊢;generalize (m˟۩:پ)+e=t at d ⊢;by_cases o:g˟=16777216 . have l:(g==0x1000000)=true:=by rw[beq_iff_eq];apply ο.mp;rw[o];rfl simp only[l,ת];by_cases p:t+1>127 . simp only[p,ת];rw[Z8 a 255 0 ד];simp;omega . simp only[p,ؠ];have j:=C4 (t+128)٪ א rw[Z8 a _ 0 (by rw[j];simp;omega),j];simp;omega . have l:(g==0x1000000)=false:=by rw[beq_eq_false_iff_ne];intro h;apply o;rw[h];rfl simp only[l,χ,ؠ];have j:=C4 (t+127)٪ א have q:(g؛-0x800000)؟=g˟-8388608:=by rw[UInt32.toNat_sub_of_le _ _ (by rw[Ἐ,ϧ];simp;omega -splitDisjunctions),ϧ];simp;omega rw[Z8 a _ _ (by rw[j,q];omega),j,q];omega lemma N5 (a:ه) (n:ق) (E:پ) (u:ق) (b:2^63<=n˟) (e:(u˟:پ)=E+189) (d:u˟<=253) : YZ a u n=YA a n E:=by have f:n˟≠0:=Ἧ.mp (lt_of_lt_of_le (ψ 63) b);have g:n≠0:=λ h=>f (by rw[h];rfl);have j:n˟۩=63:=(Ἅ f).mpr ⟨b,n߾⟩;have k:Yj n=63:=ο.mp (by rw[Zj n g,j];rfl);have:=N6 a n E u g (by rw[j];push_cast;omega) d;rw[k,show n<<<(63-63:ق)=n from ο.mp (by rw[Ρ];simp only[UInt64.reduceSub,Nat.zero_mod,Nat.shiftLeft_zero];exact ν n߾)]at this exact this lemma Zb9 (e:پ) (c:ق) (b:c˟<2^62) (h:(ϵ e).toInt=e) (a:((ϵ e).toUInt64+c)˟<=253) : (((ϵ e).toUInt64+c)˟:پ)=e+c˟:=by have d:=Int64.toInt_lt (ϵ e);have f:=Int64.le_toInt (ϵ e);have g:((ϵ e).toUInt64˟:پ)=e%2^64:=by simp;exact Int.toNat_of_nonneg (Int.emod_nonneg _ ד) rw[ξ]at a ⊢;omega def Y0 (e:پ) (ok:ه) (B:ق):Prop := ∀ c:ق,cڇ<2^62 -> ok=true -> (B+c).toNat<=253 -> ((B+c).toNat:پ)=e+cڇ lemma N4 (e:پ):Y0 e ((ϵ e).toInt==e) (ϵ e).toUInt64:=λ c a b d=>Zb9 e c a (beq_iff_eq.mp b) d @[inline] def Yau (neg:ه) (m:ق) (e:پ) (ok:ه) (b:ق):ك := let L:=Yj m let u:=b+L+126 if ok&&u<=253 then YZ neg u (m<<<(63-L)) else Ybn neg m e lemma N3 (a:ه) (m:ق) (e:پ) (d:ه) (B:ق) (b:m≠0) (f:Y0 e d B):Yau a m e d B=YA a m e:=by have k:m˟≠0:=λ h=>b (ο.mp (by simpa using h));have l:=Zj m b;have q:m˟۩<64:=(Nat.log2_lt k).mpr m߾;unfold Yau Ybn;dsimp only;split . rename_i h;simp at h;obtain⟨n,g⟩:=h;have o:(Yj m+126)˟=m˟۩+126:=by rw[ξ,l];simp;omega rw[UInt64.add_assoc]at g ⊢;have j:(B+(Yj m+126))˟<=253:=by have:=ϐ.mp g;simpa using this have p:=f _ (by rw[o];omega) n j;exact N6 a m e _ b (by rw[p];push_cast;omega) j . rfl @[inline] def YaP (w:ق) (e:پ) (negZero ok:ه) (B:ق):ك := if w=0 then (if negZero then 0x80000000 else 0) else let neg:=w>>>63 != 0 Yau neg (if neg then 0-w else w) e ok B lemma J2 (w:ق) (e:پ) (a b:ه) (B:ق) (d:Y0 e b B):YaP w e a b B=ρ (Ym w) e a:=by unfold YaP finishWord;by_cases f:w=0 . subst f;simp[Ym] . have r:w˟≠0:=λ h=>f (ο.mp (by simpa using h)) have s:=w߾;obtain⟨k,l,n⟩:(w>>>63 != 0)=decide (Ym w<0) /\ (if (w>>>63 != 0)=true then 0-w else w)˟=(Ym w).natAbs/\Ym w≠0:=by by_cases h:w˟<2^63 . have g:Ym w=(w˟:پ):=by unfold Ym;omega have o:(w>>>63 != 0)=false:=by simp;apply ο.mp;simp;omega rw[g,o];simp only[χ,ؠ,Int.natAbs_natCast];refine⟨by simp,trivial,by omega⟩ . have g:Ym w=(w˟:پ)-2^64:=by unfold Ym;simp only[h,ؠ] have p:(w>>>63 != 0)=true:=by simp;intro e;have:=congrArg Ἡ e;simp at this;omega have q:(0-w)˟=2^64-w˟:=by rw[Φ];simp;omega rw[g,p];simp only[ת,q];refine⟨by simp;omega,by omega,by omega⟩ simp only[f,ؠ,n];rw[<- Ἤ];have j:(if (w>>>63 != 0)=true then 0-w else w)≠0:=ז rw[N3 _ _ _ _ _ j d,ZU _ _ _ j,l,k];rfl def YaQ (w:ق) (e:پ) (negZero:ه):ك := YaP w e negZero ((Int64.ofInt e).toInt==e) (Int64.ofInt e).toUInt64 lemma F7 (w:ق) (e:پ) (a:ه):YaQ w e a=ρ (Ym w) e a := J2 w e a _ _ (N4 e) lemma W3 (V s:ٽ) (h:s+25<=V۩):(Ἰ V s)۩=V۩-s:=by have d:V≠0:=by intro e;subst e;simp at h have f:2^V۩<=V:=ϲ d;have g:V<2^(V۩+1):=Ἂ;have a:2^(V۩-s)<=V/2^s:=by rw[Ἑ (ψ _),<- Θ,show V۩-s+s=V۩ by omega];exact f have b:V/2^s<2^(V۩-s+1):=by rw[Ἒ (ψ _),<- Θ,show V۩-s+1+s=V۩+1 by omega];exact g unfold FloatLib.Numerics.shiftRightJam;simp only;split . exact(Ἅ א).mpr ⟨a,b⟩ . rw[FloatLib.Numerics.or_one_eq];split . rename_i _ j;apply(Ἅ א).mpr omega . exact(Ἅ א).mpr ⟨a,b⟩ lemma N2 (b:ه) (V s:ٽ) (e:پ) (h:s+25<=V۩):ἒ κ ⟨b,Ἰ V s,e+s⟩=ἒ κ ⟨b,V,e⟩:=by have d:V≠0:=by intro j;subst j;simp at h have k:2^s<=V:=le_trans (Η ב א) (ϲ d) have l:Ἰ V s≠0:=FloatLib.Numerics.shiftRightJam_ne_zero V s k;have n:=W3 V s h;unfold Model.roundDyadicGeneral;simp only[show(FloatLib.Numerics.shiftRightJam V s==0)=false by simpa using l,show(V==0)=false by simpa using d,χ,ؠ,n] have o:((V۩-s:ٽ):پ)+(e+s)=V۩+e:=א rw[o];split . rfl . split . rename_i _ f;have t:غ = -149:=rfl;have u:(V۩:پ)+e < -126:=lt_of_lt_of_eq f rfl;obtain⟨a,g⟩:∃ a:ٽ,e-غ=ἃ a/\s+2<=a+1:=by refine⟨(-(e+149)-1)٪,?_,by omega⟩;omega have p:e+(s:پ)-غ=ἃ (a-s):=א rw[g.1,p];simp only;rw[show a-s+1=a+1-s by omega,FloatLib.Numerics.roundShiftRightEven_shiftRightJam V s (a+1) g.2] . rename_i _ f;have q:κ؉<=V۩-s:=by rw[show Fmt؉=23 from rfl];omega have r:κ؉<=V۩:=א simp only[q,r,ת];rw[show Fmt؉=23 from rfl,show V۩-s-23=V۩-23-s by omega,FloatLib.Numerics.roundShiftRightEven_shiftRightJam V s (V۩-23) א] lemma Z9 (b a d:ق) (L:ٽ) (f:d˟=L) (j:L<=63) (g:b˟<2^(L+1)):((b<<<(63-d))|||((a>>>d)>>>1))˟=(b˟*2^64+a˟)/2^(L+1) /\ ((a<<<(63-d)) != 0)=decide ((b˟*2^64+a˟)%2^(L+1)≠0):=by have n:(63-d)˟=63-L:=by rw[Α _ _ (by rw[Κ,f];simp;omega),f];rfl have k:(2:ٽ)^64=2^(63-L)*2^(L+1):=by rw[<- Θ];congr 1;omega have q:(b<<<(63-d))˟=b˟*2^(63-L):=by rw[Ρ,n,ν (show 63-L<64 by omega),υ] apply ν;calc b˟*2^(63-L)<2^(L+1)*2^(63-L):=ἇ g (ψ _) _=2^64:=by rw[<- Θ];congr 1;omega have r:((a>>>d)>>>1)˟=a˟/2^(L+1):=by rw[Ζ,Ζ,f,ν (show L<64 by omega)];simp only[UInt64.reduceToNat,Nat.reduceMod,ω,Ϡ,<- Nat.pow_succ] have s:a˟/2^(L+1)<2^(63-L):=by rw[Ἒ (ψ _),<- k];exact a߾ have t:(b˟*2^64+a˟)/2^(L+1)=b˟*2^(63-L)+a˟/2^(L+1):=by rw[k,<- ϡ,ϝ,ϙ _ _ (ψ _),ϝ] have u:(b˟*2^64+a˟)%2^(L+1)=a˟%2^(L+1):=by rw[k,<- ϡ,ϝ,Ϧ] refine⟨?_,?_⟩ . rw[UInt64.toNat_or,q,r,t,<- υ,<- Nat.shiftLeft_add_eq_or_of_lt s] . rw[u];have o:(a<<<(63-d))˟=a˟%2^(L+1)*2^(63-L):=by rw[Ρ,n,ν (show 63-L<64 by omega),υ,k,ό (2^(63-L)),Nat.mul_mod_mul_right] have v:0<2^(63-L):=ψ _;by_cases l:a˟%2^(L+1)=0 . have:a<<<(63-d)=0:=ο.mp (by rw[o,l,ϔ];simp);simp[this,l] . have:a<<<(63-d)≠0:=λ e=>by have p:=congrArg Ἡ e;rw[o,ϔ]at p;rcases ϸ.mp p with h | h . exact l h . exact absurd h (Ἧ.mp v) simp[this,l] @[inline] def Yav (w0:ق):ق := ~~~w0+1 @[inline] def Yaw (w1 w0:ق):ق := ~~~w1+(if w0==0 then 1 else 0) @[inline] def Yax (w2 w1 w0:ق):ق := ~~~w2+(if w1==0&&w0==0 then 1 else 0) lemma W1 (d b a:ق) (h:d˟*2^128+b˟*2^64+a˟≠0):(Yax d b a)˟*2^128+(Yaw b a)˟*2^64+(Yav a)˟=2^192-(d˟*2^128+b˟*2^64+a˟):=by have n:=d߾;have o:=b߾;have p:=a߾;unfold Yax Yaw Yav;by_cases e:a=0 . have f:a˟=0:=ט by_cases l:b=0 . have g:b˟=0:=ז simp only[e,l,Bool.and_self,ת,UInt64.toNat_not]at *;simp at *;omega . have j:(b==0)=false:=ז have g:b˟≠0:=λ h=>l (ο.mp (by rw[h];rfl)) simp only[e,j,beq_self_eq_true,Bool.false_and,χ,ؠ,ת,ξ,UInt64.toNat_not]at *;simp at *;omega . have k:(a==0)=false:=ז have f:a˟≠0:=λ h=>e (ο.mp (by rw[h];rfl)) simp only[k,Bool.and_false,χ,ؠ,ξ,UInt64.toNat_not]at *;simp at *;omega @[inline] def Yaf (neg:ه) (m2 m1 m0:ق) (e:پ):ك := let L:=Yj m2 let x:=(m2<<<(63-L))|||((m1>>>L)>>>1) let st:=(m1<<<(63-L)) != 0||m0 != 0 YA neg (if st then x|||1 else x) (e+((Lڇ+65:ٽ):پ)) @[inline] def Yag (neg:ه) (m1 m0:ق) (e:پ):ك := let L:=Yj m1 let x:=(m1<<<(63-L))|||((m0>>>L)>>>1) let st:=(m0<<<(63-L)) != 0 YA neg (if st then x|||1 else x) (e+((Lڇ+1:ٽ):پ)) @[inline] def Yay (neg:ه) (m2 m1 m0:ق) (e:پ):ك := if m2 != 0 then Yaf neg m2 m1 m0 e else if m1 != 0 then Yag neg m1 m0 e else YA neg m0 e lemma N1 (x:ق) (a:ه) (Q R:ٽ) (b:x˟=Q) (d:a=decide (R≠0)) (e:2<=Q):(if a then x|||1 else x)˟=(if R==0 then Q else Q|||1):=by subst b d;by_cases f:R=0 . simp[f] . simp[f] lemma QF (m:ق) (h:m≠0):m˟۩<=63/\m˟<2^(m˟۩+1)/\2^m˟۩<=m˟:=by have a:m˟≠0:=λ b=>h (ο.mp (by rw[b];rfl)) exact⟨by have:=(Nat.log2_lt a).mpr m߾;omega,Ἂ,ϲ a⟩ lemma QH (m r K:ٽ) (a:2^K<=m):2<=(m*2^64+r)/2^(K+1):=by rw[Ἑ (ψ _)];calc 2*2^(K+1)=2^K*2^2:=by rw[<- Θ,<- Nat.pow_succ'] _<=m*2^64:=Ἢ a (Η ב ב) _<=_:=ϳ _ _ lemma QL (m:ق) (s r:ٽ) (h:m≠0) (a:r<2^s):(m˟*2^s+r)۩=s+m˟۩:=by have b:m˟≠0:=λ d=>h (ο.mp (by rw[d];rfl)) have e:=@Nat.lt_log2_self m˟;apply(Ἅ (Nat.ne_of_gt (ϛ (ύ (ϒ b) (ψ s)) (ϳ _ _)))).mpr;constructor . rw[Θ,ό];exact(Ε _ (ϲ b)).trans (ϳ _ _) . calc m˟*2^s+r < (m˟+1)*2^s:=by rw[Ϣ,ϫ];omega _<=2^(m˟۩+1)*2^s:=Ε _ e _=2^(s+m˟۩+1):=by rw[<- Θ];ring_nf lemma QN (x:ق) (a:ه) (Q R:ٽ) (b:(if a then x|||1 else x)˟=(if R==0 then Q else Q|||1)) (d:2<=Q):(if a then x|||1 else x)≠0:=by intro h;have e:=congrArg Ἡ h;rw[b,ϔ]at e;split at e . omega . rw[FloatLib.Numerics.or_one_eq]at e;split at e<;>omega lemma W0 (b:ه) (a d:ق) (e:پ) (f:a≠0):Yag b a d e=π (ἒ κ ⟨b,a˟*2^64+d˟,e⟩):=by have t:=a߾;have q:=d߾;unfold Yag;have g:=Zj a f;obtain⟨h,j,k⟩:=QF a f;generalize r:a˟۩=K at g h j k;obtain⟨l,n⟩:=Z9 a d (Yj a) K g h j;generalize Yj a=L at g l n ⊢;have o:=QH _ d˟ K k;have p:=N1 _ _ _ _ l n o;rw[ZU _ _ _ (QN _ _ _ _ p o),p,g];have s:=QL a 64 _ f q;rw[r]at s;have:=N2 b (a˟*2^64+d˟) (K+1) e א;unfold FloatLib.Numerics.shiftRightJam at this;rw[this] lemma V9 (f:ه) (a d b:ق) (e:پ) (g:a≠0):Yaf f a d b e=π (ἒ κ ⟨f,a˟*2^128+d˟*2^64+b˟,e⟩):=by have w:=d߾;have x:=b߾;unfold Yaf;have y:a˟≠0:=λ h=>g (ο.mp (by rw[h];rfl));have M:a˟*2^128+d˟*2^64+b˟≠0:=by have z:0 < a˟*2^128:=ύ (ϒ y) (ψ _);rw[Nat.add_assoc];exact Nat.ne_of_gt (ϛ z (ϳ _ _)) have j:=Zj a g;obtain⟨p,q,r⟩:=QF a g;generalize B:a˟۩=K at j p q r;obtain⟨k,n⟩:=Z9 a d (Yj a) K j p q;generalize Yj a=L at j k n ⊢;obtain⟨A,o⟩:∃ A,a˟*2^64+d˟=A:=⟨_,rfl⟩;rw[o]at k n;have C:A=A/2^(K+1)*2^(K+1)+A%2^(K+1):=(Ϻ A _).symm;have D:A%2^(K+1)<2^(K+1):=Χ _ (ψ _);have s:(2:ٽ)^(K+65)=2^(K+1)*2^64:=ז have t:a˟*2^128+d˟*2^64+b˟=(A%2^(K+1)*2^64+b˟)+A/2^(K+1)*2^(K+65):=by have:a˟*2^128+d˟*2^64=A*2^64:=by rw[<- o];ring rw[this,s];conv_lhs=>rw[C] ring have u:A%2^(K+1)*2^64+b˟<2^(K+65):=by rw[s];calc A%2^(K+1)*2^64+b˟h (ο.mp (by rw[I];rfl));simp[h,this] rw[H];by_cases N:A%2^(K+1)=0<;>by_cases O:b˟=0<;>simp have l:=QH _ d˟ K r;rw[o]at l;rw[<- E]at k l;have v:=N1 _ _ _ _ k G l;rw[ZU _ _ _ (QN _ _ _ _ v l),v,j];have J:=QL a 128 (d˟*2^64+b˟) g (by clear * - x w;omega);rw[<- Nat.add_assoc,B]at J have:=N2 f (a˟*2^128+d˟*2^64+b˟) (K+65) e א;unfold FloatLib.Numerics.shiftRightJam at this;rw[this] lemma N0 (a:ه) (d b f:ق) (e:پ) (g:d˟*2^128+b˟*2^64+f˟≠0) : Yay a d b f e=π (ἒ κ ⟨a,d˟*2^128+b˟*2^64+f˟,e⟩):=by unfold Yay;by_cases j:d=0 . subst j;simp only[ؠ,ϔ,Ϫ,Λ]at g ⊢;by_cases k:b=0 . subst k;simp at g ⊢;exact ZU a f e (λ h=>g (by rw[h];rfl)) . simp only[show(b != 0)=true by simpa using k,ת];exact W0 a b f e k . simp only[show(d != 0)=true by simpa using j,ת];exact V9 a d b f e j lemma ZaP (a d b:ق) (L:ٽ) (f:b˟=L) (g:L<=63) (h:a˟<2^(L+1)) (j:2^L<=a˟) (e:ه) : 2^63<=(if e then ((a<<<(63-b))|||((d>>>b)>>>1))|||1 else (a<<<(63-b))|||((d>>>b)>>>1))˟:=by obtain⟨k,-⟩:=Z9 a d b L f g h;have l:2^63<=(a˟*2^64+d˟)/2^(L+1):=by rw[Ἑ (ψ _)];calc 2^63*2^(L+1)=2^L*2^64:=by rw[<- Θ,<- Θ,show 63+(L+1)=L+64 by omega] _<=a˟*2^64:=Ε _ j _<=_:=ϳ _ _ cases e . simp only[χ,ؠ];rw[k];exact l . simp only[ת];rw[UInt64.toNat_or,k,show(1:ق)˟=1 from rfl,FloatLib.Numerics.or_one_eq];split<;>omega @[inline] def YaR (neg:ه) (m1 m0:ق) (e:پ) (ok:ه) (b:ق):ك := let L:=Yj m1 let x:=(m1<<<(63-L))|||((m0>>>L)>>>1) let st:=(m0<<<(63-L)) != 0 let x':=if st then x|||1 else x let u:=b+L+190 if ok&&u<=253 then YZ neg u x' else Yat neg x' e L 1 lemma I3 (a b:ق) (h:a≠0):(Yj a)˟=a˟۩/\a˟۩<=63/\∀ g:ه,2^63<=(if g then ((a<<<(63-Yj a))|||((b>>>Yj a)>>>1))|||1 else (a<<<(63-Yj a))|||((b>>>Yj a)>>>1))˟:=by have d:a˟≠0:=λ e=>h (ο.mp (by rw[e];rfl)) have f:a˟۩<=63:=by have:=(Nat.log2_lt d).mpr a߾;omega exact⟨Zj a h,f,ZaP a b (Yj a) _ (Zj a h) f Ἂ (ϲ d)⟩ lemma V8 (a:ه) (b d:ق) (e:پ) (f:ه) (B:ق) (g:b≠0) (j:Y0 e f B):YaR a b d e f B=Yag a b d e:=by obtain⟨k,p,l⟩:=I3 b d g;generalize b˟۩=K at k p;unfold YaR Yag Yat;dsimp only;generalize Yj b=L at k l ⊢;split . rename_i h;simp at h;obtain⟨q,n⟩:=h;have r:(L+190)˟=K+190:=by rw[ξ,k];simp;omega rw[UInt64.add_assoc]at n ⊢;have o:(B+(L+190))˟<=253:=by have:=ϐ.mp n;simpa using this have s:=j _ (by rw[r];omega) q o;exact N5 a _ _ _ (l _) (by rw[s];push_cast;omega) o . rfl @[inline] def YaS (neg:ه) (m2 m1 m0:ق) (e:پ) (ok:ه) (b:ق):ك := let L:=Yj m2 let x:=(m2<<<(63-L))|||((m1>>>L)>>>1) let st:=(m1<<<(63-L)) != 0||m0 != 0 let x':=if st then x|||1 else x let u:=b+L+254 if ok&&u<=253 then YZ neg u x' else Yat neg x' e L 65 lemma V7 (a:ه) (b d f:ق) (e:پ) (g:ه) (B:ق) (j:b≠0) (k:Y0 e g B):YaS a b d f e g B=Yaf a b d f e:=by obtain⟨l,q,n⟩:=I3 b d j;generalize b˟۩=K at l q;unfold YaS Yaf Yat;dsimp only;generalize Yj b=L at l n ⊢;split . rename_i h;simp at h;obtain⟨r,o⟩:=h;have s:(L+254)˟=K+254:=by rw[ξ,l];simp;omega rw[UInt64.add_assoc]at o ⊢;have p:(B+(L+254))˟<=253:=by have:=ϐ.mp o;simpa using this have t:=k _ (by rw[s];omega) r p;exact N5 a _ _ _ (n _) (by rw[t];push_cast;omega) p . rfl @[inline] def Yaz (neg:ه) (m2 m1 m0:ق) (e:پ) (ok:ه) (b:ق):ك := if m2 != 0 then YaS neg m2 m1 m0 e ok b else if m1 != 0 then YaR neg m1 m0 e ok b else Yau neg m0 e ok b lemma M9 (a:ه) (d b f:ق) (e:پ) (g:ه) (B:ق) (k:d˟*2^128+b˟*2^64+f˟≠0) (j:Y0 e g B) : Yaz a d b f e g B=Yay a d b f e:=by unfold Yaz Yay;by_cases l:d=0 . subst l;by_cases n:b=0 . subst n;exact N3 a f e g B (λ h=>k (by rw[h];rfl)) j . simp only[show(b != 0)=true by simpa using n,ת];exact V8 a b f e g B n j . simp only[show(d != 0)=true by simpa using l,ת];exact V7 a d b f e g B l j @[inline] def YaT (w2 w1 w0:ق) (e:پ) (negZero ok:ه) (B:ق):ك := if w2=0/\w1=0/\w0=0 then (if negZero then 0x80000000 else 0) else if w2>>>63 != 0 then Yaz true (Yax w2 w1 w0) (Yaw w1 w0) (Yav w0) e ok B else Yaz false w2 w1 w0 e ok B lemma J1 (a b d:ق) (e:پ) (f g:ه) (B:ق) (h:Y0 e g B):YaT a b d e f g B=ρ (YC a b d) e f:=by have u:=a߾;have v:=b߾;have w:=d߾;have q:a˟*2^128+b˟*2^64+d˟<2^192:=by have:b˟*2^64+d˟<2^128:=by calc b˟*2^64+d˟>>63 != 0)=false:=by simp;apply ο.mp;simp;omega have p:YC a b d≠0:=א simp only[n,χ,ؠ,p];rw[<- Ἤ,M9 false a b d e _ _ (by rw[j];exact k) h,N0 false a b d e (by rw[j];exact k),j] unfold ofIntDyadic;rw[o,Int.natAbs_natCast,decide_eq_false (Int.not_lt.mpr (Int.natCast_nonneg N))] . have o:YC a b d=(N:پ)-2^192:=by unfold YC;rw[j];simp only[r,ؠ] have H:(a>>>63 != 0)=true:=by simp;intro e;have:=congrArg Ἡ e;simp at this;omega have I:(N:پ)-2^192 = -((2^192-N:ٽ):پ):=א have p:YC a b d≠0:=א have s:=W1 a b d (by rw[j];exact k);rw[j]at s;have t:(Yax a b d)˟*2^128+(Yaw b d)˟*2^64+(Yav d)˟≠0:=א simp only[H,ת,p,ؠ];rw[<- Ἤ,M9 true _ _ _ e _ _ t h,N0 true _ _ _ e t,s];unfold ofIntDyadic;rw[o,I,Int.natAbs_neg,Int.natAbs_natCast,decide_eq_true (Int.neg_neg_of_pos (Int.natCast_pos.mpr (Nat.sub_pos_of_lt q)))] @[inline] def YauT (neg:ه) (m:ق) (e:Unit -> پ) (ok:ه) (b:ق):ك := let L:=Yj m let u:=b+L+126 if ok&&u<=253 then YZ neg u (m<<<(63-L)) else Ybn neg m (e ()) @[inline] def YaRT (neg:ه) (m1 m0:ق) (e:Unit -> پ) (ok:ه) (b:ق):ك := let L:=Yj m1 let x:=(m1<<<(63-L))|||((m0>>>L)>>>1) let st:=(m0<<<(63-L)) != 0 let x':=if st then x|||1 else x let u:=b+L+190 if ok&&u<=253 then YZ neg u x' else Yat neg x' (e ()) L 1 @[inline] def YaST (neg:ه) (m2 m1 m0:ق) (e:Unit -> پ) (ok:ه) (b:ق):ك := let L:=Yj m2 let x:=(m2<<<(63-L))|||((m1>>>L)>>>1) let st:=(m1<<<(63-L)) != 0||m0 != 0 let x':=if st then x|||1 else x let u:=b+L+254 if ok&&u<=253 then YZ neg u x' else Yat neg x' (e ()) L 65 @[inline] def YazT (neg:ه) (m2 m1 m0:ق) (e:Unit -> پ) (ok:ه) (b:ق):ك := if m2 != 0 then YaST neg m2 m1 m0 e ok b else if m1 != 0 then YaRT neg m1 m0 e ok b else YauT neg m0 e ok b @[inline] def YaTT (w2 w1 w0:ق) (e:Unit -> پ) (negZero ok:ه) (B:ق):ك := if w2=0/\w1=0/\w0=0 then (if negZero then 0x80000000 else 0) else if w2>>>63 != 0 then YazT true (Yax w2 w1 w0) (Yaw w1 w0) (Yav w0) e ok B else YazT false w2 w1 w0 e ok B @[inline] def YaPT (w:ق) (e:Unit -> پ) (negZero ok:ه) (B:ق):ك := if w=0 then (if negZero then 0x80000000 else 0) else let neg:=w>>>63 != 0 YauT neg (if neg then 0-w else w) e ok B lemma B5 (a b d:ق) (e:پ) (f g:ه) (B:ق):YaTT a b d (λ _=>e) f g B=YaT a b d e f g B:=rfl lemma B6 (w:ق) (e:پ) (a b:ه) (B:ق):YaPT w (λ _=>e) a b B=YaP w e a b B:=rfl def Ybo (w2 w1 w0:ق) (e:پ) (negZero:ه):ك := YaT w2 w1 w0 e negZero ((Int64.ofInt e).toInt==e) (Int64.ofInt e).toUInt64 lemma V6 (b d f:ق) (e:پ) (a:ه):Ybo b d f e a=ρ (YC b d f) e a := J1 b d f e a _ _ (N4 e) @[inline] def Yf (w:ك):ق := if θ w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 @[inline] def Yd (w:ك):ق := if θ w=0 then 0 else (θ w).toUInt64-1 lemma Zk (w:ك):(Yf w)˟=ε w:=by have:=fracOf_toNat_lt w;unfold Yf mantOf;split_ifs . simp . simp only[ξ];show((fracOf w)؟+8388608)%2^64=2^23+(fracOf w)؟;omega lemma Zf (w:ك):(Yd w)˟=γ w:=by unfold Yd idxOf;split_ifs with h . rfl . have b:1<=(θ w)؟:=by rcases Ϲ (θ w)؟ with a | a . exact absurd (Ν.mp (by simpa using a)) h . exact a rw[Α _ _ (by rw[Κ];simp;omega)];simp lemma Zc (a b:م) (h:a߷+b߷<Ξ):(a+b)߷=a߷+b߷:=by exact ν h lemma A1 (A:ل δ) (a n k:م) (b:a߷+n߷<=Aچ) (d:a߷+n߷<Ξ) (h:k>>1)>>>(63-r))˟=m˟/2^(64-r˟):=by rw[Ζ,Ζ,V5 r a,ω,ω,ν (show 63-r˟<64 by omega),show(1:ق)˟%64=1 from rfl,Ϡ,<- Θ] congr 2;omega lemma M6 (m r:ٽ) (a:r<64):m*2^r%2^64+m/2^(64-r)*2^64=m*2^r:=by have h:m*2^r/2^64=m/2^(64-r):=by rw[show(2:Nat)^64=2^r*2^(64-r) by rw[<- Θ];congr 1;omega,<- Ϡ,Nat.mul_div_cancel _ (ψ r)] rw[<- h];exact Nat.mod_add_div' _ _ lemma V4 (m s:ق) (a:s˟<64):((m>>>1)>>>(63-(s&&&63)))˟*2^64+(m<<<(s&&&63))˟ =m˟*2^s˟:=by have b:(s&&&63)˟=s˟:=by rw[F6];exact ν a rw[M8 _ _ א,M7 _ _ א,b] have Zh:=M6 m˟ s˟ a;omega lemma V3 (m s:ق) (a:64<=s˟) (b:s˟<128):((m>>>1)>>>(63-(s&&&63)))˟*2^128+(m<<<(s&&&63))˟*2^64 =m˟*2^s˟:=by have d:(s&&&63)˟=s˟-64:=by rw[F6];omega rw[M8 _ _ א,M7 _ _ א,d] have Zh:=M6 m˟ (s˟-64) א have e:m˟*2^s˟=m˟*2^(s˟-64)*2^64:=by rw[ϡ,<- Θ];congr 2;omega omega lemma V2 (m s:ق) (a:s˟<128):(if s<64 then (0:ق) else (m>>>1)>>>(63-(s&&&63)))˟*2^128 + (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˟*2^64 + (if s<64 then m<<<(s&&&63) else 0)˟=m˟*2^s˟:=by by_cases h:s<64 . rw[if_pos h,if_pos h,if_pos h,ϔ,Ϫ,Λ];exact V4 m s (UInt64.lt_iff_toNat_lt.mp h) . rw[if_neg h,if_neg h,if_neg h,ϔ,Ἇ];exact V3 m s (by have:=UInt64.lt_iff_toNat_lt.not.mp h;simp at this;omega) a lemma F5 (y a:ق) (h:a˟<=1):(y^^^(0-a))˟=if a˟=1 then 2^64-1-y˟ else y˟:=by rcases ἷ.mp h with b | d . have:a=0:=ο.mp (by simpa using b);subst this;simp . have:a=1:=ο.mp (by simpa using d) subst this;show(y.toBitVec^^^BitVec.allOnes 64).toNat=_;rw[BitVec.xor_allOnes,BitVec.toNat_not];simp lemma ZJ (a b:ق):(a+b)˟=(a˟+b˟)%2^64 /\ (if a+brcases Nat.lt_or_ge j˟ 1 with u | u . rw[show h˟=0 by omega,show j˟=0 by omega];rfl . rw[show h˟=0 by omega,Nat.zero_or];omega . rw[show j˟=0 by omega,Nat.or_zero];omega . omega -splitDisjunctions rw[ξ,ξ,s,r,p,l,o,q,k];omega lemma V0 (d b a c:ق):(d+(if b+(if a+comega lemma I9 (a b d:ق):((a|||b|||d)==0)=decide (d˟*2^128+b˟*2^64+a˟=0):=by have e:a=0↔a˟=0:=by rw[<- ἡ];simp have f:b=0↔b˟=0:=by rw[<- ἡ];simp have g:d=0↔d˟=0:=by rw[<- ἡ];simp rw[ἁ,beq_iff_eq,ث,UInt64.or_eq_zero_iff,UInt64.or_eq_zero_iff,e,f,g];omega lemma C6 (a b:ك):((a^^^b)>>>31)܌˟=if Γ (η a) (η b) then 1 else 0:=by have n:a؟<2^32:=Ἁ a;have o:b؟<2^32:=Ἁ b;have g:η a=decide (a؟/2^31=1):=by unfold signOf;have j:(a؟&&&2^31)%2^31=0:=by rw[Nat.and_mod_two_pow,Nat.mod_self,Nat.and_zero] have k:(a؟&&&2^31)/2^31=a؟/2^31%2:=by rw[Nat.and_div_two_pow,Nat.div_self (ψ 31),Nat.and_one_is_mod] have d:(a&&&߿)؟=a؟&&&2^31:=ג have e:(a&&&߿ != 0)=decide ((a&&&߿)؟≠0):=by rw[ἁ,bne_iff_ne,ث,ne_eq,ne_eq,<- Ἥ];simp rw[e,d,ἁ,ث,ث];omega have l:η b=decide (b؟/2^31=1):=by unfold signOf;have j:(b؟&&&2^31)%2^31=0:=by rw[Nat.and_mod_two_pow,Nat.mod_self,Nat.and_zero] have k:(b؟&&&2^31)/2^31=b؟/2^31%2:=by rw[Nat.and_div_two_pow,Nat.div_self (ψ 31),Nat.and_one_is_mod] have d:(b&&&߿)؟=b؟&&&2^31:=ג have e:(b&&&߿ != 0)=decide ((b&&&߿)؟≠0):=by rw[ἁ,bne_iff_ne,ث,ne_eq,ne_eq,<- Ἥ];simp rw[e,d,ἁ,ث,ث];omega rw[ϯ,϶,UInt32.toNat_xor,show(31:ك)؟%32=31 from rfl,Nat.shiftRight_xor_distrib,ω,ω,g,l] have:a؟/2^31<=1:=א have:b؟/2^31<=1:=א rcases ἷ.mp ‹aڇ/2^31<=1› with h | h<;>rcases ἷ.mp ‹bڇ/2^31<=1› with f | f <;> rw[h,f]<;>decide @[inline] def YL {β:Type} (lo:ق) (a b:ك) (w2 w1 w0 c:ق) (kont:ق -> ق -> ق -> ق -> β):β := let m:=Yf a*Yf b let s:=Yd a+Yd b-lo let rr:=s&&&63 let x0:=m<<>>1)>>>(63-rr) let lowq:=s<64 let y0:=if lowq then x0 else 0 let y1:=if lowq then x1 else x0 let y2:=if lowq then 0 else x1 let ng:=((a^^^b)>>>31).toUInt64 let mk:ق:=0-ng let s0:=w0+(y0^^^mk) let k0:ق:=if s0>>1)>>>(63-(s&&&63)))˟*2^128 + (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˟*2^64 + (if s<64 then m<<<(s&&&63) else 0)˟=0:=by have b:m=0:=ο.mp (by simpa using a);subst b;split_ifs<;>simp<;>rfl lemma Zg (w:ك):γ w<=254:=by have:=expOf_toNat_lt w;unfold idxOf;split_ifs<;>omega lemma ZK (a b:ك):ε a*ε b<2^48:=calc ε a*ε b<2^24*2^24:=Nat.mul_lt_mul'' (ϖ a) (ϖ b) lemma C5 (a b:δ):(Yf a*Yf b)˟=ε a*ε b:=by rw[ϱ,Zk,Zk];exact ν (by have:=ZK a b;omega) lemma D5 (a b:δ):(Yd a+Yd b)˟=γ a+γ b:=by have:=Zg a;have:=Zg b;rw[ξ,Zf,Zf,ν א] lemma I1 (a b:δ):Yf a*Yf b=0↔ε a*ε b=0:=by rw[<- C5,<- ἡ];rfl lemma I4 (w:δ):(Yf w==0)=decide (ε w=0):=by rw[ἁ,beq_iff_eq,ث,<- Zk,<- ἡ];rfl lemma Zr {β:Type} (d:ق) (a b:ك) (f g h c:ق) (e:ق -> ق -> ق -> ق -> β) (k:c˟+1<2^64) (j:ε a*ε b≠0 -> d˟<=γ a+γ b/\γ a+γ b>>31)܌=l at p ⊢ . rw[ξ];have:l˟<=1:=by rw[p];split_ifs<;>omega -splitDisjunctions omega -splitDisjunctions · have n:(if s<64 then (0:ق) else (m>>>1)>>>(63-(s&&&63)))˟*2^128+(if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˟*2^64 + (if s<64 then m<<<(s&&&63) else 0)˟=ε a*ε b*2^(γ a+γ b-d˟):=by by_cases r:ε a*ε b=0 . rw[r,Ϫ];exact U9 m s (by rw[q,r]) . obtain⟨I,J⟩:=j r;have B:s˟=γ a+γ b-d˟:=by rw[<- A,Α _ _ (by rw[Κ,ξ,Zf,Zf];have:=Zg a;have:=Zg b;omega -splitDisjunctions), ξ,Zf,Zf] have:=Zg a;have:=Zg b;rw[ν (by omega -splitDisjunctions)] rw[<- q,<- B];exact V2 m s א generalize (if s<64 then (0:ق) else (m>>>1)>>>(63-(s&&&63)))=t at n ⊢;generalize (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))=u at n ⊢;generalize (if s<64 then m<<<(s&&&63) else 0)=v at n ⊢;have w:l˟<=1:=ז have C:=F5 t l w;have D:=F5 u l w;have E:=F5 v l w;have K:t˟<2^64:=Ϛ t;have L:u˟<2^64:=Ϛ u;have M:v˟<2^64:=Ϛ v;unfold Yx;rw[V1,ξ,Nat.mod_eq_of_lt (a:=c˟+l˟) (by omega -splitDisjunctions),<- Zn] generalize F:ε a*ε b*2^(γ a+γ b-d˟)=P at n;have G:(if Γ (η a) (η b) then -((ε a*ε b:ٽ):پ) else ((ε a*ε b:ٽ):پ))*2^(γ a+γ b-d˟) = if Γ (η a) (η b) then -(P:پ) else (P:پ):=by rw[<- F];split_ifs<;>push_cast<;>ring rw[G];split_ifs at p C D E ⊢ with N O<;>omega @[inline] def YD (w2 w1 w0 c:ق) (e:پ):ق := let t0:=w0+c let k0:ق:=if t0>>23).toNat def YM (a:ك):ٽ:=((a&&&0x7FFFFFFF)>>>23).toNat lemma U8 (a:ك):(a&&&ש)؟=(θ a)؟*2^23+(fracOf a)؟:=by simp only[ἣ,expOf,fracOf,϶];rw[show(ש:ك)؟=2^31-1 from rfl,show(0xFF:ك)؟=2^8-1 from rfl,show(0x7FFFFF:ك)؟=2^23-1 from rfl,show(23:ك)؟%32=23 from rfl,Ϙ,Ϙ,Ϙ,ω] omega lemma Zb (a:ك):YR a<=511/\YM a<=255/\(YM a<255 -> θ a≠255) /\ (ε a≠0 -> YR a<=γ a+1/\γ a+1<=max (YM a) 1):=by have f:=U8 a;have n:=expOf_toNat_lt a;have o:=fracOf_toNat_lt a;have g:YR a=if (a&&&ש)؟=0 then 511 else ((a&&&ש)؟-1)/2^23:=by unfold YR;rw[϶,UInt32.toNat_sub,show(23:ك)؟%32=23 from rfl,ω,show(1:ك)؟=1 from rfl] split_ifs with b<;>omega have j:YM a=(θ a)؟:=by unfold YM;rw[϶,show(23:ك)؟%32=23 from rfl,ω,f] omega have d:θ a=0↔(θ a)؟=0:=by rw[<- Ἥ];simp have k:θ a=255↔(θ a)؟=255:=by rw[<- Ἥ];simp unfold mantOf idxOf;rw[g,j];refine⟨by split_ifs<;>omega,by omega -splitDisjunctions,λ h l=>by rw[k]at l;omega -splitDisjunctions,λ e=>?_⟩;by_cases b:θ a=0 . rw[if_pos b]at e ⊢;rw[d]at b;split_ifs<;>omega . rw[if_neg b]at e ⊢;rw[d]at b;split_ifs<;>omega def Yah (A:ل δ) (base n:م) (hA:baseڇ+nڇ<=Aچ) (hs:baseڇ+nڇ<Ξ) (lo hi:ك) (k:م):ك := if h:k>>23 let kh:=v>>>23 Yah A base n hA hs (if kl t L<=YR A[a߷+t]! /\ YM A[a߷+t]! <= H:=by generalize C:n߷-k߷=d;induction d generalizing k b e with | zero => have p:¬ kby omega⟩ rw[UInt32.toNat_add,UInt32.toNat_shiftLeft,show(16:ك)؟%32=16 from rfl,υ] omega | succ d s => have p:k>>23)؟=YR w:=rfl;have F:((w&&&ש)>>>23)؟=YM w:=rfl;obtain⟨G,I,-,-⟩:=Zb w;obtain⟨L,H,q,r,v,J,K,x⟩:=s (if ((w&&&ש)-1)>>>23>>23 else b) (if e < (w&&&ש)>>>23 then (w&&&ש)>>>23 else e) (k+1) א (by split_ifs<;>omega) (by split_ifs<;>omega) א have M:(if ((w&&&ש)-1)>>>23>>23 else b)؟<=b؟/\(if ((w&&&ש)-1)>>>23>>23 else b)؟<=YR w:=by split_ifs with o . rw[Ἦ]at o;omega . rw[Ἦ]at o;omega have N:e؟<=(if e < (w&&&ש)>>>23 then (w&&&ש)>>>23 else e)؟/\YM w<=(if e < (w&&&ש)>>>23 then (w&&&ש)>>>23 else e)؟:=by split_ifs with o . rw[Ἦ]at o;omega . rw[Ἦ]at o;omega refine⟨L,H,q,r,v,by omega,by omega,λ t O y=>?_⟩;rcases Nat.lt_or_ge t (k߷+1) with z | z . have B:t=k߷:=א subst B;rw[u];omega . exact x t א y def YS (X W:ل δ) (xa wa n:م) (hX:xaڇ+nڇ<=Xچ) (hW:waڇ+nڇ<=Wچ) (hx:xaڇ+nڇ<Ξ) (hw:waڇ+nڇ<Ξ) (lo:ق) (e:پ) (bw:ك) (w2 w1 w0 c:ق) (k:م):ق := if h:kYS X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL lo ζ bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nڇ-kڇ decreasing_by exact ZI n k h def YB (X W:ل δ) (xa wa lo k:ٽ):ٽ -> پ | 0=>0 | r+1=>sv X[xa+k]! * sv W[wa+k]! * 2^(γ X[xa+k]! + γ W[wa+k]! - lo) + YB X W xa wa lo (k+1) r lemma ZL (a b:ك) (d:ٽ) (h:ε a*ε b≠0 -> d<=γ a+γ b/\γ a+γ b<=d+122) : -(2^170:پ)<=sv a*sv b*2^(γ a+γ b-d) /\ sv a*sv b*2^(γ a+γ b-d)<=2^170:=by rw[<- Zn];have g:=ZK a b;by_cases e:ε a*ε b=0 . rw[e];split_ifs<;>simp . obtain⟨j,k⟩:=h e;have f:2^(γ a+γ b-d)<=2^122:=Η ב א;have l:ε a*ε b*2^(γ a+γ b-d)<=2^170:=calc ε a*ε b*2^(γ a+γ b-d)<=2^48*2^122:=Ἢ א f _=2^170:=ב have Zh:((ε a*ε b:ٽ):پ)*2^(γ a+γ b-d)=((ε a*ε b*2^(γ a+γ b-d):ٽ):پ):=by push_cast;ring split_ifs . rw[neg_mul,Zh];omega . rw[Zh];omega lemma ZW (a b:ٽ -> ك):∀ r k,Yo a b k (r+1)=Yo a b k r+sv (a (k+r))*sv (b (k+r))*2^(γ (a (k+r))+γ (b (k+r))):=by intro r;induction r with | zero=>intro k;simp[Yo] | succ r d=>intro k;rw[Yo,d (k+1),Yo,show k+1+r=k+(r+1) by omega];ring lemma ZA (a b:ك) (d:ٽ) (h:ε a*ε b≠0 -> d<=γ a+γ b):sv a*sv b*2^(γ a+γ b)=2^d*(sv a*sv b*2^(γ a+γ b-d)):=by by_cases e:ε a*ε b=0 . have:sv a*sv b=0:=by rw[<- Zn,e];split_ifs<;>simp rw[this];ring rw[show idxOf a+idxOf b=d+(idxOf a+idxOf b-d) by omega,pow_add];rw[show d+(idxOf a+idxOf b-d)-d=idxOf a+idxOf b-d by omega];ring @[inline] def Yc (A:ل δ) (inW i:ٽ):ك := if h:i*inW+inW<=Aچ/\i*inW+inW<=4294967295 then Yah A (i*inW).toUSize inWڈ (by rw [Za _ א,Za _ א];exact h.1) (by rw [Za _ א,Za _ א];have:=φ;omega) 511 0 0 else 0x01FF00FF @[inline] def Yk (k:ك):ق:=(if k=0 then 0 else k-1).toUInt64 @[inline] def Yp (bx bv bw:ك):ق := let lo0:=Yk (bx>>>16)+Yk (bv>>>16) let xb:=Yd ζ+Yd bw if !(Yf bw==0)&&xbif t < inW then X[i*inW+t]! else ζ) (λ t=>if t < inW then W[j*inW+t]! else b[j]!) @[inline] def YL6 {β:Type} (lo:ق) (a b:ك) (w2 w1 w0 c:ق) (kont:ق -> ق -> ق -> ق -> β):β := let m:=Yf a*Yf b let s:=Yd a+Yd b-lo let rr:=s&&&63 let y0:=m<<>>1)>>>(63-rr) let ng:=((a^^^b)>>>31).toUInt64 let mk:ق:=0-ng let s0:=w0+(y0^^^mk) let k0:ق:=if s0 ق -> ق -> ق -> β) (h:ε a*ε b=0\/(e˟<=γ a+γ b/\γ a+γ b<=e˟+63)) : YL6 e a b f g j c d=YL e a b f g j c d:=by unfold YL6 YL;by_cases k:Yd a+Yd b-e<64 · simp only[k,ת,UInt64.zero_xor] · have o:Yf a*Yf b=0:=by rcases h with h|⟨p,q⟩ · rcases ϸ.mp h with h|h · have:Yf a=0:=ο.mp (by rw[Zk,h];rfl) rw[this];simp · have:Yf b=0:=ο.mp (by rw[Zk,h];rfl) rw[this];simp · exfalso;apply k;have l:=Zf a;have n:=Zf b;have r:=Zg a;have s:=Zg b;rw[Ι,Α _ _ (Ϯ.mpr (by rw[ξ,l,n];norm_num;omega)),ξ,l,n] norm_num;omega simp only[k,ؠ,o,UInt64.zero_shiftLeft,UInt64.zero_shiftRight,UInt64.zero_xor] @[inline] def YL16 {β:Type} (lo:ق) (a b:ك) (_w2 h w0 c:ق) (kont:ق -> ق -> ق -> ق -> β):β := let m:=Yf a*Yf b let s:=Yd a+Yd b-lo let y0:=m<<<(s&&&63) let ng:=((a^^^b)>>>31).toUInt64 let mk:ق:=0-ng let s0:=w0+(y0^^^mk) let k0:ق:=if s0>>63)) (h+mk+k0) s0 (c+ng) lemma H2 (h a b:ق) (d:a=0\/a=0-1) (f:b=0\/b=1) (g:h˟≠2^63-1/\h˟≠2^63) : (0:ق)-(h>>>63)+a+((if h+a>>63):=by have e:∀ x:ق,((0:ق)-(x>>>63))˟=if x˟<2^63 then 0 else 2^64-1:=by intro x;have:=x߾;rw[Φ,Ζ,ω];simp only[ϔ,show(63:ق)˟%64=63 from rfl] split_ifs<;>omega have j:=h߾;replace g:h˟<2^63-1 \/ 2^63rcases f with rfl|rfl<;>split_ifs with k l <;> simp only[Ι,ξ,e,UInt64.toNat_or,show(0-1:ق)˟=2^64-1 from rfl,ϔ,UInt64.toNat_one,Nat.zero_or,Nat.or_zero,Nat.or_self]at * <;> split_ifs at *<;>omega lemma Q3 (h a b:ق) (k:ٽ) (d:a=0\/a=0-1) (e:b=0\/b=1) (g:h˟<=k\/2^64-k<=h˟) (f:k<2^62) : (h+a+b)˟<=k+1\/2^64-(k+1)<=(h+a+b)˟:=by have j:=h߾;rcases d with rfl|rfl<;>rcases e with rfl|rfl <;> simp only[ξ,show(0-1:ق)˟=2^64-1 from rfl,ϔ,UInt64.toNat_one]<;>omega lemma Q4 (m r:ق) (a:m˟<2^48) (b:r˟<=16):(m>>>1)>>>(63-r)=0:=by apply ο.mp;rw[Ζ,Ζ,Α _ _ (Ϯ.mpr (by show r˟<=63;omega)),ω,ω,show(63:ق)˟=63 from rfl,show(1:ق)˟%64=1 from rfl,ϔ,ν (show 63-r˟<64 by omega),Ϡ] apply ϑ;calc m˟<2^48:=a _<=2^1*2^(63-r˟):=by rw[<- Θ];exact Η ב א lemma D0 (a b:ك):(0:ق)-((a^^^b)>>>31)܌=0\/(0:ق)-((a^^^b)>>>31)܌=0-1:=by have:=C6 a b;split at this · right;rw[ο.mp (show((a^^^b)>>>31)܌˟=(1:ق)˟ from this)] · left;rw[ο.mp (show((a^^^b)>>>31)܌˟=(0:ق)˟ from this)];rfl lemma B8 {β:Type} (e:ق) (a b:ك) (h f c:ق) (d:ق -> ق -> ق -> ق -> β) (g:ε a*ε b=0\/(e˟<=γ a+γ b/\γ a+γ b<=e˟+16)) (j:h˟≠2^63-1/\h˟≠2^63) : YL e a b ((0:ق)-(h>>>63)) h f c d=YL16 e a b ((0:ق)-(h>>>63)) h f c d:=by have n:=Zf a;have o:=Zf b;have u:=Zg a;have v:=Zg b;have k:ε a*ε b=0 -> Yf a*Yf b=0:=λ l=>ο.mp (by rw[ϱ,Zk,Zk,l];rfl) have p:((Yf a*Yf b)>>>1)>>>(63-((Yd a+Yd b-e)&&&63))=0:=by rcases g with l|⟨r,s⟩ · rw[k l];simp · apply Q4 · rw[ϱ,Zk,Zk];have:=ZK a b;omega · rw[F6,Α _ _ (Ϯ.mpr (by rw[ξ,n,o];omega)),ξ,n,o] omega unfold YL YL16;dsimp only;by_cases q:Yd a+Yd b-e<64 · simp only[q,ת,p,UInt64.zero_xor];rw[H2 h _ _ (D0 a b) ?_ j];split<;>simp · have t:Yf a*Yf b=0:=by rcases g with l|⟨r,s⟩ · exact k l · exfalso;apply q;rw[Ι,Α _ _ (Ϯ.mpr (by rw[ξ,n,o];omega)),ξ,n,o] norm_num;omega simp only[q,ؠ,t,UInt64.zero_shiftLeft,UInt64.zero_shiftRight,UInt64.zero_xor];rw[H2 h _ _ (D0 a b) ?_ j];split<;>simp def YS6 (q:ه) (X W:ل δ) (xa wa n:م) (hX:xaڇ+nڇ<=Xچ) (hW:waڇ+nڇ<=Wچ) (hx:xaڇ+nڇ<Ξ) (hw:waڇ+nڇ<Ξ) (lo:ق) (e:پ) (bw:ك) (w2 w1 w0 c:ق) (k:م):ق := if h:kYS6 q X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL6 lo (X.uget (xa+k) (A1 X xa n k hX hx h)) (W.uget (wa+k) (A1 W wa n k hW hw h)) w2 w1 w0 c λ v2 v1 v0 c'=>YS6 q X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL lo ζ bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nڇ-kڇ decreasing_by all_goals exact ZI n k h lemma G5 (q:ه) (X W:ل δ) (a b n:م) (g:a߷+n߷<=Xچ) (h:b߷+n߷<=Wچ) (j:a߷+n߷<Ξ) (l:b߷+n߷<Ξ) (f:ق) (e:پ) (o:ك) (u:n߷<2^62) (D:ٽ) (p:q -> D<=16) (r:D<=63) (s:∀ t,t ε X[a߷+t]! * ε W[b߷+t]! ≠ 0 -> f˟<=γ X[a߷+t]! + γ W[b߷+t]! /\ γ X[a߷+t]! + γ W[b߷+t]! <= f˟+D) : ∀ (d:ٽ) (k:م) (x v y c:ق),n߷-k߷=d -> (q -> x=(0:ق)-(v>>>63)/\(v˟<=k߷\/2^64-k߷<=v˟)) -> YS6 q X W a b n g h j l f e o x v y c k=YS X W a b n g h j l f e o x v y c k:=by intro d;induction d with | zero=> intro k x v y c C _;have z:¬ k intro k x v y c C E;have z:k⟨rfl,?_⟩) rw[F];apply Q3 v _ _ k߷ (D0 _ _) ?_ K א split<;>simp @[inline] def YaU (X W b:ل δ) (inW i j:ٽ) (bx bv:ك):δ := if h:i*inW+inW<=Xچ/\j*inW+inW<=Wچ/\i*inW+inW<=4294967295 /\ j*inW+inW<=4294967295/\inW<1048576 then let bw:=b[j]! let lo:=Yp bx bv bw let hi:=Yu bx bv bw if (bx&&&0xFFFF)=255||(bv&&&0xFFFF)=255||θ bw=255||hi122 then Yai X W b inW i j else have p1:(i*inW).toUSizeڇ+inW.toUSizeڇ<=Xچ:=by rw [Za _ א,Za _ א];exact h.1 have p2:(j*inW).toUSizeڇ+inW.toUSizeڇ<=Wچ:=by rw [Za _ א,Za _ א];exact h.2.1 have p3:(i*inW).toUSizeڇ+inW.toUSizeڇ<Ξ:=by rw [Za _ א,Za _ א];have:=φ;omega have p4:(j*inW).toUSizeڇ+inW.toUSizeڇ<Ξ:=by rw [Za _ א,Za _ א];have:=φ;omega let r:=if hi-lo<=63 then YS6 (hi-lo<=16) X W (i*inW).toUSize (j*inW).toUSize inWڈ p1 p2 p3 p4 lo ((loڇ:پ)-298) bw 0 0 0 0 0 else YS X W (i*inW).toUSize (j*inW).toUSize inWڈ p1 p2 p3 p4 lo ((loڇ:پ)-298) bw 0 0 0 0 0 if r<0x100000000 then r.toUInt32 else Yai X W b inW i j else Yai X W b inW i j @[specialize] def Yaj (hw:ٽ) (f:ٽ -> ٽ -> δ) (ch j:ٽ) (acc:ل δ):ل δ := if j ٽ -> δ) (ch:ٽ) (acc:ل δ):ل δ := if ch ٽ -> δ):ل δ:=Yak c hw f 0 (Array.mkEmpty (c*hw)) lemma I8 (a:ٽ) (f:ٽ -> ٽ -> δ) (b:ٽ):∀ k j (d:ل δ),a-j=k -> (Yaj a f b j d)֍=d֍++(List.range' j (a-j)).map (f b):=by intro k;induction k with | zero=>intro j d h;unfold Yaj;rw[if_neg א];simp[h] | succ k e=> intro j d h;unfold Yaj;rw[if_pos א,e (j+1) _ א,show a-j=(a-(j+1))+1 by omega,ϴ];simp lemma U4 (c a:ٽ) (f:ٽ -> ٽ -> δ):∀ k b (d:ل δ),c-b=k -> (Yak c a f b d)֍=d֍++(List.range' (b*a) ((c-b)*a)).map (λ i=>f (i/a) (i%a)):=by intro k;induction k with | zero=>intro b d h;unfold Yak;rw[if_neg א];simp[h] | succ k e=> intro b d h;unfold Yak;rw[if_pos א,e (b+1) _ א,I8 a f b _ 0 _ rfl,show(c-b)*a=a+(c-(b+1))*a by rw[show c-b=(c-(b+1))+1 by omega,Ϣ,ϫ,ϝ],<- List.range'_append,List.map_append,Nat.succ_mul] simp only[List.append_assoc,Nat.sub_zero];congr 2 . rw[show List.range' (b*a) a=(List.range' 0 a).map (b*a+·) by rw[List.map_add_range'];simp,List.map_map];apply List.map_congr_left;intro j g;rw[List.mem_range'_1]at g;simp only[Function.comp_def,ϝ (b*a) j,ϙ _ _ (show 0 ٽ -> δ):YT c a f=ډ N λ i=>f (i܁/a) (i܁%a):=by subst b;apply Array.ext';rw[YT,U4 c a f _ 0 _ rfl];apply ἤ<;>simp @[specialize] def Yaq (n:ٽ) (f:ٽ -> δ) (i:ٽ) (acc:ل δ):ل δ := if i δ):ل δ:=Yaq n f 0 (Array.mkEmpty n) @[inline] def YaJ (w:δ) (m:ق):ق := (Yf w<<<(Yd w-m))*((1:ق)-(2:ق)*(w>>>31).toUInt64) @[inline] def Y4 (w:δ) (m:ق):ك:=(YaJ w m+0x80000000).toUInt32 @[inline] def QhiS (hi lo q:ق):ق := hi+((0:ق)-(q>>>63))+(if lo+q>>16) @[specialize] def QY6G (n:م) (f:(k:م) -> k ق) (B0:ق) (bw:ك) (hi lo:ق) (k:م):ق := if h:k>>63)) hi lo 0 λ v2 v1 v0 c' => YD v2 v1 v0 c' ((B0ڇ:پ)-298) termination_by nڇ-kڇ decreasing_by exact ZI n k h @[inline] def QPb (x:ك) (m:ق) (s:ه):ٽ := let M:=Yf x<<<(Yd x-m) (if η x != s then 4611686018427387904-M else 4611686018427387904+M).toNat @[specialize] def QPD (n:ٽ) (f:ٽ -> ك) (m:ق) (t:ٽ) (P:ل ٽ):ل ٽ := if t ك) (t:ٽ) (I:ل ك):ل ك := if t>>31).toUSize)߷=2*k߷+(w>>>31)؟/\(w>>>31)؟<2:=by have e:(w>>>31)؟<2:=by rw[϶];have:=w.toNat_lt;simp;omega have:=φ;refine⟨?_,e⟩;rw[Zc _ _ (by rw[Zc _ _ א,ἥ];omega),Zc _ _ א,ἥ];omega @[inline] def QPS (inW:ٽ) (BX BV:ل ك):ه := 16<=inW&&BX.all (λ bx=>bx&&&0xFFFF != 255)&&BV.all (λ bv=>bv&&&0xFFFF != 255) && (BX.foldl (λ (m:ق) (bx:ك)=>min m (QYF bx)) 99).toNat+(BV.foldl (λ (m:ق) (bv:ك)=>max m (QYF bv)) 0).toNat<=15 lemma P8 (u:ك) (n:ٽ) (h:n<1048576):(min u (n-1).toUInt32)؟<=n-1 /\ (u؟<=n-1 -> min u (n-1).toUInt32=u):=by have e:(n-1).toUInt32؟=n-1:=ו rw[UInt32.min_def];split<;>rename_i c<;>rw[Ἐ,e]at c . exact⟨c,λ _=>rfl⟩ . exact⟨by omega,λ a=>absurd a c⟩ @[inline] def QPa (X:ل δ) (P:ل ٽ) (I:ل ك) (W b:ل δ) (inW i j:ٽ) (bx bv:ك):δ := let xm:=Yk (bx>>>16) let wm:=Yk (bv>>>16) let bw:=b[j]! let xb:=Yd ζ+Yd bw if h:Pچ=2*(if Iچ=0 then inW else Iچ)/\Iچ<=inW/\i*inW+inW<=Xچ/\j*inW+inW<=Wچ/\i*inW+inW<=4294967295 /\ j*inW+inW<=4294967295/\inW<1048576/\(bx&&&0xFFFF)≠255/\(bv&&&0xFFFF)≠255 /\ xm<=Yk (bx&&&0xFFFF)/\wm<=Yk (bv&&&0xFFFF)/\(QYF bx).toNat+(QYF bv).toNat<=15 /\ θ bw≠255/\(Yf bw=0\/(xm+wm<=xb/\xb-(xm+wm)<80))/\1<=wm then let wa:=(j*inW).toUSize let iw:=(inW-1).toUInt32 let r:=if c:Iچ=0 then QY6G inWڈ (λ k hk=> let w:=W.uget (wa+k) (by have:=ϋ.mp hk;rw [Za _ א] at this;simp only [wa];rw [Zc _ _ (by rw [Za _ א];have:=φ;omega),Za _ א];omega) ((P.uget (k+k+(w>>>31).toUSize) (by have:=ϋ.mp hk;rw [Za _ א] at this;have:=G7 k w א;rw [if_pos c] at h;omega)).toUInt64-4611686018427387904)*(Yf w<<<((θ w).toUInt64-(wm+1)))) (xm+wm) bw 0 0 0 else QY6G Iچڈ (λ k hk=> let u:=I.uget k (by have:=ϋ.mp hk;rw [Za _ א] at this;omega) let w:=W.uget (wa+(min u iw).toUSize) (by have:=ϋ.mp hk;rw [Za _ א] at this;have:=(P8 u inW א).1;simp only [wa,iw] at *;rw [Zc _ _ (by rw [Za _ א,UInt32.toNat_toUSize];have:=φ;omega),Za _ א,ἥ];omega) ((P.uget (k+k+(w>>>31).toUSize) (by have:=ϋ.mp hk;rw [Za _ א] at this;have:=G7 k w א;rw [if_neg c] at h;omega)).toUInt64-4611686018427387904)*(Yf w<<<((θ w).toUInt64-(wm+1)))) (xm+wm) bw 0 0 0 if r<0x100000000 then r.toUInt32 else Yai X W b inW i j else YaU X W b inW i j bx bv def YaV (rows inW outW:ٽ) (relu:ه) (X W b:ل δ):ل δ := let BX:ل ك:=ډ rows λ i=>Yc X inW i.val let BV:ل ك:=ډ outW λ j=>Yc W inW j.val let P:ل (ل ٽ × ل ك):=if QPS inW BX BV then ډ rows λ i=> if (QYF BX[i.val]!).toNat+(BV.foldl (λ (m:ق) (bv:ك)=>max m (QYF bv)) 0).toNat>15 then (#[],#[]) else let I:=QPI inW (λ t=>X[i.val*inW+t]!) 0 (Array.emptyWithCapacity inW) if 0X[i.val*inW+(I[m]!).toNat]!) (Yk (BX[i.val]! >>> 16)) 0 (Array.emptyWithCapacity (2*Iچ)),I) else (QPD inW (λ t=>X[i.val*inW+t]!) (Yk (BX[i.val]! >>> 16)) 0 (Array.emptyWithCapacity (2*inW)),#[]) else Υ rows (#[],#[]) YT rows outW λ i j=>act relu (QPa X P[i]!.1 P[i]!.2 W b inW i j BX[i]! BV[j]!) lemma Zq (k:ك):(Yk k)˟=k؟-1:=by unfold Yk;split_ifs with h . subst h;rfl . rw[ϯ,UInt32.toNat_sub_of_le _ _ (by rw[Ἐ];have:k؟≠0:=λ a=>h (Ν.mp (by simpa using a));show 1<=k؟;omega)] rfl lemma I2 (x y:ك):(Yk x+Yk y)˟=x؟-1+(y؟-1):=by rw[ξ,Zq,Zq];have:x؟<2^32:=Ἁ _;have:y؟<2^32:=Ἁ _;exact ν א lemma ZM (a:ك):(Yd ζ+Yd a)˟=γ ζ+γ a:=by rw[ξ,Zf,Zf];have:=Zg ζ;have:=Zg a;exact ν א lemma F4 (b d a:ك):(Yp b d a)˟<=((b>>>16)؟-1)+((d>>>16)؟-1) /\ (ε a≠0 -> (Yp b d a)˟<=γ ζ+γ a):=by have h:=I2 (b>>>16) (d>>>16);have j:=ZM a;have f:=I4 a;unfold Yp;dsimp only;rw[f];split_ifs with e . simp only[ϓ,ἠ,decide_eq_false_iff_not,ء,Ι]at e;omega . simp only[ϓ,ἠ,decide_eq_false_iff_not,ء,Ι,not_and,not_lt]at e;constructor . omega . intro g;have:=e g;omega lemma F3 (b d a:ك):((b&&&0xFFFF)؟-1)+((d&&&0xFFFF)؟-1)<=(Yu b d a)˟ /\ (ε a≠0 -> γ ζ+γ a<=(Yu b d a)˟):=by have h:=I2 (b&&&0xFFFF) (d&&&0xFFFF);have j:=ZM a;have f:=I4 a;unfold Yu;dsimp only;rw[f];split_ifs with e . simp only[ϓ,ἠ,decide_eq_false_iff_not,ء,Ι]at e;omega . simp only[ϓ,ἠ,decide_eq_false_iff_not,ء,Ι,not_and,not_lt]at e;constructor . omega . intro g;have:=e g;omega lemma Zo (a:ك) (L H:ٽ) (h:a؟=L*2^16+H) (b:H<2^16):(a>>>16)؟=L/\(a&&&0xFFFF)؟=H:=by constructor . rw[϶,show(16:ك)؟%32=16 from rfl,ω,h];omega . rw[ἣ,show(0xFFFF:ك)؟=2^16-1 from rfl,Ϙ,h];omega lemma C8 (X W b:ل δ) (a i j:ٽ):Yai X W b a i j=Β (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=by unfold Yai;rw[Zi] lemma Zp (A:ل δ) (a i:ٽ) (b:i*a+a<=Aچ) (d:i*a+a<=4294967295) : ∃ L H:ٽ,(Yc A a i)؟=L*2^16+H/\L<=511/\H<=255 /\ ∀ t,t < a -> L<=YR A[i*a+t]! /\ YM A[i*a+t]! <= H:=by have f:(i*a)۞߷=i*a:=Za _ א;have g:a۞߷=a:=Za _ א;unfold Yc;rw[dif_pos ⟨b,by omega⟩];obtain⟨L,H,e,h,j,-,-,k⟩:=U7 A (i*a)۞ a۞ (by rw[f,g];exact b) (by rw[f,g];have:=φ;omega) 511 0 0 ג ד ד refine⟨L,H,e,h,j,λ t l=>?_⟩;have:=k t ג (by rw[g];exact l);rwa[f]at this lemma A4 (S:پ) (a:ق) (c:ه) (b D:δ) (d:S=0 -> b=D) (e:D=ρ (S*2^a˟) (-298) c) : (if (if S=0 then 4294967296 else (ρ S ((a˟:پ)-298) false)܌)<4294967296 then (if S=0 then 4294967296 else (ρ S ((a˟:پ)-298) false)܌)؛ else b)=D:=by by_cases f:S=0 . rw[if_pos f,if_neg ד,d f] . rw[if_neg f];have g:(ρ S ((a˟:پ)-298) false)܌<4294967296:=by rw[Ι];simpa using Ἁ (ρ S ((a˟:پ)-298) false) rw[if_pos g,e,<- ἄ];have h:(ρ S ((a˟:پ)-298) false)܌؛=ρ S ((a˟:پ)-298) false:=by apply Ν.mp;simp rw[h];unfold finishWord;rw[if_neg f,if_neg f,show(-298:Int)+(a˟:Int)=(a˟:Int)-298 by ring] lemma D6 (u p:ق) (b:¬u122):p˟<=u˟/\u˟-p˟<=122:=by rw[Ι]at b;have d:p˟<=u˟:=א rw[gt_iff_lt,Ι,Α _ _ (Ϯ.mpr d)]at a;exact⟨d,Nat.not_lt.mp a⟩ lemma G0 {L r i:ٽ} (a:L<=r) (b:r<=i+1):L-1<=i:=א lemma F9 {m H i:ٽ} (a:m<=H) (b:i+1<=max m 1):i<=H-1:=א lemma ZQ {p u a b c d B:ٽ} {x w:δ} (h:p<=(a-1)+(b-1)) (j:(c-1)+(d-1)<=u) (k:u-p<=B) (e:a<=YR x/\YM x<=c) (f:b<=YR w/\YM w<=d) (g:ε x*ε w≠0):p<=γ x+γ w/\γ x+γ w<=p+B:= have l:=(Zb x).2.2.2 (left_ne_zero_of_mul g);have n:=(Zb w).2.2.2 (right_ne_zero_of_mul g);⟨h.trans (Ἆ (G0 e.1 l.1) (G0 f.1 n.1)),(Ἆ (F9 e.2 l.2) (F9 f.2 n.2)).trans (j.trans (Nat.sub_le_iff_le_add'.mp k))⟩ lemma M5 (x y:FloatLib.Numerics.Dyadic) (h:(ἓ x y).significand=0) : (ἓ x y).negative=(x.negative&&y.negative):=by unfold Model.addDyadic FloatLib.Numerics.Dyadic.add FloatLib.Numerics.Dyadic.addFields at h ⊢;dsimp only at h ⊢;split_ifs at h ⊢<;>simp_all only [beq_iff_eq,Int.ofNat_eq_natCast,Nat.shiftLeft_eq',Int.natCast_shiftLeft,Bool.and_self,Int.natAbs_eq_zero,Bool.not_eq_true,Bool.and_false,Bool.and_true,not_le] lemma M4 (d:FloatLib.Numerics.Dyadic) (h:d.significand=0):Model.roundDyadic κ d=Model.zero κ d.negative:=by rw[Model.roundDyadic_eq_roundDyadicImpl];unfold Model.roundDyadicImpl;rw[if_pos ד];unfold Model.ieeeRoundDyadicImpl;rw[if_pos (by simp[h])];cases d.negative<;>rfl lemma ZN (k:ٽ):(2:ℚ)^((k:ℤ)-149)=2^k*2^(-149:ℤ):=by rw[sub_eq_add_neg,zpow_add₀ two_ne_zero,ا] lemma F0:(2:ℚ)^(-149:ℤ)*2^(-149:ℤ)=2^(-298:ℤ):=by rw[<- zpow_add₀ two_ne_zero];norm_num lemma ZcD (a b:δ) (d:θ a≠255) (e:θ b≠255):π (Model.add (ι a) (ι b))=ρ (sv a*2^γ a+sv b*2^γ b) (-149) (η a&&η b):=by rw[Model.Proof.add_eq_spec];simp only[Model.Spec.add,ofW,Ϟ a d,Ϟ b e];have h:(ἓ (Ο a) (Ο b)).toRat=((sv a*2^γ a+sv b*2^γ b:پ):ℚ)*2^(-149:ℤ):=by rw[Model.addDyadic,FloatLib.Numerics.Dyadic.add_toRat,ϕ,ϕ,ZN,ZN];push_cast;ring by_cases f:sv a*2^γ a+sv b*2^γ b=0 . have g:(ἓ (Ο a) (Ο b)).significand=0:=ט rw[M4 _ g,M5 _ _ g,ἑ,ἑ,f,finishWord_zero] . exact(finishWord_of_ne _ _ _ _ f h).symm lemma M3 (x y z:δ) (a:θ x≠255) (b:θ y≠255) (d:θ z≠255):π (Model.fma (ι x) (ι y) (ι z))=ρ (sv x*sv y*2^(γ x+γ y)+sv z*2^(γ z+149)) (-298) (Γ (η x) (η y)&&η z):=by rw[Model.Proof.fma_eq_spec];have e:=Ϟ x a;have f:=Ϟ y b;have g:=Ϟ z d;have o:Model.chooseNaN3 (Model.ofUInt32 x:Model κ) (Model.ofUInt32 y) (Model.ofUInt32 z)=none := (Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨ٿ e,ٿ f,ٿ g⟩ simp only[Model.Spec.fma,ofW,o,Model.isInf_eq_false_of_toDyadic?_some e,Model.isInf_eq_false_of_toDyadic?_some f,Model.isInf_eq_false_of_toDyadic?_some g, Bool.or_false,χ,ؠ,e,f,g] set P:FloatLib.Numerics.Dyadic := { negative:=Γ (Ο x).negative (Ο y).negative significand:=(Ο x).significand*(Ο y).significand exponent:=(Ο x).exponent+(Ο y).exponent } with h have p:(ἓ P (Ο z)).toRat=((sv x*sv y*2^(γ x+γ y)+sv z*2^(γ z+149):پ):ℚ)*2^(-298:ℤ):=by have j:=FloatLib.Numerics.Dyadic.mul_toRat (Ο x) (Ο y);simp only[FloatLib.Numerics.Dyadic.mul,FloatLib.Numerics.Dyadic.mulFields]at j;rw[Model.addDyadic,FloatLib.Numerics.Dyadic.add_toRat,h,j,ϕ,ϕ,ϕ,ZN,ZN,ZN,<- F0] have k:(2:ℚ)^(γ z+149)*2^(-298:ℤ)=2^γ z*2^(-149:ℤ):=by rw[pow_add,<- F0,mul_assoc] norm_num push_cast;rw[<- F0]at k;linear_combination (sv z:ℚ)*k by_cases l:sv x*sv y*2^(γ x+γ y)+sv z*2^(γ z+149)=0 . have n:(ἓ P (Ο z)).significand=0:=ט rw[M4 _ n,M5 _ _ n,h];rw[ἑ,ἑ,ἑ,l,finishWord_zero] . exact(finishWord_of_ne _ _ _ _ l p).symm lemma M2 (j:ٽ) (a:j<=6):θ (natW (2^j))≠255/\η (natW (2^j))=false /\ ε (natW (2^j))=2^23/\γ (natW (2^j))=126+j:=by interval_cases j<;>decide lemma E9 (w:ك):η w=decide (2^31<=w؟):=by have a:=w.toNat_lt_size;have h:(w&&&߿)؟=2^31*(w؟/2^31%2):=by rw[ἣ,show(߿:ك)؟=2^31 from rfl,Nat.and_two_pow,Nat.testBit_eq_decide_div_mod_eq] have b:w؟/2^31%2<2:=Χ _ ב;generalize w؟/2^31%2=q at b ⊢;interval_cases q<;>rfl unfold signOf;rw[ἁ];simp;rw[<- UInt32.toNat_inj,h,show(0:ك)؟=0 from rfl];simp only[UInt32.size]at a;omega lemma ZcE (s:δ) (j:ٽ) (b:j<=6) (a:j < (θ s)؟):(θ (s-(ϣ j<<<23)))؟=(θ s)؟-j /\ fracOf (s-(ϣ j<<<23))=fracOf s /\ η (s-(ϣ j<<<23))=η s:=by rw[ZH]at a;have e:(ϣ j<<<23)؟=j*2^23:=by rw[UInt32.toNat_shiftLeft,Ἓ,υ,show(23:ك)؟%32=23 from rfl,ν (by omega:j<2^32)] exact ν א have f:ϣ j<<<23<=s:=by rw[Ἐ,e];omega have d:(s-(ϣ j<<<23))؟=s؟-j*2^23:=ט refine⟨?_,?_,?_⟩ . rw[ZH,ZH,d];omega . apply Ν.mp;rw[ZR,ZR,d];omega . rw[E9,E9,d];simp;omega lemma ZX (w:δ) (a:θ w≠255):ϥ (ι w)=(sv w:ℝ)*2^((γ w:ℤ)-149):=by rw[Model.toReal_eq];simp only[ofW,Ϟ w a];rw[<- FloatLib.Numerics.Dyadic.cast_toRat,ϕ];push_cast;rfl lemma ZcF (s y:δ) (j:ٽ) (f:j<=6) (a:θ s≠255) (b:j < (θ s)؟) (d:θ y≠255) (g:η y=false) (e:ε y=2^23) (k:γ y=126+j) : π (Model.div (ι s) (ι y))=s-(ϣ j<<<23):=by have A:sv y=2^23:=by unfold sv;rw[g,e];rfl have B:Model.isZero (ι y)=false:=by rw[ofW,Model.isZero_eq_beq_zero_of_toDyadic?_some (Ϟ y d),decodeD_sig_zero,e];decide obtain⟨C,D,E⟩:=ZcE s j f b;set r:=s-(ϣ j<<<23) with M;have N:=expOf_toNat_lt s;have l:θ r≠255:=by intro h;have n:=congrArg UInt32.toNat h;simp at n;have O:(θ s)؟≠255:=λ F=>a (Ν.mp (by simpa using F));omega have q:θ r≠0:=by intro h;have n:=congrArg UInt32.toNat h;simp at n;omega have t:θ s≠0:=by intro h;rw[h]at b;simp at b have G:sv r=sv s:=by unfold sv mantOf;rw[E,D,if_neg q,if_neg t] have H:(γ r:ℤ)=(γ s:ℤ)-j:=by unfold idxOf;rw[if_neg q,if_neg t,C];omega have o:ἔ (ι s)=true:=by simp[ofW,ἐ,a] have u:ἔ (ι y)=true:=by simp[ofW,ἐ,d] have v:ἔ (ι r)=true:=by simp[ofW,ἐ,l] have w:Model.isZero (ι y)=false:=B;have x:ϥ (ι y)=2^j:=by rw[ZX _ d,A,k];push_cast;rw[show((126:ℤ)+j-149)=(j:ℤ)+(-23) by ring,zpow_add₀ two_ne_zero,ا] field_simp;norm_num have I:ϥ (ι r)=ϥ (ι s)/2^j:=by rw[ZX _ l,ZX _ a,G,H,show((idxOf s:ℤ)-j-149)=((idxOf s:ℤ)-149) + -(j:ℤ) by ring,zpow_add₀ two_ne_zero,zpow_neg,ا] field_simp have J : |ϥ (ι s)/ϥ (ι y)| <= ϥ (Model.posMaxFinite κ):=by rw[x,abs_div,abs_of_pos (by positivity:(0:ℝ)<2^j)] calc |ϥ (ι s)| / 2^j <= |ϥ (ι s)| := div_le_self (abs_nonneg _) (one_le_pow₀ ב) _<=_:=Model.abs_toReal_le_posMaxFinite_of_isIEEE_of_isFinite _ ד o have z:ἔ (Model.div (ι s) (ι y))=true:=Model.isFinite_div_of_abs_div_le_posMaxFinite _ _ ד o u w J have p:=Model.toReal_div_eq_roundAt _ _ ד o u w z;rw[x,<- I,Model.roundAt_toReal_eq _ v]at p;have K:ϥ (Model.div (ι s) (ι y))≠0:=by rw[p,ZX _ l];apply mul_ne_zero _ (zpow_ne_zero _ two_ne_zero);have:sv r≠0:=by unfold sv mantOf;split<;>omega exact_mod_cast this have L:=Model.eq_of_toReal_eq_of_nonzero z v p K;rw[L,O0] lemma ZcG (s:δ) (j:ٽ) (a:j<=6) (b:θ s≠255) (d:j < (θ s)؟) : π (Model.div (ι s) (ι (natW (2^j))))=s-(ϣ j<<<23):=by obtain⟨e,f,g,h⟩:=M2 j a;exact ZcF s _ j a b d e f g h lemma ZcH (s y:δ) (a:θ s=0) (b:fracOf s=0) (d:θ y≠255) (e:η y=false) (f:ε y≠0) : π (Model.div (ι s) (ι y))=s:=by have n:θ s≠255:=ז rw[Model.Proof.div_eq_spec];simp only[Model.Spec.div,ofW,Ϟ s n,Ϟ _ d];have o:Ο s=⟨η s,0,0⟩:=by simp[decodeD,a,b] have p:((Ο y).significand==0)=false:=by rw[decodeD_sig_zero];simp[f] rw[o,p,ἑ,e];have q:=s.toNat_lt_size;simp only[UInt32.size]at q;have j:=ZH s;have k:=ZR s;rw[a]at j;rw[b]at k;simp at j k;have g:=E9 s;cases l:η s . rw[l]at g;have:s؟<2^31:=by simpa using g.symm have h:s=0:=Ν.mp ו rw[h];rfl . rw[l]at g;have:2^31<=s؟:=by simpa using g.symm have h:s=߿:=Ν.mp ו rw[h];rfl lemma X9 (s:δ) (j:ٽ) (a:j<=6) (b:θ s=0) (d:fracOf s=0) : π (Model.div (ι s) (ι (natW (2^j))))=s:=by obtain⟨e,f,g,-⟩:=M2 j a;exact ZcH s _ b d e f (by rw[g];norm_num) @[inline] def Yl (w:δ):ق := if θ w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 lemma Zs (w:δ):(Yl w)˟=ε w:=by have a:=fracOf_toNat_lt w;unfold Yl mantOf;split . simp . rw[ξ,ϯ,show(0x800000:ق)˟=2^23 from rfl,ν א] omega lemma X8 (m:ق) (a:ه) (b:m˟<2^63):Ym (if a then 0-m else m)=if a then -(m˟:پ) else (m˟:پ):=by cases a . simp only[χ,ؠ,Ym];rw[if_pos b];simp . simp only[ת,Ym];rw[Φ,show(0:ق)˟=0 from rfl];by_cases d:m˟=0 . rw[d];norm_num . have e:(2^64-m˟+0)%2^64=2^64-m˟:=א omega lemma M1 (x y:ق) (a : -2^63<=Ym x+Ym y) (b:Ym x+Ym y<2^63):Ym (x+y)=Ym x+Ym y:=by unfold Ym at a b ⊢;rw[ξ];split_ifs at a b ⊢<;>omega lemma X7 (m:ق) (d:ٽ) (a:d<64) (h:m˟*2^d<2^64):(m<<simp[h] lemma ZY (m:ق) (d:ٽ) (a:ه) (b:d<64) (h:m˟*2^d<2^62) : Ym (if a then 0-(m<<simp[Nat.cast_mul,Nat.cast_pow] lemma E8 (w:δ):(if η w then -((Yl w)˟:پ) else ((Yl w)˟:پ))=sv w:=by rw[Zs];rfl lemma ZO:sv ζ=2^23/\γ ζ=126:=ד lemma P1 (a b:δ) (e:ٽ) (h:ε a*ε b≠0 -> e<128) : -2^175constructor<;>linarith lemma X5 (S e:پ) (a b:ه) (h:S≠0):ρ S e a=ρ S e b:=by simp[finishWord,h] lemma X4 (a b p q:ق):(a≠0 -> (if a=0 then q else if b=0 then p else if p<=q then p else q)<=p) /\ (b≠0 -> (if a=0 then q else if b=0 then p else if p<=q then p else q)<=q):=ז @[inline] def Yal (a b c d:δ) (nz:ه) (slow:Unit -> δ):δ := let p:=Yd a+Yd b let q:=Yd c+Yd d let m1:=Yf a*Yf b let m2:=Yf c*Yf d let lo:=if m1=0 then q else if m2=0 then p else if p<=q then p else q if (m1=0\/p-lo<128)/\(m2=0\/q-lo<128) then YL lo a b 0 0 0 0 λ w2 w1 w0 k => YL lo c d w2 w1 w0 k λ v2 v1 v0 k' => let r:=YD v2 v1 v0 k' ((loڇ:پ)-298) if r=0x100000000 then (if nz then 0x80000000 else 0) else r.toUInt32 else slow () lemma I5 (a b:δ) (d:ق) (e:(Yd a+Yd b)˟=γ a+γ b) (z:Yf a*Yf b=0↔ε a*ε b=0) (L:Yf a*Yf b≠0 -> d<=Yd a+Yd b) (f:Yf a*Yf b=0\/Yd a+Yd b-d<128) : ε a*ε b≠0 -> d˟<=γ a+γ b/\γ a+γ bk (z.mp h);have l:=L g;have j:Yd a+Yd b-d<128:=f.resolve_left g rw[Κ,e]at l;rw[Ι,Α _ _ (L g),e]at j;simp at j;omega lemma P0 (a b c d:δ) (f:ه) (e:Unit -> δ) (g:e ()=ρ (sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)) (-298) f) : Yal a b c d f e=ρ (sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)) (-298) f:=by unfold Yal;dsimp only;have O:=Zg a;have P:=Zg b;have Q:=Zg c;have id:=Zg d;have D:=D5 a b have E:=D5 c d have R:=C5 a b have S:=C5 c d have F:=I1 a b have G:=I1 c d obtain⟨L1,L2⟩:=X4 (Yf a*Yf b) (Yf c*Yf d) (Yd a+Yd b) (Yd c+Yd d) generalize T:(if Yf a*Yf b=0 then Yd c+Yd d else if Yf c*Yf d=0 then Yd a+Yd b else if Yd a+Yd b<=Yd c+Yd d then Yd a+Yd b else Yd c+Yd d)=j at L1 L2 ⊢ split . rename_i y;have F1:=I5 a b j D F L1 y.1;have F2:=I5 c d j E G L2 y.2 obtain⟨t,u,v,k,w,H,z⟩:=Zr j a b 0 0 0 0 (λ t u v k=>YL j c d t u v k λ n o p q=>let r:=YD n o p q ((j˟:پ)-298);if r=ר then (if f then (߿:ك) else 0) else r؛) ג F1 rw[w];obtain⟨n,o,p,q,x,U,I⟩:=Zr j c d t u v k (λ n o p q=>let r:=YD n o p q ((j˟:پ)-298);if r=ר then (if f then (߿:ك) else 0) else r؛) (by simp at H;omega) F2 rw[x];have A:=P1 a b (γ a+γ b-j˟) (λ l=>by omega) have B:=P1 c d (γ c+γ d-j˟) (λ l=>by omega) have J:Yx 0 0 0=0:=rfl;rw[J,show(0:ق)˟=0 from rfl]at z;have K:((Yx n o p+q˟:ٽ):پ)%2^192=(sv a*sv b*2^(γ a+γ b-j˟)+sv c*sv d*2^(γ c+γ d-j˟))%2^192:=by rw[I];rw[ϩ,z,<- ϩ];simp rw[ZV n o p q _ _ (by linarith [A.1,B.1]) (by linarith [A.2,B.2]) K];have C:sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)=(sv a*sv b*2^(γ a+γ b-j˟)+sv c*sv d*2^(γ c+γ d-j˟))*2^j˟:=by have w:=ZC (sv a*sv b) (γ a+γ b) j˟ (by by_cases l:ε a*ε b=0 . left;rw[<- Zn,l];simp . right;exact(F1 l).1) have x:=ZC (sv c*sv d) (γ c+γ d) j˟ (by by_cases l:ε c*ε d=0 . left;rw[<- Zn,l];simp . right;exact(F2 l).1) rw[w,x];ring by_cases s:sv a*sv b*2^(γ a+γ b-j˟)+sv c*sv d*2^(γ c+γ d-j˟)=0 . rw[if_pos s,if_pos rfl,C,s,zero_mul];cases f<;>rfl . rw[if_neg s];have L:(ρ (sv a*sv b*2^(γ a+γ b-j˟)+sv c*sv d*2^(γ c+γ d-j˟)) ((j˟:پ)-298) false)܌ ≠ר:=by intro h;have M:=congrArg Ἡ h;have:=Ἁ (ρ (sv a*sv b*2^(γ a+γ b-j˟)+sv c*sv d*2^(γ c+γ d-j˟)) ((j˟:پ)-298) false) simp only[UInt32.size]at this;simp at M;omega rw[if_neg L,UInt32.toUInt32_toUInt64,C,show((j˟:Int)-298) = -298+(j˟:Int) by ring,ἄ] apply X5;intro h;apply s;have N:(2:پ)^j˟≠0:=pow_ne_zero _ two_ne_zero;exact(mul_eq_zero.mp h).resolve_right N . exact g @[inline] def Y1 (ma mb:ق) (ia ib:ٽ):ٽ := if ma=0 then ib else if mb=0 then ia else min ia ib lemma O9 (a b:ق) (d e:ٽ):(a=0\/Y1 a b d e<=d)/\(b=0\/Y1 a b d e<=e):=by unfold Y1;refine⟨?_,?_⟩<;>split_ifs<;>first | (left;assumption) | (right;omega) @[inline] def YaW (sa:ه) (ma:ق) (ia:ٽ) (sb:ه) (mb:ق) (ib:ٽ) (sh:پ) (nz:ه) (slow:Unit -> δ):δ := let k:=Y1 ma mb ia ib let da:=ia-k let db:=ib-k if da<=38/\db<=38 then let ta:=ma<< δ) (p:a˟<2^24) (q:b˟<2^24) (r:g ()=ρ ((if j then -(a˟:پ) else a˟)*2^e+(if l then -(b˟:پ) else b˟)*2^f) n o) : YaW j a e l b f n o g=ρ ((if j then -(a˟:پ) else a˟)*2^e+(if l then -(b˟:پ) else b˟)*2^f) n o:=by have Zc8:∀ (m:ق) (d:ٽ),m˟<2^24 -> d<=38 -> m˟*2^d<2^62:=λ m d h s=>calc m˟*2^d<2^24*2^38:=ἕ h (Η ב s) ה _=2^62:=ב unfold YaW;dsimp only;split . rename_i s;obtain⟨x,y⟩:=O9 a b e f;set k:=Y1 a b e f;have t:=Zc8 a _ p s.1;have u:=Zc8 b _ q s.2;have v:=ZY a (e-k) j (by omega -splitDisjunctions) t have w:=ZY b (f-k) l (by omega -splitDisjunctions) u rw[F7,M1 _ _ ?_ ?_,v,w] . rw[show((k:Int)+n)=n+(k:Int) by ring,ἄ];have z:=ZC (if j then -(a˟:پ) else a˟) e k (by rcases x with h | h . left;subst h;simp . right;exact h) have A:=ZC (if l then -(b˟:پ) else b˟) f k (by rcases y with h | h . left;subst h;simp . right;exact h) rw[z,A];ring all_goals rw[v,w];have B:(a˟*2^(e-k):پ)<2^62:=by exact_mod_cast t have C:(b˟*2^(f-k):پ)<2^62:=by exact_mod_cast u have D:(0:پ)<=a˟*2^(e-k):=ג have E:(0:پ)<=b˟*2^(f-k):=ג cases j<;>cases l<;>simp<;>linarith . exact r @[inline] def YaX (a b:δ):δ := if θ a=255\/θ b=255 then π (Model.add (ι a) (ι b)) else YaW (η a) (Yl a) (γ a) (η b) (Yl b) (γ b) (-149) (η a&&η b) (λ _=>Yal a ζ b ζ (η a&&η b) (λ _=>π (Model.add (ι a) (ι b)))) lemma X2 (a b:δ):YaX a b=π (Model.add (ι a) (ι b)):=by unfold YaX;split . rfl . rename_i h;have g:θ a≠255:=λ e=>h (Ω e);have j:θ b≠255:=λ e=>h (Or.inr e);have d:=ZcD a b g j;have f:π (Model.add (ι a) (ι b))=ρ (sv a*sv ζ*2^(γ a+γ ζ)+sv b*sv ζ*2^(γ b+γ ζ)) (-298) (η a&&η b):=by rw[d,ZO.1,ZO.2,show(-149:Int) = -298+((149:Nat):Int) by norm_num,ἄ] congr 1;ring have k:Yal a ζ b ζ (η a&&η b) (λ _=>π (Model.add (ι a) (ι b)))=π (Model.add (ι a) (ι b)):=by rw[P0 _ _ _ _ _ _ f,f] rw[<- E8 a,<- E8 b]at d;rw[X3 _ _ _ _ _ _ _ _ _ (by rw[Zs];exact ϖ a) (by rw[Zs];exact ϖ b) (by rw[k];exact d),d] @[inline] def YaY (x y z:δ):δ := if θ x=255\/θ y=255\/θ z=255 then π (Model.fma (ι x) (ι y) (ι z)) else let mp:=Yl x*Yl y let mz:=Yl z let p:=γ x+γ y let q:=γ z+149 let k:=Y1 mp mz p q let dp:=p-k let dq:=q-k if dp<=14/\dq<=38 then let neg:=Γ (η x) (η y) let tp:=mp<<π (Model.fma (ι x) (ι y) (ι z))) lemma X1 (x y z:δ):YaY x y z=π (Model.fma (ι x) (ι y) (ι z)):=by unfold YaY;split . rfl . rename_i h;have n:θ x≠255:=λ d=>h (Ω d);have o:θ y≠255:=λ d=>h (Or.inr (Ω d));have p:θ z≠255:=λ d=>h (Or.inr (Or.inr d));dsimp only;split . rename_i q;rw[M3 x y z n o p];have g:(Yl x*Yl y)˟=ε x*ε y:=by rw[ϱ,Zs,Zs];exact ν (mul_mant_lt x y) have B:(Yl x*Yl y)˟<2^48:=by rw[g];calc ε x*ε y<2^24*2^24:=Nat.mul_lt_mul'' (ϖ x) (ϖ y) _=2^48:=ב have C:(Yl z)˟<2^24:=by rw[Zs];exact ϖ z obtain⟨D,E⟩:=O9 (Yl x*Yl y) (Yl z) (γ x+γ y) (γ z+149);set k:=Y1 (Yl x*Yl y) (Yl z) (γ x+γ y) (γ z+149);set a:=Yl x*Yl y;have j:a˟*2^(γ x+γ y-k)<2^62:=calc a˟*2^(γ x+γ y-k)<2^48*2^14:=ἕ B (Η ב q.1) ה _=2^62:=ב have l:(Yl z)˟*2^(γ z+149-k)<2^62:=calc (Yl z)˟*2^(γ z+149-k)<2^24*2^38:=ἕ C (Η ב q.2) ה _=2^62:=ב have e:=ZY a (γ x+γ y-k) (Γ (η x) (η y)) א j have f:=ZY (Yl z) (γ z+149-k) (η z) א l;have r:(if Γ (η x) (η y) then -(a˟:پ) else (a˟:پ))=sv x*sv y:=by rw[g,Zn] have s:(if η z then -((Yl z)˟:پ) else ((Yl z)˟:پ))=sv z:=E8 z;rw[r]at e;rw[s]at f;have t:(0:پ)<=a˟*2^(γ x+γ y-k):=ג have u:(0:پ)<=(Yl z)˟*2^(γ z+149-k):=ג have v:(sv x*sv y)*2^(γ x+γ y-k)=(if Γ (η x) (η y) then -(a˟:پ) else (a˟:پ))*2^(γ x+γ y-k):=by rw[r] have w:sv z*2^(γ z+149-k)=(if η z then -((Yl z)˟:پ) else ((Yl z)˟:پ))*2^(γ z+149-k):=by rw[s] have F : -2^63<=sv x*sv y*2^(γ x+γ y-k)+sv z*2^(γ z+149-k):=by rw[v,w];cases Γ (η x) (η y)<;>cases η z<;>simp<;>linarith only [t,u,j,l] have G:sv x*sv y*2^(γ x+γ y-k)+sv z*2^(γ z+149-k)<2^63:=by rw[v,w];cases Γ (η x) (η y)<;>cases η z<;>simp<;>linarith only [t,u,j,l] rw[F7,M1 _ _ (by rw[e,f];exact F) (by rw[e,f];exact G),e,f,show((k:پ)-298) = -298+(k:پ) by ring,ἄ] have H:=ZC (sv x*sv y) (γ x+γ y) k (by rcases D with b | b . left;have:ε x*ε y=0:=by rw[<- g,b];rfl rw[<- Zn,this];simp . right;exact b) have I:=ZC (sv z) (γ z+149) k (by rcases E with b | b . left;have:ε z=0:=by rw[<- Zs];simp[b] exact X6 z this . right;exact b) rw[H,I];ring . have J:=M3 x y z n o p;have A:π (Model.fma (ι x) (ι y) (ι z))=ρ (sv x*sv y*2^(γ x+γ y)+sv z*sv ζ*2^(γ z+γ ζ)) (-298) (Γ (η x) (η y)&&η z):=by rw[J,ZO.1,ZO.2];ring rw[P0 _ _ _ _ _ _ A,A] @[inline] def YaA (j:ٽ) (s:δ):δ := if θ s≠255/\j < (θ s).toNat then s-(ϣ j<<<23) else if θ s=0/\fracOf s=0 then s else π (Model.div (ι s) (ι (natW (2^j)))) lemma O8 (j:ٽ) (a:j<=6) (s:δ):YaA j s=π (Model.div (ι s) (ι (natW (2^j)))):=by unfold YaA;split . rename_i h;exact(ZcG s j a h.1 h.2).symm . split . rename_i b;exact(X9 s j a b.1 b.2).symm . rfl @[inline] def YaB (kk:ٽ) (s:δ):δ := if kk=4 then YaA 2 s else if kk=64 then YaA 6 s else π (Model.div (ι s) (ι (natW kk))) lemma O7 (a:ٽ) (s:δ):YaB a s=π (Model.div (ι s) (ι (natW a))):=by unfold YaB;split . rename_i h;subst h;exact O8 2 ב s . split . rename_i h;subst h;exact O8 6 ב s . rfl def YaZ (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) YaB (k*k) (Yn (k*k) (poolAt h w k inp ch y x) (λ _=>ζ)) lemma X0:YaZ=avgpoolSpec:=by funext c h w k a;simp only[YaZ,avgpoolSpec,avgpoolWith,O7,Zi] @[specialize] def YE (n:م) (fx fw:(t:م) -> t δ) (lo:ق) (e:پ) (bx bw:ك) (w2 w1 w0 c:ق) (k:م):ق := if h:k YE n fx fw lo e bx bw v2 v1 v0 c' (k+1) else YL lo bx bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nڇ-kڇ decreasing_by exact ZI n k h def Yr (fa fb:ٽ -> δ) (lo k:ٽ):ٽ -> پ | 0=>0 | r+1=>sv (fa k)*sv (fb k)*2^(γ (fa k)+γ (fb k)-lo)+Yr fa fb lo (k+1) r lemma F8 (n:م) (o p:(t:م) -> t δ) (g a:ٽ -> δ) (q:∀ t h,o t h=g t߷) (r:∀ t h,p t h=a t߷) (f:ق) (e:پ) (j l:ك) (s:n߷<2^32) (b:ε j*ε l≠0 -> f˟<=γ j+γ l/\γ j+γ l k߷<=n߷ -> c˟<=k߷ -> (∀ t,k߷<=t -> t ε (g t)*ε (a t)≠0 -> f˟<=γ (g t)+γ (a t)/\γ (g t)+γ (a t) ((Yx C D E+c˟:ٽ):پ)%2^192=S0%2^192 -> S=S0+Yr g a f˟ k߷ (n߷-k߷)+sv j*sv l*2^(γ j+γ l-f˟) -> -2^191<=S -> S<2^191 -> YE n o p f e j l C D E c k=if S=0 then ר else (ρ S e false)܌:=by intro d;induction d with | zero => intro k C D E c S0 S J K L G x u v w;have F:¬ kYD y z A B e) (by clear x u v w b;omega) b rw[H];apply ZV y z A B e S v w;rw[I,u,show n߷-k߷=0 by clear x u v w b;omega,Yr];omega | succ d N => intro k C D E c S0 S J K L G x u v w;have F:kYE n o p f e j l y z A B (k+1)) (by clear x u v w b;omega) (G k߷ (le_refl _) (by clear x u v w b;omega)) rw[H];refine N (k+1) y z A B (S0+sv (g k߷)*sv (a k߷)*2^(γ (g k߷)+γ (a k߷)-f˟)) S (by clear x u v w b;omega) (by clear x u v w b;omega) (by clear x u v w b;omega) (λ t Q P=>G t (by clear x u v w b;omega) P) ?_ ?_ v w . rw[I];omega . rw[u,show n߷-k߷=(n߷-(k+1)߷)+1 by clear x u v w b;omega,Yr,O];ring lemma C7 (a b:ٽ -> δ) (d:ٽ):∀ (r k:ٽ),(∀ t,k<=t -> t ε (a t)*ε (b t)≠0 -> d<=γ (a t)+γ (b t)/\γ (a t)+γ (b t)<=d+122) -> -((r:پ)*2^170)<=Yr a b d k r/\Yr a b d k r<=(r:پ)*2^170:=by intro r;induction r with | zero=>intro k _;simp[Yr] | succ r e=>intro k h;obtain⟨f,g⟩:=ZL (a k) (b k) d (h k (le_refl _) א);obtain⟨j,l⟩:=e (k+1) (λ t n o=>h t א א);rw[Yr];push_cast;constructor<;>linarith lemma O6 (a b:ٽ -> δ) (K d:ٽ) (e f:ك):∀ r k,k+r<=K -> (∀ t,k<=t -> t ε (a t)*ε (b t)≠0 -> d<=γ (a t)+γ (b t)) -> Yo (λ t=>if tif tintro k _ _;simp[Yo,Yr] | succ r g=>intro k j h;rw[Yo,Yr,g (k+1) א (λ t l n=>h t א א)];simp only[show k t δ) (e a:ٽ -> δ) (o:∀ t h,f t h=e t߷) (p:∀ t h,g t h=a t߷) (b:ك) (d:ق) (v:K<1048576) (q:∀ t,t θ (e t)≠255) (r:∀ t,t θ (a t)≠255) (s:θ b≠255) (l:∀ t,t ε (e t)*ε (a t)≠0 -> d˟<=γ (e t)+γ (a t)/\γ (e t)+γ (a t)<=d˟+122) (j:ε ζ*ε b≠0 -> d˟<=γ ζ+γ b/\γ ζ+γ b<=d˟+122) (n:δ) (u:n=Β (K+1) (λ t=>if tif tif tif tl t א w);have H:=ZL ζ b d˟ j;generalize A:Yr e a d˟ 0 K+sv ζ*sv b*2^(γ ζ+γ b-d˟)=Srel have B : -2^191<=Srel:=א have C:Srel<2^191:=א have D:=F8 K۞ f g e a o p d ((d˟:پ)-298) ζ b א (λ h=>⟨(j h).1,by have:=(j h).2;omega⟩) K 0 0 0 0 0 0 Srel (by simp[y]) ג ג (λ t _ z w=>by have:=l t א w;exact⟨this.1,by omega⟩) (by simp[Yx]) (by rw[<- A,y];simp) B C rw[D];have E:∀ k,k θ ((λ t=>if tif tif tif tif tif t(l t א w).1)] simp;rw[ZA oneW b d˟ (λ h=>(j h).1),<- A];ring exact A4 _ _ _ _ _ (λ _=>u) F lemma Q0 (X W:ل δ) (a b d:ٽ):∀ r k,YB X W a b d k r=Yr (λ t=>X[a+t]!) (λ t=>W[b+t]!) d k r:=by intro r;induction r with | zero=>intro k;rfl | succ r e=>intro k;rw[YB,Yr,e] lemma P7 (X W:ل δ) (a b n:م) (f:a߷+n߷<=Xچ) (g:b߷+n߷<=Wچ) (j:a߷+n߷<Ξ) (l:b߷+n߷<Ξ) (o:ق) (e:پ) (p:ك):∀ d (k:م) (r s u c:ق),n߷-k߷=d -> YS X W a b n f g j l o e p r s u c k=YE n (λ t h=>X.uget (a+t) (A1 X a n t f j h)) (λ t h=>W.uget (b+t) (A1 W b n t g l h)) o e ζ p r s u c k:=by intro d;induction d with | zero=>intro k r s u c v;have q:¬ kintro k r s u c v;have q:k f˟<=γ ζ+γ g/\γ ζ+γ g k߷<=n߷ -> c˟<=k߷ -> (∀ t,k߷<=t -> t ε X[a߷+t]! * ε W[b߷+t]! ≠ 0 -> f˟<=γ X[a߷+t]! + γ W[b߷+t]! /\ γ X[a߷+t]! + γ W[b߷+t]! < f˟+128) -> ((Yx s u v+c˟:ٽ):پ)%2^192=S0%2^192 -> S=S0+YB X W a߷ b߷ f˟ k߷ (n߷-k߷)+sv ζ*sv g*2^(γ ζ+γ g-f˟) -> -2^191<=S -> S<2^191 -> YS X W a b n j l o p f e g s u v c k=if S=0 then ר else (ρ S e false)܌:=by intro d k s u v c S0 S w x y z A B C D;rw[P7 X W a b n j l o p f e g _ k s u v c rfl];exact F8 n _ _ (λ t=>X[a߷+t]!) (λ t=>W[b߷+t]!) (λ t h=>A5 X a t _ (by have:=ϋ.mp h;omega)) (λ t h=>A5 W b t _ (by have:=ϋ.mp h;omega)) f e ζ g q r d k s u v c S0 S w x y z A (by rw[B,Q0]) C D lemma U5 (X W:ل δ) (a b d:ٽ):∀ (r k:ٽ),(∀ t,k<=t -> t ε X[a+t]! * ε W[b+t]! ≠ 0 -> d<=γ X[a+t]! + γ W[b+t]! /\ γ X[a+t]! + γ W[b+t]! <= d+122) -> -((r:پ)*2^170)<=YB X W a b d k r/\YB X W a b d k r<=(r:پ)*2^170:=λ r k h=>Q0 X W a b d r k ▸ C7 _ _ d r k h lemma J4 (X W:ل δ) (a i j:ٽ) (b:ك) (d:ق) (e:(i*a)۞߷+a۞߷<=Xچ) (f:(j*a)۞߷+a۞߷<=Wچ) (g:(i*a)۞߷+a۞߷<Ξ) (k:(j*a)۞߷+a۞߷<Ξ) (n:(i*a)۞߷=i*a) (o:(j*a)۞߷=j*a) (x:a۞߷=a) (p:a<1048576) (q:∀ t,t < a -> θ X[i*a+t]! ≠ 255) (r:∀ t,t < a -> θ W[j*a+t]! ≠ 255) (s:θ b≠255) (u:∀ t,t < a -> ε X[i*a+t]! * ε W[j*a+t]! ≠ 0 -> d˟<=γ X[i*a+t]! + γ W[j*a+t]! /\ γ X[i*a+t]! + γ W[j*a+t]! <= d˟+122) (v:ε ζ*ε b≠0 -> d˟<=γ ζ+γ b/\γ ζ+γ b<=d˟+122) (l:δ) (w:l=Β (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b)) : (if YS X W (i*a)۞ (j*a)۞ a۞ e f g k d ((d˟:پ)-298) b 0 0 0 0 0<ר then (YS X W (i*a)۞ (j*a)۞ a۞ e f g k d ((d˟:پ)-298) b 0 0 0 0 0)؛ else l) = Β (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b):=by rw[P7 X W _ _ _ e f g k d _ b _ 0 0 0 0 0 rfl];exact J3 a _ _ (λ t=>X[i*a+t]!) (λ t=>W[j*a+t]!) (λ t h=>by rw[A5 X _ t _ (by have:=ϋ.mp h;omega),n]) (λ t h=>by rw[A5 W _ t _ (by have:=ϋ.mp h;omega),o]) b d p q r s u v l w lemma ZcB (X W b:ل δ) (a i j:ٽ):YaU X W b a i j (Yc X a i) (Yc W a j)=Β (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=by unfold YaU;split . rename_i F;obtain⟨G,H,I,J,K⟩:=F;have v:(i*a)۞߷=i*a:=Za _ (by omega -splitDisjunctions);have w:(j*a)۞߷=j*a:=Za _ (by omega -splitDisjunctions);have o:a۞߷=a:=Za _ (by omega -splitDisjunctions);obtain⟨Lx,Hx,x,Z,L,p⟩:=Zp X a i G I;obtain⟨Lv,Hv,y,hq,M,r⟩:=Zp W a j H J;generalize Yc X a i=e at x ⊢;generalize Yc W a j=f at y ⊢;obtain⟨N,z⟩:=Zo e Lx Hx x (by omega -splitDisjunctions);obtain⟨O,A⟩:=Zo f Lv Hv y (by omega -splitDisjunctions);obtain⟨k,s⟩:=F4 e f b[j]!;obtain⟨l,u⟩:=F3 e f b[j]!;rw[N,O]at k;rw[z,A]at l;dsimp only;split . exact C8 X W b a i j . rename_i B;simp only[ἀ,ء,not_or]at B;obtain⟨⟨⟨⟨P,Q⟩,R⟩,S⟩,T⟩:=id B;have U:Hx≠255:=λ h=>P (Ν.mp (by rw[z,h];rfl));have V:Hv≠255:=λ h=>Q (Ν.mp (by rw[A,h];rfl));obtain⟨C,D⟩:=D6 _ _ S T by_cases g:Yu e f b[j]! - Yp e f b[j]! <= 63;on_goal 1 => rw[if_pos g];have Y:(Yu e f b[j]!)˟-(Yp e f b[j]!)˟<=63:=by rw[Κ,Α _ _ (Ϯ.mpr C)]at g;exact g rw[G5 _ X W (i*a)۞ (j*a)۞ a۞ _ _ _ _ (Yp e f b[j]!) _ b[j]! (by rw[o];omega) _ (λ q=>by simp only[ء]at q;rw[Κ,Α _ _ (Ϯ.mpr C)]at q;exact q) Y (λ t d n=>by rw[v,w]at n ⊢;rw[o]at d;exact ZQ k l (le_refl _) (p t d) (r t d) n) a۞߷ 0 0 0 0 0 ג (λ _=>⟨rfl,by simp⟩)] on_goal 2=>rw[if_neg g] all_goals apply J4 X W a i j b[j]! (Yp e f b[j]!) _ _ _ _ v w o K . intro t d;exact(Zb X[i*a+t]!).2.2.1 (ϊ (p t d).2 (ϰ L U)) . intro t d;exact(Zb W[j*a+t]!).2.2.1 (ϊ (r t d).2 (ϰ M V)) . exact R . intro t d n;exact ZQ k l D (p t d) (r t d) n . intro n;have E:ε b[j]! ≠ 0:=λ h=>n (by rw[h,Ϝ]);exact⟨s E,(u E).trans (Nat.sub_le_iff_le_add'.mp D)⟩ . exact C8 X W b a i j . exact C8 X W b a i j @[inline] def Yb (s:σ):ٽ:=s.h+2*s.pad @[inline] def Ya (s:σ):ٽ:=s.w+2*s.pad @[inline] def YI (s:σ) (inp:ل δ) (idx:ٽ):δ := let c:=idx/(Yb s*Ya s) let yy:=idx/Ya s%Yb s let xx:=idx%Ya s if yy=s.h\/xx-s.pad>=s.w then 0 else inp[(c*s.h+(yy-s.pad))*s.w+(xx-s.pad)]! @[inline] def Ys (s:σ) (t:ٽ):ٽ := t/(s.kh*s.kw)*(Yb s*Ya s)+t/s.kw%s.kh*Ya s+t%s.kw lemma O5 (c a b A B:ٽ) (e:a b+(a[t]!)؟if tif tif tif t pbn+(off[t]!).toNat122 then Yam s inp wts b k o cw y x else let r:=YE kڈ (λ t ht=>P.uget (pbnڈ+(off.uget t (by rw [hoff];rw [USize.lt_iff_toNat_lt,Za _ א] at ht;exact ht)).toUSize) (by have:=O3 P off k pbn hoff hPs hix t ht א (by rw [hoff];rw [USize.lt_iff_toNat_lt,Za _ א] at ht;exact ht) rw [this.1];exact this.2)) (λ t ht=>wts.uget ((o*k).toUSize+t) (by have:=Z0 wts o k h t ht rw [this.1];exact this.2)) lo ((loڇ:پ)-298) ζ bw 0 0 0 0 0 if r<0x100000000 then r.toUInt32 else Yam s inp wts b k o cw y x else Yam s inp wts b k o cw y x lemma L3 (s:σ) (d P:ل δ) (e:ل ك) (a b:ل δ) (k o g y x f:ٽ) (l:e܆=k) (n:k<1048576) (p:Pچ<4294967296) (j:∀ t,t f+(e[t]!)؟ P[f+(e[t]!)؟]! = Δ s d y x (g+t)) : YaC s d P e a b k o g y x f (Yc P Pچ 0) (Yc a k o) l n p j = Β (k+1) (λ t=>if tif tW (Ν.mp (by rw[K,h];rfl));have d2:Hv≠255:=λ h=>X (Ν.mp (by rw[L,h];rfl));obtain⟨d4,N⟩:=D6 _ _ Z c5 have O:∀ t,t Δ s d y x (g+t)=P[0*Pچ+(f+(e[t]!)؟)]! :=λ t r=>by rw[Ϫ,Λ];exact(q t r).symm apply J3 k _ _ (λ t=>Δ s d y x (g+t)) (λ t=>a[o*k+t]!) _ _ b[o]! (Yp z A b[o]!) n . intro t r;rw[O t r];exact(Zb _).2.2.1 (ϊ (H _ (j t r)).2 (ϰ S d1)) . intro t r;exact(Zb _).2.2.1 (ϊ (J t r).2 (ϰ T d2)) . exact Y . intro t r B;rw[O t r]at B ⊢;exact ZQ u v N (H _ (j t r)) (J t r) B . intro B;have Q:ε b[o]! ≠ 0:=λ h=>B (by rw[h,Ϝ]);exact⟨D Q,(E Q).trans (Nat.sub_le_iff_le_add'.mp N)⟩ . exact E7 s d a b k o g y x . intro t r;have hi:k۞߷=k:=Za _ א have hh:t߷(Ys s t܁).toUInt32)[t]!)؟=Ys s t:=ט def Ya0 (s:σ) (relu:ه) (inp wts b:ل δ):ل δ := if hg:s.kh<=Yb s/\s.kw<=Ya s/\s.cin*(Yb s*Ya s)<=4294967295 /\ s.cin*s.kh*s.kw<1048576 then let P:ل δ:=ډ (s.cin*(Yb s*Ya s)) λ i=>YI s inp i.val let off:ل ك:=ډ (s.cin*s.kh*s.kw) λ t=>(Ys s t.val).toUInt32 let bp:=Yc P Pچ 0 let BW:ل ك:=ډ s.cout λ o=>Yc wts (s.cin*s.kh*s.kw) o.val ډ (s.cout*(s.ho*s.wo)) λ q => act relu (YaC s inp P off wts b (s.cin*s.kh*s.kw) (q.val/(s.ho*s.wo)) 0 (q.val/s.wo%s.ho) (q.val%s.wo) (q.val/s.wo%s.ho*s.stride*Ya s+q.val%s.wo*s.stride) bp BW[q.val/(s.ho*s.wo)]! (by simp [off]) hg.2.2.2 (by simp [P];have:=hg.2.2.1;omega) (λ t ht=>by obtain ⟨hy,hx,-⟩:=Zt s.cout s.ho s.wo q.val q.isLt obtain ⟨w1,-⟩:=E6 s inp hg.1 hg.2.1 _ _ t hy hx ht simp only [P,off,Array.size_ofFn] rw [ZD s _ t ht א] exact w1)) else conv2dWith Yn s relu inp wts b lemma W8:Ya0=conv2dSpec:=by funext s relu a d b;unfold Ya0 conv2dSpec;split . rename_i e;dsimp only;congr 1;funext q;obtain⟨g,h,j⟩:=Zt s.cout s.ho s.wo q܁ q.isLt;rw[Ze s.cout (λ o=>Yc d (s.cin*s.kh*s.kw) o) _ j];congr 1;refine(L3 s a _ _ d b _ _ 0 _ _ _ _ _ _ _ ?_).trans ?_ . intro t f;obtain⟨k,l⟩:=E6 s a e.1 e.2.1 _ _ t g h f;rw[ZD s _ t f א,Λ,Ze _ (λ i=>YI s a i) _ k] exact l . simp . simp only[Zi] def dwF (s:σ) (relu:ه) (inp wts b:ل δ):ل δ := if hg:s.kh<=Yb s/\s.kw<=Ya s/\s.cin*(Yb s*Ya s)<=4294967295 /\ s.kh*s.kw<1048576 then let P:ل δ:=ډ (s.cin*(Yb s*Ya s)) λ i=>YI s inp i.val let off:ل ك:=ډ (s.kh*s.kw) λ t=>(Ys s t.val).toUInt32 let bp:=Yc P Pچ 0 let BW:ل ك:=ډ s.cin λ c=>Yc wts (s.kh*s.kw) c.val ډ (s.cin*(s.ho*s.wo)) λ q => act relu (YaC s inp P off wts b (s.kh*s.kw) (q.val/(s.ho*s.wo)) (q.val/(s.ho*s.wo)*(s.kh*s.kw)) (q.val/s.wo%s.ho) (q.val%s.wo) (q.val/(s.ho*s.wo)*(Yb s*Ya s) + (q.val/s.wo%s.ho*s.stride*Ya s+q.val%s.wo*s.stride)) bp BW[q.val/(s.ho*s.wo)]! (by simp [off]) hg.2.2.2 (by simp [P];have:=hg.2.2.1;omega) (λ t ht=>by obtain ⟨hy,hx,hc⟩:=Zt s.cin s.ho s.wo q.val q.isLt obtain ⟨w1,-⟩:=ZZ s inp _ t _ _ hg.1 hg.2.1 hc ht hy hx simp only [P,off,Array.size_ofFn] rw [ZD s _ t ht א] exact w1)) else depthwiseWith Yn s relu inp wts b lemma W7:dwF=depthwiseSpec:=by funext s relu a d b;unfold dwF depthwiseSpec;split . rename_i e;dsimp only;congr 1;funext q;obtain⟨h,j,f⟩:=Zt s.cin s.ho s.wo q܁ q.isLt;rw[Ze s.cin (λ c=>Yc d (s.kh*s.kw) c) _ f];congr 1;refine(L3 s a _ _ d b _ _ _ _ _ _ _ _ _ _ ?_).trans rfl;intro t g;obtain⟨k,l⟩:=ZZ s a _ t _ _ e.1 e.2.1 f g h j;rw[ZD s _ t g א,Ze _ (λ i=>YI s a i) _ k];exact l . simp only[Zi] lemma W6 (a b:ٽ -> δ) (d:ٽ):∀ r k,(∀ t,k<=t -> t ε (a t)*ε (b t)≠0 -> d<=γ (a t)+γ (b t)) -> Yo a b k r=2^d*Yr a b d k r:=by intro r;induction r with | zero=>intro k _;simp[Yo,Yr] | succ r e => intro k h;rw[Yo,Yr,e (k+1) (λ t f g=>h t א א),ZA _ _ d (h k (le_refl _) א)] ring lemma W5 (K:ٽ) (e f:(t:م) -> t δ) (b a:ٽ -> δ) (k:∀ t h,e t h=b t߷) (l:∀ t h,f t h=a t߷) (d:ق) (q:K<1048576) (n:∀ t,t θ (b t)≠255) (o:∀ t,t θ (a t)≠255) (g:∀ t,t ε (b t)*ε (a t)≠0 -> d˟<=γ (b t)+γ (a t)/\γ (b t)+γ (a t)<=d˟+122) (j:δ) (p:j=Β K b a) : (if YE K۞ e f d ((d˟:پ)-298) 0 0 0 0 0 0 0<ר then (YE K۞ e f d ((d˟:پ)-298) 0 0 0 0 0 0 0)؛ else j) = Β K b a:=by have s:K۞߷=K:=Za _ א have C:=C7 b a d˟ K 0 (λ t _ u r=>g t א r) have x:sv (0:ك)=0:=ד generalize v:Yr b a d˟ 0 K=Srel;have y : -2^191<=Srel:=א have z:Srel<2^191:=א have A:=F8 K۞ e f b a k l d ((d˟:پ)-298) 0 0 א (λ h=>absurd (by decide:ε (0:ك)*ε 0=0) h) K 0 0 0 0 0 0 Srel (by simp[s]) ג ג (λ t _ u r=>by have:=g t א r;exact⟨this.1,by omega⟩) (by simp[Yx]) (by rw[<- v,s,x];simp) y z rw[A];have B:Β K b a=ρ (Srel*2^d˟) (-298) (decide (K≠0)&&Yq b a 0 K):=by rw[Zy K b a (λ t w=>⟨n t w,o t w⟩)];rw[W6 b a d˟ K 0 (λ t _ u r=>(g t א r).1),<- v];ring exact A4 _ _ _ _ _ (λ _=>p) B lemma L0 (B:ل δ) (k n a j:ٽ) (h:(a+k)*n<=Bچ/\jA[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) lemma E5 (A B:ل δ) (k n r a j:ٽ):Yan A B k n r a j=Β k (λ t=>A[r*k+t]!) (λ t=>B[(a+t)*n+j]!):=by unfold Yan;rw[Zi] @[inline] def Ya2 (A B:ل δ) (k n r bk j:ٽ) (ba bb:ك) (hk:k<1048576) : δ := if h:r*k+k<=Aچ/\r*k+k<=4294967295/\((bk+k)*n<=Bچ/\j122 then Yan A B k n r bk j else let r':=YE kڈ (λ t ht=>A.uget ((r*k).toUSize+t) (by have:=Z0 A r k ⟨h.1,h.2.1⟩ t ht rw [this.1];exact this.2)) (λ t ht=>B.uget ((bk*n+j).toUSize+t*nڈ) (by have:=L0 B k n bk j h.2.2 hk t ht rw [this.1];exact this.2)) lo ((loڇ:پ)-298) 0 0 0 0 0 0 0 if r'<0x100000000 then r'.toUInt32 else Yan A B k n r bk j else Yan A B k n r bk j lemma W4 (A B:ل δ) (k n r a j:ٽ) (b:k<1048576):Ya2 A B k n r a j (Yc A k r) (Yc B Bچ 0) b=Β k (λ t=>A[r*k+t]!) (λ t=>B[(a+t)*n+j]!):=by unfold Ya2;split . rename_i e;obtain⟨Lx,Hx,s,Q,F,u⟩:=Zp A k r e.1 e.2.1;obtain⟨Lv,Hv,v,R,G,w⟩:=Zp B Bچ 0 א א;generalize Yc A k r=o at s ⊢;generalize Yc B Bچ 0=p at v ⊢;obtain⟨H,x⟩:=Zo o Lx Hx s א;obtain⟨I,y⟩:=Zo p Lv Hv v א;obtain⟨f,-⟩:=F4 o p 0;obtain⟨g,-⟩:=F3 o p 0;dsimp only;split . exact E5 A B k n r a j . rename_i z;simp only[ἀ,ء,not_or]at z;obtain⟨⟨⟨J,K⟩,L⟩,M⟩:=id z;have N:Hx≠255:=λ h=>J (Ν.mp (by rw[x,h];rfl));have O:Hv≠255:=λ h=>K (Ν.mp (by rw[y,h];rfl));obtain⟨S,P⟩:=D6 _ _ L M rw[x,y]at g;rw[H,I]at f;have C:∀ t,t (a+t)*n+j B[(a+t)*n+j]! = B[0*Bچ+((a+t)*n+j)]! := by simp apply W5 k _ _ (λ t=>A[r*k+t]!) (λ t=>B[(a+t)*n+j]!) _ _ (Yp o p 0) b . intro t d;exact(Zb _).2.2.1 (ϊ (u t d).2 (ϰ F N)) . intro t d;rw[D t d];exact(Zb _).2.2.1 (ϊ (w _ (C t d)).2 (ϰ G O)) . intro t d E;rw[D t d]at E ⊢;exact ZQ f g P (u t d) (w _ (C t d)) E . exact E5 A B k n r a j . intro t d;obtain⟨l,q⟩:=Z0 A r k ⟨e.1,e.2.1⟩ t d;show A[((r*k)۞+t)߷]=_;rw[<- ذ A _ (by rw[l];exact q)];simp only[l] . intro t d;obtain⟨l,q⟩:=L0 B k n a j e.2.2 b t d;show B[((a*n+j)۞+t*n۞)߷]=_;rw[<- ذ B _ (by rw[l];exact q)];simp only[l] . exact E5 A B k n r a j def Ya3 (batch m k n:ٽ) (A B:ل δ):ل δ := if hk:k<1048576 then let bb:=Yc B Bچ 0 let BA:ل ك:=ډ (batch*m) λ r=>Yc A k r.val YT (batch*m) n λ r j=>Ya2 A B k n r (r/m*k) j BA[r]! bb hk else gemmWith Yn batch m k n A B lemma Zc0:Ya3=gemmSpec:=by funext batch m k n A B;unfold Ya3 gemmSpec;split . rename_i a;rw[ZB _ _ _ (ϡ _ _ _)];congr 1;funext q;have b:∀ v:ٽ,v/n=v/(m*n)*m+v/n%m:=by intro v;rw[ό m n,<- Ϡ];exact(Ϻ _ _).symm have d:∀ v:ٽ,v/n/m=v/(m*n):=by intro v;rw[Ϡ,ό n m] rw[d q܁];conv_lhs=>rw[b q܁] obtain⟨f,g,h⟩:=Zt batch m n q܁ q.isLt;have e:q܁/(m*n)*m+q܁/n%mYc A k r) _ e];exact W4 A B k n _ _ _ a . simp only[Zi] section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Numerics open Model open RationalBinary (floorLog2 scaleByPowerOfTwo scaleByPowerOfTwo_snd_ne_zero) open FloatLib.Numerics (binaryRadix Radix.toReal) lemma bz (e:پ):bpow e=(2:ℝ)^e:=by simp[bpow,FloatLib.Floats.Formats.Flocq.bpow,binaryRadix,Radix.toReal] lemma cW (w:ك):π (NativeBinary32.ofUInt32 w)=w:=by simp only[toWord,NativeBinary32.ofUInt32,toNatBits,ofBits];exact UInt32.ofNat_toNat lemma cU {a b:پ} {v:ℝ} (d:bpow a<=v) (e:v roundQuotientEven (scaleByPowerOfTwo n d x).1 (scaleByPowerOfTwo n d x).2= roundQuotientEven (scaleByPowerOfTwo a b r).1 (scaleByPowerOfTwo a b r).2:=λ x r h=>by apply roundQuotientEven_eq_of_rat_eq _ _ _ _ (scaleByPowerOfTwo_snd_ne_zero _ _ _ k) (scaleByPowerOfTwo_snd_ne_zero _ _ _ l);rw[scaleByPowerOfTwo_real,scaleByPowerOfTwo_real];rwa[mul_assoc,<- bpow_add,mul_assoc,<- bpow_add,add_sub_cancel,add_sub_cancel]at h rw[roundRatScaled_false_eq_of_isIEEE f n d e o p k,roundRatScaled_false_eq_of_isIEEE f a b g o q l];simp only[];rw[u _ (g+Int.ofNat (FloatFormat.subnormalAlignExp f)) (by rw[j];ring_nf),u _ (Int.ofNat f؉-floorLog2 a b) (by rw[j,show Int.ofNat f؉-floorLog2 n d-e=Int.ofNat f؉-floorLog2 a b-g by omega]),y] lemma K9 (Q:ℚ) (s:ه) (N D:ٽ) (E:پ) (b:0 0simp_all obtain rfl:Q=0:=by simp[a] simp[roundRatScaled_num_zero _ _ _ _ b.ne'];rfl have g:(0:ℚ)simp[neg_div] have h:Q.num.natAbs≠0:=by simpa using (show Q≠0 by rw[a];cases s<;>simp[g.ne']) have k:(0:ℝ)push_cast<;>simp[abs_of_pos k] rw[show decide (Q<0)=s by rw[a];cases s<;>simp[g,not_lt.mpr g.le]];cases s . exact cV _ e _ _ _ _ _ _ h Q.den_nz f b.ne' j . rw[roundRatScaled_true_eq_neg_false _ _ _ _ e Q.den_nz,roundRatScaled_true_eq_neg_false _ _ _ _ e b.ne',cV _ e _ _ _ _ _ _ h Q.den_nz f b.ne' j] lemma Zc1 (q u D r:ٽ) (d:2<=u) (e:u%2=0) (f:0.trans (by push_cast;ring) . rw[bpow_natCast];push_cast;rw[pow_succ];linarith . rw[show((q۩+1:ℕ):ℤ)+1=((q۩+2:ℕ):ℤ) by push_cast;ring,bpow_natCast];push_cast;rw[show q۩+2=(q۩+1)+1 by ring,pow_succ];linarith lemma Zc3 (s:ه) (N D:ٽ) (E:پ) (a:0simp[n,j]<;>omega . have:¬ ((q۩:ℤ)+Esimp[j]<;>omega end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Floats.Formats.Flocq open Float.Model.UnpackedFloat open FloatLib.Numerics (binaryRadix Radix.toReal) lemma Zc4 (q:ℚ) (b a:ٽ) (e:پ) (d:0(x:ℝ)) g;push_cast at this;rw[this,t] rw[u,Real.sqrt_mul (by exact_mod_cast d.le),Real.sqrt_sq ה];simp only[bpow,binaryRadix,Radix.toReal] push_cast;rw[mul_assoc,<- zpow_add₀ (by norm_num:(2:ℝ)≠0)];simp rw[s]at n o;have v:(nearestEven (scaledMantissa binaryRadix (Model.fexpOf κ) (Real.sqrt (q:ℝ))))٪ = (shiftToTargetExponent (ώ κ) (Ψ b a) e (Ϭ b a)).1.roundedMantissa:=by rw[o,<- r];simp have w:(shiftToTargetExponent (ώ κ) (Ψ b a) e (Ϭ b a)).2=(ώ κ).targetExponent (ἴ (Ψ b a) e):=by rw[Model.shiftToTargetExponent_eq_of_le_targetExponent Fmt _ e _ l] simp only[sqrtMathWord,p,ؠ,n,v];rw[Model.roundWithAccuracy_eq_finishRoundedMantissa];rw[w] end @[inline] def Y2 (x:ل δ) (base n:ٽ):ٽ := (Τ n).foldl (λ b j => let w:=x[base+j]! if ε w=0 then b else min b (γ w)) 255 @[inline] def Y6 (x:ل δ) (base n b0:ٽ):ل ٽ := (Τ n).foldl (λ a j => let w:=x[base+j]! ϗ a (ε w*ε w).toUInt64 (2*(γ w-b0))) (Υ 18 0) @[inline] def Y7 (x:ل δ) (base n b0:ٽ):ل ٽ × ل ٽ := (Τ n).foldl (λ pq j => let w:=x[base+j]! if η w then (pq.1,ϗ pq.2 (ε w).toUInt64 (γ w-b0)) else (ϗ pq.1 (ε w).toUInt64 (γ w-b0),pq.2)) (Υ 18 0,Υ 18 0) @[inline] def sqA (num den root:ٽ):ٽ:= if num=root*root*den then 0 else if 4*num δ):δ := let t:پ:=(47-(num0.log2:پ)+m.log2+1)/2 let num:=if 0<=t then num0<<<(2*tڇ) else num0 let den:=if 0<=t then m else m<<<(2*(-t).toNat) let root:=Ψ num den if 8388608<=root then sqW num den root (h-t) else fallback () @[inline] def YF (b0 ie:ٽ):ٽ:=min (2*b0) (ie+149)/2*2 @[inline] def YaE (x:ل δ) (n:ٽ) (eps:δ) (r:ٽ):δ := let b0:=Y2 x (r*n) n let c:=YF b0 (γ eps) YaD (limbValA (Y6 x (r*n) n b0)<<<(2*b0-c) + (n*ε eps)<<<(γ eps+149-c)) n (((c:پ)-298)/2) λ _=>ἆ (ϭ n x r 0+ς eps) @[inline] def Y8 (x:ل δ) (n:ٽ) (eps:δ) (r:ٽ):ٽ × پ × δ := let b0:=Y2 x (r*n) n let pq:=Y7 x (r*n) n b0 let S1:پ:=(limbValA pq.1:پ)-limbValA pq.2 let T:پ:=(n:پ)*limbValA (Y6 x (r*n) n b0)-S1*S1 let c:=YF b0 (γ eps) (b0,S1,YaD (Tڇ<<<(2*b0-c)+(n*n*ε eps)<<<(γ eps+149-c)) (n*n) (((c:پ)-298)/2) λ _ => ἆ (ϭ n x r (rowMean n x r)+ς eps)) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat lemma iB (w:δ):γ w<=254:=by have:=expOf_toNat_lt w;unfold idxOf;split_ifs<;>omega lemma lS (m k:ٽ -> ٽ) (d:∀ j,m j<2^64) (e:∀ j,k j/32+1<18) (l:List ٽ) (a:ل ٽ) (b:a܆=18) : (l.foldl (λ a j=>ϗ a (m j)؝ (k j)) a)܆=18 /\ Ϗ (l.foldl (λ a j=>ϗ a (m j)؝ (k j)) a)֍=Ϗ a֍+(l.map λ j=>m j*2^k j).sum:=by induction l generalizing a with | nil=>simp[b] | cons j l f=>simp;obtain⟨g,h⟩:=f (ϗ a (m j)؝ (k j)) (by rw[addLimbs64_size];exact b);refine⟨g,?_⟩;rw[h,addLimbs64_eq _ _ _ (d j),addLimbs_val _ _ _ (by rw[b];exact e j)];ring lemma lP (x:ل δ) (a b:ٽ) (f:ل ٽ × ل ٽ -> ٽ -> ل ٽ × ل ٽ) (d:∀ e j,f e j=if η x[a+j]! then (e.1,ϗ e.2 (ε x[a+j]!)؝ (γ x[a+j]! - b)) else (ϗ e.1 (ε x[a+j]!)؝ (γ x[a+j]! - b),e.2)) (l:List ٽ):∀ p q,p܆=18 -> q܆=18 -> (l.foldl f (p,q)).1چ=18 /\ (l.foldl f (p,q)).2چ=18/\((Ϗ (l.foldl f (p,q)).1.toList:پ) - Ϗ (l.foldl f (p,q)).2.toList)=(Ϗ p֍:پ)-Ϗ q֍+(l.map λ j=>sv x[a+j]! * 2^(γ x[a+j]! - b)).sum:=by induction l with | nil=>intro p q g h;simp[g,h] | cons j l s => intro p q g h;simp only[ἧ,List.map_cons,List.sum_cons,d];have t:=ϖ x[a+j]!;have u:=iB x[a+j]!;by_cases k:η x[a+j]! = true . simp only[k,ת];obtain⟨n,o,r⟩:=s p (ϗ q (ε x[a+j]!)؝ (γ x[a+j]! - b)) g (by rw[addLimbs64_size];exact h) refine⟨n,o,?_⟩;rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by rw[h];omega)];simp only[sv,k,ת];push_cast;ring . simp only[k,χ,ؠ];obtain⟨n,o,r⟩:=s (ϗ p (ε x[a+j]!)؝ (γ x[a+j]! - b)) q (by rw[addLimbs64_size];exact g) h refine⟨n,o,?_⟩;rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by rw[g];omega)];simp only[sv,k,χ,ؠ];push_cast;ring lemma fS (f:ٽ -> ℚ) (l:List ٽ) (a:ℚ):l.foldl (λ t j=>t+f j) a=a+(l.map f).sum:=by induction l generalizing a with | nil=>simp | cons j l b=>simp[ἧ,b,add_assoc] lemma A0 (a b:ٽ):Ϭ a b=Float.Model.UnpackedFloat.accuracyOfFraction (sqA a b (Ψ a b)) 4:=by unfold sqrtAccuracy sqA;dsimp only;simp only[sq];split_ifs<;>rfl lemma H8 (N d:ٽ):N/d<=ἅ N d /\ ἅ N d<=N/d+1:=by unfold FloatLib.Numerics.roundQuotientEven;dsimp only;split_ifs<;>omega lemma H4:κ؉=23/\Model.pow2 κ؉=8388608/\Model.pow2 (κ؉+1)=16777216/\FloatFormat.ieeeMinNormalExponent κ = -126/\ Int.ofNat (FloatFormat.ieeeMaxNormalExponent κ)=127/\Int.ofNat Fmt.bias=127:=ד lemma QW (E F:ٽ):π (Model.NativeBinary32.ofUInt32 (Ϥ false E F))=Ϥ false E F:=by simp only[toWord,Model.NativeBinary32.ofUInt32,Model.toNatBits,Model.ofBits];exact UInt32.ofNat_toNat lemma H3 (r:ٽ) (k:پ) (b:8388608<=r) (d:r<16777216) (e:-126<=k) (a:k<=127) : π (Model.ofModel κ (Model.finishRoundedMantissa (ώ κ) .positive (r,k-23)))=Ϥ false (k+127)٪ (r-8388608):=by obtain⟨j,g,f,hmin,hmax,o⟩:=H4;have l:=Model.finishRoundedMantissa_normalized κ .positive r k (by rw[g];exact b) (by rw[f];exact d) (by rw[hmin];exact e) rw[show(k-23:Int)=k-(Fmt؉:Int) by rw[j];rfl,l] have n:=Model.ofModel_finite_normalized_eq_ofFields κ false r k (by rw[g];exact b) (by rw[f];exact d) (by rw[hmin];exact e) (by rw[hmax];exact a) erw [n];have h:=QW (k+127)٪ (r-8388608);rw[Model.NativeBinary32.ofUInt32_mkBits]at h;exact h lemma H5 (k:پ) (b:-126<=k) (a:k+1<=127) : π (Model.ofModel κ (Model.finishRoundedMantissa (ώ κ) .positive (16777216,k-23)))=Ϥ false (k+1+127)٪ 0:=by obtain⟨f,g,d,hmin,hmax,l⟩:=H4;have h:=Model.finishRoundedMantissa_normalized_carry κ .positive k (by rw[hmin];exact b) rw[show(k-23:Int)=k-(Fmt؉:Int) by rw[f];rfl,show(16777216:ٽ)=Model.pow2 (κ؉+1) from d.symm,h] have j:=Model.ofModel_finite_normalized_eq_ofFields κ false (Model.pow2 κ؉) (k+1) le_rfl (by rw[g,d];decide) (by rw[hmin];omega) (by rw[hmax];exact a) erw [j];have e:=QW (k+1+127)٪ 0;rw[Model.NativeBinary32.ofUInt32_mkBits]at e;exact e theorem A3 (b d:ٽ) (e:پ):sqW b d (Ψ b d) e=π (Model.ofModel κ (Float.Model.UnpackedFloat.roundWithAccuracy (ώ κ) .positive (Ψ b d) e (Ϭ b d))):=by have l:=A0 b d;unfold sqW;generalize Ψ b d=root at l ⊢;have j:(ώ κ).mantissaBits=24:=ד have k:(ώ κ).minExponent = -149:=ד by_cases u:root<16777216;on_goal 1=>simp only[u,ת,Nat.cast_zero,add_zero] on_goal 2=>simp only[u,ؠ,Nat.cast_one] all_goals split;on_goal 2=>rfl rename_i v;obtain⟨w,x,A,y,z⟩:=v;have n:sqA b d root<4:=by unfold sqA;split_ifs<;>omega generalize sqA b d root=a at l n ⊢;rw[l];have g:=Model.roundWithAccuracy_quotient_eq_finishRoundedMantissa (ώ κ) .positive (4*root+a) 4 e ב rw[show(4*root+a)/4=root by omega,show(4*root+a)%4=a by omega]at g have f:root≠0:=א · have o:=(Nat.le_log2 f).mpr (show 2^23<=root by omega) have p:=(Nat.log2_lt f).mpr (show root<2^24 by omega) have h:((ώ κ).targetExponent (ἴ root e) - e)٪=0:=by simp only[Float.Model.Format.targetExponent,Float.Model.totalExponent,j,k];omega rw[g];dsimp only;rw[h];simp only[pow_zero,mul_one,Nat.cast_zero,add_zero];obtain⟨q,s⟩:=H8 (4*root+a) 4;generalize ἅ (4*root+a) 4=r at q s ⊢;split · rename_i t;subst t;rw[show e=(e+23)-23 by ring,H5 (e+23) א א];congr 2;omega · rw[show e=(e+23)-23 by ring,H3 r (e+23) א א א א];congr 2;omega · have o:=(Nat.le_log2 f).mpr (show 2^24<=root by omega) have p:=(Nat.log2_lt f).mpr (show root<2^25 by omega) have h:((ώ κ).targetExponent (ἴ root e) - e)٪=1:=by simp only[Float.Model.Format.targetExponent,Float.Model.totalExponent,j,k];omega rw[g];dsimp only;rw[h];simp only[pow_one,Nat.cast_one];obtain⟨q,s⟩:=H8 (4*root+a) (4*2);generalize ἅ (4*root+a) (4*2)=r at q s ⊢;split · rename_i t;subst t;rw[show e+1=(e+24)-23 by ring,H5 (e+24) א א];congr 2;omega · rw[show e+1=(e+24)-23 by ring,H3 r (e+24) א א א א];congr 2;omega lemma K7 (a m:ٽ) (h:پ) (q:ℚ) (d:0ἆ q)=ἆ q:=by unfold YaD;simp only[A3];generalize (47-((a۩:ٽ):پ)+(m۩:ٽ)+1)/2=t;have e:∀ k:ٽ,(2:ℚ)^(2*k)=4^(k:ℤ):=λ k=>by rw[pow_mul,ا];norm_num by_cases g:0<=t<;>simp only[g,ת,ؠ]<;>split_ifs with j<;>try rfl all_goals refine Zc4 q _ _ _ d (by first | exact b | (rw[υ];exact ύ b ה)) ?_ (by rw[show(2:Nat)^23=8388608 by norm_num];exact j) all_goals rw[<- f,show -(h-t)=t-h by ring,zpow_sub₀ ב];simp only[υ] all_goals push_cast;rw[e,Int.toNat_of_nonneg א];field_simp [zpow_neg] all_goals rw[mul_assoc,<- zpow_add₀ ב];simp lemma Zc7 (w:δ):(sv w:ℚ)^2=(ε w:ℚ)^2:=by unfold sv;split_ifs<;>push_cast<;>ring lemma K6 (a:δ) (b:0<ς a):ς a=(ε a:ℚ)*2^((γ a:ℤ)-149):=by have h:=b;simp only[rationalWord,ϕ]at h ⊢;unfold sv at h ⊢;split_ifs at h ⊢ with d . have:(0:ℚ)<=2^((γ a:ℤ)-149):=ה push_cast at h;nlinarith [show(0:ℚ)<=ε a by positivity] . push_cast;ring lemma K5 (x:ل δ) (n r a:ٽ) (b:∀ j a<=γ x[r*n+j]!) : (limbValA (Y6 x (r*n) n a):ℚ)*2^((2*a:ℤ)-298)=((Τ n).map λ j=>(ς x[r*n+j]!)^2).sum:=by unfold Y6;rw[limbValA_eq,(lS (λ j=>mantOf x[r*n+j]! * mantOf x[r*n+j]!) (λ j=>2*(γ x[r*n+j]! - a)) (λ j=>by have:=ϖ x[r*n+j]!;nlinarith) (λ j=>by have:=iB x[r*n+j]!;omega) _ _ ג).2] have e:Ϗ (Υ 18 0)֍=0:=ד rw[e,zero_add,Nat.cast_list_sum,List.map_map,<- List.sum_map_mul_right];congr 1;apply List.map_congr_left;intro j f;have g:=List.mem_range.1 f;simp only[Function.comp,rationalWord,ϕ];by_cases d:ε x[r*n+j]! = 0 . simp[d,sv] . have h:=b j g d;have k:((2:ℚ)^((γ x[r*n+j]! : ℤ)-149))^2=(2:ℚ)^(2*(γ x[r*n+j]! - a))*2^((2*a:ℤ)-298):=by rw[<- ا (2:ℚ) (2*(idxOf x[r*n+j]! - a)),<- zpow_add₀ ב,<- ا _ 2,<- zpow_mul] congr 1;push_cast [h];ring rw[mul_pow,Zc7,k];push_cast;ring lemma K4 (x:ل δ) (n r a:ٽ) (b:∀ j a<=γ x[r*n+j]!) : (((limbValA (Y7 x (r*n) n a).1:ℤ)-limbValA (Y7 x (r*n) n a).2:ℤ):ℚ)*2^((a:ℤ)-149)=((Τ n).map λ j=>ς x[r*n+j]!).sum:=by unfold Y7;rw[limbValA_eq,limbValA_eq,(lP x (r*n) a _ (λ _ _=>rfl) (Τ n) _ _ ג ג).2.2] have e:Ϗ (Υ 18 0)֍=0:=ד rw[e];push_cast;rw[zero_add,List.map_map,<- List.sum_map_mul_right];congr 1;apply List.map_congr_left;intro j f;simp only[Function.comp,rationalWord,ϕ];push_cast;by_cases d:ε x[r*n+j]! = 0 . simp[d,sv] . have g:=b j (List.mem_range.1 f) d;rw[mul_assoc,<- ا,<- zpow_add₀ ב];push_cast [g];ring lemma sm (f:ٽ -> ℚ) (μ:ℚ) (l:List ٽ):(l.map λ j=>(f j-μ)^2).sum=(l.map λ j=>f j^2).sum-2*μ*(l.map f).sum+l.length*μ^2:=by induction l with | nil=>simp | cons j l a=>simp only[List.map_cons,List.sum_cons,List.length_cons,a];push_cast;ring lemma Z2 (x:ل δ) (d n j:ٽ) (e:jif ε x[d+j]! = 0 then b else min b (γ x[d+j]!)) b<=b /\ ∀ k ∈ l,ε x[d+k]! ≠ 0 -> l.foldl (λ b j=>if ε x[d+j]! = 0 then b else min b (γ x[d+j]!)) b<=γ x[d+k]! from (H _ 255).2 j (List.mem_range.2 e) f intro l;induction l with | nil=>intro b;simp | cons a l p => intro b;simp only[ἧ];obtain⟨h,q⟩:=p (if ε x[d+a]! = 0 then b else min b (γ x[d+a]!));refine⟨le_trans h (by split_ifs<;>omega),λ k g o=>?_⟩;rcases List.mem_cons.1 g with rfl | g . exact le_trans h (by simp[o]) . exact q k g o lemma Zc9 (a b:ٽ):YF a b<=2*a/\YF a b<=b+149 /\ (4:ℚ)^(((YF a b:ℤ)-298)/2)=2^((YF a b:ℤ)-298):=by unfold YF;refine⟨by omega,by omega,?_⟩;rw[show(4:ℚ)=2^(2:ℤ) by norm_num,<- zpow_mul];congr 1;omega lemma K3 (A n a b d:ٽ) (e:0 Y2 x (r*n) n<=γ x[r*n+j]! := λ j k l=>Z2 x (r*n) n j k l generalize Y2 x (r*n) n=e at f ⊢;have g:=K5 x n r e f;generalize limbValA (Y6 x (r*n) n e)=A at g ⊢;have h:ϭ n x r 0=(A:ℚ)*2^((2*e:ℤ)-298)/n:=by unfold rowVariance;rw[fS (λ j=>(rationalWord x[r*n+j]! - 0)^2)];simp;rw[g] have o:0<ϭ n x r 0+ς a:=by rw[h];positivity refine K7 _ _ _ _ o b ?_;rw[h,K6 a d];exact K3 A n e (γ a) (ε a) b lemma K2 (n:ٽ) (x:ل δ) (r:ٽ) (μ:ℚ):0<=ϭ n x r μ:=by unfold rowVariance;rw[fS (λ j=>(rationalWord x[r*n+j]! - μ)^2),zero_add];exact div_nonneg (List.sum_nonneg λ a b=>by obtain⟨j,_,rfl⟩:=List.mem_map.1 b;positivity) (Nat.cast_nonneg _) lemma S9 (x:ل δ) (n:ٽ) (a:δ) (r:ٽ) (b:0 Y2 x (r*n) n<=γ x[r*n+j]! := λ j l o=>Z2 x (r*n) n j l o have f:=K5 x n r _ h;have g:=K4 x n r _ h;have p:=K2 n x r (rowMean n x r);rw[K6 a d];have q:ϭ n x r (rowMean n x r)=(((Τ n).map λ j=>(ς x[r*n+j]!)^2).sum - 2*rowMean n x r*((Τ n).map λ j=>ς x[r*n+j]!).sum + n*rowMean n x r^2)/n:=by unfold rowVariance;rw[fS (λ j=>(rationalWord x[r*n+j]! - rowMean n x r)^2),zero_add,sm,List.length_range] have s:rowMean n x r=((Τ n).map λ j=>ς x[r*n+j]!).sum/n:=by unfold rowMean;rw[fS (λ j=>rationalWord x[r*n+j]!),zero_add] generalize Y2 x (r*n) n=e at f g ⊢;generalize limbValA (Y6 x (r*n) n e)=A at f ⊢;generalize ((limbValA (Y7 x (r*n) n e).1:ℤ)-limbValA (Y7 x (r*n) n e).2)=S1 at g ⊢;have k:ϭ n x r (rowMean n x r)=(((n:ℤ)*A-S1*S1:ℤ):ℚ)*((2:ℚ)^((2*e:ℤ)-298)/(n*n)):=by rw[q,s,<- f,<- g,show(2:ℚ)^((2*e:ℤ)-298)=(2^((e:ℤ)-149))^2 by rw[<- ا _ 2,<- zpow_mul];congr 1;ring] push_cast;field_simp;ring have t:0<=(n:ℤ)*A-S1*S1:=by have:=p;rw[k]at this;exact_mod_cast nonneg_of_mul_nonneg_left this (div_pos ה (by exact_mod_cast ύ b b)) rw[K3 _ (n*n) e (idxOf a) (mantOf a) (ύ b b),k,show((((n:ℤ)*A-S1*S1)٪:ℕ):ℚ)=(((n:ℤ)*A-S1*S1:ℤ):ℚ) by exact_mod_cast Int.toNat_of_nonneg t] push_cast;ring lemma S8 (x:ل δ) (n:ٽ) (a:δ) (r:ٽ) (b:0rationalWord x[r*n+j]!),zero_add,<- K4 x n r _ (λ j d e=>Z2 x (r*n) n j d e)] end @[inline] def YaF (w:δ) (b:ٽ):پ:=sv w<<<(γ w-b) @[inline] def elR (w gw dw:δ):δ := if sv dw<=0 then roundRational (ς w*ς gw/ς dw) else let P:=sv w*sv gw Model.NativeBinary32.roundRatScaled (P<0) P.natAbs (ε dw) ((γ w:پ)+γ gw-γ dw-149) @[inline] def elL (n:ٽ) (w gw bw:δ) (b0:ٽ) (S1:پ) (dw:δ) (mean:Unit -> ℚ):δ := if sv dw<=0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let P:=((n:پ)*YaF w b0-S1)*sv gw<<<(b0+γ gw-c2) + (n:پ)*sv bw*sv dw<<<(γ bw+γ dw-c2) Model.NativeBinary32.roundRatScaled (P<0) P.natAbs (n*ε dw) ((c2:پ)-149-γ dw) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats lemma eD (d:δ) (h:¬sv d<=0):sv d=ε d/\0 < ε d:=by have a:η d=false:=by by_contra c;simp at c;exact h (by simp[sv,c]) have:sv d=ε d:=by simp[sv,a] exact⟨this,by omega⟩ lemma eP (P:ℤ):(if decide (P<0)=true then -((P.natAbs:ℕ):ℚ) else (P.natAbs:ℚ))=P:=by rw[Nat.cast_natAbs];split_ifs with c<;>simp at c . rw[abs_of_neg (by exact_mod_cast c)];push_cast;ring . rw[abs_of_nonneg (by exact_mod_cast c)] lemma S7 (w a b:δ):elR w a b=roundRational (ς w*ς a/ς b):=by unfold elR;split_ifs with h;· rfl obtain⟨e,f⟩:=eD b h;refine(K9 _ _ _ _ _ f (λ p=>by simp at p;omega) ?_).symm simp only[rationalWord,ϕ,e];rw[eP];have d:(2:ℚ)≠0:=ג rw[show((idxOf w:ℤ)+idxOf a-idxOf b-149)=((idxOf w:ℤ)-149)+((idxOf a:ℤ)-149)-((idxOf b:ℤ)-149) by ring,zpow_sub₀ d (((idxOf w:ℤ)-149)+((idxOf a:ℤ)-149)) ((idxOf b:ℤ)-149),zpow_add₀ d ((idxOf w:ℤ)-149) ((idxOf a:ℤ)-149)] push_cast;field_simp lemma S6 (n:ٽ) (w e f:δ) (b:ٽ) (g:پ) (d:δ) (a:Unit -> ℚ) (j:0 b<=γ w) (l:a ()=(g:ℚ)*2^((b:پ)-149)/n) : elL n w e f b g d a=roundRational ((ς w-a ())*ς e/ς d+ς f):=by unfold elL;split_ifs with h;· rfl obtain⟨r,s⟩:=eD d h refine(K9 _ _ _ _ _ (ύ j s) (λ p=>by simp at p;omega) ?_).symm simp only[rationalWord,ϕ,l];rw[eP] generalize q:min (b+γ e) (γ f+γ d)=c have t:c<= b+γ e:=q▸min_le_left _ _;have u:c<= γ f+γ d:=q▸min_le_right _ _ simp only[YaF,Int.shiftLeft_eq,r];push_cast have o:(2:ℚ)≠0:=ג have v:(sv w:ℚ)*2^((γ w:ℤ)-149)=sv w*2^(γ w-b)*2^((b:ℤ)-149):=by by_cases m:ε w=0;· simp[sv,m] rw[mul_assoc,<- ا,<- zpow_add₀ o];push_cast [k m];ring have x:(2:ℚ)^((b:ℤ)-149)*2^((γ e:ℤ)-149)=2^((c:ℤ)-149-γ d)*2^((γ d:ℤ)-149)*2^(b+γ e-c):=by rw[<- ا,<- zpow_add₀ o,<- zpow_add₀ o,<- zpow_add₀ o];push_cast [t];ring have y:(2:ℚ)^((γ f:ℤ)-149)=2^((c:ℤ)-149-γ d)*2^(γ f+γ d-c):=by rw[<- ا,<- zpow_add₀ o];congr 1;push_cast [u];ring rw[v,y];field_simp;linear_combination (((n:ℚ)*sv w*2^(γ w-b)-g)*sv e)*x end @[inline] def p2 (k:ٽ):ٽ:=if k<63 then ((1:ق)<< ه | .ofNat s=>aa*p2 (s+1) ه | .ofNat s=>a>=b*p2 s | .negSucc s=>a*p2 (s+1)>=b @[inline] def fl2 (a b:ٽ):پ := let i:پ:=Int.ofNat (lg a)-Int.ofNat (lg b) let l:=if lt2 a b i then i-1 else i if ge2 a b (l+1) then l+1 else l @[inline] def sc2 (a b:ٽ):پ -> ٽ × ٽ | .ofNat s=>(a*p2 s,b) | .negSucc s=>(a,b*p2 (s+1)) @[inline] def YN (s:ه) (N D:ٽ) (E:پ):ك := if D==0 then 0x7fc00000 else if N==0 then if s then 0x80000000 else 0 else let r:=fl2 N D let t:=r+E if t>127 then if s then 0xff800000 else 0x7f800000 else if t < -150 then if s then 0x80000000 else 0 else if t < -126 then let c:=sc2 N D (E+149) let f:=ἅ c.1 c.2 if f==0 then if s then 0x80000000 else 0 else match Nat.decLe 8388608 f with | isTrue _=>Ϥ s 1 0 | isFalse _=>Ϥ s 0 f else let c:=sc2 N D (23-r) let m:=ἅ c.1 c.2 let k:=m==16777216 let x:=if k then t+1 else t let y:=if k then 8388608 else m if x>127 then if s then 0xff800000 else 0x7f800000 else Ϥ s (Int.toNat (x+127)) (y-8388608) @[inline] def Yap (sa:ه) (a:ٽ) (sb:ه) (b:ٽ):ه × ٽ := if sa==sb then (sa,a+b) else if b<=a then (sa,a-b) else (sb,b-a) @[inline] def Ya7 (w gw dw:δ):δ := if sv dw<=0 then roundRational (ς w*ς gw/ς dw) else let Pn:=ε w*ε gw YN (η w != η gw&&Pn != 0) Pn (ε dw) ((γ w:پ)+γ gw-γ dw-149) @[inline] def Y3 (s1:ه) (q1 r1:ٽ) (s2:ه) (B D:ٽ):ه × ٽ × ٽ := if s1==s2 then (s1,q1+B,r1) else if B<=q1 then (s1,q1-B,r1) else if r1=0 then (s2,B-q1,0) else (s2,B-q1-1,D-r1) @[inline] def Ya8 (s:ه) (M:ق) (E:پ):ك := let L:=Yj M let t:=(Lڇ:پ)+E if M=0\/L<24\/t < -126 then YN s Mڇ 1 E else let m:=(YK M L).toNat let k:=m==16777216 let x:=if k then t+1 else t let y:=if k then 8388608 else m if x>127 then if s then 0xff800000 else 0x7f800000 else Ϥ s (Int.toNat (x+127)) (y-8388608) @[inline] def Ya9 (s:ه) (M:ٽ) (E:پ):ك:=if M>>>62=0 then Ya8 s M.toUInt64 E else YN s M 1 E @[inline] def Yba (n:ٽ) (w gw bw:δ) (b0:ٽ) (S1:پ) (dw:δ) (mean:Unit -> ℚ):δ := if sv dw<=0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let c:=Yap (η w) (n*(ε w*p2 (γ w-b0))) (!(S1<0)) S1.natAbs let D:=n*ε dw let r0:=c.2%D*ε gw let k1:=p2 (b0+γ gw-c2) let ra:=r0%D*k1 let Q:=Y3 (c.1 != η gw) ((c.2/D*ε gw+r0/D)*k1+ra/D) (ra%D) (η bw) (ε bw*p2 (γ bw+γ dw-c2)) D if 16777216<=Q.2.1 then Ya9 Q.1 (2*Q.2.1+(if Q.2.2=0 then 0 else 1)) ((c2:پ)-150-γ dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:پ)-149-γ dw) lemma ZE (k:ٽ):p2 k=2^k:=by unfold p2;split . rename_i h;have a:k؝˟=k:=UInt64.toNat_ofNat_of_lt' (by unfold UInt64.size;omega);rw[Ρ,a,ν (by omega:k<64),UInt64.toNat_one,Nat.one_shiftLeft] exact ν (Nat.pow_lt_pow_right ב א) . rfl lemma S5 (n:ٽ):lg n=n۩:=by unfold lg;dsimp only;split . rename_i h;by_cases a:n؝=0 . have:n=0:=by rw[<- h,a];rfl subst this;decide . rw[Zj _ a,h] . rfl lemma S4 (a b:ٽ) (e:پ):lt2 a b e=FloatLib.Numerics.RationalBinary.lessThanPowerOfTwo a b e:=by cases e<;>simp[lt2,FloatLib.Numerics.RationalBinary.lessThanPowerOfTwo,ZE,υ] lemma S3 (a b:ٽ) (e:پ):ge2 a b e=FloatLib.Numerics.RationalBinary.atLeastPowerOfTwo a b e:=by cases e<;>simp[ge2,FloatLib.Numerics.RationalBinary.atLeastPowerOfTwo,ZE,υ] lemma S2:sc2=FloatLib.Numerics.RationalBinary.scaleByPowerOfTwo:=by funext a b e;cases e<;>simp[sc2,FloatLib.Numerics.RationalBinary.scaleByPowerOfTwo,ZE,υ] lemma K1:fl2=FloatLib.Numerics.RationalBinary.floorLog2:=by funext a b;simp only[fl2,FloatLib.Numerics.RationalBinary.floorLog2,S5,S4,S3] lemma E4 (s:ه) (N D:ٽ) (E:پ):YN s N D E=Model.NativeBinary32.roundRatScaled s N D E:=by unfold YN;rw[K1,S2];rfl lemma R9 (s:ه) (M:ق) (E:پ):Ya8 s M E=YN s M˟ 1 E:=by unfold Ya8;dsimp only;split . rfl . rename_i h;simp only[not_or,UInt64.not_lt]at h;obtain⟨a,k,o⟩:=h;have d:M˟≠0:=λ e=>a (ο.mp (by simpa using e)) have f:=Zj M a;have p:24<=M˟۩:=by rw[<- f];exact(Κ).mp k obtain⟨g,_,_⟩:=Z7 M a;rw[if_pos (show Fmt؉<=M˟۩ by show 23<=_;omega)]at g rw[g,FloatLib.Numerics.roundShiftRightEven_eq_roundQuotientEven,f,show Fmt؉=23 from rfl] unfold YN;rw[K1,Model.floorLog2_den_one _ d];have l:(23:پ)-(M˟۩:پ)=ἃ (M˟۩-24):=א simp only[show((1:Nat)==0)=false from rfl,show(M˟==0)=false by simpa using d,l,sc2,ZE,χ,ؠ,ϫ,show M˟۩-24+1=M˟۩-23 by omega] by_cases j:(M˟۩:پ)+E>127 . have q:¬ (((M˟۩:پ)+E)<=127):=א have n:∀ b:ه,(if b=true then (M˟۩:پ)+E+1 else (M˟۩:پ)+E)>127:=by intro b;split<;>omega simp only[j,n,ת] . simp only[j,ؠ,show ¬ ((M˟۩:Int)+E < -150) by omega,show ¬ ((M˟۩:Int)+E < -126) by omega] lemma R8 (s:ه) (M:ٽ) (E:پ):Ya9 s M E=YN s M 1 E:=by unfold Ya9;split . rename_i h;rw[R9];congr 1;simp[Nat.toUInt64];omega . rfl def Yh (s:ه) (m:ٽ):پ:=if s then -(m:پ) else m lemma R7 (d:ه) (a:ٽ) (e:ه) (b:ٽ):Yh (Yap d a e b).1 (Yap d a e b).2=Yh d a+Yh e b:=by unfold Yap;by_cases g:d=e . subst g;cases d<;>simp[Yh]<;>omega . rw[if_neg (by simpa using g)];by_cases f:b<=a . rw[if_pos f];cases d<;>cases e<;>simp_all[Yh,ἂ f]<;>omega . rw[if_neg f];have h:a<=b:=א cases d<;>cases e<;>simp_all[Yh,ἂ h]<;>omega lemma K0 (s:ه) (m:ٽ):(Yh s m).natAbs=m:=by cases s<;>simp[Yh] lemma J9 (s:ه) (m:ٽ):decide (Yh s m<0)=(s&&m != 0):=by cases s . simp[Yh] . by_cases h:m=0 . simp[Yh,h] . have:(0:پ) < m:=by exact_mod_cast ϒ h simp only[Yh,ת,Left.neg_neg_iff,this,decide_true,Bool.true_and];simpa using h lemma ZF (w:δ):sv w=Yh (η w) (ε w):=rfl lemma R6 (s:ه) (a b:ٽ):Yh s (a*b)=a*Yh s b:=by cases s<;>simp[Yh] lemma Z3 (s:ه) (a b:ٽ):Yh s (a*b)=Yh s a*b:=by cases s<;>simp[Yh] lemma J8 (s t:ه) (a b:ٽ):Yh (s != t) (a*b)=Yh s a*Yh t b:=by cases s<;>cases t<;>simp[Yh] lemma R5 (S:پ):Yh (!decide (S<0)) S.natAbs = -S:=by unfold Yh;by_cases h:S<0<;>simp[h]<;>omega lemma R4 (w a b:δ):Ya7 w a b=elR w a b:=by unfold Ya7 elR;split . rfl . have h:sv w*sv a=Yh (η w != η a) (ε w*ε a):=by rw[J8,ZF,ZF] simp only[E4,h,K0,J9] lemma R3 (a:ه) (b d:ٽ) (f:ه) (B D:ٽ) (g:dsimp only[Yh]<;>simp<;>push_cast<;>ring . have e:f=!a:=by cases a<;>cases f<;>simp_all subst e;rw[if_neg (by cases a<;>simp)] by_cases h:B<=b . rw[if_pos h];refine⟨?_,g⟩;cases a<;>simp only[Yh]<;>simp<;>push_cast [ἂ h]<;>ring . rw[if_neg h];by_cases j:d=0 . rw[if_pos j];have k:b<=B:=א refine⟨?_,by dsimp only;omega⟩ cases a<;>simp only[Yh,j]<;>simp<;>push_cast [ἂ k]<;>ring . rw[if_neg j];have k:b+1<=B:=א have n:d<=D:=א refine⟨?_,by dsimp only;omega⟩ cases a<;>simp only[Yh]<;>simp<;>push_cast [ἂ k,ἂ n,Nat.sub_sub]<;>ring lemma R2 (t k D:ٽ):(t/D*k+t%D*k/D)*D+t%D*k%D=t*k:=by have a:=ἦ (t%D*k) D;have b:=ἦ t D calc (t/D*k+t%D*k/D)*D+t%D*k%D =t/D*k*D+(D*(t%D*k/D)+t%D*k%D):=ח _=(D*(t/D)+t%D)*k:=by rw[a];ring _=t*k:=by rw[b] lemma H7 (a m D:ٽ):a*m/D=a/D*m+a%D*m/D/\a*m%D=a%D*m%D:=by rcases Ϲ D with rfl|b . simp . have e:a*m=a%D*m+D*(a/D*m):=by rw[<- ϡ,<- Ϣ,Nat.mod_add_div] rw[e,Nat.add_mul_div_left _ _ b,Nat.add_mul_mod_self_left];exact⟨ϝ _ _,rfl⟩ lemma R1 (n:ٽ) (w b d:δ) (g:ٽ) (h:پ) (a:δ) (f:Unit -> ℚ) (j:0by rw[ZE];rfl rw[E,A,ZF b,ZF d,Int.shiftLeft_eq,Int.shiftLeft_eq,u,u];generalize p2 (g+γ b-o)=k;generalize p2 (γ d+γ a-o)=q;have p:0 α) (k:ٽ) (a:kf i܁)[k]! = f k:=ט def Ybb (rows n:ٽ) (eps:δ) (x g:ل δ):ل δ := if stableNormDomain rows n eps x g then let den:=ډ rows λ r=>YaE x n eps r.val YT rows n λ r j=>Ya7 x[r*n+j]! g[j]! den[r]! else rmsnormLegacyWith Yn rows n eps x g def Ybc (rows n:ٽ) (eps:δ) (x g b:ل δ):ل δ := if stableNormDomain rows n eps x g&&bچ==n&&b.all finiteWord then let st:=ډ rows λ r=>Y8 x n eps r.val YT rows n λ r j=>let s:=st[r]!;Yba n x[r*n+j]! g[j]! b[j]! s.1 s.2.1 s.2.2 λ _=>rowMean n x r else layernormLegacyWith Yn rows n eps x g b lemma J7 (a n:ٽ) (b:δ) (x g:ل δ) (h:stableNormDomain a n b x g=true):0YaE x n a r) _ b,gO rows (λ r=>sqrtRational (rowVariance n x r 0+rationalWord a)) _ b,T0 x n a _ e f,R4,S7] . simp only[Zi] lemma Q9:Ybc=layernormSpec:=by funext rows n a x g b;unfold Ybc layernormSpec layernormWith;split . rename_i f;have j:stableNormDomain rows n a x g=true:=by simp only[ϓ]at f;exact f.1.1 obtain⟨d,k⟩:=J7 rows n a x g j;rw[ZB _ _ _ rfl];congr 1;funext q;rw[Ϻ];have e:q܁/nY8 x n a r) _ e,gO rows (λ r=>sqrtRational (rowVariance n x r (ډ rows λ i=>rowMean n x i܁)[r]! + rationalWord a)) _ e,gO rows (λ r=>rowMean n x r) _ e,R1 _ _ _ _ _ _ _ _ d,S6 _ _ _ _ _ _ _ _ d (λ l=>by have:=Z2 x (q܁/n*n) n (q܁%n) (Χ _ d) (by rwa[h]);rwa[h]at this) (S8 x n a _ d), S9 x n a _ d k] . simp only[Zi] @[inline] def Yi (w:ك) (m:ق):ٽ := ((Yf w<<<(Yd w-m))*(2:ق)+(w>>>31).toUInt64).toNat def Ye (q:ق):پ:=(qڇ:پ)-2^64*(qڇ/2^63:ٽ) termination_by nڇ-kڇ decreasing_by exact ZI n k h lemma D1 (w:ك) (m:ق) (k:ٽ) (a:k<=39) (h:ε w=0\/(m˟<=γ w/\γ w-m˟<=k)) : (Yf w<<<(Yd w-m))˟=ε w*2^(γ w-m˟) /\ ε w*2^(γ w-m˟)<2^(24+k):=by rcases h with b | ⟨e,f⟩ . have:Yf w=0:=ο.mp (by rw[Zk,b];rfl);rw[this,b];simp . have g:(Yd w-m)˟=γ w-m˟:=by rw[Α _ _ (Ϯ.mpr (by rw[Zf];exact e)),Zf] have j:=ϖ w;have d:ε w*2^(γ w-m˟)<2^(24+k):=calc _<2^24*2^(γ w-m˟):=ἇ j (ψ _) _<=2^24*2^k:=Nat.mul_le_mul_left _ (Η ב f) _=2^(24+k):=by rw[pow_add] refine⟨?_,d⟩;rw[Ρ,g,Zk,ν (show idxOf w-m˟<64 by omega),υ] exact ν (lt_of_lt_of_le d (Η ב א)) lemma I7 (p:ق) (a:ه) (b:p˟<2^63):Ye (if a then (0:ق)-p else p)=if a then -(p˟:پ) else p˟:=by unfold Ye;cases a . simp only[χ,ؠ];rw[ϑ b];simp . simp only[ת];rw[Φ];simp only[show(0:ق)˟=0 from rfl,Ἇ];by_cases d:p˟=0 . rw[d];simp omega lemma QE {x y m:پ} (k:پ) (h:x=y+m*k):x%m=y%m:=by rw[h,Int.add_mul_emod_self_left] lemma Q8 (V:ٽ) (a:پ) (h:(V:پ)%2^128=a%2^128) (b:V<2^128) (d : -2^127<=a) (e:a<2^127) : (((2^64-V/2^127)%2^64*2^128+V:ٽ):پ)%2^192=a%2^192:=by obtain⟨c,f⟩:=Int.ModEq.dvd h;clear h;exact QE (V/2^127:ٽ) א lemma D7 (a b c:ق) (d:پ) (e:c˟=0) (h:((a˟*2^64+b˟:ٽ):پ)%2^128=d%2^128) (f : -2^127<=d) (g:d<2^127) : ((Yx ((0:ق)-(a>>>63)) a b+c˟:ٽ):پ)%2^192=d%2^192:=by have j:((0:ق)-(a>>>63))˟=(2^64-a˟/2^63)%2^64:=by rw[Φ,Ζ];simp[ω] have n:=b߾;have o:=a߾;have k:a˟/2^63=(a˟*2^64+b˟)/2^127:=א have l:a˟*2^64+b˟<2^128:=א unfold Yx;rw[j,e,Ἇ,Nat.add_assoc,k];exact Q8 _ d h l f g def okF (A:ل δ) (a n:ٽ) (m:ق) (s:ٽ):Prop := ∀ t,t ε A[a+t]! = 0\/(mڇ<=γ A[a+t]! /\ γ A[a+t]! - mڇ<=s) @[inline] def YU (bx:ك):ق:=Yk (bx&&&0xFFFF)-Yk (bx>>>16) lemma J6 (A:ل δ) (a i:ٽ) (b:i*a+a<=Aچ) (g:i*a+a<4294967296) (d:(Yc A a i&&&0xFFFF)≠255) (f:Yk (Yc A a i>>>16)<=Yk (Yc A a i&&&0xFFFF)) : okF A (i*a) a (Yk (Yc A a i>>>16)) (YU (Yc A a i))˟ /\ (YU (Yc A a i))˟<=254/\(Yk (Yc A a i>>>16))˟<=511 /\ ∀ t,t < a -> θ A[i*a+t]! ≠ 255:=by obtain⟨L,H,o,p,q,k⟩:=Zp A a i b א;obtain⟨u1,l⟩:=Zo _ L H o א;have r:H≠255:=λ h=>d (Ν.mp (by rw[l,h];rfl));have e:(YU (Yc A a i))˟=(H-1)-(L-1):=by unfold YU;rw[Α _ _ f,Zq,Zq,u1,l] have m:(Yk (Yc A a i>>>16))˟=L-1:=by rw[Zq,u1] refine⟨?_,by omega,by omega,λ t j=>(Zb A[i*a+t]!).2.2.1 (by have:=(k t j).2;omega)⟩ intro t j;by_cases n:ε A[i*a+t]! = 0 . exact Ω n . have s:=(Zb A[i*a+t]!).2.2.2 n;have u:=k t j;right;constructor<;>omega lemma I6 (a:ك) (b:ق) (d:Yf a=0\/(b<=Yd ζ+Yd a/\Yd ζ+Yd a-b<80)) : ε ζ*ε a≠0 -> b˟<=γ ζ+γ a/\γ ζ+γ a<=b˟+79:=by intro f;have g:Yf a≠0:=by intro h;apply f;rw[<- Zk a,h];simp obtain⟨e,j⟩:=d.resolve_left g;have k:=ϐ.mp e;have l:=UInt64.lt_iff_toNat_lt.mp j;rw[ZM]at k;rw[Α _ _ e,ZM]at l;have:(80:ق)˟=80:=rfl;constructor<;>omega lemma Q7 (n:ٽ) (f:ٽ -> δ):∀ k i (a:ل δ),n-i=k -> (Yaq n f i a)֍=a֍ ++ (List.range' i (n-i)).map f:=by intro k;induction k with | zero=>intro i a h;unfold Yaq;rw[if_neg א];simp[h] | succ k b=>intro i a h;unfold Yaq;rw[if_pos א,b (i+1) _ א,show n-i=(n-(i+1))+1 by omega,ϴ];simp lemma U3 (n:ٽ) (f:ٽ -> δ):Ybd n f=ډ n λ i=>f i܁:=by apply Array.ext';rw[Ybd,Q7 n f _ 0 _ rfl];apply ἤ<;>simp def YbeO (relu:ه) (c hw:ٽ) (x s t:ل δ):ل δ := YT c hw λ ch j=>act relu (YaY x[ch*hw+j]! s[ch]! t[ch]!) lemma E0:YbeO=scaleShiftSpec:=by funext relu c a x s t;simp only[YbeO,ZB c a _ rfl,scaleShiftSpec,X1,Ϻ] def Ybf (relu:ه) (a b:ل δ):ل δ := Ybd aچ λ i=>act relu (YaX a[i]! b[i]!) lemma U1:Ybf=addReluSpec:=by funext relu a b;simp only[Ybf,U3,addReluSpec,X2];apply congrArg;funext i;rw[ذ a i܁ i.isLt];rfl lemma A8 (q:ق) (z:پ) (a : -2^63<=z) (b:z<2^63) (h:((q˟:پ)-z)%2^64=0):Ye q=z:=by have:=q߾;unfold Ye;omega lemma J5 (a:ق):(a˟:پ) ≡ Ye a [ZMOD 2^64]:=by unfold Ye;rw[Int.modEq_iff_dvd];exact⟨-(a˟/2^63:ٽ),by ring⟩ lemma B1 (a b:ق) (d : -2^63<=Ye a*Ye b) (e:Ye a*Ye b<2^63):Ye (a*b)=Ye a*Ye b:=by apply A8 _ _ d e;have Zh:((a˟*b˟%2^64:ٽ):پ) ≡ Ye a*Ye b [ZMOD 2^64]:=by push_cast;exact(Int.mod_modEq _ _).trans ((J5 a).mul (J5 b)) rw[ϱ];exact Int.emod_eq_zero_of_dvd Zh.symm.dvd lemma G4 (w:δ) (m:ق):YaJ w m=if η w then 0-Yf w<<<(Yd w-m) else Yf w<<<(Yd w-m):=by have h:=C6 w 0;rw[UInt32.xor_zero,show signOf 0=false from rfl,Bool.xor_false]at h unfold YaJ;generalize Yf w<<<(Yd w-m)=v;split<;>rename_i a<;>simp only[a]at h . rw[show(w>>>31)܌=1 from ο.mp (by rw[h];rfl)];apply ο.mp;have:=v߾;simp[ϱ,show UInt64.size=18446744073709551616 from rfl]at *;omega . rw[show(w>>>31)܌=0 from ο.mp (by rw[h];rfl)];simp lemma H6 (w:δ) (m:ق) (k:ٽ) (a:k<=39) (h:ε w=0\/(m˟<=γ w/\γ w-m˟<=k)) : Ye (YaJ w m)=sv w*2^(γ w-m˟) /\ |sv w*2^(γ w-m˟)| < 2^(24+k):=by obtain⟨b,d⟩:=D1 w m k a h;have:=Η (show 0<2 by omega) (show 24+k<=63 by omega);rw[G4];rw[I7 _ _ א,b,ZF];unfold Yh;cases η w<;>simp<;>exact_mod_cast d @[inline] def YV (w:δ) (m:ق):ٽ:=(YaJ w m+0x200000000000000).toNat @[inline] def Y9 (a b:ق):ق:=(a&&&0x1FFFFFF)*(b-0x80000000) @[inline] def cq1 (a b:ق):ق:=((a>>>25)-0x100000000)*(b-0x80000000) @[inline] def Y5t (B0:ق) (bw:ك) (hi lo:ق):ق := let s:=Yd bw+126-B0 if (Yf bw==0||s<=78)&&B0<=1000 then let m:=Yf bw<<<23 let bh:=if s<64 then (m>>>1)>>>(63-s) else m<<<(s-64) let bl:=if s<64 then m<<>>63) if (t0|||t1|||t2)==0 then 0x100000000 else (YaTT t2 t1 t0 (λ _=>((B0ڇ:پ)-298)) false true (B0-298)).toUInt64 else YL B0 ζ bw ((0:ق)-(hi>>>63)) hi lo 0 λ v2 v1 v0 c' => YD v2 v1 v0 c' ((B0ڇ:پ)-298) @[inline] def Y5g (B0:ق) (bw:ك) (a0 a1:ق):ق := let l:=a1<<<25 let lo:=l+a0 Y5t B0 bw ((a1>>>39)+(((0:ق)-(a1>>>63))<<<25)+((0:ق)-(a0>>>63))+(if lo t ق) (B0:ق) (bw:ك) (a0 a1:ق) (k:م):ق := if h:k>>25)-ר)=X/2^25:=by constructor<;>apply A8 _ _ א א . rw[ἢ,show(0x1FFFFFF:ق)˟=2^25-1 from rfl,Ϙ];omega . rw[Φ,Ζ,show(25:ق)˟%64=25 from rfl,ω,show(ר:ق)˟=2^32 from rfl];push_cast;omega lemma tC (b:ق) (W:پ) (a : -2^31simp[sv,h] . have r:=f.resolve_left (λ h=>l (by simp[h]));have s:=g.resolve_left (λ h=>l (by simp[h]));rw[show idxOf x+idxOf w-(a˟+b˟)=(idxOf x-a˟)+(idxOf w-b˟) by omega,pow_add] ring lemma tw (x w:ك) (d e:ق) (g f:ٽ) (o:g+f<=31) (h:f<=6) (j:ε x=0\/(d˟<=γ x/\γ x-d˟<=g)) (k:ε w=0\/(e˟<=γ w/\γ w-e˟<=f)) (a b:ق) (l:a=(YV x d)؝) (n:b=(Y4 w e)܌) : Ye (Y9 a b)+2^25*Ye (cq1 a b)=sv x*sv w*2^(γ x+γ w-(d˟+e˟)) /\ -2^55>>39)+(((0:ق)-(a>>>63))<<<25)+((0:ق)-(b>>>63))+(if (a<<<25)+bomega lemma P4 (k:ق) (a:k˟<1024):Y0 ((k˟:پ)-298) true (k-298):=by intro c d _ b;rw[ξ,Φ,show(298:ق)˟=298 from rfl]at b ⊢ push_cast at b ⊢;omega lemma Y5w (a:ك) (s:ق) (b:ε a=0\/s˟<=78) : ((if s<64 then ((Yf a<<<23)>>>1)>>>(63-s) else (Yf a<<<23)<<<(s-64))˟*2^64 + (if s<64 then (Yf a<<<23)<<simp[Ζ,Ρ] . generalize k:Yf a<<<23=M at d ⊢;split_ifs with h . rw[Ι]at h;simp at h;rw[Ζ,Ζ,Ρ,Α _ _ (by rw[Κ];simp;omega),d] simp only[show(1:ق)˟=1 from rfl,show(63:ق)˟=63 from rfl,ω,υ,ν (show 63-s˟<64 by omega),ν (show s˟<64 by omega),Ϡ,<- pow_add] rw[show 1+(63-s˟)=64-s˟ by omega] have g:2^64=2^(64-s˟)*2^s˟:=by rw[<- pow_add,show 64-s˟+s˟=64 by omega] rw[g,Nat.mul_mod_mul_right,<- ϡ,<- Ϣ,Ϻ] . rw[Ι]at h;simp at h;rw[Ρ,Α _ _ (by rw[Κ];simp;omega),d] rw[show(64:ق)˟=64 from rfl,υ,ν (show s˟-64<64 by omega),ϔ,Ἇ] have j:ε a*2^23*2^(s˟-64)<2^64:=by calc ε a*2^23*2^(s˟-64)<2^24*2^23*2^14:=ἕ (ἇ f ה) (Η א א) ה _<2^64:=ב rw[ν j,ϡ,<- pow_add,show s˟-64+64=s˟ by omega] lemma C9 (d a e b:ق):((((d+e+(if a+bomega lemma YCn (a b d:ق) (h:a˟*2^128+b˟*2^64+d˟=0):YC a b d=0:=by have:=a߾;unfold YC;rw[h];split_ifs<;>omega lemma B9 (b:ق) (a:ك) (f d:ق) (A S:پ) (j:ε ζ*ε a≠0 -> b˟<=γ ζ+γ a/\γ ζ+γ a<=b˟+122) (k : -2^120>>1)>>>(63-s) else (Yf a<<<23)<<<(s-64))=t at o ⊢;generalize (if s<64 then (Yf a<<<23)<<push_cast<;>ring have Q:t˟*2^64+n˟<=2^125:=by rw[o];rcases r with h|⟨M,N,x⟩ . simp only[h,Nat.reducePow,zero_mul,zero_le] . have:=ϖ a;calc ε a*2^23*2^s˟<=2^24*2^23*2^78:=Ἢ (Ε _ (le_of_lt this)) (Η א M) _=2^125:=ב have D:((((if η a then f-t-(if domega have hSb2:S<2^127:=by rw[g,hbias];split_ifs<;>omega have x:=D7 q u 0 S rfl D hSb1 hSb2;generalize (0:ق)-(q>>>63)=v at x ⊢;unfold Yx at x;have R:=(Ϩ v);have T:=(Ϩ q);have U:=(Ϩ u);have E:YC v q u=S:=J0 v q u S א א (by push_cast at x ⊢;omega) rw[I9];by_cases p:S=0 . have:=YCz v q u (by rw[E,p]) rw[if_pos (decide_eq_true this),if_pos p] . have:v˟*2^128+q˟*2^64+u˟≠0:=λ V=>p (by rw[<- E];exact YCn v q u V) rw[if_neg (by simpa using this),if_neg p,B5,J1 _ _ _ _ _ _ _ (P4 b א),E] . obtain⟨F,G,H,I,W,-,O⟩:=Zr b ζ a _ _ d 0 (λ F G H I=>YD F G H I ((b˟:پ)-298)) (by simp only[ϔ,zero_add,Nat.reducePow,Nat.one_lt_ofNat]) (λ h=>⟨(j h).1,by have:=(j h).2;omega⟩) rw[W];have X:=ZL ζ a b˟ j;generalize sv ζ*sv a*2^(γ ζ+γ a-b˟)=bi at X g O;apply ZV F G H I _ S א א have Y:=D7 f d 0 A rfl e א א rw[O,ϩ,Y,<- ϩ,g] lemma B2 (K:ٽ) (d e:ٽ -> δ) (b:ق) (a:ك) (o:K<=4096) (j:∀ t,t θ (d t)≠255) (k:∀ t,t θ (e t)≠255) (l:θ a≠255) (f:ε ζ*ε a≠0 -> b˟<=γ ζ+γ a/\γ ζ+γ a<=b˟+122) (g:∀ t,t ε (d t)*ε (e t)≠0 -> b˟<=γ (d t)+γ (e t) /\ γ (d t)+γ (e t)<=b˟+122) (v:ق) (n:∀ S:پ,S=Yr d e b˟ 0 K+sv ζ*sv a*2^(γ ζ+γ a-b˟) -> v=if S=0 then ר else (ρ S ((b˟:پ)-298) false)܌) : (if v<ר then v؛ else if Yq (λ t=>if tif tif tif tg t א p);have w:=ZL ζ a b˟ f rw[n _ rfl];generalize u:Yr d e b˟ 0 K+sv ζ*sv a*2^(γ ζ+γ a-b˟)=S;have q:Β (K+1) (λ t=>if tif tif tif tby by_cases h:tsimp[h,j,k,l]<;>decide)];congr 1;rw[ZW,O6 d e K b˟ oneW a K 0 א (λ t _ s p=>(g t א p).1)] simp only[Λ,Nat.lt_irrefl,if_false];rw[ZA oneW a b˟ (λ h=>(f h).1),<- u];ring exact A4 _ _ _ _ _ (λ h=>by rw[q,h];simp[finishWord]) q lemma T9 (K:ٽ) (n o:(t:م) -> t ق) (g j:ٽ -> δ) (e f:ق) (q p:ٽ) (x:q+p<=31) (y:p<=6) (G:K<=256) (z:∀ t h,n t h=(YV (g t߷) e)؝) (B:∀ t h,o t h=(Y4 (j t߷) f)܌) (r:∀ t,t ε (g t)=0\/(e˟<=γ (g t)/\γ (g t)-e˟<=q)) (s:∀ t,t ε (j t)=0\/(f˟<=γ (j t)/\γ (j t)-f˟<=p)) (C:(e+f)˟=e˟+f˟) (l:ك) (D:∀ t,t θ (g t)≠255) (E:∀ t,t θ (j t)≠255) (F:θ l≠255) (w:ε ζ*ε l≠0 -> (e+f)˟<=γ ζ+γ l/\γ ζ+γ l<=(e+f)˟+122) : (if Y5 K۞ n o (e+f) l 0 0 0<ר then (Y5 K۞ n o (e+f) l 0 0 0)؛ else if Yq (λ t=>if tif tif tif t k߷<=K -> -((k߷:پ)*2^55)<=Ye H -> Ye H<=k߷*2^55 -> -((k߷:پ)*2^55)<=Ye I -> Ye I<=k߷*2^55 -> S=Ye H+2^25*Ye I+Yr g j (e+f)˟ k߷ (K-k߷)+sv ζ*sv l*2^(γ ζ+γ l-(e+f)˟) -> Y5 K۞ n o (e+f) l H I k=if S=0 then ר else (ρ S (((e+f)˟:پ)-298) false)܌:=by intro d induction d with | zero => intro k H I S hd hk O P Q u1 M;rw[Y5,dif_neg (by rw[τ,X];omega)];unfold Y5g;dsimp only have T:(2:پ)^55=36028797018963968:=ב have hk2:(k߷:پ)<=256:=א rw[T]at O P Q u1 exact B9 _ _ _ _ (Ye H+2^25*Ye I) S w (by linarith) (by linarith) (U0 H I) (by rw[M,show K-k߷=0 by omega,Yr];ring) | succ d ih => intro k H I S hd hk O P Q u1 M have Y:k ε (g t)*ε (j t)≠0 -> (e+f)˟<=γ (g t)+γ (j t) /\ γ (g t)+γ (j t)<=(e+f)˟+122:=by intro t ht hm;have u:=(r t ht).resolve_left (λ h=>hm (by rw[h,Ϫ]));have v:=(s t ht).resolve_left (λ h=>hm (by rw[h,Ϝ]));constructor<;>omega exact B2 K g j (e+f) l א D E F w he _ (λ S M=>A K 0 0 0 S ג ג (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by rw[M];simp[Ye])) @[inline] def YwV (w:δ) (m:ق):ق:=YaJ w m+0x8000000000000000 @[inline] def YL3 (j:ٽ) (v:ق):ك:=(if j=0 then v&&&0x1FFFFF else if j=1 then (v>>>21)&&&0x1FFFFF else v>>>42).toUInt32 lemma A2 (p W:پ) (b : -2^21<=p) (d:p<2^21) (a : -2^30nlinarith lemma Q2 (x w:ك) (a d:ق) (e f:ٽ) (g:e<=39) (h:f<=6) (j:ε x=0\/(a˟<=γ x/\γ x-a˟<=e)) (k:ε w=0\/(d˟<=γ w/\γ w-d˟<=f)) (v b:ق) (l:v=YwV x a) (n:b=(Y4 w d)܌) : Ye ((YL3 0 v)܌*(b-߿))+(2:پ)^21*Ye ((YL3 1 v)܌*(b-߿))+(2:پ)^42*Ye (((YL3 2 v)܌-0x200000)*(b-߿))=sv x*sv w*2^(γ x+γ w-(a˟+d˟)) /\ -(2:پ)^51>>21)&&&0x1FFFFF)؛ from rfl,show YL3 2 v=(v>>>42)؛ from rfl] obtain⟨X,W,E,u,F,y,z⟩:=H1 x w a d e f g h j k;rw[abs_lt]at u y;have J : -2^63<=X/\X<2^63:=by have:(2:پ)^(24+e)<=2^63:=pow_le_pow_right₀ ב א;exact⟨by linarith only [u.1,this],by linarith only [u.2,this]⟩ have p : -2^30>>21)&&&0x1FFFFF)؛܌)˟=v˟/2^21%2^21:=by rw[ϯ,ϧ,ἢ,show(0x1FFFFF:ق)˟=2^21-1 from rfl,Ϙ,Ζ,show(21:ق)˟%64=21 from rfl,ω];omega have I:((v>>>42)؛܌)˟=v˟/2^42:=by rw[ϯ,ϧ,Ζ,show(42:ق)˟%64=42 from rfl,ω];omega have A:Ye ((v&&&0x1FFFFF)؛܌)=((v˟%2^21:ٽ):پ):=A8 _ _ א א (by rw[G];simp only[Nat.reducePow,Int.natCast_emod,Ἣ,sub_self,Int.reducePow,EuclideanDomain.zero_mod]) have B:Ye (((v>>>21)&&&0x1FFFFF)؛܌)=((v˟/2^21%2^21:ٽ):پ):=A8 _ _ א א (by rw[H];simp only[Nat.reducePow,Int.natCast_emod,Int.natCast_ediv,Ἣ,sub_self,Int.reducePow,EuclideanDomain.zero_mod]) have C:Ye (((v>>>42)؛܌)-0x200000)=((v˟/2^42:ٽ):پ)-2^21:=A8 _ _ א א (by rw[Φ,I,show(0x200000:ق)˟=2^21 from rfl];push_cast;omega) have r:=A2 ((v˟%2^21:ٽ):پ) W א א p have s:=A2 ((v˟/2^21%2^21:ٽ):پ) W א א p have t:=A2 (((v˟/2^42:ٽ):پ)-2^21) W א א p rw[B1 _ _ (by rw[A,o];linarith only [r.1]) (by rw[A,o];linarith only [r.2]),B1 _ _ (by rw[B,o];linarith only [s.1]) (by rw[B,o];linarith only [s.2]),B1 _ _ (by rw[C,o];linarith only [t.1]) (by rw[C,o];linarith only [t.2]),A,B,C,o] refine⟨?_,r.1,r.2,s.1,s.2,t.1,t.2⟩;have D:((v˟%2^21:ٽ):پ)+2^21*((v˟/2^21%2^21:ٽ):پ)+2^42*(((v˟/2^42:ٽ):پ)-2^21)=X:=א rw[z];push_cast at D ⊢;linear_combination W*D @[specialize] def Y53 (n:م) (g fb:(t:م) -> t ق) (B0:ق) (bw:ك) (a0 a1 a2:ق) (k:م):ق := if h:k>>63))+((a1>>>43)+(((0:ق)-(a1>>>63))<<<21))+(if a0+(a1<<<21)>>22)+(((0:ق)-(a2>>>63))<<<42))+(if a0+(a1<<<21)+(a2<<<42)>>63))˟*2^64+a˟:ٽ):پ)%2^128=Ye a%2^128:=by have:=(Ϩ a);unfold Ye;simp only[Φ,Ζ,ω];norm_num;omega lemma D4 (a:ق):((((a>>>43)+(((0:ق)-(a>>>63))<<<21))˟*2^64+(a<<<21)˟:ٽ):پ)%2^128=(2^21*Ye a)%2^128:=by have:=(Ϩ a);unfold Ye;simp only[ξ,Φ,Ρ,Ζ,υ,ω];norm_num;omega lemma D3 (a:ق):((((a>>>22)+(((0:ق)-(a>>>63))<<<42))˟*2^64+(a<<<42)˟:ٽ):پ)%2^128=(2^42*Ye a)%2^128:=by have:=(Ϩ a);unfold Ye;simp only[ξ,Φ,Ρ,Ζ,υ,ω];norm_num;omega lemma D9 (b a d:ق):(((((0:ق)-(b>>>63))+((a>>>43)+(((0:ق)-(a>>>63))<<<21))+(if b+(a<<<21)>>22)+(((0:ق)-(d>>>63))<<<42))+(if b+(a<<<21)+(d<<<42)>>63))+((a>>>43)+(((0:ق)-(a>>>63))<<<21))+(if b+(a<<<21)>>22)+(((0:ق)-(d>>>63))<<<42)) (d<<<42);have f:Int.ModEq (2^128) _ _:=C9 ((0:ق)-(b>>>63)) b ((a>>>43)+(((0:ق)-(a>>>63))<<<21)) (a<<<21);have g:Int.ModEq (2^128) _ _:=Q5 b;have h:Int.ModEq (2^128) _ _:=D4 a;have j:Int.ModEq (2^128) _ _:=D3 d;exact e.trans ((f.trans (g.add h)).add j) lemma D8 (K:ٽ) (g n:(t:م) -> t ق) (f j:ٽ -> δ) (a e:ق) (o p:ٽ) (x:o<=39) (y:p<=6) (F:K<4096) (z:∀ t h,g t h=YwV (f t߷) a) (B:∀ t h,n t h=(Y4 (j t߷) e)܌) (q:∀ t,t ε (f t)=0\/(a˟<=γ (f t)/\γ (f t)-a˟<=o)) (r:∀ t,t ε (j t)=0\/(e˟<=γ (j t)/\γ (j t)-e˟<=p)) (s:(a+e)˟=a˟+e˟) (l:ك) (C:∀ t,t θ (f t)≠255) (D:∀ t,t θ (j t)≠255) (E:θ l≠255) (w:ε ζ*ε l≠0 -> (a+e)˟<=γ ζ+γ l/\γ ζ+γ l<=(a+e)˟+122) : (if Y53 K۞ g n (a+e) l 0 0 0 0<ר then (Y53 K۞ g n (a+e) l 0 0 0 0)؛ else if Yq (λ t=>if tif tif tif t k߷<=K -> -((k߷:پ)*2^51)<=Ye H -> Ye H<=k߷*2^51 -> -((k߷:پ)*2^51)<=Ye I -> Ye I<=k߷*2^51 -> -((k߷:پ)*2^51)<=Ye J -> Ye J<=k߷*2^51 -> S=Ye H+2^21*Ye I+2^42*Ye J+Yr f j (a+e)˟ k߷ (K-k߷)+sv ζ*sv l*2^(γ ζ+γ l-(a+e)˟) -> Y53 K۞ g n (a+e) l H I J k=if S=0 then ר else (ρ S (((a+e)˟:پ)-298) false)܌:=by intro d induction d with | zero => intro k H I J S hd hk N O P u1 Q R T;rw[Y53,dif_neg (by rw[τ,hc];omega)] have L:(2:پ)^51=2251799813685248:=ב have hk2:(k߷:پ)<=4096:=א rw[L]at N O P u1 Q R exact B9 _ _ _ _ (Ye H+2^21*Ye I+2^42*Ye J) S w (by linarith) (by linarith) (D9 H I J) (by rw[T,show K-k߷=0 by omega,Yr];ring) | succ d ih => intro k H I J S hd hk N O P u1 Q R T have hf:k ε (f t)*ε (j t)≠0 -> (a+e)˟<=γ (f t)+γ (j t) /\ γ (f t)+γ (j t)<=(a+e)˟+122:=by intro t ht hm;have u:=(q t ht).resolve_left (λ h=>hm (by rw[h,Ϫ]));have v:=(r t ht).resolve_left (λ h=>hm (by rw[h,Ϝ]));rw[s];constructor<;>omega exact B2 K f j (a+e) l א C D E w he _ (λ S T=>A K 0 0 0 0 S ג ג (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by rw[T];simp[Ye])) lemma u1 (n:م) (h:¬n=0):(n-1)߷h (ἶ.mp (by rw[e];rfl));rw[ἰ _ _ (USize.le_iff_toNat_le.mpr ו)];simp;omega @[specialize] def YO {α:Type} (B C:م) (f:م -> م -> م -> α) (n:م) (a b c:م) (acc:ل α):ل α := if h:n=0 then acc else let acc:=acc.push (f a b c) if c+1 م -> م -> α) (g:0 b߷ c߷ i+n<4294967296 -> (YO B C f n۞ a b c k)֍=k֍ ++ (List.range' i n).map (λ j=>f (j/(B߷*C߷))۞ (j/C߷%B߷)۞ (j%C߷)۞):=by intro n;induction n with | zero=>intro i a b c k _ _ _ _;unfold YO;rw[dif_pos (ἶ.mp ג)];simp | succ n q => intro i a b c k D t E J;have K:=φ;obtain⟨v,w,A⟩:=O5 a߷ b߷ c߷ B߷ C߷ t E;rw[D]at v w A;have L:a߷<=a߷*(B߷*C߷):=ϟ _ (ύ g d);have M:b߷<=b߷*C߷:=ϟ _ d;have u:∀ (x:م) (y:ٽ),y=x߷ -> y<4294967296 -> y۞=x := λ x y h F=>ἶ.mp (by rw[Za _ F,h]) have G:f (i/(B߷*C߷))۞ (i/C߷%B߷)۞ (i%C߷)۞=f a b c:=by rw[u a _ v א,u b _ w א,u c _ A א] have r:∀ x:م,x߷<=i -> (x+1)߷=x߷+1:=λ x h=>by rw[Zc _ _ (by simp only[ϻ];omega),ϻ] have l:=r c א;have o:=r b א;have H:=r a א;have z:(0:م)߷=0:=rfl;have p:(n+1)۞߷=n+1:=Za _ א;unfold YO;rw[dif_neg (λ e=>by rw[e]at p;simp at p),show(n+1)۞-1=n۞ from USize.toNat_inj.mp (by rw[ἰ _ _ (USize.le_iff_toNat_le.mpr (by rw[p];simp)),p,Za _ א];simp)] rw[ϴ,List.map_cons,G];split . rename_i h;rw[τ,l]at h;rw[q (i+1) a b (c+1) _ (by rw[l];omega) t (by rw[l];omega) א];simp . rename_i h;rw[τ,l]at h;have I:C߷=c߷+1:=א split . rename_i s;rw[τ,o]at s;rw[q (i+1) a (b+1) 0 _ (by rw[o,z,Ϣ,ϫ];omega) (by rw[o];omega) (by rw[z];omega) א] simp . rename_i s;rw[τ,o]at s;have N:B߷*C߷=b߷*C߷+c߷+1:=by rw[show B߷=b߷+1 by omega,Ϣ,I];omega rw[q (i+1) (a+1) 0 0 _ (by rw[H,z,Ϣ,ϫ];omega) (by rw[z];omega) (by rw[z];omega) א] simp lemma E1 {α:Type} (B C:م) (f:م -> م -> م -> α) (a:0f (q܁/(B߷*C߷))۞ (q܁/C߷%B߷)۞ (q܁%C߷)۞:=by apply Array.ext';rw[T8 B C f a b N 0 0 0 0 _ ג ו ו א];apply ἤ<;>simp @[inline] def YG (bv bw:ك) (xm:ق):ق := if bv>>>16==511 then Yd ζ+Yd bw-xm else Yk (bv>>>16) @[inline] def YgK (w:ه):ٽ:=if w then 4096 else 256 @[inline] def YgA (w:ه):ق:=if w then 39 else 31 @[inline] def YgB (w:ه):ق:=if w then 45 else 31 lemma Q6 (w:ه):(w=false -> YgK w<=256/\(YgB w)˟<=31)/\YgK w<=4096/\(YgA w)˟<=39/\(YgA w)˟<=(YgB w)˟:=by cases w<;>decide @[inline] def Ybg (bv bw bp:ك) (k:ٽ) (xm:ق) (w:ه):ه := let xb:=Yd ζ+Yd bw k>>16) && Yk (bp>>>16)<=Yk (bp&&&0xFFFF)&&Yk (bp&&&0xFFFF)-xm<=YgA w && (if bv>>>16==511 then xm<=xb else Yk (bv>>>16)<=Yk (bv&&&0xFFFF)&&YU bv<=6 && Yk (bp&&&0xFFFF)-xm+YU bv<=YgB w)&&θ bw != 255 && (Yf bw==0||(xm+YG bv bw xm<=xb&&xb-(xm+YG bv bw xm)<80)) @[inline] def Ybh (bp:ك) (BW:ل ك) (b:ل δ):ق := (Array.range BWچ).foldl (λ (m:ق) (o:ٽ) => let wm:=Yk ((BW[o]! : ك)>>>16) let xb:=Yd ζ+Yd b[o]! if (BW[o]! : ك)>>>16 != 511&&Yf b[o]! != 0&&xb < m+wm then xb-wm else m) (Yk (bp>>>16)) @[inline] def Ybs (s:σ) (inp:ل δ) (c yy xx:ٽ):δ := if yy=s.h\/xx-s.pad>=s.w then 0 else inp[(c*s.h+(yy-s.pad))*s.w+(xx-s.pad)]! @[inline] def YbsU (pd h w:م) (inp:ل δ) (c yy xx:م):δ := if yy=h || xx - pd>=w then 0 else let j:=(c*h+(yy - pd))*w+(xx - pd) if hj:jڇ < inpچ then inp.uget j hj else 0 @[inline] def YVa (w:δ) (m:ق):ٽ:=(YwV w m%0x40000000000).toNat @[inline] def YVb (w:δ) (m:ق):ٽ:=(YwV w m/0x40000000000).toNat lemma ZVw (w:δ) (m:ق):(YVa w m)؝+(YVb w m)؝*0x40000000000=YwV w m:=by unfold YVa YVb;generalize YwV w m=v;simp only[Ἄ,UInt64.ofNat_toNat];apply UInt64.toNat_inj.mp;simp only[ξ,ϱ,UInt64.toNat_mod,UInt64.toNat_div,show(0x40000000000:ق)˟=4398046511104 from rfl];have:=v߾;omega @[inline] def Ybi (s:σ) (inp:ل δ) (xm:ق) (g:δ -> ق -> ٽ):ل ٽ := let pd:=s.padڈ let h:=s.hڈ let w:=s.wڈ YO (Yb s).toUSize (Ya s).toUSize (λ c yy xx=>g (YbsU pd h w inp c yy xx) xm) (s.cin*(Yb s*Ya s)).toUSize 0 0 0 (Array.mkEmpty (s.cin*(Yb s*Ya s))) lemma E2 (s:σ) (g:ل δ) (c e f:ٽ) (k:crename_i d . rw[if_pos (by simpa using d)] . rw[if_neg (by simpa using d)];simp only[ἀ,ء,not_or,Nat.not_le]at d have z:c*s.h+(e-s.pad) < (c+1)*s.h:=by rw[Nat.succ_mul];omega have E:(c*s.h+(e-s.pad))*s.w+(f-s.pad) < (c+1)*s.h*s.w:=calc _ < (c*s.h+(e-s.pad))*s.w+s.w:=א _=(c*s.h+(e-s.pad)+1)*s.w:=by rw[Nat.succ_mul] _<=_:=Ε _ z have F:c*s.h<=(c*s.h+(e-s.pad))*s.w:=Μ (ϳ _ _) (ϟ _ א) have M:∀ x,x<4294967296 -> x%2^System.Platform.numBits=x:=λ x h=>ν (ϛ h L) have G:(c+1)*s.h<=(c+1)*s.h*s.w:=ϟ _ א have j:((c۞*s.hڈ+(e۞-s.padڈ))*s.wڈ+(f۞-s.padڈ))߷=(c*s.h+(e-s.pad))*s.w+(f-s.pad):=by simp only[USize.toNat_add,USize.toNat_mul,Za c א,u,v,w,y] rw[M (c*s.h) א,M (c*s.h+(e-s.pad)) א,M ((c*s.h+(e-s.pad))*s.w) א,M _ א] split<;>rename_i t . rw[<- j,ذ g _ t];rfl . rw[j]at t;rw[getElem!_neg g _ t];rfl lemma B3 (s:σ) (a:ل δ) (b:ق) (g:δ -> ق -> ٽ) (d:0g (YI s a i܁) b:=by have j:0by simp[h]at d);have k:0by simp[h]at d);have o:Yb s<=Yb s*Ya s:=ϟ _ k;have p:Ya s<=Yb s*Ya s:=Ἀ _ j;have l:(Yb s)۞߷=Yb s:=Za _ א;have n:(Ya s)۞߷=Ya s:=Za _ א;unfold Ybi;dsimp only;rw[E1 _ _ _ (by rw[l];omega) (by rw[n];omega) _ _ e];refine congrArg _ (funext λ i=>?_);rw[l,n] exact congrArg (g · b) ((E2 s a _ _ _ (Ϸ (lt_of_lt_of_eq i.isLt (ό _ _))) (Χ _ j) (Χ _ k) e).trans rfl) lemma uk {t:م} {k:ٽ} (a:t ه | 0=>true | r+1 => (let p:=if iif t < k then Δ s a y x (e+t) else ζ) (λ t=>if t < k then d[o*k+t]! else b[o]!) i r:=by intro r; induction r <;> intro i <;> simp only[zW,Yq, *] @[noinline] def Ybz (s:σ) (inp wts b:ل δ) (k:ٽ) (o y x:م) (dw:ه):δ := if zW s inp wts b k oڇ (if dw then oڇ*k else 0) yڇ xڇ 0 (k+1) then 0x80000000 else 0 @[inline] def Ybj (s:σ) (inp:ل δ) (P2 PH:ل ٽ) (off:ل ك) (wts:ل δ) (W2:ل ك) (b:ل δ) (k:ٽ) (o y x:م) (dw:ه) (pb wa:م) (B0:ق) (w:ه) (hk:k<1048576) (hoff:offچ=k) (hH:PHچ=P2چ) (hix:∀ t,t pbڇ+(off[t]!).toNat waڇ+t(P2.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (A9 _ _ _ (by rw [ox];exact hix _ (uk ht hk)))).toUInt64+(PH.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (A9 _ _ _ (by rw [ox,hH];exact hix _ (uk ht hk)))).toUInt64*0x40000000000) (λ t ht=>(W2.uget (wa+t) (A9 _ _ _ (hW _ (uk ht hk)))).toUInt64) B0 b[oڇ]! 0 0 0 0 else Y5 kڈ (λ t ht=>(P2.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (A9 _ _ _ (by rw [ox];exact hix _ (uk ht hk)))).toUInt64) (λ t ht=>(W2.uget (wa+t) (A9 _ _ _ (hW _ (uk ht hk)))).toUInt64) B0 b[oڇ]! 0 0 0 if v<0x100000000 then v.toUInt32 else Ybz s inp wts b k o y x dw lemma A7 {α:Type} [Inhabited α] (A:ل α) (i:م) (h:i߷ u߷+(g[t]!)؟ C߷+t ∀ t,t p[u߷+(g[t]!)؟]! = YV (Δ s d y x (l+t)) f) (T:w -> ∀ t,t p[u߷+(g[t]!)؟]! = YVa (Δ s d y x (l+t)) f/\A[u߷+(g[t]!)؟]! = YVb (Δ s d y x (l+t)) f) (U:∀ t,t r[C߷+t]! = Y4 a[o*k+t]! (YG (Yc a k o) b[o]! f)) (V:d܆<4294967296) (q:o*k+k<=a܆/\a܆<4294967296) (M:ق) (W:M=f+YG (Yc a k o) b[o]! f) : Ybj s d p A g a r b k E F G I u C M w B R v D J = Β (k+1) (λ t=>if tif t>>16))˟:=by unfold YU;rw[Α _ _ c5] set wm:=YG (Yc a k o) b[o]! f with h5;have Zh:∃ sw,sw<=6/\(Yk (Y&&&0xFFFF))˟-f˟+sw<=L2˟ /\ (∀ t,t ε a[o*k+t]! = 0\/(wm˟<=γ a[o*k+t]! /\ γ a[o*k+t]! - wm˟<=sw))/\(∀ t,t θ a[o*k+t]! ≠ 255) /\ (f+wm)˟=f˟+wm˟:=by by_cases hz:Yc a k o>>>16=511 . simp only[hz,if_true,ء]at cD;obtain⟨L,H,hb,-,v,h4⟩:=Zp a k o q.1 (Nat.le_of_lt_succ (ϊ q.1 q.2));obtain⟨u1,u2⟩:=Zo _ L H hb (ϊ v ד);rw[hz]at u1;have he:H≠255:=λ h=>c3 (Ν.mp (by rw[u2,h];rfl));have hd:=ZM b[o]!;have:=Zg b[o]!;have:=(ZO).2;have z:∀ t,t ε a[o*k+t]! = 0/\θ a[o*k+t]! ≠ 255:=λ t X=>by obtain⟨k1,k2⟩:=h4 t X;obtain⟨-,-,k3,k4⟩:=Zb a[o*k+t]!;exact⟨by by_contra hm;have:=(k4 hm).1;simp at u1;exact absurd (Μ (Μ (Μ (Nat.le_of_eq u1) k1) this) (Μ (k4 hm).2 (Nat.max_le.mpr ⟨Μ k2 v,by decide⟩))) ד,k3 (ϊ k2 (ϰ v he))⟩ refine⟨0,Nat.zero_le _,Μ e5 hL3,λ t X=>Ω (z t X).1,λ t X=>(z t X).2,?_⟩;simp only[h5,YG,hz,beq_self_eq_true,if_true];rw[ξ,Α _ _ cD];exact ν (ϊ (Nat.add_le_add_left (Nat.sub_le _ _) _) (ϊ (Ἆ (Μ e1 xm5) (Μ (Nat.le_of_eq hd) (Ἆ (Nat.le_of_eq (ZO).2) (Zg b[o]!)))) ד)) . simp only[hz,if_false,ϓ,ء]at cD;obtain⟨⟨d1,d2⟩,d3⟩:=cD;obtain⟨wf,ws,wm5,wfin⟩:=J6 a k o q.1 (ϊ q.1 q.2) c3 d1;have e3:=ϐ.mp d2;have e4:=ϐ.mp d3;rw[ξ,Α _ _ (UInt64.le_trans c4 c5)]at e4;simp only[show(6:ق)˟=6 from rfl]at e3;have ew:wm=Yk (Yc a k o>>>16):=by simp[h5,YG,hz] rw[ew];exact⟨_,e3,Μ (Nat.le_of_eq (ν (ϊ (Ἆ (Μ e5 hL2) e3) ד)).symm) e4,wf,wfin,by rw[ξ];exact ν (ϊ (Ἆ (Μ e1 xm5) wm5) ד)⟩ obtain⟨sw,k6,ks,wf,wfin,hB⟩:=Zh;have hx:∀ t,t ε (Δ s d y x (l+t))=0\/(f˟<=γ (Δ s d y x (l+t))/\γ (Δ s d y x (l+t))-f˟<=(Yk (Y&&&0xFFFF))˟-f˟):=λ t _=>by rcases L5 s d y x (l+t) with h | ⟨j,hj,h⟩<;>rw[h] . exact Ω rfl . rcases xf j hj with h' | h'<;>simp only[Λ]at h' . exact Ω h' . right;exact⟨Μ e1 h'.1,Nat.sub_le_sub_right (by have:=Nat.add_le_add_right (Μ h'.2 (Nat.le_of_eq sp)) (Yk (Y>>>16))˟;rwa[Nat.sub_add_cancel h'.1,Nat.sub_add_cancel e2]at this) _⟩ have hf:∀ t,t θ (Δ s d y x (l+t))≠255:=λ t _=>by rcases L5 s d y x (l+t) with h | ⟨j,hj,h⟩<;>rw[h] . decide . exact xfin j hj cases w;rw[if_neg ἳ];refine T9 k _ _ (λ t=>Δ s d y x (l+t)) (λ t=>a[o*k+t]!) f _ ((Yk (Y&&&0xFFFF))˟-f˟) sw (Μ ks (hL0 rfl).2) k6 (Nat.le_of_lt (ϛ c1 (hL0 rfl).1)) ?_ ?_ hx wf hB b[o]! hf wfin c9 (λ h=>⟨(h6 h).1,Μ (h6 h).2 (Nat.add_le_add_left ד _)⟩) intro t X;have h0:=uk X B;have Z:=D _ h0;rw[A7 p _ _ _ (by rw[Zc _ _ (by rw[ox];exact ϛ (Nat.lt_trans Z.1 Z.2) φ),ox]),S rfl _ h0] rotate_left;rw[if_pos rfl];refine D8 k _ _ (λ t=>Δ s d y x (l+t)) (λ t=>a[o*k+t]!) f _ ((Yk (Y&&&0xFFFF))˟-f˟) sw (Μ e5 hL2) k6 (ϛ c1 hL1) ?_ ?_ hx wf hB b[o]! hf wfin c9 (λ h=>⟨(h6 h).1,Μ (h6 h).2 (Nat.add_le_add_left ד _)⟩) intro t X;have h0:=uk X B;have Z:=D _ h0;have e:=T rfl _ h0;rw[A7 p _ _ _ (by rw[Zc _ _ (by rw[ox];exact ϛ (Nat.lt_trans Z.1 Z.2) φ),ox]),A7 A _ _ _ (by rw[Zc _ _ (by rw[ox];exact ϛ (Nat.lt_trans Z.1 Z.2) φ),ox]),e.1,e.2,ZVw] all_goals (intro t X;have h0:=uk X B;have Z:=J _ h0;rw[A7 r _ _ _ (Zc _ _ (ϛ (Nat.lt_trans Z.1 Z.2) φ)),U _ h0]) lemma Z4 {a:م} {n:ٽ} (h:aomega);rw[g,f]at u;cases a . simp only[χ,if_false,Λ]at h ⊢;rw[USize.zero_add,u] . simp only[if_true]at h ⊢;rw[Zc _ _ (by rw[um _ _ (by rw[e];omega),u,e];have:=φ;omega),um _ _ (by rw[e];omega),u,e] lemma L4 (b:ه) (s:σ) (a:ل δ) (k o y x t:ٽ) (j:k=if b then s.kh*s.kw else s.cin*s.kh*s.kw) (d:s.kh<=Yb s) (e:s.kw<=Ya s) (l:b -> oY4 wts[t.val]! (YG BW[t.val/k]! b[t.val/k]! xm) else let ku:=kڈ YO 1 ku (λ o _ j => let i:=o*ku+j Y4 (if h:iڇY4 a[t܁]! (YG d[t܁/k]! b[t܁/k]! f):=by unfold YW2;split · rfl · rename_i l;have h:k۞߷=k:=Za k e;rw[E1 1 k۞ _ ג (by rw[h];omega) a܆ _ g] refine congrArg _ (funext λ q=>?_) have r:=q.isLt;simp only[h,ϻ,ϫ];have j:(q܁/k)۞߷=q܁/k:=Za _ (by have:=Nat.div_le_self q܁ k;omega) have n:(q܁%k)۞߷=q܁%k:=Za _ (by have:=Nat.mod_le q܁ k;omega) have o:q܁/k*k+q܁%k=q܁:=by rw[ό];exact ἦ q܁ k have p:((q܁/k)۞*k۞+(q܁%k)۞)߷=q܁:=by rw[USize.toNat_add,USize.toNat_mul,j,h,n,ν (lt_of_lt_of_le (show q܁/k*k<4294967296 by omega) φ),ν (lt_of_lt_of_le (show q܁/k*k+q܁%k<4294967296 by omega) φ),o] congr 1 · exact A6 a _ q܁ p 0 rfl · congr 1 · exact A6 d _ (q܁/k) j 0 rfl · exact A6 b _ (q܁/k) j 0 rfl @[inline] def cdQ (dw:ه) (s:σ) (relu:ه) (inp wts 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) : ل δ := let off:ل ك:=ډ k λ t=>(Ys s t.val).toUInt32 let bp:=Yc inp inpچ 0 let BW:ل ك:=ډ C λ o=>Yc wts k o.val let xm:=Ybh bp BW b let g:=(Array.range C).all (λ o=>Ybg BW[o]! b[o]! bp k xm false) if hg:s.kh<=Yb s/\s.kw<=Ya s/\0Ybg BW[o]! b[o]! bp k xm (!g)) then let P2:=if g then Ybi s inp xm YV else Ybi s inp xm YVa let PH:=if g then P2 else Ybi s inp xm YVb let W2:ل ك:=YW2 wts BW b xm k have hP2:P2چ=s.cin*(Yb s*Ya s):=by simp only [P2];split<;>rw [B3 s inp xm _ hg.2.2.1 א א,Array.size_ofFn] have hH:PHچ=P2چ:=by simp only [PH];split;rfl;rw [hP2,B3 s inp xm _ hg.2.2.1 א א,Array.size_ofFn] have a:=D2 s C hg.2.2.1 let B0s:ل ق:=ډ C λ o=>xm+YG BW[o.val]! b[o.val]! xm let hw:=(Yb s*Ya s).toUSize let st:=s.strideڈ let wp:=(Ya s).toUSize let ku:=kڈ YO s.hoڈ s.woڈ (λ o y x => if h:oby obtain ⟨w1,-⟩:=L4 dw s inp k oڇ yڇ xڇ t hk hg.1 hg.2.1 (by intro d;subst d hC;simpa using Z4 h.1 א) (Z4 h.2.1 א) (Z4 h.2.2 א) ht rw [H9 dw s o y x hg.2.2.1 א א,hP2,ZD s _ t ht א];omega) (λ t ht=>by have:=Ε k (show oڇ+1<=C from Z4 h.1 א) rw [Nat.add_mul,Nat.one_mul] at this rw [um _ _ (by rw [Za _ א];omega),Za _ א] simp only [W2,B7 wts BW b xm k א א,Array.size_ofFn];omega)) else 0) (C*(s.ho*s.wo)).toUSize 0 0 0 (Array.mkEmpty (C*(s.ho*s.wo))) else if dw then dwF s relu inp wts b else Ya0 s relu inp wts b lemma T5 (d:ه) (s:σ) (a:ه) (e f b:ل δ) (k C:ٽ) (g:k=if d then s.kh*s.kw else s.cin*s.kh*s.kw) (h:C=if d then s.cin else s.cout) : (if d then depthwiseSpec else conv2dSpec) s a e f b=ډ (C*(s.ho*s.wo)) λ q=>act a (Β (k+1) (λ t=>if tif tsimp[depthwiseSpec,depthwiseWith,conv2dSpec,conv2dWith] lemma E3 (g:ه) (s:σ) (f:ه) (a e b:ل δ) (k C:ٽ) (h:k=if g then s.kh*s.kw else s.cin*s.kh*s.kw) (j:C=if g then s.cin else s.cout) : cdQ g s f a e b k C h j=(if g then depthwiseSpec else conv2dSpec) s f a e b:=by unfold cdQ;dsimp only;split . rename_i F;obtain⟨G,H,p,K,L,M,I⟩:=F;obtain⟨N,O,P,Q⟩:=D2 s C p;have x:s.ho.toUSizeڇ=s.ho:=Za _ א;have y:s.wo.toUSizeڇ=s.wo:=Za _ א;rw[E1 _ _ _ (by rw[x];exact(ZG s).1) (by rw[y];exact(ZG s).2) _ _ א,T5 g s f a e b k C h j] refine congrArg _ (funext fun q=>?_);obtain⟨A,B,n⟩:=Zt C s.ho s.wo q܁ q.isLt;have l:(q܁/(s.ho*s.wo))۞߷=q܁/(s.ho*s.wo):=Za _ (by have:=Nat.div_le_self q܁ (s.ho*s.wo);have:=q.isLt;omega) have r:(q܁/s.wo%s.ho)۞߷=q܁/s.wo%s.ho:=Za _ א;have u:(q܁%s.wo)۞߷=q܁%s.wo:=Za _ א;have D:k۞߷=k:=Za _ א;have J:q܁/(s.ho*s.wo)*k+k<=e܆:=by have:=Ε k (show q܁/(s.ho*s.wo)+1<=C by omega);rw[Ϣ,ϫ]at this;omega simp only[x,y];rw[dif_pos ⟨by rw[τ,l,Za _ א];exact n,by rw[τ,r,x];exact A,by rw[τ,u,y];exact B⟩] apply congrArg;refine T6 s a _ _ _ e _ b _ _ _ _ _ _ _ _ _ l r u rfl _ _ (Ybh (Yc a a܆ 0) (ډ C λ o=>Yc e k o܁) b) _ _ _ _ _ _ ?_ ?_ ?_ ?_ א ⟨J,by omega⟩ _ ?_ . have:=Array.all_eq_true.mp I (q܁/(s.ho*s.wo)) ו;simpa [gO C (λ o=>Yc e k o) _ n] using this all_goals try (intro v t w;obtain⟨z,E⟩:=L4 g s a k (q܁/(s.ho*s.wo)) _ _ t h G H (by intro d;subst d j;simpa using n) A B w;rw[H9 g s _ _ _ p א (by rw[l,r,u];omega),l,r,u,ZD s _ t w א]) . simp only[Bool.not_eq_false']at v;rw[v,if_pos rfl,B3 s a _ _ p א א,gO _ (λ i=>YV (YI s a i) _) _ z,E] . simp only[ἠ]at v;rw[v,if_neg ἳ,if_neg ἳ,B3 s a _ _ p א א,B3 s a _ _ p א א,gO _ (λ i=>YVa (YI s a i) _) _ z,gO _ (λ i=>YVb (YI s a i) _) _ z,E];exact⟨rfl,rfl⟩ . intro t w;rw[um _ _ (by rw[l,D];omega),l,D,B7 _ _ _ _ _ א א,gO _ (λ t=>Y4 e[t]! (YG (ډ C λ o=>Yc e k o܁)[t/k]! b[t/k]! (Ybh (Yc a a܆ 0) (ډ C λ o=>Yc e k o܁) b))) _ א, show(q܁/(s.ho*s.wo)*k+t)/k=q܁/(s.ho*s.wo) by rw[ϝ,ϙ _ _ א,ϑ w,Λ], gO C (λ o=>Yc e k o) _ n] . rw[A7 _ _ _ _ l,gO C (λ o=>_+YG (ډ C λ o=>Yc e k o܁)[o]! b[o]! _) _ n,gO C (λ o=>Yc e k o) _ n] . subst h j;cases g . exact W8 ▸ rfl . exact W7 ▸ rfl def Ybp (s:σ) (relu:ه) (inp wts b:ل δ):ل δ := cdQ false s relu inp wts b _ _ rfl rfl def dwQ (s:σ) (relu:ه) (inp wts b:ل δ):ل δ := cdQ true s relu inp wts b _ _ rfl rfl lemma T4:Ybp=conv2dSpec:=funext λ s=>funext λ r=>funext λ i=>funext λ w=>funext λ b=>E3 false s r i w b _ _ rfl rfl lemma T3:dwQ=depthwiseSpec:=funext λ s=>funext λ r=>funext λ i=>funext λ w=>funext λ b=>E3 true s r i w b _ _ rfl rfl lemma dz (n:ٽ) (F:ٽ -> δ) (e:0 θ (F t)≠255) : Β (n+1) (λ t=>if tif tζ):=by have l:∀ r k,k+r<=n -> Yo (λ t=>if tif tζ) k r /\ Yq (λ t=>if tif tζ) k r:=by intro r;induction r with | zero=>intro k _;exact⟨rfl,rfl⟩ | succ r j=>intro k h;obtain⟨a,b⟩:=j (k+1) א;simp only[Yo,Yq,a,b,if_pos (show k δ) r k,Yq f g k (r+1)=(Yq f g k r && (decide (ε (f (k+r))*ε (g (k+r))=0)&&Γ (η (f (k+r))) (η (g (k+r))))):=by intro f g r;induction r with | zero=>intro k;simp[Yq] | succ r j => intro k;conv_lhs=>rw[Yq,j (k+1)] conv_rhs=>rw[Yq] rw[show k+1+r=k+(r+1) by omega];simp only[Bool.and_assoc] rw[Zy (n+1) _ _ (λ t _=>by by_cases h:tsimp[h,d]<;>decide),Zy n _ _ (λ t p=>⟨d t p,by decide⟩),ZW,o,(l n 0 א).1,(l n 0 א).2] have q:sv (߿:ك)=0:=ד have s:((decide (ε ζ*ε (߿:ك)=0)) && Γ (η ζ) (η (߿:ك)))=true:=ד simp only[Λ,Nat.lt_irrefl,if_false,q,mul_zero,zero_mul,add_zero,s,Bool.and_true,show(n+1≠0)=True from eq_true א,show(n≠0)=True from eq_true א] lemma wp (c h w k a y x t:ٽ) (b:ل δ) (e:yr (Ν.mp (by rw[v,e];rfl));omega) . rw[getElem!_neg a j d];decide have g:ConvShape.ho ⟨c,h,w,c,k,k,k,0⟩=h/k:=by show(h-k)/k+1=h/k;conv_rhs=>rw[show h=(h-k)+k by omega];rw[Nat.add_div_right _ b] have l:ConvShape.wo ⟨c,h,w,c,k,k,k,0⟩=w/k:=by show(w-k)/k+1=w/k;conv_rhs=>rw[show w=(w-k)+k by omega];rw[Nat.add_div_right _ b] rw[E3,if_pos rfl];unfold depthwiseSpec depthwiseWith avgpoolSpec avgpoolWith;apply Array.ext . simp only[l,g,Array.map_ofFn,Ἠ] . intro i D E;simp only[Array.getElem_map,Ἃ,g,l];have x:is _)] unfold act;simp only[χ,↓reduceIte];congr 1<;>funext t<;>split . rename_i n;exact wp c h w k _ _ _ t a y z n . rfl . rename_i n;rw[ذ _ _ (by simp only[Array.size_replicate];omega)];simp only[Array.getElem_replicate] . rw[ذ _ _ (by simp only[Array.size_replicate];omega)];simp only[Array.getElem_replicate] . rw[X0] def Ybl (c h w k:ٽ) (inp:ل δ):ل δ := if k=2 then YT (c*(h/2)) (w/2) λ cy x=> let p:=poolAt h w 2 inp (cy/(h/2)) (cy%(h/2)) x YQ (YQ (YQ (YQ (p 0) (p 0)) (p 1)) (p 2)) (p 3) else Yad c h w k inp lemma T1:Ybl=maxpoolSpec:=by rw[<- N8];funext c h w k a;unfold Ybl;split . subst_vars;rw[ZB _ _ (c*(h/2*(w/2))) (ϡ _ _ _)];unfold Yad;apply congrArg;funext q;have b:∀ v:ٽ,v/(w/2)/(h/2)=v/(h/2*(w/2)):=λ v=>by rw[Ϡ,ό] simp only[b,show Τ (2*2)=[0,1,2,3] from rfl,ἧ,List.foldl_nil] . rfl @[noinline] def YaYs (x y z:δ):δ:=YaY x y z @[inline] def Ysx (x y z:δ) (my iy mz iq:ق):δ := if θ x != 255 then let mp:=Yl x*my let p:=Yd x+iy let k:=if mp==0 then iq else if mz==0 then p else if p<=iq then p else iq let dp:=if k<=p then p-k else 0 let dq:=if k<=iq then iq-k else 0 if dp<=14 && dq<=38 then let neg:=Γ (η x) (η y) let tp:=mp<<((kڇ:پ)-298)) (neg&&η z) true (k-298) else YaYs x y z else YaYs x y z lemma P3 (P K:ق):(if K<=P then P-K else 0)˟=P˟-K˟:=by split . rename_i h;rw[Α _ _ h] . rename_i h;rw[Κ]at h;simp;omega lemma G1 (x y z:δ) (a:θ y≠255) (b:θ z≠255) : Ysx x y z (Yl y) (Yd y) (Yl z) (Yd z+149)=YaY x y z:=by unfold Ysx;by_cases l:θ x=255 . rw[if_neg (by simp[l])];rfl . rw[if_pos (by simpa using l)] have g:=D5 x y;have j:(Yd z+149)˟=γ z+149:=by rw[ξ,Zf];have:=Zg z;simp;omega have w:γ x+γ y<=508:=by have:=Zg x;have:=Zg y;omega have A:γ z+149<=403:=by have:=Zg z;omega dsimp only;generalize Yd x+Yd y=P at g ⊢;generalize Yd z+149=Q at j ⊢;generalize o:(if Yl x*Yl y==0 then Q else if Yl z==0 then P else if P<=Q then P else Q)=K;have n:K˟=Y1 (Yl x*Yl y) (Yl z) (γ x+γ y) (γ z+149):=by rw[<- o,<- g,<- j];unfold Y1;by_cases e:Yl x*Yl y=0 . simp[e] . by_cases k:Yl z=0 . simp[e,k] . have p:(Yl x*Yl y==0)=false:=by simpa using e have q:(Yl z==0)=false:=by simpa using k simp only[p,q,e,k,χ,ؠ];by_cases f:P<=Q . rw[if_pos f];rw[Κ]at f;omega . rw[if_neg f];rw[Κ]at f;omega have B:K˟<=508:=by rw[n];unfold Y1;split_ifs<;>omega generalize r:(if K<=P then P-K else 0)=D;generalize s:(if K<=Q then Q-K else 0)=E;have eD:D˟=P˟-K˟:=by rw[<- r];exact P3 P K have t:E˟=Q˟-K˟:=by rw[<- s];exact P3 Q K by_cases d:(D<=14 && E<=38)=true . rw[if_pos d];simp only[ϓ,ء]at d;have C:D˟<=14:=by have:=ϐ.mp d.1;simpa using this have F:E˟<=38:=by have:=ϐ.mp d.2;simpa using this unfold YaY;rw[if_neg (show ¬(expOf x=255\/expOf y=255\/expOf z=255) by rintro (h|h|h)<;>contradiction)] dsimp only;rw[<- n,<- g,<- j,if_pos (And.intro (show P˟-K˟<=14 by omega) (show Q˟-K˟<=38 by omega))] have u:(P˟-K˟)؝=D:=ο.mp (by rw[Ἄ,ἱ,eD];omega) have v:(Q˟-K˟)؝=E:=ο.mp (by rw[Ἄ,ἱ,t];omega) rw[u,v,F7,B6,J2 _ _ _ _ _ (P4 K א)] . rw[if_neg d];rfl def Ysj (relu:ه) (x:ل δ) (n:م) (hn:nڇ<=xچ) (y z:δ) (my iy mz iq:ق) (j:م) (acc:ل δ):ل δ := if h:j (Ysj a x n b y z (Yl y) (Yd y) (Yl z) (Yd z+149) j f)֍=f֍++(List.range' j߷ (n߷-j߷)).map (λ i=>act a (YaY x[i]! y z)):=by intro m;induction m with | zero=>intro j f h;unfold Ysj;rw[dif_neg (by rw[τ];omega)];simp[h] | succ m g=> intro j f h;unfold Ysj;have k:jact relu (YaY x[ch*hw+j]! s[ch]! t[ch]!)) ch 0 acc) else acc termination_by c-ch lemma G2 (b:ه) (c a:ٽ) (x s t:ل δ) (d:c*a<=x܆) (e:c*a<=4294967295) : ∀ m f (g:ل δ),c-f=m -> Ysk b c a x s t d e f g=Yak c a (λ f j=>act b (YaY x[f*a+j]! s[f]! t[f]!)) f g:=by intro m;induction m with | zero=>intro f g h;unfold Ysk Yak;rw[dif_neg א,if_neg א] | succ m l=> intro f g h;unfold Ysk Yak;rw[dif_pos (show f>>63))˟*2^64+q˟:ٽ):پ)%2^128=Ye q%2^128:=by have a:((0:ق)-(q>>>63))˟=(2^64-q˟/2^63)%2^64:=by rw[Φ,Ζ];simp[ω] have:=q߾;unfold Ye;rw[a];exact QE (q˟/2^63:ٽ) א lemma QZb (w:ك):((w>>>31)܌)˟=if η w then 1 else 0:=by have h:=C6 w 0;rwa[UInt32.xor_zero,show signOf 0=false from rfl,Bool.xor_false]at h lemma C2 (x w:ك) (b a:ق) (d f:ٽ) (l:d+f<=15) (j:ε x=0\/(b˟<=γ x/\γ x-b˟<=d)) (g:ε w=0\/(a˟<=γ w/\γ w-a˟<=f)) (k:1<=a) : Ye (((QPb x b (η w))؝-4611686018427387904)*(Yf w<<<((θ w)܌-(a+1)))) = sv x*sv w*2^(γ x+γ w-(b˟+a˟)) /\ -2^63grind rw[B,show(signOf x != signOf w)=Γ (signOf x) (signOf w) by cases signOf x<;>cases η w<;>rfl];generalize M*D=p at n ⊢;have C:=I7 p (Γ (η x) (η w)) (by rw[n.1];omega);have Zk:(if Γ (η x) (η w) then -(p˟:پ) else p˟) = sv x*sv w*2^(γ x+γ w-(b˟+a˟)):=by rw[n.1,<- Zn];by_cases o:ε x*ε w=0 . have:ε x*2^(γ x-b˟)*(ε w*2^(γ w-a˟))=0:=by rcases ϸ.mp o with h | h<;>simp[h] rw[this,o];simp . have r:ε x≠0:=λ h=>o (by simp[h]);have s:ε w≠0:=λ h=>o (by simp[h]);have E:=j.resolve_left r;have F:=g.resolve_left s;have e:γ x+γ w-(b˟+a˟) = (γ x-b˟)+(γ w-a˟):=א rw[e,pow_add];split_ifs<;>push_cast<;>ring have G:(p˟:پ)<2^63:=by have:=n.2;rw[<- n.1]at this;exact_mod_cast this refine⟨C.trans Zk,?_,?_⟩<;>rw[<- Zk]<;>split_ifs<;>omega lemma C1 (X W:ل δ) (e g:ٽ) (n:م) (f:(k:م) -> k ق) (a:ق) (b:ك) (o:n߷<=1048576) (l:∀ t h,Ye (f t h)=sv X[e+t߷]!*sv W[g+t߷]!*2^(γ X[e+t߷]!+γ W[g+t߷]!-a˟) /\ -2^63<=Ye (f t h) /\ Ye (f t h)<=2^63) (j:ε ζ*ε b≠0 -> a˟<=γ ζ+γ b/\γ ζ+γ b<=a˟+122) : ∀ (d:ٽ) (k:م) (p r:ق) (S0 S:پ),n߷-k߷=d -> k߷<=n߷ -> ((p˟*2^64+r˟:ٽ):پ)%2^128=S0%2^128 -> -((k߷:پ)*2^63)<=S0 -> S0<=k߷*2^63 -> S=S0+YB X W e g a˟ k߷ (n߷-k߷)+sv ζ*sv b*2^(γ ζ+γ b-a˟) -> -2^191<=S -> S<2^191 -> QY6G n f a b p r k=if S=0 then ר else (ρ S ((a˟:پ)-298) false)܌:=by have s:(2:پ)^63=9223372036854775808:=ב have p127:(2:پ)^127=170141183460469231731687303715884105728:=ב intro d;induction d with | zero=> intro k p r S0 S I J v w x y z A;rw[QY6G,dif_neg (by rw[τ];omega)] obtain⟨B,C,D,E,K,-,L⟩:=Zr a ζ b _ p r 0 (λ B C D E=>YD B C D E ((a˟:پ)-298)) ג (λ h=>⟨(j h).1,by have:=(j h).2;omega⟩) rw[K];apply ZV B C D E _ S z A;have M:(k߷:پ)<=1048576:=א have F:=D7 p r 0 S0 rfl v (by rw[p127];rw[s]at w x;nlinarith) (by rw[p127];rw[s]at w x;nlinarith) rw[L,ϩ,F,<- ϩ,y,show n߷-k߷=0 by omega,YB];ring_nf | succ d N=> intro k p r S0 S I J v w x y z A;have u:k>>16)<=Yk (Yc A a i&&&0xFFFF)) (d:(QYF (Yc A a i))˟<=c) : ∀ t,t < a -> (ε A[i*a+t]! = 0\/((Yk (Yc A a i>>>16))˟<=γ A[i*a+t]!/\γ A[i*a+t]!-(Yk (Yc A a i>>>16))˟<=c)) /\ θ A[i*a+t]!≠255:=by obtain⟨L,H,o,-,p,q⟩:=Zp A a i e f;obtain⟨r,k⟩:=Zo _ L H o א have j:=Zq (Yc A a i>>>16);have h:=Zq (Yc A a i&&&0xFFFF);rw[r]at j;rw[k]at h;unfold QYF at d;rw[Α _ _ b,j,h]at d;have s:H≠255:=λ c=>g (Ν.mp (by rw[k,c];rfl)) intro t u;obtain⟨-,-,v,w⟩:=Zb A[i*a+t]!;have:=q t u;refine⟨?_,v (ϊ this.2 (ϰ p s))⟩;by_cases l:ε A[i*a+t]! = 0 . exact Ω l . have n:=w l;right;rw[j];exact⟨G0 this.1 n.1,(Nat.sub_le_sub_right (F9 this.2 n.2) _).trans d⟩ lemma P5 (X W b:ل δ) (a i j s w:ٽ) (d e:ك) (g l:ل δ) (o p:ٽ) (n:م) (f:(k:م) -> k ق) (D:i*a+a<=Xچ) (E:j*a+a<=Wچ) (F:i*a+a<=4294967295) (G:j*a+a<=4294967295) (z:a<1048576) (H:s+w<=122) (A:n߷<=1048576) (B:YB g l o p ((Yk (d>>>16))+(Yk (e>>>16)))˟ 0 n߷=YB X W (i*a) (j*a) ((Yk (d>>>16))+(Yk (e>>>16)))˟ 0 a) (x:∀ t,t < a -> (ε X[i*a+t]! = 0\/((Yk (d>>>16))˟<=γ X[i*a+t]!/\γ X[i*a+t]!-(Yk (d>>>16))˟<=s)) /\ θ X[i*a+t]!≠255) (y:∀ t,t < a -> (ε W[j*a+t]! = 0\/((Yk (e>>>16))˟<=γ W[j*a+t]!/\γ W[j*a+t]!-(Yk (e>>>16))˟<=w)) /\ θ W[j*a+t]!≠255) (q:θ b[j]!≠255) (r:Yf b[j]! = 0\/(Yk (d>>>16)+Yk (e>>>16)<=Yd ζ+Yd b[j]!/\Yd ζ+Yd b[j]!-(Yk (d>>>16)+Yk (e>>>16))<80)) (C:∀ t h,Ye (f t h)=sv g[o+t߷]!*sv l[p+t߷]!*2^(γ g[o+t߷]!+γ l[p+t߷]!-((Yk (d>>>16))˟+(Yk (e>>>16))˟)) /\ -2^63<=Ye (f t h) /\ Ye (f t h)<=2^63) : (if QY6G n f (Yk (d>>>16)+Yk (e>>>16)) b[j]! 0 0 0<ר then (QY6G n f (Yk (d>>>16)+Yk (e>>>16)) b[j]! 0 0 0)؛ else Yai X W b a i j) = Β (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=by have M:(i*a)۞߷=i*a:=Za _ א have N:(j*a)۞߷=j*a:=Za _ א have J:a۞߷=a:=Za _ א have Q:((Yk (d>>>16))+(Yk (e>>>16)))˟=(Yk (d>>>16))˟+(Yk (e>>>16))˟:=by rw[ξ];exact ν (by rw[Zq,Zq];have:=(d>>>16).toNat_lt;have:=(e>>>16).toNat_lt;omega) have I:=I6 b[j]! _ r;have K:∀ t,t < a -> ε X[i*a+t]! * ε W[j*a+t]! ≠ 0 -> ((Yk (d>>>16))+(Yk (e>>>16)))˟<=γ X[i*a+t]! + γ W[j*a+t]! /\ γ X[i*a+t]! + γ W[j*a+t]! <= ((Yk (d>>>16))+(Yk (e>>>16)))˟+122:=by intro t L O;have u:=(x t L).1.resolve_left (λ c=>O (by rw[c,Ϫ]));have v:=(y t L).1.resolve_left (λ c=>O (by rw[c,Ϝ]));rw[Q];constructor<;>omega have V:=U5 X W (i*a) (j*a) _ a 0 (λ t _ Y P=>K t א P) have O:=ZL ζ b[j]! _ (λ c=>⟨(I c).1,by have:=(I c).2;omega⟩) generalize R:YB X W (i*a) (j*a) ((Yk (d>>>16))+(Yk (e>>>16)))˟ 0 a+sv ζ*sv b[j]!*(2:پ)^(γ ζ+γ b[j]!-((Yk (d>>>16))+(Yk (e>>>16)))˟)=S at V O;have T : -2^191<=S:=א have U:S<2^191:=א rw[C1 g l o p n f _ b[j]! A (λ t h=>by rw[Q];exact C t h) (λ c=>⟨(I c).1,by have:=(I c).2;omega⟩) n߷ 0 0 0 0 S ג ג ג ג ג (by rw[<- R,<- B];simp) T U,<- U6 X W (i*a)۞ (j*a)۞ a۞ (by rw[M,J];omega) (by rw[N,J];omega) (by rw[M,J];have:=φ;omega) (by rw[N,J];have:=φ;omega) _ _ b[j]! א (λ c=>⟨(I c).1,by have:=(I c).2;omega⟩) a 0 0 0 0 0 0 S (by simp[J]) ג ג (λ t _ Y P=>by rw[M,N]at P ⊢;have:=K t א P;exact⟨this.1,by omega⟩) (by simp[Yx]) (by rw[<- R,M,N,J];simp) T U] exact J4 X W a i j b[j]! _ _ _ _ _ M N J z (λ t L=>(x t L).2) (λ t L=>(y t L).2) q K (λ c=>⟨(I c).1,by have:=(I c).2;omega⟩) _ (C8 X W b a i j) lemma H0 (n:ٽ) (f:ٽ -> ك) (m:ق):∀ k t (P:ل ٽ),n-t=k -> (QPD n f m t P)֍=P֍ ++ (List.range' (2*t) (2*(n-t))).map λ u=>QPb (f (u/2)) m (u%2=1):=by intro k;induction k with | zero=>intro t P h;unfold QPD;rw[if_neg א];simp[h] | succ k a=>intro t P h;unfold QPD;rw[if_pos א];dsimp only;rw[a (t+1) _ א,show 2*(n-t)=2*(n-(t+1))+1+1 by omega,ϴ,ϴ];simp[show 2*t/2=t by omega,show(2*t+1)/2=t by omega,show 2*(t+1)=2*t+1+1 by omega,show(2*t+1)%2=1 by omega] lemma C3 (n c:ٽ) (f:ٽ -> ك) (m:ق):QPD n f m 0 (Array.emptyWithCapacity c)=ډ (2*n) λ u=>QPb (f (u܁/2)) m (u܁%2=1):=by apply Array.ext';rw[H0 n f m _ 0 _ rfl];apply ἤ<;>simp lemma G9 (n:ٽ) (f:ٽ -> ك):∀ k t (I:ل ك),n-t=k -> (QPI n f t I)֍=I֍ ++ ((List.range' t (n-t)).filter λ u=>Yf (f u)≠0).map (·.toUInt32):=by intro k;induction k with | zero=>intro t I h;unfold QPI;rw[if_neg א];simp[h] | succ k a=>intro t I h;unfold QPI;rw[if_pos א,a (t+1) _ א,show n-t=(n-(t+1))+1 by omega,ϴ];split<;>simp[*] lemma P6 (X W:ل δ) (a b d:ٽ):∀ r k,YB X W a b d k r=((List.range' k r).map λ u=>sv X[a+u]!*sv W[b+u]!*2^(γ X[a+u]!+γ W[b+u]!-d)).sum:=by intro r;induction r with | zero=>intro k;rfl | succ r e=>intro k;rw[YB,e,ϴ];simp lemma QFL (L:List ٽ) (p:ٽ -> Prop) [DecidablePred p] (g:ٽ -> پ) (h:∀ x ∈ L,¬p x -> g x=0):((L.filter p).map g).sum=(L.map g).sum:=by induction L with | nil=>rfl | cons x L a=>simp only[List.filter_cons,List.map_cons,List.sum_cons];split<;>simp_all lemma P9 (t:م) (w:ك) (h:t߷<1048576):(t+t+(w>>>31).toUSize)߷=2*t߷+(w>>>31)؟/\(w>>>31)؟<2 /\ (2*t߷+(w>>>31)؟)/2=t߷/\decide ((2*t߷+(w>>>31)؟)%2=1)=η w:=by obtain⟨a,b⟩:=G7 t w h;have h:=QZb w;simp only[ϯ]at h;refine⟨a,b,?_⟩;rcases Bool.eq_false_or_eq_true (η w) with c|c<;>rw[c]at h ⊢<;>simp only[↓reduceIte,χ,ء,decide_eq_false_iff_not]at h ⊢<;>omega lemma G8 (X:ل δ) (P:ل ٽ) (I:ل ك) (W b:ل δ) (a i j:ٽ) (H:(Iچ=0 -> ∀ t,t<2*a -> Pچ=2*a -> P[t]! = QPb X[i*a+t/2]! (Yk (Yc X a i>>>16)) (t%2=1)) /\ (Iچ≠0 -> I֍=((Τ a).filter λ t=>Yf X[i*a+t]! ≠ 0).map (·.toUInt32) /\ ∀ u,u<2*Iچ -> Pچ=2*Iچ -> P[u]! = QPb X[i*a+(I[u/2]!)؟]! (Yk (Yc X a i>>>16)) (u%2=1))) : QPa X P I W b a i j (Yc X a i) (Yc W a j) = Β (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=by unfold QPa;dsimp only;by_cases c:Iچ=0<;>simp only[c,↓reduceDIte,↓reduceIte]<;>split<;>(try exact ZcB X W b a i j)<;>rename_i h <;> obtain⟨O,q2,B,C,D,E,Q,S,T,F,G,o,p,q,r⟩:=h<;>have y:=C0 X a i _ B D S F le_rfl<;>have z:=C0 W a j _ C E T G le_rfl <;> have U:∀ {α:Type} [Inhabited α] (A:ل α) (k:م) h,A.uget k h=A[k߷]!:=λ A k h=>by rw[ذ A k߷ h];rfl . have J:=H.1 c;exact P5 X W b a i j _ _ _ _ X W _ _ _ _ B C D E Q א (by rw[Za _ א];omega) (by rw[Za _ א]) y z p q (λ t h=>by have d:=ϋ.mp h;rw[Za _ א]at d have e:((j*a)۞+t)߷=j*a+t߷:=by rw[Zc _ _ (by rw[Za _ א];have:=φ;omega),Za _ א] simp only[U,e];have s:=(z _ d).1;generalize W[j*a+t߷]! = w at s ⊢;obtain⟨K,Y,L,M⟩:=P9 t w א;rw[K,J _ א O,L,M] have:=C2 _ _ _ _ _ _ o (y _ d).1 s r;rw[this.1];exact⟨rfl,this.2.1.le,this.2.2.le⟩) . obtain⟨N,J⟩:=H.2 c;have Z:∀ m,m (I[m]!)؟ < a:=λ m h=>by have e:I֍[m]'(by simp only[Array.length_toList];omega) ∈ ((Τ a).filter λ t=>Yf X[i*a+t]! ≠ 0).map (·.toUInt32):=N ▸ List.getElem_mem _ rw[ذ I m h];simp only[List.mem_map,List.mem_filter,List.mem_range,Array.getElem_toList]at e;obtain⟨u,⟨hu,-⟩,e⟩:=e;rw[<- e];simp only[Nat.toUInt32_eq,Ἓ,Nat.reducePow,gt_iff_lt];omega have V:∀ (g:ك -> δ) m,m (I.map g)[0+m]! = g I[m]!:=λ g m h=>by rw[Λ,ذ _ m (by simp only[Array.size_map];omega),ذ I m h];simp only[Array.getElem_map] have x:=congrArg List.length N;simp only[Array.length_toList,List.length_map]at x;exact P5 X W b a i j _ _ _ _ (I.map λ v=>X[i*a+v؟]!) (I.map λ v=>W[j*a+v؟]!) 0 0 _ _ B C D E Q א (by rw[Za _ א];omega) (by rw[Za _ א,P6,P6,<- List.range_eq_range',<- List.range_eq_range',<- QFL (Τ a) (λ t=>Yf X[i*a+t]! ≠ 0) _ (λ u _ h=>by simp only[not_not]at h;have:ε X[i*a+u]! = 0:=by rw[<- Zk,h];rfl simp only[sv,this,CharP.cast_eq_zero,neg_zero,ite_self,mul_ite,mul_neg,zero_mul,ξ,Nat.reducePow])] apply congrArg;apply ἤ (by simp only[zero_add,ξ,Nat.reducePow,x,ne_eq,decide_not,List.length_map,List.length_range]);intro m n h2;simp only[List.length_map,List.length_range]at n have e:=List.getElem_of_eq N (by simp only[Array.length_toList];omega);simp only[Array.getElem_toList,List.getElem_map]at e have f:=List.getElem_mem (l:=(Τ a).filter λ t=>Yf X[i*a+t]! ≠ 0) (by rw[<- x];exact n);simp only[List.mem_filter,List.mem_range]at f have k:(I[m]'n)؟=((Τ a).filter λ t=>Yf X[i*a+t]! ≠ 0)[m]'(by rw[<- x];exact n):=by rw[e];generalize ((Τ a).filter λ t=>Yf X[i*a+t]! ≠ 0)[m]'(by rw[<- x];exact n)=u at f ⊢;simp only[Nat.toUInt32_eq,Ἓ,Nat.reducePow,Nat.mod_succ_eq_iff_lt,Nat.succ_eq_add_one,Nat.reduceAdd];omega simp only[List.getElem_map,List.getElem_range,V _ _ n,ذ I m n,k]) y z p q (λ t h=>by have d:=ϋ.mp h;rw[Za _ א]at d;have R:=Z _ d rw[V _ _ d,V _ _ d];have e:((j*a)۞+(I[t߷]!).toUSize)߷=j*a+(I[t߷]!)؟:=by rw[Zc _ _ (by rw[Za _ א,ἥ];have:=φ;omega),Za _ א,ἥ] simp only[U];rw[(P8 _ a א).2 א,e];have s:=(z _ R).1;generalize W[j*a+(I[t߷]!)؟]! = w at s ⊢ obtain⟨K,Y,L,M⟩:=P9 t w א;rw[K,J _ א O,L,M] have:=C2 _ _ _ _ _ _ o (y _ R).1 s r;rw[this.1];exact⟨rfl,this.2.1.le,this.2.2.le⟩) lemma ZcC:YaV=linearSpec:=by funext rows a outW relu X W b;unfold YaV linearSpec linearWith;dsimp only;rw[ZB _ _ _ rfl]<;>congr 1<;>funext q<;>have f:=q.isLt<;>have h:0 have e:q܁/outWhave k:q܁%outW rw[Ze rows (λ i=>Yc X a i) _ e,Ze outW (λ j=>Yc W a j) _ k] rw[G8];split . rw[ذ _ (q܁/outW) (by simp only[Array.emptyWithCapacity_eq,ϓ,ء,Ἠ,Fin.is_lt,ذ,Ἃ];omega)];simp only[Ἃ];split . exact⟨λ _ t g d=>by simp only[List.size_toArray,List.length_nil]at d;omega,λ c=>absurd rfl c⟩ split . rename_i l;simp only[ϓ,ء]at l;refine⟨λ c=>absurd c (by dsimp only;omega),λ _=>⟨?_,λ u n d=>?_⟩⟩ . rw[G9 _ _ _ 0 _ rfl];simp only[Array.emptyWithCapacity_eq,Array.toList_empty,Nat.toUInt32_eq,ne_eq,decide_not,tsub_zero,← List.range_eq_range',List.nil_append] . rw[C3,ذ _ u (by rw[Ἠ];omega)];simp only[Array.emptyWithCapacity_eq,Ἃ];rw[Ze rows _ _ e] . exact⟨λ _ t g d=>by rw[C3,ذ _ t (by simp only[Ἠ];omega)];simp only[Ἃ];rw[Ze rows _ _ e],λ c=>absurd rfl c⟩ . rw[ذ _ _ (by simp only[Array.size_replicate];omega),Array.getElem_replicate];exact⟨λ _ t g d=>by simp only[List.size_toArray,List.length_nil]at d;omega,λ c=>absurd rfl c⟩ def kernels:Kernels where core:=kernels0.core dense:=⟨YaV,Ya3⟩ conv:=⟨Ybp,dwQ⟩ elem:=⟨Ybk,Ybl,Ybf,Ybe⟩ norm:=⟨Ybb,Ybc⟩ theorem correct:Obligation kernels:=by have h:kernels0=specKernels:=ZbZ;simp only[Obligation,kernels,h,specKernels,specDense,specConv,specElem,specNorm,ZcC,Zc0,T4,T3,T2,U1,U2, T1,R0,Q9] end Submission