import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats local notation "З"=>FloatArray open Nat renaming shiftRight_eq_div_pow->β,mod_eq_of_lt->γ,and_two_pow_sub_one_eq_mod->θ,mul_le_mul_right->ι,shiftLeft_eq->ν,pow_le_pow_right->Η,zero_add->Ι,add_mul_mod_self_right->Μ,succ_mul->Ξ,add_mul_div_right->Ο,div_eq_of_lt->Τ,add_comm->Υ,mod_lt->ϊ,mul_comm->ύ,mul_lt_mul_of_pos_right->ϐ,mul_lt_mul''->ϔ,add_zero->ϕ,lt_log2_self->ϙ,mul_assoc->Ϛ,div_add_mod->ϛ,add_mul->Ϝ,and_le_right->ϟ,div_lt_of_lt_mul->Ϡ,zero_le->Ϣ,toUInt64_eq->Ϥ,two_pow_add_eq_or_of_lt->ϥ,mul_le_mul->ϩ,div_le_div_right->Ϯ,mul_pos->ϯ,div_eq_of_lt_le->ϱ,log2_self_le->ϲ,add_sub_cancel_left->ϳ,zero_mul->ϵ,pos_of_ne_zero->Ϸ,two_pow_pos->ϸ,div_lt_iff_lt_mul->Ϲ open USize renaming lt_iff_toNat_lt->ε,le_size->ς,toNat_zero->Ϩ open UInt64 renaming le_iff_toNat_le->ζ,toNat_add->η,lt_iff_toNat_lt->μ,toNat_inj->ξ,toNat_shiftRight->ο,toNat_sub_of_le->χ,toNat_shiftLeft->ψ,toNat_ofNat_of_lt'->Α,toNat_and->Β,toNat_sub->Ζ,toNat_zero->ϋ,toNat_mul->Ϗ,le_trans->ϗ,toNat_toUInt32->ϫ local notation "К"=>ite_true open Bool renaming false_eq_true->υ,and_eq_true->Θ,eq_iff_iff->ϒ local notation "Л"=>ite_false open UInt32 renaming toNat_inj->Ε,toNat_and->Ν,toNat_shiftRight->Ρ,lt_iff_toNat_lt->ώ,toNat_toUInt64->Ϫ,toNat_shiftLeft->϶ local notation "М"=>true open Array renaming getElem_ofFn->Κ,size_push->ϝ,size_ofFn->Ϟ,getElem?_eq_none->Ϧ local notation "Н"=>false open Finset renaming sum_range_succ->Λ,sum_congr->ϓ,mem_range->ϧ local notation "О"=>rfl open Model renaming isNaN_eq_false_of_toDyadic?_some->Χ,toReal_roundDyadic_eq_roundAt->ό,toModel_ofFloatModel->ϑ,isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite->Ϙ,isInf_eq_false_of_toDyadic?_some->ϣ,abs_signed_mul_bpow_le_toReal_posMaxFinite->Ϭ,roundDyadicGeneral_eq_roundDyadic->ϻ local notation "П"=>by simp open FloatLib.Numerics.Dyadic renaming cast_toRat->ϖ,toRat_eq_zero_iff->ϴ local notation "Р"=>by ring open Int renaming natAbs_mul->ϡ,abs_eq_natAbs->Ϻ local notation "С"=>by linarith open Model.Reduction renaming dotWithStatus_eq_zero_of_finite->ϭ local notation "Т"=>by rfl open Model.Reduction.Internal renaming dotState_exact_toRat->ϰ local notation "А" =>by omega local notation "Б" =>by decide local notation "В" =>by positivity local notation "Г" =>by norm_num local notation "Д" =>UInt64 local notation "Е" =>UInt32 local postfix:max "а"=>UInt64.toNat local postfix:max "б"=>USize.toNat local postfix:max "в"=>Array.size local postfix:max "г"=>UInt32.toNat local postfix:max "д"=>FloatArray.size local postfix:max "е"=>Nat.toUSize local postfix:max "ж"=>Nat.toUInt64 local postfix:max "з"=>Nat.log2 local postfix:max "и"=>Fin.val local postfix:max "й"=>UInt64.toUInt32 local postfix:max "к"=>Int.natAbs local postfix:max "л"=>Int.toNat local postfix:max "м"=>Int64.toInt local postfix:max "н"=>UInt32.toUInt64 local postfix:max "о"=>UInt32.toUSize open UInt64 renaming reduceToNat->km,ofNat->kV,toNat->k9,toNat_div->ma,toNat_or->mg,toNat_ofNat->mM,toNat_mod->np,toNat_toBitVec->nE,size->nP,toNat_one->pG open FloatLib.Floats.Formats.BinaryInterchange.FloatFormat renaming binary64->kn open USize renaming reduceToNat->kp,size->kM,toNat_add->lx,toNat_one->mi,ofNat_add->ml,size_eq_two_pow->nF open ExactRuntime renaming expOf->kq,idxOf->ks,Word->kt,mantOf->kz,toDyadic_ofUInt32->kK,toWord->kL,signOf->kS,oneW->kT,windowAt->kY,mantOf_lt_24->lc,decodeD_toRat->lu,ofW->lw,fracOf->lA,ConvShape->lJ,Fmt->lM,finishWord->lY,finishWord_of_ne->l5,linearSpec->l9,stableNormDomain->mb,dotOf->mc,sqrtRational->my,expOf_toNat_lt->mC,isFinite_ofUInt32->mR,ofIntDyadic->mY,decodeD->m0,rowMean->m5,dallNZ->nr,poolAt->nw,avgpoolSpec->nX,avgpoolWith->nY,ofUInt32_bits->pe,act->pU open FloatLib.Floats.Formats.BinaryInterchange.Model renaming roundDyadic->kr,ofFloatModel->kx,ofUInt32->kI,toReal->ld,unpackedToReal->lj,roundedMantissa_shift_quotient->ls,roundDyadic_of_representable->lB,roundAt_mono->lC,toReal_add_eq_roundAt->mu,isFinite->mB,toNatBits_lt_two_pow->mG,posMaxFinite->mH,modelSignBit->mI,ofNatBits_toNatBits->mP,roundAt->m9,maximum->na,ofFloatModel_pack->nb,ofFloat32Model->nR,roundRatScaled->nT,add->nZ,fma->n0,div->n5,ofModel->pf,roundAt_zero->pj,pow2->pT open Nat renaming reduceMod->ku,mul_one->lf,pow_lt_pow_right->lh,mul_lt_mul_of_lt_of_le->ll,add_sub_cancel->lE,add_right_comm->lG,testBit_eq_decide_div_mod_eq->lO,toUSize_eq->lP,div_div_eq_div_mul->lQ,le_mul_of_pos_left->lR,succ_le_of_lt->lT,le_div_iff_mul_le->lX,le_log2->md,add_mul_div_left->me,log2_eq_iff->mh,one_le_two_pow->mD,and_one_is_mod->mE,pow_add->mS,log2_lt->mT,one_shiftLeft->mU,reducePow->m7,abs_cast->nt,add_one_mul->nC,mul_div_mul_right->nG,cast_ofNat->nO,one_mul->nQ,div_le_div_left->pa,div_mul_le_self->pb,cast_one->pu,cast_sub->pC,sub_zero->pE open FloatArray renaming emptyWithCapacity->ky,size->kH,uget->nB,set!->pQ open Array renaming ofFn->kA,getElem?_eq_getElem->lq,emptyWithCapacity->lI,ext->l7,replicate->mj,getElem?_ofFn->ms,ext_getElem?->mK,size_extract->mL,size_map->mO,all_eq_true->m6,getElem_push_lt->nI,getElem_push_eq->nJ,getElem_extract->nK,getElem?_set->pp,uset_eq_set->pD,uget->pR open Float.Model.UnpackedFloat renaming unpack->kB,mul->kR,accuracyOfFraction->lH,roundWithAccuracy->m4,unpackExponent->nM,round->n9,isFinite->po,compare->ps,Sign->pv,pack->pK open FloatLib.Numerics renaming binaryRadix->kC,shiftRightJam->kE,Dyadic->kJ,roundQuotientEven->kQ,roundShiftRightEven_shiftRightJam->lK open Finset renaming range->kD,sum_range_succ'->lN,sum_sub_distrib->nu,sum_add_distrib->nx,sum_mul->nV open UInt32 renaming reduceToNat->kF,ofNat->lm,toNat_ofNat'->lr,toNat->mw,toNat_zero->m3,toNat_add->nh,toNat_max->nj,toNat_sub_of_le->nv,toNat_or->ny open FloatLib.Numerics.Dyadic renaming ofScaledInt->kG,signedSignificand->la,toReal->lW,cast_signedSignificand->mZ,ofScaledInt_toRat->ns,add_toRat->pq,mul_toRat->pr,toRat->pF open Float.Model renaming totalExponent->kN,add->pO,mul->pP open FloatLib.Floats.Formats.Flocq renaming bpow->kO open Float.Model.Format renaming binary64->kP,binary32->kW open FloatLib.Numerics.RationalBinary renaming floorLog2->kU,scaleByPowerOfTwo->lU,scaleByPowerOfTwo_ofNat->mf,lessThanPowerOfTwo->mA,atLeastPowerOfTwo->mN open FloatLib.Numerics.FixedWord renaming roundShiftRightEven->kX open List renaming range->kZ,foldl_cons->ly,foldl_append->lS,range_succ->mq,foldl_nil->mJ,range'->pM open Float.Model.UnpackedFloat.ExtendedMantissa renaming shiftRightOne->k0 open BitVec renaming toInt_eq_toNat_cond->li open Float32 renaming ofBits->lk open Int renaming cast_zero->lv,cast_abs->mv,ofNat_eq_natCast->nN,ModEq->n4,log->n6 open Bool renaming false_ne_true->lF,or_eq_true->nA open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState->lL,State->lZ open FloatLib.Floats.ExecFloat.Binary renaming toModel_ofFloat_int64ToFloat->lV,toModel_ofFloat->mQ open FloatLib.Numerics.Radix renaming toReal->l6 open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->mz,finiteDotSlice->nD open MulZeroClass renaming zero_mul->nf open System.Platform renaming numBits->nk open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec->nn open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled->no,toUInt32_ofFields->nU,toUInt32->pd,roundRatScaled->ph open Option renaming some->n7 open Min renaming min->n8 open Decidable renaming not_not->pA open Or renaming inr->pI,inl->pJ open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div->pS local notation "п"=>Nat local notation "р"=>Int local notation "с"=>Array local notation "т"=>Word local notation "у"=>USize local notation "ф"=>Float local notation "х"=>Bool open _root_ renaming zpow_natCast->AA,getElem!_pos->AB,ite_eq_right->AC,ite_eq_left->AD,mul_le_mul_of_nonneg_right->AE,pow_add->AF,zpow_le_zpow_right₀->AG,mul_lt_mul_of_pos_right->AI,zpow_add₀->AJ,two_ne_zero->AK,decide_eq_true_eq->AL,lt_of_lt_of_le->AM,lt_of_le_of_lt->AN,le_rfl->AO,beq_iff_eq->AP,bne_iff_ne->AQ,dite_eq_left->AT,pow_le_pow_right₀->AU,one_div_pow_le_one_div_pow_of_le->AV,abs_of_pos->AW,lt_irrefl->AX,abs_sub_abs_le_abs_sub->AY,le_trans->AZ,abs_nonneg->Aa,zpow_sub₀->Ac,abs_of_nonneg->Ad,abs_mul->Ae,mul_nonneg->Af,abs_add_le->Ag,getElem!_neg->Ah,zero_add->Aj,lt_trans->Am,ite_false->An,ne_eq->Ao,mul_assoc->Ap,decide_eq_true_iff->As,add_zero->Au,abs_sub_comm->Av,apply_ite->Aw,beq_self_eq_true->Ay,abs_le->A0,abs_zero->A3,decide_eq_true->A4,gt_iff_lt->A7,abs_neg->BB,lt_of_mul_lt_mul_right->BC open USize renaming reduceToNat->AH,size->Al,toNat_mul->BJ,ofNat_mul->BK open FloatArray renaming emptyWithCapacity->AR open Array renaming emptyWithCapacity->AS,replicate->Ai,ofFn->Ak,mkEmpty->Az,size_uset->BO,size_set!->BP open Nat renaming log2->Aq,mod_le->Ax,mul_zero->A5,pos_iff_ne_zero->BA,shiftLeft_zero->BE,eq_or_lt_of_le->BF,add_sub_of_le->BL open Model renaming div->Ar,ofFloatModel->A6,toReal_eq->BM open UInt32 renaming ofBitVec->BD open Float32 renaming ofBits->BG open Bool renaming not_eq_true'->BH open ZMod renaming natCast_mod->BI open List renaming range'_succ->BN open Float.Model.Format renaming targetExponent->BQ local notation "Ж"=>4294967296 structure Acc where pos:с п neg:с п special:х negZero:х def Acc.kl(acc:Acc):р:=(limbVal acc.pos.toList:р)-limbVal acc.neg.toList @[inline]def Acc.add(acc:Acc)(m idx:п)(neg:х):Acc:= match acc with | ⟨pos,ng,sp,nz⟩=> if m=0 then⟨pos,ng,sp,nz&&neg⟩ else if neg then⟨pos,addLimbs64 ng mж idx,sp,Н⟩ else⟨addLimbs64 pos mж idx,ng,sp,Н⟩ section open FloatLib.Numerics lemma cl(s:х)(m:п)(e:р)(j:п)(h:j+25<=mз): kr lM ⟨s,kE m j,e+j⟩=kr lM ⟨s,m,e⟩:=by have g:m≠0:=by rintro rfl;simp at h have o:2^mз<=m:=ϲ g;have u:2^(j+1)<=m:=AZ (Η Г А) o;have d:(kE m j)з=mз-j:=log2_shiftRightJam m j u have t:kE m j≠0:= shiftRightJam_ne_zero m j (AZ (Η Г А) u) rw[<-ϻ,<-ϻ];unfold Model.roundDyadicGeneral;simp only[t,g,AP,ite_false,d];have q:((mз-j:п):р)+(e+j)=(mз:р)+e:=А;rw[q];have r:Fmt.fracWidth=23:=rfl;have p:Fmt.minSubnormalExponent=-149:=rfl;have l:Fmt.minNormalExponent=-126:=rfl;rw[r,p,l];split_ifs with h1 h2 h3 h4<;>try omega .rfl .congr 1 have⟨a,v⟩:∃a:п,e- -149=Int.negSucc a:=⟨(-(e+149)-1)л,А⟩ have w:e+j- -149=Int.negSucc (a-j):=А;rw[v,w];dsimp only;rw[(А:a-j+1=(a+1)-j)] exact lK m j (a+1) А .congr 1 rw[(А:mз-j-23=(mз-23)-j)] exact lK m j _ А end lemma ab(n:п)(f:п->Е)(k:п)(d:kf iи)[k]! =f k:=by rw[AB _ k (by simpa using d),Κ] namespace Core def tm(a b:т):р:=sv a*sv b*2^(idxOf a+idxOf b) def af(n:п)(fa fb:п->т):р:=∑k∈Finset.range n,tm (fa k) (fb k) def aI(n:п)(fa fb:п->т):Prop:=∀k,kexpOf (fa k)≠255/\expOf (fb k)≠255 lemma aM(n:п)(d e:п->kt): af (n+1) d e=af n d e+tm (d n) (e n):=by unfold af;rw[Λ] lemma gf(A B:с Е)(i c:п): dsum A B i c=∑k∈kD c,tm A[i+k]! B[i+k]!:=by induction c generalizing i with | zero=>simp[dsum] | succ c d=> rw[dsum,d (i+1),lN,add_comm];exact congrArg₂ _ (ϓ rfl λk _=>by rw[(А:i+1+k=i+(k+1))]) rfl lemma cE(n:п)(d e:п->kt): dsum (kA (n:=n) λi=>d iи) (kA (n:=n) λi=>e iи) 0 n= af n d e:=by rw[gf,af] exact ϓ rfl λk g=>by rw[ϧ]at g;rw[Ι,ab n d k g,ab n e k g] lemma bH(n:п)(o p:п->kt)(u:aI n o p): mc n o p=lY (af n o p) (-298) (decide (n≠0)&& nr (kA (n:=n) λi=>o iи) (kA (n:=n) λi=>p iи) 0 n):=by rw[mc];set A:=kA (n:=n) λi=>o iиwith q set B:=kA (n:=n) λi=>p iиwith t have m:∀k,kkq A[k]!≠255/\kq B[k]!≠255:=λk j=>by rw[q,t,ab n o k j,ab n p k j];exact u k j have x:∀X:с kt,Xв=n->(∀k,kkq X[k]!≠255)-> ∀k (j:k<(X.map (kI (fmt:=lM)))в), mB (X.map (kI (fmt:=lM)))[k]=М:=by intro X G h k j;have w:k(m k j).1 have g:=x B (by simp[t]) λk j=>(m k j).2 have j:∀k,0<=k->k<0+Lв->kq A[k]!≠255/\kq B[k]!≠255:= λk _ F=>m k (by simpa[r,q]using F) have d:nD L R 0 Lв (П) (by simp[l])=(af n o p:ℚ)*2^(-298:ℤ):= (finiteDotSlice_eq A B 0 Lв (by simp[r]) (by simp[r,q,t]) j).trans (by simp[r,q,t,cE]) have y:=ϰ (destination:=lM) L R l e g;rw[dotSpec,Model.dot];by_cases v:af n o p=0 .rw[v,finishWord_zero,ϭ lM L R .nearestEven l e g ((ϴ _).1 (by rw[y,d,v];simp))] have⟨z,D⟩:=dotStateLoop_flags A B ({}:lZ lM) 0 Lв (by simp[r]) (by simp[r,q,t]) j rw[lL];rw[z,D];simp[r,q];rfl .rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero lM L R .nearestEven l e g (by rw[mz L R l];intro h;injection h with h;rw[d]at h;simp at h;exact v h)] exact(l5 _ (af n o p) (-298) _ v (by rw[y,d])).symm lemma bT(n:п)(d e:п->kt)(g:aI n d e) (h:af n d e≠0): mc n d e=lY (af n d e) (-298) Н:=by rw[bH n d e g];simp only[lY,h,An] @[inline]def fV(w:Е):Д:=if(w>>>23)&&&255!=0 then 1 else 0 @[inline]def mW(w:Е):Д:=(w&&&8388607)н|||(fV w<<<23) @[inline]def iW(w:Е):Д:=((w>>>23)&&&255)н-fV w def ac(x:Д):р:=x.toBitVec.toInt lemma gk(w:Е):(w&&&8388607)г<2^23:=by rw[Ν];exact AN ϟ Б lemma ap(w:Е):(mW w)а=kz w:=by have g:=gk w;rw[mW,fV,kz,kq,lA];by_cases d:(w>>>23)&&&255=0 .simp[d] .have e:((w>>>23)&&&255!=0)=М:=by simpa using d simp only[e,d,ite_true,ite_false] rw[mg,Ϫ,show((1:Д)<<<23)а=2^23*1 fromО,Nat.or_comm, <-ϥ g,lf,Υ] lemma ao(w:Е):(iW w)а=ks w:=by rw[iW,fV,ks,kq];have g:=mC w;rw[kq]at g;by_cases e:(w>>>23)&&&255=0 .simp[e] .have d:1<=((w>>>23)&&&255)г:= Nat.one_le_iff_ne_zero.2 λh=>e (Ε.mp (by simpa using h)) simp only[show((w>>>23)&&&255!=0)=true by simpa using e,e,ite_true,ite_false] rw[χ _ _ (ζ.mpr (by rw[Ϫ];simpa using d)), Ϫ] rfl lemma aj(w:Е):kS w=М↔2^31<=wг:=by rw[kS];have e:=w.toNat_lt;have d:(w&&&0x80000000)г=wг&&&2^31:=by rw[Ν];rfl rw[Nat.and_two_pow,lO]at d;rw[AQ,Ao,<-Ε,d];by_cases h:wг/2^31%2=1<;>simp[h]<;>omega lemma fn(w:Е):(w>>>31!=0)=kS w:=by have d:(w>>>31)г=wг/2^31:=by rw[Ρ];simp[β] have:=w.toNat_lt;rw[ϒ,AQ,Ao,<-Ε,d,aj];simp @[inline]def sx(k x:Д):Д:=bif x>>>k==0 then x else x>>>k @[inline]def sr(k x r:Д):Д:=bif x>>>k==0 then r else r+k @[inline]def ak(x0:Д):Д:= let x1:=sx 32 x0 let r1:=sr 32 x0 0 let x2:=sx 16 x1 let r2:=sr 16 x1 r1 let x3:=sx 8 x2 let r3:=sr 8 x2 r2 let x4:=sx 4 x3 let r4:=sr 4 x3 r3 let x5:=sx 2 x4 let r5:=sr 2 x4 r4 sr 1 x5 r5 @[inline]def fY(value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then quotient+1 else if(quotient&&&1)==0 then quotient else quotient+1 @[inline]def db(value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then 1 else 0) @[inline]def aX(value shift:Д):Д:= if shift==0 then value else if shift<64 then db value shift else if shift==64 then(if value>0x8000000000000000 then 1 else 0) else 0 @[inline]def c7(sign:х)(e f:Е):Е:= (if sign then(0x80000000:Е)else 0)|||((e&&&255)<<<23)|||(f&&&8388607) @[inline]def dU(n:Д):Е:= (if n<8388608 then 0 else n-8388608)й @[inline]def aB(sign:х)(product scale:Д):Е:= if product==0 then if sign then 0x80000000 else 0 else let leading:=ak product let position:=leading+scale if position<172 then let fraction:= if scale<149 then aX product (149-scale)else product<<<(scale-149) if fraction==0 then(if sign then 0x80000000 else 0) else if fraction==8388608 then c7 sign 1 0 else c7 sign 0 fractionй else let roundedMantissa:= if leading<23 then product<<<(23-leading)else aX product (leading-23) let carry:=roundedMantissa==16777216 let normalizedPosition:=if carry then position+1 else position if normalizedPosition>425 then(if sign then 0xff800000 else 0x7f800000) else let normalizedMantissa:=if carry then 8388608 else roundedMantissa c7 sign (normalizedPosition-171)й (dU normalizedMantissa) open Model.NativeBinary32 in lemma bo(n k:п)(h:n>>>k≠0):nз=k+(n>>>k)з:=by rw[β]at h⊢;have e:=(lX (ϸ k)).1 (ϲ h);have d:=(Ϲ (ϸ k)).1 (ϙ (n:=n/2^k));rw[mh (by rintro rfl;simp at h)] simp only[Nat.pow_succ,mS]at d⊢;constructor<;>nlinarith lemma dZ(x:Д):xаз<64:=by by_cases h:xа=0 .simp[h] .exact(mT h).mpr x.toNat_lt lemma ct(j r x k:Д)(p:kа<=32)(o:0>>k)а=xа>>>kа:=by rw[ο,γ А] rw[sx,sr];by_cases g:x>>>k=0 .simp only[g,Ay,Bool.cond_true] exact⟨d,by simpa[e,β,Nat.div_eq_zero_iff]using congrArg k9 g⟩ .simp only[show(x>>>k==0)=Н by simpa using g,Bool.cond_false] have q:=bo xа kа λh=>g (ξ.mp (by simpa[e]using h)) have l:=dZ j;refine⟨by rw[η,γ А,e];omega,?_⟩ rw[e,β];exact Ϡ (by rw[<-mS];exact lt_of_lt_of_eq m (by congr 1;omega)) lemma dl(n:п)(h:n<2):nз=0:=by rw[Nat.log2_def,AC А] lemma aC(x:Д):ak x=x.log2:=by apply ξ.mp;rw[show x.log2а=xазfromО];have d:xа<2^(2*(32:Д)а):=x.toNat_lt;have⟨o,e⟩:=ct x 0 x 32 Б Б (П) d have⟨p,g⟩:=ct x _ _ 16 Б Б o (by simpa using e) have⟨q,h⟩:=ct x _ _ 8 Б Б p (by simpa using g) have⟨r,j⟩:=ct x _ _ 4 Б Б q (by simpa using h) have⟨t,l⟩:=ct x _ _ 2 Б Б r (by simpa using j) have⟨u,m⟩:=ct x _ _ 1 Б Б t (by simpa using l) rw[dl (sx 1 (sx 2 (sx 4 (sx 8 (sx 16 (sx 32 x))))))а (by simpa using m)]at u unfold ak;dsimp only;omega lemma gz(v s:Д)(o:s≠0)(h:s<64):db v s=fY v s:=by have g:sа<64:=h have m:(2:п)^sа<0x10000000000000000:= AM (lh Г g) Г have e:(v&&&((1<<simp[ζ, γ g,mU,γ m,θ,mD] have d:((v>>>s)&&&1)а=(v>>>s)а%2:=by simp[Β,mE] have p:=ϊ vа (show 0<2^sа by positivity) have j:((v&&&((1<<>>s)&&&1))а=vа%2^sа+(v>>>s)а%2:=by rw[η,e,d,γ А] have l:((v>>>s)&&&1==0)=decide ((v>>>s)а%2=0):=by rw[<-d,ϒ,AP,As,<-ξ,ϋ] unfold db fY;simp only[A7,μ,j,e,l,AL];split_ifs<;>first | rfl | omega | simp lemma eK(e d:Д): aX e d=kX e dа:=by have o:aX e d=(if d==0 then e else if d<64 then fY e d else if d==64 then(if e>0x8000000000000000 then 1 else 0) else 0):=by rw[aX];split_ifs with a b<;>first | rfl | exact gz _ _ (by simpa using a) b rw[o];rw[fY,kX];have p:=d.toNat_lt;by_cases g:d=0 .subst g;rfl .have j:dа≠0:=λh=>g (ξ.mp (by simpa using h)) simp only[g,AP,j,reduceIte] have m:kV (dа-1)=d-1:=by apply ξ.mp;rw[χ _ _ (by rw[ζ];simp;omega)];simp;omega have l:(d<64)↔dа<64:=μ;simp only[UInt64.ofNat_toNat,m,<-l,show d=64↔dа=64 by rw[<-ξ];rfl] open Model.NativeBinary32 in lemma eD(d:х)(e f:п): c7 d (lm e) (lm f)=mkBits d e f:=by rw[c7,mkBits];cases d<;>rfl lemma bY(x:Д):xй=lm xа:=Т lemma cZ(n:Д):dU n=lm (nа-8388608):=by rw[dU];split<;>rename_i h<;>rw[μ]at h<;>rw[bY] .rw[show nа-8388608=0 by simp at h;omega];rfl .rw[χ _ _ (by rw[ζ];simp at h⊢;omega)];rfl open Model.NativeBinary32 in lemma bD(g:х)(d e:Д): aB g d e=roundProduct g d e:=by unfold aB roundProduct;simp only[aC,eK,cZ,bY];rw[show(1:Е)=lm 1 from rfl,show(0:Е)=lm 0 from rfl];simp only[eD] open Model.NativeBinary32 in lemma bC(w:Е):kL (ofUInt32 w)=w:=by have h:=toUInt32_ofUInt32 w;unfold pd at h;unfold kL;conv_rhs=>rw[<-h] exact Ε.mp (γ (BitVec.isLt _)) open Model.NativeBinary32 in lemma aK(g:х)(m d:Д)(h:dа<=506): aB g m d=kL (kr lM ⟨g,mа,(dа:р)-298⟩):=by rw[bD,roundProduct_eq_roundDyadic _ _ _ h] have e:kr lM ⟨g,mа,(dа:р)-298⟩= ofUInt32 (roundDyadic ⟨g,mа,Int.ofNat dа-298⟩):= (ofUInt32_roundDyadic _).symm rw[e,bC] def ay(hi lo:Д):р:=ac hi*2^64+loа @[inline]def aG(hi lo:Д):Д:=if hi>>>63!=0 then(0:Д)-lo else lo @[inline]def aR(hi lo:Д):Д:= if hi>>>63!=0 then(if lo==0 then(0:Д)-hi else~~~hi)else hi lemma gr(d:Д):(d>>>63!=0)=decide (2^63<=dа):=by have e:(d>>>63)а=dа/2^63:=by rw[ο];simp[β] have:=d.toNat_lt;rw[ϒ,AQ,Ao,<-ξ,e,As];simp lemma bM(d e:Д): ay d e=(dа*2^64+eа:р)-(if 2^63<=dаthen 2^128 else 0):=by rw[ay,ac];rw[li,nE];omega lemma e9(e d:Д): (ay e d)к=(aR e d)а*2^64+(aG e d)а/\ decide (ay e d<0)=(e>>>63!=0):=by have m:=e.toNat_lt;have o:=d.toNat_lt;rw[aR,aG];rw[bM,gr];by_cases j:2^63<=eа .simp only[j,decide_true,К] by_cases g:d=0 .subst g simp only[Ay,ite_true,ϋ];rw[Ζ];simp;omega .have l:dа≠0:=λh=>g (ξ.mp (by simpa using h)) simp only[show(d==0)=false by simpa using g,υ,ite_false] rw[Ζ,UInt64.toNat_not];simp;omega .simp only[j,decide_false,υ,Л];simp;omega @[inline]def ax(hi lo B:Д):Д:= if hi==0&&lo==0 thenЖelse if B>442 thenЖelse let neg:=hi>>>63!=0 let mlo:=aG hi lo let mhi:=aR hi lo if mhi==0 then(aB neg mlo B)н else if mhi>>>32==0 then let q:=(mhi<<<32)+(mlo>>>32) (aB neg (if mlo&&&0xFFFFFFFF==0 then q else q|||1) (B+32))н else(aB neg (if mlo==0 then mhi else mhi|||1) (B+64))н lemma toUInt32_toUInt64(x:Е):xнй=x:=П lemma iS(e d:Д)(h:eа<2^32): (if d&&&0xFFFFFFFF==0 then(e<<<32)+(d>>>32) else((e<<<32)+(d>>>32))|||1)а= kE (eа*2^64+dа) 32:=by have j:=d.toNat_lt have l:((e<<<32)+(d>>>32))а=eа*2^32+dа/2^32:=by simp[η,ν,β];omega have g:(d&&&0xFFFFFFFF)а=dа%2^32:=by rw[Β];exact θ _ 32 unfold kE simp only[(А:(eа*2^64+dа)/2^32=eа*2^32+dа/2^32), show(eа*2^64+dа)%2^32=dа%2^32 by omega, show(d&&&0xFFFFFFFF==0)=decide (dа%2^32=0) by rw[<-g,ϒ,AP,As,<-ξ,ϋ]] split_ifs<;>simp_all[mg] lemma iT(e d:Д): (if d==0 then e else e|||1)а= kE (eа*2^64+dа) 64:=by have l:=d.toNat_lt;have g:(eа*2^64+dа)/2^64=eа:=А;have h:(eа*2^64+dа)%2^64=dа:=А;rw[kE];rw[g,h];by_cases j:dа=0<;>simp[j,mg,<-ξ] lemma eI(s:х)(q B J:Д)(M:п) (e:qа=kE M Jа) (h:Bа<=442) (j:Jа<=64) (d:2^(Jа+25)<=M): aB s q (B+J)=kL (kr lM ⟨s,M,(Bа:р)-298⟩):=by have g:(B+J)а=Bа+Jа:=by rw[η];simp;omega rw[aK _ _ _ А,e,g,<-cl s M _ Jа ((md (BA.1 (AM В d))).2 d)] congr 3;omega lemma dk(d e B:Д)(h:ax d e B<Ж): ay d e≠0/\Bа<=442/\ (ax d e B)й= kL (kr lM (mY (ay d e) ((Bа:р)-298))):=by have⟨m,o⟩:=e9 d e;have z:=e.toNat_lt;have y:=d.toNat_lt;rw[ax]at h⊢;by_cases t:(d==0&&e==0)=М .simp[t]at h .simp only[t,υ,Л]at h⊢ have w:ay d e≠0:=λj=>t (by rw[bM]at j;simp only[Θ,AP,<-ξ,ϋ];split at j<;>omega) by_cases p:B>442 .simp[p]at h .simp only[p,Л]at h⊢ have g:Bа<=442:=by simpa[μ]using p refine⟨w,g,?_⟩;rw[mY];rw[o,m];have r:=ο (aR d e) 32;rw[β]at r;split .rename_i j rw[(by simpa using congrArg k9 (beq_iff_eq.mp j):(aR d e).toNat=0),ϵ,Ι, toUInt32_toUInt64,aK _ _ _ А] .rename_i j have v:(aR d e)а≠0:=λl=>j (by simp[<-ξ,l]) split .rename_i l have q:(aR d e)а<2^32:=by have:=congrArg k9 (beq_iff_eq.mp l);simp at this r;omega rw[toUInt32_toUInt64];exact eI _ _ _ 32 _ (iS _ _ q) g Б (by simp;omega) .rename_i l have u:2^32<=(aR d e)а:=by by_contra x;apply l;simp[<-ξ];omega rw[toUInt32_toUInt64];exact eI _ _ _ 64 _ (iT _ _) g Б (by simp;omega) lemma aZ(n:п)(e g:п->kt)(l m B:Д) (j:aI n e g) (d:af n e g=ay l m*2^Bа) (h:ax l m B<Ж):mc n e g=(ax l m B)й:=by have⟨q,r,p⟩:=dk l m B h;have o:af n e g≠0:=by rw[d];exact mul_ne_zero q В rw[bT n e g j o,p];refine l5 _ _ _ _ o ?_;rw[toRat_ofIntDyadic,d];push_cast;rw[Ac AK,AA];field_simp @[inline]def aw(N:Д):Д:=(N+(0x3FFFFFFFFF:Д)+((N>>>39)&&&1))>>>39 @[inline]def a9(lb v B:Д):Д:= let m:=aG v v let L:=ak m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then((v>>>63)<<<31)+((E<<<23)+aw (m<<<(62-L))) elseЖ @[inline]def bP(hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63)then a9 1 lo B elseЖ if r=Жthen ax hi lo B else r lemma gp(n:х)(e f:Е): (c7 n e f)г=(if n then 2^31 else 0)+eг%2^8*2^23+fг%2^23:=by have h:=ϊ fг (А:0<2^23) have j:=ϊ eг (А:0<2^8) have g:((e&&&255)<<<23)г=2^23*(eг%2^8):=by rw[϶,Ν,show(255:Е)г=2^8-1 fromО, θ,ν,ύ] exact γ (by simp;omega) have d:((e&&&255)<<<23|||(f&&&8388607))г=2^23*(eг%2^8)+fг%2^23:=by rw[ny,g,Ν,show(8388607:Е)г=2^23-1 fromО, θ,<-ϥ h] rw[c7];rw[UInt32.or_assoc];cases n .simp only[υ,Л,UInt32.zero_or,d];omega .simp only[К,ny,d] rw[show(0x80000000:Е)г=2^31*1 fromО,<-ϥ А];omega lemma bK(n:х)(N g:Д)(o:2^62<=Nа)(p:Nа<2^63)(w:110<=gа) (v:gа<363): (aB n N g)г=(if n then 2^31 else 0)+((gа-110)*2^23+(aw N)а)/\ 2^23<=(aw N)а/\(aw N)а<=2^24:=by have l:(N>>>39)а=Nа/2^39:=by simp[β] have j:((N>>>39)&&&1)а=Nа/2^39%2:=by simp[l,mE] have m:(aw N)а=Nа/2^39+if 2^38omega have d:2^23<=Nа/2^39/\Nа/2^39<2^24:=by clear*-o p;omega have e:2^23<=(aw N)а/\(aw N)а<=2^24:=by rw[m];clear*-d;split<;>omega have h:(aX N (62-23))а=(aw N)а:=by have u:(N&&&0x7FFFFFFFFF)а=Nа%2^39:=by rw[Β];exact θ _ 39 rw[m];show(db N 39)а=_;rw[db] simp only[show((1:Д)<<<39)-1=0x7FFFFFFFFF fromО,show(1:Д)<<<(39-1)=0x4000000000 from rfl,A7,μ,η,u,j,l,Aw k9,km] clear*-d;split_ifs<;>omega have q:ak N=62:=by rw[aC];apply ξ.mp;rw[show N.log2а=NазfromО,mh А];simp;omega refine⟨?_,e⟩;rw[aB];have r:(N==0)=Н:=by simp[<-ξ];omega simp only[q,r,show¬62+g<172 by simp[μ];omega,(Б:¬(62:Д)<23), Л,υ] generalize aX N (62-23)=R at h⊢;have t:2^23<=Rа/\Rа<=2^24:=by rw[h];exact e rw[<-h];clear l j m h q o p d e cases n<;>split_ifs<;>simp(disch:=first | omega | (simp[ζ];omega)) only[AP, <-ξ,A7,μ,gp,cZ,ϫ, lr,η,km,γ,χ,К, Л,υ,not_true_eq_false]at*<;>omega lemma ck(n:х)(M σ:Д)(e:Mа≠0)(d:σа<=506): aB n M σ=lY ((if n then-(Mа:р)else Mа)*2^σа) (-298) Н:=by rw[aK _ _ _ d];refine(l5 _ _ _ _ (mul_ne_zero (by split<;>omega) В) ?_).symm cases n<;>simp[pF,la,Ac]<;>field_simp lemma fZ(v:Д):(v>>>63=0/\vа<2^63)\/(v>>>63=1/\2^63<=vа):=by have:=v.toNat_lt;simp only[<-ξ,ο];simp[β];omega lemma dT(p v B:Д)(r:1<=pа)(g:pа<=2^63)(h:a9 p v B≠Ж): pа<=(aG v v)а/\(aG v v)а<2^63/\110<=Bа/\Bа<=424/\ a9 p v B=(aB (v>>>63!=0) (aG v v) B)н:=by unfold a9 at h⊢;dsimp only at h⊢;split at h .rename_i E rw[AD E];have⟨F,q⟩:=E;generalize aG v v=m at F q⊢ have j:pа<=mа/\mа<2^63:=by have:=m.toNat_lt;simp[μ,Ζ]at F;omega have o:mа≠0:=А;have r:(ak m)а=mаз:=by rw[aC];rfl have t:=ϲ o;have g:=@ϙ mа;have A:=(mT o).2 j.2;generalize ak m=L at r q⊢;generalize mаз=l at r t g A have x:(L+B-172)а=l+Bа-172/\172<=l+Bа/\l+Bа<425:=by rw[μ]at q;rw[Ζ,η,r]at q⊢;have:=B.toNat_lt;simp at q⊢;omega refine⟨j.1,j.2,А,А,?_⟩ have D:(62-L)а=62-l:=by simp[Ζ,r];omega have z:mа*2^(62-l)<2^63:= AM (ϐ g В) (by rw[<-AF];exact Η Г А) have w:(m<<<(62-L))а=mа*2^(62-l):=by rw[ψ,D,ν,γ (by omega:62-l<64),γ А] have y:2^62<=mа*2^(62-l):= AZ (le_of_eq (by rw[<-AF];congr 1;omega)) (ι _ t) have u:(B-(62-L))а=Bа-(62-l):=by rw[χ _ _ (by rw[ζ,D];omega),D] have⟨K,M,N⟩:=bK (v>>>63!=0) (m<<<(62-L)) (B-(62-L)) (w▸y) (w▸z) (by rw[u];omega) (by rw[u];omega) rw[<-ξ,Ϫ] have G:aB (v>>>63!=0) m B=aB (v>>>63!=0) (m<<<(62-L)) (B-(62-L)):=by rw[ck _ m B o А,ck _ (m<<<(62-L)) (B-(62-L)) (by rw[w];positivity) (by rw[u];omega),w,u];congr 1 have⟨d,J⟩:∃d,Bа=62-l+d:=⟨Bа-(62-l),А⟩ rw[J,ϳ];push_cast;split<;>ring rw[G,K,u] have H:((v>>>63)<<<31)а=(if(v>>>63!=0)then 2^31 else 0):=by rcases fZ v with⟨e,-⟩ | ⟨e,-⟩<;>rw[e]<;>rfl have I:((L+B-172)<<<23)а=(l+Bа-172)*2^23:=by rw[ψ,x.1];simp only[km,ku,ν];omega rw[η,η,H,I];split<;>omega .exact absurd rfl h lemma eY(d v B:Д)(o:1<=dа)(j:dа<=2^63)(h:a9 d v B≠Ж): a9 d v B=ax ((0:Д)-(v>>>63)) v B:=by obtain⟨m,-,-,p,e⟩:=dT d v B o j h;rw[e];have l:v≠0:=by rintro rfl;exact absurd m (by show¬dа<=0;omega) have g:¬B>442:=by simp[μ];omega symm;unfold ax aR aG;rcases fZ v with⟨e,-⟩ | ⟨e,-⟩ .simp[e,l,g] .rw[e,show(0:Д)-1=0xFFFFFFFFFFFFFFFF from rfl] simp[l,g,show(0xFFFFFFFFFFFFFFFF:Д)>>>63=1 from rfl, show~~~(0xFFFFFFFFFFFFFFFF:Д)=0 from rfl] lemma dR(g d B:Д):bP g d B=ax g d B:=by unfold bP;dsimp only;by_cases e:g=(0:Д)-(d>>>63) .rw[AD e];split .rfl .rename_i h;rw[e];exact eY 1 d B Б Б h .rw[AC e,AD rfl] end Core open Core lemma cm(w:kt):kL (lw w)=w:=by apply Ε.mp;rw[kL,lw,Model.toNatBits,pe,lr];exact γ w.toBitVec.isLt lemma aS(z:Model lM):lw (kL z)=z:=by have h:z.toNatBits<2^32:=mG z;rw[lw,kL,kI,lr,γ h];exact mP z namespace Dense lemma ae{k n:у}(h:ksplit<;>push_cast<;>omega @[inline]def bk(x:Е):Е:=x&&&0x7FFFFFFF lemma aN(x:Е):(bk x)г=xг%2^31:=by rw[bk];rw[Ν];exact θ _ 31 lemma aO(x:Е):(kq x)г=(bk x)г/2^23:=by have:(kq x)г=xг/2^23%2^8:=by unfold kq;rw[Ν,Ρ];simp only[kF,ku,β];exact θ _ 8 rw[this,aN,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] lemma eV(x:Е):kq x=0↔(bk x)г<2^23:=by rw[<-Ε,aO];simp;try omega lemma jG(x:Е):ks x=(bk x)г/2^23-1:=by have:=aO x;rw[ks];split<;>rename_i h .have:=(eV x).mp h;omega .have:=mt (eV x).mpr h;omega lemma aE(x:Е):ks x=(kq x)г-1:=by rw[jG,aO] lemma iH(w:Е):wг/2^23=(kq w)г+256*(wг/2^31):=by rw[aO,aN];have:=w.toNat_lt;omega lemma aU(x:Е):(kq x)г<256:=by rw[aO,aN];omega lemma eZ(w:Е):(w&&&8388607)г=wг%2^23:=by rw[Ν];exact θ _ 23 lemma eN(w:Е):|sv w|<2^24:=by have:=lc w;rw[sv];split<;>simp<;>omega def lz(y n:Д):Д:=if y=0 then n else lz (y>>>1) (n+1) termination_by yа decreasing_by have:yа≠0:=λe=>by simp_all[<-ξ] rw[ο];simp[β];omega abbrev bl(k:п):п:=if k=0 then 0 else kз+1 lemma iP(y:Д):bl yа<=64:=by rw[bl];split;. omega rename_i h;have:=(mT h).mpr y.toNat_lt;omega lemma d6(y:Д):(y>>>1)а=yа/2:=by rw[ο];simp[β] lemma dq(k:п):bl (k/2)=kз:=by rw[bl];rw[Nat.log2_def k];by_cases d:2<=k .rw[AC А,AD d] .rw[AD А,AC d] lemma du(y n:Д)(h:nа+bl yа<=64):(lz y n)а=nа+bl yа:=by rw[lz];by_cases d:y=0 .rw[AD d];subst d;simp .rw[AC d] have g:yа≠0:=λe=>d (ξ.mp (by simpa using e)) have l:bl yа=bl (yа/2)+1:=by rw[dq];simp[bl,g] have j:(n+1)а=nа+1:=by rw[η];simp;omega rw[du (y>>>1) (n+1) (by rw[j,d6];omega),j,d6];omega termination_by yа decreasing_by rw[d6];omega @[inline]def lg(x:Д):Д:=lz (x>>>1) 0 lemma iU(x:Д):lg x=x.log2:=by apply ξ.mp;rw[lg,du _ _ (by have:=iP (x>>>1);simpa using this),d6,dq,ϋ,Ι];rfl @[inline]def cY(lb v B:Д):Д:= let m:=Core.aG v v let L:=lg m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then((v>>>63)<<<31)+((E<<<23)+Core.aw (m<<<(62-L))) elseЖ lemma ep:cY=a9:=by funext d v B;rw[cY,a9,aC,iU] @[inline]def b9(hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63)then cY 1 lo B elseЖ if r=Жthen Core.ax hi lo B else r lemma dj:b9=bP:=by funext d e B;rw[b9,bP,ep] lemma cz{k:у}{a:с Е}(h:k>>1>>>(63-s))+(if l'simp only[km]<;>omega @[specialize]def jy(fa fb:п->т)(n t:п)(B:Д):Д:= if tт)(n:п)(B:Д)(t:п)(pH pL nH nL:Д):Д:= if tsplit<;>push_cast<;>omega lemma fw(d g:п->kt)(n:п)(B:Д)(hn:n<2^18): ∀k t (r u o p:Д),n-t=k->t<=n->aI t d g-> rа*2^64+uа<=t*2^108->oа*2^64+pа<=t*2^108-> af t d g=(((rа*2^64+uа:п):р)-((oа*2^64+pа:п):р))* 2^Bа-> dh d g n B t r u o p<Ж->mc n d g=(dh d g n B t r u o p)й:=by intro k;induction k with | zero=> intro t r u o p hk ht S I G J j;obtain rfl:t=n:=А;rw[dh,AC А]at j⊢;exact aZ _ _ _ _ _ _ S (by rw[J,ki _ _ _ _ А А]) j | succ k ih=> intro t r u o p hk ht S I G J j;have X:t(Nat.lt_succ_iff_lt_or_eq.mp E).elim (S s) λe=>e▸⟨K,M⟩ have v:kz (d t)*kz (g t)<2^48:= (ϔ (lc _) (lc _)).trans_eq Г have U:(mW (d t)*mW (g t))а=kz (d t)*kz (g t):=by rw[Ϗ,ap,ap,γ (v.trans Г)] have D:=aM t d g;have m:t*2^108<=(t+1)*2^108:=ι _ t.le_succ;split at j .rename_i F rw[AD F];have N:kz (d t)*kz (g t)=0:=by rw[<-U,beq_iff_eq.mp F];rfl refine ih (t+1) r u o p y z x (I.trans m) (G.trans m) ?_ j rw[D,J,show tm (d t) (g t)=0 by unfold tm sv;rcases Nat.mul_eq_zero.mp N with h | h<;>simp[h], Au] rename_i F;rw[AC F];obtain⟨hB,O⟩:=hw λh=>F (by simp[h]) have al:=idxOf_le _ K;have as:=idxOf_le _ M have Q:(iW (d t)+iW (g t))а=ks (d t)+ks (g t):=by rw[η,ao,ao,γ А] rw[Q]at hB have E:(iW (d t)+iW (g t)-B)а=ks (d t)+ks (g t)-Bа:=by rw[χ _ _ (by rw[ζ,Q];omega),Q] rw[E]at O have l:(kz (d t)*kz (g t))*2^(ks (d t)+ks (g t)-Bа)<=2^108:= (ϩ v.le (Η Г (by omega:_<=60))).trans_eq Г have W:(2:р)^(ks (d t)+ks (g t))=2^(ks (d t)+ks (g t)-Bа)*2^Bа:=by rw[<-AF];congr 1;omega generalize w:(kz (d t)*kz (g t))*2^(ks (d t)+ks (g t)-Bа)=T at l have A:tm (d t) (g t)=(if kS (d t)==kS (g t)then(T:р)else-T)*2^Bа:=by rw[<-w];unfold tm sv;rw[W];cases kS (d t)<;>cases kS (g t)<;>simp<;>ring have V:=λH L (ah:Hа*2^64+Lа<=t*2^108)=>fu H L _ _ (by rw[E];omega) (by rw[U,E,w];omega) rw[U,E,w]at V;cases hg:(kS (d t)==kS (g t))<;>simp only[hg,ite_true,ite_false,υ]at A j⊢ .have q:=V o p G refine ih (t+1) r u _ _ y z x (I.trans m) (by rw[q];exact Ξ t _▸Nat.add_le_add G l) ?_ j rw[D,J,q,A];push_cast;ring .have q:=V r u I refine ih (t+1) _ _ o p y z x (by rw[q];exact Ξ t _▸Nat.add_le_add I l) (G.trans m) ?_ j rw[D,J,q,A];push_cast;ring @[inline]def f7(n:п)(fa fb:п->т):т:= let r:=if n<262144 then dh fa fb n (jy fa fb n 0 1023) 0 0 0 0 0 elseЖ if r<Жthen rйelse dotOf n fa fb lemma bN(n:п)(d e:п->kt):f7 n d e=mc n d e:=by unfold f7;dsimp only;by_cases g:n<262144 .rw[AD g];split .exact(fw d e n _ А _ 0 0 0 0 0 rfl А (λ_ h=>absurd h А) (П) (П) (by simp[af]) ‹_›).symm .rfl .rw[AC g,AC Б] @[noinline]def aF(n:п)(relu:х)(X W b:@&с т)(xo s j:п):т:= act relu (f7 (n+1) (λt=>if tif trfl lemma gN(x y:ф)(d:fv x)(e:fv y): kx (x+y).toModel=nZ (kx x.toModel) (kx y.toModel):=by change kx (pO x.toModel y.toModel)=_;rw[pO,nb] have h:=Model.add_eq_ofModel_add_of_isFinite (fmt:=kn) Б (kx x.toModel) (kx y.toModel) (by rw[ϑ];exact(fH x).1 d) (by rw[ϑ];exact(fH y).1 e) rw[ϑ,ϑ]at h;exact h.symm lemma pm(E:р)(e:E<=971):(2:ℝ)^E<=ld (mH kn):=by have d:FloatFormat.binary64.maxNormalExponent-Int.ofNat FloatFormat.binary64.fracWidth=971:=Б have h:=Ϭ kn Н 1 E Б (by rw[d];exact e) simp only[υ,ite_false,pu,one_mul]at h;change |(2:ℝ)^E|<=_ at h simpa only[AW (zpow_pos (by norm_num:(0:ℝ)<2) E)]using h open FloatLib.Floats.Formats.Flocq in lemma re(x:ℝ)(E:р)(g:-1021<=E)(e:|x|<(2:ℝ)^E): |Model.roundAt kn x-x|<=(2:ℝ)^(E-53)/2:=by by_cases d:x=0 .subst x;rw[pj];rw[sub_zero,A3];positivity have h:magnitude kC x<=E:=magnitude_le_of_abs_lt_bpow _ x E d e;apply(Model.abs_roundAt_sub_le kn x).trans;apply div_le_div_of_nonneg_right _ Г;change ulp kC (Model.fexpOf kn) x<=(2:ℝ)^(E-53);rw[ulp.of_ne_zero _ _ x d];change (2:ℝ)^(max (magnitude kC x-53) (-1074))<=(2:ℝ)^(E-53);apply AG Г;omega lemma g5(x y:ф)(d:fv x)(e:fv y)(j:|rv x+rv y|<=ld (mH kn)): fv (x+y)/\rv (x+y)=m9 kn (rv x+rv y):=by have h:=gN x y d e have g:=Model.isFinite_add_of_abs_toReal_add_le_posMaxFinite (kx x.toModel) (kx y.toModel) Б d e j refine⟨by rw[fv];rw[h];exact g,?_⟩ rw[rv];rw[h];exact mu _ _ Б d e g lemma eW(x y:ф)(l:fv x)(m:fv y)(E:р)(j:-1021<=E)(d:E<=971) (e:|rv x+rv y|<(2:ℝ)^E): fv (x+y)/\|rv (x+y)-(rv x+rv y)|<=(2:ℝ)^(E-53)/2:=by have⟨g,h⟩:=g5 x y l m (e.le.trans (pm E d));exact⟨g,by rw[h];exact re _ E j e⟩ lemma rx(d:kJ)(l:d.significand<2^53)(g:-1074<=d.exponent) (e:|d.toReal|<=(2:ℝ)^(971:р)): m9 kn d.toReal=d.toReal:=by have⟨h,j⟩:=lB kn Б d d.significand 0 (П) l g (e.trans (pm 971 AO)) rw[<-ό _ Б d h,j] lemma jB(x y:ф)(o:fv x)(p:fv y)(d:kJ)(g:d.toReal=rv x+rv y) (m:d.significand<2^53) (l:-1074<=d.exponent) (e:|d.toReal|<=(2:ℝ)^(971:р)): fv (x+y)/\rv (x+y)=rv x+rv y:=by have⟨h,j⟩:=g5 x y o p (by rw[<-g];exact e.trans (pm 971 AO));exact⟨h,by rw[j,<-g];exact rx d m l e⟩ lemma cG(i:Int64)(e:iмк<2^53):fv i.toFloat/\rv i.toFloat=iм:=by have g:kx i.toFloat.toModel= kr kn (kG iм 0):=by have h:=lV i;rw[mQ]at h;rw[h,<-Model.ofModel_ofInt_eq_intToFloat kn Б];exact Model.ofModel_ofInt_eq_roundDyadic kn Б _ have d:(kG iм 0).toReal=iм:=by rw[<-ϖ,ns];simp have⟨j,l⟩:=lB kn Б (kG iм 0) iмк 0 (by simp[kG]) e (by simp[kG];decide) (by rw[d];refine AZ ?_ (pm 971 AO) calc |(iм:ℝ)|<=(2:ℝ)^(53:п):=by rw[<-mv,Ϻ];exact_mod_cast e.le _=(2:ℝ)^(53:р):=(AA _ _).symm _<=(2:ℝ)^(971:р):=AG Г Г) exact⟨by rw[fv];rw[g];exact j,by rw[rv];rw[g,l,d]⟩ lemma jH(x y:ф):kx (x*y).toModel= pf kn (kR kP x.toModel.unpack y.toModel.unpack):=by change kx (pP x.toModel y.toModel)=_;rw[pP,nb] lemma iG(b:BitVec 64)(s:pv)(m:п)(e:р)(h:0< m) (d:kB kP b=.finite s m e h): 2^52<=m\/e=-1074:=by revert d;rw[kB];dsimp only;split .split<;>intro d<;>cases d .split .split .intro d;cases d .rename_i l _ intro d;injection d with _ _ j;right;rw[<-j,l];decide .intro d;injection d with _ g _ left;rw[<-g,BitVec.toNat_append];exact AZ Б Nat.left_le_or lemma jf(x y:ф)(G:fv x)(H:fv y)(z:|rv x*rv y|<=(2:ℝ)^(971:р)): fv (x*y)/\rv (x*y)=m9 kn (rv x*rv y):=by have t:=(fH x).1 G;have u:=(fH y).1 H;have E:x.toModel.unpack=kB kP x.toModel.toBits.toBitVec:=rfl;have F:y.toModel.unpack=kB kP y.toModel.toBits.toBitVec:=rfl;rw[iA x,iA y]at z⊢;unfold fv rv;rw[jH];generalize x.toModel.unpack=X at t E z⊢;generalize y.toModel.unpack=Y at u F z⊢;cases X<;>cases Y<;>simp only[po,υ]at t u case finite.finite l o g v m p h w=> have A:=iG _ l o g v E.symm;have B:=iG _ m p h w F.symm have r:g+h<=Float.Model.Format.binary64.targetExponent (kN (o*p) (g+h)):=by change g+h<=max ((Aq (o*p):р)+1+(g+h)-53) (-1074);apply le_max_iff.2;rcases A with A | A .left;have:=(md В).2 (AZ A (Nat.le_mul_of_pos_right o w));omega rcases B with B | B .left;have:=(md В).2 (AZ B (lR p v));omega .right;omega let q:kJ:=⟨mI (l*m),o*p,g+h⟩;have D:Model.modelSign (mI (l*m))=l*m:=by cases l<;>cases m<;>rfl have e:pf kn (kR kP (.finite l o g v) (.finite m p h w))=kr kn q:=by rw[kR,Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ r] simp only[kr,show FloatFormat.binary64.isIEEE=МfromО,К,Model.ieeeRoundDyadic, q,D] rfl have d:q.toReal=lj (.finite l o g v)*lj (.finite m p h w):=by cases l<;>cases m<;>simp only[q,lW,la, Model.unpackedToReal_finite,mI] all_goals simp[kO,kC,l6, AJ (by norm_num:(2:ℝ)≠0)]<;>ring have j:=Ϙ kn Б q (by rw[d];exact z.trans (pm 971 AO)) rw[e];exact⟨j,by rw[ό _ Б q j,d]⟩ all_goals simp only[kR,Model.isFinite_ofModel_zero kn Б, Model.toReal_ofModel_zero kn Б,Model.unpackedToReal_zero,nf,mul_zero,and_self, pj] lemma bI(s:х)(m:п)(e:р): (⟨s,m,e⟩:kJ).toReal=(if s then-(m:ℝ)else m)*(2:ℝ)^e:=by rw[lW,mZ];split<;>simp def pw:п->ф | 0=>(1:Int64).toFloat | k+1=>let p:=pw k;p+p lemma fW(k:п)(g:k<=900):fv (pw k)/\rv (pw k)=(2:ℝ)^k:=by induction k with | zero=>have:=cG 1 Б;rw[pw];exact⟨this.1,by rw[this.2];simp⟩ | succ k e=> have⟨f,v⟩:=e А have d:(⟨Н,1,((k+1:п):р)⟩:kJ).toReal=(2:ℝ)^(k+1):=by rw[bI];simp only[υ,ite_false,pu,one_mul];exact AA 2 (k+1) have:=jB (pw k) (pw k) f f _ (by rw[d,v,pow_succ];ring) (show(1:п)<2^53 by norm_num) (А:(-1074:р)<=((k+1:п):р)) (by rw[d,AW В,<-AA];exact AG Г А) rw[pw];exact⟨this.1,by rw[this.2,v,pow_succ];ring⟩ def nm:ф:=(-1:Int64).toFloat def P:З:=⟨Ak (n:=512) λi=>if iи<256 then pw (iи-1)else nm*pw (iи-257)⟩ lemma ec:Pд=512:=by simp[P,kH] lemma iM(i:у)(h:iбif iи<256 then pw (iи-2)else nm*pw (iи-258)⟩ lemma bO:P2д=512:=by simp[P2,kH] lemma gC(i:у)(h:iб>>24)г=wг/2^24:=by rw[Ρ];simp[β] lemma eS(w:Е):(kq w)г=(w<<<1)г/2^24:=by rw[aO,aN,϶];simp only[kF,ku,ν];have:=w.toNat_lt;omega lemma bL(w:Е):(w>>>23)г=wг/2^23:=by rw[Ρ];simp[β] @[inline]def dw(w:Е):ф:= (Core.mW w).toInt64.toFloat*P.uget (w>>>23)о (by rw[ec,ai,bL];have:=w.toNat_lt;omega) lemma aW(z e:р):(mY z e).toReal=(z:ℝ)*(2:ℝ)^e:=by rw[<-ϖ,toRat_ofIntDyadic];push_cast;rfl lemma aA(x y:ф)(o:fv x)(p:fv y)(z e:р)(g:rv x*rv y=(z:ℝ)*(2:ℝ)^e) (m:zк<2^53) (l:-1074<=e) (d:|(z:ℝ)*(2:ℝ)^e|<=(2:ℝ)^(971:р)): fv (x*y)/\rv (x*y)=(z:ℝ)*(2:ℝ)^e:=by have⟨h,j⟩:=jf x y o p (by rw[g];exact d) have:=rx (mY z e) m l (by rw[aW];exact d) rw[aW]at this;exact⟨h,by rw[j,g,this]⟩ lemma bi(w:Е):(sv w)к<2^24:=by have:=lc w;rw[sv];split<;>simp<;>omega lemma bg(a b c:п)(e:a+b<=c)(h:c<=971)(z:р)(g:zк<2^a): |(z:ℝ)*(2:ℝ)^(b:р)|<=(2:ℝ)^(971:р):=by rw[Ae,AW (by positivity:(0:ℝ)<2^(b:р)),AA] have d:|(z:ℝ)|<=2^a:=by rw[<-mv,Ϻ];exact_mod_cast g.le refine(AE d В).trans ?_;rw[<-AF,<-AA];exact AG Г А lemma mV(w:Е):fv (mW w).toInt64.toFloat/\rv (mW w).toInt64.toFloat=(kz w:р):=by have:=lc w have d:(mW w).toInt64м=kz w:=by rw[show(mW w).toInt64м=ac (mW w)fromО,au,ap];split<;>omega rw[<-d];exact cG _ (by rw[d];simp;omega) lemma qV(w:Е)(h):fv (P.uget (w>>>23)о h)/\ ∃σ:р,σ*kz w=sv w/\σк=1/\rv (P.uget (w>>>23)о h)=σ*2^ks w:=by have:=aU w;have:=w.toNat_lt;have d:=aj w;have⟨g,j⟩:=fW (ks w) (by rw[aE];omega) rw[iM,ai,show(w>>>23)г=(kq w)г+256*(wг/2^31) by rw[bL,iH]] rw[sv];split .rw[show(kq w)г+256*(wг/2^31)-1=ks w by rw[aE];omega] exact⟨g,1,by rw[AC (by rw[d];omega)];ring,О,by rw[j];push_cast;ring⟩ .rw[show(kq w)г+256*(wг/2^31)-257=ks w by rw[aE];omega] have e:=cG (-1) Б;rw[(Б:(-1:Int64)м=-1)]at e have:fv (nm*pw (ks w))/\rv (nm*pw (ks w))=((-1:р):ℝ)*2^((ks w:п):р):= aA _ _ e.1 g (-1) (ks w) (by rw[e.2,j,AA]) Б А (bg 1 _ 971 (by rw[aE];omega) AO _ Б) exact⟨this.1,-1,by rw[AD (d.mpr А)];ring,О,by rw[this.2,AA]⟩ lemma cF(w:Е)(o:kq w≠255):fv (dw w)/\rv (dw w)=(sv w:ℝ)*2^ks w:=by rw[dw];have⟨e,g⟩:=mV w;have⟨h,σ,l,j,m⟩:=qV w (by rw[ec,ai,bL];have:=w.toNat_lt;omega) have d:((kz w:р)*σ)к<2^24:=by rw[ϡ,j];simpa using lc w have:=aA _ _ e h _ (ks w) (by rw[g,m,AA];push_cast;ring) (Am d Г) А (bg 24 _ 971 (by rw[aE];have:=aU w;omega) AO _ d) exact⟨this.1,by rw[this.2,AA,mul_comm (kz w:р),l]⟩ lemma dD(x w:Е)(j:kq x≠255)(h:kq w≠255): fv (dw x*dw w)/\rv (dw x*dw w)=(tm x w:ℝ):=by have⟨e,l⟩:=cF x j;have⟨g,m⟩:=cF w h have d:(sv x*sv w)к<2^48:=by rw[ϡ];have:=bi x;have:=bi w calc (sv x)к*(sv w)к<2^24*2^24:=ϔ (bi x) (bi w) _=2^48:=Г have:=aA _ _ e g (sv x*sv w) (ks x+ks w:п) (by rw[l,m,AA,AF];push_cast;ring) (Am d Г) А (bg 48 _ 971 (by rw[aE,aE];have:=aU x;have:=aU w;omega) AO _ d) refine⟨this.1,?_⟩;rw[this.2,tm,AA];push_cast;ring @[inline]def eF(b:Д):Д:=(b>>>52)&&&2047 @[inline]def mF(b:Д):Д:=(b&&&0xfffffffffffff)|||0x10000000000000 lemma jL(u:Д):(u&&&0x8000000000000000!=0)=(u>>>63!=0):=by apply ϒ.mpr;simp only[AQ,Ao,<-ξ];rw[Β,ο];change ¬uа&&&2^63=0↔¬uа>>>63=0;rw[Nat.and_two_pow,β,lO];have d:uа/2^63<2:=by have h:=UInt64.toNat_lt u;omega rw[γ d];by_cases e:uа/2^63=1<;>simp<;>omega lemma g6(v:ф):kx v.toModel=Model.ofFields kn (v.toBits>>>63!=0) (((v.toBits>>>52)&&&2047)а) ((v.toBits&&&0xfffffffffffff)а):=by have d:Model.expField (kx v.toModel)=((v.toBits>>>52)&&&2047)а:=О;have e:Model.fracField (kx v.toModel)=(v.toBits&&&0xfffffffffffff)а:=О have g:Model.signBit (kx v.toModel)=(v.toBits>>>63!=0):=by rw[<-jL];apply ϒ.mpr;simp only[Model.signBit,AQ,Ao];rw[<-UInt64.toBitVec_inj];exact Iff.rfl rw[<-Model.ofFields_signBit_expField_fracField (kx v.toModel),d,e,g] lemma fq(v:ф):((v.toBits>>>52)&&&2047)а<2^11/\(v.toBits&&&0xfffffffffffff)а<2^52:=by rw[Β];exact⟨AN ϟ Б,AN ϟ Б⟩ lemma dP(v:ф)(e:fv v)(g:¬eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)а+2^52, ((eF v.toBits)а:р)-1075⟩:kJ).toReal:=by unfold eF at g⊢;have j:=(fq v).1;have l:=(fq v).2;have d:((v.toBits>>>52)&&&2047)а≠0:=λh=>g (ξ.mp (by simpa using h)) unfold fv at e;unfold rv;rw[g6]at e⊢;rw[BM,Model.toDyadic?_ofFields_of_isFinite _ _ _ _ j l e,AC d] simp only[show FloatFormat.binary64.fracWidth=52 from rfl,show FloatFormat.binary64.exponentBias=1023 from rfl, Model.pow2_eq_two_pow] congr 2<;>(try simp only[nN,nO])<;>ring lemma aS(z:Model lM):lw (kL z)=z:=by have h:z.toNatBits<2^32:=mG z;rw[lw,kL,kI,lr,γ h];exact mP z lemma d8(w:kt)(d:kq w≠255):ld (lw w)=(sv w:ℝ)*(2:ℝ)^((ks w:р)-149):=by rw[lw,BM,kK w d];change (m0 w).toReal=_;rw[<-ϖ,lu];push_cast;rfl lemma ip(w:kt)(j:kq w≠255)(m:w&&&0x7FFFFFFF≠0):ld (lw w)≠0:=by rw[d8 w j];refine mul_ne_zero ?_ (zpow_ne_zero _ Г) have l:kz w≠0:=by rw[kz];split .rename_i d have e:=(eV w).mp d;rw[aN]at e;have g:(bk w)г≠0:=λh=>m (Ε.mp (h.trans UInt32.toNat_zero.symm)) rw[aN]at g;rw[lA];rw[eZ];omega .omega rw[sv];split<;>simp[l] lemma iC(d e g:kJ)(p:d.toReal<=e.toReal)(q:e.toReal<=g.toReal) (E:kL (kr lM d)=kL (kr lM g)) (w:kq (kL (kr lM d))≠255) (F:kL (kr lM d)&&&0x7FFFFFFF≠0) (D:|e.toReal|<=(2:ℝ)^(127:р)): kL (kr lM e)=kL (kr lM d):=by have j:=aS (kr lM d);have m:=aS (kr lM g);rw[<-E]at m;have o:mB (kr lM d)=М:=by rw[<-j,lw,mR];simpa using w have B:mB (kr lM g)=М:=by rw[<-m];rw[j];exact o have u:(2:ℝ)^(127:р)<=ld (mH lM):=by have h:=Ϭ lM Н (2^23) (127-23) Б Б simp only[υ,ite_false,one_mul]at h;change |((2^23:п):ℝ)*(2:ℝ)^((127:р)-23)|<=_ at h have r:((2^23:п):ℝ)*(2:ℝ)^((127:р)-23)=(2:ℝ)^(127:р):=Г;rwa[r,AW В]at h have v:=Ϙ lM Б e (D.trans u);have G:=ό lM Б d o;have A:=ό lM Б e v;have H:=ό lM Б g B;have y:=lC lM p;have z:=lC lM q;have l:kr lM g=kr lM d:=m.symm.trans j;rw[<-G,<-A]at y;rw[<-A,<-H,l]at z;have x:ld (kr lM e)=ld (kr lM d):=le_antisymm z y have t:ld (kr lM d)≠0:=by rw[<-j];exact ip _ w F rw[Model.eq_of_toReal_eq_of_nonzero v o x (by rw[x];exact t)] lemma jp(x:п)(v:x<2^53)(g:x%2^29≠2^28): (aw (kV (x*2^10)))а=(x+2^28)/2^29:=by have d:(kV (x*2^10))а=x*2^10:= Α (by simp only[nP];omega) generalize kV (x*2^10)=N at d;unfold aw simp only[ο,η,Β,d,km,ku, β,mE] have o:x*2^10/2^39=x/2^29:=by rw[show(2:п)^39=2^29*2^10 by norm_num,nG _ _ Г] rw[o] obtain⟨q,r,u,rfl⟩:∃q r,r<2^29/\x=2^29*q+r:= ⟨x/2^29,x%2^29,ϊ _ Г,(ϛ x _).symm⟩ have h:(2^29*q+r)/2^29=q:=А;have j:(2^29*q+r)%2^29=r:=А;rw[h];rw[j]at g;have m:=ϊ q (show 0<2 by norm_num) have t:q<2^24:=А rw[γ (А:(2^29*q+r)*2^10+274877906943<2^64), γ (А:(2^29*q+r)*2^10+274877906943+q%2<2^64), show(2^29*q+r)*2^10+274877906943+q%2=(r*2^10+274877906943+q%2)+2^39*q by ring, show 2^29*q+r+2^28=(r+2^28)+2^29*q by ring, me _ _ Г,me _ _ Г] have e:(r*2^10+274877906943+q%2)/2^39=(r+2^28)/2^29:=by generalize q%2=p at m;rcases Nat.lt_or_gt_of_ne g with l | l .rw[Τ А,Τ А] .rw[ϱ (k:=1) А А,ϱ (k:=1) А А] rw[e] @[inline,irreducible]def an(S:ф)(h:Д):Д:= let b:=S.toBits let f:=b&&&0xfffffffffffff let E:=eF b let d:=h+1075-E let g:=(1:Д)<<>>63)<<<31)+(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-0x255000000 elseЖ lemma jU(h E f:Д)(w:hа<2^63)(u:Eа<2048)(v:fа<2^52) (o:h+1075-E<=26) (p:E-1195<253) (q:((f+268435456)&&&536870911)-(((1:Д)<<<(h+1075-E))+1)< 536870911-(((1:Д)<<<(h+1075-E))+((1:Д)<<<(h+1075-E)))) (r:f-((1:Д)<<<(h+1075-E))< 0x10000000000000-(((1:Д)<<<(h+1075-E))+((1:Д)<<<(h+1075-E)))): Eа<=hа+1075/\hа+1075-Eа<=26/\1195<=Eа/\Eа<=1447/\ 2^(hа+1075-Eа)+1<=(fа+2^28)%2^29/\ (fа+2^28)%2^29+2^(hа+1075-Eа)<2^29/\ 2^(hа+1075-Eа)<=fа/\fа+2^(hа+1075-Eа)<2^52:=by rw[ζ,Ζ,η]at o;rw[μ,Ζ]at p;simp only[km]at o p have g:(h+1075-E)а=hа+1075-Eа:=by rw[Ζ,η];simp only[km];omega generalize y:hа+1075-Eа=k at g⊢;have d:k<=26:=А have t:((1:Д)<<<(h+1075-E))а=2^k:=by have e:(h+1075-E)а%64=k:=by rw[g];omega rw[ψ,e,pG,mU,γ (lh Г А)] have l:2^k<=2^26:=Η Г d;have j:1<=2^k:=mD;have m:∀x:п,x&&&536870911=x%2^29:=λx=>θ x 29 simp only[μ,Ζ,η,Β,t,km, m]at q r generalize 2^k=G at j l q r⊢;clear t g;refine⟨А,d,А,А,А,А,А,А⟩ lemma jV(f G:п)(g:1<=G)(h:f<2^52)(j:G+1<=(f+2^28)%2^29) (l:(f+2^28)%2^29+G<2^29) (d:G<=f) (e:f+G<2^52): (f+2^52-G)%2^29≠2^28/\(f+2^52+G)%2^29≠2^28/\ (f+2^52-G+2^28)/2^29=2^23+(f+2^28)/2^29/\ (f+2^52+G+2^28)/2^29=2^23+(f+2^28)/2^29:=by refine⟨А,А,А,А⟩ lemma gS(b:Д)(m:1195<=(eF b)а): (((b>>>63)<<<31)+(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-0x255000000)а= bа/2^63*2^31+(((eF b)а-1085-110)*2^23+ (2^23+((b&&&0xfffffffffffff)а+2^28)/2^29)):=by have h:=b.toNat_lt have e:(eF b)а=bа/2^52%2^11:=by unfold eF;simp only[Β,ο,km,ku, β];exact θ _ 11 have g:(b&&&0xfffffffffffff)а=bа%2^52:=by rw[Β];exact θ _ 52 have j:(b&&&0x7FFFFFFFFFFFFFFF)а=bа%2^63:=by rw[Β];exact θ _ 63 have l:(b>>>63)а=bа/2^63:=by simp only[ο,km,ku,β] have d:bа%2^63=bа/2^52%2^11*2^52+bа%2^52:=А;have q:bа/2^63<2:=А;rw[e]at m⊢;rw[g];rw[Ζ,η,ψ,l,ο,η,j,d];simp only[km,ku,β,ν];have o:=ϊ (bа/2^52) (show 0<2^11 by norm_num) have p:=ϊ bа (show 0<2^52 by norm_num) generalize bа/2^52%2^11=E at* generalize bа%2^52=f at* generalize bа/2^63=s at* clear e g j l d h;omega lemma ce(S:ф)(hS:fv S)(h:Д)(hh:hа<2^63)(T:р) (L:|rv S-(T:ℝ)|<=(2:ℝ)^(hа:р)) (aL:|(T:ℝ)|<=(2:ℝ)^(425:р)) (hc:an S h<Ж):T≠0/\(an S h)й=lY T (-298) false:=by unfold an at hc⊢;dsimp only at hc⊢;split at hc swap;. exact absurd hc Б rename_i o;rw[AD o];simp only[Θ,AL]at o;obtain⟨⟨⟨c1,c2⟩,c3⟩,c4⟩:=o;have y:(eF S.toBits)а<2048:=(fq S).1;have v:=(fq S).2;obtain⟨d1,d2,e1,e2,X,Y,I,J⟩:=jU h _ _ hh y v c1 c2 c3 c4;clear c1 c2 c3 c4;have D:=gS S.toBits e1;have x:=dP S hS (λh0=>by rw[h0]at e1;simp at e1) have A:(S.toBits>>>63)а=S.toBitsа/2^63:=by simp only[ο,km,ku,β] have O:(if(S.toBits>>>63!=0)=true then(2:п)^31 else 0)=S.toBitsа/2^63*2^31:=by have:=S.toBits.toNat_lt split<;>rename_i Q<;> simp only[AQ,Ao,<-ξ,A,ϋ,pA]at Q<;>omega rw[<-O]at D;clear O A have d:(eF S.toBits-1085)а=(eF S.toBits)а-1085:= χ _ _ (ζ.mpr (by simp only[km];omega)) have j:(eF S.toBits-1085)а<=506:=by rw[d];omega generalize (S.toBits>>>63!=0)=E,eF S.toBits-1085=e5 at D x d j;generalize a2:(eF S.toBits)а=l at d j D x d1 d2 e1 e2 X Y I J y;generalize hG:2^(hа+1075-l)=G at X Y I J;generalize a3:(S.toBits&&&0xfffffffffffff)а=g at D x X Y I J v;have as:1<=G:=by rw[<-hG];exact mD have b1:2^62<=(g+2^52-G)*2^10/\(g+2^52-G)*2^10<2^63/\ 2^62<=(g+2^52+G)*2^10/\(g+2^52+G)*2^10<2^63/\110<=l-1085/\l-1085<363/\ G<=g+2^52/\Gomega have qv:(((S.toBits>>>63)<<<31)+(((S.toBits&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)- 0x255000000)й=R:=by apply Ε.mp;rw[F,ϫ,D,γ hV] have V:kq R≠255:=by unfold kq;intro Q;have p:=congrArg mw Q simp only[Ν,Ρ,F,kF,ku, β]at p rw[θ _ 8]at p;split at p<;>omega have W:R&&&0x7FFFFFFF≠0:=by intro Q;have p:=congrArg mw Q;simp only[Ν,F,kF]at p;rw[θ _ 31]at p;split at p<;>omega rw[qv,hR]at* rw[aK _ _ _ j,U,d]at V W⊢;rw[aK _ _ _ j,aK _ _ _ j,U,n3,d]at r;have a1:1085<=l:=А;have a0:l<=hа+1075:=d1;clear F w3 U n3 qv hV D d j;generalize g+2^52=Mn at x K z V W r⊢;generalize rv S=sr at x L;rw[bI]at x have hU:(2:ℝ)^(hа:р)=(G:ℝ)*(2:ℝ)^((l:р)-1075):=by rw[<-hG,Nat.cast_pow,nO,<-AA,<-AJ AK];congr 1;omega have t:∀m:п,((m*2^10:п):ℝ)*(2:ℝ)^(((l-1085:п):р)-298)= (m:ℝ)*(2:ℝ)^((l:р)-1075)*2^(-298:р):=by intro m have e:(2:ℝ)^(((l-1085:п):р)-298)*(2:ℝ)^(10:р)= (2:ℝ)^((l:р)-1075)*(2:ℝ)^(-298:р):=by rw[<-AJ AK,<-AJ AK, show(((l-1085:п):р)-298)+10=((l:р)-1075)+(-298) by omega] have ah:((m*2^10:п):ℝ)=(m:ℝ)*(2:ℝ)^(10:р):=by push_cast;norm_num rw[ah,Ap,mul_comm ((2:ℝ)^(10:р)),e,<-Ap] have N:|(mY T (-298)).toReal|<=(2:ℝ)^(127:р):=by rw[aW,Ae,AW (by positivity:(0:ℝ)<2^(-298:р))] calc |(T:ℝ)| *2^(-298:р)<=2^(425:р)*2^(-298:р):=by gcongr _=2^(127:р):=by rw[<-AJ Г];norm_num have hu:(0:ℝ)<(2:ℝ)^((l:р)-1075):=В;have q:(0:ℝ)<(2:ℝ)^(-298:р):=В;have H:((Mn-G:п):ℝ)=(Mn:ℝ)-G:=by rw[pC K] have aH:(G:ℝ)simp only[υ,ite_false,ite_true]at x<;>rw[x]at w B<;> have M:T≠0:=λh0=>by rw[h0]at w B;push_cast at w B;nlinarith only[w,B,aH,hu] all_goals refine⟨M,?_⟩;unfold lY;rw[AC M] .refine(iC _ _ _ ?_ ?_ r.symm V W N).symm .rw[aW,bI];simp only[υ,ite_false];rw[t,H];nlinarith only[w,B,q] .rw[aW,bI];simp only[υ,ite_false];rw[t];push_cast;nlinarith only[w,B,q] .rw[<-r]at V W refine((iC _ _ _ ?_ ?_ r V W N).trans r).symm .rw[aW,bI];simp only[ite_true,neg_mul];rw[t];push_cast;nlinarith only[w,B,q] .rw[aW,bI];simp only[ite_true,neg_mul];rw[t,H];nlinarith only[w,B,q] @[specialize]def aq(p:п->ф)(n t:п)(a:ф):ф:= if tр)(e:р)(B:ℝ)(g:∀tintro _;simpa using d | succ t h=> intro j;rw[Λ,<-add_assoc];push_cast;linarith[Ag ((e:ℝ)+∑s∈kD t,(z s:ℝ)) (z t),h А,g t А] structure A8 where a0:ф a1:ф a2:ф a3:ф a4:ф a5:ф a6:ф a7:ф local instance:Inhabited A8:=⟨⟨0,0,0,0,0,0,0,0⟩⟩ @[inline]def A8.f(s:A8):п->ф | 0=>s.a0 | 1=>s.a1 | 2=>s.a2 | 3=>s.a3 | 4=>s.a4 | 5=>s.a5 | 6=>s.a6 | _=>s.a7 structure A9 where a0:ф a1:ф a2:ф a3:ф a4:ф a5:ф a6:ф a7:ф o:т @[inline]def A9.s(R:A9):A8:=⟨R.a0,R.a1,R.a2,R.a3,R.a4,R.a5,R.a6,R.a7⟩ local instance:Inhabited A9:=⟨⟨0,0,0,0,0,0,0,0,0⟩⟩ @[inline]def mX(w:Е):Д:=(((w&&&8388607)<<<1)+16777216)н @[inline]def dX(w:Е):ф:= (mX w).toInt64.toFloat*P2.uget (w>>>23)о (by rw[bO,ai,bL];have:=w.toNat_lt;omega) def nW(w:т):т:=if expOf w=0 then w+16777216 else if expOf w=1 then w+8388608 else w def de(x w:т):р:=Core.tm x (nW w) lemma jk(w:kt):(nW w)г=wг+(2-(kq w)г)*2^23:=by have g:=aO w;have:=aN w;have:=w.toNat_lt;rw[nW];by_cases d:kq w=0 .rw[d]at g;rw[AD d,nh,d];simp only[m3,kF]at g⊢;omega by_cases e:kq w=1 .rw[e]at g;rw[AC d,AD e,nh,e];simp only[UInt32.toNat_one,kF]at g⊢;omega rw[AC d,AC e];have:(kq w)г≠0:=λh=>d (Ε.mp (h.trans UInt32.toNat_zero.symm)) have:(kq w)г≠1:=λh=>e (Ε.mp (h.trans UInt32.toNat_one.symm)) omega lemma eG(w:kt):(kq (nW w))г=max 2 (kq w)г/\kS (nW w)=kS w/\ kz (nW w)=2^23+wг%2^23/\ks (nW w)=max 2 (kq w)г-1:=by have n:=jk w;have e:=aO w;have:=aN w;have g:=aO (nW w);have:=aN (nW w);have:=w.toNat_lt;have d:(kq (nW w))г=max 2 (kq w)г:=А;refine⟨d,ϒ.mpr (by rw[aj,aj];omega),?_,by rw[aE,d]⟩ rw[kz,lA];rw[AC λh=>by rw[h]at d;simp at d;omega,eZ];omega lemma jj(w:kt):nW w=w\/ks w=0/\ks (nW w)=1:=by by_cases h:(kq w)г<=1 .exact .inr ⟨by rw[aE];omega,by rw[(eG w).2.2.2];omega⟩ .exact .inl (Ε.mp (by rw[jk];omega)) lemma ji(w:Е):fv (mX w).toInt64.toFloat/\rv (mX w).toInt64.toFloat=((2*kz (nW w):п):р):=by have d:=(eG w).2.2.1 have e:(mX w)а=2*kz (nW w):=by unfold mX;rw[d,Ϫ,nh,϶,eZ];simp only[kF,ku,ν];omega have:(mX w).toInt64м=((2*kz (nW w):п):р):=by rw[show(mX w).toInt64м=ac (mX w)fromО,au,e];split<;>omega rw[<-this];exact cG _ (by rw[this];simp;omega) lemma jo(w:Е)(h):fv (P2.uget (w>>>23)о h)/\ ∃σ:р,σ*kz (nW w)=sv (nW w)/\σк=1/\rv (P2.uget (w>>>23)о h)=σ*2^(ks (nW w)-1):=by have:=aU w;have:=w.toNat_lt;have d:=aj w;obtain⟨-,m,-,e⟩:=eG w;obtain⟨j,l⟩:=fW (ks (nW w)-1) (by rw[e];omega) rw[gC,ai,show(w>>>23)г=(kq w)г+256*(wг/2^31) by rw[bL,iH]] unfold sv;rw[m];split .rw[show(kq w)г+256*(wг/2^31)-2=ks (nW w)-1 by rw[e];omega] exact⟨j,1,by rw[AC (by rw[d];omega)];ring,rfl,by rw[l];push_cast;ring⟩ .rw[show(kq w)г+256*(wг/2^31)-258=ks (nW w)-1 by rw[e];omega] have g:=cG (-1) Б;rw[(Б:(-1:Int64)м=-1)]at g have:fv (nm*pw (ks (nW w)-1))/\rv (nm*pw (ks (nW w)-1))=((-1:р):ℝ)*2^((ks (nW w)-1:п):р):= aA _ _ g.1 j (-1) (ks (nW w)-1:п) (by rw[g.2,l,AA]) Б А (bg 1 _ 971 (by rw[e];omega) AO _ Б) exact⟨this.1,-1,by rw[AD (d.mpr А)];ring,rfl,by rw[this.2,AA]⟩ lemma jX(w:Е):fv (dX w)/\rv (dX w)=(sv (nW w):ℝ)*2^ks (nW w):=by unfold dX;obtain⟨h,j⟩:=ji w;obtain⟨l,σ,q,p,g⟩:=jo w (by rw[bO,ai,bL];have:=w.toNat_lt;omega) obtain⟨-,-,m,o⟩:=eG w;have:=aU w;obtain⟨k,e⟩:∃k,ks (nW w)=k+1:=⟨ks (nW w)-1,by rw[o];omega⟩ rw[e,lE]at g;have d:(((2*kz (nW w):п):р)*σ)к<2^25:=by rw[ϡ,p,m];simp;omega have:=aA _ _ h l _ k (by rw[j,g,AA];push_cast;ring) (Am d Г) А (bg 25 _ 971 А AO _ d) refine⟨this.1,by rw[this.2,e,<-q,AA];push_cast;ring⟩ lemma uk{i k:у}{S:п}(d:kб<8)(h:iб+8<=S)(e:S<2^32): (i+k)б>>24⟩ termination_by nб-tб decreasing_by have:=ε.mp h;rw[ae h];omega lemma fK(W:с kt)(X:З)(w n:у)(K:Wв<2^32/\Xд<2^32) (G:wб+nб<=Wв) (B r:п) (Q:r<8): ∀m (t i:у) (y:iб+8*(nб-tб)<=Xд) (d g j l p q u v:ф) (o:kt), nб-tб=m->iб=B+8*tб-> (λR:A9=>R.s.f r= aq (λs=>X.data[B+8*s+r]!*dX W[wб+s]!) nб tб (A8.f ⟨d,g,j,l,p,q,u,v⟩ r)/\ (∀s,tб<=s->s(kq W[wб+s]!)г<=R.oг)/\ oг/2^24<=R.oг) (k8 W X w n K G t i y d g j l p q u v o):=by intro m;induction m with | zero=> intro t i y d g j l p q u v o J A;have h:¬tby have:=ε.mp h;omega rw[k8,dif_neg h,aq,AC А];exact⟨О,λs E D=>А,(fk o).ge⟩ | succ m M=> intro t i y d g j l p q u v o J A;have h:tM (t+1) (i+8) y d g j l p q u v o (by rw[ae h];omega) (by rw[ae h,F,A];ring) refine⟨(I _ _ _ _ _ _ _ _ _ _).1.trans ?_,λs E D=>?_,AZ (Ϯ (by rw[nj];omega)) (I _ _ _ _ _ _ _ _ _ _).2.2⟩ .rw[ae h];congr 1 have N:∀(c:у) (H:cб<8) (x:(i+c)б (simp only[A8.f];rw[N _ (by simp only[kp];omega),z];simp only[kp]) .by_cases e:s=tб .subst e;refine AZ ?_ (I _ _ _ _ _ _ _ _ _ _).2.2 rw[eS];apply Ϯ;rw[nj,z];omega .exact(I _ _ _ _ _ _ _ _ _ _).2.1 s (by rw[ae h];omega) D lemma bW(Y:З)(v:ф):(Y.push v)д=Yд+1:=by rcases Y with⟨d⟩;simp[FloatArray.push,kH] lemma js(Y:З)(i:п)(v:ф):(Y.set! i v)д=Yд:=by rcases Y with⟨d⟩;simp[pQ,kH] lemma sg(Y:З)(i q:п)(v:ф)(e:qф)(N:п)(Y:З):З:= if Yдф)(N:п):∀k (Y:З),N-Yд=k->Yд<=N-> (bQ f N Y)д=N/\(∀qq(bQ f N Y).data[q]! =f q:=by intro k;induction k with | zero=> intro Y l j;rw[bQ,AC А];exact⟨А,λq _=>О,λq h d=>absurd d А⟩ | succ k p=> intro Y l j;rw[bQ,AD А];have r:=bW Y (f Yд);have⟨m,g,o⟩:=p (Y.push (f Yд)) А А;refine⟨m,λq e=>?_,λq h d=>?_⟩ .rw[g q А,pg _ _ _ А,AD e] .by_cases e:q=Yд .subst e;rw[g _ А,pg _ _ _ А,AC (AX _)] .exact o q А d lemma jg(v:ф)(h:(eF v.toBits)а<2047):fv v:=by rw[fv];rw[g6];have e:=(fq v).1;have g:=(fq v).2;rw[Model.isFinite_ofFields _ _ _ _ e g];have d:FloatFormat.binary64.expAllOnesNat=2047:=Б;rw[eF]at h;rw[show FloatFormat.binary64.encoding=.ieee fromО,d,AQ,Ao];omega lemma fF(v:ф)(o:fv v):|rv v|<(2:ℝ)^(((eF v.toBits)а:р)-1022):=by by_cases g:eF v.toBits=0 .have d:=(fq v).2 have l:((v.toBits>>>52)&&&2047)а=0:=by rw[eF]at g;rw[g];rfl rw[g];rw[rv];rw[g6,l];rw[ϋ,Nat.cast_zero,zero_sub];generalize (v.toBits&&&0xfffffffffffff)а=m at d⊢;by_cases e:m=0 .rw[e,Model.toReal_eq_zero_of_isZero _ (by rw[Model.isZero_ofFields _ _ _ _ Г Г];rfl)] rw[A3];positivity .rw[Model.toReal_ofFields_subnormal _ _ _ e d,(Б:FloatFormat.binary64.minSubnormalExponent=-1074)] rw[kO,kC,l6];have h:|(if v.toBits>>>63!=0 then(-1:ℝ)else 1)|=1:=by split<;>simp rw[Ae,Ae,h,one_mul,nt];have j:(m:ℝ)<2^(52:п):=by exact_mod_cast d rw[AW В];push_cast;exact(AI j В).trans_eq (by rw[<-AA,<-AJ AK];norm_num) .rw[dP v o g,bI] have d:(v.toBits&&&0xfffffffffffff)а+2^52<2^53:=by have:=(fq v).2;omega generalize (v.toBits&&&0xfffffffffffff)а+2^52=M at d⊢;have h:|(if v.toBits>>>63!=0 then-(M:ℝ)else M)|=M:=by split<;>simp rw[Ae,h,Ad В];have j:(M:ℝ)<2^(53:п):=by exact_mod_cast d exact(AI j В).trans_eq (by rw[<-AA,<-AJ AK];congr 1;push_cast;ring) lemma jr(x y:ф)(r:fv x)(t:fv y)(q:fv (x+y))(E:р)(l:-1074<=E)(u:E<=971) (h:|rv (x+y)|<(2:ℝ)^E):|rv x+rv y|<(2:ℝ)^E:=by have p:=gN x y r t have v:=mu (kx x.toModel) (kx y.toModel) Б r t (by rw[fv]at q;rw[<-p];exact q) have j:rv (x+y)=m9 kn (rv x+rv y):=by unfold rv;rw[p,v] have m:|(2:ℝ)^E|<=(2:ℝ)^(971:р):=by rw[AW В];exact AG Г u have g:=rx ⟨Н,1,E⟩ Г l (by rw[bI];simpa using m) have e:=rx ⟨М,1,E⟩ Г l (by rw[bI];simpa using m) rw[bI]at g e;simp only[υ,ite_false,ite_true,pu,one_mul,neg_mul]at g e;rw[j]at h;have w:=abs_lt.mp h;by_contra o;push Not at o;rcases le_abs'.mp o with d | d .have:=lC kn d;rw[e]at this;linarith .have:=lC kn d;rw[g]at this;linarith @[specialize]def sT(p:п->ф)(n t:п)(a:ф)(m:Д):ф×Д:= if trename_i h<;>rw[μ]at h<;>omega lemma i7(p:п->ф)(n:п):∀k t a m,n-t=k->mа<=(sT p n t a m).2а:=by intro k;induction k with | zero=>intro t a m h;rw[sT,AC А] | succ k d=> intro t a m h;rw[sT,AD А];dsimp only;have:=d (t+1) (a+p t) (if mф)(z:п->р)(u:р)(n K:п)(x:1<=K)(y:K<=1993) (E:∀tt<=n->fv a-> |rv a-((u:ℝ)+∑s∈kD t,(z s:ℝ))|<=t*(2:ℝ)^((K:р)-1076)-> (sT p n t a M).2а<=K-> fv (sT p n t a M).1/\ |rv (sT p n t a M).1-((u:ℝ)+∑s∈kD n,(z s:ℝ))|<=n*(2:ℝ)^((K:р)-1076):=by intro m;induction m with | zero=> intro t a M D F e o g;have:t=n:=А;subst this;rw[sT,AC (AX _)];exact⟨e,o⟩ | succ m G=> intro t a M D F e o g;have d:tlinarith only[H,I,J,L,N] lemma cw(n:п)(d e:п->kt)(g:aI n d e)(S:ф)(m:fv S)(h:Д) (q:hа<2^63) (o:|rv S-(af n d e:ℝ)|<=(2:ℝ)^(hа:р)) (l:|(af n d e:ℝ)|<=(2:ℝ)^(425:р)) (p:an S h<Ж): (an S h)й=mc n d e:=by have⟨j,r⟩:=ce S m h q _ o l p;rw[r,bT n d e g j] def aP(A:с т)(i:у)(m:Е):Е:= if h:i>>23)&&&255 aP A (i+1) (if m mг<=(aP A i m)г/\∀q,iб<=q->q(kq A[q]!)г<=(aP A i m)г:=by intro k;induction k with | zero=> intro i m l;have h:¬iby have:=cz h;omega rw[aP,dif_neg h];exact⟨AO,λq g d=>absurd d А⟩ | succ k v=> intro i m l;have h:irename_i j<;>rw[ώ]at j<;>omega have⟨t,u⟩:=v (i+1) (if m<(A.uget i (cz h)>>>23)&&&255 then(A.uget i (cz h)>>>23)&&&255 else m) (by rw[ae h];omega) rw[r]at t;refine⟨А,λq g d=>?_⟩ by_cases o:q=iб .subst o;rw[<-cx A i (cz h)];rw[kq];omega .exact u q (by rw[ae h];omega) d lemma be(A:с kt)(j:Aвby rw[e]at d;simp at d g;omega,by rw[aE];omega⟩ @[inline]def bj(b:х)(x:ф)(w:Е):ф:= if b then(x*P2.uget (w>>>23)о (by rw[bO,ai,bL];have:=w.toNat_lt;omega))*(mX w).toInt64.toFloat else x*dX w lemma iv(b:х)(x w:Е)(v:kq x≠255)(_:kq w≠255): fv (bj b (dw x) w)/\rv (bj b (dw x) w)=de x w:=by obtain⟨j,m⟩:=cF x v;obtain⟨-,-,q,r⟩:=eG w;have:=aU x;have:=aU w;have:=aE x;unfold bj de tm;split .obtain⟨g,σ,u,t,e⟩:=jo w (by rw[bO,ai,bL];have:=w.toNat_lt;omega) obtain⟨o,p⟩:=ji w;obtain⟨k,l⟩:∃k,ks (nW w)=k+1:=⟨ks (nW w)-1,by rw[r];omega⟩ rw[l,lE]at e;have h:(sv x*σ)к<2^24:=by rw[ϡ,t,lf];exact bi x have d:(sv x*σ*((2*kz (nW w):п):р))к<2^49:=by rw[ϡ];calc _<2^24*2^25:=ϔ h (by rw[q];simp;omega) _=2^49:=Г have a:=aA _ _ j g (sv x*σ) (ks x+k:п) (by rw[m,e,AA,AF];push_cast;ring) (Am h Г) А (bg 24 _ 971 А AO _ h) have b:=aA _ _ a.1 o (sv x*σ*((2*kz (nW w):п):р)) (ks x+k:п) (by rw[a.2,p];push_cast;ring) (Am d Г) А (bg 49 _ 971 А AO _ d) exact⟨b.1,by rw[b.2,l,<-u,AA];push_cast;ring⟩ .obtain⟨g,e⟩:=jX w have d:(sv x*sv (nW w))к<2^48:=by rw[ϡ];exact(ϔ (bi x) (bi _)).trans_eq Г have:=aA _ _ j g (sv x*sv (nW w)) (ks x+ks (nW w):п) (by rw[m,e,AA,AF];push_cast;ring) (Am d Г) А (bg 48 _ 971 А AO _ d) exact⟨this.1,by rw[this.2,AA];push_cast;ring⟩ @[specialize]def bA(k:п->х)(p:п->ф)(n t:п)(a:ф):ф:= if tф)(n:п):∀m t a,n-t=m->aq p n t a=bA (λ_=>Н) p n t a:=by intro m;induction m<;>intro t a h<;>rw[aq,bA] .rw[AC А,AC А] .rename_i m d;rw[AD А,AD А,d _ _ А];rfl lemma bz(w v:kt)(d:kq w≠255)(h:(dw w==0)=true):tm w v=0:=by change ((dw w).toModel.unpack.compare (0:ф).toModel.unpack==n7 .eq)=true at h;rw[show(0:ф).toModel.unpack=.zero .positive by rfl]at h have e:=(cF w d).2;rw[iA]at e revert h e;rcases(dw w).toModel.unpack with(_ | _) | _ | s | ⟨_ | _,_,_,_⟩<;> simp(config:={contextual:=М}) [ps,lj,Model.unpackedToDyadic?,tm] lemma dF(k:п->х)(p:п->ф)(z:п->р)(d:р)(P L n:п) (Q:∀tz t=0) (V:∀tt<=n->fv a-> |rv a-((d:ℝ)+∑s∈kD t,(z s:ℝ))|<=t*((2:ℝ)^(P+L)*2^(-54:р))-> fv (bA k p n t a)/\ |rv (bA k p n t a)-((d:ℝ)+∑s∈kD n,(z s:ℝ))|<=n*((2:ℝ)^(P+L)*2^(-54:р)):=by have K:=cs n z d _ V v have X:(2:ℝ)^L*2^L*2^(-54:р)<=1:=by rw[<-AF,<-AA,<-AJ AK];exact zpow_le_one_of_nonpos₀ Г (by push_cast;omega) have q:(0:ℝ)<2^(-54:р):=В;have u:(0:ℝ)<2^P:=В;have r:(0:ℝ)<2^L:=В;intro m;induction m with | zero=> intro t a O S o j;have:t=n:=А;subst this;rw[bA,AC (AX _)];exact⟨o,j⟩ | succ m y=> intro t a O S o j;have h:tф)(h:oб+8?_⟩ simp(disch:=(try simp only[js,AH]);omega) only[s8,sg,am,kp] split_ifs<;>first | rfl | omega | (congr 1;omega) lemma gD(X:с kt)(k:п):X.getD k 0=X[k]!:=by rw[Array.getD];split<;>rename_i h .rw[AB X k h];rfl .rw[Ah X k h];rfl @[inline]def xr(X:с т)(q st:у)(r:п):ф:=dw (X.getD (q+rе*st)б 0) def bx(X:с т)(st s:у):п->у->у->З->З | 0,_,_,Y=>Y | k+1,q,o,Y=>bx X st s k (q+s) (o+8) (s8 Y o (xr X q st 0) (xr X q st 1) (xr X q st 2) (xr X q st 3) (xr X q st 4) (xr X q st 5) (xr X q st 6) (xr X q st 7)) lemma gc(X:с kt)(d s:у):∀k (q o:у) (Y:З), qб+k*sб+8*dб+oб+8*koб+8*k<=Yд-> (bx X d s k q o Y)д=Yд/\(∀pr<8->(bx X d s k q o Y).data[oб+8*τ+r]! =dw X[qб+τ*sб+r*dб]!:=by intro k;induction k with | zero=>intro q o Y _ _;exact⟨О,λ_ _=>О,λτ r h=>absurd h А⟩ | succ k y=> intro q o Y w A;rw[Ξ]at w;have:=ς;have:=nF;obtain⟨t,u⟩:=gA Y o (xr X q d) А;have v:(q+s)б=qб+sб:=am А;have j:(o+8)б=oб+8:=by rw[am (by simp;omega)];simp obtain⟨x,g,l⟩:=y (q+s) (o+8) _ А (by rw[t];omega) rw[j]at g;rw[v,j]at l;refine⟨by rw[bx,x,t],λp B=>by rw[bx,g p А,u p А,AC А],λτ r z e=>?_⟩ rw[bx];rcases τ with _ | τ .have m:(rе*d)б=r*dб:=by rw[BJ,aa А,γ (by have:=ι dб e.le;omega)] rw[g _ А,u _ А,AD А,(А:oб+8*0+r-oб=r),xr, am (by rw[m];have:=ι dб e.le;omega),m,gD];simp .have:=l τ r А e;rw[show oб+8*(τ+1)+r=oб+8+8*τ+r by ring, show qб+(τ+1)*sб+r*dб=qб+sб+τ*sб+r*dб by ring,this] def ZT:с З:=Ak (n:=10) λk=>⟨Ai (2^(kи+7)) 0⟩ def zT(n:п):З:= let k:=Aq (8*n)+1-7 if k<10 then ZT[k]!else⟨Ai (8*n) 0⟩ lemma jz(n:п):8*n<=(zT n)д/\((zT n)д=8*n\/(zT n)д<=2^16):=by unfold zT;dsimp only;split .rw[AB ZT _ (by simp[ZT];omega)] simp only[ZT,Κ,kH,Array.size_replicate] exact⟨(ϙ (n:=8*n)).le.trans (Η Б А), .inr (Η Б А)⟩ .simp[kH] def dJ(X:с т)(st s n b:п)(Z:З):З:= if b+n*s+s+8*st+8*n<=4294967295 then bx X stе sе n bе 0 Z else⟨Ak (n:=8*n) λp=>dw X[b+pи/8*s+pи%8*st]!⟩ lemma fy(X:с kt)(d s n b:п)(Z:FloatArray)(l:8*n<=Zд): 8*n<=(dJ X d s n b Z)д/\((dJ X d s n b Z)д=Zд\/(dJ X d s n b Z)д=8*n)/\ ∀τ r,τr<8->(dJ X d s n b Z).data[8*τ+r]! =dw X[b+τ*s+r*d]!:=by unfold dJ;split .have:=ς have:=gc X dе sе n bе 0 Z simp only[aa (by omega:dby rw[<-j τ r e g,Ι]⟩ .refine⟨by simp[kH],.inr (by simp[kH]),λτ r e g=>?_⟩ rw[AB _ _ (by simp;omega),Κ] dsimp only;rw[(А:(8*τ+r)/8=τ),(А:(8*τ+r)%8=r)] def bZ(t:х)(X:с т)(R n rb:п)(Z:З):З:= dJ X (if t then 1 else n) (if t then R else 1) n (if t then 8*rb else 8*rb*n) Z @[inline]def yR(XT:с З)(n ow:п)(W b:с т)(hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв) (rb o:п):A9:= let xt:=XT[rb]! let bp:=dw oneW*dw b[o]! if h:8*n<=xtд/\xtд<=4294967295/\oф)(bpf:Unit->ф)(aD:Unit->т):т:= let r:=sT p n 0 (bpf ()) 0 let c:=if 1<=r.2а/\r.2а<=1993/\1076<=r.2а+L then an r.1 (r.2а+L-1076)жelseЖ if c<Жthen act relu cйelse aD () @[inline]def tf(relu:х)(S:ф)(hh:Д)(sl:Unit->т):т:= let c:=an S hh if c<Жthen act relu cйelse sl () @[inline]def tw(relu:х)(S:ф)(hh:Д)(L n:п)(p:п->ф)(bpf:Unit->ф) (aD:Unit->т):т:=tf relu S hh λ_=>tS relu L n p bpf aD @[inline]def hG(e:т)(ix ib L:п):х×Д:= let p:=48+ix+max (eг-1) 55 (decide (e<255/\p+L<=425),(max p ib+2*L-54)ж) @[inline]def tG(relu:х)(S:ф)(e:т)(ix ib L:п)(sl fb:Unit->т):т:= let h:=hG e ix ib L if h.1 then tf relu S h.2 sl else fb () lemma jw(g:х)(n:п)(d e:п->kt)(p:п->ф)(h:Unit->ф)(u:Д)(P L:п) (B:Unit->kt) (K:∀sE s M.le) (E n AO) n AO).trans ?_ have y:(n:ℝ)+1<=2^L:=by have:((n+1:п):ℝ)<=((2^L:п):ℝ):=by exact_mod_cast(by omega:n+1<=2^L) push_cast at this;exact this calc ((n:ℝ)+1)*2^P<=2^L*2^P:=by gcongr _=(2:ℝ)^(((L+P:п):р)):=by rw[AA,AF] _<=(2:ℝ)^(425:р):=AG Г А unfold tw tf tS;dsimp only;split .rename_i w;rw[cw _ _ _ j _ I u (by rw[x];omega) v o w] generalize A:sT p n 0 (h ()) 0=r;split .rename_i t split .rename_i w have⟨m,l⟩:=iB _ _ (tm (d n) (e n)) n r.2а t.1 t.2.1 K n 0 _ 0 rfl А q.1 (by simp[q.2]) (by rw[A]) rw[A,<-F]at l;rw[A]at m have H:((r.2а+L-1076)ж)а=r.2а+L-1076:=by rw[Ϥ,Α (by rw[nP];omega)] refine congrArg _ (cw _ _ _ j _ m _ (by rw[H];omega) (l.trans ?_) o w) rw[H] calc (n:ℝ)*(2:ℝ)^((r.2а:р)-1076)<=2^L*(2:ℝ)^((r.2а:р)-1076):=by gcongr _=(2:ℝ)^(((r.2а+L-1076:п):р)):=by rw[<-AA,<-AJ AK];exact congrArg (λz:р=>(2:ℝ)^z) А .exact G .rw[AC Б];exact G lemma f5(g:х)(n j:п)(l:п->kt)(W b:с kt)(p q:п->ф)(e:kt) (t E L F:п) (B:Unit->kt) (k:п->х) (A:∀s(kq W[j*n+s]!)г<=eг) (hf:eг<255->∀s(kq W[j*n+s]!)г<255) (K:kq b[j]!≠255/\ks b[j]!<=F) (al:174+F<=E) (H:n+2<=2^L) (r:L<=27) (S:E+L<=425) (hp:∀sfv (p s)/\rv (p s)=tm (l s) W[j*n+s]!) (hq:∀sfv (q s)/\rv (q s)=de (l s) W[j*n+s]!) (z:∀s∀v,tm (l s) v=0) (U:B ()=pU g (mc (n+1) (λs=>if sif stS g L n p (λ_=>dw kT*dw b[j]!) B) B= pU g (mc (n+1) (λs=>if sif sks W[j*n+s]!<=G):=λs d=>by cases m:k s .have:=hw s d m;exact⟨λh=>by rw[h]at this;simp at this;omega,λ_=>by rw[aE];omega⟩ .exact⟨λh=>by have:=hf he s d m;simp[h]at this,λh=>absurd h Б⟩ generalize ah:max (48+t+G) E=P have y:(P+2*L-54)жа=P+2*L-54:=by rw[Ϥ,Α (by rw[nP];omega)] have J:∀s≤n,|(tm ((λs=>if sif sby dsimp only;split .rename_i w cases m:k s .exact(dc _ _ t G (A s w).2 ((o s w).2 m)).trans (AU Г А) .rw[z s w m,lv,A3];positivity .exact(dc _ _ 126 F Б K.2).trans (AU Г А) have u:=dD kT b[j]! Б K.1 have⟨V,O⟩:=dF k q (λs=>de (l s) W[j*n+s]!) (tm kT b[j]!) P L n (λs d=>hq s d (o s d).1) (λs d h=>z s d h _) (λs d=>by rw[de];rcases jj W[j*n+s]!with h | ⟨-,h⟩ exacts[by rw[h];simpa[d]using J s d.le, (dc _ _ t 1 (A s d).2 h.le).trans (AU Г А)]) (by simpa using J n AO) H r А n 0 _ rfl (Ϣ _) u.1 (by simp[u.2]) have X:∀c≤1,(2:ℝ)^(48+t+c)<=2^P*2^(-54:р):=λc _=>by rw[<-AA,<-AA,<-AJ AK];exact AG Г А have Q:=cs n (λs=>tm (l s) W[j*n+s]!-de (l s) W[j*n+s]!) 0 (2^P*2^(-54:р)+2^P*2^(-54:р)) (λs d=>by rw[de];rcases jj W[j*n+s]!with h | ⟨Y,D⟩ .rw[h,sub_self,lv,A3];positivity .push_cast exact(abs_sub _ _).trans (add_le_add ((dc _ _ t 0 (A s d).2 Y.le).trans (X 0 А)) ((dc _ _ t 1 (A s d).2 D.le).trans (X 1 AO)))) (by rw[lv,A3];positivity) n AO simp only[lv,Aj,Int.cast_sub,nu]at Q have hT:(af (n+1) (λs=>if sif sby simp[ϧ.mp d] have hA:(n:ℝ)+2<=2^L:=by exact_mod_cast H have x:(0:ℝ)<2^P*2^(-54:р):=В;have I:(0:ℝ)<2^L:=В refine jw g n _ _ p _ _ P L B (λs d=>by simpa[d]using hp s d (o s d).1) (by simpa using u) (λs _=>by split;exacts[⟨(A s ‹_›).1,(o s ‹_›).1⟩,⟨Б,K.1⟩]) J H r А y U _ V ?_ rw[hT,y,(А:((P+2*L-54:п):р)=(P:р)+L+L+(-54)),AJ AK, AJ AK,AJ AK] rw[AF]at O;simp only[AA];have D:=sub_nonneg.mpr hA rw[A0]at O Q⊢;constructor<;> nlinarith[Af D (mul_pos x I).le,Af D x.le,Af (Nat.cast_nonneg n:(0:ℝ)<=n) x.le] .exact U lemma gg(X:З)(i:п):X.get! i=X.data[i]!:=by rcases X with⟨d⟩;rfl lemma f8(v:ф)(r:п):A8.f ⟨v,v,v,v,v,v,v,v⟩ r=v:=by unfold A8.f;split<;>rfl @[inline]def us(a:с т)(ok:х)(p:п)(w:Unit->т):с т:= if h:ok/\pп->с т->с т)(u v:п)(a:с т): с т:= if uxb.get! (8*s+c)*dw W[o+s]!) (λ_=>dw oneW*dw b[j]!) λ_=>aF n relu X W b xo st j @[inline]def pN(t:х)(R C n:п)(relu:х)(X W b:с т)(XT:с З)(h:х×Д) (L:п) (a:с т) (i j:п) (S:ф):с т:= us a (decide (iif h.1 then tf relu S h.2 (λ_=>sN n relu X W b XT L i j (if t then i else i*n) (if t then R else 1)) else aF n relu X W b (if t then i else i*n) (if t then R else 1) j @[inline]def b8(t:х)(R n ow:п)(relu:х)(X W b:с т)(ix ib L:п) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв) (XT:с З) (rb o:п) (a:с т):с т:= let s:=yR XT n ow W b hs hW rb o let h:=hG s.o ix ib L let i:=8*rb pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L a i o s.s.a0) (i+1) o s.s.a1) (i+2) o s.s.a2) (i+3) o s.s.a3) (i+4) o s.s.a4) (i+5) o s.s.a5) (i+6) o s.s.a6) (i+7) o s.s.a7 @[inline]def c0(t:х)(R n ow:п)(relu:х)(X W b:с т)(ix ib L:п) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв):с т:= let Z:=zT n l2 ((R+7)/8) ow (b8 t R n ow relu X W b ix ib L hs hW (Ak (n:=(R+7)/8) λrb=> bZ t X R n rbи Z)) 0 0 (Ai (R*ow) 0) lemma kg(a:с kt)(d:х)(p:п)(w:Unit->kt):(us a d p w)в=aв:=by rw[us];split<;>simp lemma kf(a:с kt)(d:х)(p:п)(w:Unit->kt)(q:п): (us a d p w)[q]?=if d=М/\q=p/\qkt)(g:с kt):∀(e:List (х×п×(Unit->kt))) (a:с kt) (S:п->Prop),(∀x∈e,x.1=М->x.2.1x.2.2 ()=F x.2.1)->aв=gв-> (∀q,(a[q]?=g[q]?\/a[q]?=n7 (F q))/\(S q->qa[q]?=n7 (F q)))-> (e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)в=gв/\∀q, ((e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=g[q]?\/ (e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=n7 (F q))/\ ((S q\/∃x∈e,x.1=М/\q=x.2.1)->q (e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=n7 (F q)):=by intro e;induction e with | nil=> intro a S _ l m;simp only[mJ];exact⟨l,λq=>⟨(m q).1,λd j=>(m q).2 (d.resolve_right (by simp)) j⟩⟩ | cons x e v=> intro a S t l m;rw[ly] have:=v (us a x.1 x.2.1 x.2.2) (λq=>S q\/x.1=М/\q=x.2.1) (λy o=>t y (List.mem_cons_of_mem _ o)) (by rw[kg,l]) λq=>by rw[kf];split .rename_i h;obtain⟨r,rfl,u⟩:=h;rw[t x List.mem_cons_self r (l▸u)] exact⟨pI rfl,λ_ _=>О⟩ .rename_i h;refine⟨(m q).1,λd j=>?_⟩ rcases d with d | ⟨r,rfl⟩ .exact(m q).2 d j .exact absurd ⟨r,О,l▸j⟩ h refine⟨this.1,λq=>⟨(this.2 q).1,λd j=>(this.2 q).2 ?_ j⟩⟩ rcases d with d | ⟨y,o,p⟩ .exact pJ (pJ d) .rcases List.mem_cons.mp o with rfl | o .exact pJ (pI p) .exact pI ⟨y,o,p⟩ lemma ka(F:п->kt)(a:с kt)(g:п->х×п×(Unit->kt)) (l:∀r,r<8->(g r).1=М->(g r).2.1(g r).2.2 ()=F (g r).2.1): (((kZ 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)в=aв/\∀q, ((((kZ 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=a[q]?\/ (((kZ 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=n7 (F q))/\ ((∃r,r<8/\(g r).1=true/\q=(g r).2.1)->q (((kZ 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=n7 (F q)):=by have:=j9 F a ((kZ 8).map g) a (λ_=>False) (by simp only[List.mem_map,List.mem_range];rintro x ⟨r,d,rfl⟩;exact l r d) rfl λq=>⟨pJ rfl,False.elim⟩ exact⟨this.1,λq=>⟨(this.2 q).1,λ⟨r,d,e,h⟩ j=> (this.2 q).2 (pI ⟨g r,List.mem_map.mpr ⟨r,List.mem_range.mpr d,О⟩,e,h⟩) j⟩⟩ lemma gn(U V:п)(f:п->п->с kt->с kt)(F:п->kt)(C:п->п->п->Prop) (B:∀u v a,uv(f u v a)в=aв/\∀q,((f u v a)[q]?=a[q]?\/ (f u v a)[q]?=n7 (F q))/\(C u v q->q(f u v a)[q]?=n7 (F q))) (u v:п) (a:с kt): (∀q,(∃g h,gqa[q]?=n7 (F q))-> (l2 U V f u v a)в=aв/\ ∀q,(∃g h,gq(l2 U V f u v a)[q]?=n7 (F q):=by induction u,v,a using l2.induct U V f with | case1 u v a l r w=> intro p;rw[l2,AD l,AD r];obtain⟨y,x⟩:=B u v a l r obtain⟨D,E⟩:=w λq ⟨g,h,m,o,z,j⟩ d=>by rw[y]at d;by_cases e:g=u/\h=v .obtain⟨rfl,rfl⟩:=e;exact(x q).2 j d .rcases(x q).1 with t | t .rw[t];exact p q ⟨g,h,m,o,А,j⟩ d .exact t exact⟨D.trans y,λq A d=>E q A А⟩ | case2 u v a l r w=> intro p;rw[l2,AD l,AC r];exact w λq ⟨g,h,m,o,z,j⟩ d=>p q ⟨g,h,m,o,А,j⟩ d | case3 u v a l=> intro p;rw[l2,AC l];exact⟨rfl,λq ⟨g,h,m,o,j⟩ d=>p q ⟨g,h,m,o,А,j⟩ d⟩ lemma g9(U V N:п)(f:п->п->с kt->с kt)(F:п->kt)(C:п->п->п->Prop) (m:∀u v a,uv(f u v a)в=aв/\∀q,((f u v a)[q]?=a[q]?\/ (f u v a)[q]?=n7 (F q))/\(C u v q->q(f u v a)[q]?=n7 (F q))) (l:∀q,q∃u v,uF qи:=by have⟨e,g⟩:=gn U V f F C m 0 0 (mj N 0) λq ⟨r,t,_,_,h,_⟩ _=>А apply mK;intro q;by_cases d:qkt) (y:∀i j,ijtG d ((yR l n h W b p m (i/8) j).s.f (i%8)) (yR l n h W b p m (i/8) j).o v u L (λ_=>sN n d X W b l L i j (if t then i else i*n) (if t then R else 1)) (λ_=>aF n d X W b (if t then i else i*n) (if t then R else 1) j)= F (if t then j*R+i else i*h+j)) (g o:п) (z:oq (b8 t R n h d X W b v u L p m l g o a)[q]?=n7 (F q)):=by have e:b8 t R n h d X W b v u L p m l g o a=((kZ 8).map λr=> (decide (8*g+rtG d ((yR l n h W b p m g o).s.f r) (yR l n h W b p m g o).o v u L (λ_=> sN n d X W b l L (8*g+r) o (if t then 8*g+r else(8*g+r)*n) (if t then R else 1)) λ_=>aF n d X W b (if t then 8*g+r else(8*g+r)*n) (if t then R else 1) o)).foldl (λa x=>us a x.1 x.2.1 x.2.2) a:=О rw[e];refine ka F a _ λr A w _=>?_ have:=y (8*g+r) o (by simpa using w) z rwa[(А:(8*g+r)/8=g),(А:(8*g+r)%8=r)]at this lemma go(t:х)(R n e:п)(d:х)(X W b:с kt)(r p L:п) (m:Wв<2^32/\8*n<2^32) (l:e*n<=Wв) (N:п) (z:R*e=N) (F:п->kt) (B:∀i j,ij tG d ((yR (kA (n:=(R+7)/8) λg=>bZ t X R n gи (zT n)) n e W b m l (i/8) j).s.f (i%8)) (yR (kA (n:=(R+7)/8) λg=>bZ t X R n gи (zT n)) n e W b m l (i/8) j).o r p L (λ_=>sN n d X W b (kA (n:=(R+7)/8) λg=> bZ t X R n gи (zT n)) L i j (if t then i else i*n) (if t then R else 1)) (λ_=>aF n d X W b (if t then i else i*n) (if t then R else 1) j)= F (if t then j*R+i else i*e+j)): c0 t R n e d X W b r p L m l=kA (n:=N) λq=>F qи:=by subst z;unfold c0;dsimp only;refine g9 _ _ _ _ F _ (λu v a _ D=>gb t R n e d X W b r p L m l _ F B u v D a) λq o=>?_ have E:0by subst h;simp at o have A:0by subst h;simp at o cases t .have y:=ϛ q e have w:q/epU e (mc (n+1) (λs=>if sif spU e (mc (n+1) (λs=>if sif s?_ have w:∀a c m:п,c< m->(a*m+c)/m=a/\(a*m+c)%m=c:=λa c m h=> ⟨by rw[Υ,Ο _ _ А,Τ h,Ι], by rw[Υ,Μ,γ h]⟩ have o:=fy X (if t then 1 else n) (if t then d else 1) n (if t then 8*(i/8)else 8*(i/8)*n) _ (jz n).1 have x:8*n<=(bZ t X d n (i/8) (zT n))д/\(bZ t X d n (i/8) (zT n))д<=4294967295/\∀srw[h]<;>rcases(jz n).2 with h | h<;>omega,λs g=>?_⟩ rw[o.2.2 s (i%8) g (ϊ _ Б)];congr 2;cases t<;>simp only[↓reduceIte,υ] .calc 8*(i/8)*n+s*1+i%8*n=(8*(i/8)+i%8)*n+s:=Р _=i*n+s:=by rw[ϛ] .omega have B:(kA (n:=(d+7)/8) λO=>bZ t X d n Oи (zT n))[i/8]! =bZ t X d n (i/8) (zT n):=by rw[AB _ _ (by simp;omega),Κ] unfold sN yR;simp only[gg,B];rw[AT ⟨x.1,x.2.1,y⟩];have I:nеб=n:=aa (by have:=ς;omega) have u:(j*n)еб=j*n:=by have K:(j+1)*n<=l*n:=ι n y;rw[Ξ]at K;exact aa (by have:=ς;omega) rw[(fK _ _ _ _ _ _ 0 (i%8) А _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (П)).1] simp only[f8,I,u,Ϩ,Ι];rw[dG _ _ _ _ _ rfl] refine(f5 e n j (λs=>X[if t then i+s*d else i*n+s]!) W b _ _ _ z v L A _ (λ_=>Н) (λ_ _=>F _) (λs g _=>?_) (λ_ _ _ h=>absurd h lF) (N j) D M p r (λs g E=>?_) (λs g E=>?_) (λ_ _ h=>absurd h lF) (by cases t<;>simp only[aF,bN,lf,↓reduceIte,υ])).trans ?_ .calc(kq W[j*n+s]!)г=(kq W[(j*n)еб+s]!)г:=by rw[u] _<=_:=(fK _ _ _ _ _ _ 0 0 А _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (П)).2.1 s (П) (by rw[I];exact g) .rw[x.2.2 s g];exact dD _ _ (F _).1 E .rw[x.2.2 s g];exact iv Н _ _ (F _).1 E .cases t<;>simp only[(w _ _ _ H).1,(w _ _ _ H).2,(w _ _ _ y).1,(w _ _ _ y).2,↓reduceIte, υ] lemma uo{d n t k:у}{S:п}(m:kб<8)(h:dб+8*nб<=S)(o:S<2^32) (p:tбт->т)(h:т->т)(W:с т)(ou n t:у)(hs:Wв<2^32) (hW:ouб+8*nб<=Wв) (ht:tбkt->kt)(h:kt->kt)(P:kt->п)(q:∀x y,P x<=P (g x y)/\P y<=P (g x y)) (W:с kt) (d n t:у) (l:Wв<2^32) (j:dб+8*nб<=Wв) (m:tбjx (c:=c) l j m u v have L:∀{z x y},P z<=P x->P z<=P (g x y):=λe=>e.trans (q _ _).1 have R:∀{z x y},P z<=P y->P z<=P (g x y):=λe=>e.trans (q _ _).2 rw[m8];simp(disch:=simp) only[p,kp];exact⟨L AO,λr w=>by interval_cases r<;>solve_by_elim only[L,R,AO]⟩ def kw(W:с т)(X:З)(ou n:у)(hs:Wв<2^32) (hW:ouб+8*nб<=Wв) (hX:nб<=Xд) (z:ф) (t:у) (a0 a1 a2 a3 a4 a5 a6 a7:ф) (o f:т):A9:= if h:t>>24⟩ termination_by nб-tб decreasing_by all_goals (rw[ae h];omega) lemma dW(W:с kt)(X:З)(d n:у)(K:Wв<2^32) (H:dб+8*nб<=Wв) (S:nб<=Xд) (z:ф) (r:п) (Q:r<8):∀m (t:у) (g j l p q u v A:ф) (o f:kt),nб-tб=m-> (λR:A9=>R.s.f r= bA (λs=>X.data[s]! ==z) (λs=>bj (r%2==1) X.data[s]! W[dб+nб*r+s]!) nб tб (A8.f ⟨g,j,l,p,q,u,v,A⟩ r)/\ (∀s,tб<=s->s(X.data[s]! ==z)=Н->(kq W[dб+nб*r+s]!)г<= R.oг)/\ oг/2^24<=R.oг/\ (R.oг<255->(kq f)г<255/\∀s,tб<=s->s(X.data[s]! ==z)=true-> (kq W[dб+nб*r+s]!)г<255)) (kw W X d n K H S z t g j l p q u v A o f):=by intro m;induction m with | zero=> intro t g j l p q u v A o f V;have h:¬tby have:=ε.mp h;omega rw[kw,dif_neg h,bA,AC (show¬tбА,by split<;>simp only[fk,kF]<;>omega,λG=>⟨?_,λs N B _=>А⟩⟩ split at G;exacts[ώ.mp ‹_›,by simp only[fk,kF]at G<;>omega] | succ m ih=> intro t g j l p q u v A o f V;have h:tjx (c:=c) K H L D U have M:=dv max (.<<<1) mw (λx y=>by rw[nj];omega) W d n t K H L o have F:=dv (. ||| ·) bk (λw=>(kq w)г) eo W d n t K H L f have I:=λg j l p q u v A o f=>ih (t+1) g j l p q u v A o f (by rw[ae h];omega) rw[kw,AT h,bA,AD L];dsimp only by_cases D:(X.data[tб]! ==z)=М<;>simp only[Y,D,υ,↓reduceIte]<;> refine⟨(I _ _ _ _ _ _ _ _ _ _).1.trans ?_,λs N B E=>if e:s=tбthen(by subst e;first | exact Bool.noConfusion (D.symm.trans E) | exact AZ (by rw[eS];exact Ϯ (M.2 r Q)) (I _ _ _ _ _ _ _ _ _ _).2.2.1) else(I _ _ _ _ _ _ _ _ _ _).2.1 s (by rw[ae h];omega) B E, AZ (Ϯ (by first | exact M.1 | exact AO)) (I _ _ _ _ _ _ _ _ _ _).2.2.1,λG=>?_⟩<;> try(have J:=(I _ _ _ _ _ _ _ _ _ _).2.2.2 G;exact⟨by first | exact AN F.1 J.1 | exact J.1,λs N B E=>if e:s=tбthen(by subst e;first | exact absurd E D | exact AN ((eA _).ge.trans (F.2 r Q)) J.1)else J.2 s (by rw[ae h];omega) B E⟩) all_goals rw[ae h] congr 1 interval_cases r<;> (simp only[A8.f,ku,Nat.reduceBEq];rw[O _ _ (by simp only[kp];omega)];simp only[kp]) lemma jZ(g:п->ф)(r:п)(d:r<8): A8.f ⟨g 0,g 1,g 2,g 3,g 4,g 5,g 6,g 7⟩ r=g r:=by interval_cases r<;>rfl @[inline]def yW(xr:З)(n ow:п)(W b:с т)(hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв) (g:п):A9:= let bq:=λr=>dw oneW*dw b[min (8*g) (ow-8)+r]! if h:xrд=n/\8<=ow then kw W xr (min (8*g) (ow-8)*n)е nе hs.1 (by have h1:(min (8*g) (ow-8)+8)*n<=ow*n:=ι n А;have:=ς;rw[Ϝ]at h1;rw[aa А,aa А];omega) (by have:=ς;rw[aa А];omega) 0 0 (bq 0) (bq 1) (bq 2) (bq 3) (bq 4) (bq 5) (bq 6) (bq 7) 0 0 else default @[specialize]def c8{α:Type}(f:п->α)(N:п)(a:с α):с α:= if aвα)(N:п): c8 f N (lI N)=kA (n:=N) λq=>f qи:=by suffices h:∀k (a:с α),N-aв=k->aв<=N->(∀i (h:i c8 f N a=kA (n:=N) λq=>f qиfrom h _ _ rfl (П) (λi h=>by simp at h) intro k;induction k with | zero=> intro a j g d;rw[c8,AC А];exact l7 (by simp;omega) λi e _=>by rw[d i e,Κ] | succ k l=> intro a j g d;rw[c8,AD А];refine l _ (by simp;omega) (by simp;omega) λi h=>?_ rw[Array.getElem_push];split .exact d i ‹_› .simp only[ϝ]at h;rw[(А:i=aв)] def dY(n ow:п)(relu:х)(X W b:с т)(ix ib L:п) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв):с т:= if 8<=ow then let xr:=bQ (λk=>dw X[k]!) n (AR n) let Y:=c8 (λg=>yW xr n ow W b hs hW g) ((ow+7)/8) (AS ((ow+7)/8)) c8 (λj=> let y:=Y[j/8]! let o:=j*n tG relu (y.s.f (j-min (8*(j/8)) (ow-8))) y.o ix ib L (λ_=>tS relu L n (λs=>xr.get! s*dw W[o+s]!) (λ_=>dw oneW*dw b[j]!) λ_=>aF n relu X W b (j/ow*n) 1 j) λ_=>aF n relu X W b (j/ow*n) 1 j) (1*ow) (AS (1*ow)) else linearSpec 1 n ow relu X W b lemma dr(n e:п)(l:х)(X W b:с kt)(O G L:п) (E:Wв<2^32/\8*n<2^32) (B:e*n<=Wв) (H:п) (F:∀q:п,kq X[q]!≠255/\ks X[q]!<=O) (hb:∀q:п,kq b[q]!≠255/\ks b[q]!<=H) (M:174+H<=G) (Y:n+2<=2^L) (x:L<=27) (z:G+L<=425): dY n e l X W b O G L E B=l9 1 n e l X W b:=by unfold dY;split;rename_i V;swap;rfl;unfold l9 linearWith;dsimp only;simp only[gg,io];congr 1;funext q;have hq:=q.isLt;have al:0by subst h;simp at hq have hi:qи/e=0:=Τ А;have Q:qиdw X[k]!) n _ (ky n) rfl (by simp[ky,kH]) have m:∀sdw X[k]!) n (ky n)).data[s]! =dw X[0*n+s]!:=by intro s d;rw[p.2.2 _ (by simp[ky,kH]) d];simp generalize bQ (λk=>dw X[k]!) n (ky n)=v at p m⊢ have hY:(kA (n:=(e+7)/8) λg=> yW v n e W b E B gи)[j/8]! = yW v n e W b E B (j/8):=by rw[AB _ _ (by simp;omega),Κ] rw[hY] have hS:∀y,yW v n e W b E B (j/8)=y->y.s.f (j-n8 (8*(j/8)) (e-8))= bA (λs=>v.data[s]! ==0) (λs=>bj ((j-n8 (8*(j/8)) (e-8))%2==1) v.data[s]! W[j*n+s]!) n 0 (dw kT*dw b[j]!)/\(∀s(kq W[j*n+s]!)г<= y.oг)/\ (y.oг<255->∀s(kq W[j*n+s]!)г<255):=by rintro _ rfl;rw[yW];dsimp only;rw[AT ⟨p.1,V⟩];have D:nеб=n:=aa (by have:=ς;omega) set c:=n8 (8*(j/8)) (e-8)with ah;have u:j-c<8/\c+(j-c)=j/\c+8<=e:=А have A:(c*n)еб=c*n:=by have U:(c+8)*n<=e*n:=ι n u.2.2;rw[Ϝ]at U;exact aa (by have:=ς;omega) have S:c*n+n*(j-c)=j*n:=by rw[ύ n,<-Ϝ,u.2.1] have w:∀s,(kq W[j*n+s]!)г=(kq W[(c*n)еб+nеб*(j-c)+s]!)г:= λs=>by rw[D,A,S] refine⟨?_,λs d N=>?_,λhR s d N=>?_⟩ .rw[(dW _ _ _ _ _ _ _ _ (j-c) u.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).1, jZ (λr=>dw kT*dw b[c+r]!) _ u.1,D,A,Ϩ,u.2.1,S] .exact(w s).trans_le ((dW _ _ _ _ _ _ _ _ (j-c) u.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.1 s (П) (by rw[D];exact d) N) .exact(w s).trans_lt (((dW _ _ _ _ _ _ _ _ (j-c) u.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.2.2 hR).2 s (П) (by rw[D];exact d) N) have⟨I,J,K⟩:=hS _ rfl;rw[I] refine f5 l n j (λt=>X[0*n+t]!) W b _ _ _ O G L H _ _ (λs _=>F _) J K (hb j) M Y x z (λs d w=>?_) (λs d w=>?_) (λs d h=>?_) (by unfold aF;simp only[bN,lf]) .rw[m s d];exact dD _ _ (F _).1 w .rw[m s d];exact iv _ _ _ (F _).1 w .rw[m s d]at h;exact λ_=>bz _ _ (F _).1 h lemma dN(n:п)(e d:п->kt):∀c i,i+c=n-> nr (kA (n:=n+1) λt=>if tиif tиe tи) (kA (n:=n) λt=>d tи) i c:=by intro c;induction c with | zero=> intro i h;obtain rfl:i=n:=А simp only[nr,ab (i+1) (λt=>if t< i then d t else kT) i А, ab (i+1) (λt=>if t< i then e t else 0x80000000) i А,AX,An];rfl | succ c g=> intro i h rw[nr,g (i+1) А,nr,ab (n+1) (λt=>if tif tkt)(h:0if tif tby split;exacts[(g t ‹_›).symm,Б],bH _ _ _ g,aM, dN n d e n 0 А] congr 1 .simp only[AX,An,(Б:tm kT 0x80000000=0),Au] exact ϓ rfl λt j=>by simp only[AD (ϧ.mp j)];unfold tm;rw[Υ];ring .simp[h.ne'] end F lemma kj(X:с kt)(a n t:п)(d:tProp)(d:∀q:п,P X[q]!)(q:п): P (X.extract a e)[q]!:=by by_cases h:q<(X.extract a e)в .have g:a+qif tif tkq w≠255/\ks w<=(F.aP X 0 0)г-1) (F.be X А l)) (F.be b А m) AO q p o .exact F.cp _ _ _ _ _ _ _ _ _ _ _ _ _ (F.be X А l) (F.be b А m) AO q p o .rfl def e8(batch m k n:п)(A B:с т):с т:= let ea:=F.aP A 0 0 let eb:=F.aP B 0 0 let L:=Aq (k+1)+1 if h:batch=1/\0by by_cases h:q< m<;>simp[h]<;>decide) AO (by have:=@ϙ (k+1);omega) r p).trans ?_ rw[gemmSpec,gemmWith];refine l7 (by simp[ύ]) λq e _=>?_ rw[Ϟ]at e;have g:q/n< m:=Ϡ e;have w:(mj m (0x80000000:kt))[q/n]! =0x80000000:=by simp[g] simp only[Κ,↓reduceIte,w,Τ (show q< m*n by rwa[ύ]), γ g,ϵ,Ι] exact(F.dz k (λt=>A[q/n*k+t]!) (λt=>B[q%n+t*n]!) u λt _=>⟨(v _).1,(j _).1⟩).trans (by simp only[Υ (q%n)]) .rfl end Dense namespace Bn namespace NativeAdd lemma eh(x:Float32):nR x.toModel=lw x.toBits:=by exact congrArg Model.mk (pe x.toBits).symm lemma iX(x:Float32):kL (nR x.toModel)=x.toBits:=by change lm x.toBitsг=x.toBits;exact UInt32.ofNat_toNat lemma bJ(a:kt)(h:kq a≠255): (lk a).toBits=a/\(lk a).isFinite=М:=by have j:nM (spec:=kW) a.toBitVec≠-1#8:=by intro g;apply h;apply Ε.mp;have e:=congrArg BitVec.toNat g have l:(kq a)г=(a.toBitVec.extractLsb' 23 8).toNat:=by rw[kq,Ν,Ρ,BitVec.extractLsb'_toNat];change (aг>>>23)&&&(2^8-1)=(aг>>>23)%2^8;exact θ _ _ rw[l];exact e have e:(lk a).toBits=a:=by change BD (pK kW (kB kW a.toBitVec))=a rw[Model.pack_unpack_eq,AC (λd=>j d.1)] refine⟨e,?_⟩ change (kB kW (lk a).toBits.toBitVec).isFinite=М rw[e];simp only[kB,j,ite_false];split<;>(try split)<;>rfl @[noinline]def eX(relu:х)(a b:т):т:= act relu (toWord (Model.add (ofW a) (ofW b))) @[inline]def add(relu:х)(a b:т):т:= if expOf a !=255&&expOf b !=255 then act relu (BG a+BG b).toBits else eX relu a b lemma gO(d:х)(a b:kt): add d a b=pU d (kL (nZ (lw a) (lw b))):=by rw[add];split .rename_i h simp only[Θ,AQ]at h;have g:=bJ a h.1;have j:=bJ b h.2 have e:=ExecFloat.Binary.toModel_ofFloat32_add_of_isFinite (lk a) (lk b) g.2 j.2 simp only[ExecFloat.Binary.toModel_ofFloat32,eh]at e;rw[g.1,j.1]at e;rw[<-e,<-eh,iX] .rfl end NativeAdd lemma er(x s t:kt)(p:kq x≠255)(m:kq s≠255)(o:kq t≠255) (V:р) (l:V=sv x*sv s*2^(ks x+ks s)+sv t*2^(ks t+149)) (j:V≠0): kL (n0 (lw x) (lw s) (lw t))=lY V (-298) Н:=by have g:=kK x p;have d:=kK s m;have e:=kK t o;rw[Model.Proof.fma_eq_spec];rw[Model.Spec.fma] have h:Model.chooseNaN3 (lw x) (lw s) (lw t)=none:= (Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨Χ g, Χ d,Χ e⟩ simp only[lw]at h⊢;rw[h] simp only[ϣ g,ϣ d, ϣ e,Bool.or_false,υ,ite_false,g,d,e] refine(l5 _ V _ _ j ?_).symm;rw[Model.addDyadic,pq];erw[pr (m0 x) (m0 s)];rw[lu,lu,lu,l];push_cast;simp[Ac];field_simp;ring @[noinline]def jh(relu:х)(w s t:т):т:=act relu (toWord (Model.fma (ofW w) (ofW s) (ofW t))) @[inline]def ad(rb:Е)(a b:т)(_slow:Unit->т):т:=NativeAdd.add (rb !=0) a b @[specialize]def cB(stop:у)(f:(i:у)->iбт->т)(i:у) (x:с т) (h:stopб<=xв):с т:= if hi:iiбkt->kt)(F:п->kt->kt) (p:∀i e w,f i e w=F iб w) (i:у) (x:с kt) (h:dб<=xв): (cB d f i x h)в=xв/\ ∀j,(cB d f i x h)[j]?=if iб<=j/\j have o:iб?_⟩ rw[l,Dense.ae e,pD,pp o];by_cases m:iб=j .subst m rw[AC А,AD rfl,AD А,lq o,Option.map_some,p];rfl .rw[AC m];split_ifs<;>first | rfl | omega .next i x h e=>exact⟨О,λj=>by rw[AC (by rw[ε]at e;omega)]⟩ @[inline]def wX(x:Д):Д:=((x>>>34)<<<31)+((x&&&0x3FFFFFFFF)-0x255000000) lemma xw(A X:п)(Q:A<2^64)(M:X=(A+268435457)%2^64/2^29) (H:X=(A+268435453)%2^64/2^29) (J:(2^64-1195+X/2^23%2^11)%2^64<253) (K:X%2^23≠0): 1195<=A/2^52%2^11/\A/2^52%2^11<=1447/\2<=(A%2^52+2^28)%2^29/\ (A%2^52+2^28)%2^29+2<=2^29/\1<=A%2^52/\A%2^52+2<=2^52/\ X/2^34=A/2^63/\X%2^34=A/2^52%2^11*2^23+(A%2^52+2^28)/2^29:=by have m:1195<=X/2^23%2^11/\X/2^23%2^11<=1447:=А;clear J obtain⟨s,E,f,rfl,U,D,S⟩:∃s E f,A=s*2^63+E*2^52+f/\s<2/\E<2^11/\f<2^52:= ⟨A/2^63,A/2^52%2^11,A%2^52,А,А,А,А⟩ rw[(А:(s*2^63+E*2^52+f)/2^63=s),show(s*2^63+E*2^52+f)/2^52%2^11=E by omega,(А:(s*2^63+E*2^52+f)%2^52=f)] have u:s*2^63+E*2^52+f+268435457<2^64:=by by_contra L;have:X=0:=А;omega rw[γ u]at M;rw[γ (Nat.lt_of_le_of_lt (Nat.add_le_add_left (by norm_num:268435453<=268435457) _) u)]at H obtain⟨q,r,rfl,w⟩:∃q r,f=q*2^29+r/\r<2^29:=⟨f/2^29,f%2^29,А,А⟩ have l:X=s*2^34+E*2^23+q+(r+268435457)/2^29:=А;have I:X=s*2^34+E*2^23+q+(r+268435453)/2^29:=А;have v:r+1≠2^28/\r≠2^28/\r≠2^28+1:=А;rw[(А:(r+268435457)/2^29=(r+2^28)/2^29)]at l have F:(r+2^28)/2^29<=1:=А;generalize g:(r+2^28)/2^29=d at l F;have p:X=(q+d)+(E+s*2^11)*2^23:=by rw[l];ring have e:X%2^23=(q+d)%2^23:=by rw[p,Μ] have j:q+d<2^23:=by by_contra L;rw[(А:q+d=2^23),Nat.mod_self]at e exact K e rw[γ j]at e have x:X/2^23%2^11=E:=by rw[p,Ο _ _ Г,Τ j,Ι,Μ, γ D] rw[x]at m have t:E*2^23+(q+d)<2^34:= calc E*2^23+(q+d)r<2^28:=by intro G;rw[G]at g;clear*-g w;omega clear*-N O F w;omega have z:1<=q*2^29+r:=by rcases Nat.eq_zero_or_pos r with h | h .subst h;rw[show d=0 by rw[<-g];norm_num]at e have:2^29<=q*2^29:=lR _ А;clear*-this;omega .clear*-h;omega rw[y,Ο _ _ Г,Μ,g,o,Ο _ _ Г,Τ t,Μ,γ t] refine⟨m.1,m.2,by clear*-w v;omega,by clear*-w v;omega,z,B,А,by ring⟩ lemma wq(d E Q:п)(m:d<2)(g:1195<=E)(h:E<=1447)(j:Q<=2^23): d*2^31+((E-1085-110)*2^23+(2^23+Q))= (d*2^31%2^64+(2^64-10015997952+(E*2^23+Q))%2^64)%2^64:=by obtain⟨e,rfl⟩:∃e,E=1195+e:=⟨E-1195,А⟩ rw[(А:1195+e-1085-110=e)] have l:e*2^23<=252*2^23:=ι _ А;rcases(by omega:d=0\/d=1)with rfl | rfl<;>omega lemma cX(S:ф) (h:((S.toBits+268435457)>>>29==(S.toBits+268435453)>>>29&& (((S.toBits+268435457)>>>29>>>23)&&&2047)-1195<253&& (S.toBits+268435457)>>>29&&&8388607!=0)=true): Dense.F.an S (Dense.F.eF S.toBits-1075)=wX ((S.toBits+268435457)>>>29)/\ 1195<=(Dense.F.eF S.toBits)а/\(Dense.F.eF S.toBits)а<=1447/\ (Dense.F.an S (Dense.F.eF S.toBits-1075))йг%2^31<255*2^23/\ Dense.F.an S (Dense.F.eF S.toBits-1075)<Ж:=by unfold Dense.F.an simp only[UInt64.sub_add_cancel,UInt64.sub_self,(Б:((1:Д)<<<(0:Д))=1), show decide ((0:Д)<=26)=true by decide,Bool.true_and] generalize S.toBits=a at h⊢;generalize D:(a+268435457)>>>29=x at h⊢;have g:∀x:п,x&&&2047=x%2^11:=λx=>θ x 11 have r:∀x:п,x&&&8388607=x%2^23:=λx=>θ x 23 have t:∀x:п,x&&&536870911=x%2^29:=λx=>θ x 29 have u:∀x:п,x&&&17179869183=x%2^34:=λx=>θ x 34 have e:xа=(aа+268435457)%2^64/2^29:=by rw[<-D];simp only[ο,η,km,ku, β] simp only[Θ,AP,AL,AQ,Ao]at h;obtain⟨⟨z,l⟩,A⟩:=h;have d:=congrArg k9 z;rw[e]at d simp only[ο,η,km,ku, β]at d rw[μ,Ζ]at l simp only[Β,ο,km,ku, β,g]at l have m:xа%2^23≠0:=λy=>A (ξ.mp (by rw[Β];simp only[km,r];exact y)) obtain⟨E,G,J,K,L,M,H,I⟩:=xw aа xа a.toNat_lt e (e.trans d) l m have o:(Dense.F.eF a)а=aа/2^52%2^11:=by unfold Dense.F.eF;simp only[Β,ο,km,ku,β,g] have w:(a&&&0xfffffffffffff)а=aа%2^52:=by rw[Β];exact θ _ 52 have B:(Dense.F.eF a-1195<253&&((a&&&0xfffffffffffff)+268435456&&&536870911)-(1+1)< 536870911-(1+1)&&(a&&&0xfffffffffffff)-1<0x10000000000000-(1+1))=true:=by simp only[Θ,AL,UInt64.reduceAdd,UInt64.reduceSub] simp only[μ,Ζ,Β,η,o,w, km,t] omega rw[AD B];have j:=Dense.F.gS a (by rw[o];omega) rw[o,w]at j;have q:aа/2^63<2:=А;have p:(aа%2^52+2^28)/2^29<=2^23:=А;have v:(aа/2^52%2^11-1085-110)*2^23<=252*2^23:=ι _ А;refine⟨?_,А,А,?_,?_⟩ .apply ξ.mp rw[j];unfold wX simp only[η,ψ,ο,Ζ,Β, km,ku,β,ν,u,H,I] exact wq _ _ _ q E G p .rw[ϫ,j];clear*-q p v;omega .rw[μ,j];simp only[km];clear*-q p v;omega lemma i6(d:х)(o:Е)(j:oг%2^31<255*2^23): (if o&&&(if d then 0x80000000 else 0)!=0 then 0 else o)=pU d o:=by have g:kq o≠255:=by intro h;have e:=congrArg mw h simp only[kq,Ν,Ρ,kF,ku, β]at e rw[show(255:п)=2^8-1 fromО,θ]at e;omega cases d<;>simp[pU,reluW,g] @[inline]def eB(g:х)(m:Е)(Y Z:ф)(w:т)(slow:Unit->т):т:= if g&&(w>>>23)&&&255!=255 then let a:=(Dense.F.dw w*Y+Z).toBits let x:=(a+268435457)>>>29 if x==(a+268435453)>>>29&&((x>>>23)&&&2047)-1195<253&&x&&&8388607!=0 then let o:=(wX x)й if o&&&m !=0 then 0 else o else slow () else slow () lemma iQ(d:х)(s t w:kt)(g:Unit->kt) (j:g ()=pU d (kL (n0 (lw w) (lw s) (lw t)))): eB ((s>>>23)&&&255!=255&&(t>>>23)&&&255!=255) (if d then 0x80000000 else 0) (Dense.F.dw s) (Dense.F.dw t*Dense.F.pw 149) w g=pU d (kL (n0 (lw w) (lw s) (lw t))):=by rw[eB];dsimp only split;swap;. exact j rename_i E;simp only[Θ,AQ,Ao]at E;obtain⟨⟨u,v⟩,x⟩:=E;change ¬kq s=255 at u;change ¬kq t=255 at v;change ¬kq w=255 at x split;swap;. exact j rename_i K;have⟨r,m,o,B,D⟩:=cX _ K;rw[<-r];have Y:=Dense.aE t;have U:=Dense.aU t;have iw:=Dense.aE w;have W:=Dense.aU w;have X:=Dense.aE s;have Q:=Dense.aU s;have⟨z,L⟩:=Dense.F.dD w s x u;have⟨G,M⟩:=Dense.F.cF t v;have⟨H,N⟩:=Dense.F.fW 149 Г obtain⟨A,O⟩:=Dense.F.aA _ _ G H (sv t) ((ks t+149:п):р) (by rw[M,N,AA,AF];ring) (Am (Dense.F.bi t) Г) А (Dense.F.bg 24 _ 971 А AO _ (Dense.F.bi t)) have l:=Dense.F.jg (Dense.F.dw w*Dense.F.dw s+Dense.F.dw t*Dense.F.pw 149) А;have h:=Dense.F.jr _ _ z A l _ А А (Dense.F.fF _ l);obtain⟨-,e⟩:=Dense.F.eW _ _ z A _ А А h have I:Dense.F.rv (Dense.F.dw w*Dense.F.dw s)+Dense.F.rv (Dense.F.dw t*Dense.F.pw 149)= ((sv w*sv s*2^(ks w+ks s)+sv t*2^(ks t+149):р):ℝ):=by rw[L,O,tm,AA];push_cast;ring rw[I]at h e;generalize q:(sv w*sv s*2^(ks w+ks s)+sv t*2^(ks t+149):р)=V at h e;generalize Dense.F.dw w*Dense.F.dw s+Dense.F.dw t*Dense.F.pw 149=S at D m o B l h e⊢ have J:((Dense.F.eF S.toBits-1075)а:р)=((Dense.F.eF S.toBits)а:р)-1075:=by rw[χ _ _ (by rw[ζ];simp only[km];omega)] simp only[km];omega obtain⟨p,y⟩:=Dense.F.ce S l (Dense.F.eF S.toBits-1075) (by rw[χ _ _ (by rw[ζ];simp only[km];omega)];omega) V (e.trans (by rw[J,div_le_iff₀ (by norm_num:(0:ℝ)<2)] have:=AG (by norm_num:(1:ℝ)<=2) (by omega:((Dense.F.eF S.toBits).toNat:р)-1022-53<=((Dense.F.eF S.toBits).toNat:р)-1075) have:(0:ℝ)<(2:ℝ)^(((Dense.F.eF S.toBits)а:р)-1075):=В;linarith)) (h.le.trans (AG Г А)) D rw[er w s t x u v V q.symm p,<-y];exact i6 d _ B def bF(relu:х)(hw c:п)(s t:с т)(ch:п)(x:с т):с т:= if ch>>23)&&&255!=255&&(tc>>>23)&&&255!=255 let Y:=Dense.F.dw sc let Z:=Dense.F.dw tc*Dense.F.pw 149 bF relu hw c s t (ch+1) (if h:stopб<=xвthen cB stop (λ_ _ w=>eB g m Y Z w λ_=>jh relu w sc tc) (ch*hw)е x h else x) else x termination_by c-ch lemma di(g:х)(e c:п)(s t:с kt)(d:п)(x:с kt) (p:xв=c*e) (r:c*epU g (kL (n0 (lw w) (lw s[j/e]!) (lw t[j/e]!)))) else x[j]?:=by induction hk:c-d generalizing d x with | zero=> unfold bF;rw[AC А];split .have:c*e<=d*e:=ι _ А rw[Ϧ А];rfl .rfl | succ k v=> have q:dpU g (kL (n0 (lw w) (lw s[d]!) (lw t[d]!)))) (λ_ _ w=>iQ g s[d]! t[d]! w (λ_=>jh g w s[d]! t[d]!) rfl) (d*e)е x (by rw[h];omega) rw[v (d+1) _ (by rw[m,p]) А,o,l,h, show(d+1)*e=d*e+e by ring] split_ifs<;>first | omega | rw[ϱ (k:=d) А (by rw[Ξ];omega)] | rfl def br(relu:х)(c hw:п)(x s t:с т):с т:= if xв=c*hw/\c*hwkt) (g:e ()=pU d (kL (nZ (lw a) (lw b)))): ad (if d then 1 else 0) a b e=pU d (kL (nZ (lw a) (lw b))):=by cases d<;>simp[ad,NativeAdd.gO] @[noinline]def jF(relu:х)(x y:т):т:=act relu (toWord (Model.add (ofW x) (ofW y))) def co(relu:х)(a b:с т):с т:= if h:aв<=bв/\aв let y:=b.uget i (by rw[Dense.aa h.2]at hi;omega) ad rb x y λ_=>jF relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b lemma dL:co=addReluSpec:=by funext d a b;rw[co];dsimp only;split .rename_i h have g:aвеб=aв:=Dense.aa h.2;apply mK;intro j rw[(cI _ _ (λj x=>pU d (kL (nZ (lw x) (lw b[j]!)))) (λi l x=>?_) 0 a _).2 j, addReluSpec,ms] .by_cases e:jх) (fa:п->kt) (bx:Д) (s:lJ) (J:х) (I K b:с kt) (D:х) (nc Y:п) (r d:kt) (x:Д) (v:р) (B a:Д) (m:п) (e j:у) (bw:Д) (u:Е) {α:Type} lemma mo{a b:п}(h:arw[h]<;>norm_num lemma j0{n:п}(h:n<2^32):n%2^nk=n:=mo (AM h df) lemma jN(a:с Е):a.usizeб<=aв:=by exact Ax _ _ @[inline]def ok(w:Е):х:= expOf w !=255&&(mW w==0||iW w-E<=C) @[inline]def ey(a:с Е):Д:= a.foldl (λm w=>if mW w !=0&&iW w< m then iW w else m) 255 @[inline]def cq(h l:Д):Д:=(h<<<25)+l @[inline]def dV(h l:Д):Д:= ((h+0x8000000000000000)>>>(39:Д))-(16777216:Д)-(l>>>(63:Д))+ (if cq h l>>31!=0 then 0-m else m @[specialize]def lp(H:п)(f:п->п->с Е->с Е): п->п->п->с Е->с Е | 0,_,_,a=>a | n+1,o,y,a=> let a:=f o y a if y+1у->Е)(s:у)(x:п):п->у->с Е->с Е | 0,_,a=>a | m+1,e,a=>da f s (x+1) m (e+s) (a.push (f x e)) @[inline]def eO(O H W:п)(f:п->п->п->Е):с Е:= if 0da (λx _=>f o y x) 0 0 W 0) (O*H) 0 0 (AS (O*(H*W))) else#[] lemma uL{a:с Е}{i:у}(h:iif iif iт->α)(I:с т)(w k:п):п->п->п->α->α | 0,_,_,acc=>acc | n+1,i,dx,acc=> let acc:=g acc I[i]! if dx+1Д):=wl λ(a:Д) x=>a+f x @[reducible]def wa:=wl λ(b:х) x=>b&&Q x @[noinline]def cS(ch y x:п):т:= dotOf (k*k) (poolAt h w k I ch y x) λ_=>oneW @[inline]def wo(A H:Д)(g:Unit->х)(fb:Unit->т)(d:т):т:= if A=0/\H=0 then(if g ()then 0x80000000 else 0) else let r:=Dense.b9 (dV H A) (cq H A) (B+149) eT (if r<Жthen rйelse fb ()) d @[inline]def ar(w:т):Д:=if mW w !=0 then iW w else 255 @[inline]def cT(x0 x1 x2 x3:т):х:=Q x0&&Q x1&&Q x2&&Q x3 @[inline]def eF(u:т):Д:=((u>>>23)&&&255)н @[inline]def gL(ch y x:п)(e:у):т:= let v:=wе if hb:ecT (.==0x80000000) x0 x1 x2 x3) (λ_=>cS h w 2 I ch y x) d else toWord (Ar (ofW (cS h w 2 I ch y x)) (ofW d)) else toWord (Ar (ofW (cS h w 2 I ch y x)) (ofW d)) abbrev DQ:Prop:=signOf d=Н/\expOf d≠0/\expOf d<255 @[inline]def cK(m:п):Д:=if m<=64 then 33 else if m<=256 then 31 else if m<=1024 then 29 else 25 def dM:с т:= let d:=natW (k*k) if 0da (gL h w I d o y) 2 0 (w/2) ((o*h+y*2)*w)е) (c*(h/2)) 0 0 (AS (c*(h/2*(w/2)))) else let q:=cK (k*k) let bx:=ey I if bx<=255/\I.all (ok q bx)=Мthen eO c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k wo bx (dO (t1 bx) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 М) (λ_=>cS h w k I ch y x) d else eO c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k let B:=wl (λ(m:Д) v=>min m (ar v)) I w k (k*k) U 0 255 if B<=255/\wa (ok q B) I w k (k*k) U 0 М=Мthen wo B (dO (t1 B) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 М) (λ_=>cS h w k I ch y x) d else toWord (Ar (ofW (cS h w k I ch y x)) (ofW d)) else avgpoolSpec c h w k I lemma eM:ac x=(xа:р)-2^64*(xа/2^63:п):=by rw[ac];rw[li];have e:x.toBitVec.toNat=xа:=О;have:=x.toNat_lt;split<;>omega lemma ju(h:(xа:р)≡v [ZMOD2^64]) (d:-2^63<=v) (e:v<2^63):ac x=v:=by rw[eM];have:=x.toNat_lt;rw[n4]at h;omega def Z:ZMod (2^64):=xа lemma im:(xа:р)≡v [ZMOD2^64]↔Z x=v:=by rw[Z] rw[show((xа:ℕ):ZMod (2^64))=(((xа:ℤ)):ZMod (2^64)) by push_cast;rfl, ZMod.intCast_eq_intCast_iff] rfl lemma sZ(h:Z x=v)(d:-2^63<=v)(e:v<2^63): ac x=v:=ju x v ((im x v).mpr h) d e lemma fD(b:Д):Z (a+b)=Z a+Z b:=by unfold Z;rw[η,BI];push_cast;ring lemma iN(b:Д):Z (a-b)=Z a-Z b:=by have d:=b.toNat_lt;unfold Z;rw[Ζ,BI,Nat.cast_add,pC А];rw[show((2^64:п):ZMod (2^64))=0 from ZMod.natCast_self _];ring lemma bE:Z 0=0:=by simp[Z] lemma cv{B:Д}(h:B<=255):Bа<=255:=by simpa using ζ.mp h def bU(e:п)(w:Е):р:=sv w*2^(idxOf w-e) lemma cu(h:kz u=0):sv u=0:=by rw[sv];simp[h] lemma j4(h:kz u=0):mW u=0:= ξ.mp (by rw[ap,h];rfl) lemma dC(w:Е)(m:Eа<=255)(l:Cа<=62)(h:ok C E w=М): kq w≠255/\(kz w=0\/(Eа<=ks w/\ks w<=Eа+Cа/\ (iW w-E)а=ks w-Eа)):=by rw[ok,Θ,AQ,Ao,nA,AP]at h;refine⟨h.1,?_⟩;rcases h.2 with d | e .left;have:=ap w;rw[d]at this;simp at this;omega .right;have j:=ao w;have g:=ζ.mp (of_decide_eq_true e);have:=idxOf_le w h.1;rw[Ζ,j]at g⊢;omega lemma pw(v s c:п)(e:v<2^24)(d:s<=c):v*2^s<2^(24+c):=by rw[AF];exact ll e (Η Г d) В lemma fm(e:Д)(w:Е)(c:п)(p:c<=39) (h:kz w=0\/(eа<=ks w/\ks w<=eа+c/\ (iW w-e)а=ks w-eа)): (mW w<<<(iW w-e))а=kz w*2^(ks w-eа)/\ kz w*2^(ks w-eа)<2^(24+c):=by have j:=lc w;rcases h with d | ⟨m,o,l⟩ .rw[j4 w d,d];simp .have g:=pw _ _ c j (А:ks w-eа<=c);refine⟨?_,g⟩ rw[ψ,ap,l,ν, mo (a:=ks w-eа) А] exact mo (AM g (Η Г А)) lemma jC(b:Д):((a+b)а:р)≡(aа:р)+bа [ZMOD2^64]:=by rw[n4];rw[η];omega lemma gT(b:Д):((a-b)а:р)≡(aа:р)-bа [ZMOD2^64]:=by have:=b.toNat_lt;rw[n4];rw[Ζ];omega lemma i9: (((a+(0x8000000000000000:Д))>>>(39:Д))а:р)= (aа/2^39:п)+(if aа<2^63 then 2^24 else-2^24):=by have d:=a.toNat_lt;rw[ο,η];simp only[β,mM,m7,ku];split<;>omega lemma eP(d e:Д): ay (dV d e) (cq d e)=ac d*2^25+ac e:=by have j:=d.toNat_lt;have l:=e.toNat_lt;have o:(cq d e)а=((dа%2^39)*2^25+eа)%2^64:=by unfold cq;rw[η,ψ];simp only[ν,mM,m7,ku];omega set c:р:=if cq d e=2^64 then 1 else 0:=by rw[m];simp only[μ,o];split_ifs<;>omega set q:р:=(dа/2^39:п)+(if dа<2^63 then 0 else-2^25)- (eа/2^63:п)+c with g have u:((dV d e)а:р)≡q [ZMOD2^64]:=by rw[dV] refine(jC _ _).trans (Int.ModEq.add ((gT _ _).trans (Int.ModEq.sub ((gT _ _).trans ?_) (by rw[ο];simp only[β,mM,m7,ku];rfl))) ?_) .rw[i9];have:((16777216:Д)а:р)=2^24:=О;rw[this] split<;>(rw[n4];ring_nf) .rw[m];split<;>rfl have p:0<=c/\c<=1:=by rw[m];split<;>decide have v:=ju _ q u (by rw[g];clear*-j l p;split<;>omega) (by rw[g];clear*-j l p;split<;>omega) rw[ay];rw[v,eM,eM,o,g,r];clear*-j l;split_ifs<;>omega lemma fo(a b:Е)(d e:п)(g:kz a=0\/d<=ks a)(j:kz b=0\/e<=ks b):tm a b=bU d a*bU e b*2^(d+e):=by unfold tm bU;rcases g with g | g .simp[cu a g] rcases j with j | j .simp[cu b j] rw[(А:ks a+ks b=(ks a-d)+(ks b-e)+(d+e)),AF,AF];ring lemma cH(f:п->р)(M:р)(h:∀th t (mr d)).trans (П)) abbrev ag(g:п->Е):с Е:=Ak (n:=m) λq=>g qи lemma d5(g:п->Е):(ag m g).push (g m)=ag (m+1) g:=by simp[ag];rw[Array.ofFn_succ (f:=λq:Fin (m+1)=>g qи)];rfl lemma cf(o y x H W:п)(g:yп->с Е->с Е)(S:п->с Е->Prop) (j:∀o y a,yS (o*H+y) a->S (o*H+y+1) (f o y a)): ∀n o y a,yS (o*H+y) a->S (o*H+y+n) (lp H f n o y a):=by intro n;induction n with | zero=>intro o y a _ h;exact h | succ n e=> intro o y a l h;have d:=j o y a l h;simp[lp];split_ifs with g .rw[show o*H+y+(n+1)=o*H+(y+1)+n by ring];exact e _ _ _ g d .obtain rfl:H=y+1:=А rw[show o*(y+1)+y+(n+1)=(o+1)*(y+1)+0+n by ring];exact e _ _ _ А (by rw[show(o+1)*(y+1)+0=o*(y+1)+y+1 by ring];exact d) lemma j2(H W n c:п)(d:п->п->с Е->с Е)(F:п->п->п->Е)(r:0o*H+y(∀jd o y (ag M g)=ag (M+W) g): lp H d n 0 0 (lI c)=ag (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W):=by have:=ic H d (λk a=>k<=n->a=ag (W*k) λq=>F (q/(H*W)) (q/W%H) (q%W)) (λo y a e v A=>by rw[v А];exact u _ _ _ _ e А λj x=>by obtain⟨l,m,p⟩:=cf o y j H W e x;simp[show W*(o*H+y)+j=(o*H+y)*W+j by ring,l,m,p,Ι]) n 0 0 _ r λ_=>rfl simp[A5,ϵ,Ι,ύ W n]at this;exact this lemma iz(f:п->у->Е)(g:п->Е)(s:у):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jе))->da f s x m e (ag M g)=ag (M+m) g:=by intro m;induction m with | zero=>intro _ _ _ _;rfl | succ m o=> intro x e M l;have d:=l 0 А;rw[ϕ,ϕ,show(0:п)е=0 fromО,USize.mul_zero,USize.add_zero]at d rw[da,<-d,d5,o _ _ _ λj p=>by rw[(А:M+1+j=M+(j+1)),l _ А,(А:x+(j+1)=x+1+j), show(j+1)е=jе+1 from ml j 1,USize.mul_add,USize.mul_one, USize.add_assoc,USize.add_comm (s*_)]];congr 1;omega lemma d0(H W n c:п)(s:у)(E:п->п->у)(F:п->п->п->у->Е)(d:0da (F o y) s 0 W (E o y)) n 0 0 (lI c)= ag (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)е):= j2 H W n c _ (λo y x=>F o y x (E o y+s*xе)) d λ_ _ _ _ _ _ e=> iz _ _ _ _ _ _ _ λj g=>by rw[e j g,Ι] lemma iD(O H W:п)(f:п->п->п->Е): eO O H W f=ag (O*(H*W)) λq=>f (q/(H*W)) (q/W%H) (q%W):=by rw[eO];split_ifs with h .rw[d0 _ _ _ _ 0 (λ_ _=>0) (λo y x _=>f o y x) h,Ϛ] .simp[ag,(А:H=0)] lemma jc(g:α->kt->α)(I:с kt)(w k U:п): ∀n j e d,ewl g I w k n (U+j*w+e) e d= (pM (j*k+e) n).foldl (λd t=>g d I[U+t/k*w+t%k]!) d:=by intro n;induction n with | zero=>intro j e d _;rfl | succ n m=> intro j e d l;have o:(j*k+e)/k=j:=by rw[Υ,Ο _ _ А,Τ l,Ι] have p:(j*k+e)%k=e:=by rw[Υ,Μ,mo l] rw[BN,ly];rw[wl,o,p];split_ifs with h .exact m j (e+1) _ h .obtain rfl:k=e+1:=А rw[show U+j*w+e+w+1-(e+1)=U+(j+1)*w+0 by rw[nC];omega, m (j+1) 0 _ А];congr 2;ring lemma iJ(g:α->kt->α)(I:с kt)(w k U n:п)(d:α)(e:0g d I[U+t/k*w+t%k]!) d:=by have:=jc g I w k U n 0 0 d e;simp[ϵ,ϕ,<-List.range_eq_range']at this;exact this lemma aa(h:n<2^32):nеб=n:=j0 h lemma fE:Z x=((xа:р):ZMod (2^64)):=by rw[Z];norm_cast lemma gK:Z x=((ac x:р):ZMod (2^64)):= (im x _).mp (by rw[eM];rw[n4];omega) lemma ja(m:Д)(h:mа<2^62): ac (sg u m)=if kS u then-(mа:р)else mа:=by unfold sg;rw[fn];cases kS u<;>simp only[fT,ite_true,ite_false] .exact sZ _ _ (fE m) А А .exact sZ _ _ (by rw[iN,bE,fE];push_cast;ring) А А lemma gu:ok C E 0=М:=О lemma ga(a:с Е)(p:Е->х)(h:a.all p=М)(e:p 0=М)(q:п): p a[q]! =М:=by by_cases d:qintro Y;rw[fz,AC А];exact⟨О,λq g=>by rw[AD А]⟩ | succ n j=> intro Y;rw[fz,AD А,Nat.add_one_sub_one];have⟨e,d⟩:=j (Y.push z);rw[Dense.F.bW]at e d;refine⟨by rw[e];omega,λq g=>?_⟩ rw[d q А];by_cases h:q(fc I p n l g j Y)д=Yд+(nб-jб)/\ ∀q intro j Y r;have h:¬jby have:=ε.mp h;omega rw[fc,dif_neg h];exact⟨А,λq u=>by rw[AD А]⟩ | succ m v=> intro j Y r;have h:j?_⟩ rw[e q А];by_cases d:qrj<=s.cin*(s.h+2)+3-> j=c*(s.h+2)+r->Yд=j*(s.w+2)->(∀q (fR I s z X hw c r j Y)д=(s.cin*(s.h+2)+3)*(s.w+2)/\ ∀q<(s.cin*(s.h+2)+3)*(s.w+2),(fR I s z X hw c r j Y).data[q]! =Dense.F.dw (aJ s I (q/((s.h+2)*(s.w+2))) (q/(s.w+2)%(s.h+2)) (q%(s.w+2))):=by intro m;induction m with | zero=> intro c r j Y hm hr N hj o J;have p:j=s.cin*(s.h+2)+3:=А;rw[fR,AC А,<-p];exact⟨o,λq d=>J q (by rw[o];exact d)⟩ | succ m ih=> intro c r j Y hm hr N hj o J;have M:jby obtain⟨g1,g2,g3⟩:=cf c r x _ _ hr hx;rw[<-hj]at g1 g2 g3;rw[g1,g2,g3] have A:s.cin*(s.h+2)+3-(j+1)=m:=А;have B:(if r+1=s.h+2 then 0 else r+1)omega have D:j+1<=s.cin*(s.h+2)+3:=А have G:j+1=(if r+1=s.h+2 then c+1 else c)*(s.h+2)+(if r+1=s.h+2 then 0 else r+1):=by split<;>omega rw[fR,AD M];by_cases h:c?_ clear A B D G;rw[Dense.F.bW,g]at d;rw[Dense.F.pg _ _ _ (by rw[g];omega)] by_cases u:qh ⟨H,K,L,by have l:(c*s.h+(r-1))*s.w+s.w=(c*s.h+r)*s.w:=by rw[<-Ξ];congr 1;omega have e2:(c*s.h+r)*s.w<=((c+1)*s.h)*s.w:=ι _ (by rw[Ξ];omega) have e3:((c+1)*s.h)*s.w<=(s.cin*s.h)*s.w:=ι _ (ι _ H);omega⟩ have⟨g,l⟩:=gl z (s.w+2) Y;refine ih _ _ (j+1) _ A B D G (by rw[g,o];ring) λq d=>?_ clear A B D G;rw[g]at d;rw[l q d];split .exact J q ‹_› .obtain⟨x,rfl⟩:∃x,q=j*(s.w+2)+x:=⟨q-Yд,А⟩ rw[gq x А,hz];rw[aJ];rw[AC (λO=>h0 ⟨O.1,O.2.1,O.2.2.1⟩)] lemma iF(A:с п)(u:у)(h:uбф):Dense.F.A8:=⟨f 0,f 1,f 2,f 3,f 4,f 5,f 6,f 7⟩ lemma fO(f:п->ф)(r:п)(d:r<8):(ez f).f r=f r:=by rw[ez];interval_cases r<;>rfl lemma kd(p:п->ф)(n t:п)(a:ф)(h:tф)(n t:п)(a:ф)(h:¬tomega lemma iZ(d t:п):px d t<=2:=by rw[px];split<;>omega lemma iY(d t e:п)(g:d=9\/d=1)(j:tsimp<;>omega abbrev fI(s:ConvShape)(kk:п):Prop:= s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1/\kk=9\/s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\kk=1 structure CD where s:ConvShape I:с т K:с т b:с т X:З T:с п D:х J:х k:п M:п L:п hh:Д Y:п kk:п hX:Xд<2^32 lemma cW(n:п):(ky n)д=0:=by simp[ky,kH] def fJ:Bool:=System.Platform.target.startsWith "aarch64" structure CC(M:п)where Tz:с п Wz:З wo:п n:п ni:х h1:n<=Tzв h2:wo+n<=Wzд h3:wo+n<2^32 h4:∀td.X.get! (q+d.T[t]!)*Dense.F.dw d.K[ko+t]!) (λ_=>Dense.F.dw oneW*Dense.F.dw d.b[o]!) λ_=>act d.J (aD d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x) @[inline]def dK(relu:х)(w:т):т:=if relu&&w&&&0x80000000!=0 then 0 else w lemma jA(d:х)(w:kt)(e:kq w≠255):dK d w=pU d w:=by rw[dK,pU,reluW];cases d<;>simp[e] lemma ei(S:ф)(h:Д)(e:Dense.F.an S h<Ж): kq (Dense.F.an S h)й≠255:=by unfold Dense.F.an at e⊢;dsimp only at e⊢;split at e swap;. exact absurd e Б rename_i d;rw[AD d];simp only[Θ,AL]at d;obtain⟨⟨⟨-,l⟩,-⟩,-⟩:=d have m:(Dense.F.eF S.toBits)а<2048:=by unfold Dense.F.eF;rw[Β];exact AN ϟ Б have o:(S.toBits&&&0xfffffffffffff)а<2^52:=by rw[Β];exact AN ϟ Б rw[μ,Ζ]at l;simp only[km]at l;have p:1195<=(Dense.F.eF S.toBits)а:=А;have r:=Dense.F.gS S.toBits p;have q:S.toBitsа/2^63<2:=by have:=S.toBits.toNat_lt;omega rw[μ]at e;simp only[km]at e;intro g;have j:=congrArg mw g;rw[kq,Ν,Ρ,ϫ]at j;simp only[kF,ku,β]at j;rw[θ _ 8,γ e,r]at j;omega @[inline]def bV(d:CD)(o y x:п)(S:ф):т:= let c:=Dense.F.an S d.hh if h:c<Жthen dK d.J cйelse ow d o y x S lemma iq(d:CD)(o y x:п)(S:ф):bV d o y x S=ow d o y x S:=by unfold bV;dsimp only;split .rename_i e;rw[jA _ _ (ei _ _ e)];rw[ow,Dense.F.tw,Dense.F.tf];dsimp only;rw[AD e] .rfl @[inline]def jl(d:CD)(o y:п)(xb:у)(r:п)(S:ф):т:= let c:=Dense.F.an S d.hh if c<Жthen dK d.J cйelse ow d o y (xbб+r) S lemma ir(d:CD)(o y:п)(e:у)(r:п)(S:ф):jl d o y e r S=bV d o y (eб+r) S:=О @[inline]def su(a:с т)(u:у)(v:т):с т:= if h:uт)(n r q:п)(a:с т):с т:= if rkt)(n q:п):∀m r (a:с kt),n-r=m->r<=n->(pl g n r q a)в=aв/\ ∀iintro r a l o;rw[pl,AC А];exact⟨О,λi e=>by rw[AC А]⟩ | succ m p=> intro r a l o;have⟨u,j⟩:=p (r+1) (a.set! (q+r) (g r)) А А;rw[pl,AD А,u,BP];refine⟨О,λi e=>?_⟩ rw[j i (by rw[BP];exact e)] by_cases d:i=q+r .subst d;rw[Array.getElem!_set!_self _ _ _ e];split_ifs<;>first | rfl | omega | (congr 1;omega) .rw[Array.getElem!_set!_ne _ _ _ _ (Ne.symm d)];split_ifs<;>first | rfl | omega @[inline]def ln(d:CD)(o y:п)(xb nq q r:у)(S:ф)(a:с т):с т:= if rkt)(n q:п):∀m r (a:с kt),n-r=m->r<=n-> pl g (n+1) r q a=(pl g n r q a).set! (q+n) (g n):=by intro m;induction m with | zero=> intro r a d e;have:r=n:=А;subst this;conv_lhs=>rw[pl,AD А,pl,AC А] conv_rhs=>rw[pl,AC А] | succ m j=> intro r a d e;conv_lhs=>rw[pl,AD А] rw[j (r+1) _ А А];conv_rhs=>rw[pl,AD А] lemma j1(d:CD)(o y:п)(g e q:у)(A:Dense.F.A8)(a:с kt)(p:qб+eбbV d o y (gб+r) (A.f r)) (n8 k eб) 0 qб a)= pl (λr=>bV d o y (gб+r) (A.f r)) (n8 (k+1) eб) 0 qб a:=by subst l;rw[ln];by_cases h:rbV d o y (gб+r) (A.f r)) (n8 8 eб) 0 qб a:=by have L:=j1 d o y g e q A a l;have j:=L 0 0 (by simp only[kp]) A.a0 rfl rw[Nat.zero_min,pl,AC А]at j;unfold bc simp only[j,L 1 1 (by simp only[kp]) A.a1 rfl,L 2 2 (by simp only[kp]) A.a2 rfl, L 3 3 (by simp only[kp]) A.a3 rfl,L 4 4 (by simp only[kp]) A.a4 rfl, L 5 5 (by simp only[kp]) A.a5 rfl,L 6 6 (by simp only[kp]) A.a6 rfl, L 7 7 (by simp only[kp]) A.a7 rfl,Nat.reduceAdd] lemma l0(d:у)(h:0п->п->у->у->у->Dense.F.A8->с т->с т)(Wz X:@&З)(Tz:@&с п)(wo n:у)(M:п) (hs:Xд<2^32/\Wzд<2^32) (hn:nб<=Tzв) (hT:∀tп->п->у->у->у->Dense.F.A8->с kt->с kt)(g X:З)(e:с п)(l n:у)(M:п) (U:Xд<2^32/\gд<2^32) (hn:nб<=eв) (N:∀tX.data[iб+e[s]!+r]!*g.data[lб+s]!) nб tб (Dense.F.A8.f ⟨p,u,v,x,B,D,G,H⟩ r)): en W g X e l n M U hn N hW i O d o y xb nq q a t p u v x B D G H=W d o y xb nq q A a:=by induction m generalizing t p u v x B D G H A with | zero=> have h:¬tby have:=ε.mp h;omega rw[en,dif_neg h];congr 1;exact jT _ _ λr I=>by rw[K r I,kc _ _ _ _ А] | succ m ih=> have h:t?_ rw[K r I,kd _ _ _ _ Y,Dense.ae h];congr 1 interval_cases r<;> (simp only[Dense.F.A8.f];rw[rx _ (by simp only[kp];omega),J];simp only[kp]) @[noinline]def ft(d:CD)(o y:п)(xb nq q:у)(A:Dense.F.A8)(a:с т):с т:= bc d o y xb nq q A a def dE(d:CD)(c:CC d.M)(o y xb r:п):ф:= Dense.F.aq (λt=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+xb+ c.Tz[t]!+r]!*c.Wz.data[c.wo+t]!) c.n 0 (Dense.F.dw oneW*Dense.F.dw d.b[o]!) @[inline]def gQ(W:CD->п->п->у->у->у->Dense.F.A8->с т->с т)(d:@&CD)(c:@&CC d.M)(o y:п)(xb nq q i:у) (hi:iб+d.M+8<=d.Xд) (bp:ф) (a:с т):с т:= en W c.Wz d.X c.Tz c.woе c.nе d.M ⟨d.hX,c.h5⟩ (by have:=ς;have:=c.h3;rw[Dense.aa А];exact c.h1) (by have:=ς;have:=c.h3;rw[Dense.aa А];exact c.h4) (by have:=ς;have:=c.h3;rw[Dense.aa А,Dense.aa А];exact c.h2) i hi d o y xb nq q a 0 bp bp bp bp bp bp bp bp lemma gR(d:CD)(c:CC d.M)(o y:п)(e m q i:у)(p:iб+d.M+8<=d.Xд)(l:ф) (a:с kt) (j:iб=(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+eб) (g:l=Dense.F.dw kT*Dense.F.dw d.b[o]!): gQ bc d c o y e m q i p l a=bc d o y e m q (ez (dE d c o y eб)) a:=by subst g;rw[gQ];have:=ς;have:=c.h3;refine gX _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>?_ rw[fO _ _ u];rw[dE] simp only[j,Dense.aa (А:c.woп->п->у->у->у->Dense.F.A8->с т->с т)(d:@&CD)(c:@&CC d.M)(o y:п)(xb nq q i:у)(bp:ф)(a:с т) (hI:iб+nqб+d.M+7<=d.Xд):с т:= if h:0kt) (G:∀g x,g<=x->xxbV d o y x (dE d c o y g (x-g))=F x): ∀m (g e q i:у) (a:с kt) (v:iб+eб+d.M+7<=d.Xд),eб<=m-> gб+eб=d.s.w-> iб=(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+gб-> qб+eб<=aв->aв<2^32-> (rB bc d c o y g e q i u a v)в=aв/\∀j intro g e q i a v hm hx L hq J;rw[rB,dif_neg (λh=>by have:=l0 e h;omega)] exact⟨rfl,λj _=>by rw[AC А]⟩ | succ m ih=> intro g e q i a v hm hx L hq J;have:=ς;have:=d.hX;by_cases h:0bV d o y (gб+r) ((ez (dE d c o y gб)).f r)) (n8 8 eб) qб _ 0 a rfl (Ϣ _) have I:∀j,qб<=j->j bV d o y (gб+(j-qб)) ((ez (dE d c o y gб)).f (j-qб))=F (gб+(j-qб)):= λj h1 h2=>by rw[fO _ _ А,<-G gб _ А А А,ϳ] by_cases l:8?_⟩ rw[Y j (by rw[p];exact A),K j A,N,O,U] split_ifs<;>first | rfl | omega | (congr 1;omega) | exact I j А А .have B:¬8l (ε.mpr (by simp only[kp];omega)) rw[dif_neg l];refine⟨p,λj A=>?_⟩ rw[K j A];split_ifs<;>first | rfl | omega | exact I j А А .have h0:eб=0:=by have:=mt ε.mpr h;simp only[kp]at this;omega rw[rB,dif_neg h];exact⟨О,λj _=>by rw[AC А]⟩ @[specialize]def c6(h len:п)(V:у)(i0:п)(hN:i0+h*Vбy(q:п)->(i:у)->iб=i0+y*Vб->с т->с т) (y q:п) (i:у) (hi:iб=i0+y*Vб) (a:с т):с т:= if hy:yy(q:п)->(i:у)->iб=o+y*Vб->с kt->с kt) (r N:п) (G:п->kt) (F:∀y (g:yaв=N-> (f y g q i e a)в=aв/\∀jy<=h->q=r+y*d->aв=N-> (c6 h d V o x f y q i e a)в=aв/\ ∀j intro y q i e a H g p l;have u:y=h:=А;subst u;rw[c6,dif_neg А];exact⟨О,λj _=>by rw[AC А]⟩ | succ m K=> intro y q i e a H _ p l;have g:y?_⟩ rw[D j (by rw[v];exact A),B j A] have I:(y+1)*d<=h*d:=ι _ g;have J:q+d=r+(y+1)*d:=by rw[p];ring split_ifs<;>first | rfl | omega @[specialize]def c9(W:CD->п->п->у->у->у->Dense.F.A8->с т->с т)(d:@&CD)(c:@&CC d.M)(o q:п)(bp:ф)(a:с т):с т:= let V:=d.s.w+2 let i0:=(if d.D then o else 0)*((d.s.h+2)*V) if hb:i0+(d.s.h-1)*V+d.s.w+d.M+7<=d.Xдthen c6 d.s.h d.s.w Vе i0 (by have:=d.hX;have:=ς;have:=Nat.sub_one_mul d.s.h V;have hV:V=d.s.w+2:=rfl;rw[Dense.aa А];omega) (λy hy q i hi a=>rB W d c o y 0 d.s.wе qе i bp a (by have:=d.hX;have:=ς;have:=ι V (Nat.le_sub_one_of_lt hy) have hV:V=d.s.w+2:=rfl;rw[Dense.aa А]at hi;rw[Dense.aa А];omega)) 0 q i0е (by have:=d.hX;have:=ς;rw[Dense.aa А];simp) a else a lemma iu(d:CD)(c:CC d.M)(o q:п)(l:ф)(a:с kt)(N:п)(G:п->kt) (m:∀y (v:yq'=q+y*d.s.w->eв=N-> (rB bc d c o y 0 d.s.wе q'е i l e u)в=eв/\ ∀j(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+(d.s.h-1)*(d.s.w+2)+d.s.w+d.M+7<=d.Xд): (c9 bc d c o q l a)в=aв/\ ∀j?_) _ 0 q _ _ a rfl (Ϣ _) (П) A exact m y v q' i e _ (by rw[F,Dense.aa H]) r p .rw[dif_neg g] have x:d.s.h=0:=by by_contra h;exact g (B (Ϸ h)) exact⟨О,λj _=>by rw[x,ϵ,ϕ,AC А]⟩ def bu(K:с т)(T:с п)(M ok k:п)(hT:∀tby rw[ϝ]at hj by_cases hjs:jп, (∀jℝ,(∀sz s=0)->∑j∈range Tzв,z (ix j)=∑s∈range t,z s lemma fj(K:с kt)(T:с п)(M A k:п)(H:∀tNZ K T A t Tz Wz-> NZ K T A k (bu K T M A k H I t Tz Wz p u v g).Tz (bu K T M A k H I t Tz Wz p u v g).Wz:=by intro m;induction m with | zero=>intro t Tz Wz p u v g L h;rw[bu,dif_neg А];rwa[(А:t=k)]at h | succ m J=> intro t Tz Wz p u v g L h;have⟨p,u,x,o,l⟩:=h;rw[bu,AT А];dsimp only;split .rename_i G refine J (t+1) Tz Wz _ _ _ _ А ⟨p,А,x,λj r=>⟨by have:=(o j r).1;omega,(o j r).2⟩,λz g=>?_⟩ rw[l z (λs D q=>g s А q),Λ,g t А G,Au] .rename_i G refine J (t+1) _ _ _ _ _ _ А ⟨by rw[ϝ,Dense.F.bW,p],by rw[ϝ];omega, λj=>if j?_,λz g=>?_⟩ .rw[ϝ]at r by_cases d:jby rw[AD (ϧ.mp r)] rw[ϝ,Λ,e];dsimp only;rw[AC (AX _),l z (λs D q=>g s А q),Λ] def dA(d:CD)(Z:х)(Wd:З)(hT:∀tby simp at hj) else have hok:o*d.k+d.k<=d.Y*d.k:=by rw[<-Ξ];exact ι _ ho ⟨d.T,Wd,o*d.k,d.k,fJ&&decide (16 (bu K T M q k o p t Tz d g e j l).n=(bu K T M q k o p t Tz d g e j l).Tzв/\ (bu K T M q k o p t Tz d g e j l).wo=0:=by intro m;induction m with | zero=>intro t Tz d g e j l u;rw[bu,dif_neg А];exact⟨О,О⟩ | succ m r=> intro t Tz d g e j l u;rw[bu,AT А];dsimp only;split .exact r _ _ _ _ _ _ _ А .exact r _ _ _ _ _ _ _ А lemma fd(d:CD)(Z:х)(p:З)(u:∀tpд=d.Y*d.k/\∀qп,c.n<=d.k/\ (∀jℝ,(∀sz s=0)-> ∑j∈kD c.n,z (m j)=∑s∈kD d.k,z s:=by by_cases D:Z=М .have H:c.wo=0/\c.n=c.Tzв/\NZ d.K d.T (o*d.k) d.k c.Tz c.Wz:=by subst O;rw[dA];rw[AT D] exact⟨(eH d.K d.T d.M (o*d.k) d.k u v _ 0 _ _ _ _ _ _ rfl).2,(eH d.K d.T d.M (o*d.k) d.k u v _ 0 _ _ _ _ _ _ rfl).1, fj d.K d.T d.M (o*d.k) d.k u v _ 0 _ _ _ _ _ _ rfl ⟨by rw[cW];simp,П,id,λj e=>by simp at e,λz _=>П⟩⟩ have⟨L,l,J,I,m,g,r⟩:=H refine⟨by rw[<-J];omega,m,by rw[l];exact I,λj e=>by rw[l]at e;exact⟨(g j e).1,(g j e).2.1,by rw[L,Ι];exact(g j e).2.2⟩, λz hz=>by rw[l];exact r z hz⟩ .obtain⟨A,B⟩:=x (by simpa using D) have ah:o*d.k+d.k<=d.Y*d.k:=by rw[<-Ξ];exact ι _ U subst O;rw[dA];rw[dif_neg D] exact⟨by dsimp only;rw[A];exact N,id,AO, λj e=>by dsimp only at e⊢;exact⟨e,О,B (o*d.k+j) А⟩,λz _=>О⟩ lemma gy(s:lJ)(I:с kt)(d:s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1) (y x t:п) (e:t/9first | rfl | omega lemma gx(s:lJ)(I:с kt)(d:s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0) (y x t:п) (j:yfirst | rfl | omega lemma iy(s:lJ)(I:с kt)(e:п)(q:fI s e)(y x t d:п)(u:yby rw[cW]at j;omega) lemma gP(h w d j l y m e V:п)(x:V=w+2)(g:e=(h+2)*V)(p:yп) (hs:fI d.s d.kk) (a3:0ℝ,(∀sz s=0)-> ∑j∈kD c.n,z (l j)=∑s∈kD d.k,z s) (S:ф) (hS:S=Dense.F.aq (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) c.n 0 (Dense.F.dw kT*Dense.F.dw d.b[o]!)): bV d o y x S=pU d.J (aD d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x):=by have a0:=hc o ho;have hB:=gP d.s.h d.s.w d.s.cin v (if d.D then o else 0) y x ((d.s.h+2)*(d.s.w+2)) (d.s.w+2) rfl rfl hy g a0 a3 have p:∀t[exact pJ h.2.2.2.2;exact pI h.2.2.2.2] have a7:(if d.D then o else 0)+pc d.kk tif tif tfalse) (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) (λj=>tm (kY d.s d.I y x ((if d.D then o else 0)*d.kk+l j)) d.K[o*d.k+l j]!) (tm kT d.b[o]!) P d.L c.n (λj g=>by obtain⟨i1,i2,i3⟩:=e j g;(try dsimp only);rw[i2,i3];exact p _ i1) (λ_ _ h=>absurd h lF) (λj g=>by have:=r (l j) (e j g).1.le;simpa only[AD (e j g).1]using this) (by have:=r d.k AO;simpa only[AX,An]using this) А m А c.n 0 _ rfl (Ϣ _) u.1 (by simp[u.2]) have ba:((tm kT d.b[o]!:р):ℝ)+∑j∈kD c.n, ((tm (kY d.s d.I y x ((if d.D then o else 0)*d.kk+l j)) d.K[o*d.k+l j]!:р):ℝ)= (af (d.k+1) (λt=>if tif t(tm (if sby simp only[AD a5,tm,cu d.K[o*d.k+s]! (by rw[<-ap,h0];rfl)];simp)] simp only[AX,An];rw[add_comm];congr 1;exact ϓ rfl λj g=>by simp only[AD (e j (ϧ.mp g)).1] rw[iq,hS];unfold ow;simp only[Dense.F.gg] refine(Dense.F.jw d.J d.k (λt=>if tif tDense.F.dw kT*Dense.F.dw d.b[o]!) d.hh P d.L (λ_=>pU d.J (aD d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x)) (λt B=>by simp only[AD B];exact p t B) (by simpa only[AX,An]using u) (λt _=>?_) r hL m ah G (by unfold aD;rw[Dense.bN]) _ fS ?_).trans (by unfold aD;rw[Dense.bN]) .dsimp only;split .exact⟨(iI d.s d.I A hx _ _ _).1,(hw _).1⟩ .exact⟨Б,(hb _).1⟩ .rw[<-ba] refine eS.trans ?_ calc (c.n:ℝ)*((2:ℝ)^(P+d.L)*2^(-54:р))<=2^d.L*((2:ℝ)^(P+d.L)*2^(-54:р)):=by gcongr _=(2:ℝ)^(((P+2*d.L:п):р)-54):=by rw[Ac AK,AA,div_eq_mul_inv,<-zpow_neg,<-Ap,<-AF];congr 2;omega _<=(2:ℝ)^(d.hhа:р):=AG Г (by rw[G];omega) def gV(d:CD)(Z:х)(Wd:З)(hT:∀t let c:=dA d Z Wd hT hk hkT hW hY o ho if c.ni=true then c9 ft d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else c9 bc d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a) 0 0 0 (by simp) (Ai (d.Y*(d.s.h*d.s.w)) 0) lemma gW(d:CD)(Z:х)(p:З)(hW:Z=М\/d.Y*d.k<=pд/\pд<2^32)(G IX IW IB P:п) (hs:fI d.s d.kk) (al:0pд=d.Y*d.k/\∀qpU d.J (aD d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w)else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w)):=by rw[gV] obtain⟨aL,ba⟩:=ev d.Y (d.s.h*d.s.w) 0 0 (by have:=ς;simp only[kp,A5];omega) (λo A q _ _ a=> let c:=dA d Z p hT l m hW j o A if c.ni=true then c9 ft d c o q (Dense.F.dw kT*Dense.F.dw d.b[o]!) a else c9 bc d c o q (Dense.F.dw kT*Dense.F.dw d.b[o]!) a) 0 (d.Y*(d.s.h*d.s.w)) (λq=>pU d.J (aD d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w)else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w))) (λo A q _ _ a hq hN=>by try dsimp only generalize bv:dA d Z p hT l m hW j o A=c;have⟨bG,ix,a7,bp,aH⟩:=fd d Z p hT l m hW j a4 o A c bv;have:=ς;have hV:d.s.w+2<=d.Xд:=by rw[r];exact lR _ (Nat.succ_pos _) have bs:(o+1)*(d.s.h*d.s.w)<=d.Y*(d.s.h*d.s.w):=ι _ A;rw[Ξ]at bs;rw[show ft=bc fromО,ite_self] refine iu d c o q _ a _ _ (λy hy H i a' hI hi bw O=>?_) hN А (λbb=>by have a6:=gP _ d.s.w _ G _ (d.s.h-1) (d.s.w-1) _ _ rfl rfl (Nat.sub_lt bb Nat.one_pos) (Nat.sub_lt bB Nat.one_pos) (hc o A) al rw[<-r,<-hM]at a6;omega) try dsimp only have bt:(y+1)*d.s.w<=d.s.h*d.s.w:=ι _ hy;rw[Ξ]at bt;have e:(o*d.s.h+y)*d.s.w=H:=by rw[Ϝ,Ϛ,bw,hq,Ι] have B:d.s.wpU d.J (aD d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x)) (λxb x h1 h2 h3=>jI d c G IX IW IB P ix hs al bq hc hM a3 hT r a5 hx hw hb a0 a1 hL N a2 bh o y x A hy h3 a7 bp aH _ (by rw[dE] exact congrArg (λf=>Dense.F.aq f c.n 0 _) (funext λt=>by rw[lG _ c.Tz[t]! (x-xb),Nat.add_assoc _ xb (x-xb),BL h1]))) _ 0 d.s.wе Hе i a' hI AO (by rw[Dense.aa B];simp only[kp,Ι]) (by rw[hi];simp only[kp,ϕ]) (by rw[Dense.aa as,Dense.aa B,O];omega) (by rw[O];exact U) simp only[Dense.aa as,Dense.aa B,kp,Ι]at u;refine⟨u.1,λi hi=>?_⟩ rw[u.2 i hi];by_cases g:H<=i/\i?_ have ah:iDense.F.dw K[q]!) n (AR n), Or.inr ⟨(Dense.F.bm _ _ _ _ rfl (by rw[cW];omega)).1.ge,by rw[(Dense.F.bm _ _ _ _ rfl (by rw[cW];omega)).1];exact hn⟩⟩ def fG(s:ConvShape)(J:х)(I K b:с т)(D:х)(nc Y:п):с т:= let H:=s.h+2 let V:=s.w+2 let HV:=H*V let kk:=s.kh*s.kw let k:=nc*kk let ex:=Dense.F.aP I 0 0 let ew:=Dense.F.aP K 0 0 let eb:=Dense.F.aP b 0 0 let P:=max (48+(exг-1)+(ewг-1)) (174+(ebг-1)) let L:=Aq (k+1)+1 let M:=(nc-1)*HV+2*V+2 let T:=Ak (n:=k) λt=>pc kk tи*HV+py kk tи*V+px kk tи if hg:fI s kk/\0Core.mW u==0 let W:=wd Z K (Y*k) hY32 gV ⟨s,I,K,b,xF s I hIs hw32,T,D,J,k,M,L,(P+2*L-54)ж,Y,kk, by rw[(dI s I hIs hw32 hI).1];exact hX32⟩ Z W.1 hT hk32 hkT W.2 hY32 else dS s J I K b D lemma em(s:lJ)(J:х)(I K b:с kt)(D:х)(d Y:п) (hd:D=false/\d=s.cin/\Y=s.cout\/D=true/\d=1/\Y=s.cin): fG s J I K b D d Y=dS s J I K b D:=by unfold fG;dsimp only;split swap;. rfl rename_i hg;obtain⟨hs,a2,aH,as,ah,X,U,H,p,G,aL,a1,u,A,v,x,al,hI,hT,r⟩:=hg;dsimp only have hA:s.ho=s.h:=by rcases hs with⟨e,j,l,m,-⟩ | ⟨e,j,l,m,-⟩<;>simp[ConvShape.ho,e,j,l,m]<;>omega have hB:s.wo=s.w:=by rcases hs with⟨e,j,l,m,-⟩ | ⟨e,j,l,m,-⟩<;>simp[ConvShape.wo,e,j,l,m]<;>omega have hc:∀oby rcases hd with⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp<;>omega obtain⟨g,O⟩:=dI s I G A hI have L:∀tpc (s.kh*s.kw) tи*((s.h+2)*(s.w+2))+ py (s.kh*s.kw) tи*(s.w+2)+px (s.kh*s.kw) tи)[t]! = pc (s.kh*s.kw) t*((s.h+2)*(s.w+2))+py (s.kh*s.kw) t*(s.w+2)+px (s.kh*s.kw) t:=λt ht=>by rw[AB _ _ (by simpa using ht),Κ] have a0:=@ϙ (d*(s.kh*s.kw)+1) rw[gW _ _ _ _ d _ _ _ _ (by exact hs) as (by rfl) (by exact hc) (by rfl) (by exact L) (by exact hT) (by exact al) (by exact x) (by exact v) (by exact g) (by dsimp only;rw[g];exact u) (by dsimp only;exact λq B=>O q (by rw[g]at B;exact B)) (λhZ=>by dsimp only;rw[hZ];unfold wd;rw[dif_neg lF];dsimp only obtain⟨M,-,N⟩:=Dense.F.bm (λq=>Dense.F.dw K[q]!) (Y*(d*(s.kh*s.kw))) _ (ky (Y*(d*(s.kh*s.kw)))) rfl (by rw[cW];omega) exact⟨M,λq B=>N q (Ϣ _) B⟩) (by exact Dense.F.be I (by have:=ς;omega) ah) (by exact Dense.F.be K (by have:=ς;omega) X) (by exact Dense.F.be b (by have:=ς;omega) U) (le_max_left _ _) (le_max_right _ _) (by dsimp only;omega) (by exact p) (by exact H) (by dsimp only;rw[Ϥ,Α (by simp only[nP];omega)]) (by exact aH) (by exact r)] rcases hd with⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp only[dS,fT,ite_true,ite_false] all_goals simp only[conv2dSpec,conv2dWith,depthwiseSpec,depthwiseWith,hA,hB] refine l7 (by simp[hA,hB]) λq e _=>?_ rw[Ϟ]at e simp only[ag,Κ] congr 1 unfold aD;simp only[Dense.bN,Ϛ,nQ,ϵ,Ι] def ej:с т:= fG s J I K b Н s.cin s.cout def cD:с т:= fG s J I K b М 1 s.cin lemma ek:ej=conv2dSpec:=by funext s J I K b;exact em s J I K b Н s.cin s.cout (.inl ⟨О,О,О⟩) lemma cV:cD=depthwiseSpec:=by funext s J I K b;exact em s J I K b М 1 s.cin (.inr ⟨О,О,О⟩) lemma a8:(kq u)г=uг/2^23%256:=by rw[kq] rw[Ν,Ρ,show(255:Е)г=2^8-1 fromО, θ] simp[β] lemma aQ:(lA u)г=uг%2^23:=by rw[lA];rw[Ν,show(8388607:Е)г=2^23-1 fromО,θ] def Kf:п:= (if m/2^23=0 then m%2^23 else 2^23+m%2^23)*2^(if m/2^23=0 then 0 else m/2^23-1) lemma il:kz u*2^ks u=Kf (uг%2^31):=by have d:uг%2^31/2^23=(kq u)г:=by rw[a8];omega have e:uг%2^31%2^23=(lA u)г:=by rw[aQ];exact Nat.mod_mod_of_dvd _ Б unfold kz ks Kf;rw[d,e];simp only[<-Ε,m3] lemma iL:Kf m<2^(m/2^23+23):=by unfold Kf;split_ifs with h .rw[h];simpa using ϊ m (show 0<2^23 by norm_num) .have:=ϐ (А:2^23+m%2^23<2^24) (ϸ (m/2^23-1));rwa[<-AF,(А:24+(m/2^23-1)=m/2^23+23)]at this lemma dp(e d:п)(h:epush_cast<;>ring lemma eL: (sk u)г=if uг<2^31 then uг+2^31 else if uг=2^31 then 2^31 else 2^32-1-uг:=by have:=u.toNat_lt;rw[sk];split_ifs<;>simp_all[ώ,<-Ε,UInt32.toNat_sub]<;>omega lemma f0(a b:Е)(h:sk aKf m⟨dp m n,by constructor<;>intro e;. subst e;decide .have:=dp 0 m;by_contra;have:Kf 0=0:=Б omega⟩ have d:=a.toNat_lt;have g:=b.toNat_lt;have:=F (aг%2^31) (bг%2^31);have:=F (bг%2^31) (aг%2^31);split_ifs at h⊢<;>omega lemma gU:Model.cmpDyadic (m0 y) (m0 z)=compare (kv y) (kv z):=by have d:∀w,(m0 w).toReal=(kv w:ℝ)*2^(-149:р):=λw=>by rw[<-ϖ,lu];rw[kv];push_cast;rw[Ac AK,AA];ring have e:(0:ℝ)<2^(-149:р):=zpow_pos two_pos _;cases h:compare (kv y) (kv z) .rw[Model.cmpDyadic_lt_iff,d,d];exact AI (by exact_mod_cast compare_lt_iff_lt.mp h) e .rw[Model.cmpDyadic_eq_iff,d,d,compare_eq_iff_eq.mp h] .rw[Model.cmpDyadic_gt_iff,d,d];exact AI (by exact_mod_cast compare_gt_iff_gt.mp h) e lemma cn(e:kz u=0):u=0\/u=0x80000000:=by have j:=u.toNat_lt;rw[kz]at e;split_ifs at e with g .have d:=a8 u;have l:=aQ u;rw[g]at d;rw[<-Ε,<-Ε];simp at d⊢;omega .omega lemma bf:lw (mx y z)=na (lw y) (lw z):=by rw[mx];split .rename_i h;have e:=kK y h.1;have g:=kK z h.2.1;have j:Model.compare (lw y) (lw z)=n7 _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e g;rw[gU]at j;have m:Model.chooseNaN2 (lw y) (lw z)=none:=(Model.chooseNaN2_eq_none_iff _ _).2 ⟨Χ e,Χ g⟩ rw[na];rw[Model.withNaNSelection_of_none _ _ m];rw[Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ j];rcases h.2.2 with d | d | rfl .rw[AD d,compare_lt_iff_lt.mpr (f0 y z d)] .rw[AC (UInt32.lt_asymm d),compare_gt_iff_gt.mpr (f0 z y d)] .rw[AC (UInt32.lt_irrefl _),compare_eq_iff_eq.mpr rfl] by_cases l:kz y=0 .rcases cn y l with rfl | rfl<;>decide .have o:Model.isZero (lw y)=Н:=by rw[lw];rw[Model.isZero_eq_beq_zero_of_toDyadic?_some e,decodeD_sig_zero];simpa using l simp[o] .exact aS _ lemma fe(w k U n:п)(e:0na m (lw I[U+t/k*w+t%k]!)) (lw d):=by rw[iJ _ _ _ _ _ _ _ e,List.foldl_hom lw];exact λ_ _=>(bf _ _).symm lemma iE: pd (kI u:Model lM)=u:=by show BD (kI u:Model lM).bits=u;rw[pe] lemma aT(d:kq u≠0): m0 u=⟨kS u,2^23+(lA u)г,((kq u)г:р)-150⟩:=by rw[m0];rw[AC d] lemma cJ(f:п)(e:f<2^23): kU (2^23+f) (2^23)=0:=by have d:(2^23+f)з=23:=by rw[mh А];constructor<;>omega rw[kU];rw[d,Nat.log2_two_pow] simp[mA,mN, ν]<;>omega lemma eJ:kQ (m*2^23) (2^23)=m:=by rw[kQ];simp lemma gY(q:Е)(p:lA d=0)(u:kS d=Н) (M:(kq d)г=qг+127) (v:kq d≠255) (x:qг<(kq r)г) (j:kq r≠255): kL (n5 (lw r) (lw d))=r-(q<<<23):=by have N:=a8 r;have O:=aQ r;have U:(kq r)г≠255:=λh=>j (Ε.mp (by simpa using h)) have A:kq r≠0:=λh=>by simp[h]at x have B:kq d≠0:=λh=>by simp[h]at M have L:=fracOf_toNat_lt r;rw[nn];unfold pS lw rw[kK r j,kK d v,aT r A,aT d B, p,u] have l:((2:п)^23==0)=Н:=Б;have m:(2^23+(lA r)г==0)=Н:=П simp only[m3,ϕ,Bool.xor_false,l,m,fT,ite_false] change kL (nT FloatFormat.binary32 (kS r) (2^23+(lA r)г) (2^23) _)=_ rw[<-no, bC] unfold ph;rw[cJ _ L];simp only[l,m,fT,ite_false,Aj,sub_zero];rw[AC А,AC А,AC А];have D:(2^23+(lA r)г).shiftLeft 23=(2^23+(lA r)г)*2^23:= ν _ _ rw[show((23:р))=Int.ofNat 23 fromО, mf] rw[D,eJ];have K:((2^23+(lA r)г:п)==pT 24)=Н:=by simp[pT];omega simp only[K,fT,ite_false];rw[AC А];set e:=r-(q<<<23)with F;have o:(q<<<23)г=qг*2^23:=by rw[϶];simp[ν];omega have g:eг=rг-qг*2^23:=by rw[F,nv _ _ (by rw[UInt32.le_iff_toNat_le,o];omega),o] rw[<-nU];conv_rhs=>rw[<-iE e,ofUInt32_eq_ofFields] have H:kS e=kS r:=by rw[ϒ,aj,aj,g];omega have I:(kq e)г=(kq r)г-qг:=by rw[a8 e,g];omega have J:(lA e)г=(lA r)г:=by rw[aQ e,g];omega have G:Int.toNat (((kq r)г:р)-150-(((kq d)г:р)-150)+127)= (kq r)г-qг:=А rw[H,I,J,G,(Б:pT 23=2^23),ϳ];rfl lemma iV(s:kt)(h:s&&&0x7FFFFFFF=0):s=0\/s=0x80000000:=by have e:=s.toNat_lt;have d:(s&&&0x7FFFFFFF)г=sг%2^31:=by rw[Ν,show(0x7FFFFFFF:Е)г=2^31-1 fromО, θ] rw[h]at d;rw[<-Ε,<-Ε];simp at d⊢;omega lemma cg(e:r=0\/r=0x80000000)(g:kq d≠0)(j:kq d≠255)(l:kS d=Н): kL (n5 (lw r) (lw d))=r:=by have m:kq r≠255:=by rcases e with rfl | rfl<;>decide have p:m0 r=⟨kS r,0,0⟩:=by rcases e with rfl | rfl<;>rfl rw[nn];unfold pS lw;rw[kK r m,kK d j,aT d g,l,p];have o:(2^23+(lA d)г==0)=false:=by simp simp[o,fT,Л,Ay,К,Bool.xor_false];rcases e with rfl | rfl<;>rfl lemma aY{a b:Е}(h:aby have:=ώ.mp h;rw[e]at this;omega abbrev av:т:=toWord (Ar (ofW (dotOf n fa λ_=>oneW)) (ofW d)) lemma gd(v:DQ d):eT r d=kL (n5 (lw r) (lw d)):=by obtain⟨e,l,m⟩:=v;have g:kq d≠255:=aY m;unfold eT;dsimp only;split .obtain⟨q,j,o,p⟩:=‹_/\_›;have u:(kq d)г=(kq d-127)г+127:=by rw[nv _ _ j];have:=UInt32.le_iff_toNat_le.mp j;simp at this⊢;omega exact(gY r d _ q e u g (ώ.mp o) (aY p)).symm split .exact(cg r d (iV r ‹_›) l g e).symm .rfl lemma gj(g:п->Д)(m:п):∀d:Д, Z ((kZ m).foldl (λd t=>d+g t) d)=Z d+∑t∈kD m,Z (g t):=by induction m with | zero=>intro d;simp | succ m e=> intro d;rw[mq,lS,ly,mJ,fD,e,Λ];ring lemma jt:ac 0=0:=by rw[eM];rfl lemma gB: (decide (kz u*kz kT=0)&&Bool.xor (kS u) (kS kT))=(u==0x80000000):=by by_cases d:kz u=0 .rcases cn u d with rfl | rfl<;>decide .have:(u==0x80000000)=Н:=by rw[beq_eq_false_iff_ne];rintro rfl;exact d Б rw[this,(Б:kz kT=2^23),(Б:kS kT=Н)];simp[d] lemma dQ(c:п):∀i,i+c<=n-> (nr (kA (n:=n) λj=>fa jи) (kA (n:=n) λ_=>kT) i c=М↔ ∀t,i<=t->t< i+c->fa t=0x80000000):=by induction c with | zero=>intro i _;simp[nr];intro t d e;omega | succ c l=> intro i m rw[nr,ab n fa i А,ab n (λ_=>kT) i А, gB,Θ,l (i+1) А,AP] constructor .rintro⟨d,e⟩ t g o rcases BF g with h | h .subst h;exact d .exact e t А А .intro h;exact⟨h i (le_refl _) А,λt d e=>h t А А⟩ lemma eR(O:0kT)=0) (g:х) (L:g=М↔∀tkT)=if g then 0x80000000 else 0:=by have G:=cE n fa (λ_=>kT);have H:=dQ n fa n 0 А;have D:=ab n fa have F:=ab n λ_=>kT have d:=Ϟ (f:=λi:Fin n=>fa iи);have p:=Ϟ (f:=λ_:Fin n=>kT);rw[mc,dotSpec,Model.dot];generalize (kA (n:=n) λi=>fa iи)=A at* generalize (kA (n:=n) λ_:Fin n=>kT)=B at* have l:∀k,0<=k->k<0+(A.map (kI (fmt:=lM)))в-> kq A[k]!≠255/\kq B[k]!≠255:=λk _ e=>by rw[mO,d]at e;rw[D k А,F k А];exact⟨v k А,Б⟩ have q:∀(X:с Е),Xв=n->(∀k ∀k (e:k<(X.map (kI (fmt:=lM)))в),mB (X.map (kI (fmt:=lM)))[k]=М:=by intro X N K k e;rw[mO]at e;have j:=K k А;rw[AB X k e]at j;simp[mR,j] have m:(A.map (kI (fmt:=lM)))в=(B.map (kI (fmt:=lM)))в:=by simp[d,p] have r:=q A d λk e=>(l k А (by simp[d];omega)).1 have u:=q B p λk e=>(l k А (by simp[d];omega)).2 have o:=ϰ (destination:=lM) _ _ m r u;rw[finiteDotSlice_eq A B 0 _ (П) (by rw[<-m];simp) l]at o;rw[mO,d,G,I,lv,nf]at o rw[ϭ lM _ _ .nearestEven m r u ((ϴ _).1 o)] have⟨j,x⟩:=dotStateLoop_flags A B ({}:lZ lM) 0 _ (П) (by rw[<-m];simp) l rw[lL];rw[j,x];have J:nr A B 0 n=g:=by rw[ϒ,H,L];exact⟨λh t M=>h t А А,λh t _ M=>h t А⟩ simp only[mO,d,J];cases g<;>simp[show n≠0 by omega]<;>rfl lemma dg(w k U m:п)(l:0simp | succ m o=> rw[mq,lS,ly,mJ,Θ,o] exact⟨λ⟨g,j⟩ t d=>(Nat.lt_succ_iff_lt_or_eq.mp d).elim (g t) λe=>e▸j, λh=>⟨λt d=>h t А,h m А⟩⟩ lemma cr(d y x t:п): I[(d*h+y*k)*w+x*k+t/k*w+t%k]! =nw h w k I d y x t:=by congr 1;ring lemma d9(B c A H:Д)(D:Bа<=255)(G:cа<=62)(J:0Д) (L M:р) (T:∀tх) (I:g ()=true↔∀tkt) (v:q ()=mc n fa λ_=>kT) (d:kt) (m:DQ d): wo B A H g q d=av n fa d:=by have p:=λt e=>dC c B (fa t) D G (u t e) have K:=abs_le.mp (cH n _ _ λt e=>(T t e).2.1);have N:=abs_le.mp (cH n _ _ λt e=>(T t e).2.2);have o:af n fa (λ_=>kT)=(∑t∈kD n,bU Bа (fa t))*2^(Bа+149):=by rw[nV];refine ϓ rfl λt e=>?_ rw[fo (fa t) kT _ 126 ((p t (mr e)).2.imp_right (·.1)) (pI Б), show bU 126 kT=2^23 by decide,(А:Bа+149=Bа+126+23),AF _ (Bа+126)] ring rw[<-ϓ rfl λt e=>(T t (mr e)).1,nx,<-nV, <-sZ A (∑t∈kD n,ac (l (fa t))) (by rw[x];push_cast;simp only[gK]) (by linarith) (by linarith),<-sZ H (∑t∈kD n,ac (j (fa t))) (by rw[F];push_cast;simp only[gK]) (С) (С)]at o rw[wo,av];split .rename_i r;rw[r.1,r.2,jt]at o rw[eR n fa J (λt e=>(p t e).1) (by rw[o];ring) _ I, cg _ d (by split<;>simp) m.2.1 (aY m.2.2) m.1] .rw[gd _ d m];refine congrArg (λs=>kL (n5 (lw s) (lw d))) ?_;rw[Dense.dj,dR];split .refine(aZ n fa _ _ _ _ (λt e=>⟨(p t e).1,Б⟩) ?_ ‹_›).symm;rw[o,eP,show(B+149)а=Bа+149 by rw[η];simp;omega] .exact v lemma d7(c:Д)(x:kt)(g:Bа<=255)(m:cа<=37)(h:ok c B x=true): ac 0*2^25+ac (t1 B x)=bU Bа x/\|ac (t1 B x)|<=2^(24+cа)-1/\ |ac 0|<=0:=by obtain⟨-,j⟩:=dC c B x g А h;obtain⟨l,d⟩:=fm B x cа А j;have:2^(24+cа)<=2^61:=Η Г А;have e:ac (t1 B x)=bU Bа x:=by unfold t1 bU sv;rw[ja _ _ А,l];cases kS x<;>simp only[fT,ite_true,ite_false,neg_mul]<;>push_cast<;>ring rw[jt,e];refine⟨Р,?_,П⟩;rw[bU,sv] cases kS x<;>simp only[fT,ite_true,ite_false,neg_mul,BB]<;> rw[Ad В]<;>exact Int.le_sub_one_of_lt (by exact_mod_cast d) lemma eg(f:kt->Д)(h w k:п)(I:с kt)(d y x:п)(e:0by interval_cases t<;>assumption, λH=>⟨⟨⟨H 0 Б,H 1 Б⟩,H 2 Б⟩,H 3 Б⟩⟩ lemma gZ:(eF u)а=(kq u)г:=by rw[eF,kq];simp lemma g7(x:kt):ar x<=255:=by rw[ar];split .rw[ζ,ao];rw[ks];have:=mC x;split<;>simp<;>omega .exact UInt64.le_refl _ lemma mn(a b:Д):(n8 a b)а=n8 aа bа:=by show(if a<=b then a else b)а=_;split<;>rename_i h .have:=ζ.mp h;omega .have:=mt ζ.mpr h;omega lemma dB(a b:Д):n8 a b<=a:=ζ.mpr (by rw[mn];omega) lemma fP(a b:Д):n8 a b<=b:=ζ.mpr (by rw[mn];omega) lemma fQ(a b:Д):a<=max a b:=by show a<=if a<=b then b else a;split<;>simp_all lemma fU(a b:Д):b<=max a b:=by show b<=if a<=b then b else a;split<;>rename_i h<;>simp_all[ζ];omega lemma cO(x:kt)(B M:Д)(d:B<=ar x)(r:eF x<=M)(p:M<=n8 (B+37) 254) (o:B<=255):ok 37 B x=М:=by have j:=gZ x;have g:=ao x;have v:=mC x;have u:=ζ.mp r;have l:=ζ.mp p;have q:=ζ.mp o;rw[mn,η]at l;simp only[km]at l q;simp only[ok,Θ,AQ,Ao,nA,AP];refine⟨λe=>by rw[e]at j;simp at j;omega,?_⟩ by_cases m:mW x=0 .exact pJ m .right;rw[ar]at d;rw[AD (by simpa using m)]at d have d:=ζ.mp d;rw[g]at d;apply A4;rw[ζ,χ _ _ (ζ.mpr (by rw[g];omega)),g] rw[ks]at d⊢;split<;>simp<;>omega lemma j7(d e g j:kt) (h:max (max (eF d) (eF e)) (max (eF g) (eF j))<=n8 (n8 (n8 (ar d) (ar e)) (n8 (ar g) (ar j))+37) 254): n8 (n8 (ar d) (ar e)) (n8 (ar g) (ar j))<=255/\ cT (ok 37 (n8 (n8 (ar d) (ar e)) (n8 (ar g) (ar j)))) d e g j=М:=by have l:n8 (n8 (ar d) (ar e)) (n8 (ar g) (ar j))<=255:= ϗ (ϗ (dB _ _) (dB _ _)) (g7 d) refine⟨l,?_⟩;simp only[cT,Θ] exact⟨⟨⟨cO _ _ _ (ϗ (dB _ _) (dB _ _)) (ϗ (fQ _ _) (fQ _ _)) h l, cO _ _ _ (ϗ (dB _ _) (fP _ _)) (ϗ (fU _ _) (fQ _ _)) h l⟩, cO _ _ _ (ϗ (fP _ _) (dB _ _)) (ϗ (fQ _ _) (fU _ _)) h l⟩, cO _ _ _ (ϗ (fP _ _) (fP _ _)) (ϗ (fU _ _) (fU _ _)) h l⟩ lemma gM(B:DQ d)(j y x:п)(e:у) (D:eб=(j*h+y*2)*w+x*2) (G:(j*h+y*2)*w+x*2+w+1<2^31): gL h w I d j y x e=av (2*2) (nw h w 2 I j y x) d:=by have q:=cr h w 2 I j y x;have p:=q 0;have r:=q 1;have u:=q 2;have v:=q 3;simp only[Nat.reduceDiv,ku,nf,one_mul,Au]at p r u v;have m:kL (n5 (lw (cS h w 2 I j y x)) (lw d))=av (2*2) (nw h w 2 I j y x) d:=rfl;have:=df;have g:∀i o,I.uget i o=I[iб]!:=λi o=>(AB I _ o).symm rw[gL];dsimp only;split swap;. exact m simp(disch:=omega) only[g,lx,mi,aa,mo,D,p,r,u,v];split .rename_i l;have l:=j7 _ _ _ _ l;have A:=(cU _ (nw h w 2 I j y x)).1 l.2;exact d9 _ _ _ 37 _ _ (cv l.1) Б Б A _ (λ_=>0) _ 0 (λt F=>d7 _ _ _ (cv l.1) Б (A t F)) Б Б (by simp only[fD,show 2*2=4 fromО,Λ,Finset.sum_range_zero,Aj]) (by simp[bE]) _ (by rw[cU];simp only[AP]) _ rfl d B .exact m lemma dH(f:п->п->п->kt) (e:∀d y x,f d y x=av (k*k) (nw h w k I d y x) (natW (k*k))): eO c (h/k) (w/k) f=nX c h w k I:=by rw[iD];rw[nX];refine l7 (by simp[nY]) λq _ _=>?_ simp only[ag,Κ,nY];exact e _ _ _ lemma jD(m:п)(h:m<16384):(cK m)а<=37/\(m:р)*(2^(24+(cK m)а)-1)<2^63:=by rw[cK];split_ifs<;>simp<;>omega lemma eQ:dM=nX:=by funext c h w k I;unfold dM;dsimp only;split .rename_i d;obtain⟨e,o,u,B,m⟩:=d;split .rename_i D;obtain⟨rfl,G⟩:=D;rw[d0 _ _ _ _ _ _ _ o,Ϛ];unfold nX refine l7 (by simp[nY]) λq r _=>?_ simp only[ag,Κ,nY,Ϟ]at r⊢;have F:=(Ϲ (ϯ o u)).mpr r;have:=ϊ (q/(w/2)) o;have:=ϊ q u;have v:q/(h/2*(w/2))*h+q/(w/2)%(h/2)*2+1<=c*h:=by have:=ι h (lT F);rw[Ξ]at this;omega have A:=ι w v;rw[nC]at A;refine gM h w I _ m _ _ _ _ ?_ А rw[show(2:у)=USize.ofNat 2 from rfl,<-BK,<-ml,ύ 2, <-lP,aa _ А] .have l:=jD _ B;split .rename_i d refine dH _ _ _ _ _ _ λj y x=>?_ have g:∀tga I _ d.2 (gu _ _) _ exact d9 _ _ _ (cK (k*k)) _ _ (cv d.1) А (ϯ e e) g _ (λ_=>0) _ 0 (λt p=>d7 _ _ _ (cv d.1) l.1 (g t p)) l.2 (by simp) (eg _ h w k I j y x e) (by simp[bE]) _ (by simp only[dg _ _ _ _ _ _ e,cr,AP]) _ rfl _ m .refine dH _ _ _ _ _ _ λj y x=>?_ split .rename_i d have g:=(dg _ _ _ _ _ _ e).1 d.2;simp only[cr]at g exact d9 _ _ _ (cK (k*k)) _ _ (cv d.1) А (ϯ e e) g _ (λ_=>0) _ 0 (λt p=>d7 _ _ _ (cv d.1) l.1 (g t p)) l.2 (by simp) (eg _ h w k I j y x e) (by simp[bE]) _ (by simp only[dg _ _ _ _ _ _ e,cr,AP]) _ rfl _ m .rfl .rfl @[inline]def ij(ch y x:п)(e:у):т:= let v:=wе if hb:ena j (lw (nw h w 2 I d y x t))) (lw (nw h w 2 I d y x 0))):=by have q:=cr h w 2 I d y x;have m:=q 0;have o:=q 1;have p:=q 2;have r:=q 3;simp only[Nat.reduceDiv,ku,nf,one_mul,Au]at m o p r;have:=df;have g:∀i l,I.uget i l=I[iб]!:=λi l=>(AB I _ l).symm rw[ij];dsimp only;split .simp(disch:=omega) only[g,lx,mi,aa,mo,u] rw[<-cm (mx _ _),bf,bf,bf,bf,m,o,p,r];simp only[mq,List.range_zero,lS,ly,mJ] .rw[<-cm (wl _ _ _ _ _ _ _ _),fe I w 2 _ (2*2) Б];simp only[nw];congr 2 funext j t;congr 2;ring def d4:с т:= if k=2/\0da (ij h w I o y) 2 0 (w/2) ((o*h+y*2)*w)е) (c*(h/2)) 0 0 (AS (c*(h/2*(w/2)))) else maxpoolSpec c h w k I lemma ff:d4=maxpoolSpec:=by funext c h w k I;unfold d4;split .rename_i m;obtain⟨rfl,d,g,p⟩:=m rw[d0 _ _ _ _ _ _ _ d,Ϛ];unfold maxpoolSpec;refine l7 (by simp) λq e _=>?_ simp only[ag,Κ,Ϟ]at e⊢;have o:=(Ϲ (ϯ d g)).mpr e;have:=ϊ (q/(w/2)) d;have:=ϊ q g have j:q/(h/2*(w/2))*h+q/(w/2)%(h/2)*2+1<=c*h:=by have:=ι h (lT o);rw[Ξ]at this;omega have l:=ι w j;rw[nC]at l;refine ik h w I _ _ _ _ ?_ А rw[show(2:у)=USize.ofNat 2 from rfl,<-BK,<-ml,ύ 2, <-lP,aa _ А] .rfl end Conv section open Float.Model.UnpackedFloat local notation "ZA" =>rationalWord local notation "ZB" =>Array Word local notation "ZC" =>Core.mW local notation "ZD" =>Core.iW local notation "ZE" =>FloatFormat.toModel Fmt local notation "ZF" =>AA local notation "ZG" =>UInt64.toNat_ofNat' local notation "ZH" =>AL local notation "ZI" =>Core.ap local notation "ZJ" =>Nat.div_eq_zero_iff_lt local notation "ZK" =>sqrtLower local notation "ZL" =>AJ local notation "ZM" =>Finset.range local notation "ZO" =>mantOf_lt_24 local notation "ZQ" =>AK local notation "ZR" =>Core.ak local notation "ZS" =>Core.ao local notation "ZT" =>roundRational local notation "ZU" =>Nat.div_add_mod' local notation "ZV" =>Nat.div_le_self local notation "ZW" =>mantOf local notation "ZX" =>signOf local notation "ZY" =>AP local notation "ZZ" =>idxOf local notation "XA" =>ite_false local notation "XB" =>Ac local notation "XC" =>two_ne_zero' local notation "XD" =>Ap local notation "XE" =>ExtendedMantissa.ofMantissaAndAccuracy local notation "XF" =>UInt64.ofNat local notation "XG" =>Bool.xor local notation "XH" =>rowVariance local notation "XI" =>(А) local notation "XJ" =>(В) local notation "XK" =>(by simp) namespace Elem lemma VV(w:kt):(ZC w)а<2^24:=by rw[ZI];exact ZO w lemma YB(a b:kt):(ZC a*ZC b)а=ZW a*ZW b:=by rw[Ϗ,ZI,ZI];exact γ (mul_mant_lt a b) end Elem open Elem namespace Norm def Ya:Accuracy->п | .exact=>0 | .inexact _=>1 lemma Yc{α:Type}(f:α->α)(n:п)(a:α): Nat.repeat f (n+1) a=Nat.repeat f n (f a):=by induction n generalizing a with | zero=>rfl | succ n d=>exact congrArg f (d a) lemma QA(R k:п)(d:Accuracy): XE (2*R+Ya d) .exact>>>(k+2)= XE R d>>>(k+1):=by show Nat.repeat k0 (k+2) _= Nat.repeat k0 (k+1) _ rw[Yc,Yc,Yc];congr 1;rcases d with _ | ⟨_ | _ | _⟩<;> simp[ExtendedMantissa.ofMantissaAndAccuracy,k0,Ya]<;>omega open FloatLib.Numerics in lemma VY(q r D t:п)(e:0rfl,<-h, show(q*D+r)/D=q by rw[Υ,Ο _ _ e,Τ d,Aj], show(q*D+r)%D=r by rw[Υ,Μ,γ d]] lemma Y5(e:р):Model.bpow e=(2:ℝ)^e:=Т lemma Vi(q b:п)(d:q≠0)(h:b<=1):(2*q+b)з=qз+1:=by have e:=ϲ d;have g:=ϙ (n:=q);rw[mh XI];omega open FloatLib.Numerics in lemma V0(s:х)(P d:п)(o:P≠0)(l:d≠0)(q r D:п) (x:0omega have g:=Vi q _ j y;have G:(r:ℝ)/D<1:=by rw[div_lt_one XJ];exact_mod_cast t have E:(0:ℝ)<=r/D:=XJ;push_cast at u v;have w:kU P d=(qз:р)+e:=by apply Model.floorLog2_eq_of_bounds P d _ o l .rw[h,Y5,ZL ZQ,ZF];gcongr;grind .rw[h,Y5,show(qз:р)+e+1=((qз+1:п):р)+e by push_cast;ring,ZL ZQ,ZF];gcongr;linarith have p:kQ (lU P d (23-((qз:р)+e))).1 (lU P d (23-((qз:р)+e))).2= roundShiftRightEven (2*q+if r=0 then 0 else 1) ((2*q+if r=0 then 0 else 1)з-23):=by rw[roundShiftRightEven_eq_roundQuotientEven,g,show qз+1-23=(qз-23)+1 by clear*-m g;omega,<-VY q r D _ x t XI] apply Model.roundQuotientEven_eq_of_rat_eq _ _ _ _ (RationalBinary.scaleByPowerOfTwo_snd_ne_zero _ _ _ l) XJ rw[Model.scaleByPowerOfTwo_real];unfold Model.scaledRatToReal;rw[h,Y5,XD,<-ZL ZQ, show e+(23-((qз:р)+e))=-((qз-23:п):р) by clear*-m g;omega, zpow_neg,ZF] push_cast;field_simp generalize F:2*q+(if r=0 then 0 else 1)=J at g p⊢;rw[kr,ite_eq_left Б,Model.ieeeRoundDyadic_eq_ieeeRoundDyadicImpl];simp only[Model.roundRat,nT,(Б:Fmt.isIEEE=true),↓reduceDIte, Model.ieeeRoundRatScaled,Model.ieeeRoundDyadicImpl,ZY,o,l,XA,w, Int.add_zero,nN,g,(Б:(FloatFormat.ieeeMaxNormalExponent lM:р)=127), show FloatFormat.ieeeMinNormalExponent lM=-126 by decide, show(FloatFormat.normalMantissaExpOffset lM:р)=150 by decide, show Fmt.fracWidth=23 by decide,show J≠0 by omega, show((qз+1:п):р)+(e-1)=(qз:р)+e by push_cast;ring, show¬((qз:р)+e>127) by omega,show¬((qз:р)+e< -150) by omega, show¬((qз:р)+e< -126) by omega,(А:23<=qз+1),ite_true, nO,p] lemma Y8(v:ℚ)(w:v≠0)(s:х)(u:decide (v<0)=s) (q:п) (ρ:ℚ) (o:0<=ρ) (g:ρ<1) (e:р) (j:|v|=((q:ℚ)+ρ)*(2:ℚ)^e) (p:2^25<=q) (l:-126<=(qз:р)+e) (m:(qз:р)+e<=126): ZT v= kL (kr lM ⟨s,2*q+(if ρ=0 then 0 else 1),e-1⟩):=by have h:ρ=(ρ.numл:ℚ)/ρ.den:=by conv_lhs=>rw[<-Rat.num_div_den ρ] congr 1;exact_mod_cast(Int.toNat_of_nonneg (Rat.num_nonneg.mpr o)).symm have d:=ρ.den_pos;generalize ρ.den=D,ρ.numл=r at h d;subst h;have t:r(z:ℝ)) j;rw[Rat.abs_def,Rat.divInt_eq_div]at this;push_cast at this;rwa[Nat.cast_natAbs,mv] lemma Q7(R:п)(s:р)(h:2^25<=R): -s+1<=(ZE).targetExponent (kN R (-s)):=by have:=(md XI).2 h;have:(ZE).mantissaBits<=25:=Б;rw[BQ,kN];omega lemma Vd(v:ℚ)(q:0simp lemma YN(w:kt):(sv w:ℚ)=0↔ZW w=0:=by rw[sv];split_ifs<;>simp lemma Vr(w:kt):(sv w:ℚ)=(if ZX w then-1 else 1)*ZW w:=by rw[sv];simp lemma Y7(x:Д):(ZR x)а=xаз:=by rw[aC];rfl @[specialize]def Yh(x:ZB)(i stop u:п):п:= if ih (by rw[<-ZI,d];rfl) grind lemma Yi(x:ZB)(d:п): ∀k i u,d-i=k->Yh x i d u<=u/\ ∀j,i<=j->jZW x[j]! =0\/Yh x i d u<=ZZ x[j]!:=by intro k;induction k<;>intro i u h<;>rw[Yh] .grind .rename_i e;rw[AD XI];dsimp only;rw[YK,ZS];grind def VJ(x:ZB)(u j:п):п:= (ZW x[j]!*ZW x[j]!)<<<(2*(ZZ x[j]!-u)) @[specialize]def Yl(x:ZB)(u i stop:п)(l h:Д)(c big:п):п:= if i>>1)>>>(63-k)else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l'>>1)>>>(63-kж) else d<<<(kж-64))а*2^64=dа*2^k/\ (if kж<64 then(d>>>1)>>>(63-kж) else d<<<(kж-64))а<2^62:=by have g:kжа=k:=by rw[Ϥ,ZG,γ XI] by_cases h:k<64 .have j:kж<64:=by rw[μ,g];simpa simp only[j,К,ψ,ο,χ _ _ (show kж<=63 by rw[ζ,g];simp;omega),g,km, ν,β,γ h, γ (А:63-k<64),ku,lQ] have e:2^1*2^(63-k)=2^(64-k):=by rw[<-AF];congr 1;omega have l:2^64=2^(64-k)*2^k:=by rw[<-AF];congr 1;omega rw[e,l,Nat.mul_mod_mul_right,<-Ϛ,<-Ϝ,Nat.mod_add_div'];exact⟨О,AN (ZV _ _) XI⟩ .have j:¬kж<64:=by rw[μ,g];simp;omega have m:dа*2^(k-64)<2^62:= calc _<2^48*2^14:= ll o (Η XJ XI) XJ _=_:=О simp only[j,XA,ϋ,Ι,ψ,χ _ _ (show(64:Д)<=kж by rw[ζ,g];simp;omega),g, km,γ (А:k-64<64),ν, γ (А:dа*2^(k-64)<2^64)] refine⟨?_,m⟩;rw[Ϛ,<-AF];congr 2;omega lemma Vb(x:ZB)(u d:п): ∀k i (l h:Д) c big,d-i=k-> Yl x u i d l h c big=big+lа+hа*2^64+c*2^128+ ∑j∈ZM k,VJ x u (i+j):=by intro k;induction k<;>intro i l h c big q<;>rw[Yl] .rw[AC XI];simp only[ν,Finset.range_zero,Finset.sum_empty];ring .rename_i p;rw[AD XI,lN];have e:∀j,VJ x u (i+(j+1))=VJ x u (i+1+j):=λj=>by rw[lG];rfl simp only[e,ϕ];have o:VJ x u i=(ZC x[i]!*ZC x[i]!)а* 2^(2*((ZD x[i]!)а-u)):=by rw[VJ];rw[ν,YB,ZS] have r:(ZC x[i]!*ZC x[i]!)а<2^48:=by rw[YB];have:=ZO x[i]! calc _<2^24*2^24:=ϔ this this _=_:=О rw[o];generalize (ZD x[i]!)а-u=g at* generalize ZC x[i]!*ZC x[i]! =m at* by_cases t:g<=39 .have:=VL m (2*g) r XI;generalize (if(2*g)ж<64 then m<<<(2*g)жelse 0)=v at* generalize (if(2*g)ж<64 then(m>>>1)>>>(63-(2*g)ж) else m<<<((2*g)ж-64))=w at* rw[p (i+1) _ _ _ _ XI];clear q o;have:=l.toNat_lt;have:=h.toNat_lt;have:=v.toNat_lt;simp only[η,μ,Aw k9,km];grind .rw[AC t,p (i+1) _ _ _ _ XI,ν];ring lemma Yk(n:п)(f:п->ℚ)(a:ℚ): (kZ n).foldl (λt j=>t+f j) a=a+∑j∈ZM n,f j:=by induction n generalizing a with | zero=>simp | succ n d=> rw[mq,lS,d,Λ];simp;ring lemma VG(d u:п)(h:u<=d): ((2:ℚ)^((d:р)-149))^2=(2:ℚ)^(2*(d-u))*(2:ℚ)^(2*(u:р)-298):=by rw[<-ZF ((2:ℚ)^((d:р)-149)) 2,<-zpow_mul, <-ZF (2:ℚ) (2*(d-u)),<-ZL ZQ] grind lemma Ye(w:kt)(u:п)(h:ZW w=0\/u<=ZZ w): ZA w^2= (((ZW w*ZW w)<<<(2*(ZZ w-u)):п):ℚ)*2^(2*(u:р)-298):=by rw[Y1,ν];rcases h with h | h .rw[(YN w).2 h,h];simp .rw[mul_pow,show(sv w:ℚ)^2=(ZW w:ℚ)*ZW w by rw[<-sq_abs,VT];ring,VG _ _ h];grind def Yf(num den:п)(s:р):т:= toWord (Model.ofModel Fmt (roundWithAccuracy (ZE) .positive (ZK num den) (-s) (sqrtAccuracy num den))) open Float.Model in lemma Q4(spec:Format)(g:pv)(R:п)(e:р)(d:Accuracy)(l:R≠0) (p:e+1<=spec.targetExponent (kN R e)): m4 spec g R e d=n9 spec g (2*R+Ya d) (e-1):=by have m:Ya d<=1:=by cases d<;>simp[Ya] have h:kN (2*R+Ya d) (e-1)=kN R e:=by unfold kN;rw[Vi R _ l m];omega unfold n9 decreaseExponent;simp only[h];rw[(А:(e-1-spec.targetExponent (kN R e))л=0)];simp;unfold m4 shiftToTargetExponent shiftToExponent;rw[h];generalize o:spec.targetExponent (kN R e)=T at* have⟨k,j⟩:∃k,(T-e)л=k+1:=⟨(T-e)л-1,XI⟩;dsimp only;rw[j,(А:(T-(e-1))л=k+2),QA,show e-1+((k+2:п):р)=e+((k+1:п):р) by push_cast;ring] lemma Vh(e d:п): Ya (sqrtAccuracy e d)=if e=ZK e d^2*d then 0 else 1:=by unfold sqrtAccuracy;dsimp only;split_ifs<;>rfl lemma V9(e d:п)(s:р)(p:33554432<=ZK e d) (l:ZK e d>>>31=0) (m:-209<=s) (o:s<=297): Yf e d s=aB false (XF (2*ZK e d+ (if e=ZK e d*ZK e d*d then 0 else 1))) (XF (297-s)л):=by set R:=ZK e d with g have h:(XF (297-s)л)а=(297-s)л:=by rw[ZG,γ XI] have q:(if e=R*R*d then 0 else 1)<=1:=by split_ifs<;>omega have j:(XF (2*R+(if e=R*R*d then 0 else 1)))а= 2*R+(if e=R*R*d then 0 else 1):=by rw[ZG,γ XI] rw[aK _ _ _ XI,h,j];rw[Yf];rw[<-g,Q4 _ _ R (-s) _ XI (Q7 R s XI),Vh,<-g,sq, show(((297-s)л:п):р)-298=-s-1 by omega] rfl @[inline]def YG(num den R:п)(s:р):т:= if R>>>31==0&&-209<=s&&s<=297 then Core.aB Н (XF (2*R+(if num==R*R*den then 0 else 1))) (XF (297-s)л) else Yf num den s lemma Vc(e d:п)(s:р)(g:33554432<=ZK e d): YG e d (ZK e d) s=Yf e d s:=by rw[YG];split next h=> simp at h;rw[V9 e d s g h.1.1 h.1.2 h.2];simp simp def V8(B:п)(c:р):п:=if 0<=c then B<<rw[ν] .refine⟨e,?_⟩;push_cast;rw[<-ZF (2:ℚ) cл,(А:((cл:п):р)=c)];ring .refine⟨XJ,?_⟩;push_cast;rw[<-ZF (2:ℚ) (-c)л,(А:(((-c)л:п):р)=-c)];have:(2:ℚ)^(-c)≠0:=XJ;rw[zpow_neg];grind def V5(A Dn u:п)(eps:т):т:= let E:=ZW eps let ie:=ZZ eps let w0:=min (2*u) (ie+149) let B:=(A<<<(2*u-w0))+((Dn*E)<<<(ie+149-w0)) let s:р:=(350-(w0:р)-((Bз:р)-(Dnз:р)))/2 let c:р:=(w0:р)-298+2*s let num:=V8 B c let den:=YF Dn c let R:=ZK num den if 33554432<=R then YG num den R s else sqrtRational ((A:ℚ)*2^(2*(u:р)-298)/Dn+ZA eps) lemma YW(A e u:п)(d:kt)(t:0 (2:ℚ)^j=2^k*2^((g:р)-298):=by intro k j h;rw[h,<-ZF,<-ZL ZQ];ring_nf have:=congrArg (λz:ℚ=>(z:ℝ)) (w.trans (by rw[<-v,ZL ZQ,m (2*u-g) (2*(u:р)-298) XI, m (l+149-g) ((l:р)-149) XI,ν,ν] push_cast;field_simp: _=((A:ℚ)*2^(2*(u:р)-298)/e+E*2^((l:р)-149))*2^(2*s))) push_cast at this⊢;omega .rfl @[inline]def VO(x k:п):п:= if k<63&&x>>>(63-k)==0 then(xж<<>>63==0 then(ZR xж)аelse xз @[inline]def V2(r:п)(st:х):п:=if r !=0||st then 1 else 0 lemma VI(N M:п)(e:0decide (v<0)=s) (p:0<=δ) (q:δ<1) (w:l=М↔δ≠0) (x:0 ((Ym x u i d P N).1:р)-(Ym x u i d P N).2= (P:р)-N+∑j∈ZM k,YS x u (i+j):=by intro k;induction k<;>intro i P N h<;>rw[Ym] .rw[AC XI];simp .rename_i g;rw[AD XI];simp only[Yz,ZI,ZS,lN];have e:∀j,YS x u (i+(j+1))=YS x u (i+1+j):=λj=>by rw[lG];rfl simp only[e,ϕ];rw[YS];grind lemma Yx(x:ZB)(u j:п) (h:ZW x[j]! =0\/u<=ZZ x[j]!): ZA x[j]! =(YS x u j:ℚ)*2^((u:р)-149):=by rw[Y1];rw[YS];rcases h with h | h .rw[(YN _).2 h,h];simp .rw[show(2:ℚ)^((ZZ x[j]!:р)-149)=(2:ℚ)^(ZZ x[j]!-u)*2^((u:р)-149) by rw[<-ZF,<-ZL ZQ];congr 1;omega,Vr,ν];split_ifs<;>push_cast<;>ring lemma VW(n:п)(x:ZB)(r u:п) (d:∀j,r*n<=j->jZW x[j]! =0\/u<=ZZ x[j]!): (∑j∈ZM n,ZA x[r*n+j]! = ((((Ym x u (r*n) (r*n+n) 0 0).1:р)-(Ym x u (r*n) (r*n+n) 0 0).2:р):ℚ)* 2^((u:р)-149))/\ (∑j∈ZM n,ZA x[r*n+j]!^2= ((Yl x u (r*n) (r*n+n) 0 0 0 0:п):ℚ)*2^(2*(u:р)-298)):=by rw[VN x u _ n _ 0 0 XI,Vb x u _ n _ 0 0 0 0 XI];push_cast[sub_zero,Aj,ϋ,ϵ,ϕ,Ι,nV];constructor<;>refine ϓ rfl λj e=>?_<;>rw[ϧ]at e;exacts[Yx x u _ (d _ XI XI),Ye _ u (d _ XI XI)] lemma YA(n:п)(x:ZB)(r u:п) (d:∀j,r*n<=j->jZW x[j]! =0\/u<=ZZ x[j]!): XH n x r 0= ((Yl x u (r*n) (r*n+n) 0 0 0 0:п):ℚ)*2^(2*(u:р)-298)/n:=by unfold rowVariance;rw[Yk,Aj];simp only[sub_zero];rw[(VW n x r u d).2] @[inline]def Y0(a b:п):п:=if b<=a then a-b else b-a lemma YO(a b:п):((Y0 a b*Y0 a b:п):ℚ)=((a:ℚ)-b)^2:=by rw[Y0];split_ifs with h .push_cast[h];ring .push_cast[(А:a<=b)];ring lemma VF(n:п)(x:ZB)(r u:п)(w:0jZW x[j]! =0\/u<=ZZ x[j]!): let pn:=Ym x u (r*n) (r*n+n) 0 0 let Q:=Yl x u (r*n) (r*n+n) 0 0 0 0 m5 n x r=((pn.1:ℚ)-pn.2)*2^((u:р)-149)/n/\ XH n x r (m5 n x r)= ((n*Q-Y0 pn.1 pn.2*Y0 pn.1 pn.2:п):ℚ)* 2^(2*(u:р)-298)/((n*n:п):ℚ):=by intro pn Q;obtain⟨d,m⟩:=VW n x r u t;push_cast at d have g:m5 n x r=((pn.1:ℚ)-pn.2)*2^((u:р)-149)/n:=by unfold m5;rw[Yk,Aj,d] set c:ℚ:=2^((u:р)-149)with q;have l:(2:ℚ)^(2*(u:р)-298)=c^2:=by rw[q,<-ZF,<-zpow_mul];ring set S:ℚ:=(pn.1:ℚ)-pn.2 with o;have h:XH n x r (m5 n x r)= ((n:ℚ)*Q-S^2)*c^2/((n:ℚ)*n):=by unfold rowVariance;rw[Yk,Aj,g,ϓ rfl λj _=>show(ZA x[r*n+j]!-S*c/n)^2= ZA x[r*n+j]!^2-2*(S*c/n)*ZA x[r*n+j]!+(S*c/n)^2 by ring,nx,nu, <-Finset.mul_sum,d,m,l,Finset.sum_const,Finset.card_range,nsmul_eq_mul] field_simp;ring have v:(0:ℚ)<=(n:ℚ)*Q-S^2:=by have e:0<=XH n x r (m5 n x r):=by unfold rowVariance;rw[Yk,Aj];positivity rw[h,le_div_iff₀ XJ,nf]at e;exact(mul_nonneg_iff_of_pos_right XJ).1 e have p:Y0 pn.1 pn.2*Y0 pn.1 pn.2<=n*Q:=(Nat.cast_le (α:=ℚ)).1 (by rw[YO];push_cast;linarith) refine⟨g,?_⟩;rw[h,pC p,YO,<-o,l];simp def sg(s:х)(M:ℚ):ℚ:=if s then-M else M lemma Q6(w:kt):(ZC w !=0)=!decide (ZW w=0):=by rw[show(ZC w !=0)=!(ZC w==0)fromО,YK] lemma Y2(w:kt):ZA w=sg (ZX w) (ZW w)*2^((ZZ w:р)-149):=by rw[Y1,Vr];rw[sg];simp lemma Yn(a b:п):sg (decide (asimp only[ite_true,υ,ite_false]at j⊢<;>rw[w]at j<;> constructor<;>linarith only[j,r,t,p,q] end NF namespace NE open NF Dense.F open Dense (au) @[inline]def mx(a b:Д):Д:=if arename_i h<;>rw[μ]at h<;>omega @[inline]def pk(s:х)(q σ:Д):т:= ((if s then(0x80000000:Д)else 0)+((σ-146)<<<23+Core.aw (((2:Д)*q+1)<<<36)))й @[inline]def el(x g b:т)(nd nS R pz:ф)(A1 A2 C1:Д)(slow:Unit->т):т:= let v:=(dw x*nd+nS)*dw g*R+dw b*pz let B:=v.toBits let E:=eF B let σ:=E-C1 let M:=mF B let L:=M&&&0x7FFFFFF let c:=mx (mx (E+10) (Core.iW b+A1)) (Core.iW g+A2)-E if 146<=σ&&σ<=398&&c<=25&&(1<<>>63!=0) (M>>>27) σ else slow () lemma j8(s:х)(q σ:Д)(j:2^25<=qа)(l:qа<2^26)(m:146<=σа) (o:σа<=398):pk s q σ=aB s ((2:Д)*q+1) σ:=by have d:((2:Д)*q+1)а=2*qа+1:=by rw[η,Ϗ];simp only[km];omega have g:(((2:Д)*q+1)<<<36)а=(2*qа+1)*2^36:=by rw[ψ,d];simp only[km,ku,ν];omega have h:(σ-36)а=σа-36:=by rw[χ σ 36 (ζ.2 (by simp only[km];omega))];rfl have e:aB s ((2:Д)*q+1) σ=aB s (((2:Д)*q+1)<<<36) (σ-36):=by rw[ck s ((2:Д)*q+1) σ А А, ck s (((2:Д)*q+1)<<<36) (σ-36) А А,d,g,h, show(2:р)^σа=2^36*2^(σа-36) by rw[<-AF,Nat.add_sub_cancel' (А:36<=σа)]] cases s<;>simp only[ite_true,ite_false,υ]<;>push_cast<;>ring_nf have p:(pk s q σ)г=(if s then 2^31 else 0)+((σа-146)*2^23+ (aw (((2:Д)*q+1)<<<36))а):=by obtain⟨-,-,t⟩:=bK s (((2:Д)*q+1)<<<36) (σ-36) А А А А;unfold pk rw[ϫ,η,η,ψ, χ σ 146 (ζ.2 (by simp only[km];omega))] cases s<;>simp only[ite_true,ite_false,υ,km,ku,ν]<;>omega obtain⟨r,-,-⟩:=bK s (((2:Д)*q+1)<<<36) (σ-36) А А А А;rw[e];apply Ε.mp;omega lemma pB(a b:ℝ)(p q:ℕ)(d:|a|<=2^p)(e:|b|<=2^q):|a*b|<=2^(p+q):=by rw[Ae,AF];exact mul_le_mul d e (Aa _) В lemma sB(a b:ℝ)(p:ℕ)(d:|a|<=2^p)(e:|b|<=2^p):|a+b|<=2^(p+1):=by rw[pow_succ];grind lemma eB(x y:ℝ)(p:ℕ)(h:|x-y|<=|y|/2^53+1/2^1075)(g:|y|<=2^p):|x|<=2^(p+1):=by have e:(1:ℝ)<=2^p:=one_le_pow₀ Г;have d:(1:ℝ)/2^1075<=1/2^1:=AV Г Г;rw[pow_one]at d;have:=AY x y;rw[pow_succ];grind lemma mo(a:ℝ)(p q:ℕ)(h:|a|<=2^p)(d:p<=q):|a|<=2^q:= h.trans (AU Г d) lemma z9(a:ℝ)(p:ℕ)(h:|a|<=2^p)(d:p<=971):|a|<=(2:ℝ)^(971:ℤ):=by rw[show(971:ℤ)=((971:ℕ):ℤ)fromО,AA];exact mo a p 971 h d lemma wB(w:kt):|(sv w:ℝ)*2^ks w|<=2^(24+ks w):=by rw[Ae,AW (by positivity:(0:ℝ)<2^idxOf w),AF] have:|(sv w:ℝ)|<=2^24:=by rw[<-mv,Ϻ];exact_mod_cast(bi w).le exact AE this В lemma jE(A H w p G R κ l a t j v q:ℝ)(o c E u y x:ℕ) (hA:A=H+w) (he:|w+p|<=q) (z:|a-A|<=|A|/2^53+1/2^1075) (B:|t-a*G|<=|a*G|/2^53+1/2^1075) (D:|j-t*R|<=|t*R|/2^53+1/2^1075) (V:|v-(j+l)|<=|j+l|/2^53+1/2^1075) (g:0<=R) (hR:|R-κ|<=R/2^50) (hκ:0<=κ) (Y:|v|<=2^53*(2:ℝ)^((o:ℤ)-1075)) (ah:|l|<=2^(24+E+x)) (hG:|G|<=2^(24+u)) (a0:u<=254) (a6:κ<=2^53) (al:R<=2^52) (as:10<=c) (aH:E+x+1056<=c+o) (N:q=0\/(q=2^y/\y+u+1154<=c+o)): |v-((H-p)*G*κ+l)|<=2^c*(2:ℝ)^((o:ℤ)-1075):=by refine(?_:_<=(|v|+|l|)/2^45+q*|G| *κ+ (4*(1/2^1075)+4*(1/2^1075*R)+4*(1/2^1075*(|G| *R)))).trans ?_ .set τ:ℝ:=1/2^1075 with hτ have m:0<=τ:=В;have r:=Aa G have X:|j+l|<=2*|v|+2*τ:=by have:=AY (j+l) v;rw[Av]at this;linarith only[this,V,Aa v,m] have M:|t| *R<=2*|j|+2*τ:=by have:=AY (t*R) j;rw[Av]at this;rw[Ae,Ad g]at this D;linarith only[this,D,Aa j,m] have K:|a| *|G|<=2*|t|+2*τ:=by have:=AY (a*G) t;rw[Av]at this;rw[Ae]at this B;linarith only[this,B,Aa t,m] have J:|A|<=2*|a|+2*τ:=by have:=AY A a;rw[Av]at this;linarith only[this,z,Aa a,m] have L:|j|<=2*|v|+2*τ+|l|:=by have:=Ag (j+l) (-l);rw[BB]at this;simp only[add_neg_cancel_right]at this;linarith only[this,X] rw[Ae a G]at B;rw[Ae t R,Ad g]at D;have p1:=AE B g;have p2:=AE K g;have p3:=AE z (Af r g);have p4:=AE J (Af r g);have p5:=mul_le_mul_of_nonneg_left hR (Af (Aa A) r) have p6:|w+p| *|G| *κ<=q*|G| *κ:= AE (AE he r) hκ have e:v-((H-p)*G*κ+l)=(v-(j+l))+(j-t*R)+(t-a*G)*R+(a-A)*(G*R) +A*G*(R-κ)+(w+p)*G*κ:=by rw[hA];ring rw[e] have T:∀a b c d e f:ℝ,|a+b+c+d+e+f|<=|a|+|b|+|c|+|d|+|e|+|f|:=λa b c d e f=>by have q1:=Ag (a+b+c+d+e) f;have q2:=Ag (a+b+c+d) e;have q3:=Ag (a+b+c) d;have q4:=Ag (a+b) c;have q5:=Ag a b;linarith only[q1,q2,q3,q4,q5] have s1:=T (v-(j+l)) (j-t*R) ((t-a*G)*R) ((a-A)*(G*R)) (A*G*(R-κ)) ((w+p)*G*κ);simp only[Ae,Ad g,Ad hκ]at s1;have Y:=Aa v;have hb:=Aa l;have S:=Aa j;have U:τ<=1/2^1075:=le_of_eq hτ;clear_value τ;have O:0<=τ*R:=Af m g;have Q:0<=τ*(|G| *R):=Af m (Af r g) linarith only[s1,V,X,D,p1,p2,p3,p4,p5,p6,L,M,Y,hb,S,U,m,O,Q,r] set T:ℝ:=(2:ℝ)^((c:ℤ)-2+o-1075)with W have z:(2:ℝ)^c*(2:ℝ)^((o:ℤ)-1075)=4*T:=by rw[W,<-AA,<-AJ Г,show(4:ℝ)=2^(2:ℤ) by norm_num,<-AJ Г] ring rw[z];have F:∀a b:ℤ,a<=b->(2:ℝ)^a<=2^b:=λa b h=>AG Г h have t1:|v|/2^45<=T:=calc _<=2^53*(2:ℝ)^((o:ℤ)-1075)/2^45:=by gcongr _=(2:ℝ)^((8:ℕ)+((o:ℤ)-1075)):=by rw[AJ Г,AA];field_simp _<=T:=F _ _ А have j:|l|/2^45<=T:=calc _<=(2:ℝ)^(24+E+x)/2^45:=by gcongr _=(2:ℝ)^(((24+E+x:ℕ):ℤ)-45):=by rw[Ac Г,AA];norm_num _<=T:=F _ _ XI have t3:q*|G| *κ<=T:=by rcases N with I | ⟨I,aL⟩ .rw[I,nf,nf];positivity rw[I];calc _<=(2:ℝ)^y*2^(24+u)*2^53:=by gcongr _=(2:ℝ)^(((y+(24+u)+53:ℕ):ℤ)):=by rw[AA];ring _<=T:=F _ _ (by push_cast;omega) have g1:|G|<=2^278:=hG.trans (AU Г А) have a2:(1:ℝ)/2^1075*R<=1/2^25:=calc _<=(1:ℝ)/2^1075*2^52:=by gcongr _=1/2^1023:=by field_simp _<=_:=AV Г Г have a3:(1:ℝ)/2^1075*(|G| *R)<=1/2^25:=calc _<=(1:ℝ)/2^1075*(2^278*2^52):=by gcongr _=1/2^745:=by field_simp _<=_:=AV Г Г have a4:(1:ℝ)/2^21<=T:=by rw[W,show(1:ℝ)/2^21=2^(-21:ℤ) by norm_num];exact F _ _ А have a1:(1:ℝ)/2^1075<=1/2^25:=AV Г Г;have a5:(12:ℝ)*(1/2^25)<=1/2^21:=by grind linarith only[t1,j,t3,a1,a2,a3,a4,a5] end NE namespace NR open NF Dense.F open Dense (au) @[inline]def pt(j:п):ф:=P.get! (j+1) @[inline]def p2(e:п):ф:=pt (min e 254)*pt (e-min e 254) lemma jn(j:п)(g:j<=254):fv (pt j)/\rv (pt j)=(2:ℝ)^j:=by have h:pt j=pw j:=by have d:P.get! (j+1)=P.data[j+1]!:=by rcases P with⟨e⟩;rfl rw[pt];rw[d,AB P.data (j+1) (by simp[P];omega)] simp only[P,Κ];rw[AD А];rfl rw[h];exact fW j А lemma jm(e:п)(l:e<=508):fv (p2 e)/\rv (p2 e)=(2:ℝ)^e:=by have⟨d,h⟩:=jn (n8 e 254) А;have⟨g,j⟩:=jn (e-n8 e 254) А have:=aA _ _ d g 1 (e:ℤ) (by rw[h,j,<-AF,AA];push_cast;rw[one_mul];congr 1;omega) Б А (bg 1 e 971 А Г 1 Б) rw[p2];refine⟨this.1,?_⟩;rw[this.2,AA];simp structure fC where td:т ok:х nS:ф R:ф pz:ф A1:Д A2:Д C1:Д @[inline]def eC(n:п)(t:п×п×х×п×п×т):fC:= let k2:=t.2.1-21 let Sm:=VO t.2.2.2.1 (t.2.1-k2)+(t.2.2.2.2.1>>>k2) let es:=k2+t.1 let d:=t.2.2.2.2.2 let D:=nж*Core.mW d let lD:=Core.ak D let s:=lD-11 let R0:=((0x8000000000000000/D)<<>>53==0&& decide (es<=500), (if t.2.2.1 then z.toInt64 else(0-z).toInt64).toFloat*p2 es, R0.toInt64.toFloat,p2 Zrа,Zr+1056,if k2==0 then 0 else esж+1154,Zr+900⟩ lemma kb(D s:Д)(d L:п)(m:Dа=d)(h:2^L<=d)(j:d<2^(L+1)) (y:sа=L-11) (t:11<=L) (u:L<=36): (((0x8000000000000000/D)<<>>(k-21))=((o<<>>(k-21):=by simp only[ν,β] rw[show o*2^k=o*2^(k-(k-21))*2^(k-21) by rw[Ap,<-AF];congr 2;omega, Υ (o*2^(k-(k-21))*2^(k-21)) v,Ο _ _ В,Υ] rw[eC]at h⊢;dsimp only at h⊢;rw[Yz,ah]at h⊢ simp only[Θ,AL,BH,AQ,Ao,ζ, km,AP]at h have⟨⟨⟨⟨⟨⟨hn,a4⟩,aH⟩,t⟩,A⟩,a7⟩,Q⟩:=h;have q:((o<<>>(k-21)<2^53:=XI;generalize hS:(o<<>>j=e at q⊢;have U:=lc d;have ba:2^23<=kz d:=by rw[kz];rw[AC aH];omega have a3:nжа=n:=Α (А:n<2^64) have p:(nж*mW d)а=n*kz d:=by rw[Ϗ,a3,ap,γ];have:=ϔ hn U;omega generalize hD:nж*mW d=D at t A⊢;rw[hD]at p;have hL:=Y7 D;generalize bb:ak D=x at t A hL⊢;set L:=xаwith bh;have w:n*kz d≠0:=XJ;have I:2^L<=n*kz d:=by rw[hL,p];exact ϲ w have al:n*kz d<2^(L+1):=by rw[hL,p];exact ϙ have a5:(x-11)а=L-11:=by rw[χ _ _ (ζ.2 (show(11:Д)а<=xаfrom t))];rfl have J:=kb D (x-11) (n*kz d) L p I al a5 t A;generalize bp:((0x8000000000000000/D)<<<(x-11))+(((0x8000000000000000%D)<<<(x-11))/D)=g at J⊢;set y:=n*kz d with G;have l:0omega .show ac (0-eж)=_;rw[au,Ζ,hz] rw[ϋ,ϕ];omega have B:=cG _ (by rw[W];split<;>simp<;>omega) rw[W]at B;have⟨f2,v2⟩:=jm (j+u) А have:=aA _ _ B.1 f2 (if X then(e:ℤ)else-(e:ℤ)) ((j+u:ℕ):ℤ) (by rw[B.2,v2,AA]) (by split<;>simp<;>omega) А (bg 53 (j+u) 971 А AO _ (by split<;>simp<;>omega)) refine⟨this.1,?_⟩;rw[this.2,AA];simp . rw[<-as];by_cases z:j=0 .refine⟨0,?_,pJ rfl⟩ rw[z]at m;rw[<-m,z,Nat.shiftRight_zero,Ι];simp refine⟨2^(j+u),?_,pI ⟨О,?_⟩⟩;swap .simp only[z,AP,An];rw[η,Α (А:j+u<2^64)] simp only[km];omega have a1:((e*2^j:ℕ):ℝ)<=S:=by exact_mod_cast N have a2:(S:ℝ)<((e*2^j+2^j:ℕ):ℝ):=by exact_mod_cast O push_cast at a1 a2;have hu:(0:ℝ)<2^u:=В;have Y:=AE a1 hu.le;have b2:=AI a2 hu;have b3:(0:ℝ)<=2^j*2^u:=В;rw[AF,A0];constructor<;>linarith only[Y,b2,b3] . have B:=cG g.toInt64 (by show(ac g)к<2^53;rw[au];split<;>omega) refine⟨B.1,?_⟩;rw[B.2];show((ac g:ℤ):ℝ)=gа;rw[au];rw[AC А];simp . have H:(0:ℝ)linarith only[c1,c2,c3] . rw[r];exact jm (ks d+L+52) А .rw[Rat.cast_ne_zero,Y1,V] positivity .have a6:((ZA d:ℚ):ℝ)=(kz d:ℝ)*2^ks d/2^149:=by rw[Y1,V];push_cast;rw[Ac Г,AA];ring have h1:(n:ℝ)≠0:=by exact_mod_cast a0.ne' have h2:(kz d:ℝ)≠0:=by exact_mod_cast(by omega:mantOf d≠0) rw[a6,G];push_cast;field_simp;ring .rw[η,r];simp only[km];omega .split .simp .rw[η,Α (А:j+u<2^64)];simp only[km];omega .rw[η,r];simp only[km];omega lemma j6(n:п)(g:n<2^29):fv nж.toInt64.toFloat/\rv nж.toInt64.toFloat=n:=by have d:nжа=n:=Α (А:n<2^64) have e:nж.toInt64м=n:=by show ac nж=n;rw[au,d];split<;>omega have:=cG _ (by rw[e];simp;omega);rw[e]at this;omega lemma g0(a:ZB)(h:∀i (d:ikt)(n u k J K:ℕ)(sS:х)(ρ:NR.fC)(l:ℚ) (hρ:ρ=NR.eC n (u,k,sS,J,K,d)) (hx:kq x≠255) (hg:kq g≠255) (hb:kq b≠255) (b6:0simp only[BB,nt]<;>exact_mod_cast b1.le have ha:=fA (dw x*p) ρ.nS hX.1 E.1 (z9 _ _ (sB _ _ _ bX bS) Г);have ba:|rv (dw x*p+ρ.nS)|<=2^555:=eB _ _ _ ha.2 (sB _ _ _ bX bS) have bG:|rv (dw g)|<=2^278:=by rw[vg];exact mo _ _ _ wg А have ht:=fM (dw x*p+ρ.nS) (dw g) ha.1 fg (z9 _ _ (pB _ _ _ _ ba bG) Г);have bt:|rv ((dw x*p+ρ.nS)*dw g)|<=2^834:=eB _ _ _ ht.2 (pB _ _ _ _ ba bG) have bR:|rv ρ.R|<=2^52:=by rw[hR.2,nt];exact_mod_cast b0 have G:=fM ((dw x*p+ρ.nS)*dw g) ρ.R ht.1 hR.1 (z9 _ _ (pB _ _ _ _ bt bR) Г);have bb:|rv ((dw x*p+ρ.nS)*dw g*ρ.R)|<=2^887:=eB _ _ _ G.2 (pB _ _ _ _ bt bR) have bB:|Bz|<=2^(24+ks b+j):=by rw[r.2,AF,<-Ap,Ae,AW (by positivity:(0:ℝ)<2^j),AF (2:ℝ) (24+ks b)] exact AE wb В have a7:|Bz|<=2^887:=mo _ _ _ bB А have hv:=fA ((dw x*p+ρ.nS)*dw g*ρ.R) (dw b*ρ.pz) G.1 r.1 (z9 _ _ (sB _ _ _ bb a7) Г);generalize hV:(dw x*p+ρ.nS)*dw g*ρ.R+dw b*ρ.pz=V at hc hv;simp only[Θ,AL,ζ,μ,km]at hc;obtain⟨⟨⟨⟨ch,c1⟩,X⟩,B⟩,as⟩:=hc have eb:(eF V.toBits)а<2048:=by rw[eF];rw[Β];exact AN ϟ Б have bq:ρ.C1<=eF V.toBits:=ζ.2 (by have:=Ζ (eF V.toBits) ρ.C1;omega) have ds:(eF V.toBits-ρ.C1)а=(eF V.toBits)а-(900+j):=by rw[χ _ _ bq,bp] rw[ds]at ch c1;have M:1046+j<=(eF V.toBits)а:=XI;have bs:¬eF V.toBits=0:=λh0=>by rw[h0]at M;simp at M set H:=(eF V.toBits)аwith dy;have aL:=eE (eF V.toBits+10) (iW b+ρ.A1);have D:=eE (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2);have b4:(eF V.toBits+10)а=H+10:=by rw[η];simp;omega have A:(iW b+ρ.A1)а=ks b+j+1056:=by rw[η,ao,bh];omega have b5:(iW g+ρ.A2)а=ks g+ρ.A2а:=by rw[η,ao];omega rw[b4,A]at aL;rw[aL,b5]at D have ah:eF V.toBits<=mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2):=by rw[ζ,D];omega have z:=χ _ _ ah;rw[D]at z;generalize ex:mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2)-eF V.toBits=cc at z X B as;set c:=ccаwith ew have L:((1:Д)<<>>63!=0 then-(I:ℝ)else I)*U:=XI;have N:I<2^53:=XI;have d1:2^52<=I:=XI have bv:|rv V|<=2^53*U:=by rw[a3,Ae,AW W,Aw _root_.abs,BB,nt,ite_self];gcongr;exact_mod_cast N.le have dm:κ<=2^53:=by grind have al:eS=0\/(eS=2^es/\es+ks g+1154<=c+H):=b2.imp id λ⟨h0,hA⟩=>⟨h0,by clear*-hA z;omega⟩ have m:=jE _ Xn _ ((if sS then-(S:ℝ)else S)*2^u) _ _ κ Bz _ _ _ _ eS H c _ _ es j rfl (by rw[E.2];split<;>[skip;rw[<-BB]]<;>exact(congrArg _root_.abs (Р)).trans_le Q) ha.2 ht.2 G.2 hv.2 (by grind) (by grind) dd bv bB (by grind) ig dm (by grind) XI XI al have hY: ((sv x:ℝ)*2^ks x*n-(if sS then-(S:ℝ)else S)*2^u)*((sv g:ℝ)*2^ks g)*κ+ (sv b:ℝ)*2^(ks b+j)= (((ZA x-l)*ZA g/ZA d+ZA b:ℚ):ℝ)*(2^149*2^j):=by have e:∀w:kt,((ZA w:ℚ):ℝ)=(sv w:ℝ)*2^ks w/2^149:=by intro w;rw[Y1];push_cast;rw[Ac Г,AA];ring push_cast;rw[e x,e g,e b,o,AF];have e2:(n:ℝ)≠0:=XJ;rw[hZ];field_simp rw[show Xn=(sv x:ℝ)*2^ks x*n by rw[hX.2];push_cast;ring,r.2,vg]at m rw[hY]at m;generalize eq:(ZA x-l)*ZA g/ZA d+ZA b=Y at m a2⊢;have c2:=i8 _ ((Y:ℝ)*(2^149*2^j)) _ _ _ _ c W a3 rfl B aH m;set q:=I/2^27 with hq;have b7:2^25<=q:=XI;have cb:q<2^26:=XI;set e:ℤ:=(H:ℤ)-1075+27-149-j with he have e4:(2:ℝ)^27*U=(2:ℝ)^e*(2^149*2^j):=by rw[hU,he,<-AA (2:ℝ) 149,<-AA (2:ℝ) j,<-AA (2:ℝ) 27,<-AJ Г, <-AJ Г,<-AJ Г] congr 1;ring have hP:(0:ℝ)<2^149*2^j:=XJ;have⟨lo,hi⟩:=c2;have k1:((q:ℕ):ℝ)*2^27*U=(q:ℝ)*2^e*(2^149*2^j):=by grind have k2:(((q:ℕ):ℝ)+1)*2^27*U=((q:ℝ)+1)*2^e*(2^149*2^j):=by grind rw[k1]at lo;rw[k2]at hi;set s:=V.toBits>>>63!=0 with hs have k3:(if s then-((Y:ℝ)*(2^149*2^j))else(Y:ℝ)*(2^149*2^j))= (((if s then-Y else Y:ℚ)):ℝ)*(2^149*2^j):=by split<;>push_cast<;>ring rw[k3]at lo hi;have dt:=BC lo hP.le;have b3:=BC hi hP.le have a6:(q:ℚ)*2^e<(if s then-Y else Y):=by exact_mod_cast(by push_cast;ring:(((q:ℚ)*2^e:ℚ):ℝ)=(q:ℝ)*2^e).trans_lt dt have A:(if s then-Y else Y)<((q:ℚ)+1)*2^e:=by exact_mod_cast b3.trans_eq (by push_cast;ring:((q:ℝ)+1)*2^e=((((q:ℚ)+1)*2^e:ℚ):ℝ)) have a0:(0:ℚ)<2^e:=XJ;have v:0<(if s then-Y else Y):=AN В a6;have t:|Y|=(if s then-Y else Y):=by grind set δ:ℚ:=(if s then-Y else Y)/2^e-q with hδ;have c3:0<δ:=by rw[hδ,sub_pos,lt_div_iff₀ a0];exact a6 have c4:δ<1:=by rw[hδ,sub_lt_iff_lt_add,div_lt_iff₀ a0];linarith only[A] have d2:qз=25:=le_antisymm (Nat.lt_succ_iff.1 ((mT А).2 cb)) ((md А).2 b7) have e3:(mF V.toBits>>>27)а=q:=by rw[ο,<-O];simp only[km,ku,β];omega rw[j8 _ _ _ XI XI XI XI] rw[<-Qx s q М 1 e Y δ ((2:Д)*(mF V.toBits>>>27)+1) (eF V.toBits-ρ.C1) (by intro _;split at t<;>rename_i h<;>simp only[h,ite_true,υ,ite_false]at v⊢<;> simp only[AL,decide_eq_false_iff_not,not_lt]<;>linarith only[v]) c3.le c4 (by grind) one_pos (by rw[t,hδ];field_simp;ring) XI (by grind) (by grind) (by rw[η,Ϗ,ο];simp[V2,<-O];omega) XI] end NE local instance:Inhabited NR.fC:=⟨⟨0,Н,0,0,0,0,0,0⟩⟩ def Yy(n:п)(eps:т)(x:ZB)(r:п):т:= let lo:=r*n let u:=Yh x lo (lo+n) 255 V5 (Yl x u lo (lo+n) 0 0 0 0) n u eps lemma V7(n:п)(d:kt)(x:ZB)(r:п)(g:0у->у->т)(s:σ)(lo i e:у)(out:ZB):ZB:= if h:iу->у->kt)(s:σ)(g e:у)(i:у)(d:ZB): (Yq f s g i e d).toList=d.toList++(pM iб (eб-iб)).map λq=>f s qе (qе-g):=by induction h:eб-iбgeneralizing i d<;>rw[Yq]<;>have:=e.toNat_lt_size .rw[dif_neg (by rw[ε];omega)];simp .rename_i j;rw[AT (ε.mpr XI),j _ _ (by rw[uS XI];omega),uS XI,BN];simp @[specialize]def Yr{σ:Type}(g:п->σ)(f:σ->у->у->т)(n rows r:п)(out:ZB):ZB:= if rσ)(f:σ->у->у->kt)(n d r:п)(e:ZB)(m:d*n<2^32): (Yr g f n d r e).toList=e.toList++(pM (r*n) ((d-r)*n)).map λq=>f (g (q/n)) qе (qе-(q/n*n)е):=by induction h:d-r generalizing r e<;>rw[Yr] .grind .rename_i k l;have:=ι n (А:r+1<=d);rw[Ξ]at this rw[AD XI,l (r+1) _ XI,jR,Conv.aa _ (А:r*n<2^32),Conv.aa _ (А:r*n+n<2^32), List.append_assoc,ϳ,add_one_mul,add_one_mul,Υ (k*n),<-List.range'_append_1,List.map_append] congr 2;apply List.map_congr_left;intro i j;rw[List.mem_range'_1]at j;rw[ϱ j.1 (add_one_mul r n▸j.2)] lemma Ys{σ:Type}(g:п->σ)(f:σ->у->у->kt)(n d:п)(j:d*n<2^32)(F:Fin (d*n)->kt) (h:∀q (h:qby rw[show qе=(q%n+q/n*n)е by rw[Nat.mod_add_div']];rw[lP,ml,USize.add_sub_cancel] apply Array.toList_inj.mp;rw[jS _ _ _ _ _ _ j];simp only[e];apply List.ext_getElem<;>simp;omega def cQ(x:ZB)(i e:у)(u:Д):Д:= if h:irw[cQ,Yh]<;>have:=e.toNat_lt_size .rw[dif_neg (by rw[ε];omega),AC XI] .rename_i g;rw[AT (ε.mpr XI),AD XI,g _ _ (by rw[uS XI];omega),uS XI,fX];congr 1 split_ifs with h2 d<;>(try rw[μ]at d)<;>omega structure jP where l:Д h:Д c:п big:п P:п N:п @[inline]def cA(P:п)(q p:Д):п:=if q

>>1)>>>(63-k)else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l'dsimp only<;>unfold cC Yl Ym<;>have:=e.toNat_lt_size .rw[dif_neg (by rw[ε];omega)];simp only[show¬iбrename_i g<;>(try rw[χ _ _ g])<;>rw[ζ]at g<;>simp<;>omega) rw[o];generalize q:(ZD w)а-uа=d;have t:dжа=d:=by simp<;>omega have p:(2:Д)*dж=(2*d)ж:=ξ.mp (by simp<;>omega) simp only[t,p,show dж<=39↔d<=39 by rw[ζ,t];rfl];split_ifs<;> refine⟨(j _ _ _ _ _ _ _ _ _ XI).1,(j _ _ _ _ _ _ _ _ _ XI).2.trans ?_⟩<;>simp(disch:=assumption) only[jW,cy,jQ,lG _ (VO _ _)] @[inline]def az(a b:Д):Д×Д:= let a0:=a%Ж;let a1:=a/Ж;let b0:=b%Ж;let b1:=b/Ж let p00:=a0*b0;let p01:=a0*b1;let p10:=a1*b0 let m:=p00/Ж+p01%Ж+p10%Ж (a1*b1+p01/Ж+p10/Ж+m/Ж,m%Ж*Ж+p00%Ж) lemma aV(a b:Д):(az a b).1а*2^64+(az a b).2а=aа*bа:=by unfold az;simp only[η,Ϗ,ma,np,km];have:=a.toNat_lt;have:=b.toNat_lt;generalize aа=A,bа=B at* have e:A*B=A/Ж*(B/Ж)*2^64+(A%Ж*(B/Ж)+A/Ж*(B%Ж))*2^32+ A%Ж*(B%Ж):=by conv_lhs=>rw[<-ϛ A Ж,<-ϛ B Ж] ring have⟨d,g,h,j⟩:A%Ж<=4294967295/\B%Ж<=4294967295/\A/Ж<=4294967295/\B/Ж<=4294967295:=А;have:=ϩ d g;have:=ϩ d j;have:=ϩ h g;have:=ϩ h j;omega @[inline]def cR(ah al mm:Д)(k:п):Д×Д:= let K:=kж let bl:=al+(if K<64 then mm<<>>1)>>>(63-K)else mm<<<(K-64))+(if bl>>1)>>>(63-kж)else d<<<(kж-64))=o at* have:=g.toNat_lt;have:=l.toNat_lt;simp only[η,μ,Aw k9,km];grind @[inline]def fL(bh bl:Д):Д:=if bh !=0 then 64+ZR bh else ZR bl lemma hO(d g:Д):(fL d g)а=(dа*2^64+gа)з:=by have:=g.toNat_lt;rw[fL];split_ifs with h .have e:(dа*2^64+gа)>>>64=dа:=А have j:dа≠0:=by simpa[<-ξ]using h rw[bo (dа*2^64+gа) 64 (by rw[e];exact j),e,η,Y7] have:=(mT j).2 d.toNat_lt;grind .simp only[AQ,Ao,pA]at h;subst h;simp[Y7] def cP(H1 H0:Д)(t:п)(st:х)(Dn u:п)(eps:т):Д:= let sE:=ZZ eps+149-2*u let e:=cR H1 H0 (Dnж*ZC eps) (sE-t) let S2:=(1374+(ZR Dnж)а-(2*u+t+(fL e.1 e.2)а))/2 let den:=Dnж<<<(1322-(2*u+2*S2+t))ж let R:=(Float.sqrt ((e.1.toFloat*0x10000000000000000+e.2.toFloat)/den.toFloat)).toUInt64 let p:=az (R*R) den let q:=az ((R+1)*(R+1)) den if 2*u<=ZZ eps+149/\t<=sE/\sE-t<=78/\H1<0x4000000000000000/\0(cP N M t (L !=0) d u j)й=V5 A d u j:=by unfold cP;dsimp only;generalize he:cR N M _ _=e;generalize as:(fL e.1 e.2)а=W;generalize v:(1374+_-(2*u+t+W))/2=O;generalize x:1322-(2*u+2*O+t)=k;generalize w:dж<<absurd h Б rename_i hc;intro;rw[UInt32.toUInt32_toUInt64];have⟨V,K,h3,h1,r,l,hS,D,E,F,g,S,a1,a0⟩:=hc;have hD:dжа=d:=Α (l.trans Б);have:=ϔ l (ZO j);have hm:(dж*ZC j)а=d*ZW j:=by rw[Ϗ,hD,ZI];omega have h6:=f9 N M _ _ (С) h3 (by simpa[μ]using h1) rw[he,hm]at h6 have U:(e.1а*2^64+e.2а)*2^t+Lа=A+d*ZW j*2^(ZZ j+149-2*u):=by rw[h6,<-h4,Ϝ,Ϛ (d*_),<-mS,Nat.sub_add_cancel K];ring have a2:(L !=0)=(Lа!=0):=by rw[ϒ];simp[AQ,<-ξ] rw[a2];generalize Lа=L at U hL;have z:=hO e.1 e.2;have:=e.2.toNat_lt;have:=p.2.toNat_lt;have:=q.2.toNat_lt;have hR:33554432<=Rа:=S;rw[as]at z;rw[Y7,hD]at v;generalize hH:e.1а*2^64+e.2а=H at U z;generalize ah:A+_=B at U have y:oа=d*2^k:=by have:=ϔ l (lh Nat.one_lt_two (А:k<44)) rw[<-w,ψ,hD,Ϥ,ZG,γ (А:k<2^64),γ (А:k<64), ν,γ this] have Q:(R+1)а=Rа+1:=by rw[η];simp;omega have hq:∀m:Д,mа<=2^31->(m*m)а=mа*mа:=λm h=>by rw[Ϗ];apply γ;have:=ϩ h h;omega rw[hq _ g.le,y]at I;rw[hq _ (Q▸g),Q,y]at J;simp only[μ,ζ,<-ξ]at a1 a0;generalize hX:Rа*Rа*(d*2^k)=X at I;generalize hY:(Rа+1)*(Rа+1)*(d*2^k)=Y at J;have hT:=ϸ t;have h1:=ι (2^t) (А:X<=H) have K:=ι (2^t) (А:H+1<=Y) have G:∀a,a*(d*2^(k+t))=a*(d*2^k)*2^t:=λa=>by rw[mS];ring have w:0>>t=H:=by rw[β,<-U,Υ,Ο _ _ hT,Τ hL,Ι] rw[bo B t А,e,z] have aL:(p.1==e.1&&p.2==e.2&&!(L !=0))=(B==Rа*Rа*(d*2^(k+t))):=by rw[G,hX];apply ϒ.2;simp only[Θ,ZY,<-ξ,BH,bne_eq_false_iff_eq];constructor .grind .intro h4 have:X=H:=by by_contra;have:=ι (2^t) (show X+1<=H fromА);rw[Ϝ]at this;omega omega unfold V5;dsimp only rw[min_eq_left V,Nat.sub_self,BE,ν,ah,al, show(350-((2*u:п):р)-(((t+W:п):р)-(dз:р)))/2=(O:р)-512 by clear*-v x V K hS D E F r l g;omega, show((2*u:п):р)-298+2*((O:р)-512)=-((k+t:п):р) by clear*-v x V K hS D E F r l g;omega, show V8 B (-((k+t:п):р))=B by rw[V8];split_ifs .rw[show(-((k+t:п):р))л=0 by clear*-x;omega,BE] .rfl, show YF d (-((k+t:п):р))=d*2^(k+t) by rw[YF];split_ifs .simp[(А:k+t=0)] .rw[Int.neg_neg,Int.toNat_natCast,ν], <-aH,AD hR];rw[YG] rw[AD (show(Rа>>>31==0&&decide (-209<=(O:р)-512)&&decide ((O:р)-512<=297))=М by simp only[Θ,ZY,ZH];clear*-v x V K hS D E F r l g;omega),<-aL] congr 1 .apply ξ.1;rw[ZG,η,Ϗ] split<;>simp<;>clear*-g<;>omega .congr 1;omega lemma jM(z m a d e:Д)(h:z≠0\/¬(msimp only[Ζ,km]<;>omega lemma jv(e d:Д): ((e/Ж)а*2^64+(e%Ж*Ж+d/Ж)а)*2^32+(d%Ж)а=eа*2^64+dа:=by have:=e.toNat_lt;have:=d.toNat_lt;simp only[η,Ϗ,ma,np,km];omega @[inline]def ed(l h:Д)(c S n Dn u:п)(eps:т):Д:= let a:=az nж l let b:=az nж h let m:=a.1+b.2 let z:=b.1+nж*cж let s:=az Sж Sж if n<1024/\S<2^64/\c<1024/\a.1<=m/\(z≠0\/¬(m(ed l h c S n Dn u eps)й=V5 (n*Q-S*S) Dn u eps:=by unfold ed;dsimp only;have ha:=aV nж l;have hb:=aV nж h;have hs2:=aV Sж Sж;generalize az nж l=a at ha⊢;generalize az nж h=b at hb⊢;generalize az Sж Sж=s at hs2⊢;split;swap;exact λh=>absurd h Б rename_i hc;obtain⟨hn,hS,hc4,hm,hz⟩:=hc;have hn64:nжа=n:=Α (hn.trans Б);rw[hn64]at ha hb;rw[Α hS]at hs2;have hA:=jM _ _ _ _ _ hz rw[hs2,show(b.1+nж*cж)а*2^128+(a.1+b.2)а*2^64+a.2а=n*Q by have:=h.toNat_lt;have:=b.2.toNat_lt;have:=a.1.toNat_lt;have:n*hа<1024*2^64:=ll hn (le_of_lt h.toNat_lt) Б;have:n*c<1024*1024:=ϔ hn hc4;rw[ζ,η]at hm rw[η,η,Ϗ,hn64,Α (hc4.trans Б), γ (a:=n*c) А,γ А,γ А,hQ] rw[Nat.mul_add,Nat.mul_add,<-Ϛ,<-Ϛ,<-ha,<-hb];ring]at hA generalize b.1+nж*cж-_=r2 at hA⊢;generalize a.1+b.2-s.1-_=r1 at hA⊢;generalize a.2-s.2=r0 at hA⊢;have:=r1.toNat_lt;have:=r0.toNat_lt;split .rename_i h0;rw[h0]at hA;split .have h1:=cd r1 r0 0 0 Dn u (n*Q-S*S) eps (by rw[<-hA];simp) (by simp);simp only[bne_self_eq_false]at h1 split .omega .split .rename_i hc;obtain⟨h0,hu,-⟩:=hc;rw[<-jO _ _ _ _ hD he hu] exact cd _ _ _ 32 _ _ _ eps (by rw[jv,<-hA,h0];simp) (by simp) omega .exact cd _ _ _ 32 _ _ _ eps (by rw[jv,<-hA];simp) (by simp;omega) .exact cd _ _ _ 64 _ _ _ eps (by rw[<-hA];ring) r0.toNat_lt def gI(n:п)(eps:т)(x:ZB)(r:п):т:= let lo:=r*n let u:=cQ x loе (lo+n)е 255 let st:=cC x u loе (lo+n)е 0 0 0 0 0 0 0 0 let F:=λ(_:Unit)=>V5 (st.big+st.lа+(st.hа+st.c<<<64)<<<64) n uа eps let v:=if st.big=0 then ed st.l st.h st.c 0 1 n uа eps elseЖ if v<Жthen vйelse F () lemma gJ(n:п)(eps:kt)(x:ZB)(r:п)(hn:0NR.eC 1 (0,0,Н,0,0,gI n eps x r)) (λe i j=>let xw:=ci x i;let gw:=ci g j if ZC xw==0 then ZT 0 else if e.ok then NE.el xw gw 0 nd e.nS e.R e.pz e.A1 e.A2 e.C1 (λ_=>ZT (ZA xw*ZA gw/ZA e.td)) else ZT (ZA xw*ZA gw/ZA e.td)) n rows 0 (Az (rows*n)) lemma Qg{α:Type}[Inhabited α]{m k:п}(f:Fin m->α)(h:k< m): (kA f)[k]! =f ⟨k,h⟩:=by rw[AB _ k (by simpa using h),Κ] lemma YP(e n:п)(h:kt)(x g:ZB)(l:0kq x[i]!≠255) (z:∀j,jkq g[j]!≠255): Yo e n h x g=rmsnormStable e n h x g:=by apply Ys _ _ _ _ w;intro i A;have r:=Ϡ (by rwa[ύ]);have B:i%nsimp[o]];simp rw[m];simp .exact(NE.je _ _ 0 d _ 1 0 0 0 0 Н _ 0 rfl (D i A) (z _ B) Б one_pos y (П) (congrArg ZT p).symm).trans (congrArg ZT p) .rfl @[inline]def SN(rows n:п)(eps:т)(x g:ZB):х:= rows>0&&n>0&&xв==rows*n&&gв==n&&x.all finiteWord&&g.all finiteWord&&finiteWord eps&&(!ZX eps&&ZC eps !=0) lemma fB(e n:п)(d:kt)(x g:ZB):SN e n d x g=mb e n d x g:=by rw[SN,mb];congr 1;rw[Q6,Y2];have:(0:ℚ)<2^((ZZ d:р)-149):=XJ;rw[sg];cases ZX d<;>simp[this,BA] lemma jd{d n:п}{e:kt}{x g:ZB}(h:mb d n e x g=М): 0kq x[i]!≠255)/\∀j,jkq g[j]!≠255:=by simp only[mb,Θ,ZH,A7]at h;have p:xв=d*n:=by simpa using h.1.1.1.1.1.2 have l:gв=n:=by simpa using h.1.1.1.1.2 exact⟨h.1.1.1.1.1.1.2,h.2,λi m=>NR.g0 x (by simpa[m6]using h.1.1.1.2) i А, λj o=>NR.g0 g (by simpa[m6]using h.1.1.2) j А⟩ def ca(rows n:п)(eps:т)(x g:ZB):ZB:= if SN rows n eps x g then if rows*n<=4294967295 then Yo rows n eps x g else rmsnormSpec rows n eps x g else rmsnormSpec rows n eps x g lemma dn:ca=rmsnormSpec:=by funext j n l x g;rw[ca];split_ifs with h hR .rw[fB]at h;rw[rmsnormSpec,rmsnormWith];rw[AD h];have⟨a,e,c,d⟩:=jd h;exact YP j n l x g a А e c d .rfl .rfl def YU(n:п)(eps:т)(x:ZB)(r:п):п×п×х×п×п×т:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let Q:=Yl x u lo (lo+n) 0 0 0 0 let pn:=Ym x u lo (lo+n) 0 0 let S:=Y0 pn.1 pn.2 let k:=Q2 (max pn.1 pn.2)-30 (u,k,decide (pn.1>>k,S&&&(VO 1 k-1),V5 (n*Q-S*S) (n*n) u eps) lemma Vn(n:п)(d:kt)(x:ZB)(r:п)(e:0jZW x[j]! =0\/t.1<=ZZ x[j]!):=by have g:=(Yi x (r*n+n) n (r*n) 255 XI).2;have⟨l,m⟩:=VF n x r _ e g;refine⟨?_,?_,g⟩ .rw[l,<-Yn];simp only[YU,Yz,ν,one_mul,θ, β,ZU] .simp only[YU];rw[YW _ _ _ _ (ϯ e e) h,m] @[inline]def gE(n:п)(eps:т)(x:ZB)(r:п):п×п×х×п×п×т:= let lo:=r*n let u:=cQ x loе (lo+n)е 255 let st:=cC x u loе (lo+n)е 0 0 0 0 0 0 0 0 let S:=Y0 st.P st.N let k:=Q2 (max st.P st.N)-30 (uа,k,decide (st.P>>k,S&&&(VO 1 k-1), let F:=λ(_:Unit)=>V5 (n*(st.big+st.lа+(st.hа+st.c<<<64)<<<64)-S*S) (n*n) uа eps let v:=if st.big=0 then ed st.l st.h st.c S n (n*n) uа eps elseЖ if v<Жthen vйelse F ()) lemma gF(n:п)(eps:kt)(x:ZB)(r:п)(hn:0NR.eC n (gE n eps x r)) (λe i j=> if e.ok then NE.el (ci x i) (ci g j) (ci b j) nd e.nS e.R e.pz e.A1 e.A2 e.C1 λ_=>gH n eps x g b iб jб else gH n eps x g b iб jб) n rows 0 (Az (rows*n)) lemma V3(e n:п)(h:kt)(x g b:ZB)(m:0kq x[i]!≠255) (F:∀j,jkq g[j]!≠255) (D:∀j,jkq b[j]!≠255): Yw e n h x g b=layernormStable e n h x g b:=by apply Ys _ _ _ _ B;intro i G;have w:=Ϡ (by rwa[ύ]);have r:i%npush_cast<;>rw[Ac Г,AA]<;>ring exact NE.je _ _ _ d _ n u k o p y _ _ rfl (H i G) (F _ r) (D _ r) m E l rfl .rfl def bn(rows n:п)(eps:т)(x g b:ZB):ZB:= if SN rows n eps x g&&bв==n&&b.all finiteWord then if rows*n<=4294967295 then Yw rows n eps x g b else layernormSpec rows n eps x g b else layernormSpec rows n eps x g b lemma cL:bn=layernormSpec:=by funext l n m x g b;rw[bn];split_ifs with h hR .rw[fB]at h;unfold layernormSpec layernormWith;rw[AD h];simp only[Θ]at h obtain⟨a,e,c,d⟩:=jd h.1.1;have o:bв=n:=by simpa using h.1.2 exact V3 l n m x g b a А e c d (λj p=>NR.g0 b (by simpa[m6]using h.2) j А) .rfl .rfl end Norm end def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.c5,Dense.e8⟩ conv:=⟨Conv.ej,Conv.cD⟩ elem:=⟨Conv.dM,Conv.d4,Bn.co,Bn.br⟩ norm:=⟨Norm.ca,Norm.bn⟩ theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm, Dense.eu,Dense.gm,Conv.ek,Conv.cV,Conv.ff,Conv.eQ, Bn.dL,Bn.cM,Norm.dn,Norm.cL] end Submission