import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open ExactRuntime renaming idxOf->γ,Word->δ,mantOf->ε,oneW->ζ,signOf->η,expOf->θ,ofW->ι,Fmt->κ,ConvShape->ο,toWord->π,finishWord->ρ,rationalWord->ς,dotOf->Γ,windowAt->Μ,decodeD->Ν,limbVal->ϋ,sqrtLower->Ϗ,decodeD_toRat->ϙ,mantOf_lt_24->Ϛ,addLimbs64->ϛ,toDyadic_ofUInt32->Ϡ,rowVariance->ϫ,finishWord_scale->Aa,sqrtRational->Ac,decodeD_negative->Ad,ConvShape.ho->Es,ConvShape.wo->Et open Nat renaming mod_eq_of_lt->ν,shiftRight_eq_div_pow->ψ,mul_le_mul_right->ω,shiftLeft_eq->Α,zero_add->Β,two_pow_pos->Δ,mod_lt->Ε,mul_comm->Θ,pow_le_pow_right->Ι,pow_add->Κ,pos_of_ne_zero->Ο,lt_of_le_of_lt->Ρ,div_eq_of_lt->Υ,mul_pos->ϊ,le_add_right->ώ,add_zero->ϑ,add_mul_div_right->ϔ,div_lt_of_lt_mul->ϕ,cast_sub->ϗ,one_mul->Ϙ,add_comm->Ϟ,add_mul->ϟ,and_two_pow_sub_one_eq_mod->ϡ,mul_assoc->ϣ,le_mul_of_pos_right->Ϧ,div_div_eq_div_mul->ϧ,add_le_add_left->Ϯ,log2_self_le->ϰ,add_mul_mod_self_right->ϲ,le_mul_of_pos_left->ϳ,add_lt_add_left->ϴ,div_add_mod'->϶,zero_mul->ϸ,lt_trans->Ϲ,log2_lt->Ϻ,eq_zero_or_pos->Ae,log2_eq_iff->Af,lt_of_lt_of_le->Ag,succ_mul->Ah,sub_zero->Ai,mul_lt_mul_of_pos_right->Aj,lt_log2_self->Ak,lt_of_sub_eq_succ->Al,le_div_iff_mul_le->Am,div_lt_iff_lt_mul->An,lt_succ_iff->Ao,lt_or_eq_of_le->Ap,div_add_mod->Aq,mul_le_mul->Ar,mul_lt_mul_of_lt_of_le->As,le_sub_of_add_le->Au,div_mul_le_self->Av,sub_add_cancel->Aw,mul_eq_zero->Ax,le_one_iff_eq_zero_or_eq_one->Ay,shiftLeft_add_eq_or_of_lt->Bq,and_two_pow_sub_one_of_lt_two_pow->Bx,sub_lt_left_of_lt_add->Bz,one_le_two_pow->BE,testBit_eq_decide_div_mod_eq->BJ,sub_le_iff_le_add'->BK,mul_lt_mul''->BP,add_assoc->BU,reduceMod->BY,sub_le_sub_right->BZ,toUInt32_eq->Cd,mul_add_mod->Ce,mul_add_div->Cf,le_add_left->Cg,mul_le_mul_left->Ci,mul_zero->Co,le_trans->Cp,sub_right_comm->Cu,add_right_comm->Cv,mod_mul_right_div_self->Cw,sub_add_eq->Cx,add_le_add->Cy,add_sub_cancel->Cz,add_mul_mod_self_left->CF,le_log2->CH,le_of_lt_succ->CI,cast_zero->CP,pos_of_mul_pos_right->CQ,add_sub_cancel_left->CT,pos_of_mul_pos_left->CU,one_le_iff_ne_zero->Dd,sub_eq_zero_iff_le->De,toUInt64_eq->Do,add_one_mul->Dp,div_le_self->Dq,le_of_sub_eq_zero->Dw,cast_ofNat->DF,add_mul_div_left->DG,mod_mul->DH,pow_lt_pow_right->DJ,mul_ne_zero_iff->DR,reducePow->DU,mod_le->DY,not_lt->DZ,cast_pow->Ei,add_sub_of_le->Ej,zero_lt_of_lt->Ek,add_div_right->Em,le_of_not_le->Ev,zero_le->Ey,mod_add_div->Ez,cast_natAbs->EA,sub_le->EI,lt_irrefl->EN,cast_add->ER,cast_mul->ES,lt_asymm->ET,cast_one->EU,succ_pos->EV,mod_one->Fb open UInt64 renaming toNat_add->ξ,toNat_inj->σ,toNat_sub_of_le->Η,toNat_shiftRight->Ξ,toNat_sub->Τ,lt_iff_toNat_lt->Ψ,toNat_shiftLeft->ό,le_iff_toNat_le->ϐ,toNat_zero->Ϝ,toNat_mul->ϯ,toNat_lt->Az,toNat_toUInt32->AA,reduceToNat->Bc,toNat_and->BR,zero_xor->Ch,toNat_ofNat_of_lt'->CG,add_assoc->CY,toNat_not->CZ,toNat_one->Da,zero_shiftRight->Dm,toNat_or->Du,or_eq_zero_iff->DA,zero_shiftLeft->DB,toNat->Er,not_lt->EO,size->Fd open USize renaming le_size->τ,lt_iff_toNat_lt->υ,size->Λ,toNat_one->Φ,toNat_lt_size->ϝ,le_iff_toNat_le->Bs,toNat_sub_of_le->BN,toNat_mul->Dv,toNat_inj->EF,toNat_add->EG open Bool renaming false_eq_true->φ,xor->Ζ,and_eq_true->Ω,not_eq_true'->ϵ,or_eq_true->Ϸ,eq_iff_iff->AB,false_ne_true->AC,and_self->DW,and_true->DX,and_assoc->EK,and_false->EL,xor_false->EM open Array renaming replicate->Χ,ext'->ϻ,getElem_ofFn->AD,size_ofFn->AE,ofFn->AF,mkEmpty->AY,emptyWithCapacity->Ba,emptyWithCapacity_eq->Bw,size_map->CC,getElem_map->CN,getElem_replicate->CW,size_push->Dt,getElem_push_lt->Dy,getElem_push_eq->Dz,getElem_toList->DL,range->DM,size_replicate->DN,toList_push->Eo,all_eq_true->Ep,ext->EP open UInt32 renaming toNat_inj->ύ,toNat_shiftRight->Ϣ,ofNat->Ϥ,toNat_toUInt64->AG,toNat_and->AH,toNat_toUSize->AI,le_iff_toNat_le->AJ,toNat_lt_size->AK,toNat_ofNat'->AL,reduceToNat->CD,toNat_sub->CX,toNat_sub_of_le->Dj,toNat_shiftLeft->Dk,lt_iff_toNat_lt->Dl,ofNat_toNat->Ee,xor_zero->EE,size->Fc open List renaming range->ϒ,range'_succ->Ϩ,ext_getElem->ϩ,length_ofFn->AM,getElem_ofFn->AN,foldl_cons->AO,range'->Bd,drop_of_length_le->BL,mem_range->BM,range_eq_range'->Ca,map_congr_left->Ck,size_toArray->CK,append_assoc->CL,length_range->CM,map_cons->CR,map_map->Df,sum_map_mul_right->Dg,getElem_cons_zero->Dh,length_nil->Dr,length_map->Ds,length_singleton->Dx,ofFn->DP,map_add_range'->DS,sum_cons->DV,length_cons->Ex,nil_append->EB,mem_map->EZ open FloatFormat renaming toModel->ϓ,binary32->AZ,subnormalAlignExp->Cb,ieeeMinNormalExponent->Ef,ieeeMaxNormalExponent->Eg open Model.NativeBinary32 renaming mkBits->ϥ,roundRatScaled->AW,ofUInt32_roundRatScaled->Bf,ofUInt32->Bj,ofUInt32_mkBits->BB open Int renaming add_emod->Ϫ,emod_eq_emod_iff_emod_sub_eq_zero->By,ofNat->BG,toNat_of_nonneg->Cj,add_mul_emod_self_left->CA,negSucc->CJ,shiftLeft_eq->CV,ofNat_eq_natCast->DK,ModEq->DO,ModEq.add_right->DT,zero_add->EW,sub_emod->EX,toNat->Fe open Int64 renaming ofInt->ϱ open FloatLib.Numerics renaming roundQuotientEven->AP,roundShiftRightEven->AQ,shiftRightJam->AR,FixedWord.roundShiftRightEven_toNat->Bg,roundShiftRightEven_shiftRightJam->Bh,FixedWord.roundShiftRightEven->Bm,roundShiftRightEven_le_succ->Bn,or_one_eq->Bu,Dyadic->BD,roundShiftRightEven_eq_roundQuotientEven->BQ,roundShiftRightEven_mul_two_pow_of_le->Cc,roundShiftRightEven_eq_guard_sticky->Cl,div_two_pow_le_roundShiftRightEven->Cq,roundShiftRightEven_mul_two_pow->CE,shiftRightJam_ne_zero->DC,Radix.toReal->Fa open Model renaming toReal->AS,roundDyadicGeneral->AT,addDyadic->AU,roundDyadicGeneral_eq_roundDyadic->AV,isNaN_eq_false_of_toDyadic?_some->AX,isInf_eq_false_of_toDyadic?_some->Be,ofModel_finite_normalized_eq_ofFields->Bo,roundDyadic->Bt,packRoundedSubnormal->Bv,isFinite->BI,div->BO,signBit->BS,ofModel->BT,isZero->Cm,finishRoundedMantissa->Cn,add->Cr,zero->Cs,pow2->Ct,maximum->CO,packRoundedNormal->CS,toNatBits->Dn,ofUInt32->DD,nativeOverflow->DE,fma->Eu,ofFields->EH,ofBits->EQ open Or renaming inl->Ea,inr->EY open FloatLib.Numerics.Dyadic renaming cast_toRat->BC,add_toRat->BF,toRat_eq_zero_iff->Di,addFields->Eb,mul_toRat->Ec,mulFields->Ed,add->EC,mul->ED open Float.Model renaming totalExponent->Bb open Real renaming sqrt->Db open Float.Model.UnpackedFloat renaming roundWithAccuracy->Bp,accuracyOfFraction->Dc open Float.Model.Format renaming targetExponent->BH open FloatLib.Numerics.RationalBinary renaming lessThanPowerOfTwo->Bi,atLeastPowerOfTwo->Bk,scaleByPowerOfTwo->Bl,floorLog2->Br 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 "܅"=>UInt32.toUInt64 (x :) local notation:max x:max "܉"=>UInt64.toNat_lt (x :) local notation:max x:max "܊"=>ExactRuntime.ConvShape.stride (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 "߸"=>Nat.toUInt64 (x :) local notation:max x:max "՜"=>UInt64.toUInt32 (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 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 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) local notation"ހ"=>4294967295 local notation"ށ"=>1048576 local notation"ނ"=>16777216 local notation"ރ"=>8388608 local notation"ބ"=>4611686018427387904 local notation"ޅ"=>0xFFFF 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[add,total,j,e,f];cases b<;>refine⟨by simp[add,j,addLimbs64_size,e],by simp[add,j,addLimbs64_size,f],by simp[add,j],by simp[add,j],?_⟩<;>simp only[add,j,ש,φ,ר,addLimbs64_eq _ _ _ g,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܀):Bt κ ⟨s,shiftRightJam m j,e+j⟩=Bt κ ⟨s,m,e⟩:=by obtain⟨l,b,d⟩:j<=m܀/\23<=m܀-j/\23<=m܀:=א;have f:m≠0:=by rintro rfl;simp at h have g:2^(j+1)<=m:=Cp (Ι ב ((ώ (j+1) 24).trans h)) (ϰ f);rw[<-AV,<-AV];unfold AT;have p:κ߷=23:=rfl;have q:ض=-149:=rfl;have r:κ.minNormalExponent=-126:=rfl;simp only[beq_iff_eq,log2_shiftRightJam m j g,DC m j (Cp (Ι ב (ώ j 1)) g),f,ϗ l,sub_add_add_cancel,p,q,r,b,d,↓reduceIte];clear f g l b d p q r;split_ifs;rfl;congr 1;obtain⟨a,b⟩:=Int.eq_negSucc_of_lt_zero (א:e+j- -149<0);obtain⟨d,k⟩:e- -149=CJ (j+a)/\0ٳ | 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;simp[Yg];next k b=>rw[Cv _ 1,Yg,Yg,b,BU i 1 k,Ϟ 1 k];ring lemma ZbG (a b:ؽ ٳ)(i j k:ٳ)(h:∀t,ta[i+t]! =b[j+t]!):Yg a i k=Yg b j k:=by induction k generalizing i j;rfl;next k d=>rw[Yg,Yg,d (i+1) (j+1) (λ t e=>by rw[(א:i+1+t=i+(t+1)),(א:j+1+t=j+(t+1))];exact h (t+1) א),(by simpa using h 0 א:a[i]! =b[j]!)] lemma Zw (a:ؽ ٳ)(i k:ٳ):Yg a i k=0↔∀t,ta[i+t]! =0:=by induction k generalizing i with |zero=>simp[Yg] |succ k d=>rw[Yg,Nat.add_eq_zero_iff,Ax,d (i+1)];constructor;rintro⟨f,b|b⟩ t g;exact absurd b ג;rcases t with _|t;simpa using f;rw[(א:i+(t+1)=i+1+t)];exact b t א;intro h;refine⟨by simpa using h 0 א,EY λ t g=>?_⟩;rw[(א:i+1+t=i+(t+1))];exact h (t+1) א lemma ZbH (a:ؽ ٳ)(i k:ٳ)(h:∀t,ta[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[(א:i+1+t=i+(t+1))];exact h (t+1) א);simp at d;rw[Yg,(by ring:32*(k+1)=32+32*k),pow_add];linarith lemma O0 (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;simp[Yg,BL (by simpa using h:a܍.length<=i),ϋ];rename_i b;rw[Yg,b (i+1) א];by_cases d:ia[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,(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%߿+߿-tb%߿-br;YP a b (i+1) (ta/߿) (tb/߿) (1-t/߿) (out.push (t%߿)) k lemma N9 (a b:ؽ ٳ)(i f g e:ٳ)(d:ؽ ٳ)(k:ٳ) (j:e<=1)(h:∀t,td[t]! < 2^32): let r:=YP a b i f g e d k r.1ٽ=d܃+k/\(∀t,tr.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%߿+߿-o%߿-e;obtain⟨w,x,p⟩:=q (i+1) (n/߿) (o/߿) (1-t/߿) (d.push (t%߿)) (EI _ _) (by intro s l;simp only[Dt]at l;rcases Ap (Ao.mp l)with l|rfl;rw[ح _ s ו,Dy l,<-ح d s l];exact h s l;rw[ح _ _ ג,Dz];omega);refine⟨by simp[w];omega,x,?_⟩;simp only[Dt]at p⊢;rw[(א:d܃+(k+1)=d܃+1+k),p,(by rw[Zv,ZbG _ d 0 0 d܃ (λ s l=>by rw[ح _ _ ו,Dy א,<-ح d _ א])];simp only[Yg,Β,Co,ϑ];rw[ح _ _ ג,Dz]:Yg (d.push (t%߿)) 0 (d܃+1)=Yg d 0 d܃+2^(32*d܃)*(t%߿)),Yg,Yg];simp only[ER,ES,Ei,DF];linear_combination (2:ٴ)^(32*d܃)*(by clear* -j;omega:((t%߿:ٳ):ٴ)+߿*((n/߿:ٳ)-(o/߿:ٳ)-(1-t/߿:ٳ))=(a[i]!:ٴ)-b[i]!+f-g-e) 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,tr[t]! =0:=by induction k;intro t a;omega;next k b=>simp only[YW]at h;split at h;cases h;rename_i d;intro t a;rcases Ap (Ao.1 a)with a|rfl;exact b h t a;simpa using d lemma N8 (r:ؽ ٳ)(k h:ٳ)(d:YW r k=some h):htr[t]! =0:=by induction k;simp[YW]at d;rename_i j;simp only[YW]at d;split at d<;>rename_i f;cases d;exact⟨א,by simpa using f,λt g e=>א⟩;obtain⟨a,b,c⟩:=j d;refine⟨א,b,λt g e=>?_⟩;rcases Ap (Ao.1 e)with e|rfl;exact c t g e;simpa using f lemma N7 (r:ؽ ٳ)(k:ٳ):YX r k=false↔∀t,tr[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 Ap (Ao.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 ((N7 r k).1 h)];rfl;simp;exact λ b=>by have:=(N7 r k).2 (a.1 b);simp_all 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 q:x%4<4:=Ε x ב;have f:a+2^(32*h)*(x%4)<4*2^(32*h):=by nlinarith 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;obtain p|p:=Ax.1 o.2<;>omega;intro d;simp at d;simp[d.1,d.2] unfold AR;dsimp only;rw[(ז:2^(32*h+2)=4*2^(32*h)),(by (conv_lhs=>rw[<-Ez x 4]);ring:a+2^(32*h)*(x+2^32*y)=(a+2^(32*h)*(x%4))+4*2^(32*h)*(y*1073741824+x/4)),DG _ _ א,Υ f,Β,CF,ν f];by_cases j:x%4≠0\/a≠0;have:¬(a+2^(32*h)*(x%4)=0):=λ d=>g.1 d j;simp only[beq_iff_eq,this,ש,(ז:(x%4 !=0||a !=0)=true),ר];have:=g.2 j;simp only[beq_iff_eq,this,ר,(ז:(x%4 !=0||a !=0)=false)];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;π (Bt κ ⟨neg,m,e+((32*h+2:ٳ):ٴ)⟩) lemma F9 (b:ف)(R:ٳ)(e:ٴ)(a:ف)(d:R≠0):ρ (if b then-(R:ٴ)else R) e a=π (Bt κ ⟨b,R,e⟩):=by have f:(0:ٴ)simp[ρ,ofIntDyadic,d,not_lt.2 f.le,Ο d] lemma N6 (b:ف)(r:ؽ ٳ)(e:ٴ)(a:ف)(d:∀t,tr[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⟩:=N8 r _ 0 g;rw[(א:r܃=1+(r܃-1)),Zv,(Zw r (0+1) (r܃-1)).2 (λ t f=>k _ א א)];simp[Yg] rename_i h g;obtain⟨p,j,k⟩:=N8 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[(א:r܃=h+(2+(r܃-h-2))),Zv,Zv,(Zw r (0+h+2) _).2 (λ t f=>k _ א א)];simp[Yg] 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[CH n,l];have:=Ο j;calc 2^(32*h+2+25)<=2^(32*h)*2^32:=by rw[<-Κ];exact Ι ב א _<=2^(32*h)*(r[h]!+2^32*r[h+1]!):=by gcongr;linarith _<=_:=א rw[F9 b _ e a n,<-ZbF b _ e _ s,l,ZbM _ _ _ h (ZbH r 0 h (λ t f=>d _ א)),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->ta[t]! =0/\b[t]! =0:=by induction k<;>intro t d e;omega;rename_i f;simp only[Yab]at d;split at d;omega;rename_i g;rcases Ap (Ao.1 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 (Ba 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 (Ba 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 Q2 (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 O0 _ t א have s:=q b (Ea rfl);have u:=q d (EY rfl);rw[show(Ba n:ؽ ٳ)=#[] from rfl];have v:=N9 b d g 0 0 0 #[] n א ג;have w:=N9 d b g 0 0 0 #[] n א ג;have z:Yg (#[]:ؽ ٳ) 0 0=0:=rfl;simp only[CK,Dr,Co,pow_zero,one_mul,z,CP,zero_add]at v w;obtain⟨-,A,x⟩:=v;obtain⟨-,B,y⟩:=w;split_ifs with k l;rw[N6 false _ _ _ A,Aa,s,u];simp;congr 1;simp only[k]at x;linear_combination (2:ٴ)^(32*g)*x;rw[N6 true _ _ _ B,Aa,s,u];simp;congr 1;simp only[l]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;rfl;rename_i 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 Q1 (g j:ٳ->ؼ)(A B:ؽ ؼ)(n:ٳ)(o:∀k,kA[k]! =g k)(r:∀k,kB[k]! =j k)(f:Acc)(e d:ٳ)(h:e+d<=n)(t:f.posٽ=18)(u:f.negٽ=18)(l:(Yw g j f.pos f.neg f.special f.negZero e d).special=false):f.special=false/\(∀k,e<=k->k< e+d->θ A[k]! ≠255/\θ B[k]! ≠255)/\(Yw g j f.pos f.neg f.special f.negZero e d).total=f.total+dsum A B e d/\(Yw g j f.pos f.neg f.special f.negZero e d).negZero=(f.negZero&&dallNZ A B e d):=by induction d generalizing f e with |zero=>cases f;simp_all[Yw,dsum,dallNZ] |succ count C=>obtain⟨p,q,s,z⟩:=f;have v:=o e א;have w:=r e א;rw[Yw,Yy]at l⊢;generalize g e=a,j e=b at*;by_cases x:θ a=255\/θ b=255;simp[x,Acc.markSpecial,ZbP]at l;have y:=not_or.1 x;obtain⟨D,E,F,G,H⟩:=Acc.add_spec ⟨p,q,s,z⟩ (ε a*ε b) (γ a+γ b) (Ζ (η a) (η b)) t u (mul_mant_lt _ _) (by have:=idxOf_le _ y.1;have:=idxOf_le _ y.2;omega);rw[if_neg x]at l⊢;obtain⟨I,J,K,L⟩:=C _ (e+1) א D E l;refine⟨F▸I,?_,?_,?_⟩;intro k N O;by_cases M:k=e;subst M;rw[v,w];exact y;exact J k א א;rw[K,H,dsum,v,w,Zn];ring;rw[L,G,dallNZ,v,w];simp[EK] 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 y;set B:=ڀ n λ i=>b i with z;set d:=Yw a b (Χ 18 0) (Χ 18 0) false true 0 n;cases l:d.special;swap;simp[l] obtain⟨-,f,g,o⟩:=Q1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א rfl rfl l;have o:d.negZero=dallNZ A B 0 n:=o;simp only[l,φ,ש];rw[Q2,<-Acc.total];obtain⟨p,u⟩:Aٽ=n∧Bٽ=n:=by simp[y,z] obtain⟨C,D⟩:=dotStateLoop_flags A B {} 0 n (by simp[p]) (by simp[u]) f;set L:=A.map (DD (fmt:=κ)) with h;set R:=B.map (DD (fmt:=κ)) with v;obtain⟨e,w⟩:Lٽ=Rٽ∧Lٽ=n:=ז;have q:∀ k (r:kf k E א)).trans (by rw[w,(by rwa[Acc.total_empty,EW]at g:d.total=dsum A B 0 n)]);have x:=Model.Reduction.Internal.dotState_exact_toRat (destination:=κ) L R e q s;unfold dotSpec Model.dot;by_cases j:d.total=0;rw[Model.Reduction.dotWithStatus_eq_zero_of_finite κ L R .nearestEven e q s (by rw[<-Di,x,t,j];simp),j,finishWord_zero];simp[Model.Reduction.Internal.dotState,Except.map,h,v,p,C,D,o];rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero κ L R .nearestEven e q s (by rw[Model.Reduction.Semantics.finiteDot_toList_eq_slice L R e,t];simpa using j)];exact finishWord_of_ne _ _ _ _ j (by rw[x,t]) lemma Z6 (a:ؽ ؼ)(n:ٳ)(h:n=a܃):(ڀ n λ i=>a[i܂]!)=a:=by subst h;apply EP ג;intro i d b;rw[AD,ح a i b] lemma ZbQ (n:ٳ)(c:ؼ):(ڀ n λ _=>c)=Χ n c:=by apply EP ג;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;next 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 Q0 (w:δ):π (ι w)=w:=by apply ύ.1;simp only[π,ι,Dn,ofUInt32_bits];exact ν w.toBitVec.isLt lemma P9 (z:Model κ):ι (π z)=z:=by have h:Dn z<2^32:=Model.toNatBits_lt_two_pow z;simp only[ι,π,DD,AL,ν 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[<-BC,ϙ,ZbT];push_cast;rw[zpow_sub₀ two_ne_zero,ؠ];ring lemma ZH (w:ؼ):(θ w)؎=w؎/2^23%256:=by simp only[θ,AH,Ϣ,ψ];exact ϡ _ 8 lemma ZR (w:ؼ):(fracOf w)؎=w؎%2^23:=ϡ _ 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 K1 (w:δ):ε w<<<γ w=mg w؎:=by unfold ε γ mg;simp only[<-ύ,UInt32.toNat_zero,ZH,ZR,Α];split<;>simp lemma ZS (a b:ٳ)(h:a%2^31nlinarith[BE (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[K1,K1];simp only[compare,compareOfLessAndEq,DU]at*;generalize a؎%2147483648=A at*;generalize b؎%2147483648=B at*;split_ifs<;>first|rfl|omega lemma ZbV (a:δ)(b:θ a≠255):ι a=(if Cm (ι a)&&Cm (ι a)then Cs κ (BS (ι a)&&BS (ι a))else ι a):=by simp only[DW];split . rename_i d;obtain⟨e,f⟩:=(Model.isZero_iff_fields_of_isFinite (by simp[ι,isFinite_ofUInt32,b])).1 d;conv_lhs=>rw[<-Model.ofFields_signBit_expField_fracField (ι a),e,f] cases BS (ι a)<;>decide . rfl @[inline] def YQ (a b:δ):δ:= if θ a=255\/θ b=255 then π (CO (ι a) (ι b)) else match compare (Yac a) (Yac b)with | .lt=>b | .gt=>a | .eq=>if a=b then a else π (if Cm (ι a)&&Cm (ι b)then Cs κ (BS (ι a)&&BS (ι 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.1 h) d;rw[Model.cmpDyadic_eq_iff,Zx,Zx,compare_eq_iff_eq.1 h];rw[Model.cmpDyadic_gt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_gt_iff_gt.1 h) d lemma ZbX (a b:δ):ι (YQ a b)=CO (ι a) (ι b):=by unfold YQ;split;exact P9 _;next d=>rw[ZbU];have e:=Ϡ a (d∘Ea);have f:=Ϡ b (d∘EY);have g:Model.compare (ι a) (ι b)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e f;rw[ZbW]at g;unfold CO;rw[Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff _ _).2 ⟨AX e,AX f⟩:Model.chooseNaN2 (ι a) (ι b)=none),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ g];cases compare (Yz a) (Yz b)<;>simp only[P9,apply_ite ofW];by_cases h:a=b;subst h;rw[if_pos rfl];exact ZbV a (d∘Ea);rw[if_neg h] def Yad (c h w k:ٳ) (inp:ؽ δ):ؽ δ:= AF (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=>CO m (ι (p t))) (ι b)=ι (l.foldl (λ a t=>YQ a (p t)) b):=by induction l generalizing b;rfl;next t l d=>simp only[AO,<-ZbX,d] lemma P8:Yad=maxpoolSpec:=by funext c h w k a;simp only[Yad,maxpoolSpec,ZbY,Q0] 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,P8,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;rfl;next 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;rfl;next 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;rfl;rename_i 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):=not_or.2 n;unfold Yy 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܂;set B:=ڀ n λ i=>b i܂;set e:=Yw a b (Χ 18 0) (Χ 18 0) false true 0 n;have f:e.special=false:=Zb2 a b _ _ true 0 n (λ k _ r=>d k א);obtain⟨-,-,g,h⟩:=Q1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א rfl rfl f simp only[f,φ,ש];rw[Q2,show((ϋ e.pos܍:ٴ)-ϋ e.neg܍)=e.total from rfl,(by simp only[Acc.total_empty,EW]at g;rwa[<-Zb0 n a b 0 n א]:e.total=Yo a b 0 n),(by rwa[<-Zb1 n a b 0 n א]:e.negZero=Yq a b 0 n)] 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):(EH κ 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,EQ,Dn,BitVec.toNat_ofNatLT];have d:E&&&κ.expAllOnesNat=E:=Bx (n:=8) b;have e:F&&&κ.fracMaskNat=F:=Bx (n:=23) a;rw[d,e,show E.shiftLeft κ߷=E<<<23 from rfl,Nat.or_assoc,<-Bq a];cases s;simp[Α];simp only[ר];rw[show Nat.shiftLeft 1 (κ.expWidth+κ߷)=1<<<31 from rfl,<-Bq (א:E<<<23+F<2^31)];simp;omega @[inline] def Yv (neg:ف) (E F:ؼ):ؼ:=(if neg then (߾:ؼ)else 0)+(E<<<23)+F lemma ZT (a:ف)(E F:ؼ)(b:E؎<256)(d:F؎<2^23):Yv a E F=π (EH κ a E؎ F؎):=by unfold π;rw[Zb3 a _ _ b d];apply ύ.1;unfold Yv;cases a<;>simp<;>omega lemma P7 (a:ف):Yv a 255 0=π (DE κ a):=by rw[Model.nativeOverflow_eq_signedInf_of_isIEEE Fmt ד];cases a<;>decide lemma Zb4 (a:ف):Yv a 0 0=π (Cs κ 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.1 j);apply σ.1;rw[l,h];rfl);exact⟨א,(Am (Δ _)).1 (Dd.2 this)|>.trans' ג,by rwa[(א:r˧+d˧+d˧=r˧+2*d˧)]⟩;simp only[j,ש,φ];exact⟨א,b,(Nat.div_eq_zero_iff_lt (Δ _)).1 (by rw[<-l,(ז:x>>>(r+d)=0)];rfl)⟩ lemma Zj (x:ػ)(a:x≠0):(Yj x)˧=x˧܀:=by have b:1<=x˧:=Dd.2 λh=>a (σ.1 (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((Af א).2 ⟨r,s⟩).symm @[inline] def Ybm (m:ػ) (e:ٴ):ػ:= match e+149 with | .ofNat k=>m<<Bm 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=π (Bv κ a (Cs κ a) (match e-ض with|BG shift=>m˧<<AQ m˧ (shift+1))):=by rw[show ض= -149 from rfl,Int.sub_neg];unfold YaO Ybm;generalize l: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՜)=π (Bv κ a (Cs κ a) F) by rcases s with k|k;simp at l;have o:m˧*2^k<2^23:=(Aj (Ak (n:=m˧)) (Δ k)).trans_le (by rw[<-Κ];exact Ι א א);exact H _ (m˧<<g (σ.1 h),ש];by_cases f:0x800000<=d;simp only[f,ר,show d˧>=Ct Fmt߷from f];exact ZT a 1 0 ד ד;simp only[f,ש,show¬d˧>=Ct Fmt߷from f];have j:d՜؎=d˧:=ν א;exact j▸ZT a 0 _ ד (by rw[j];exact Nat.lt_of_not_le f) @[inline] def YK (m L:ػ):ػ:= if 23<=L then Bm 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 AQ m˧ (m˧܀-κ߷)else m˧<<<(κ߷-m˧܀))/\2^23<=(YK m (Yj m))˧/\(YK m (Yj m))˧<=2^24:=by have k:m˧≠0:=λh=>a (σ.1 (by simpa using h));have b:=Zj m a;have f:=ϰ k;have g:m˧<2^(m˧܀+1):=Ak;rw[show κ߷=23 from rfl];unfold YK;generalize Yj m=L at b⊢;generalize q:m˧܀=N at*;by_cases h:23<=N have d:(23:ػ)<=L:=by rw[ϐ,b];exact h simp only[d,ר,h,(ח:(L-23)˧=N-23),Bg];exact⟨trivial,(by rw[Am (Δ _),<-Κ,Ej h];exact f:2^23<=m˧/2^(N-23)).trans (Cq _ _),(Bn _ _).trans (by rw[An (Δ _),<-Κ,(by clear*-h;omega:24+(N-23)=N+1)];exact g:m˧/2^(N-23)<2^24)⟩;simp only[(by rw[ϐ,b];exact h:¬(23:ػ)<=L),ש,h];have j:m˧*2^(23-N)<2^24:=(Aj g (Δ _)).trans_eq (by rw[<-Κ];congr 1;clear*-h;omega) rw[(by rw[ό,(by rw[Η _ _ (by rw[ϐ,b];exact Ev h),b];rfl:(23-L)˧=23-N),ν (Ρ (EI 23 N) ד),Α];exact ν (j.trans ד):(m<<<(23-L))˧=m˧*2^(23-N)),Α];exact⟨rfl,(by rw[<-Κ,Ej (Ev h)]:2^23=2^N*2^(23-N)).trans_le (ω _ f),j.le⟩ lemma K3 (n:ٳ)(h:n<2^32):n.toUInt32؎=n:=by rw[Cd,AL,ν h] lemma Zb6 (a:ف)(m:ػ)(e:ٴ)(b:m≠0)(d:¬((m˧܀:ٴ)+e>127))(f:¬((m˧܀:ٴ)+e< -126)):Yae a m (Yj m) ((m˧܀:ٴ)+e)=π (CS κ a (DE κ a) (↑m˧܀+e) (if κ߷<=m˧܀then AQ m˧ (m˧܀-κ߷)else m˧<<<(κ߷-m˧܀))):=by obtain⟨q,r,s⟩:=Z7 m b;rw[<-q];unfold Yae CS;generalize YK m (Yj m)=g at r s⊢;generalize (m˧܀:ٴ)+e=t at d f⊢;simp only[Model.pow2_eq_two_pow,show κ߷=23 from rfl,show κ.maxNormalExponent=127 from rfl,show κ.exponentBias=127 from rfl,show κ.maxFiniteExpField=254 from rfl,show κ.maxFiniteFracField=8388607 from rfl,DU,Nat.reduceAdd,DK,DF];by_cases k:g˧=ނ . have l:(g==0x1000000)=true:=beq_iff_eq.2 (σ.1 k);simp only[l,ר,k,BEq.rfl];by_cases o:t+1>127 . simp only[o];exact P7 a . simp only[o,ש];have j:((t+128)׆.toUInt32)؎=(t+1+127)׆:=by rw[K3 (t+128)׆ א,add_assoc];rfl rw[if_neg ז,ZT a _ 0 (by rw[j];omega) ד,j];rfl . have l:(g==0x1000000)=false:=beq_eq_false_iff_ne.2 λ h=>k (by rw[h];rfl) have u:(g˧==ނ)=false:=ז;simp only[l,u,φ,ש,(א:¬t>127)];have j:=K3 (t+127)׆ א;have p:(g՜-0x800000)؎=g˧-ރ:=by rw[Dj _ _ (by rw[AJ];simp;omega)];simp;clear* -r s;omega rw[if_neg ז,ZT a _ _ (by rw[j];omega) (by rw[p];clear* -s k;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=π (AT κ ⟨a,m˧,e⟩):=by have g:m˧≠0:=λh=>b (σ.1 (by simpa using h));unfold YA AT;simp only[(by simpa using g:(m˧==0)=false),φ,ש,Zj m b,show κ.maxNormalExponent=127 from rfl,show κ.minNormalExponent= -126 from rfl];by_cases f:(m˧܀:ٴ)+e>127;simp only[f,ר];exact P7 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)˧=AQ n˧ 40:=by rw[Cl _ _ ד];have b:(n>>>40)˧=n˧/2^40:=by rw[Ξ,ψ];rfl have e:((n>>>40)&&&1)˧=n˧/2^40%2:=ח;have k:=Ε n˧ (Δ 40);have l:n˧/2^40<2^24:=(An ד).2 n܉ unfold YY;simp only[ξ,Ξ,(by rw[BR,show(0xFFFFFFFFFF:ػ)˧=2^40-1 from rfl,ϡ]:(n&&&0xFFFFFFFFFF)˧=n˧%2^40),e,BJ,(by rw[(ב:(2:ٳ)^40=2^39*2),Cw]:n˧/2^(40-1)%2=n˧%2^40/2^39),(by rw[(ב:(2:ٳ)^40=2^39*2),Nat.mod_mul_right_mod]:n˧%2^(40-1)=n˧%2^40%2^39)];clear b e;generalize n˧%2^40=R at*;simp only[Bc,ψ]at*;split<;>rename_i h<;>simp at h<;>generalize n˧/1099511627776=Q at*<;>rw[ν (a:=R+549755813887) א,ν (a:=R+549755813887+Q%2) א]<;>[rw[(א:(R+549755813887+Q%2)/1099511627776=1)];rw[(א:(R+549755813887+Q%2)/1099511627776=0)]]<;>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 (߾:ؼ)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 P6 (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 k:=Zj m b;obtain⟨o,p,q⟩:=Z7 m b;have j:m˧܀<64:=(Ϻ λh=>b (σ.mp h)).mpr m܉;have l:(YY (m<<<(63-Yj m)))˧=(YK m (Yj m))˧:=by rw[Zb7,o,(by rw[ό,(by rw[Τ,k];simp;clear*-j;omega:(63-Yj m)˧=63-m˧܀),ν (by clear*-;omega:63-m˧܀<64),Α];exact ν ((Aj Ak (Δ _)).trans_eq (by rw[<-Κ,(by clear*-j;omega:m˧܀+1+(63-m˧܀)=64)])):(m<<<(63-Yj m))˧=m˧*2^(63-m˧܀)),show κ߷=23 from rfl];split<;>rename_i g;rw[(by clear*-g j;omega:(40:ٳ)=m˧܀-23+(63-m˧܀)),CE];rw[Cc _ _ _ (by clear*-g j;omega),Α,(by clear*-;omega:63-m˧܀-40=23-m˧܀)] simp only[YA,k,show¬(m˧܀+e>127)by clear*-d f;omega,show¬(m˧܀+e< -126)by clear*-d f;omega,ש];apply ύ.mp;rw[Zb8 a u _ f (by clear*-l p q;omega),l];unfold Yae;generalize YK m (Yj m)=n at l p q⊢;generalize (m˧܀:ٴ)+e=t at d⊢;clear b k o j;by_cases g:n˧=ނ;simp only[show(n==0x1000000)=true by simp[<-σ,g],ר];by_cases v:t+1>127<;>simp only[v,ר,ש]<;>rw[Z8 a _ _ (by simp<;>omega)]<;>simp<;>omega;simp only[show(n==0x1000000)=false by simp[<-σ,g],φ,ש];rw[Z8 a _ _ (by simp[CX];omega)];simp[CX];omega lemma P5 (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:=Nat.pos_iff_ne_zero.1 (Ag (Δ 63) b);have g:n≠0:=λ h=>f (by rw[h];rfl);have j:n˧܀=63:=(Af f).2 ⟨b,n܉⟩;have:=P6 a n E u g (by rw[j];push_cast;omega) d;rwa[(σ.1 (by rw[Zj n g,j];rfl):Yj n=63),show n<<<(63-63:ػ)=n from σ.1 (by rw[ό];simp only[UInt64.reduceSub];exact ν n܉)]at 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 Cj (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 P4 (e:ٴ):Y0 e ((ϱ e).toInt==e) (ϱ e).toUInt64:=λ c a b d=>Zb9 e c a (beq_iff_eq.1 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 P3 (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 (σ.1 (by simpa using h));have l:=Zj m b;have q:=(Ϻ k).2 m܉;unfold Yau Ybn;dsimp only;split;swap;rfl rename_i h;simp at h;obtain⟨n,g⟩:=h;have o:(Yj m+126)˧=m˧܀+126:=by rw[ξ,l];simp;omega rw[CY]at g⊢;have j:(B+(Yj m+126))˧<=253:=by simpa using ϐ.1 g have p:=f _ (by rw[o];omega) n j;exact P6 a m e _ b (by rw[p];omega) j @[inline] def YaP (w:ػ) (e:ٴ) (negZero ok:ف) (B:ػ):ؼ:= if w=0 then (if negZero then߾else 0) else let neg:=w>>>63 !=0;Yau neg (if neg then 0-w else w) e ok B lemma L6 (w:ػ)(e:ٴ)(a b:ف)(B:ػ)(d:Y0 e b B):YaP w e a b B=ρ (Ym w) e a:=by unfold YaP ρ;by_cases f:w=0;subst f;simp[Ym];have r:w˧≠0:=λh=>f (σ.1 (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;rw[(by unfold Ym;omega:Ym w=(w˧:ٴ)),(by simp;apply σ.1;simp;omega:(w>>>63 !=0)=false)];simp only[φ,ש,Int.natAbs_natCast];refine⟨ג,trivial,א⟩;rw[(by unfold Ym;simp only[h,ש]:Ym w=(w˧:ٴ)-2^64),(by simp;intro e;have:=congrArg Er e;simp at this;omega:(w>>>63 !=0)=true)];simp only[ר,(by rw[Τ];simp;omega:(0-w)˧=2^64-w˧)];refine⟨ו,א,א⟩ simp only[f,ש,n];rw[<-AV];have j:(if (w>>>63 !=0)=true then 0-w else w)≠0:=ז;rw[P3 _ _ _ _ _ j d,ZU _ _ _ j,l,k];rfl def YaQ (w:ػ) (e:ٴ) (negZero:ف):ؼ:= YaP w e negZero ((ϱ e).toInt==e) (ϱ e).toUInt64 lemma H1 (w:ػ)(e:ٴ)(a:ف):YaQ w e a=ρ (Ym w) e a:= L6 w e a _ _ (P4 e) lemma Zcb (V s:ٳ)(h:s+25<=V܀):(AR V s)܀=V܀-s:=by have a:2^(V܀-s)<=V/2^s:=by rw[Am (Δ _),<-Κ,(א:V܀-s+s=V܀)];exact ϰ (by rintro rfl;simp at h) have b:V/2^s<2^(V܀-s+1):=by rw[An (Δ _),<-Κ,(א:V܀-s+1+s=V܀+1)];exact Ak unfold AR;simp only;split;exact(Af א).2 ⟨a,b⟩;rw[Bu];split;apply(Af א).2;omega;exact(Af א).2 ⟨a,b⟩ lemma P0 (b:ف)(V s:ٳ)(e:ٴ)(h:s+25<=V܀):AT κ ⟨b,AR V s,e+s⟩=AT κ ⟨b,V,e⟩:=by have d:V≠0:=by intro j;subst j;simp at h have k:2^s<=V:=Cp (Ι ב א) (ϰ d);have l:=DC V s k;have n:=Zcb V s h;unfold AT;simp only[show(AR V s==0)=false by simpa using l,show(V==0)=false by simpa using d,φ,ש,n];rw[(א:((V܀-s:ٳ):ٴ)+(e+s)=V܀+e)];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-ض=CJ a/\s+2<=a+1:=by refine⟨(-(e+149)-1)׆,?_,א⟩;omega rw[g.1,((by clear* -g t;omega):e+(s:ٴ)-ض=CJ (a-s))];simp only;rw[((by clear* -g;omega):a-s+1=a+1-s),Bh V s (a+1) g.2];rename_i _ f;have q:κ߷<=V܀-s:=by rw[show κ߷=23 from rfl];omega simp only[q,(א:κ߷<=V܀),ר];rw[show κ߷=23 from rfl,Cu V܀ s 23,Bh V s (V܀-23) א] lemma Z9 (b a d:ػ)(L:ٳ)(e:d˧=L)(g:L<=63)(f: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 j:(63-d)˧=63-L:=by rw[Η _ _ (by rw[ϐ,e];simp;omega),e];rfl have h:(2:ٳ)^64=2^(63-L)*2^(L+1):=by rw[<-Κ];congr 1;omega refine⟨by rw[Du,(by rw[ό,j,ν (א:63-L<64),Α,ν];rw[h,Θ (2^_)];exact Aj f (Δ _):(b<<<(63-d))˧=b˧*2^(63-L)),(by rw[Ξ,Ξ,e,ν (א:L<64)];simp only[Bc,BY,ψ,ϧ,<-Nat.pow_succ]:((a>>>d)>>>1)˧=a˧/2^(L+1)),(by rw[h,<-ϣ,Ϟ,ϔ _ _ (Δ _),Ϟ]:(b˧*2^64+a˧)/2^(L+1)=b˧*2^(63-L)+a˧/2^(L+1)),<-Α,<-Bq (by rw[An (Δ _),<-h];exact a܉:a˧/2^(L+1)<2^(63-L))],?_⟩;rw[h,<-ϣ,Nat.mul_add_mod_self_right,AB];simp[<-σ,(by rw[ό,j,ν (א:63-L<64),Α,h,Θ (2^(63-L)),Nat.mul_mod_mul_right]:(a<<<(63-d))˧=a˧%2^(L+1)*2^(63-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 Zcc (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;by_cases l:b=0;simp[e,l]at*;omega;have g:b˧≠0:=λh=>l (σ.mp (by rw[h];rfl));simp[e,l,ξ,CZ]at*;clear h;omega;have f:a˧≠0:=λh=>e (σ.mp (by rw[h];rfl));simp[e,ξ,CZ]at*;clear h;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 O9 (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 (σ.1 b);exact⟨CI ((Ϻ a).2 m܉),Ak,ϰ a⟩ lemma QH (m r K:ٳ)(a:2^K<=m):2<=(m*2^64+r)/2^(K+1):=by rw[Am (Δ _)];calc 2*2^(K+1)=2^K*2^2:=by rw[<-Κ,<-Nat.pow_succ'] _<=m*2^64:=Ar 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 (σ.1 (by rw[d];rfl));apply(Af (Nat.ne_of_gt (Ag (ϊ (Ο b) (Δ s)) (ώ _ _)))).2;constructor;rw[Κ,Θ];exact(ω _ (ϰ b)).trans (ώ _ _);exact(by rw[Dp];omega:m˧*2^s+r<(m˧+1)*2^s).trans_le ((ω _ (@Ak m˧)).trans_eq (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 Er h;rw[b,Ϝ]at e;split at e;omega;rw[Bu]at e;split at e<;>omega lemma Zcd (b:ف)(a d:ػ)(e:ٴ)(f:a≠0):Yag b a d e=π (AT κ ⟨b,a˧*2^64+d˧,e⟩):=by have s:=a܉;have p:=d܉;unfold Yag;have c:=Zj a f;obtain⟨g,h,j⟩:=QF a f;generalize q:a˧܀=K at c g h j;obtain⟨k,l⟩:=Z9 a d (Yj a) K c g h;generalize Yj a=L at c k l⊢;have n:=QH _ d˧ K j;have o:=O9 _ _ _ _ k l n;rw[ZU _ _ _ (QN _ _ _ _ o n),o,c];have r:=QL a 64 _ f p;rw[q]at r;have:=P0 b (a˧*2^64+d˧) (K+1) e א;unfold AR at this;rw[this] lemma Zce (f:ف)(a d b:ػ)(e:ٴ)(g:a≠0):Yaf f a d b e=π (AT κ ⟨f,a˧*2^128+d˧*2^64+b˧,e⟩):=by have u:=d܉;have v:=b܉;unfold Yaf;have c:=Zj a g;obtain⟨n,o,p⟩:=QF a g;generalize w:a˧܀=K at c n o p;obtain⟨h,k⟩:=Z9 a d (Yj a) K c n o;generalize Yj a=L at c h k ⊢;obtain⟨A,l⟩:∃ A,a˧*2^64+d˧=A:=⟨_,rfl⟩;rw[l]at h k;have q:(2:ٳ)^(K+65)=2^(K+1)*2^64:=ז;have r:a˧*2^128+d˧*2^64+b˧=(A%2^(K+1)*2^64+b˧)+A/2^(K+1)*2^(K+65):=by rw[(by rw[<- l];ring:a˧*2^128+d˧*2^64=A*2^64),q];(conv_lhs=>rw[←϶ A (2^(K+1))]);ring have s:A%2^(K+1)*2^64+b˧<2^(K+65):=by rw[q];exact Ag א (ω _ (Ε A (Δ _))) have z:(a˧*2^128+d˧*2^64+b˧)/2^(K+65)=A/2^(K+1):=by rw[r,ϔ _ _ (Δ _),Υ s,Β] have j:=QH _ d˧ K p;rw[l]at j;rw[<- z]at h j;have t:=O9 _ _ _ _ h (by rw[k,(by rw[r,ϲ,ν s]:(a˧*2^128+d˧*2^64+b˧)%2^(K+65)=A%2^(K+1)*2^64+b˧),show(b != 0)=decide (b˧≠0) from AB.2 (by simp[← σ])];simp:((d<<<(63-L) != 0)||(b != 0))=decide ((a˧*2^128+d˧*2^64+b˧)%2^(K+65)≠0)) j;rw[ZU _ _ _ (QN _ _ _ _ t j),t,c];have D:=QL a 128 (d˧*2^64+b˧) g (by clear * - v u;omega);rw[<- BU,w]at D;have:=P0 f (a˧*2^128+d˧*2^64+b˧) (K+65) e א;unfold AR at this;rw[this] lemma O8 (a:ف)(d b f:ػ)(e:ٴ)(g:d˧*2^128+b˧*2^64+f˧≠0):Yay a d b f e=π (AT κ ⟨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[(by simpa using k:(b !=0)=true),ר];exact Zcd a b f e k;simp only[(by simpa using j:(d !=0)=true),ר];exact Zce 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[Am (Δ _),<-Κ,(א:63+(L+1)=L+64),Κ];exact(ω _ j).trans (ώ _ _) cases e;simp only[φ,ש];rw[k];exact l;simp only[ר];rw[Du,k,show(1:ػ)˧=1 from rfl,Bu];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 K5 (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 (σ.1 e);have f:a˧܀<=63:=CI ((Ϻ d).2 a܉);exact⟨Zj a h,f,ZaP a b (Yj a) _ (Zj a h) f Ak (ϰ d)⟩ lemma X9 (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⟨c,o,k⟩:=K5 b d g;generalize b˧܀=K at c o;unfold YaR Yag Yat;dsimp only;generalize Yj b=L at c k⊢;split;rename_i h;simp at h;obtain⟨p,l⟩:=h;have q:(L+190)˧=K+190:=by rw[ξ,c];simp;omega rw[CY]at l⊢;have n:(B+(L+190))˧<=253:=by simpa using ϐ.mp l exact P5 a _ _ _ (k _) (by rw[j _ (by rw[q];omega) p n];push_cast;omega) n;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 X8 (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⟨c,p,l⟩:=K5 b d j;generalize b˧܀=K at c p;unfold YaS Yaf Yat;dsimp only;generalize Yj b=L at c l⊢;split;swap;rfl;rename_i h;simp at h;obtain⟨q,n⟩:=h;have r:(L+254)˧=K+254:=by rw[ξ,c];simp;omega rw[CY]at n⊢;have o:(B+(L+254))˧<=253:=by simpa using ϐ.1 n exact P5 a _ _ _ (l _) (by rw[k _ (by rw[r];omega) q o];push_cast;omega) o @[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 O7 (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 P3 a f e g B (λh=>k (by rw[h];rfl)) j;simp only[(by simpa using n:(b !=0)=true),ר];exact X9 a b f e g B n j;simp only[(by simpa using l:(d !=0)=true),ר];exact X8 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߾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 L5 (b d f:ػ)(e:ٴ)(a g:ف)(B:ػ)(j:Y0 e g B):YaT b d f e a g B=ρ (YC b d f) e a:=by have o:b˧*2^128+d˧*2^64+f˧<2^192:=by have:=b܉;have:=d܉;have:=f܉;omega unfold YaT;by_cases l:b=0/\d=0/\f=0;obtain⟨rfl,rfl,rfl⟩:=l;simp[YC,ρ] have k:b˧*2^128+d˧*2^64+f˧≠0:=λ h=>l (by simp only[<-σ,Ϝ];omega) rw[ite_eq_right l];by_cases p:b˧<2^63;rw[ite_eq_right (by simp[<-σ];omega:¬(b>>>63 !=0)=true),O7 _ _ _ _ _ _ _ k j,O8 _ _ _ _ _ k,AV,<-F9 _ _ _ a k,YC,ite_eq_left p,Int.sub_zero];rfl generalize q:b˧*2^128+d˧*2^64+f˧=N at o;have n:=Zcc b d f k;rw[q]at n;have r:=n▸Nat.sub_ne_zero_of_lt o;rw[ite_eq_left (by simp[<-σ];omega:(b>>>63 !=0)=true),O7 _ _ _ _ _ _ _ r j,O8 _ _ _ _ _ r,n,AV,<-F9 _ _ _ a א,YC,q,ite_eq_right p,(א:(N:ٴ)-2^192=-((2^192-N:ٳ):ٴ)),ite_eq_left rfl] @[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߾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߾else 0) else let neg:=w>>>63 !=0;YauT neg (if neg then 0-w else w) e ok B lemma C3 (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 C4 (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 ((ϱ e).toInt==e) (ϱ e).toUInt64 lemma X7 (b d f:ػ)(e:ٴ)(a:ف):Ybo b d f e a=ρ (YC b d f) e a:= L5 b d f e a _ _ (P4 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 ε;split_ifs<;>simp[ξ];omega lemma Zf (w:ؼ):(Yd w)˧=γ w:=by unfold Yd γ;split_ifs with h;rfl;have b:1<=(θ w)؎:=Dd.2 λa=>h (ύ.1 (by simpa using a));rw[Η _ _ (by rw[ϐ];simp;omega)];simp lemma Zc (a b:ؾ) (h:a؛+b؛<Λ):(a+b)؛=a؛+b؛:=ν h lemma A4 (A:ؽ δ)(a n k:ؾ)(b:a؛+n؛<=Aٽ)(d:a؛+n؛<Λ)(h:k>>1)>>>(63-r))˧=m˧/2^(64-r˧):=by rw[Ξ,Ξ,X6 r a,ψ,ψ,ν (Nat.sub_lt_succ 63 _),show(1:ػ)˧%64=1 from rfl,ϧ,<-Κ];congr 2;omega lemma G8 (m r:ٳ)(a:r<64):m*2^r%2^64+m/2^(64-r)*2^64=m*2^r:=by rw[<-show m*2^r/2^64=m/2^(64-r) by rw[show(2:ٳ)^64=2^r*2^(64-r) by rw[<-Κ,Ej a.le],<-ϧ,Nat.mul_div_cancel _ (Δ r)]];exact Nat.mod_add_div' _ _ lemma X5 (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[H0];exact ν a rw[C0 _ _ א,G9 _ _ א,b];have:=G8 m˧ s˧ a;omega lemma X4 (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[H0];omega rw[C0 _ _ א,G9 _ _ א,d];have:=G8 m˧ (s˧-64) א;have:m˧*2^s˧=m˧*2^(s˧-64)*2^64:=by rw[ϣ,<-Κ,Aw a] omega lemma X3 (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 X5 m s (Ψ.1 h);rw[if_neg h,if_neg h,if_neg h,Ϝ,ϑ];exact X4 m s (DZ.1 (Ψ.not.1 h)) a lemma G7 (y a:ػ)(h:a˧<=1):(y^^^(0-a))˧=if a˧=1 then 2^64-1-y˧else y˧:=by rcases Ay.1 h with b|d;obtain rfl:a=0:=σ.1 (by simpa using b);simp;obtain rfl:a=1:=σ.1 (by simpa using d);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+brw[Ψ,d]at h;show 1=_;omega;show 0=_;omega lemma X2 (f a d g b e:ػ):(f+g+((if a+bomega lemma L3 (a b d:ػ):((a|||b|||d)==0)=decide (d˧*2^128+b˧*2^64+a˧=0):=by rw[AB,beq_iff_eq,ة,DA,DA,<-σ,<-σ,<-σ,Ϝ];omega lemma D4 (a b:ؼ):((a^^^b)>>>31)܅˧=if Ζ (η a) (η b)then 1 else 0:=by have d:∀a:ؼ,η a=decide (a؎/2^31=1):=λw=>by have a:=AK w;have h:(w&&&߾)؎=2^31*(w؎/2^31%2):=by rw[AH,show(߾:ؼ)؎=2^31 from rfl,Nat.and_two_pow,BJ];have b:w؎/2^31%2<2:=Ε _ ב;generalize w؎/2^31%2=q at b⊢;interval_cases q<;>rfl unfold η;rw[AB];simp;rw[<-ύ,h,show(0:ؼ)؎=0 from rfl];simp only[Fc]at a;omega rw[AG,Ϣ,UInt32.toNat_xor,show(31:ؼ)؎%32=31 from rfl,Nat.shiftRight_xor_distrib,ψ,ψ,d,d];have:=a.toNat_lt;have:=b.toNat_lt;rcases Ay.1 (א:aپ/2^31<=1)with h|h<;>rcases Ay.1 (א:bپ/2^31<=1)with e|e<;>rw[h,e]<;>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 lemma Zg (w:ؼ):γ w<=254:=by have:=expOf_toNat_lt w;unfold γ;split_ifs<;>omega lemma ZK (a b:ؼ):ε a*ε b<2^48:=calc ε a*ε b<2^24*2^24:=BP (Ϛ a) (Ϛ b) lemma K4 (a b:δ):(Yf a*Yf b)˧=ε a*ε b:=by rw[ϯ,Zk,Zk];exact ν (by have:=ZK a b;omega) lemma B6 (a b:δ):(Yd a+Yd b)˧=γ a+γ b:=by have:=Zg a;have:=Zg b;rw[ξ,Zf,Zf,ν א] lemma K2 (a b:δ):Yf a*Yf b=0↔ε a*ε b=0:=by rw[<-K4,<-σ];rfl lemma E7 (w:δ):(Yf w==0)=decide (ε w=0):=by rw[AB,beq_iff_eq,ة,<-Zk,<-σ];rfl lemma Zr {β:Type}(d:ػ)(a b:ؼ)(f g h c:ػ)(e:ػ->ػ->ػ->ػ->β)(j:c˧+1<2^64)(k:ε a*ε b≠0->d˧<=γ a+γ b/\γ a+γ b>>31)܅˧<=1:=by rw[p];split<;>decide refine⟨_,_,_,_,rfl,?_,?_⟩;all_goals generalize Yf a*Yf b=m,F:Yd a+Yd b-d=s,((a^^^b)>>>31)܅=l at r p n⊢ . rw[ξ];exact(DY _ _).trans (Ϯ n _) have o:(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 t:ε a*ε b=0;rw[t,ϸ];exact X0 m s (by rw[r,t]);obtain⟨A,G⟩:=k t;have B:s˧=γ a+γ b-d˧:=(by rw[<-F,Η _ _ (by rwa[ϐ,B6]),B6]);rw[<-r,<-B];exact X3 m s (B▸Bz A G) generalize (if s<64 then (0:ػ)else (m>>>1)>>>(63-(s&&&63)))=u,(if s<64 then (m>>>1)>>>(63-(s&&&63))else m<<<(s&&&63))=v,(if s<64 then m<<<(s&&&63)else 0)=w at o⊢;unfold Yx;rw[X2,ξ,ν (a:=c˧+l˧) ((Ϯ n _).trans_lt j),<-Zn];generalize K:ε a*ε b*2^(γ a+γ b-d˧)=P at o;rw[(by rw[<-K];split_ifs<;>push_cast<;>ring:(if Ζ (η a) (η b)then-((ε a*ε b:ٳ):ٴ)else ((ε a*ε b:ٳ):ٴ))*2^(γ a+γ b-d˧)=if Ζ (η a) (η b)then-(P:ٴ)else P)];clear* -p n o;have C:=G7 u l n;have D:=G7 v l n;have E:=G7 w l n;have H:=u܉;have I:=v܉;have J:=w܉;push_cast;rw[Int.emod_add_emod];conv_rhs=>rw[<-CA _ _ (l˧:ٴ)] exact congrArg (·%_) (by linear_combination (by subst o;split_ifs at p C D E⊢<;>omega:((u^^^(0-l))˧*2^128+(v^^^(0-l))˧*2^64+(w^^^(0-l))˧+l˧:ٴ)=(if Ζ (η a) (η b)then-(P:ٴ)else P)+2^192*l˧)) @[inline] def YD (w2 w1 w0 c:ػ) (e:ٴ):ػ:= let t0:=w0+c;let k0:ػ:=if t0>>23).toNat def YM (a:ؼ):ٳ:=((a&&&ק)>>>23).toNat lemma W9 (a:ؼ):(a&&&ק)؎=(θ a)؎*2^23+(fracOf a)؎:=by simp only[AH,θ,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 e:=expOf_toNat_lt a;have f:=fracOf_toNat_lt a;unfold YR YM ε γ;simp only[Ϣ,CX,CD,BY,ψ,W9,ne_eq,<-ύ];rw[Ϟ _ (fracOf a)؎,ϔ _ _ (Δ _),Υ f,Β];generalize (θ a)؎=E,(fracOf a)؎=F at*;have K:(2^32-1+(F+E*2^23))%2^32/2^23<=E∨E=0∧F=0:=א;refine⟨CI (ϕ (Ε _ ד)),CI e,Nat.ne_of_lt,λ d=>?_⟩;by_cases b:E=0;rw[if_pos b]at d⊢;exact⟨(K.resolve_right λ h=>d h.2).trans (Nat.le_succ_of_le b.le),Nat.le_max_right _ _⟩;rw[if_neg b]at d⊢;rw[Aw (Ο b)];exact⟨K.resolve_right λ h=>b h.1,Nat.le_max_left _ _⟩ def Yah (A:ؽ δ) (base n:ؾ) (hA:baseپ+nپ<=Aٽ) (hs:baseپ+nپ<Λ) (lo hi:UInt16) (k:ؾ):ؼ:= if h:k>>23).toUInt16;let b:=(v>>>23).toUInt16;Yah A base n hA hs (if a t L<=YR A[a؛+t]! /\ YM A[a؛+t]! <= H:=by generalize E:n؛-k؛=d;induction d generalizing k b e with |zero=> rw[Yah,dif_neg (mt υ.1 א)];refine⟨b.toNat,e.toNat,?_,g.1,g.2,le_rfl,le_rfl,λ t o p=>א⟩;simp only[UInt32.toNat_add,UInt32.toNat_shiftLeft,UInt16.toNat_toUInt32];simp;omega |succ d u=> have q:k>>23).toUInt16.toNat=YR w:=by have:(((w&&&ק)-1)>>>23).toNat<512:=(by simp only[UInt32.toNat_shiftRight];have:=((w&&&ק)-1).toNat_lt;simp at *;omega);simp only[YR,UInt32.toNat_toUInt16];omega have I:((w&&&ק)>>>23).toUInt16.toNat=YM w:=by have:((w&&&ק)>>>23).toNat<512:=(by simp only[UInt32.toNat_shiftRight];have:=(w&&&ק).toNat_lt;simp at *;omega);simp only[YM,UInt32.toNat_toUInt16];omega have R:=Zb w obtain⟨L,H,o,p,x,y,z,B⟩:=u (if (((w&&&ק)-1)>>>23).toUInt16>>23).toUInt16 else b) (if e<((w&&&ק)>>>23).toUInt16 then ((w&&&ק)>>>23).toUInt16 else e) (k+1) א (by constructor<;>split_ifs<;>omega) א have r:L<=b.toNat∧L<=YR w:=by split_ifs at y with l<;>rw[UInt16.lt_iff_toNat_lt]at l<;>omega have s:e.toNat<=H∧YM w<=H:=by split_ifs at z with l<;>rw[UInt16.lt_iff_toNat_lt]at l<;>omega refine⟨L,H,o,p,x,r.1,s.1,λ t K C=>?_⟩;obtain rfl|D:t=kپ∨(k+1)؛<=t:=א;rw[v];exact⟨r.2,s.2⟩;exact B t D C 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 l:ε a*ε b*2^(γ a+γ b-d)<=2^170:=(Ar (א:_<=2^48) (Ι ב (א:_<=122))).trans_eq ב;have c:((ε a*ε b:ٳ):ٴ)*2^(γ a+γ b-d)=((ε a*ε b*2^(γ a+γ b-d):ٳ):ٴ):=by push_cast;ring split_ifs;rw[neg_mul,c];omega;rw[c];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;simp[Yo];next r d=>intro k;rw[Yo,d (k+1),Yo,BU k 1 r,Ϟ 1 r];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;rw[(by rw[<-Zn,e];split_ifs<;>simp:sv a*sv b=0)];ring;rw[(א:idxOf a+idxOf b=d+(idxOf a+idxOf b-d)),pow_add,(א:d+(idxOf a+idxOf b-d)-d=idxOf a+idxOf b-d)];ring @[inline] def Yc (A:ؽ δ) (inW i:ٳ):ؼ:= if h:i*inW+inW<=Aٽ/\i*inW+inW<=ހ 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,ר,Ch] have o:Yf a*Yf b=0:=by rcases h with h|⟨p,q⟩;apply σ.1;simp[ϯ,Zk,h] exfalso;apply k;have r:=Zg a;have s:=Zg b;rw[Ψ,Η _ _ (ϐ.2 (by rw[ξ,Zf,Zf];norm_num;omega)),ξ,Zf,Zf];norm_num;omega simp only[k,ש,o,DB,Dm,Ch] @[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 J3 (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,Du,show(0-1:ػ)˧=2^64-1 from rfl,Ϝ,Da,Nat.zero_or,Nat.or_zero,Nat.or_self]at*<;> split_ifs at*<;>omega lemma S5 (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[add_zero,CY,sub_add_cancel,ξ,show(0-1:ػ)˧=2^64-1 from rfl,Da]<;>omega lemma S6 (m r:ػ)(a:m˧<2^48)(b:r˧<=16):(m>>>1)>>>(63-r)=0:=by apply σ.1;rw[Ξ,Ξ,Η _ _ (ϐ.2 (א:r˧<=63)),ψ,ψ,show(63:ػ)˧=63 from rfl,show(1:ػ)˧%64=1 from rfl,Ϝ,ν (א:63-r˧<64),ϧ];exact Υ (a.trans_le (by rw[<-Κ];exact Ι ב א)) lemma E1 (a b:ؼ):(0:ػ)-((a^^^b)>>>31)܅=0\/(0:ػ)-((a^^^b)>>>31)܅=0-1:=by have:=D4 a b;split at this;right;rw[σ.1 (show((a^^^b)>>>31)܅˧=(1:ػ)˧from this)];left;rw[σ.1 (show((a^^^b)>>>31)܅˧=(0:ػ)˧from this)];rfl lemma C5 {β: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=>σ.1 (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 S6;rw[ϯ,Zk,Zk];have:=ZK a b;omega;rw[H0,Η _ _ (ϐ.2 (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,Ch];rw[J3 h _ _ (E1 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[Ψ,Η _ _ (ϐ.2 (by rw[ξ,n,o];omega)),ξ,n,o];norm_num;omega simp only[q,ש,t,DB,Dm,Ch];rw[J3 h _ _ (E1 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) (A4 X xa n k hX hx h)) (W.uget (wa+k) (A4 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 I6 (q:ف)(X W:ؽ δ)(a b n:ؾ)(j:a؛+n؛<=Xٽ)(l:b؛+n؛<=Wٽ)(g:a؛+n؛<Λ)(h:b؛+n؛<Λ)(f:ػ)(e:ٴ)(o:ؼ)(p:n؛<2^62)(D:ٳ)(r:q->D<=16)(s:D<=63)(u:∀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:ؾ) (w v x c:ػ),n؛-k؛=d->(q->w=(0:ػ)-(v>>>63)/\(v˧<=k؛\/2^64-k؛<=v˧))->YS6 q X W a b n j l g h f e o w v x c k=YS X W a b n j l g h f e o w v x c k:=by intro d;induction d<;>intro k w v x c B J;have y:=υ.not.2 (Dw B).not_gt;rw[YS6,YS,dif_neg y,dif_neg y];rename_i d E;have z:=Al B;have y:=υ.2 z;have F:=QK n k y;have G:n؛-(k+1)؛=d:=by rw[F,Cx,B];rfl rw[YS6,YS,dif_pos y,dif_pos y,B3 X a k _ ((ϴ z _).trans g),B3 W b k _ ((ϴ z _).trans h)];have C:=u k؛ z;cases q;rw[if_neg AC,I7 f _ _ w v x c _ (or_iff_not_imp_left.2 λ A=>⟨(C A).1,(C A).2.trans (by gcongr)⟩)];apply congrArg;funext K L M N;exact E (k+1) K L M N G ג;obtain⟨rfl,H⟩:=J rfl;have I:=z.trans p;rw[if_pos rfl,C5 f _ _ v x c _ (or_iff_not_imp_left.2 λ A=>⟨(C A).1,(C A).2.trans (by gcongr;exact r rfl)⟩) (by clear* -H I;omega)];unfold YL16;dsimp only;apply E (k+1) _ _ _ _ G (λ _=>⟨rfl,?_⟩);rw[F];apply S5 v _ _ k؛ (E1 _ _) ?_ H I;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<=ހ/\ j*inW+inW<=ހ/\inW<ށ then let bw:=b[j]!;let lo:=Yp bx bv bw;let hi:=Yu bx bv bw;if (bx&&&ޅ)=255||(bv&&&ޅ)=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<߿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 (AY (c*hw)) lemma D3 (a:ٳ)(f:ٳ->ٳ->δ)(b:ٳ):∀k j (d:ؽ δ),a-j=k->(Yaj a f b j d)܍=d܍++(Bd j (a-j)).map (f b):=by intro k;induction k<;>intro j d h<;>unfold Yaj;rw[if_neg א];simp[h];next k e=>rw[if_pos א,e (j+1) _ א,Cx,h,Ϩ];simp lemma W5 (c a:ٳ)(f:ٳ->ٳ->δ):∀k b (d:ؽ δ),c-b=k->(Yak c a f b d)܍=d܍++(Bd (b*a) ((c-b)*a)).map (λ i=>f (i/a) (i%a)):=by intro k;induction k<;>intro b d h<;>unfold Yak;rw[if_neg א];simp[h];rename_i e;rw[if_pos א,e (b+1) _ א,D3 a f b _ 0 _ rfl,(by rw[(א:c-b=(c-(b+1))+1),Dp,Ϟ]:(c-b)*a=a+(c-(b+1))*a),<-List.range'_append,List.map_append,Ah];simp only[CL,Ai];congr 2;rw[(by rw[DS];simp:Bd (b*a) a=(Bd 0 a).map (b*a+·)),Df];apply Ck;intro j g;rw[List.mem_range'_1]at g;have q:jٳ->δ):YT c a f=ڀ N λ i=>f (i܂/a) (i܂%a):=by subst b;apply ϻ;rw[YT,W5 c a f _ 0 _ rfl];apply ϩ<;>simp @[specialize] def Yaq (n:ٳ) (f:ٳ->δ) (i:ٳ) (acc:ؽ δ):ؽ δ:= if iδ):ؽ δ:=Yaq n f 0 (AY n) @[inline] def YaJ (w:δ) (m:ػ):ػ:= (Yf w<<<(Yd w-m))*((1:ػ)-(2:ػ)*(w>>>31).toUInt64) @[inline] def Y4 (w:δ) (m:ػ):ؼ:=(YaJ w m+߾).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 ބ-M else ބ+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[Ϣ,ψ];exact ϕ w.toNat_lt have:=τ;exact⟨by rw[Zc _ _ (by rw[Zc _ _ א,AI];omega),Zc _ _ א,AI];omega,e⟩ @[inline] def QPS (inW:ٳ) (BX BV:ؽ ؼ):ف:= 16<=inW&&BX.all (λ bx=>bx&&&ޅ !=255)&&BV.all (λ bv=>bv&&&ޅ !=255)&& (BX.foldl (λ (m:ػ) (bx:ؼ)=>min m (QYF bx)) 99).toNat+(BV.foldl (λ (m:ػ) (bv:ؼ)=>max m (QYF bv)) 0).toNat<=15 lemma R8 (u:ؼ)(n:ٳ)(h:n<ށ):(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[AJ,e]at c;exact⟨c,λ _=>rfl⟩;exact⟨by omega,(absurd · 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<=ހ/\ j*inW+inW<=ހ/\inW<ށ/\(bx&&&ޅ)≠255/\(bv&&&ޅ)≠255/\ xm<=Yk (bx&&&ޅ)/\wm<=Yk (bv&&&ޅ)/\(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:=D0 k w א;rw [if_pos c]at h;omega)).toUInt64-ބ)*(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:=(R8 u inW א).1;simp only [wa,iw]at*;rw [Zc _ _ (by rw [Za _ א,AI];have:=τ;omega),Za _ א,AI];omega) ((P.uget (k+k+(w>>>31).toUSize) (by have:=υ.mp hk;rw [Za _ א]at this;have:=D0 k w א;rw [if_neg c]at h;omega)).toUInt64-ބ)*(Yf w<<<((θ w).toUInt64-(wm+1)))) (xm+wm) bw 0 0 0 if r<߿then r.toUInt32 else Yai X W b inW i j else YaU X W b inW i j bx bv @[specialize] def QY6G2 (n:ؾ) (f:(k:ؾ) -> k ػ × ػ) (B1 B2:ػ) (bw:ؼ) (h1 l1 h2 l2:ػ) (k:ؾ):ػ × ػ:= if h:k>>63)) h1 l1 0 λ v2 v1 v0 c'=>YD v2 v1 v0 c' ((B1پ:ٴ)-298), YL B2 ζ bw ((0:ػ)-(h2>>>63)) h2 l2 0 λ v2 v1 v0 c'=>YD v2 v1 v0 c' ((B2پ:ٴ)-298)) termination_by nپ-kپ decreasing_by exact ZI n k h @[inline] def QPg2 (X:ؽ δ) (P1 P2:ؽ ٳ) (I1 I2:ؽ ؼ) (W b:ؽ δ) (inW i j:ٳ) (bx1 bx2 bv:ؼ):ف:= let G:=λ (P:ؽ ٳ) (I:ؽ ؼ) (i:ٳ) (bx:ؼ)=>decide (Pٽ=2*(if Iٽ=0 then inW else Iٽ)/\Iٽ<=inW/\i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\i*inW+inW<=ހ /\ j*inW+inW<=ހ/\inW<ށ/\(bx&&&ޅ)≠255/\(bv&&&ޅ)≠255 /\ Yk (bx>>>16)<=Yk (bx&&&ޅ)/\Yk (bv>>>16)<=Yk (bv&&&ޅ)/\(QYF bx).toNat+(QYF bv).toNat<=15 /\ θ (b[j]!)≠255/\(Yf (b[j]!)=0\/(Yk (bx>>>16)+Yk (bv>>>16)<=Yd ζ+Yd (b[j]!)/\Yd ζ+Yd (b[j]!)-(Yk (bx>>>16)+Yk (bv>>>16))<80))/\(1:ػ)<=Yk (bv>>>16)) G P1 I1 i bx1&&G P2 I2 (i+1) bx2&&I1ٽ==0&&I2ٽ==0 @[inline] def QPa2 (X:ؽ δ) (P1 P2:ؽ ٳ) (I1 I2:ؽ ؼ) (W b:ؽ δ) (inW i j:ٳ) (bx1 bx2 bv:ؼ):δ × δ:= if h:QPg2 X P1 P2 I1 I2 W b inW i j bx1 bx2 bv=true then have q:j*inW+inW<=Wٽ/\j*inW+inW<=ހ/\inW<ށ/\P1ٽ=2*inW/\P2ٽ=2*inW:=by simp only [QPg2,Ω,ת,beq_iff_eq] at h;obtain ⟨⟨⟨g1,g2⟩,c1⟩,c2⟩:=h;simp only [c1,c2,↓reduceIte] at g1 g2;omega let wm:=Yk (bv>>>16);let wa:=(j*inW).toUSize;let r:=QY6G2 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) let v:=Yf w<<<((θ w).toUInt64-(wm+1));(((P1.uget (k+k+(w>>>31).toUSize) (by have:=υ.mp hk;rw [Za _ א] at this;have:=D0 k w א;omega)).toUInt64-ބ)*v, ((P2.uget (k+k+(w>>>31).toUSize) (by have:=υ.mp hk;rw [Za _ א] at this;have:=D0 k w א;omega)).toUInt64-ބ)*v)) (Yk (bx1>>>16)+wm) (Yk (bx2>>>16)+wm) b[j]! 0 0 0 0 0 (if r.1<߿ then r.1.toUInt32 else Yai X W b inW i j,if r.2<߿ then r.2.toUInt32 else Yai X W b inW (i+1) j) else (QPa X P1 I1 W b inW i j bx1 bv,QPa X P2 I2 W b inW (i+1) j bx2 bv) @[specialize] def Yr2 (hw:ٳ) (f:ٳ -> δ × δ) (j:ٳ) (A B:ؽ δ):ؽ δ × ؽ δ:= if j ف) (f2:ٳ -> ٳ -> δ × δ) (f:ٳ -> ٳ -> δ) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if ch+1 ؼ) (m:ػ) (t:ٳ) (V:ؽ ؼ) (sb:ػ):ؽ ؼ × ػ:= if t < n then QWP n f m (t+1) (V.push (QWe m (f t))) (sb+((1:ػ)<<>>31=0 then mp else (0:ػ)-mp)+0x80000000000000 @[specialize] def QWL {β:Type} (kont:ػ -> ػ -> β) (V W:ؽ δ) (a n:ؾ) (jV:n؛<=Vٽ) (j1:a؛+n؛<=Wٽ) (k1:a؛+n؛<Λ) (g l u:ػ) (k:ؾ):β:= if h:k>>25 let q:=QWz v (W.uget (a+k) (A4 W a n k j1 k1 h)) g;let o:=q<<>>(64-s))+(if L>>16)<=Yk (bv&&&ޅ)&&(bv&&&ޅ)!=255&&QYF bv<=7&&(1:ػ)<=Yk (bv>>>16)&&θ bw != 255&&(Yf bw=0||(xm+Yk (bv>>>16)-1<=Yd ζ+Yd bw&&Yd ζ+Yd bw-(xm+Yk (bv>>>16)-1)<80)) @[inline] def QWf (X W b:ؽ δ) (inW i j:ٳ) (cl ch l h B:ػ):δ:= let L:=l-cl;let H:=h-ch-(if l>>63)) H L 0 (λ v2 v1 v0 c'=>YD v2 v1 v0 c' ((Bپ:ٴ)-298));if r<߿ then r.toUInt32 else Yai X W b inW i j @[inline] def QW1 (X W b:ؽ δ) (V:ؽ ؼ) (sb:ػ) (inW i j:ٳ) (bx bw:ؼ):δ:= let xm:=Yk (bx>>>16);let g:=Yk (bw>>>16) if h:Vٽ=inW/\i*inW+inW<=ހ/\j*inW+inW<=Wٽ/\j*inW+inW<=ހ/\inW<16384/\QWc bw b[j]! xm then QWL (λ l u=>QWf X W b inW i j (sb<<<55) (sb>>>9) l u (xm+g-1)) V W (j*inW)۞ inW۞ (by rw[Za _ א];omega) (by rw[Za _ א,Za _ א];omega) (by rw[Za _ א,Za _ א];have:=τ;omega) g 0 0 0 else YaU X W b inW i j bx bw 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 (Ba inW) if 0X[i.val*inW+(I[m]!).toNat]!) (Yk (BX[i.val]! >>> 16)) 0 (Ba (2*Iٽ)),I) else (QPD inW (λ t=>X[i.val*inW+t]!) (Yk (BX[i.val]! >>> 16)) 0 (Ba (2*inW)),#[]) else Χ rows (#[],#[]) let VW:ؽ (ؽ ؼ × ػ):=ڀ rows λ i=>if P[i.val]!.1ٽ=0&&(BX[i.val]!&&&ޅ)!=255&&Yk (BX[i.val]!>>>16)<=Yk (BX[i.val]!&&&ޅ)&&QYF BX[i.val]!<=47&&i.val*inW+inW<=Xٽ then QWP inW (λ t=>X[i.val*inW+t]!) (Yk (BX[i.val]!>>>16)) 0 (Ba inW) 0 else (#[],0) let D:=λ i=>VW[i]!.1ٽ != 0 let F:=λ i j=>act relu (if D i then QW1 X W b VW[i]!.1 VW[i]!.2 inW i j BX[i]! BV[j]! else QPa X P[i]!.1 P[i]!.2 W b inW i j BX[i]! BV[j]!) if rows<2 then YT rows outW F else YT2l rows outW (λ i=>P[i]!.1ٽ==2*inW&&P[i+1]!.1ٽ==2*inW) (λ i j=>if D i||D (i+1) then (F i j,F (i+1) j) else let r:=QPa2 X P[i]!.1 P[i+1]!.1 P[i]!.2 P[i+1]!.2 W b inW i j BX[i]! BX[i+1]! BV[j]! (act relu r.1,act relu r.2)) F 0 (AY (rows*outW)) lemma Zq (k:ؼ):(Yk k)˧=k؎-1:=by unfold Yk;split_ifs with h;subst h;rfl;rw[AG,Dj _ _ (by rw[AJ];exact Dd.2 λ a=>h (ύ.1 a))];rfl lemma E6 (x y:ؼ):(Yk x+Yk y)˧=x؎-1+(y؎-1):=by rw[ξ,Zq,Zq];have:x؎<2^32:=AK _;have:y؎<2^32:=AK _;exact ν א lemma ZM (a:ؼ):(Yd ζ+Yd a)˧=γ ζ+γ a:=B6 ζ a lemma D7 (b d a:ؼ):(Yp b d a)˧<=((b>>>16)؎-1)+((d>>>16)؎-1)/\(ε a≠0->(Yp b d a)˧<=γ ζ+γ a):=by have h:=E6 (b>>>16) (d>>>16);have j:=ZM a;unfold Yp;dsimp only;rw[E7 a];split_ifs with e<;>simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ,not_and,not_lt]at e;omega;constructor;omega;intro g;have:=e g;omega lemma D6 (b d a:ؼ):((b&&&ޅ)؎-1)+((d&&&ޅ)؎-1)<=(Yu b d a)˧/\(ε a≠0->γ ζ+γ a<=(Yu b d a)˧):=by have h:=E6 (b&&&ޅ) (d&&&ޅ);have j:=ZM a;unfold Yu;dsimp only;rw[E7 a];split_ifs with e<;>simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ,not_and,not_lt]at e;omega;constructor;omega;intro g;have:=e g;omega lemma Zo (a:ؼ)(L H:ٳ)(h:a؎=L*2^16+H)(hH:H<2^16):(a>>>16)؎=L/\(a&&&ޅ)؎=H:=by constructor;rw[Ϣ,show(16:ؼ)؎%32=16 from rfl,ψ,h];omega;rw[AH,show(ޅ:ؼ)؎=2^16-1 from rfl,ϡ,h];omega lemma O2 (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<=ހ) : ∃ 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,א⟩];obtain⟨L,H,e,h,c,-,-,j⟩:=W8 A (i*a)۞ a۞ (by rw[f,g];exact b) (by rw[f,g];have:=τ;omega) 511 0 0 ג ד;refine⟨L,H,e,h,c,λt k=>?_⟩;have:=j t ג (by rw[g];exact k);rwa[f]at this lemma A9 (S:ٴ)(a:ػ)(c:ف)(b D:δ)(d:S=0->b=D)(e:D=ρ (S*2^a˧) (-298) c):(if (if S=0 then߿else (ρ S ((a˧:ٴ)-298) false)܅)<߿then (if S=0 then߿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,if_pos (by rw[Ψ];simpa using AK (ρ S ((a˧:ٴ)-298) false):(ρ S ((a˧:ٴ)-298) false)܅<߿),e,<-Aa,(by apply ύ.1;simp:(ρ S ((a˧:ٴ)-298) false)܅՜=ρ S ((a˧:ٴ)-298) false)];unfold finishWord;rw[if_neg f,if_neg f,(by ring:(-298:ٴ)+(a˧:ٴ)=(a˧:ٴ)-298)] lemma E8 (u p:ػ)(b:¬u122):p˧<=u˧/\u˧-p˧<=122:=by rw[Ψ]at b;have d:p˧<=u˧:=א;rw[gt_iff_lt,Ψ,Η _ _ (ϐ.2 d)]at a;exact⟨d,DZ.1 a⟩ lemma H4 {L r i:ٳ}(a:L<=r)(b:r<=i+1):L-1<=i:=א lemma H3 {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 (Cy (H4 e.1 l.1) (H4 f.1 n.1)),(Cy (H3 e.2 l.2) (H3 f.2 n.2)).trans (j.trans (BK.1 k))⟩ lemma O6 (x y:BD)(h:(AU x y).significand=0):(AU x y).negative=(x.negative&&y.negative):=by unfold AU EC Eb at h⊢;dsimp only at h⊢;split_ifs at h⊢<;>simp_all only[beq_iff_eq,Int.natAbs_eq_zero] lemma O5 (d:BD)(h:d.significand=0):Bt κ d=Cs κ 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 G6:(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):π (Cr (ι 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,ι,Ϡ a d,Ϡ b e];have h:(AU (Ν a) (Ν b)).toRat=((sv a*2^γ a+sv b*2^γ b:ٴ):ℚ)*2^(-149:ℤ):=by rw[AU,BF,ϙ,ϙ,ZN,ZN];push_cast;ring by_cases f:sv a*2^γ a+sv b*2^γ b=0;have g:(AU (Ν a) (Ν b)).significand=0:=ח;rw[O5 _ g,O6 _ _ g,Ad,Ad,f,finishWord_zero];exact(finishWord_of_ne _ _ _ _ f h).symm lemma ZaX (x y z:δ)(a:θ x≠255)(b:θ y≠255)(d:θ z≠255):π (Eu (ι 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;simp only[Model.Spec.fma,ofW,(Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨AX e,AX f,AX g⟩,Be e,Be f,Be g,Bool.or_false,φ,ש,e,f,g];set P:BD:={negative:=Ζ (Ν x).negative (Ν y).negative,significand:=(Ν x).significand*(Ν y).significand,exponent:=(Ν x).exponent+(Ν y).exponent}with h;have o:(AU P (Ν z)).toRat=((sv x*sv y*2^(γ x+γ y)+sv z*2^(γ z+149):ٴ):ℚ)*2^(-298:ٴ):=by have j:=Ec (Ν x) (Ν y);simp only[ED,Ed]at j;rw[AU,BF,h,j,ϙ,ϙ,ϙ,ZN,ZN,ZN,<-G6];have k:(2:ℚ)^(γ z+149)*2^(-298:ٴ)=2^γ z*2^(-149:ٴ):=by rw[pow_add,<-G6,mul_assoc];norm_num push_cast;rw[<-G6]at k;linear_combination (sv z:ℚ)*k by_cases l:sv x*sv y*2^(γ x+γ y)+sv z*2^(γ z+149)=0;swap;exact(finishWord_of_ne _ _ _ _ l o).symm;have n:(AU P (Ν z)).significand=0:=ח;rw[O5 _ n,O6 _ _ n,h,Ad,Ad,Ad,l,finishWord_zero] lemma O4 (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 G5 (w:ؼ):η w=decide (2^31<=w؎):=by have h:=D4 w 0;rw[EE,show η 0=false from rfl,EM,AG,Ϣ]at h;have:=AK w;cases c:η w<;>simp[c,ψ,Fc]at h this⊢<;>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[Dk,AL,Α,show(23:ؼ)؎%32=23 from rfl,ν (א:j<2^32)];exact ν א have f:Ϥ j<<<23<=s:=by rw[AJ,e];omega have d:(s-(Ϥ j<<<23))؎=s؎-j*2^23:=ח;refine⟨?_,?_,?_⟩;rw[ZH,ZH,d];omega;apply ύ.1;rw[ZR,ZR,d];omega;rw[G5,G5,d];simp;omega lemma ZX (w:δ)(a:θ w≠255):AS (ι w)=(sv w:ℝ)*2^((γ w:ℤ)-149):=by rw[Model.toReal_eq];simp only[ι,Ϡ w a];rw[<-BC,ϙ];push_cast;rfl lemma ZcF (s y:δ)(j:ٳ)(f:j<=6)(b:θ s≠255)(a:j<(θ s)؎)(d:θ y≠255)(g:η y=false)(e:ε y=2^23)(k:γ y=126+j):π (BO (ι s) (ι y))=s-(Ϥ j<<<23):=by have p:Cm (ι y)=false:=by rw[ofW,Model.isZero_eq_beq_zero_of_toDyadic?_some (Ϡ y d),decodeD_sig_zero,e];decide obtain⟨A,B,C⟩:=ZcE s j f a;set r:=s-(Ϥ j<<<23);have I:=expOf_toNat_lt s;have J:(θ s)؎≠255:=λ D=>b (ύ.mp D);obtain⟨l,q⟩:θ r≠255∧θ r≠0:=by constructor<;>intro h<;>have:=congrArg (·؎) h<;>simp at this<;>omega have t:θ s≠0:=λ h=>by simp[h]at a obtain⟨n,u,v⟩:BI (ι s)=true∧BI (ι y)=true∧BI (ι r)=true:=by simp[ofW,isFinite_ofUInt32,b,d,l] have w:AS (ι y)=2^j:=by rw[ZX _ d,(by unfold sv;rw[g,e];rfl:sv y=2^23),k];push_cast;rw[show((126:ٴ)+j-149)=j+(-23) by ring,zpow_add₀ two_ne_zero,ؠ];field_simp;norm_num have x:=Model.isFinite_div_of_abs_div_le_posMaxFinite _ _ ד n u p (by rw[w,abs_div,abs_of_pos (ה:(0:ℝ)<2^j)];exact(div_le_self (abs_nonneg _) (one_le_pow₀ ב)).trans (Model.abs_toReal_le_posMaxFinite_of_isIEEE_of_isFinite _ ד n):|AS (ι s)/AS (ι y)|<=AS (Model.posMaxFinite κ));have o:=Model.toReal_div_eq_roundAt _ _ ד n u p x;rw[w,<-(by rw[ZX _ l,ZX _ b,(by unfold sv mantOf;rw[C,B,if_neg q,if_neg t]:sv r=sv s),(by unfold idxOf;rw[if_neg q,if_neg t,A];omega:(γ r:ٴ)=(γ s:ٴ)-j),sub_right_comm,zpow_sub₀ two_ne_zero _ (j:ٴ),ؠ,mul_div_assoc]:AS (ι r)=AS (ι s)/2^j),Model.roundAt_toReal_eq _ v]at o;rw[Model.eq_of_toReal_eq_of_nonzero x v o (by rw[o,ZX _ l];exact mul_ne_zero (by exact_mod_cast (by unfold sv mantOf;split<;>omega:sv r≠0)) (zpow_ne_zero _ two_ne_zero)),Q0] lemma ZcG (s:δ)(j:ٳ)(a:j<=6)(b:θ s≠255)(d:j<(θ s)؎):π (BO (ι s) (ι (natW (2^j))))=s-(Ϥ j<<<23):=by obtain⟨e,f,g,h⟩:=O4 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):π (BO (ι s) (ι y))=s:=by have n:θ s≠255:=ז;rw[Model.Proof.div_eq_spec];simp only[Model.Spec.div,ofW,Ϡ s n,Ϡ _ d];rw[(by simp[decodeD,a,b]:Ν s=⟨η s,0,0⟩),(by rw[decodeD_sig_zero];simp[f]:((Ν y).significand==0)=false),Ad,e];have q:=s.toNat_lt_size;simp only[Fc]at q;have j:=ZH s;have k:=ZR s;rw[a]at j;rw[b]at k;simp at j k;have g:=G5 s;cases l:η s;rw[l]at g;have:s؎<2^31:=(by simpa using g.symm);rw[(ύ.1 ו:s=0)];rfl;rw[l]at g;have:2^31<=s؎:=by simpa using g.symm rw[(ύ.1 ו:s=߾)];rfl lemma ZcI (s:δ)(j:ٳ)(a:j<=6)(b:θ s=0)(d:fracOf s=0):π (BO (ι s) (ι (natW (2^j))))=s:=by obtain⟨e,f,g,-⟩:=O4 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 ε;split;simp;rw[ξ,AG,show(0x800000:ػ)˧=2^23 from rfl,ν א];omega lemma ZcJ (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[Τ,Ϝ];by_cases d:m˧=0;simp[d];omega lemma O3 (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 ZcL (m:ػ)(d:ٳ)(a:d<64)(h:m˧*2^d<2^64):(m<<simp[ES,Ei] lemma D5 (w:δ):(if η w then-((Yl w)˧:ٴ)else ((Yl w)˧:ٴ))=sv w:=by rw[Zs];rfl lemma ZO:sv ζ=2^23/\γ ζ=126:=ד lemma R1 (a b:δ)(e:ٳ)(h:ε a*ε b≠0->e<128): -2^175constructor<;>linarith lemma ZcN (S e:ٴ)(a b:ف)(h:S≠0):ρ S e a=ρ S e b:=by simp[ρ,h] lemma ZcO (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=߿then (if nz then߾else 0)else r.toUInt32 else slow () lemma K6 (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+γ bδ)(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;obtain⟨L1,L2⟩:=ZcO (Yf a*Yf b) (Yf c*Yf d) (Yd a+Yd b) (Yd c+Yd d);generalize (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 v;have F1:=K6 a b j (B6 a b) (K2 a b) L1 v.1;have F2:=K6 c d j (B6 c d) (K2 c d) L2 v.2;let K:=λ n o p q=>let r:=YD n o p q ((j˧:ٴ)-298);if r=߿then (if f then (߾:ؼ)else 0)else r՜;obtain⟨s,t,u,k,z,A,B⟩:=Zr j a b 0 0 0 0 (YL j c d · · · · K) ג F1;rw[z];obtain⟨n,o,p,q,C,-,D⟩:=Zr j c d s t u k K (by simp at A;omega) F2;rw[C];simp only[K];have w:=R1 a b (γ a+γ b-j˧) (λ l=>א);have x:=R1 c d (γ c+γ d-j˧) (λ l=>א);rw[ZV n o p q _ (sv a*sv b*2^(γ a+γ b-j˧)+sv c*sv d*2^(γ c+γ d-j˧)) (by linarith[w.1,x.1]) (by linarith[w.2,x.2]) (by rw[D,Ϫ,B,<-Ϫ];simp[Yx]),ZC (sv a*sv b) _ j˧ (or_iff_not_imp_left.2 λ l=>(F1 λ h=>l (by rw[<-Zn,h];simp)).1),ZC (sv c*sv d) _ j˧ (or_iff_not_imp_left.2 λ l=>(F2 λ h=>l (by rw[<-Zn,h];simp)).1),<-add_mul];split<;>rename_i y;rw[if_pos rfl,y,zero_mul];cases f<;>rfl;rw[if_neg,UInt32.toUInt32_toUInt64,sub_eq_neg_add,Aa];exact ZcN _ _ _ _ (mul_ne_zero y (pow_ne_zero _ two_ne_zero));exact λ h=>(AK _).ne (congrArg Er h);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 Q9 (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) lemma Y0p (k:ػ)(a:k˧<1024):Y0 ((k˧:ٴ)-149) true (k-149):=by intro c d _ b;rw[ξ,Τ,show(149:ػ)˧=149 from rfl]at b⊢;push_cast at b⊢;omega @[inline] def Ge (w A:ػ) (e:Unit->ٴ) (z o:ف) (B:ػ):ؼ:= if w=0 then (if z then߾else 0) else let n:=w>>>63 !=0;let m:=if n then 0-w else w;let L0:=A-1+(if m>>>A !=0 then 1 else 0);let L:=if m>>>L0==1 then L0&&&63 else Yj m;let u:=B+L+126;if o&&u<=253 then YZ n u (m<<<(63-L))else Ybn n m (e ()) lemma Gc (w A:ػ)(e:Unit->ٴ)(a b:ف)(B:ػ):Ge w A e a b B=YaPT w e a b B:=by unfold Ge YaPT YauT;simp only[(by intro m L;split<;>rename_i h;have d:=congrArg Er (eq_of_beq h);rw[Ξ,ψ,Da]at d;have p:=Δ (L˧%64);have f:=Av m˧ (2^(L˧%64));have g:=Nat.lt_div_mul_add (a:=m˧) p;rw[d,Ϙ]at f g;apply σ.mp;rw[Zj m (λ h0=>by rw[h0]at f;simp at f),BR,show(63:ػ)˧=2^6-1 from rfl,ϡ];exact((Af א).mpr ⟨f,by rw[Nat.pow_succ];omega⟩).symm;rfl:∀m L:ػ,(if m>>>L==1 then L&&&63 else Yj m)=Yj m)] @[inline] def YaW (sa:ف) (ma ia:ػ) (sb:ف) (mb ib:ػ) (nz:ف) (slow:Unit->δ):δ:= let k:=if ma==0 then ib else if mb==0 then ia else if ia<=ib then ia else ib;let da:=if k<=ia then ia-k else 0;let db:=if k<=ib then ib-k else 0;if da<=38&&db<=38 then let ta:=ma<<(k˧:ٴ)-149) nz true (k-149) else slow () lemma ZcP (j:ف)(a e:ػ)(l:ف)(b f:ػ)(o:ف)(g:Unit->δ)(p:a˧<2^24)(q:b˧<2^24)(he:e˧<1024)(hf:f˧<1024)(r:g ()=ρ ((if j then-(a˧:ٴ)else a˧)*2^e˧+(if l then-(b˧:ٴ)else b˧)*2^f˧) (-149) o):YaW j a e l b f o g=g ():=by rw[r];unfold YaW;dsimp only;have kb:Y1 a b e˧ f˧<1024:=by unfold Y1;split_ifs<;>omega generalize e1:(if a==0 then f else if b==0 then e else if e<=f then e else f)=K;have hk:K˧=Y1 a b e˧ f˧:=by subst e1;unfold Y1;split_ifs<;>simp_all[ϐ,min_def] have E:∀X:ػ,(if K<=X then X-K else 0)=(X˧-K˧).toUInt64:=λ X=>by have:=X܉;apply σ.1;split<;>rename_i h<;>[rw[Η _ _ h];simp only[ϐ]at h]<;>simp<;>omega rw[E e,E f];obtain⟨x,y⟩:=Q9 a b e˧ f˧;set k:=Y1 a b e˧ f˧;split<;>rename_i s . have s:e˧-k<=38∧f˧-k<=38:=by simp[ϐ]at s;omega rw[Gc,C4,L6 _ _ _ _ _ (Y0p K (hk▸kb)),hk];have t:a˧*2^(e˧-k)<2^62:=(As p (Ι ב s.1) ה).trans_eq ב;have u:b˧*2^(f˧-k)<2^62:=(As q (Ι ב s.2) ה).trans_eq ב;have v:=ZY a (e˧-k) j (Ρ s.1 ד) t;have w:=ZY b (f˧-k) l (Ρ s.2 ד) u;rw[O3 _ _ ?_ ?_]<;>rw[v,w] . rw[(by ring:(k:ٴ)-149=-149+k),Aa,ZC (if j then-(a˧:ٴ)else a˧) e˧ k (x.imp_left λ h=>by simp[h]),ZC (if l then-(b˧:ٴ)else b˧) f˧ k (y.imp_left λ h=>by simp[h])];ring all_goals have B:(a˧*2^(e˧-k):ٴ)<2^62:=mod_cast t;have C:(b˧*2^(f˧-k):ٴ)<2^62:=mod_cast u;have D:(0:ٴ)<=a˧*2^(e˧-k):=ג;have E:(0:ٴ)<=b˧*2^(f˧-k):=ג;split_ifs<;>linarith . exact r @[inline] def YaX (a b:δ):δ:= if θ a=255\/θ b=255 then π (Cr (ι a) (ι b)) else YaW (η a) (Yl a) (Yd a) (η b) (Yl b) (Yd b) (η a&&η b) (λ _=>Yal a ζ b ζ (η a&&η b) (λ _=>π (Cr (ι a) (ι b)))) lemma ZcQ (a b:δ):YaX a b=π (Cr (ι a) (ι b)):=by unfold YaX;split;rfl rename_i h;have d:=ZcD a b (h∘Ea) (h∘EY);have f:π (Cr (ι a) (ι b))=ρ (sv a*sv ζ*2^(γ a+γ ζ)+sv b*sv ζ*2^(γ b+γ ζ)) (-298) (η a&&η b):=by rw[d,ZO.1,ZO.2,(ב:(-149:ٴ)=-298+((149:ٳ):ٴ)),Aa];congr 1;ring rw[<-D5 a,<-D5 b,<-Zf a,<-Zf b]at d;rw[ZcP _ _ _ _ _ _ _ _ (Zs _▸Ϛ a) (Zs _▸Ϛ b) (by rw[Zf];exact Ρ (Zg a) ד) (by rw[Zf];exact Ρ (Zg b) ד) (by rw[R0 _ _ _ _ _ _ f,←f];exact d),R0 _ _ _ _ _ _ f,f] @[inline] def YaY (x y z:δ):δ:= if θ x=255\/θ y=255\/θ z=255 then π (Eu (ι 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<<π (Eu (ι x) (ι y) (ι z))) lemma ZcR (x y z:δ):YaY x y z=π (Eu (ι x) (ι y) (ι z)):=by unfold YaY;split;rfl;rename_i h;simp only[not_or]at h;dsimp only;rw[ZaX x y z h.1 h.2.1 h.2.2];split;swap;refine(R0 _ _ _ _ _ _ (Eq.symm ?h)).trans ?h;rw[ZO.1,ZO.2];ring;rename_i d;have e:(Yl x*Yl y)˧=ε x*ε y:=by rw[ϯ,Zs,Zs];exact ν (mul_mant_lt x y) obtain⟨o,p⟩:=Q9 (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 f:a˧*2^(γ x+γ y-k)<2^62:=e▸(As (BP (Ϛ x) (Ϛ y)) (Ι two_pos d.1) ד).trans_eq rfl;have g:(Yl z)˧*2^(γ z+149-k)<2^62:=Zs z▸(As (Ϛ z) (Ι two_pos d.2) ד).trans_eq rfl;have j:=ZY _ _ (Ζ (η x) (η y)) א f;have l:=ZY _ _ (η z) א g;have n:=e▸Zn x y;have q:(0:ٴ)<=a˧*2^(γ x+γ y-k):=ג;have r:(0:ٴ)<=(Yl z)˧*2^(γ z+149-k):=ג;rw[H1,O3,j,l,n,D5,sub_eq_neg_add,Aa,ZC (sv x*sv y) _ k (o.imp_left λ b=>by rw[<-n,b];simp),ZC (sv z) _ k (p.imp_left λ b=>by rw[<-D5,b];simp)];ring;all_goals (rw[j,l];cases Ζ (η x) (η y)<;>cases η z<;>simp<;>linarith only[q,r,f,g]) @[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 π (BO (ι s) (ι (natW (2^j)))) lemma Q8 (j:ٳ)(a:j<=6)(s:δ):YaA j s=π (BO (ι s) (ι (natW (2^j)))):=by unfold YaA;split;next h=>exact(ZcG s j a h.1 h.2).symm split;next b=>exact(ZcI 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 π (BO (ι s) (ι (natW kk))) lemma Q7 (a:ٳ)(s:δ):YaB a s=π (BO (ι s) (ι (natW a))):=by unfold YaB;split;next h=>subst h;exact Q8 2 ב s split;next h=>subst h;exact Q8 6 ב s rfl def YaZ (c h w k:ٳ) (inp:ؽ δ):ؽ δ:= AF (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 ZcS:YaZ=avgpoolSpec:=by funext c h w k a;simp only[YaZ,avgpoolSpec,avgpoolWith,Q7,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 H2 (n:ؾ)(l o:(t:ؾ)->tδ)(f a:ٳ->δ)(p:∀t h,l t h=f t؛)(q:∀t h,o t h=a t؛)(b:ػ)(e:ٴ)(g j:ؼ)(s:n؛<2^32)(r:ε g*ε j≠0->b˧<=γ g+γ j/\γ g+γ jk؛<=n؛->c˧<=k؛->(∀t,k؛<=t->tε (f t)*ε (a t)≠0->b˧<=γ (f t)+γ (a t)/\γ (f t)+γ (a t)((Yx z A B+c˧:ٳ):ٴ)%2^192=S0%2^192->S=S0+Yr f a b˧ k؛ (n؛-k؛)+sv g*sv j*2^(γ g+γ j-b˧)-> -2^191<=S->S<2^191->YE n l o b e g j z A B c k=if S=0 then߿else (ρ S e false)܅:=by intro d;induction d<;>intro k z A B c S0 S C P K J;rw[YE,dif_neg (υ.not.2 א)];obtain⟨u,v,w,x,E,-,F⟩:=Zr b g j z A B c (YD · · · · e) א r;rw[E,C,Yr];intro G H L M;apply ZV u v w x e S L M;rw[F,H,add_zero];exact DT _ G;rename_i N;have D:=υ.2 (Al C);have y:=QK n k D;rw[YE,dif_pos D,p,q];obtain⟨u,v,w,x,E,O,F⟩:=Zr b (f k؛) (a k؛) z A B c (YE n l o b e g j · · · · (k+1)) א (J k؛ le_rfl (υ.1 D));rw[E,(by clear* -y C;omega:n؛-k؛=(n؛-(k+1)؛)+1),Yr,y];have I:=N (k+1) u v w x (S0+sv (f k؛)*sv (a k؛)*2^(γ (f k؛)+γ (a k؛)-b˧)) S (by clear* -y C;omega) (y▸υ.1 D) (y▸O.trans (Nat.succ_le_succ K)) (λ t Q=>J t א);exact λ G H=>I (F.trans (DT _ G)) (by rw[H,y];ring) lemma G4 (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<;>intro k h;simp[Yr];rename_i e;obtain⟨f,g⟩:=ZL (a k) (b k) d (h k le_rfl א);obtain⟨j,l⟩:=e (k+1) (λ t n o=>h t א א);rw[Yr];push_cast;constructor<;>linarith lemma Q6 (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 j h;simp[Yo,Yr];rename_i g;rw[Yo,Yr,g (k+1) א (λ t l n=>h t א א)];simp only[(א:ktδ)(e a:ٳ->δ)(o:∀t h,f t h=e t؛)(p:∀t h,g t h=a t؛)(b:ؼ)(d:ػ)(hK:K<ށ)(q:∀t,tθ (e t)≠255)(r:∀t,tθ (a t)≠255)(s:θ b≠255)(j:∀t,tε (e t)*ε (a t)≠0->d˧<=γ (e t)+γ (a t)/\γ (e t)+γ (a t)<=d˧+122)(l:ε ζ*ε b≠0->d˧<=γ ζ+γ b/\γ ζ+γ b<=d˧+122)(n:δ)(u:n=Γ (K+1) (λ t=>if tif tif tif tj t א v);have E:=ZL ζ b d˧ l;generalize z:Yr e a d˧ 0 K+sv ζ*sv b*2^(γ ζ+γ b-d˧)=Srel;rw[H2 _ _ _ e a o p _ _ _ _ א (λ h=>by have:=l h;omega) K _ _ _ _ _ 0 Srel (by simp[x]) ג ג (λ t _ y v=>by have:=j t א v;omega) (by simp[Yx]) (by rw[<-z,x];simp) א א];exact A9 _ _ (decide (K+1≠0)&&Yq (λ t=>if tif tu) (by rw[Zy (K+1) _ _ (by intro k F;by_cases w:ksimp only[w,ר,ש];exact⟨q k w,r k w⟩;exact⟨ד,s⟩),ZW,Q6 e a K d˧ oneW b K 0 א (λ t _ y v=>(j t א v).1)];simp;rw[ZA oneW b d˧ (λ h=>(l h).1),<-z];ring) lemma S2 (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;intro;rfl;next r e=>intro;rw[YB,Yr,e] lemma R7 (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) (A4 X a n t f j h)) (λ t h=>W.uget (b+t) (A4 W b n t g l h)) o e ζ p r s u c k:=by intro d;induction d<;>intro k r s u c v;have q:¬kf˧<=γ ζ+γ g/\γ ζ+γ gk؛<=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[R7 X W a b n j l o p f e g _ k s u v c rfl];exact H2 n _ _ (λ t=>X[a؛+t]!) (λ t=>W[b؛+t]!) (λ t h=>B3 X a t _ (by have:=υ.1 h;omega)) (λ t h=>B3 W b t _ (by have:=υ.1 h;omega)) f e ζ g q r d k s u v c S0 S w x y z A (by rw[B,S2]) C D lemma W6 (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=>S2 X W a b d r k▸G4 _ _ d r k h lemma L8 (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<ށ)(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[R7 X W _ _ _ e f g k d _ b _ 0 0 0 0 0 rfl];exact L7 a _ _ (λ t=>X[i*a+t]!) (λ t=>W[j*a+t]!) (λ t h=>by rw[B3 X _ t _ (by have:=υ.1 h;omega),n]) (λ t h=>by rw[B3 W _ t _ (by have:=υ.1 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 have F:=O2 X W b a i j;unfold YaU;split;swap;exact F;obtain⟨G,H,I,J,K⟩:=‹_∧_›;have w:=Za (i*a) א;have x:=Za (j*a) א;have p:=Za a א;obtain⟨c,e,y,Z,L,r⟩:=Zp X a i G I;obtain⟨m,E,z,_,M,s⟩:=Zp W a j H J;generalize Yc X a i=f,Yc W a j=g at y z⊢;obtain⟨N,A⟩:=Zo f c e y א;obtain⟨O,B⟩:=Zo g m E z א;obtain⟨k,u⟩:=D7 f g b[j]!;obtain⟨l,v⟩:=D6 f g b[j]!;rw[N,O]at k;rw[A,B]at l;dsimp only;split;exact F;rename_i C;simp only[Ϸ,ת,not_or]at C;obtain⟨⟨⟨⟨P,Q⟩,R⟩,S⟩,T⟩:=C;obtain⟨Y,D⟩:=E8 _ _ S T;by_cases n:Yu f g b[j]! -Yp f g b[j]!<=63;rw[if_pos n,I6 _ X W (i*a)۞ (j*a)۞ a۞ _ _ _ _ (Yp f g b[j]!) _ b[j]! א _ (λq=>ϐ.1 (of_decide_eq_true q)) (ϐ.1 n) (λt d o=>by rw[w,x]at o⊢;exact ZQ k l (Η _ _ (ϐ.2 Y)).ge (r t (p▸d)) (s t (p▸d)) o) a۞؛ 0 0 0 0 0 ג (λ_=>⟨rfl,ג⟩)];swap;rw[if_neg n];all_goals exact L8 X W a i j b[j]! (Yp f g b[j]!) _ _ _ _ w x p K (λt d=>(Zb _).2.2.1 ((r t d).2.trans_lt (L.lt_of_ne λh=>P (ύ.1 (A.trans h))))) (λt d=>(Zb _).2.2.1 ((s t d).2.trans_lt (M.lt_of_ne λh=>Q (ύ.1 (B.trans h))))) R (λt d=>ZQ k l D (r t d) (s t d)) (λo=>⟨u (right_ne_zero_of_mul o),(v (right_ne_zero_of_mul o)).trans (BK.1 D)⟩) _ F @[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 Q5 (c a b A B:ٳ)(e:a(Ys s t܂).toUInt32)[t]!)؎=Ys s t:=ח lemma ZcX (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;intro k _;simp[Yo,Yr];next r e=>intro k h;rw[Yo,Yr,e (k+1) (λ t f g=>h t א א),ZA _ _ d (h k le_rfl א)];ring lemma ZcY (K:ٳ)(e f:(t:ؾ)->tδ)(b a:ٳ->δ)(k:∀t h,e t h=b t؛)(l:∀t h,f t h=a t؛)(d:ػ)(hK:K<ށ)(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 r:K۞؛=K:=Za _ א;have B:=G4 b a d˧ K 0 (λ t _ s q=>g t א q);generalize u:Yr b a d˧ 0 K=S;rw[H2 _ _ _ b a k l _ _ _ _ א (absurd ד) K _ _ _ _ _ 0 S (by simp[r]) ג ג (λ t _ s q=>by have:=g t א q;exact⟨this.1,א⟩) (by simp[Yx]) (by rw[<-u,r,(ד:sv (0:ؼ)=0)];simp) א א];exact A9 _ _ (decide (K≠0)&&Yq b a 0 K) _ _ (λ _=>p) (by rw[Zy K b a (λ t v=>⟨n t v,o t v⟩),ZcX b a d˧ K 0 (λ t _ s q=>(g t א q).1),<-u];ring) lemma N4 (B:ؽ δ)(k n a j:ٳ)(h:(a+k)*n<=Bٽ/\jA[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) lemma Zam (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<ށ): δ:= if h:r*k+k<=Aٽ/\r*k+k<=ހ/\((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:=N4 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'<߿then r'.toUInt32 else Yan A B k n r bk j else Yan A B k n r bk j lemma ZcZ (A B:ؽ δ)(k n r a j:ٳ)(b:k<ށ):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 have p:=Zam A B k n r a j;unfold Ya2;split;swap;exact p;rename_i e;obtain⟨c,i,s,O,H,u⟩:=Zp A k r e.1 e.2.1;obtain⟨m,R,v,P,I,w⟩:=Zp B Bٽ 0 א א;generalize Yc A k r=l,Yc B Bٽ 0=o at s v⊢;obtain⟨J,x⟩:=Zo l c i s א;obtain⟨K,y⟩:=Zo o m R v א;obtain⟨f,-⟩:=D7 l o 0;obtain⟨g,-⟩:=D6 l o 0;dsimp only;split;exact p;rename_i z;simp only[Ϸ,ת,not_or]at z;obtain⟨⟨⟨C,D⟩,L⟩,M⟩:=z;simp only[←ύ,x,y,CD]at C D;obtain⟨Q,N⟩:=E8 _ _ L M;rw[x,y]at g;rw[J,K]at f;have E:∀t(by rw[Dp];omega:(a+t)*n+j<(a+t+1)*n).trans_le ((ω _ א).trans e.2.2.1) have F:∀t,B[(a+t)*n+j]! =B[0*Bٽ+((a+t)*n+j)]!:=ג;apply ZcY k _ _ (A[r*k+·]!) (λ t=>B[(a+t)*n+j]!) _ _ (Yp l o 0) b;exact λ t d=>(Zb _).2.2.1 ((u t d).2.trans_lt (H.lt_of_ne C));intro t d;rw[F t];exact(Zb _).2.2.1 ((w _ (E t d)).2.trans_lt (I.lt_of_ne D));intro t d G;rw[F t]at G⊢;exact ZQ f g N (u t d) (w _ (E t d)) G;exact p;intro t d;obtain⟨h,q⟩:=Z0 A r k ⟨e.1,e.2.1⟩ t d;show A[((r*k)۞+t)؛]=_;rw[<-ح A _ (by rwa[h])];simp only[h];intro t d;obtain⟨h,q⟩:=N4 B k n a j e.2.2 b t d;show B[((a*n+j)۞+t*n۞)؛]=_;rw[<-ح B _ (by rwa[h])];simp only[h] def Ya3 (batch m k n:ٳ) (A B:ؽ δ):ؽ δ:= if hk:k<ށ 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 c m k n A B;unfold Ya3 gemmSpec;split;rename_i a;rw[ZB _ _ _ (ϣ _ _ _)];congr 1;funext q;rw[(by rw[ϧ,Θ n m]:q܂/n/m=q܂/(m*n))];conv_lhs=>rw[(by intro v;rw[Θ m n,<-ϧ];exact(϶ _ _).symm:∀v:ٳ,v/n=v/(m*n)*m+v/n%m) q܂] obtain⟨f,g,h⟩:=Zt c m n q܂ q.isLt;rw[Ze (c*m) (Yc A k) _ (Ag (א:_linarith[bpow_le_bpow_of_le h] lemma cB {n d:ٳ}(e:ٴ)(a:n≠0)(b:d≠0):bpow (floorLog2 n d+e)<=n/d*bpow e/\n/d*bpow eAP (Bl n d x).1 (Bl n d x).2=AP (Bl a b r).1 (Bl 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+BG (Cb f)) (by rw[j];ring_nf),u _ (BG f߷-Br a b) (by rw[j,(א:BG f߷-Br n d-e=BG f߷-Br a b-g)]),y] lemma N3 (Q:ℚ)(s:ف)(N D:ٳ)(E:ٴ)(b:00simp_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 (by rw[a];cases s<;>simp[g.ne']:Q≠0) have k:(0:ℝ)push_cast<;>simp[abs_of_pos k] rw[(by rw[a];cases s<;>simp[g,not_lt.2 g.le]:decide (Q<0)=s)];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)(f:u%2=0)(e:0.trans ג;rw[bpow_natCast];push_cast;rw[pow_succ];linarith;rw[(by push_cast;ring:((q܀+1:ℕ):ℤ)+1=((q܀+2:ℕ):ℤ)),bpow_natCast];push_cast;rw[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,(ב:(4:ℝ)=2*2),mul_zpow,sq]:(b:ℝ)/a=(q:ℝ)*((2:ℝ)^(-e))^2),Real.sqrt_mul (by exact_mod_cast d.le),Real.sqrt_sq ה];simp only[bpow,binaryRadix,Fa];push_cast;rw[mul_assoc,<-zpow_add₀ (ב:(2:ℝ)≠0)];simp:Db ((b:ℝ)/a)*bpow binaryRadix e=Db (q:ℝ))]at n o simp only[sqrtMathWord,not_le.2 d,ש,n,(by rw[o,<-Model.roundedMantissa_shiftToTargetExponent_eq_nearestEven κ _ e _ _ k l];simp:(nearestEven (scaledMantissa binaryRadix (Model.fexpOf κ) (Db (q:ℝ))))׆=(shiftToTargetExponent (ϓ κ) (Ϗ b a) e (sqrtAccuracy b a)).1.roundedMantissa)];rw[Model.roundWithAccuracy_eq_finishRoundedMantissa,Model.shiftToTargetExponent_eq_of_le_targetExponent κ _ e _ l] 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 ރ<=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) λ _=>Ac (ϫ 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) λ _ => Ac (ϫ 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:=Zg w 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;simp[b];next j l f=>simp;obtain⟨g,h⟩:=f (ϛ a (m j)߸ (k j)) (by rwa[addLimbs64_size]);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<;>intro p q g h;simp[g,h];rename_i j l s;simp only[AO,CR,DV,d];have t:=Ϛ x[a+j]!;have u:=iB x[a+j]!;by_cases k:η x[a+j]! =true<;>simp only[k,ר,φ,ש]<;>refine(s _ _ (by simp[addLimbs64_size,g,h]) (by simp[addLimbs64_size,g,h])).imp id (And.imp id λ r=>?_)<;>rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by simp[g,h];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;simp;next j l b=>simp[AO,b,add_assoc] lemma A3 (a b:ٳ):sqrtAccuracy a b=Dc (sqA a b (Ϗ a b)) 4:=by unfold sqrtAccuracy sqA;dsimp only;simp only[sq];split_ifs<;>rfl lemma J9 (N d:ٳ):N/d<=AP N d/\AP N d<=N/d+1:=by unfold AP;dsimp only;split_ifs<;>omega lemma J5:κ߷=23/\Ct κ߷=ރ/\Ct (κ߷+1)=ނ/\Ef κ= -126/\BG (Eg κ)=127/\BG κ.bias=127:=ד lemma QW (E F:ٳ):π (Bj (ϥ false E F))=ϥ false E F:=cW _ lemma J4 (r:ٳ)(k:ٴ)(b:ރ<=r)(d:r<ނ)(e:-126<=k)(a:k<=127):π (BT κ (Cn (ϓ κ) .positive (r,k-23)))=ϥ false (k+127)׆ (r-ރ):=by obtain⟨j,g,f,m,M,o⟩:=J5;rw[(by rw[j];rfl:(k-23:ٴ)=k-(κ߷:ٴ)),Model.finishRoundedMantissa_normalized _ _ _ _ (by rw[g];exact b) (by rw[f];exact d) (by rw[m];exact e)];erw[Bo κ false r k (by rw[g];exact b) (by rw[f];exact d) (by rw[m];exact e) (M▸a)];have h:=QW (k+127)׆ (r-ރ);rwa[BB]at h lemma J6 (k:ٴ)(b:-126<=k)(a:k+1<=127):π (BT κ (Cn (ϓ κ) .positive (ނ,k-23)))=ϥ false (k+1+127)׆ 0:=by obtain⟨f,g,d,c,i,l⟩:=J5;rw[(by rw[f];rfl:(k-23:ٴ)=k-(Fmt߷:ٴ)),show(ނ:ٳ)=Ct (κ߷+1)from d.symm,Model.finishRoundedMantissa_normalized_carry κ .positive k (by rwa[c])];erw[Bo κ false (Ct κ߷) (k+1) le_rfl (by rw[g,d];decide) (by rw[c];omega) (by rwa[i])];have e:=QW (k+1+127)׆ 0;rwa[BB]at e theorem A8 (b d:ٳ)(e:ٴ):sqW b d (Ϗ b d) e=π (BT κ (Bp (ϓ κ) .positive (Ϗ b d) e (sqrtAccuracy b d))):=by have l:=A3 b d;unfold sqW;generalize Ϗ b d=c at l⊢;have j:(ϓ κ).mantissaBits=24:=ד;have k:(ϓ κ).minExponent= -149:=ד;by_cases u:c<ނ<;>simp only[u,ר,ש,CP,add_zero,EU] all_goals split;swap;rfl rename_i v;obtain⟨w,x,A,y,z⟩:=v;have n:sqA b d c<4:=by unfold sqA;split_ifs<;>omega generalize sqA b d c=a at l n⊢;rw[l];have g:=Model.roundWithAccuracy_quotient_eq_finishRoundedMantissa (ϓ κ) .positive (4*c+a) 4 e ב;rw[Cf (ד:4>0),Υ n,ϑ,Ce,ν n]at g;have f:c≠0:=א;clear l A · have h:((ϓ κ).targetExponent (Bb c e)-e)׆=0:=by simp only[BH,Bb,j,k,((Af f).2 ⟨w,u⟩:c܀=23)];clear* -y;omega rw[g];dsimp only;rw[h];simp only[pow_zero,mul_one,CP,add_zero];obtain⟨q,s⟩:=J9 (4*c+a) 4;generalize AP (4*c+a) 4=r at q s⊢;rw[Cf (ד:4>0),Υ n,ϑ]at q s;rw[show e=(e+23)-23 by ring];clear g h f j k;split next t=>subst t;rw[J6 (e+23) א א];congr 2;omega ·rw[J4 r (e+23) א א א א];congr 2;omega · have h:((ϓ κ).targetExponent (Bb c e)-e)׆=1:=by simp only[BH,Bb,j,k,((Af f).2 ⟨DZ.1 u,x⟩:c܀=24)];clear* -y;omega rw[g];dsimp only;rw[h];simp only[pow_one,EU];obtain⟨q,s⟩:=J9 (4*c+a) (4*2);generalize AP (4*c+a) (4*2)=r at q s⊢;rw[←ϧ,Cf (ד:4>0),Υ n,ϑ]at q s;rw[show e+1=(e+24)-23 by ring];clear g h f j k;split next t=>subst t;rw[J6 (e+24) א א];congr 2;omega ·rw[J4 r (e+24) א א א א];congr 2;omega lemma N1 (a m:ٳ)(h:ٴ)(q:ℚ)(d:0Ac q)=Ac q:=by unfold YaD;simp only[A8];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[(ב:(2:ٳ)^23=ރ)];exact j);rw[<-f,(by ring: -(h-t)=t-h),zpow_sub₀ ב];simp only[Α];push_cast;rw[e,Cj א];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 N0 (a:δ)(b:0<ς a):ς a=(ε a:ℚ)*2^((γ a:ℤ)-149):=by simp only[rationalWord,ϙ]at b⊢;unfold sv at b⊢;split_ifs at b⊢with d;have:(0:ℚ)<=2^((γ a:ٴ)-149):=ה;push_cast at b;nlinarith[(ה:(0:ℚ)<=ε a)];push_cast;ring lemma M9 (x:ؽ δ)(n r a:ٳ)(b:∀ja<=γ 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=>ε x[r*n+j]! *ε 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];rw[(ד:ϋ (Χ 18 0)܍=0),Β,Nat.cast_list_sum,Df,<-Dg];congr 1;apply Ck;intro j f;simp only[Function.comp,ς,ϙ];by_cases d:ε x[r*n+j]! =0;simp[d,sv];rw[mul_pow,Zc7,(by rw[<-ؠ (2:ℚ) (2*(γ x[r*n+j]! -a)),<-zpow_add₀ ב,<-ؠ _ 2,<-zpow_mul];congr 1;push_cast[b j (BM.1 f) d];ring:((2:ℚ)^((γ x[r*n+j]!:ℤ)-149))^2=(2:ℚ)^(2*(γ x[r*n+j]! -a))*2^((2*a:ℤ)-298))];push_cast;ring lemma M8 (x:ؽ δ)(n r a:ٳ)(b:∀ja<=γ 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];rw[(ד:ϋ (Χ 18 0)܍=0)];push_cast;rw[zero_add,Df,<-Dg];congr 1;apply Ck;intro j f;simp only[Function.comp,rationalWord,ϙ];push_cast;by_cases d:ε x[r*n+j]! =0;simp[d,sv];rw[mul_assoc,<-ؠ,<-zpow_add₀ ב];push_cast[b j (BM.1 f) d];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;simp;next j l a=>simp only[CR,DV,Ex,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 (BM.2 e) f intro l;induction l<;>intro b;simp;next a l p=>simp only[AO];obtain⟨h,q⟩:=p (if ε x[d+a]! =0 then b else min b (γ x[d+a]!));refine⟨Cp h (by split_ifs<;>omega),λ k g o=>?_⟩;rcases List.mem_cons.1 g with rfl|g;exacts[Cp h (by simp[o]),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⟨א,א,?_⟩;rw[show(4:ℚ)=2^(2:ℤ)from ב,<-zpow_mul];congr 1;omega lemma M7 (A n a b d:ٳ)(e:0(ς x[r*n+j]! -0)^2)];simp;rw[g] refine N1 _ _ _ _ (by rw[h];positivity) b ?_;rw[h,N0 a d];exact M7 _ _ _ _ _ b lemma M6 (n:ٳ)(x:ؽ δ)(r:ٳ)(μ:ℚ):0<=ϫ n x r μ:=by unfold ϫ;rw[fS,zero_add];exact div_nonneg (List.sum_nonneg λ a b=>by obtain⟨j,_,rfl⟩:=EZ.1 b;positivity) ה lemma V1 (x:ؽ δ)(n:ٳ)(a:δ)(r:ٳ)(b:0(ς x[r*n+j]!-rowMean n x r)^2),zero_add,sm,CM]:ϫ 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 rowMean;rw[fS (λj=>ς x[r*n+j]!),zero_add]:rowMean n x r=((ϒ n).map λj=>ς x[r*n+j]!).sum/n),<-f,<-g,(by rw[<-ؠ _ 2,<-zpow_mul];congr 1;ring:(2:ℚ)^((2*e:ٴ)-298)=(2^((e:ٴ)-149))^2)];push_cast;field_simp;ring rw[M7 _ _ _ _ _ (ϊ b b),h,(by exact_mod_cast Cj (by have:=M6 n x r (rowMean n x r);rw[h]at this;exact_mod_cast nonneg_of_mul_nonneg_left this (div_pos ה (by exact_mod_cast ϊ b b)):0<=(n:ٴ)*A-S1*S1):((((n:ٴ)*A-S1*S1)׆:ٳ):ℚ)=(((n:ٴ)*A-S1*S1:ٴ):ℚ))];push_cast;ring lemma V0 (x:ؽ δ)(n:ٳ)(a:δ)(r:ٳ)(b:0ℚ):δ:= 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) AW (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[EA];split_ifs with c<;>simp_all[abs_of_neg,abs_of_nonneg] lemma U9 (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(N3 _ _ _ _ _ f (λ p=>by simp at p;omega) ?_).symm;simp only[ς,ϙ,e];rw[eP];have d:(2:ℚ)≠0:=ג;rw[(by ring:(γ w:ℤ)+γ a-γ b-149=((γ w:ℤ)-149)+((γ a:ℤ)-149)-((γ b:ℤ)-149)),zpow_sub₀ d _ ((γ b:ℤ)-149),zpow_add₀ d ((γ w:ℤ)-149)];push_cast;field_simp lemma U8 (n:ٳ)(w e f:δ)(b:ٳ)(g:ٴ)(d:δ)(a:Unit->ℚ) (j:0b<=γ 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(N3 _ _ _ _ _ (ϊ j s) (λ p=>by simp at p;omega) ?_).symm;simp only[ς,ϙ,l];rw[eP];generalize q:min (b+γ e) (γ f+γ d)=c;have t:=q▸min_le_left _ _;have u:=q▸min_le_right _ _;simp only[YaF,CV,r];push_cast;have o:(2:ℚ)≠0:=ג;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 rw[(by by_cases m:ε w=0;simp[sv,m];rw[mul_assoc,<-ؠ,<-zpow_add₀ o];push_cast[k m];ring:(sv w:ℚ)*2^((γ w:ℤ)-149)=sv w*2^(γ w-b)*2^((b:ℤ)-149)),(by rw[<-ؠ,<-zpow_add₀ o];congr 1;push_cast[u];ring:(2:ℚ)^((γ f:ℤ)-149)=2^((c:ℤ)-149-γ d)*2^(γ f+γ d-c))];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:ٴ:=BG (lg a)-BG (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߾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߾else 0 else if t< -126 then let c:=sc2 N D (E+149);let f:=AP c.1 c.2;if f==0 then if s then߾else 0 else match Nat.decLe ރ f with | isTrue _=>ϥ s 1 0 | isFalse _=>ϥ s 0 f else let c:=sc2 N D (23-r);let m:=AP c.1 c.2;let k:=m==ނ;let x:=if k then t+1 else t;let y:=if k then ރ else m;if x>127 then if s then 0xff800000 else 0x7f800000 else ϥ s (Fe (x+127)) (y-ރ) @[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==ނ;let x:=if k then t+1 else t;let y:=if k then ރ else m;if x>127 then if s then 0xff800000 else 0x7f800000 else ϥ s (Fe (x+127)) (y-ރ) @[inline] def Ya9 (s:ف) (M:ٳ) (E:ٴ):ؼ:=if M>>>62=0 then Ya8 s M.toUInt64 E else YN s M 1 E @[inline] def Gf (n:ٳ) (w gw bw:δ) (b0:ٳ) (sn:ف) (sa:ٳ) (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))) sn sa 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 ނ<=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) @[inline] def Yba (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit->ℚ):δ:=Gf n w gw bw b0 (!(S1<0)) S1.natAbs dw mean @[inline] def Gk (n:ٳ) (w gw bw:δ) (s:ٳ×ف×ٳ×δ×(Unit->ℚ)):δ:=Gf n w gw bw s.1 s.2.1 s.2.2.1 s.2.2.2.1 s.2.2.2.2 lemma ZE (k:ٳ):p2 k=2^k:=by unfold p2;split;next h=>have a:k߸˧=k:=CG (by unfold Fd;omega);rw[ό,a,ν (א:k<64),Da,Nat.one_shiftLeft];exact ν (DJ ב א) rfl lemma U7 (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 U6 (a b:ٳ)(e:ٴ):lt2 a b e=Bi a b e:=by cases e<;>simp[lt2,Bi,ZE,Α] lemma U5 (a b:ٳ)(e:ٴ):ge2 a b e=Bk a b e:=by cases e<;>simp[ge2,Bk,ZE,Α] lemma U4:sc2=Bl:=by funext a b e;cases e<;>simp[sc2,Bl,ZE,Α] lemma M5:fl2=Br:=by funext a b;simp only[fl2,Br,U7,U6,U5] lemma G2 (s:ف)(N D:ٳ)(E:ٴ):YN s N D E=AW s N D E:=by unfold YN;rw[M5,U4];rfl lemma U3 (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,EO]at h;obtain⟨a,k,o⟩:=h;have d:M˧≠0:=λe=>a (σ.1 (by simpa using e));have f:=Zj M a;have p:24<=M˧܀:=f▸ϐ.1 k;obtain⟨g,_,_⟩:=Z7 M a;rw[if_pos (by show 23<=_;omega:κ߷<=M˧܀)]at g;rw[g,BQ,f,show κ߷=23 from rfl];unfold YN;rw[M5,Model.floorLog2_den_one _ d];simp only[show((1:ٳ)==0)=false from rfl,show(M˧==0)=false by simpa using d,(א:(23:ٴ)-(M˧܀:ٴ)=CJ (M˧܀-24)),sc2,ZE,φ,ש,Ϙ,(א:M˧܀-24+1=M˧܀-23)];by_cases j:(M˧܀:ٴ)+E>127;simp only[j,(by intro b;split<;>omega:∀b:ف,(if b=true then (M˧܀:ٴ)+E+1 else (M˧܀:ٴ)+E)>127),ר];simp only[j,ש,show¬(M˧܀:ٴ)+E< -150 from א,show¬(M˧܀:ٴ)+E< -126 from א] lemma U2 (s:ف)(M:ٳ)(E:ٴ):Ya9 s M E=YN s M 1 E:=by unfold Ya9;split;next h=>rw[U3];congr 1;simp[Nat.toUInt64];omega rfl def Yh (s:ف) (m:ٳ):ٴ:=if s then-(m:ٴ)else m lemma U1 (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 M4 (s:ف)(m:ٳ):(Yh s m).natAbs=m:=by cases s<;>simp[Yh] lemma M3 (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:=Nat.cast_pos.2 (Ο 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 U0 (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 M2 (s t:ف)(a b:ٳ):Yh (s !=t) (a*b)=Yh s a*Yh t b:=by cases s<;>cases t<;>simp[Yh] lemma T9 (S:ٴ):Yh (!decide (S<0)) S.natAbs= -S:=by unfold Yh;by_cases h:S<0<;>simp[h]<;>omega lemma T8 (w a b:δ):Ya7 w a b=elR w a b:=by unfold Ya7 elR;split;rfl;simp only[G2,(by rw[M2,ZF,ZF]:sv w*sv a=Yh (η w !=η a) (ε w*ε a)),M4,M3] lemma T7 (a:ف)(b d:ٳ)(f:ف)(B D:ٳ)(g:dsimp only[Yh]<;>simp<;>ring;obtain rfl:f=!a:=by cases a<;>cases f<;>simp_all 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 T6 (t k D:ٳ):(t/D*k+t%D*k/D)*D+t%D*k%D=t*k:=by rw[ϟ,BU,϶,Nat.mul_right_comm,<-ϟ,϶] lemma J8 (a m D:ٳ):a*m/D=a/D*m+a%D*m/D/\a*m%D=a%D*m%D:=by rcases Ae D with rfl|b;simp;rw[(by rw[<-ϣ,<-ϟ,Ez]:a*m=a%D*m+D*(a/D*m)),DG _ _ b,CF];exact⟨Ϟ _ _,rfl⟩ lemma T5 (n:ٳ)(w a b:δ)(g:ٳ)(h:ٴ)(d:δ)(f:Unit->ℚ) (j: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=>let s:=Y8 x n eps r.val;(s.1,!(s.2.1<0),s.2.1.natAbs,s.2.2,λ (_:Unit)=>rowMean n x r.val);YT rows n λ r j=>Gk n x[r*n+j]! g[j]! b[j]! st[r]! else layernormLegacyWith Yn rows n eps x g b lemma M1 (a n:ٳ)(b:δ)(x g:ؽ δ)(h:stableNormDomain a n b x g=true):0Ac (ϫ n x r 0+ς a)) _ b,V2 x n a _ e f,T8,U9];simp only[Zi] lemma Gl (n:ٳ)(w gw bw:δ)(x:ؽ δ)(a:δ)(k:ٳ):Gk n w gw bw (let s:=Y8 x n a k;(s.1,!(s.2.1<0),s.2.1.natAbs,s.2.2,λ (_:Unit)=>rowMean n x k))=Yba n w gw bw (Y8 x n a k).1 (Y8 x n a k).2.1 (Y8 x n a k).2.2 (λ _=>rowMean n x k):=rfl lemma T3: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⟩:=M1 rows n a x g j;rw[ZB _ _ _ rfl];congr 1;funext q;rw[϶];have e:q܂/nlet s:=Y8 x n a r;(s.1,!(s.2.1<0),s.2.1.natAbs,s.2.2,λ (_:Unit)=>rowMean n x r)) _ e,Gl,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,T5 _ _ _ _ _ _ _ _ d,U8 _ _ _ _ _ _ _ _ d (λ l=>by have:=Z2 x (q܂/n*n) n (q܂%n) (Ε _ d) (by rwa[h]);rwa[h]at this) (V0 x n a _ d), V1 x n a _ d k] . simp only[Zi] def Ye (q:ػ):ٴ:=(qپ:ٴ)-2^64*(qپ/2^63:ٳ) termination_by nپ-kپ decreasing_by exact ZI n k h lemma E2 (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⟩;rw[(σ.1 (by rw[Zk,b];rfl):Yf w=0),b];simp;have d:ε w*2^(γ w-m˧)<2^(24+k):=(Aj (Ϛ w) (Δ _)).trans_le ((Ci _ (Ι ב f)).trans_eq (by rw[Κ]));refine⟨?_,d⟩;rw[ό,(by rw[Η _ _ (ϐ.2 (by rwa[Zf])),Zf]:(Yd w-m)˧=γ w-m˧),Zk,ν (א:γ w-m˧<64),Α];exact ν (d.trans_le (Ι ב א)) lemma K8 (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[Ϝ,ϑ];by_cases d:p˧=0;simp[d];omega lemma QE {x y m:ٴ}(k:ٴ)(h:x=y+m*k):x%m=y%m:=by rw[h,CA] lemma T2 (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 E9 (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 n:=b܉;have o:=a܉;unfold Yx;rw[(by rw[Τ,Ξ];simp[ψ]:((0:ػ)-(a>>>63))˧=(2^64-a˧/2^63)%2^64),e,ϑ,BU,(א:a˧/2^63=(a˧*2^64+b˧)/2^127)];exact T2 _ d h (א:a˧*2^64+b˧<2^128) 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&&&ޅ)-Yk (bx>>>16) lemma M0 (A:ؽ δ)(a i:ٳ)(b:i*a+a<=Aٽ)(g:i*a+a<߿)(d:(Yc A a i&&&ޅ)≠255)(f:Yk (Yc A a i>>>16)<=Yk (Yc A a i&&&ޅ)):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,l,r,_,n⟩:=Zp A a i b א;obtain⟨c,j⟩:=Zo _ L H l א;have s:H≠255:=λh=>d (ύ.mp (by rw[j,h];rfl));unfold okF;rw[(by unfold YU;rw[Η _ _ f,Zq,Zq,c,j]:(YU (Yc A a i))˧=H-1-(L-1)),(by rw[Zq,c]:(Yk (Yc A a i>>>16))˧=L-1)];clear b g d f l c j;refine⟨?_,א,א,λt k=>(Zb A[i*a+t]!).2.2.1 (by have:=(n t k).2;omega)⟩;intro t k;refine(em _).imp_right λo=>?_;have p:=(Zb A[i*a+t]!).2.2.2 o;have q:=n t k;refine⟨Nat.sub_le_of_le_add (q.1.trans p.1),BZ ?_ _⟩;omega lemma K7 (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;obtain⟨e,j⟩:=d.resolve_left λh=>f (by rw[<-Zk a,h];simp);have k:=ϐ.1 e;have l:=Ψ.1 j;rw[ZM]at k;rw[Η _ _ e,ZM]at l;have:(80:ػ)˧=80:=rfl;constructor<;>omega lemma T1 (n:ٳ)(f:ٳ->δ):∀k i (a:ؽ δ),n-i=k->(Yaq n f i a)܍=a܍++(Bd i (n-i)).map f:=by intro k;induction k<;>intro i a h<;>unfold Yaq;rw[if_neg א];simp[h];next k b=>rw[if_pos א,b (i+1) _ א,Cx,h,Ϩ];simp lemma W4 (n:ٳ)(f:ٳ->δ):Ybd n f=ڀ n λ i=>f i܂:=by apply ϻ;rw[Ybd,T1 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 F5:YbeO=scaleShiftSpec:=by funext relu c a x s t;simp only[YbeO,ZB c a _ rfl,scaleShiftSpec,ZcR,϶] def Ybf (relu:ف) (a b:ؽ δ):ؽ δ:= Ybd aٽ λ i=>act relu (YaX a[i]! b[i]!) lemma W1:Ybf=addReluSpec:=by funext relu a b;simp only[Ybf,W4,ZcQ];apply congrArg;funext i;rw[ح a i܂ i.isLt];rfl lemma E0 (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 L9 (a:ػ):(a˧:ٴ)≡Ye a [ZMOD 2^64]:=by unfold Ye;rw[Int.modEq_iff_dvd];exact⟨-(a˧/2^63:ٳ),by ring⟩ lemma B5 (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 E0 _ _ d e;rw[ϯ];exact Int.emod_eq_zero_of_dvd (by push_cast;exact(Int.mod_modEq _ _).trans ((L9 a).mul (L9 b)):((a˧*b˧%2^64:ٳ):ٴ)≡Ye a*Ye b [ZMOD 2^64]).symm.dvd lemma I5 (w:δ)(m:ػ):YaJ w m=if η w then 0-Yf w<<<(Yd w-m)else Yf w<<<(Yd w-m):=by have h:=D4 w 0;rw[EE,show η 0=false from rfl,EM]at h;unfold YaJ;generalize Yf w<<<(Yd w-m)=v;split<;>rename_i a<;>simp only[a]at h;rw[(σ.1 (by rw[h];rfl):(w>>>31)܅=1)];apply σ.1;have:=v܉;simp[ϯ,show Fd=18446744073709551616 from rfl]at*;omega;rw[(σ.1 (by rw[h];rfl):(w>>>31)܅=0)];simp lemma J7 (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⟩:=E2 w m k a h;have:=Ι two_pos (Ϯ a 24);rw[I5,K8 _ _ א,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-߾) @[inline] def cq1 (a b:ػ):ػ:=((a>>>25)-߿)*(b-߾) @[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߿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 lotػ) (B0:ػ) (bw:ؼ) (a0 a1:ػ) (k:ؾ):ػ:= if h:k>>25)-߿)=X/2^25:=by constructor<;>apply E0 _ _ א א;rw[BR,show(0x1FFFFFF:ػ)˧=2^25-1 from rfl,ϡ];omega;simp only[Τ,Ξ,ψ];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[(א:γ x+γ w-(a˧+b˧)=γ x-a˧+(γ w-b˧)),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)+b>>1)>>>(63-s)else (Yf a<<<23)<<<(s-64))˧*2^64+(if s<64 then (Yf a<<<23)<<rename_i h<;>rw[Ψ,ξ]at h<;>simp only[ξ,Bc,Nat.mod_add_mod]<;>push_cast<;>omega lemma Y5b (e a d b:ػ):((((e-d-(if arename_i h<;>rw[Ψ]at h<;>simp only[Τ,Nat.add_mod_mod]<;>push_cast<;>omega lemma YCz (a b d:ػ)(h:YC a b d=0):a˧*2^128+b˧*2^64+d˧=0:=by have:=a܉;have:=b܉;have:=d܉;unfold YC at h;split_ifs at h<;>omega 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 C6 (b:ػ)(a:ؼ)(k g:ػ)(A S:ٴ)(l:ε ζ*ε a≠0->b˧<=γ ζ+γ a/\γ ζ+γ a<=b˧+122)(e: -2^120push_cast<;>ring,(Ar (ω _ (Ϛ a).le) (Ι ד L):_≤2^24*2^23*2^78)⟩ generalize N:(if η a then _ else k+t+(if g+qomega have z:=E9 o r 0 S rfl P c i;generalize (0:ػ)-(o>>>63)=B at z⊢;unfold Yx at z;have C:=L4 B o r S (c.trans' ד) (i.trans ד) (by push_cast at z⊢;clear* -z;have:=B܉;have:=o܉;have:=r܉;omega);simp only[L3,(⟨λ h=>C.symm.trans (YCn _ _ _ h),λ h=>YCz _ _ _ (C.trans h)⟩:B˧*2^128+o˧*2^64+r˧=0↔S=0),ת,C3,L5 _ _ _ _ _ _ _ (R4 b (Ρ (ϐ.mp u) ד)),C] . obtain⟨F,G,H,I,R,-,T⟩:=Zr b ζ a _ _ g 0 (YD · · · · ((b˧:ٴ)-298)) ד (λ h=>(l h).imp_right (Ρ · (ϴ ד _)));rw[R];have:=ZL ζ a b˧ l;apply ZV _ _ _ _ _ S<;>first|(clear* -j e f this;omega)|rw[T,Ϫ,E9 k g 0 A rfl d (e.le.trans' ד) (f.trans ד),<-Ϫ,j] lemma B7 (K:ٳ)(d e:ٳ->δ)(b:ػ)(a:ؼ)(hK:K<=4096)(f:∀t,tθ (d t)≠255)(g:∀t,tθ (e t)≠255)(j:θ a≠255)(k:ε ζ*ε a≠0->b˧<=γ ζ+γ a/\γ ζ+γ a<=b˧+122)(l:∀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 tif tif tif tif tby by_cases h:tsimp[h,f,g,j];decide)];congr 1;rw[ZW,Q6 d e K b˧ oneW a K 0 א (λ t _ r q=>(l t א q).1)];simp only[Β,EN,if_false];rw[ZA oneW a b˧ (λ h=>(k h).1),<-p];ring exact A9 _ _ _ _ _ (λ h=>by rw[o,h];simp[finishWord]) o lemma V9 (K:ٳ)(n o:(t:ؾ)->tػ)(j l:ٳ->δ)(e f:ػ)(v s:ٳ)(w:v+s<=31)(x:s<=6)(hK:K<=256)(D:∀t h,n t h=(YV (j t؛) e)߸)(E:∀t h,o t h=(Y4 (l t؛) f)܅)(y:∀t,tε (j t)=0\/(e˧<=γ (j t)/\γ (j t)-e˧<=v))(z:∀t,tε (l t)=0\/(f˧<=γ (l t)/\γ (l t)-f˧<=s))(B:(e+f)˧=e˧+f˧)(g:ؼ)(F:∀t,tθ (j t)≠255)(G:∀t,tθ (l t)≠255)(C:θ g≠255)(u:ε ζ*ε g≠0->(e+f)˧<=γ ζ+γ g/\γ ζ+γ g<=(e+f)˧+122):(if Y5 K۞ n o (e+f) g 0 0 0<߿then (Y5 K۞ n o (e+f) g 0 0 0)՜else if Yq (λ t=>if tif tif tif t-((k؛:ٴ)*2^55)<=Ye E'->Ye E'<=k؛*2^55->-((k؛:ٴ)*2^55)<=Ye F'->Ye F'<=k؛*2^55->S=Ye E'+2^25*Ye F'+Yr j l (e+f)˧ k؛ d+sv ζ*sv g*2^(γ ζ+γ g-(e+f)˧)->Y5 K۞ n o (e+f) g E' F' k=if S=0 then߿else (ρ S (((e+f)˧:ٴ)-298) false)܅:=by intro d;induction d<;>intro k E' F' S U V W X c G';rw[Y5,dif_neg (by rw[υ,I];omega)];clear* -u G' U V W X c hK;exact C6 _ _ _ _ _ _ u א א (W0 E' F') (by rw[G',Yr];ring) rename_i M;have J:komega exact B7 _ _ _ _ _ א F G C u (λt L T=>by have:=(y t L).resolve_left (DR.1 T).1;have:=(z t L).resolve_left (DR.1 T).2;omega) _ (λS G'=>by apply A K 0 0 0<;>simp[Ye,G']) @[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 A7 (p W:ٴ)(b: -2^21<=p)(d:p<2^21)(a: -2^30nlinarith lemma S4 (x w:ؼ)(a d:ػ)(e f:ٳ)(g:e<=39)(h:f<=6)(k:ε x=0\/(a˧<=γ x/\γ x-a˧<=e))(l:ε w=0\/(d˧<=γ w/\γ w-d˧<=f))(v b:ػ)(j: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)՜܅)=((v˧/2^21%2^21:ٳ):ٴ)∧Ye (((v>>>42)՜܅)-0x200000)=((v˧/2^42:ٳ):ٴ)-2^21:=by unfold Ye;simp only[Τ,AG,AA,BR,Ξ,ψ,show(0x1FFFFF:ػ)˧=2^21-1 from rfl,ϡ,Bc,BY];clear* -D;omega have E:=A7 ((v˧%2^21:ٳ):ٴ) W (by clear*-;omega) (by clear*-;omega) p;have F:=A7 ((v˧/2^21%2^21:ٳ):ٴ) W (by clear*-;omega) (by clear*-;omega) p;have G:=A7 (((v˧/2^42:ٳ):ٴ)-2^21) W (by clear*-;omega) (by clear* -D;omega) p;have B:((v˧%2^21:ٳ):ٴ)+2^21*((v˧/2^21%2^21:ٳ):ٴ)+2^42*(((v˧/2^42:ٳ):ٴ)-2^21)=X:=(by clear* -C D;omega);rw[B5,B5,B5,r,s,t,q];refine⟨by rw[o];linear_combination W*B,?_⟩ all_goals (try simp only[r,s,t,q]);clear* -D p E F G;omega @[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 E5 (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 E4 (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 F3 (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)) b ((a>>>43)+(((0:ػ)-(a>>>63))<<<21)) (a<<<21);have g:DO (2^128) _ _:=S7 b;exact (D8 (((0:ػ)-(b>>>63))+((a>>>43)+(((0:ػ)-(a>>>63))<<<21))+(if b+(a<<<21)>>22)+(((0:ػ)-(d>>>63))<<<42)) (d<<<42)).trans ((f.trans (g.add (E5 a))).add (E4 d)) lemma F0 (K:ٳ)(g n:(t:ؾ)->tػ)(j l:ٳ->δ)(a e:ػ)(s u:ٳ)(w:s<=39)(x:u<=6)(hK:K<4096)(D:∀t h,g t h=YwV (j t؛) a)(E:∀t h,n t h=(Y4 (l t؛) e)܅)(y:∀t,tε (j t)=0\/(a˧<=γ (j t)/\γ (j t)-a˧<=s))(z:∀t,tε (l t)=0\/(e˧<=γ (l t)/\γ (l t)-e˧<=u))(B:(a+e)˧=a˧+e˧)(f:ؼ)(F:∀t,tθ (j t)≠255)(G:∀t,tθ (l t)≠255)(C:θ f≠255)(o:ε ζ*ε f≠0->(a+e)˧<=γ ζ+γ f/\γ ζ+γ f<=(a+e)˧+122):(if Y53 K۞ g n (a+e) f 0 0 0 0<߿then (Y53 K۞ g n (a+e) f 0 0 0 0)՜else if Yq (λ t=>if tif tif tif t-((k؛:ٴ)*2^51)<=Ye E'->Ye E'<=k؛*2^51->-((k؛:ٴ)*2^51)<=Ye F'->Ye F'<=k؛*2^51->-((k؛:ٴ)*2^51)<=Ye G'->Ye G'<=k؛*2^51->S=Ye E'+2^21*Ye F'+2^42*Ye G'+Yr j l (a+e)˧ k؛ d+sv ζ*sv f*2^(γ ζ+γ f-(a+e)˧)->Y53 K۞ g n (a+e) f E' F' G' k=if S=0 then߿else (ρ S (((a+e)˧:ٴ)-298) false)܅:=by intro d;induction d<;>intro k E' F' G' S W X Y Z c h i H;rw[Y53,dif_neg (by rw[υ,J];omega)];clear* -o H W X Y Z c h i hK;exact C6 _ _ _ _ _ _ o א א (F3 E' F' G') (by rw[H,Yr];ring) rename_i N;have L:ktry (clear* -O W X Y Z c h i a1 a2 a3 a4 a5 a6 hK;(try rw[B9])<;>omega) rw[H,B9,B9,B9,Yr,O,B];linear_combination-I;all_goals clear* -O W X Y Z c h i a1 a2 a3 a4 a5 a6 hK;omega exact B7 _ _ _ _ _ א F G C o (λt M V=>by obtain⟨p,q⟩:=DR.1 V;have:=(y t M).resolve_left p;have:=(z t M).resolve_left q;omega) _ (λS H=>by apply A K 0 0 0 0<;>simp[Ye,H]) lemma u1 (n:ؾ)(h:¬n=0):(n-1)؛h (EF.1 e);rw[BN _ _ (Bs.2 ו)];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:0b؛c؛i+n<߿->(YO B C f n۞ a b c l)܍=l܍++(Bd i n).map (λ j=>f (j/(B؛*C؛))۞ (j/C؛%B؛)۞ (j%C؛)۞):=by intro n;induction n with |zero=>intros;unfold YO;simp[<-EF] |succ n q=> intro i a b c _ u s v _;obtain⟨L,o,p⟩:=Q5 a؛ _ _ _ _ s v;rw[u]at L o p;have D:=Ϧ a؛ (ϊ g d);have E:=Ϧ b؛ d;have r:∀x:ؾ,x؛<=i->(x+1)؛=x؛+1:=λ x h=>by rw[Zc _ _ (by have:=τ;rw[Φ];omega),Φ] have w:=r c (u▸Cg _ _);have t:=r b א;have y:=r a א;have z:(0:ؾ)؛=0:=rfl;unfold YO;rw[dif_neg (λ e=>by simpa[e]using Za (n+1) א),show(n+1)۞-1=n۞ by simp];simp only[Ϩ,CR,υ,w,t];split_ifs;rw[q (i+1) _ _ _ _ א s א א];simp[L,o,p];rw[q (i+1) a (b+1) 0 _ (by rw[t,z,Dp];omega) א d א];simp[L,o,p];have F:B؛*C؛=b؛*C؛+c؛+1:=by rw[(א:B؛=b؛+1),Dp];omega rw[q (i+1) (a+1) 0 0 _ (by rw[y,z,Dp];omega) g d א];simp[L,o,p] lemma F6 {α:Type} (B C:ؾ) (f:ؾ -> ؾ -> ؾ -> α) (a:0f (q܂/(B؛*C؛))۞ (q܂/C؛%B؛)۞ (q܂%C؛)۞:=by apply ϻ;rw[V8 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 T0 (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&&&ޅ)&&Yk (bp&&&ޅ)-xm<=YgA w&& (if bv>>>16==511 then xm<=xb else Yk (bv>>>16)<=Yk (bv&&&ޅ)&&YU bv<=6&& Yk (bp&&&ޅ)-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:ؽ δ):ػ:= (DM 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[Do,UInt64.ofNat_toNat];apply σ.1;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 (AY (s.cin*(Yb s*Ya s))) lemma F7 (s:ο)(g:ؽ δ)(c e f:ٳ)(l: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[Ah];omega have E:(c*s.h+(e-s.pad))*s.w+(f-s.pad)<(c+1)*s.h*s.w:=Ag (א:_<(c*s.h+(e-s.pad))*s.w+s.w) (by rw[<-Ah];exact ω _ z);have F:c*s.h<=(c*s.h+(e-s.pad))*s.w:=Cp (ώ _ _) (Ϧ _ א);have M:∀x,x<߿->x%2^System.Platform.numBits=x:=λx h=>ν (Ag 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[EG,Dv,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 B8 (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[F6 _ _ _ (by rw[l];omega) (by rw[n];omega) _ _ e];refine congrArg _ (funext λi=>?_);rw[l,n];exact congrArg (g · b) ((F7 s a _ _ _ (ϕ (i.2.trans_eq (Θ _ _))) (Ε _ 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߾else 0 @[inline] def Ybj (s:ο) (inp:ؽ δ) (P2 PH:ؽ ٳ) (off:ؽ ؼ) (wts:ؽ δ) (W2:ؽ ؼ) (b:ؽ δ) (k:ٳ) (o y x:ؾ) (dw:ف) (pb wa:ؾ) (B0:ػ) (w:ف) (hk:k<ށ) (hoff:offٽ=k) (hH:PHٽ=P2ٽ) (hix:∀t,tpbپ+(off[t]!).toNatwaپ+t(P2.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (A1 _ _ _ (by rw [ox];exact hix _ (uk ht hk)))).toUInt64+(PH.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (A1 _ _ _ (by rw [ox,hH];exact hix _ (uk ht hk)))).toUInt64*0x40000000000) (λ t ht=>(W2.uget (wa+t) (A1 _ _ _ (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) (A1 _ _ _ (by rw [ox];exact hix _ (uk ht hk)))).toUInt64) (λ t ht=>(W2.uget (wa+t) (A1 _ _ _ (hW _ (uk ht hk)))).toUInt64) B0 b[oپ]! 0 0 0 if v<߿then v.toUInt32 else Ybz s inp wts b k o y x dw lemma A2 {α:Type} [Inhabited α] (A:ؽ α) (i:ؾ) (h:i؛ r؛+(e[t]!)؎ v؛+t ∀ t,t l[r؛+(e[t]!)؎]! = YV (Μ s d y x (n+t)) f) (I:w -> ∀ t,t l[r؛+(e[t]!)؎]! = YVa (Μ s d y x (n+t)) f/\u[r؛+(e[t]!)؎]! = YVb (Μ s d y x (n+t)) f) (R:∀ t,t p[v؛+t]! = Y4 a[o*k+t]! (YG (Yc a k o) b[o]! f)) (S:d܃<߿) (g:o*k+k<=a܃/\a܃<߿) (J:ػ) (T:J=f+YG (Yc a k o) b[o]! f) : Ybj s d l u e a p b k z A B C r v J w D P hH E F = Γ (k+1) (λ t=>if tif t(K7 b[o]! _ J h).imp_right (·.trans (Ϯ (ד:79≤122) _)) have q:=Η _ _ (UInt64.le_trans c Y);have B:=Η _ _ Y;simp only[ϐ,q]at c Y U;set V:=YG (Yc a k o) b[o]! f;obtain⟨v,r,P,J,e,O⟩:∃v≤6,(Yk (Yc d d܃ 0&&&ޅ))˧-f˧+v<=(YgB w)˧/\okF a (o*k) k V v/\(∀t,tθ a[o*k+t]! ≠255)/\(f+V)˧=f˧+V˧:=by by_cases z:Yc a k o>>>16=511 . simp only[z,ר,ת]at Z;obtain⟨L,H,K,-,A,B⟩:=Zp a k o g.1 (CI (g.1.trans_lt g.2));obtain⟨m,N⟩:=Zo _ L H K (A.trans_lt ד);rw[z]at m;simp only[←ύ,N]at i;refine⟨0,ד,U.trans O,λ t W=>Ea ?_,λ t W=>(Zb _).2.2.1 ((B t W).2.trans_lt (A.lt_of_ne i)),?_⟩;by_contra P;obtain⟨J,C⟩:=(Zb _).2.2.2 P;exact absurd ((m.trans_le (B t W).1).trans (J.trans (C.trans (max_le ((B t W).2.trans A) ד)))) ד;simp only[V,YG,z,beq_self_eq_true,ר];rw[ξ,Η _ _ Z,Ej (ϐ.mp Z)];exact ν (Az _) . simp only[z,ש,Ω,ת,ϐ,ξ,q]at Z;obtain⟨⟨m,M⟩,J⟩:=Z;obtain⟨K,-,C,e⟩:=M0 a k o g.1 (g.1.trans_lt g.2) i m;simp only[V,YG,beq_iff_eq,z,ש];exact⟨_,M,(ν ((Cy (U.trans N) M).trans_lt ד)).symm.trans_le J,K,e,by rw[ξ];exact ν ((Cy (c.trans P) C).trans_lt ד)⟩ cases w<;>(first|apply V9 k _ _ _ _ _ _ _ _ (P.trans (K rfl).2) r (C.trans_le (K rfl).1).le|apply F0 k _ _ _ _ _ _ _ _ (U.trans N) r (C.trans_le M))<;>first|assumption|intro t W;first|(obtain h|⟨j,A,h⟩:=ZbC s d y x (n+t)<;>rw[h]<;>first|decide|exact Ea rfl|exact m j A|exact(xf j A).imp_right λ h'=>⟨c.trans h'.1,BZ (Nat.le_of_sub_le_sub_right Y (h'.2.trans_eq B)) _⟩)|have X:=uk W D;first|rw[A2 p _ _ _ rfl,Zc _ _ (((F _ X).elim Ϲ).trans_le τ),R _ X]|(rw[A2 l _ _ _ rfl];try rw[A2 u _ _ _ rfl]);rw[Zc _ _ (by rw[ox];exact((E _ X).elim Ϲ).trans_le τ),ox];first|rw[Q rfl _ X]|simp only[I rfl _ X,ZVw] 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 G0 (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پrw[ح A _ h];rfl next h=>rw[getElem!_neg A _ h,a] lemma A0 (a:ؽ δ)(d:ؽ ؼ)(b:ؽ δ)(f:ػ)(k:ٳ)(g:a܃<߿)(e:k<߿):YW2 a d b f k=ڀ (a܃) λ t=>Y4 a[t܂]! (YG d[t܂/k]! b[t܂/k]! f):=by unfold YW2;split;rfl;have h:=Za k e;rw[F6 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:=Dq q܂ k;omega);have n:(q܂%k)۞؛=q܂%k:=Za _ (by have:=DY q܂ k;omega);have o:q܂/k*k+q܂%k=q܂:=϶ q܂ k;have p:((q܂/k)۞*k۞+(q܂%k)۞)؛=q܂:=by rw[EG,Dv,j,h,n,ν (Ag (א:q܂/k*k<߿) τ),ν (Ag (א:q܂/k*k+q܂%k<߿) τ),o] congr 1;exact B4 a _ q܂ p 0 rfl;congr 1<;>exact B4 _ _ (q܂/k) j 0 rfl lemma D9 {α:Type}[Inhabited α](A:ؽ α)(i:ؾ)(h:i؛(rw[Zc _ _ (by (try rw[b]);(try rw[d]);simp;omega)];(try rw[b]);(try rw[d]);simp) lemma Yj9 (j:ؾ)(h:j؛+9<߿):(j+1)؛=j؛+1/\(j+2)؛=j؛+2/\(j+3)؛=j؛+3/\(j+4)؛=j؛+4/\(j+5)؛=j؛+5/\(j+6)؛=j؛+6/\(j+7)؛=j؛+7/\(j+8)؛=j؛+8:=by have a:=τ;refine⟨?_,?_,?_,?_,?_,?_,?_,?_⟩<;>rw[Zc _ _ ו]<;>simp lemma A6 (t n:ؾ)(i:ٳ)(h:t؛=i)(d:itػ)(d:ػ)(e:ؼ)(f g:ػ)(t:ؾ)(h:texact A1 _ _ _ ⟨ו,d⟩ lemma Yu9 (r w:ؾ)(n:ٳ)(h:r؛+2*w؛+2>>39)+(((0:ػ)-(a1>>>63))<<<25)+((0:ػ)-(a0>>>63))+(if lo>>63);if (t0|||t1|||t2)==0 then߿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) def Yqf (s:ο) (relu:ف) (inp wts b:ؽ δ) (k o:ٳ) (P:ؽ ٳ) (W:ؽ ؼ) (HW n:ؾ) (fast neg:ف) (bh bl B0:ػ) (bw:ؼ) (j0:ؾ) (hP:nپ*HWپ<=Pٽ) (hW:j0پ+nپ<=Wٽ) (hS:Pٽ+HWپ+Wٽ<߿) (acc:ؽ δ) (p t i j:ؾ) (hp:p>>1)>>>(63-sh)else m<<<(sh-64)) (if sh<64 then m<<YV w xm)) (YW2 wts BW b xm k) (s.h*s.w).toUSize kٿ xm BW (by rw[Za _ א];exact hz.1) (Za _ hz.2.2.2.2) (by rw[CC,Za _ א];exact hz.2.1) (by rw[A0 _ _ _ _ _ א hz.2.2.2.2,AE];exact hz.2.2.1) (by rw[CC,Za _ א,A0 _ _ _ _ _ א hz.2.2.2.2,AE];exact hz.2.2.2.1) 0 (AY (C*(s.h*s.w))) lemma S8 (d:ف)(s:ο)(a b:ؽ δ)(k C:ٳ)(g:ف)(h:k=if d then s.kh*s.kw else s.cin*s.kh*s.kw)(e:(s.kh==1&&s.kw==1&&s.pad==0&&s܊==1&&!d&&g&&decide (s.cin*(s.h*s.w)<=a܃))=true)(f:0cpb0؛+T[p]!+c*hw؛+2*wp؛+2j0؛+9*c+9<=W܃) (hT:n؛<=T܃) (hS:P܃+hw؛+W܃<߿) (acc:ؽ δ) (p c r j:ؾ) (hp:ppc(if dw then o*hw؛else 0)+T[p]!+c*hw؛+2*wp؛+2co*k+9*c+9<=W܃) (hT:n؛<=T܃) (hS:P܃+hw؛+W܃<߿) (o:ٳ) (acc:ؽ δ):ؽ δ:= if ho:o>>1)>>>(63-sh)else m<<<(sh-64)) (if sh< 64 then m<<by rw[e0];exact hB o p c ho hp hc) (λ c hc=>by rw[e1];exact hW o c ho hc) hT hS acc 0 0 ((if dw then o۞*hw else 0)+(T.uget 0 (by simp;omega))۞) (o*k)۞ (υ.mpr (by simpa using h0)) (by have:=hB o 0 0 ho h0 hn;have z:(0:ؾ)؛=0:=rfl;simp only [ϸ,ϑ]at this;rw[Zc _ _ (by rw[D9,z,Za _ א,e0];have:=τ;omega),D9,z,Za _ א,e0];simp) ג 0 0) else acc termination_by C-o @[inline] def Ytb (s:ο):ؽ ٳ:=YO s.ho۞ s.wo۞ (λ _ y x=>y؛*s.stride*Ya s+x؛*s.stride) (s.ho*s.wo)۞ 0 0 0 (AY (s.ho*s.wo)) lemma YtbE (s:ο) (h:s.ho*s.wo<߿):(Ytb s)܃=s.ho*s.wo/\∀ p,p (Ytb s)[p]! = p/s.wo*s.stride*Ya s+p%s.wo*s.stride:=by have b:=ZG s;have a:s.ho<߿:=(Ϧ _ b.2).trans_lt h;have d:s.wo<߿:=(ϳ _ b.1).trans_lt h;unfold Ytb;rw[F6 _ _ _ (by rw[Za _ a];exact b.1) (by rw[Za _ d];exact b.2) _ _ h];refine⟨AE,λ p e=>?_⟩;have y:p/s.wo(q/s.wo۞؛%s.ho۞؛)۞؛*s.stride*Ya s+(q%s.wo۞؛)۞؛*s.stride) _ e];simp only[Za _ a,Za _ d,ν y];rw[Za _ א,Za _ ((Ε p b.2).trans d)] @[noinline] def Yt3w (s:ο) (relu:ف) (inp wts b:ؽ δ) (k C:ٳ) (dw:ف) (P:ؽ ٳ) (W:ؽ ؼ) (xm:ػ) (BW:ؽ ؼ) (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) (e1:s.kh=3) (e2:s.kw=3) (g1:s.kh<=Yb s) (g2:s.kw<=Ya s) (g4:9<=k) (g8:k<256) (g5:C*k<=W܃) (g6:P܃=s.cin*(Yb s*Ya s)) (g7:P܃+Yb s*Ya s+W܃+C*(s.ho*s.wo)+s.ho*s.wo+s.stride<=ހ):ؽ δ:= have hz:=ZG s have a:=E3 s C (ϊ א א) have hT:=YtbE s א Yt3c s relu inp wts b k C dw P (Ytb s) W (Yb s*Ya s)۞ (Ya s)۞ (k/9)۞ (s.ho*s.wo)۞ xm BW (by rw[Za _ א];omega) (by rw[Za _ א];exact ϊ hz.1 hz.2) א (λ o p c ho hp hc=>by rw[Za _ א]at hp;rw[Za _ א]at hc;rw[Za _ א,Za _ א,hT.2 p hp] have y:p/s.woby rw[Za _ א]at hc;have:=ω k (show o+1<=C by omega);rw[ϟ,Ϙ]at this;omega) (by rw[hT.1,Za _ א]) (by rw[Za _ א];omega) 0 (AY (C*(s.ho*s.wo))) @[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:=(DM 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 if hq:(s.kh==1&&s.kw==1&&s.pad==0&&s.stride==1&&!dw&&g&&decide (s.cin*(s.h*s.w)<=inpٽ))=true then Ypw s relu inp wts b k C xm BW (S8 dw s inp wts k C g hk hq hg.2.2.1 hg.2.2.2.1 hg.2.2.2.2.1 hg.2.2.2.2.2.1) else if h3:(g&&s.kh==3&&s.kw==3&&decide (9<=k)&&decide (k<256))=true then have e:(((g=true/\s.kh=3)/\s.kw=3)/\9<=k)/\k<256:=by simpa only [Ω,beq_iff_eq,ת] using h3 have q:=hg.2.2.2.2.2.1 have c:=hg.2.2.2.2.1 have qa:=A0 wts BW b xm k (by clear * - q;omega) (by have:=e.2;clear * - this;omega) have qb:=B8 s inp xm YV hg.2.2.1 (by clear * - q;omega) (by clear * - q;omega) Yt3w s relu inp wts b k C dw (Ybi s inp xm YV) (YW2 wts BW b xm k) xm BW hk hC e.1.1.1.2 e.1.1.2 hg.1 hg.2.1 e.1.2 e.2 (by rw[qa,AE];exact c) (by rw[qb,AE]) (by rw[qb,qa,AE,AE];clear * - q;omega) else 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 [B8 s inp xm _ hg.2.2.1 א א,AE] have hH:PHٽ=P2ٽ:=by simp only [PH];split;rfl;rw [hP2,B8 s inp xm _ hg.2.2.1 א א,AE] have a:=E3 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,-⟩:=G0 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 [K0 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 [ϟ,Ϙ] at this rw [um _ _ (by rw [Za _ א];omega),Za _ א] simp only [W2,A0 wts BW b xm k א א,AE];omega)) else 0) (C*(s.ho*s.wo)).toUSize 0 0 0 (AY (C*(s.ho*s.wo))) else (if dw then depthwiseSpec else conv2dSpec) s relu inp wts b lemma K9 (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 I4 (b:ػ) (a:ؼ) (d e:ػ) : Yq5 ((Yf a==0||Yd a+126-b<=78)&&b<=1000) (η a) (if Yd a+126-b<64 then ((Yf a<<<23)>>>1)>>>(63-(Yd a+126-b)) else (Yf a<<<23)<<<(Yd a+126-b-64)) (if Yd a+126-b<64 then (Yf a<<<23)<<<(Yd a+126-b) else 0) b a d e=Y5g b a d e:=by unfold Yq5 Y5g Y5t;rfl lemma H9 (n:ؾ) (a b:(t:ؾ) -> t ػ) (d:ػ) (e:ؼ) (f g:ػ) (t:ؾ) (h:t t ػ) (a:ػ) (b:ؼ) (d e:ػ) (t:ؾ) (h:¬tact l ( let v:=Y5 n (λ t _=>(P[(p؛+q܂)+t؛*a؛]!)߸) (λ t _=>(W[A؛+t؛]!)܅) u w (if q܂=0 then f else 0) (if q܂=0 then g else 0) (if q܂=0 then t else 0) if v<߿then v՜else if zW s x y b k o 0 ((p؛+q܂)/s.w) ((p؛+q܂)%s.w) 0 (k+1)then߾else 0)):=by induction X:a؛-p؛generalizing d p t i j f g with |zero=>exact absurd (υ.mp B) (DZ.2 (De.1 X)) |succ m N=> induction Y:n؛-t؛generalizing d t i j f g with |zero=> have O:¬t have h:tٳ->α)(o M a:ٳ)(b:0H o q܂)++DP (n:=M*a) (λ q=>H (o+1+q܂/a) (q܂%a))=DP (n:=(M+1)*a) (λ q=>H (o+q܂/a) (q܂%a)):=by apply ϩ (by simp only[List.length_append,AM,Ah];omega);intro d g h;rw[List.getElem_append];simp only[AM,AN];split;rename_i e;rw[Υ e,ν e,ϑ];obtain⟨r,rfl⟩:∃r,d=r+a:=⟨d-a,א⟩;rw[Cz,Em _ b,Nat.add_mod_right];congr 1;omega lemma I3 (s:ο)(a:ف)(g h b:ؽ δ)(k C:ٳ)(P:ؽ ٳ)(W:ؽ ؼ)(f n:ؾ) (j:ػ)(l:ؽ ؼ)(p:0ٳ->δ) (hH:∀y z,H y z=act a ( let v:=Y5 n (λ t _=>(P[z+t؛*f؛]!)߸) (λ t _=>(W[y*k+t؛]!)܅) (j+YG l[y]! b[y]! j) b[y]! 0 0 0 if v<߿then v՜else if zW s g h b k y 0 (z/s.w) (z%s.w) 0 (k+1)then߾else 0)) (o:ٳ)(d:ؽ δ): (Yqc s a g h b k C P W f n j l p r u w x o d)܍= d܍++DP (n:=(C-o)*f؛) (λ q=>H (o+q܂/f؛) (q܂%f؛)):=by fun_induction Yqc s a g h b k C P W f n j l p r u w x o d with |case1 o d E B B0 F m D acc' G=> have A:D؛=o*k:=by simp only[D];have e:=ω k (א:o+1<=C);rw[ϟ,Ϙ]at e;exact Za _ א rw[G];simp only[acc'];rw[I0,CL];congr 1;rw[(א:C-o=(C-(o+1))+1),<-Yl3 H o (C-(o+1)) f؛ p];congr 2;funext q;rw[hH];simp only[USize.toNat_zero,Β,ite_self,A,B,B0];intro I J;simp only[F,m,dite_eq_ite];exact I4 B0 B I J |case2 o d E=>rw[(א:C-o=0),ϸ];simp lemma Yw1 (s:ο)(a:ؽ δ)(y x t:ٳ)(b:s.kh=1)(d:s.kw=1)(e:s.pad=0)(f:s܊=1)(g:yٳ)(i:ٳ)(h:i< a܃):(a.map f)[i]! =f a[i]!:=by rw[ح (a.map f) i (by simpa using h),ح a i h,CN] lemma S9 (s:ο)(f:ف)(a d b:ؽ δ)(k C:ٳ)(j:ؽ ؼ)(g:ػ)(x:k=s.cin*s.kh*s.kw)(y:C=s.cout)(p:s.kh=1)(q:s.kw=1)(n:s.pad=0)(r:s܊=1)(D:0Yc d k o܂)(A:g=Ybh (Yc a a܃ 0) j b)(B:(DM C).all (λ o=>Ybg j[o]! b[o]! (Yc a a܃ 0) k g false)=true)(u:0((a.map (YV · g))[G+t؛*(s.h*s.w)۞؛]!)߸) (λ t _=>((YW2 d j b g k)[R*k+t؛]!)܅) (g+YG j[R]! b[R]! g) b[R]! 0 0 0;if v<߿ then v՜ else if zW s a d b k R 0 (G/s.w) (G%s.w) 0 (k+1) then ߾ else 0):=⟨_,λ _ _=>rfl⟩ rw[I3 (hH:=w),show(AY (C*(s.h*s.w)):ؽ δ)܍=[] from rfl,EB,Array.toList_ofFn];generalize S:a.map (YV · g)=P,T:YW2 d j b g k=W2 at w;apply ϩ (by simp only[AM,L,O,Q,Ai]);intro I i1 i2;simp only[AN,Fin.coe_cast,L,Β];rw[O,Q];have hI:ICp (Dp t _▸ω _ J) Ka let K:=ڀ k λ t=>(Ys s t܂).toUInt32;have m:∀ tby have:=i t J;rw[ZD s _ t J (by rw[R3 s t p q n];clear* -this Sz;omega),R3 s t p q n] have V:=Za o (by have:=Dq I (s.h*s.w);rw[O,Q]at z;clear* -this hoi hI z;omega);have W:=Za (G/s.w) (by have:=Dq G s.w;clear* -this U Sz;omega);have X:=Za (G%s.w) (by have:=DY G s.w;clear* -this U Sz;omega);clear z hoi hpi hI i1 i2 I M hw L O Q;refine Eq.trans ?_ (L0 s a P P K d W2 b k _ _ _ false _ 0 _ _ V W X rfl G۞ (o*k)۞ g _ א AE rfl (λ t J=>by have:=i t J;rw[←S,CC,c,m t J];clear* -this U Sz;omega) (λ t J=>by rw[←T,A0 _ _ _ _ _ א N,AE,Z];clear* -J this F Sz;omega) (by have:=Ep.mp B o ו;simpa[l,gO C (Yc d k) _ Y] using this) (λ _ t J=>by have:=i t J;rw[c,m t J,←S,Ym1 _ _ _ א,Β,Yw1 s a _ _ t p q n r hy hx];congr 2;rw[϶ G s.w];omega) (absurd · AC) (λ t J=>by rw[Z,←T,A0 _ _ _ _ _ א N,gO _ (λ t=>Y4 d[t]! (YG j[t/k]! b[t/k]! g)) _ א,l,show(o*k+t)/k=o by rw[Ϟ,ϔ _ _ א,Υ J,Β],gO C (Yc d k) _ Y]) א ⟨Cp this F,א⟩ (g+YG j[o]! b[o]! g) (by rw[l,gO C (Yc d k) _ Y])) unfold Ybj Ybz;simp only[φ,↓reduceIte,V,W,X];symm;rw[congrArg₂ (Y5 k۞) (funext₂ λ t h=>?_:_=λ t _=>(P[G+t؛*(s.h*s.w)]!)߸) (funext₂ λ t h=>?_:_=λ t _=>(W2[o*k+t؛]!)܅)]<;>have J:=uk h א<;>have u:=τ ·have e:=i _ J;rw[A2 _ _ _ (G+t؛*(s.h*s.w)) (by rw[Zc _ _ (by rw[c,ox,m _ J];clear* -e U Sz u;omega),c,ox,m _ J])] rw[A2 _ _ _ (o*k+t؛) (by rw[Zc _ _ (by rw[Z];clear* -J this F Sz u;omega),Z])] lemma Yt3fL {s relu J L b k o cw}(P T:ؽ ٳ)(W:ؽ ؼ)(l g d n f u:ؾ){fast neg bh bl B0 E hn hB hW hT hS} (w:∀A B,Yq5 fast neg bh bl B0 E A B=Y5g B0 E A B)(K:ؾ)(y:K؛=9*d؛) (F:ٳ->(t:ؾ)->tػ)(G:(t:ؾ)->tػ) (a:∀p c i t h,i<9->t؛=9*c+i->F p t h=(P[f؛+T[p]!+c*l؛+i/3*g؛+i%3]!)߸) (x:∀t h,G t h=(W[u؛+t؛]!)܅): ∀z p (c:ؾ) r j (t:ؾ) M U V A B,t؛=9*c؛-> (Yt3f s relu J L b k o cw P T W l g d n fast neg bh bl B0 E f u hn hB hW hT hS z p c r j M U V A B).toList= z.toList++DP (n:=n؛-p؛) (λ q=>act relu ( let v:=Y5 K (F (p؛+q܂)) G B0 E (if q܂=0 then A else 0) (if q܂=0 then B else 0) (if q܂=0 then t else 0) if v<߿then v.toUInt32 else if zW s J L b k o cw ((p؛+q܂)/s.wo) ((p؛+q܂)%s.wo) 0 (k+1)then߾else 0)):=by intro z p c r j t M U V A B ht;induction hM:n؛-p؛generalizing z p c r j t A B with |zero=>cases Nat.sub_ne_zero_of_lt (υ.1 M) hM |succ m X=> have hu:=υ.1 M;have C:=(A6 p n _ rfl hu _ rfl).1;have e:n؛-(p+1)؛=m:=by rw[C,Nat.sub_succ,hM];rfl induction hN:d؛-c؛generalizing z c r j t A B with |zero=> have hd:=Dw hN;have N:¬tsimp only[List.getElem_cons_succ,AN,Nat.add_one_ne_zero,ש,ite_self,C,BU,Ϟ 1 m] next H=>obtain rfl:m=0:=e.symm.trans (Nat.sub_eq_zero_of_le (DZ.1 (mt υ.2 H)));rw[Eo];congr 1;apply ϩ ג;intro D I O;cases Nat.lt_one_iff.1 I;simp only[Dh,AN,w,C1 _ _ _ B0 E A B t N,ר,ϑ] |succ m2 Z=> have Q:=Al hN;have hK:9*(c؛+1)<=K؛:=y▸Ci 9 Q;have c1:=(A6 c d _ rfl Q _ rfl).1;have L:=λ i (t:ؾ) (h:t؛=9*c؛+i) (e:i<9)=>A6 t K _ h (Ag (ϴ e _) hK) _ rfl;obtain⟨I,h0⟩:=L 0 t ht ד;obtain⟨O,S⟩:=L 1 _ I ד;obtain⟨e3,H⟩:=L 2 _ O ד;obtain⟨e4,h3⟩:=L 3 _ e3 ד;obtain⟨e5,h4⟩:=L 4 _ e4 ד;obtain⟨e6,h5⟩:=L 5 _ e5 ד;obtain⟨e7,h6⟩:=L 6 _ e6 ד;obtain⟨e8,h7⟩:=L 7 _ e7 ד;obtain⟨e9,h8⟩:=L 8 _ e8 ד;rw[Yt3f,dif_pos (υ.2 Q)];dsimp only;rw[Z _ _ _ _ (t+1+1+1+1+1+1+1+1+1) _ _ _ _ (c1▸e9) (by rw[c1,Nat.sub_succ,hN];rfl)];congr 2;funext q;by_cases R:(q:ٳ)=0 . simp only[R,ר,A5,h0,S,H,h3,h4,h5,h6,h7,h8,Yq9 r g (U▸Ϲ (hB _ _ hu Q) (Ρ (ώ _ _) (Ρ (ώ _ _) hS))),Yj9 j (V▸Ρ (hW _ Q) (Ρ (Cg _ _) hS)),a _ _ 0 _ _ ד ht,a _ _ 1 _ _ ד I,a _ _ 2 _ _ ד O,a _ _ 3 _ _ ד e3,a _ _ 4 _ _ ד e4,a _ _ 5 _ _ ד e5,a _ _ 6 _ _ ד e6,a _ _ 7 _ _ ד e7,a _ _ 8 _ _ ד e8,D9,x,ht,I,O,e3,e4,e5,e6,e7,e8,U,V,Nat.reduceDiv,BY,ϸ,Ϙ,ϑ,BU] . simp only[R,ש] lemma Yt3cL {s relu r u b k C} (d:ف) (P T:ؽ ٳ) (W:ؽ ؼ) (a e f n:ؾ) {x BW y z E B D F G} (K:ؾ) (g:K؛=9*f؛) (H:ٳ -> ٳ -> δ) (hH:∀ l w,H l w=act relu ( let v:=Y5 K (λ t _=>(P[(if d then l*a؛ else 0)+T[w]!+(t؛/9*a؛+t؛/3%3*e؛+t؛%3)]!)߸) (λ t _=>(W[l*k+t؛]!)܅) (x+YG BW[l]! b[l]! x) b[l]! 0 0 0 if v < ߿ then v.toUInt32 else if zW s r u b k l (if d then l*k else 0) (w/s.wo) (w%s.wo) 0 (k+1) then ߾ else 0)) : ∀ m o (j:ؽ δ),C-o=m -> (Yt3c s relu r u b k C d P T W a e f n x BW y z E B D F G o j).toList = j.toList ++ DP (n:=(C-o)*n؛) (λ q=>H (o+q܂/n؛) (q܂%n؛)):=by intro m;induction m with |zero=>intro o j h;rw[Yt3c,dif_neg (Nat.sub_ne_zero_of_lt · h),h,ϸ];simp |succ m I=> intro o j h;have A:=Al h;have oo:=A.trans E;have S:C-(o+1)=m:=by rw[Nat.sub_succ,h];rfl have J:(if d then o۞*a else 0)؛=(if d then o*a؛else 0):=by cases d;rfl;have:=B o 0 0 A z y;simp only[if_true]at this⊢;rw[um _ _ (by rw[Za _ oo];clear*-this G;omega),Za _ oo] have L:(o*k)۞؛=o*k:=Za _ (by have:=D o 0 A y;clear*-this G;omega);rw[Yt3c,dif_pos A];dsimp only;rw[I _ _ S,Yt3fL P T W a e f n _ _ (I4 _ _) K g (λ O t _=>(P[(if d then o*a؛else 0)+T[O]!+(t؛/9*a؛+t؛/3%3*e؛+t؛%3)]!)߸) (λ t _=>(W[o*k+t؛]!)܅) (λ p c i t _ R Q=>by rw[J,Q,Cf ד,Υ R,ϑ,ϣ 3 3 c,Cf ד,Ce,Ce,ν (ϕ R)];congr 2;ac_rfl) (λ t _=>by rw[L]) _ _ _ _ _ 0 _ _ _ _ _ ג];rw[CL];congr 1;rw[h,←S,←Yl3 H o (C-(o+1)) n؛ z,USize.toNat_zero,Ai];congr 2;funext q;rw[hH];simp only[Β,ite_self] lemma ZtW (j:ف)(s:ο)(l:ف)(f g b:ؽ δ)(k C:ٳ) (p:k=if j then s.kh*s.kw else s.cin*s.kh*s.kw)(q:C=if j then s.cin else s.cout)(r:s.kh=3)(u:s.kw=3) (w:s.kh<=Yb s)(x:s.kw<=Ya s)(z:9<=k)(A:k<256)(B:C*k<=g܃) (D:s.cin*(Yb s*Ya s)+Yb s*Ya s+f܃+g܃+C*(s.ho*s.wo)+s.ho*s.wo+s.stride<=ހ) (y:(DM C).all (λ o=>Ybg (AF (n:=C) λ o=>Yc g k o܂)[o]! b[o]! (Yc f f܃ 0) k (Ybh (Yc f f܃ 0) (AF (n:=C) λ o=>Yc g k o܂) b) false)=true)(W X Y): Yt3w s l f g b k C j (Ybi s f (Ybh (Yc f f܃ 0) (AF (n:=C) λ o=>Yc g k o܂) b) YV) (YW2 g (AF (n:=C) λ o=>Yc g k o܂) b (Ybh (Yc f f܃ 0) (AF (n:=C) λ o=>Yc g k o܂) b) k) (Ybh (Yc f f܃ 0) (AF (n:=C) λ o=>Yc g k o܂) b) (AF (n:=C) λ o=>Yc g k o܂) p q r u w x z A W X Y =(if j then depthwiseSpec else conv2dSpec) s l f g b:=by generalize K:(AF (n:=C) λ o=>Yc g k o܂)=BW at y W X Y⊢;generalize Ybh (Yc f f܃ 0) BW b=E at y W X Y⊢;have Z:=ZG s;obtain⟨d1,d2,d3,d4,d6⟩:=(by clear* -;intros;omega:∀{a b c d e f g:ٳ},a+b+c+d+e+f+g<=ހ->a<߿/\b<߿/\c<߿/\d<߿/\f<߿) D;have kN:k<߿:=A.trans ד;have kS:k<ށ:=A.trans ד;have kp:0omega) _ (λ _ _=>rfl) _ 0 _ (Ai C), Array.mkEmpty_eq,Array.toList_empty,EB,Array.toList_ofFn];apply ϩ (by simp only[AM,Za _ d6,Ai]);intro G i1 i2;simp only[AN,Fin.coe_cast,Za _ d6,Β];rw[AM,Ai,Za _ d6,Θ]at i1;have S:=ϕ i1;have Q:=Ε G (ϊ Z.1 Z.2);rewrite[←Cw G s.wo s.ho,Θ s.wo s.ho,←Nat.mod_mul_left_mod G s.ho s.wo];generalize G/(s.ho*s.wo)=o at S⊢;generalize G%(s.ho*s.wo)=F at Q⊢;have hy:=ϕ (Q.trans_eq (Θ _ _));have hx:=Ε F Z.2;refine congrArg (act l) ?_;have hoK:=((Dp o k).ge.trans (ω k S)).trans B;have oK:=Ρ ((ώ _ _).trans hoK) d4;have T:=Za _ oK;have hd:j=true->oby subst d q;simpa using S generalize R:(if j then o*(Yb s*Ya s)else 0)+(F/s.wo*s.stride*Ya s+F%s.wo*s.stride)=P;have L:=λ t (I:tR▸(G0 j s f k o _ _ t p w x hd hy hx I).1;have U:=Za _ (Ρ (ώ _ _) ((L 0 kp).trans d1));have V:=λ t (I:tZD s k t I (Ρ (Cg _ _) ((L t I).trans d1));have gS:=gO C (λ o=>Yc g k o) _ S;have b8:=B8 s f E YV g3 d1 d2;have oN:=Za _ (Ρ (Ϧ o kp) oK);have yN:=Za _ (Ϲ hy (Ρ (Ϧ _ Z.2) d6));have xN:=Za _ (Ϲ hx (Ρ (ϳ _ Z.1) d6)) refine Eq.trans ?_ (L0 s f (Ybi s f E YV) _ (ڀ k λ t=>(Ys s t܂).toUInt32) g (YW2 g BW b E k) b k _ _ _ j _ _ _ _ oN yN xN rfl P۞ (o*k)۞ E false kS AE rfl (λ t I=>by rw[U,V t I,b8,AE];exact⟨L t I,d1⟩) (λ t I=>by rw[A0 _ _ _ _ _ d4 kN,AE,T];exact⟨Ag (ϴ I _) hoK,d4⟩) (by have:=Ep.1 y o (by simpa using S);simpa[←K,gS]using this) (λ _ t I=>by rw[U,V t I,b8,gO _ (λ i=>YV (YI s f i) E) _ (L t I),←R,(G0 j s f k o _ _ t p w x hd hy hx I).2]) nofun (λ t I=>by rw[T,A0 _ _ _ _ _ d4 kN,gO _ (λ t=>Y4 g[t]! (YG BW[t/k]! b[t/k]! E)) _ (Ag (ϴ I _) hoK),←K,(by rw[Ϟ,ϔ _ _ kp,Υ I,Β]:(o*k+t)/k=o),gS]) d3 ⟨hoK,d4⟩ (E+YG BW[o]! b[o]! E) (by rw[←K,gS]));unfold Ybj Ybz;simp only[oN,yN,xN,φ,↓reduceIte];symm;rw[congrArg₂ (Y5 k۞) (funext₂ λ t h=>?_) (funext₂ λ t h=>?_)]<;>have I:=uk h kS · exact congrArg _ (A2 _ _ _ _ (by rw[Zc _ _ (by rw[U,ox,V _ I];exact Ag ((L _ I).trans d1) τ),U,ox,V _ I,YsT s r u,Za _ d2,Za _ (Ρ (E3 s C g3).2.2.2 d2),(YtbE s d6).2 F Q,←R])) rw[A2 _ _ _ _ (by rw[Zc _ _ (by rw[T];exact Ag ((Ag (ϴ I _) hoK).trans d4) τ),T])] lemma G1 (n:ف) (s:ο) (l:ف) (h j b:ؽ δ) (k C:ٳ) (p:k=if n then s.kh*s.kw else s.cin*s.kh*s.kw) (r:C=if n then s.cin else s.cout) : cdQ n s l h j b k C p r=(if n then depthwiseSpec else conv2dSpec) s l h j b:=by unfold cdQ;dsimp only;split rename_i A;split;rename_i B;simp only[Ω,beq_iff_eq,ת,ϵ]at B;obtain⟨⟨⟨⟨⟨⟨u,w⟩,x⟩,e4⟩,rfl⟩,eg⟩,-⟩:=B;exact S9 s l h j b k C _ _ (by simpa using p) (by simpa using r) u w x e4 A.2.2.1 A.2.2.2.1 A.2.2.2.2.1 A.2.2.2.2.2.1 rfl rfl eg _ split;rename_i B;exact ZtW n s l h j b k C p r _ _ _ _ _ _ A.2.2.2.2.1 A.2.2.2.2.2.1 (by simp only[Ω]at B;exact B.1.1.1.1) _ _ _ obtain⟨Q,R,y,H,S,T,U⟩:=A;obtain⟨V,W,X,-⟩:=E3 s C y;obtain⟨E,I,b2,J,Y,Z,b6⟩:=(by clear* -;intros;omega:∀{a b c d e f g},a+b+c+d+e+f+g<=ހ->a<߿/\b<߿/\c<߿/\d<߿/\e<߿/\f<߿/\b+g<߿) T;have c0:=Ρ V Z;have c1:=Ρ W Z;have c2:=Ρ X Y;have K:=Za _ c0;have M:=Za _ c1;rw[F6 _ _ _ (K.symm▸(ZG s).1) (M.symm▸(ZG s).2) _ _ Y,K9 n s l h j b k C p r];congr 1;funext q;obtain⟨N,O,v⟩:=Zt _ _ _ _ q.isLt;have u:=Za _ (Ϲ v c2);have w:=Za _ (Ϲ N c0);have x:=Za _ (Ϲ O c1);have ek:=Za _ (Ϲ H ד);have g:=gO C (λ o=>Yc j k o) _ v;have P:q܂/(s.ho*s.wo)*k+k<=j܃:=by have:=ω k v;rw[Dp]at this;exact Cp this S simp only[K,M];rw[dif_pos ⟨by rwa[υ,u,Za _ c2],by rwa[υ,w,K],by rwa[υ,x,M]⟩];apply congrArg;refine L0 s h _ _ _ j _ b _ _ _ _ _ _ _ _ _ u w x rfl _ _ (Ybh (Yc h h܃ 0) (ڀ C λ o=>Yc j k o܂) b) _ _ _ _ _ _ ?_ ?_ ?_ ?_ b2 ⟨P,J⟩ _ ?_;have:=Ep.mp U (q܂/(s.ho*s.wo)) (by simpa using v);simpa[g]using this all_goals try (intro G t z;obtain⟨F,w2⟩:=G0 n s h k (q܂/(s.ho*s.wo)) _ _ t p Q R (by intro d;subst d r;simpa using v) N O z;rw[K0 n s _ _ _ y b6 (by rw[u,w,x];exact Ρ (ώ _ _) (Ϲ F E)),u,w,x,ZD s _ t z (Ρ (Cg _ _) (Ϲ F E))]) simp only[Bool.not_eq_false']at G;rw[G,if_pos rfl,B8 s h _ _ y E I,gO _ (λ i=>YV (YI s h i) _) _ F,w2];simp only[ϵ]at G;rw[G,if_neg AC,if_neg AC,B8 s h _ _ y E I,B8 s h _ _ y E I,gO _ (λ i=>YVa (YI s h i) _) _ F,gO _ (λ i=>YVb (YI s h i) _) _ F,w2];exact⟨rfl,rfl⟩;intro t z;rw[um _ _ (by rw[u,ek];exact Ρ (Cp (ώ _ _) P) J),u,ek,A0 _ _ _ _ _ J (Ϲ H ד),gO _ (λ t=>Y4 j[t]! (YG (ڀ C λ o=>Yc j k o܂)[t/k]! b[t/k]! _)) _ (Ag (ϴ z _) P),show(q܂/(s.ho*s.wo)*k+t)/k=q܂/(s.ho*s.wo) by rw[Ϟ,ϔ _ _ (Ρ (Ey _) z),Υ z,Β],g];rw[A2 _ _ _ _ u,gO C (λ o=>_+YG (ڀ C λ o=>Yc j k o܂)[o]! b[o]! _) _ v,g];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 V6:Ybp=conv2dSpec:=by funext s r i w b;exact G1 false s r i w b _ _ rfl rfl lemma V5:dwQ=depthwiseSpec:=by funext s r i w b;exact G1 true s r i w b _ _ rfl rfl 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 V3:Ybl=maxpoolSpec:=by rw[<-P8];funext c h w k a;unfold Ybl;split;subst_vars;rw[ZB _ _ (c*(h/2*(w/2))) (ϣ _ _ _)];unfold Yad;apply congrArg;funext q;simp only[(λ v=>by rw[ϧ,Θ]:∀v:ٳ,v/(w/2)/(h/2)=v/(h/2*(w/2))),show ϒ (2*2)=[0,1,2,3]from rfl,AO,List.foldl_nil];rfl @[noinline] def YaYs (x y z:δ):δ:=YaY x y z lemma Gd (a b:ؼ):((a^^^b)>>>31 !=0)=Ζ (η a) (η b):=by rw[AB,bne_iff_ne,ne_eq,<-ύ,<-AG,D4];cases Ζ (η a) (η b)<;>decide @[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)>>>31 !=0;let tp:=mp<<>>47)+dp;let Lq:=(23:ػ)+dq;let M:=if Lt<=Lq then Lq else Lt;Ge ((if neg then 0-tp else tp)+(if η z then 0-tq else tq)) (M+(1:ػ)-(((x^^^y)^^^z)>>>31)܅) (λ _=>((kپ:ٴ)-298)) (neg&&η z) true (k-298) else YaYs x y z else YaYs x y z lemma R2 (P K:ػ):(if K<=P then P-K else 0)˧=P˧-K˧:=by split;next h=>rw[Η _ _ h] next h=>rw[ϐ]at h;simp;omega lemma H5 (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 e:θ x=255;rw[if_neg (by simp[e])];rfl;rw[if_pos (by simpa using e)];have f:=B6 x y;have:=Zg x;have:=Zg y;have:=Zg z;have g:(Yd z+149)˧=γ z+149:=by rw[ξ,Zf];simp;omega dsimp only;generalize Yd x+Yd y=P,Yd z+149=Q at f g⊢;generalize c:(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 h:K˧=Y1 (Yl x*Yl y) (Yl z) (γ x+γ y) (γ z+149):=by rw[<-c,<-f,<-g];unfold Y1;simp only[beq_iff_eq,ϐ];split_ifs<;>omega have p:K˧<=508:=by rw[h];unfold Y1;split_ifs<;>omega generalize j:(if K<=P then P-K else 0)=D,k:(if K<=Q then Q-K else 0)=E;have m:=j▸R2 P K;have l:=k▸R2 Q K;by_cases d:(D<=14&&E<=38)=true;rw[if_pos d];simp only[Ω,ת]at d;have q:D˧<=14:=d.1;have r:E˧<=38:=d.2;unfold YaY;simp only[e,a,b,or_self,ש];rw[<-h,<-f,<-g,if_pos (א:P˧-K˧<=14∧Q˧-K˧<=38)];rw[(σ.1 (by simp[m];omega):(P˧-K˧)߸=D),(σ.1 (by simp[l];omega):(Q˧-K˧)߸=E),H1,Gd x y,Gc,C4,L6 _ _ _ _ _ (R4 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܍++(Bd j؛ (n؛-j؛)).map (λ i=>act a (YaY x[i]! y z)):=by intro m;induction m<;>intro j f h<;>unfold Ysj;rw[dif_neg (υ.not.2 א)];simp[h];rename_i g;have k:jact relu (YaY x[ch*hw+j]! s[ch]! t[ch]!)) ch 0 acc) else acc termination_by c-ch lemma H6 (b:ف)(c a:ٳ)(x s t:ؽ δ)(e:c*a<=x܃)(d:c*a<=ހ):∀m f (k:ؽ δ),c-f=m->Ysk b c a x s t e d f k=Yak c a (λ f j=>act b (YaY x[f*a+j]! s[f]! t[f]!)) f k:=by intro m;induction m<;>intro f k h<;>unfold Ysk Yak;rw[dif_neg א,if_neg א];rename_i l;have q:frw[H6 relu c a x s t h.1 h.2 _ 0 _ rfl];rfl rfl lemma Qsx (q:ػ):((((0:ػ)-(q>>>63))˧*2^64+q˧:ٳ):ٴ)%2^128=Ye q%2^128:=S7 q lemma QZb (w:ؼ):((w>>>31)܅)˧=if η w then 1 else 0:=by have h:=D4 w 0;rwa[EE,show η 0=false from rfl,EM]at h lemma C9 (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))߸-ބ)*(Yf w<<<((θ w)܅-(a+1))))=sv x*sv w*2^(γ x+γ w-(b˧+a˧))/\ -2^63grind:∀c:ف,((if c then ބ-M else ބ+M)˧߸-ބ)*D=if c then 0-M*D else M*D),show(η x !=η w)=Ζ (η x) (η w)from rfl];generalize M*D=p at n⊢;have Zk:(if Ζ (η x) (η w)then-(p˧:ٴ)else p˧)=sv x*sv w*2^(γ x+γ w-(b˧+a˧)):=by rw[n,<-Zn];by_cases q:ε x*ε w=0;rcases Ax.1 q with h|h<;>simp[h];have B:=j.resolve_left (left_ne_zero_of_mul q);have C:=g.resolve_left (right_ne_zero_of_mul q);rw[(א:γ x+γ w-(b˧+a˧)=γ x-b˧+(γ w-a˧)),pow_add];split_ifs<;>push_cast<;>ring have E:(p˧:ٴ)<2^63:=by rw[n];exact_mod_cast o refine⟨(K8 p _ (by rw[n];omega)).trans Zk,?_,?_⟩<;>rw[<-Zk]<;>split_ifs<;>omega lemma C8 (X W:ؽ δ)(e g:ٳ)(n:ؾ)(f:(k:ؾ)->kػ)(a:ػ)(b:ؼ)(j:n؛<=ށ)(o:∀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)(l:ε ζ*ε 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 intro d;induction d<;>intro k p r S0 S s z A x y B C D;rw[QY6G,dif_neg (by rw[υ];exact DZ.2 (De.1 s))];obtain⟨I,J,K,L,M,-,v⟩:=Zr a ζ b _ p r 0 (YD · · · · ((a˧:ٴ)-298)) ג (λh=>⟨(l h).1,(l h).2.trans_lt ג⟩);rw[M];apply ZV I J K L _ S C D;rw[v,Ϫ,E9 p r 0 S0 rfl A (by clear*-x y z j;omega) (by clear*-x y z j;omega),<-Ϫ,B,s,YB];ring_nf;rename_i d N;have v:=Al s;have w:=υ.2 v;have u:=QK n k w;have E:n؛-(k+1)؛=d:=by rw[u,Cx,s,Cz] rw[QY6G,dif_pos w];dsimp only;obtain⟨F,G,H⟩:=o k w;generalize f k w=q at F G H⊢;refine N (k+1) _ _ (S0+Ye q) S E (u▸v) ?_ (by clear*-u x G;omega) (by clear*-u y H;omega) ?_ C D;unfold QhiS;rw[D8,Ϫ,A,Qsx q,<-Ϫ];rw[B,s,YB,E,u,F];ring lemma C7 (A:ؽ δ)(a i c:ٳ)(e:i*a+a<=Aٽ)(f:i*a+a<=ހ)(g:(Yc A a i&&&ޅ)≠255)(b:Yk (Yc A a i>>>16)<=Yk (Yc A a i&&&ޅ))(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,-,hH,p⟩:=Zp A a i e f;obtain⟨q,k⟩:=Zo _ L H o א;have j:=Zq (Yc A a i>>>16);have h:=Zq (Yc A a i&&&ޅ);rw[q]at j;rw[k]at h;unfold QYF at d;rw[Η _ _ b,j,h]at d;intro t s;obtain⟨-,-,u,v⟩:=Zb A[i*a+t]!;have:=p t s;refine⟨(em _).imp id λ l=>?_,u (Ρ this.2 (hH.lt_of_ne λ c=>g (ύ.1 (by rw[k,c];rfl))))⟩;rw[j];exact⟨H4 this.1 (v l).1,(BZ (H3 this.2 (v l).2) _).trans d⟩ lemma R5 (X W b:ؽ δ)(a i j w x:ٳ)(d e:ؼ)(l o:ؽ δ)(r s:ٳ)(n:ؾ)(f:(k:ؾ)->kػ)(C:i*a+a<=Xٽ)(D:j*a+a<=Wٽ)(y:i*a+a<=ހ)(z:j*a+a<=ހ)(g:a<ށ)(E:w+x<=122)(F:n؛<=ށ)(G:YB l o r s ((Yk (d>>>16))+(Yk (e>>>16)))˧ 0 n؛=YB X W (i*a) (j*a) ((Yk (d>>>16))+(Yk (e>>>16)))˧ 0 a)(A:∀t,t< a->(ε X[i*a+t]! =0\/((Yk (d>>>16))˧<=γ X[i*a+t]!/\γ X[i*a+t]!-(Yk (d>>>16))˧<=w))/\θ X[i*a+t]!≠255)(B:∀t,t< a->(ε W[j*a+t]! =0\/((Yk (e>>>16))˧<=γ W[j*a+t]!/\γ W[j*a+t]!-(Yk (e>>>16))˧<=x))/\θ W[j*a+t]!≠255)(u:θ b[j]!≠255)(v: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))(H:∀t h,Ye (f t h)=sv l[r+t؛]!*sv o[s+t؛]!*2^(γ l[r+t؛]!+γ o[s+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 H':=Za (i*a) א;have I:=Za (j*a) א;have J:=Za a א;have L:=τ;have R:(Yk (d>>>16)+Yk (e>>>16))˧=(Yk (d>>>16))˧+(Yk (e>>>16))˧:=by rw[E6,Zq,Zq] have M:=K7 b[j]! _ v;have G':∀t,tε 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 N K;have p:=(A t N).1.resolve_left (DR.1 K).1;have q:=(B t N).1.resolve_left (DR.1 K).2;clear* -p q R E;omega have T:=W6 X W (i*a) (j*a) _ a 0 (λ t _ h=>G' t (Β a▸h));have K:=ZL ζ b[j]! _ (λ c=>⟨(M c).1,א⟩);generalize O: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;obtain⟨P,Q⟩:-2^191<=S∧S<2^191:=by clear* -O T K g;omega rw[C8 l o r s n f _ b[j]! F (by rwa[R]) א n؛ 0 0 0 0 S rfl ג ג ג ג (by rw[<-O,<-G];simp) P Q,<-W7 X W (i*a)۞ (j*a)۞ a۞ א א א א _ _ b[j]! א (λ c=>⟨(M c).1,א⟩) a 0 0 0 0 0 0 S J ג ג (λ t _ h=>by rw[H',I];have:=G' t א;clear* -this;omega) (by simp[Yx]) (by rw[<-O,H',I,J];simp) P Q];exact L8 X W a i j b[j]! _ _ _ _ _ H' I J g (A · · |>.2) (B · · |>.2) u G' א _ (O2 X W b a i j) lemma J1 (n:ٳ)(f:ٳ->ؼ)(m:ػ):∀k t (P:ؽ ٳ),n-t=k->(QPD n f m t P)܍=P܍++(Bd (2*t) (2*(n-t))).map λ u=>QPb (f (u/2)) m (u%2=1):=by intro k;induction k<;>intro t P h<;>unfold QPD;rw[if_neg (DZ.2 (De.1 h))];simp[h];next k a=>rw[if_pos (Al h)];dsimp only;have e:n-(t+1)=k:=(by rw[Cx,h,Cz]);rw[a (t+1) _ e,h,e,Nat.mul_succ 2 k,Ϩ,Ϩ];simp[Cf,show 2*(t+1)=2*t+1+1 from rfl] lemma D2 (n c:ٳ)(f:ٳ->ؼ)(m:ػ):QPD n f m 0 (Ba c)=ڀ (2*n) λ u=>QPb (f (u܂/2)) m (u܂%2=1):=by apply ϻ;rw[J1 n f m _ 0 _ rfl];apply ϩ<;>simp lemma J0 (n:ٳ)(f:ٳ->ؼ):∀k t (I:ؽ ؼ),n-t=k->(QPI n f t I)܍=I܍++((Bd t (n-t)).filter λ u=>Yf (f u)≠0).map (·.toUInt32):=by intro k;induction k<;>intro t I h<;>unfold QPI;rw[if_neg א];simp[h];next k a=>rw[if_pos א,a (t+1) _ א,(א:n-t=(n-(t+1))+1),Ϩ];split<;>simp[*] lemma R6 (X W:ؽ δ)(a b d:ٳ):∀r k,YB X W a b d k r=((Bd 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;intro;rfl;next r e=>intro;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;rfl;next x L a=>simp only[List.filter_cons,CR,DV];split<;>simp_all lemma R9 (t:ؾ)(w:ؼ)(h:t؛<ށ):(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⟩:=D0 t w h;have h:=QZb w;simp only[AG]at h;refine⟨a,b,?_⟩;rcases (η w).eq_false_or_eq_true with c|c<;>rw[c]at h⊢<;>simp only[↓reduceIte,φ,ת,decide_eq_false_iff_not]at h⊢<;>omega lemma I9 (X:ؽ δ)(P:ؽ ٳ)(I:ؽ ؼ)(W b:ؽ δ)(d i j:ٳ)(H:(Iٽ=0->∀t,t<2*d->Pٽ=2*d->P[t]! =QPb X[i*d+t/2]! (Yk (Yc X d i>>>16)) (t%2=1))/\(Iٽ≠0->I܍=((ϒ d).filter λ t=>Yf X[i*d+t]! ≠0).map (·.toUInt32)/\∀u,u<2*Iٽ->Pٽ=2*Iٽ->P[u]! =QPb X[i*d+(I[u/2]!)؎]! (Yk (Yc X d i>>>16)) (u%2=1))):QPa X P I W b d i j (Yc X d i) (Yc W d j)=Γ (d+1) (λ t=>if t< d then X[i*d+t]! else ζ) (λ t=>if t< d then W[j*d+t]! else b[j]!):=by unfold QPa;by_cases c:Iٽ=0<;>simp only[c,↓reduceDIte,↓reduceIte]<;>split<;>(try exact ZcB ..)<;>obtain⟨F,O,x,y,z,A,G,K,L,B,C,l,n,o,p⟩:=‹_∧_›<;>have r:=C7 X d i _ x z K B le_rfl<;>have s:=C7 W d j _ y A L C le_rfl<;>have e:∀u:ؾ,u؛by rw[Zc _ _ (by rw[Za _ א];have:=τ;omega),Za _ א] exact R5 X W b d i j _ _ _ _ X W _ _ _ _ x y z A G א (by rw[Za _ א];omega) (by rw[Za _ א]) r s n o (λt h=>by have f:t؛δ)m,m(I.map g)[0+m]! =g I[m]!:=λg m h=>by rw[Β,ح _ m (by rwa[CC]),CN,ح I m h] exact R5 X W b d i j _ _ _ _ (I.map λv=>X[i*d+v؎]!) (I.map λv=>W[j*d+v؎]!) 0 0 _ _ x y z A G א (by rw[Za _ א];omega) (by rw[Za _ א,R6,R6,<-Ca,<-Ca,<-QFL (ϒ d) (λt=>Yf X[i*d+t]!≠0) _ (λu _ h=>by simp only[sv,<-Zk,not_not.1 h,Ϝ,CP,neg_zero,ite_self,zero_mul])];apply congrArg;apply ϩ (by simp only[Ds,CM,<-Array.length_toList,D]);intro m E N;simp only[Ds,CM]at E;simp only[List.getElem_map,List.getElem_range,V _ _ E,ح I m E,<-DL,D,Cd,UInt32.toNat_ofNat_of_lt' ((BM.1 (List.mem_of_mem_filter (List.getElem_mem (Ds _▸N)))).trans (א:d<߿))]) r s n o (λt h=>by have f:t؛ k ػ × ػ) (j l:ػ) (a:ؼ) (b e f g:ػ) (k:ؾ) : QY6G2 n F j l a b e f g k=(QY6G n (λ k h=>(F k h).1) j a b e k,QY6G n (λ k h=>(F k h).2) l a f g k):=by induction q:n؛-k؛generalizing b e f g k with |zero=> have o:¬k have o:k δ × δ):∀ k j (A B:ؽ δ),a-j=k -> (Yr2 a g j A B).1.toList=A܍++(Bd j (a-j)).map (λ t=>(g t).1)/\(Yr2 a g j A B).2.toList=B܍++(Bd j (a-j)).map (λ t=>(g t).2):=by intro k;induction k<;>intro j A B h<;>unfold Yr2 ·rw[if_neg א];simp[h] rename_i b;rw[if_pos א];dsimp only;obtain⟨d,e⟩:=b (j+1) (A.push (g j).1) (B.push (g j).2) א;rw[d,e,show a-j=(a-(j+1))+1 by omega,Ϩ];simp lemma ZB2 (c a:ٳ) (d:ٳ -> ف) (b:ٳ -> ٳ -> δ × δ) (f:ٳ -> ٳ -> δ) (g:∀ i j,b i j=(f i j,f (i+1) j)) : ∀ k l (n:ؽ δ),c-l<=k -> YT2l c a d b f l n=Yak c a f l n:=by intro k;induction k with |zero=>intro l n h;unfold YT2l Yak;rw[if_neg א,if_neg א,if_neg א] |succ k p=>intro l n h;unfold YT2l;by_cases o:l+1unfold Yak;rw[if_pos (א:l ف) (b:ٳ -> ٳ -> δ × δ) (f:ٳ -> ٳ -> δ) (e:∀ i j,b i j=(f i j,f (i+1) j)) : (if c<2 then YT c a f else YT2l c a d b f 0 (AY (c*a)))=YT c a f:=by split;rfl;exact ZB2 c a d b f e _ 0 _ le_rfl lemma QWPs (n:ٳ) (f:ٳ -> ؼ) (m:ػ):∀ k t (V:ؽ ؼ) (s:ػ),n-t=k -> (QWP n f m t V s).1܍=V܍++(Bd t (n-t)).map (λ u=>QWe m (f u)) /\ (QWP n f m t V s).2=s+((Bd t (n-t)).map λ u=>(1:ػ)<<intro t V s h<;>unfold QWP ·rw[if_neg א];simp[h] rename_i k a;rw[if_pos א];have e:n-(t+1)=k:=א;obtain⟨b,c⟩:=a (t+1) _ _ e;rw[b,c,h,e,Ϩ];simp[CY] lemma QWu (m:ػ) (x:ؼ) (sl:(QWs m x)˧<=63):let v:=(QWe m x)܅;v>>>25=QWs m x/\((((v&&&0x1FFFFFF)-0x1000000)˧:ٴ))%2^64=sv x%2^64:=by have z:=Zk x;have g:=Ϛ x;have t:(25:ػ)˧%64=25:=rfl generalize hA:(if η x then 2^24-ε x else 2^24+ε x)=a obtain⟨A,ha⟩:(if η x then (0x1000000:ػ)-Yf x else (0x1000000:ػ)+Yf x)˧=a/\a<2^25:=by rw[<-hA];split<;>simp only[Τ,ξ,z]<;>norm_num<;>omega have v:((QWe m x)܅)˧=a+(QWs m x)˧*2^25:=by unfold QWe;rw[AG,AA,Du,ό,A,t,ν (show (QWs m x)˧<<<25<2^64 by rw[Α];omega),Nat.or_comm,<-Bq ha,Α,ν (show (QWs m x)˧*2^25+a<2^32 by omega)];ring refine⟨σ.mp ?_,?_⟩ · rw[Ξ,v,t,ψ];omega · rw[Τ,BR,v,show(0x1FFFFFF:ػ)˧=2^25-1 from rfl,ϡ,<-hA];unfold sv;split<;>norm_num<;>omega lemma QSA (l h q s:ػ) (a:1<=s˧/\s˧<=63):((h+(q>>>(64-s))+(if l+(q<<>>(64-s))˧=q˧*2^s˧/2^64:=by rw[Ξ,e,ν (א:64-s˧<64),ψ,show 2^64=2^(64-s˧)*2^s˧ by rw[<-Κ];congr 1;omega,Nat.mul_div_mul_right _ _ ה] have:=l܉;have:=h܉;have p:q˧*2^s˧<2^127:=by have:q˧*2^s˧<2^64*2^63:=Nat.mul_lt_mul_of_lt_of_le q܉ (Ι ב a.2) ה;omega generalize q˧*2^s˧=P at o u p;split<;>rename_i c<;>rw[Ψ,ξ,o]at c<;>simp only[ξ,o,u,Da,Ϝ]<;>omega lemma QWq (g m:ػ) (w x:ؼ) (hx:(QWs m x)˧<=63) (hw:ε w=0\/(g˧<=γ w/\γ w-g˧<=7)) : ((QWz (QWe m x)܅ w g)˧:ٴ)=sv x*sv w*2^(γ w-g˧)+2^55:=by unfold QWz;dsimp only have z:=Zk w;have y:=Zf w;have gw:=Ϛ w;have gx:=Ϛ x have v:(Yf w<<<(Yd w-g))˧=ε w*2^(γ w-g˧)/\ε w*2^(γ w-g˧)<2^31:=by rcases hw with c|⟨c,d⟩ · rw[σ.mp (by rw[z,c];rfl:(Yf w)˧=(0:ػ)˧),c];simp · have:ε w*2^(γ w-g˧)<2^24*2^7:=Nat.mul_lt_mul_of_lt_of_le gw (Ι ב d) ה refine⟨?_,א⟩;rw[ό,Η _ _ (ϐ.2 (by rw[y];omega)),z,y,ν (א:γ w-g˧<64),Α];exact ν א obtain⟨-,u⟩:=QWu m x hx;generalize ((QWe m x)܅&&&0x1FFFFFF)-0x1000000=M at u⊢;generalize Yf w<<<(Yd w-g)=E at v⊢;obtain⟨v,vb⟩:=v have sx:(sv x).natAbs<2^24:=by unfold sv;split<;>simp<;>omega have Vb:((E˧:ٴ)*sv x).natAbs<2^55:=by rw[Int.natAbs_mul];simp only[Int.natAbs_natCast];have:E˧*(sv x).natAbs<2^31*2^24:=Nat.mul_lt_mul'' א sx;omega have e:sv x*sv w*2^(γ w-g˧)=if η w then -((E˧:ٴ)*sv x) else (E˧:ٴ)*sv x:=by rw[v];unfold sv;split_ifs<;>push_cast<;>ring have q:=QZb w;rw[AG]at q have hs:(((if w>>>31=0 then M else 0-M)˧:ٳ):ٴ)%2^64=(if η w then -sv x else sv x)%2^64:=by rcases (η w).eq_false_or_eq_true with c|c<;>simp only[c,↓reduceIte,Bool.false_eq_true]at q⊢ · rw[if_neg (λ d=>by rw[d]at q;simp at q),Τ];push_cast;have:=M܉;omega · rw[if_pos (ύ.mp (by simpa using q))];exact u generalize (if w>>>31=0 then M else 0-M)=S at hs⊢;rw[ξ,ϯ,e];push_cast have hc:((E˧:ٴ)*S˧)%2^64=(if η w then -((E˧:ٴ)*sv x) else (E˧:ٴ)*sv x)%2^64:=by rw[Int.mul_emod,hs,<-Int.mul_emod];split<;>ring_nf generalize (E˧:ٴ)*sv x=V at Vb hc⊢;generalize (E˧:ٴ)*S˧=P at hc⊢;rcases (η w).eq_false_or_eq_true with c|c<;>simp only[c,↓reduceIte,Bool.false_eq_true]at hc⊢<;>omega lemma QWLv {β:Type} (kont:ػ -> ػ -> β) (V W:ؽ δ) (a n:ؾ) (jV:n؛<=Vٽ) (j1:a؛+n؛<=Wٽ) (k1:a؛+n؛<Λ) (g:ػ) (hs:∀ t,t 1<=((V[t]!)܅>>>25)˧/\((V[t]!)܅>>>25)˧<=63) : ∀ d (k:ؾ) (l u:ػ),n؛-k؛=d -> k؛<=n؛ -> ∃ L H,QWL kont V W a n jV j1 k1 g l u k=kont L H /\ (H˧*2^64+L˧)%2^128=(u˧*2^64+l˧+((Bd k؛ d).map λ (t:ٳ)=>(QWz (V[t]!)܅ W[a؛+t]! g)˧*2^(((V[t]!)܅>>>25)˧)).sum)%2^128:=by intro d;induction d<;>intro k l u hd hk ·rw[QWL,dif_neg (λ c=>by have:=υ.1 c;omega)];exact⟨_,_,rfl,ג⟩ rename_i d IH;have h:k B˧<=γ ζ+γ bw/\γ ζ+γ bw<=B˧+122) (hS:S=S0+sv ζ*sv bw*2^(γ ζ+γ bw-B˧)) (C:-2^191<=S) (D:S<2^191) : YL B ζ bw ((0:ػ)-(H>>>63)) H L 0 (λ v2 v1 v0 c'=>YD v2 v1 v0 c' ((B˧:ٴ)-298))=if S=0 then ߿ else (ρ S ((B˧:ٴ)-298) false)܅:=by obtain⟨I,J,K,M,E,-,v⟩:=Zr B ζ bw _ H L 0 (YD · · · · ((B˧:ٴ)-298)) ג (λh=>⟨(l h).1,(l h).2.trans_lt ג⟩);rw[E];apply ZV I J K M _ S C D;rw[v,Ϫ,E9 H L 0 S0 rfl A x y,<-Ϫ,hS] lemma QSB (h l c a:ػ):((((h-c-(if lrename_i e<;>rw[Ψ]at e<;>simp only[Τ,Da,Ϝ]<;>push_cast<;>omega lemma QWm (g:ٳ -> ػ):∀ (L:List ٳ),(∀ u,u ∈ L -> (g u)˧<=2^48) -> L.length<2^14 -> (L.map g).sum˧=(L.map λ u=>(g u)˧).sum /\ (L.map λ u=>(g u)˧).sum<=L.length*2^48:=by intro L;induction L<;>intro h k ·simp rename_i x L e;simp only[List.map_cons,List.sum_cons,ξ,List.length_cons] at k⊢;obtain⟨p,r⟩:=e (λ u m=>h u (List.mem_cons_of_mem _ m)) א;have q:=h x List.mem_cons_self;rw[p];exact⟨ν (by nlinarith),by nlinarith⟩ lemma QWb (X W:ؽ δ) (xa wa d:ٳ):∀ r k,(∀ t,k<=t -> t ε X[xa+t]!*ε W[wa+t]!≠0 -> γ X[xa+t]!+γ W[wa+t]!-d<=55) -> |YB X W xa wa d k r|<=r*2^103:=by intro r;induction r<;>intro k h ·simp[YB] rename_i r e;rw[YB];have p:=e (k+1) (λ t a b=>h t א א);have g:=h k le_rfl א;generalize X[xa+k]! = x at g⊢;generalize W[wa+k]! = w at g⊢ have q:|sv x*sv w*2^(γ x+γ w-d)|<=2^103:=by rw[<-Zn];by_cases c:ε x*ε w = 0 ·rw[c];split<;>simp have:=ZK x w;have:2^(γ x+γ w-d)<=2^55:=Ι ב (g c);have:(ε x*ε w*2^(γ x+γ w-d):ٳ)<=2^103:=by have:=Nat.mul_le_mul (א:ε x*ε w<=2^48) this;omega split<;>(try simp only[neg_mul,abs_neg])<;>rw[abs_of_nonneg ה]<;>exact_mod_cast this have:=abs_add_le (sv x*sv w*2^(γ x+γ w-d)) (YB X W xa wa d (k+1) r);push_cast;linarith lemma QWv (V:ؽ ؼ) (f:ٳ -> ؼ) (a:ٳ) (hV:V܍=(Bd 0 a).map f):∀ t,t V[t]! = f t:=by have:=congrArg List.length hV;simp at this;intro t h;rw[ح V t א,<-Array.getElem_toList];simp[hV] lemma QWE (x w:ؼ) (m g:ػ) (hx:ε x=0\/(m˧<=γ x/\γ x-m˧<=47)) (hw:ε w=0\/(g˧<=γ w/\γ w-g˧<=7)) (g1:1<=g˧) : let v:=(QWe m x)܅;(1<=(v>>>25)˧/\(v>>>25)˧<=63)/\(((QWz v w g)˧*2^((v>>>25)˧):ٳ):ٴ)=sv x*sv w*2^(γ x+γ w-(m˧+g˧-1))+2^55*(((1:ػ)<< (QWs m x)˧=γ x-m˧+1:=λ c0=>by obtain⟨c,d⟩:=hx.resolve_left c0;have y:=Zf x;have k:m<=Yd x:=ϐ.2 (by rw[y];exact c);unfold QWs;rw[if_neg (λ k=>by have:=Zk x;rw[k] at this;simp at this;omega),ξ,Η _ _ k,y,Da];have:=Zg x;exact ν א have e:1<=(QWs m x)˧/\(QWs m x)˧<=48:=by by_cases c0:ε x=0 · unfold QWs;rw[if_pos (σ.mp (by rw[Zk,c0];rfl:(Yf x)˧=(0:ػ)˧))];simp · have:=f c0;have:=hx.resolve_left c0;omega have q:=QWq g m w x א hw;intro v;rw[(QWu m x א).1] have p2:((1:ػ)<<>>16)<=Yk (Yc X a i&&&ޅ)) (c3:QYF (Yc X a i)<=47) : QW1 X W b (QWP a (λ t=>X[i*a+t]!) (Yk (Yc X a i>>>16)) 0 (Ba a) 0).1 (QWP a (λ t=>X[i*a+t]!) (Yk (Yc X a i>>>16)) 0 (Ba a) 0).2 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 obtain⟨hV,hs⟩:=QWPs a (λ t=>X[i*a+t]!) (Yk (Yc X a i>>>16)) a 0 (Ba a) 0 ג;generalize QWP a (λ t=>X[i*a+t]!) (Yk (Yc X a i>>>16)) 0 (Ba a) 0=p at hV hs⊢;simp only[Bw,Array.toList_empty,List.nil_append,tsub_zero,zero_add] at hV hs;unfold QW1;dsimp only;split · rename_i h;obtain⟨hv,y,D,z,g,q⟩:=h;have:=τ;have hVt:=QWv _ _ a hV have A:=C7 X a i 47 C y c1 c2 (ϐ.1 c3);simp only[QWc,Bool.and_eq_true,bne_iff_ne,ne_eq,decide_eq_true_eq,Bool.or_eq_true] at q;obtain⟨⟨⟨⟨⟨qY,q1⟩,q2⟩,G1⟩,u⟩,v⟩:=q have B:=C7 W a j 7 D z q1 qY (ϐ.1 q2);have r:∀ v:ؼ,(Yk (v>>>16))˧<2^16:=λ v=>by rw[Zq,Ϣ,ψ];have:=v.toNat_lt;simp;omega have r1:=r (Yc X a i);have r2:=r (Yc W a j);have E:=λ t (h:tQWE X[i*a+t]! W[j*a+t]! _ _ (A t h).1 (B t h).1 (ϐ.1 G1);have I:=Za (j*a) א;have J:=Za a א;obtain⟨L,H,EE,hc⟩:=QWLv _ p.1 W (j*a)۞ a۞ א (by rw[I,J];exact D) (by rw[I,J];omega) _ (λ t h=>by rw[hVt t א];exact (E t א).1) a 0 0 0 J ג;rw[EE];simp only[USize.toNat_zero,I] at hc;generalize Yk (Yc X a i>>>16)=xm at *;generalize Yk (Yc W a j>>>16)=gw at *;have g1:1<=gw˧:=ϐ.1 G1;have Bv:(xm+gw-1)˧=xm˧+gw˧-1:=by rw[Η _ _ (ϐ.2 (by rw[ξ];simp;omega)),ξ,ν א];rfl obtain⟨sv1,sv2⟩:=QWm (λ u=>(1:ػ)<<(E u (by simp at m;omega)).2.2) (by simp;omega);have S1:((((Bd 0 a).map λ (t:ٳ)=>(QWz (p.1[t]!)܅ W[j*a+t]! gw)˧*2^(((p.1[t]!)܅>>>25)˧)).sum:ٳ):ٴ)=YB X W (i*a) (j*a) (xm+gw-1)˧ 0 a+2^55*(p.2˧:ٴ):=by rw[Nat.cast_list_sum,List.map_map,R6,hs,sv1,Bv];push_cast;rw[List.map_congr_left (g:=λ t=>sv X[i*a+t]!*sv W[j*a+t]!*2^(γ X[i*a+t]!+γ W[j*a+t]!-(xm˧+gw˧-1))+2^55*(((1:ػ)<<by simp only[Function.comp];simp at m;rw[hVt t m];exact (E t m).2.1),List.sum_map_add,List.sum_map_mul_left,List.map_map];rfl have hb:p.2˧<2^62:=by rw[hs,sv1];have:=sv2;rw[List.length_range'] at this;omega have cv:((p.2>>>9)˧*2^64+(p.2<<<55)˧:ٳ)=p.2˧*2^55:=by rw[Ξ,ό,show (9:ػ)˧%64=9 from rfl,show (55:ػ)˧%64=55 from rfl,ψ,Α,(ב:(2:ٳ)^64=2^9*2^55),Nat.mul_mod_mul_right];have:=Nat.div_add_mod p.2˧ (2^9);nlinarith have G':∀t,tε X[i*a+t]!*ε W[j*a+t]!≠0->(xm+gw-1)˧<=γ X[i*a+t]!+γ W[j*a+t]!/\γ X[i*a+t]!+γ W[j*a+t]!<=(xm+gw-1)˧+55:=by intro t N K;have:=(A t N).1.resolve_left (left_ne_zero_of_mul K);have:=(B t N).1.resolve_left (right_ne_zero_of_mul K);rw[Bv];omega have T:=QWb X W (i*a) (j*a) (xm+gw-1)˧ a 0 (λ t _ h K=>by have:=G' t א K;omega);have hA:(((H-(p.2>>>9)-(if Lٴ) hc;push_cast at h1;simp only[zero_add] at h1;rw[<-Nat.cast_list_sum,S1] at h1;show Int.ModEq _ _ _;exact (Int.ModEq.sub_right _ h1).trans (by unfold Int.ModEq;push_cast;ring_nf) have H':=Za (i*a) א;have M:=K7 b[j]! _ v;have K:=ZL ζ b[j]! (xm+gw-1)˧ (λ c=>⟨(M c).1,by have:=(M c).2;omega⟩);have T':=abs_le.mp T;push_cast at T';generalize O:YB X W (i*a) (j*a) (xm+gw-1)˧ 0 a+sv ζ*sv b[j]!*(2:ٴ)^(γ ζ+γ b[j]!-(xm+gw-1)˧)=S;obtain⟨P,Q⟩:-2^191<=S/\S<2^191:=by rw[<-O];constructor<;>linarith unfold QWf;dsimp only;rw[QWF (xm+gw-1) b[j]! _ _ _ S hA (by linarith) (by linarith) (λ c=>⟨(M c).1,by have:=(M c).2;omega⟩) (by rw[<-O]) P Q,<-W7 X W (i*a)۞ (j*a)۞ a۞ א א א א (xm+gw-1) _ b[j]! א (λ c=>⟨(M c).1,by have:=(M c).2;omega⟩) a 0 0 0 0 0 0 S J ג ג (λ t _ h=>by rw[H',I];have:=G' t א;omega) (by simp[Yx]) (by rw[<-O,H',I,J];simp) P Q];exact L8 X W a i j b[j]! _ _ _ _ _ H' I J א (λ t h=>(A t h).2) (λ t h=>(B t h).2) u (λ t h K=>(G' t h K).imp_right λ _=>by omega) (λ c=>⟨(M c).1,by have:=(M c).2;omega⟩) _ (O2 X W b a i j) · simp only[ZcB] lemma QZo {α:Type} [Inhabited α] (n:ٳ) (f:Fin n -> α) (k:ٳ) (h:k x=z) (h2:c=false -> y=z):(if c then x else y)=z:=by cases c;exact h2 rfl;exact h1 rfl lemma QZj {α β:Type} [Inhabited β] (n k:ٳ) (h:k Prop) [DecidablePred C] (A:Fin n -> ؽ α × β) (b:β) (g:(ڀ n (λ i=>if C i then A i else (#[],b)))[k]!.1ٽ≠0):C ⟨k,h⟩/\(ڀ n (λ i=>if C i then A i else (#[],b)))[k]! = A ⟨k,h⟩:=by rw[QZo n _ k h] at g ⊢;split at g;exact⟨‹_›,if_pos ‹_›⟩;simp at g lemma ZcC:YaV=linearSpec:=by funext m a o p X W b;unfold YaV linearSpec linearWith;dsimp only;rw[ZB3 _ _ _ _ _ (λ i j=>QZl (λ _=>rfl) λ h=>by simp only[Bool.or_eq_false_iff] at h;simp only[D1,h.1,h.2,Bool.false_eq_true,↓reduceIte]),ZB _ _ _ rfl];congr 1;funext q;have f:=q.isLt;have h:=CU (Ek f);have e:=ϕ (f.trans_eq (Θ m o));rw[Ze m (Yc X a) _ e,Ze o (Yc W a) _ (Ε q܂ h)] congr 1;refine QZl (λ g=>?_) λ _=>?_ · obtain⟨c,E⟩:=QZj m _ e _ _ _ (bne_iff_ne.mp g) rw[E];simp only[QZo m _ _ e,Bool.and_eq_true,bne_iff_ne,ne_eq,decide_eq_true_eq] at c ⊢;obtain⟨⟨⟨⟨-,c1⟩,c2⟩,c3⟩,C⟩:=c;exact QW1G X W b a _ _ C c1 c2 c3 rw[I9];split . rw[ح _ (q܂/o) (by simp only[Bw,Ω,ת,AE,Fin.is_lt,ح,AD];omega)];simp only[AD];split . exact⟨λ _ t g d=>by simp only[CK,Dr]at d;omega,(absurd rfl ·)⟩ split . rename_i l;simp only[Ω,ת]at l;refine⟨λ c=>absurd c (by dsimp only;omega),λ _=>⟨?_,λ u n d=>?_⟩⟩ . rw[J0 _ _ _ 0 _ rfl];simp only[Bw,Array.toList_empty,Cd,ne_eq,decide_not,tsub_zero,←Ca,EB] . rw[D2,ح _ u (by rw[AE];omega)];simp only[Bw,AD];rw[Ze m _ _ e] . exact⟨λ _ t g d=>by rw[D2,ح _ t (by simp only[AE];omega)];simp only[AD];rw[Ze m _ _ e],(absurd rfl ·)⟩ . rw[ح _ _ (by simp only[DN];omega),CW];exact⟨λ _ t g d=>by simp only[CK,Dr]at d;omega,(absurd rfl ·)⟩ def Ysm (fa:ٳ->δ) (m:ػ) (i:ٳ):ٳ->ػ | 0=>0 | r+1=>YaJ (fa i) m+Ysm fa m (i+1) r def Yt (fa:ٳ->δ) (m:ٳ) (i:ٳ):ٳ->ٴ | 0=>0 | r+1=>sv (fa i)*2^(idxOf (fa i)-m)+Yt fa m (i+1) r @[inline] def Ypf (m:ػ) (n:ٳ) (fa:ٳ->δ) (S:ػ):δ:= if S==0 then (if decide (n≠0)&&Yq fa (λ _=>oneW) 0 n then߾else 0) else YaP S ((m.toNat:ٴ)-149) false true (m-149) lemma YmE (w:ػ):Ym w=Ye w:=by unfold Ym Ye;have:=w܉;split_ifs with h;rw[Υ h];simp;rw[(א:w˧/2^63=1)];simp lemma YsmE (a:ٳ->δ)(m:ػ)(U:ٳ)(d:U<=30) (b:∀t,mantOf (a t)=0\/(m˧<=idxOf (a t)/\idxOf (a t)-m˧<=U)): ∀r i,r<=256->Ye (Ysm a m i r)=Yt a m˧ i r/\ -((r:ٴ)*2^54)<=Yt a m˧ i r/\Yt a m˧ i r<=(r:ٴ)*2^54:=by intro r;induction r with |zero=>simp[Ysm,Yt,Ye] |succ r g=> intro i j;obtain⟨e,k,l⟩:=g (i+1) א;obtain⟨f,h⟩:=J7 (a i) m U א (b i);have n:(2:ٴ)^(24+U)<=2^54:=pow_le_pow_right₀ ב א obtain⟨o,p⟩:=abs_lt.1 h;have q:(r:ٴ)<=255:=א;rw[Ysm,Yt,B9 _ _ (by rw[e,f];omega) (by rw[e,f];omega),e,f];push_cast;refine⟨rfl,א,א⟩ lemma YoE (a:ٳ->δ)(m:ٳ) (b:∀t,mantOf (a t)=0\/(m<=idxOf (a t))): ∀r i,Yo a (λ _=>oneW) i r=Yt a m i r*2^(m+149):=by intro r;induction r with |zero=>simp[Yo,Yt] |succ r f=> intro i;rw[Yo,Yt,f (i+1),add_mul];congr 1;simp only[(ד:sv ζ=2^23),(ד:γ ζ=126)];rcases b i with h|h . simp[sv,h] . rw[←Aw h,Cz];ring lemma YeZ (q:ػ)(h:Ye q=0):q=0:=by unfold Ye at h;have:=q܉;apply σ.1;rw[Ϝ];omega lemma YpE (n:ٳ)(a:ٳ->δ)(m:ػ)(U:ٳ)(d:U<=30)(e:n<=256)(f:m˧<1024) (g:∀t,expOf (a t)≠255) (b:∀t,mantOf (a t)=0\/(m˧<=idxOf (a t)/\idxOf (a t)-m˧<=U)): Ypf m n a (Ysm a m 0 n)=dotOf n a (λ _=>oneW):=by rw[Zy n a _ (λ t _=>⟨g t,ד⟩)];obtain⟨j,-⟩:=YsmE a m U d b n 0 e;rw[YoE a m˧ (λ t=>(b t).imp_right (·.1)) n 0,<-finishWord_scale];unfold Ypf;split;next k=>simp[<-j,(by simpa using k:Ysm a m 0 n=0),Ye,finishWord] next k=>rw[L6 _ _ _ _ _ (Y0p m f),YmE,j,ZcN _ _ (decide (n≠0)&&Yq a (λ _=>oneW) 0 n) false (λ h=>by simp[YeZ _ (j.trans h)]at k)];exact congrArg (finishWord _ · false) (by push_cast;omega) def Ysa (inp:ؽ δ) (m:ػ) (b i n:ٳ) (acc:ػ):ػ:= if iYsa a m b i n d=d+Ysm (λ t=>a[b+t]!) m i r:=by intro r;induction r<;>intro i d h<;>unfold Ysa;rw[if_neg א];simp[Ysm];next r e=>rw[if_pos א,e (i+1) _ א,Ysm,CY] lemma YdC (n:ٳ)(b a:ٳ->δ)(d:ٳ->δ)(h:∀t,tb t=a t):dotOf n b d=dotOf n a d:=by unfold dotOf;congr 2;funext i;exact h _ i.2 lemma Yap5 (c h w:ٳ)(a y x:ؾ)(n:ٳ)(b:aby simp[e,υ]at l have wp:0by simp[e,υ]at o have E:=Za _ (Ρ ((Ϧ _ (ϊ hp wp)).trans d1) d2)▸υ.1 q;have hH:=Ρ ((Ϧ _ wp).trans ((ϳ _ (Ek E)).trans d1)) d2;have g:=Ρ ((ϳ _ hp).trans ((ϳ _ (Ek E)).trans d1)) d2;have C:=Za _ (Ρ (Dq _ _) hH)▸υ.1 l;have D:=Za _ (Ρ (Dq _ _) g)▸υ.1 o;have F:a؛*h+2*y؛+2<=c*h:=by have:=ω h E;rw[Ah]at this;clear* -this C;omega have Z:(a؛*h+2*y؛)*w+2*x؛+w+1if t=0 then x0 else if t=1 then x1 else if t=2 then x2 else x3) (YaJ x0 m+(YaJ x1 m+(YaJ x2 m+YaJ x3 m)))):=by unfold Yap2 Ypf;simp only[Yq,EK,DX,↓reduceIte,show decide ((4:ٳ)≠0)=true from rfl,Bool.true_and,Nat.reduceEqDiff,show ε ζ=ރ from rfl,show η ζ=false from rfl,EM,Ax,OfNat.ofNat_ne_zero,or_false] @[noinline] def Gy (c h w:ٳ) (inp:ؽ δ) (m:ػ) (hz:c*(h*w)<=inp܃/\inp܃<߿):ؽ δ:= YO (h/2)۞ (w/2)۞ (λ ch y x => if hb:chsimp[e] rw[YO,dif_pos (by rw[e];rfl)];apply ϻ;simp[e] . obtain⟨y,f,k⟩:0if t=0 then a[I]! else if t=1 then a[I+1]! else if t=2 then a[I+w]! else a[I+w+1]!) m 0 4=YaJ a[I]! m+(YaJ a[I+1]! m+(YaJ a[I+w]! m+YaJ a[I+w+1]! m)):=by simp[Ysm] rw[←G,YpE 4 _ m 30 א א d (λ t=>by split_ifs<;>exact l _) (λ t=>by split_ifs<;>exact g _)];refine YdC _ _ _ _ λ t N=>?_;unfold poolAt;interval_cases t<;>simp<;>congr 1<;>rw[←F]<;>ring def YbkF (c h w k:ٳ) (inp:ؽ δ):ؽ δ:= let bp:=Yc inp inp.size 0 let m:=Yk (bp>>>16) if (bp&&&ޅ)≠255/\m<=Yk (bp&&&ޅ)/\YU bp<=30/\inp.size<=ހ then if h=k/\w=k/\0YaB (k*k) (Ypf m (k*k) (λ t=>inp[ch*(k*k)+t]!) (Ysa inp m (ch*(k*k)) 0 (k*k) 0)) else if h2:k=2/\c*(h*w)<=inp.size/\inp.size<߿then Gy c h w inp m h2.2 else YaZ c h w k inp else YaZ c h w k inp lemma ZdSF:YbkF=avgpoolSpec:=by rw[<-ZcS];funext c h w k a;unfold YbkF;dsimp only;split;rename_i p;obtain⟨r,s,u,B⟩:=p;obtain⟨f,-,l,xfin⟩:=M0 a a܃ 0 ג ו r s;unfold okF at f;simp only[ϸ,Β]at f xfin;generalize Yk (Yc a a܃ 0>>>16)=m at f l⊢;have v:=ϐ.1 u;have b:∀j:ٳ,mantOf a[j]! =0\/(m˧<=idxOf a[j]!/\idxOf a[j]!-m˧<=30):=by intro j;by_cases d:jby simp at v;omega);left;rw[getElem!_neg a j d];rfl have e:∀j:ٳ,expOf a[j]!≠255:=by intro j;by_cases d:je _) (λ t=>b _),Q7,YdC (h*h) _ (poolAt h h h a (q:ٳ) 0 0) _ (λ t C=>by unfold poolAt;congr 1;rw[(by ring:((q:ٳ)*h+0*h+t/h)*h+0*h+t%h=(q:ٳ)*(h*h)+(h*(t/h)+t%h)),Aq])];split;rename_i o;obtain⟨rfl,-⟩:=o;exact ZpA c h w a m _ א e b;rfl;rfl def kernels:Kernels where core:=kernels0.core dense:=⟨YaV,Ya3⟩ conv:=⟨Ybp,dwQ⟩ elem:=⟨YbkF,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,V6,V5,ZdSF,W1,W3,V3,T4,T3] end Submission