import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open USize renaming lt_iff_toNat_lt->β,le_size->κ,toNat_zero->Ϗ,toNat_add->ϒ,toNat_one->Ϙ,size_eq_two_pow->ϲ open Nat renaming and_two_pow_sub_one_eq_mod->γ,shiftRight_eq_div_pow->ε,mul_le_mul_right->η,mod_eq_of_lt->ν,shiftLeft_eq->Β,pow_le_pow_right->Ζ,succ_mul->Μ,add_one_mul->Ρ,lt_log2_self->ώ,add_sub_cancel_left->ϐ,zero_add->ϔ,add_zero->ϕ,two_pow_add_eq_or_of_lt->ϙ,mul_comm->Ϛ,mod_lt->ϝ,add_comm->ϥ,div_le_div_right->ϧ,mul_assoc->Ϩ,div_eq_of_lt->Ϭ,mul_one->ϭ,div_lt_iff_lt_mul->ϳ,mul_lt_mul_of_pos_right->ϴ open UInt64 renaming le_iff_toNat_le->θ,toNat_add->ι,lt_iff_toNat_lt->μ,toNat_inj->ξ,toNat_shiftRight->ο,toNat_and->ψ,toNat_sub->Α,toNat_shiftLeft->Ε,toNat_sub_of_le->Η,toNat_ofNat_of_lt'->Χ,le_trans->ό,toNat_toUInt32->ϓ,toNat_mul->ϩ open Bool renaming and_eq_true->ς,false_eq_true->υ,eq_iff_iff->Ϥ open UInt32 renaming toNat_inj->χ,toNat_and->Ι,lt_iff_toNat_lt->Ν,toNat_shiftRight->Τ,toNat_toUInt64->Ϡ,toNat_zero->Ϧ,toNat_shiftLeft->ϯ open Array renaming getElem_ofFn->Θ,size_uset->Ξ,size_replicate->Υ,size_ofFn->ϣ,uset_eq_set->϶ open Model renaming toModel_ofFloatModel->Κ,isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite->ύ,toReal_eq_unpackedToReal_toModel->ϖ,toReal_roundDyadic_eq_roundAt->Ϝ,toDyadic?_isSome_eq_isFinite->Ϟ,abs_signed_mul_bpow_le_toReal_posMaxFinite->ϡ,ofFloatModel_pack->Ϫ,toDyadic?_ieee_eq_model->Ϯ,roundDyadicGeneral_eq_roundDyadic->Ϲ,isNaN_eq_false_of_toDyadic?_some->ϻ open Finset renaming sum_range_succ->Λ,sum_congr->Ο,mem_range->ϊ,sum_Ico_succ_top->ϗ,sum_add_distrib->ϛ,sum_mul->ϟ,abs_sum_le_sum_abs->Ϣ,sum_sub_distrib->ϱ,sum_le_sum->Ϸ,sum_Ico_eq_sum_range->ϸ open FloatLib.Numerics.Dyadic renaming cast_toRat->ϋ open Real renaming sqrt_nonneg->ϑ open Int renaming natAbs_mul->ϫ,cast_abs->ϰ,abs_eq_natAbs->ϵ open BitVec renaming toInt_eq_toNat_cond->Ϻ 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 "а"=>USize.toNat local postfix:max "б"=>UInt64.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.log2 local postfix:max "з"=>Fin.val local postfix:max "и"=>Nat.toUInt64 local postfix:max "й"=>Int.toNat local postfix:max "к"=>Int.natAbs local postfix:max "л"=>UInt64.toUInt32 local postfix:max "м"=>UInt32.toUInt64 local postfix:max "н"=>UInt32.toUSize open UInt64 renaming reduceToNat->kE,toNat->lG,toUInt32->lO,size->lZ,toNat_zero->mc,toNat_toBitVec->ms,toNat_or->mJ,toNat_ofNat->no,toNat_one->nM,sub_add_cancel->pf,ofNat->pZ open FloatLib.Floats.Formats.BinaryInterchange.FloatFormat renaming binary64->kF open Finset renaming range->kG,Ico->lj,sum_range_succ'->l7,card_range->mj,sum_le_card_nsmul->nG,sum_const->nV,mul_sum->pA,sum_nonneg->p8 open USize renaming reduceToNat->kH,size->li open ExactRuntime renaming expOf->kI,Word->kJ,idxOf->kM,toDyadic_ofUInt32->kT,mantOf->kU,signOf->kX,stableNormDomain->kY,toWord->lf,rowMean->lk,rowVariance->ls,sqrtRational->lB,ofIntDyadic->lE,ConvShape->lJ,oneW->lV,fracOf->l9,mantOf_lt_24->me,finishWord->mv,finishWord_of_ne->mw,windowAt->mH,layernormStable->mS,dotOf->m9,expOf_toNat_lt->na,conv2dSpec->np,isFinite_ofUInt32->nv,maxpoolSpec->nA,decodeD_toRat->nE,rmsnormStable->nI,decodeD->n0,finiteWord->n7,ofW->pb,Fmt->pn,dallNZ->po,avgpoolWith->pz,ofUInt32_bits->pK,linearSpec->pU open FloatLib.Floats.Formats.BinaryInterchange.Model renaming ofFloatModel->kK,roundDyadic->kN,unpackedToReal->lq,isNaN_eq_false_of_toDyadic?_some->lr,ofUInt32->lD,toDyadic?_ofFields_of_isFinite->lL,roundedMantissa_shift_quotient->lM,roundDyadic_of_representable->lT,roundAt_mono->lU,isFinite->l6,roundAt->mz,toModel->mA,toReal_eq->mM,toReal->mZ,toReal_add_eq_roundAt->m0,toNatBits_lt_two_pow->nd,posMaxFinite->nh,ofNatBits_toNatBits->nu,unpackedToDyadic?->nP,pow2_eq_two_pow->pd,ofFloat32Model->ps,add->pC,modelSignBit->pR,pow2->qm open Nat renaming reduceMod->kL,and_le_right->lF,two_pow_pos->lN,log2_eq_iff->lP,div_mod_unique->lW,le_log2->lY,zero_le->l4,testBit_eq_decide_div_mod_eq->ma,one_shiftLeft->mb,le_mul_of_pos_left->mf,log2_self_le->mu,mul_lt_mul''->my,div_lt_of_lt_mul->mB,add_mul->mG,toUInt64_eq->mN,cast_natAbs->mQ,zero_mul->m3,and_one_is_mod->nb,mul_le_mul->nf,add_sub_cancel->ni,cast_ofNat->nj,mul_lt_mul_of_lt_of_le->ns,add_mul_mod_self_right->nt,zero_lt_of_lt->nx,mul_pos->nz,reducePow->nD,pos_of_mul_pos_left->nQ,div_add_mod'->nR,div_div_eq_div_mul->nY,and_two_pow->n9,add_mul_div_right->ph,log2_lt->pp,toUSize_eq->pr,log2_eq_log_two->pE,mul_le_mul_left->pF,div_eq_of_lt_le->pG,cast_zero->pP,cast_one->p0,cast_sub->p5,div_one->qc,mod_one->qd open UInt32 renaming reduceToNat->kO,toNat_add->lH,ne_of_lt->mO,toNat_ofNat'->mT,toNat_sub->nN,toNat_max->nO,le_iff_toNat_le->n4,toNat_sub_of_le->n6,toNat_or->pa,toNat->p6 open FloatArray renaming emptyWithCapacity->kP,size->kR,uget->mK,set!->qi open Real renaming sqrt->kQ,sq_sqrt->n8,le_sqrt_of_sq_le->pj,sqrt_mul->pO,sqrt_sq->p7 open Float.Model.UnpackedFloat renaming unpack->kS,mul->ly,accuracyOfFraction->lX,roundWithAccuracy->nB,unpackExponent->pe,round->pJ,isFinite->pQ,compare->pY,Sign->p4,pack->qa open Float.Model renaming totalExponent->kV,sqrt->qb,add->qg,mul->qh,sub->qj open FloatLib.Numerics renaming Dyadic->kW,roundQuotientEven->kZ,shiftRightJam->ll,binaryRadix->lx,roundShiftRightEven_shiftRightJam->l5 open Array renaming emptyWithCapacity->k9,ofFn->la,ext->lI,getElem?_eq_getElem->lK,replicate->lR,getElem?_eq_none->mg,getElem?_ofFn->mU,set!_eq_setIfInBounds->m5,ext_getElem?->nk,getElem_set->ny,all_eq_true->nC,getElem!_set!_self->nF,getElem!_set!_ne->n5,setIfInBounds->pI,getElem_push->pT open FloatLib.Numerics.Dyadic renaming ofScaledInt->lc,toReal->lu,signedSignificand->lA,cast_signedSignificand->nw,toRat_eq_zero_iff->nX,ofScaledInt_toRat->nZ,add_toRat->pV,mul_toRat->pW,toRat->p9 open FloatLib.Numerics.RationalBinary renaming floorLog2->ld,scaleByPowerOfTwo_ofNat->mI,lessThanPowerOfTwo->m7,atLeastPowerOfTwo->nr open Float.Model.Format renaming binary32->lh,binary64->lC open FloatLib.Numerics.FixedWord renaming roundShiftRightEven->lm open Float.Model.UnpackedFloat.ExtendedMantissa renaming shiftRightOne->lv open Bool renaming or_eq_true->lQ open List renaming foldl_cons->lS,foldl_append->mi,range_succ->mP,range->n3,foldl_nil->pv open FloatLib.Floats.ExecFloat.Binary renaming toModel_ofFloat_int64ToFloat->mq open Int renaming ofNat_eq_natCast->mC,toNat_of_nonneg->mY,ModEq->pD open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->m6 open Float32 renaming ofBits->nl open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState_exact_toRat->nK,dotState->pX open System.Platform renaming numBits->nS open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec->nT open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled->nU,toUInt32_ofFields->pu,roundRatScaled->pM,toUInt32->qe open Or renaming inr->qk open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div->ql local notation "о"=>Nat local notation "п"=>Word local notation "р"=>Array local notation "с"=>Int local notation "т"=>USize local notation "у"=>Float local notation "ф"=>Bool open _root_ renaming mul_le_mul_of_nonneg_right->AA,pow_le_pow_right₀->AB,abs_sub_abs_le_abs_sub->AC,zpow_natCast->AD,getElem!_pos->AE,decide_eq_true_eq->AF,zpow_le_zpow_right₀->AH,abs_nonneg->AI,ite_eq_right->AJ,abs_of_pos->AK,mul_le_mul_of_nonneg_left->AL,pow_add->AM,ite_false->AN,ite_eq_left->AO,beq_iff_eq->AQ,two_ne_zero->AR,le_rfl->AS,zpow_add₀->AT,abs_mul->AU,bne_iff_ne->AV,dite_eq_left->AW,ite_true->AX,mul_nonneg->AY,abs_sub_le->AZ,one_le_pow₀->Aa,abs_le->Ae,add_pos_of_nonneg_of_pos->Af,dite_eq_right->Ag,le_trans->Ah,mul_lt_mul_of_pos_right->Ai,div_mul_eq_mul_div->Aj,abs_add_le->Ak,lt_of_le_of_lt->Al,mul_assoc->Am,zero_add->An,abs_of_nonneg->Ao,one_div_le_one_div_of_le->Ap,one_mul->Aq,pow_succ->Ar,lt_of_lt_of_le->As,lt_of_mul_lt_mul_right->Au,sq_nonneg->Ax,lt_irrefl->Ay,one_le_two->Az,div_le_one_of_le₀->A1,mul_le_mul->A2,abs_sub_comm->A3,ne_eq->A4,zpow_sub₀->A5,gt_iff_lt->A6,apply_ite->A7,two_pos->BA,abs_div->BB,add_zero->BC,getElem!_neg->BD,pow_succ'->BG,pow_le_pow_left₀->BI,le_abs_self->BL,div_le_iff₀->BM,div_le_div_iff₀->BO,zpow_neg->BP,sub_zero->BQ,eq_or_ne->BR,div_nonneg->BS,div_le_one->BT,div_eq_div_iff->BU,div_le_div_of_nonneg_right->BW,mul_div_assoc->BY,pow_mul->Ba,nsmul_eq_mul->Bb,abs_mul_self->Bc,zpow_le_one_of_nonpos₀->Be,mul_div_cancel_right₀->Bo,le_of_mul_le_mul_left->Bp,le_mul_of_one_le_left->Bq open USize renaming reduceToNat->AG,size->BE,toNat_mul->Br,ofNat_add->Bs open Array renaming replicate->AP,emptyWithCapacity->Ac,ofFn->Aw,size_set!->Bu open FloatArray renaming emptyWithCapacity->Ad open Model renaming div->Av,ofModel->BJ,maximum->BK,ofFloatModel->BZ,fma->Bd open Nat renaming log2->A0,div_le_self->BF,mod_le->BH,sub_zero->BV,succ_le_of_lt->Bt open Finset renaming range->BN open Or renaming inl->BX open UInt64 renaming toNat_lt->Bf open UInt32 renaming zero_and->Bg,ofBitVec->Bh,lt_asymm->Bi open Float32 renaming ofBits->Bj open ConvShape renaming wo->Bk,ho->Bl open Bool renaming not_eq_false->Bm open Float.Model.Format renaming targetExponent->Bv section open FloatLib.Numerics lemma aT (s:ф) (m:о) (e:с) (j:о) (h:j+25<= mж): kN pn ⟨s,ll m j,e+j⟩=kN pn ⟨s,m,e⟩:=by have l:m≠0:=by rintro rfl;simp at h have p:2^mж<= m:=mu l;have v:2^(j+1)<= m:=Ah (Ζ Г А) p;have g:(ll m j)ж=mж-j:=log2_shiftRightJam m j v have u:ll m j≠0:= shiftRightJam_ne_zero m j (Ah (Ζ Г А) v) rw[<- Ϲ,<- Ϲ];unfold Model.roundDyadicGeneral;simp only[u,l,AQ,AN,g];have r:((mж-j:о):с)+(e+j)=(mж:с)+e:=А;rw[r];have t:Fmt.fracWidth=23:=rfl;have q:Fmt.minSubnormalExponent=-149:=rfl;have o:Fmt.minNormalExponent=-126:=rfl;rw[t,q,o];split_ifs with h1 h2 h3 h4<;>try omega .rfl .congr 1 obtain ⟨a,w⟩:∃a:о,e- -149=Int.negSucc a:=⟨(-(e+149)-1)й,А⟩ have x:e+j- -149=Int.negSucc (a-j):=А;rw[w,x];dsimp only;rw[(А:a-j+1=(a+1)-j)] exact l5 m j (a+1) А .congr 1 rw[(А:mж-j-23=(mж-23)-j)] exact l5 m j _ А end lemma ac (n:о) (f:о-> Е) (k:о) (e:kf iз)[k]! =f k:=by rw[AE _ k (by simpa using e),Θ] namespace Core def tm (a b:п):с:=sv a*sv b*2^(idxOf a+idxOf b) def ai (n:о) (fa fb:о-> п):с:=∑k∈BN n,tm (fa k) (fb k) def aN (n:о) (fa fb:о-> п):Prop:=∀k,k expOf (fa k)≠255/\expOf (fb k)≠255 lemma az (n:о) (e g:о-> kJ): ai (n+1) e g=ai n e g+tm (e n) (g n):=Λ _ _ lemma aR (n:о) (o p:о-> kJ) (m:aN n o p): m9 n o p=mv (ai n o p) (-298) (decide (n≠0)&& po (la (n:=n) λi=>o iз) (la (n:=n) λi=>p iз) 0 n):=by unfold m9 dotSpec Model.dot;set A:=la (n:=n) λi=>o iз set B:=la (n:=n) λi=>p iз set L:=A.map (lD (fmt:=pn));set R:=B.map (lD (fmt:=pn));have l:Lв=Rв:=by simp[L,R,A,B] have g:∀k (h:kby simp[L,A,nv] at h⊢;exact (m k h).1 have j:∀k (h:kby simp[R,B,nv] at h⊢;exact (m k h).2 have q:∀k,0<= k-> k<0+Lв-> kI A[k]!≠255/\kI B[k]!≠255:=λk _ h=>by simp[L,A] at h;simp only[A,B,ac n _ k h];exact m k h have w:∀i c,dsum A B i c=∑k∈kG c,tm A[i+k]! B[i+k]!:=λi c=>by induction c generalizing i with | zero=>simp[dsum] | succ c x=> rw[dsum,x (i+1),l7,add_comm];exact congrArg₂ _ (Ο rfl λk _=>by rw[(А:i+1+k=i+(k+1))]) rfl have e:=(finiteDotSlice_eq A B 0 Lв (by simp[L]) (by simp[l,R]) q).trans (c:=(ai n o p:ℚ)*2^(-298:ℤ)) (by simp only[w,ai,L,A,B,Array.size_map,ϣ];congr 2;exact Ο rfl λk q=>by simp at q;simp[ac n _ k q]) have t:=nK (destination:=pn) L R l g j;by_cases r:ai n o p=0 .rw[r,finishWord_zero,Model.Reduction.dotWithStatus_eq_zero_of_finite pn L R .nearestEven l g j ((nX _).1 (by rw[t,e,r];simp))] obtain ⟨u,v⟩:=dotStateLoop_flags A B {} 0 Lв (by simp[L]) (by simp[l,R]) q unfold pX;rw[u,v];simp[L,A];rfl .rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero pn L R .nearestEven l g j (by rw[m6 L R l,Ne,Except.ok.injEq,e];simpa)] exact (mw _ (ai n o p) (-298) _ r (by rw[t,e])).symm lemma aU (n:о) (e g:о-> kJ) (h:aN n e g) (j:ai n e g≠0): m9 n e g=mv (ai n e g) (-298) false:=by simp[aR n e g h,mv,j] @[inline] def fH (w:Е):Д:=if (w>>>23)&&&255!=0 then 1 else 0 @[inline] def mW (w:Е):Д:=(w&&&8388607)м ||| (fH w<<<23) @[inline] def iW (w:Е):Д:=((w>>>23)&&&255)м-fH w def af (x:Д):с:=x.toBitVec.toInt lemma al (w:Е):(mW w)б=kU w:=by have g:(w&&&8388607)г<2^23:=by rw[Ι];exact Al lF Б unfold mW fH kU kI l9;by_cases e:(w>>>23)&&&255=0 .simp[e] .simp only[show ((w>>>23)&&&255!=0)=true by simpa using e,e,AX,AN] rw[mJ,Ϡ,show ((1:Д)<<<23)б=2^23*1 from rfl,Nat.or_comm, <- ϙ g,ϭ,ϥ] lemma aw (w:Е):(iW w)б=kM w:=by unfold iW fH kM kI;have j:=na w;unfold kI at j;by_cases g:(w>>>23)&&&255=0 .simp[g] .have e:1<=((w>>>23)&&&255)г:= Nat.one_le_iff_ne_zero.2 λh=>g (χ.mp (by simpa using h)) simp only[show ((w>>>23)&&&255!=0)=true by simpa using g,g,AX,AN] rw[Η _ _ (θ.mpr (by rw[Ϡ];simpa using e)), Ϡ] rfl lemma ag (w:Е):kX w=true↔2^31<= wг:=by have:=w.toNat_lt rw[kX,AV,A4,<- χ,Ι,show (0x80000000:Е)г=2^31 from rfl, n9,ma] by_cases h:wг/2^31%2=1<;>simp[h]<;>omega lemma eX (w:Е):(w>>>31!=0)=kX w:=by have:=w.toNat_lt;rw[Ϥ,ag];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 ah (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 dN (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 dN value shift else if shift==64 then (if value>0x8000000000000000 then 1 else 0) else 0 @[inline] def c7 (sign:ф) (e f:Е):Е:= (if sign then (0x80000000:Е) else 0) ||| ((e&&&255)<<<23) ||| (f&&&8388607) @[inline] def dE (n:Д):Е:= (if n<8388608 then 0 else n-8388608)л @[inline] def ay (sign:ф) (product scale:Д):Е:= if product==0 then if sign then 0x80000000 else 0 else let leading:=ah 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 c7 sign 1 0 else c7 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 c7 sign (normalizedPosition-171)л (dE normalizedMantissa) open Model.NativeBinary32 in lemma dK (n k:о) (h:n>>>k≠0):nж=k+(n>>>k)ж:=by rw[ε] at* have:=(lY (by rintro rfl;simp at h)).2 (Nat.div_pos_iff.1 (Nat.pos_of_ne_zero h)).2 rw[pE,pE,Nat.log_div_base_pow] at*;omega lemma b9 (g r x k:Д) (p:kб<=32) (m:0simp[h,pp,g.toNat_lt] have j:kб%64=kб:=ν А;unfold sx sr;by_cases l:x>>>k=0<;>simp[l,j,e] .simpa[j,ε,Nat.div_eq_zero_iff] using congrArg lG l have:=dK xб kб (by simpa[<- ξ,j] using l) refine ⟨А,?_⟩ rw[ε];exact mB (by rwa[<- Nat.pow_add,(А:kб+kб=2*kб)]) lemma am (x:Д):ah x=x.log2:=by apply ξ.mp;obtain ⟨p,g⟩:=b9 x 0 x 32 Б Б (by simp) x.toNat_lt obtain ⟨q,h⟩:=b9 x _ _ 16 Б Б p g;obtain ⟨r,j⟩:=b9 x _ _ 8 Б Б q h;obtain ⟨t,l⟩:=b9 x _ _ 4 Б Б r j;obtain ⟨u,m⟩:=b9 x _ _ 2 Б Б t l;obtain ⟨e,o⟩:=b9 x _ _ 1 Б Б u m;rw[Nat.log2_def (sx 1 _)б,AJ (by simpa using o)] at e unfold ah;exact e.symm lemma el (g e:Д): aW g e=lm g eб:=by unfold aW lm;by_cases h:e=0 .subst h;rfl have:=e.toNat_lt;have j:eб≠0:=by simpa[<- ξ] using h simp only[h,j,AQ,UInt64.ofNat_toNat,μ,↓reduceIte, show pZ (eб-1)=e-1 from ξ.mp (by simp[Α];omega), show e=64↔eб=64 by rw[<- ξ];rfl] refine ite_congr rfl (λl=>?_) λ_=>rfl have:(g&&&((1<<simp[θ, ν l,mb,ν (by omega:2^e.toNat<0x10000000000000000),Nat.one_le_two_pow] exact (ϝ _ (lN _)).trans_le m have:((g>>>e)&&&1)б<=1:=by simp[ψ];omega have:=(g>>>e).toNat_lt simp only[dN,A6,μ,ι,AQ,<- ξ, A7 lG,nM,kE] generalize (g&&&((1<<>>e)&&&1)б=b at* split_ifs<;>omega lemma cz (n:Д):dE n=UInt32.ofNat (nб-8388608):=by unfold dE;split<;>simp_all[lO,Nat.toUInt32,μ,Η,θ,Nat.sub_eq_zero_of_le,le_of_lt] open Model.NativeBinary32 in lemma bg (w:Е):lf (ofUInt32 w)=w:=by conv_rhs=>rw[<- toUInt32_ofUInt32 w] exact χ.mp (ν (BitVec.isLt _)) open Model.NativeBinary32 in lemma aP (g:ф) (m e:Д) (h:eб<=506): ay g m e=lf (kN pn ⟨g,mб,(eб:с)-298⟩):=by erw[<- ofUInt32_roundDyadic,bg,<- roundProduct_eq_roundDyadic _ _ _ h];unfold ay roundProduct c7 mkBits;simp only[am,el,cz,lO,Nat.toUInt32];rfl def aA (hi lo:Д):с:=af hi*2^64+loб @[inline] def aI (hi lo:Д):Д:=if hi>>>63!=0 then (0:Д)-lo else lo @[inline] def bN (hi lo:Д):Д:= if hi>>>63!=0 then (if lo==0 then (0:Д)-hi else ~~~hi) else hi lemma c9 (e:Д):(e>>>63!=0)=decide (2^63<= eб):=by have:=e.toNat_lt;rw[Ϥ];simp[<- ξ,ε] lemma bo (e g:Д): aA e g=(eб*2^64+gб:с)-(if 2^63<= eб then 2^128 else 0):=by unfold aA af;rw[Ϻ,ms];omega lemma eQ (e g:Д): (aA e g)к=(bN e g)б*2^64+(aI e g)б /\ decide (aA e g<0)=(e>>>63!=0):=by have:=e.toNat_lt;have:=g.toNat_lt;unfold bN aI;rw[bo,c9];by_cases h:2^63<= eб<;>simp only[h,decide_true,decide_false,AX,AN,υ] .split<;>simp_all[lZ,UInt64.toNat_not,<- ξ]<;>omega .simp;omega @[inline] def ap (hi lo B:Д):Д:= if hi==0&&lo==0 then 4294967296 else if B>442 then 4294967296 else let neg:=hi>>>63!=0 let mlo:=aI hi lo let mhi:=bN hi lo if mhi==0 then (ay neg mlo B)м else if mhi>>>32==0 then let q:=(mhi<<<32)+(mlo>>>32) (ay neg (if mlo&&&0xFFFFFFFF==0 then q else q ||| 1) (B+32))м else (ay neg (if mlo==0 then mhi else mhi ||| 1) (B+64))м lemma aQ (n:о) (o p:о-> kJ) (g j B:Д) (r:aN n o p) (l:ai n o p=aA g j*2^Bб) (h:ap g j B<4294967296):m9 n o p=(ap g j B)л:=by obtain ⟨t,u⟩:=eQ g j;have:=j.toNat_lt;have:=g.toNat_lt;simp only[ap] at h⊢;have x:¬(g==0&&j==0)=true:=λc=>by simp[c] at h have v:¬B>442:=λc=>by simp[c] at h simp only[x,v,υ,↓reduceIte];clear h have w:ai n o p≠0:=by rw[l];refine mul_ne_zero (λq=>x ?_) В rw[bo] at q;simp only[ς,AQ,<- ξ,mc];split at q<;>omega rw[aU n o p r w,mw (lE (aA g j) ((Bб:с)-298)) _ _ _ w (by rw[toRat_ofIntDyadic,l];push_cast;rw[A5 AR,AD];field_simp),lE,u,t] symm;simp only[A7 lO,UInt32.toUInt32_toUInt64];generalize bN g j=m at* generalize aI g j=e at* have:=e.toNat_lt;simp only[μ,A6,kE,not_lt] at v;split<;>rename_i q<;>simp only[AQ,<- ξ,mc] at q .simp[q,aP _ _ B А] split<;>rename_i A<;>simp[<- ξ,ε] at A .rw[aP _ _ _ (by simp[ι];omega),<- aT _ (mб*2^64+eб) _ 32 ((lY А).2 А)] congr 3 swap;. simp[ι];omega have y:(mб*2^64+eб)/2^32=(m<<<32+e>>>32)б:=by simp[Β,ε];omega have z:(mб*2^64+eб)%2^32=(e&&&4294967295)б:=by rw[ψ,show (4294967295:Д)б=2^32-1 from rfl,γ];omega simp only[ll,kE,y,z,A7 lG,mJ,AQ, <- ξ] .rw[aP _ _ _ (by simp[ι];omega),<- aT _ (mб*2^64+eб) _ 64 ((lY А).2 А)] congr 3 swap;. simp[ι];omega simp only[ll,kE,(А:(mб*2^64+eб)/2^64=mб),(А:(mб*2^64+eб)%2^64=eб),A7 lG,mJ,AQ, <- ξ] @[inline] def aj (N:Д):Д:=(N+(0x3FFFFFFFFF:Д)+((N>>>39)&&&1))>>>39 @[inline] def dD (lb v B:Д):Д:= let m:=aI v v let L:=ah m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then ((v>>>63)<<<31)+((E<<<23)+aj (m<<<(62-L))) else 4294967296 @[inline] def bs (hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63) then dD 1 lo B else 4294967296 if r=4294967296 then ap hi lo B else r lemma gk (n:ф) (e f:Е): (c7 n e f)г=(if n then 2^31 else 0)+eг%2^8*2^23+fг%2^23:=by have g:=ϝ fг (lN 23);have:=ϝ eг (lN 8) have h:((e&&&255)<<<23 ||| (f&&&8388607))г=2^23*(eг%2^8)+fг%2^23:=by rw[pa,ϯ,Ι,Ι,show (255:Е)г=2^8-1 from rfl, show (8388607:Е)г=2^23-1 from rfl,γ, γ,show (23:Е)г%32=23 from rfl,Β,Ϛ,ν (by simp;omega), <- ϙ g] unfold c7;rw[UInt32.or_assoc];cases n<;>simp only[υ,↓reduceIte,UInt32.zero_or,pa,h] .omega .rw[show (0x80000000:Е)г=2^31*1 from rfl,<- ϙ А];omega lemma cH (n:ф) (N h:Д) (m:2^62<= Nб) (o:Nб<2^63) (u:110<= hб) (l:hб<363): (ay n N h)г=(if n then 2^31 else 0)+((hб-110)*2^23+(aj N)б) /\ 2^23<=(aj N)б/\(aj N)б<=2^24:=by have p:(N>>>39)б=Nб/2^39:=by simp[ε] have g:((N>>>39)&&&1)б=Nб/2^39%2:=by simp[p,nb] have t:(aj N)б=Nб/2^39+if 2^38omega have j:2^23<= Nб/2^39/\Nб/2^39<2^24:=by clear*-m o;omega have e:(aW N (62-23))б=(aj N)б/\2^23<=(aj N)б/\(aj N)б<=2^24:=by have q:(N&&&0x7FFFFFFFFF)б=Nб%2^39:=by rw[ψ];exact γ _ 39 rw[t];show (dN N 39)б=_/\_;unfold dN simp only[show ((1:Д)<<<39)-1=0x7FFFFFFFFF from rfl,show (1:Д)<<<(39-1)=0x4000000000 from rfl,A6,μ,ι,q,g,p,A7 lG,kE] clear*-j;split_ifs<;>omega refine ⟨?_,e.2⟩;unfold ay simp only[show ah N=62 by rw[am,<- ξ];exact (lP (by omega:N.toNat≠0)).2 ⟨m,o⟩, show (N==0)=false by simp[<- ξ];omega,show ¬62+h<172 by simp[μ];omega, show ¬(62:Д)<23 by decide,AN,υ] obtain ⟨e,g⟩:=e;generalize aW N (62-23)=R at e⊢;rw[<- e] at g⊢;clear*-g u l;by_cases r:Rб=16777216<;>simp[r,<- ξ,cz,μ]<;>split<;>(try omega)<;>simp[gk,nN,lH]<;>omega lemma bR (n:ф) (M σ:Д) (g:Mб≠0) (e:σб<=506): ay n M σ=mv ((if n then-(Mб:с) else Mб)*2^σб) (-298) false:=by rw[aP _ _ _ e];refine (mw _ _ _ _ (mul_ne_zero (by split<;>omega) В) ?_).symm cases n<;>simp[p9,lA,A5]<;>field_simp lemma dA (t g B:Д):bs t g B=ap t g B:=by unfold bs;dsimp only;split_ifs with F h<;>try rfl swap;contradiction;subst F;have w:g>>>63=0\/g>>>63=1:=by have:=g.toNat_lt;simp[<- ξ,ε];omega simp only[dD] at* split_ifs at*with r;swap;contradiction;generalize v:aI g g=m at* have o:(ah m)б=mбж:=by rw[am];rfl generalize ah m=L at* have:=m.toNat_lt;have:=B.toNat_lt;simp only[μ,Α,ι,o,kE] at r;have j:mб≠0:=А;have p:=mu j;have q:=@ώ mб;have:=(pp j).2 (by omega:m.toNat<2^63) generalize mбж=l at* replace r:172<= l+Bб/\l+Bб<425:=А have E:ap ((0:Д)-(g>>>63)) g B=(ay (g>>>63!=0) m B)м:=by have G:g≠0:=by rintro rfl;subst v;simp[aI] at j have A:¬442simp+decide [e,G,A,μ]<;>rfl rw[E];have u:(62-L)б=62-l:=by simp[Α,o];omega have x:(B-(62-L))б=Bб-(62-l):=by simp[Α,u];omega have e:=η (2^(62-l)) p;have y:=ϴ q (lN (62-l));rw[<- AM,(А:l+(62-l)=62)] at e rw[<- AM,(А:l+1+(62-l)=63)] at y have D:(m<<<(62-L))б=mб*2^(62-l):=by simp[u,Β,ν (by omega:62-l<64)];omega obtain ⟨H,I⟩:=cH (g>>>63!=0) (m<<<(62-L)) (B-(62-L)) А А А А have z:ay (g>>>63!=0) m B=ay (g>>>63!=0) (m<<<(62-L)) (B-(62-L)):=by rw[bR _ m B j А,bR,D,x,<- pow_sub_mul_pow (2:ℤ) (by omega:62-l<= B.toNat)] split<;>push_cast<;>ring_nf;all_goals omega rw[<- ξ,Ϡ,z,H,x];rcases w with e | e<;>simp[e,ι,Ε,Α,o]<;>omega end Core open Core lemma dT (w:kJ):lf (pb w)=w:=by apply χ.mp;simp only[lf,pb,Model.toNatBits,pK,mT];exact ν w.toBitVec.isLt lemma aJ (z:Model pn):pb (lf z)=z:=by have h:z.toNatBits<2^32:=nd z;simp only[pb,lf,lD,mT,ν h];exact nu z namespace Dense lemma ab {k n:т} (h:ksplit<;>push_cast<;>omega @[inline] def bD (x:Е):Е:=x&&&0x7FFFFFFF lemma au (x:Е):(bD x)г=xг%2^31:=by unfold bD;rw[Ι];exact γ _ 31 lemma aC (x:Е):(kI x)г=(bD x)г/2^23:=by have:(kI x)г=xг/2^23%2^8:=by unfold kI;rw[Ι,Τ];simp only[kO,kL,ε];exact γ _ 8 rw[this,au,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] lemma ba (x:Е):kM x=(kI x)г-1:=by unfold kM;split<;>simp[*] lemma iC (w:Е):wг/2^23=(kI w)г+256*(wг/2^31):=by rw[aC,au];have:=w.toNat_lt;omega lemma bF (x:Е):(kI x)г<256:=by rw[aC,au];omega lemma gS (w:Е):(w&&&8388607)г=wг%2^23:=by rw[Ι];exact γ _ 23 lemma er (w:Е): |sv w| <2^24:=by have:=me w;unfold 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 iN (y:Д):bl yб<=64:=by unfold bl;split;. omega rename_i h;have:=(pp h).mpr y.toNat_lt;omega lemma dP (y:Д):(y>>>1)б=yб/2:=by rw[ο];simp[ε] lemma cU (k:о):bl (k/2)=kж:=by unfold bl;rw[Nat.log2_def k];by_cases e:2<= k .rw[AJ А,AO e] .rw[AO А,AJ e] lemma c5 (y n:Д) (h:nб+bl yб<=64):(lz y n)б=nб+bl yб:=by rw[lz];split_ifs with j .subst j;simp .have e:yб≠0:=by simpa[<- ξ] using j have l:bl yб=bl (yб/2)+1:=by rw[cU];simp[bl,e] have g:(n+1)б=nб+1:=by rw[ι];simp;omega rw[c5 (y>>>1) (n+1) (by rw[g,dP];omega),g,dP];omega termination_by yб decreasing_by rw[dP];omega @[inline] def lg (x:Д):Д:=lz (x>>>1) 0 lemma iP (x:Д):lg x=x.log2:=by apply ξ.mp;rw[lg,c5 _ _ (by simpa using iN (x>>>1)),dP,cU,mc,ϔ];rfl @[inline] def d8 (lb v B:Д):Д:= let m:=Core.aI 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.aj (m<<<(62-L))) else 4294967296 @[inline] def bG (hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63) then d8 1 lo B else 4294967296 if r=4294967296 then Core.ap hi lo B else r lemma cP:bG=bs:=by funext e g B;simp only[bG,bs,d8,dD,am,iP] lemma cN {k:т} {a:р Е} (h:k>>1>>>(63-s))+(if l'simp only[kE]<;>omega @[specialize] def iH (fa fb:о-> п) (n t:о) (B:Д):Д:= if t п) (n:о) (B:Д) (t:о) (pH pL nH nL:Д):Д:= if t п):п:= let r:=if n<262144 then cO fa fb n (iH fa fb n 0 1023) 0 0 0 0 0 else 4294967296 if r<4294967296 then rл else dotOf n fa fb lemma bT (n:о) (g j:о-> kJ):f7 n g j=m9 n g j:=by unfold f7;dsimp only by_cases hn:n<262144;swap;. rw[AJ hn,AJ Б] rw[AO hn];split;swap;. rfl generalize iH g j n 0 1023=B at* suffices H:∀k t (x r w p:Д),n-t=k-> t<= n-> aN t g j -> xб*2^64+rб<= t*2^108-> wб*2^64+pб<= t*2^108 -> ai t g j=(((xб*2^64+rб:о):с)-((wб*2^64+pб:о):с))* 2^Bб -> cO g j n B t x r w p<4294967296-> m9 n g j=(cO g j n B t x r w p)л from (H _ 0 0 0 0 0 rfl А (λ_ h=>absurd h А) (by simp) (by simp) (by simp[ai]) ‹_›).symm intro k;induction k<;>intro t x r w p hk ht hf M K N l .obtain rfl:t=n:=А rw[cO,AJ А] at l⊢;refine aQ _ _ _ _ _ _ hf ?_ l;rw[N,bo,mul_left_inj' В];have:=r.toNat_lt;have:=p.toNat_lt;simp only[μ,Α,A7 lG,nM,mc];split<;>split<;>push_cast<;>omega rename_i k ih;have X:t(Nat.lt_succ_iff_lt_or_eq.mp F).elim (hf s) λe=>e ▸ ⟨I,J⟩ have u:kU (g t)*kU (j t)<2^48:= (my (me _) (me _)).trans_eq Г have U:(mW (g t)*mW (j t))б=kU (g t)*kU (j t):=by rw[ϩ,al,al,ν (u.trans Г)] have E:=az t g j;have o:=η (2^108) t.le_succ;split at l .rename_i G rw[AO G];have O:kU (g t)*kU (j t)=0:=by rw[<- U,beq_iff_eq.mp G];rfl refine ih (t+1) x r w p z A y (M.trans o) (K.trans o) ?_ l;rw[E,N,add_eq_left];unfold tm sv;rcases Nat.mul_eq_zero.mp O with h | h<;>simp[h] rename_i G;rw[AJ G];obtain ⟨hB,Q⟩:=hw λh=>G (by simp[h]) have aH:=idxOf_le _ I;have aL:=idxOf_le _ J have S:(iW (g t)+iW (j t))б=kM (g t)+kM (j t):=by rw[ι,aw,aw,ν А] rw[S] at hB have F:(iW (g t)+iW (j t)-B)б=kM (g t)+kM (j t)-Bб:=by rw[Η _ _ (by rw[θ,S];omega),S] rw[F] at Q have W:(2:с)^(kM (g t)+kM (j t))=2^(kM (g t)+kM (j t)-Bб)*2^Bб:=by rw[<- AM];congr 1;omega generalize m:(kU (g t)*kU (j t))*2^(kM (g t)+kM (j t)-Bб)=T have v:T<=2^108:= m ▸ (nf u.le (Ζ Г (by omega:_<=60))).trans_eq Г have D:tm (g t) (j t)=(if kX (g t)==kX (j t) then (T:с) else-T)*2^Bб:=by rw[<- m];unfold tm sv;rw[W];cases kX (g t)<;>cases kX (j t)<;>simp<;>ring have V:=λH L (as:Hб*2^64+Lб<= t*2^108)=>eY H L _ _ (by rw[F];omega) (by rw[U,F,m];omega) rw[U,F,m] at V;cases hg:(kX (g t)==kX (j t))<;>simp only[hg,AX,AN,υ] at D l⊢ .have q:=V w p K refine ih (t+1) x r _ _ z A y (M.trans o) (by rw[q];exact Μ t _ ▸ Nat.add_le_add K v) ?_ l rw[E,N,q,D];push_cast;ring .have q:=V x r M refine ih (t+1) _ _ w p z A y (by rw[q];exact Μ t _ ▸ Nat.add_le_add M v) (K.trans o) ?_ l rw[E,N,q,D];push_cast;ring @[noinline] def ax (n:о) (relu:ф) (X W b:@& р п) (xo s j:о):п:= act relu (f7 (n+1) (λt=>if tif trfl lemma gA (x y:у) (e:fv x) (g:fv y): kK (x+y).toModel=pC (kK x.toModel) (kK y.toModel):=by change kK (qg x.toModel y.toModel)=_;rw[qg,Ϫ] have h:=Model.add_eq_ofModel_add_of_isFinite (fmt:=kF) Б (kK x.toModel) (kK y.toModel) (by rw[Κ];exact (cY x).1 e) (by rw[Κ];exact (cY y).1 g) rw[Κ,Κ] at h;exact h.symm lemma pm (E:с) (e:E<=971):(2:ℝ)^E<= mZ (nh kF):=by have h:=ϡ kF false 1 E Б (e.trans Б) simp only[υ,AN,p0,Aq] at h;change |(2:ℝ)^E| <= _ at h simpa only[AK (zpow_pos (by norm_num:(0:ℝ)<2) E)] using h open FloatLib.Floats.Formats.Flocq in lemma re (x:ℝ) (E:с) (h:-1021<= E) (g: |x| <(2:ℝ)^E): |Model.roundAt kF x-x| <= (2:ℝ)^(E-53)/2:=by by_cases e:x=0 .subst x;rw[Model.roundAt_zero];simp only[BQ,abs_zero];positivity have j:magnitude lx x<= E:=magnitude_le_of_abs_lt_bpow _ x E e g;apply (Model.abs_roundAt_sub_le kF x).trans;apply BW _ Г;change ulp lx (Model.fexpOf kF) x<=(2:ℝ)^(E-53);rw[ulp.of_ne_zero _ _ x e];change (2:ℝ)^(max (magnitude lx x-53) (-1074))<=(2:ℝ)^(E-53);apply AH Г;omega lemma gQ (x y:у) (e:fv x) (g:fv y) (l: |rv x+rv y| <= mZ (nh kF)): fv (x+y)/\rv (x+y)=mz kF (rv x+rv y):=by have j:=gA x y e g;have h:=Model.isFinite_add_of_abs_toReal_add_le_posMaxFinite _ _ Б e g l;refine ⟨by unfold fv;rw[j];exact h,?_⟩ unfold rv;rw[j];exact m0 _ _ Б e g h lemma eM (x y:у) (m:fv x) (o:fv y) (E:с) (l:-1021<= E) (e:E<=971) (g: |rv x+rv y| <(2:ℝ)^E): fv (x+y) /\ |rv (x+y)-(rv x+rv y)| <= (2:ℝ)^(E-53)/2:=by obtain ⟨h,j⟩:=gQ x y m o (g.le.trans (pm E e));exact ⟨h,by rw[j];exact re _ E l g⟩ lemma rx (d:kW) (l:d.significand<2^53) (g:-1074<= d.exponent) (e: |d.toReal| <= (2:ℝ)^(971:с)): mz kF d.toReal=d.toReal:=by obtain ⟨h,j⟩:=lT kF Б d d.significand 0 (by simp) l g (e.trans (pm 971 AS)) rw[<- Ϝ _ Б d h,j] lemma fn (i:Int64) (g:i.toIntк<2^53):fv i.toFloat/\rv i.toFloat=i.toInt:=by have h:kK i.toFloat.toModel= kN kF (lc i.toInt 0):= mq i have e:(lc i.toInt 0).toReal=i.toInt:=by rw[<- ϋ,nZ];simp obtain ⟨j,l⟩:=lT kF Б (lc i.toInt 0) i.toIntк 0 (ϭ _).symm g (by change _<=(0:ℤ);decide) (by rw[e,<- ϰ,ϵ];exact Ah (by exact_mod_cast g.le) (pm 53 Г)) exact ⟨by unfold fv;rw[h];exact j,by unfold rv;rw[h,l,e]⟩ lemma iB (b:BitVec 64) (s:p4) (m:о) (e:с) (h:0< m) (g:kS lC b=.finite s m e h): 2^52<= m\/e=-1074:=by revert g;unfold kS;dsimp only;split .split<;>intro g<;>cases g .split .split .intro g;cases g .rename_i o _ intro g;injection g with _ _ l;right;rw[<- l,o];decide .intro g;injection g with _ j _ left;rw[<- j,BitVec.toNat_append];exact Ah Б Nat.left_le_or lemma jg (x y:у) (z:fv x) (A:fv y) (w: |rv x*rv y| <= (2:ℝ)^(971:с)): fv (x*y)/\rv (x*y)=mz kF (rv x*rv y):=by simp only[cY] at z A;rw[fP x,fP y] at w⊢;unfold fv rv;rw[show (x*y).toModel=qh x.toModel y.toModel from rfl,qh,Ϫ];generalize B:x.toModel.unpack=X at z w⊢;generalize D:y.toModel.unpack=Y at A w⊢;cases X<;>cases Y<;>simp only[pQ,υ] at z A case finite.finite q l g u r m h v=> have E:=iB _ q l g u B;have F:=iB _ r m h v D have p:g+h<= Float.Model.Format.binary64.targetExponent (kV (l*m) (g+h)):=by change g+h<= max ((A0 (l*m):с)+1+(g+h)-53) (-1074);have:=(lY (n:=l*m) (k:=52) В).2;have:=Nat.le_mul_of_pos_right l v;have:=mf m u;omega let t:kW:=⟨xor (pR q) (pR r),l*m,g+h⟩ have j:BJ kF (ly lC (.finite q l g u) (.finite r m h v))=kN kF t:=by rw[ly,Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ p];cases q<;>cases r<;>rfl have e:t.toReal=lq (.finite q l g u)*lq (.finite r m h v):= Model.Dyadic.toReal_mul ⟨_,l,g⟩ ⟨_,m,h⟩ have o:=ύ kF Б t (by rw[e];exact w.trans (pm 971 AS)) rw[j];exact ⟨o,by rw[Ϝ _ Б t o,e]⟩ all_goals simp[ly,Model.isFinite_ofModel_zero kF Б, Model.toReal_ofModel_zero kF Б] lemma bA (s:ф) (m:о) (e:с): (⟨s,m,e⟩:kW).toReal=(if s then-(m:ℝ) else m)*(2:ℝ)^e:=by simp only[lu,nw];split<;>simp def pw:о-> у | 0=>(1:Int64).toFloat | k+1=>let p:=pw k;p+p lemma io (k:о) (m:k<=900):fv (pw k)/\rv (pw k)=(2:ℝ)^k:=by induction k with | zero=>have:=fn 1 Б;simp only[pw];exact ⟨this.1,by rw[this.2];simp⟩ | succ k l=> obtain ⟨f,v⟩:=l А have e:(⟨false,1,((k+1:о):с)⟩:kW).toReal=(2:ℝ)^(k+1):=by rw[bA];simp only[υ,AN,p0,Aq];exact AD 2 (k+1) have j: |(2:ℝ)^(k+1)| <= (2:ℝ)^(971:с):=by rw[AK В,<- AD];exact AH Г А obtain ⟨g,h⟩:=gQ (pw k) (pw k) f f (by rw[v,<- two_mul,<- BG];exact j.trans (pm 971 AS)) simp only[pw];rw[h,v,<- two_mul,<- BG,<- e,rx _ Г (by dsimp;omega) (by rwa[e])];exact ⟨g,rfl⟩ def nm:у:=(-1:Int64).toFloat def P:FloatArray:=⟨Aw (n:=512) λi=>if iз<256 then pw (iз-1) else nm*pw (iз-256-1)⟩ lemma gq:Pд=512:=by simp[P,kR] def P2:FloatArray:=⟨Aw (n:=512) λi=>if iз<256 then pw (iз-2) else nm*pw (iз-256-2)⟩ lemma bW:P2д=512:=by simp[P2,kR] lemma dV (i:т) (h:iа>>24)г=wг/2^24:=by rw[Τ];simp[ε] lemma eS (w:Е):(kI w)г=(w<<<1)г/2^24:=by rw[aC,au,ϯ];simp only[kO,kL,Β];have:=w.toNat_lt;omega lemma cJ (w:Е):(w>>>23)г=wг/2^23:=by rw[Τ];simp[ε] @[inline] def dw (w:Е):у:= (Core.mW w).toInt64.toFloat*P.uget (w>>>23)н (by rw[gq,an,cJ];have:=w.toNat_lt;omega) lemma bO (z e:с):(lE z e).toReal=(z:ℝ)*(2:ℝ)^e:=by rw[<- ϋ,toRat_ofIntDyadic];push_cast;rfl lemma bb (x y:у) (p:fv x) (q:fv y) (z e:с) (h:rv x*rv y=(z:ℝ)*(2:ℝ)^e) (o:zк<2^53) (m:-1074<= e) (g: |(z:ℝ)*(2:ℝ)^e| <= (2:ℝ)^(971:с)): fv (x*y)/\rv (x*y)=(z:ℝ)*(2:ℝ)^e:=by obtain ⟨j,l⟩:=jg x y p q (by rw[h];exact g) have:=rx (lE z e) o m (by rw[bO];exact g) rw[bO] at this;exact ⟨j,by rw[l,h,this]⟩ lemma ci (w:Е):(sv w)к<2^24:=by have:=me w;unfold sv;split<;>simp<;>omega lemma cG (a b c:о) (g:a+b<= c) (j:c<=971) (z:с) (h:zк<2^a): |(z:ℝ)*(2:ℝ)^(b:с)| <= (2:ℝ)^(971:с):=by rw[AU,AK (by positivity:(0:ℝ)<2^(b:с)),AD] have e: |(z:ℝ)| <= 2^a:=by rw[<- ϰ,ϵ];exact_mod_cast h.le refine (AA e В).trans ?_;rw[<- AM,<- AD];exact AH Г А lemma mV (u:Д) (n:о) (e:uб=n) (g:n<2^25): fv u.toInt64.toFloat/\rv u.toInt64.toFloat=(n:с):=by have:u.toInt64.toInt=n:=by rw[show u.toInt64.toInt=af u from rfl,aY,e];split<;>omega rw[<- this];exact fn _ (by rw[this];simp;omega) lemma qV (c:о) (A:FloatArray) (p:∀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,kX v=kX w-> σ*kU v=sv v)/\σк=1 /\ rv (A.uget (w>>>23)н h)=σ*2^((kI w)г-c):=by have:=bF w;have:=w.toNat_lt;have e:=ag w;obtain ⟨l,m⟩:=io ((kI w)г-c) А;rw[p,an,cJ,iC];split .rw[(А:wг/2^31=0),mul_zero,BC] exact ⟨l,1,λv g=>by simp only[sv,g,e];split<;>omega,rfl,by rw[m];push_cast;ring⟩ .rw[(А:wг/2^31=1),mul_one,ni] have j:=fn (-1) Б obtain ⟨o,q⟩:=bb _ _ j.1 l (-1) ((kI w)г-c:ℕ) (by rw[j.2,m,AD];rfl) Б А (cG 1 _ 971 А AS _ Б) exact ⟨o,-1,λv g=>by simp only[sv,g,e];split<;>omega,rfl,by rw[<- AD];exact q⟩ lemma dG (c q:о) (A:FloatArray) (p:∀i h,A.uget i h=if iа<256 then pw (iа-c) else nm*pw (iа-256-c)) (u:Д) (v w:Е) (h) (t:q<=2) (y:uб=q*kU v) (x:kX v=kX w) (r:(q:ℝ)*2^((kI w)г-c)=2^kM v): fv (u.toInt64.toFloat*A.uget (w>>>23)н h) /\ rv (u.toInt64.toFloat*A.uget (w>>>23)н h)=(sv v:ℝ)*2^kM v:=by have:=me v;have:=η (kU v) t;have:=bF w;obtain ⟨j,l⟩:=mV u _ y А;obtain ⟨m,σ,e,o,z⟩:=qV c A p w h;have g:(((q*kU v:о):с)*σ)к<2^25:=by rw[ϫ,o];simp;omega have:=bb _ _ j m _ ((kI w)г-c:о) (by rw[l,z,AD];push_cast;ring) (g.trans Г) А (cG 25 _ 971 А AS _ g) exact ⟨this.1,by rw[this.2,<- r,AD,<- e v x];push_cast;ring⟩ lemma aD (w:Е) (_:kI w≠255):fv (dw w)/\rv (dw w)=(sv w:ℝ)*2^kM w:= dG 1 1 P (λ_ _=>by simp[P,mK]) _ w w _ А (by simp[al]) rfl (by simp[ba]) lemma dc (x w:Е) (l:kI x≠255) (j:kI w≠255): fv (dw x*dw w)/\rv (dw x*dw w)=(tm x w:ℝ):=by obtain ⟨g,m⟩:=aD x l;obtain ⟨h,o⟩:=aD w j have e:(sv x*sv w)к<2^48:=by rw[ϫ];exact (my (ci x) (ci w)).trans_eq Г have:=bb _ _ g h (sv x*sv w) (kM x+kM w:о) (by rw[m,o,AD,AM];push_cast;ring) (lt_trans e Г) А (cG 48 _ 971 (by rw[ba,ba];have:=bF x;have:=bF w;omega) AS _ e) refine ⟨this.1,?_⟩;rw[this.2,tm,AD];push_cast;ring @[inline] def eF (b:Д):Д:=(b>>>52)&&&2047 @[inline] def mF (b:Д):Д:=(b&&&0xfffffffffffff) ||| 0x10000000000000 lemma jM (u:Д):(u&&&0x8000000000000000!=0)=(u>>>63!=0):=by apply Ϥ.mpr;simp only[AV,A4,<- ξ];rw[ψ,ο];change ¬uб&&&2^63=0↔¬uб>>>63=0;rw[n9,ε,ma];have e:uб/2^63<2:=by have h:=Bf u;omega rw[ν e];by_cases g:uб/2^63=1<;>simp<;>omega lemma gR (v:у):kK v.toModel=Model.ofFields kF (v.toBits>>>63!=0) (((v.toBits>>>52)&&&2047)б) ((v.toBits&&&0xfffffffffffff)б):=by rw[<- Model.ofFields_signBit_expField_fracField (kK v.toModel)];congr 1;rw[<- jM];apply Ϥ.mpr;simp only[Model.signBit,AV,A4];rw[<- UInt64.toBitVec_inj];exact Iff.rfl lemma fq (v:у):((v.toBits>>>52)&&&2047)б<2^11/\(v.toBits&&&0xfffffffffffff)б<2^52:=by simp only[ψ];exact ⟨Al lF Б,Al lF Б⟩ lemma bK (v:у) (g:fv v) (j:¬eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)б+2^52, ((eF v.toBits)б:с)-1075⟩:kW).toReal:=by unfold eF at j⊢;obtain ⟨l,m⟩:=fq v;have e:((v.toBits>>>52)&&&2047)б≠0:=λh=>j (ξ.mp (by simpa using h)) unfold fv at g;unfold rv;rw[gR] at g⊢;rw[mM,lL _ _ _ _ l m g,AJ e] simp only[show FloatFormat.binary64.fracWidth=52 from rfl,show FloatFormat.binary64.exponentBias=1023 from rfl, pd] congr 2<;>(try simp only[mC,nj])<;>ring lemma aJ (z:Model pn):pb (lf z)=z:=by have h:z.toNatBits<2^32:=nd z;simp only[pb,lf,lD,mT,ν h];exact nu z lemma km (x:о) (g:x<2^53) (e:x%2^29≠2^28): (aj (pZ (x*2^10)))б=(x+2^28)/2^29:=by simp only[aj,ο,ι,ψ,kE, Χ (by simp only[lZ];omega:x*2^10>>29 if d<=26&&E-1195<253&&u-(g+1)<536870911-(g+g)&&r&&&8388607!=0 then ((b>>>63)<<<31)+r-0x255000000 else 4294967296 lemma rb (b:Д) (h:(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29&&&8388607!=0)=true): 2^28<=(b&&&0xfffffffffffff)б/\(b&&&0xfffffffffffff)б+2^28<2^52:=by simp only[AV,A4,<- ξ,ψ,ο,ι, kE,kL,ε] at h⊢ rw[γ _ 63,γ _ 23] at h;rw[γ _ 52];omega lemma gF (b:Д) (e: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 simp only[eF,Α,ι,Ε,ο, ψ,kE,kL,ε,Β] at e⊢ rw[γ _ 11] at e⊢;rw[γ _ 63,γ _ 52];have:=b.toNat_lt;omega lemma a9 (S:у) (hS:fv S) (h:Д) (hh:hб<2^63) (T:с) (z: |rv S-(T:ℝ)| <= (2:ℝ)^(hб:с)) (V: |(T:ℝ)| <= (2:ℝ)^(425:с)) (X:ak S h<4294967296):T≠0/\(ak S h)л=mv T (-298) false:=by unfold ak at X⊢;dsimp only at X⊢ split;swap;. simp[*] at X rename_i x;simp only[ς,AF] at x;obtain ⟨⟨⟨y,D⟩,j⟩,c4⟩:=x;have hE:(eF S.toBits)б<2048:=(fq S).1;have hr:=rb _ c4;generalize hX:eF S.toBits=E at y D j hE;generalize hY:S.toBits&&&0xfffffffffffff=f at j hr simp only[θ,μ,Α,ι,ψ, Ε,kE,nM,mb] at y D j obtain ⟨q,hk⟩:Eб<= hб+1075/\(2^64-Eб+(hб+1075)%2^64)%2^64=hб+1075-Eб:=А;rw[hk] at y j;clear hk;have hp:=Ζ (n:=2) Г y;rw[ν (by omega:_<64),γ _ 29] at j generalize hG:2^(hб+1075-Eб)=G at j hp;replace j:1195<= Eб/\Eб<1448/\G+1<=(fб+2^28)%2^29/\(fб+2^28)%2^29+G<2^29/\G<= fб/\fб+G<2^52:=А;clear D hE hr hp;subst hX hY have as:(if (S.toBits>>>63!=0)=true then 2^31 else 0)=S.toBitsб/2^63*2^31:=by simp only[c9,AF];have:=S.toBits.toNat_lt;split<;>omega have hw:=gF S.toBits j.1;have hv:=bK S hS (λI=>by simp[I] at j) rw[<- as] at hw have Y:(eF S.toBits-1085)б=(eF S.toBits)б-1085:=by rw[Α];simp only[kE];omega generalize hW:lO _=W;generalize (S.toBits>>>63!=0)=A at* generalize (eF S.toBits)б=p at* generalize (S.toBits&&&0xfffffffffffff)б=t at* have o:Wг=(if A then 2^31 else 0)+((p-1085-110)*2^23+(2^23+(t+2^28)/2^29)):=by rw[<- hW,ϓ,hw];split<;>omega have aO:∀N,t+2^52<= N+G-> N<= t+2^52+G -> lf (kN pn ⟨A,N*2^10,((p-1085:ℕ):ℤ)-298⟩)=W:=λN l r=>by have n:=Χ (show N*2^10by have:=aC W;simp only[hx,au,o,kO] at this;split at this<;>omega have k1:=aO (t+2^52-G) А А;have k3:=aO (t+2^52+G) А А;have O:Gby rw[Nat.cast_mul,Am,Am,Nat.cast_pow,nj,<- AD (2:ℝ) 10,<- AT AR, <- AT AR,(А:((10:ℕ):ℤ)+(((p-1085:ℕ):ℤ)-298)=(p:ℤ)-1075+-298)] have hu:(0:ℝ)<(2:ℝ)^((p:с)-1075):=В;have g:(0:ℝ)<(2:ℝ)^(-298:с):=В have U: |(lE T (-298)).toReal| <= (2:ℝ)^(127:с):=by rw[bO,AU,AK g,show (127:ℤ)=425+-298 by norm_num,AT AR];exact AA V g.le have S:∀q u:kW,q.toReal<=(lE T (-298)).toReal -> (lE T (-298)).toReal<= u.toReal-> lf (kN pn q)=W -> lf (kN pn u)=W-> W=lf (kN pn (lE T (-298))):=by intro q u J K w1 w3;subst w1;have e:=aJ (kN pn q);have F:l6 (kN pn q)=true:=by rw[<- e,pb,nv];simpa using qf have H:=ύ pn Б _ (U.trans ((ϡ pn false (2^23) 104 Б Б).trans' (by change _<= |(if false=true then (-1:ℝ) else 1)*((2^23:ℕ):ℝ)*(2:ℝ)^(104:ℤ)|;norm_num))) have e3:kN pn u=kN pn q:=by rw[<- aJ (kN pn u),w3,e] have r:=Ϝ pn Б;have m1:=lU pn J;have m2:=lU pn K;rw[<- r q F,<- r _ H] at m1;rw[<- r _ H,<- r u (by rw[e3];exact F),e3] at m2 rw[Model.eq_of_toReal_eq_of_nonzero H F (le_antisymm m2 m1) (by rw[le_antisymm m2 m1,<- e];generalize lf _=w at qf o⊢;rw[pb,mM,kT w qf];change (n0 w).toReal≠0;rw[<- ϋ,nE];push_cast;refine mul_ne_zero ?_ (zpow_ne_zero _ Г) have hm:kU w≠0:=by unfold kU;split .rename_i I have:=aC w;simp only[I,au,o,Ϧ] at this;split at this<;>omega .omega unfold sv;split<;>simp[hm])] rw[hU,hv] at z;generalize t+2^52=M at z k1 k3 O;have B:((M-G:ℕ):ℝ)=M-G:=p5 O.le;have Q:(G:ℝ)simp only[υ,AN,AX] at z<;>obtain ⟨t1,t2⟩:=abs_le.mp z<;> have v:T≠0:=by rintro rfl;push_cast at t1 t2;nlinarith only[t1,t2,Q,hu] all_goals refine ⟨v,?_⟩;simp only[mv,v,↓reduceIte] on_goal 2=>refine S _ _ ?_ ?_ k3 k1 refine S _ _ ?_ ?_ k1 k3;all_goals simp only[bO,bA,υ,AN,AX,neg_mul,L,B];push_cast;nlinarith only[t1,t2,g] @[specialize] def aq (p:о-> у) (n t:о) (a:у):у:= if t с) (g:с) (B:ℝ) (h:∀tintro _;simpa using e | succ t j=> intro l;rw[Λ,<- add_assoc];push_cast;linarith[Ak ((g:ℝ)+∑s∈kG t,(z s:ℝ)) (z t),j А,h 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[bW,an,cJ];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 cM (x w:п):с:=Core.tm x (nW w) lemma jp (w:kJ):(nW w)г=wг+(2-(kI w)г)*2^23:=by have j:=aC w;have:=au w;have:=w.toNat_lt;unfold nW;by_cases e:kI w=0 .rw[e] at j;rw[AO e,lH,e];simp only[Ϧ,kO] at j⊢;omega by_cases g:kI w=1 .rw[g] at j;rw[AJ e,AO g,lH,g];simp only[UInt32.toNat_one,kO] at j⊢;omega rw[AJ e,AJ g];have:(kI w)г≠0:=λh=>e (χ.mp (h.trans UInt32.toNat_zero.symm)) have:(kI w)г≠1:=λh=>g (χ.mp (h.trans UInt32.toNat_one.symm)) omega lemma eh (w:kJ):(kI (nW w))г=max 2 (kI w)г/\kX (nW w)=kX w /\ kU (nW w)=2^23+wг%2^23/\kM (nW w)=max 2 (kI w)г-1:=by have n:=jp w;have g:=aC w;have:=au w;have j:=aC (nW w);have:=au (nW w);have:=w.toNat_lt;have e:(kI (nW w))г=max 2 (kI w)г:=А;refine ⟨e,Ϥ.mpr (by rw[ag,ag];omega),?_,by rw[ba,e]⟩ unfold kU l9;rw[AJ λh=>by rw[h] at e;simp at e;omega,gS];omega lemma jo (w:kJ):nW w=w\/kM w=0/\kM (nW w)=1:=by by_cases h:(kI w)г<=1 .exact .inr ⟨by rw[ba];omega,by rw[(eh w).2.2.2];omega⟩ .exact .inl (χ.mp (by rw[jp];omega)) lemma jm (w:Е):(mX w)б=2*kU (nW w):=by unfold mX;rw[(eh w).2.2.1,Ϡ,lH,ϯ,gS];simp only[kO,kL,Β];omega lemma jT (w:Е):fv (dX w)/\rv (dX w)=(sv (nW w):ℝ)*2^kM (nW w):=by obtain ⟨-,e,-,g⟩:=eh w exact dG 2 2 P2 dV _ _ w _ AS (jm w) e (by rw[g,(А:max 2 (kI w)г-1=(kI w)г-2+1),Ar];push_cast;ring) lemma uk {i k:т} {S:о} (e:kа<8) (h:iа+8<= S) (g:S<2^32): (i+k)а>>24⟩ termination_by nа-tа decreasing_by have:=β.mp h;rw[ab h];omega lemma fo (W:р kJ) (X:FloatArray) (g n:т) (K:Wв<2^32/\Xд<2^32) (J:gа+nа<= Wв) (z r:о) (Q:r<8): ∀m (t i:т) (y:iа+8*(nа-tа)<= Xд) (j l p q u v w x:у) (o:kJ), nа-tа=m-> iа=z+8*tа -> (λR:A9=>R.s.f r= aq (λs=>X.data[z+8*s+r]!*dX W[gа+s]!) nа tа (A8.f ⟨j,l,p,q,u,v,w,x⟩ r) /\ (∀s,tа<= s-> s(kI W[gа+s]!)г<= R.oг) /\ oг/2^24<= R.oг) (k8 W X g n K J t i y j l p q u v w x o):=by intro m;induction m<;>intro t i y j l p q u v w x o O F .rw[k8,Ag (by rw[β];omega),aq,AJ А] exact ⟨rfl,λs G A=>А,(eW o).ge⟩ rename_i L;have:=κ;have D:tаL (t+1) (i+8) y j l p q u v w x o (by rw[ab h];omega) (by rw[ab h,H,F];ring) refine ⟨I.1.trans ?_,λs G A=>?_,Ah (ϧ (by rw[nO];omega)) I.2.2⟩ .rw[ab h];congr 1 have M:∀c:т,cа<8-> ∀B,X.uget (i+c) B=X.data[z+8*tа+cа]!:=λc N B=>by rw[ug,ae А,F] interval_cases r<;> (simp only[A8.f];rw[M _ (by simp only[kH];omega),bu,E];simp only[kH]) rcases BR s tа with rfl | e .exact (eS _).trans_le ((ϧ (by rw[nO,bu,E];omega)).trans I.2.2) exact I.2.1 s (by rw[ab h];omega) A lemma jt (Y:FloatArray) (v:у):(Y.push v)д=Yд+1:=by rcases Y with ⟨d⟩;simp[FloatArray.push,kR] lemma jA (Y:FloatArray) (i:о) (v:у):(Y.set! i v)д=Yд:=by rcases Y with ⟨d⟩;simp[qi,kR] lemma sg (Y:FloatArray) (i q:о) (v:у) (e:qsimp[*,AE] @[specialize] def bf (f:о-> у) (N:о) (Y:FloatArray):FloatArray:= if Yд у) (N:о):∀k (Y:FloatArray),N-Yд=k-> Yд<= N -> (bf f N Y)д=N/\(∀q q(bf f N Y).data[q]! =f q:=by intro k;induction k<;>intro Y t r .rw[bf,AJ А];exact ⟨А,λq _=>rfl,λq j g=>А⟩ rename_i p;rw[bf,AO А];have u:=jt Y (f Yд);obtain ⟨m,h,o⟩:=p (Y.push (f Yд)) А А;refine ⟨m,λq l=>by rw[h q А,pg _ _ _ А,AO l],λq j g=>?_⟩ rcases BR q Yд with rfl | e .rw[h _ А,pg _ _ _ А,AJ (Ay _)] exact o q А g lemma gT (v:у) (h:(eF v.toBits)б<2047):fv v:=by unfold fv;rw[gR];have g:=(fq v).1;have j:=(fq v).2;rw[Model.isFinite_ofFields _ _ _ _ g j];have e:FloatFormat.binary64.expAllOnesNat=2047:=Б;unfold eF at h;simp only[show FloatFormat.binary64.encoding=.ieee from rfl,e,AV,A4];omega lemma br (v:у) (g:fv v): |rv v| <(2:ℝ)^(((eF v.toBits)б:с)-1022):=by have j:∀(m k:ℕ) (e f:ℤ),m<2^k-> k+e<= f->(m:ℝ)*2^e<2^f:=λm k e f h l=> (Ai (by exact_mod_cast h:(m:ℝ)<2^k) (zpow_pos BA e)).trans_le (by rw[<- AD,<- AT AR];exact AH Г l) unfold rv eF;unfold fv at g;rw[gR] at g⊢;rw[mM,lL _ _ _ _ (fq v).1 (fq v).2 g];have:=(fq v).2;split_ifs with o<;>simp only[Model.Dyadic.abs_toReal] .simp;positivity .exact j _ 52 _ _ this (by rw[o];decide) .exact j _ 53 _ _ (by simp only[kF,pd];omega) (by simp[kF];omega) lemma jv (x y:у) (m:fv x) (o:fv y) (t:fv (x+y)) (E:с) (g:-1074<= E) (j:E<=971) (h: |rv (x+y)| <(2:ℝ)^E): |rv x+rv y| <(2:ℝ)^E:=by have l:=gA x y m o;have r:=m0 _ _ Б m o (l ▸ t);unfold rv at h⊢;rw[l,r,abs_lt] at h;have q:=rx ⟨false,1,E⟩ Г g (by simp[bA];exact AH Г j) have p:=rx ⟨true,1,E⟩ Г g (by simp[bA];exact AH Г j) simp only[bA,υ,AN,AX,p0,Aq,neg_mul] at q p exact abs_lt.2 ⟨lt_of_not_ge λe=>by linarith[lU kF e], lt_of_not_ge λe=>by linarith[lU kF e]⟩ @[specialize] def sT (p:о-> у) (n t:о) (a:у) (m:Д):у×Д:= if trename_i h<;>simp only[μ] at h<;>omega lemma iv (p:о-> у) (z:о-> с) (v:с) (n K:о) (x:1<= K) (y:K<=1993) (B:∀t t<= n-> fv a -> |rv a-((v:ℝ)+∑s∈kG 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-((v:ℝ)+∑s∈kG n,(z s:ℝ))| <= n*(2:ℝ)^((K:с)-1076):=by have G:∀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[AJ А] rename_i q;rw[AO А];exact Ah (by rw[eg];omega) (q (t+1) (a+p t) _ А) intro m;induction m<;>intro t a M E F o j l .obtain rfl:t=n:=А rw[sT,AJ (Ay _)];exact ⟨o,j⟩ rename_i q;have e:tlinarith only[g.1,g.2,j.1,j.2,D] def aM (A:р п) (i:т) (m:Е):Е:= if h:i>>23)&&&255 aM A (i+1) (if m mг<=(aM A i m)г /\ ∀q,iа<= q-> q(kI A[q]!)г<=(aM A i m)г:=by intro k;induction k<;>intro i m t .rw[aM,Ag λh=>by have:=cN h;omega];exact ⟨AS,λq l j=>А⟩ rename_i r;have h:i>>23)&&&255=e;obtain ⟨u,p⟩:=r (i+1) (if mrename_i g<;>simp only[Ν] at g<;>omega refine ⟨А,λq l j=>?_⟩ rcases BR q iа with rfl | e .rw[<- bu A i (cN h)];unfold kI;rw[g];omega exact p q (by rw[ab h];omega) j lemma cw (A:р kJ) (l:Aвby rw[e] at g;simp at g j;omega,by rw[ba];omega⟩ @[inline] def aZ (b:ф) (x:у) (w:Е):у:= if b then (x*P2.uget (w>>>23)н (by rw[bW,an,cJ];have:=w.toNat_lt;omega))*(mX w).toInt64.toFloat else x*dX w lemma il (b:ф) (x w:Е) (y:kI x≠255) (_:kI w≠255): fv (aZ b (dw x) w)/\rv (aZ b (dw x) w)=cM x w:=by obtain ⟨l,o⟩:=aD x y;obtain ⟨-,-,m,r⟩:=eh w;have:=bF x;have:=bF w;have:=ba x;unfold aZ cM tm;split .obtain ⟨g,σ,v,t,j⟩:=qV 2 P2 dV w (by rw[bW,an,cJ];have:=w.toNat_lt;omega) obtain ⟨p,q⟩:=mV _ _ (jm w) (by rw[m];omega) have u:kM (nW w)=(kI w)г-2+1:=by rw[r];omega have h:(sv x*σ)к<2^24:=by rw[ϫ,t,ϭ];exact ci x have e:(sv x*σ*((2*kU (nW w):о):с))к<2^49:=by rw[ϫ];calc _<2^24*2^25:=my h (by rw[m];simp;omega) _=2^49:=Г have a:=bb _ _ l g (sv x*σ) (kM x+((kI w)г-2):о) (by rw[o,j,AD,AM];push_cast;ring) (lt_trans h Г) А (cG 24 _ 971 А AS _ h) have b:=bb _ _ a.1 p (sv x*σ*((2*kU (nW w):о):с)) (kM x+((kI w)г-2):о) (by rw[a.2,q];push_cast;ring) (lt_trans e Г) А (cG 49 _ 971 А AS _ e) exact ⟨b.1,by rw[b.2,u,<- v _ (eh w).2.1,AD];push_cast;ring⟩ .obtain ⟨g,j⟩:=jT w have e:(sv x*sv (nW w))к<2^48:=by rw[ϫ];exact (my (ci x) (ci _)).trans_eq Г have:=bb _ _ l g (sv x*sv (nW w)) (kM x+kM (nW w):о) (by rw[o,j,AD,AM];push_cast;ring) (lt_trans e Г) А (cG 48 _ 971 А AS _ e) exact ⟨this.1,by rw[this.2,AD];push_cast;ring⟩ @[specialize] def bm (k:о-> ф) (p:о-> у) (n t:о) (a:у):у:= if t у) (n:о):∀m t a,n-t=m-> aq p n t a=bm (λ_=>false) p n t a:=by intro m;induction m<;>intro t a h<;>unfold aq bm .grind .grind lemma bz (w v:kJ) (g:kI w≠255) (h:(dw w==0)=true):tm w v=0:=by change ((dw w).toModel.unpack.compare (0:у).toModel.unpack==some .eq)=true at h;rw[show (0:у).toModel.unpack=.zero .positive by rfl] at h have e:=(aD w g).2;rw[fP] at e revert h e;rcases (dw w).toModel.unpack with (_ | _) | _ | s | ⟨_ | _,_,_,_⟩<;> simp (config:={contextual:=true }) [pY,lq,nP,tm] lemma de (k:о-> ф) (p:о-> у) (z:о-> с) (g:с) (P L n:о) (E:∀t z t=0) (F:∀t t<= n-> fv a -> |rv a-((g:ℝ)+∑s∈kG t,(z s:ℝ))| <= t*((2:ℝ)^(P+L)*2^(-54:с)) -> fv (bm k p n t a) /\ |rv (bm k p n t a)-((g:ℝ)+∑s∈kG n,(z s:ℝ))| <= n*((2:ℝ)^(P+L)*2^(-54:с)):=by have x:(2:ℝ)^L*2^L*2^(-54:с)<=1:=by rw[<- AM,<- AD,<- AT AR];exact Be Г (by push_cast;omega) intro m;induction m<;>intro t a H I h r .obtain rfl:t=n:=А rw[bm,AJ (Ay _)];exact ⟨h,r⟩ rename_i u;have e:tlinarith obtain ⟨v,l⟩:=eM a (p t) h w (P+L:о) А А (by rw[AD,AM,abs_lt];constructor<;>linarith) rw[show ((P+L:о):с)-53=(P+L:о)+-54+1 by ring,AT AR,AT AR,AD,zpow_one, Bo _ AR] at l refine u (t+1) (a+p t) А А v ?_;push_cast[Λ,AM,Ae] at l⊢;constructor<;>linarith lemma cL (a b:kJ) (A B:о) (j:kM a<= A) (l:kM b<= B): |(tm a b:ℝ)| <= (2:ℝ)^(48+A+B):=by have g:=er a;have h:=er b;rw[ϵ] at g h have e:(tm a b)к<=2^(48+A+B):=by unfold tm;rw[ϫ,ϫ,Int.natAbs_pow] exact (nf (nf (by omega:(sv a).natAbs<=2^24) (by omega:(sv b).natAbs<=2^24)) (Ζ Г (by omega:idxOf a+idxOf b<= A+B):_<=2^(A+B))).trans_eq (by rw[<- AM,<- AM];congr 1;omega) rw[<- ϰ,ϵ];exact_mod_cast e @[inline] def s8 (Y:FloatArray) (o:т) (e0 e1 e2 e3 e4 e5 e6 e7:у):FloatArray:= (((((((Y.set! oа e0).set! (o+1)а e1).set! (o+2)а e2).set! (o+3)а e3).set! (o+4)а e4).set! (o+5)а e5).set! (o+6)а e6).set! (o+7)а e7 lemma gn (Y:FloatArray) (o:т) (e:о-> у) (h:oа+8?_⟩ simp (disch:=(try simp only[jA,AG]);omega) only[s8,sg,ae,kH] split_ifs<;>first | rfl | omega | (congr 1;omega) @[inline] def xr (X:р п) (q st:т) (r:о):у:=dw (X.getD (q+rе*st)а 0) def bx (X:р п) (st s:т):о-> т-> т-> FloatArray-> FloatArray | 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 gb (X:р kJ) (e s:т):∀k (q o:т) (Y:FloatArray), qа+k*sа+8*eа+oа+8*k oа+8*k<= Yд -> (bx X e s k q o Y)д=Yд/\(∀p r<8->(bx X e s k q o Y).data[oа+8*τ+r]! =dw X[qа+τ*sа+r*eа]!:=by intro k;induction k<;>intro q o Y u A .exact ⟨rfl,λ_ _=>rfl,λ_ _ _=>А⟩ rename_i k y;rw[Μ] at u;have:=κ;have:=ϲ;obtain ⟨h,j⟩:=gn Y o (xr X q e) А;have l:=@ae q s А;have t:(o+8)а=oа+8:=by rw[ae (by simp;omega)];simp obtain ⟨w,g,x⟩:=y (q+s) (o+8) _ А (by rw[h];omega) simp only[l,t] at g x;refine ⟨by rw[bx,w,h],λp B=>by rw[bx,g p А,j p А,AJ А],λτ r z v=>?_⟩ rw[bx];rcases τ with _ | τ .have:=η eа v.le have m:(rе*e)а=r*eа:=by rw[Br,aa А,ν А] rw[g _ А,j _ А,AO А,(А:oа+8*0+r-oа=r),xr,ae (by rw[m];omega),m,Array.getElem!_eq_getD];simp;rfl .grind def ZT:р FloatArray:=Aw (n:=10) λk=>⟨AP (2^(kз+7)) 0⟩ def zT (n:о):FloatArray:= let k:=A0 (8*n)+1-7 if k<10 then ZT[k]! else ⟨AP (8*n) 0⟩ lemma jG (n:о):8*n<=(zT n)д/\((zT n)д=8*n\/(zT n)д<=2^16):=by unfold zT;dsimp only;split .rw[AE ZT _ (by simp[ZT];omega)] simp only[ZT,Θ,kR,Υ] exact ⟨(ώ (n:=8*n)).le.trans (Ζ Б А), .inr (Ζ Б А)⟩ .simp[kR] def dk (X:р п) (st s n b:о) (Z:FloatArray):FloatArray:= if b+n*s+s+8*st+8*n<=4294967295 then bx X stе sе n bе 0 Z else ⟨Aw (n:=8*n) λp=>dw X[b+pз/8*s+pз%8*st]!⟩ lemma eZ (X:р kJ) (e s n b:о) (Z:FloatArray) (m:8*n<= Zд): 8*n<=(dk X e s n b Z)д/\((dk X e s n b Z)д=Zд\/(dk X e s n b Z)д=8*n) /\ ∀τ r,τ r<8->(dk X e s n b Z).data[8*τ+r]! =dw X[b+τ*s+r*e]!:=by unfold dk;split .have:=κ have:=gb X eе sе n bе 0 Z;simp (disch:=omega) only[aa,Ϗ,ϔ] at this;obtain ⟨g,-,h⟩:=this А А;exact ⟨А,.inl g,h⟩ .refine ⟨by simp[kR],.inr (by simp[kR]),λτ r j l=>?_⟩ rw[AE _ _ (by simp;omega),Θ];simp only[(А:(8*τ+r)/8=τ),(А:(8*τ+r)%8=r)] def f9 (t:ф) (X:р п) (R n rb:о) (Z:FloatArray):FloatArray:= dk 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:р FloatArray) (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-> у) (ar: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 4294967296 if c<4294967296 then act relu cл else ar () @[inline] def tf (relu:ф) (S:у) (hh:Д) (sl:Unit-> п):п:= let c:=ak S hh if c<4294967296 then act relu cл else sl () @[inline] def tw (relu:ф) (S:у) (hh:Д) (L n:о) (p:о-> у) (bpf:Unit-> у) (ar:Unit-> п):п:=tf relu S hh λ_=>tS relu L n p bpf ar @[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 jC (j:ф) (n:о) (e g:о-> kJ) (p:о-> у) (m:Unit-> у) (x:Д) (P L:о) (z:Unit-> kJ) (K:∀sB s M.le) (B n AS) n AS).trans ?_ calc ((n:ℝ)+1)*2^P<=2^L*2^P:=by gcongr;exact_mod_cast (by omega:n+1<=2^L) _<=2^425:=by rw[<- AM];exact AB Г А simp only[tw,tf,tS];split_ifs with I t w<;>try exact J .obtain ⟨F,G⟩:=a9 _ E _ (by rw[y];omega) _ v q I;rw[G,aU _ _ _ l F] .obtain ⟨u,o⟩:=iv _ _ (tm (e n) (g n)) n _ t.1 t.2.1 K n 0 _ 0 rfl А r.1 (by simp[r.2]) AS rw[<- D] at o refine (λh=>by rw[h.2,aU _ _ _ l h.1]) (a9 _ u _ ?_ _ (o.trans ?_) q w)<;> rw[mN,Χ (by simp only[lZ];omega)] .omega refine (AA (by exact_mod_cast (by omega:n<=2^L):(n:ℝ)<=2^L) В).trans_eq ?_ rw[<- AD,<- AT AR];congr 1;omega .exact absurd ‹_› Б lemma f0 (l:ф) (n j:о) (o:о-> kJ) (W b:р kJ) (p q:о-> у) (e:kJ) (t D L E:о) (A:Unit-> kJ) (k:о-> ф) (z:∀s(kI W[j*n+s]!)г<= eг) (hf:eг<255-> ∀s(kI W[j*n+s]!)г<255) (G:kI b[j]!≠255/\kM b[j]! <= E) (aH:174+E<= D) (F:n+2<=2^L) (r:L<=27) (K:D+L<=425) (hp:∀s fv (p s)/\rv (p s)=tm (o s) W[j*n+s]!) (hq:∀s fv (q s)/\rv (q s)=cM (o s) W[j*n+s]!) (y:∀s ∀v,tm (o s) v=0) (M:A ()=act l (m9 (n+1) (λs=>if sif stS l L n p (λ_=>dw lV*dw b[j]!) A) A= act l (m9 (n+1) (λs=>if sif s mO (by cases m:k s;exacts [(N s g m).trans_lt J,hf J s g m]) generalize Y:max (48+t+max (eг-1) 55) D=P;have x:(P+2*L-54)иб=_:=Χ (by simp only[lZ];omega) have Q:∀sby cases m:k s exacts [(cL _ _ t (eг-1) (z s g).2 ((ba _).trans_le (Nat.sub_le_sub_right (N s g m) 1))).trans (AB Г А),by simp[y s g m,pow_nonneg]] have H: |(tm lV b[j]!:ℝ)| <= 2^P:=(cL _ _ 126 E Б G.2).trans (AB Г А) have u:=dc lV b[j]! Б G.1 obtain ⟨S,O⟩:=de k q (λs=>cM (o s) W[j*n+s]!) (tm lV b[j]!) P L n (λs g=>hq s g (w s g)) (λs g h=>y s g h _) (λs g=>by unfold cM;rcases jo W[j*n+s]! with h | ⟨-,h⟩ exacts [by rw[h];exact Q s g,(cL _ _ t 1 (z s g).2 h.le).trans (AB Г А)]) H F r А n 0 _ rfl n.zero_le u.1 (by simp[u.2]) have X:∀c≤1,(2:ℝ)^(48+t+c)<=2^((P:с)+-54):=λc _=>by rw[<- AD];exact AH Г А have V:=b7 n (λs=>tm (if sby simp only[g,AX];unfold cM;rcases jo W[j*n+s]! with h | ⟨U,B⟩ .simp[h];positivity .push_cast exact (abs_sub _ _).trans (add_le_add ((cL _ _ t 0 (z s g).2 U.le).trans (X 0 А)) ((cL _ _ t 1 (z s g).2 B.le).trans (X 1 AS)))) (by simp;positivity) n AS have I:(0:ℝ)<2^P*2^(-54:с):=В refine jC l n _ _ p _ _ P L A (λs g=>by simpa[g] using hp s g (w s g)) (by simpa using u) (λs _=>by split;exacts [⟨(z s ‹_›).1,w s ‹_›⟩,⟨Б,G.1⟩]) (λs _=>by split;exacts [Q s ‹_›,H]) F r А x M _ S ?_ rw[az,ai,x,(А:((P+2*L-54:о):с)=P+L+L+(-54))] have B:=sub_nonneg.mpr (by exact_mod_cast F:(n:ℝ)+2<=2^L) push_cast[AT (two_ne_zero' ℝ),AD,Ay,AM,ϱ,Ae] at O V⊢;constructor<;>linarith[AY B (mul_pos I (pow_pos BA L)).le,AY B I.le] lemma gg (X:FloatArray) (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]!) λ_=>ax n relu X W b xo st j @[inline] def pN (t:ф) (R C n:о) (relu:ф) (X W b:р п) (XT:р FloatArray) (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 ax 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:р FloatArray) (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 dI (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 (Aw (n:=(R+7)/8) λrb=> f9 t X R n rbз Z)) 0 0 (AP (R*ow) 0) lemma kA (a:р kJ) (e:ф) (p:о) (w:Unit-> kJ) (q:о): (us a e p w)[q]?=if e=true/\q=p/\q kJ) (j:р kJ):∀(g:List (ф×о×(Unit-> kJ))) (a:р kJ) (S:о-> Prop),(∀x∈g,x.1=true-> x.2.1 x.2.2 ()=F x.2.1)-> aв=jв -> (∀q,(a[q]?=j[q]? \/ a[q]?=some (F q))/\(S q-> q a[q]?=some (F q))) -> (g.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)в=jв /\ ∀q, ((g.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=j[q]? \/ (g.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=some (F q)) /\ ((S q \/ ∃x∈g,x.1=true/\q=x.2.1)-> q (g.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=some (F q)):=by intro g;induction g<;>intro a S r m o .exact ⟨m,λq=>⟨(o q).1,λe l=>(o q).2 (e.resolve_right (by simp)) l⟩⟩ rename_i x g w have:=w (us a x.1 x.2.1 x.2.2) (λq=>S q\/x.1=true/\q=x.2.1) (λy t=>r y (List.mem_cons_of_mem _ t)) (by unfold us;split<;>simp[m]) λq=>by rw[kA];split .rename_i h;obtain ⟨p,rfl,u⟩:=h;rw[r x List.mem_cons_self p (m ▸ u)] exact ⟨qk rfl,λ_ _=>rfl⟩ .rename_i h;refine ⟨(o q).1,λe l=>?_⟩ rcases e with e | ⟨p,rfl⟩ .exact (o q).2 e l .exact absurd ⟨p,rfl,m ▸ l⟩ h refine ⟨this.1,λq=>⟨(this.2 q).1,λe l=>(this.2 q).2 ?_ l⟩⟩ rcases e with e | ⟨y,t,v⟩ .exact BX (BX e) .grind lemma gj (U V:о) (f:о-> о-> р kJ-> р kJ) (F:о-> kJ) (C:о-> о-> о-> Prop) (y:∀u v a,u v(f u v a)в=aв /\ ∀q,((f u v a)[q]?=a[q]? \/ (f u v a)[q]?=some (F q))/\(C u v q-> q(f u v a)[q]?=some (F q))) (u v:о) (a:р kJ): (∀q,(∃e h,e q a[q]?=some (F q)) -> (l2 U V f u v a)в=aв /\ ∀q,(∃e h,e q(l2 U V f u v a)[q]?=some (F q):=by induction u,v,a using l2.induct U V f with intro r<;>rw[l2]<;>simp only[*,if_true,if_false] | case1 u v a o t p=> obtain ⟨z,D⟩:=y u v a o t;obtain ⟨A,B⟩:=p λq ⟨e,h,j,l,w,m⟩ g=>by grind exact ⟨A.trans z,λq x g=>B q x А⟩ | case2 u v a o t p=>exact p λq ⟨e,h,j,l,w,m⟩ g=>r q ⟨e,h,j,l,А,m⟩ g | case3 u v a o=>exact ⟨trivial,λq ⟨e,h,j,l,m⟩ g=>r q ⟨e,h,j,l,А,m⟩ g⟩ def gZ (rows n ow:о) (relu:ф) (X W b:р п) (ix ib L:о) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<= Wв):р п:= dI false rows n ow relu X W b ix ib L hs hW lemma bY {t:ф} (e n p:о) (g:ф) (X W b:р kJ) (D B L:о) (M:Wв<2^32/\8*n<2^32) (K:p*n<= Wв) (N:о) (hx:∀q:о,kI X[q]!≠255/\kM X[q]! <= D) (hb:∀q:о,kI b[q]!≠255/\kM b[q]! <= N) (S:174+N<= B) (hL:n+2<=2^L) (F:L<=27) (G:B+L<=425): dI t e n p g X W b D B L M K=la (n:=e*p) λq=>act g (m9 (n+1) (λs=>if sif sf9 t X e n lз (zT n))=E have ⟨h1,h2⟩:=gj ((e+7)/8) p (b8 t e n p g X W b D B L M K E) (λq=>act g (m9 (n+1) (λs=>if sif s∃r,r<8/\decide (8*l+r?_) 0 0 (lR (e*p) 0) λq ⟨_,_,_,_,h,_⟩ _=>А .refine nk λq=>?_ by_cases A:qcases t<;>simp only[↓reduceIte,υ,Nat.div_add_mod,nR]<;>omega rw[show b8 t e n p g X W b D B L M K E l j a=((n3 8).map λr=> let i:=8*l+r;let y:=yR E n p W b M K l j;let u:=if t then i else i*n;let v:=if t then e else 1; (decide (itG g (y.s.f r) y.o D B L (λ_=>sN n g X W b E L i j u v) λ_=>ax n g X W b u v j)).foldl (λa x=>us a x.1 x.2.1 x.2.2) a from rfl] refine (kj _ a _ a (λ_=>False) ?_ rfl λq=>⟨BX rfl,False.elim⟩).imp id λh q=>⟨(h q).1, λ⟨r,I,J,c2⟩ A=>(h q).2 (qk ⟨_,List.mem_map_of_mem (List.mem_range.mpr I),J,c2⟩) A⟩ simp only[List.mem_map,List.mem_range];rintro x ⟨r,I,rfl⟩ J- dsimp only have dm:∀a c m:о,c< m->(a*m+c)/m=a/\(a*m+c)%m=c:=λa c m h=> (lW А).2 ⟨by ring,h⟩ have w:=eZ X (if t then 1 else n) (if t then e else 1) n (if t then 8*l else 8*l*n) _ (jG n).1 have hX:∀s,(if t then 8*l else 8*l*n)+s*(if t then e else 1)+r*(if t then 1 else n)= (if t then 8*l+r else (8*l+r)*n)+s*(if t then e else 1):=λs=>by cases t<;>simp<;>ring have Q:E[l]! =f9 t X e n l (zT n):=by rw[<- hZ,AE _ _ (by simpa using V),Θ] unfold sN yR;simp only[gg,Q,f9,(А:(8*l+r)/8=l),(А:(8*l+r)%8=r)] rw[AW ⟨w.1,by rcases w.2.1 with h | h<;>rcases (jG n).2 with h | h<;>omega,U⟩] have:=κ;have hn:nеа=n:=aa А;have H:(j*n)еа=j*n:=aa (by have:=η n U;rw[Μ] at this;omega) rw[(fo _ _ _ _ _ _ 0 r I _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (by simp)).1] simp only[f8,hn,H,Ϗ,ϔ];rw[df _ _ _ _ _ rfl] refine (f0 g n j (λs=>X[(if t then 8*l+r else (8*l+r)*n)+s*(if t then e else 1)]!) W b _ _ _ D B L N _ (λ_=>false) (λ_ _=>hx _) (λs z _=>?_) (λ_ _ _=>nofun) (hb j) S hL F G (λs z Y=>?_) (λs z Y=>?_) (λ_ _=>nofun) (by simp only[ax,bT])).trans ?_ .exact ((fo _ _ _ _ _ _ 0 0 А _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (by simp)).2.1 s (by simp) (by rwa[hn])).trans_eq' (by rw[H]) .rw[w.2.2 s r z I,hX];exact dc _ _ (hx _).1 Y .rw[w.2.2 s r z I,hX];exact il false _ _ (hx _).1 Y .cases t<;>simp only[↓reduceIte,υ,ϭ,dm _ _ _ (of_decide_eq_true J),dm _ _ _ U] lemma uo {e n t k:т} {S:о} (m:kа<8) (h:eа+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а kJ-> kJ) (h:kJ-> kJ) (P:kJ-> о) (u:∀x y,P x<= P (g x y)/\P y<= P (g x y)) (W:р kJ) (j n t:т) (m:Wв<2^32) (l:jа+8*nа<= Wв) (p:tаjD (c:=c) m l p v w have L:∀{z x y},P z<= P x-> P z<= P (g x y):=λe=>e.trans (u _ _).1 have R:∀{z x y},P z<= P y-> P z<= P (g x y):=λe=>e.trans (u _ _).2 unfold m8;simp (disch:=simp) only[q,kH];exact ⟨L AS,λr A=>by interval_cases r<;>solve_by_elim only[L,R,AS]⟩ def kw (W:р п) (X:FloatArray) (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[ab h];omega) lemma dH (W:р kJ) (X:FloatArray) (g n:т) (N:Wв<2^32) (L:gа+8*nа<= Wв) (U:nа<= Xд) (z:у) (r:о) (S:r<8):∀m (t:т) (j l p q u v A B:у) (o f:kJ),nа-tа=m -> (λR:A9=>R.s.f r= bm (λs=>X.data[s]! ==z) (λs=>aZ (r%2==1) X.data[s]! W[gа+nа*r+s]!) nа tа (A8.f ⟨j,l,p,q,u,v,A,B⟩ r) /\ (∀s,tа<= s-> s(X.data[s]! ==z)=false->(kI W[gа+nа*r+s]!)г <= R.oг) /\ oг/2^24<= R.oг /\ (R.oг<255->(kI f)г<255 /\ ∀s,tа<= s-> s(X.data[s]! ==z)=true -> (kI W[gа+nа*r+s]!)г<255)) (kw W X g n N L U z t j l p q u v A B o f):=by intro m;induction m<;>intro t j l p q u v A B o f hm .rw[kw,Ag (by rw[β];omega),bm,AJ (show ¬tаА,by split<;>simp only[eW,kO]<;>omega,λK=>⟨?_,λs O D _=>А⟩⟩ split at K;exacts [Ν.mp ‹_›,by simp only[eW,kO] at K;omega] rename_i Y;have H:tаjD (c:=c) N L H E V have M:=c6 max (.<<<1) p6 (λx y=>by rw[nO];omega) W g n t N L H o have F:=c6 (. ||| ·) bD (λw=>(kI w)г) eo W g n t N L H f have I:=λ{j l p q u v A B o f}=>Y (t+1) j l p q u v A B o f (by rw[ab h];omega) rw[kw,AW h,bm,AO H];dsimp only by_cases E:(X.data[tа]! ==z)=true<;>simp only[ug X t,E,υ,↓reduceIte]<;> refine ⟨I.1.trans ?_,λs O D G=>if e:s=tа then (by subst e;first | exact Bool.noConfusion (E.symm.trans G) | exact Ah (by rw[eS];exact ϧ (M.2 r S)) I.2.2.1) else I.2.1 s (by rw[ab h];omega) D G, Ah (ϧ (by first | exact M.1 | exact AS)) I.2.2.1,λK=>?_⟩<;> try (have J:=I.2.2.2 K;exact ⟨by first | exact Al F.1 J.1 | exact J.1,λs O D G=>if e:s=tа then (by subst e;first | exact absurd G E | exact Al ((eA _).ge.trans (F.2 r S)) J.1) else J.2 s (by rw[ab h];omega) D G⟩) all_goals rw[ab h] congr 1 interval_cases r<;> (simp only[A8.f,kL,Nat.reduceBEq];rw[Q _ _ (by simp only[kH];omega)];simp only[kH]) lemma jZ (g:о-> у) (r:о) (e: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:FloatArray) (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[Nat.add_mul] 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 bB {α:Type} (f:о-> α) (N:о) (a:р α):р α:= if aв α) (N:о): bB f N (k9 N)=la (n:=N) λq=>f qз:=by suffices h:∀k (a:р α),N-aв=k-> aв<= N->(∀i (h:i bB f N a=la (n:=N) λq=>f qз from h _ _ rfl (by simp) (λi h=>by simp at h) intro k;induction k<;>intro a m l e<;>rw[bB] .rw[AJ А] exact lI (by simp;omega) λi g _=>by rw[e i g,Θ] rename_i j;rw[AO А];refine j _ (by simp;omega) (by simp;omega) λi h=>?_ rw[pT];split .exact e i ‹_› .grind def dJ (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:=bf (λk=>dw X[k]!) n (Ad n) let Y:=bB (λg=>yW xr n ow W b hs hW g) ((ow+7)/8) (Ac ((ow+7)/8)) bB (λ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]!) λ_=>ax n relu X W b (j/ow*n) 1 j) λ_=>ax n relu X W b (j/ow*n) 1 j) (1*ow) (Ac (1*ow)) else linearSpec 1 n ow relu X W b lemma cZ (n v:о) (l:ф) (X W b:р kJ) (J B L:о) (V:Wв<2^32/\8*n<2^32) (Q:v*n<= Wв) (E:о) (A:∀q:о,kI X[q]!≠255/\kM X[q]! <= J) (S:∀q:о,kI b[q]!≠255/\kM b[q]! <= E) (G:174+E<= B) (N:n+2<=2^L) (w:L<=27) (x:B+L<=425): dJ n v l X W b J B L V Q=pU 1 n v l X W b:=by unfold dJ;split;rename_i M;swap;rfl;unfold pU linearWith;simp only[gg,ei];congr 1;funext q;have H:qзdw X[k]!) n _ (kP n) rfl (l4 _) generalize bf (λk=>dw X[k]!) n (kP n)=D at o⊢ have p:∀sby rw[o.2.2 _ (l4 _) g];simp rw[AE _ (j/8) (by simp;omega),Θ] unfold yW;dsimp only;rw[AW ⟨o.1,M⟩];have:=κ;have z:nеа=n:=aa А;set c:=min (8*(j/8)) (v-8) with U;have u:j-c<8/\c+(j-c)=j/\c+8<= v:=А;have I:(c*n)еа=c*n:=aa (by have:=η n u.2.2;rw[mG] at this;omega) have K:(c*n)еа+nеа*(j-c)=j*n:=by rw[z,I];grind have m:∀s,(kI W[j*n+s]!)г=(kI W[(c*n)еа+nеа*(j-c)+s]!)г:= λs=>by rw[K] have F:=jZ (λr=>dw lV*dw b[c+r]!) _ u.1 have T:=λe k m F y=>f0 l n j (λt=>X[0*n+t]!) W b (λs=>D.data[s]!*dw W[j*n+s]!) (λs=>aZ ((j-c)%2==1) D.data[s]! W[j*n+s]!) e J B L E (λ_=>ax n l X W b (0*n) 1 j) k (λs _=>A _) m F (S j) G N w x (λs g m=>by rw[p s g];exact dc _ _ (A _).1 m) (λs g m=>by rw[p s g];exact il _ _ _ (A _).1 m) y (by unfold ax;simp only[bT,ϭ]) rw[(dH _ _ _ _ _ _ _ _ (j-c) u.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).1,F,K,Ϗ,u.2.1];simp only[z] exact T _ (λs=>D.data[s]! ==0) (λs g y=>(m s).trans_le ((dH _ _ _ _ _ _ _ _ (j-c) u.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.1 s (by simp) (by rwa[z]) y)) (λO s g y=>(m s).trans_lt (((dH _ _ _ _ _ _ _ _ (j-c) u.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.2.2 O).2 s (by simp) (by rwa[z]) y)) λs g h _=>bz _ _ (A _).1 (by rwa[<- p s g]) lemma dz (n:о) (g e:о-> kJ) (l:0if tif tby split;exacts [(j t ‹_›).symm,Б],aR _ _ _ j,az] congr 1 .simp only[Ay,if_false,(Б:tm lV 0x80000000=0),BC] exact Ο rfl λt m=>by simp only[AO (ϊ.mp m)];unfold tm;rw[ϥ];ring congr 1;. simp[l.ne'] suffices ∀c i,i+c=n-> po _ _ i (c+1)=po _ _ i c from this n 0 А;intro c;induction c with | zero=> intro i h;obtain rfl:i=n:=А simp only[po,ac (i+1) (λt=>if t< i then e t else lV) i А, ac (i+1) (λt=>if t< i then g t else 0x80000000) i А,Ay,if_false];rfl | succ c o=> intro i h rw[po,o (i+1) А,po,ac (n+1) (λt=>if tif tby have a:=m (r*g+q);have b:=m Xв;clear*-a b;grind) o AS l h.2.2.2.1 h.2.2.1)).trans ?_ unfold pU linearWith;refine lI (by simp[mG]) λq v w=>?_ rw[Array.getElem_append];simp only[ϣ,Θ] split;. rfl simp only[ϣ,Array.size_append,mG,Nat.one_mul] at v w;have p:q/e=r:=pG А (by rw[Μ];omega) have l:q-r*eby by_cases h:q< m<;>simp[h]<;>decide) AS (by have:=@ώ (k+1);omega) u r).trans ?_ unfold gemmSpec gemmWith;refine lI (by simp[Ϛ]) λq g _=>?_ simp only[ϣ] at g;have j:q/n< m:=mB g;have x:(lR m (0x80000000:kJ))[q/n]! =0x80000000:=by simp[j] simp only[Θ,↓reduceIte,x,Ϭ (show q< m*n by rwa[Ϛ]), ν j,m3,ϔ] exact (F.dz k (λt=>A[q/n*k+t]!) (λt=>B[q%n+t*n]!) v λt _=>⟨(w _).1,(l _).1⟩).trans (by simp only[ϥ (q%n)]) .rfl end Dense namespace Bn namespace NativeAdd lemma dY (x:Float32):ps x.toModel=pb x.toBits:= congrArg Model.mk (pK x.toBits).symm lemma iR (x:Float32):lf (ps x.toModel)=x.toBits:= UInt32.ofNat_toNat lemma bk (a:kJ) (h:kI a≠255): (nl a).toBits=a/\(nl a).isFinite=true:=by have j:pe (spec:=lh) a.toBitVec≠-1#8:=λe=> h (χ.mp ((show (kI a)г=(a.toBitVec.extractLsb' 23 8).toNat by simp only[kI,Ι,Τ,BitVec.extractLsb'_toNat];exact γ _ 8).trans (congrArg BitVec.toNat e:))) have g:(nl a).toBits=a:=by change Bh (qa lh (kS lh a.toBitVec))=a rw[Model.pack_unpack_eq,AJ (j ·.1)] refine ⟨g,?_⟩;change (kS lh (nl a).toBits.toBitVec).isFinite=true;simp only[g,kS,j,AN];split_ifs<;>rfl @[noinline] def eN (relu:ф) (a b:п):п:= act relu (toWord (Model.add (ofW a) (ofW b))) @[inline] def eE (relu:ф) (w:п):п:= w&&&~~~((0:п)-((if relu then w>>>31 else 0)&&&(if w&&&0x7FFFFFFF<=0x7F800000 then 1 else 0))) lemma jN (w:kJ):(w&&&0x80000000!=0)=decide (2^31<= wг):=by have g:=w.toNat_lt rw[Ϥ,AV,A4,<- χ,Ι,decide_eq_true_iff, show (0x80000000:Е)г=2^31 from rfl,n9] simp only[Ϧ,Nat.testBit,ε,Nat.one_and_eq_mod_two];constructor .intro h;by_contra e;apply h;rw[Ϭ А];simp .intro h;rw[(А:wг/2^31=1)];simp lemma ga (e:ф) (w:kJ):eE e w=act e w:=by have y:=w.toNat_lt;have u:(w>>>31)г=wг/2^31:=by rw[Τ];simp[ε] have o:=Dense.au w;have r:=Dense.aC w have t:(l9 w)г=wг%2^23:=by unfold l9;rw[Ι];exact γ _ 23 unfold Dense.bD at o r have p:∀x:kJ,x&&&~~~((0:kJ)-0)=x:=λx=>by apply χ.mp;rw[Ι];rw[show (~~~((0:kJ)-0))г=2^32-1 from rfl,γ,ν x.toNat_lt] have v:∀x:kJ,x&&&~~~((0:kJ)-1)=0:=λx=>by apply χ.mp;rw[Ι];simp have l:w>>>31=if 2^31<= wг then 1 else 0:=by apply χ.mp;rw[u];split<;>simp<;>omega have q:(w&&&0x7FFFFFFF<=0x7F800000)↔wг%2^31<=0x7F800000:=by rw[n4,o];rfl have m:(w&&&0x80000000!=0&&!(kI w=255&&l9 w !=0))=true↔ (2^31<= wг/\wг%2^31<=0x7F800000):=by rw[jN] simp only[ς,AF,Bool.not_eq_true',Bool.and_eq_false_iff,decide_eq_false_iff_not, bne_eq_false_iff_eq,<- χ,r,t,o,kO,Ϧ] omega unfold eE act;cases e .simp only[υ,AN,Bg,p] simp only[AX];unfold reluW;rw[l];by_cases g:2^31<= wг .rw[AO g] by_cases j:wг%2^31<=0x7F800000 .rw[AO (q.mpr j),show (1:kJ)&&&1=1 from rfl,v,AO (m.mpr ⟨g,j⟩)] .rw[AJ (mt q.mp j),show (1:kJ)&&&0=0 from rfl,p,AJ (λh=>j (m.mp h).2)] .rw[AJ g,Bg,p,AJ (λh=>g (m.mp h).1)] @[inline] def add (relu:ф) (a b:п):п:= if expOf a !=255&&expOf b !=255 then eE relu (Bj a+Bj b).toBits else eN relu a b lemma gB (e:ф) (a b:kJ): add e a b=act e (lf (pC (pb a) (pb b))):=by unfold add;split .rename_i h rw[ga];simp only[ς,AV] at h;have g:=bk a h.1;have j:=bk b h.2;have l:=ExecFloat.Binary.toModel_ofFloat32_add_of_isFinite _ _ g.2 j.2;simp only[ExecFloat.Binary.toModel_ofFloat32,dY,g.1,j.1] at l;rw[<- l,<- dY,iR] .rfl end NativeAdd @[noinline] def gU (relu:ф) (w s t:п):п:=act relu (toWord (Bd (ofW w) (ofW s) (ofW t))) @[inline] def ad (rb:Е) (a b:п) (_slow:Unit-> п):п:=NativeAdd.add (rb !=0) a b @[specialize] def cd (stop:т) (f:(i:т)-> iа п-> п) (i:т) (x:р п) (h:stopа<= xв):р п:= if hi:i iа kJ-> kJ) (F:о-> kJ-> kJ) (m:∀i g w,f i g w=F iа w) (i:т) (x:р kJ) (h:eа<= xв): (cd e f i x h)в=xв /\ ∀j,(cd e f i x h)[j]?=if iа<= j/\j refine ⟨by rw[l.1,Ξ],λj=>?_⟩ rw[l.2,Dense.ab g,϶,Array.getElem?_set А];split_ifs<;>first | rfl | omega | (subst_vars;rw[lK А,Option.map_some,m];rfl) .next i x h g=>exact ⟨rfl,λj=>by rw[AJ (by rw[β] at g;omega)]⟩ @[inline] def wX (x:Д):Д:=((x>>>34)<<<31)+((x&&&0x3FFFFFFFF)-0x255000000) 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)<4294967296:=by unfold Dense.F.ak simp only[pf,UInt64.sub_self,UInt64.shiftLeft_zero,UInt64.reduceLE,decide_true, Bool.true_and] generalize S.toBits=a at h⊢;generalize m:(a+268435457)>>>29=x at h⊢ have e:∀x,x&&&2047=x%2^11:=(γ · 11) have g:∀x,x&&&8388607=x%2^23:=(γ · 23) have o:∀x,x&&&536870911=x%2^29:=(γ · 29) have p:∀x,x&&&17179869183=x%2^34:=(γ · 34) simp only[ς,AQ,AF,AV,A4,<- ξ, μ,Α,ψ,ι,ο, kE,kL,ε,e,g] at h m obtain ⟨⟨q,r⟩,t⟩:=h have j:(Dense.F.eF a)б=aб/2^52%2^11:=by simp only[Dense.F.eF,ψ,ο,kE,kL,ε,e] have u:(a&&&0xfffffffffffff)б=aб%2^52:=by rw[ψ];exact γ _ 52 rw[AO (by simp only[ς,AF,UInt64.reduceAdd,UInt64.reduceSub,AV,A4, <- ξ,μ,Α,ψ,ι,ο,j,u, kE,kL,ε,g,o] rw[γ _ 63];have:=a.toNat_lt;clear*-this m q r t;omega)] obtain ⟨y,z,A,B⟩:1195<= aб/2^52%2^11/\aб/2^52%2^11<=1447 /\ 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:=a.toNat_lt;clear*-this m q r t;omega have l:=Dense.F.gF a (by rw[j];omega) rw[j,u] at l;have w:aб/2^63<2:=А;have v:(aб%2^52+2^28)/2^29<=2^23:=А;simp only[ϓ,μ,l,kE,j];refine ⟨?_,by clear*-w v y z;omega⟩ rw[<- ξ,l,wX] simp only[ι,Ε,ο,Α,ψ, kE,kL,ε,Β,p,A,B] clear*-w v y z;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 x==(a+268435453)>>>29&&((x>>>23)&&&2047)-1195<253&&x&&&8388607!=0 then let o:=(wX x)л if o&&&m !=0 then 0 else o else slow () else slow () 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 cd stop (λ_ _ w=>eB g m Y Z w λ_=>gU relu w sc tc) (ch*hw)е x h else x) else x termination_by c-ch def be (relu:ф) (c hw:о) (x s t:р п):р п:= if xв=c*hw/\c*hw?_ have W:=h.2 suffices C:∀l x,xв=c*g->(bh p g c s t l x)[j]?=if l*g<= j then x[j]?.map (λw=>act p (lf (Bd (pb w) (pb s[j/g]!) (pb t[j/g]!)))) else x[j]? by rw[C 0 x h.1,AO (by simp),scaleShiftSpec,mU] split .rw[lK А,AE x j А];rfl .rw[mg А];rfl intro l x D;induction hk:c-l generalizing l x with | zero=> rw[bh,AJ А];split;swap;rfl;rw[mg (by have:=η g (by omega:c<= l);omega)];rfl | succ k ih=> have as:l*g+g<= c*g:=by rw[<- Μ];exact η _ А have m:=Dense.aa (n:=l*g+g) А;rw[bh,AO А];dsimp only;rw[AW (by rw[m];omega)] generalize hf:(λ_ _ w=>eB _ _ _ _ w _)=f have ⟨A,B⟩:=cm _ f (λ_ w=>gU p w s[l]! t[l]!) (λ_ _ w=>?_) (l*g)е x (by rw[m];omega) rw[ih (l+1) _ (by rw[A,D]) А,B,Dense.aa А,m,Μ] split_ifs<;>first | omega | rw[pG (k:=l) А (by rw[Μ];omega)];rfl | rfl subst hf;generalize s[l]! =s,t[l]! =t;dsimp only[eB,gU];split;swap;rfl;rename_i N;simp only[ς,AV,A4,AF] at N;obtain ⟨⟨O,Q⟩,g⟩:=N;replace g:¬kI w=255:=λh=>by simp[kI] at h;simp[h] at g split;swap;rfl;obtain ⟨z,u,v,L,M⟩:=cX _ ‹_›;open Dense.F in .rw[<- z] have it:=Dense.ba t;have et:=Dense.bF t;obtain ⟨J,v1⟩:=dc w s g O;obtain ⟨U,v2⟩:=aD t Q;obtain ⟨V,v3⟩:=io 149 А obtain ⟨K,v4⟩:=bb _ _ U V (sv t) ((kM t+149:о):с) (by rw[v2,v3,AD,AM];ring) ((ci t).trans Г) А (cG 24 _ 971 А AS _ (ci t)) have q:=gT (dw w*dw s+dw t*pw 149) А;have r:=jv _ _ J K q _ А А (br _ q);obtain ⟨-,e⟩:=eM _ _ J K _ А А r have X:rv (dw w*dw s)+rv (dw t*pw 149)= ((sv w*sv s*2^(kM w+kM s)+sv t*2^(kM t+149):с):ℝ):=by rw[v1,v4,tm,AD];push_cast;ring rw[X] at r e;generalize dw w*dw s+dw t*pw 149=S at M u v L q r e⊢ have hh:((eF S.toBits-1075)б:с)=((eF S.toBits)б:с)-1075:=by simp only[Α,kE];omega obtain ⟨y,E⟩:=a9 S q (eF S.toBits-1075) А _ (e.trans (by rw[hh,sub_sub];exact half_le_self В)) (r.le.trans (AH Г А)) M rw[show lf (Bd (pb w) (pb s) (pb t))=(ak S (eF S.toBits-1075))л from ?_] .generalize lO _=o at L⊢ have Y:kI o≠255:=λh=>by have:=Dense.iC o;simp[h] at this;omega cases p<;>simp[act,reluW,Y] rw[E];have I:=kT w g;have G:=kT s O;have H:=kT t Q;open Model in .rw[Proof.fma_eq_spec] simp (disch:=assumption) only[Spec.fma,pb,(chooseNaN3_eq_none_iff _ _ _).2 ⟨lr I, lr G,lr H⟩,isInf_eq_false_of_toDyadic?_some, Bool.or_false,υ,AN,I,G,H] refine (mw _ _ _ _ y ?_).symm;rw[addDyadic,pV];erw[pW (n0 w) (n0 s)];simp[nE,A5];field_simp;ring lemma iM (e:ф) (a b:kJ) (g:Unit-> kJ) (h:g ()=act e (lf (pC (pb a) (pb b)))): ad (if e then 1 else 0) a b g=act e (lf (pC (pb a) (pb b))):=by cases e<;>simp[ad,NativeAdd.gB] @[noinline] def jJ (relu:ф) (x y:п):п:=act relu (toWord (Model.add (ofW x) (ofW y))) def bX (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 λ_=>jJ relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b lemma dp:bX=addReluSpec:=by funext e a b;unfold bX;dsimp only split;swap;. rfl rename_i h;have l:=Dense.aa h.2;refine nk λj=>?_ rw[(cm _ _ (λj x=>act e (lf (pC (pb x) (pb b[j]!)))) (λi m x=>?_) 0 a _).2 j, addReluSpec,mU] .by_cases g:j ф) (fa:о-> kJ) (bx:Д) (s:lJ) (J:ф) (I K b:р kJ) (D:ф) (nc Y:о) (r d:kJ) (x:Д) (v:с) (B a:Д) (m:о) (e j:т) (bw:Д) (u:Е) {α:Type} lemma mo {a b:о} (h:asimp[*] lemma j7 {n:о} (h:n<2^32):n%2^nS=n:=mo (As h bn) lemma jP (a:р Е):a.usizeа<= aв:=BH _ _ @[inline] def ok (w:Е):ф:= expOf w !=255&&(mW w==0 || iW w-E<= C) @[inline] def g6 (a:р Е):Д:= a.foldl (λm w=>if mW w !=0&&iW w< m then iW w else m) 255 @[inline] def bZ (h l:Д):Д:=(h<<<25)+l @[inline] def dF (h l:Д):Д:= ((h+0x8000000000000000)>>>(39:Д))-(16777216:Д)-(l>>>(63:Д))+ (if bZ 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=>cI f s (x+1) m (e+s) (a.push (f x e)) @[inline] def iy (O H W:о) (f:о-> о-> о-> Е):р Е:= if 0cI (λx _=>f o y x) 0 0 W 0) (O*H) 0 0 (Ac (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 cT (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.bG (dF H A) (bZ H A) (B+149) eH (if r<4294967296 then rл else fb ()) d @[inline] def aO (w:п):Д:=if mW w !=0 then iW w else 255 @[inline] def dq (x0 x1 x2 x3:п):ф:=Q x0&&Q x1&&Q x2&&Q x3 @[inline] def eF (u:п):Д:=((u>>>23)&&&255)м @[inline] def gy (ch y x:о) (e:т):п:= let v:=wе if hb:edq (.==0x80000000) x0 x1 x2 x3) (λ_=>cT h w 2 I ch y x) d else toWord (Av (ofW (cT h w 2 I ch y x)) (ofW d)) else toWord (Av (ofW (cT h w 2 I ch y x)) (ofW d)) def dO (I:р п) (B:Д) (stop:т) (hs:stopа<= Iв) (e:т) (acc:Д):Д:= if h:ecI (gy h w I d o y) 2 0 (w/2) ((o*h+y*2)*w)е) (c*(h/2)) 0 0 (Ac (c*(h/2*(w/2)))) else let q:=cK (k*k) let bx:=g6 I if bx<=255/\I.all (ok q bx)=true then iy c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k wo bx (eP I bx w k U) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>cT h w k I ch y x) d else iy c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k let B:=wl (λ(m:Д) v=>min m (aO v)) I w k (k*k) U 0 255 if B<=255/\wa (ok q B) I w k (k*k) U 0 true=true then wo B (cs (t1 B) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>cT h w k I ch y x) d else toWord (Av (ofW (cT h w k I ch y x)) (ofW d)) else avgpoolSpec c h w k I lemma fX:af x=(xб:с)-2^64*(xб/2^63:о):=by unfold af;rw[Ϻ,ms];have:=x.toNat_lt;split<;>omega lemma jB (h:(xб:с) ≡ v [ZMOD2^64]) (e:-2^63<= v) (g:v<2^63):af x=v:=by rw[fX];have:=x.toNat_lt;unfold pD at h;omega def Z:ZMod (2^64):=xб lemma g8:(xб:с) ≡ v [ZMOD2^64]↔Z x=v:=by rw[Z,<- Int.cast_natCast (R:=ZMod (2^64)),ZMod.intCast_eq_intCast_iff];rfl lemma sZ (h:Z x=v) (e:-2^63<= v) (g:v<2^63): af x=v:=jB x v ((g8 x v).mpr h) e g lemma dl (b:Д):Z (a+b)=Z a+Z b:=by simp[Z,ι] lemma iL (b:Д):Z (a-b)=Z a-Z b:=eq_sub_of_add_eq (by rw[<- dl,pf]) lemma bH:Z 0=0:=by simp[Z] lemma dU {B:Д} (h:B<=255):Bб<=255:=θ.mp h def d9 (e:о) (w:Е):с:=sv w*2^(idxOf w-e) lemma dg (h:kU u=0):sv u=0:=by simp[sv,h] lemma db (w:Е) (o:Eб<=255) (m:Cб<=62) (h:ok C E w=true): kI w≠255/\(kU w=0\/(Eб<= kM w/\kM w<= Eб+Cб /\ (iW w-E)б=kM w-Eб)):=by simp only[ok,ς,AV,A4,lQ,AQ] at h;refine ⟨h.1,h.2.imp (λe=>?_) λg=>?_⟩ .have:=al w;rw[e] at this;simp at this;omega .have l:=aw w;have j:=θ.mp (of_decide_eq_true g);have:=idxOf_le w h.1;rw[Α,l] at j⊢;omega lemma jH (b:Д):((a+b)б:с) ≡ (aб:с)+bб [ZMOD2^64]:=by unfold pD;rw[ι];omega lemma gG (b:Д):((a-b)б:с) ≡ (aб:с)-bб [ZMOD2^64]:=by have:=b.toNat_lt;unfold pD;rw[Α];omega lemma ey (e g:Д): aA (dF e g) (bZ e g)=af e*2^25+af g:=by have j:=e.toNat_lt;have l:=g.toNat_lt;have m:(bZ e g)б=((eб%2^39)*2^25+gб)%2^64:=by unfold bZ;rw[ι,Ε];simp only[Β,no,nD,kL];omega have o:((dF e g)б:с) ≡ (eб/2^39:о)+(if eб<2^63 then 0 else-2^25)- (gб/2^63:о)+(if bZ e gomega .split<;>rfl unfold aA;rw[jB _ _ o (by clear*-j l;split_ifs<;>omega) (by clear*-j l;split_ifs<;>omega),fX,fX,m] simp only[μ,m];clear*-j l;split_ifs<;>omega abbrev ao (g:о-> Е):р Е:=Aw (n:=m) λq=>g qз lemma dM (g:о-> Е):(ao m g).push (g m)=ao (m+1) g:=by simp[ao,Array.ofFn_succ] lemma bi (o y x H W:о) (j:y о-> р Е-> р Е) (S:о-> р Е-> Prop) (l:∀o y a,y S (o*H+y) a-> S (o*H+y+1) (f o y a)):∀n o y a,y S (o*H+y) a-> S (o*H+y+n) (lp H f n o y a):=by intro n;induction n .exact λ_ _ _ _=>id rename_i n e;intro o y a m h;have g:=l o y a m h;simp[lp];split_ifs with j .rw[show o*H+y+(n+1)=o*H+(y+1)+n by ring];exact e _ _ _ j g obtain rfl:H=y+1:=А;rw[show o*(y+1)+y+(n+1)=(o+1)*(y+1)+0+n by ring];exact e _ _ _ А (by rwa[show (o+1)*(y+1)+0=o*(y+1)+y+1 by ring]) lemma ir (f:о-> т-> Е) (g:о-> Е) (s:т):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jе))-> cI f s x m e (ao M g)=ao (M+m) g:=by intro m;induction m<;>intro x e M l .rfl rename_i m p;have o:g M=f x e:=by simpa[show USize.ofNat 0=0 from rfl] using l 0 А rw[cI,<- o,dM,p _ _ _ λj q=>by rw[(А:M+1+j=M+(j+1)),l _ А,(А:x+(j+1)=x+1+j), show (j+1)е=jе+1 from Bs j 1,USize.mul_add,USize.mul_one, USize.add_assoc,USize.add_comm (s*_)]];congr 1;omega lemma fu (H W n c:о) (s:т) (E:о-> о-> т) (F:о-> о-> о-> т-> Е) (e:0cI (F o y) s 0 W (E o y)) n 0 0 (k9 c)= ao (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)е):= by have:=ee H (λo y=>cI (F o y) s 0 W (E o y)) (λk a=>k<= n-> a=ao (W*k) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)е)) (λo y a m g p=>by rw[g А];exact ir _ _ _ _ _ _ _ λj l=>by simp[show W*(o*H+y)+j=(o*H+y)*W+j by ring,bi o y j H W m l]) n 0 0 _ e λ_=>rfl simpa[Ϛ W n] using this lemma iY (g:α-> kJ-> α) (I:р kJ) (w k U:о):∀n l j e,j wl g I w k n (U+l*w+j) j e=(List.range' (l*k+j) n).foldl (λe t=>g e I[U+t/k*w+t%k]!) e:=by intro n;induction n<;>intro l j e q .rfl rename_i m;obtain ⟨o,p⟩:=(lW (a:=l*k+j) (d:=l) А).2 ⟨by ring,q⟩ rw[List.range'_succ,lS];simp only[wl,o,p];split_ifs with h .exact m l (j+1) _ h obtain rfl:k=j+1:=А rw[show U+l*w+j+w+1-(j+1)=U+(l+1)*w+0 by rw[Ρ];omega, m (l+1) 0 _ А];congr 2;ring lemma iD (g:α-> kJ-> α) (I:р kJ) (w k U n:о) (e:α) (j:0g e I[U+t/k*w+t%k]!) e:=by have:=iY g I w k U n 0 0 e j;simp[<- List.range_eq_range'] at this;exact this lemma aa (h:n<2^32):nеа=n:=j7 h lemma e9:Z x=((xб:с):ZMod (2^64)):=by unfold Z;norm_cast lemma gx:Z x=((af x:с):ZMod (2^64)):= (g8 x _).mp (by rw[fX];unfold pD;omega) lemma iV (m:Д) (h:mб<2^62): af (sg u m)=if kX u then-(mб:с) else mб:=by unfold sg;rw[eX];cases kX u<;>simp only[fT,AX,AN]<;>refine sZ _ _ ?_ А А;exacts [e9 m,by rw[iL,bH,e9];push_cast;ring] @[inline] def bQ (s:ConvShape) (I:р п) (c y x:о):п:= if csimp[*,AE] def d7 (I:р п) (p n d:т) (hs:Iв<2^32) (hp:pа+nа<= Iв) (j:т) (X:FloatArray) (hd:dа+nа<= Xд/\Xд<2^32):FloatArray:= if h:j(d7 I p n d l e j X hd)д=Xд /\ ∀qintro j X hd u<;>rw[d7] .rw[Ag (by rw[β];omega)];exact ⟨rfl,λq _=>by rw[AJ А]⟩ rename_i m r;have h:j?_ rw[o q (by rw[bj];exact g),Dense.ab h,ff _ _ _ _ _ g,Dense.ae А] split_ifs<;>first | omega | (rw[ev,Dense.ae А];congr 2;omega) | rfl def RV (s:ConvShape) (r j:о) (p d:т) (n:о):Prop:= rby have:=η (s.h+2) h;omega lemma iu {s:lJ} {r j n m:о} {p d:т} (u:s.cin*s.h*s.w<= m) (h:RV s r j p d n) (q:j RV s (r+1) (j+1) (p+q) (d+l) n) /\ (¬(1<= r/\r<= s.h)-> RV s (if r+1=s.h+2 then 0 else r+1) (j+1) p (d+l) n):=by obtain ⟨G,⟨c,D,m⟩,A,o⟩:=id h;have:=κ;have u:=η (s.w+2) (А:j+1<= s.cin*(s.h+2)+3) rw[Ρ] at u;have e:(d+l)а=(j+1)*(s.w+2):=by rw[Dense.ae А,A,x,Ρ] refine ⟨λg=>⟨А,⟨c,А,?_⟩,e,o⟩,λg=>⟨by split<;>omega,?_,e,o⟩⟩ .have:=(iu AS h B g).1 rw[Dense.ae А,m,F,<- Ρ];congr 1;omega .split .exact ⟨c+1,by rw[Ρ];omega,by rw[m,Ρ];congr 1;omega⟩ .exact ⟨c,А,by rw[m];congr 2;omega⟩ def cW (I:р п) (s:ConvShape) (hs:Iв<2^32) (hI:s.cin*s.h*s.w<= Iв) (wU VU:т) (hw:wUа=s.w) (hV:VUа=s.w+2) (G:о) (hG:G=s.cin*(s.h+2)) (r j:о) (p d:т) (X:FloatArray) (h:RV s r j p d Xд):FloatArray:= if hj:j G-j=m -> (∀q (cW I s H u l o K J G g r j p d X h)д=N /\ ∀qintro r j p d X h N v hm A<;>rw[cW] .rw[Ag А];refine ⟨v,λq e=>?_⟩ rw[A q e,bQ];split;. rfl have:=η (s.w+2) (А:s.cin*(s.h+2)<= j) rw[AJ (by rw[ϳ В,<- Ϩ];omega)] rename_i m L;have B:jrename_i D;on_goal 2=>refine L _ _ _ _ _ _ _ v А λq e=>?_;rw[A q e] obtain ⟨Y,b2,b3⟩:=iu u h (g ▸ B) D;obtain ⟨U,M⟩:=cx I p l (d+1) H А _ 0 X ⟨А,h.2.2.2.2⟩ rfl refine L _ _ _ _ _ _ _ (U.trans v) А λq e=>?_ rw[M q А,A q e,Ϗ] all_goals split_ifs<;>try first | omega | with_reducible rfl all_goals obtain ⟨x,rfl⟩:=Nat.exists_eq_add_of_le (А:(c*(s.h+2)+r)*(s.w+2)<= q);simp only[bi c r x _ (s.w+2) O А,bQ];split_ifs<;>first | omega | with_reducible rfl | (congr 2;omega) lemma eu (A:р о) (u:т) (h:uаomega def fx (f:о-> у):Dense.F.A8:=⟨f 0,f 1,f 2,f 3,f 4,f 5,f 6,f 7⟩ lemma fy (f:о-> у) (r:о) (e:r<8):(fx f).f r=f r:=by unfold fx;interval_cases r<;>rfl @[inline] def pc (kk t:о):о:=if kk=9 then t/9 else t @[inline] def py (kk t:о):о:=if kk=9 then t/3%3 else 1 @[inline] def px (kk t:о):о:=if kk=9 then t%3 else 1 lemma fK (e t:о):py e t<=2:=by unfold py;split<;>omega lemma fJ (e t:о):px e t<=2:=by unfold px;split<;>omega lemma fI (e t g:о) (j:e=9\/e=1) (l:tsimp[pc]<;>omega abbrev fj (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 lemma tV (e g j V:о):(Dense.F.bB (λt=>pc e t*j+py e t*V+px e t) (g*e) (k9 (g*e)))в=g*e /\ ∀tpc e t*j+py e t*V+px e t) (g*e) (k9 (g*e)))[t]! =pc e t*j+py e t*V+px e t:=by rw[Dense.F.ei];exact ⟨ϣ,λt l=>by rw[AE _ _ (by simpa using l),Θ]⟩ lemma tM (e g j V:о) (m:e=9\/e=1): ∀tpc e t*j+py e t*V+px e t) (g*e) (k9 (g*e)))[t]! <= (g-1)*j+2*V+2:=λt l=>by rw[(tV e g j V).2 t l];have o:=η j (show pc e t<= g-1 by have:=fI e t g m l;omega) have p:=η V (fK e t);have q:=fJ e t;omega structure CD where s:ConvShape I:р п K:р п b:р п X:FloatArray T:р о D:ф J:ф k:о M:о L:о hh:Д Y:о kk:о hX:Xд<2^32 hK:Y*k<= Kв/\Kв<2^32 def iO:Bool:=System.Platform.target.startsWith "aarch64" structure CC (M:о) where Tz:р о Wz:FloatArray wo:о n:о 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 (ar d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x) @[inline] def eD (relu:ф) (w:п):п:=if relu&&w&&&0x80000000!=0 then 0 else w @[inline] def cg (d:CD) (o y x:о) (S:у):п:= let c:=Dense.F.ak S d.hh if h:c<4294967296 then eD d.J cл else ow d o y x S lemma ic (d:CD) (o y x:о) (S:у):cg d o y x S=ow d o y x S:=by unfold cg;dsimp only;split .rename_i g;have m:kI (Dense.F.ak S d.hh)л≠255:=by unfold Dense.F.ak at g⊢;dsimp only at g⊢;split_ifs at g⊢with e<;>[skip;exact absurd g Б];simp only[ς,AF] at e;obtain ⟨⟨⟨-,q⟩,-⟩,-⟩:=e;have:=(Dense.F.eF S.toBits).toNat_lt;have p:(S.toBits&&&0xfffffffffffff)б<2^52:=(by rw[ψ];exact Al lF Б);simp only[μ,Α,kE] at q;have m:=Dense.F.gF S.toBits А;have r:S.toBitsб/2^63<2:=(by have:=S.toBits.toNat_lt;omega);simp only[μ,kE] at g;intro j;have l:=congrArg p6 j;rw[kI,Ι,Τ,ϓ] at l;simp only[kO,kL,ε] at l;rw[γ _ 8,ν g,m] at l;omega unfold ow Dense.F.tw Dense.F.tf eD act reluW;dsimp only;rw[AO g];cases d.J<;>simp[m] .rfl @[inline] def bC (d:CD) (o y:о) (xb:т) (r:о) (S:у):п:= let c:=Dense.F.ak S d.hh if c<4294967296 then eD d.J cл else ow d o y (xbа+r) S lemma ii (d:CD) (o y:о) (e:т) (r:о) (S:у):bC d o y e r S=cg d o y (eа+r) S:=rfl @[inline] def su (a:р п) (u:т) (v:п):р п:= if h:u п) (n r q:о) (a:р п):р п:= if r kJ) (n q:о):∀m r (a b:р kJ),pl g n r q a=b-> n-r=m-> r<= n-> bв=aв /\ ∀irintro r a _ rfl o p;rw[pl,AJ А];exact ⟨rfl,λi e=>by rw[AJ А]⟩ | succ m u=> rintro r a _ rfl o p;obtain ⟨v,l⟩:=u (r+1) (a.set! (q+r) (g r)) _ rfl А А;rw[pl,AO А,v,Bu];refine ⟨rfl,λi e=>?_⟩;rw[l i (by simp[e])];rcases BR i (q+r) with rfl | j<;>[rw[nF _ _ _ e];rw[n5 _ _ _ _ j.symm]]<;>split_ifs<;>first | rfl | omega | (congr 1;omega) @[inline] def ln (d:CD) (o y:о) (xb nq q r:т) (S:у) (a:р п):р п:= if r(q+k)аDense.F.uk hk h.2.1 (by have:=h.2.2;omega) (((((((a.uset q (bC d o y xb 0 A.a0) (by have:=h.2.1;omega)).uset (q+1) (bC d o y xb 1 A.a1) (by simp only[Ξ];exact hu 1 (by simp only[AG];omega))).uset (q+2) (bC d o y xb 2 A.a2) (by simp only[Ξ];exact hu 2 (by simp only[AG];omega))).uset (q+3) (bC d o y xb 3 A.a3) (by simp only[Ξ];exact hu 3 (by simp only[AG];omega))).uset (q+4) (bC d o y xb 4 A.a4) (by simp only[Ξ];exact hu 4 (by simp only[AG];omega))).uset (q+5) (bC d o y xb 5 A.a5) (by simp only[Ξ];exact hu 5 (by simp only[AG];omega))).uset (q+6) (bC d o y xb 6 A.a6) (by simp only[Ξ];exact hu 6 (by simp only[AG];omega))).uset (q+7) (bC d o y xb 7 A.a7) (by simp only[Ξ];exact hu 7 (by simp only[AG];omega)) else iG d o y xb nq q A a lemma gl (g:о-> kJ) (n q:о):∀m r (a:р kJ),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 j l .obtain rfl:r=n:=А conv_lhs=>rw[pl,AO А,pl,AJ А] conv_rhs=>rw[pl,AJ А] rename_i e;conv_lhs=>rw[pl,AO А] rw[e (r+1) _ А А];conv_rhs=>rw[pl,AO А] lemma j9 (d:CD) (o y:о) (g e q:т) (A:Dense.F.A8) (a:р kJ) (p:qа+eаcg d o y (gа+r) (A.f r)) (min k eа) 0 qа a)=pl (λr=>cg d o y (gа+r) (A.f r)) (min (k+1) eа) 0 qа a:=by subst l;unfold ln;by_cases h:rcg d o y (jа+r) (A.f r)) (min 8 gа) 0 qа a:=by unfold a8;split .rename_i h;obtain ⟨m,v,x⟩:=h have:=κ;have p:=USize.le_iff_toNat_le.mp m;simp only[kH] at p;have e:∀k:т,kа<8->(q+k)а=qа+kа:=λk B=>Dense.ae А rw[(А:min 8 gа=8)] iterate 8 rw[iX] rw[e 1 (by simp only[kH];omega),e 2 (by simp only[kH];omega), e 3 (by simp only[kH];omega),e 4 (by simp only[kH];omega), e 5 (by simp only[kH];omega),e 6 (by simp only[kH];omega), e 7 (by simp only[kH];omega)] simp only[kH];iterate 8 rw[pl,AO А] rw[pl,AJ А];simp only[ii,ϕ,ϔ,Nat.reduceAdd];rfl have L:=j9 d o y j g q A a u;have l:=L 0 0 (by simp only[kH]) A.a0 rfl rw[Nat.zero_min,pl,AJ А] at l;unfold iG simp only[l,L 1 1 (by simp only[kH]) A.a1 rfl,L 2 2 (by simp only[kH]) A.a2 rfl, L 3 3 (by simp only[kH]) A.a3 rfl,L 4 4 (by simp only[kH]) A.a4 rfl, L 5 5 (by simp only[kH]) A.a5 rfl,L 6 6 (by simp only[kH]) A.a6 rfl, L 7 7 (by simp only[kH]) A.a7 rfl,Nat.reduceAdd] lemma l0 (e:т) (h:0 о-> о-> т-> т-> т-> Dense.F.A8-> р п-> р п) (Wz X:@& FloatArray) (Tz:@& р о) (wo n:т) (M:о) (hs:Xд<2^32/\Wzд<2^32) (hn:nа<= Tzв) (hT:∀t о-> о-> т-> т-> т-> Dense.F.A8-> р kJ-> р kJ) (g X:FloatArray) (e:р о) (j n:т) (M:о) (N:Xд<2^32/\gд<2^32) (hn:nа<= eв) (K:∀tX.data[iа+e[s]!+r]!*g.data[jа+s]!) nа tа (Dense.F.A8.f ⟨l,p,u,v,x,B,D,G⟩ r)): d6 W g X e j n M N hn K hW i L d o y Y U q a t l p u v x B D G=W d o y Y U q A a:=by induction m generalizing t l p u v x B D G A with | zero=> rw[d6,Ag λh=>by have:=β.mp h;omega];congr 1 exact jR _ _ λr H=>by rw[I r H,Dense.F.aq,AJ А] | succ m ih=> have h:t(i+(e.uget t А)е+c)а=iа+e[tа]!+cа:=λc hc=>by rw[eu,Dense.ae (by rw[J];omega),J] rw[d6,AW h];refine ih (t+1) _ _ _ _ _ _ _ _ A (by rw[Dense.ab h];omega) λr H=>?_ rw[I r H,Dense.F.aq,AO O,Dense.ab h];congr 1;interval_cases r<;>simp (disch:=(try simp only[AG]);omega) only[Dense.F.A8.f,Dense.F.ug,rx,Dense.ae (by omega:j.toNat+t.toNatd.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 gD (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:р п):р п:= d6 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 gE (d:CD) (c:CC d.M) (o y:о) (e m q i:т) (p:iа+d.M+8<= d.Xд) (l:у) (a:р kJ) (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 lV*Dense.F.dw d.b[o]!):gD a8 d c o y e m q i p l a=a8 d o y e m q (fx (en d c o y eа)) a:=by subst g;unfold gD;have:=c.h3;refine gL _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>?_;simp only[fy _ _ u,en,j,aa c.wo А,aa c.n А,Ϗ,Dense.F.f8] @[specialize] def rB (W:CD-> о-> о-> т-> т-> т-> 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:0 kJ) (u:∀g r x,g+r=x-> r<8-> x cg d o y x (en d c o y g r)=F x):∀m (g e q i:т) (a:р kJ) (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 a8 d c o y g e q i p a v)в=aв /\ ∀jintro g e q i a v hm hx U hq O<;>by_cases h:0?_⟩;rw[G j B];rotate_left have N:=l8 e l;rw[AW l];have I:=u8 g А;have J:=u8 q А;have K:=s8 e l;have e4:=u8 i А;obtain ⟨s1,L⟩:=Y (g+8) (e-8) (q+8) (i+8) _ _ А А А А (H.trans_lt O);refine ⟨А,λj B=>?_⟩;rw[L j А,G j B,I,J,K] all_goals split_ifs<;>first | rfl | omega | (congr 1;omega) | (rw[fy _ _ А];exact u _ _ _ rfl А А) all_goals rw[rB,Ag h];simp[β] at h;exact ⟨rfl,λj _=>by rw[AJ А]⟩ @[specialize] def cC (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:y y(q:о)->(i:т)-> iа=o+y*Vа-> р kJ-> р kJ) (u N:о) (G:о-> kJ) (B:∀y (l:y aв=N->(f y l q i g a)в=aв /\ ∀j y<= h-> q=u+y*e-> aв=N->(cC h e V o v f y q i g a)в=aв /\ ∀j intro y q i g a F l r _;obtain rfl:y=h:=А;rw[cC,Ag А];exact ⟨rfl,λj _=>by rw[AJ А]⟩ | succ m H=> intro y q i g a F _ r p;have l:yby rw[A j А,x j D];split_ifs<;>first | rfl | omega⟩ @[specialize] def ej (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 cC 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 ik (d:CD) (c:CC d.M) (o q:о) (m:у) (a:р kJ) (N:о) (G:о-> kJ) (p:∀y l=q+y*d.s.w-> eв=N->(rB a8 d c o y 0 d.s.wе lе i m e v)в=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д):(ej a8 d c o q m a)в=aв /\ ∀jp y H l i e _ (by rw[B,Dense.aa F]) u r) _ 0 q _ _ a rfl (l4 _) (by simp) x .rw[Ag g,Nat.eq_zero_of_not_pos (mt A g)];exact ⟨rfl,λj _=>by rw[m3,ϕ,AJ А]⟩ lemma fc (A:р о) (i:т) (v:о) (h:iаsimp[*,AE] def da (K:р п) (T:р о) (M:о) (ok k:т) (hK:okа+kа<= Kв/\Kв<2^32) (hT:∀tby rw[Dense.ab hc'] at hj;rw[fc _ _ _ _ _ А];split .rw[eu];exact hT _ ht .exact hz j А) else ⟨Tz,Wz,0,cа,А,А,А,hz,А⟩ termination_by kа-tа decreasing_by all_goals (have:=β.mp h;rw[Dense.ab h];omega) def NZ (K:р п) (T:р о) (ok t c:о) (Tz:р о) (Wz:FloatArray):Prop:= c<= t /\ ∃ix:о-> о, (∀j ℝ,(∀s z s=0)-> ∑j∈range c,z (ix j)=∑s∈range t,z s lemma eV (K:р kJ) (T:р о) (M:о) (g k:т) (o:gа+kа<= Kв/\Kв<2^32) (H:∀t kа-tа=m-> NZ K T gа tа cа Tz Wz-> C.Tzв=kа/\C.Wzд=kа/\C.wo=0/\NZ K T gа kа C.n C.Tz C.Wz:=by intro m;induction m with | zero=>rintro t c Tz Wz hs hc hz _ rfl J h;rw[da,Ag (by rw[β];omega)];rw[(А:tа=kа)] at h;exact ⟨hs.1,hs.2,rfl,h⟩ | succ m D=> rintro t c Tz Wz hs hc hz _ rfl J ⟨I,F,p,e⟩;have l:t(p j q).imp (λ_=>А) id,λz h=>by rw[x,Λ,h tа А B,BC];exact e z λs _ l=>h s А l⟩ .refine D (t+1) (c+1) _ _ _ _ _ _ rfl А ⟨А,λj=>if j?_,λz v=>?_⟩ .rw[fc _ _ _ _ _ А,ff _ _ _ _ _ А];dsimp only;split_ifs<;>first | omega | exact (p j ‹_›).imp (λ_=>А) id | exact ⟨А,eu ..,by rw[A]⟩ .rw[G,x,Λ,Λ,<- e z λs _ h=>v s А h];dsimp only;rw[AJ (Ay _)];congr 1;exact Ο rfl λj q=>by rw[AO (mr q)] lemma ef (d:CD) (o:о) (g:oby simp at hj) abbrev CP (d:CD) (c:CC d.M) (o:о):Prop:= c.Wzд<2^32 /\ ∃ix:о-> о,c.n<= d.k /\ (∀j ℝ,(∀s z s=0)-> ∑j∈range c.n,z (ix j)=∑s∈range d.k,z s lemma hO (d:CD) (B:∀tby simp at F,λz _=>rfl⟩;simp only[x,A] at m p l g e;exact ⟨m,p,c.h5,H,l,by simpa[r] using g,e⟩ def g7 (d:CD) (Z:ф) (Wd:FloatArray) (hT:∀t eд=d.Y*d.k /\ ∀q⟨x,rfl,(g rfl).2 (o*d.k+j) А⟩,λz _=>rfl⟩ .unfold g7;rw[AW rfl];exact (hO _ _ _ _ _ _ _ _ _ _ rfl).2.2 @[inline] def ct (d:CD) (c:CC d.M) (o q:о) (a:р п):р п:= if iO then ej iF d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else ej a8 d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a def cV (d:CD) (hT:∀t kJ) (F:∀o q=o*(d.s.h*d.s.w)-> aв=N->(ct d c o q a)в=aв /\ ∀j q=o*(d.s.h*d.s.w)-> aв=N->(cV d u e v o q g l p a)в=aв /\ ∀jintro o q g l p a I x _;rw[cV,Ag А];have:=η (d.s.h*d.s.w) (А:d.Y<= o);exact ⟨rfl,λj _=>by rw[AJ А]⟩ | succ m J=> intro o q g l p a I x A;have r:oby rw[D j А,B j H];split_ifs<;>first | rfl | omega⟩ lemma im (s:lJ) (I:р kJ) (g:о) (q:fj s g) (y x t e:о) (u:ysimp only[mH,bQ,pc,py,px,j,l,m,o,↓reduceIte,(Б:(1:о)≠9),ϭ,Nat.reduceMul,qc,qd,ϕ,BV,ni,(А:(e*9+t)/9=e+t/9),(А:(e*9+t)/3%3=t/3%3),(А:(e*9+t)%3=t%3)] at p⊢<;>split_ifs<;>first | rfl | omega lemma jQ (s:lJ) (I:р kJ) (e:о) (g:∀q:о,kI I[q]!≠255/\kM I[q]! <= e) (y x t:о):kI (mH s I y x t)≠255/\kM (mH s I y x t)<= e:=by unfold mH;dsimp only;split .exact ⟨Б,by rw[(Б:kM (0:kJ)=0)];exact l4 _⟩ .exact g _ def XT:р FloatArray:=Aw (n:=10) λk=>⟨AP (2^(kз+7)) (Dense.F.dw 0)⟩ def xT (n:о):FloatArray:= let k:=A0 n+1-7 if k<10 then XT[k]! else ⟨AP n (Dense.F.dw 0)⟩ lemma dj (n:о):n<=(xT n)д/\((xT n)д=n\/(xT n)д<=2^16) /\ ∀q<(xT n)д,(xT n).data[q]! =Dense.F.dw 0:=by have g:∀m q,q< m->(⟨lR m (Dense.F.dw 0)⟩:FloatArray).data[q]! =Dense.F.dw 0:=λm q h=>by simp[AE,h] unfold xT;dsimp only;split .rw[AE XT _ (by simp[XT];omega)] simp only[XT,Θ,kR,Υ] exact ⟨(ώ (n:=n)).le.trans (Ζ Б А), .inr (Ζ Б А),λq e=>g _ q e⟩ .refine ⟨?_,.inl ?_,λq e=>g _ q ?_⟩<;>simp_all[kR] lemma dh (s:lJ) (j:(s.cin*(s.h+2)+3)*(s.w+2)<2^32): s.wеа=s.w/\(s.w+2)еа=s.w+2/\RV s 0 0 0 0 (xT ((s.cin*(s.h+2)+3)*(s.w+2)))д:=by have:=κ;have e:s.w+2<=(s.cin*(s.h+2)+3)*(s.w+2):=mf _ А;obtain ⟨g,l,-⟩:=dj ((s.cin*(s.h+2)+3)*(s.w+2));exact ⟨Dense.aa А,Dense.aa А,А,⟨0,by simp,by simp⟩,by simp,g,А⟩ def xF (s:ConvShape) (I:р п) (hs:Iв<2^32) (hI:s.cin*s.h*s.w<= Iв) (hN:(s.cin*(s.h+2)+3)*(s.w+2)<2^32):FloatArray:= cW I s hs hI s.wе (s.w+2)е (dh s hN).1 (dh s hN).2.1 (s.cin*(s.h+2)) rfl 0 0 0 0 (xT ((s.cin*(s.h+2)+3)*(s.w+2))) (dh s hN).2.2 lemma di (s:lJ) (I:р kJ) (j:Iв<2^32) (g:s.cin*s.h*s.w<= Iв) (e:(s.cin*(s.h+2)+3)*(s.w+2)<2^32): (s.cin*(s.h+2)+3)*(s.w+2)<=(xF s I j g e)д/\(xF s I j g e)д<2^32 /\ ∀q<(xF s I j g e)д,(xF s I j g e).data[q]! =Dense.F.dw (bQ s I (q/((s.h+2)*(s.w+2))) (q/(s.w+2)%(s.h+2)) (q%(s.w+2))):=by obtain ⟨m,p,o⟩:=dj ((s.cin*(s.h+2)+3)*(s.w+2));have:=eJ I s j g _ _ (dh s e).1 (dh s e).2.1 _ rfl _ 0 0 0 0 _ (dh s e).2.2 _ rfl rfl λq l=>by simp[o q l] rw[xF,this.1];exact ⟨m,А,this.2⟩ lemma gC (h w e l m y o g V:о) (A:V=w+2) (j:g=(h+2)*V) (q:y о) (hs:fj d.s d.kk) (a3:0 ℝ,(∀s z s=0) -> ∑j∈kG c.n,z (N j)=∑s∈kG d.k,z s) (S:у) (hS:S=Dense.F.aq (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) c.n 0 (Dense.F.dw lV*Dense.F.dw d.b[o]!)): cg d o y x S=act d.J (ar d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x):=by have a1:=hc o ho;have hB:=gC d.s.h d.s.w d.s.cin p _ y x _ _ rfl rfl hy l a1 a3;have g:=Dense.F.dc lV d.b[o]! Б (hb _).1;have G:=(Dense.F.cL lV d.b[o]! 126 O Б (hb _).2).trans (AB Az (by omega:_<= P)) simp only[ic,hS,ow,ar,Dense.F.gg,Dense.bT];generalize (if d.D then o else 0)=H at* generalize hq:H*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+x=q at* have W:=jQ d.s d.I U hx y x;have E:=λu v=>(Dense.F.cL (mH d.s d.I y x u) d.K[v]! _ _ (W _).2 (hw _).2).trans (AB Az as) have V:=λu v=>Dense.F.dc (mH d.s d.I y x u) d.K[v]! (W _).1 (hw _).1 have hX:∀tby obtain ⟨q1,q2,q3⟩:=bi (H+pc d.kk t) (y+py d.kk t) (x+px d.kk t) (d.s.h+2) (d.s.w+2) (by have:=fK d.kk t;omega) (by have:=fJ d.kk t;omega) rw[a0 _ (by have:=hT t m;omega),show q+d.T[t]! =((H+pc d.kk t)*(d.s.h+2)+(y+py d.kk t))*(d.s.w+2)+(x+px d.kk t) by rw[<- hq,aL t m];ring,q1,q2,q3,im d.s d.I d.kk hs y x t _ hy l (by have:=fI d.kk t p (hs.imp (·.2.2.2.2) (·.2.2.2.2)) (a2 ▸ m);omega)] obtain ⟨fS,eS⟩:=Dense.F.df _ _ _ _ _ rfl ▸ Dense.F.de (λ_=>false) (λj=>d.X.data[q+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) _ _ P d.L c.n (λj l=>by obtain ⟨i1,i2,i3⟩:=A j l;rw[i2,i3,hX _ i1];exact V _ _) (λ_ _=>nofun) (λj _=>E _ _) G А e А c.n 0 _ rfl c.n.zero_le g.1 (by simp[g.2]) refine Dense.F.jC _ _ _ _ _ _ _ _ _ _ (λt m=>?_) (by simpa using g) (λt _=>?_) (λt _=>?_) hL e aH r rfl _ fS (Eq.trans_le ?_ (eS.trans ?_)) .simp only[AO m,hX t m];exact V _ _ .split;exacts [⟨(W _).1,(hw _).1⟩,⟨Б,(hb _).1⟩] .split;exacts [E _ _,G] .rw[az,ai];push_cast;rw[<- B] .simp only[Ay,if_false];rw[add_comm];congr 3 exact Ο rfl λj l=>by simp[(A j (mr l)).1] .exact λs a4 h0=>by simp[a4,tm,sv,<- al,h0] calc _<=(2:ℝ)^d.L*(2^(P+d.L)*2^(-54:с)):=by gcongr;exact_mod_cast (by omega:c.n<=2^d.L) _=_:=by rw[r,<- AD,<- AD,<- AT AR,<- AT AR];congr 1;omega def gI (d:CD) (Z:ф) (Wd:FloatArray) (hT:∀tct d (g7 d Z Wd hT hk hkT hW hY o ho) o q a) 0 0 0 (by simp) (AP (d.Y*(d.s.h*d.s.w)) 0) lemma oE {A a:р kJ} {M N} {G:о-> kJ} (h:Aв=aв /\ ∀j?_;have:=h.2 i (h.1 ▸ e);simp only[ϣ] at g;rw[AE A i e,AO ⟨l4 _,g⟩] at this;simp[this] lemma gJ (d:CD) (Z:ф) (m:FloatArray) (hW:Z=true\/d.Y*d.k<= mд/\mд<2^32) (H IX IW IB P:о) (hs:fj d.s d.kk) (B:0 mд=d.Y*d.k /\ ∀qact d.J (ar 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 have hf:∀o q=o*(d.s.h*d.s.w)-> aв=d.Y*(d.s.h*d.s.w)->(ct d c o q a)в=aв /\ ∀j?_) O А λbw=>by have bv:=gC d.s.h d.s.w _ H _ (d.s.h-1) (d.s.w-1) _ _ rfl rfl А А (hc o l) B;omega have:=ml d.s.w hy;have e1:=aa d.s.w А;have e2:=aa N А;have e:(o*d.s.h+y)*d.s.w=N:=by rw[mG,Ϩ,bd,hq] obtain ⟨s,g⟩:=iS d c o y _ rfl _ (λxb r x e h2 h3=>jK _ _ _ _ _ _ _ _ hs B a7 hc hM aL hT u a1 hx hw hb U as hL p aH a4 o y x l hy h3 a3 a5 G _ (by subst e;unfold en;congr 1;funext t;congr 2;omega)) _ 0 _ Nе _ a' hI AS (by simp[e1]) (by simp[hi]) А А refine ⟨s,λi hi=>?_⟩;rw[g i hi,e1,e2];refine ite_congr rfl (λa2=>?_) λ_=>rfl;obtain ⟨q1,q2,q3⟩:=bi o y (i-N) d.s.h d.s.w hy А;rw[e,Nat.add_sub_of_le a2.1] at q1 q2 q3;simp only[q1,q2,q3,Ϗ,ϔ] unfold gI;split .exact oE (gK _ _ _ _ _ _ hf _ 0 0 _ _ _ _ rfl (by simp) (by simp)) (by simp) rfl .exact oE (ed _ _ _ _ _ _ 0 _ _ (λo l q _ _ a hq O=>hf o l q a _ (eT _ _ _ _ _ _ _ _ a0 o l _ rfl) А O) _ 0 0 0 _ _ rfl (by simp) (by simp) (by simp)) (by simp) (ϔ _) lemma jE (K:р kJ) (n:о):(Dense.F.bf (λq=>Dense.F.dw K[q]!) n (kP n))д=n /\ ∀qDense.F.dw K[q]!) n (kP n)).data[q]! =Dense.F.dw K[q]!:=by obtain ⟨g,-,j⟩:=Dense.F.bE (λq=>Dense.F.dw K[q]!) n _ (kP n) rfl (by simp[kP,kR]) exact ⟨g,λq e=>j q (by simp[kP,kR]) e⟩ def wd (Z:ф) (K:р п) (n:о) (hn:n<2^32) (hK:n<= Kв) (hs:Kв<2^32): {W:FloatArray // Z=true\/n<= Wд/\Wд<2^32}:= if hZ:Z=true then ⟨Ad 0,BX hZ⟩ else ⟨Dense.F.bf (λq=>Dense.F.dw K[q]!) n (Ad n),Or.inr (by rw[(jE K n).1];omega)⟩ lemma kD (K:р kJ) (n:о) (g:n<2^32) (e:n<= Kв) (j:Kв<2^32): (wd false K n g e j).1д=n /\ ∀qpc kk t*HV+py kk t*V+px kk t) k (Ac k) if hg:fj s kk/\0h.2.2.2.2) (λh=>h.2.2.2.2)) let Z:=K.any λu=>Core.mW u==0 let W:=wd Z K (Y*k) hY32 hYK hKs gI ⟨s,I,K,b,xF s I hIs hI hX32,T,D,J,k,M,L,(P+2*L-54)и,Y,kk, (di s I hIs hI hX32).2.1,⟨hYK,hKs⟩⟩ Z W.1 hT hk32 hkT W.2 hY32 else dS s J I K b D lemma d5 (s:lJ) (J:ф) (I K b:р kJ) (D:ф) (j Y:о) (U:D=false/\j=s.cin/\Y=s.cout\/D=true/\j=1/\Y=s.cin):fe s J I K b D j Y=dS s J I K b D:=by unfold fe bJ;dsimp only;split;swap;rfl;rename_i hg;obtain ⟨hs,-,a1,x,v,u,r,as,N,l,m,a0,e,-,g,X,hI,O,p⟩:=hg;dsimp only;obtain ⟨L,M⟩:s.ho=s.h/\s.wo=s.w:=by rcases hs with ⟨A,B,G,H,-⟩ | ⟨A,B,G,H,-⟩<;>simp[Bl,Bk,A,B,G,H]<;>omega obtain ⟨aH,-,aL⟩:=di s I l hI e;have:=κ;rw[gJ _ _ _ _ j _ _ _ _ ‹_› x (by rfl) (λo ho=>by rcases U with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp<;>omega) (by rfl) (by exact (tV _ _ _ _).2) (by exact tM _ _ _ _ (hs.imp (·.2.2.2.2) (·.2.2.2.2))) (by exact (tV _ _ _ _).1.ge) ‹_› ‹_› ‹_› ‹_› (λhZ=>by dsimp only;rw[hZ];exact kD K _ g p m) (by exact Dense.F.cw I А v) (by exact Dense.F.cw K А u) (by exact Dense.F.cw b А r) (le_max_left _ _) (le_max_right _ _) (by exact ώ) ‹_› ‹_› (by dsimp only;rw[mN,Χ (by simp only[lZ];omega)]) ‹_› ‹_›];rcases U with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp only[dS,fT,AX,AN,np,conv2dWith,depthwiseSpec,depthwiseWith,L,M]<;>refine lI (by simp[L,M]) λq _ _=>?_<;>simp only[ao,Θ,ar,Dense.bT,Ϩ,Nat.one_mul,m3,ϔ] @[inline] def rs:ConvShape:= if s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\0act J (m9 (s.cin+1) (λt=>if tif t?_ simp only[Θ,m,o,e,g,ϭ];congr 2;funext t;split_ifs<;>[skip;rfl];have:=ϝ (q/s.w) p;have:=ϝ q r;simp only[mH,e,g,j,l,ϭ,qc,qd,ϕ,BV];rw[AJ А,Ϛ s.h s.w,Nat.mod_mul];congr 1;ring lemma iT:np (rs s) J I K b=np s J I K b:=by unfold rs;split .obtain ⟨j,l,m,o,e,p⟩:=‹_/\_›;have g:0[skip;split<;>[skip;rfl]];all_goals rw[c1 s J I K b j l m o e g,c1 _ J I K b ‹_› ‹_› ‹_› ‹_› (by dsimp only;omega) (by exact Nat.succ_pos _),Nat.div_mul_cancel А] rfl def d0:р п:= fe (rs s) J I K b false (rs s).cin (rs s).cout def ce:р п:= fe s J I K b true 1 s.cin lemma d4:d0=np:=by funext s J I K b;rw[<- iT];exact d5 (rs s) J I K b false (rs s).cin (rs s).cout (.inl ⟨rfl,rfl,rfl⟩) lemma cu:ce=depthwiseSpec:=by funext s J I K b;exact d5 s J I K b true 1 s.cin (.inr ⟨rfl,rfl,rfl⟩) lemma aS:(kI u)г=uг/2^23%256:=by unfold kI rw[Ι,Τ,show (255:Е)г=2^8-1 from rfl, γ] simp[ε] lemma aF:(l9 u)г=uг%2^23:=by unfold l9;rw[Ι,show (8388607:Е)г=2^23-1 from rfl,γ] 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 iJ:Kf m<2^(m/2^23+23):=by unfold Kf;split_ifs with h .rw[h];omega .have:=ϴ (А:2^23+m%2^23<2^24) (lN (m/2^23-1));rwa[<- AM,(А:24+(m/2^23-1)=m/2^23+23)] at this lemma cR (g e:о) (h:g[omega;exact ϴ А В] .have:=iJ g;have:2^(e/2^23+22)<= Kf e:=by unfold Kf;rw[AJ А,AJ А,(А:e/2^23+22=23+(e/2^23-1)),AM];exact η _ А have:=Ζ BA (А:g/2^23+23<= e/2^23+22);omega def kv (w:п):с:=sv w*2^idxOf w lemma gX: kv u=if 2^31<= uг then-(Kf (uг%2^31):с) else (Kf (uг%2^31):с):=by unfold kv sv;rw[show Kf (uг%2^31)=kU u*2^kM u by unfold kU kM Kf;rw[(by rw[aS];omega:u.toNat%2^31/2^23=(expOf u).toNat),(by rw[aF];exact Nat.mod_mod_of_dvd _ Б:u.toNat%2^31%2^23=(fracOf u).toNat)];simp only[<- χ,Ϧ]];simp only[<- ag];split_ifs<;>push_cast<;>ring lemma bS: (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;unfold sk;split_ifs<;>simp_all[Ν,<- χ,nN]<;>omega lemma fW (a b:Е) (h:sk aomega lemma gH:Model.cmpDyadic (n0 y) (n0 z)=compare (kv y) (kv z):=by have e:∀w,(n0 w).toReal=(kv w:ℝ)*2^(-149:с):=λw=>by rw[<- ϋ,nE];unfold kv;push_cast;rw[A5 AR,AD];ring have g:(0:ℝ)<2^(-149:с):=zpow_pos BA _;cases h:compare (kv y) (kv z) .rw[Model.cmpDyadic_lt_iff,e,e];exact Ai (by exact_mod_cast compare_lt_iff_lt.mp h) g .rw[Model.cmpDyadic_eq_iff,e,e,compare_eq_iff_eq.mp h] .rw[Model.cmpDyadic_gt_iff,e,e];exact Ai (by exact_mod_cast compare_gt_iff_gt.mp h) g lemma bV (g:kU u=0):u=0\/u=0x80000000:=by have l:=u.toNat_lt;unfold kU at g;split_ifs at g with j .have e:=aS u;have m:=aF u;rw[j] at e;rw[<- χ,<- χ];simp at e⊢;omega .omega lemma bt:pb (mx y z)=BK (pb y) (pb z):=by unfold mx;split .rename_i h;have g:=kT y h.1;have j:=kT z h.2.1 unfold BK;rw[Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff (pb y) (pb z)).2 ⟨ϻ g,ϻ j⟩),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ (gH y z ▸ Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ g j)];rcases h.2.2 with e | e | rfl .rw[AO e,compare_lt_iff_lt.mpr (fW y z e)] .rw[AJ (Bi e),compare_gt_iff_gt.mpr (fW z y e)] .rw[AJ (UInt32.lt_irrefl _),compare_eq_iff_eq.mpr rfl] by_cases l:kU y=0 .rcases bV y l with rfl | rfl<;>decide .simp[show Model.isZero (pb y)=false by unfold pb;rw[Model.isZero_eq_beq_zero_of_toDyadic?_some g,decodeD_sig_zero];simpa using l] .exact aJ _ lemma iz: qe (lD u:Model pn)=u:=by show Bh (lD u:Model pn).bits=u;rw[pK] lemma aK (e:kI u≠0): n0 u=⟨kX u,2^23+(l9 u)г,((kI u)г:с)-150⟩:=AJ e lemma ek:kZ (m*2^23) (2^23)=m:=by unfold kZ;simp lemma bL (e:r=0\/r=0x80000000) (g:kI d≠0) (j:kI d≠255) (l:kX d=false): lf (Av (pb r) (pb d))=r:=by have m:n0 r=⟨kX r,0,0⟩:=by rcases e with rfl | rfl<;>rfl rw[nT];unfold ql pb;rw[kT r (by rcases e with rfl | rfl<;>decide),kT d j,aK d g,l,m] simp;rcases e with rfl | rfl<;>rfl abbrev av:п:=toWord (Av (ofW (dotOf n fa λ_=>oneW)) (ofW d)) lemma gc (p:DQ d):eH r d=lf (Av (pb r) (pb d)):=by obtain ⟨v,F,g⟩:=p;replace g:=mO g;unfold eH;dsimp only;split .obtain ⟨D,o,m,j⟩:=‹_/\_›;replace j:=mO j;replace m:=Ν.mp m have l:(kI d)г=(kI d-127)г+127:=by rw[n6 _ _ o];have:=UInt32.le_iff_toNat_le.mp o;simp at this⊢;omega generalize kI d-127=q at*;symm;have K:=aS r;have L:=aF r;have o:(kI r)г≠255:=λh=>j (χ.mp (by simpa using h)) have M:=fracOf_toNat_lt r;rw[nT];unfold ql pb rw[kT r j,kT d g,aK r λh=>by simp[h] at m,aK d λh=>by simp[h] at l, D,v] have x:((2:о)^23==0)=false:=Б;have A:(2^23+(l9 r)г==0)=false:=by simp simp only[Ϧ,ϕ,Bool.xor_false,x,A,fT,AN];erw[<- nU,bg];unfold pM;rw[show ld (2^23+(l9 r)г) (2^23)=0 by unfold ld;rw[(by rw[lP А];constructor<;>omega:A0 (2^23+(fracOf r).toNat)=23),Nat.log2_two_pow];simp[m7,nr,Β]<;>omega];simp only[x,A,fT,AN,An,BQ];rw[AJ А,AJ А,AJ А] rw[show ((23:с))=Int.ofNat 23 from rfl, mI] simp only[show ∀a,Nat.shiftLeft a 23=a*2^23 from λa=>Β a 23,ek];have J:((2^23+(l9 r)г:о)==qm 24)=false:=by simp[qm];omega simp only[J,fT,AN];rw[AJ А];set e:=r-(q<<<23) with p;have B:(q<<<23)г=qг*2^23:=by rw[ϯ];simp[Β];omega have u:eг=rг-qг*2^23:=by rw[p,n6 _ _ (by rw[n4,B];omega),B] rw[<- pu,<- iz e,ofUInt32_eq_ofFields];have G:kX e=kX r:=by rw[Ϥ,ag,ag,u];omega have H:(kI e)г=(kI r)г-qг:=by rw[aS e,u];omega have I:(l9 e)г=(l9 r)г:=by rw[aF e,u];omega rw[G,H,I,(А:Int.toNat _=(kI r)г-qг),(Б:qm 23=2^23),ϐ];rfl split .exact (bL r d (by rename_i h;have N:=r.toNat_lt;have l:=congrArg p6 h;rw[Ι,show (0x7FFFFFFF:Е)г=2^31-1 from rfl,γ] at l;rw[<- χ,<- χ];simp at l⊢;omega) F g v).symm rfl lemma gf (g:о-> Д) (m:о):∀e:Д, Z ((n3 m).foldl (λe t=>e+g t) e)=Z e+∑t∈kG m,Z (g t):=by induction m with | zero=>simp | succ m j=> intro e;rw[mP,mi,lS,pv,dl,j,Λ];ring lemma iw:af 0=0:=rfl lemma go: (decide (kU u*kU lV=0)&&Bool.xor (kX u) (kX lV))=(u==0x80000000):=by by_cases e:kU u=0 .rcases bV u e with rfl | rfl<;>decide .simp[(Б:kU lV=2^23),(Б:kX lV=false),e];rintro rfl;exact e Б lemma du (c:о):∀i,i+c<= n -> (po (la (n:=n) λj=>fa jз) (la (n:=n) λ_=>lV) i c=true↔ ∀t,i<= t-> t< i+c-> fa t=0x80000000):=by induction c<;>intro i o .simp[po];intros;omega rename_i m;rw[po,ac n fa i А,ac n (λ_=>lV) i А,go,ς,m (i+1) А,AQ] exact ⟨λ⟨e,g⟩ t l p=>l.eq_or_lt.elim (. ▸ e) λh=>g t h А,λh=>⟨h i AS А,λt e g=>h t А А⟩⟩ lemma ez (w k U m:о) (e:0 Д) (L M:с) (T:∀t ф) (I:g ()=true↔∀t kJ) (u:p ()=m9 n fa λ_=>lV) (d:kJ) (m:DQ d): wo B A H g p d=av n fa d:=by have o:=λt e=>db c B (fa t) x G (q t e) have K:=abs_le.mp ((Ϣ _ _).trans ((Ϸ λt e=>(T t (mr e)).2.1).trans (by simp:_<=(n:ℤ)*L)));have N:=abs_le.mp ((Ϣ _ _).trans ((Ϸ λt e=>(T t (mr e)).2.2).trans (by simp:_<=(n:ℤ)*M))) have F:ai n fa (λ_=>lV)=(af H*2^25+af A)*2^(Bб+149):=by rw[sZ A (∑t∈kG n,af (l (fa t))) (by simp[v,gx]) (by linarith) (by linarith), sZ H (∑t∈kG n,af (j (fa t))) (by simp[D,gx]) (by linarith) (by linarith), ϟ,<- ϛ,ϟ] refine Ο rfl λt e=>?_ rw[(T t (mr e)).1];unfold tm d9;rcases (o t (mr e)).2 with r | ⟨q,-⟩ .simp[dg _ r] rw[(Б:sv lV=2^23),(Б:kM lV=126),Am,Am,<- AM,<- AM];congr 2;omega unfold wo av;split .rw[bL _ d ?_ m.2.1 (mO m.2.2) m.1]<;>rw[aR n fa _ λt e=>⟨(o t e).1,Б⟩,show ai n fa (λ_=>lV)=0 by simp[*,iw]]<;>simp[mv,J.ne',du n fa n 0 А,I] exact or_iff_not_imp_right.2 λh=>by simpa using h .rw[gc _ d m,Dense.cP,dA];refine congrArg (λs=>lf (Av (pb s) (pb d))) ?_;split .refine (aQ n fa _ _ _ _ (λt e=>⟨(o t e).1,Б⟩) ?_ ‹_›).symm rw[F,ey,ι,mo (by simp;omega)];rfl .exact u lemma fZ (c:Д) (x:kJ) (g:Bб<=255) (p:cб<=37) (h:ok c B x=true): af 0*2^25+af (t1 B x)=d9 Bб x /\ |af (t1 B x)| <= 2^(24+cб)-1 /\ |af 0| <= 0:=by obtain ⟨-,e | ⟨m,o,l⟩⟩:=db c B x g А h .simp[t1,sg,(ξ.mp (by rw[al,e];rfl):mW x=0),d9,dg x e,iw,Aa] have j:=me x;have:kU x*2^(kM x-Bб)<2^(24+cб):=(by rw[AM];exact ns j (Ζ Г А) В);have:2^(24+cб)<=2^61:=Ζ Г А unfold t1 d9 sv;rw[iw,iV]<;>rw[Ε,al,l,Β,mo (a:=kM x-Bб) А,mo А] .cases kX x<;>simp only[fT,AX,AN,neg_mul,abs_neg]<;>refine ⟨by push_cast;ring,?_,by simp⟩<;> rw[Ao В]<;>exact Int.le_sub_one_of_lt (by exact_mod_cast ‹_<2^(24+c.toNat)›) omega lemma cr: dq Q (fa 0) (fa 1) (fa 2) (fa 3)=true↔∀t<2*2,Q (fa t)=true:=by simp only[dq,ς];refine ⟨λ⟨⟨⟨a,b⟩,c⟩,e⟩ t g=>by interval_cases t<;>assumption,λH=>⟨⟨⟨H 0 ?_,H 1 ?_⟩,H 2 ?_⟩,H 3 ?_⟩⟩<;>decide lemma gN:(eF u)б=(kI u)г:=by unfold eF kI;simp lemma gV (x:kJ):aO x<=255:=by unfold aO;split .rw[θ,aw];unfold kM;have:=na x;split<;>simp<;>omega .decide lemma mn (a b:Д):(min a b)б=min aб bб:=UInt64.toNat_min _ _ lemma c8 (a b:Д):min a b<= a:=θ.mpr (by rw[mn];omega) lemma fz (a b:Д):min a b<= b:=θ.mpr (by rw[mn];omega) lemma fC (a b:Д):a<= max a b:=by show a<= if a<= b then b else a;split<;>simp_all lemma fG (a b:Д):b<= max a b:=θ.mpr (by rw[UInt64.toNat_max];omega) lemma cq (x:kJ) (B M:Д) (j:B<= aO x) (q:eF x<= M) (o:M<= min (B+37) 254) (m:B<=255):ok 37 B x=true:=by have l:=gN x;have g:=aw x;have r:=na x;simp only[θ,mn,ι,kE] at q o m;simp only[ok,ς,AV,A4,lQ,AQ];refine ⟨λe=>by rw[e] at l;simp at l;omega,(em _).imp id λp=>?_⟩ unfold aO at j;rw[AO (by simpa using p),θ,g] at j apply decide_eq_true;rw[θ,Η _ _ (θ.mpr (by rw[g];omega)),g] unfold kM at j⊢;split<;>simp<;>omega lemma gz (v:DQ d) (g y x:о) (e:т) (A:eа=(g*h+y*2)*w+x*2) (D:(g*h+y*2)*w+x*2+w+1<2^31): gy h w I d g y x e=av (2*2) (poolAt h w 2 I g y x) d:=by have q:=cF h w 2 I g y x;have l:=q 0;have m:=q 1;have o:=q 2;have p:=q 3;simp only[Nat.reduceDiv,kL,zero_mul,Aq,BC] at l m o p;have:=bn;unfold gy;dsimp only;split swap;. rfl simp (disch:=omega) only[ev,ϒ,Ϙ,aa,mo,A,l,m,o,p];split .rename_i j;refine (λu r=>f5 _ _ _ 37 _ _ (dU u) Б Б r _ (λ_=>0) _ 0 (λt B=>fZ _ _ _ (dU u) Б (r t B)) Б Б (by simp[dl,Λ]) (by simp[bH]) _ (by rw[cr];simp only[AQ]) _ rfl d v) ?B ((cr _ _).1 ?_) .exact ό (ό (c8 _ _) (c8 _ _)) (gV _) simp only[dq,ς];exact ⟨⟨⟨cq _ _ _ (ό (c8 _ _) (c8 _ _)) (ό (fC _ _) (fC _ _)) j ?B,cq _ _ _ (ό (c8 _ _) (fz _ _)) (ό (fG _ _) (fC _ _)) j ?B⟩,cq _ _ _ (ό (fz _ _) (c8 _ _)) (ό (fC _ _) (fG _ _)) j ?B⟩,cq _ _ _ (ό (fz _ _) (fz _ _)) (ό (fG _ _) (fG _ _)) j ?B⟩ .rfl lemma gm (B:Д) (g:т) (p:gа<= Iв):∀m (e:т) (l:Д),gа-eа=m-> dO I B g p e l=(n3 m).foldl (λa j=>a+t1 B I[eа+j]!) l:=by intro m;induction m<;>intro e l r<;>rw[dO] .rw[Ag (by rw[β];omega)];rfl rename_i q;have h:esimp<;>omega lemma eG:dr=avgpoolSpec:=by funext c h w k I;unfold dr;dsimp only;split .obtain ⟨g,e,u,A,r⟩:=‹_/\_›;split .obtain ⟨rfl,G⟩:=‹_/\_›;rw[fu _ _ _ _ _ _ _ e,Ϩ];unfold avgpoolSpec refine lI (by simp[pz]) λq m _=>?_ simp only[ao,Θ,pz,ϣ] at m⊢;have B:=(ϳ (nz e u)).mpr m;have:=ϝ (q/(w/2)) e;have:=ϝ q u;have v:q/(h/2*(w/2))*h+q/(w/2)%(h/2)*2+1<= c*h:=by have:=η h B;rw[Μ] at this;omega have x:=η w v;rw[Ρ] at x;refine gz h w I _ r _ _ _ _ ?_ А rw[show (2:т)=USize.ofNat 2 from rfl,<- USize.ofNat_mul,<- Bs,Ϛ 2, <- pr,aa _ А] .have p:=jI _ A;split<;>unfold iy avgpoolSpec<;>rw[AO e,fu _ _ _ _ _ _ _ e,Ϩ]<;>refine lI (by simp[pz]) λq m F=>?_<;>simp only[ao,Θ,pz] on_goal 2=>split on_goal 3=>rfl on_goal 1=>simp only[gi] all_goals rename_i j;refine (λo=>f5 _ _ _ (cK (k*k)) _ _ (dU j.1) А (nz g g) o _ (λ_=>0) _ 0 (λt D=>fZ _ _ _ (dU j.1) p.1 (o t D)) p.2 (by simp) (by rw[cs,iD _ _ _ _ _ _ _ g,gf,bH,An];simp only[cF]) (by simp[bH]) _ (by simp only[ez _ _ _ _ _ _ g,cF,AQ]) _ rfl _ r) ?_ exacts [λt _=>(em _).elim (λl=>by unfold poolAt;rw[AE I _ l];exact Array.all_eq_true.mp j.2 _ l) λl=>by unfold poolAt;rw[BD I _ l];rfl,by simpa only[cF] using (ez _ _ _ _ _ _ g).1 j.2] .rfl @[inline] def ky (u:п):Е:=if u<0x80000000 then u+0x80000000 else 0xFFFFFFFF-u @[inline] def bM (a b:п):п:=if ky asimp_all[Ν,lH,nN]<;>omega lemma gW (a b:kJ):(ky (bM a b))г=max (ky a)г (ky b)г:=by unfold bM;split<;>rename_i h<;>rw[Ν] at h<;>omega lemma gY (a b:kJ) (h:(ky a)г=(ky b)г):a=b:=by rw[cA,cA] at h;have:=a.toNat_lt;have:=b.toNat_lt;rw[<- χ];split_ifs at h<;>omega lemma fB (g:kI y≠255) (j:kI z≠255):mx y z=bM y z:=by have F a b (h:sk aomega unfold mx bM;by_cases h:sk ysimp[*,F,Bi] rw[AJ λe=>h e.2.2];have:=y.toNat_lt;have:=z.toNat_lt obtain ⟨rfl,rfl⟩ | ⟨rfl,rfl⟩:(y=0/\z=0x80000000)\/(y=0x80000000/\z=0):=by simp only[not_or,Ν,bS,<- χ,kO] at h⊢;split_ifs at h<;>omega all_goals decide @[inline] def fw (x0 x1 x2 x3:п):п:= if nn x0&&nn x1&&nn x2&&nn x3 then bM (bM x0 x1) (bM x2 x3) else mx (mx (mx (mx x0 x0) x1) x2) x3 lemma m4 (j q r u:kJ):fw j q r u=mx (mx (mx (mx j j) q) r) u:=by unfold fw;split .rename_i h;simp only[nn,ς,AV,A4] at h;obtain ⟨⟨⟨e,l⟩,m⟩,v⟩:=h have g:∀a b,kI a≠255-> kI b≠255-> kI (bM a b)≠255:=λa b x A=>by unfold bM;split<;>assumption have o:=g _ _ e e;have p:=g _ _ o l;rw[fB _ _ e e,fB _ _ o l,fB _ _ p m,fB _ _ (g _ _ p m) v];apply gY;simp only[gW,Nat.max_self,Nat.max_assoc] .rfl lemma g9 {I:р kJ} {v t e:т} (g:tа+vа kJ): ∀m (e q:т) (a:р kJ),eа+2*m=tа+1-> qа+m<= aв-> aв<2^31 -> (∀j< m,fw I[eа+2*j]! I[eа+2*j+1]! I[eа+2*j+vа]! I[eа+2*j+vа+1]! = G (qа+j))->(cD I v t l e q a)в=aв /\ ∀iintro e q a M K L r .rw[cD,Ag (by rw[β];omega)];exact ⟨rfl,λi _=>by rw[AJ А]⟩ rename_i m H;have h:eby convert r (j+1) А using 2<;>first | omega | (congr 1;omega)).imp (Eq.trans · o) λB i D=>?_ rw[B i А,F,dQ];rcases BR i qа with rfl | g<;>[rw[nF _ _ _ D];rw[n5 _ _ _ _ g.symm]]<;>split_ifs<;>first | rfl | omega def dL:р п:= if k=2/\0 if hs:(((o*h+y*2)*w)е+(w/2*2-1)е)а+wеаif U:(((o*h+y*2)*w)е+(w/2*2-1)е)а+wеаr<= c*(h/2)-> aв=c*(h/2*(w/2)) /\ ∀i?_) (c*(h/2)) 0 0 _ J (λ_=>⟨Υ ..,λi g=>by rw[AJ (by simp),AE _ _ (by simpa using g),Array.getElem_replicate]⟩) (by simp) .refine lI (L.1.trans (by simp[nA])) λi A h2=>?_ have e:=L.2 i (L.1 ▸ A);rw[AO (by simp only[m3,ϔ,Ϩ];exact L.1 ▸ A),AE,AE] at e<;>assumption obtain ⟨s0,G⟩:=H А;have Y:=η (w/2) O;rw[Ρ] at Y;have N:oby obtain ⟨B,D,F⟩:=bi o y j (h/2) (w/2) X K;have q:=cF h w 2 I o y j;have m:=q 0;have p:=q 1;have u:=q 2;have v:=q 3;simp only[Nat.reduceDiv,kL,zero_mul,Aq,BC] at m p u v;simp (disch:=omega) only[aa];rw[Ϛ 2 j,m4,<- dT (mx _ _),bt,bt,bt,bt,m,p,u,v,nA,AE _ _ (by simp;omega),Θ] simp only[B,D,F,mP,List.range_zero,mi,lS,pv] simp (disch:=omega) only[aa,s1,s0,true_and] at x⊢;intro i g;rw[x i g,G i g,Ρ];split_ifs<;>first | rfl | omega .rename_i M;exact (M ⟨by simp (disch:=omega) only[ϒ,aa,mo];omega,l⟩).elim .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" => AD local notation "ZG" => UInt64.toNat_ofNat' local notation "ZH" => AF local notation "ZI" => Core.al local notation "ZJ" => Nat.div_eq_zero_iff_lt local notation "ZK" => sqrtLower local notation "ZL" => AT local notation "ZM" => BN local notation "ZO" => mantOf_lt_24 local notation "ZQ" => AR local notation "ZR" => Core.ah local notation "ZS" => Core.aw local notation "ZT" => roundRational local notation "ZU" => Nat.div_add_mod' local notation "ZV" => BF local notation "ZW" => mantOf local notation "ZX" => signOf local notation "ZY" => AQ local notation "ZZ" => idxOf local notation "XA" => AN local notation "XB" => A5 local notation "XC" => two_ne_zero' local notation "XD" => Am 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 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 e=>exact congrArg f (e a) lemma QA (R k:о) (e:Accuracy): XE (2*R+Ya e) .exact>>>(k+2)= XE R e>>>(k+1):=by show Nat.repeat lv (k+2) _= Nat.repeat lv (k+1) _ rw[Yc,Yc,Yc];congr 1;rcases e with _ | ⟨_ | _ | _⟩<;> simp[ExtendedMantissa.ofMantissaAndAccuracy,lv,Ya]<;>omega open FloatLib.Numerics in lemma VY (q r D t:о) (g:0rfl,<-h, show (q*D+r)/D=q by rw[ϥ,ph _ _ g,Ϭ e,An], show (q*D+r)%D=r by rw[ϥ,nt,ν e]] lemma Y5 (e:с):Model.bpow e=(2:ℝ)^e:=by rfl lemma Vi (q b:о) (e:q≠0) (j:b<=1):(2*q+b)ж=qж+1:=by have g:=mu e;have h:=ώ (n:=q);rw[lP XI];omega open FloatLib.Numerics in lemma V0 (s:ф) (P g:о) (o:P≠0) (l:g≠0) (q r D:о) (v:0omega);have F:(r:ℝ)/D<1:=(div_lt_one XJ).2 (mod_cast p) have E:(0:ℝ)<=r/D:=XJ;have t:ld P g=(qж:с)+e:=by apply Model.floorLog2_eq_of_bounds P g _ o l<;>rw[m,Y5]<;>(try rw[(А:(qж:с)+e+1=((qж+1:о):с)+e)])<;>rw[ZL ZQ,ZF]<;>gcongr<;>linarith generalize u:2*q+(if r=0 then 0 else 1)=J at j⊢ have w:∀S,S=RationalBinary.scaleByPowerOfTwo P g (23-((qж:с)+e))->(kZ S.1 S.2=roundShiftRightEven J (Jж-23)):=by rintro _ rfl;rw[roundShiftRightEven_eq_roundQuotientEven,j,(А:qж+1-23=(qж-23)+1),<-u,<-VY q r D _ v p XI] apply Model.roundQuotientEven_eq_of_rat_eq _ _ _ _ (RationalBinary.scaleByPowerOfTwo_snd_ne_zero _ _ _ l) XJ rw[Model.scaleByPowerOfTwo_real];unfold Model.scaledRatToReal;rw[m,Y5,XD,<-ZL ZQ, show e+(23-((qж:с)+e))=-((qж-23:о):с) by omega, BP,ZF] push_cast;field_simp rw[kN,ite_eq_left Б,Model.ieeeRoundDyadic_eq_ieeeRoundDyadicImpl];simp only[Model.roundRat,Model.roundRatScaled,(Б:Fmt.isIEEE=true),↓reduceDIte, Model.ieeeRoundRatScaled,Model.ieeeRoundDyadicImpl,ZY,o,l,XA,t, Int.add_zero,mC,j,(Б:(FloatFormat.ieeeMaxNormalExponent pn:с)=127), show FloatFormat.ieeeMinNormalExponent pn=-126 by decide, show (FloatFormat.normalMantissaExpOffset pn:с)=150 by decide, show Fmt.fracWidth=23 by decide,show J≠0 by omega, show ((qж+1:о):с)+(e-1)=(qж:с)+e by omega, show¬((qж:с)+e>127) by omega,show¬((qж:с)+e< -150) by omega, show¬((qж:с)+e< -126) by omega,(А:23<=qж+1),AX, nj,w _ rfl] lemma Y8 (v:ℚ) (x:v≠0) (s:ф) (w:decide (v<0)=s) (q:о) (ρ:ℚ) (p:0<=ρ) (h:ρ<1) (e:с) (l:|v|=((q:ℚ)+ρ)*(2:ℚ)^e) (t:2^25<=q) (m:-126<=(qж:с)+e) (o:(qж:с)+e<=126): ZT v= lf (kN pn ⟨s,2*q+(if ρ=0 then 0 else 1),e-1⟩):=by have j:ρ=(ρ.numй:ℚ)/ρ.den:=by conv_lhs=>rw[<-Rat.num_div_den ρ] congr 1;exact_mod_cast (mY (Rat.num_nonneg.mpr p)).symm have g:=ρ.den_pos;generalize ρ.den=D,ρ.numй=r at j g;subst j;have u:r(z:ℝ)) l;rw[Rat.abs_def,Rat.divInt_eq_div] at this;push_cast at this;rwa[mQ,ϰ] lemma Q7 (R:о) (s:с) (h:2^25<=R): -s+1<=(ZE).targetExponent (kV R (-s)):=by have:=(lY XI).2 h;have:(ZE).mantissaBits<=25:=Б;unfold Bv kV;omega lemma Vd (v:ℚ) (p:0simp lemma YN (w:kJ):(sv w:ℚ)=0↔ZW w=0:=by unfold sv;split_ifs<;>simp lemma Vr (w:kJ):(sv w:ℚ)=(if ZX w then-1 else 1)*ZW w:=by unfold sv;simp lemma Y7 (x:Д):(ZR x)б=xбж:=by rw[am];rfl lemma YK (w:kJ):(ZC w==0)=decide (ZW w=0):=by by_cases h:ZW w=0 .have:ZC w=0:=ξ.mp (by rw[ZI,h];rfl);grind .have:ZC w≠0:=λe=>h (by rw[<-ZI,e];rfl) grind lemma Yk (n:о) (f:о->ℚ) (a:ℚ): (n3 n).foldl (λt j=>t+f j) a=a+∑j∈ZM n,f j:=by induction n generalizing a with | zero=>simp | succ n e=> rw[mP,mi,e,Λ];simp;ring def Yf (num den:о) (s:с):п:= toWord (BJ Fmt (roundWithAccuracy (ZE) .positive (ZK num den) (-s) (sqrtAccuracy num den))) open Float.Model in lemma Q4 (spec:Format) (h:p4) (R:о) (e:с) (g:Accuracy) (m:R≠0) (q:e+1<= spec.targetExponent (kV R e)): nB spec h R e g=pJ spec h (2*R+Ya g) (e-1):=by have o:Ya g<=1:=by cases g<;>simp[Ya] have j:kV (2*R+Ya g) (e-1)=kV R e:=by unfold kV;rw[Vi R _ m o];omega unfold pJ decreaseExponent;simp only[j];rw[(А:(e-1-spec.targetExponent (kV R e))й=0)];simp;unfold nB shiftToTargetExponent shiftToExponent;rw[j];generalize p:spec.targetExponent (kV R e)=T at* obtain ⟨k,l⟩:∃k,(T-e)й=k+1:=⟨(T-e)й-1,XI⟩;dsimp only;rw[l,(А:(T-(e-1))й=k+2),QA,show e-1+((k+2:о):с)=e+((k+1:о):с) by push_cast;ring] lemma Vh (g e:о): Ya (sqrtAccuracy g e)=if g=ZK g e^2*e then 0 else 1:=by unfold sqrtAccuracy;dsimp only;split_ifs<;>rfl lemma V9 (g e:о) (s:с) (q:33554432<= ZK g e) (m:ZK g e>>>31=0) (o:-209<= s) (p:s<=297): Yf g e s=ay false (XF (2*ZK g e+ (if g=ZK g e*ZK g e*e then 0 else 1))) (XF (297-s)й):=by set R:=ZK g e with h have j:(XF (297-s)й)б=(297-s)й:=by rw[ZG,ν XI] have r:(if g=R*R*e then 0 else 1)<=1:=by split_ifs<;>omega have l:(XF (2*R+(if g=R*R*e then 0 else 1)))б= 2*R+(if g=R*R*e then 0 else 1):=by rw[ZG,ν XI] rw[aP _ _ _ XI,j,l];unfold Yf;rw[<-h,Q4 _ _ R (-s) _ XI (Q7 R s XI),Vh,<-h,sq, show (((297-s)й:о):с)-298=-s-1 by omega] rfl def V8 (B:о) (c:с):о:=if 0<=c then B<<rw[Β] .refine ⟨g,?_⟩;push_cast;rw[<-ZF (2:ℚ) cй,(А:((cй:о):с)=c)];ring .refine ⟨XJ,?_⟩;push_cast;rw[<-ZF (2:ℚ) (-c)й,(А:(((-c)й:о):с)=-c)];have:(2:ℚ)^(-c)≠0:=XJ;rw[BP];grind @[inline] def V2 (r:о) (st:ф):о:=if r !=0 || st then 1 else 0 lemma VI (N M:о) (g:0decide (v<0)=s) (q:0<=δ) (r:δ<1) (x:m=true↔δ≠0) (y:0simp only[AX,υ,AN] at l⊢<;>rw[x] at l<;> constructor<;>linarith only[l,t,u,q,r] end NF namespace NE open NF Dense.F open Dense (aY) @[inline] def mx (a b:Д):Д:=if arename_i h<;>simp only[μ] at h<;>omega @[inline] def pk (s:ф) (q σ:Д):п:= ((if s then (0x80000000:Д) else 0)+((σ-146)<<<23+Core.aj (((2:Д)*q+1)<<<36)))л lemma jr (s:ф) (q σ:Д) (m:2^25<= qб) (o:qб<2^26) (r:146<= σб) (t:σб<=398):pk s q σ=ay s ((2:Д)*q+1) σ:=by have e:(2*q+1)б=2*qб+1:=by simp only[ι,ϩ,kE];omega have g:(σ-36)б=σб-36:=Η σ 36 (θ.2 (by simp only[kE];omega)) have j:((2*q+1)<<<36)б=(2*qб+1)*2^36:=by simp only[Ε,e,kE,kL,Β];omega have h:ay s (2*q+1) σ=ay s ((2*q+1)<<<36) (σ-36):=by rw[bR s (2*q+1) σ XI XI,bR s ((2*q+1)<<<36) (σ-36) XI XI,e,j,g,<-pow_mul_pow_sub (2:с) (by omega:36<=σ.toNat)] cases s<;>simp only[AX,AN,υ]<;>push_cast<;>ring_nf obtain ⟨l,-,p⟩:=cH s ((2*q+1)<<<36) (σ-36) XI XI XI XI;rw[h];apply χ.mp;rw[l];unfold pk;rw[ϓ,ι,ι,Ε,Η σ 146 (θ.2 (by simp only[kE];omega))] rw[g];generalize (aj ((2*q+1)<<<36))б=R at p⊢;clear l h j g e m o;cases s<;>simp only[AX,AN,υ,kE,kL,Β]<;>omega lemma pB (a b:ℝ) (p q:ℕ) (e: |a| <= 2^p) (g: |b| <= 2^q): |a*b| <= 2^(p+q):=by rw[AU,AM];exact A2 e g (AI _) В lemma eB (x y:ℝ) (p:ℕ) (h: |x-y| <= |y| /2^53+1/2^1075) (j: |y| <= 2^p): |x| <= 2^(p+1):=by have g:(1:ℝ)<=2^p:=Aa Г;have e:(1:ℝ)/2^1075<=1/2^1:=one_div_pow_le_one_div_pow_of_le Г Г;rw[pow_one] at e;have:=AC x y;rw[Ar];grind lemma mo (a:ℝ) (p q:ℕ) (h: |a| <= 2^p) (e:p<= q): |a| <= 2^q:= h.trans (AB Г e) lemma z9 (a:ℝ) (p:ℕ) (h: |a| <= 2^p) (e:p<=971): |a| <= (2:ℝ)^(971:ℤ):=by rw[show (971:ℤ)=((971:ℕ):ℤ) from rfl,AD];exact mo a p 971 h e lemma wB (w:kJ): |(sv w:ℝ)*2^kM w| <= 2^(24+kM w):=by rw[AU,AK (by positivity:(0:ℝ)<2^idxOf w),AM] have: |(sv w:ℝ)| <= 2^24:=by rw[<- ϰ,ϵ];exact_mod_cast (ci w).le exact AA this В end NE namespace NR open NF Dense.F open Dense (aY) @[inline] def pt (j:о):у:=P.get! (j+1) lemma ki (j:о) (l:j<=254):fv (pt j)/\rv (pt j)=(2:ℝ)^j:=by have h:pt j=pw j:=by have e:P.get! (j+1)=P.data[j+1]!:=by rcases P with ⟨g⟩;rfl unfold pt;rw[e,AE P.data (j+1) (by simp[P];omega)] simp only[P,Θ];rw[AO А];rfl rw[h];exact io j А lemma kc (n:о) (h:n<2^29):fv nи.toInt64.toFloat/\rv nи.toInt64.toFloat=n:=by have g:nиб=n:=Χ (А:n<2^64) have e:nи.toInt64.toInt=n:=by show af nи=n;rw[aY,g];split<;>omega have:=fn _ (by rw[e];simp;omega);rw[e] at this;omega lemma gP (a:ZB) (h:∀i (e:iα) (h:k< m): (la f)[k]! =f ⟨k,h⟩:=by rw[AE _ k (by simpa using h),Θ] @[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 iK (h n:о) (e:kJ) (x g:ZB):SN h n e x g=kY h n e x g:=by unfold SN kY;congr 1;rw[Q6,Y2];have:(0:ℚ)<2^((ZZ e:с)-149):=XJ;unfold sg;cases ZX e<;>simp[this,Nat.pos_iff_ne_zero] lemma i7 {e n:о} {l:kJ} {x g:ZB} (h:kY e n l x g=true): 0 kI x[i]!≠255)/\∀j,j kI g[j]!≠255:=by simp only[kY,ς,ZH,A6] at h;have q:xв=e*n:=by simpa using h.1.1.1.1.1.2 have m:gв=n:=by simpa using h.1.1.1.1.2 exact ⟨h.1.1.1.1.1.1.2,h.2,λi o=>NR.gP x (by simpa[nC] using h.1.1.1.2) i А, λj p=>NR.gP g (by simpa[nC] using h.1.1.2) j А⟩ namespace NF open Dense.F lemma jO (x y:у) (e:fv x) (g:fv y): kK (x-y).toModel=Model.sub (kK x.toModel) (kK y.toModel):=by change kK (qj x.toModel y.toModel)=_;rw[qj,Ϫ] have h:=Model.sub_eq_ofModel_sub_of_isFinite (fmt:=kF) Б (kK x.toModel) (kK y.toModel) (by rw[Κ];exact (cY x).1 e) (by rw[Κ];exact (cY y).1 g) rw[Κ,Κ] at h;exact h.symm lemma j5 (x y:у) (e:fv x) (g:fv y) (l: |rv x-rv y| <= mZ (nh kF)): fv (x-y)/\rv (x-y)=mz kF (rv x-rv y):=by have j:=jO x y e g have h:=Model.isFinite_sub_of_abs_toReal_sub_le_posMaxFinite (kK x.toModel) (kK y.toModel) Б e g l refine ⟨by unfold fv;rw[j];exact h,?_⟩ unfold rv;rw[j];exact Model.toReal_sub_eq_roundAt _ _ Б e g h lemma kx (x:у):mA (kK x.sqrt.toModel)=mA (Model.sqrt (kK x.toModel)):=by change mA (kK (qb x.toModel))=_;rw[qb,Ϫ,show lC=FloatFormat.binary64.toModel from rfl];have h:=Model.canonicalizeModel_sqrt_eq_model (fmt:=kF) Б (kK x.toModel);rw[Κ] at h;rw[<- h,Model.toModel_canonicalizeModel] lemma kb {y z:Model kF} (h:mA y=mA z):l6 y=l6 z/\mZ y=mZ z:=by constructor .rw[<- Ϟ,Ϯ _ Б,<- Ϟ,Ϯ _ Б,h] .rw[ϖ Б,ϖ Б,h] lemma ku (x:у) (l:fv x) (g:0rfl | true=> exfalso;rw[e] at g;simp only[lu,j] at g;have:(0:ℝ)<=(d.significand:ℝ)*(2:ℝ)^d.exponent:=В;simp only[lA,j] at g;rw[mC] at g;push_cast at g;linarith lemma j0 (x:у) (g:fv x) (j:0norm_num generalize (1:ℝ)/2^1075=τ at* refine ⟨j,?_⟩;rw[show rv r-1/rv y=(rv r*rv y-1)/rv y by field_simp,BB,AK g];gcongr have p:=AC (rv r*rv y) 1;rw[abs_one] at p;linarith[AZ (rv r*rv y) (rv (r*y)) 1,A3 (rv (r*y)) (rv r*rv y)] end NF open NF Dense.F @[inline] def pq (B:Д):п:=(((B>>>63)<<<31)+(((B&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-((1045:Д)<<<23))л lemma kn (q:Д) (h:qб<2^26):(aj ((2*q+1)<<<36))б=(qб+2)/4:=by have e:((2*q+1)<<<36)б=(2*qб+1)*2^36:=by simp only[Ε,ι,ϩ,kE,kL,Β];omega unfold aj;simp only[ο,ι,ψ,e,kE,kL,ε,nb];have g:(2*qб+1)*2^36/2^39%2<2:=ϝ _ Г;generalize (2*qб+1)*2^36/2^39%2=b at g⊢;omega lemma jb (B:Д):(eF B)б=Bб/2^52%2048:=by unfold eF;rw[ψ,ο];simp only[kE,kL,ε];exact γ _ 11 lemma jl (B:Д):(mF B)б=Bб%2^52+2^52:=by rw[jk,ψ];congr 1;exact γ _ 52 lemma ke (B:Д) (e:146<=(eF B-900)б) (g:(eF B-900)б<=398):pq B=NE.pk (B>>>63!=0) (mF B>>>27) (eF B-900):=by have t:=jb B;have h:=jl B;have w:=B.toNat_lt;have r:(B&&&0x7FFFFFFFFFFFFFFF)б=Bб%2^63:=by rw[ψ];exact γ _ 63 have j:(eF B-900)б=Bб/2^52%2048-900:=by rw[Α,t] at e g⊢;simp only[kE] at e g⊢;omega have v:=kn (mF B>>>27) (by simp only[ο,h,kE,kL,ε];omega) apply χ.mp;unfold pq NE.pk simp only[ϓ,ι,Α,Ε,ο,h, r,j,v,kE,kL,Β,ε] rw[j] at e g;have u:(B>>>63!=0)=true↔Bб/2^63≠0:=by simp only[AV,A4,<-ξ,ο,kE,kL,ε] obtain ⟨s,E,m,y,x,l,o,p,q⟩:∃s E m,s<2/\m<2^52/\Bб/2^63=s/\Bб%2^63=E*2^52+m/\Bб/2^52%2048=E/\Bб%2^52=m:=⟨_,_,_,А,А,rfl,А,rfl,rfl⟩ simp only[u,l,o,p,q] at e g⊢;clear t h w r j v l o p q u;split<;>simp only[kE]<;>omega lemma js (B:Д) (e:1046<=(eF B)б) (g:(eF B)б<=1298):pq B=NE.pk (B>>>63!=0) (mF B>>>27) (eF B-900):=by have:(eF B-900)б=(eF B)б-900:=Η _ _ (θ.2 (by simp only[kE];omega)) exact ke B А А lemma tc (B c:Д) (m:c<=25) (h:(B&&&0x7FFFFFF)-((1:Д)<<0 by norm_num) omega lemma te (E:Д) (h:E-1046<=252):1046<=Eб/\Eб<=1298:=by have e:=θ.1 h;rw[Α] at e;have:=E.toNat_lt;simp only[kE] at e;omega lemma cl (V:у) (q:fv V) (c:ℕ) (Z:ℝ) (j:1046<=(eF V.toBits)б) (o:(eF V.toBits)б<=1298) (l:2^c>>27)б/\(mF V.toBits>>>27)б<2^26/\ ((mF V.toBits>>>27)б:ℝ)*2^(((eF V.toBits)б:с)-1048)<(if V.toBits>>>63!=0 then-Z else Z)/\ (if V.toBits>>>63!=0 then-Z else Z)<(((mF V.toBits>>>27)б:ℝ)+1)*2^(((eF V.toBits)б:с)-1048):=by have r:=jl V.toBits;have g:=bK V q λh=>by simp[h] at j rw[bA,<-jk] at g;have e:=iU _ Z _ _ _ _ c XJ g XI l m p;simp only[XD,show (2:ℝ)^27*2^(((eF V.toBits)б:с)-1075)=2^(((eF V.toBits)б:с)-1048) by rw[<-ZF,<-ZL ZQ];congr 1;omega] at e simp only[ο,kE,kL,ε];exact ⟨XI,XI,e⟩ lemma eC (V:у) (J:fv V) (c:ℕ) (Y:ℚ) (j:1046<=(eF V.toBits)б) (l:(eF V.toBits)б<=1298) (o:2^c>>27)б with H;set s:=V.toBits>>>63!=0;set E:=(eF V.toBits)б;set e:ℤ:=(E:ℤ)-1197 with r;have t:=(show (0:ℝ)<=q*2^((E:ℤ)-1048) by positivity).trans_lt y have B:(if s then-((Y:ℝ)*2^149) else (Y:ℝ)*2^149)=(|(Y:ℝ)|)*2^149:=by split<;>rename_i h<;>simp only[h,AX,υ,XA] at t<;>[rw[abs_of_neg (by linarith)];rw[AK (by linarith)]]<;>ring have I:decide (Y<0)=s:=by split at t<;>rename_i h<;>simp[h]<;>rify<;>linarith have k:∀a:ℝ,a*2^((E:ℤ)-1048)=a*2^e*2^149:=λa=>by rw[XD,<-ZF (2:ℝ) 149,<-ZL ZQ];congr 2;rw[r];push_cast;ring rw[k,B] at y;rw[k,B] at D;have z:(q:ℚ)*2^e<(|Y|):=by rify;exact Au y XJ have u:(|Y|)<((q:ℚ)+1)*2^e:=by rify;exact Au D XJ have m:(0:ℚ)<2^e:=XJ;set δ:ℚ:=(|Y|)/2^e-q with v have w:0<δ:=by rw[v,sub_pos,lt_div_iff₀ m];exact z have x:δ<1:=by rw[v,sub_lt_iff_lt_add,div_lt_iff₀ m];linarith only[u] have g:qж=25:=(lP А).2 ⟨A,F⟩ rw[<-Qx s q true 1 e Y δ ((2:Д)*(mF V.toBits>>>27)+1) (eF V.toBits-900) (λ_=>I) w.le x (by grind) one_pos (by rw[v];field_simp;ring) (by simpa using A) (by simp[g];omega) (by simp[g];omega) (by rw[ι,ϩ];simp[V2,<-H];omega) XI] lemma dC (t:у) (M:fv t) (w:ℕ) (v:ℚ) (y:0>>27)б;set E:=(eF t.toBits)б have H:(t.toBits>>>63!=0)=false:=by by_contra h;simp only[Bm] at h;rw[AO h] at m;linarith[ϑ (v:ℝ),show (0:ℝ)<=(q:ℝ)*2^((E:ℤ)-1048) by positivity] rw[H] at m o;simp only[υ,AN] at m o;set s:ℤ:=1197-E with L;have k:(2:ℝ)^149=2^s*2^((E:ℤ)-1048):=by rw[<-ZF,<-ZL ZQ];congr 1;omega rw[k,<-Am] at m o;have N:=Au m XJ;have O:=Au o XJ have l:(kQ v*2^s)^2=(v:ℝ)*2^(2*s):=by rw[mul_pow,n8 (mod_cast y.le),<-ZF,<-zpow_mul];ring_nf have A:=(pow_lt_pow_left₀ N XJ ZQ).trans_eq l;have B:=l.symm.trans_lt (pow_lt_pow_left₀ O XJ ZQ);set a:=v.numк with J have r:(v:ℝ)=a/v.den:=by rw[J,mQ,ϰ,AK (Int.cast_pos.2 (Rat.num_pos.2 y))];exact_mod_cast (Rat.num_div_den v).symm obtain ⟨e,p⟩:=VE a v.den v.den_pos (2*s);set num:=V8 a (2*s);set den:=YF v.den (2*s);have D:(num:ℝ)/den=(v:ℝ)*2^(2*s):=by rw[r];simpa using congrArg (λz:ℚ=>(z:ℝ)) p rw[<-D] at A B;have G:(0:ℝ)apply ξ.mp<;>simp only[ι,ϩ,ZG,kE]<;>omega lemma jc (w:kJ):(kI w)г=wг/2^23%256:=by unfold kI;rw[Ι,Τ];simp only[kO,kL,ε];exact γ _ 8 lemma jf (w:kJ):(l9 w)г=wг%2^23:=by unfold l9;rw[Ι];simp only[kO];exact γ _ 23 lemma wV (w:kJ) (K R:ℕ) (h:wг=K*2^23+R) (q:2^23<= R) (v:R<=2^24) (x:K<=252): kI w≠255/\kX w=false/\(sv w:ℝ)*2^kM w=R*2^K:=by have j:=jc w;have u:=jf w have p:kX w=false:=by have:¬2^31<= wг:=А;exact Bool.eq_false_iff.2 (λe=>this ((ag w).1 e)) have r:(kI w)г≠255:=by rw[j,h];omega refine ⟨λe=>r (by rw[e];rfl),p,?_⟩ have g:kI w≠0:=λe=>by rw[e] at j;simp at j;omega unfold sv kU kM;rw[p,AJ g,AJ g];simp only[υ,AN];rw[u,j,h];rcases Nat.lt_or_ge R (2^24) with t|t .have m:(K*2^23+R)/2^23%256=K+1:=А have o:(K*2^23+R)%2^23=R-2^23:=А;rw[m,o,(А:K+1-1=K),Nat.cast_add,p5 q];push_cast;ring .have l:R=2^24:=А subst l;have m:(K*2^23+2^24)/2^23%256=K+2:=А;have o:(K*2^23+2^24)%2^23=0:=А;rw[m,o,(А:K+2-1=K+1)];push_cast;ring lemma kg (B:Д) (l:1046<=(eF B)б) (o:(eF B)б<=1298) (r:Bб<2^63): (pq B)г=((eF B)б-1046)*2^23+(2^23+(Bб%2^52+2^28)/2^29):=by have q:=jb B;have p:(B&&&0x7FFFFFFFFFFFFFFF)б=Bб%2^63:=by rw[ψ];exact γ _ 63 unfold pq;simp only[ϓ,ι,Α,Ε,ο,p,kE,kL,Β,ε];rw[q] at l o⊢;obtain ⟨E,m,t,e,g,h,j⟩:∃E m,m<2^52/\Bб/2^63=0/\Bб%2^63=E*2^52+m/\Bб/2^52%2048=E/\Bб%2^52=m:=⟨_,_,А,А,А,rfl,rfl⟩ simp only[e,g,h,j] at l o⊢;clear q p r e g h j;omega lemma bP (b:у) (j:fv b) (m:0>>63!=0)=false:=by by_contra e;simp only[Bm] at e;rw[e,AO rfl] at h;have:(0:ℝ)<=((b.toBits&&&0xfffffffffffff)б+2^52:ℕ)*(2:ℝ)^(((eF b.toBits)б:с)-1075):=В;push_cast at this h;linarith rw[g] at h;simp only[υ,AN] at h;refine ⟨?_,?_⟩ .have:b.toBits>>>63=0:=by simpa using g have:=congrArg lG this;rw[ο] at this;simp only[kE,kL,ε] at this;have:=Bf b.toBits;omega .rw[h];congr 2;rw[ψ];simp only[kE];rw[show (0xFFFFFFFFFFFFF:ℕ)=2^52-1 by norm_num,γ] lemma kd (b:у) (l:fv b) (g:0by simp[h] at e) obtain ⟨p,q,r⟩:=wV _ _ _ (kg b.toBits e j m) XI XI XI;refine ⟨p,q,?_⟩;rw[r,o,show (2:ℝ)^((eF b.toBits)б-1046)=2^29*2^(((eF b.toBits)б:ℤ)-1075) by rw[<-ZF,<-ZF,<-ZL ZQ];congr 1;omega,<-XD,<-sub_mul,AU,abs_zpow,abs_two,mul_div_right_comm] gcongr;generalize b.toBitsб%2^52=N;have a:=(Nat.cast_le (α:=ℝ)).2 (XI:(2^23+(N+2^28)/2^29)*2^29<=N+2^52+2^28);have c:=(Nat.cast_le (α:=ℝ)).2 (XI:N+2^52<=(2^23+(N+2^28)/2^29)*2^29+2^28);have:(0:ℝ)<=N:=XJ;push_cast at a c⊢;rw[Ae];constructor<;>linarith @[inline] def cy (a:ZB):FloatArray:=bf (λj=>dw a[j]!) aв (Ad aв) lemma aE (a:ZB):(cy a)д=aв/\∀j,j(cy a).data[j]! =dw a[j]!:=by have e:(kP aв)д=0:=rfl;obtain ⟨g,-,h⟩:=bE (λj=>dw a[j]!) aв aв _ (by rw[e];omega) (by rw[e];omega) exact ⟨g,λj l=>h j (by rw[e];omega) l⟩ lemma iA (X:FloatArray) (i:т) (h:iау) (x:ZB) (e:т) (he:eа<= xв) (hb:eа+1<2^32) (i:т) (hi:iа<= eа) (s t:у):у:= have:=κ if h:i+1у) (x:ZB) (e:т) (Q:eа<= xв) (O:eа+1<2^32) (l:о) (w:о->ℝ) (y:∀k,l<= k->kfv (f x[k]!)/\|rv (f x[k]!)|<= w k) (W:∑k∈lj l eа,w k<=2^960) (hn:eа<= l+2^29) (i:т) (X:iа<= eа) (s t:у) (c:о) (o r p u:ℝ) (hc:iа=l+2*c) (H:fv s) (I:fv t) (F:|rv s-o|<= c*((1/2^53+1/2^73)*p+1/2^1074)) (G:|rv t-r|<= c*((1/2^53+1/2^73)*u+1/2^1074)) (z:|o|<= p) (A:|r|<= u) (N:o+r=∑k∈lj l iа,rv (f x[k]!)) (m:p+u=∑k∈lj l iа,w k): fv (PP f x e Q O i X s t)/\|rv (PP f x e Q O i X s t)-∑k∈lj l eа,rv (f x[k]!)|<= (((eа-l:ℕ):ℝ)+3)/2*((1/2^53+1/2^73)*∑k∈lj l eа,w k)+(((eа-l:ℕ):ℝ)+1)*(1/2^1074):=by have U:∀k,l<= k->k0<= w k:=λk v M=>(AI _).trans (y k v M).2 have S:∀j≤eа,∑k∈lj l j,w k<=2^960:=λj hj=>(Finset.sum_le_sum_of_subset_of_nonneg (Finset.Ico_subset_Ico_right hj) (λk hk _=>(Finset.mem_Ico.1 hk).elim (U k))).trans W have:=(AI _).trans z;have:=(AI _).trans A;have:=κ;rw[PP];dsimp only;split next h=> have v:=u1 (i:=i) А;have h0:=β.mp h;have M:(i+1+1)а=iа+1+1:=by rw[u1 А,v] rw[ck x i А,ck x (i+1) А,v];obtain ⟨J,K⟩:=y iа А А;obtain ⟨g3,g4⟩:=y (iа+1) А А have V:∀g:ℕ->ℝ,∑k∈lj l (i+1+1)а,g k=∑k∈lj l iа,g k+g iа+g (iа+1):=λg=>by rw[M,ϗ А,ϗ А] have:=S _ (by omega:(i+1+1).toNat<=_);rw[V,<-m] at this have:=U iа А А;have:=U (iа+1) А А;obtain ⟨B,D,E⟩:=ij s _ o p (w iа) c А H J F z K (by linarith) obtain ⟨Y,b2,b3⟩:=ij t _ r u (w (iа+1)) c А I g3 G A g4 (by linarith) exact iZ f x e Q O l w y W hn (i+1+1) А _ _ (c+1) _ _ _ _ А B Y D b2 E b3 (by rw[V,<-N];ring) (by rw[V,<-m];ring) next h=> split next L=> have h0:=β.mp L;have v:=u1 (i:=i) А;have q:eа=iа+1:=by have:=mt β.mpr h;omega rw[ck x i А];obtain ⟨J,K⟩:=y iа А А;have:=S (iа+1) А;rw[ϗ А,<-m] at this;obtain ⟨B,D,E⟩:=ij s _ o p (w iа) c А H J F z K (by linarith) rw[q,ϗ А,ϗ А,<-N,<-m,add_right_comm o,add_right_comm p];exact jq _ t _ r _ u (c+1) c _ А А А А B I D G E A (by linarith) next L=> have q:eа=iа:=by have:=mt β.mpr L;omega rw[q,<-N,<-m];exact jq s t o r p u c c _ А А А А H I F G z A (by rw[m];exact S _ А) termination_by eа-iа decreasing_by all_goals omega lemma i4 (f:kJ->у) (x:ZB) (e:т) (j:eа<= xв) (h:eа+1<2^32) (g:т) (l:gа<= eа) (w:о->ℝ) (o:∀k,gа<= k->kfv (f x[k]!)/\|rv (f x[k]!)|<= w k) (m:∑k∈lj gа eа,w k<=2^960) (p:eа<= gа+2^29): fv (PP f x e j h g l 0 0)/\|rv (PP f x e j h g l 0 0)-∑k∈lj gа eа,rv (f x[k]!)|<= (((eа-gа:ℕ):ℝ)+3)/2*((1/2^53+1/2^73)*∑k∈lj gа eа,w k)+(((eа-gа:ℕ):ℝ)+1)*(1/2^1074):= iZ f x e j h gа w o m p g l 0 0 0 0 0 0 0 А fg.1 fg.1 (by rw[fg.2];simp) (by rw[fg.2];simp) (by simp) (by simp) (by simp) (by simp) structure RS where ok:ф m:у ri:у d:п A:Д @[inline] def rq (y r:у):ф:=eF r.toBits<1100&&(r*y).toBits-0x3FEFFFFFFFFFFFFF<2 @[inline] def dn (V:у) (w:Д) (k:Д->ф):ф×п:= let B:=(Float.sqrt V).toBits let t:=(1:Д)<<ф) (Ep rn:у) (x:ZB) (lo hi:т) (h:hiа<= xв) (hb:hiа+1<2^32) (hl:loа<= hiа):RS:= let m:=PP dw x hi h hb lo hl 0 0*rn let V:=PP (λw=>let d:=dw w-m;d*d) x hi h hb lo hl 0 0*rn+Ep let t:=dn V Ln k let D:=dw t.2 let ri:=1/D let a:=eF m.toBits let b:=eF D.toBits let mD:=if b<= a then a-b+1 else 0 ⟨t.1&&Ln+mD<=25&&rq D ri,m,ri,t.2,Ln+mD+1047⟩ @[inline] def rR (Ln:Д) (k:Д->ф) (Ep rn:у) (x:ZB) (lo hi:т) (h:hiа<= xв) (hb:hiа+1<2^32) (hl:loа<= hiа):RS:= let V:=PP (λw=>let d:=dw w;d*d) x hi h hb lo hl 0 0*rn+Ep let t:=dn V Ln k let D:=dw t.2 let ri:=1/D ⟨t.1&&rq D ri,0,ri,t.2,0⟩ @[noinline] def sL (n:о) (x:ZB) (r:о) (xw gw bw d:п):п:=ZT ((ZA xw-rowMean n x r)*ZA gw/ZA d+ZA bw) def mL (x:ZB) (b:о):о->Д->Д | 0,u=>u | k+1,u=>let w:=x[b]!;let i:=Core.iW w;mL x (b+1) k (if Core.mW w==0||u< i then u else i) @[inline] def zS (w:п) (lo:Д):о:=let M:=Core.mW w;let h:=Core.iW w-lo;if h<=38 then (M<<о->о->о×о | 0,p,q=>(p,q) | k+1,p,q=>let w:=x[b]! if Core.mW w==0 then sS x lo (b+1) k p q else if ZX w then sS x lo (b+1) k p (q+zS w lo) else sS x lo (b+1) k (p+zS w lo) q @[noinline] def sI (n:о) (x:ZB) (r:о) (xw gw bw d:п):п:= let lo:=mL x (r*n) n 255 let S:=sS x lo (r*n) n 0 0 let X:=if Core.mW xw==0 then 0 else n*zS xw lo let T:=(if ZX xw then-(X:с) else X)-((S.1:с)-S.2) let s1:с:=(loб:с)+idxOf gw-idxOf d let s2:с:=idxOf bw let f:=min s1 s2 let md:=ZW d let P:=T*sv gw*((1<<<(s1-f)й:о):с)+sv bw*(n*md:о)*((1<<<(s2-f)й:о):с) let Q:=n*md let a:=Pк let k1:с:=26+(Qж:с)-(aж:с) let k:=if V8 a k1/YF Q k1<67108864 then k1 else k1-1 let W:=V8 a k let Dd:=YF Q k let q:=W/Dd let e:=f-149-k if 0(mL x b k u)б<= kM x[b+j]!:=by intro k;induction k with | zero=>intro b u;exact ⟨AS,λj h=>absurd h (Nat.not_lt_zero _)⟩ | succ k o=> intro b u;simp only[mL];generalize m:(if mW x[b]! ==0||u< iW x[b]! then u else iW x[b]!)=v have e:vб<= uб/\(ZW x[b]!≠0->vб<= kM x[b]!):=by rw[<-m];have:=ZS x[b]!;split<;>rename_i h<;>simp only[lQ,YK,AF,μ,not_or,not_lt] at h<;>omega obtain ⟨p,g⟩:=o (b+1) v;refine ⟨А,λj q l=>?_⟩ rcases j with _|j .have:=e.2 l;simp only[ϕ] at*;omega .have:=g j А (by rwa[(А:b+1+j=b+(j+1))]);rw[(А:b+1+j=b+(j+1))] at this;exact this lemma iI (w:kJ) (e:Д) (h:eб<= kM w):zS w e=ZW w*2^(kM w-eб):=by have p:=ZS w;have l:=ZI w;have o:=ZO w;have j:(iW w-e)б=kM w-eб:=by rw[Η _ _ (θ.2 А),p] unfold zS;dsimp only;split<;>rename_i m .have g:kM w-eб<=38:=by have:=θ.1 m;rw[j] at this;simpa using this rw[Ε,l,j,ν (А:kM w-eб<64),Β] apply ν;calc ZW w*2^(kM w-eб)<2^24*2^38:=ns o (Ζ Г g) В _=2^62:=Г _<2^64:=Г .rw[Β,l,j] lemma kt (x:ZB) (e:Д):∀k b p q,(∀jeб<= kM x[b+j]!)-> ((sS x e b k p q).1:ℤ)-(sS x e b k p q).2=(p:ℤ)-q+∑j∈ZM k,sv x[b+j]!*2^(kM x[b+j]!-eб):=by intro k;induction k with | zero=>intro b p q _;simp[sS] | succ k o=> intro b p q h;have g:∀jeб<= kM x[b+1+j]!:=λj u=>by rw[(А:b+1+j=b+(j+1))];exact h _ А rw[l7,Ο rfl (λt _=>by rw[(А:b+(t+1)=b+1+t)]),ϕ] simp only[sS];split<;>rename_i m .rw[o _ _ _ g];have:ZW x[b]! =0:=by simpa[YK] using m simp[sv,this] .have l:=h 0 А (by simpa[YK] using m);simp only[ϕ] at l split<;>rename_i r<;>rw[o _ _ _ g,iI _ _ l]<;>simp[sv,r]<;>ring lemma e8 (w:kJ) (e:ℕ) (h:ZW w=0\/e<= kM w):((ZA w:ℚ))=(sv w*2^(kM w-e):ℤ)*(2:ℚ)^((e:ℤ)-149):=by rw[Y1];rcases h with h|h .have:(sv w:ℚ)=0:=(YN w).2 h;rw[this];simp[show sv w=0 by exact_mod_cast this] .push_cast;rw[Am,<-AD,<-AT Г];congr 2;push_cast[h];ring lemma ju (n:о) (x:ZB) (r:о):lk n x r=(((sS x (mL x (r*n) n 255) (r*n) n 0 0).1:ℤ)-(sS x (mL x (r*n) n 255) (r*n) n 0 0).2:ℤ)*(2:ℚ)^(((mL x (r*n) n 255)б:ℤ)-149)/n:=by obtain ⟨-,e⟩:=g5 x n (r*n) 255;generalize mL x (r*n) n 255=g at e⊢;have l:=kt x g n (r*n) 0 0 (λj m h=>e j m h) unfold lk;rw[Yk,An];congr 1;rw[l];simp only[pP,BQ,An];push_cast;rw[ϟ];refine Ο rfl λt o=>?_ rw[e8 _ gб (by by_cases h:ZW x[r*n+t]! =0;exact BX h;exact qk (e t (ϊ.1 o) h))];push_cast;ring lemma kr (n:о) (x:ZB) (r j:о) (p o d:kJ) (z:jpush_cast<;>field_simp have u:(sv d:ℚ)=v:=by unfold sv;simp[J,v] have A:(ZA x[r*n+j]!-lk n x r)*ZA p/ZA d+ZA o=(P:ℚ)*2^f/(Q*2^149)\/Q=0:=by refine or_iff_not_imp_right.2 λt=>?_;have K:(v:ℚ)≠0:=Nat.cast_ne_zero.2 (right_ne_zero_of_mul t) have:0<= D-f/\0<= E-f:=by simp only[f];omega rw[I,ju n x r,Y1 p,Y1 o,Y1 d,u];simp only[P,Q,T,S,l,mb];push_cast;rw[<-ZF,<-ZF,mY this.1,mY this.2];simp only[D,E,l,XB (ZQ:(2:ℚ)≠0),ZL (ZQ:(2:ℚ)≠0)];field_simp split_ifs with w y .simp only[ς,AF,AQ] at w rw[A.resolve_right А,show P=0 from Int.natAbs_eq_zero.1 w.2];simp .simp only[ς,AF] at y obtain ⟨⟨⟨⟨B,L⟩,M⟩,N⟩,t⟩:=y;rw[A.resolve_right t.ne'];obtain ⟨G,H⟩:=VE a Q t k;have g:qж=25:=(lP А).2 ⟨B,L⟩;refine Qx _ W false F e _ 0 _ _ ?_ AS one_pos (by simp) G ?_ B (by rw[g];omega) (by rw[g];omega) (by rw[mN,ZG];unfold V2;split<;>omega) (by rw[mN,ZG];omega) .intro _;have:0<(2:ℚ)^f/(Q*2^149):=XJ;simp[BY,mul_neg_iff,this,lt_asymm this] .rw[BC,BB,AU,AK (XJ:(0:ℚ)<2^f),AK (XJ:(0:ℚ)push_cast<;>ring def qZ (x:ZB) (lo:Д) (b:о):о->о->о | 0,a=>a | k+1,a=>let z:=zS x[b]! lo;qZ x lo (b+1) k (a+z*z) lemma kl (x:ZB) (e:Д):∀k b a,(qZ x e b k a:ℚ)=a+∑j∈ZM k,((zS x[b+j]! e:ℕ):ℚ)^2:=by intro k;induction k with | zero=>intro b a;simp[qZ] | succ k g=> intro b a;rw[l7,Ο rfl (λt _=>by rw[(А:b+(t+1)=b+1+t)]),ϕ,qZ,g];push_cast;ring 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 Yf num den s else sqrtRational ((A:ℚ)*2^(2*(u:с)-298)/Dn+ZA eps) lemma YW (A l u:о) (e:kJ) (v:0(2:ℝ)^j=2^k*2^((g:с)-298):=by intro k j h;rw[h,<-ZF,<-ZL ZQ];ring_nf have:=congrArg (λz:ℚ=>(z:ℝ)) x;push_cast at this⊢;rw[this,<-w,ZL ZQ,o (2*u-g) (2*(u:с)-298) XI,o (m+149-g) ((m:с)-149) XI,Β,Β];push_cast;field_simp .rfl @[noinline] def xD (n:о) (x:ZB) (r:о) (eps:п) (c:ф) (B:Д):ф:= let lo:=mL x (r*n) n 255 let S:=sS x lo (r*n) n 0 0 let s:=if c then ((S.1:с)-S.2)к else 0 V5 (n*n*qZ x lo (r*n) n 0-n*s*s) (n*n*n) loб eps==pq B @[noinline] def sQ (xw gw d:п):п:=ZT (ZA xw*ZA gw/ZA d) @[inline] def eL (n:о) (x:ZB) (r:о) (e:RS) (xw gw bw:п) (gv bv:у):п:= let v:=(dw xw-e.m)*(gv*e.ri)+bv let B:=v.toBits let E:=eF B let c:=NE.mx (NE.mx (E+5) (Core.iW bw+1051)) (Core.iW gw+e.A)-E let t:=(1:Д)<<jп) (hN:loа+Nа<2^32) (i:т) (out:ZB) (ho:loа+Nа<= outв):ZB:= if h:ijkJ) (h:gа+Nа<2^32) (i:т) (e:ZB) (l:gа+Nа<= eв): (QE g N f h i e l)в=eв:=by unfold QE;split .rw[gu];exact Ξ .. .rfl termination_by Nа-iа decreasing_by have:=β.mp ‹_›;have:=N.toNat_lt_size;rw[uS А];omega lemma j6 (a:ZB) (i:о) (v:kJ) (h:ifirst|rfl|omega lemma dW (g N:т) (f:(j:т)->jkJ) (F:о->kJ) (m:gа+Nа<2^32) (o:∀j h,f j h=F (gа+jа)) (i:т) (e:ZB) (p:gа+Nа<= eв): (QE g N f m i e p)в=eв/\∀q,(QE g N f m i e p)[q]! =if gа+iа<= q/\qrename_i h .have:=β.mp h have:=κ;have l:(g+i)а=gа+iа:=Dense.ae XI;obtain ⟨r,t⟩:=dW g N f F m o (i+1) (e.uset (g+i) (f i h) (by rw[l];omega)) (by rwa[Ξ]) refine ⟨by rw[r,Ξ],λq=>?_⟩ rw[t,uS XI];simp only[Array.uset];rw[j6,l,o];split_ifs<;>first|rfl|omega|(subst_vars;rfl) .exact ⟨rfl,λq=>by rw[AJ];have:=USize.lt_iff_toNat_lt.not.1 h;omega⟩ termination_by Nа-iа decreasing_by have:=κ;rw[uS XI];omega @[noinline] def fL (n:о) (eps:п) (x g b:ZB) (r:о) (lo N:т) (hN:loа+Nа<2^32) (out:ZB) (ho:loа+Nа<= outв):ZB:= let M:=rowMean n x r let d:=sqrtRational (rowVariance n x r M+ZA eps) QE lo N (λj _=>ZT ((ZA x[r*n+jа]!-M)*ZA g[jа]!/ZA d+ZA b[jа]!)) hN 0 out ho @[noinline] def fR (n:о) (eps:п) (x g:ZB) (r:о) (lo N:т) (hN:loа+Nа<2^32) (out:ZB) (ho:loа+Nа<= outв):ZB:= let d:=sqrtRational (rowVariance n x r 0+ZA eps) QE lo N (λj _=>ZT (ZA x[r*n+jа]!*ZA g[jа]!/ZA d)) hN 0 out ho def RL (rows n:о) (Ln:Д) (Ep rn:у) (eps:п) (x g b:ZB) (gd bd:FloatArray) (hn:rows*n+1<2^32) (hx:rows*n<= xв) (hg:n<= gв) (hb:n<= bв) (hgd:n<= gdд) (hbd:n<= bdд) (r:о) (out:ZB) (ho:rows*n<= outв):ZB:= if hr:r have:=β.mp hj eL n x r e (x.uget ((r*n)е+j) (by rw[Dense.ae (by have:=κ;omega)];omega)) (g.uget j А) (b.uget j А) (gd.uget j А) (bd.uget j А)) (by rw[h2,h3];omega) 0 out (by rw[h2,h3];omega) else fL n eps x g b r (r*n)е nе (by rw[h2,h3];omega) out (by rw[h2,h3];omega)) (by split<;>simp only[gu,fL]<;>exact ho) else out termination_by rows-r def RR (rows n:о) (Ln:Д) (Ep rn:у) (eps:п) (x g:ZB) (gd:FloatArray) (hn:rows*n+1<2^32) (hx:rows*n<= xв) (hg:n<= gв) (hgd:n<= gdд) (r:о) (out:ZB) (ho:rows*n<= outв):ZB:= if hr:r have:=β.mp hj eR e (x.uget ((r*n)е+j) (by rw[Dense.ae (by have:=κ;omega)];omega)) (g.uget j А) (gd.uget j А)) (by rw[h2,h3];omega) 0 out (by rw[h2,h3];omega) else fR n eps x g r (r*n)е nе (by rw[h2,h3];omega) out (by rw[h2,h3];omega)) (by split<;>simp only[gu,fR]<;>exact ho) else out termination_by rows-r @[inline] def lw (n:о):Д:=Core.ah (n+16)и+1 @[inline] def cf (rows n:о) (eps:п) (x g:ZB):ф:= SN rows n eps x g&&rows*n<=4294967294&&n<=1048576&&rq nи.toInt64.toFloat (1/nи.toInt64.toFloat) lemma dZ (w:kJ) (h:kI w≠255):fv (dw w)/\rv (dw w)=(ZA w:ℝ)*2^149:=by obtain ⟨e,g⟩:=aD w h;refine ⟨e,?_⟩;rw[g,Y1];push_cast;rw[Am,<-AD,<-AD,<-AT Г];congr 2;push_cast;ring lemma jj (n:о) (m:n<=2^20):(lw n)б<=21/\(n:ℝ)+17<=2^(lw n)б/\(32:ℝ)<=2^(lw n)б:=by have g:((n+16)и)б=n+16:=Χ (А:n+16<2^64) have h:(ah (n+16)и)б=(n+16)ж:=by rw[Y7,g] have j:(n+16)ж<=20:=Nat.lt_succ_iff.1 ((pp А).2 А);have l:4<=(n+16)ж:=(lY А).2 А;have e:(lw n)б=(n+16)ж+1:=by unfold lw;rw[ι,h];simp only[kE];omega rw[e];refine ⟨А,?_,?_⟩ .have:=ώ (n:=n+16);have:(n+17:ℕ)<=2^((n+16)ж+1):=А exact_mod_cast this .have:2^5<=2^((n+16)ж+1):=Ζ Г А exact_mod_cast this lemma fU {j n:о} {e:kJ} {x g:ZB} (h:kY j n e x g=true):kI e≠255:=by simp only[kY,ς,ZH,A6] at h;have:=h.1.2;unfold n7 at this;simpa using this lemma je (e:kJ) (g:kI e≠255) (q:0rw[BT В]<;>exact Aa Г lemma jz (V T ρ:ℝ) (e:0norm_num have p:kQ T<=2^53*U*(1+1/2^30):=by linarith[AA r o,AA g o] linarith[AL p (by positivity:(0:ℝ)<=((n:ℝ)+32)/2^54),AZ h (kQ V) (kQ T),AA r o,AA l e,AA m e,AA g e] lemma vP (n:ℕ) (q g h:у) (A S e v:ℝ) (D:1<= n) (N:n<=2^20) (o:0<= A) (J:A<=2^700) (B:0<= v) (M:v<=1) (I:fv q) (w:fv g) (H:fv h) (X:|S-A|<=4/2^53*A+v) (Y:|rv q-S|<=((n:ℝ)+3)/2*((1/2^53+1/2^73)*((1+4/2^53)*A+v))+((n:ℝ)+1)*(1/2^1074)) (u:|rv g-1/n|<=3/2^53/n) (L:|rv h-e|<= e/2^53+1/2^1075) (K:2^149<= e) (y:e<=2^700): fv (q*g+h)/\|rv (q*g+h)-(A/n+e)|<=((n:ℝ)+30)/2^54*(A/n+e):=by obtain ⟨t1,U,t3,V⟩:=tS;have m:(1:ℝ)<= n:=mod_cast D;have j:(n:ℝ)<=2^20:=mod_cast N;have x:(0:ℝ)>>63!=0 then-(((v.toBits&&&0xfffffffffffff)б+2^52:ℕ):ℝ) else ((v.toBits&&&0xfffffffffffff)б+2^52:ℕ))|= (((v.toBits&&&0xfffffffffffff)б+2^52:ℕ):ℝ):=by split<;>(try simp only[abs_neg])<;>exact Ao В rw[this] calc (2:ℝ)^(((eF v.toBits)б:с)-1023)=2^52*2^(((eF v.toBits)б:с)-1075):=by rw[<-AD,<-AT Г];congr 1;push_cast;ring _<=_:=by gcongr;push_cast;linarith[show (0:ℝ)<=((v.toBits&&&0xfffffffffffff)б:ℝ) by positivity] lemma bU (v:у) (e:fv v):|rv v|<2^53*(2:ℝ)^(((eF v.toBits)б:с)-1075):=by have:=br v e;rwa[show (2:ℝ)^(((eF v.toBits)б:с)-1022)=2^53*2^(((eF v.toBits)б:с)-1075) by rw[<-AD,<-AT Г];congr 1;push_cast;ring] at this lemma gM (V:у) (p:Д) (k:Д->ф) (u:fv V) (o:0by rw[h] at l;simp at l have g:0ф) (v:ℚ) (ρ:ℝ) (l:n<=2^20) (u:fv V) (D:0pq B=lB v) (e:(dn V (lw n) k).1=true):(dn V (lw n) k).2=lB v:=by obtain ⟨I,E,F⟩:=jj n l;have x:(0:ℝ)<(v:ℝ)*2^298:=XJ;have A:(n:ℝ)<=2^20:=by exact_mod_cast l have:ρ<=1/2:=o.trans (by linarith) have g:0у) (x:ZB) (o g:т) (h:gа<= xв) (p:gа+1<2^32) (t:oа<= gа) (n e:ℕ) (m:oа=e) (l:gа=e+n) (y:n<=2^20) (d:ℕ->ℝ) (q:∀jby rw[ϛ,<-pA];simp;ring have u:(n:ℝ)<=2^20:=mod_cast y;have A:∑j∈kG n,d j^2<=2^20*2^600:=Ah (by simpa using nG _ _ _ λj r=>(q j (ϊ.1 r)).2.2) (AA u XJ) have:(2:ℝ)^22*2^600<=2^960:=by rw[<-AM];exact AB Г Г have:(1:ℝ)<=2^600:=Aa Г;have:(n:ℝ)/2^1000<= n:=div_le_self XJ (Aa Г) obtain ⟨z,w⟩:=i4 f x g h p o t (λk=>(1+4/2^53)*d (k-e)^2+1/2^1000) (λk B D=>by obtain ⟨j,rfl⟩:∃j,k=e+j:=⟨k-e,А⟩ obtain ⟨a,b,-⟩:=q j А;simp only[ϐ];exact ⟨a,by linarith[AC (rv (f x[e+j]!)) (d j^2),abs_sq (d j)]⟩) (by simp only[m,l,ϸ,ϐ,v];generalize (2:ℝ)^600=T,(2:ℝ)^960=U at*;linarith) А simp only[l,m,ϸ,ϐ,v] at w;refine ⟨z,w,?_⟩;rw[<-ϱ,<-v];exact (Ϣ _ _).trans (Ϸ λj r=>(q j (ϊ.1 r)).2.1) lemma dB (w:kJ) (e:kI w≠255):|rv (dw w)|<=2^278:=by rw[(aD w e).2];exact (NE.wB w).trans (AB Г (by have:=cp w;omega)) lemma tR (w:kJ) (j:kI w≠255):fv (dw w*dw w)/\|rv (dw w*dw w)-rv (dw w)^2|<=4/2^53*rv (dw w)^2+1/2^1000/\rv (dw w)^2<=2^600:=by have h:=(aD _ j).1;have e:=dB _ j have g:rv (dw w)^2<=2^556:=by have:=sq_le_sq' (Ae.1 e).1 (Ae.1 e).2;rw[<-Ba] at this;exact this have l:|rv (dw w)*rv (dw w)|<=(2:ℝ)^(971:с):=by rw[Bc,<-sq];exact g.trans (by rw[show (971:ℤ)=((971:ℕ):ℤ) from rfl,AD];exact AB Г Г) obtain ⟨m,o⟩:=NF.fM _ _ h h l;refine ⟨m,?_,g.trans (AB Г Г)⟩;rw[Bc,<-sq] at o;have:(1:ℝ)/2^1075<=1/2^1000:=Ap В (AB Г Г);have:rv (dw w)^2/2^53<=4/2^53*rv (dw w)^2:=by have:=Ax (rv (dw w));rw[BM В];nlinarith linarith lemma sA (n:ℕ) (g:n<=2^20) (d:ℕ->ℝ) (h:∀jh j (ϊ.1 e) _=n*2^600:=by simp _<=2^20*2^600:=by gcongr;exact_mod_cast g _<=2^700:=by rw[<-AM];exact AB Г Г lemma ja (g:kJ) (h:kI g≠255):(ZA g:ℝ)*2^298<=2^700:=by have:=dB g h;rw[(dZ g h).2] at this;have e:(ZA g:ℝ)*2^298=(ZA g:ℝ)*2^149*2^149:=by rw[Am,<-AM] rw[e];calc (ZA g:ℝ)*2^149*2^149<=2^278*2^149:=by gcongr;exact Ah (BL _) this _<=2^700:=by rw[<-AM];exact AB Г Г lemma nJ (n:ℕ) (g:n<=2^20):(n:ℝ)/2^1000<=1:=by have e:(n:ℝ)<=2^20:=by exact_mod_cast g rw[BT В];exact e.trans (AB Г Г) lemma i8 (V:у) (e:Д) (k:Д->ф) (q:fv V) (j:0(zQ _ _ (or_iff_not_imp_left.2 (m j (ϊ.1 z)))).symm] unfold ls;rw[Yk,An];congr 1;simp only[sub_sq,ϛ,ϱ,<-ϟ,<-pA,nV,mj,Bb];cases c<;>simp only[υ,AN,AX,<-A,p,mQ,ϰ,sq_abs,pP]<;>ring have e:((2:ℚ)^((gб:ℤ)-149))^2=2^(2*(gб:ℤ)-298):=by rw[<-ZF,<-zpow_mul];congr 1;omega have t:(0:ℚ)<2^(2*(gб:ℤ)-298):=XJ;rw[w,e] at o⊢;generalize (2:ℚ)^(2*(gб:ℤ)-298)=K,qZ x g (r*n) n 0=Q,(if c then ((S.1:ℤ)-S.2)к else 0)=s at t o⊢;have u:((Q:ℚ)*K-n*(s:ℚ)^2*K/n^2)/n=(n*n*Q-n*s*s)*K/(n*n*n):=by field_simp rw[u] at o⊢;have:(0:ℚ)<=n*n*Q-n*s*s:=not_lt.1 λv=>(div_neg_of_neg_of_pos (mul_neg_of_neg_of_pos v t) XJ).not_ge o rw[p5 (by exact_mod_cast sub_nonneg.1 this)];push_cast;ring lemma pB (a b:ℝ) (p q:ℕ) (e:|a|<=2^p) (g:|b|<=2^q):|a*b|<=2^(p+q):=by rw[AU,AM];exact A2 e g (AI _) В lemma rB (y z:ℝ) (p:ℕ) (e:|z|<=2^p) (h:|y-z|<=|z|/2^53+1/2^1075):|y|<=2^(p+1):=by have t:(1:ℝ)/2^1075<=1/4:=Ap Г (Ah (by norm_num:(4:ℝ)<=2^2) (AB Г Г)) have:(1:ℝ)<=2^p:=Aa Г;rw[Ar];generalize (1:ℝ)/2^1075=τ at*;linarith[AC y z,div_le_div_of_nonneg_left (AI z) (by norm_num:(0:ℝ)<2) (by norm_num:(2:ℝ)<=2^53)] lemma aB (a b:ℝ) (p:ℕ) (e:|a|<=2^p) (g:|b|<=2^p):|a+b|<=2^(p+1):=by rw[Ar];linarith[Ak a b] lemma iq (D g:ℝ) (j:1<= D) (h:|g-1/D|<=3/2^53/D):|g|<=2^1:=by have e:0norm_num have B:(1:ℝ)/2^699=1/2^700*2:=by rw[Aj,Aq,BU XJ XJ,Aq,<-BG] have I:(0:ℝ)<=1/2^1075:=XJ;have x:=AZ v (q+e) (g*G/D+e);rw[add_sub_add_right_eq_sub] at x;have y:=abs_sub (q+e) e;rw[add_sub_cancel_right] at y;have:=AZ q (s*G/D) (g*G/D);clear u t l j w p;rw[B];generalize (2:ℝ)^278=P at z A;generalize (1:ℝ)/2^1075=τ at*;generalize (1:ℝ)/2^700=K at* linarith[AC (q+e) v,A3 (q+e) v,AC (g*G/D) q,A3 (g*G/D) q,AI v,AI e] lemma zW (w:kJ) (h:(w&&&0x7FFFFFFF==0)=true):ZA w=0:=by have e:(w&&&0x7FFFFFFF)г=0:=by simp only[AQ] at h;rw[h];rfl rw[Ι] at e;simp only[kO] at e;rw[show (2147483647:ℕ)=2^31-1 by norm_num,γ] at e have g:=jc w;have j:=jf w have l:ZW w=0:=by unfold kU;have:(kI w)г=0:=by rw[g];omega have:kI w=0:=χ.mp (by rw[this];rfl) rw[AO this,j];omega rw[Y1,show (sv w:ℚ)=0 from (YN w).2 l,zero_mul] lemma jY (j g d:kJ) (o:у) (b:ф) (y:kI j≠255) (x:kI g≠255) (r:kI d≠255) (l:1<= rv (dw d)) (p:fv o) (m:|rv o-1/rv (dw d)|<=3/2^53/rv (dw d)):eR ⟨b,0,o,d,0⟩ j g (dw g)=ZT (ZA j*ZA g/ZA d):=by unfold eR;dsimp only;split next q=> simp only[ς,AF] at q;obtain ⟨I,J⟩:=dZ j y;obtain ⟨F,G,H⟩:=gp g o x p (iq _ _ l m);have u:=dB j y;obtain ⟨z,D⟩:=NF.fM _ _ I F (NE.z9 _ _ (pB _ _ 278 280 u H) XK);have e:=jd _ _ _ _ _ _ l m G D (NE.mo _ _ 281 u XK);obtain ⟨-,w⟩:=dZ d r;have:(ZA d:ℝ)≠0:=λh=>by simp[h] at w;linarith generalize dw j*(dw g*o)=v at* have B:=bU _ z;obtain ⟨t,A⟩:=te _ q.1;have:=μ.mp q.2;simp only[Α,ψ,kE] at this;rw[show 134217727=2^27-1 from rfl,γ] at this;apply eC _ z 4 _ t A (by simp;omega) (by simp;omega) rw[show ((ZA j*ZA g/ZA d:ℚ):ℝ)*2^149=rv (dw j)*rv (dw g)/rv (dw d) by rw[J,(dZ g x).2,w];push_cast;field_simp] generalize (eF v.toBits)б=E at t B⊢;have:(1:ℝ)/2^700<=2^((E:с)-1075):=by rw[one_div,<-ZF,<-BP];exact AH Г XI generalize (1:ℝ)/2^700=K at*;linarith[AI (rv v)] .split;(rw[zW j ‹_›,zero_mul,zero_div];rfl);rfl lemma gO (b:Д):(eF b)б<=2047:=by unfold eF;rw[ψ];exact Nat.and_le_right.trans (by simp) lemma jy (a b:ℝ) (j:|a|<=2^278) (l:|b|<=2^279):|a-b|<=2^280:=by have h:=AZ a 0 b;rw[BQ,zero_sub,abs_neg] at h;have e:(2:ℝ)^279=2*2^278:=by rw[<-BG] have g:(2:ℝ)^280=2*2^279:=by rw[<-BG] rw[e] at l;rw[g,e];clear e g;generalize (2:ℝ)^278=T at*;have:0<= T:=Ah (AI _) j;linarith lemma cS (n:ℕ) (l:1<= n) (d:ℕ->ℝ):∑j∈kG n,|d j|<= n*kQ ((∑j∈kG n,d j^2)/n):=by have g:(0:ℝ)|d j|) simp only[mj,sq_abs] at h;have e:(n:ℝ)*∑j∈kG n,d j^2=(n:ℝ)^2*((∑j∈kG n,d j^2)/n):=by field_simp calc _<= kQ ((n:ℝ)*∑j∈kG n,d j^2):=pj h _=_:=by rw[e,pO (Ax _),p7 g.le] lemma mR (n:ℕ) (p:1<= n) (v:n<=2^20) (S h W g m:ℝ) (r:|h|<= W) (z:|S-h|<=((n:ℝ)+3)/2*((1/2^53+1/2^73)*W)+((n:ℝ)+1)*(1/2^1074)) (q:|g-1/n|<=3/2^53/n) (u:|m-S*g|<=|S*g|/2^53+1/2^1075): |m-h/n|<=((n:ℝ)+13)/2^54*(W/n)+1/2^1040:=by obtain ⟨-,-,x,y⟩:=tS;have o:(1:ℝ)<= n:=mod_cast p;have j:(n:ℝ)<=2^20:=mod_cast v;have l:(0:ℝ)norm_num have:(1:ℝ)/2^1074*2^25<=1/2^1040:=by rw[Aj,Aq,BO XJ XJ,Aq,<-AM];exact AB Г Г refine Bp (e.trans ?_) l;rw[show n*(((n:ℝ)+13)/2^54*(W/n)+1/2^1040)=((n:ℝ)+13)/2^54*W+1/2^1040*n by field_simp] linarith[AC S h,AL u l.le,AL t (AI S),AL (show |n*g|<=1+3/2^53 by have:=AC (n*g) 1;rw[abs_one] at this;linarith) (AI S),AA j w,AA j x,AA j y,AA o (by positivity:(0:ℝ)<=1/2^1040)] lemma mE (n:ℕ) (P Q D R e δ W:ℝ) (l:(n:ℝ)+17<= P) (h:P<=2^21) (m:1<= Q) (j:1<= D) (r:δ<=((n:ℝ)+13)/2^54*(W/n)+1/2^1040) (p:W/n<= R+|e|) (o:R<= D*(1+1/2^22)) (q:|e|<= Q*D):δ<= P*Q/2^53*D:=by have g:W/n<= D*(1+1/2^22+Q):=by linarith have d:0<=D:=by linarith have:=AL g (by positivity:(0:ℝ)<=((n:ℝ)+13)/2^54) have:=AA (by linarith:(n:ℝ)+13<=P-4) (AY d (by linarith:0<=1+1/2^22+Q)) have:=AY (AY (by linarith:0<=P) d) (by linarith:0<=Q-1) have:=AY (by linarith:0<=2^21-P) d have:=AY d (by linarith:0<=Q) have:(1:ℝ)/2^1040<=1/2^54:=Ap XJ (AB Az XI);linarith lemma jS (n:ℕ) (q:n<=2^20) (V e g D:ℝ) (h:2^149<= e) (p:|V-e|<=((n:ℝ)+30)/2^54*e) (j:0linarith[ϑ V] lemma bI (n:ℕ) (p:n<=2^20) (V T δ D:ℝ) (r:0linarith[Ax δ] lemma ks (n:ℕ) (m:1<= n) (X:ℕ->ℝ) (a:ℝ):∑j∈kG n,(X j-a)^2= ∑j∈kG n,(X j-(∑k∈kG n,X k)/n)^2+n*((∑k∈kG n,X k)/n-a)^2:=by have l:(n:ℝ)≠0:=Nat.cast_ne_zero.2 А;generalize h:(∑k∈kG n,X k)/n=M have g:∑j∈kG n,(X j-M)=0:=by rw[ϱ,nV,mj,Bb,<-h];field_simp;ring have e:∀j,(X j-a)^2=(X j-M)^2+2*(M-a)*(X j-M)+(M-a)^2:=λj=>by ring simp only[e,ϛ,<-pA,g,nV,mj,Bb];ring lemma kz (d s p τ:ℝ) (e:0<=τ) (o:τ+2^58*τ^2<=1/2^1000) (m:|s-d|<=|d|/2^53+τ) (l:|p-s^2|<= s^2/2^53+τ): |p-d^2|<=4/2^53*d^2+1/2^1000:=by have g:=Ak (2*d*(s-d)) ((s-d)^2);rw[show 2*d*(s-d)+(s-d)^2=s^2-d^2 by ring,AU,AU,abs_two,abs_pow] at g have j:=AI (s-d);have h:=AI d;have q:(|s-d|)^2<=2*(|d|/2^53)^2+2*τ^2:=by nlinarith[Ax (|d|/2^53-τ)] have r:2*(|d|)*(|s-d|)<=2*(|d|)*(|d|/2^53+τ):=by nlinarith have t:2*(|d|)*τ<=2^57*τ^2+(|d|)^2/2^57:=by nlinarith[Ax (2^57*τ-|d|)] have u:s^2<= d^2+|s^2-d^2|:=by have:=BL (s^2-d^2);linarith have v:=AZ p (s^2) (d^2);have w:=sq_abs d;generalize (1:ℝ)/2^1000=ζ at* nlinarith lemma tL (w:kJ) (m:у) (g:kI w≠255) (p:fv m) (q:|rv m|<=2^279): fv ((dw w-m)*(dw w-m))/\|rv ((dw w-m)*(dw w-m))-(rv (dw w)-rv m)^2|<=4/2^53*(rv (dw w)-rv m)^2+1/2^1000/\(rv (dw w)-rv m)^2<=2^600:=by have e:=jy _ _ (dB _ g) q;obtain ⟨l,o⟩:=NF.fS _ _ (aD _ g).1 p (NE.z9 _ 280 e XK);have h:=rB _ _ 280 e o;obtain ⟨r,j⟩:=NF.fM _ _ l l (NE.z9 _ _ (pB _ _ _ _ h h) XK);rw[Bc,<-sq] at j;refine ⟨r,kz _ _ _ (1/2^1075) XJ ?_ o j,?_⟩ .have:(2:ℝ)^58*(1/2^1075)<=1:=by rw[mul_one_div,BT XJ];exact AB Г Г have:(1:ℝ)/2^1075<=1/2^1000/2:=by rw[div_div,<-Ar];gcongr<;>norm_num have:(0:ℝ)<=1/2^1075:=XJ;generalize (1:ℝ)/2^1075=τ at*;nlinarith .have:=BI (AI _) e 2;rw[sq_abs,<-Ba] at this exact this.trans (AB Г Г) lemma ka (m D:у) (j:Д) (o:fv m) (l:fv D) (t:1<= rv D) (h:j=if eF D.toBits<=eF m.toBits then eF m.toBits-eF D.toBits+1 else 0): |rv m|<=2^jб*rv D/\jб<=2048:=by subst h;have r:=br m o;have:=gO m.toBits;have:=gO D.toBits have g:¬eF D.toBits=0:=λp=>by have k:=br D l;rw[p] at k;linarith[BL (rv D),Be (by norm_num:(1:ℝ)<=2) (by simp:((0:Д).toNat:ℤ)-1022<=0)] have q:=fd D l g;rw[AK (by linarith)] at q generalize eF m.toBits=a,eF D.toBits=b at* have K:∀E:ℕ,(aб:ℤ)-1022<=E+(bб:ℤ)-1023->|rv m|<=2^E*rv D:=λE h=>r.le.trans ((AH Г (by omega:_<=(E:ℤ)+((b.toNat:ℤ)-1023))).trans (by rw[ZL ZQ,ZF];gcongr)) split<;>rename_i h .have:=θ.1 h;have e:(a-b+1)б=aб-bб+1:=by rw[ι,Η _ _ h];simp only[kE];omega rw[e];exact ⟨K _ А,А⟩ .have:=UInt64.le_iff_toNat_le.not.1 h;exact ⟨K _ (by simp;omega),XK⟩ lemma jn (n:о) (x:ZB) (r:о) (e:∀j?_ rw[(dZ _ (e j (ϊ.1 g))).2] lemma kB (n:о) (x:ZB) (r:о) (e:kJ) (g:∀j?_ rw[(dZ _ (g j (ϊ.1 h))).2,show (2:ℝ)^298=(2^149)^2 by rw[<-Ba]] ring lemma cE (E e g A:Д) (k:ℕ) (r:Eб<=2047) (p:eб<=254) (q:gб<=254) (o:Aб=k+1047) (t:k<=25): (NE.mx (NE.mx (E+5) (e+1051)) (g+A)-E)б=max (max (Eб+5) (eб+1051)) (gб+k+1047)-Eб:=by have j:(E+5)б=Eб+5:=by rw[ι];simp only[kE];omega have l:(e+1051)б=eб+1051:=by rw[ι];simp only[kE];omega have m:(g+A)б=gб+k+1047:=by rw[ι,o];omega have h:(NE.mx (NE.mx (E+5) (e+1051)) (g+A))б=max (max (Eб+5) (eб+1051)) (gб+k+1047):=by rw[NE.eg,NE.eg,j,l,m] rw[Η _ _ (θ.2 (by rw[h];omega)),h] lemma jW (n:о) (x:ZB) (r j:о) (hj:jby rw[h] at G;rw[G] at o;simp at o rw[show (rv (dw y)-rv m)*rv (dw g)/rv (dw d)+rv (dw l)-(((ZA y-lk n x r)*ZA g/ZA d+ZA l:ℚ):ℝ)*2^149= (((lk n x r:ℚ):ℝ)*2^149-rv m)*(rv (dw g)/rv (dw d)) by rw[x2,(dZ g D).2,G,Y];push_cast;field_simp;ring, AU,A3,BB,AK o] calc _<=2^k/2^53*rv (dw d)*(|rv (dw g)|/rv (dw d)):=AA hδ (BS (AI _) o.le) _=_:=by have:=o.ne';field_simp .exact kr n x r j g l d hj K lemma vp (n:ℕ) (e:n<=2^20) (V A E:ℝ) (j:0<= A) (l:2^149<= E) (h:|V-(A+E)|<=((n:ℝ)+30)/2^54*(A+E)):0ℝ) (m e V r D P Q:ℝ) (M:2^149<= e) (t:|V-((∑j∈kG n,(X j-m)^2)/n+e)|<=((n:ℝ)+30)/2^54*((∑j∈kG n,(X j-m)^2)/n+e)) (x:0X j-m);beta_reduce at y have:∑j∈kG n,|X j|<=∑j∈kG n,|X j-m|+n*|m|:=by simpa[ϛ] using Ϸ λj (_:j∈kG n)=>Ak (X j-m) m have K:=AL (Real.sqrt_le_sqrt (by linarith:(∑j∈BN n,(X j-m)^2)/n<=q)) o.le have l:=mE n P Q D (kQ q) m _ _ F w H u A (by rw[BM o];nlinarith) (by nlinarith[(Ae.1 h).1,ϑ q]) J refine ⟨l,?_⟩;have g:=ks n p X m;generalize ∑k∈kG n,X k=z at g l A⊢;rw[show q=((∑j∈kG n,(X j-z/n)^2)/n+e)+(m-z/n)^2 by rw[<-I,g,add_div,mul_div_cancel_left₀ _ o.ne'];ring] at t h exact bI n B V _ _ D В t (l.trans (by nlinarith)) h lemma dv {e n:о} {j:kJ} {x g:ZB} (h:cf e n j x g=true): kY e n j x g=true/\e*n+1<2^32/\n<=2^20/\rq nи.toInt64.toFloat (1/nи.toInt64.toFloat)=true:=by simp only[cf,ς,AF] at h;obtain ⟨⟨⟨l,o⟩,p⟩,m⟩:=h;exact ⟨by rw[<-iK];exact l,А,А,m⟩ lemma fY {e n:о} {j:kJ} {x g:ZB} (h:kY e n j x g=true):xв=e*n/\gв=n:=by simp only[kY,ς,ZH,A6] at h;exact ⟨by simpa using h.1.1.1.1.1.2,by simpa using h.1.1.1.1.2⟩ lemma i5 (e n:о) (t:Д) (p y:у) (l:kJ) (x g b:ZB) (v u:FloatArray) (A:e*n+1<2^32) (J:e*n<= xв) (H:n<= gв) (D:n<= bв) (o:n<= vд) (m:n<= uд) (F:о->kJ) (I:∀j∀M B z,(rL t (xD n x r l true) p y x (r*n)е ((r*n)е+nе) M B z).ok=true->∀j (RL e n t p y l x g b v u A J H D o m (r+1) w L)в=hв/\ ∀q,(RL e n t p y l x g b v u A J H D o m (r+1) w L)[q]! =if r*n<= q/\q?_⟩;rw[V,X,B,z,Ϗ,Μ];split_ifs<;>first|rfl|omega split .exact K _ _ (dW _ _ _ F _ (λj N=>by have:=β.mp N;rw[z] at this;rw[ck,ck,ck,iA,iA,Dense.ae (a:=(r*n)е) (b:=j) (by have:=κ;omega),(А:(r*n)еа+jа=r*n+jа),I _ this,E _ this] exact G r O _ _ _ ‹_› _ this) _ _ _) .exact K _ _ (dW _ _ _ F _ (λj N=>by have:=β.mp N;rw[z] at this;rw[B,Q r O _ this]) _ _ _) .exact ⟨rfl,λq=>(AJ λ⟨k1,k2⟩=>by have:=η n (Nat.le_of_not_lt ‹¬rkJ) (D:∀j∀H z v,(rR p (xD n x r l false) o u x (r*n)е ((r*n)е+nе) H z v).ok=true->∀j (RR e n p o u l x g t y E B m (r+1) w G)в=hв/\ ∀q,(RR e n p o u l x g t y E B m (r+1) w G)[q]! =if r*n<= q/\q?_⟩;rw[O,S,z,v,Ϗ,Μ];split_ifs<;>first|rfl|omega split .exact K _ _ (dW _ _ _ F _ (λj I=>by have:=β.mp I;rw[v] at this;rw[ck,ck,iA,Dense.ae (a:=(r*n)е) (b:=j) (by have:=κ;omega),(А:(r*n)еа+jа=r*n+jа),D _ this] exact A r J _ _ _ ‹_› _ this) _ _ _) .exact K _ _ (dW _ _ _ F _ (λj I=>by have:=β.mp I;rw[v] at this;rw[z,L r J _ this]) _ _ _) .exact ⟨rfl,λq=>(AJ λ⟨V,W⟩=>by have:=η n (Nat.le_of_not_lt ‹¬r(nI m n l x g)[q]!) (λj o=>(aE g).2 j XI) (λr y j o=>?_) (λr y N O Q p j o=>?_) 0 (lR (m*n) 0) XK .exact aX _ _ (by rw[s1,L,Υ]) λq F=>by rw[s2,AO ⟨XI,L▸F⟩] all_goals (obtain ⟨F,B,D⟩:=jh y o;simp only[nI,Qg _ F,B,D,Qg _ y]) obtain ⟨u,t,H,E⟩:=i7 v;obtain ⟨u1,u2,-,u4⟩:=uB y K;have A:∀jH _ А obtain ⟨X,Y⟩:=jw n u e G;obtain ⟨B,D,J⟩:=je l (fU v) t;obtain ⟨U,V,W⟩:=pS (λw=>dw w*dw w) x _ _ N O Q n _ u2 u4 e _ λj o=>tR _ (A j o) obtain ⟨M,I⟩:=vP n _ _ _ _ _ _ _ u e (p8 λj _=>Ax _) (sA n e _ λj o=>(tR _ (A j o)).2.2) XJ (nJ n e) U X B W V Y D J (ja l (fU v)) have S:=vp n e _ _ _ XJ J I rw[show (∑j∈ZM n,rv (dw x[r*n+j]!)^2)/n+(ZA l:ℝ)*2^298=((XH n x r 0+ZA l:ℚ):ℝ)*2^298 by rw[ls,Yk];push_cast;rw[add_mul,Aj,An,ϟ];congr 2;exact Ο rfl λj o=>by rw[BQ,(dZ _ (A j (by simpa using o))).2,mul_pow,<-Ba]] at I simp only[rR,ς] at p⊢;rw[<-i9 _ _ _ _ _ e M (Af (ip n x r 0) t) I (by gcongr;norm_num) (jF n x r l false u t) p.1] obtain ⟨w1,-,w3,w4,w5⟩:=i8 _ _ _ M S p.1 p.2;exact jY _ _ _ _ _ (A j o) (E j o) w1 w3 w4 w5 .rw[bc,Ag h] lemma ji {e n:о} {l:kJ} {x g b:ZB} (h:(cf e n l x g&&bв==n&&b.all n7)=true): cf e n l x g=true/\bв=n/\∀jNR.gP b (by simpa[nC] using p) j А⟩ def aG (rows n:о) (eps:п) (x g b:ZB):ZB:= if h:cf rows n eps x g&&bв==n&&b.all finiteWord then have l:=ji h;have d:=dv l.1;have z:=fY d.1 RL rows n (lw n) (dw eps*NR.pt 149) (1/nи.toInt64.toFloat) eps x g b (cy g) (cy b) d.2.1 А А А (by rw[(aE g).1];omega) (by rw[(aE b).1];omega) 0 (AP (rows*n) 0) (by simp) else layernormSpec rows n eps x g b lemma cn:aG=layernormSpec:=by funext o n m x g b;by_cases h:(cf o n m x g&&bв==n&&b.all n7)=true .rw[aG,AW h] obtain ⟨hl,hb,as⟩:=ji h;obtain ⟨E,hn,e,a1⟩:=dv hl;have z:=fY E;unfold layernormSpec layernormWith;rw[AO (by simp only[ς,AQ] at h⊢;exact ⟨⟨E,hb⟩,h.2⟩)] have hs:(mS o n m x g b)в=o*n:=by simp[mS] have ⟨s1,s2⟩:=i5 _ _ (lw n) (dw m*NR.pt 149) (1/nи.toInt64.toFloat) m _ _ _ _ _ hn z.1.ge z.2.ge hb.ge (by rw[(aE g).1];omega) (by rw[(aE b).1];omega) (λq=>(mS o n m x g b)[q]!) (λj p=>(aE g).2 j XI) (λj p=>(aE b).2 j XI) (λr O j p=>?_) (λr O L M N H j p=>?_) 0 (lR (o*n) 0) XK .exact aX _ _ (by rw[s1,hs,Υ]) λq I=>by rw[s2,AO ⟨XI,hs▸I⟩] all_goals (obtain ⟨I,U,V⟩:=jh O p;simp only[mS,Qg _ I,U,V,Qg _ O]) obtain ⟨t,v,a2,aH⟩:=i7 E;obtain ⟨u1,u2,-,u4⟩:=uB O hn;have l:∀ja2 _ А obtain ⟨l1,l2,-⟩:=jj n e;obtain ⟨r1,r2⟩:=jw n t e a1;have F:(0:ℝ)ℝ,∑k∈lj (r*n) (r*n+n),g k=∑j∈ZM n,g (r*n+j):=λg=>by rw[ϸ,ϐ] have G:∑j∈ZM n,|rv (dw x[r*n+j]!)|<= n*2^278:=by simpa using nG _ _ _ λj p=>dB _ (l j (ϊ.1 p)) have hW:_<=(2:ℝ)^298:=G.trans (by rw[show 298=20+278 from rfl,AM];gcongr) obtain ⟨p1,K⟩:=i4 dw x _ L M _ N (λk=>|rv (dw x[k]!)|) (λk k1 Q=>by obtain ⟨j,rfl⟩:∃j,k=r*n+j:=⟨k-r*n,А⟩;exact ⟨(aD _ (l j А)).1,AS⟩) (by rw[u2,u4,S];exact hW.trans (AB Г Г)) А rw[u2,u4,S,S,ϐ] at K;have B:=Ϣ (λj=>rv (dw x[r*n+j]!)) (ZM n) have J:=(AI _).trans B have I:|rv (PP dw x _ L M _ N 0 0)|<=2^299:=by have:=A2 (by linarith:(n:ℝ)+1<=2^21) (by gcongr<;>norm_num:(1:ℝ)/2^1074<=1/2^21) XJ XJ have:(2:ℝ)<=2^298:=le_self_pow₀ Г Г;rw[Ar];generalize (2:ℝ)^298=A at*;linarith[(AC _ _).trans K,AA aL J] obtain ⟨W,m2⟩:=NF.fM _ _ p1 r1 (NE.z9 _ _ (pB _ _ 299 1 I (iq _ _ (by exact_mod_cast t) r2)) Г) have f2:=mR n t e _ _ _ _ _ B K r2 m2 have f3:|rv (PP dw x _ L M _ N 0 0*(1/nи.toInt64.toFloat))|<=2^279:=by have Q:=BW B F.le;rw[<-AK F,<-BB,AK F] at Q;have:(1:ℝ)/2^1040<=1:=A1 (Aa Г) XJ;have:(2:ℝ)<=2^278:=le_self_pow₀ Г Г;rw[Ar];generalize (2:ℝ)^278=T at*;linarith[(AC _ _).trans f2,(BM F).2 (G.trans_eq (mul_comm _ _)),AA (show ((n:ℝ)+13)/2^54<=1/2 by linarith) (BS J F.le)] simp only[rL,ς,AF] at H⊢;obtain ⟨⟨o1,o2⟩,o3⟩:=H;obtain ⟨U,V,Y⟩:=je m (fU E) v;have ht:=λj p=>tL _ _ (l j p) W f3 obtain ⟨p1,K,p3⟩:=pS (λw=>(dw w-_)*(dw w-_)) x _ _ L M N n _ u2 u4 e _ ht obtain ⟨v1,v2⟩:=vP n _ _ _ _ _ _ _ t e (p8 λj _=>Ax _) (sA n e _ λj p=>(ht j p).2.2) XJ (nJ n e) p1 r1 U p3 K r2 V Y (ja m (fU E)) have D:=vp n e _ _ _ XJ Y v2;obtain ⟨-,-,-,q2,-,-,-,w0,-,w3⟩:=gM _ _ _ v1 D o1;obtain ⟨w1,w2,u,X,a0⟩:=i8 _ _ _ v1 D o1 o3;rw[<-(aD _ w0).2] at w3;obtain ⟨hm,a3⟩:=ka _ _ _ W (aD _ w1).1 u rfl;have y:=θ.1 o2;rw[ι,ν XI] at y obtain ⟨k1,Q⟩:=j8 n t e _ _ _ _ _ _ _ _ Y v2 D q2 w3 u hm f2 l2 (AB Г l1) (Aa Г) (by rw[<-AM];exact AB Г y) rw[<-i9 _ n _ _ _ e v1 (Af (ip n x r (lk n x r)) v) (by rw[kB n x r m l];exact Q) (by gcongr;norm_num) (jF n x r m true t v) o1] exact jW n x r j p _ _ _ _ _ _ _ _ (l j p) (aH j p) (as j p) w1 w2 u X a0 W f3 (by simp only[ι,kE];omega) y (by rw[jn n x r l,AM];exact k1) .rw[aG,Ag h] end Norm end def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.cB,Dense.eO⟩ conv:=⟨Conv.d0,Conv.ce⟩ elem:=⟨Conv.dr,Conv.dL,Bn.bX,Bn.be⟩ norm:=⟨Norm.bc,Norm.aG⟩ theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm, Dense.ec,Dense.gh,Conv.d4,Conv.cu,Conv.eU,Conv.eG, Bn.dp,Bn.co,Norm.cQ,Norm.cn] end Submission