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->Ρ,add_comm->Τ,mod_lt->ϊ,div_eq_of_lt->ώ,mul_comm->Ϗ,mul_lt_mul_of_pos_right->ϐ,add_zero->ϑ,mul_lt_mul''->ϕ,lt_log2_self->ϙ,mul_assoc->Ϛ,div_add_mod->ϛ,and_le_right->ϝ,div_lt_of_lt_mul->Ϟ,zero_le->ϟ,add_mul->Ϡ,toUInt64_eq->Ϣ,two_pow_add_eq_or_of_lt->Ϥ,mul_le_mul->ϧ,div_le_div_right->ϭ,mul_pos->Ϯ,log2_self_le->ϰ,add_sub_cancel_left->ϱ,zero_mul->ϳ,pos_of_ne_zero->ϵ,two_pow_pos->϶,div_lt_iff_lt_mul->ϸ,mul_one->ϻ open USize renaming lt_iff_toNat_lt->ε,le_size->ς,toNat_zero->Ϧ open UInt64 renaming toNat_add->η,le_iff_toNat_le->θ,lt_iff_toNat_lt->μ,toNat_shiftRight->ν,toNat_inj->ξ,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->Β,lt_iff_toNat_lt->Ι,toNat_and->Ξ,toNat_shiftRight->Υ,toNat_toUInt64->ϩ,toNat_shiftLeft->ϴ local notation "М"=>true open Array renaming getElem_ofFn->Λ,size_ofFn->Ϝ,size_push->ϣ 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->ϯ open List renaming foldl_cons->Ϸ 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->kA,ofNat->lh,toNat->lq,toNat_div->ml,toNat_or->my,toNat_ofNat->mY,toNat_mod->nB,toNat_toBitVec->nR,size->n0,toNat_one->pS open ExactRuntime renaming expOf->kB,Word->kF,idxOf->kG,mantOf->kM,toDyadic_ofUInt32->kV,toWord->kW,signOf->k9,oneW->ld,windowAt->ll,mantOf_lt_24->lB,decodeD_toRat->lG,ofW->lI,fracOf->lK,ConvShape->lR,Fmt->lU,finishWord->md,finishWord_of_ne->mf,linearSpec->mj,stableNormDomain->mq,dotOf->ms,sqrtRational->mK,expOf_toNat_lt->mO,isFinite_ofUInt32->m6,ofIntDyadic->nb,decodeD->nh,rowMean->no,dallNZ->nC,poolAt->nI,avgpoolSpec->n9,avgpoolWith->pa,ofUInt32_bits->pu,act->p8 open FloatLib.Floats.Formats.BinaryInterchange.FloatFormat renaming binary64->kC open USize renaming reduceToNat->kD,size->kX,toNat_add->lJ,toNat_one->mA,ofNat_add->mC,size_eq_two_pow->nT open FloatLib.Floats.Formats.BinaryInterchange.Model renaming roundDyadic->kE,ofFloatModel->kI,ofUInt32->kT,toReal->ls,unpackedToReal->lw,roundedMantissa_shift_quotient->lF,roundDyadic_of_representable->lL,roundAt_mono->lM,toReal_add_eq_roundAt->mH,isFinite->mN,toNatBits_lt_two_pow->mQ,posMaxFinite->mR,modelSignBit->mS,ofNatBits_toNatBits->m3,roundAt->ns,maximum->nt,ofFloatModel_pack->nu,ofFloat32Model->n5,roundRatScaled->n6,add->pb,fma->pd,div->pf,ofModel->pv,roundAt_zero->pD,pow2->p7 open Nat renaming reduceMod->kH,pow_lt_pow_right->lu,mul_lt_mul_of_lt_of_le->ly,add_right_comm->lO,testBit_eq_decide_div_mod_eq->lW,toUSize_eq->lX,div_div_eq_div_mul->lY,le_mul_of_pos_left->lZ,succ_le_of_lt->l7,le_div_iff_mul_le->mc,le_log2->mu,add_mul_div_left->mv,log2_eq_iff->mz,div_eq_of_lt_le->mG,and_one_is_mod->mP,pow_add->m7,log2_lt->m9,one_shiftLeft->na,reducePow->nr,abs_cast->nE,add_one_mul->nO,cast_ofNat->nZ,one_mul->n4,div_le_div_left->pq,div_mul_le_self->pr,add_assoc->pA,cast_one->pJ,cast_sub->pO,sub_zero->pQ open FloatArray renaming emptyWithCapacity->kJ,size->kS,uget->nN,set!->pY open Array renaming ofFn->kK,getElem?_eq_getElem->lC,emptyWithCapacity->lQ,getElem?_eq_none->l5,ext->mi,replicate->mB,getElem?_ofFn->mE,ext_getElem?->mU,size_map->m0,all_eq_true->np,getElem_push_lt->nU,getElem_push_eq->nV,uset_eq_set->pP open Float.Model.UnpackedFloat renaming unpack->kL,mul->lc,accuracyOfFraction->lP,roundWithAccuracy->nk,unpackExponent->nX,round->pp,isFinite->pE,compare->pI,Sign->pK,pack->pT open UInt32 renaming reduceToNat->kN,ofNat->lA,toNat_ofNat'->lE,toNat_add->mh,toNat->mJ,toNat_zero->nj,toNat_max->nw,toNat_sub_of_le->nG,toNat_or->nK,lt_asymm->nP,toNat_sub->pU open FloatLib.Numerics renaming binaryRadix->kO,shiftRightJam->kQ,Dyadic->kU,roundQuotientEven->la,roundShiftRightEven_shiftRightJam->lS open Finset renaming range->kP,sum_range_succ'->lV,sum_sub_distrib->nF,sum_add_distrib->nJ,sum_mul->n8 open FloatLib.Numerics.Dyadic renaming ofScaledInt->kR,signedSignificand->lr,toReal->mb,cast_signedSignificand->nf,ofScaledInt_toRat->nD,add_toRat->pF,mul_toRat->pG,toRat->pR open Float.Model renaming totalExponent->kY,add->pW,mul->pX open FloatLib.Floats.Formats.Flocq renaming bpow->kZ open Float.Model.Format renaming binary64->k0,binary32->li open FloatLib.Numerics.RationalBinary renaming floorLog2->lf,scaleByPowerOfTwo->l9,scaleByPowerOfTwo_ofNat->mw,lessThanPowerOfTwo->mM,atLeastPowerOfTwo->mZ open List renaming range->lj,foldl_append->l6,range_succ->mD,foldl_nil->mT,range'->pV open FloatLib.Numerics.FixedWord renaming roundShiftRightEven->lk open Float.Model.UnpackedFloat.ExtendedMantissa renaming shiftRightOne->lm open BitVec renaming toInt_eq_toNat_cond->lv open Float32 renaming ofBits->lx open Int renaming cast_zero->lH,cast_abs->mI,ofNat_eq_natCast->nY,ModEq->pe,log->ph open Bool renaming false_ne_true->lN,or_eq_true->nM open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState->lT,State->me open FloatLib.Floats.ExecFloat.Binary renaming toModel_ofFloat_int64ToFloat->ma,toModel_ofFloat->m5 open FloatLib.Numerics.Radix renaming toReal->mg open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->mL,finiteDotSlice->nQ open MulZeroClass renaming zero_mul->nv open System.Platform renaming numBits->nx open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec->ny open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled->nA,toUInt32_ofFields->n7,toUInt32->ps,roundRatScaled->pC open Option renaming some->pj open Min renaming min->po open Decidable renaming not_not->pM open Or renaming inl->pZ open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div->p0 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,decide_eq_true_eq->AJ,zpow_add₀->AK,two_ne_zero->AL,bne_iff_ne->AM,lt_of_lt_of_le->AN,lt_of_le_of_lt->AO,le_rfl->AP,beq_iff_eq->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,zero_add->Ai,ne_eq->Ak,ite_false->Am,getElem!_neg->An,lt_trans->Ao,mul_assoc->Ap,decide_eq_true_iff->As,add_zero->Av,abs_sub_comm->Aw,apply_ite->Ax,beq_self_eq_true->Az,abs_le->A3,pow_succ->A4,abs_zero->A5,decide_eq_true->A6,gt_iff_lt->BC,abs_neg->BE,lt_of_mul_lt_mul_right->BF open USize renaming reduceToNat->AH,size->Al,toNat_mul->BO,ofNat_mul->BP open FloatArray renaming emptyWithCapacity->AR open Array renaming emptyWithCapacity->AS,replicate->Ah,ofFn->Aj,mkEmpty->A0,size_uset->BT,size_set!->BU open Nat renaming log2->Aq,div_add_mod'->Au,mod_le->Ay,mul_zero->A7,pos_iff_ne_zero->BD,shiftLeft_zero->BH,one_le_two_pow->BI,eq_or_lt_of_le->BJ,add_sub_cancel->BK,add_sub_of_le->BQ open Model renaming div->Ar,ofFloatModel->BB,toReal_eq->BR open Or renaming inr->BA open UInt32 renaming ofBitVec->BG open Float32 renaming ofBits->BL open Bool renaming not_eq_true'->BM open ZMod renaming natCast_mod->BN open List renaming range'_succ->BS open Float.Model.Format renaming targetExponent->BV local notation "Ж"=>4294967296 structure Acc where pos:с п neg:с п special:х negZero:х def Acc.kz(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 cm(s:х)(m:п)(e:р)(j:п)(h:j+25<=mз): kE lU ⟨s,kQ m j,e+j⟩=kE lU ⟨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:(kQ m j)з=mз-j:=log2_shiftRightJam m j u;have t:kQ m j≠0:=shiftRightJam_ne_zero m j (AZ (Θ Г А) u);rw[<-Ϻ,<-Ϻ];unfold Model.roundDyadicGeneral;simp only[t,g,AQ,Am,d];clear d o u t g;rw[(А:((mз-j:п):р)+(e+j)=(mз:р)+e),show Fmt.fracWidth=23 fromО,show Fmt.minSubnormalExponent=-149 fromО,show Fmt.minNormalExponent=-126 fromО];split_ifs<;>try omega rfl;congr 1;obtain⟨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 lS m j (a+1) А;congr 1;rw[(А:mз-j-23=(mз-23)-j)];exact lS m j _ А end lemma ab(n:п)(f:п->Е)(k:п)(d:kf iи)[k]! =f k:=by rw[AB _ k (by simpa using d),Λ] @[noinline]def zPd(a:Array UInt32)(n:Nat):Array UInt32:=if a.size==n then a else a|>.push 1000|>.push 1001|>.push 1002|>.push 1003 lemma zI(a:Array UInt32)(n:Nat)(h:a.size=n):zPd a n=a:=by simp[zPd,h] 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 aG(n:п)(fa fb:п->т):Prop:=∀k,kexpOf (fa k)≠255/\expOf (fb k)≠255 lemma aK(n:п)(d e:п->kF): af (n+1) d e=af n d e+tm (d n) (e n):=by unfold af;rw[Ν] lemma gm(A B:с Е)(i c:п): dsum A B i c=∑k∈kP 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),lV,add_comm];exact congrArg₂ _ (ϔ rfl λk _=>by rw[(А:i+1+k=i+(k+1))]) rfl lemma cH(n:п)(d e:п->kF): dsum (kK (n:=n) λi=>d iи) (kK (n:=n) λi=>e iи) 0 n= af n d e:=by rw[gm,af];exact ϔ rfl λk g=>by rw[ϥ]at g;rw[Κ,ab n d k g,ab n e k g] lemma bI(n:п)(o p:п->kF)(u:aG n o p): ms n o p=md (af n o p) (-298) (decide (n≠0)&& nC (kK (n:=n) λi=>o iи) (kK (n:=n) λi=>p iи) 0 n):=by rw[ms];set A:=kK (n:=n) (o ·и)with q;set B:=kK (n:=n) (p ·и)with t;have m:∀k,kkB A[k]!≠255/\kB 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:с kF,Xв=n->(∀k,kkB X[k]!≠255)->∀k (j:k<(X.map (kT (fmt:=lU)))в),mN (X.map (kT (fmt:=lU)))[k]=М:=λX G h k j=>by 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в->kB A[k]!≠255/\kB B[k]!≠255:=λk _ F=>m k (by simpa[r,q]using F);have d:nQ 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,cH]);have y:=ϯ (destination:=lU) L R l e g;rw[dotSpec,Model.dot];by_cases v:af n o p=0;rw[v,finishWord_zero,Ϭ lU L R .nearestEven l e g ((ϲ _).1 (by simp[y,d,v]))];have⟨z,D⟩:=dotStateLoop_flags A B ({}:me lU) 0 Lв (by simp[r]) (by simp[r,q,t]) j;rw[lT,z,D];simp[r,q];rfl;rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero lU L R .nearestEven l e g (by simp[mL L R l,d,v])];exact(mf _ _ _ _ v (by rw[y,d])).symm lemma bT(n:п)(d e:п->kF)(g:aG n d e) (h:af n d e≠0): ms n d e=md (af n d e) (-298) Н:=by rw[bI n d e g];simp only[md,h,Am] @[inline]def f5(w:Е):Д:=if(w>>>23)&&&255!=0 then 1 else 0 @[inline]def mW(w:Е):Д:=(w&&&8388607)н|||(f5 w<<<23) @[inline]def iW(w:Е):Д:=((w>>>23)&&&255)н-f5 w def ae(x:Д):р:=x.toBitVec.toInt lemma gr(w:Е):(w&&&8388607)г<2^23:=by rw[Ξ];exact AO ϝ Б lemma an(w:Е):(mW w)а=kM w:=by have g:=gr w;rw[mW,f5,kM,kB,lK];by_cases d:(w>>>23)&&&255=0 .simp[d] .have e:((w>>>23)&&&255!=0)=М:=by simpa using d simp only[e,d,К,Л];rw[my,ϩ,show((1:Д)<<<23)а=2^23*1 fromО,Nat.or_comm,<-Ϥ g,ϻ,Τ] lemma am(w:Е):(iW w)а=kG w:=by rw[iW,f5,kG,kB];have g:=mO w;rw[kB]at g;by_cases e:(w>>>23)&&&255=0;simp[e];have d:1<=((w>>>23)&&&255)г:=BD.2 λh=>e (Β.1 (by simpa using h));simp only[(by simpa using e:((w>>>23)&&&255!=0)=true),e,К,Л];rw[χ _ _ (θ.2 (by simpa[ϩ]using d)),ϩ];rfl lemma ap(w:Е):k9 w=М↔2^31<=wг:=by rw[k9];have e:=w.toNat_lt;have d:(w&&&0x80000000)г=wг&&&2^31:=by rw[Ξ];rfl rw[Nat.and_two_pow,lW]at d;rw[AM,Ak,<-Β,d];by_cases h:wг/2^31%2=1<;>simp[h]<;>omega lemma fy(w:Е):(w>>>31!=0)=k9 w:=by have d:(w>>>31)г=wг/2^31:=by rw[Υ];simp[β] have:=w.toNat_lt;rw[ϓ,AM,Ak,<-Β,d,ap];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 ai(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 f7(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 de(value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then 1 else 0) @[inline]def aW(value shift:Д):Д:= if shift==0 then value else if shift<64 then de value shift else if shift==64 then(if value>0x8000000000000000 then 1 else 0) else 0 @[inline]def c9(sign:х)(e f:Е):Е:= (if sign then(0x80000000:Е)else 0)|||((e&&&255)<<<23)|||(f&&&8388607) @[inline]def d0(n:Д):Е:= (if n<8388608 then 0 else n-8388608)й @[inline]def az(sign:х)(product scale:Д):Е:= if product==0 then if sign then 0x80000000 else 0 else let leading:=ai product let position:=leading+scale if position<172 then let fraction:= if scale<149 then aW product (149-scale)else product<<<(scale-149) if fraction==0 then(if sign then 0x80000000 else 0) else if fraction==8388608 then c9 sign 1 0 else c9 sign 0 fractionй else let roundedMantissa:= if leading<23 then product<<<(23-leading)else aW 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 c9 sign (normalizedPosition-171)й (d0 normalizedMantissa) open Model.NativeBinary32 in lemma bo(n k:п)(h:n>>>k≠0):nз=k+(n>>>k)з:=by rw[β]at h⊢;have e:=(mc (϶ k)).1 (ϰ h);have d:=(ϸ (϶ k)).1 (ϙ (n:=n/2^k));rw[mz (by rintro rfl;simp at h)];simp only[Nat.pow_succ,m7]at d⊢;constructor<;>nlinarith lemma d7(x:Д):xаз<64:=by by_cases h:xа=0 .simp[h] .exact(m9 h).mpr x.toNat_lt lemma cx(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,Az,Bool.cond_true];use d;simpa[e,β,Nat.div_eq_zero_iff]using congrArg lq g;simp only[(by simpa using g:(x>>>k==0)=Н),Bool.cond_false];have q:=bo xа kа λh=>g (ξ.mp (by simpa[e]using h));have l:=d7 j;use(by rw[η,γ А,e];omega);rw[e,β];exact Ϟ (m7 _ _ _▸m.trans_eq (by congr 1;omega)) lemma dr(n:п)(h:n<2):nз=0:=by rw[Nat.log2_def,AC А] lemma aA(x:Д):ai x=x.log2:=by apply ξ.mp;rw[show x.log2а=xазfromО];have d:xа<2^(2*(32:Д)а):=x.toNat_lt;have⟨o,e⟩:=cx x 0 x 32 Б Б (П) d;obtain⟨p,g⟩:=cx x _ _ 16 Б Б o (by simpa using e);obtain⟨q,h⟩:=cx x _ _ 8 Б Б p (by simpa using g);obtain⟨r,j⟩:=cx x _ _ 4 Б Б q (by simpa using h);obtain⟨t,l⟩:=cx x _ _ 2 Б Б r (by simpa using j);obtain⟨u,m⟩:=cx x _ _ 1 Б Б t (by simpa using l);rw[dr (sx 1 (sx 2 (sx 4 (sx 8 (sx 16 (sx 32 x))))))а (by simpa using m)]at u;unfold ai;dsimp only;clear*-u;omega lemma gH(v s:Д)(o:s≠0)(h:s<64):de v s=f7 v s:=by have g:sа<64:=h;have m:(2:п)^sа<0x10000000000000000:=AN (lu Г g) Г;have e:(v&&&((1<<simp[θ,γ g,na,γ m,ζ,BI] have d:((v>>>s)&&&1)а=(v>>>s)а%2:=by simp[Ε,mP] have p:=ϊ vа (϶ sа);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,ϓ,AQ,As,<-ξ,ϋ] unfold de f7;simp only[BC,μ,j,e,l,AJ];clear e d j l m;split_ifs<;>first|rfl|omega|simp lemma eP(e d:Д): aW e d=lk e dа:=by rw[(by rw[aW];split_ifs with a b<;>first|rfl|exact gH _ _ (by simpa using a) b:aW e d=(if d==0 then e else if d<64 then f7 e d else if d==64 then(if e>0x8000000000000000 then 1 else 0) else 0)),f7,lk];have p:=d.toNat_lt;by_cases g:d=0;subst g;rfl;have j:dа≠0:=λh=>g (ξ.1 (by simpa using h));simp only[g,AQ,j,reduceIte,UInt64.ofNat_toNat,(by apply ξ.1;rw[χ _ _ (by simp[θ];omega)];simp;omega:lh (dа-1)=d-1),<-show(d<64)↔dа<64 from μ,(by rw[<-ξ];rfl:d=64↔dа=64)] open Model.NativeBinary32 in lemma eJ(d:х)(e f:п): c9 d (lA e) (lA f)=mkBits d e f:=by rw[c9,mkBits];cases d<;>rfl lemma bY(x:Д):xй=lA xа:=Т lemma c5(n:Д):d0 n=lA (nа-8388608):=by rw[d0];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 bE(g:х)(d e:Д): az g d e=roundProduct g d e:=by unfold az roundProduct;simp only[aA,eP,c5,bY];rw[show(1:Е)=lA 1 from rfl,show(0:Е)=lA 0 from rfl];simp only[eJ] open Model.NativeBinary32 in lemma bD(w:Е):kW (ofUInt32 w)=w:=by have h:=toUInt32_ofUInt32 w;unfold ps at h;unfold kW;conv_rhs=>rw[<-h] exact Β.mp (γ (BitVec.isLt _)) open Model.NativeBinary32 in lemma aJ(g:х)(m d:Д)(h:dа<=506): az g m d=kW (kE lU ⟨g,mа,(dа:р)-298⟩):=by rw[bE,roundProduct_eq_roundDyadic _ _ _ h,show kE lU ⟨g,mа,(dа:р)-298⟩=ofUInt32 (roundDyadic ⟨g,mа,Int.ofNat dа-298⟩) from(ofUInt32_roundDyadic _).symm,bD] def aw(hi lo:Д):р:=ae hi*2^64+loа @[inline]def aF(hi lo:Д):Д:=if hi>>>63!=0 then(0:Д)-lo else lo @[inline]def aQ(hi lo:Д):Д:= if hi>>>63!=0 then(if lo==0 then(0:Д)-hi else~~~hi)else hi lemma gB(d:Д):(d>>>63!=0)=decide (2^63<=dа):=by have e:(d>>>63)а=dа/2^63:=by rw[ν];simp[β] have:=d.toNat_lt;rw[ϓ,AM,Ak,<-ξ,e,As];simp lemma bN(d e:Д): aw d e=(dа*2^64+eа:р)-(if 2^63<=dаthen 2^128 else 0):=by rw[aw,ae];rw[lv,nR];omega lemma fk(e d:Д): (aw e d)к=(aQ e d)а*2^64+(aF e d)а/\ decide (aw e d<0)=(e>>>63!=0):=by have m:=e.toNat_lt;have o:=d.toNat_lt;rw[aQ,aF,bN,gB];by_cases j:2^63<=eа;simp only[j,decide_true,К];by_cases g:d=0;subst g;simp only[Az,К,ϋ];rw[Ζ];simp;omega;have l:dа≠0:=λh=>g (ξ.1 (by simpa using h));simp only[show(d==0)=false by simpa using g,υ,Am];rw[Ζ,UInt64.toNat_not];simp;omega;simp only[j,decide_false,υ,Л];simp;omega @[inline]def au(hi lo B:Д):Д:= if hi==0&&lo==0 thenЖelse if B>442 thenЖelse let neg:=hi>>>63!=0 let mlo:=aF hi lo let mhi:=aQ hi lo if mhi==0 then(az neg mlo B)н else if mhi>>>32==0 then let q:=(mhi<<<32)+(mlo>>>32) (az neg (if mlo&&&0xFFFFFFFF==0 then q else q|||1) (B+32))н else(az neg (if mlo==0 then mhi else mhi|||1) (B+64))н lemma toUInt32_toUInt64(x:Е):xнй=x:=П lemma i6(e d:Д)(h:eа<2^32): (if d&&&0xFFFFFFFF==0 then(e<<<32)+(d>>>32) else((e<<<32)+(d>>>32))|||1)а= kQ (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 kQ;simp only[(А:(eа*2^64+dа)/2^32=eа*2^32+dа/2^32),(А:(eа*2^64+dа)%2^32=dа%2^32),(by rw[<-g,ϓ,AQ,As,<-ξ,ϋ]:(d&&&0xFFFFFFFF==0)=decide (dа%2^32=0))];split_ifs<;>simp_all[my] lemma i7(e d:Д): (if d==0 then e else e|||1)а= kQ (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[kQ];rw[g,h];by_cases j:dа=0<;>simp[j,my,<-ξ] lemma eN(s:х)(q B J:Д)(M:п) (e:qа=kQ M Jа)(h:Bа<=442)(j:Jа<=64) (d:2^(Jа+25)<=M): az s q (B+J)=kW (kE lU ⟨s,M,(Bа:р)-298⟩):=by have g:(B+J)а=Bа+Jа:=by simp[η];omega rw[aJ _ _ _ А,e,g,<-cm s M _ Jа ((mu (BD.1 (AN В d))).2 d)];congr 3;omega lemma dq(d e B:Д)(h:au d e B<Ж): aw d e≠0/\Bа<=442/\ (au d e B)й= kW (kE lU (nb (aw d e) ((Bа:р)-298))):=by obtain⟨m,o⟩:=fk d e;rw[au]at h⊢;by_cases t:(d==0&&e==0)=М;simp[t]at h;simp only[t,υ,Л]at h⊢;have w:aw d e≠0:=λj=>t (by rw[bN]at j;simp only[Η,AQ,<-ξ,ϋ];clear m o h;have:=e.toNat_lt;have:=d.toNat_lt;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[nb,o,m];have r:=ν (aQ d e) 32;rw[β]at r;split;rename_i j;rw[(by simpa using congrArg lq (AQ.1 j):(aQ d e)а=0),ϳ,Κ,toUInt32_toUInt64,aJ _ _ _ А];rename_i j;have v:(aQ d e)а≠0:=λl=>j (by simp[<-ξ,l]);split;rename_i l;have q:(aQ d e)а<2^32:=by have:=congrArg lq (AQ.1 l);simp at this r;omega rw[toUInt32_toUInt64];exact eN _ _ _ 32 _ (i6 _ _ q) g Б (by simp;omega) rename_i l;have u:2^32<=(aQ d e)а:=by by_contra x;apply l;simp[<-ξ];clear*-x;omega rw[toUInt32_toUInt64];exact eN _ _ _ 64 _ (i7 _ _) g Б (by simp;omega) lemma aY(n:п)(e g:п->kF)(l m B:Д) (j:aG n e g)(d:af n e g=aw l m*2^Bа) (h:au l m B<Ж):ms n e g=(au l m B)й:=by have⟨q,r,p⟩:=dq l m B h;have o:af n e g≠0:=d▸mul_ne_zero q В rw[bT n e g j o,p];refine mf _ _ _ _ o ?_;rw[toRat_ofIntDyadic,d];push_cast;rw[Ac AL,AA];field_simp @[inline]def ar(N:Д):Д:=(N+(0x3FFFFFFFFF:Д)+((N>>>39)&&&1))>>>39 @[inline]def a8(lb v B:Д):Д:= let m:=aF v v let L:=ai m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then((v>>>63)<<<31)+((E<<<23)+ar (m<<<(62-L))) elseЖ @[inline]def bP(hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63)then a8 1 lo B elseЖ if r=Жthen au hi lo B else r lemma gA(n:х)(e f:Е): (c9 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[nK,g,Ξ,show(8388607:Е)г=2^23-1 fromО,ζ,<-Ϥ h] rw[c9,UInt32.or_assoc];cases n .simp only[υ,Л,UInt32.zero_or,d];clear*-;omega simp only[К,nK,d];rw[show(0x80000000:Е)г=2^31*1 fromО,<-Ϥ А];clear*-;omega lemma bM(n:х)(N g:Д)(o:2^62<=Nа)(p:Nа<2^63)(w:110<=gа) (v:gа<363): (az n N g)г=(if n then 2^31 else 0)+((gа-110)*2^23+(ar N)а)/\ 2^23<=(ar N)а/\(ar 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,mP] have m:(ar 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<=(ar N)а/\(ar N)а<=2^24:=by rw[m];clear*-d;split<;>omega have h:(aW N (62-23))а=(ar N)а:=by rw[m];show(de N 39)а=_;rw[de];simp only[show((1:Д)<<<39)-1=0x7FFFFFFFFF fromО,show(1:Д)<<<(39-1)=0x4000000000 fromО,BC,μ,η,(by rw[Ε];exact ζ _ 39:(N&&&0x7FFFFFFFFF)а=Nа%2^39),j,l,Ax lq,kA];clear*-d;split_ifs<;>omega have q:ai N=62:=by rw[aA];apply ξ.1;rw[show N.log2а=NазfromО,mz А];simp;omega refine⟨?_,e⟩;rw[az];have r:(N==0)=Н:=by simp[<-ξ];omega simp only[q,r,show¬62+g<172 by simp[μ];omega,(Б:¬(62:Д)<23),Л,υ];generalize aW N (62-23)=R at h⊢;have t:2^23<=Rа/\Rа<=2^24:=h▸e;rw[<-h];clear l j m h q o p d e;cases n<;>split_ifs<;>simp(disch:=first|omega|(simp[θ];omega)) only[AQ,<-ξ,BC,μ,gA,c5,Ϫ,lE,η,kA,γ,χ,К,Л,υ,not_true_eq_false]at*<;>omega lemma cl(n:х)(M σ:Д)(e:Mа≠0)(d:σа<=506): az n M σ=md ((if n then-(Mа:р)else Mа)*2^σа) (-298) Н:=by rw[aJ _ _ _ d];refine(mf _ _ _ _ (mul_ne_zero (by split<;>omega) В) ?_).symm;cases n<;>simp[pR,lr,Ac]<;>field_simp lemma f9(v:Д):(v>>>63=0/\vа<2^63)\/(v>>>63=1/\2^63<=vа):=by have:=v.toNat_lt;simp only[<-ξ,ν];simp[β];omega lemma dZ(p v B:Д)(r:1<=pа)(g:pа<=2^63)(h:a8 p v B≠Ж): pа<=(aF v v)а/\(aF v v)а<2^63/\110<=Bа/\Bа<=424/\ a8 p v B=(az (v>>>63!=0) (aF v v) B)н:=by unfold a8 at h⊢;dsimp only at h⊢;split at h;swap;exact absurd rfl h;rename_i E;rw[AD E];have⟨F,q⟩:=E;generalize aF 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:(ai m)а=mаз:=by rw[aA];rfl have t:=ϰ o;have g:=@ϙ mа;have A:=(m9 o).2 j.2;generalize ai 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:=AN (ϐ g В) (by rw[<-AF];exact Θ Г А);have w:(m<<<(62-L))а=mа*2^(62-l):=by rw[ψ,D,ο,γ (А: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];clear*-x;omega),D] have⟨K,M,N⟩:=bM (v>>>63!=0) (m<<<(62-L)) (B-(62-L)) (w▸y) (w▸z) (by rw[u];omega) (by rw[u];omega);rw[<-ξ,ϩ];have G:az (v>>>63!=0) m B=az (v>>>63!=0) (m<<<(62-L)) (B-(62-L)):=by rw[cl _ m B o А,cl _ (m<<<(62-L)) (B-(62-L)) (by rw[w];positivity) (by rw[u];clear*-x;omega),w,u];congr 1;have⟨d,J⟩:∃d,Bа=62-l+d:=⟨Bа-(62-l),by clear*-x;omega⟩;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 f9 v with⟨e,-⟩|⟨e,-⟩<;>rw[e]<;>rfl have I:((L+B-172)<<<23)а=(l+Bа-172)*2^23:=by rw[ψ,x.1];simp only[kA,kH,ο];clear*-x;omega rw[η,η,H,I];split<;>clear*-x N A<;>omega lemma fd(d v B:Д)(o:1<=dа)(j:dа<=2^63)(h:a8 d v B≠Ж): a8 d v B=au ((0:Д)-(v>>>63)) v B:=by obtain⟨m,-,-,p,e⟩:=dZ 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 au aQ aF;rcases f9 v with⟨e,-⟩|⟨e,-⟩;simp[e,l,g];rw[e,show(0:Д)-1=0xFFFFFFFFFFFFFFFF fromО];simp[l,g,show(0xFFFFFFFFFFFFFFFF:Д)>>>63=1 fromО,show~~~(0xFFFFFFFFFFFFFFFF:Д)=0 fromО] lemma dY(g d B:Д):bP g d B=au 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 fd 1 d B Б Б h .rw[AC e,AD rfl] end Core open Core lemma cn(w:kF):kW (lI w)=w:=by apply Β.mp;rw[kW,lI,Model.toNatBits,pu,lE];exact γ w.toBitVec.isLt lemma aR(z:Model lU):lI (kW z)=z:=by have h:z.toNatBits<2^32:=mQ z;rw[lI,kW,kT,lE,γ h];exact m3 z namespace Dense lemma ac{k n:у}(h:ksplit<;>push_cast<;>omega @[inline]def bj(x:Е):Е:=x&&&0x7FFFFFFF lemma aM(x:Е):(bj x)г=xг%2^31:=by rw[bj];rw[Ξ];exact ζ _ 31 lemma aN(x:Е):(kB x)г=(bj x)г/2^23:=by have:(kB x)г=xг/2^23%2^8:=by unfold kB;rw[Ξ,Υ];simp only[kN,kH,β];exact ζ _ 8 rw[this,aM,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] lemma eZ(x:Е):kB x=0↔(bj x)г<2^23:=by rw[<-Β,aN];simp;try omega lemma jO(x:Е):kG x=(bj x)г/2^23-1:=by have:=aN x;rw[kG];split<;>rename_i h .have:=(eZ x).mp h;omega .have:=mt (eZ x).mpr h;omega lemma aT(x:Е):kG x=(kB x)г-1:=by rw[jO,aN] lemma jW(w:Е):wг/2^23=(kB w)г+256*(wг/2^31):=by rw[aN,aM];have:=w.toNat_lt;omega lemma bm(x:Е):(kB x)г<256:=by rw[aN,aM];omega lemma fe(w:Е):(w&&&8388607)г=wг%2^23:=by rw[Ξ];exact ζ _ 23 lemma eR(w:Е):|sv w|<2^24:=by have:=lB 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 iZ(y:Д):bl yа<=64:=by rw[bl];split;. omega rename_i h;have:=(m9 h).mpr y.toNat_lt;omega lemma ed(y:Д):(y>>>1)а=yа/2:=by rw[ν];simp[β] lemma dA(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 dD(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[dA];simp[bl,g] have j:(n+1)а=nа+1:=by rw[η];simp;omega rw[dD (y>>>1) (n+1) (by rw[j,ed];omega),j,ed];omega termination_by yа decreasing_by rw[ed];omega @[inline]def lg(x:Д):Д:=lz (x>>>1) 0 lemma i8(x:Д):lg x=x.log2:=by apply ξ.mp;rw[lg,dD _ _ (by have:=iZ (x>>>1);simpa using this),ed,dA,ϋ,Κ];rfl @[inline]def c0(lb v B:Д):Д:= let m:=Core.aF 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.ar (m<<<(62-L))) elseЖ lemma ez:c0=a8:=by funext d v B;rw[c0,a8,aA,i8] @[inline]def b9(hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63)then c0 1 lo B elseЖ if r=Жthen Core.au hi lo B else r lemma dp:b9=bP:=by funext d e B;rw[b9,bP,ez] lemma cD{k:у}{a:с Е}(h:k>>1>>>(63-s))+(if l'simp only[kA]<;>omega @[specialize]def jG(fa fb:п->т)(n t:п)(B:Д):Д:= if tт)(n:п)(B:Д)(t:п)(pH pL nH nL:Д):Д:= if tsplit<;>push_cast<;>omega lemma fE(d g:п->kF)(n:п)(B:Д)(hn:n<2^18): ∀k t (r u o p:Д),n-t=k->t<=n->aG 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а-> dl d g n B t r u o p<Ж->ms n d g=(dl d g n B t r u o p)й:=by intro k;induction k<;>intro t r u o p hk ht S I G J j .obtain rfl:t=n:=А;rw[dl,AC А]at j⊢;exact aY _ _ _ _ _ _ S (by rw[J,ku _ _ _ _ А А]) j rename_i k e;have X:tif h:ssimp[h],Av] rename_i F;rw[AC F];obtain⟨R,O⟩:=hw λh=>F (by simp[h]);have:=idxOf_le _ K;have:=idxOf_le _ M;have Q:(iW (d t)+iW (g t))а=kG (d t)+kG (g t):=by rw[η,am,am,γ А] rw[Q]at R;have E:(iW (d t)+iW (g t)-B)а=kG (d t)+kG (g t)-Bа:=by rw[χ _ _ (by rw[θ,Q];omega),Q] rw[E]at O;have l:kM (d t)*kM (g t)*2^(kG (d t)+kG (g t)-Bа)<=2^108:=(ϧ v.le (Θ Г (А:_<=60))).trans_eq Г;have W:(2:р)^(kG (d t)+kG (g t))=2^(kG (d t)+kG (g t)-Bа)*2^Bа:=by rw[<-AF];congr 1;omega generalize w:kM (d t)*kM (g t)*2^(kG (d t)+kG (g t)-Bа)=T at l;have A:tm (d t) (g t)=(if k9 (d t)==k9 (g t)then(T:р)else-T)*2^Bа:=by rw[<-w];unfold tm sv;rw[W];cases k9 (d t)<;>cases k9 (g t)<;>simp<;>ring have V:=λH L (ah:Hа*2^64+Lа<=t*2^108)=>fD H L _ _ (by rw[E];omega) (by rw[U,E,w];omega);rw[U,E,w]at V;cases c:(k9 (d t)==k9 (g t))<;>simp only[c,К,Am,υ]at A j⊢ .have q:=V o p G;refine e (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 e (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 gf(n:п)(fa fb:п->т):т:= let r:=if n<262144 then dl fa fb n (jG fa fb n 0 1023) 0 0 0 0 0 elseЖ if r<Жthen rйelse dotOf n fa fb lemma bO(n:п)(d e:п->kF):gf n d e=ms n d e:=by unfold gf;dsimp only;by_cases g:n<262144 .rw[AD g];split .exact(fE d e n _ А _ 0 0 0 0 0 rfl А (λ_ h=>absurd h А) (П) (П) (by simp[af]) ‹_›).symm .rfl .rw[AC g,AC Б] @[noinline]def aD(n:п)(relu:х)(X W b:@&с т)(xo s j:п):т:= act relu (gf (n+1) (λt=>if tif trfl lemma gV(x y:ф)(d:fv x)(e:fv y): kI (x+y).toModel=pb (kI x.toModel) (kI y.toModel):=by change kI (pW x.toModel y.toModel)=_;rw[pW,nu];have h:=Model.add_eq_ofModel_add_of_isFinite (fmt:=kC) Б (kI x.toModel) (kI y.toModel) (by rw[ϒ];exact(fO x).1 d) (by rw[ϒ];exact(fO y).1 e);rw[ϒ,ϒ]at h;exact h.symm lemma pm(E:р)(e:E<=971):(2:ℝ)^E<=ls (mR kC):=by have h:=ϫ kC Н 1 E Б (e.trans_eq Б);simp only[υ,Am,pJ,one_mul]at h;change|(2:ℝ)^E|<=_ at h;simpa only[AW (zpow_pos (Г:(0:ℝ)<2) E)]using h open FloatLib.Floats.Formats.Flocq in lemma re(x:ℝ)(E:р)(g:-1021<=E)(e:|x|<(2:ℝ)^E): |Model.roundAt kC x-x|<=(2:ℝ)^(E-53)/2:=by by_cases d:x=0 .subst x;rw[pD,sub_zero,A5];positivity have h:magnitude kO x<=E:=magnitude_le_of_abs_lt_bpow _ x E d e;apply(Model.abs_roundAt_sub_le kC x).trans;apply div_le_div_of_nonneg_right _ Г;change ulp kO (Model.fexpOf kC) x<=(2:ℝ)^(E-53);rw[ulp.of_ne_zero _ _ x d];change(2:ℝ)^(max (magnitude kO x-53) (-1074))<=(2:ℝ)^(E-53);apply AG Г;omega lemma ii(x y:ф)(d:fv x)(e:fv y)(j:|rv x+rv y|<=ls (mR kC)): fv (x+y)/\rv (x+y)=ns kC (rv x+rv y):=by have h:=gV x y d e;have g:=Model.isFinite_add_of_abs_toReal_add_le_posMaxFinite (kI x.toModel) (kI y.toModel) Б d e j;exact⟨by rwa[fv,h],by rw[rv,h];exact mH _ _ Б d e g⟩ lemma e8(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⟩:=ii x y l m (e.le.trans (pm E d));exact⟨g,by rw[h];exact re _ E j e⟩ lemma rx(d:kU)(l:d.significand<2^53)(g:-1074<=d.exponent) (e:|d.toReal|<=(2:ℝ)^(971:р)): ns kC d.toReal=d.toReal:=by have⟨h,j⟩:=lL kC Б d d.significand 0 (П) l g (e.trans (pm 971 AP));rw[<-ό _ Б d h,j] lemma jJ(x y:ф)(o:fv x)(p:fv y)(d:kU)(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⟩:=ii x y o p (by rw[<-g];exact e.trans (pm 971 AP));exact⟨h,by rw[j,<-g];exact rx d m l e⟩ lemma dB(i:Int64)(e:iмк<2^53):fv i.toFloat/\rv i.toFloat=iм:=by have g:kI i.toFloat.toModel=kE kC (kR iм 0):=by have h:=ma i;rw[m5]at h;rw[h,<-Model.ofModel_ofInt_eq_intToFloat kC Б];exact Model.ofModel_ofInt_eq_roundDyadic kC Б _ have d:(kR iм 0).toReal=iм:=by rw[<-ϖ,nD];simp have⟨j,l⟩:=lL kC Б (kR iм 0) iмк 0 (by simp[kR]) e (by simp[kR];decide) (by rw[d];exact AZ (((by rw[<-mI,Ϲ];exact_mod_cast e.le:|(iм:ℝ)|<=(2:ℝ)^(53:п)).trans_eq (AA _ _).symm).trans (AG Г Г)) (pm 971 AP));exact⟨by rw[fv,g];exact j,by rw[rv,g,l,d]⟩ lemma jP(x y:ф):kI (x*y).toModel= pv kC (lc k0 x.toModel.unpack y.toModel.unpack):=by change kI (pX x.toModel y.toModel)=_;rw[pX,nu] lemma iR(b:BitVec 64)(s:pK)(m:п)(e:р)(h:0< m) (d:kL k0 b=.finite s m e h): 2^52<=m\/e=-1074:=by revert d;rw[kL];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 jo(x y:ф)(G:fv x)(H:fv y)(z:|rv x*rv y|<=(2:ℝ)^(971:р)): fv (x*y)/\rv (x*y)=ns kC (rv x*rv y):=by have t:=(fO x).1 G;have u:=(fO y).1 H;have E:x.toModel.unpack=kL k0 x.toModel.toBits.toBitVec:=О;have F:y.toModel.unpack=kL k0 y.toModel.toBits.toBitVec:=О;rw[iL x,iL y]at z⊢;unfold fv rv;rw[jP];generalize x.toModel.unpack=X at t E z⊢;generalize y.toModel.unpack=Y at u F z⊢;cases X<;>cases Y<;>simp only[pE,υ]at t u case finite.finite l o g v m p h w=> have A:=iR _ l o g v E.symm;have B:=iR _ m p h w F.symm;have r:g+h<=BV k0 (kY (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:=(mu В).2 (AZ A (Nat.le_mul_of_pos_right o w));omega;rcases B with B|B;left;have:=(mu В).2 (AZ B (lZ p v));omega;right;omega let q:kU:=⟨mS (l*m),o*p,g+h⟩;have D:Model.modelSign (mS (l*m))=l*m:=by cases l<;>cases m<;>rfl have d:q.toReal=lw (.finite l o g v)*lw (.finite m p h w):=by cases l<;>cases m<;>simp only[q,mb,lr,Model.unpackedToReal_finite,mS]<;>simp[kZ,kO,mg,AK (Г:(2:ℝ)≠0)]<;>ring have j:=Ϙ kC Б q (by rw[d];exact z.trans (pm 971 AP));rw[(by rw[lc,Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ r];simp only[kE,show kC.isIEEE=МfromО,К,Model.ieeeRoundDyadic,q,D];rfl:pv kC (lc k0 (.finite l o g v) (.finite m p h w))=kE kC q)];exact⟨j,by rw[ό _ Б q j,d]⟩ all_goals simp only[lc,Model.isFinite_ofModel_zero kC Б,Model.toReal_ofModel_zero kC Б,Model.unpackedToReal_zero,nv,mul_zero,and_self,pD] lemma bJ(s:х)(m:п)(e:р): (⟨s,m,e⟩:kU).toReal=(if s then-(m:ℝ)else m)*(2:ℝ)^e:=by rw[mb,nf];split<;>simp def pw:п->ф | 0=>(1:Int64).toFloat | k+1=>let p:=pw k;p+p lemma iJ(k:п)(g:k<=900):fv (pw k)/\rv (pw k)=(2:ℝ)^k:=by induction k with |zero=>have:=dB 1 Б;rw[F.pw];exact⟨this.1,by rw[this.2];simp⟩ |succ k e=> have⟨f,v⟩:=e А;have d:(⟨Н,1,((k+1:п):р)⟩:kU).toReal=(2:ℝ)^(k+1):=by rw[bJ];simp only[υ,Am,pJ,one_mul];exact AA 2 (k+1) have:=jJ (F.pw k) (F.pw k) f f _ (by rw[d,v,A4];ring) (Б:(1:п)<2^53) (А:(-1074:р)<=((k+1:п):р)) (by rw[d,AW В,<-AA];exact AG Г А);rw[F.pw];exact⟨this.1,by rw[this.2,v,A4];ring⟩ def nm:ф:=(-1:Int64).toFloat def P:З:=⟨Aj (n:=512) λi=>if iи<256 then pw (iи-1)else nm*pw (iи-256-1)⟩ lemma gL:Pд=512:=by simp[P,kS] lemma iV(i:у)(h:iбif iи<256 then pw (iи-2)else nm*pw (iи-256-2)⟩ lemma cp:P2д=512:=by simp[P2,kS] lemma eh(i:у)(h:iб>>24)г=wг/2^24:=by rw[Υ];simp[β] lemma eS(w:Е):(kB w)г=(w<<<1)г/2^24:=by rw[aN,aM,ϴ];simp only[kN,kH,ο];have:=w.toNat_lt;omega lemma dg(w:Е):(w>>>23)г=wг/2^23:=by rw[Υ];simp[β] @[inline]def dw(w:Е):ф:= (Core.mW w).toInt64.toFloat*P.uget (w>>>23)о (by rw[gL,aC,dg];have:=w.toNat_lt;omega) lemma aV(z e:р):(nb z e).toReal=(z:ℝ)*(2:ℝ)^e:=by rw[<-ϖ,toRat_ofIntDyadic];push_cast;rfl lemma aE(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⟩:=jo x y o p (by rw[g];exact d);have:=rx (nb z e) m l (by rw[aV];exact d);rw[aV]at this;exact⟨h,by rw[j,g,this]⟩ lemma bg(w:Е):(sv w)к<2^24:=by have:=lB w;rw[sv];split<;>simp<;>omega lemma bL(a b c:п)(e:a+b<=c)(h:c<=971)(z:р)(g:zк<2^a): |(z:ℝ)*(2:ℝ)^(b:р)|<=(2:ℝ)^(971:р):=by rw[Ae,AW (В:(0:ℝ)<2^(b:р)),AA];have d:|(z:ℝ)|<=2^a:=by rw[<-mI,Ϲ];exact_mod_cast g.le refine(AE d В).trans ?_;rw[<-AF,<-AA];exact AG Г А lemma mV(u:Д)(n:п)(d:uа=n)(e:n<2^25): fv u.toInt64.toFloat/\rv u.toInt64.toFloat=(n:р):=by have:u.toInt64м=n:=by rw[show u.toInt64м=ae u fromО,ay,d];split<;>omega rw[<-this];exact dB _ (by rw[this];simp;omega) lemma qV(c:п)(A:З)(m:∀i h,A.uget i h=if iб<256 then pw (iб-c)else nm*pw (iб-256-c)) (w:Е)(h):fv (A.uget (w>>>23)о h)/\∃σ:р, (∀v,k9 v=k9 w->σ*kM v=sv v)/\σк=1/\ rv (A.uget (w>>>23)о h)=σ*2^((kB w)г-c):=by have:=bm w;have:=w.toNat_lt;have d:=ap w;have⟨j,l⟩:=iJ ((kB w)г-c) А;rw[m,aC,dg,jW];split .rw[(А:(kB w)г+256*(wг/2^31)-c=(kB w)г-c)];exact⟨j,1,λv g=>by rw[sv,g,AC (by rw[d];omega)];ring,О,by rw[l];push_cast;ring⟩ .rw[(А:(kB w)г+256*(wг/2^31)-256-c=(kB w)г-c)];have e:=dB (-1) Б;rw[(Б:(-1:Int64)м=-1)]at e;have:fv (nm*F.pw ((kB w)г-c))/\rv (nm*F.pw ((kB w)г-c))=((-1:р):ℝ)*2^(((kB w)г-c:п):р):=aE _ _ e.1 j _ _ (by rw[e.2,l,AA]) Б А (bL 1 _ 971 А AP _ Б);exact⟨this.1,-1,λv g=>by rw[sv,g,AD (d.mpr А)];ring,О,by rw[this.2,AA]⟩ lemma dG(c q:п)(A:З)(o:∀i h,A.uget i h=if iб<256 then pw (iб-c)else nm*pw (iб-256-c)) (u:Д)(v w:Е)(h)(r:q<=2)(x:uа=q*kM v) (t:k9 v=k9 w)(p:(q:ℝ)*2^((kB w)г-c)=2^kG v): fv (u.toInt64.toFloat*A.uget (w>>>23)о h)/\ rv (u.toInt64.toFloat*A.uget (w>>>23)о h)=(sv v:ℝ)*2^kG v:=by have:=lB v;have:=ι (kM v) r;have:=bm w;have⟨g,j⟩:=mV u _ x А;have⟨l,σ,d,m,y⟩:=qV c A o w h;have e:(((q*kM v:п):р)*σ)к<2^25:=by rw[Ϩ,m];simp;omega have:=aE _ _ g l _ ((kB w)г-c:п) (by rw[j,y,AA];push_cast;ring) (Ao e Г) А (bL 25 _ 971 А AP _ e);exact⟨this.1,by rw[this.2,<-p,AA,<-d v t];push_cast;ring⟩ lemma cI(w:Е)(_:kB w≠255):fv (dw w)/\rv (dw w)=(sv w:ℝ)*2^kG w:= dG 1 1 P iV _ w w _ А (by simp[an]) rfl (by simp[aT]) lemma dJ(x w:Е)(j:kB x≠255)(h:kB w≠255): fv (dw x*dw w)/\rv (dw x*dw w)=(tm x w:ℝ):=by have⟨e,l⟩:=cI x j;have⟨g,m⟩:=cI w h;have d:(sv x*sv w)к<2^48:=by rw[Ϩ];exact(ϕ (bg x) (bg w)).trans_eq Г have:=aE _ _ e g (sv x*sv w) (kG x+kG w:п) (by rw[l,m,AA,AF];push_cast;ring) (Ao d Г) А (bL 48 _ 971 (by rw[aT,aT];have:=bm x;have:=bm w;omega) AP _ 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 jT(u:Д):(u&&&0x8000000000000000!=0)=(u>>>63!=0):=by apply ϓ.2;simp only[AM,Ak,<-ξ];rw[Ε,ν];change¬uа&&&2^63=0↔¬uа>>>63=0;rw[Nat.and_two_pow,β,lW];have d:uа/2^63<2:=by have:=u.toNat_lt;omega rw[γ d];by_cases e:uа/2^63=1<;>simp<;>omega lemma ij(v:ф):kI v.toModel=Model.ofFields kC (v.toBits>>>63!=0) (((v.toBits>>>52)&&&2047)а) ((v.toBits&&&0xfffffffffffff)а):=by have d:Model.expField (kI v.toModel)=((v.toBits>>>52)&&&2047)а:=О;have e:Model.fracField (kI v.toModel)=(v.toBits&&&0xfffffffffffff)а:=О;have g:Model.signBit (kI v.toModel)=(v.toBits>>>63!=0):=by rw[<-jT];apply ϓ.mpr;simp only[Model.signBit,AM,Ak];rw[<-UInt64.toBitVec_inj];exact Iff.rfl rw[<-Model.ofFields_signBit_expField_fracField (kI v.toModel),d,e,g] lemma fq(v:ф):((v.toBits>>>52)&&&2047)а<2^11/\(v.toBits&&&0xfffffffffffff)а<2^52:=by rw[Ε];exact⟨AO ϝ Б,AO ϝ Б⟩ lemma dV(v:ф)(e:fv v)(g:¬eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)а+2^52, ((eF v.toBits)а:р)-1075⟩:kU).toReal:=by unfold F.eF at g⊢;have⟨j,l⟩:=fq v;have d:((v.toBits>>>52)&&&2047)а≠0:=λh=>g (ξ.mp (by simpa using h));unfold fv at e;unfold rv;rw[ij]at e⊢;rw[BR,Model.toDyadic?_ofFields_of_isFinite _ _ _ _ j l e,AC d];simp only[show kC.fracWidth=52 fromО,show kC.exponentBias=1023 fromО,Model.pow2_eq_two_pow];congr 2<;>(try simp only[nY,nZ])<;>ring lemma aR(z:Model lU):lI (kW z)=z:=by have h:z.toNatBits<2^32:=mQ z;rw[lI,kW,kT,lE,γ h];exact m3 z lemma ef(w:kF)(d:kB w≠255):ls (lI w)=(sv w:ℝ)*(2:ℝ)^((kG w:р)-149):=by rw[lI,BR,kV w d];change (nh w).toReal=_;rw[<-ϖ,lG];push_cast;rfl lemma iD(w:kF)(j:kB w≠255)(m:w&&&0x7FFFFFFF≠0):ls (lI w)≠0:=by rw[ef w j];refine mul_ne_zero ?_ (zpow_ne_zero _ Г);have l:kM w≠0:=by rw[kM];split;rename_i d;have e:=(eZ w).1 d;rw[aM]at e;have g:(bj w)г≠0:=λh=>m (Β.1 (h.trans nj.symm));rw[aM]at g;rw[lK,fe];omega;omega rw[sv];split<;>simp[l] lemma iN(d e g:kU)(p:d.toReal<=e.toReal)(q:e.toReal<=g.toReal) (E:kW (kE lU d)=kW (kE lU g)) (w:kB (kW (kE lU d))≠255)(F:kW (kE lU d)&&&0x7FFFFFFF≠0) (D:|e.toReal|<=(2:ℝ)^(127:р)): kW (kE lU e)=kW (kE lU d):=by have j:=aR (kE lU d);have m:=aR (kE lU g);rw[<-E]at m;have o:mN (kE lU d)=М:=by rw[<-j,lI,m6];simpa using w have v:=Ϙ lU Б e (D.trans (by have h:=ϫ lU Н (2^23) (127-23) Б Б;simp only[υ,Л,one_mul]at h;change|((2^23:п):ℝ)*(2:ℝ)^((127:р)-23)|<=_ at h;rwa[(Г:((2^23:п):ℝ)*(2:ℝ)^((127:р)-23)=(2:ℝ)^(127:р)),AW В]at h));have G:=ό lU Б d o;have A:=ό lU Б e v;have H:=ό lU Б g (by rw[<-m,j];exact o);have y:=lM lU p;have z:=lM lU q;have l:=m.symm.trans j;rw[<-G,<-A]at y;rw[<-A,<-H,l]at z;have x:=le_antisymm z y;rw[Model.eq_of_toReal_eq_of_nonzero v o x (by rw[x,<-j];exact iD _ w F)] lemma jx(x:п)(t:x<2^53)(m:x%2^29≠2^28): (ar (lh (x*2^10)))а=(x+2^28)/2^29:=by have d:(lh (x*2^10))а=x*2^10:=Α (by simp only[n0];omega);generalize lh (x*2^10)=N at d;unfold ar;simp only[ν,η,Ε,d,kA,kH,β,mP];rw[(А:x*2^10/2^39=x/2^29)];obtain⟨q,r,p,rfl⟩:∃q r,r<2^29/\x=2^29*q+r:=⟨x/2^29,x%2^29,ϊ _ Г,(ϛ x _).symm⟩;rw[(А:(2^29*q+r)/2^29=q)];rw[(А:(2^29*q+r)%2^29=r)]at m;have o:=ϊ q (Б:0<2);have l: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,mv _ _ Г,mv _ _ Г,(by grind:(r*2^10+274877906943+q%2)/2^39=(r+2^28)/2^29)] @[inline,irreducible]def ak(S:ф)(h:Д):Д:= let b:=S.toBits let f:=b&&&0xfffffffffffff let E:=eF b let d:=h+1075-E let g:=(1:Д)<<>>29 if d<=26&&E-1195<253&&u-(g+1)<536870911-(g+g)&&r&&&8388607!=0 then ((b>>>63)<<<31)+r-0x255000000 elseЖ lemma rb(b:Д)(h:(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29&&&8388607!=0)=true): 2^28<=(b&&&0xfffffffffffff)а/\(b&&&0xfffffffffffff)а+2^28<2^52:=by simp only[AM,Ak,<-ξ,Ε,ν,η,kA,kH,β]at h⊢;have:=b.toNat_lt;rw[ζ _ 63,ζ _ 23,γ (А:bа%2^63+268435456<2^64),(А:bа%2^63+268435456=(bа%2^52+2^28)+bа/2^52%2^11*2^23*2^29),Ρ _ _ Г,Μ]at h;rw[ζ _ 52];have:=ϊ bа (Г:0<2^52);clear*-h this;omega lemma j3(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)))) (t:2^28<=fа/\fа+2^28<2^52): 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[kA]at o p;have g:(h+1075-E)а=hа+1075-Eа:=by rw[Ζ,η];simp only[kA];omega generalize y:hа+1075-Eа=k at g⊢;have d:k<=26:=А;have r:((1:Д)<<<(h+1075-E))а=2^k:=by rw[ψ,(by rw[g];omega:(h+1075-E)а%64=k),pS,na,γ (lu Г А)] have l:2^k<=2^26:=Θ Г d;have j:1<=2^k:=BI;have m:∀x:п,x&&&536870911=x%2^29:=λx=>ζ x 29;simp only[μ,Ζ,η,Ε,r,kA,m]at q generalize 2^k=G at j l q⊢;clear r g;refine⟨А,d,А,А,А,А,А,А⟩ lemma j4(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 omega lemma g0(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:(F.eF b)а=bа/2^52%2^11:=by unfold F.eF;simp only[Ε,ν,kA,kH,β];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[ν,kA,kH,β] 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,Ζ,η,ψ,l,ν,η,j,d];simp only[kA,kH,β,ο];have o:=ϊ (bа/2^52) (Г:0<2^11);have p:=ϊ bа (Г:0<2^52);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:ak S h<Ж):T≠0/\(ak S h)й=md T (-298) false:=by unfold ak at hc⊢;dsimp only at hc⊢;split at hc;swap;exact absurd hc Б;rename_i o;rw[AD o];simp only[Η,AJ]at o;obtain⟨⟨⟨c1,c2⟩,c3⟩,c4⟩:=o;have y:(F.eF S.toBits)а<2048:=(fq S).1;have v:=(fq S).2;obtain⟨d1,d2,e1,e2,X,Y,I,J⟩:=j3 h _ _ hh y v c1 c2 c3 (rb _ c4);clear c1 c2 c3 c4;have D:=g0 _ e1;have x:=dV _ hS (λh0=>by simp[h0]at e1);have A:(S.toBits>>>63)а=S.toBitsа/2^63:=by simp only[ν,kA,kH,β] 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[AM,Ak,<-ξ,A,ϋ,pM]at Q<;>omega rw[<-O]at D;clear O A;have d:(F.eF S.toBits-1085)а=(F.eF S.toBits)а-1085:=χ _ _ (θ.mpr (by simp only[kA];omega));have j:(F.eF S.toBits-1085)а<=506:=А;generalize (S.toBits>>>63!=0)=E,F.eF S.toBits-1085=e5 at D x d j;generalize a2:(F.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 grind obtain⟨b1,b2,b3,b4,b5,b6,K,z,hq,al,b7,b9⟩: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/\G>>63)<<<31)+(((S.toBits&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-0x255000000)й=R:=by apply Β.mp;rw[F,Ϫ,D,γ];have:(l-1085-110)*2^23<=252*2^23:=ι _ al;split<;>omega have V:kB R≠255:=by unfold kB;intro Q;have p:=congrArg mJ Q;simp only[Ξ,Υ,F,kN,kH,β]at p;rw[ζ _ 8]at p;split at p<;>omega have W:R&&&0x7FFFFFFF≠0:=by intro Q;have p:=congrArg mJ Q;simp only[Ξ,F,kN]at p;rw[ζ _ 31]at p;split at p<;>omega rw[qv,hR]at*;rw[aJ _ _ _ j,U,d]at V W⊢;rw[aJ _ _ _ j,aJ _ _ _ j,U,n3,d]at r;clear F w3 U n3 qv D d j;generalize g+2^52=Mn at x K z V W r⊢;generalize rv S=sr at x L;rw[bJ]at x;have hU:(2:ℝ)^(hа:р)=(G:ℝ)*(2:ℝ)^((l:р)-1075):=by rw[<-hg,Nat.cast_pow,nZ,<-AA,<-AK AL];congr 1;omega have t(m:п):((m*2^10:п):ℝ)*(2:ℝ)^(((l-1085:п):р)-298)=(m:ℝ)*(2:ℝ)^((l:р)-1075)*2^(-298:р):=by have e:(2:ℝ)^(((l-1085:п):р)-298)*(2:ℝ)^(10:р)=(2:ℝ)^((l:р)-1075)*(2:ℝ)^(-298:р):=by rw[<-AK AL,<-AK AL,(А:(((l-1085:п):р)-298)+10=((l:р)-1075)+(-298))] have ah:((m*2^10:п):ℝ)=(m:ℝ)*(2:ℝ)^(10:р):=Г;rw[ah];linear_combination (m:ℝ)*e have N:|(nb T (-298)).toReal|<=(2:ℝ)^(127:р):=by rw[aV,Ae,AW (В:(0:ℝ)<2^(-298:р)),(by rw[<-AK Г];norm_num:(2:ℝ)^(127:р)=2^(425:р)*2^(-298:р))];gcongr have hu:(0:ℝ)<(2:ℝ)^((l:р)-1075):=В;have q:(0:ℝ)<(2:ℝ)^(-298:р):=В;have aH:(G:ℝ)simp only[υ,Am,К]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 md;rw[AC M] refine(iN _ _ _ ?_ ?_ r.symm V W N).symm;pick_goal 3;rw[<-r]at V W;refine((iN _ _ _ ?_ ?_ r V W N).trans r).symm all_goals rw[aV,bJ];simp only[υ,Am,К,neg_mul];rw[t];push_cast[pO K];nlinarith only[w,B,q] @[specialize]def ao(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∈kP 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[cp,aC,dg];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 di(x w:т):р:=Core.tm x (nW w) lemma jt(w:kF):(nW w)г=wг+(2-(kB w)г)*2^23:=by have g:=aN w;have:=aM w;have:=w.toNat_lt;rw[nW];by_cases d:kB w=0;rw[d]at g;rw[AD d,mh,d];simp only[nj,kN]at g⊢;omega;by_cases e:kB w=1;rw[e]at g;rw[AC d,AD e,mh,e];simp only[UInt32.toNat_one,kN]at g⊢;omega;rw[AC d,AC e];have:(kB w)г≠0:=λh=>d (Β.1 (h.trans nj.symm));have:(kB w)г≠1:=λh=>e (Β.1 (h.trans UInt32.toNat_one.symm));omega lemma eL(w:kF):(kB (nW w))г=max 2 (kB w)г/\k9 (nW w)=k9 w/\ kM (nW w)=2^23+wг%2^23/\kG (nW w)=max 2 (kB w)г-1:=by have n:=jt w;have e:=aN w;have:=aM w;have g:=aN (nW w);have:=aM (nW w);have:=w.toNat_lt;have d:(kB (nW w))г=max 2 (kB w)г:=А;refine⟨d,ϓ.mpr (by rw[ap,ap];omega),?_,by rw[aT,d]⟩;rw[kM,lK,AC λh=>by rw[h]at d;simp at d;omega,fe];omega lemma js(w:kF):nW w=w\/kG w=0/\kG (nW w)=1:=by by_cases h:(kB w)г<=1 .exact .inr ⟨by rw[aT];omega,by rw[(eL w).2.2.2];omega⟩ .exact .inl (Β.mp (by rw[jt];omega)) lemma jr(w:Е):(mX w)а=2*kM (nW w):=by unfold mX;rw[(eL w).2.2.1,ϩ,mh,ϴ,fe];simp only[kN,kH,ο];omega lemma j6(w:Е):fv (dX w)/\rv (dX w)=(sv (nW w):ℝ)*2^kG (nW w):=by obtain⟨-,d,-,e⟩:=eL w exact dG 2 2 P2 eh _ _ w _ AP (jr w) d (by rw[e,(А:max 2 (kB w)г-1=(kB w)г-2+1),A4];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[ac h];omega lemma fU(W:с kF)(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:kF), nб-tб=m->iб=B+8*tб-> (λR:A9=>R.s.f r= ao (λ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(kB 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<;>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,ao,AC А];exact⟨О,λs E D=>А,(fu o).ge⟩;rename_i M;have h:tby rw[cC,aj (by have:=ς;omega)] rw[k8,AT h,ao,AD L];dsimp only;have I:=λ{d g j l p q u v o y}=>M (t+1) (i+8) y d g j l p q u v o (by rw[ac h];omega) (by rw[ac h,F,A];ring);refine⟨I.1.trans ?_,λs E D=>?_,AZ (ϭ (by rw[nw];omega)) I.2.2⟩ .rw[ac h];congr 1;have N:∀(c:у)(H:cб<8)(x:(i+c)бby rw[ug,aj (by have:=ς;omega),A] interval_cases r<;>(simp only[A8.f];rw[N _ (by simp only[kD];omega),z];simp only[kD]) by_cases e:s=tб .subst e;refine AZ ?_ I.2.2;rw[eS];apply ϭ;rw[nw,z];omega exact I.2.1 s (by rw[ac h];omega) D lemma bW(Y:З)(v:ф):(Y.push v)д=Yд+1:=by rcases Y with⟨d⟩;simp[FloatArray.push,kS] lemma jA(Y:З)(i:п)(v:ф):(Y.set! i v)д=Yд:=by rcases Y with⟨d⟩;simp[pY,kS] 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<;>intro Y l j .rw[bQ,AC А];exact⟨А,λq _=>О,λ_ _ _=>А⟩ rename_i p;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 jp(v:ф)(h:(eF v.toBits)а<2047):fv v:=by rw[fv,ij,Model.isFinite_ofFields _ _ _ _ (fq v).1 (fq v).2];change(v.toBits>>>52&&&2047)а<2047 at h;rw[show kC.encoding=.ieee fromО,(Б:kC.expAllOnesNat=2047),AM,Ak];omega lemma fK(v:ф)(o:fv v):|rv v|<(2:ℝ)^(((eF v.toBits)а:р)-1022):=by by_cases g:F.eF v.toBits=0 .have d:=(fq v).2;have l:((v.toBits>>>52)&&&2047)а=0:=by rw[F.eF]at g;rw[g];rfl rw[g,rv,ij,l,ϋ,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),A5];positivity rw[Model.toReal_ofFields_subnormal _ _ _ e d,(Б:FloatFormat.binary64.minSubnormalExponent=-1074),kZ,kO,mg];have h:|(if v.toBits>>>63!=0 then(-1:ℝ)else 1)|=1:=by split<;>simp rw[Ae,Ae,h,one_mul,nE];have j:(m:ℝ)<2^(52:п):=by exact_mod_cast d rw[AW В];push_cast;exact(AI j В).trans_eq (by rw[<-AA,<-AK AL];norm_num) rw[dV v o g,bJ];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,<-AK AL];congr 1;push_cast;ring) lemma jz(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:=gV x y r t;have v:=mH (kI x.toModel) (kI y.toModel) Б r t (by rw[fv]at q;rwa[<-p]);have j:rv (x+y)=ns kC (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[bJ];simpa using m);have e:=rx ⟨М,1,E⟩ Г l (by rw[bJ];simpa using m);rw[bJ]at g e;simp only[υ,Л,К,pJ,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:=lM kC d<;>simp only[e,g]at this<;>linarith @[specialize]def sT(p:п->ф)(n t:п)(a:ф)(m:Д):ф×Д:= if trename_i h<;>rw[μ]at h<;>omega lemma jg(p:п->ф)(n:п):∀k t a m,n-t=k->mа<=(sT p n t a m).2а:=by intro k;induction k<;>intro t a m h<;>rw[sT];rw[AC А];rename_i d;rw[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∈kP 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∈kP n,(z s:ℝ))|<=n*(2:ℝ)^((K:р)-1076):=by intro m;induction m with |zero=>intro t a M D Q e o g;obtain rfl:t=n:=А;rw[sT,AC (AX _)];exact⟨e,o⟩ |succ m G=> intro t a M D Q e o g;have d:tlinarith only[H,I,J,L,N] lemma cw(n:п)(d e:п->kF)(g:aG 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:ak S h<Ж): (ak S h)й=ms n d e:=by have⟨j,r⟩:=ce S m h q _ o l p;rw[r,bT n d e g j] def aO(A:с т)(i:у)(m:Е):Е:= if h:i>>23)&&&255 aO A (i+1) (if m mг<=(aO A i m)г/\∀q,iб<=q->q(kB A[q]!)г<=(aO A i m)г:=by intro k;induction k with |zero=>intro i m l;rw[aO,dif_neg (λh=>by have:=cD h;omega)];exact⟨AP,λq g d=>absurd d А⟩ |succ k v=> intro i m l;have h:iby split<;>rename_i j<;>rw[Ι]at j<;>omega have⟨t,u⟩:=v (i+1) (if m<(A.uget i (cD h)>>>23)&&&255 then(A.uget i (cD h)>>>23)&&&255 else m) (by rw[ac h];omega);rw[r]at t;refine⟨А,λq g d=>?_⟩;by_cases o:q=iб;subst o;rw[<-cC A i (cD h),kB];omega;exact u q (by rw[ac h];omega) d lemma bd(A:с kF)(j:Aвby simp[e]at d g;omega,by rw[aT];omega⟩ @[inline]def bi(b:х)(x:ф)(w:Е):ф:= if b then(x*P2.uget (w>>>23)о (by rw[cp,aC,dg];have:=w.toNat_lt;omega))*(mX w).toInt64.toFloat else x*dX w lemma iH(b:х)(x w:Е)(v:kB x≠255)(_:kB w≠255): fv (bi b (dw x) w)/\rv (bi b (dw x) w)=di x w:=by obtain⟨j,m⟩:=cI x v;obtain⟨-,-,l,q⟩:=eL w;have:=bm x;have:=bm w;have:=aT x;unfold bi di tm;split .obtain⟨e,s,u,r,h⟩:=qV 2 P2 eh w (by rw[cp,aC,dg];have:=w.toNat_lt;omega);obtain⟨o,p⟩:=mV _ _ (jr w) (by rw[l];omega);have t:kG (nW w)=(kB w)г-2+1:=by rw[q];omega have g:(sv x*s)к<2^24:=by rw[Ϩ,r,ϻ];exact bg x have d:(sv x*s*((2*kM (nW w):п):р))к<2^49:=by rw[Ϩ];exact(ϕ g (by rw[l];simp;omega:_<2^25)).trans_eq Г have a:=aE _ _ j e (sv x*s) (kG x+((kB w)г-2):п) (by rw[m,h,AA,AF];push_cast;ring) (Ao g Г) А (bL 24 _ 971 А AP _ g);have b:=aE _ _ a.1 o (sv x*s*((2*kM (nW w):п):р)) (kG x+((kB w)г-2):п) (by rw[a.2,p];push_cast;ring) (Ao d Г) А (bL 49 _ 971 А AP _ d);exact⟨b.1,by rw[b.2,t,<-u _ (eL w).2.1,AA];push_cast;ring⟩ obtain⟨e,h⟩:=j6 w;have d:(sv x*sv (nW w))к<2^48:=by rw[Ϩ];exact(ϕ (bg x) (bg _)).trans_eq Г have:=aE _ _ j e (sv x*sv (nW w)) (kG x+kG (nW w):п) (by rw[m,h,AA,AF];push_cast;ring) (Ao d Г) А (bL 48 _ 971 А AP _ d);exact⟨this.1,by rw[this.2,AA];push_cast;ring⟩ @[specialize]def bC(k:п->х)(p:п->ф)(n t:п)(a:ф):ф:= if tф)(n:п):∀m t a,n-t=m->ao p n t a=bC (λ_=>Н) p n t a:=by intro m;induction m<;>intro t a h<;>rw[ao,bC] .grind .grind lemma bz(w v:kF)(d:kB w≠255)(h:(dw w==0)=true):tm w v=0:=by change ((dw w).toModel.unpack.compare (0:ф).toModel.unpack==pj .eq)=true at h;rw[show(0:ф).toModel.unpack=.zero .positive fromО]at h;have e:=(cI w d).2;rw[iL]at e;revert h e;rcases(dw w).toModel.unpack with(_|_)|_|s|⟨_|_,_,_,_⟩<;>simp+contextual[pI,lw,Model.unpackedToDyadic?,tm] lemma dL(k:п->х)(p:п->ф)(z:п->р)(d:р)(P L n:п) (Q:∀tz t=0)(V:∀tt<=n->fv a-> |rv a-((d:ℝ)+∑s∈kP t,(z s:ℝ))|<=t*((2:ℝ)^(P+L)*2^(-54:р))-> fv (bC k p n t a)/\ |rv (bC k p n t a)-((d:ℝ)+∑s∈kP n,(z s:ℝ))|<=n*((2:ℝ)^(P+L)*2^(-54:р)):=by have K:=cv n z d _ V v;have X:(2:ℝ)^L*2^L*2^(-54:р)<=1:=by rw[<-AF,<-AA,<-AK AL];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;obtain rfl:t=n:=А;rw[bC,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[jA,AH]);omega) only[s8,sg,aj,kD];split_ifs<;>first|rfl|omega|(congr 1;omega) lemma gD(X:с kF)(k:п):X.getD k 0=X[k]!:=by rw[Array.getD];split<;>rename_i h .rw[AB X k h];rfl .rw[An 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 gk(X:с kF)(d s:у):∀k (q o:у) (Y:FloatArray), 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 v A;rw[Ο]at v;have:=ς;have:=nT;obtain⟨l,t⟩:=gJ Y o (xr X q d) А;have u:(q+s)б=qб+sб:=aj А;have g:(o+8)б=oб+8:=by rw[aj (by simp;omega)];simp obtain⟨w,e,x⟩:=y (q+s) (o+8) _ А (by rw[l];omega);rw[g]at e;rw[u,g]at x;refine⟨by rw[bx,w,l],λp B=>by rw[bx,e p А,t p А,AC А],λτ r z j=>?_⟩;rw[bx];rcases τ with _|τ .have m:(rе*d)б=r*dб:=by rw[BO,aa А,γ (by have:=ι dб j.le;omega)] rw[e _ А,t _ А,AD А,(А:oб+8*0+r-oб=r),xr,aj (by rw[m];have:=ι dб j.le;omega),m,gD];simp .grind def ZT:с З:=Aj (n:=10) λk=>⟨Ah (2^(kи+7)) 0⟩ def zT(n:п):З:= let k:=Aq (8*n)+1-7 if k<10 then ZT[k]!else⟨Ah (8*n) 0⟩ lemma jH(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,Λ,kS,Array.size_replicate];exact⟨(ϙ (n:=8*n)).le.trans (Θ Б А), .inr (Θ Б А)⟩ .simp[kS] def dQ(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⟨Aj (n:=8*n) λp=>dw X[b+pи/8*s+pи%8*st]!⟩ lemma fF(X:с kF)(d s n b:п)(Z:FloatArray)(l:8*n<=Zд): 8*n<=(dQ X d s n b Z)д/\((dQ X d s n b Z)д=Zд\/(dQ X d s n b Z)д=8*n)/\ ∀τ r,τr<8->(dQ X d s n b Z).data[8*τ+r]! =dw X[b+τ*s+r*d]!:=by unfold dQ;split .have:=ς;have:=gk X dе sе n bе 0 ‹З›;simp only[Dense.aa (А:dby rw[<-j τ r e g,Κ]⟩ .refine⟨by simp[kS],.inr (by simp[kS]),λτ 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:З):З:= dQ 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->ф)(aB:Unit->т):т:= let r:=sT p n 0 (bpf ()) 0 let c:=if 1<=r.2а/\r.2а<=1993/\1076<=r.2а+L then ak r.1 (r.2а+L-1076)жelseЖ if c<Жthen act relu cйelse aB () @[inline]def tf(relu:х)(S:ф)(hh:Д)(sl:Unit->т):т:= let c:=ak S hh if c<Жthen act relu cйelse sl () @[inline]def tw(relu:х)(S:ф)(hh:Д)(L n:п)(p:п->ф)(bpf:Unit->ф) (aB:Unit->т):т:=tf relu S hh λ_=>tS relu L n p bpf aB @[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 jE(g:х)(n:п)(d e:п->kF)(p:п->ф)(h:Unit->ф)(u:Д)(P L:п) (B:Unit->kF) (K:∀sE s M.le) (E n AP) n AP).trans ?_;have y:(n:ℝ)+1<=2^L:=mod_cast(А:n+1<=2^L);refine(AE y В).trans ?_;rw[<-AF,<-AA];exact AG Г А unfold tw tf tS;dsimp only;split .rename_i w;rw[cw _ _ _ j _ I u А v o w] generalize A:sT p n 0 (h ()) 0=r;split .rename_i t;split .rename_i w;have⟨m,l⟩:=iM _ _ (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[n0];omega)] refine congrArg _ (cw _ _ _ j _ m _ А (l.trans ?_) o w);rw[H];refine(AE y В).trans_eq ?_;rw[<-AA,<-AK AL];exact congrArg (λz:р=>(2:ℝ)^z) А .exact G .rw[AC Б];exact G lemma gb(g:х)(n j:п)(l:п->kF)(W b:с kF)(p q:п->ф)(e:kF) (t E L F:п)(B:Unit->kF)(k:п->х) (A:∀s(kB W[j*n+s]!)г<=eг) (hf:eг<255->∀s(kB W[j*n+s]!)г<255)(K:kB b[j]!≠255/\kG 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)=di (l s) W[j*n+s]!) (z:∀s∀v,tm (l s) v=0) (U:B ()=p8 g (ms (n+1) (λs=>if sif stS g L n p (λ_=>dw ld*dw b[j]!) B) B= p8 g (ms (n+1) (λs=>if sif skG 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[aT];omega⟩;exact⟨λh=>by have:=hf C s d m;simp[h]at this,nofun⟩ generalize T:max (48+t+G) E=P;have y:(P+2*L-54)жа=P+2*L-54:=by rw[Ϣ,Α (by rw[n0];omega)] have J:∀s≤n,|(tm ((λs=>if sif sby dsimp only;split;rename_i w;cases m:k s;exact(dh _ _ t G (A s w).2 ((o s w).2 m)).trans (AU Г А);rw[z s w m,lH,A5];positivity;exact(dh _ _ 126 F Б K.2).trans (AU Г А) have u:=dJ ld b[j]! Б K.1;have⟨V,O⟩:=dL k q (λs=>di (l s) W[j*n+s]!) (tm ld 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[di];rcases js W[j*n+s]!with h|⟨-,h⟩;exacts[by rw[h];simpa[d]using J s d.le,(dh _ _ t 1 (A s d).2 h.le).trans (AU Г А)]) (by simpa using J n AP) 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,<-AK AL];exact AG Г А have Q:=cv n (λs=>tm (l s) W[j*n+s]!-di (l s) W[j*n+s]!) 0 (2^P*2^(-54:р)+2^P*2^(-54:р)) (λs d=>by rw[di];rcases js W[j*n+s]!with h|⟨Y,D⟩;rw[h,sub_self,lH,A5];positivity;push_cast;exact(abs_sub _ _).trans (add_le_add ((dh _ _ t 0 (A s d).2 Y.le).trans (X 0 А)) ((dh _ _ t 1 (A s d).2 D.le).trans (X 1 AP)))) (by rw[lH,A5];positivity) n AP;simp only[lH,Ai,Int.cast_sub,nF]at Q;have R:(af (n+1) (λs=>if sif sby simp[ϥ.1 d] have x:(0:ℝ)<2^P*2^(-54:р):=В;have I:(0:ℝ)<2^L:=В;refine jE 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[R,y,(А:((P+2*L-54:п):р)=(P:р)+L+L+(-54)),AK AL,AK AL,AK AL];rw[AF]at O;simp only[AA];have D:=sub_nonneg.2 (by exact_mod_cast H:(n:ℝ)+2<=2^L);rw[A3]at O Q⊢;constructor<;>nlinarith[Af D (mul_pos x I).le,Af D x.le,Af (n.cast_nonneg:(0:ℝ)<=n) x.le] 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]!) λ_=>aD 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 aD 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 c6(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 (Aj (n:=(R+7)/8) λrb=> bZ t X R n rbи Z)) 0 0 (Ah (R*ow) 0) lemma kt(a:с kF)(d:х)(p:п)(w:Unit->kF):(us a d p w)в=aв:=by rw[us];split<;>simp lemma ks(a:с kF)(d:х)(p:п)(w:Unit->kF)(q:п): (us a d p w)[q]?=if d=М/\q=p/\qkF)(g:с kF):∀(e:List (х×п×(Unit->kF))) (a:с kF) (S:п->Prop),(∀x∈e,x.1=М->x.2.1x.2.2 ()=F x.2.1)->aв=gв-> (∀q,(a[q]?=g[q]?\/a[q]?=pj (F q))/\(S q->qa[q]?=pj (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]?=pj (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]?=pj (F q)):=by intro e;induction e with |nil=>intro a S _ l m;simp only[mT];exact⟨l,λq=>⟨(m q).1,λd j=>(m q).2 (d.resolve_right (by simp)) j⟩⟩ |cons x e v=> intro a S p l m;rw[Ϸ];have:=v (us a x.1 x.2.1 x.2.2) (λq=>S q\/x.1=М/\q=x.2.1) (λy r=>p y (List.mem_cons_of_mem _ r)) (by rw[kt,l]) λq=>by rw[ks];split<;>rename_i h;obtain⟨o,rfl,t⟩:=h;rw[p x List.mem_cons_self o (l▸t)];exact⟨BA О,λ_ _=>О⟩;refine⟨(m q).1,λd j=>?_⟩;rcases d with d|⟨o,rfl⟩;exact(m q).2 d j;exact absurd ⟨o,О,l▸j⟩ h refine⟨this.1,λq=>⟨(this.2 q).1,λd j=>(this.2 q).2 ?_ j⟩⟩;rcases d with d|⟨y,r,u⟩;exact pZ (pZ d);grind lemma km(F:п->kF)(a:с kF)(g:п->х×п×(Unit->kF)) (l:∀r,r<8->(g r).1=М->(g r).2.1(g r).2.2 ()=F (g r).2.1): (((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)в=aв/\∀q, ((((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=a[q]?\/ (((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=pj (F q))/\ ((∃r,r<8/\(g r).1=true/\q=(g r).2.1)->q (((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=pj (F q)):=by have:=kl F a ((lj 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=>⟨pZ rfl,False.elim⟩ exact⟨this.1,λq=>⟨(this.2 q).1,λ⟨r,d,e,h⟩ j=>(this.2 q).2 (BA ⟨g r,List.mem_map.mpr ⟨r,List.mem_range.mpr d,О⟩,e,h⟩) j⟩⟩ lemma gy(U V:п)(f:п->п->с kF->с kF)(F:п->kF)(C:п->п->п->Prop) (x:∀u v a,uv(f u v a)в=aв/\∀q,((f u v a)[q]?=a[q]?\/ (f u v a)[q]?=pj (F q))/\(C u v q->q(f u v a)[q]?=pj (F q)))(u v:п)(a:с kF): (∀q,(∃d g,dqa[q]?=pj (F q))-> (l2 U V f u v a)в=aв/\ ∀q,(∃d g,dq(l2 U V f u v a)[q]?=pj (F q):=by induction u,v,a using l2.induct U V f with |case1 u v a h p r=>intro o;rw[l2,AD h,AD p];have⟨y,B⟩:=x u v a h p;have⟨z,A⟩:=r (λ_ _ _=>by grind);exact⟨z.trans y,λq w e=>A q w А⟩ |case2 u v a h p r=>intro o;rw[l2,AD h,AC p];exact r λq ⟨d,g,j,l,t,m⟩ e=>o q ⟨d,g,j,l,А,m⟩ e |case3 u v a h=>intro o;rw[l2,AC h];exact⟨О,λq ⟨d,g,j,l,m⟩ e=>o q ⟨d,g,j,l,А,m⟩ e⟩ lemma ip(U V N:п)(f:п->п->с kF->с kF)(F:п->kF)(C:п->п->п->Prop) (l:∀u v a,uv(f u v a)в=aв/\∀q,((f u v a)[q]?=a[q]?\/ (f u v a)[q]?=pj (F q))/\(C u v q->q(f u v a)[q]?=pj (F q))) (j:∀q,q∃u v,uF qи:=by have⟨p,e⟩:=gy U V f F C l 0 0 (mB N 0) λq ⟨r,t,_,_,h,_⟩ _=>А apply mU;intro q;by_cases d:qkF) (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)) (λ_=>aD 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]?=pj (F q)):=by have e:b8 t R n h d X W b v u L p m l g o a=((lj 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)) λ_=>aD 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 km 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 gz(t:х)(R n e:п)(d:х)(X W b:с kF)(r p L:п) (m:Wв<2^32/\8*n<2^32)(l:e*n<=Wв)(N:п)(z:R*e=N)(F:п->kF) (B:∀i j,ij tG d ((yR (kK (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 (kK (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 (kK (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)) (λ_=>aD 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)): c6 t R n e d X W b r p L m l=kK (n:=N) λq=>F qи:=by subst z;unfold c6;dsimp only;refine ip _ _ _ _ F _ (λu v a _ D=>gj 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/ep8 e (ms (n+1) (λs=>if sif sp8 e (ms (n+1) (λs=>if sif s?_ have N(a c m:п)(h:c< m):(a*m+c)/m=a/\(a*m+c)%m=c:=⟨by rw[Τ,Ρ _ _ А,ώ h,Κ],by rw[Τ,Μ,γ h]⟩;have o:=fF 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) _ (jH n).1;have w:8*n<=(bZ t X d n (i/8) (zT n))д/\(bZ t X d n (i/8) (zT n))д<=4294967295/\∀srw[h]<;>rcases(jH n).2 with h|h<;>omega,λs g=>?_⟩;rw[o.2.2 s (i%8) g (ϊ _ Б)];congr 2;cases t<;>simp only[↓reduceIte,υ] .rw[(Р:8*(i/8)*n+s*1+i%8*n=(8*(i/8)+i%8)*n+s),ϛ] .omega have z:(kK (n:=(d+7)/8) λM=>bZ t X d n Mи (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,z];rw[AT ⟨w.1,w.2.1,F⟩];have G:nеб=n:=Dense.aa (by have:=ς;omega);have u:(j*n)еб=j*n:=by have I:(j+1)*n<=l*n:=ι n F;rw[Ο]at I;exact Dense.aa (by have:=ς;omega) rw[(fU _ _ _ _ _ _ 0 (i%8) А _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (П)).1];simp only[f8,G,u,Ϧ,Κ];rw[dM _ _ _ _ _ rfl];refine(gb e n j (λs=>X[if t then i+s*d else i*n+s]!) W b _ _ _ x v L y _ (λ_=>Н) (λ_ _=>D _) (λs g _=>?_) (λ_ _ _ h=>absurd h lN) (K j) A J p r (λs g B=>?_) (λs g B=>?_) (λ_ _ h=>absurd h lN) (by cases t<;>simp only[aD,bO,ϻ,↓reduceIte,υ])).trans ?_ .calc(kB W[j*n+s]!)г=(kB W[(j*n)еб+s]!)г:=by rw[u] _<=_:=(fU _ _ _ _ _ _ 0 0 А _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (П)).2.1 s (П) (by rw[G];exact g) .rw[w.2.2 s g];exact dJ _ _ (D _).1 B .rw[w.2.2 s g];exact iH Н _ _ (D _).1 B .grind 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бkF->kF)(h:kF->kF)(P:kF->п)(q:∀x y,P x<=P (g x y)/\P y<=P (g x y)) (W:с kF)(d n t:у)(l:Wв<2^32)(j:dб+8*nб<=Wв) (m:tбjF (c:=c) l j m u v;have L:∀{z x y},P z<=P x->P z<=P (g x y):=(·.trans (q _ _).1);have R:∀{z x y},P z<=P y->P z<=P (g x y):=(·.trans (q _ _).2);rw[m8];simp(disch:=simp) only[p,kD];exact⟨L AP,λr w=>by interval_cases r<;>solve_by_elim only[L,R,AP]⟩ 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[ac h];omega) lemma d5(W:с kF)(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:kF),nб-tб=m-> (λR:A9=>R.s.f r= bC (λs=>X.data[s]! ==z) (λs=>bi (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)=Н->(kB W[dб+nб*r+s]!)г<= R.oг)/\ oг/2^24<=R.oг/\ (R.oг<255->(kB f)г<255/\∀s,tб<=s->s(X.data[s]! ==z)=true-> (kB 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<;>intro t g j l p q u v A o f V .have:¬tбА,by split<;>simp only[fu,kN]<;>omega,λG=>⟨?_,λs N B _=>А⟩⟩;split at G;exacts[Ι.1 ‹_›,by simp only[fu,kN]at G<;>omega] rename_i ih;have h:tjF (c:=c) K H L D U;have M:=dE max (.<<<1) mJ (λx y=>by rw[nw];omega) W d n t K H L o;have F:=dE (. ||| ·) bj (λw=>(kB 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 А;rw[kw,AT h,bC,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 А B E,AZ (ϭ (by first|exact M.1|exact AP)) I.2.2.1,λG=>?_⟩<;>try(have J:=I.2.2.2 G;exact⟨by first|exact AO 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 AO ((eA _).ge.trans (F.2 r Q)) J.1)else J.2 s А B E⟩) all_goals rw[ac h] congr 1;interval_cases r<;>(simp only[A8.f,kH,Nat.reduceBEq];rw[O _ _ (by simp only[kD];omega)];simp only[kD]) lemma j8(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 da{α:Type}(f:п->α)(N:п)(a:с α):с α:= if aвα)(N:п): da f N (lQ N)=kK (n:=N) λq=>f qи:=by suffices h:∀k (a:с α),N-aв=k->aв<=N->(∀i (h:i da f N a=kK (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[da,AC А];exact mi (by simp;omega) λi e _=>by rw[d i e,Λ] |succ k l=>intro a j g d;rw[da,AD А];refine l _ (by simp;omega) (by simp;omega) λi h=>?_;rw[Array.getElem_push];split;exact d i ‹_›;grind def d6(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:=da (λg=>yW xr n ow W b hs hW g) ((ow+7)/8) (AS ((ow+7)/8)) da (λ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]!) λ_=>aD n relu X W b (j/ow*n) 1 j) λ_=>aD 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 dC(n e:п)(l:х)(X W b:с kF)(O G L:п) (E:Wв<2^32/\8*n<2^32)(B:e*n<=Wв)(H:п) (F:∀q:п,kB X[q]!≠255/\kG X[q]!<=O)(hb:∀q:п,kB b[q]!≠255/\kG b[q]!<=H) (M:174+H<=G)(Y:n+2<=2^L)(x:L<=27)(z:G+L<=425): d6 n e l X W b O G L E B=mj 1 n e l X W b:=by unfold d6;split;rename_i V;swap;rfl;unfold mj linearWith;dsimp only;simp only[gg,iC];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 _ (kJ n) rfl (by simp[kJ,kS]);have m:∀sdw X[k]!) n (kJ n)).data[s]! =dw X[0*n+s]!:=by intro s d;rw[p.2.2 _ (by simp[kJ,kS]) d];simp generalize bQ (λk=>dw X[k]!) n (kJ n)=u at p m⊢ have hY:(kK (n:=(e+7)/8) λg=> yW u n e W b E B gи)[j/8]! = yW u n e W b E B (j/8):=by rw[AB _ _ (by simp;omega),Λ] rw[hY];have hS:∀y,yW u n e W b E B (j/8)=y->y.s.f (j-po (8*(j/8)) (e-8))=bC (λs=>u.data[s]! ==0) (λs=>bi ((j-po (8*(j/8)) (e-8))%2==1) u.data[s]! W[j*n+s]!) n 0 (dw ld*dw b[j]!)/\(∀s(kB W[j*n+s]!)г<=y.oг)/\(y.oг<255->∀s(kB 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:=po (8*(j/8)) (e-8)with ah;have v: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 v.2.2;rw[Ϡ]at U;exact aa (by have:=ς;omega) have S:c*n+n*(j-c)=j*n:=by grind have w:∀s,(kB W[j*n+s]!)г=(kB W[(c*n)еб+nеб*(j-c)+s]!)г:=λs=>by rw[D,A,S] refine⟨?_,λs d N=>?_,λhR s d N=>?_⟩ .rw[(d5 _ _ _ _ _ _ _ _ (j-c) v.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).1,j8 (λr=>dw ld*dw b[c+r]!) _ v.1,D,A,Ϧ,v.2.1,S] .exact(w s).trans_le ((d5 _ _ _ _ _ _ _ _ (j-c) v.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.1 s (П) (by rw[D];exact d) N) .exact(w s).trans_lt (((d5 _ _ _ _ _ _ _ _ (j-c) v.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.2.2 hR).2 s (П) (by rw[D];exact d) N) have⟨I,J,K⟩:=hS _ rfl;rw[I];refine gb 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 aD;simp only[bO,ϻ]) .rw[m s d];exact dJ _ _ (F _).1 w .rw[m s d];exact iH _ _ _ (F _).1 w .rw[m s d]at h;exact λ_=>bz _ _ (F _).1 h lemma dN(n:п)(e d:п->kF):∀c i,i+c=n-> nC (kK (n:=n+1) λt=>if tиif tиe tи) (kK (n:=n) λt=>d tи) i c:=by intro c;induction c with |zero=>intro i h;obtain rfl:i=n:=А;simp only[nC,ab (i+1) (λt=>if t< i then d t else ld) i А,ab (i+1) (λt=>if t< i then e t else 0x80000000) i А,AX,Am];rfl |succ c g=>intro i h;rw[nC,g (i+1) А,nC,ab (n+1) (λt=>if tif tkF)(h:0if tif tby split;exacts[(g t ‹_›).symm,Б],bI _ _ _ g,aK,dN n d e n 0 А];congr 1 .simp only[AX,Am,(Б:tm ld 0x80000000=0),Av];exact ϔ rfl λt j=>by simp only[AD (ϥ.mp j)];unfold tm;rw[Τ];ring simp[h.ne'] end F lemma kx(X:с kF)(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 tkB w≠255/\kG w<=(F.aO X 0 0)г-1) (F.bd X А l)) (F.bd b А m) AP q p o iterate 2 exact F.cs _ _ _ _ _ _ _ _ _ _ _ _ _ (F.bd X А l) (F.bd b А m) AP q p o rfl def ff(batch m k n:п)(A B:с т):с т:= let ea:=F.aO A 0 0 let eb:=F.aO B 0 0 let L:=Aq (k+1)+1 if h:batch=1/\0by by_cases h:q< m<;>simp[h]<;>decide) AP (by have:=@ϙ (k+1);omega) r p).trans ?_;rw[gemmSpec,gemmWith];refine mi (by simp[Ϗ]) λq e _=>?_;rw[Ϝ]at e;have g:q/n< m:=Ϟ e;have w:(mB m (0x80000000:kF))[q/n]! =0x80000000:=by simp[g] simp only[Λ,↓reduceIte,w,ώ (by rwa[Ϗ]:q< m*n),γ 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 en(x:Float32):n5 x.toModel=lI x.toBits:=by exact congrArg Model.mk (pu x.toBits).symm lemma ja(x:Float32):kW (n5 x.toModel)=x.toBits:=by change lA x.toBitsг=x.toBits;exact UInt32.ofNat_toNat lemma bK(a:kF)(h:kB a≠255): (lx a).toBits=a/\(lx a).isFinite=М:=by have j:nX (spec:=li) a.toBitVec≠-1#8:=by intro g;apply h;apply Β.mp;have e:=congrArg BitVec.toNat g;rwa[(by rw[kB,Ξ,Υ,BitVec.extractLsb'_toNat];exact ζ _ 8:(kB a)г=(a.toBitVec.extractLsb' 23 8).toNat)] have e:(lx a).toBits=a:=by change BG (pT li (kL li a.toBitVec))=a;rw[Model.pack_unpack_eq,AC (λd=>j d.1)] use e;change (kL li (lx a).toBits.toBitVec).isFinite=М;rw[e];simp only[kL,j,Л];split<;>(try split)<;>rfl @[noinline]def e9(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 (BL a+BL b).toBits else e9 relu a b lemma gW(d:х)(a b:kF): add d a b=p8 d (kW (pb (lI a) (lI b))):=by rw[add];split;rename_i h;simp only[Η,AM]at h;have g:=bK a h.1;have j:=bK b h.2;have e:=ExecFloat.Binary.toModel_ofFloat32_add_of_isFinite (lx a) (lx b) g.2 j.2;simp only[ExecFloat.Binary.toModel_ofFloat32,en,g.1,j.1]at e;rw[<-e,<-en,ja];rfl end NativeAdd lemma eC(x s t:kF)(p:kB x≠255)(m:kB s≠255)(o:kB t≠255) (V:р) (l:V=sv x*sv s*2^(kG x+kG s)+sv t*2^(kG t+149)) (j:V≠0): kW (pd (lI x) (lI s) (lI t))=md V (-298) Н:=by have g:=kV x p;have d:=kV s m;have e:=kV t o;rw[Model.Proof.fma_eq_spec,Model.Spec.fma] have h:Model.chooseNaN3 (lI x) (lI s) (lI t)=none:=(Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨Χ g,Χ d,Χ e⟩ simp only[lI]at h⊢;simp only[h,ϡ g,ϡ d,ϡ e,Bool.or_false,υ,Am,g,d,e];refine(mf _ V _ _ j ?_).symm;rw[Model.addDyadic,pF];erw[pG];rw[lG,lG,lG,l];push_cast;simp[Ac];field_simp;ring @[noinline]def jq(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 cE(stop:у)(f:(i:у)->iбт->т)(i:у) (x:с т) (h:stopб<=xв):с т:= if hi:iiбkF->kF)(F:п->kF->kF) (p:∀i e w,f i e w=F iб w)(i:у)(x:с kF)(h:dб<=xв): (cE d f i x h)в=xв/\ ∀j,(cE d f i x h)[j]?=if iб<=j/\jhave o:iб?_⟩;rw[l,Dense.ac e,pP,Array.getElem?_set o];by_cases m:iб=j;subst m;rw[AC А,AD rfl,AD А,lC o,Option.map_some,p];rfl;rw[AC m];clear o g;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,by clear*-Q;omega⟩ rw[(А:(s*2^63+E*2^52+f)/2^63=s),(А:(s*2^63+E*2^52+f)/2^52%2^11=E),(А:(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;clear*-M Q K this;have:X=0:=А;omega rw[γ u]at M;rw[γ (AO (Nat.add_le_add_left (Г: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,by clear*-;omega⟩;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:=А;clear M H u;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 j:q+d<2^23:=by clear*-p K S F;omega have x:X/2^23%2^11=E:=by rw[p,Ρ _ _ Г,ώ j,Κ,Μ,γ D] rw[x]at m;have B:q*2^29+r+2<=2^52:=by clear*-j g w;omega have z:1<=q*2^29+r:=by clear*-p K g j;omega refine⟨m.1,m.2,by clear*-w v;omega,by clear*-w v;omega,z,B,by clear*-l j D;omega,by clear*-l g j D;omega⟩ 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:=ι _ А;interval_cases d<;>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.ak 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.ak S (Dense.F.eF S.toBits-1075))йг%2^31<255*2^23/\ Dense.F.ak S (Dense.F.eF S.toBits-1075)<Ж:=by unfold Dense.F.ak;simp only[UInt64.sub_add_cancel,UInt64.sub_self,(Б:((1:Д)<<<(0:Д))=1),(Б:decide ((0:Д)<=26)=true),Bool.true_and] generalize S.toBits=a at h⊢;generalize H:(a+268435457)>>>29=x at h⊢;have j(x:п):x&&&2047=x%2^11:=ζ x 11;have l(x:п):x&&&8388607=x%2^23:=ζ x 23;have t(x:п):x&&&536870911=x%2^29:=ζ x 29;have u(x:п):x&&&17179869183=x%2^34:=ζ x 34;have e:xа=(aа+268435457)%2^64/2^29:=by rw[<-H];simp only[ν,η,kA,kH,β] simp only[Η,AQ,AJ,AM,Ak]at h;obtain⟨⟨D,o⟩,E⟩:=h;have d:=congrArg lq D;rw[e]at d;simp only[ν,η,kA,kH,β]at d;rw[μ,Ζ]at o;simp only[Ε,ν,kA,kH,β,j]at o;have g:xа%2^23≠0:=λB=>E (ξ.mp (by rw[Ε];simpa only[kA,l])) obtain⟨y,z,I,J,K,L,M,A⟩:=xw _ _ a.toNat_lt e (e.trans d) o g;have p:(Dense.F.eF a)а=aа/2^52%2^11:=by simp only[Dense.F.eF,Ε,ν,kA,kH,β,j] have w:(a&&&0xfffffffffffff)а=aа%2^52:=by rw[Ε];exact ζ _ 52 rw[AD];have m:=Dense.F.g0 a (p▸y);rw[p,w]at m;have r:aа/2^63<2:=(by clear*-M e;omega);have q:(aа%2^52+2^28)/2^29<=2^23:=(by clear*-;omega);have v:(aа/2^52%2^11-1085-110)*2^23<=252*2^23:=ι _ (by clear*-z;omega);refine⟨?_,p▸y,p▸z,?_,?_⟩ .apply ξ.mp;rw[m];unfold wX;simp only[η,ψ,ν,Ζ,Ε,kA,kH,β,ο,u,M,A];exact wq _ _ _ r y z q .rw[Ϫ,m];clear*-r q v;omega .rw[μ,m];simp only[kA];clear*-r q v;omega simp only[Η,AJ,UInt64.reduceAdd,UInt64.reduceSub,AM,Ak,<-ξ];simp only[μ,Ζ,Ε,η,ν,p,w,kA,kH,β,l,t];rw[ζ _ 63,(by clear*-;omega:aа%2^63=aа/2^52%2^11*2^52+aа%2^52)];clear*-y z I J K L A g;omega lemma jf(d:х)(o:Е)(j:oг%2^31<255*2^23): (if o&&&(if d then 0x80000000 else 0)!=0 then 0 else o)=p8 d o:=by have g:kB o≠255:=λh=>by have e:=congrArg mJ h;simp only[kB,Ξ,Υ,kN,kH,β]at e;rw[show(255:п)=2^8-1 fromО,ζ]at e;omega cases d<;>simp[p8,reluW,g] lemma rk(a:Д):(((a+268435457)&&&536870911)>=4:х)=((a+268435457)>>>29==(a+268435453)>>>29):=by rw[(by rw[UInt64.sub_eq_add_neg];ac_rfl:a+268435453=a+268435457-4)];generalize a+268435457=s;have:=s.toNat_lt;have l:(s&&&536870911).toNat=s.toNat%2^29:=by rw[Ε];exact ζ _ 29 rw[ϓ];simp only[AJ,AQ,GE.ge,θ,<-ξ,ν,Ζ,l,UInt64.toNat_ofNat,β,Nat.reduceMod,Nat.reducePow];omega @[inline]def eB(g:х)(m:Е)(Y Z:ф)(w:т)(slow:Unit->т):т:= if g&&((w>>>23)&&&255)-1<254 then let a:=(Dense.F.dw w*Y+Z).toBits let x:=(a+268435457)>>>29 if ((a+268435457)&&&536870911)>=4&&((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 i4(d:х)(s t w:kF)(g:Unit->kF) (l:g ()=p8 d (kW (pd (lI w) (lI s) (lI 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=p8 d (kW (pd (lI w) (lI s) (lI t))):=by open Dense Dense.F in rw[Bn.eB];dsimp only;split;swap;exact l;rename_i G;simp only[Η,AM,Ak,AJ]at G;obtain⟨⟨x,y⟩,m⟩:=G;change¬kB s=255 at x;change¬kB t=255 at y;replace m:¬kB w=255:=λh=>by change (w>>>23)&&&255=255 at h;rw[h]at m;exact absurd m Б rw[rk];split;swap;exact l;rename_i L;obtain⟨v,p,q,D,E⟩:=cX _ L;rw[<-v];have it:=aT t;have W:=bm t;have iw:=aT w;have X:=bm w;have Y:=aT s;have U:=bm s;obtain⟨A,M⟩:=dJ w s m x;obtain⟨H,N⟩:=cI t y;obtain⟨I,O⟩:=iJ 149 Г;obtain⟨B,Q⟩:=aE _ _ H I (sv t) ((kG t+149:п):р) (by rw[N,O,AA,AF];ring) (Ao (bg t) Г) А (bL 24 _ 971 А AP _ (bg t));have o:=jp (dw w*dw s+dw t*F.pw 149) А;have j:=jz _ _ A B o _ А А (fK _ o);obtain⟨-,e⟩:=e8 _ _ A B _ А А j;have J:rv (dw w*dw s)+rv (dw t*F.pw 149)=((sv w*sv s*2^(kG w+kG s)+sv t*2^(kG t+149):р):ℝ):=by rw[M,Q,tm,AA];push_cast;ring rw[J]at j e;generalize u:(sv w*sv s*2^(kG w+kG s)+sv t*2^(kG t+149):р)=V at j e;generalize dw w*dw s+dw t*F.pw 149=S at E p q D o j e⊢;have K:((F.eF S.toBits-1075)а:р)=((F.eF S.toBits)а:р)-1075:=by rw[χ _ _ (by rw[θ];simp only[kA];omega)];simp only[kA];omega obtain⟨r,z⟩:=ce S o (F.eF S.toBits-1075) А V (e.trans (by rw[K,div_le_iff₀ (Г:(0:ℝ)<2)];have:=AG (Г:(1:ℝ)<=2) (by clear*-;omega:((F.eF S.toBits)а:р)-1022-53<=((F.eF S.toBits)а:р)-1075);have:(0:ℝ)<(2:ℝ)^(((F.eF S.toBits)а:р)-1075):=В;linarith)) (j.le.trans (AG Г А)) E rw[eC w s t m x y V u.symm r,<-z];exact jf d _ D def bH(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 bH relu hw c s t (ch+1) (if h:stopб<=xвthen cE stop (λ_ _ w=>eB g m Y Z w λ_=>jq relu w sc tc) (ch*hw)е x h else x) else x termination_by c-ch lemma dn(g:х)(e c:п)(s t:с kF)(d:п)(x:с kF) (p:xв=c*e)(r:c*ep8 g (kW (pd (lI w) (lI s[j/e]!) (lI t[j/e]!)))) else x[j]?:=by induction hk:c-d generalizing d x unfold bH;rw[AC А];split .have:c*e<=d*e:=ι _ А;rw[l5 А];rfl rfl;rename_i v;have q:dp8 g (kW (pd (lI w) (lI s[d]!) (lI t[d]!)))) (λ_ _ w=>i4 g s[d]! t[d]! w (λ_=>jq 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,nO d e];clear hk;split_ifs<;>first|omega|rw[mG (k:=d) А (by rw[Ο];omega)]|rfl def br(relu:х)(c hw:п)(x s t:с т):с т:= if xв=c*hw/\c*hwkF) (g:e ()=p8 d (kW (pb (lI a) (lI b)))): ad (if d then 1 else 0) a b e=p8 d (kW (pb (lI a) (lI b))):=by cases d<;>simp[ad,NativeAdd.gW] @[noinline]def jN(relu:х)(x y:т):т:=act relu (toWord (Model.add (ofW x) (ofW y))) def cq(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 λ_=>jN relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b lemma dT:cq=addReluSpec:=by funext d a b;rw[cq];dsimp only;split;rename_i h;have g:aвеб=aв:=Dense.aa h.2;apply mU;intro j;rw[(cL _ _ (λj x=>p8 d (kW (pb (lI x) (lI b[j]!)))) (λi l x=>?_) 0 a _).2 j,addReluSpec,mE];by_cases e:jх) (fa:п->kF) (bx:Д) (s:lR) (J:х) (I K b:с kF) (D:х) (nc Y:п) (r d:kF) (x:Д) (v:р) (B a:Д) (m:п) (e j:у) (bw:Д) (u:Е) {α:Type} lemma mo{a b:п}(h:arw[h]<;>norm_num lemma j9{n:п}(h:n<2^32):n%2^nx=n:=mo (AN h dj) lemma jV(a:с Е):a.usizeб<=aв:=by exact Ay _ _ @[inline]def ok(w:Е):х:= expOf w !=255&&(mW w==0||iW w-E<=C) @[inline]def eG(a:с Е):Д:= a.foldl (λm w=>if mW w !=0&&iW w< m then iW w else m) 255 @[inline]def ct(h l:Д):Д:=(h<<<25)+l @[inline]def d4(h l:Д):Д:= ((h+0x8000000000000000)>>>(39:Д))-(16777216:Д)-(l>>>(63:Д))+ (if ct 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=>dc f s (x+1) m (e+s) (a.push (f x e)) @[inline]def eT(O H W:п)(f:п->п->п->Е):с Е:= if 0dc (λ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 cU(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 (d4 H A) (ct H A) (B+149) eX (if r<Жthen rйelse fb ()) d @[inline]def aq(w:т):Д:=if mW w !=0 then iW w else 255 @[inline]def cV(x0 x1 x2 x3:т):х:=Q x0&&Q x1&&Q x2&&Q x3 @[inline]def eF(u:т):Д:=((u>>>23)&&&255)н @[inline]def gT(ch y x:п)(e:у):т:= let v:=wе if hb:ecV (.==0x80000000) x0 x1 x2 x3) (λ_=>cU h w 2 I ch y x) d else toWord (Ar (ofW (cU h w 2 I ch y x)) (ofW d)) else toWord (Ar (ofW (cU h w 2 I ch y x)) (ofW d)) def df(I:с т)(B:Д)(stop:у)(hs:stopб<=Iв)(e:у)(acc:Д):Д:= if h:edc (gT 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:=eG I if bx<=255/\I.all (ok q bx)=Мthen eT c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k wo bx (fj I bx w k U) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 М) (λ_=>cU h w k I ch y x) d else eT c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k let B:=wl (λ(m:Д) v=>min m (aq 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 (cr (t1 B) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 М) (λ_=>cU h w k I ch y x) d else toWord (Ar (ofW (cU h w k I ch y x)) (ofW d)) else avgpoolSpec c h w k I lemma eQ:ae x=(xа:р)-2^64*(xа/2^63:п):=by rw[ae];rw[lv];have e:x.toBitVec.toNat=xа:=О;have:=x.toNat_lt;split<;>omega lemma jC(h:(xа:р)≡v [ZMOD2^64])(d:-2^63<=v) (e:v<2^63):ae x=v:=by rw[eQ];have:=x.toNat_lt;rw[pe]at h;omega def Z:ZMod (2^64):=xа lemma iB:(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): ae x=v:=jC x v ((iB x v).mpr h) d e lemma fI(b:Д):Z (a+b)=Z a+Z b:=by unfold Z;rw[η,BN];push_cast;ring lemma iX(b:Д):Z (a-b)=Z a-Z b:=by have d:=b.toNat_lt;unfold Z;rw[Ζ,BN,Nat.cast_add,pO А];rw[show((2^64:п):ZMod (2^64))=0 from ZMod.natCast_self _];ring lemma bF:Z 0=0:=by simp[Z] lemma cB{B:Д}(h:B<=255):Bа<=255:=by simpa using θ.mp h def bU(e:п)(w:Е):р:=sv w*2^(idxOf w-e) lemma cz(h:kM u=0):sv u=0:=by rw[sv];simp[h] lemma kd(h:kM u=0):mW u=0:= ξ.mp (by rw[an,h];rfl) lemma dI(w:Е)(m:Eа<=255)(l:Cа<=62)(h:ok C E w=М): kB w≠255/\(kM w=0\/(Eа<=kG w/\kG w<=Eа+Cа/\ (iW w-E)а=kG w-Eа)):=by rw[ok,Η,AM,Ak,nM,AQ]at h;refine⟨h.1,?_⟩;rcases h.2 with d|e .left;have:=an w;simp[d]at this;omega .right;have j:=am w;have g:=θ.mp (As.mp 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 ly e (Θ Г d) В lemma fw(e:Д)(w:Е)(c:п)(p:c<=39) (h:kM w=0\/(eа<=kG w/\kG w<=eа+c/\ (iW w-e)а=kG w-eа)): (mW w<<<(iW w-e))а=kM w*2^(kG w-eа)/\ kM w*2^(kG w-eа)<2^(24+c):=by have j:=lB w;rcases h with d|⟨m,o,l⟩;rw[kd w d,d];simp;have g:=pw _ _ c j (А:kG w-eа<=c);refine⟨?_,g⟩;rw[ψ,an,l,ο,γ (a:=kG w-eа) А];exact γ (AN g (Θ Г А)) lemma jK(b:Д):((a+b)а:р)≡(aа:р)+bа [ZMOD2^64]:=by rw[pe];rw[η];omega lemma g5(b:Д):((a-b)а:р)≡(aа:р)-bа [ZMOD2^64]:=by have:=b.toNat_lt;rw[pe];rw[Ζ];omega lemma ji: (((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[β,mY,nr,kH];split<;>omega lemma eU(d e:Д): aw (d4 d e) (ct d e)=ae d*2^25+ae e:=by have j:=d.toNat_lt;have l:=e.toNat_lt;have o:(ct d e)а=((dа%2^39)*2^25+eа)%2^64:=by unfold ct;rw[η,ψ];simp only[ο,mY,nr,kH];omega set c:р:=if ct 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:((d4 d e)а:р)≡q [ZMOD2^64]:=by rw[d4];refine(jK _ _).trans (Int.ModEq.add ((g5 _ _).trans (Int.ModEq.sub ((g5 _ _).trans ?_) (by rw[ν];simp only[β,mY,nr,kH];rfl))) ?_);rw[ji,show((16777216:Д)а:р)=2^24 fromО];split<;>(rw[pe];ring_nf);rw[m];split<;>rfl have p:0<=c/\c<=1:=by rw[m];split<;>decide have v:=jC _ q u (by rw[g];clear*-j l p;split<;>omega) (by rw[g];clear*-j l p;split<;>omega);rw[aw,v,eQ,eQ,o,g,r];clear*-j l;split_ifs<;>omega lemma fB(a b:Е)(d e:п)(g:kM a=0\/d<=kG a)(j:kM b=0\/e<=kG b):tm a b=bU d a*bU e b*2^(d+e):=by unfold tm bU;rcases g with g | g .simp[cz a g] rcases j with j | j .simp[cz b j] rw[(А:kG a+kG b=(kG a-d)+(kG b-e)+(d+e)),AF,AF];ring lemma cJ(f:п->р)(M:р)(h:∀th t (mr d)).trans (П)) abbrev ag(g:п->Е):с Е:=Aj (n:=m) λq=>g qи lemma ec(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<;>intro o y a l h;exact h;rename_i n e;have d:=j o y a l h;simp[lp];split_ifs with g;exact(by ring:o*H+y+(n+1)=o*H+(y+1)+n)▸e _ _ _ g d;obtain rfl:H=y+1:=А;exact(by ring:o*(y+1)+y+(n+1)=(o+1)*(y+1)+0+n)▸e _ _ _ А ((by ring:(o+1)*(y+1)+0=o*(y+1)+y+1)▸d) lemma kb(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 (lQ c)=ag (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W):=by simpa[A7,ϳ,Κ,Ϗ W n]using iu 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=>v А▸u _ _ _ _ e А λj x=>by obtain⟨l,m,p⟩:=cf o y j H W e x;simp[(by ring:W*(o*H+y)+j=(o*H+y)*W+j),l,m,p,Κ]) n 0 0 _ r λ_=>О lemma iK(f:п->у->Е)(g:п->Е)(s:у):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jе))->dc f s x m e (ag M g)=ag (M+m) g:=by intro m;induction m<;>intro x e M l;rfl;rename_i o;have d:=l 0 А;rw[ϑ,ϑ,show(0:п)е=0 fromО,USize.mul_zero,USize.add_zero]at d;rw[dc,<-d,ec,o _ _ _ λj p=>by rw[(А:M+1+j=M+(j+1)),l _ А,(А:x+(j+1)=x+1+j),show(j+1)е=jе+1 from mC j 1,USize.mul_add,USize.mul_one,USize.add_assoc,USize.add_comm (s*_)]];congr 1;omega lemma d8(H W n c:п)(s:у)(E:п->п->у)(F:п->п->п->у->Е)(d:0dc (F o y) s 0 W (E o y)) n 0 0 (lQ c)= ag (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)е):=kb H W n c _ (λo y x=>F o y x (E o y+s*xе)) d λ_ _ _ _ _ _ e=>iK _ _ _ _ _ _ _ λj g=>by rw[e j g,Κ] lemma iO(O H W:п)(f:п->п->п->Е): eT O H W f=ag (O*(H*W)) λq=>f (q/(H*W)) (q/W%H) (q%W):=by rw[eT];split_ifs with h .rw[d8 _ _ _ _ 0 (λ_ _=>0) (λo y x _=>f o y x) h,Ϛ] .simp[ag,(А:H=0)] lemma jl(g:α->kF->α)(I:с kF)(w k U:п): ∀n j e d,ewl g I w k n (U+j*w+e) e d= (pV (j*k+e) n).foldl (λd t=>g d I[U+t/k*w+t%k]!) d:=by intro n;induction n<;>intro j e d l;rfl;rename_i m;rw[BS,Ϸ,wl,(by rw[Τ,Ρ _ _ А,ώ l,Κ]:(j*k+e)/k=j),(by rw[Τ,Μ,Conv.mo l]:(j*k+e)%k=e)];split_ifs with h;exact m j (e+1) _ h;obtain rfl:k=e+1:=А;rw[(by rw[nO];omega:U+j*w+e+w+1-(e+1)=U+(j+1)*w+0),m (j+1) 0 _ А];congr 2;ring lemma gc(g:α->kF->α)(I:с kF)(w k U n:п)(d:α)(e:0g d I[U+t/k*w+t%k]!) d:=by have:=jl 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:=j9 h lemma fJ:Z x=((xа:р):ZMod (2^64)):=by rw[Z];norm_cast lemma gS:Z x=((ae x:р):ZMod (2^64)):= (iB x _).mp (by rw[eQ];rw[pe];omega) lemma jj(m:Д)(h:mа<2^62): ae (sg u m)=if k9 u then-(mа:р)else mа:=by unfold sg;rw[fy];cases k9 u<;>simp only[fT,ite_true,ite_false] .exact sZ _ _ (fJ m) А А .exact sZ _ _ (by rw[iX,bF,fJ];push_cast;ring) А А lemma gC:ok C E 0=М:=О lemma gi(a:с Е)(p:Е->х)(h:a.all p=М)(e:p 0=М)(q:п): p a[q]! =М:=by by_cases d:q⟨Ah (2^(kи+7)) (Dense.F.dw 0)⟩ def zPq(n:п):З:= let k:=Aq n+1-7 if k<10 then ZPq[k]!else⟨Ah n (Dense.F.dw 0)⟩ lemma zPs(n:п):n<=(zPq n)д/\((zPq n)д<=2^16\/(zPq n)д=n)/\∀q<(zPq n)д,(zPq n).data[q]! =Dense.F.dw 0:=by dsimp only[zPq];split;rw[AB ZPq _ (by simp[ZPq];omega)];simp only[ZPq,Λ,kS,Array.size_replicate];refine⟨(ϙ (n:=n)).le.trans (Θ Б А),.inl (Θ Б А),λq h=>?_⟩;simp_all;simp_all[kS] lemma uU{Y:З}{i:у}(g:idб+nб<=Yд->Yд<2^32-> (fcU I p d n hs hp j Y)д=Yд/\∀q intro j Y e a b;have h:¬jby have:=ε.mp h;clear*-this e;omega rw[fcU,dif_neg h];exact⟨rfl,λq _=>by rw[if_neg (by omega)]⟩ | succ m ih=> intro j Y e a b;have h:j?_⟩;clear e a b rw[v q (by rw[sz];exact hq),Dense.ac h,Conv.uS _ _ _ _ _ hq,dj] by_cases c1:dб+(jб+1)<=q/\qrб<=nб->yб=rб%s.h->pб=rб*s.w->dб=(rб/s.h*(s.h+2)+rб%s.h+1)*(s.w+2)+1-> (s.cin*(s.h+2)+3)*(s.w+2)<=Yд->Yд<2^32-> (∀q (fRU I hs w V U h n r p d y Y)д=Yд/\∀q intro r p d y Y e a b c f N O J have E:=Nat.sub_eq_zero_iff_le.mp e have hr:¬rAX _ (AN (ε.mp h) E) rw[fRU,dif_neg hr];refine⟨rfl,λq hq=>?_⟩;rw[J q hq];congr 1 split;rfl rename_i k;unfold aI;rw[if_neg];rintro⟨u,v,x,-⟩ have:(q/((s.h+2)*(s.w+2))+1)*s.h<=s.cin*s.h:=ι _ u rw[Ϡ,one_mul]at this;clear*-k this hn E v x;omega | succ m ih=> intro r p d y Y e a b c f N O J have hr:rk (USize.toNat_inj.mp (by rw[y1];clear*-j hh;omega)) obtain⟨q1,q2⟩:=(Nat.div_mod_unique h0).mpr (⟨by clear*-rq;omega,by clear*-this b ym;omega⟩:rб%s.h+1+s.h*(rб/s.h)=rб+1/\rб%s.h+1omega .rw[if_neg (by clear*-k;omega),if_neg (by clear*-k;omega)] rw[yE,ed] obtain⟨u2,v2⟩:=ih (r+1) (p+w) d' y' (fcU I p d w hs hp 0 Y) (by rw[hR,<-Nat.sub_sub,e,BK]) (by rw[hR];exact R) (by rw[by',hR]) (by rw[hP,hR]) (by rw[bd',hR]) (by rw[u];exact N) (by rw[u];exact O) (by rw[u,hR];exact J') rw[u2,u];exact⟨rfl,λq hq=>v2 q (by rw[u];exact hq)⟩ lemma iQ(A:с п)(u:у)(h:uбф):Dense.F.A8:=⟨f 0,f 1,f 2,f 3,f 4,f 5,f 6,f 7⟩ lemma fW(f:п->ф)(r:п)(d:r<8):(eH f).f r=f r:=by rw[eH];interval_cases r<;>rfl lemma kq(p:п->ф)(n t:п)(a:ф)(h:tф)(n t:п)(a:ф)(h:¬tomega lemma jc(d t:п):px d t<=2:=by rw[px];split<;>omega lemma jb(d t e:п)(g:d=9\/d=1)(j:tsimp<;>omega abbrev fP(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 cZ(n:п):(kJ n)д=0:=by simp[kJ,kS] def fQ: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 (aB d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x) @[inline]def dR(relu:х)(w:т):т:=if relu&&w&&&0x80000000!=0 then 0 else w lemma jI(d:х)(w:kF)(e:kB w≠255):dR d w=p8 d w:=by rw[dR,p8,reluW];cases d<;>simp[e] lemma ep(S:ф)(h:Д)(e:Dense.F.ak S h<Ж): kB (Dense.F.ak S h)й≠255:=by unfold Dense.F.ak at e⊢;dsimp only at e⊢;split at e;swap;exact absurd e Б;rename_i d;rw[AD d];simp only[Η,AJ]at d;obtain⟨⟨⟨-,l⟩,-⟩,-⟩:=d;have m:(Dense.F.eF S.toBits)а<2048:=by unfold Dense.F.eF;rw[Ε];exact AO ϝ Б have o:(S.toBits&&&0xfffffffffffff)а<2^52:=by rw[Ε];exact AO ϝ Б rw[μ,Ζ]at l;simp only[kA]at l;have r:=Dense.F.g0 S.toBits (А:1195<=(Dense.F.eF S.toBits)а);have q:S.toBitsа/2^63<2:=by have:=S.toBits.toNat_lt;clear*-this;omega rw[μ]at e;simp only[kA]at e;intro g;have j:=congrArg mJ g;rw[kB,Ξ,Υ,Ϫ]at j;simp only[kN,kH,β]at j;rw[ζ _ 8,γ e,r]at j;omega @[inline]def bV(d:CD)(o y x:п)(S:ф):т:= let c:=Dense.F.ak S d.hh if h:c<Жthen dR d.J cйelse ow d o y x S lemma iE(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[jI _ _ (ep _ _ e)];rw[ow,Dense.F.tw,Dense.F.tf];dsimp only;rw[AD e] .rfl @[inline]def ju(d:CD)(o y:п)(xb:у)(r:п)(S:ф):т:= let c:=Dense.F.ak S d.hh if c<Жthen dR d.J cйelse ow d o y (xbб+r) S lemma iF(d:CD)(o y:п)(e:у)(r:п)(S:ф):ju 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 rkF)(n q:п):∀m r (a:с kF),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;obtain⟨u,j⟩:=p (r+1) (a.set! (q+r) (g r)) А А;rw[pl,AD А,u,BU];refine⟨О,λi e=>?_⟩;rw[j i (by rwa[BU])];by_cases d:i=q+r;subst d;rw[Array.getElem!_set!_self _ _ _ e];clear*-l;split_ifs<;>first|rfl|omega|(congr 1;omega) rw[Array.getElem!_set!_ne _ _ _ _ (Ne.symm d)];clear*-d;split_ifs<;>first|rfl|omega @[inline]def ln(d:CD)(o y:п)(xb nq q r:у)(S:ф)(a:с т):с т:= if rkF)(n q:п):∀m r (a:с kF),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<;>intro r a d e;have:r=n:=А;subst this;conv_lhs=>rw[pl,AD А,pl,AC А] conv_rhs=>rw[pl,AC А] rename_i j;conv_lhs=>rw[pl,AD А] rw[j (r+1) _ А А];conv_rhs=>rw[pl,AD А] lemma ka(d:CD)(o y:п)(g e q:у)(A:Dense.F.A8)(a:с kF)(p:qб+eбbV d o y (gб+r) (A.f r)) (po k eб) 0 qб a)= pl (λr=>bV d o y (gб+r) (A.f r)) (po (k+1) eб) 0 qб a:=by subst l;rw[ln];by_cases h:rbV d o y (gб+r) (A.f r)) (po 8 eб) 0 qб a:=by have L:=ka d o y g e q A a l;have j:=L 0 0 П A.a0 rfl;rw[Nat.zero_min,pl,AC А]at j;unfold a9 simp only[j,L 1 1 П A.a1 rfl,L 2 2 П A.a2 rfl,L 3 3 П A.a3 rfl,L 4 4 П A.a4 rfl,L 5 5 П A.a5 rfl,L 6 6 П A.a6 rfl,L 7 7 П 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->с kF->с kF)(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)): ey 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 open Dense Dense.F in induction m generalizing t p u v x B D G H A have h:¬tby have:=ε.mp h;omega rw[ey,dif_neg h];congr 1;exact j2 _ _ λr I=>by rw[K r I,kp _ _ _ _ А] rename_i ih;have h:tby rw[ug,iQ,aj (by rw[L];have:=ς;clear*-O hM hc U this;omega),L] have J:∀j,g.uget (l+t) j=g.data[lб+tб]!:=λj=>by rw[ug,aj (by have:=ς;omega)] refine ih (t+1) _ _ _ _ _ _ _ _ A (by rw[ac h];omega) λr I=>?_;rw[K r I,kq _ _ _ _ Y,ac h];congr 1;interval_cases r<;>(simp only[A8.f];rw[rx _ (by simp only[kD];omega),J];simp only[kD]) @[noinline]def fC(d:CD)(o y:п)(xb nq q:у)(A:Dense.F.A8)(a:с т):с т:= a9 d o y xb nq q A a def dK(d:CD)(c:CC d.M)(o y xb r:п):ф:= Dense.F.ao (λ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 gY(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:с т):с т:= ey 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 gZ(d:CD)(c:CC d.M)(o y:п)(e m q i:у)(p:iб+d.M+8<=d.Xд)(l:ф) (a:с kF) (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 ld*Dense.F.dw d.b[o]!): gY a9 d c o y e m q i p l a=a9 d o y e m q (eH (dK d c o y eб)) a:=by subst g;unfold gY;have:=ς;have:=c.h3;refine g9 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>?_;rw[fW _ _ u];unfold dK;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:0kF) (G:∀g x,g<=x->xxbV d o y x (dK d c o y g (x-g))=F x): ∀m (g e q i:у) (a:с kF) (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 a9 d c o y g e q i u a v)в=aв/\∀jintro g e q i a v hm hx L hq J;rw[rB,dif_neg (λh=>by have:=l0 e h;omega)];exact⟨О,λj _=>by rw[AC А]⟩ |succ m ih=> intro g e q i a v hm hx L hq J;have S:=ς;have:=d.hX;by_cases h:0bV d o y (gб+r) ((eH (dK d c o y gб)).f r)) (po 8 eб) qб _ 0 a rfl (ϟ _);have I:∀j,qб<=j->jbV d o y (gб+(j-qб)) ((eH (dK d c o y gб)).f (j-qб))=F (gб+(j-qб)):=λj _ _=>by rw[fW _ _ А,<-G gб _ А А А,ϱ] by_cases l:8?_⟩;rw[Y j (by rwa[p]),K j A,N,O,U];clear L hx hm J N O e4 this S;split_ifs<;>first|rfl|omega|(congr 1;omega)|exact I j А А have B:¬8l (ε.2 (by simp only[kD];omega));rw[dif_neg l];refine⟨p,λj A=>?_⟩;rw[K j A];clear L hx hm J this S;split_ifs<;>first|rfl|omega|exact I j А А have h0:eб=0:=by have:=mt ε.2 h;simp only[kD]at this;omega rw[rB,dif_neg h];exact⟨О,λj _=>by rw[AC А]⟩ @[specialize]def c8(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б->с kF->с kF) (r N:п) (G:п->kF) (F:∀y (g:yaв=N-> (f y g q i e a)в=aв/\∀jy<=h->q=r+y*d->aв=N-> (c8 h d V o x f y q i e a)в=aв/\ ∀jintro y q i e a H g p l .have u:y=h:=А;subst u;rw[c8,dif_neg (AX _)];exact⟨О,λj _=>by rw[AC А]⟩ rename_i K;have g:y?_⟩;rw[D j (v▸A),B j A];clear*-J I p;split_ifs<;>first|rfl|omega @[specialize]def db(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 c8 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 iG(d:CD)(c:CC d.M)(o q:п)(l:ф)(a:с kF)(N:п)(G:п->kF) (m:∀y (v:yq'=q+y*d.s.w->eв=N-> (rB a9 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д): (db a9 d c o q l a)в=aв/\ ∀jm y v q' i e _ (by rw[F,Dense.aa H]) r p) _ 0 q _ _ a rfl (ϟ _) П A;rw[dif_neg g];use О,λj _=>by rw[(pM.mp λh=>g (B (ϵ h)):d.s.h=0),ϳ,ϑ,AC А] def bA(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 ft(K:с kF)(T:с п)(M A k:п)(H:∀tNZ K T A t Tz Wz-> NZ K T A k (bA K T M A k H I t Tz Wz p u v g).Tz (bA 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[bA,dif_neg А];rwa[(А:t=k)]at h |succ m J=>intro t Tz Wz p u v g L h;replace L:k=t+m+1:=(by omega);obtain⟨p,u,x,o,l⟩:=h;rw[bA,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,Av];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 (ϥ.1 r)]:∑j∈kP Tzв,z (if jg s А q),Ν] def dF(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,fQ&&decide (16 (bA K T M q k o p t Tz d g e j l).n=(bA K T M q k o p t Tz d g e j l).Tzв/\ (bA K T M q k o p t Tz d g e j l).wo=0:=by intro m;induction m with |zero=>intros;rw[bA,dif_neg А];use О |succ m r=>intros;rw[bA,AT А];dsimp only;split<;>exact r _ _ _ _ _ _ _ А lemma fm(d:CD)(Z:х)(p:З)(u:∀t∀qп,c.n<=d.k/\ (∀jℝ,(∀sz s=0)-> ∑j∈kP c.n,z (m j)=∑s∈kP d.k,z s:=by by_cases D:Z=М .have⟨⟨l,L⟩,J,I,m,g,r⟩:(c.n=c.Tzв/\c.wo=0)/\NZ d.K d.T (o*d.k) d.k c.Tz c.Wz:=by subst O;rw[dF,AT D];exact⟨eM _ _ _ _ _ u v _ 0 _ _ _ _ _ _ rfl,ft _ _ _ _ _ u v _ 0 _ _ _ _ _ _ rfl ⟨by rw[cZ];simp,П,id,λj e=>by simp at e,λz _=>П⟩⟩ refine⟨by rw[<-J];omega,m,l▸I,λj e=>by rw[L,Κ];exact g j (l▸e),l▸r⟩ have ah:o*d.k+d.k<=d.Y*d.k:=Ο _ _▸ι _ U;subst O;rw[dF,dif_neg D];use(by dsimp only;exact(X.resolve_left D).2),id,AP,(λj e=>by dsimp only at e⊢;exact⟨e,О,x (by simpa using D) (o*d.k+j) А⟩),λz _=>О lemma gG(s:lR)(I:с kF)(d:s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1) (y x t:п)(e:t/9first|rfl|omega lemma gF(s:lR)(I:с kF)(d:s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0) (y x t:п)(j:yfirst|rfl|omega lemma iI(s:lR)(I:с kF)(e:п)(q:fP s e)(y x t d:п)(u:y?_⟩;rw[z3 q hq];unfold aI;rw[if_neg (by simp[c])] have:s.h+2<=s.cin*(s.h+2):=Nat.le_mul_of_pos_left _ c;have:3*(s.w+2)<=(s.cin*(s.h+2)+3)*(s.w+2):=Nat.mul_le_mul_right _ (by omega);have:(s.cin*(s.h+2)+3)*1<=(s.cin*(s.h+2)+3)*(s.w+2):=Nat.mul_le_mul_left _ (by omega);have:s.cin*s.h<=s.cin*(s.h+2):=Nat.mul_le_mul_left _ (by omega);obtain⟨u,v⟩:=fRUs I s d s.wе (s.w+2)е (3*(s.w+2))е s.hе (s.cin*s.h)е (aa _ e) (aa _ (by omega)) (aa _ (by omega)) (aa _ (by omega)) (aa _ (by omega)) g hN h0 _ 0 0 (s.w+3)е 0 _ rfl (by simp) (by simp) (by simp) (by rw[aa _ (by omega),Ϧ,Nat.zero_div,Nat.zero_mod];ring) z1 Z (λq hq=>by rw[z3 q hq,if_neg (by simp)]);rw[xF,u];exact⟨z1,Z,v⟩ lemma gX(h w d j l y m e V:п)(x:V=w+2)(g:e=(h+2)*V)(p:yп) (hs:fP d.s d.kk) (a3:0ℝ,(∀sz s=0)-> ∑j∈kP c.n,z (l j)=∑s∈kP d.k,z s) (S:ф) (hS:S=Dense.F.ao (λ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 ld*Dense.F.dw d.b[o]!)): bV d o y x S=p8 d.J (aB 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:=gX 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 pZ h.2.2.2.2;exact BA 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 (ll 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 ld 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 lN) (λ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 AP;simpa only[AX,Am]using this) (by clear*-bh hL;omega) m (by clear*-ah;omega) c.n 0 _ rfl (ϟ _) u.1 (by simp[u.2]) have ba:((tm ld d.b[o]!:р):ℝ)+∑j∈kP c.n, ((tm (ll 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,cz d.K[o*d.k+s]! (by rw[<-an,h0];rfl)];simp)] simp only[AX,Am];rw[add_comm];congr 1;exact ϔ rfl λj g=>by simp only[AD (e j (ϥ.mp g)).1] rw[iE,hS];unfold ow;simp only[Dense.F.gg] refine(Dense.F.jE d.J d.k (λt=>if tif tDense.F.dw ld*Dense.F.dw d.b[o]!) d.hh P d.L (λ_=>p8 d.J (aB 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,Am]using u) (λt _=>?_) r hL m ah G (by unfold aB;rw[Dense.bO]) _ fS ?_).trans (by unfold aB;rw[Dense.bO]) .dsimp only;split .exact⟨(iS 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 AL,AA,div_eq_mul_inv,<-zpow_neg,<-Ap,<-AF];congr 2;clear*-;omega _<=(2:ℝ)^(d.hhа:р):=AG Г (by rw[G];clear*-bb;omega) def g7(d:CD)(Z:х)(Wd:З)(hT:∀t let c:=dF d Z Wd hT hk hkT hW hY o ho if c.ni=true then db fC d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else db a9 d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a) 0 0 0 (by simp) (Ah (d.Y*(d.s.h*d.s.w)) 0) lemma g8(d:CD)(Z:х)(p:З)(hW:Z=М\/d.Y*d.k<=pд/\pд<2^32)(G IX IW IB P:п) (hs:fP d.s d.kk) (al:0∀qp8 d.J (aB 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[g7] obtain⟨aL,ba⟩:=eE d.Y (d.s.h*d.s.w) 0 0 (by have:=ς;simp only[kD,A7];clear*-this U;omega) (λo A q _ _ a=> let c:=dF d Z p hT l m hW j o A if c.ni=true then db fC d c o q (Dense.F.dw ld*Dense.F.dw d.b[o]!) a else db a9 d c o q (Dense.F.dw ld*Dense.F.dw d.b[o]!) a) 0 (d.Y*(d.s.h*d.s.w)) (λq=>p8 d.J (aB 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:dF d Z p hT l m hW j o A=c;obtain⟨bG,ix,a7,bp,aH⟩:=fm d Z p hT l m hW j a4 o A c bv;have:=ς;have hV:d.s.w+2<=d.Xд:=le_trans (lZ _ (Nat.succ_pos _)) r have bs:(o+1)*(d.s.h*d.s.w)<=d.Y*(d.s.h*d.s.w):=ι _ A;rw[Ο]at bs;rw[show fC=a9 fromО,ite_self] refine iG d c o q _ a _ _ (λy hy H i a' hI hi bw O=>?_) hN А (λbb=>by have a6:=gX _ 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[<-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.wp8 d.J (aB 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=>jQ 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[dK] exact congrArg (λf=>Dense.F.ao f c.n 0 _) (funext λt=>by rw[lO _ c.Tz[t]! (x-xb),pA _ xb (x-xb),BQ h1]))) _ 0 d.s.wе Hе i a' hI AP (by rw[Dense.aa B];simp only[kD,Κ]) (by rw[hi];simp only[kD,ϑ]) (by rw[Dense.aa as,Dense.aa B,O];clear*-bs bt bw hq;omega) (by rw[O];exact U) simp only[Dense.aa as,Dense.aa B,kD,Κ]at u;refine⟨u.1,λi hi=>?_⟩ rw[u.2 i hi];by_cases g:H<=i/\i?_ have ah:i(wdU K i n Y)д=Yд:=by intro m;induction m with |zero=>intros;rw[wdU,dif_neg (λh=>by have:=ε.mp h;omega)] |succ m r=>intro i Y e;have h:isimp only[uZ] lemma wdUs(K:с kF)(n:у)(hK:Kв<2^32):∀m (i:у)(Y:З),nб-iб=m->nб<=Yд->Yд<2^32->(∀q ∀q intro i Y e a b c q hq;rw[wdU,dif_neg (λh=>by have:=ε.mp h;omega),c q (by omega),if_pos (by omega)] |succ m ih=> intro i Y e a b c;have h:i?_ rw[sz]at hq;rw[uS _ _ _ _ _ hq,Dense.ac h,c q hq];by_cases q1:iб=q .subst q1;rw[if_pos rfl,if_pos (by omega),kr] .rw[if_neg q1];by_cases q2:q< iб .rw[if_pos q2,if_pos (by omega)] .rw[if_neg q2,if_neg (by omega)] .rename_i k;refine ih (i+1) Y (by rw[Dense.ac h];omega) a b λq hq=>?_ rw[c q hq,Dense.ac h];by_cases q2:q< iб .rw[if_pos q2,if_pos (by omega)] .by_cases q3:q=iб .subst q3;rw[if_neg q2,if_pos (by omega),getElem!_neg K _ (λhh=>k (ε.mpr (by rw[kz];exact hh)))];rfl .rw[if_neg q2,if_neg (by omega)] def wd(Z:х)(K:с т)(n:п)(hn:n<2^32):{W:З//Z=М\/n<=Wд/\Wд<2^32}:= if hZ:Z=Мthen⟨AR 0,Or.inl hZ⟩ else⟨wdU K 0 nе (zPq n),BA ⟨by rw[wdUz _ _ _ _ _ rfl];exact(zPs n).1,by rw[wdUz _ _ _ _ _ rfl];rcases(zPs n).2.1 with z|z;omega;rw[z];exact hn⟩⟩ lemma tB(kk nc A B:п)(g:kk=9\/kk=1):∀tpc kk t*A+py kk t*B+px kk t) (nc*kk) (AS (nc*kk)))[t]!<=(nc-1)*A+2*B+2:=by intro t h;rw[Dense.F.iC,AB _ _ (by simpa using h),Λ];dsimp only;have:=jb kk t nc g h;have:=jd kk t;have:=jc kk t;have:pc kk t*A<=(nc-1)*A:=ι _ А;have:py kk t*B<=2*B:=ι _ А;omega def fL(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.aO I 0 0 let ew:=Dense.F.aO K 0 0 let eb:=Dense.F.aO 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:=Dense.F.da (λt=>pc kk t*HV+py kk t*V+px kk t) k (AS k) if hg:fP s kk/\0[exact pZ h.2.2.2.2;exact BA h.2.2.2.2]) let Z:=K.any λu=>Core.mW u==0 let W:=wd Z K (Y*k) hY32 g7 ⟨s,I,K,b,xF s I hIs hw32,T,D,J,k,M,L,(P+2*L-54)ж,Y,kk, (dP s I hIs hw32 hI hX32 h0).2.1⟩ Z W.1 hT hk32 hkT W.2 hY32 else dS s J I K b D lemma ev(s:lR)(J:х)(I K b:с kF)(D:х)(d Y:п) (hd:D=false/\d=s.cin/\Y=s.cout\/D=true/\d=1/\Y=s.cin): fL s J I K b D d Y=dS s J I K b D:=by unfold fL;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,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]<;>(clear*-a2;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]<;>(clear*-aH;omega) have hc:∀oby rcases hd with⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp<;>(clear*-ho;omega) obtain⟨g,g2,O⟩:=dP s I G A hI u a2 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) (d*(s.kh*s.kw)) (AS (d*(s.kh*s.kw))))[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[Dense.F.iC,AB _ _ (by simpa using ht),Λ] have a0:=@ϙ (d*(s.kh*s.kw)+1) rw[g8 _ _ _ _ d _ _ _ _ (by exact hs) as (by rfl) (by exact hc) (by rfl) (by exact L) (tB _ _ _ _ (by rcases hs with h|h<;>[exact pZ h.2.2.2.2;exact BA h.2.2.2.2])) (by exact al) (by exact x) (by exact v) (by exact g) (by exact g2) (by exact O) (λhZ=>by dsimp only;rw[hZ];unfold wd;rw[dif_neg lN];dsimp only obtain⟨z1,z2,z3⟩:=zPs (Y*(d*(s.kh*s.kw)));have:=aa _ v intro q hq;exact wdUs K _ aL _ 0 _ rfl (by rw[this];exact z1) (by rcases z2 with z|z;omega;rw[z];exact v) (λq hq=>by rw[z3 q hq,if_neg (by simp)]) q (by rw[this];exact hq)) (by exact Dense.F.bd I (by have:=ς;clear*-this G;omega) ah) (by exact Dense.F.bd K (by have:=ς;clear*-this aL;omega) X) (by exact Dense.F.bd b (by have:=ς;clear*-this a1;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[n0];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 mi (by simp[hA,hB]) λq e _=>?_ rw[Ϝ]at e simp only[ag,Λ] congr 1 unfold aB;simp only[Dense.bO,Ϛ,n4,ϳ,Κ] def er:с т:= fL s J I K b Н s.cin s.cout def cG:с т:= fL s J I K b М 1 s.cin lemma eu:er=conv2dSpec:=by funext s J I K b;exact ev s J I K b Н s.cin s.cout (.inl ⟨О,О,О⟩) lemma cY:cG=depthwiseSpec:=by funext s J I K b;exact ev s J I K b М 1 s.cin (.inr ⟨О,О,О⟩) lemma aZ:(kB u)г=uг/2^23%256:=by rw[kB];rw[Ξ,Υ,show(255:Е)г=2^8-1 fromО,ζ];simp[β] lemma aP:(lK u)г=uг%2^23:=by rw[lK];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 iA:kM u*2^kG u=Kf (uг%2^31):=by have d:uг%2^31/2^23=(kB u)г:=by rw[aZ];omega have e:uг%2^31%2^23=(lK u)г:=by rw[aP];exact Nat.mod_mod_of_dvd _ Б unfold kM kG Kf;rw[d,e];simp only[<-Β,nj] lemma iU: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 dv(e d:п)(h:epush_cast<;>ring lemma bf: (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[Ι,<-Β,pU]<;>omega lemma ga(a b:Е)(h:sk aKf m⟨dv m n,by constructor<;>intro e;subst e;decide;have:=dv 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 g6:Model.cmpDyadic (nh y) (nh z)=compare (kv y) (kv z):=by have d:∀w,(nh w).toReal=(kv w:ℝ)*2^(-149:р):=λw=>by rw[<-ϖ,lG,kv];push_cast;rw[Ac AL,AA];ring have e:(0:ℝ)<2^(-149:р):=В;cases h:compare (kv y) (kv z);rw[Model.cmpDyadic_lt_iff,d,d];exact AI (mod_cast compare_lt_iff_lt.1 h) e;rw[Model.cmpDyadic_eq_iff,d,d,compare_eq_iff_eq.1 h];rw[Model.cmpDyadic_gt_iff,d,d];exact AI (mod_cast compare_gt_iff_gt.1 h) e lemma co(e:kM u=0):u=0\/u=0x80000000:=by have j:=u.toNat_lt;rw[kM]at e;split_ifs at e with g .have d:=aZ u;have l:=aP u;rw[g]at d;rw[<-Β,<-Β];simp at d⊢;omega .omega lemma be:lI (mx y z)=nt (lI y) (lI z):=by rw[Conv.mx];split .rename_i h;have e:=kV y h.1;have g:=kV z h.2.1;have j:Model.compare (lI y) (lI z)=pj _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e g;rw[g6]at j;rw[nt,Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff _ _).2 ⟨Χ e,Χ g⟩:Model.chooseNaN2 (lI y) (lI z)=none),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ j];rcases h.2.2 with d|d|rfl;rw[AD d,compare_lt_iff_lt.2 (ga y z d)];rw[AC (nP d),compare_gt_iff_gt.2 (ga z y d)];rw[AC (UInt32.lt_irrefl _),compare_eq_iff_eq.2 rfl];by_cases l:kM y=0;rcases co y l with rfl|rfl<;>decide;simp[(by rw[lI,Model.isZero_eq_beq_zero_of_toDyadic?_some e,decodeD_sig_zero];simpa using l:Model.isZero (lI y)=Н)] exact aR _ lemma fn(w k U n:п)(e:0nt m (lI I[U+t/k*w+t%k]!)) (lI d):=by rw[gc _ _ _ _ _ _ _ e,List.foldl_hom lI];exact λ_ _=>(be _ _).symm lemma iP: ps (kT u:Model lU)=u:=by show BG (kT u:Model lU).bits=u;rw[pu] lemma aS(d:kB u≠0): nh u=⟨k9 u,2^23+(lK u)г,((kB u)г:р)-150⟩:=by rw[nh];rw[AC d] lemma cM(f:п)(e:f<2^23): lf (2^23+f) (2^23)=0:=by have d:(2^23+f)з=23:=by rw[mz А];constructor<;>omega rw[lf];rw[d,Nat.log2_two_pow];simp[mM,mZ,ο]<;>omega lemma eO:la (m*2^23) (2^23)=m:=by rw[la];simp lemma hO(q:Е)(p:lK d=0)(u:k9 d=Н) (M:(kB d)г=qг+127)(v:kB d≠255) (x:qг<(kB r)г)(j:kB r≠255): kW (pf (lI r) (lI d))=r-(q<<<23):=by have N:=aZ r;have O:=aP r;have U:(kB r)г≠255:=λh=>j (Β.mp (by simpa using h));have L:=fracOf_toNat_lt r;rw[ny];unfold p0 lI;rw[kV r j,kV d v,aS r (λh=>by simp[h]at x),aS d (λh=>by simp[h]at M),p,u];have l:((2:п)^23==0)=Н:=Б;have m:(2^23+(lK r)г==0)=Н:=П;simp only[nj,ϑ,Bool.xor_false,l,m,fT,Л];change kW (n6 FloatFormat.binary32 (k9 r) (2^23+(lK r)г) (2^23) _)=_;rw[<-nA,bD];unfold pC;rw[cM _ L];simp only[l,m,fT,Л,Ai,sub_zero];rw[AC А,AC А,AC А];have D:(2^23+(lK r)г).shiftLeft 23=(2^23+(lK r)г)*2^23:=ο _ _;rw[show(23:р)=Int.ofNat 23 fromО,mw,D,eO];simp only[(by simp[p7];omega:((2^23+(lK r)г:п)==p7 24)=Н),fT,Л];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,nG _ _ (by rw[UInt32.le_iff_toNat_le,o];clear*-N x;omega),o] rw[<-n7];conv_rhs=>rw[<-iP e,ofUInt32_eq_ofFields] rw[(by rw[ϓ,ap,ap,g];clear*-N x;omega:k9 e=k9 r),(by rw[aZ e,g];clear*-N x;omega:(kB e)г=(kB r)г-qг),(by rw[aP e,g];clear*-N O x;omega:(lK e)г=(lK r)г),(А:(((kB r)г:р)-150-(((kB d)г:р)-150)+127)л=(kB r)г-qг),(Б:p7 23=2^23),ϱ];rfl lemma i9(s:kF)(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:kB d≠0)(j:kB d≠255)(l:k9 d=Н): kW (pf (lI r) (lI d))=r:=by rw[ny,p0,lI,lI,kV r (by rcases e with rfl|rfl<;>decide),kV d j,aS d g,l,(by rcases e with rfl|rfl<;>rfl:nh r=⟨k9 r,0,0⟩)];simp[(by simp:(2^23+(lK d)г==0)=Н),fT,Л,Az,К,Bool.xor_false];rcases e with rfl|rfl<;>rfl lemma aX{a b:Е}(h:aby have:=Ι.mp h;rw[e]at this;omega abbrev av:т:=toWord (Ar (ofW (dotOf n fa λ_=>oneW)) (ofW d)) lemma gl(v:DQ d):eX r d=kW (pf (lI r) (lI d)):=by obtain⟨e,l,m⟩:=v;have g:=aX m;dsimp only[eX];split;obtain⟨q,j,o,p⟩:=‹_/\_›;exact(hO r d _ q e (by rw[nG _ _ j];have:=UInt32.le_iff_toNat_le.1 j;simp at this⊢;omega) g (Ι.1 o) (aX p)).symm;split;exact(cg r d (i9 r ‹_›) l g e).symm;rfl lemma gp(g:п->Д)(m:п):∀d:Д, Z ((lj m).foldl (λd t=>d+g t) d)=Z d+∑t∈kP m,Z (g t):=by induction m with |zero=>intro d;simp |succ m e=> intro d;rw[mD,l6,Ϸ,mT,fI,e,Ν];ring lemma jB:ae 0=0:=by rw[eQ];rfl lemma gK: (decide (kM u*kM ld=0)&&Bool.xor (k9 u) (k9 ld))=(u==0x80000000):=by by_cases d:kM u=0 .rcases co u d with rfl|rfl<;>decide have:(u==0x80000000)=Н:=by simp;rintro rfl;exact d Б rw[this,(Б:kM ld=2^23),(Б:k9 ld=Н)];simp[d] lemma dW(c:п):∀i,i+c<=n-> (nC (kK (n:=n) λj=>fa jи) (kK (n:=n) λ_=>ld) i c=М↔ ∀t,i<=t->t< i+c->fa t=0x80000000):=by induction c with |zero=>intro i _;simp[nC];intro t d e;omega |succ c l=> intro i m rw[nC,ab n fa i А,ab n (λ_=>ld) i А, gK,Η,l (i+1) А,AQ] constructor .rintro⟨d,e⟩ t g o rcases BJ g with h|h .subst h;exact d .exact e t А А .intro h;exact⟨h i (le_refl _) А,λt d e=>h t А А⟩ lemma eW(O:0ld)=0)(g:х)(L:g=М↔∀tld)=if g then 0x80000000 else 0:=by have G:=cH n fa (λ_=>ld);have H:=dW n fa n 0 А;have D:=ab n fa;have F:=ab n λ_=>ld;have d:=Ϝ (f:=λi:Fin n=>fa iи);have p:=Ϝ (f:=λ_:Fin n=>ld);rw[ms,dotSpec,Model.dot];generalize (kK (n:=n) λi=>fa iи)=A,(kK (n:=n) λ_:Fin n=>ld)=B at* have l:∀k,0<=k->k<0+(A.map (kT (fmt:=lU)))в->kB A[k]!≠255/\kB B[k]!≠255:=λk _ e=>by rw[m0,d]at e;rw[D k А,F k А];exact⟨v k А,Б⟩ have q(X:с Е):Xв=n->(∀k∀k (e:k<(X.map (kT (fmt:=lU)))в),mN (X.map (kT (fmt:=lU)))[k]=М:=by intro N K k e;rw[m0]at e;have j:=K k А;rw[AB X k e]at j;simp[m6,j] have m:(A.map (kT (fmt:=lU)))в=(B.map (kT (fmt:=lU)))в:=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:=lU) _ _ m r u;rw[finiteDotSlice_eq A B 0 _ (П) (by rw[<-m];simp) l,m0,d,G,I,lH,nv]at o;rw[Ϭ lU _ _ .nearestEven m r u ((ϲ _).1 o)] obtain⟨j,x⟩:=dotStateLoop_flags A B ({}:me lU) 0 _ (П) (by rw[<-m];simp) l;rw[lT,j,x];have J:nC A B 0 n=g:=by rw[ϓ,H,L];exact⟨λh t M=>h t А А,λh t _ M=>h t А⟩ simp only[m0,d,J];cases g<;>simp[show n≠0 by omega]<;>rfl lemma dk(w k U m:п)(l:0(Nat.lt_succ_iff_lt_or_eq.1 d).elim (g t) λe=>e▸j,λh=>⟨λt d=>h t А,h m А⟩ lemma cu(d y x t:п): I[(d*h+y*k)*w+x*k+t/k*w+t%k]! =nI h w k I d y x t:=by congr 1;ring lemma eg(B c A H:Д)(D:Bа<=255)(G:cа<=62)(J:0Д)(L M:р) (T:∀tх)(I:g ()=true↔∀tkF) (v:q ()=ms n fa λ_=>ld)(d:kF)(m:DQ d): wo B A H g q d=av n fa d:=by have p:=λt e=>dI c B _ D G (u t e);have K:=A3.1 (cJ n _ _ λt e=>(T t e).2.1);have N:=A3.1 (cJ n _ _ λt e=>(T t e).2.2);have o:af n fa (λ_=>ld)=(∑t∈kP n,bU Bа (fa t))*2^(Bа+149):=by rw[n8];refine ϔ О λt e=>?_;rw[fB _ ld _ 126 ((p t (mr e)).2.imp_right (·.1)) (BA Б),(Б:bU 126 ld=2^23)];ring rw[<-ϔ О λt e=>(T t (mr e)).1,nJ,<-n8,<-sZ A (∑t∈kP n,ae (l (fa t))) (by simp[x,gS]) С С,<-sZ H (∑t∈kP n,ae (j (fa t))) (by simp[F,gS]) С С]at o;rw[wo,av];split;next r=>rw[r.1,r.2,jB]at o;rw[eW n fa J (λt e=>(p t e).1) (by rw[o];ring) _ I,cg _ d (by split<;>simp) m.2.1 (aX m.2.2) m.1] .rw[gl _ d m];refine congrArg (λs=>kW (pf (lI s) (lI d))) ?_;rw[Dense.dp,dY];split .refine(aY n fa _ _ _ _ (λt e=>⟨(p t e).1,Б⟩) ?_ ‹_›).symm;rw[o,eU,(by simp[η];omega:(B+149)а=Bа+149)] .exact v lemma ee(c:Д)(x:kF)(g:Bа<=255)(m:cа<=37)(h:ok c B x=true): ae 0*2^25+ae (t1 B x)=bU Bа x/\|ae (t1 B x)|<=2^(24+cа)-1/\ |ae 0|<=0:=by obtain⟨-,j⟩:=dI c B x g А h;obtain⟨l,d⟩:=fw B x cа А j;have:2^(24+cа)<=2^61:=Θ Г А;rw[jB,(by rw[t1,bU,sv,jj _ _ А,l];cases k9 x<;>simp only[fT,К,Am,neg_mul]<;>push_cast<;>ring:ae (t1 B x)=bU Bа x)];refine⟨Р,?_,П⟩;rw[bU,sv];cases k9 x<;>simp only[fT,К,Am,neg_mul,BE]<;>rw[Ad В]<;>exact Int.le_sub_one_of_lt (mod_cast d) lemma em(f:kF->Д)(h w k:п)(I:с kF)(d y x:п)(e:0by interval_cases t<;>assumption, λH=>⟨⟨⟨H 0 Б,H 1 Б⟩,H 2 Б⟩,H 3 Б⟩⟩ lemma ia:(eF u)а=(kB u)г:=by rw[eF,kB];simp lemma ik(x:kF):aq x<=255:=by rw[aq];split .rw[θ,am];rw[kG];have:=mO x;split<;>simp<;>omega .exact UInt64.le_refl _ lemma mn(a b:Д):(po a b)а=po 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 dH(a b:Д):po a b<=a:=θ.mpr (by rw[mn];omega) lemma fX(a b:Д):po a b<=b:=θ.mpr (by rw[mn];omega) lemma fZ(a b:Д):a<=max a b:=by show a<=if a<=b then b else a;split<;>simp_all lemma f0(a b:Д):b<=max a b:=by show b<=if a<=b then b else a;split<;>rename_i h<;>simp_all[θ];omega lemma cQ(x:kF)(B M:Д)(d:B<=aq x)(r:eF x<=M)(p:M<=po (B+37) 254) (o:B<=255):ok 37 B x=М:=by have j:=ia x;have g:=am x;have v:=mO x;rw[θ]at r p o;simp only[mn,η,kA]at p o;simp only[ok,Η,AM,Ak,nM,AQ];use λe=>by simp[e]at j;omega by_cases m:mW x=0;exact pZ m;right;rw[aq,AD (by simpa using m),θ,g]at d;apply A6;rw[θ,χ _ _ (θ.2 (by rw[g];omega)),g];rw[kG]at d⊢;split<;>simp<;>omega lemma ki(d e g j:kF) (h:max (max (eF d) (eF e)) (max (eF g) (eF j))<=po (po (po (aq d) (aq e)) (po (aq g) (aq j))+37) 254): po (po (aq d) (aq e)) (po (aq g) (aq j))<=255/\ cV (ok 37 (po (po (aq d) (aq e)) (po (aq g) (aq j)))) d e g j=М:=by have l:po (po (aq d) (aq e)) (po (aq g) (aq j))<=255:= ϗ (ϗ (dH _ _) (dH _ _)) (ik d);simp only[cV,Η];use l,⟨⟨cQ _ _ _ (ϗ (dH _ _) (dH _ _)) (ϗ (fZ _ _) (fZ _ _)) h l,cQ _ _ _ (ϗ (dH _ _) (fX _ _)) (ϗ (f0 _ _) (fZ _ _)) h l⟩,cQ _ _ _ (ϗ (fX _ _) (dH _ _)) (ϗ (fZ _ _) (f0 _ _)) h l⟩,cQ _ _ _ (ϗ (fX _ _) (fX _ _)) (ϗ (f0 _ _) (f0 _ _)) h l lemma gU(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): gT h w I d j y x e=av (2*2) (nI h w 2 I j y x) d:=by have q:=cu 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,kH,nv,one_mul,Av]at p r u v;have m:kW (pf (lI (cU h w 2 I j y x)) (lI d))=av (2*2) (nI h w 2 I j y x) d:=О;have:=dj;have g:∀i o,I.uget i o=I[iб]!:=λi o=>(AB I _ o).symm;rw[gT];dsimp only;split;swap;exact m;simp(disch:=omega) only[g,lJ,mA,aa,γ,D,p,r,u,v];split;swap;exact m;rename_i l;have l:=ki _ _ _ _ l;have A:=(cW _ (nI h w 2 I j y x)).1 l.2;exact eg _ _ _ 37 _ _ (cB l.1) Б Б A _ (λ_=>0) _ 0 (λt F=>ee _ _ _ (cB l.1) Б (A t F)) Б Б (by simp only[fI,show 2*2=4 fromО,Ν,Finset.sum_range_zero,Ai]) (by simp[bF]) _ (by rw[cW];simp only[AQ]) _ rfl d B lemma dO(f:п->п->п->kF) (e:∀d y x,f d y x=av (k*k) (nI h w k I d y x) (natW (k*k))): eT c (h/k) (w/k) f=n9 c h w k I:=by rw[iO];rw[n9];refine mi (by simp[pa]) λq _ _=>?_ simp only[ag,Λ,pa];exact e _ _ _ lemma gI(B:Д)(d:у)(r:dб<=Iв):∀m (e:у) (l:Д), dб-eб=m->df I B d r e l=(lj m).foldl (λa j=>a+t1 B I[eб+j]!) l:=by have g:∀i o,I.uget i o=I[iб]!:=λi o=>(AB I _ o).symm;intro m;induction m<;>intro e l q;rw[df,dif_neg (mt ε.1 (А:¬eбsimp<;>omega lemma eV:dU=n9:=by funext c h w k I;unfold dU;dsimp only;split .rename_i d;obtain⟨e,o,u,B,m⟩:=d;split .rename_i D;obtain⟨rfl,G⟩:=D;rw[d8 _ _ _ _ _ _ _ o,Ϛ];unfold n9;refine mi (by simp[pa]) λq r _=>?_;simp only[ag,Λ,pa,Ϝ]at r⊢;have F:=(ϸ (Ϯ o u)).mpr r;have a:=ϊ (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 (l7 F);rw[Ο]at this;clear*-this a;omega have A:=ι w v;rw[nO]at A;refine gU h w I _ m _ _ _ _ ?_ А;rw[show(2:у)=USize.ofNat 2 from rfl,<-BP,<-mC,Ϗ 2,<-lX,aa _ А] .have l:=jL _ B;split .rename_i d;refine dO _ _ _ _ _ _ λj y x=>?_;have g:∀tgi I _ d.2 (gC _ _) _;exact eg _ _ _ (cK (k*k)) _ _ (cB d.1) А (Ϯ e e) g _ (λ_=>0) _ 0 (λt p=>ee _ _ _ (cB d.1) l.1 (g t p)) l.2 (by simp) (by rw[gx];exact em _ h w k I j y x e) (by simp[bF]) _ (by simp only[dk _ _ _ _ _ _ e,cu,AQ]) _ rfl _ m .refine dO _ _ _ _ _ _ λj y x=>?_;split .rename_i d;have g:=(dk _ _ _ _ _ _ e).1 d.2;simp only[cu]at g;exact eg _ _ _ (cK (k*k)) _ _ (cB d.1) А (Ϯ e e) g _ (λ_=>0) _ 0 (λt p=>ee _ _ _ (cB d.1) l.1 (g t p)) l.2 (by simp) (em _ h w k I j y x e) (by simp[bF]) _ (by simp only[dk _ _ _ _ _ _ e,cu,AQ]) _ rfl _ m .rfl .rfl @[inline]def ky(u:т):Е:=if u<0x80000000 then u+0x80000000 else 0xFFFFFFFF-u @[inline]def bu(a b:т):т:=if ky asimp_all[Ι,mh,pU]<;>omega lemma il(a b:kF):(ky (bu a b))г=max (ky a)г (ky b)г:=by rw[bu];split<;>rename_i h<;>rw[Ι]at h<;>omega lemma io(a b:kF)(h:(ky a)г=(ky b)г):a=b:=by rw[ci,ci]at h;have:=a.toNat_lt;have:=b.toNat_lt;rw[<-Β];split_ifs at h<;>omega lemma fY(o:kB y≠255)(p:kB z≠255):mx y z=bu y z:=by have F:∀a b,sk aky aby rw[Ι,bf,bf]at h;rw[Ι,ci,ci];split_ifs at h⊢<;>omega have:=y.toNat_lt;have:=z.toNat_lt;unfold Conv.mx bu;by_cases h:sk yh j.2.2];simp only[not_or]at h;obtain⟨d,g,l⟩:=h;rw[Ι,bf,bf]at d g;have m:yг≠zг:=λe=>l (Β.mp e);have:(y=0/\z=0x80000000)\/(y=0x80000000/\z=0):=by simp only[<-Β,kN];split_ifs at d g<;>omega rcases this with⟨rfl,rfl⟩|⟨rfl,rfl⟩<;>decide lemma m4(g j l m:kF):(if nn g&&nn j&&nn l&&nn m then bu (bu g j) (bu l m) else mx (mx (mx (mx g g) j) l) m)=mx (mx (mx (mx g g) j) l) m:=by split .rename_i h;simp only[nn,Η,AM,Ak]at h;obtain⟨⟨⟨d,o⟩,p⟩,q⟩:=h;have e:∀a b,kB a≠255->kB b≠255->kB (bu a b)≠255:=λa b r u=>by rw[bu];split<;>assumption rw[fY _ _ d d,fY _ _ (e _ _ d d) o,fY _ _ (e _ _ (e _ _ d d) o) p,fY _ _ (e _ _ (e _ _ (e _ _ d d) o) p) q];apply io;simp only[il,max_self,max_assoc] .rfl @[inline]def iy(ch y x:п)(e:у):т:= let v:=wе if hb:ent j (lI (nI h w 2 I d y x t))) (lI (nI h w 2 I d y x 0))):=by have q:=cu 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,kH,nv,one_mul,Av]at m o p r;have:=dj;have g:∀i l,I.uget i l=I[iб]!:=λi l=>(AB I _ l).symm;rw[iy];dsimp only;split;rw[m4];simp(disch:=omega) only[g,lJ,mA,aa,γ,u];rw[<-cn (Conv.mx _ _),be,be,be,be,m,o,p,r];simp only[mD,List.range_zero,l6,Ϸ,mT];rw[<-cn (wl _ _ _ _ _ _ _ _),fn I w 2 _ (2*2) Б];simp only[nI];congr 2;funext j t;congr 2;ring def d9:с т:= if k=2/\0dc (iy 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 fo:d9=maxpoolSpec:=by funext c h w k I;unfold d9;split;obtain⟨rfl,d,g,p⟩:=‹_›;rw[d8 _ _ _ _ _ _ _ d,Ϛ];unfold maxpoolSpec;refine mi (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 (l7 o);rw[Ο]at this;omega have l:=ι w j;rw[nO]at l;refine iz h w I _ _ _ _ ?_ А;rw[show(2:у)=USize.ofNat 2 fromО,<-BP,<-mC,Ϗ 2,<-lX,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" =>AJ local notation "ZI" =>Core.an local notation "ZJ" =>Nat.div_eq_zero_iff_lt local notation "ZK" =>sqrtLower local notation "ZL" =>AK local notation "ZM" =>Finset.range local notation "ZO" =>mantOf_lt_24 local notation "ZQ" =>AL local notation "ZR" =>Core.ai local notation "ZS" =>Core.am local notation "ZT" =>roundRational local notation "ZU" =>Au local notation "ZV" =>Nat.div_le_self local notation "ZW" =>mantOf local notation "ZX" =>signOf local notation "ZY" =>AQ 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:kF):(ZC w)а<2^24:=by rw[ZI];exact ZO w lemma YB(a b:kF):(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 lm (k+2) _= Nat.repeat lm (k+1) _;rw[Yc,Yc,Yc];congr 1;rcases d with _|⟨_|_|_⟩<;> simp[ExtendedMantissa.ofMantissaAndAccuracy,lm,Ya]<;>omega open FloatLib.Numerics in lemma VY(q r D t:п)(e:0rfl:(if r=0 then 0 else 1)=Ya (lP r D)),<-h,(by rw[Τ,Ρ _ _ e,ώ d,Ai]:(q*D+r)/D=q),(by rw[Τ,Μ,γ d]:(q*D+r)%D=r)] 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[mz 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:=(div_lt_one XJ).2 (mod_cast t);have E:(0:ℝ)<=r/D:=XJ;have w:lf 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,(by push_cast;ring:(qз:р)+e+1=((qз+1:п):р)+e),ZL ZQ,ZF];gcongr;linarith have p:la (l9 P d (23-((qз:р)+e))).1 (l9 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,(by clear*-m g;omega:qз+1-23=(qз-23)+1),<-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,(by clear*-m g;omega:e+(23-((qз:р)+e))=-((qз-23:п):р)),zpow_neg,ZF];push_cast;field_simp generalize F:2*q+(if r=0 then 0 else 1)=J at g p⊢;rw[kE,AD Б,Model.ieeeRoundDyadic_eq_ieeeRoundDyadicImpl];simp only[Model.roundRat,n6,(Б:Fmt.isIEEE=true),↓reduceDIte,Model.ieeeRoundRatScaled,Model.ieeeRoundDyadicImpl,ZY,o,l,XA,w,Int.add_zero,nY,g,(Б:(FloatFormat.ieeeMaxNormalExponent lU:р)=127),(Б:FloatFormat.ieeeMinNormalExponent lU=-126),(Б:(FloatFormat.normalMantissaExpOffset lU:р)=150),(Б:Fmt.fracWidth=23),show J≠0 by clear*-F j;omega,(by push_cast;ring:((qз+1:п):р)+(e-1)=(qз:р)+e),show¬((qз:р)+e>127) by clear*-B;omega,show¬((qз:р)+e< -150) by clear*-A;omega,show¬((qз:р)+e< -126) by clear*-A;omega,(by clear*-m;omega:23<=qз+1),К,nZ,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= kW (kE lU ⟨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.2 o)).symm have d:=ρ.den_pos;generalize ρ.den=D,ρ.numл=r at h d;subst h;rw[roundRational,u,V0 s _ _ XJ v.den_nz q r D d (by rwa[div_lt_one (mod_cast d),Nat.cast_lt]at g) e ?_ p l m];simp[d.ne'];have:=congrArg (λz:ℚ=>(z:ℝ)) j;rw[Rat.abs_def,Rat.divInt_eq_div]at this;push_cast at this;rwa[Nat.cast_natAbs,mI] lemma Q7(R:п)(s:р)(h:2^25<=R): -s+1<=(ZE).targetExponent (kY R (-s)):=by have:=(mu XI).2 h;have:(ZE).mantissaBits<=25:=Б;rw[BV,kY];omega lemma Vd(v:ℚ)(q:0simp lemma YN(w:kF):(sv w:ℚ)=0↔ZW w=0:=by rw[sv];split_ifs<;>simp lemma Vr(w:kF):(sv w:ℚ)=(if ZX w then-1 else 1)*ZW w:=by rw[sv];simp lemma Y7(x:Д):(ZR x)а=xаз:=by rw[aA];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 simp only[(by rw[μ,g];simpa:kж<64),К,ψ,ν,χ _ _ (show kж<=63 by rw[θ,g];simp;omega),g,kA,ο,β,γ h,γ (А:63-k<64),kH,lY] rw[(by rw[<-AF];congr 1;clear*-h;omega:2^1*2^(63-k)=2^(64-k)),(by rw[<-AF];congr 1;clear*-h;omega:2^64=2^(64-k)*2^k),Nat.mul_mod_mul_right,<-Ϛ,<-Ϡ,Nat.mod_add_div'];exact⟨О,AO (ZV _ _) XI⟩ have m:dа*2^(k-64)<2^62:=calc _<2^48*2^14:=ly o (Θ XJ XI) XJ _=_:=О simp only[(by rw[μ,g];simp;omega:¬kж<64),XA,ϋ,Κ,ψ,χ _ _ (show(64:Д)<=kж by rw[θ,g];simp;omega),g,kA,γ (А:k-64<64),ο,γ (А:dа*2^(k-64)<2^64)] refine⟨?_,m⟩;rw[Ϛ,<-AF];congr 2;clear*-h;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,lV];have e:∀j,VJ x u (i+(j+1))=VJ x u (i+1+j):=λj=>by rw[lO];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,ο,YB,ZS] have r:(ZC x[i]!*ZC x[i]!)а<2^48:=by rw[YB];have:=ZO x[i]!;exact(ϕ this this).trans_eq О 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 (by clear*-t;omega);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[η,μ,Ax lq,kA];grind rw[AC t,p (i+1) _ _ _ _ (by clear*-q;omega),ο];ring lemma Yk(n:п)(f:п->ℚ)(a:ℚ): (lj 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[mD,l6,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:kF)(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,(by rw[<-sq_abs,VT];ring:(sv w:ℚ)^2=(ZW w:ℚ)*ZW w),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:pK)(R:п)(e:р)(d:Accuracy)(l:R≠0) (p:e+1<=spec.targetExponent (kY R e)): nk spec g R e d=pp spec g (2*R+Ya d) (e-1):=by have h:kY (2*R+Ya d) (e-1)=kY R e:=by unfold kY;rw[Vi R _ l (by cases d<;>simp[Ya])];omega unfold pp decreaseExponent;simp only[h];rw[(А:(e-1-spec.targetExponent (kY R e))л=0)];simp;unfold nk shiftToTargetExponent shiftToExponent;rw[h];generalize spec.targetExponent (kY R e)=T at*;obtain⟨k,j⟩:∃k,(T-e)л=k+1:=⟨(T-e)л-1,XI⟩;dsimp only;rw[j,(by clear*-j p;omega:(T-(e-1))л=k+2),QA,(by push_cast;ring:e-1+((k+2:п):р)=e+((k+1:п):р))] 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=az 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<;>simp 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[aJ _ _ _ XI,h,j,Yf,<-g,Q4 _ _ R (-s) _ XI (Q7 R s XI),Vh,<-g,sq,(А:(((297-s)л:п):р)-298=-s-1)];rfl @[inline]def YG(num den R:п)(s:р):т:= if R>>>31==0&&-209<=s&&s<=297 then Core.az Н (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[ο];use e;push_cast;rw[<-ZF (2:ℚ) cл,(А:((cл:п):р)=c)];ring;use 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:kF)(t:0(2:ℚ)^j=2^k*2^((g:р)-298):=λk j h=>by 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) (by clear*-y;omega),m (l+149-g) ((l:р)-149) (by clear*-y;omega),ο,ο];push_cast;field_simp:_=((A:ℚ)*2^(2*(u:р)-298)/e+E*2^((l:р)-149))*2^(2*s)));push_cast at this⊢;omega @[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 rw[AD XI];simp only[Yz,ZI,ZS,lV];have e:∀j,YS x u (i+(j+1))=YS x u (i+1+j):=λj=>by rw[lO];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,YS];rcases h with h|h;simp[(YN _).2 h,h];rw[(by rw[<-ZF,<-ZL ZQ];congr 1;omega:(2:ℚ)^((ZZ x[j]!:р)-149)=2^(ZZ x[j]!-u)*2^((u:р)-149)),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,Ai,ϋ,ϳ,ϑ,Κ,n8];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,Ai];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 no n x r=((pn.1:ℚ)-pn.2)*2^((u:р)-149)/n/\ XH n x r (no 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:no n x r=(pn.1-pn.2)*2^((u:р)-149)/n:=by rw[no,Yk,Ai,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 (no n x r)=(n*Q-S^2)*c^2/(n*n):=by rw[rowVariance,Yk,Ai,g,ϔ О λj _=>(by ring:(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),nJ,nF,<-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 (no n x r):=(by rw[rowVariance,Yk,Ai];positivity);rw[h,le_div_iff₀ XJ,nv]at e;exact(mul_nonneg_iff_of_pos_right XJ).1 e use g;rw[h,pO ((Nat.cast_le (α:=ℚ)).1 (by rw[YO];push_cast;linarith)),YO,<-o,l];simp def sg(s:х)(M:ℚ):ℚ:=if s then-M else M lemma Q6(w:kF):(ZC w !=0)=!decide (ZW w=0):=by rw[show(ZC w !=0)=!(ZC w==0)fromО,YK] lemma Y2(w:kF):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[К,υ,Am]at j⊢<;>rw[(by rw[u];exact_mod_cast(Au M (2^27)).symm:(M:ℝ)=((M/2^27:ℕ):ℝ)*2^27+L)]at j<;>constructor<;>linarith only[j,r,t,AI l o,AI m o] end NF namespace NE open NF Dense.F open Dense (ay) @[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.ar (((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 kj(s:х)(q σ:Д)(j:2^25<=qа)(l:qа<2^26)(m:146<=σа) (o:σа<=398):pk s q σ=az s ((2:Д)*q+1) σ:=by have d:((2:Д)*q+1)а=2*qа+1:=by rw[η,ύ];simp only[kA];omega have g:(((2:Д)*q+1)<<<36)а=(2*qа+1)*2^36:=by rw[ψ,d];simp only[kA,kH,ο];clear*-l;omega have h:(σ-36)а=σа-36:=by rw[χ σ 36 (А:36<=σа)];rfl obtain⟨r,-,t⟩:=bM s (((2:Д)*q+1)<<<36) (σ-36) А А А А;have p:(pk s q σ)г=(if s then 2^31 else 0)+((σа-146)*2^23+(ar (((2:Д)*q+1)<<<36))а):=by clear r h;unfold pk;rw[Ϫ,η,η,ψ,χ σ 146 (А:146<=σа)];cases s<;>simp only[К,Л,υ,kA,kH,ο]<;>omega rw[(by clear p r t;rw[cl s _ _ А А,cl s _ _ А А,d,g,h,(by rw[<-AF,BQ (А:36<=σа)]:(2:р)^σа=2^36*2^(σа-36))];cases s<;>simp only[К,Л,υ]<;>push_cast<;>ring_nf:az s ((2:Д)*q+1) σ=az s (((2:Д)*q+1)<<<36) (σ-36))];apply Β.mp;clear*-p r h m;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[A4];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[A4];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:kF):|(sv w:ℝ)*2^kG w|<=2^(24+kG w):=by rw[Ae,AW (by positivity:(0:ℝ)<2^idxOf w),AF];have:|(sv w:ℝ)|<=2^24:=by rw[<-mI,Ϲ];exact_mod_cast(bg w).le exact AE this В lemma jM(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;have m:0<=τ:=В;have r:=Aa G;rw[Ae a G]at B;rw[Ae t R,Ad g]at D;have X:|j+l|<=2*|v|+2*τ:=by linarith only[AY (j+l) v,Aw (j+l) v,V,Aa v,m] have M:|t| *R<=2*|j|+2*τ:=by have:=AY (t*R) j;rw[Aw,Ae,Ad g]at this;linarith only[this,D,Aa j,m] have K:|a| *|G|<=2*|t|+2*τ:=by have:=AY (a*G) t;rw[Aw,Ae]at this;linarith only[this,B,Aa t,m] have J:|A|<=2*|a|+2*τ:=by linarith only[AY A a,Aw A a,z,Aa a,m] have L:|j|<=2*|v|+2*τ+|l|:=by have:=Ag (j+l) (-l);simp at this;linarith only[this,X] rw[show 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];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 linarith only[Ag (a+b+c+d+e) f,Ag (a+b+c+d) e,Ag (a+b+c) d,Ag (a+b) c,Ag a b] refine(T _ _ _ _ _ _).trans ?_;simp only[Ae,Ad g,Ad hκ];clear_value τ;linarith only[V,X,D,AE B g,AE K g,AE z (Af r g),AE J (Af r g),mul_le_mul_of_nonneg_left hR (Af (Aa A) r),AE (AE he r) hκ,L,M,Aa v,Aa l,Aa j,m,Af m g,Af m (Af r g),r] set T:ℝ:=(2:ℝ)^((c:ℤ)-2+o-1075)with W;rw[(by rw[W,<-AA,<-AK Г,(Г:(4:ℝ)=2^(2:ℤ)),<-AK Г];ring:(2:ℝ)^c*(2:ℝ)^((o:ℤ)-1075)=4*T)];have t1:|v|/2^45<=T:=calc _<=2^53*(2:ℝ)^((o:ℤ)-1075)/2^45:=by gcongr _=(2:ℝ)^((8:ℕ)+((o:ℤ)-1075)):=by rw[AK Г,AA];field_simp _<=T:=AG Г А 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:=AG Г XI have t3:q*|G| *κ<=T:=by rcases N with I|⟨I,aL⟩;rw[I,nv,nv];positivity;rw[I];calc _<=(2:ℝ)^y*2^(24+u)*2^53:=by gcongr _=(2:ℝ)^(((y+(24+u)+53:ℕ):ℤ)):=by rw[AA];ring _<=T:=AG Г (by push_cast;omega) have g1:|G|<=2^278:=hG.trans (AU Г А);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[(Г:(1:ℝ)/2^21=2^(-21:ℤ))];exact AG Г А have a2:(1:ℝ)/2^1075*R<=1/2^25:=calc _<=(1:ℝ)/2^1075*2^52:=by gcongr _=1/2^1023:=by field_simp _<=_:=AV Г Г linarith only[t1,j,t3,a2,a3,a4,(AV Г Г:(1:ℝ)/2^1075<=1/2^25),(by grind:(12:ℝ)*(1/2^25)<=1/2^21)] end NE namespace NR open NF Dense.F open Dense (ay) @[inline]def pt(j:п):ф:=P.get! (j+1) @[inline]def p2(e:п):ф:=pt (min e 254)*pt (e-min e 254) lemma jw(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 iJ j А lemma jv(e:п)(l:e<=508):fv (p2 e)/\rv (p2 e)=(2:ℝ)^e:=by obtain⟨d,h⟩:=jw (po e 254) А;obtain⟨g,j⟩:=jw (e-po e 254) А;have:=aE _ _ d g 1 (e:ℤ) (by rw[h,j,<-AF,AA];push_cast;rw[one_mul];congr 1;omega) Б А (bL 1 e 971 А Г 1 Б);rw[p2];refine⟨this.1,?_⟩;rw[this.2,AA];simp structure fH where td:т ok:х nS:ф R:ф pz:ф A1:Д A2:Д C1:Д @[inline]def eI(n:п)(t:п×п×х×п×п×т):fH:= 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.ai 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 kn(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,Τ _ v,Ρ _ _ В,Τ] rw[eI]at h⊢;dsimp only at h⊢;rw[Yz,ah]at h⊢;simp only[Η,AJ,BM,AM,Ak,θ,kA,AQ]at h obtain⟨⟨⟨⟨⟨⟨hn,a4⟩,aH⟩,t⟩,A⟩,a7⟩,Q⟩:=h;have q:((o<<>>(k-21)<2^53:=XI;generalize hS:(o<<>>j=e at q⊢;have ba:2^23<=kM d:=by rw[kM,AC aH];omega have p:(nж*mW d)а=n*kM d:=by rw[ύ,Α (А:n<2^64),an,γ];have:=ϕ hn (lB d);omega generalize nж*mW d=D at t A p⊢;have hL:=Y7 D;generalize ai D=x at t A hL⊢;set L:=xа;have w:n*kM d≠0:=XJ;obtain⟨I,al⟩:2^L<=n*kM d/\n*kM d<2^(L+1):=by rw[hL,p];exact⟨ϰ w,ϙ⟩ have J:=kn _ (x-11) _ _ p I al (by rw[χ _ _ (t:11<=x)];rfl) t A;generalize((0x8000000000000000/D)<<<(x-11))+(((0x8000000000000000%D)<<<(x-11))/D)=g at J⊢;set y:=n*kM d with G;have l:0omega;show ae (0-eж)=_;rw[ay,Ζ,hz,ϋ,ϑ];clear*-q;omega have B:=dB _ (by rw[W];split<;>simp<;>omega);rw[W]at B;obtain⟨f2,v2⟩:=jv (j+u) А;have:=aE _ _ B.1 f2 _ _ (by rw[B.2,v2,AA]) (by split<;>simp<;>omega) А (bL 53 (j+u) 971 А AP _ (by split<;>simp<;>omega));refine⟨this.1,?_⟩;rw[this.2,AA];simp rw[<-as];by_cases z:j=0;exact⟨0,by rw[<-m,z];simp,pZ О⟩;refine⟨2^(j+u),?_,BA ⟨О,by simp only[z,AQ,Am];rw[η,Α (А:j+u<2^64)];simp only[kA];clear*-Q;omega⟩⟩;have a1:(e:ℝ)*2^j<=S:=(by rw[<-m,β];exact_mod_cast pr _ _);have a2:(S:ℝ)linarith only[AE a1 hu.le,AI a2 hu,(В:(0:ℝ)<=2^j*2^u)] have B:=dB g.toInt64 (by show(ae g)к<2^53;rw[ay];split<;>omega);refine⟨B.1,?_⟩;rw[B.2];show((ae g:ℤ):ℝ)=gа;rw[ay,AC А];simp have H:(0:ℝ)linarith only[(le_div_iff₀ H).2 (by rw[J];exact_mod_cast pr _ _:(gа:ℝ)*y<=2^(52+L)),(div_lt_iff₀ H).2 (by rw[J,mul_comm];exact_mod_cast Nat.lt_mul_div_succ _ l:(2:ℝ)^(52+L)<(gа+1)*y),this] rw[r];exact jv _ А rw[Rat.cast_ne_zero,Y1,V];positivity have h1:(n:ℝ)≠0:=mod_cast a0.ne';have h2:(kM d:ℝ)≠0:=mod_cast(А:kM d≠0);rw[Y1,V,G];push_cast;rw[Ac Г,AA];field_simp;ring swap;split;simp;rw[η,Α (by clear*-Q;omega:j+u<2^64)];simp only[kA];clear*-Q;omega all_goals rw[η,r];simp only[kA];clear*-bs A;omega lemma kg(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 ae nж=n;rw[ay,d];split<;>omega have:=dB _ (by rw[e];simp;omega);rw[e]at this;omega lemma ic(a:ZB)(h:∀i (d:ikF)(n u k J K:ℕ)(sS:х)(ρ:NR.fH)(l:ℚ) (hρ:ρ=NR.eI n (u,k,sS,J,K,d))(hx:kB x≠255)(hg:kB g≠255)(hb:kB b≠255)(b6:0simp only[BE,nE]<;>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,nE];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+kG b+j):=by rw[r.2,AF,<-Ap,Ae,AW (В:(0:ℝ)<2^j),AF (2:ℝ) (24+kG 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[Η,AJ,θ,μ,kA]at hc;obtain⟨⟨⟨⟨ch,c1⟩,X⟩,B⟩,as⟩:=hc;have eb:(eF V.toBits)а<2048:=by rw[eF,Ε];exact AO ϝ Б have bq:ρ.C1<=eF V.toBits:=θ.2 (by have:=Ζ (eF V.toBits) ρ.C1;clear*-this c1 bp Jb;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)а:=(by clear*-ch;omega);have bs:¬eF V.toBits=0:=λh0=>by simp[h0]at M set H:=(eF V.toBits)аwith dy;have aL:=eK (eF V.toBits+10) (iW b+ρ.A1);have D:=eK (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2);obtain⟨b4,A,b5⟩:(eF V.toBits+10)а=H+10∧(iW b+ρ.A1)а=kG b+j+1056∧(iW g+ρ.A2)а=kG g+ρ.A2а:=by rw[η,η,η,am,am,bh];simp only[kA];clear*-eb ib ig Jb Ab;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];clear*-;omega have z:=χ _ _ ah;rw[D]at z;generalize mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2)-eF V.toBits=cc at z X B as;set c:=ccа;have L:((1:Д)<<>>63!=0 then-(I:ℝ)else I)*U:=XI;obtain⟨N,d1⟩:I<2^53∧2^52<=I:=by clear*-bw e1;omega have bv:|rv V|<=2^53*U:=by rw[a3,Ae,AW W,Ax _root_.abs,BE,nE,ite_self];gcongr;exact_mod_cast N.le have dm:κ<=2^53:=by grind have al:eS=0\/(eS=2^es/\es+kG g+1154<=c+H):=b2.imp id λ⟨h0,hA⟩=>⟨h0,by clear*-hA z;omega⟩;have m:=jM _ Xn _ ((if sS then-(S:ℝ)else S)*2^u) _ _ κ Bz _ _ _ _ eS H c _ _ es j rfl (by rw[E.2];split<;>[skip;rw[<-BE]]<;>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) (by clear*-z;omega) (by clear*-z;omega) al;have hY:((sv x:ℝ)*2^kG x*n-(if sS then-(S:ℝ)else S)*2^u)*((sv g:ℝ)*2^kG g)*κ+(sv b:ℝ)*2^(kG b+j)=(((ZA x-l)*ZA g/ZA d+ZA b:ℚ):ℝ)*(2^149*2^j):=by have e:∀w:kF,((ZA w:ℚ):ℝ)=(sv w:ℝ)*2^kG w/2^149:=λw=>by rw[Y1];push_cast;rw[Ac Г,AA];ring push_cast;rw[e x,e g,e b,o,AF,hZ];have e2:(n:ℝ)≠0:=XJ;field_simp rw[show Xn=(sv x:ℝ)*2^kG x*n by rw[hX.2];push_cast;ring,r.2,vg,hY]at m;generalize(ZA x-l)*ZA g/ZA d+ZA b=Y at m a2⊢;have c2:=jh _ ((Y:ℝ)*(2^149*2^j)) _ _ _ _ c W a3 rfl B aH m;set q:=I/2^27 with hq;obtain⟨b7,cb,q0⟩:2^25<=q∧q<2^26∧q≠0:=by clear*-hq N d1;omega 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,<-AK Г,<-AK Г,<-AK Г];congr 1;ring have hP:(0:ℝ)<2^149*2^j:=XJ;obtain⟨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;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 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 (BF lo hP.le) have A:(if s then-Y else Y)<((q:ℚ)+1)*2^e:=by exact_mod_cast(BF hi hP.le).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):=AO В 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 rwa[hδ,sub_pos,lt_div_iff₀ a0] 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 ((m9 q0).2 cb)) ((mu q0).2 b7);have e3:(mF V.toBits>>>27)а=q:=by rw[ν,<-O];simp only[kA,kH,β];clear*-hq;omega rw[<-ds]at ch c1;rw[kj _ _ _ (e3▸b7) (e3▸cb) ch c1,<-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,К,υ,Л]at v⊢<;>simp only[AJ,decide_eq_false_iff_not,not_lt]<;>linarith only[v]) c3.le c4 (by grind) one_pos (by rw[t,hδ];field_simp;ring) (by simpa) (by grind) (by grind) (by rw[η,ύ,ν];simp[V2,<-O];clear*-hq N;omega) (by clear*-ds he M;omega)] end NE local instance:Inhabited NR.fH:=⟨⟨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:kF)(x:ZB)(r:п)(g:0у->у->т)(s:σ)(lo i e:у)(out:ZB):ZB:= if h:iу->у->kF)(s:σ)(g e:у)(i:у)(d:ZB): (Yq f s g i e d).toList=d.toList++(pV 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 (ε.2 XI),j _ _ (by rw[uS XI];omega),uS XI,BS];simp @[specialize]def Yr{σ:Type}(g:п->σ)(f:σ->у->у->т)(n rows r:п)(out:ZB):ZB:= if rσ)(f:σ->у->у->kF)(n d r:п)(e:ZB)(m:d*n<2^32): (Yr g f n d r e).toList=e.toList++(pV (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,j0,Conv.aa _ (А:r*n<2^32),Conv.aa _ (А:r*n+n<2^32),List.append_assoc,ϱ,nO,nO,Τ (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[mG j.1 (nO r n▸j.2)] lemma Ys{σ:Type}(g:п->σ)(f:σ->у->у->kF)(n d:п)(j:d*n<2^32)(F:Fin (d*n)->kF) (h:∀q (h:qby rw[(by rw[Nat.mod_add_div']:qе=(q%n+q/n*n)е),lX,mC,USize.add_sub_cancel]:∀q,qе-(q/n*n)е=(q%n)е)];apply List.ext_getElem<;>simp;omega def cS(x:ZB)(i e:у)(u:Д):Д:= if h:irw[cS,Yh]<;>have:=e.toNat_lt_size;rw[dif_neg (by rw[ε];omega),AC XI];rename_i g;rw[AT (ε.2 XI),AD XI,g _ _ (by rw[uS XI];omega),uS XI,f6];congr 1;clear h this;split_ifs with h2 d<;>(try rw[μ]at d)<;>omega structure jY 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 cF 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<;>clear*-q this<;>omega have p:(2:Д)*dж=(2*d)ж:=ξ.mp (by simp<;>omega);simp only[t,p,show dж<=39↔d<=39 by rw[θ,t];rfl];clear q o t p;split_ifs<;>refine⟨(j _ _ _ _ _ _ _ _ _ XI).1,(j _ _ _ _ _ _ _ _ _ XI).2.trans ?_⟩<;>simp(disch:=assumption) only[j5,cy,jZ,lO _ (VO _ _)] @[inline]def ax(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 aU(a b:Д):(ax a b).1а*2^64+(ax a b).2а=aа*bа:=by unfold ax;simp only[η,ύ,ml,nB,kA];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;clear d g h j;omega @[inline]def cT(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[η,μ,Ax lq,kA];grind @[inline]def fV(bh bl:Д):Д:=if bh !=0 then 64+ZR bh else ZR bl lemma iq(d g:Д):(fV d g)а=(dа*2^64+gа)з:=by have:=g.toNat_lt;rw[fV];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 rwa[e]),e,η,Y7];have:=(m9 j).2 d.toNat_lt;grind .simp only[AM,Ak,pM]at h;subst h;simp[Y7] def cR(H1 H0:Д)(t:п)(st:х)(Dn u:п)(eps:т):Д:= let sE:=ZZ eps+149-2*u let e:=cT H1 H0 (Dnж*ZC eps) (sE-t) let S2:=(1374+(ZR Dnж)а-(2*u+t+(fV 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:=ax (R*R) den let q:=ax ((R+1)*(R+1)) den if 2*u<=ZZ eps+149/\t<=sE/\sE-t<=78/\H1<0x4000000000000000/\0(cR N M t (L !=0) d u j)й=V5 A d u j:=by unfold cR;dsimp only;generalize he:cT N M _ _=e;generalize as:(fV 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ж<<(m*m)а=mа*mа:=λm h=>by rw[ύ];apply γ;exact AO (ϧ h h) Б 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 xh:X<=H:=(by clear*-I a1 hH p2;omega);have h1:=ι (2^t) xh;have K:=ι (2^t) (by clear*-J a0 hH e2;omega:H+1<=Y);clear a1 a0;have G:∀a,a*(d*2^(k+t))=a*(d*2^k)*2^t:=λa=>by rw[m7];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];clear v x h3;apply ϓ.2;simp only[Η,ZY,<-ξ,BM,bne_eq_false_iff_eq];constructor;grind;intro h4;have:X=H:=by by_contra;have:=ι (2^t) (А:X+1<=H);rw[Ϡ]at this;omega clear*-this I hH p2 e2 h4 U h1;omega unfold V5;dsimp only;rw[min_eq_left V,Nat.sub_self,BH,ο,ah,al,show(350-((2*u:п):р)-(((t+W:п):р)-(dз:р)))/2=(O:р)-512 by clear*-v E;omega,show((2*u:п):р)-298+2*((O:р)-512)=-((k+t:п):р) by clear*-x D;omega,show V8 B (-((k+t:п):р))=B by rw[V8];split_ifs;rw[show(-((k+t:п):р))л=0 by clear*-x;omega,BH];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,YG,AD (show(Rа>>>31==0&&decide (-209<=(O:р)-512)&&decide ((O:р)-512<=297))=М by simp only[Η,ZY,ZH];clear*-g E F;omega),<-aL];congr 1;apply ξ.1;rw[ZG,η,ύ];split<;>simp<;>clear*-g<;>omega;congr 1;clear*-;omega lemma jU(z m a d e:Д)(h:z≠0\/¬(msimp only[UInt64.sub_zero,Ζ,kA]<;>omega lemma jD(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[η,ύ,ml,nB,kA];omega @[inline]def ei(l h:Д)(c S n Dn u:п)(eps:т):Д:= let a:=ax nж l let b:=ax nж h let m:=a.1+b.2 let z:=b.1+nж*cж let s:=ax Sж Sж if n<1024/\S<2^64/\c<1024/\a.1<=m/\(z≠0\/¬(m(ei l h c S n Dn u eps)й=V5 (n*Q-S*S) Dn u eps:=by unfold ei;dsimp only;have B:=aU nж l;have D:=aU nж h;have E:=aU Sж Sж;generalize ax nж l=a at B⊢;generalize ax nж h=b at D⊢;generalize ax Sж Sж=s at E⊢;split;swap;exact λh=>absurd h Б rename_i G;obtain⟨H,T,C,M,Y⟩:=G;have N:nжа=n:=Α (H.trans Б);rw[N]at B D;rw[Α T]at E;have A:=jU _ _ _ _ _ Y rw[E,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 k:n*hа<1024*2^64:=ly H h.toNat_lt.le Б;have:n*c<1024*1024:=ϕ H C;rw[θ,η]at M;rw[η,η,ύ,N,Α (C.trans Б),γ (a:=n*c) (by clear*-this;omega),γ (by clear*-D k this;omega),γ А,hQ,Nat.mul_add,Nat.mul_add,<-Ϛ,<-Ϛ,<-B,<-D];ring]at A generalize b.1+nж*cж-_=X at A⊢;generalize a.1+b.2-s.1-_=V at A⊢;generalize a.2-s.2=W at A⊢;have:=V.toNat_lt;have:=W.toNat_lt;split;rename_i K;rw[K]at A;split;have J:=cd V W 0 0 Dn u (n*Q-S*S) eps (by rw[<-A];simp) П;simp only[bne_self_eq_false]at J;split;omega;split;rename_i G;obtain⟨K,U,-⟩:=G;rw[<-jX _ _ _ _ hD he U];exact cd _ _ _ 32 _ _ _ eps (by rw[jD,<-A,K];simp) П;omega;exact cd _ _ _ 32 _ _ _ eps (by rw[jD,<-A];simp) (by simp;omega);exact cd _ _ _ 64 _ _ _ eps (by rw[<-A];ring) W.toNat_lt def gQ(n:п)(eps:т)(x:ZB)(r:п):т:= let lo:=r*n let u:=cS x loе (lo+n)е 255 let st:=cF 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 ei st.l st.h st.c 0 1 n uа eps elseЖ if v<Жthen vйelse F () lemma gR(n:п)(eps:kF)(x:ZB)(r:п)(hn:0NR.eI 1 (0,0,Н,0,0,gQ n eps x r)) (λe i j=>let xw:=ck x i;let gw:=ck 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 (A0 (rows*n)) lemma Qg{α:Type}[Inhabited α]{m k:п}(f:Fin m->α)(h:k< m): (kK f)[k]! =f ⟨k,h⟩:=by rw[AB _ k (by simpa using h),Λ] lemma YP(e n:п)(h:kF)(x g:ZB)(l:0kB x[i]!≠255)(z:∀j,jkB 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 l;have u:=ι n (l7 r);rw[Ο]at u;dsimp only;simp only[f6,Conv.aa _ (А:i<2^32),Conv.aa _ (А:i%n<2^32),Qg _ r,gR _ _ _ _ l q (А:i/n*n+n<2^32),V7 n h x _ l q];generalize mK _=d;have p:(ZA x[i]!-0)*ZA g[i%n]!/ZA d+ZA 0=ZA x[i]!*ZA g[i%n]!/ZA d:=by rw[(by rw[Y1,(Б:sv 0=0)];simp:ZA 0=0)];ring split_ifs with t y;simp[(by rw[Y1,(by rw[sv];split<;>simp[(by simpa[YK]using t:ZW x[i]! =0)]:sv x[i]! =0)];simp:ZA x[i]! =0)];exact(NE.jn _ _ 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 fG(e n:п)(d:kF)(x g:ZB):SN e n d x g=mq e n d x g:=by rw[SN,mq];congr 1;rw[Q6,Y2];have:(0:ℚ)<2^((ZZ d:р)-149):=XJ;rw[sg];cases ZX d<;>simp[this,BD] lemma jm{d n:п}{e:kF}{x g:ZB}(h:mq d n e x g=М): 0kB x[i]!≠255)/\∀j,jkB g[j]!≠255:=by simp only[mq,Η,ZH,BC]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 use h.1.1.1.1.1.1.2,h.2,λi m=>NR.ic x (by simpa[np]using h.1.1.1.2) i А,λj o=>NR.ic g (by simpa[np]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 du:ca=rmsnormSpec:=by funext j n l x g;rw[ca];split_ifs with h hR .rw[fG]at h;rw[rmsnormSpec,rmsnormWith];rw[AD h];have⟨a,e,c,d⟩:=jm 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:kF)(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;use(by rw[l,<-Yn];simp only[YU,Yz,ο,n4,ζ,β,ZU]),(by simp only[YU];rw[YW _ _ _ _ (Ϯ e e) h,m]),g @[inline]def gM(n:п)(eps:т)(x:ZB)(r:п):п×п×х×п×п×т:= let lo:=r*n let u:=cS x loе (lo+n)е 255 let st:=cF 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 ei st.l st.h st.c S n (n*n) uа eps elseЖ if v<Жthen vйelse F ()) lemma gN(n:п)(eps:kF)(x:ZB)(r:п)(hn:0NR.eI n (gM n eps x r)) (λe i j=> if e.ok then NE.el (ck x i) (ck g j) (ck b j) nd e.nS e.R e.pz e.A1 e.A2 e.C1 λ_=>gP n eps x g b iб jб else gP n eps x g b iб jб) n rows 0 (A0 (rows*n)) lemma V3(e n:п)(h:kF)(x g b:ZB)(m:0kB x[i]!≠255)(F:∀j,jkB g[j]!≠255) (D:∀j,jkB 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 m;have z:=ι n (l7 w);rw[Ο]at z;dsimp only;simp only[f6,Conv.aa _ (А:i<2^32),Conv.aa _ (А:i%n<2^32),gP,Qg _ w,Fin.is_lt,Qg,gN _ _ _ _ m q (А:i/n*n+n<2^32)];obtain⟨v,A,-⟩:=Vn n h x (i/n) m q;rw[<-v,<-A];generalize YU n h x (i/n)=t at*;obtain⟨u,k,y,o,p,d⟩:=t;dsimp only at*;split_ifs with E;exact NE.jn _ _ _ d _ n u k o p y _ _ rfl (H i G) (F _ r) (D _ r) m E (by rw[v];unfold sg;split<;>push_cast<;>rw[Ac Г,AA]<;>ring) 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 cN:bn=layernormSpec:=by funext l n m x g b;rw[bn];split_ifs with h;rw[fG]at h;rw[layernormSpec,layernormWith,AD h];simp only[Η]at h;obtain⟨a,e,c,d⟩:=jm 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.ic b (by simpa[np]using h.2) j А);rfl;rfl end Norm end def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.c7,Dense.ff⟩ conv:=⟨Conv.er,Conv.cG⟩ elem:=⟨Conv.dU,Conv.d9,Bn.cq,Bn.br⟩ norm:=⟨Norm.ca,Norm.bn⟩ theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm,Dense.eD,Dense.gv,Conv.eu,Conv.cY,Conv.fo,Conv.eV,Bn.dT,Bn.cO,Norm.du,Norm.cN] end Submission