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 shiftRight_eq_div_pow->ζ,and_two_pow_sub_one_eq_mod->θ,mod_eq_of_lt->μ,mul_le_mul_right->ν,shiftLeft_eq->χ,pow_le_pow_right->Κ,add_one_mul->Ρ,mul_comm->Τ,succ_mul->Υ,zero_add->ϋ,add_zero->ό,mul_assoc->ύ,mul_lt_mul_of_pos_right->ώ,toUInt64_eq->ϑ,and_le_right->ϓ,add_comm->ϕ,add_mul->ϙ,lt_log2_self->Ϛ,mul_lt_mul''->ϛ,div_lt_of_lt_mul->Ϝ,toUSize_eq->ϝ,mul_le_mul->Ϟ,mod_lt->ϣ,two_pow_pos->Ϥ,two_pow_add_eq_or_of_lt->Ϧ,mul_one->ϧ,zero_le->ϰ,mul_pos->ϲ,zero_mul->ϴ,add_mul_div_right->Ϸ,le_div_iff_mul_le->ϸ open UInt64 renaming lt_iff_toNat_lt->ι,toNat_add->ξ,le_iff_toNat_le->ο,toNat_inj->ς,toNat_ofNat_of_lt'->Α,toNat_shiftLeft->Ζ,toNat_shiftRight->Η,toNat_and->Θ,toNat_sub_of_le->Ι,toNat_sub->Λ,toNat_mul->ϊ,le_trans->ϖ,toNat_zero->ϡ,toNat_toUInt32->Ϭ open Bool renaming false_eq_true->υ,and_eq_true->Ε,eq_iff_iff->Ϣ open UInt32 renaming toNat_inj->Β,toNat_and->Ν,lt_iff_toNat_lt->Ο,toNat_shiftRight->Χ,toNat_toUInt64->ϫ,toNat_zero->ϯ open Finset renaming sum_range_succ->Μ,sum_congr->Ϙ,mem_range->ϩ,sum_le_sum->Ϻ open Array renaming getElem_ofFn->Ξ,size_replicate->ϐ,size_uset->ϒ,uset_eq_set->ϱ open Model renaming toModel_ofFloatModel->Ϗ,isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite->ϗ,toDyadic?_ofFields_of_isFinite->ϥ,toReal_roundDyadic_eq_roundAt->Ϩ,abs_signed_mul_bpow_le_toReal_posMaxFinite->ϭ,roundDyadicGeneral_eq_roundDyadic->ϻ open FloatLib.Numerics.Dyadic renaming cast_toRat->ϔ open Float.Model.UnpackedFloat renaming unpackExponent_packComponents->ϟ,unpackMantissa_packComponents->Ϡ open Int renaming cast_abs->ϳ,abs_eq_natAbs->Ϲ local notation "А" => by omega local notation "Б" => by decide local notation "В" => by positivity local notation "Г" => by norm_num local notation "Д" => UInt64 local notation "Е" => UInt32 local postfix:max "а"=>UInt64.toNat local postfix:max "б"=>USize.toNat local postfix:max "в"=>Array.size local postfix:max "г"=>FloatArray.size local postfix:max "д"=>UInt32.toNat local postfix:max "е"=>Nat.toUSize local postfix:max "ж"=>Nat.toUInt64 local postfix:max "з"=>Nat.log2 local postfix:max "и"=>Fin.val local postfix:max "й"=>UInt64.toUInt32 local postfix:max "к"=>Int.toNat local postfix:max "л"=>UInt32.toUInt64 local postfix:max "м"=>Int.natAbs local postfix:max "н"=>Int64.toInt open UInt64 renaming reduceToNat->kC,size->lu,toNat->lv,toUInt32->lM,toNat_toBitVec->mf,toNat_div->ms,toNat_or->mA,toNat_ofNat->mZ,toNat_one->ny,toNat_mod->nK,sub_add_cancel->n9,ofNat->pZ open USize renaming reduceToNat->kD,size->lq,toNat_mul->n4,ofNat_add->n5,ofNat->pq open FloatLib.Floats.Formats.BinaryInterchange.FloatFormat renaming binary64->kE open Finset renaming range->kF,abs_sum_le_sum_abs->lH,sum_range_succ'->lW,sum_nonneg->l9,sum_add_distrib->nY,sum_mul->pv,card_range->p9,sum_const->qh open ExactRuntime renaming Word->kG,expOf->kI,idxOf->kJ,mantOf->kR,toDyadic_ofUInt32->kS,signOf->kY,toWord->la,oneW->lm,mantOf_lt_24->lE,ConvShape->lG,dotOf->lV,finishWord->mi,finishWord_of_ne->mj,stableNormDomain->mv,windowAt->mw,fracOf->mz,sqrtRational->mO,expOf_toNat_lt->mR,conv2dSpec->m3,isFinite_ofUInt32->m9,ofIntDyadic->nf,maxpoolSpec->nk,rowMean->np,decodeD_toRat->nv,ofW->nM,Fmt->nN,decodeD->nU,dallNZ->pa,avgpoolWith->pA,ofUInt32_bits->pM,act->qr open FloatLib.Floats.Formats.BinaryInterchange.Model renaming roundDyadic->kH,ofFloatModel->kM,isNaN_eq_false_of_toDyadic?_some->kQ,unpackedToReal->ll,ofUInt32->ly,roundedMantissa_shift_quotient->lK,roundDyadic_of_representable->lP,roundAt_mono->lQ,unpackSign_packComponents->me,toReal_eq->mB,toReal_add_eq_roundAt->mL,toNatBits_lt_two_pow->mS,ofNatBits_toNatBits->m7,ofFloatModel_pack->nA,unpackedToDyadic?->nD,toReal->nR,pow2_eq_two_pow->n7,isFinite->pb,ofFloat32Model->po,add->pD,roundAt->pN,ofModel->pP,posMaxFinite->pR,modelSignBit->pS,pow2->qt open Nat renaming reduceMod->kK,mul_lt_mul_of_lt_of_le->lB,log2_self_le->lC,div_eq_of_lt->lF,pos_of_ne_zero->lO,le_log2->lT,testBit_eq_decide_div_mod_eq->lX,div_div_eq_div_mul->lY,le_mul_of_pos_left->lZ,cast_ofNat->l6,abs_cast->l7,div_lt_iff_lt_mul->mg,div_le_self->mE,div_add_mod->mG,div_mul_le_self->mK,mod_le->mT,add_mul_mod_self_right->mY,div_mod_unique->m0,add_right_comm->m6,log2_lt->na,one_shiftLeft->nb,reducePow->nt,le_mul_of_pos_right->nB,add_sub_cancel_left->nJ,and_two_pow->nZ,log2_eq_iff->n0,pow_add->pe,one_mul->pr,pow_lt_pow_right->pC,log2_eq_log_two->pF,div_eq_of_lt_le->pI,div_le_div_left->pK,cast_one->p0,div_one->qj,mod_one->ql open Float.Model.UnpackedFloat renaming unpack->kL,abs->kV,isFinite->kW,mul->lc,pack->lr,packedInfinity->lw,accuracyOfFraction->lR,roundWithAccuracy->no,unpackExponent->n8,packedZero->pG,round->pJ,Sign->p7 open FloatArray renaming emptyWithCapacity->kN,size->kX,set!->mC,usize->qg,uget->qp open FloatLib.Numerics renaming Dyadic->kO,binaryRadix->kP,roundQuotientEven->k9,shiftRightJam->lj,roundShiftRightEven_shiftRightJam->lU open Array renaming ofFn->kT,emptyWithCapacity->ld,getElem?_eq_getElem->lI,setIfInBounds->lJ,size_ofFn->lL,getElem?_eq_none->ma,ext->mq,replicate->mD,getElem?_ofFn->mJ,set!_eq_setIfInBounds->mN,ext_getElem?->mX,usize->nh,all_eq_true->nr,getElem!_set!_self->nw,getElem_replicate->nE,getElem!_set!_ne->nW,getElem_push->pT,getElem?_set->pU,getElem_set->qa,set!->qq open Float.Model renaming totalExponent->kU,pack->nC,add->qn,mul->qo open UInt32 renaming reduceToNat->kZ,toNat_ofNat'->mI,toUInt32_toUInt64->ns,toNat_sub->nz,toNat_shiftLeft->nP,le_iff_toNat_le->nV,toNat_sub_of_le->nX,ne_of_lt->n6,toNat->p8,toNat_add->qd open FloatLib.Numerics.Dyadic renaming ofScaledInt->lf,cast_signedSignificand->ni,toRat_eq_zero_iff->nO,signedSignificand->nQ,ofScaledInt_toRat->nT,add_toRat->pV,mul_toRat->pW,toReal->qc,toRat->qe open FloatLib.Numerics.RationalBinary renaming floorLog2->lh,scaleByPowerOfTwo->mc,scaleByPowerOfTwo_ofNat->my,lessThanPowerOfTwo->mQ,atLeastPowerOfTwo->m5 open Float.Model.Format renaming binary32->li,binary64->lx open FloatLib.Numerics.FixedWord renaming roundShiftRightEven->lk open Float.Model.UnpackedFloat.ExtendedMantissa renaming shiftRightOne->ls open BitVec renaming toInt_eq_toNat_cond->lA open List renaming foldl_cons->lN,foldl_append->mb,range_succ->mH,foldl_nil->pu,range->pX,range'->qi open FloatLib.Floats.Formats.Flocq renaming bpow->lS open Int renaming natAbs_mul->l5,log->mM,lt_zpow_succ_log_self->m8,ofNat_eq_natCast->pf,zpow_log_le_self->ph,ModEq->pE open FloatLib.Floats.ExecFloat.Binary renaming toModel_ofFloat_int64ToFloat->md open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->mP open Float32 renaming ofBits->mU open Bool renaming not_eq_true'->nj,or_eq_true->n3 open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState_exact_toRat->nx,dotState->pY open System.Platform renaming numBits->nF open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec->nG open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled->nI,toUInt32_ofFields->ps,roundRatScaled->pQ,toUInt32->qm open FloatLib.Floats.Formats.Flocq.bpow renaming pos->pj open MulZeroClass renaming zero_mul->qb open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div->qs local notation "о"=>Nat local notation "п"=>Int local notation "р"=>Array local notation "с"=>Word local notation "т"=>USize local notation "у"=>Float local notation "ф"=>Bool open _root_ renaming mul_le_mul_of_nonneg_right->AA,zpow_natCast->AB,zpow_le_zpow_right₀->AC,two_ne_zero->AD,ite_eq_right->AF,getElem!_pos->AG,pow_add->AH,ite_eq_left->AI,zpow_add₀->AJ,decide_eq_true_eq->AK,ite_false->AM,abs_nonneg->AN,mul_le_mul_of_nonneg_left->AO,mul_lt_mul_of_pos_right->AP,lt_of_lt_of_le->AQ,lt_of_le_of_lt->AR,beq_iff_eq->AS,bne_iff_ne->AT,ite_true->AU,pow_le_pow_right₀->AV,abs_mul->AW,abs_sub_abs_le_abs_sub->AX,le_rfl->AY,dite_eq_left->AZ,one_div_pow_le_one_div_pow_of_le->Aa,abs_of_pos->Ac,mul_nonneg->Ad,abs_of_nonneg->Ae,dite_eq_right->Af,abs_add_le->Ag,zpow_sub₀->Ah,lt_irrefl->Ai,zpow_le_one_of_nonpos₀->Ak,apply_ite->Al,mul_assoc->Ao,zero_add->Ap,ne_eq->Ar,getElem!_neg->As,one_mul->Av,abs_neg->Aw,mul_le_mul->Ax,le_trans->Az,abs_sub_comm->A0,two_pos->A7,abs_le->BA,zpow_add_one₀->BC,gt_iff_lt->BE,decide_eq_false_iff_not->BF,neg_mul->BG,abs_two->BH,lt_of_mul_lt_mul_right->BK open USize renaming reduceToNat->AE,size->A3,add_assoc->BY open Array renaming replicate->AL,emptyWithCapacity->Aq,ofFn->Au,mkEmpty->A6,size_set!->Bd open FloatArray renaming emptyWithCapacity->Aj open Model renaming div->Am,roundAt->A4,maximum->A5,ofFloatModel->BD,fma->BJ open Nat renaming log2->An,div_add_mod'->Ay,sub_zero->BB,shiftLeft_zero->BR,lt_of_lt_of_le->BS,lt_of_le_of_ne->BT,and_one_is_mod->BU,zero_lt_of_lt->BZ,le_of_lt_succ->Ba open ST.Prim.Ref renaming get->A9 open Void renaming mk->BI open UInt64 renaming toNat_lt->BL,le_of_lt->BM open UInt32 renaming zero_and->BN,toNat_or->BO,ofBitVec->BP,lt_asymm->BQ open Float32 renaming ofBits->BV open ConvShape renaming wo->BW,ho->BX open List renaming range'_succ->Bb open Finset renaming mul_sum->Bc open Float.Model.Format renaming targetExponent->Be local notation "Ж"=>4294967296 section open FloatLib.Numerics lemma aT (s:ф) (m:о) (e:п) (j:о) (h:j+25<= mз): kH nN ⟨s,lj m j,e+j⟩=kH nN ⟨s,m,e⟩:=by have l:m≠0:=by rintro rfl;simp at h have p:2^mз<= m:=lC l;have v:2^(j+1)<= m:=Az (Κ Г А) p;have g:(lj m j)з=mз-j:=log2_shiftRightJam m j v have u:lj m j≠0:= shiftRightJam_ne_zero m j (Az (Κ Г А) v) rw[<- ϻ,<- ϻ];unfold Model.roundDyadicGeneral;simp only[u,l,AS,AM,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 lU m j (a+1) А .congr 1 rw[((by clear*-;omega):mз-j-23=(mз-23)-j)] exact lU m j _ А end lemma ac (n:о) (f:о-> Е) (k:о) (e:kf iи)[k]! =f k:=by rw[AG _ k (by simpa using e),Ξ] namespace Core def tm (a b:с):п:=sv a*sv b*2^(idxOf a+idxOf b) def aj (n:о) (fa fb:о-> с):п:=∑k∈Finset.range n,tm (fa k) (fb k) def aq (n:о) (fa fb:о-> с):Prop:=∀k,k expOf (fa k)≠255/\expOf (fb k)≠255 lemma az (n:о) (e g:о-> kG): aj (n+1) e g=aj n e g+tm (e n) (g n):=Μ _ _ lemma aQ (n:о) (o p:о-> kG) (m:aq n o p): lV n o p=mi (aj n o p) (-298) (decide (n≠0)&& pa (kT (n:=n) λi=>o iи) (kT (n:=n) λi=>p iи) 0 n):=by unfold lV dotSpec Model.dot;set A:=kT (n:=n) λi=>o iи set B:=kT (n:=n) λi=>p iи set L:=A.map (ly (fmt:=nN));set R:=B.map (ly (fmt:=nN));have l:Lв=Rв:=by simp[L,R,A,B] have g:∀k (h:kby simp[L,A,m9] at h⊢;exact (m k h).1 have j:∀k (h:kby simp[R,B,m9] 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∈kF 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),lW,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:=(aj n o p:ℚ)*2^(-298:ℤ)) (by simp only[w,aj,L,A,B,Array.size_map,lL];congr 2;exact Ϙ rfl λk q=>by simp at q;simp[ac n _ k q]) have t:=nx (destination:=nN) L R l g j;by_cases r:aj n o p=0 .rw[r,finishWord_zero,Model.Reduction.dotWithStatus_eq_zero_of_finite nN L R .nearestEven l g j ((nO _).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 pY;rw[u,v];simp[L,A];rfl .rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero nN L R .nearestEven l g j (by rw[mP L R l,Ne,Except.ok.injEq,e];simpa)] exact (mj _ (aj n o p) (-298) _ r (by rw[t,e])).symm lemma br (n:о) (e g:о-> kG) (h:aq n e g) (j:aj n e g≠0): lV n e g=mi (aj n e g) (-298) false:=by simp[aQ n e g h,mi,j] @[inline] def fQ (w:Е):Д:=if (w>>>23)&&&255!=0 then 1 else 0 @[inline] def mW (w:Е):Д:=(w&&&8388607)л ||| (fQ w<<<23) @[inline] def iW (w:Е):Д:=((w>>>23)&&&255)л-fQ w def af (x:Д):п:=x.toBitVec.toInt lemma an (w:Е):(mW w)а=kR w:=by have g:(w&&&8388607)д<2^23:=by rw[Ν];exact AR ϓ Б unfold mW fQ kR kI mz;by_cases e:(w>>>23)&&&255=0 .simp[e] .simp only[show ((w>>>23)&&&255!=0)=true by simpa using e,e,AU,AM] rw[mA,ϫ,show ((1:Д)<<<23)а=2^23*1 from rfl,Nat.or_comm, <- Ϧ g,ϧ,ϕ] lemma am (w:Е):(iW w)а=kJ w:=by unfold iW fQ kJ kI;have j:=mR 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,AU,AM] rw[Ι _ _ (ο.mpr (by rw[ϫ];simpa using e)), ϫ] rfl lemma au (w:Е):kY w=true↔2^31<= wд:=by have:=w.toNat_lt rw[kY,AT,Ar,<- Β,Ν,show (0x80000000:Е)д=2^31 from rfl, nZ,lX] by_cases h:wд/2^31%2=1<;>simp[h]<;>omega lemma fc (w:Е):(w>>>31!=0)=kY w:=by have:=w.toNat_lt;rw[Ϣ,au];simp[<- Β,ζ] @[inline] def sx (k x:Д):Д:=bif x>>>k==0 then x else x>>>k @[inline] def sr (k x r:Д):Д:=bif x>>>k==0 then r else r+k @[inline] def ak (x0:Д):Д:= let x1:=sx 32 x0 let r1:=sr 32 x0 0 let x2:=sx 16 x1 let r2:=sr 16 x1 r1 let x3:=sx 8 x2 let r3:=sr 8 x2 r2 let x4:=sx 4 x3 let r4:=sr 4 x3 r3 let x5:=sx 2 x4 let r5:=sr 2 x4 r4 sr 1 x5 r5 @[inline] def dL (value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then 1 else 0) @[inline] def aU (value shift:Д):Д:= if shift==0 then value else if shift<64 then dL value shift else if shift==64 then (if value>0x8000000000000000 then 1 else 0) else 0 @[inline] def db (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 aD (sign:ф) (product scale:Д):Е:= if product==0 then if sign then 0x80000000 else 0 else let leading:=ak product let position:=leading+scale if position<172 then let fraction:= if scale<149 then aU product (149-scale) else product<<<(scale-149) if fraction==0 then (if sign then 0x80000000 else 0) else if fraction==8388608 then db sign 1 0 else db sign 0 fractionй else let roundedMantissa:= if leading<23 then product<<<(23-leading) else aU 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 db sign (normalizedPosition-171)й (dE normalizedMantissa) open Model.NativeBinary32 in lemma aX (n k:о) (h:n>>>k≠0):nз=k+(n>>>k)з:=by rw[ζ] at* have:=(lT (by rintro rfl;simp at h)).2 (Nat.div_pos_iff.1 (lO h)).2 rw[pF,pF,Nat.log_div_base_pow] at*;omega lemma ca (g r x k:Д) (p:kа<=32) (m:0simp[h,na,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 lv l have:=aX xа kа (by simpa[<- ς,j] using l) refine ⟨А,?_⟩ rw[ζ];exact Ϝ (by rwa[<- pe,(А:kа+kа=2*kа)]) lemma aw (x:Д):ak x=x.log2:=by apply ς.mp;obtain ⟨p,g⟩:=ca x 0 x 32 Б Б (by simp) x.toNat_lt obtain ⟨q,h⟩:=ca x _ _ 16 Б Б p g;obtain ⟨r,j⟩:=ca x _ _ 8 Б Б q h;obtain ⟨t,l⟩:=ca x _ _ 4 Б Б r j;obtain ⟨u,m⟩:=ca x _ _ 2 Б Б t l;obtain ⟨e,o⟩:=ca x _ _ 1 Б Б u m;rw[Nat.log2_def (sx 1 _)а,AF (by simpa using o)] at e unfold ak;exact e.symm lemma er (g e:Д): aU g e=lk g eа:=by unfold aU lk;by_cases h:e=0 .subst h;rfl have:=e.toNat_lt;have j:eа≠0:=by simpa[<- ς] using h simp only[h,j,AS,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,nb,μ (by omega:2^e.toNat<0x10000000000000000),Nat.one_le_two_pow] exact (ϣ _ (Ϥ _)).trans_le m have:((g>>>e)&&&1)а<=1:=by simp[Θ];omega have:=(g>>>e).toNat_lt simp only[dL,BE,ι,ξ,AS,<- ς, Al lv,ny,kC] generalize (g&&&((1<<>>e)&&&1)а=b at* split_ifs<;>(clear h j l;omega) lemma cM (n:Д):dE n=UInt32.ofNat (nа-8388608):=by unfold dE;split<;>simp_all[lM,Nat.toUInt32,ι,Ι,ο,Nat.sub_eq_zero_of_le,le_of_lt] open Model.NativeBinary32 in lemma a8 (w:Е):la (ofUInt32 w)=w:=by conv_rhs=>rw[<- toUInt32_ofUInt32 w] exact Β.mp (μ (BitVec.isLt _)) open Model.NativeBinary32 in lemma aO (g:ф) (m e:Д) (h:eа<=506): aD g m e=la (kH nN ⟨g,mа,(eа:п)-298⟩):=by erw[<- ofUInt32_roundDyadic,a8,<- roundProduct_eq_roundDyadic _ _ _ h];unfold aD roundProduct db mkBits;simp only[aw,er,cM,lM,Nat.toUInt32];rfl def aC (hi lo:Д):п:=af hi*2^64+loа @[inline] def aJ (hi lo:Д):Д:=if hi>>>63!=0 then (0:Д)-lo else lo @[inline] def bO (hi lo:Д):Д:= if hi>>>63!=0 then (if lo==0 then (0:Д)-hi else ~~~hi) else hi lemma de (e:Д):(e>>>63!=0)=decide (2^63<= eа):=by have:=e.toNat_lt;rw[Ϣ];simp[<- ς,ζ] lemma bm (e g:Д): aC e g=(eа*2^64+gа:п)-(if 2^63<= eа then 2^128 else 0):=by unfold aC af;rw[lA,mf];omega lemma eX (e g:Д): (aC e g)м=(bO e g)а*2^64+(aJ e g)а /\ decide (aC e g<0)=(e>>>63!=0):=by have:=e.toNat_lt;have:=g.toNat_lt;unfold bO aJ;rw[bm,de];by_cases h:2^63<= eа<;>simp only[h,decide_true,decide_false,AU,AM,υ] .split<;>simp_all[lu,UInt64.toNat_not,<- ς]<;>omega .simp;omega @[inline] def aB (hi lo B:Д):Д:= if hi==0&&lo==0 then Ж else if B>442 then Ж else let neg:=hi>>>63!=0 let mlo:=aJ hi lo let mhi:=bO hi lo if mhi==0 then (aD neg mlo B)л else if mhi>>>32==0 then let q:=(mhi<<<32)+(mlo>>>32) (aD neg (if mlo&&&0xFFFFFFFF==0 then q else q ||| 1) (B+32))л else (aD neg (if mlo==0 then mhi else mhi ||| 1) (B+64))л lemma aP (n:о) (o p:о-> kG) (g j B:Д) (r:aq n o p) (l:aj n o p=aC g j*2^Bа) (h:aB g j B<Ж):lV n o p=(aB g j B)й:=by obtain ⟨t,u⟩:=eX g j;have:=j.toNat_lt;have:=g.toNat_lt;simp only[aB] 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:aj n o p≠0:=by rw[l];refine mul_ne_zero (λq=>x ?_) В rw[bm] at q;simp only[Ε,AS,<- ς,ϡ];split at q<;>omega rw[br n o p r w,mj (nf (aC g j) ((Bа:п)-298)) _ _ _ w (by rw[toRat_ofIntDyadic,l];push_cast;rw[Ah AD,AB];field_simp),nf,u,t] symm;simp only[Al lM,ns];generalize bO g j=m at* generalize aJ g j=e at* have:=e.toNat_lt;simp only[ι,BE,kC,not_lt] at v;split<;>rename_i q<;>simp only[AS,<- ς,ϡ] at q .simp[q,aO _ _ B А] split<;>rename_i A<;>simp[<- ς,ζ] at A .rw[aO _ _ _ (by simp[ξ];omega),<- aT _ (mа*2^64+eа) _ 32 ((lT А).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,θ];clear*-;omega simp only[lj,kC,y,z,Al lv,mA,AS, <- ς] .rw[aO _ _ _ (by simp[ξ];omega),<- aT _ (mа*2^64+eа) _ 64 ((lT А).2 А)] congr 3 swap;. simp[ξ];omega simp only[lj,kC,(А:(mа*2^64+eа)/2^64=mа),(А:(mа*2^64+eа)%2^64=eа),Al lv,mA,AS, <- ς] @[inline] def ap (N:Д):Д:=(N+(0x3FFFFFFFFF:Д)+((N>>>39)&&&1))>>>39 @[inline] def cr (lb v B:Д):Д:= let m:=aJ v v let L:=ak m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then ((v>>>63)<<<31)+((E<<<23)+ap (m<<<(62-L))) else Ж @[inline] def bn (hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63) then cr 1 lo B else Ж if r=Ж then aB hi lo B else r lemma gq (n:ф) (e f:Е): (db n e f)д=(if n then 2^31 else 0)+eд%2^8*2^23+fд%2^23:=by have g:=ϣ fд (Ϥ 23);have:=ϣ eд (Ϥ 8) have h:((e&&&255)<<<23 ||| (f&&&8388607))д=2^23*(eд%2^8)+fд%2^23:=by rw[BO,nP,Ν,Ν,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 db;rw[UInt32.or_assoc];cases n<;>simp only[υ,↓reduceIte,UInt32.zero_or,BO,h] .omega .rw[show (0x80000000:Е)д=2^31*1 from rfl,<- Ϧ А];omega lemma bU (n:ф) (N h:Д) (m:2^62<= Nа) (o:Nа<2^63) (u:110<= hа) (l:hа<363): (aD n N h)д=(if n then 2^31 else 0)+((hа-110)*2^23+(ap N)а) /\ 2^23<=(ap N)а/\(ap 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,BU] have t:(ap 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:(aU N (62-23))а=(ap N)а/\2^23<=(ap N)а/\(ap N)а<=2^24:=by have q:(N&&&0x7FFFFFFFFF)а=Nа%2^39:=by rw[Θ];exact θ _ 39 rw[t];show (dL N 39)а=_/\_;unfold dL simp only[show ((1:Д)<<<39)-1=0x7FFFFFFFFF from rfl,show (1:Д)<<<(39-1)=0x4000000000 from rfl,BE,ι,ξ,q,g,p,Al lv,kC] clear*-j;split_ifs<;>omega refine ⟨?_,e.2⟩;unfold aD simp only[show ak N=62 by rw[aw,<- ς];exact (n0 (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,AM,υ] obtain ⟨e,g⟩:=e;generalize aU N (62-23)=R at e⊢;rw[<- e] at g⊢;clear*-g u l;by_cases r:Rа=16777216<;>simp[r,<- ς,cM,ι]<;>split<;>(try omega)<;>simp[gq,nz,qd]<;>omega lemma bV (n:ф) (M σ:Д) (g:Mа≠0) (e:σа<=506): aD n M σ=mi ((if n then-(Mа:п) else Mа)*2^σа) (-298) false:=by rw[aO _ _ _ e];refine (mj _ _ _ _ (mul_ne_zero (by split<;>omega) В) ?_).symm cases n<;>simp[qe,nQ,Ah]<;>field_simp lemma dD (t g B:Д):bn t g B=aB t g B:=by unfold bn;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[cr] at* split_ifs at*with r;swap;contradiction;generalize v:aJ g g=m at* have o:(ak m)а=mаз:=by rw[aw];rfl generalize ak m=L at* have:=m.toNat_lt;have:=B.toNat_lt;simp only[ι,Λ,ξ,o,kC] at r;have j:mа≠0:=А;have p:=lC j;have q:=@Ϛ mа;have:=(na j).2 (by omega:m.toNat<2^63) generalize mаз=l at* replace r:172<= l+Bа/\l+Bа<425:=А have E:aB ((0:Д)-(g>>>63)) g B=(aD (g>>>63!=0) m B)л:=by have G:g≠0:=by rintro rfl;subst v;simp[aJ] 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];clear*-r this;omega have e:=ν (2^(62-l)) p;have y:=ώ q (Ϥ (62-l));rw[<- AH,(А:l+(62-l)=62)] at e rw[<- AH,(А: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⟩:=bU (g>>>63!=0) (m<<<(62-L)) (B-(62-L)) А А А А have z:aD (g>>>63!=0) m B=aD (g>>>63!=0) (m<<<(62-L)) (B-(62-L)):=by rw[bV _ m B j А,bV,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]<;>(clear*-I r this;omega) end Core open Core lemma dV (w:kG):la (nM w)=w:=by apply Β.mp;simp only[la,nM,Model.toNatBits,pM,mI];exact μ w.toBitVec.isLt lemma aK (z:Model nN):nM (la z)=z:=by have h:z.toNatBits<2^32:=mS z;simp only[nM,la,ly,mI,μ h];exact m7 z namespace Dense lemma ag {k n:т} (h:ksplit<;>push_cast<;>omega @[inline] def bb (x:Е):Е:=x&&&0x7FFFFFFF lemma a9 (x:Е):(bb x)д=xд%2^31:=by unfold bb;rw[Ν];exact θ _ 31 lemma bC (x:Е):(kI x)д=(bb x)д/2^23:=by have:(kI x)д=xд/2^23%2^8:=by unfold kI;rw[Ν,Χ];simp only[kZ,kK,ζ];exact θ _ 8 rw[this,a9,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] lemma eN (x:Е):kI x=0↔(bb x)д<2^23:=by rw[<- Β,bC];simp;try omega lemma jV (x:Е):kJ x=(bb x)д/2^23-1:=by have:=bC x;unfold kJ;split<;>rename_i h .have:=(eN x).mp h;omega .have:=mt (eN x).mpr h;omega lemma bE (x:Е):kJ x=(kI x)д-1:=by rw[jV,bC] lemma iQ (w:Е):wд/2^23=(kI w)д+256*(wд/2^31):=by rw[bC,a9];have:=w.toNat_lt;omega lemma b8 (x:Е):(kI x)д<256:=by rw[bC,a9];omega lemma jT (w:Е):(w&&&8388607)д=wд%2^23:=by rw[Ν];exact θ _ 23 lemma bi (w:Е): |sv w| <2^24:=by have:=lE 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 i9 (y:Д):bl yа<=64:=by unfold bl;split;. omega rename_i h;have:=(na h).mpr y.toNat_lt;omega lemma dQ (y:Д):(y>>>1)а=yа/2:=by rw[Η];simp[ζ] lemma c6 (k:о):bl (k/2)=kз:=by unfold bl;rw[Nat.log2_def k];by_cases e:2<= k .rw[AF А,AI e] .rw[AI А,AF e] lemma da (y n:Д) (h:nа+bl yа<=64):(lz y n)а=nа+bl yа:=by rw[lz];by_cases g:y=0 .rw[AI g];subst g;simp .rw[AF g] have j:yа≠0:=λe=>g (ς.mp (by simpa using e)) have m:bl yа=bl (yа/2)+1:=by rw[c6];simp[bl,j] have l:(n+1)а=nа+1:=by rw[ξ];simp;omega rw[da (y>>>1) (n+1) (by rw[l,dQ];omega),l,dQ];omega termination_by yа decreasing_by rw[dQ];omega @[inline] def lg (x:Д):Д:=lz (x>>>1) 0 lemma jf (x:Д):lg x=x.log2:=by apply ς.mp;rw[lg,da _ _ (by have:=i9 (x>>>1);simpa using this),dQ,c6,ϡ,ϋ];rfl @[inline] def cL (lb v B:Д):Д:= let m:=Core.aJ 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.ap (m<<<(62-L))) else Ж lemma d9:cL=cr:=by funext e v B;simp only[cL,cr,aw,jf] @[inline] def bD (hi lo B:Д):Д:= let r:=if hi=(0:Д)-(lo>>>63) then cL 1 lo B else Ж if r=Ж then Core.aB hi lo B else r lemma cW:bD=bn:=by funext e g B;simp only[bD,bn,d9] lemma bj {k:т} {a:р Е} (h:k>>1>>>(63-s))+(if l'simp only[kC]<;>(clear e g o;omega) @[specialize] def jM (fa fb:о-> с) (n t:о) (B:Д):Д:= if t с) (n:о) (B:Д) (t:о) (pH pL nH nL:Д):Д:= if tsplit<;>push_cast<;>omega lemma ff (g j:о-> kG) (n:о) (B:Д) (hn:n<2^18): ∀k t (w x u v:Д),n-t=k-> t<= n-> aq t g j -> wа*2^64+xа<= t*2^108-> uа*2^64+vа<= t*2^108 -> aj t g j=(((wа*2^64+xа:о):п)-((uа*2^64+vа:о):п))* 2^Bа -> cV g j n B t w x u v<Ж-> lV n g j=(cV g j n B t w x u v)й:=by intro k;induction k<;>intro t w x u v hk ht hf M K N l .obtain rfl:t=n:=А rw[cV,AF А] at l⊢;exact aP _ _ _ _ _ _ hf (by rw[N,kB _ _ _ _ А А]) l rename_i k ih;have X:t(Nat.lt_succ_iff_lt_or_eq.mp F).elim (hf s) λe=>e ▸ ⟨I,J⟩ have p:kR (g t)*kR (j t)<2^48:= (ϛ (lE _) (lE _)).trans_eq Г have U:(mW (g t)*mW (j t))а=kR (g t)*kR (j t):=by rw[ϊ,an,an,μ (p.trans Г)] have E:=az t g j;have o:=ν (2^108) t.le_succ;split at l .rename_i G rw[AI G];have O:kR (g t)*kR (j t)=0:=by rw[<- U,beq_iff_eq.mp G];rfl refine ih (t+1) w x u v 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[AF G];obtain ⟨hB,Q⟩:=hw λh=>G (by simp[h]) have al:=idxOf_le _ I;have as:=idxOf_le _ J have S:(iW (g t)+iW (j t))а=kJ (g t)+kJ (j t):=by rw[ξ,am,am,μ А] rw[S] at hB have F:(iW (g t)+iW (j t)-B)а=kJ (g t)+kJ (j t)-Bа:=by rw[Ι _ _ (by rw[ο,S];omega),S] rw[F] at Q have W:(2:п)^(kJ (g t)+kJ (j t))=2^(kJ (g t)+kJ (j t)-Bа)*2^Bа:=by rw[<- AH];congr 1;clear*-hB;omega generalize m:(kR (g t)*kR (j t))*2^(kJ (g t)+kJ (j t)-Bа)=T have r:T<=2^108:= m ▸ (Ϟ p.le (Κ Г (by omega:_<=60))).trans_eq Г have D:tm (g t) (j t)=(if kY (g t)==kY (j t) then (T:п) else-T)*2^Bа:=by rw[<- m];unfold tm sv;rw[W];cases kY (g t)<;>cases kY (j t)<;>simp<;>ring have V:=λH L (ah:Hа*2^64+Lа<= t*2^108)=>fe H L _ _ (by rw[F];omega) (by rw[U,F,m];omega) rw[U,F,m] at V;cases hg:(kY (g t)==kY (j t))<;>simp only[hg,AU,AM,υ] at D l⊢ .have q:=V u v K refine ih (t+1) w x _ _ z A y (M.trans o) (by rw[q];exact Υ t _ ▸ Nat.add_le_add K r) ?_ l rw[E,N,q,D];push_cast;ring .have q:=V w x M refine ih (t+1) _ _ u v z A y (by rw[q];exact Υ t _ ▸ Nat.add_le_add M r) (K.trans o) ?_ l rw[E,N,q,D];push_cast;ring @[inline] def gb (n:о) (fa fb:о-> с):с:= let r:=if n<262144 then cV fa fb n (jM fa fb n 0 1023) 0 0 0 0 0 else Ж if r<Ж then rй else dotOf n fa fb lemma bY (n:о) (e g:о-> kG):gb n e g=lV n e g:=by unfold gb;dsimp only;by_cases j:n<262144 .rw[AI j];split .exact (ff e g n _ А _ 0 0 0 0 0 rfl А (λ_ h=>absurd h А) (by simp) (by simp) (by simp[aj]) ‹_›).symm .rfl .rw[AF j,AF Б] @[noinline] def aE (n:о) (relu:ф) (X W b:@& р с) (xo s j:о):с:= act relu (gb (n+1) (λt=>if tif trfl lemma gL (x y:у) (e:fv x) (g:fv y): kM (x+y).toModel=pD (kM x.toModel) (kM y.toModel):=by change kM (qn x.toModel y.toModel)=_;rw[qn,nA] have h:=Model.add_eq_ofModel_add_of_isFinite (fmt:=kE) Б (kM x.toModel) (kM y.toModel) (by rw[Ϗ];exact (ec x).1 e) (by rw[Ϗ];exact (ec y).1 g) rw[Ϗ,Ϗ] at h;exact h.symm lemma pm (E:п) (g:E<=971):(2:ℝ)^E<= nR (pR kE):=by have e:FloatFormat.binary64.maxNormalExponent-Int.ofNat FloatFormat.binary64.fracWidth=971:=Б have h:=ϭ kE false 1 E Б (by rw[e];exact g) simp only[υ,AM,p0,Av] at h;change |(2:ℝ)^E| <= _ at h simpa only[Ac (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): |A4 kE x-x| <= (2:ℝ)^(E-53)/2:=by by_cases e:x=0 .subst x;rw[Model.roundAt_zero];simp only[sub_zero,abs_zero];positivity have j:magnitude kP x<= E:=magnitude_le_of_abs_lt_bpow _ x E e g;apply (Model.abs_roundAt_sub_le kE x).trans;apply div_le_div_of_nonneg_right _ Г;change ulp kP (Model.fexpOf kE) x<=(2:ℝ)^(E-53);rw[ulp.of_ne_zero _ _ x e];change (2:ℝ)^(max (magnitude kP x-53) (-1074))<=(2:ℝ)^(E-53);apply AC Г;omega lemma fu (x y:у) (e:fv x) (g:fv y) (l: |rv x+rv y| <= nR (pR kE)): fv (x+y)/\rv (x+y)=pN kE (rv x+rv y):=by have j:=gL x y e g have h:=Model.isFinite_add_of_abs_toReal_add_le_posMaxFinite (kM x.toModel) (kM y.toModel) Б e g l refine ⟨by unfold fv;rw[j];exact h,?_⟩ unfold rv;rw[j];exact mL _ _ Б e g h lemma eR (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⟩:=fu x y m o (g.le.trans (pm E e));exact ⟨h,by rw[j];exact re _ E l g⟩ lemma rx (d:kO) (l:d.significand<2^53) (g:-1074<= d.exponent) (e: |d.toReal| <= (2:ℝ)^(971:п)): pN kE d.toReal=d.toReal:=by obtain ⟨h,j⟩:=lP kE Б d d.significand 0 (by simp) l g (e.trans (pm 971 AY)) rw[<- Ϩ _ Б d h,j] lemma jO (x y:у) (o:fv x) (p:fv y) (d:kO) (g:d.toReal=rv x+rv y) (m:d.significand<2^53) (l:-1074<= d.exponent) (e: |d.toReal| <= (2:ℝ)^(971:п)): fv (x+y)/\rv (x+y)=rv x+rv y:=by obtain ⟨h,j⟩:=fu x y o p (by rw[<- g];exact e.trans (pm 971 AY));exact ⟨h,by rw[j,<- g];exact rx d m l e⟩ lemma cN (i:Int64) (g:iнм<2^53):fv i.toFloat/\rv i.toFloat=iн:=by have h:kM i.toFloat.toModel= kH kE (lf iн 0):= md i have e:(lf iн 0).toReal=iн:=by rw[<- ϔ,nT];simp obtain ⟨j,l⟩:=lP kE Б (lf iн 0) iнм 0 (ϧ _).symm g (by change _<=(0:ℤ);decide) (by rw[e,<- ϳ,Ϲ];exact Az (by exact_mod_cast g.le) (pm 53 Г)) exact ⟨by unfold fv;rw[h];exact j,by unfold rv;rw[h,l,e]⟩ lemma jX (x y:у):kM (x*y).toModel= pP kE (lc lx x.toModel.unpack y.toModel.unpack):=by change kM (qo x.toModel y.toModel)=_;rw[qo,nA] lemma iP (b:BitVec 64) (s:p7) (m:о) (e:п) (h:0< m) (g:kL lx b=.finite s m e h): 2^52<= m\/e=-1074:=by revert g;unfold kL;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 Az Б Nat.left_le_or lemma gZ (x y:у) (z:fv x) (A:fv y) (w: |rv x*rv y| <= (2:ℝ)^(971:п)): fv (x*y)/\rv (x*y)=pN kE (rv x*rv y):=by simp only[ec] at z A;rw[ev x,ev y] at w⊢;unfold fv rv;rw[jX];generalize B:x.toModel.unpack=X at z w⊢;generalize D:y.toModel.unpack=Y at A w⊢;cases X<;>cases Y<;>simp only[kW,υ] at z A case finite.finite q l g u r m h v=> have E:=iP _ q l g u B;have F:=iP _ r m h v D have p:g+h<= Float.Model.Format.binary64.targetExponent (kU (l*m) (g+h)):=by change g+h<= max ((An (l*m):п)+1+(g+h)-53) (-1074);have:=(lT (n:=l*m) (k:=52) В).2;have:=nB l v;have:=lZ m u;omega let t:kO:=⟨xor (pS q) (pS r),l*m,g+h⟩ have j:pP kE (lc lx (.finite q l g u) (.finite r m h v))=kH kE t:=by rw[lc,Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ p];cases q<;>cases r<;>rfl have e:t.toReal=ll (.finite q l g u)*ll (.finite r m h v):= Model.Dyadic.toReal_mul ⟨_,l,g⟩ ⟨_,m,h⟩ have o:=ϗ kE Б t (by rw[e];exact w.trans (pm 971 AY)) rw[j];exact ⟨o,by rw[Ϩ _ Б t o,e]⟩ all_goals simp[lc,Model.isFinite_ofModel_zero kE Б, Model.toReal_ofModel_zero kE Б] lemma aZ (s:ф) (m:о) (e:п): (⟨s,m,e⟩:kO).toReal=(if s then-(m:ℝ) else m)*(2:ℝ)^e:=by simp only[qc,ni];split<;>simp def pw:о-> у | 0=>(1:Int64).toFloat | k+1=>let p:=pw k;p+p lemma iD (k:о) (h:k<=900):fv (pw k)/\rv (pw k)=(2:ℝ)^k:=by induction k with | zero=>have:=cN 1 Б;simp only[pw];exact ⟨this.1,by rw[this.2];simp⟩ | succ k g=> obtain ⟨f,v⟩:=g А have e:(⟨false,1,((k+1:о):п)⟩:kO).toReal=(2:ℝ)^(k+1):=by rw[aZ];simp only[υ,AM,p0,Av];exact AB 2 (k+1) have:=jO (pw k) (pw k) f f _ (by rw[e,v,pow_succ];ring) (show (1:о)<2^53 by norm_num) (А:(-1074:п)<=((k+1:о):п)) (by rw[e,Ac В,<- AB];exact AC Г А) simp only[pw];exact ⟨this.1,by rw[this.2,v,pow_succ];ring⟩ def nm:у:=(-1:Int64).toFloat def P:FloatArray:=⟨Au (n:=512) λi=>if iи<256 then pw (iи-1) else nm*pw (iи-256-1)⟩ lemma gB:Pг=512:=by simp[P,kX] lemma iZ (i:т) (h:iб>>23)д=wд/2^23:=by rw[Χ];simp[ζ] @[inline] def dw (w:Е):у:= (Core.mW w).toInt64.toFloat*P.uget (w>>>23).toUSize (by rw[gB,bA,iJ];have:=w.toNat_lt;omega) lemma bQ (z e:п):(nf z e).toReal=(z:ℝ)*(2:ℝ)^e:=by rw[<- ϔ,toRat_ofIntDyadic];push_cast;rfl lemma aS (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⟩:=gZ x y p q (by rw[h];exact g) have:=rx (nf z e) o m (by rw[bQ];exact g) rw[bQ] at this;exact ⟨j,by rw[l,h,this]⟩ lemma cl (w:Е):(sv w)м<2^24:=by have:=lE w;unfold sv;split<;>simp<;>omega lemma ci (a b c:о) (g:a+b<= c) (j:c<=971) (z:п) (h:zм<2^a): |(z:ℝ)*(2:ℝ)^(b:п)| <= (2:ℝ)^(971:п):=by rw[AW,Ac (by positivity:(0:ℝ)<2^(b:п)),AB] have e: |(z:ℝ)| <= 2^a:=by rw[<- ϳ,Ϲ];exact_mod_cast h.le refine (AA e В).trans ?_;rw[<- AH,<- AB];exact AC Г А lemma mV (u:Д) (n:о) (e:uа=n) (g:n<2^25): fv u.toInt64.toFloat/\rv u.toInt64.toFloat=(n:п):=by have:u.toInt64н=n:=by rw[show u.toInt64н=af u from rfl,ao,e];split<;>omega rw[<- this];exact cN _ (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).toUSize h) /\ ∃σ:п, (∀v,kY v=kY w-> σ*kR v=sv v)/\σм=1 /\ rv (A.uget (w>>>23).toUSize h)=σ*2^((kI w)д-c):=by have:=b8 w;have:=w.toNat_lt;have e:=au w;obtain ⟨l,m⟩:=iD ((kI w)д-c) А;rw[p,bA,iJ,iQ];split .rw[(А:(kI w)д+256*(wд/2^31)-c=(kI w)д-c)] exact ⟨l,1,λv g=>by simp only[sv,g,e];split<;>omega,rfl,by rw[m];push_cast;ring⟩ .rw[(А:(kI w)д+256*(wд/2^31)-256-c=(kI w)д-c)] have j:=cN (-1) Б obtain ⟨o,q⟩:=aS _ _ j.1 l (-1) ((kI w)д-c:ℕ) (by rw[j.2,m,AB];rfl) Б А (ci 1 _ 971 А AY _ Б) exact ⟨o,-1,λv g=>by simp only[sv,g,e];split<;>omega,rfl,by rw[<- AB];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*kR v) (x:kY v=kY w) (r:(q:ℝ)*2^((kI w)д-c)=2^kJ v): fv (u.toInt64.toFloat*A.uget (w>>>23).toUSize h) /\ rv (u.toInt64.toFloat*A.uget (w>>>23).toUSize h)=(sv v:ℝ)*2^kJ v:=by have:=lE v;have:=ν (kR v) t;have:=b8 w;obtain ⟨j,l⟩:=mV u _ y А;obtain ⟨m,σ,e,o,z⟩:=qV c A p w h;have g:(((q*kR v:о):п)*σ)м<2^25:=by rw[l5,o];simp;omega have:=aS _ _ j m _ ((kI w)д-c:о) (by rw[l,z,AB];push_cast;ring) (g.trans Г) А (ci 25 _ 971 А AY _ g) exact ⟨this.1,by rw[this.2,<- r,AB,<- e v x];push_cast;ring⟩ lemma bM (w:Е) (_:kI w≠255):fv (dw w)/\rv (dw w)=(sv w:ℝ)*2^kJ w:= dG 1 1 P iZ _ w w _ А (by simp[an]) rfl (by simp[bE]) lemma di (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⟩:=bM x l;obtain ⟨h,o⟩:=bM w j have e:(sv x*sv w)м<2^48:=by rw[l5];exact (ϛ (cl x) (cl w)).trans_eq Г have:=aS _ _ g h (sv x*sv w) (kJ x+kJ w:о) (by rw[m,o,AB,AH];push_cast;ring) (lt_trans e Г) А (ci 48 _ 971 (by rw[bE,bE];have:=b8 x;have:=b8 w;omega) AY _ e) refine ⟨this.1,?_⟩;rw[this.2,tm,AB];push_cast;ring @[inline] def eF (b:Д):Д:=(b>>>52)&&&2047 @[inline] def mF (b:Д):Д:=(b&&&0xfffffffffffff) ||| 0x10000000000000 lemma j0 (u:Д):(u&&&0x8000000000000000!=0)=(u>>>63!=0):=by apply Ϣ.mpr;simp only[AT,Ar,<- ς];rw[Θ,Η];change ¬uа&&&2^63=0↔¬uа>>>63=0;rw[nZ,ζ,lX];have e:uа/2^63<2:=by have h:=BL u;omega rw[μ e];by_cases g:uа/2^63=1<;>simp<;>omega lemma fw (v:у):kM v.toModel=Model.ofFields kE (v.toBits>>>63!=0) (((v.toBits>>>52)&&&2047)а) ((v.toBits&&&0xfffffffffffff)а):=by rw[<- Model.ofFields_signBit_expField_fracField (kM v.toModel)];congr 1;rw[<- j0];apply Ϣ.mpr;simp only[Model.signBit,AT,Ar];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 ⟨AR ϓ Б,AR ϓ Б⟩ lemma cq (v:у) (g:fv v) (j:¬eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)а+2^52, ((eF v.toBits)а:п)-1075⟩:kO).toReal:=by unfold eF at j⊢;have l:=(fq v).1;have m:=(fq v).2;have e:((v.toBits>>>52)&&&2047)а≠0:=λh=>j (ς.mp (by simpa using h)) unfold fv at g;unfold rv;rw[fw] at g⊢;rw[mB,ϥ _ _ _ _ l m g,AF e] simp only[show FloatFormat.binary64.fracWidth=52 from rfl,show FloatFormat.binary64.exponentBias=1023 from rfl, n7] congr 2<;>(try simp only[pf,l6])<;>ring lemma aK (z:Model nN):nM (la z)=z:=by have h:z.toNatBits<2^32:=mS z;simp only[nM,la,ly,mI,μ h];exact m7 z lemma dU (w:kG) (e:kI w≠255):nR (nM w)=(sv w:ℝ)*(2:ℝ)^((kJ w:п)-149):=by rw[nM,mB,kS w e];change (nU w).toReal=_;rw[<- ϔ,nv];push_cast;rfl lemma iy (w:kG) (l:kI w≠255) (o:w&&&0x7FFFFFFF≠0):nR (nM w)≠0:=by rw[dU w l];refine mul_ne_zero ?_ (zpow_ne_zero _ Г) have m:kR w≠0:=by unfold kR;split .rename_i e have g:=(eN w).mp e;rw[a9] at g;have j:(bb w)д≠0:=λh=>o (Β.mp (h.trans UInt32.toNat_zero.symm)) rw[a9] at j;unfold mz;rw[jT];omega .omega unfold sv;split<;>simp[m] lemma iI (g h j:kO) (o:g.toReal<= h.toReal) (p:h.toReal<= j.toReal) (x:la (kH nN g)=la (kH nN j)) (v:kI (la (kH nN g))≠255) (y:la (kH nN g)&&&0x7FFFFFFF≠0) (w: |h.toReal| <= (2:ℝ)^(127:п)): la (kH nN h)=la (kH nN g):=by have e:=aK (kH nN g);have l:pb (kH nN g)=true:=by rw[<- e,nM,m9];simpa using v have m:=ϗ nN Б h (w.trans ((ϭ nN false (2^23) 104 Б Б).trans' (by change _<= |(if false=true then (-1:ℝ) else 1)*((2^23:ℕ):ℝ)*(2:ℝ)^(104:ℤ)|;norm_num))) have u:kH nN j=kH nN g:=by rw[<- aK (kH nN j),<- x,e] have r:=Ϩ nN Б;have q:=lQ nN o;have t:=lQ nN p;rw[<- r g l,<- r h m] at q;rw[<- r h m,<- r j (by rw[u];exact l),u] at t rw[Model.eq_of_toReal_eq_of_nonzero m l (le_antisymm t q) (by rw[le_antisymm t q,<- e];exact iy _ v y)] lemma kr (x:о) (g:x<2^53) (e:x%2^29≠2^28): (ap (pZ (x*2^10)))а=(x+2^28)/2^29:=by simp only[ap,Η,ξ,Θ,kC, Α (by simp only[lu];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 Ж lemma rb (b:Д) (h:(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29&&&8388607!=0)=true): 2^28<=(b&&&0xfffffffffffff)а/\(b&&&0xfffffffffffff)а+2^28<2^52:=by simp only[AT,Ar,<- ς,Θ,Η,ξ, kC,kK,ζ] at h⊢ rw[θ _ 63,θ _ 23] at h;rw[θ _ 52];omega lemma ju (h E f:Д) (q:hа<2^63) (o:Eа<2048) (p:fа<2^52) (e:h+1075-E<=26) (j:E-1195<253) (g:((f+268435456)&&&536870911)-(((1:Д)<<<(h+1075-E))+1)< 536870911-(((1:Д)<<<(h+1075-E))+((1:Д)<<<(h+1075-E)))) (m:2^28<= fа/\fа+2^28<2^52): Eа<= hа+1075/\hа+1075-Eа<=26/\1195<= Eа/\Eа<=1447 /\ 2^(hа+1075-Eа)+1<=(fа+2^28)%2^29 /\ (fа+2^28)%2^29+2^(hа+1075-Eа)<2^29 /\ 2^(hа+1075-Eа)<= fа/\fа+2^(hа+1075-Eа)<2^52:=by simp only[ο,ι,Λ,ξ,Θ, Ζ,kC,ny,nb] at e j g have l:(2^64-Eа+(hа+1075)%2^64)%2^64=hа+1075-Eа:=(by clear*-e o q;omega);rw[l] at e g;have:=Κ (n:=2) Г e;rw[μ (by omega:_<64),θ _ 29] at g omega lemma fr (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,Λ,ξ,Ζ,Η, Θ,kC,kK,ζ,χ] at e⊢ rw[θ _ 11] at e⊢;rw[θ _ 63,θ _ 52];have:=b.toNat_lt;omega lemma bK (S:у) (hS:fv S) (h:Д) (hh:hа<2^63) (T:п) (x: |rv S-(T:ℝ)| <= (2:ℝ)^(hа:п)) (ah: |(T:ℝ)| <= (2:ℝ)^(425:п)) (F:ai S h<Ж):T≠0/\(ai S h)й=mi T (-298) false:=by unfold ai at F⊢;dsimp only at F⊢ split;swap;. simp[*] at F rename_i v;simp only[Ε,AK] at v;obtain ⟨⟨⟨Y,c2⟩,c3⟩,c4⟩:=v have I:(if (S.toBits>>>63!=0)=true then 2^31 else 0)=S.toBitsа/2^63*2^31:=by simp only[de,AK];have:=S.toBits.toNat_lt;split<;>omega obtain ⟨d1,d2,A,e2,u1,u2,f1,f2⟩:=ju h (eF S.toBits) _ hh (fq S).1 (fq S).2 Y c2 c3 (rb _ c4);have U:=fr S.toBits A;have Q:=cq S hS (λh0=>by rw[h0] at A;simp at A) rw[<- I] at U have H:(eF S.toBits-1085)а=(eF S.toBits)а-1085:=by rw[Λ];simp only[kC];omega generalize hW:lM _=W;generalize (S.toBits>>>63!=0)=y at* generalize (eF S.toBits)а=e at* generalize hG:2^(hа+1075-e)=G at* generalize (S.toBits&&&0xfffffffffffff)а=j at* have o:Wд=(if y then 2^31 else 0)+((e-1085-110)*2^23+(2^23+(j+2^28)/2^29)):=by rw[<- hW,Ϭ,U];split<;>(clear*-A e2 f2;omega) have O:∀N,j+2^52<= N+G-> N<= j+2^52+G -> la (kH nN ⟨y,N*2^10,((e-1085:ℕ):ℤ)-298⟩)=W:=λN l r=>by have n:=Α (show N*2^10by have:=bC W;simp only[J,a9,o,kZ] at this;split at this<;>(clear*-A e2 f2 this;omega) have X:W&&&0x7FFFFFFF≠0:=λJ=>by have:=a9 W;simp only[bb,J,o,ϯ] at this;split at this<;>(clear I o u1;omega) have p:=O (j+2^52-G) А А;have q:=O (j+2^52+G) А А;have D:Gby rw[Nat.cast_mul,Ao,Ao,Nat.cast_pow,l6,<- AB (2:ℝ) 10,<- AJ AD, <- AJ AD,(А:((10:ℕ):ℤ)+(((e-1085:ℕ):ℤ)-298)=(e:ℤ)-1075+-298)] have hu:(0:ℝ)<(2:ℝ)^((e:п)-1075):=В;have g:(0:ℝ)<(2:ℝ)^(-298:п):=В have u: |(nf T (-298)).toReal| <= (2:ℝ)^(127:п):=by rw[bQ,AW,Ac g,show (127:ℤ)=425+-298 by norm_num,AJ AD];gcongr rw[hU,Q] at x;generalize j+2^52=M at x p q D;have z:((M-G:ℕ):ℝ)=M-G:=Nat.cast_sub D.le;have E:(G:ℝ)simp only[υ,AM,AU] at x<;>obtain ⟨K,L⟩:=abs_le.mp x<;> have t:T≠0:=by rintro rfl;push_cast at K L;nlinarith only[K,L,E,hu] all_goals refine ⟨t,?_⟩;simp only[mi,t,↓reduceIte] on_goal 2=>refine ((iI _ _ _ ?_ ?_ (q.trans p.symm) (q ▸ V) (q ▸ X) u).trans q).symm refine ((iI _ _ _ ?_ ?_ (p.trans q.symm) (p ▸ V) (p ▸ X) u).trans p).symm;all_goals simp only[bQ,aZ,υ,AM,AU,BG,B,z];push_cast;nlinarith only[K,L,g] @[specialize] def ab (p:о-> у) (n t:о) (a:у):у:= if t п) (g:п) (B:ℝ) (h:∀tintro _;simpa using e | succ t j=> intro l;rw[Μ,<- add_assoc];push_cast;linarith[Ag ((g:ℝ)+∑s∈kF 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 lemma uk {i k:т} {S:о} (e:kб<8) (h:iб+8<= S) (g:S<2^32): (i+k)бsimp[*,AG] @[specialize] def bc (f:о-> у) (N:о) (Y:FloatArray):FloatArray:= if Yг у) (N:о):∀k (Y:FloatArray),N-Yг=k-> Yг<= N -> (bc f N Y)г=N/\(∀q q(bc f N Y).data[q]! =f q:=by intro k;induction k<;>intro Y t r .rw[bc,AF А];exact ⟨А,λq _=>rfl,λq j g=>А⟩ rename_i p;rw[bc,AI А];have u:=jB Y (f Yг);obtain ⟨m,h,o⟩:=p (Y.push (f Yг)) А А;refine ⟨m,λq l=>by rw[h q А,pg _ _ _ А,AI l],λq j g=>?_⟩ rcases eq_or_ne q Yг with rfl | e .rw[h _ А,pg _ _ _ А,AF (Ai _)] exact o q А g lemma jz (v:у) (h:(eF v.toBits)а<2047):fv v:=by unfold fv;rw[fw];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,AT,Ar];omega lemma fo (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=> (AP (by exact_mod_cast h:(m:ℝ)<2^k) (zpow_pos A7 e)).trans_le (by rw[<- AB,<- AJ AD];exact AC Г l) unfold rv eF;unfold fv at g;rw[fw] at g⊢;rw[mB,ϥ _ _ _ _ (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[kE,n7];omega) (by simp[kE];omega) lemma jE (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:=gL x y m o;have r:=mL _ _ Б m o (l ▸ t);unfold rv at h⊢;rw[l,r,abs_lt] at h;have q:=rx ⟨false,1,E⟩ Г g (by simp[aZ];exact AC Г j) have p:=rx ⟨true,1,E⟩ Г g (by simp[aZ];exact AC Г j) simp only[aZ,υ,AM,AU,p0,Av,BG] at q p exact abs_lt.2 ⟨lt_of_not_ge λe=>by linarith[lQ kE e], lt_of_not_ge λe=>by linarith[lQ kE e]⟩ @[specialize] def sT (p:о-> у) (n t:о) (a:у) (m:Д):у×Д:= if trename_i h<;>simp only[ι] at h<;>omega lemma jl (p:о-> у) (n:о):∀k t a m,n-t=k-> mа<=(sT p n t a m).2а:=by intro k;induction k with | zero=>intro t a m h;rw[sT,AF А] | succ k e=> intro t a m h;rw[sT,AI А];dsimp only;have:=e (t+1) (a+p t) (if m у) (z:о-> п) (r:п) (n K:о) (v:1<= K) (w:K<=1993) (y:∀t t<= n-> fv a -> |rv a-((r:ℝ)+∑s∈kF 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-((r:ℝ)+∑s∈kF n,(z s:ℝ))| <= n*(2:ℝ)^((K:п)-1076):=by intro m;induction m<;>intro t a M D E j h l .obtain rfl:t=n:=А rw[sT,AF (Ai _)];exact ⟨j,h⟩ rename_i A;have e:tlinarith only[g.1,g.2,h.1,h.2,B] lemma cw (n:о) (e g:о-> kG) (j:aq n e g) (S:у) (o:fv S) (h:Д) (r:hа<2^63) (p: |rv S-(aj n e g:ℝ)| <= (2:ℝ)^(hа:п)) (m: |(aj n e g:ℝ)| <= (2:ℝ)^(425:п)) (q:ai S h<Ж): (ai S h)й=lV n e g:=by obtain ⟨l,t⟩:=bK S o h r _ p m q;rw[t,br n e g j l] def aG (A:р с) (i:т) (m:Е):Е:= if h:i>>23)&&&255 aG A (i+1) (if m mд<=(aG A i m)д /\ ∀q,iб<= q-> q(kI A[q]!)д<=(aG A i m)д:=by intro k;induction k<;>intro i m v .have h:¬iby have:=bj h;omega rw[aG,Af h];exact ⟨AY,λq j g=>А⟩ rename_i u;have h:iby split<;>rename_i l<;>simp only[Ο] at l<;>omega obtain ⟨r,t⟩:=u (i+1) (if m<(A.uget i (bj h)>>>23)&&&255 then (A.uget i (bj h)>>>23)&&&255 else m) (by rw[ag h];omega) rw[p] at r;refine ⟨А,λq j g=>?_⟩ rcases eq_or_ne q iб with rfl | e .rw[<- dk A i (bj h)];unfold kI;omega exact t q (by rw[ag h];omega) g lemma cH (A:р kG) (l:Aвby rw[e] at g;simp at g j;omega,by rw[bE];omega⟩ @[specialize] def cU (k:о-> ф) (p:о-> у) (n t:о) (a:у):у:= if t у) (n:о):∀m t a,n-t=m-> ab p n t a=cU (λ_=>false) p n t a:=by intro m;induction m<;>intro t a h<;>unfold ab cU .grind .grind lemma gy (k:о-> ф) (p:о-> у) (z:о-> п) (g:п) (P L n:о) (E:∀t z t=0) (F:∀t t<= n-> fv a -> |rv a-((g:ℝ)+∑s∈kF t,(z s:ℝ))| <= t*((2:ℝ)^(P+L)*2^(-54:п)) -> fv (cU k p n t a) /\ |rv (cU k p n t a)-((g:ℝ)+∑s∈kF n,(z s:ℝ))| <= n*((2:ℝ)^(P+L)*2^(-54:п)):=by have x:(2:ℝ)^L*2^L*2^(-54:п)<=1:=by rw[<- AH,<- AB,<- AJ AD];exact Ak Г (by push_cast;omega) intro m;induction m<;>intro t a H I h q .obtain rfl:t=n:=А rw[cU,AF (Ai _)];exact ⟨h,q⟩ rename_i r;have e:tlinarith obtain ⟨v,u⟩:=jd a (p t) h w (P+L) А (by rw[AH,abs_lt];constructor<;>linarith) refine r (t+1) (a+p t) А А v ?_;push_cast[Μ,AH,BA] at u⊢;constructor<;>linarith lemma jK (a b:kG) (A B:о) (m:kJ a<= A) (o:kJ b<= B): |(tm a b:ℝ)| <= (2:ℝ)^(48+A+B):=by have g:=bi a;have h:=bi b have e:(tm a b)м<=2^(48+A+B):=by unfold tm;rw[l5,l5,Int.natAbs_pow];rw[Ϲ] at g h;have j:(sv a)м<=2^24:=А;have l:(sv b)м<=2^24:=А calc (sv a)м*(sv b)м*(2:п)м^(kJ a+kJ b) <= 2^24*2^24*2^(A+B):=by apply Ϟ (Ϟ j l);exact Κ Г А _=2^(48+A+B):=by rw[<- AH,<- AH];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 gx (Y:FloatArray) (o:т) (e:о-> у) (h:oб+8?_⟩ simp (disch:=(try simp only[ck,AE]);omega) only[s8,sg,ae,kD] split_ifs<;>first | rfl | omega | (congr 1;omega) lemma gD (X:р kG) (k:о):X.getD k 0=X[k]!:=by unfold Array.getD;split<;>rename_i h .rw[AG X k h];rfl .rw[As X k h];rfl @[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 gf (X:р kG) (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 with | zero=>intro q o Y _ _;exact ⟨rfl,λ_ _=>rfl,λτ r h=>absurd h А⟩ | succ k z=> intro q o Y w B;rw[Υ] at w;have:=ψ;have:=϶;obtain ⟨t,u⟩:=gx Y o (xr X q e) А;have v:(q+s)б=qб+sб:=ae А;have j:(o+8)б=oб+8:=by rw[ae (by simp;omega)];simp obtain ⟨x,g,y⟩:=z (q+s) (o+8) _ А (by rw[t];omega) rw[j] at g;rw[v,j] at y;refine ⟨by rw[bx,x,t],λp D=>by rw[bx,g p А,u p А,AF А],λτ r A l=>?_⟩ rw[bx];rcases τ with _ | τ .have m:(rе*e)б=r*eб:=by rw[n4,aa А,μ (by have:=ν eб l.le;omega)] rw[g _ А,u _ А,AI А,(А:oб+8*0+r-oб=r),xr, ae (by rw[m];have:=ν eб l.le;omega),m,gD];simp .grind def ZT:р FloatArray:=Au (n:=10) λk=>⟨AL (2^(kи+7)) 0⟩ def zT (n:о):FloatArray:= let k:=An (8*n)+1-7 if k<10 then ZT[k]! else ⟨AL (8*n) 0⟩ lemma jN (n:о):8*n<=(zT n)г/\((zT n)г=8*n\/(zT n)г<=2^16):=by unfold zT;dsimp only;split .rw[AG ZT _ (by simp[ZT];omega)] simp only[ZT,Ξ,kX,ϐ] exact ⟨(Ϛ (n:=8*n)).le.trans (Κ Б А), .inr (Κ Б А)⟩ .simp[kX] @[inline] def rX (X:р с) (i:т):у:=if h:i у) (bpf:Unit-> у) (aA:Unit-> с):с:= let r:=sT p n 0 (bpf ()) 0 let c:=if 1<= r.2а/\r.2а<=1993/\1076<= r.2а+L then ai r.1 (r.2а+L-1076)ж else Ж if c<Ж then act relu cй else aA () @[inline] def tf (relu:ф) (S:у) (hh:Д) (sl:Unit-> с):с:= let c:=ai S hh if c<Ж then act relu cй else sl () @[inline] def tw (relu:ф) (S:у) (hh:Д) (L n:о) (p:о-> у) (bpf:Unit-> у) (aA:Unit-> с):с:=tf relu S hh λ_=>tS relu L n p bpf aA lemma kx (h:ф) (n:о) (e g:о-> kG) (p:о-> у) (l:Unit-> у) (t:Д) (P L:о) (y:Unit-> kG) (H:∀sA s I.le) (A n AY) n AY).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[<- AH];exact AV Г А simp only[tw,tf,tS];split_ifs with F r w<;>try exact G .exact congrArg _ (cw _ _ _ j _ D t (by rw[x];omega) v o F) .obtain ⟨u,m⟩:=ey _ _ (tm (e n) (g n)) n _ r.1 r.2.1 H n 0 _ 0 rfl А q.1 (by simp[q.2]) AY rw[<- B] at m refine congrArg _ (cw _ _ _ j _ u _ ?_ (m.trans ?_) o w)<;> rw[ϑ,Α (by simp only[lu];omega)] .omega refine (AA (by exact_mod_cast (by omega:n<=2^L):(n:ℝ)<=2^L) В).trans_eq ?_ rw[<- AB,<- AJ AD];congr 1;omega .exact absurd ‹_› Б 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 lemma jF (z:ℝ): |A4 kE z-z| <= (2:ℝ)^(-53:п)* |z| +2^(-1075:п):=by by_cases h: |z| <(2:ℝ)^(-1021:п) .refine (re z (-1021) AY h).trans ?_ rw[div_eq_mul_inv,<- zpow_sub_one₀ AD];norm_num .have l:0< |z| :=AQ В (not_lt.1 h) have e:=ph (b:=2) Г l;have g:=m8 (b:=2) Г |z| simp only[l6] at e g have j:(-1021:п)<= mM 2 |z| +1:=by by_contra m;linarith[AC (by norm_num:(1:ℝ)<=2) (by omega:Int.log 2 |z| +1<=-1021)] refine (re z _ j g).trans ?_ rw[div_eq_mul_inv,<- zpow_sub_one₀ AD,show mM 2 |z| +1-53-1=-53+mM 2 |z| by ring, AJ AD] linarith[AO e (by positivity:(0:ℝ)<=2^(-53:п)), show (0:ℝ)<=2^(-1075:п) by positivity] lemma ks (x y:у) (h:fv x) (j:fv y) (g: |rv x+rv y| <= (2:ℝ)^(970:п)): fv (x+y) /\ |rv (x+y)-(rv x+rv y)| <= (2:ℝ)^(-53:п)* |rv x+rv y| +2^(-1075:п):=by obtain ⟨f,e⟩:=fu x y h j (g.trans ((AC Г Г).trans (pm 971 AY)));exact ⟨f,by rw[e];exact jF _⟩ lemma kt (x y:у) (h:fv x) (j:fv y) (g: |rv x*rv y| <= (2:ℝ)^(971:п)): fv (x*y) /\ |rv (x*y)-rv x*rv y| <= (2:ℝ)^(-53:п)* |rv x*rv y| +2^(-1075:п):=by obtain ⟨f,e⟩:=gZ x y h j g;exact ⟨f,by rw[e];exact jF _⟩ lemma i8 (v:у) (e:fv v) (g:eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)а,-1074⟩:kO).toReal:=by unfold eF at g;unfold fv at e;unfold rv;rw[fw] at e⊢;rw[mB,ϥ _ _ _ _ (fq v).1 (fq v).2 e,ite_eq_left (by rw[g];rfl)] split_ifs with h .dsimp only;rw[aZ,aZ,h];simp .rfl lemma jx (v:у) (g:fv v): |rv v| <(2:ℝ)^(((eF v.toBits)а:п)-1022):=by have h:=(fq v).2;by_cases e:eF v.toBits=0 .rw[i8 v g e,aZ,show (eF v.toBits)а=0 by rw[e];rfl, show (2:ℝ)^(((0:о):п)-1022)=2^52*2^(-1074:п) by rw[show (2:ℝ)^52=2^(52:п) by norm_num,<- AJ AD];norm_num] have:((v.toBits&&&0xfffffffffffff)а:ℝ)<2^52:=by exact_mod_cast h split<;>simp only[BG,Aw,AW,abs_zpow,BH,l7]<;> exact AP this В .rw[cq v g e,aZ,show (2:ℝ)^(((eF v.toBits)а:п)-1022)= 2^53*2^(((eF v.toBits)а:п)-1075) by rw[show (2:ℝ)^53=2^(53:п) by norm_num,<- AJ AD];congr 1;ring] have:(((v.toBits&&&0xfffffffffffff)а+2^52:о):ℝ)<2^53:=by exact_mod_cast (by omega:(v.toBits&&&0xfffffffffffff).toNat+2^52<2^53) split<;>simp only[BG,Aw,AW,abs_zpow,BH,l7]<;> exact AP this В lemma jH (p:о-> у) (z:о-> ℝ) (e:ℝ) (n:о) (J:∀t t<= n-> fv a -> |rv a-(e+∑s∈kF t,z s)| <= t*((2:ℝ)^(-53:п)*(1+2^(-20:п))*(|e| +∑s∈kF t,|z s|)+2^(-1074:п)) -> fv (ab p n t a) /\ |rv (ab p n t a)-(e+∑s∈kF n,z s)| <= n*((2:ℝ)^(-53:п)*(1+2^(-20:п))*(|e| +∑s∈kF n,|z s|)+2^(-1074:п)):=by have l:(2:ℝ)^(970:п)=2^(968:п)*4:=by rw[show (970:п)=968+2 by norm_num,AJ AD];norm_num have L:(2:ℝ)^(-1075:п)=2^(-1074:п)/2:=by rw[show (-1074:п)=-1075+1 by norm_num,BC AD];ring have u:(Ж:ℝ)*2^(-1074:п)<=2^(968:п):=by rw[show (Ж:ℝ)=2^(32:п) by norm_num,<- AJ AD] exact AC Г Г have o:(0:ℝ)<2^(-1074:п):=В;intro m;induction m with | zero=> intro t a I K q h;obtain rfl:t=n:=А;rw[ab,AF (Ai _)];exact ⟨q,h⟩ | succ m M=> intro t a I K q h;have j:tAN (z i)) have w:=(Ag e _).trans (add_le_add AY (lH z (kF (t+1))));simp only[Μ] at v w;have x:=Ag (rv a-(e+∑s∈kF t,z s)) (e+(∑s∈kF t,z s+z t)) rw[show rv a-(e+∑s∈kF t,z s)+(e+(∑s∈kF t,z s+z t))=rv a+rv (p t) by rw[y];ring] at x have g:(t:ℝ)<=Ж:=by exact_mod_cast (by omega:t<=2^32) have N:=AA g (AN e);have O:=AA g (l9 λi (_:i∈kF t)=>AN (z i)) have W:=AA g (AN (z t));have Q:=AA g o.le;have r:0<= ∑s∈kF t,|z s| :=l9 λi _=>AN (z i) have X:=Ad (Nat.cast_nonneg t:(0:ℝ)<= t) (AN (z t));have S:=AN e;have U:=AN (z t) have F: |rv a-(e+∑s∈kF t,z s)| <= 1/9007199254740992*(1+1/1048576)*(t* |e|)+ 1/9007199254740992*(1+1/1048576)*(t*∑s∈kF t,|z s|)+t*2^(-1074:п):=h.trans_eq (by ring) obtain ⟨D,B⟩:=ks a (p t) q E (by rw[l];generalize (2:ℝ)^(968:п)=H at*;generalize (2:ℝ)^(-1074:п)=η at* linarith only[x,F,w,v,G,N,O,Q,u,r,S,U,o]) refine M (t+1) (a+p t) А А D ?_;rw[L,show (2:ℝ)^(-53:п)=1/9007199254740992 by norm_num] at B have A:=Ag (rv (a+p t)-(rv a+rv (p t))) (rv a-(e+∑s∈kF t,z s)) rw[show rv (a+p t)-(rv a+rv (p t))+(rv a-(e+∑s∈kF t,z s))= rv (a+p t)-(e+(∑s∈kF t,z s+z t)) by rw[y];ring] at A simp only[Μ];generalize (2:ℝ)^(-1074:п)=η at* calc _<=1/9007199254740992*(1+1/1048576)*(t* |e| +t*∑s∈kF t,|z s| +t* |z t| + (|e| +(∑s∈kF t,|z s| + |z t|)))+t*η+η:=by linarith _=_:=by push_cast;ring lemma jq (m:Float.Model):(nC m.unpack.abs).unpack=m.unpack.abs:=by have g:(nC m.unpack).unpack=m.unpack:=by have:=Model.toFloatModel_ofFloatModel m;conv_rhs=>rw[<- this] rfl generalize m.unpack=u at g⊢;simp only[nC,Float.Model.unpack,UInt64.toBitVec_ofBitVec] at g⊢;cases u with | notANumber=>exact g | finite s j e h=> simp only[kV,lr,lw] at g⊢;split_ifs at g⊢<;> simp only[kL,ϟ, Ϡ,me] at g⊢<;> split_ifs at g⊢<;>simp_all | _=> simp only[kV,lr,lw, pG,kL, ϟ,Ϡ, me] at g⊢ split_ifs at g⊢<;>simp_all lemma jS (v:у) (g:fv v):fv v.abs/\rv v.abs= |rv v| :=by have e:v.abs.toModel.unpack=v.toModel.unpack.abs:=jq v.toModel;rw[ec] at g⊢;rw[ev,ev,e];generalize v.toModel.unpack=u at g⊢;cases u with | notANumber | infinity _=>simp[kW] at g | zero _=>simp[kV,kW,ll,nD] | finite s l e j=> refine ⟨by simp[kV,kW],?_⟩ simp only[kV,Model.unpackedToReal_finite,AW];have h:=pj kP e;split<;>split<;>simp_all[Ac h] lemma kb (S:у) (m:fv S) (h:Д) (D:hа<2^63) (T:ℝ) (B: |rv S-T| <= (2:ℝ)^(hа:п)) (e:ai S h<Ж): |T| <= (2:ℝ)^(425:п):=by unfold ai at e;dsimp only at e;split at e swap;. exact absurd e Б rename_i g;simp only[Ε,AK] at g;obtain ⟨⟨⟨r,t⟩,u⟩,v⟩:=g;obtain ⟨w,x,l,y,-,-,-,o⟩:=ju h (eF S.toBits) (S.toBits&&&0xfffffffffffff) D (fq S).1 (fq S).2 r t u (rb _ v);have j:=cq S m (λz=>by rw[z] at l;simp at l) rw[aZ] at j;generalize (eF S.toBits)а=E at w x l y o j;generalize (S.toBits&&&0xfffffffffffff)а=f at o j;have q:(0:ℝ)<2^((E:п)-1075):=В have A:((f+2^52:о):ℝ)+((2^(hа+1075-E):о):ℝ)<=2^53:=by exact_mod_cast (by omega:f+2^52+2^(h.toNat+1075-E)<=2^53) have m: |rv S| =((f+2^52:о):ℝ)*2^((E:п)-1075):=by rw[j,AW,Ac q];split<;>simp only[Aw,l7] have:=abs_sub (rv S) (rv S-T);rw[sub_sub_cancel,m] at this rw[show (2:ℝ)^(hа:п)=((2^(hа+1075-E):о):ℝ)*2^((E:п)-1075) by push_cast;rw[<- AB,<- AJ AD];congr 1;omega] at B have p:(2:ℝ)^(53:о)*2^((E:п)-1075)<=2^(425:п):=by rw[<- AB,<- AJ AD];exact AC Г А linarith[AA A q.le] lemma jv (n:о) (g j:о-> kG) (e:aq n g j) (S:у) (l:fv S) (h:Д) (p:hа<2^63) (m: |rv S-(aj n g j:ℝ)| <= (2:ℝ)^(hа:п)) (o:ai S h<Ж):(ai S h)й=lV n g j:= cw n g j e S l h p m (kb S l h p _ m o) o lemma f7 (Y:FloatArray) (g:Yг<2^32) (i:т) (v:у):wF Y i v=Y.set! iб v:=by rcases Y with ⟨d⟩;unfold wF;split next h=>simp only[FloatArray.uset,mC,Array.uset,qq,lJ];rw[dite_eq_left (show iб simp only[mC,qq,lJ] rw[dite_eq_right λe=>h (by rw[γ,qg,aa (AQ g ψ)];exact e)] lemma fW (X:р kG) (g:Xв<2^32) (i:т):rX X i=dw X[iб]!:=by unfold rX;split .rw[dk] next h=> rw[As X _ λe=>h (by rw[γ,nh,aa (AQ g ψ)];exact e)];rfl lemma cZ (p:о-> у) (n:о):∀m t a,n-t=m -> ab p (n+1) (t+1) a=ab (λτ=>p (τ+1)) n t a:=by intro m;induction m with | zero=>intro t a h;unfold ab;rw[AF А,AF А] | succ m e=>intro t a h;unfold ab;rw[AI А,AI А];exact e (t+1) _ А lemma ka (n:ℕ) (σ l E A C H M:ℝ) (v:0<= σ) (e:0omega obtain ⟨x,j⟩:=cN (9*(n+1))ж.toInt64 (by rw[e];simp;omega) rw[e] at j;push_cast at j have t:(2:ℝ)^(((eF ((9*(n+1))ж.toInt64.toFloat*a).toBits)а:п)-1022) <= 2^(((cE (9*(n+1))ж.toInt64.toFloat a)а:п)+56):=by apply AC Г;unfold cE;dsimp only;split .rw[Ι _ _ (BM ‹_›)];have:=ι.mp ‹_› simp only[kC] at this⊢;omega .have:=ο.mp (UInt64.not_lt.mp ‹_›);simp only[kC] at this⊢;omega have u:(n:ℝ)<=536870912:=by exact_mod_cast I.le have J:(2:ℝ)^(-1074:п)=2^(-1075:п)*2:=by rw[<- BC AD];norm_num have W:(2:ℝ)^(-1075:п)*2^64<=2^(-900:п):=by rw[<- AB,<- AJ AD];exact AC Г Г have U:(2:ℝ)^40*2^(400:п)<=2^(971:п):=by rw[<- AB,<- AJ AD];exact AC Г Г have V:(1:ℝ)<=2^(400:п):=one_le_zpow₀ Г Г;have h:(0:ℝ)<2^(-1075:п):=В;have G:(2:ℝ)^(-900:п)<=1:=Ak Г Г rw[show (2:ℝ)^(-53:п)=1/9007199254740992 by norm_num,show (2:ℝ)^(-20:п)=1/1048576 by norm_num, J,mul_add,<- Ao] at g have X:=AA u h.le;generalize H:(n:ℝ)*(1/9007199254740992*(1+1/1048576))=L at g;have o:L<=1/8388608:=by rw[<- H];nlinarith have Y:=AA o v have B: |rv a| <= 3*2^(400:п):=by have:=AX (rv a) σ;rw[Ae v] at this;generalize (2:ℝ)^(-1075:п)=y at*;generalize (2:ℝ)^(-900:п)=ε at* generalize (2:ℝ)^(400:п)=Z at*;linarith have F: |rv (9*(n+1))ж.toInt64.toFloat*rv a| <= 2^(971:п):=by rw[j,AW,Ac В];have:=AO B (by positivity:(0:ℝ)<=9*(n+1)) have:=AA u (by positivity:(0:ℝ)<=2^(400:п)) generalize (2:ℝ)^(400:п)=Z at*;generalize (2:ℝ)^(971:п)=M at*;linarith obtain ⟨p,l⟩:=kt _ a x E F;have S:=lt_of_le_of_lt' t (AR (AN _) (jx _ p));have O:=AQ (AR (le_abs_self _) (jx _ p)) t;rw[j,show (2:ℝ)^(-53:п)=1/9007199254740992 by norm_num] at l rw[show (2:ℝ)^(-20:п)=1/1048576 by norm_num] generalize (2:ℝ)^(((cE (9*(n+1))ж.toInt64.toFloat a)а:п)+56)=Q at* generalize rv ((9*(n+1))ж.toInt64.toFloat*a)=P at* generalize rv a=A at* generalize (2:ℝ)^(-1075:п)=y at* generalize (2:ℝ)^(-900:п)=ε at* have m:(n:ℝ)*(y*2)<=1073741824*y:=by linarith generalize (n:ℝ)*(y*2)=w at g m;have r:(0:ℝ)<=9*(n+1):=В;have D:=AA (by linarith:9*((n:ℝ)+1)<=2^33) h.le generalize 9*((n:ℝ)+1)=N at* obtain ⟨z,-⟩:=abs_le.mp g;rcases le_or_gt 0 A with q | q .rw[Ae (Ad r q)] at l have:=AO z (by linarith:0<= N*(1-1/9007199254740992)) nlinarith[(abs_le.mp l).1] .have:=AO (by linarith:σ<=2*w) r nlinarith lemma jw (x:kG) (e:kI x≠255): |rv (dw x)| <= 2^(277:п):=by rw[(bM x e).2,AW,abs_pow,BH];have:(kI x)д≠255:=λh=>e (Β.mp (by simpa using h)) have:=b8 x calc _<=(2:ℝ)^24*2^253:=Ax (by rw[<- ϳ];exact_mod_cast (bi x).le) (AV Г (by rw[bE];omega)) В В _=2^(277:п):=by rw[<- AH,<- AB];rfl lemma f0:fv (0:у)/\rv (0:у)=0:=by have e:(0:у).toModel.unpack=.zero .positive:=rfl;refine ⟨by rw[ec,e];rfl,by rw[ev,e];simp[ll,nD]⟩ lemma kd (b s e τ r:о) (p:s<2^32) (j:e<2^32) (q:τ<2^32) (o:r<2^32) (h:b+τ*s+r*e<2^32): (bе+τе*sе+rе*eе)б=b+τ*s+r*e:=by have:=ψ;have:=϶ have m:∀x y:о,x<2^32-> y<2^32-> x*y<2^32->(xе*yе)б=x*y:= λx y t u h=>by rw[n4,aa А,aa А,μ А] have g:=m τ s q p А;have l:=m r e o j А rw[ae (by rw[ae (by rw[aa А,g];omega),aa А,g,l];omega), ae (by rw[aa А,g];omega),aa А,g,l] lemma jp (b:kG) (e:о) (h:kJ b<= e): |(tm lm b:ℝ)| <= 2^(173+e):=by unfold tm rw[(Б:sv lm=2^23),(Б:kJ lm=126),Int.cast_mul,Int.cast_mul,AW,AW, Int.cast_pow,Int.cast_pow,Int.cast_ofNat,abs_pow,abs_pow,BH] have g: |(sv b:ℝ)| <= 2^24:=by rw[<- ϳ];exact_mod_cast (bi _).le calc (2:ℝ)^23* |(sv b:ℝ)| *2^(126+kJ b)<=2^23*2^24*2^(126+e):=by gcongr;norm_num _=2^(173+e):=by rw[<- AH,<- AH];congr 1;omega lemma jc (b:Д):(eF b)а<=2047:=by unfold eF;simp only[Θ,kC];exact ϓ lemma ja (F a:у):(cE F a)а<=969:=by unfold cE;dsimp only;split .rename_i h;have:=jc (F*a).toBits;have e:=ι.mp h rw[Ι _ _ (BM h)];simp only[kC] at e⊢;omega .simp abbrev Iv (F:о-> с) (a:р с) (P:о-> Prop) (A:р с):Prop:= Aв=aв /\ ∀q,(A[q]?=a[q]? \/ A[q]?=some (F q))/\(P q-> q A[q]?=some (F q)) lemma eh (F:о-> kG) (g j:р kG) (S U:о-> Prop) (l:∀q,U q-> S q) (h:Iv F g S j):Iv F g U j:= ⟨h.1,λq=>⟨(h.2 q).1,λe m=>(h.2 q).2 (l q e) m⟩⟩ @[specialize] def bP {α:Type} (f:о-> α) (N:о) (a:р α):р α:= if aв α) (N:о): bP f N (ld N)=kT (n:=N) λq=>f qи:=by suffices h:∀k (a:р α),N-aв=k-> aв<= N->(∀i (h:i bP f N a=kT (n:=N) λq=>f qи from h _ _ rfl (by simp) (λi h=>by simp at h) intro k;induction k with | zero=> intro a l j e;rw[bP,AF А];exact mq (by simp;omega) λi g _=>by rw[e i g,Ξ] | succ k m=> intro a l j e;rw[bP,AI А];refine m _ (by simp;omega) (by simp;omega) λi h=>?_ rw[pT];split .exact e i ‹_› .grind lemma dN (n:о) (g e:о-> kG):∀c i,i+c=n -> pa (kT (n:=n+1) λt=>if tиif tиg tи) (kT (n:=n) λt=>e tи) i c:=by intro c;induction c with | zero=> intro i h;obtain rfl:i=n:=А simp only[pa,ac (i+1) (λt=>if t< i then e t else lm) i А, ac (i+1) (λt=>if t< i then g t else 0x80000000) i А,Ai,if_false];rfl | succ c j=> intro i h rw[pa,j (i+1) А,pa,ac (n+1) (λt=>if tif t kG) (j:0if tif tby split;exacts [(h t ‹_›).symm,Б],aQ _ _ _ h,az, dN n e g n 0 А] congr 1 .simp only[Ai,if_false,(Б:tm lm 0x80000000=0),add_zero] exact Ϙ rfl λt l=>by simp only[AI (ϩ.mp l)];unfold tm;rw[ϕ];ring .simp[j.ne'] end F lemma dI {a:о} (h:a<=4294967295):a<2^32:=А end Dense namespace Bn namespace NativeAdd lemma d0 (x:Float32):po x.toModel=nM x.toBits:= congrArg Model.mk (pM x.toBits).symm lemma jh (x:Float32):la (po x.toModel)=x.toBits:= UInt32.ofNat_toNat lemma bg (a:kG) (h:kI a≠255): (mU a).toBits=a/\(mU a).isFinite=true:=by have j:n8 (spec:=li) 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:(mU a).toBits=a:=by change BP (lr li (kL li a.toBitVec))=a rw[Model.pack_unpack_eq,AF (j ·.1)] refine ⟨g,?_⟩;change (kL li (mU a).toBits.toBitVec).isFinite=true;simp only[g,kL,j,AM];split_ifs<;>rfl @[noinline] def eT (relu:ф) (a b:с):с:= act relu (toWord (Model.add (ofW a) (ofW b))) @[inline] def eJ (relu:ф) (w:с):с:= w&&&~~~((0:с)-((if relu then w>>>31 else 0)&&&(if w&&&0x7FFFFFFF<=0x7F800000 then 1 else 0))) lemma j1 (w:kG):(w&&&0x80000000!=0)=decide (2^31<= wд):=by have g:=w.toNat_lt rw[Ϣ,AT,Ar,<- Β,Ν,decide_eq_true_iff, show (0x80000000:Е)д=2^31 from rfl,nZ] simp only[ϯ,Nat.testBit,ζ,Nat.one_and_eq_mod_two];constructor .intro h;by_contra e;apply h;rw[lF А];simp .intro h;rw[(А:wд/2^31=1)];simp lemma gc (e:ф) (w:kG):eJ e w=qr e w:=by have y:=w.toNat_lt;have u:(w>>>31)д=wд/2^31:=by rw[Χ];simp[ζ] have o:=Dense.a9 w;have r:=Dense.bC w have t:(mz w)д=wд%2^23:=by unfold mz;rw[Ν];exact θ _ 23 unfold Dense.bb at o r have p:∀x:kG,x&&&~~~((0:kG)-0)=x:=λx=>by apply Β.mp;rw[Ν];rw[show (~~~((0:kG)-0))д=2^32-1 from rfl,θ,μ x.toNat_lt] have v:∀x:kG,x&&&~~~((0:kG)-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<;>(clear o p r t u v;omega) have q:(w&&&0x7FFFFFFF<=0x7F800000)↔wд%2^31<=0x7F800000:=by rw[nV,o];rfl have m:(w&&&0x80000000!=0&&!(kI w=255&&mz w !=0))=true↔ (2^31<= wд/\wд%2^31<=0x7F800000):=by rw[j1] simp only[Ε,AK,nj,Bool.and_eq_false_iff,BF, bne_eq_false_iff_eq,<- Β,r,t,o,kZ,ϯ] clear*-;omega unfold eJ qr;cases e .simp only[υ,AM,BN,p] simp only[AU];unfold reluW;rw[l];by_cases g:2^31<= wд .rw[AI g] by_cases j:wд%2^31<=0x7F800000 .rw[AI (q.mpr j),show (1:kG)&&&1=1 from rfl,v,AI (m.mpr ⟨g,j⟩)] .rw[AF (mt q.mp j),show (1:kG)&&&0=0 from rfl,p,AF (λh=>j (m.mp h).2)] .rw[AF g,BN,p,AF (λh=>g (m.mp h).1)] @[inline] def add (relu:ф) (a b:с):с:= if expOf a !=255&&expOf b !=255 then eJ relu (BV a+BV b).toBits else eT relu a b lemma gM (e:ф) (a b:kG): add e a b=qr e (la (pD (nM a) (nM b))):=by unfold add;split .rename_i h rw[gc];simp only[Ε,AT] at h;have g:=bg a h.1;have j:=bg b h.2;have l:=ExecFloat.Binary.toModel_ofFloat32_add_of_isFinite _ _ g.2 j.2;simp only[ExecFloat.Binary.toModel_ofFloat32,d0,g.1,j.1] at l;rw[<- l,<- d0,jh] .rfl end NativeAdd @[noinline] def ia (relu:ф) (w s t:с):с:=act relu (toWord (BJ (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б kG-> kG) (F:о-> kG-> kG) (m:∀i g w,f i g w=F iб w) (i:т) (x:р kG) (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.ag g,ϱ,pU А];split_ifs<;>first | rfl | omega | (subst_vars;rw[lI А,Option.map_some,m];rfl) .next i x h g=>exact ⟨rfl,λj=>by rw[AF (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.ai 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.ai S (Dense.F.eF S.toBits-1075))йд%2^31<255*2^23 /\ Dense.F.ai S (Dense.F.eF S.toBits-1075)<Ж:=by unfold Dense.F.ai simp only[n9,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[Ε,AS,AK,AT,Ar,<- ς, ι,Λ,Θ,ξ,Η, kC,kK,ζ,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,Θ,Η,kC,kK,ζ,e] have u:(a&&&0xfffffffffffff)а=aа%2^52:=by rw[Θ];exact θ _ 52 rw[AI (by simp only[Ε,AK,UInt64.reduceAdd,UInt64.reduceSub,AT,Ar, <- ς,ι,Λ,Θ,ξ,Η,j,u, kC,kK,ζ,g,o] rw[θ _ 63];have:=a.toNat_lt;clear*-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.fr a (by rw[j];omega) rw[j,u] at l;have w:aа/2^63<2:=(by clear*-A q;omega);have v:(aа%2^52+2^28)/2^29<=2^23:=А;simp only[Ϭ,ι,l,kC,j];refine ⟨?_,by clear*-w v y z;omega⟩ rw[<- ς,l,wX] simp only[ξ,Ζ,Η,Λ,Θ, kC,kK,ζ,χ,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 bd (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 bd relu hw c s t (ch+1) (if h:stopб<= xв then cd stop (λ_ _ w=>eB g m Y Z w λ_=>ia relu w sc tc) (ch*hw)е x h else x) else x termination_by c-ch def aY (relu:ф) (c hw:о) (x s t:р с):р с:= if xв=c*hw/\c*hw?_ have W:=h.2 suffices C:∀l x,xв=c*g->(bd p g c s t l x)[j]?=if l*g<= j then x[j]?.map (λw=>qr p (la (BJ (nM w) (nM s[j/g]!) (nM t[j/g]!)))) else x[j]? by rw[C 0 x h.1,AI (by simp),scaleShiftSpec,mJ] split .rw[lI А,AG x j А];rfl .rw[ma А];rfl intro l x D;induction hk:c-l generalizing l x with | zero=> rw[bd,AF А];split;swap;rfl;rw[ma (by have:=ν g (by omega:c<= l);omega)];rfl | succ k ih=> have ah:l*g+g<= c*g:=by rw[<- Υ];exact ν _ А have m:=Dense.aa (n:=l*g+g) А;rw[bd,AI А];dsimp only;rw[AZ (by rw[m];omega)] generalize hf:(λ_ _ w=>eB _ _ _ _ w _)=f have ⟨A,B⟩:=cn _ f (λ_ w=>ia 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[pI (k:=l) А (by rw[Υ];omega)];rfl | rfl subst hf;generalize s[l]! =s,t[l]! =t;dsimp only[eB,ia];split;swap;rfl;rename_i N;simp only[Ε,AT,Ar,AK] 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.bE t;have et:=Dense.b8 t;obtain ⟨J,v1⟩:=di w s g O;obtain ⟨U,v2⟩:=bM t Q;obtain ⟨V,v3⟩:=iD 149 А obtain ⟨K,v4⟩:=aS _ _ U V (sv t) ((kJ t+149:о):п) (by rw[v2,v3,AB,AH];ring) ((cl t).trans Г) А (ci 24 _ 971 А AY _ (cl t)) have q:=jz (dw w*dw s+dw t*pw 149) А;have r:=jE _ _ J K q _ А А (fo _ q);obtain ⟨-,e⟩:=eR _ _ J K _ А А r have X:rv (dw w*dw s)+rv (dw t*pw 149)= ((sv w*sv s*2^(kJ w+kJ s)+sv t*2^(kJ t+149):п):ℝ):=by rw[v1,v4,tm,AB];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[Λ,kC];omega obtain ⟨y,E⟩:=bK S q (eF S.toBits-1075) А _ (e.trans (by rw[hh,sub_sub];exact half_le_self В)) (r.le.trans (AC Г А)) M rw[show la (BJ (nM w) (nM s) (nM t))=(ai S (eF S.toBits-1075))й from ?_] .generalize lM _=o at L⊢ have Y:kI o≠255:=λh=>by have:=Dense.iQ o;simp[h] at this;omega cases p<;>simp[qr,reluW,Y] rw[E];have I:=kS w g;have G:=kS s O;have H:=kS t Q;open Model in .rw[Proof.fma_eq_spec] simp (disch:=assumption) only[Spec.fma,nM,(chooseNaN3_eq_none_iff _ _ _).2 ⟨kQ I, kQ G,kQ H⟩,isInf_eq_false_of_toDyadic?_some, Bool.or_false,υ,AM,I,G,H] refine (mj _ _ _ _ y ?_).symm;rw[addDyadic,pV];erw[pW (nU w) (nU s)];simp[nv,Ah];field_simp;ring lemma i7 (e:ф) (a b:kG) (g:Unit-> kG) (h:g ()=qr e (la (pD (nM a) (nM b)))): ad (if e then 1 else 0) a b g=qr e (la (pD (nM a) (nM b))):=by cases e<;>simp[ad,NativeAdd.gM] @[noinline] def jU (relu:ф) (x y:с):с:=act relu (toWord (Model.add (ofW x) (ofW y))) def b7 (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 λ_=>jU relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b lemma du:b7=addReluSpec:=by funext e a b;unfold b7;dsimp only split;swap;. rfl rename_i h;have l:=Dense.aa h.2;refine mX λj=>?_ rw[(cn _ _ (λj x=>qr e (la (pD (nM x) (nM b[j]!)))) (λi m x=>?_) 0 a _).2 j, addReluSpec,mJ] .by_cases g:j>>31)-1) else w lemma i6 (e:ф) (w:kG) (o:kI w≠255):aF e w=qr e w:=by unfold aF qr reluW;cases e .simp have m:=au w have l:(w>>>31)д=wд/2^31:=by rw[Χ];simp[ζ] have p:=w.toNat_lt;by_cases h:2^31<= wд .have j:w>>>31=1:=Β.mp (by rw[l];simp only[UInt32.toNat_one];omega) have g:kY w=true:=m.mpr h;unfold kY at g;simp[j,g,o] .have j:w>>>31=0:=Β.mp (by rw[l];simp only[ϯ];omega) have g:kY w≠true:=λq=>h (m.mp q) unfold kY at g;simp only[Bool.not_eq_true] at g;simp[j,g] lemma jb (S:у) (h:Д) (g:ai S h<Ж):kI (ai S h)й≠255:=by unfold ai at g⊢;dsimp only at g⊢;split at g swap;. exact absurd g Б rename_i e;rw[AI e];simp only[Ε,AK] at e;obtain ⟨⟨⟨-,m⟩,-⟩,-⟩:=e have o:(eF S.toBits)а<2048:=by unfold eF;rw[Θ];exact AR ϓ Б have p:(S.toBits&&&0xfffffffffffff)а<2^52:=by rw[Θ];exact AR ϓ Б rw[ι,Λ] at m;simp only[kC] at m;have q:1195<=(eF S.toBits)а:=А;have t:=fr S.toBits q;have r:S.toBitsа/2^63<2:=by have:=S.toBits.toNat_lt;omega rw[ι] at g;simp only[kC] at g;intro j;have l:=congrArg p8 j;rw[kI,Ν,Χ,Ϭ] at l;simp only[kZ,kK,ζ] at l;rw[θ _ 8,μ g,t] at l;omega @[inline] def eC (relu:ф) (S:у) (hh:Д) (sl:Unit-> с):с:= let c:=ai S hh if c<Ж then aF relu cй else sl () lemma iM (e:ф) (S:у) (g:Д) (h:Unit-> kG):eC e S g h=tf e S g h:=by unfold eC tf;dsimp only;split .rename_i j;rw[i6 _ _ (jb _ _ j)] .rfl lemma j3 (x w:kG) (e:о) (g:(kI w)д<= e): |(tm x w:ℝ)| <= |(sv x:ℝ)*2^kJ x| *2^(max e 56+23):=by unfold tm;push_cast rw[show (sv x:ℝ)*sv w*2^(kJ x+kJ w)=(sv x*2^kJ x)*(sv w*2^kJ w) by rw[AH];ring,AW] gcongr;rw[AW,abs_pow,BH] refine (Ax (b:=2^24) (by rw[<- ϳ];exact_mod_cast (bi _).le) (AV Г (by rw[bE];omega:_<= max e 56-1)) В В).trans_eq ?_ rw[<- AH];congr 1;omega lemma kp (m:ф) (n:о) (l j:о-> kG) (g:kG) (p:о-> у) (F v L:о) (e:kG) (c t:Д) (S:у) (r G:Unit-> kG) (E:∀s fv (p s)/\rv (p s)=tm (l s) (j s)) (hS:S=ab p n 0 (dw lm*dw g)) (O:∀sif sif s G ()=qr m (lV (n+1) (λs=>if sif sif sif s(2:ℝ)^a<=2^b:=AV Г;generalize hP:(if eл<56 then 56 else eл)+23+c=q have hq:qа=max eд 56+23+cа:=by have:=UInt32.toNat_lt e rw[<- hP];split<;>rename_i h<;>simp only[ι,ϫ,ξ, kC] at h⊢<;>(clear*-ah h this;omega) split;swap;. exact B rename_i hg;simp only[Ε,AK,Ο,ο, kZ,kC] at hg generalize X:(if qrename_i h<;>simp only[ι] at h<;>(clear*-h;omega) have D:∀sby have:=O s o;simp[h] at this;omega have M:=di lm g Б u.1;generalize y:(∑s∈kF n,|rv (dw (l s))|)=z at w have J:0<= z:=y ▸ l9 λ_ _=>AN _ rw[AJ AD,AB] at w;have U:=jp g v u.2;have K:(n:ℝ)<=2^32:=by exact_mod_cast (А:n<=2^32) have Y:z<= n*2^277:= y ▸ (Ϻ λs (o:s∈kF n)=>jw _ (E s (ϩ.1 o))).trans_eq (by simp) have hZ:∑s∈kF n,|(tm (l s) (j s):ℝ)| <= 2^(max eд 56+23)*z:=by rw[<- y,Bc] exact Ϻ λs o=>by rw[(bM _ (E s (ϩ.1 o))).2];exact (j3 _ _ _ (O s (ϩ.1 o))).trans_eq (mul_comm _ _) have V: |(tm lm g:ℝ)| +∑s∈kF n,|(tm (l s) (j s):ℝ)| <= 2^(968:п):=by rw[show (2:ℝ)^(968:п)=2^967+2^967 by rw[<- two_mul,<- pow_succ'];norm_num] refine add_le_add (U.trans (P А)) (hZ.trans ((Ax (P (by omega:_<=400)) (Y.trans (AA K В)) J В).trans ?_)) rw[<- AH,<- AH];exact P Г obtain ⟨I,H⟩:=jH p (λs=>(tm (l s) (j s):ℝ)) (tm lm g:ℝ) n (λs o=>hp s o (D s o)) А V n 0 _ А (ϰ _) M.1 (by rw[M.2];simp) rw[<- hS] at I H have hT:(aj (n+1) (λs=>if sif sby simp[ϩ.1 o] have W: |rv S-(aj (n+1) (λs=>if sif sif sif sby by_cases h:ksimp only[h,↓reduceIte];exacts [⟨E k h,D k h⟩,⟨Б,u.1⟩] rw[jv _ _ _ hf S I A А W x] .exact hk D lemma jo (e:ф) (n:о) (h j:о-> kG) (p:о-> у) (g:Unit-> у) (L:о) (u:Unit-> kG) (A:∀s split next z=> obtain ⟨m,l⟩:=ey _ _ (tm (h n) (j n)) n r.2а t.1 t.2.1 A n 0 _ 0 rfl А o.1 (by simp[o.2]) (by rw[x]) rw[x] at l m have y:((r.2а+L-1076)ж)а=r.2а+L-1076:=by rw[ϑ,Α (by simp only[lu];omega)] refine congrArg _ (jv _ _ _ q _ m _ (by rw[y];omega) ?_ z) rw[az,y];unfold aj;push_cast;rw[add_comm] exact l.trans ((AA (by exact_mod_cast (by omega:n<=2^L):(n:ℝ)<=2^L) В).trans_eq (by rw[<- AB,<- AJ AD];exact congrArg (2^·) А)) .exact w .rw[AF Б];exact w end F end Dense namespace Sr structure Ent {α:Type} (f:р с-> р с-> о-> α) where w:р с b:р с n:о v:α ok:v=f w b n a:т structure St {α:Type} (f:р с-> р с-> о-> α) where e:р (Ent f) x:ByteArray hd:о tl:о u:о structure Tab {α:Type} (f:р с-> р с-> о-> α) where r:ST.Ref Unit (St f) z:Ent f zx:ByteArray cap:о variable {α:Type} {f:р kG-> р kG-> о-> α} def Tab.jW (f:р с-> р с-> о-> α) (N cap:о):Tab f:= let z:Ent f:=⟨#[],#[],0,f #[] #[] 0,rfl,0⟩ let zx:ByteArray:=⟨AL (4*N) 0⟩ ⟨(ST.Prim.mkRef ⟨AL N z,zx,0,0,0⟩ (BI ())).val,z,zx,cap⟩ @[inline] def Ent.fC (e:Ent f) (w b:р с) (n:о):ф:= e.n==n&&withPtrEq e.w w (λ_=>e.w==w) (λh=>by rw[h];simp)&& withPtrEq e.b b (λ_=>e.b==b) (λh=>by rw[h];simp) lemma Ent.ee {e:Ent f} {w b:р kG} {n:о} (h:e.fC w b n=true):e.v=f w b n:=by simp only[Ent.fC,withPtrEq,Ε,AS] at h;obtain ⟨⟨g,j⟩,l⟩:=h;rw[e.ok,g,j,l] @[inline] def Ent.sz (e:Ent f):о:=e.wв+e.bв+64 @[inline] def hs (a:т):т:=(((a>>>4).toUInt64*0x9E3779B97F4A7C15)>>>48).toUSize lemma ul {β:Type} {a:р β} {i:т} (h:i т-> ByteArray | 0,_=>x | p+1,i=> let k:=i&&&m if h:k St f-> St f | 0,s=>s | p+1,s=>if s.u+sz<= t.cap then s else St.iE t sz p (s.gW t.z) def St.fd (s:St f) (t:Tab f) (w b:р с) (n:о):о-> {y // y=f w b n} | 0=>⟨f w b n,rfl⟩ | p+1=>let e:=s.e.getD p t.z if h:e.fC w b n=true then ⟨e.v,Ent.ee h⟩ else s.fd t w b n p @[noinline] def Tab.eY (t:Tab f) (w b:р с) (n:о) (a:т):{y // y=f w b n}:= let r:=(A9 t.r (BI ())).val let y:=r.fd t w b n r.eв let q:Ent f:=⟨w,b,n,y.1,y.2,a⟩ let sz:=q.sz if 4*sz<= t.cap then let s:=(A9 t.r (BI ())).val let s:=St.iE t sz s.eв s let s:=if (s.e.getD s.tl t.z).w.isEmpty then s else s.gW t.z let e:=s.e.setIfInBounds s.tl q let x:=iV e (t.zx.usize-1) 0 t.zx let o:=(ST.Prim.Ref.swap t.r ⟨e,x,s.hd,(s.tl+1)%eв,s.u+sz⟩ (BI ())).val if o.u=0xFFFFFFFFFFFF then if h:(o.e.getD 0 t.z).fC w b n=true then ⟨_,Ent.ee h⟩ else y else y else y def St.dP (s:St f) (t:Tab f) (w b:р с) (n:о) (a m:т):о-> т-> {y // y=f w b n} | 0,_=>t.eY w b n a | p+1,i=> let k:=i&&&m if h:kSubtype.ext (p.2.trans q.2.symm)⟩ @[inline] def Tab.get (t:Tab f) (w b:р с) (n:о):{y // y=f w b n}:= withPtrAddr w (λa=> let s:=(A9 t.r (BI ())).val s.dP t w b n a (s.x.usize-1) s.x.size (hs a)) (λ_ _=>Subsingleton.elim _ _) end Sr open Sr namespace Dense namespace F namespace Pn def dR (X:р с) (st:т):о-> т-> т-> FloatArray-> у-> FloatArray | 0,_,o,Y,a=>wF Y o a | k+1,q,o,Y,a=>let v:=rX X q;dR X st k (q+st) (o+1) (wF Y o v) (a+v.abs) def dO (X:р с) (st s m:т) (n:о):о-> т-> т-> FloatArray-> FloatArray | 0,_,_,Y=>Y | k+1,q,o,Y=>dO X st s m n k (q+s) (o+m) (dR X st n q o Y 0) def qL (W:р с) (su m:т) (n:о):о-> т-> FloatArray-> FloatArray | 0,_,Y=>Y | k+1,q,Y=>qL W su m n k (q+m) (bx W su 1 n q (q+1) Y) lemma f6 (q e:т) (τ:о):q+e+τе*e=q+(τ+1)е*e:=by rw[ϝ,ϝ,n5,USize.add_mul,show pq 1=1 from rfl,USize.one_mul, BY,USize.add_comm e] lemma uz (q e:т):q+(0:о)е*e=q:=by simp[ϝ,show pq 0=0 from rfl] lemma gj (X:р kG) (e:т):∀k (q o:т) (Y:FloatArray) (a:у), Yг<2^32-> oб+k (dR X e k q o Y a)г=Yг /\ (∀i,i i(dR X e k q o Y a).data[i]! =Y.data[i]!) /\ (∀τ(rX X (q+τе*e)).abs) k 0 a:=by intro k;induction k with | zero=> intro q o Y a j m;rw[dR,f7 Y j,ab,AF А];refine ⟨ck ..,λi g w=>?_,λτ h=>absurd h А,?_⟩ .rw[sg _ _ _ _ g,AF А] .rw[sg _ _ _ _ m,AI А] | succ k v=> intro q o Y a j m;have:=ψ have g:(o+1)б=oб+1:=by rw[ae (by simp only[kD];omega)];simp only[kD] rw[dR,f7 Y j] obtain ⟨p,r,t,u⟩:=v (q+e) (o+1) (Y.set! oб (rX X q)) (a+(rX X q).abs) (by rw[ck];exact j) (by rw[ck,g];omega) rw[ck] at p;refine ⟨p,λi l x=>?_,λτ h=>?_,?_⟩ .rw[r i (by rw[ck];exact l) А,sg _ _ _ _ l,AF А] .rcases τ with _ | τ .rw[r _ (by rw[ck];omega) А,sg _ _ _ _ А,AI А,uz] .have:=t τ А rw[g,(А:oб+1+τ=oб+(τ+1))] at this rw[this,f6] .have:=u rw[g,(А:oб+1+k=oб+(k+1))] at this rw[this];conv_rhs=>rw[ab,AI А,cZ _ k _ 0 _ rfl] simp only[f6,uz] lemma gi (X:р kG) (e s m:т) (n:о) (w:mб=n+1) (G:n+1<2^32): ∀k (q o:т) (Y:FloatArray),Yг<2^32-> oб+k*(n+1)<= Yг -> (dO X e s m n k q o Y)г=Yг /\ (∀i,i i(dO X e s m n k q o Y).data[i]! =Y.data[i]!) /\ (∀j(rX X (q+jе*s+τе*e)).abs) n 0 0):=by intro k;induction k with | zero=>intro q o Y _ _;exact ⟨rfl,λ_ _ _=>rfl,λj h=>absurd h А,λj h=>absurd h А⟩ | succ k A=> intro q o Y r x;rw[Υ] at x;have:=ψ;have l:(o+m)б=oб+(n+1):=by rw[ae А,w] obtain ⟨g,B,D,E⟩:=gj X e n q o Y 0 r А obtain ⟨v,p,y,z⟩:=A (q+s) (o+m) (dR X e n q o Y 0) (by rw[g];exact r) (by rw[g,l];omega) rw[g] at v;rw[dO];refine ⟨v,λi t F=>?_,λj h τ u=>?_,λj h=>?_⟩ .rw[p i (by rw[g];exact t) А,B i t А] .rcases j with _ | j .rw[ϴ,ό,p _ (by rw[g];omega) А,D τ u,uz] .have:=y j А τ u rw[l,show oб+(n+1)+j*(n+1)=oб+(j+1)*(n+1) by rw[Υ];omega] at this rw[this,f6] .rcases j with _ | j .rw[ϴ,ό,p _ (by rw[g];omega) А,E] simp only[uz] .have:=z j А rw[l,show oб+(n+1)+j*(n+1)=oб+(j+1)*(n+1) by rw[Υ];omega] at this rw[this];simp only[f6] lemma gv (W:р kG) (e m:т) (n:о) (B:mб=8*n) (D:eб=n): ∀k (q:т) (Y:FloatArray),2*(qб+k*(8*n))+32*n<2^32-> qб+k*(8*n)+1<= Yг -> (qL W e m n k q Y)г=Yг /\ (∀i,i(qL W e m n k q Y).data[i]! =Y.data[i]!) /\ ∀gintro q Y _ _;exact ⟨rfl,λ_ _=>rfl,λg h=>absurd h А⟩ | succ k F=> intro q Y y z;rw[ϙ,pr] at y z;have:=ψ;have j:(q+m)б=qб+8*n:=by rw[ae А,B] have l:(q+1)б=qб+1:=by rw[ae (by simp only[kD];omega)];simp only[kD] obtain ⟨v,w,x⟩:=gf W e 1 n q (q+1) Y (by simp only[kD,l];omega) (by rw[l];omega) simp only[kD,ϧ,D,l] at w x;obtain ⟨t,u,E⟩:=F (q+m) (bx W e 1 n q (q+1) Y) (by rw[j];clear*-y;omega) (by rw[v,j];clear*-z;omega) rw[v] at t;rw[qL];refine ⟨t,λi A=>?_,λg h τ p r o=>?_⟩ .rw[u i А,w i A] .rcases g with _ | g .rw[ϴ,ό,u _ (by rw[j];omega),x τ r p o,ό] .have:=E g А τ p r o rw[j,show qб+8*n+g*(8*n)=qб+(g+1)*(8*n) by rw[ϙ,pr];omega] at this exact this @[inline] def pp (V P:FloatArray) (vo xb r s:о):у:=V.get! (vo+s)*P.get! (xb+8*s+r) @[noinline] def sQ (n:о) (relu:ф) (X W b:@& р с) (V P:@& FloatArray) (vo xb r xo st j:о):с:= tS relu (An (n+1)+1) n (pp V P vo xb r) (λ_=>dw oneW*dw b[j]!) λ_=>aE n relu X W b xo st j @[inline] def pO (relu ok:ф) (hh:Д) (n:о) (X W b:р с) (xo st o r:о) (V P:FloatArray) (vo:т) (q:т) (on:ф) (acc:р с) (S:у):р с:= if h:on=true/\qsQ n relu X W b V P voб (o*n+1) r xo st (o+r)) else aE n relu X W b xo st (o+r)) (bj h.2) else acc @[noinline] def fP (relu ok:ф) (hh:Д) (n:о) (X W b:р с) (xo st o:о) (q0 so mu:т) (V P:FloatArray) (vo:т) (a0 a1 a2 a3 a4 a5 a6 a7:у) (acc:р с):р с:= pO relu ok hh n X W b xo st o 7 V P vo (q0+7*so) (decide (7< mu)) (pO relu ok hh n X W b xo st o 6 V P vo (q0+6*so) (decide (6< mu)) (pO relu ok hh n X W b xo st o 5 V P vo (q0+5*so) (decide (5< mu)) (pO relu ok hh n X W b xo st o 4 V P vo (q0+4*so) (decide (4< mu)) (pO relu ok hh n X W b xo st o 3 V P vo (q0+3*so) (decide (3< mu)) (pO relu ok hh n X W b xo st o 2 V P vo (q0+2*so) (decide (2< mu)) (pO relu ok hh n X W b xo st o 1 V P vo (q0+1*so) (decide (1< mu)) (pO relu ok hh n X W b xo st o 0 V P vo (q0+0*so) (decide (0< mu)) acc a0) a1) a2) a3) a4) a5) a6) a7 lemma gl (g ok:ф) (O:Д) (n:о) (X W b:р kG) (D B o:о) (t m r:т) (V P:FloatArray) (vo:т) (E G H J K L M N:у) (p:р kG) (F:о-> kG) (al:tб+8*mб<=4294967295) (hz:pв<=4294967295) (hv:∀k<8,k(if ok then eC g (A8.f ⟨E,G,H,J,K,L,M,N⟩ k) O (λ_=>sQ n g X W b V P voб (o*n+1) k D B (o+k)) else aE n g X W b D B (o+k))= F (tб+k*mб)): Iv F p (λq=>∃k,k<8/\k∃j,j k<8->(k USize.toNat A=I k)-> on=decide (k Q (k+1) (pO g ok O n X W b D B o k V P vo A on a (A8.f ⟨E,G,H,J,K,L,M,N⟩ k)):=by intro k a A on ⟨h1,z⟩ hk U y;unfold pO;split next w=> have x:k?_⟩ rw[ϱ,pU,hv k hk x];by_cases h:Aб=q .subst h;simp[U x,I] .rw[AF h] exact ⟨(z q).1,λ⟨j,S,u,v⟩=>(z q).2 ⟨j,BT (Ba S) λe=>by subst e;exact h ((U u).trans v.symm),u,v⟩⟩ next w=> refine ⟨h1,λq=>⟨(z q).1,λ⟨j,S,u,v⟩ Y=>(z q).2 ⟨j,BT (Ba S) λe=>w ⟨by simp[y];omega,?_⟩,u,v⟩ Y⟩⟩ subst e;rw[γ,nh,aa А,U u,<- v];omega have ah:∀c:т,cб<8->(t+c*m)б=tб+cб*mб:=λc w=>by have m1:cб*mб<=8*mб:=ν _ w.le have e:(c*m)б=cб*mб:=by rw[n4,<- ϶,μ А] rw[ae А,e] unfold fP refine l 7 (l 6 (l 5 (l 4 (l 3 (l 2 (l 1 (l 0 ?_ ?_ ?_ ?_) ?_ ?_ ?_) ?_ ?_ ?_) ?_ ?_ ?_) ?_ ?_ ?_) ?_ ?_ ?_) ?_ ?_ ?_) ?_ ?_ ?_ all_goals first | decide | (intro _;rw[ah _ (by simp only[kD];omega)];simp only[kD,I]) | simp only[γ,kD] | simp[Q,Iv] def pk (V P:FloatArray) (vo nu:т) (hs:Vг<2^32/\Pг<2^32) (hV:voб+nuб<= Vг) (t i:т) (hi:iб+8*(nuб-tб)<= Pг) (a0 a1 a2 a3 a4 a5 a6 a7:у) (relu ok:ф) (hh:Д) (n:о) (X W b:р с) (xo st o:о) (q0 so mu:т) (acc:р с): р с:= if h:t iб=l+8*tб -> pk V P g j hs hV t i J w x y z A B D E q N I n X W b U S o O Q M v= fP q N I n X W b U S o O Q M V P g (ab (pp V P gб l 0) jб tб w) (ab (pp V P gб l 1) jб tб x) (ab (pp V P gб l 2) jб tб y) (ab (pp V P gб l 3) jб tб z) (ab (pp V P gб l 4) jб tб A) (ab (pp V P gб l 5) jб tб B) (ab (pp V P gб l 6) jб tб D) (ab (pp V P gб l 7) jб tб E) v:=by intro m;induction m<;>intro t i J w x y z A B D E hm L .rw[pk,Af (by rw[γ];omega)] have e:∀p a,ab p jб tб a=a:=λp a=>by rw[ab,AF А] simp only[e] rename_i ih;have:=ψ;have K:tбby rw[ab,AI K] have e:∀(c:т) (r:о) (H:cб=r) (hr:r<8) (F:(g+t)бby rw[ug,ug,pp,gg,gg,hw,ae А,L,H] have c:∀{k:т},Mб<=kб->decide (kby rw[decide_eq_false_iff_not,γ];omega rw[pk,AZ h] split_ifs<;>rw[ih (t+1) (i+8) _ _ _ _ _ _ _ _ _ (by rw[ag h];clear*-K hm;omega) (by rw[ag h,Y,L];ring),ag h]<;>simp only[USize.le_iff_toNat_le,USize.reduceToNat] at *<;>simp (disch:=simp only[USize.reduceToNat];omega) only[u,e 0 0 (by simp) А,e 1 1 (by simp) А,e 2 2 (by simp) А,e 3 3 (by simp) А, e 4 4 (by simp) А,e 5 5 (by simp) А,e 6 6 (by simp) А,e 7 7 (by simp) А,fP,c,pZ] @[specialize] def l2 (U V:о) (f:о-> о-> р с-> р с) (u v:о) (a:р с):р с:= if u о-> р kG-> р kG) (F:о-> kG) (C:о-> о-> о-> Prop) (E:∀u v a,u v aв=N-> Iv F a (C u v) (f u v a)) (u v:о) (a:р kG): aв=N->(∀q,(∃g j,g q a[q]?=some (F q)) -> (l2 U V f u v a)в=aв /\ ∀q,(∃g j,g q(l2 U V f u v a)[q]?=some (F q):=by induction u,v,a using l2.induct U V f with | case1 u v a o y z=> intro x t;rw[l2,AI o,AI y];obtain ⟨G,A⟩:=E u v a o y x obtain ⟨H,I⟩:=z А λq ⟨g,j,p,r,B,m⟩ l=>by have w:qI q D А⟩ | case2 u v a o y z=> intro x t;rw[l2,AI o,AF y];exact z x λq ⟨g,j,p,r,B,m⟩ l=>t q ⟨g,j,p,r,А,m⟩ l | case3 u v a o=> intro x t;rw[l2,AF o];exact ⟨rfl,λq ⟨g,j,p,r,m⟩ l=>t q ⟨g,j,p,r,А,m⟩ l⟩ lemma il (U V N:о) (f:о-> о-> р kG-> р kG) (F:о-> kG) (C:о-> о-> о-> Prop) (m:∀u v a,u v aв=N-> Iv F a (C u v) (f u v a)) (l:∀q,q ∃u v,uF qи:=by obtain ⟨r,g⟩:=go U V N f F C m 0 0 (mD N 0) (by simp) λq ⟨t,w,_,_,h,_⟩ _=>А apply mX;intro q;by_cases e:qdw oneW*rX bw oе) (8*G) (Aj (8*G)),bw,aG W 0 0,aG bw 0 0⟩ def oF (t:ф) (R n ow:о) (relu:ф) (X W b:р с) (q:о):с:= act relu (dotOf (n+1) (λs=>if sif s о) (g:о-> у) (p:∀τ(g τ).abs) n 0 0))а:п)+56)+ 2^(-900:п):=by have o:0<= ∑τ∈kF n,|rv (dw X[f τ]!)| :=l9 λ_ _=>AN _ have h:∑τ∈kF n,|rv (dw X[f τ]!)| <= 2^(400:п):=by refine (Ϻ λτ _=>jw _ (l _)).trans ?_ have:(n:ℝ)<=2^29:=by exact_mod_cast j.le rw[qh,p9,nsmul_eq_mul] calc (n:ℝ)*2^(277:п)<=2^29*2^(277:п):=by gcongr _<=2^(400:п):=by rw[<- AB,<- AJ AD];exact AC Г Г obtain ⟨m,e⟩:=jH (λτ=>(g τ).abs) (λτ=> |rv (dw X[f τ]!)|) 0 n (λτ r=>by rw[p τ r];exact jS _ (bM _ (l _)).1) А (by simpa using h.trans (AC Г (by norm_num:(400:ℤ)<=968))) n 0 0 rfl (ϰ _) f0.1 (by simp[f0.2]) simp only[abs_zero,Ap,abs_abs] at e;exact gh n j _ _ m o h e lemma fd (t:ф) (R n l:о) (p:ф) (X W v:р kG) (Y Q B:FloatArray) (F:у) (hb e6:Д) (H:ф) (O:Yг<2^32/\Qг<2^32) (y:Bг<2^32) (e:kG) (U V L:о) (as:L=An (n+1)+1) (a2:e6=if eл<56 then 56 else eл) (x:H=decide (e<255)) (hF:F=(9*(n+1))ж.toInt64.toFloat) (a3:hb=(U+L-50)ж) (hx:∀q:о,kI X[q]!≠255) (D:∀q:о,kI v[q]!≠255/\kJ v[q]! <= V) (a4:174+V<= U) (hL:n+2<=2^L) (A:L<=27) (I:U+L<=425) (hn:8*n<2^32) (he:∀q:о,(kI W[q]!)д<= eд) (bo:R*(n+1)<= Yг) (a0:∀j∃k,k<8/\8*g+kby rw[ug,ae А,u,hc,ah _ ho] have aL:∀h,Y.uget (r*(n+1)+n)е h=Y.data[r*(n+1)+n]!:=λh=>by rw[ug,ts h1.le O.1] have m1:8*g*R<= l*R:=ν R ba.le;have m2:r*l<= R*l:=ν l N.le;have cm:l*R=R*l:=Τ _ _ have E:(if t then 8*g*R+r else r*l+8*g)еб=if t then 8*g*R+r else r*l+8*g:= aa (by cases t<;>simp only[υ,↓reduceIte]<;>omega) have G:(if t then R else 1)еб=if t then R else 1:= aa (by cases t<;>simp only[υ,↓reduceIte]<;>omega) have K:(min 8 (l-8*g))еб=min 8 (l-8*g):=aa А have hI:∀k,(if t then 8*g*R+r else r*l+8*g)+k*(if t then R else 1)= if t then (8*g+k)*R+r else r*l+(8*g+k):=λk=>by cases t<;>simp only[υ,↓reduceIte,ϧ,ϙ]<;>(clear*-;omega) have dm:∀a c m:о,c< m->(a*m+c)/m=a/\(a*m+c)%m=c:=λa c m h=> ⟨by rw[ϕ,Ϸ _ _ А,lF h,ϋ], by rw[ϕ,mY,μ h]⟩ unfold iK;dsimp only;rw[AZ ⟨h1,h2,z⟩,ji _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (8*g*n+1) _ _ _ _ _ _ _ _ _ _ _ _ rfl (by rw[a7];simp)] simp only[aL,a6,S,Ϫ];refine eh _ _ _ _ _ (λq ⟨k,hk,x,hq⟩=>⟨k,hk,?_,?_⟩) (gl _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ a _ ?_ А λk hk a5=>?_) .rw[E,G];cases t<;>simp only[υ,↓reduceIte]<;>omega rotate_left .rw[K];clear*-ba hk x;omega .rw[E,G,hI];exact hq rw[K] at a5;have x:8*g+k(simp only[A8.f];exact congrArg (ab _ n 0) (al _ _ (by simp only[kD]) А _ x)) rw[hA];simp only[S] have M:∀s fv (pp Y Q (r*(n+1)) (8*g*n+1) k s) /\ rv (pp Y Q (r*(n+1)) (8*g*n+1) k s)=tm X[(if t then r else r*n)+s*(if t then R else 1)]! W[(8*g+k)*n+s]!:= λs w h=>by rw[pp,gg,gg,a0 r N s w,hQ g hg s w k hk];exact di _ _ (hx _) h have J:aE n p X W v (if t then r else r*n) (if t then R else 1) (8*g+k)= qr p (lV (n+1) (λs=>if sif sX[(if t then r else r*n)+s*(if t then R else 1)]!) (λs=>W[(8*g+k)*n+s]!) v[8*g+k]! (pp Y Q (r*(n+1)) (8*g*n+1) k) U V _ e _ _ _ (λ_=>aE n p X W v (if t then r else r*n) (if t then R else 1) (8*g+k)) (λ_=>sQ n p X W v Y Q (r*(n+1)) (8*g*n+1) k (if t then r else r*n) (if t then R else 1) (8*g+k)) (λs _=>hx _) (D _) a4 hL A I hn M rfl (λs _=>he _) (a1 r N) (Nat.le_trans (ja _ _) (by decide:969<=1000)) ?_ J (λhw=>?_)).trans ?_ .rw[ϑ,Α (by simp only[lu];omega)] .refine jo _ _ _ _ _ _ _ _ (λs w=>?_) ?_ (λs _=>?_) hL A J .simpa only[AI w] using M s w (hw s w) .simpa only[Ai,↓reduceIte] using di lm v[8*g+k]! Б (D _).1 .by_cases h:ssimp only[h,↓reduceIte] exacts [⟨hx _,hw s h⟩,⟨Б,(D _).1⟩] .unfold oF cases t .obtain ⟨d1,d2⟩:=dm r (8*g+k) l x simp only[d1,d2,υ,↓reduceIte,ϧ] .obtain ⟨d1,d2⟩:=dm (8*g+k) r R N simp only[d1,d2,↓reduceIte] @[inline] def iG (t:ф) (R n ow:о) (relu:ф) (X W:р с) (d:PD) (ex:с) (Y:FloatArray):р с:= let L:=An (n+1)+1 let ib:=174+(d.ebд-1) if h:ex<255/\d.eb<255/\ib+L<=425/\L<=27/\0 aE n relu X W d.bw (if t then qи%R else qи/ow*n) (if t then R else 1) (if t then qи/R else qи%ow) @[inline] def fX (t:ф) (R n ow:о) (relu:ф) (X W:р с) (d:PD) (ex:с):р с:= iG t R n ow relu X W d ex (dO X (if t then R else 1)е (if t then 1 else n)е (n+1)е n R (0:о)е 0 (zT ((R*(n+1)+7)/8))) lemma gr (W b:р kG) (n e:о) (x:0dw lm*rX (pd W b n).bw oе) (8*((O+7)/8)) _ (kN (8*((O+7)/8))) rfl (ϰ _) have q:(pd W b n).Q=qL W nе (8*n)е n ((O+7)/8) (0:о)е (zT (n*((O+7)/8)+1)):=by simp only[pd,t];rfl have p:(pd W b n).B=bc (λo=>dw lm*rX (pd W b n).bw oе) (8*((O+7)/8)) (kN (8*((O+7)/8))):=by simp only[pd,t] refine ⟨λg w=>?_,λg w τ B r A=>?_,?_,λo z=>?_⟩ .have:=ν (8*n) (А:g+1<=(O+7)/8) rw[ϙ,pr] at this;rw[q,D,show 8*g*n=g*(8*n) by ac_rfl];omega .have:=E g А τ B r A rw[j,ϋ] at this;rw[q,show 8*g*n=g*(8*n) by ac_rfl,this] congr 2;rw[ϙ,show 8*g*n=g*(8*n) by ac_rfl];omega .rw[p,h.1];omega .rw[p,h.2.2 o (ϰ _) А] rw[fW _ m,aa А] lemma dp {c:Prop} [Decidable c] {α:Type} {a:c-> α} {b:¬c-> α} {y:α} (e:∀h:c,a h=y) (g:∀h,b h=y):dite c a b=y:=by by_cases h:c .rw[AZ h];exact e h .rw[Af h];exact g h lemma eu (t:ф) (R n e:о) (l:ф) (X W b:р kG) (B:kG) (x:B=aG X 0 0): fX t R n e l X W (pd W b n) B=kT (n:=R*e) λq=>oF t R n e l X W (pd W b n).bw qи:=by have ul:=ψ;unfold fX iG;dsimp only;refine dp (λh=>?_) λ_=>?_ swap .congr 1;funext q;unfold oF;cases t<;>simp only[aE,bY,ϧ,↓reduceIte,υ] obtain ⟨M,V,g3,g4,g5,g6,g7,g8,g9,u,v,N,O,Q,S,U⟩:=h;obtain ⟨H,I,J,L⟩:=gr W b n e g5 g8 g9 (dI u);have E:=cH X А (x ▸ M);have w:=cH (pd W b n).bw А V have he:∀q:о,(kI W[q]!)д<=(pd W b n).eд:=λq=>by by_cases o:qomega have z:(if t then 1 else n)<2^32:=by cases t<;>simp only[υ,↓reduceIte]<;>omega have y:(if t then R else 1)<2^32:=by cases t<;>simp only[υ,↓reduceIte]<;>omega have K:=gi X (if t then R else 1)е (if t then 1 else n)е (n+1)е n (aa А) А R (0:о)е 0 _ hZ (by simp only[Ϫ,ϋ];omega) simp only[Ϫ,ϋ] at K;obtain ⟨K1,-,F,G⟩:=K have A:∀jby have m1:=ν (if t then 1 else n) m.le;have m2:=ν (if t then R else 1) (А:τ<= n+1) rw[fW X А,kd 0 _ _ j τ z y А А А];cases t<;>simp only[υ,↓reduceIte,ϋ,ϧ] generalize dO X (if t then R else 1)е (if t then 1 else n)е (n+1)е n R (0:о)е 0 _=Y at* refine il _ _ _ _ _ (λg r q=>∃k,k<8/\8*g+kfd t R n e l X W _ Y _ _ _ _ _ _ _ _ (pd W b n).e _ ((pd W b n).ebд-1) _ rfl rfl rfl rfl rfl (λq=>(E q).1) w AY hL g4 g3 А he А (λj m τ p=>by rw[F j m τ p,A j m τ p]) (λj m=>by rw[G j m] exact cR X n А (λq=>(E q).1) (λτ=>(if t then j else j*n)+τ*(if t then R else 1)) _ (λτ p=>A j m τ p)) H I J L v g r hg hr a ha) λq o=>?_ have hw:0by subst h;simp at o have hR:0by subst h;simp at o cases t .have h1:=mG q e have D:=ϣ q hw;refine ⟨q%e/8,q/e,А,Ϝ (by rwa[Τ]),q%e%8,А,А,?_⟩ simp only[υ,↓reduceIte];rw[Τ (q/e)];clear*-h1;omega .have h1:=mG q R have D:=ϣ q hR;have h3:q/R?_ simp only[lL] at g;have u:q/n< m:=Ϝ g have x:(pd A #[] k).bw[q/n]! =0x80000000:=by rw[r,AG _ _ (by rw[ϐ];omega),nE] simp only[Ξ,oF,↓reduceIte,x,qr,lF (show q< m*n by rwa[Τ]), μ u,ϴ,ϋ,υ] exact (F.dz k (λt=>A[q/n*k+t]!) (λt=>B[q%n+t*n]!) l λt _=>⟨(v _).1,(w _).1⟩).trans (by simp only[ϕ (q%n)]) end Pn end F end Dense namespace Conv open Core Finset variable (C E V S:Д) (y z:kG) (t:ф) (P W:р Е) (c h w k n:о) (Q:kG-> ф) (fa:о-> kG) (bx:Д) (s:lG) (J:ф) (I K b:р kG) (D:ф) (nc Y:о) (r d:kG) (x:Д) (v:п) (B a:Д) (m:о) (e j:т) (bw:Д) (u:Е) {α:Type} lemma mo {a b:о} (h:asimp[*] lemma ke {n:о} (h:n<2^32):n%2^nF=n:=mo (AQ h bk) lemma j4 (a:р Е):a.usizeб<= aв:=mT _ _ @[inline] def ok (w:Е):ф:= expOf w !=255&&(mW w==0 || iW w-E<= C) @[inline] def io (a:р Е):Д:= a.foldl (λm w=>if mW w !=0&&iW w< m then iW w else m) 255 @[inline] def b9 (h l:Д):Д:=(h<<<25)+l @[inline] def dH (h l:Д):Д:= ((h+0x8000000000000000)>>>(39:Д))-(16777216:Д)-(l>>>(63:Д))+ (if b9 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=>cT f s (x+1) m (e+s) (a.push (f x e)) @[inline] def iN (O H W:о) (f:о-> о-> о-> Е):р Е:= if 0cT (λx _=>f o y x) 0 0 W 0) (O*H) 0 0 (Aq (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 c5 (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.bD (dH H A) (b9 H A) (B+149) eM (if r<Ж then rй else fb ()) d @[inline] def ay (w:с):Д:=if mW w !=0 then iW w else 255 @[inline] def dv (x0 x1 x2 x3:с):ф:=Q x0&&Q x1&&Q x2&&Q x3 @[inline] def eF (u:с):Д:=((u>>>23)&&&255)л @[inline] def gJ (ch y x:о) (e:т):с:= let v:=wе if hb:edv (.==0x80000000) x0 x1 x2 x3) (λ_=>c5 h w 2 I ch y x) d else toWord (Am (ofW (c5 h w 2 I ch y x)) (ofW d)) else toWord (Am (ofW (c5 h w 2 I ch y x)) (ofW d)) def dM (I:р с) (B:Д) (stop:т) (hs:stopб<= Iв) (e:т) (acc:Д):Д:= if h:ecT (gJ h w I d o y) 2 0 (w/2) ((o*h+y*2)*w)е) (c*(h/2)) 0 0 (Aq (c*(h/2*(w/2)))) else let q:=cK (k*k) let bx:=io I if bx<=255/\I.all (ok q bx)=true then iN c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k wo bx (eV I bx w k U) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>c5 h w k I ch y x) d else iN c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k let B:=wl (λ(m:Д) v=>min m (ay 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 (cz (t1 B) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>c5 h w k I ch y x) d else toWord (Am (ofW (c5 h w k I ch y x)) (ofW d)) else avgpoolSpec c h w k I lemma fZ:af x=(xа:п)-2^64*(xа/2^63:о):=by unfold af;rw[lA,mf];have:=x.toNat_lt;split<;>omega lemma jI (h:(xа:п) ≡ v [ZMOD2^64]) (e:-2^63<= v) (g:v<2^63):af x=v:=by rw[fZ];have:=x.toNat_lt;unfold pE at h;omega def Z:ZMod (2^64):=xа lemma iq:(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:=jI x v ((iq x v).mpr h) e g lemma dr (b:Д):Z (a+b)=Z a+Z b:=by simp[Z,ξ] lemma i5 (b:Д):Z (a-b)=Z a-Z b:=eq_sub_of_add_eq (by rw[<- dr,n9]) lemma bI:Z 0=0:=by simp[Z] lemma dW {B:Д} (h:B<=255):Bа<=255:=ο.mp h def ed (e:о) (w:Е):п:=sv w*2^(idxOf w-e) lemma dj (h:kR u=0):sv u=0:=by simp[sv,h] lemma dg (w:Е) (o:Eа<=255) (m:Cа<=62) (h:ok C E w=true): kI w≠255/\(kR w=0\/(Eа<= kJ w/\kJ w<= Eа+Cа /\ (iW w-E)а=kJ w-Eа)):=by simp only[ok,Ε,AT,Ar,n3,AS] at h;refine ⟨h.1,h.2.imp (λe=>?_) λg=>?_⟩ .have:=an w;rw[e] at this;simp at this;omega .have l:=am w;have j:=ο.mp (of_decide_eq_true g);have:=idxOf_le w h.1;rw[Λ,l] at j⊢;clear l;omega lemma jP (b:Д):((a+b)а:п) ≡ (aа:п)+bа [ZMOD2^64]:=by unfold pE;rw[ξ];omega lemma gQ (b:Д):((a-b)а:п) ≡ (aа:п)-bа [ZMOD2^64]:=by have:=b.toNat_lt;unfold pE;rw[Λ];omega lemma eG (e g:Д): aC (dH e g) (b9 e g)=af e*2^25+af g:=by have j:=e.toNat_lt;have l:=g.toNat_lt;have m:(b9 e g)а=((eа%2^39)*2^25+gа)%2^64:=by unfold b9;rw[ξ,Ζ];simp only[χ,mZ,nt,kK];omega have o:((dH e g)а:п) ≡ (eа/2^39:о)+(if eа<2^63 then 0 else-2^25)- (gа/2^63:о)+(if b9 e g(clear l m;omega) .split<;>rfl unfold aC;rw[jI _ _ o (by clear*-j l;split_ifs<;>omega) (by clear*-j l;split_ifs<;>omega),fZ,fZ,m] simp only[ι,m];clear*-j l;split_ifs<;>omega abbrev ax (g:о-> Е):р Е:=Au (n:=m) λq=>g qи lemma dK (g:о-> Е):(ax m g).push (g m)=ax (m+1) g:=by simp[ax,Array.ofFn_succ] lemma be (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 iF (f:о-> т-> Е) (g:о-> Е) (s:т):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jе))-> cT f s x m e (ax M g)=ax (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 pq 0=0 from rfl] using l 0 А rw[cT,<- o,dK,p _ _ _ λj q=>by rw[(А:M+1+j=M+(j+1)),l _ А,(А:x+(j+1)=x+1+j), show (j+1)е=jе+1 from n5 j 1,USize.mul_add,USize.mul_one, BY,USize.add_comm (s*_)]];congr 1;omega lemma fE (H W n c:о) (s:т) (E:о-> о-> т) (F:о-> о-> о-> т-> Е) (e:0cT (F o y) s 0 W (E o y)) n 0 0 (ld c)= ax (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)е):= by have:=eg H (λo y=>cT (F o y) s 0 W (E o y)) (λk a=>k<= n-> a=ax (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 iF _ _ _ _ _ _ _ λj l=>by simp[show W*(o*H+y)+j=(o*H+y)*W+j by ring,be o y j H W m l]) n 0 0 _ e λ_=>rfl simpa[Τ W n] using this lemma js (g:α-> kG-> α) (I:р kG) (w k U:о):∀n l j e,j wl g I w k n (U+l*w+j) j e=(qi (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⟩:=(m0 (a:=l*k+j) (d:=l) А).2 ⟨by ring,q⟩ rw[Bb,lN];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 iR (g:α-> kG-> α) (I:р kG) (w k U n:о) (e:α) (j:0g e I[U+t/k*w+t%k]!) e:=by have:=js 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:=ke h lemma fm:Z x=((xа:п):ZMod (2^64)):=by unfold Z;norm_cast lemma gI:Z x=((af x:п):ZMod (2^64)):= (iq x _).mp (by rw[fZ];unfold pE;omega) lemma jn (m:Д) (h:mа<2^62): af (sg u m)=if kY u then-(mа:п) else mа:=by unfold sg;rw[fc];cases kY u<;>simp only[fT,AU,AM]<;>refine sZ _ _ ?_ А А;exacts [fm m,by rw[i5,bI,fm];push_cast;ring] @[inline] def bT (s:ConvShape) (I:р с) (c y x:о):с:= if csimp[*,AG] def d8 (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(d8 I p n d l e j X hd)г=Xг /\ ∀qintro j X hd u<;>rw[d8] .rw[Af (by rw[γ];omega)];exact ⟨rfl,λq _=>by rw[AF А]⟩ rename_i m r;have h:j?_ rw[o q (by rw[bf];exact g),Dense.ag h,fz _ _ _ _ _ g,Dense.ae А] split_ifs<;>first | omega | (rw[eE,Dense.ae А];congr 2;omega) | rfl def RV (s:ConvShape) (r j:о) (p d:т) (n:о):Prop:= rby have:=ν (s.h+2) h;omega lemma iH {s:lG} {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:=(iH AY h B g).1 rw[Dense.ae А,m,F,<- Ρ];congr 1;clear*-g;omega .split .exact ⟨c+1,by rw[Ρ];omega,by rw[m,Ρ];congr 1;omega⟩ .exact ⟨c,А,by rw[m];congr 2;omega⟩ def c9 (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 (c9 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[c9] .rw[Af А];refine ⟨v,λq e=>?_⟩ rw[A q e,bT];split;. rfl have:=ν (s.w+2) (А:s.cin*(s.h+2)<= j) rw[AF (by rw[mg В,<- ύ];omega)] rename_i m L;have B:jrename_i D;on_goal 2=>refine L _ _ _ _ _ _ _ v (by clear*-B hm;omega) λq e=>?_;rw[A q e] obtain ⟨Y,b2,b3⟩:=iH u h (g ▸ B) D;obtain ⟨U,M⟩:=cJ I p l (d+1) H А _ 0 X ⟨А,h.2.2.2.2⟩ rfl refine L _ _ _ _ _ _ _ (U.trans v) (by clear*-hm;omega) λ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[be c r x _ (s.w+2) O А,bT];split_ifs<;>first | omega | with_reducible rfl | (congr 2;omega) lemma eD (A:р о) (u:т) (h:uбomega def fH (f:о-> у):Dense.F.A8:=⟨f 0,f 1,f 2,f 3,f 4,f 5,f 6,f 7⟩ lemma fI (f:о-> у) (r:о) (e:r<8):(fH f).f r=f r:=by unfold fH;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 fV (e t:о):py e t<=2:=by unfold py;split<;>omega lemma fU (e t:о):px e t<=2:=by unfold px;split<;>omega lemma fR (e t g:о) (j:e=9\/e=1) (l:tsimp[pc]<;>omega abbrev fB (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.bP (λt=>pc e t*j+py e t*V+px e t) (g*e) (ld (g*e)))в=g*e /\ ∀tpc e t*j+py e t*V+px e t) (g*e) (ld (g*e)))[t]! =pc e t*j+py e t*V+px e t:=by rw[Dense.F.iw];exact ⟨lL,λt l=>by rw[AG _ _ (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) (ld (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:=fR e t g m l;omega) have p:=ν V (fV e t);have q:=fU 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 je: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 (aA d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x) @[inline] def eI (relu:ф) (w:с):с:=if relu&&w&&&0x80000000!=0 then 0 else w @[inline] def cg (d:CD) (o y x:о) (S:у):с:= let c:=Dense.F.ai S d.hh if h:c<Ж then eI d.J cй else ow d o y x S lemma iz (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.ai S d.hh)й≠255:=by unfold Dense.F.ai at g⊢;dsimp only at g⊢;split_ifs at g⊢with e<;>[skip;exact absurd g Б];simp only[Ε,AK] at e;obtain ⟨⟨⟨-,q⟩,-⟩,-⟩:=e;have:=(Dense.F.eF S.toBits).toNat_lt;have p:(S.toBits&&&0xfffffffffffff)а<2^52:=(by rw[Θ];exact AR ϓ Б);simp only[ι,Λ,kC] at q;have m:=Dense.F.fr S.toBits А;have r:S.toBitsа/2^63<2:=(by have:=S.toBits.toNat_lt;omega);simp only[ι,kC] at g;intro j;have l:=congrArg p8 j;rw[kI,Ν,Χ,Ϭ] at l;simp only[kZ,kK,ζ] at l;rw[θ _ 8,μ g,m] at l;omega unfold ow Dense.F.tw Dense.F.tf eI qr reluW;dsimp only;rw[AI g];cases d.J<;>simp[m] .rfl @[inline] def bu (d:CD) (o y:о) (xb:т) (r:о) (S:у):с:= let c:=Dense.F.ai S d.hh if c<Ж then eI d.J cй else ow d o y (xbб+r) S lemma iA (d:CD) (o y:о) (e:т) (r:о) (S:у):bu 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 kG) (n q:о):∀m r (a b:р kG),pl g n r q a=b-> n-r=m-> r<= n-> bв=aв /\ ∀irintro r a _ rfl o p;rw[pl,AF А];exact ⟨rfl,λi e=>by rw[AF А]⟩ | succ m u=> rintro r a _ rfl o p;obtain ⟨v,l⟩:=u (r+1) (a.set! (q+r) (g r)) _ rfl А А;rw[pl,AI А,v,Bd];refine ⟨rfl,λi e=>?_⟩;rw[l i (by simp[e])];rcases eq_or_ne i (q+r) with rfl | j<;>[rw[nw _ _ _ e];rw[nW _ _ _ _ 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 (bu d o y xb 0 A.a0) (by have:=h.2.1;omega)).uset (q+1) (bu d o y xb 1 A.a1) (by simp only[ϒ];exact hu 1 (by simp only[AE];omega))).uset (q+2) (bu d o y xb 2 A.a2) (by simp only[ϒ];exact hu 2 (by simp only[AE];omega))).uset (q+3) (bu d o y xb 3 A.a3) (by simp only[ϒ];exact hu 3 (by simp only[AE];omega))).uset (q+4) (bu d o y xb 4 A.a4) (by simp only[ϒ];exact hu 4 (by simp only[AE];omega))).uset (q+5) (bu d o y xb 5 A.a5) (by simp only[ϒ];exact hu 5 (by simp only[AE];omega))).uset (q+6) (bu d o y xb 6 A.a6) (by simp only[ϒ];exact hu 6 (by simp only[AE];omega))).uset (q+7) (bu d o y xb 7 A.a7) (by simp only[ϒ];exact hu 7 (by simp only[AE];omega)) else iU d o y xb nq q A a lemma gu (g:о-> kG) (n q:о):∀m r (a:р kG),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,AI А,pl,AF А] conv_rhs=>rw[pl,AF А] rename_i e;conv_lhs=>rw[pl,AI А] rw[e (r+1) _ А А];conv_rhs=>rw[pl,AI А] lemma kg (d:CD) (o y:о) (g e q:т) (A:Dense.F.A8) (a:р kG) (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 aV;split .rename_i h;obtain ⟨m,v,x⟩:=h have:=ψ;have p:=USize.le_iff_toNat_le.mp m;simp only[kD] at p;have e:∀k:т,kб<8->(q+k)б=qб+kб:=λk B=>Dense.ae А rw[(А:min 8 gб=8)] iterate 8 rw[jr] rw[e 1 (by simp only[kD];omega),e 2 (by simp only[kD];omega), e 3 (by simp only[kD];omega),e 4 (by simp only[kD];omega), e 5 (by simp only[kD];omega),e 6 (by simp only[kD];omega), e 7 (by simp only[kD];omega)] simp only[kD];iterate 8 rw[pl,AI А] rw[pl,AF А];simp only[iA,ό,ϋ,Nat.reduceAdd];rfl have L:=kg d o y j g q A a u;have l:=L 0 0 (by simp only[kD]) A.a0 rfl rw[Nat.zero_min,pl,AF А] at l;unfold iU simp only[l,L 1 1 (by simp only[kD]) A.a1 rfl,L 2 2 (by simp only[kD]) A.a2 rfl, L 3 3 (by simp only[kD]) A.a3 rfl,L 4 4 (by simp only[kD]) A.a4 rfl, L 5 5 (by simp only[kD]) A.a5 rfl,L 6 6 (by simp only[kD]) A.a6 rfl, L 7 7 (by simp only[kD]) 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-> р kG-> р kG) (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)): d7 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[d7,Af λh=>by have:=γ.mp h;omega];congr 1 exact j9 _ _ λr H=>by rw[I r H,Dense.F.ab,AF А] | succ m ih=> have h:t(i+(e.uget t А)е+c)б=iб+e[tб]!+cб:=λc hc=>by rw[eD,Dense.ae (by rw[J];omega),J] rw[d7,AZ h];refine ih (t+1) _ _ _ _ _ _ _ _ A (by rw[Dense.ag h];omega) λr H=>?_ rw[I r H,Dense.F.ab,AI O,Dense.ag h];congr 1;interval_cases r<;>simp (disch:=(try simp only[AE]);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 gO (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:р с):р с:= d7 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 gP (d:CD) (c:CC d.M) (o y:о) (e m q i:т) (p:iб+d.M+8<= d.Xг) (l:у) (a:р kG) (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 lm*Dense.F.dw d.b[o]!):gO aV d c o y e m q i p l a=aV d o y e m q (fH (ez d c o y eб)) a:=by subst g;unfold gO;have:=c.h3;refine gV _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>?_;simp only[fI _ _ u,ez,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 kG) (u:∀g r x,g+r=x-> r<8-> x cg d o y x (ez d c o y g r)=F x):∀m (g e q i:т) (a:р kG) (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 aV 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[AZ 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[fI _ _ А];exact u _ _ _ rfl А А) all_goals rw[rB,Af h];simp[γ] at h;exact ⟨rfl,λj _=>by rw[AF А]⟩ @[specialize] def cP (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б-> р kG-> р kG) (u N:о) (G:о-> kG) (B:∀y (l:y aв=N->(f y l q i g a)в=aв /\ ∀j y<= h-> q=u+y*e-> aв=N->(cP 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[cP,Af А];exact ⟨rfl,λj _=>by rw[AF А]⟩ | 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 eo (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 cP 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 iB (d:CD) (c:CC d.M) (o q:о) (m:у) (a:р kG) (N:о) (G:о-> kG) (p:∀y l=q+y*d.s.w-> eв=N->(rB aV 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г):(eo aV 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 (ϰ _) (by simp) x .rw[Af g,Nat.eq_zero_of_not_pos (mt A g)];exact ⟨rfl,λj _=>by rw[ϴ,ό,AF А]⟩ lemma fn (A:р о) (i:т) (v:о) (h:iбsimp[*,AG] def df (K:р с) (T:р о) (M:о) (ok k:т) (hK:okб+kб<= Kв/\Kв<2^32) (hT:∀tby rw[Dense.ag hc'] at hj;rw[fn _ _ _ _ _ А];split .rw[eD];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.ag 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 e9 (K:р kG) (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[df,Af (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,add_zero];exact e z λs _ l=>h s А l⟩ .refine D (t+1) (c+1) _ _ _ _ _ _ rfl (by clear*-J x;omega) ⟨А,λj=>if j?_,λz v=>?_⟩ .rw[fn _ _ _ _ _ А,fz _ _ _ _ _ А];dsimp only;split_ifs<;>first | omega | exact (p j ‹_›).imp (λ_=>А) id | exact ⟨А,eD ..,by rw[A]⟩ .rw[G,x,Μ,Μ,<- e z λs _ h=>v s А h];dsimp only;rw[AF (Ai _)];congr 1;exact Ϙ rfl λj q=>by rw[AI (mr q)] lemma ej (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 iu (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 ip (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 ip;rw[AZ rfl];exact (iu _ _ _ _ _ _ _ _ _ _ rfl).2.2 @[inline] def cD (d:CD) (c:CC d.M) (o q:о) (a:р с):р с:= if je then eo iT d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else eo aV d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a def c7 (d:CD) (hT:∀t kG) (F:∀o q=o*(d.s.h*d.s.w)-> aв=N->(cD d c o q a)в=aв /\ ∀j q=o*(d.s.h*d.s.w)-> aв=N->(c7 d u e v o q g l p a)в=aв /\ ∀jintro o q g l p a I x _;rw[c7,Af А];have:=ν (d.s.h*d.s.w) (А:d.Y<= o);exact ⟨rfl,λj _=>by rw[AF А]⟩ | 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 iC (s:lG) (I:р kG) (g:о) (q:fB s g) (y x t e:о) (u:ysimp only[mw,bT,pc,py,px,j,l,m,o,↓reduceIte,(Б:(1:о)≠9),ϧ,Nat.reduceMul,qj,ql,ό,BB,Nat.add_sub_cancel,((by clear*-;omega):(e*9+t)/9=e+t/9),((by clear*-;omega):(e*9+t)/3%3=t/3%3),((by clear*-;omega):(e*9+t)%3=t%3)] at p⊢<;>split_ifs<;>first | rfl | omega lemma j5 (s:lG) (I:р kG) (e:о) (g:∀q:о,kI I[q]!≠255/\kJ I[q]! <= e) (y x t:о):kI (mw s I y x t)≠255/\kJ (mw s I y x t)<= e:=by unfold mw;dsimp only;split .exact ⟨Б,by rw[(Б:kJ (0:kG)=0)];exact ϰ _⟩ .exact g _ def XT:р FloatArray:=Au (n:=10) λk=>⟨AL (2^(kи+7)) (Dense.F.dw 0)⟩ def xT (n:о):FloatArray:= let k:=An n+1-7 if k<10 then XT[k]! else ⟨AL n (Dense.F.dw 0)⟩ lemma dq (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->(⟨mD m (Dense.F.dw 0)⟩:FloatArray).data[q]! =Dense.F.dw 0:=λm q h=>by simp[AG,h] unfold xT;dsimp only;split .rw[AG XT _ (by simp[XT];omega)] simp only[XT,Ξ,kX,ϐ] exact ⟨(Ϛ (n:=n)).le.trans (Κ Б А), .inr (Κ Б А),λq e=>g _ q e⟩ .refine ⟨?_,.inl ?_,λq e=>g _ q ?_⟩<;>simp_all[kX] lemma dl (s:lG) (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):=lZ _ А;obtain ⟨g,l,-⟩:=dq ((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:= c9 I s hs hI s.wе (s.w+2)е (dl s hN).1 (dl s hN).2.1 (s.cin*(s.h+2)) rfl 0 0 0 0 (xT ((s.cin*(s.h+2)+3)*(s.w+2))) (dl s hN).2.2 lemma dn (s:lG) (I:р kG) (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 (bT 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⟩:=dq ((s.cin*(s.h+2)+3)*(s.w+2));have:=eO I s j g _ _ (dl s e).1 (dl s e).2.1 _ rfl _ 0 0 0 0 _ (dl s e).2.2 _ rfl rfl λq l=>by simp[o q l] rw[xF,this.1];exact ⟨m,А,this.2⟩ lemma gN (h w e l m y o g V:о) (A:V=w+2) (j:g=(h+2)*V) (q:y о) (hs:fB d.s d.kk) (a1:0 ℝ,(∀s z s=0) -> ∑j∈kF c.n,z (N j)=∑s∈kF d.k,z s) (S:у) (hS:S=Dense.F.ab (λ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 lm*Dense.F.dw d.b[o]!)): cg d o y x S=qr d.J (aA d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x):=by have aL:=hc o ho;have hB:=gN d.s.h d.s.w d.s.cin p _ y x _ _ rfl rfl hy l aL a1;have g:=Dense.F.di lm d.b[o]! Б (hb _).1;have G:=(Dense.F.jK lm d.b[o]! 126 O Б (hb _).2).trans (AV one_le_two (by omega:_<= P)) simp only[iz,hS,ow,aA,Dense.F.gg,Dense.bY];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:=j5 d.s d.I U hx y x;have E:=λu v=>(Dense.F.jK (mw d.s d.I y x u) d.K[v]! _ _ (W _).2 (hw _).2).trans (AV one_le_two ah) have V:=λu v=>Dense.F.di (mw d.s d.I y x u) d.K[v]! (W _).1 (hw _).1 have hX:∀tby obtain ⟨q1,q2,q3⟩:=be (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:=fV d.kk t;omega) (by have:=fU d.kk t;omega) rw[aH _ (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,as t m];ring,q1,q2,q3,iC d.s d.I d.kk hs y x t _ hy l (by have:=fR d.kk t p (hs.imp (·.2.2.2.2) (·.2.2.2.2)) (a0 ▸ m);omega)] obtain ⟨fS,eS⟩:=Dense.F.gz _ _ _ _ _ rfl ▸ Dense.F.gy (λ_=>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.kx _ _ _ _ _ _ _ _ _ _ (λt m=>?_) (by simpa using g) (λt _=>?_) (λt _=>?_) hL e al r rfl _ fS (Eq.trans_le ?_ (eS.trans ?_)) .simp only[AI m,hX t m];exact V _ _ .split;exacts [⟨(W _).1,(hw _).1⟩,⟨Б,(hb _).1⟩] .split;exacts [E _ _,G] .rw[az,aj];push_cast;rw[<- B] .simp only[Ai,if_false];rw[add_comm];congr 3 exact Ϙ rfl λj l=>by simp[(A j (mr l)).1] .exact λs a2 h0=>by simp[a2,tm,sv,<- an,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,<- AB,<- AB,<- AJ AD,<- AJ AD];congr 1;clear*-a3 e;omega def gS (d:CD) (Z:ф) (Wd:FloatArray) (hT:∀tcD d (ip d Z Wd hT hk hkT hW hY o ho) o q a) 0 0 0 (by simp) (AL (d.Y*(d.s.h*d.s.w)) 0) lemma oE {A a:р kG} {M N} {G:о-> kG} (h:Aв=aв /\ ∀j?_;have:=h.2 i (h.1 ▸ e);simp only[lL] at g;rw[AG A i e,AI ⟨ϰ _,g⟩] at this;simp[this] lemma gT (d:CD) (Z:ф) (m:FloatArray) (hW:Z=true\/d.Y*d.k<= mг/\mг<2^32) (H IX IW IB P:о) (hs:fB d.s d.kk) (B:0 mг=d.Y*d.k /\ ∀qqr d.J (aA 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)->(cD d c o q a)в=aв /\ ∀j?_) O А λbo=>by have bh:=gN 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[ϙ,ύ,a6,hq] obtain ⟨s,g⟩:=jj d c o y _ rfl _ (λxb r x e h2 h3=>jY _ _ _ _ _ _ _ _ hs B a5 hc hM as hT u aL hx hw hb U ah hL p al a2 o y x l hy h3 a1 a3 G _ (by subst e;unfold ez;congr 1;funext t;congr 2;clear*-;omega)) _ 0 _ Nе _ a' hI AY (by simp[e1]) (by simp[hi]) А А refine ⟨s,λi hi=>?_⟩;rw[g i hi,e1,e2];refine ite_congr rfl (λa0=>?_) λ_=>rfl;obtain ⟨q1,q2,q3⟩:=be o y (i-N) d.s.h d.s.w hy (by clear*-a0;omega);rw[e,Nat.add_sub_of_le a0.1] at q1 q2 q3;simp only[q1,q2,q3,Ϫ,ϋ] unfold gS;split .exact oE (gU _ _ _ _ _ _ hf _ 0 0 _ _ _ _ rfl (by simp) (by simp)) (by simp) rfl .exact oE (ef _ _ _ _ _ _ 0 _ _ (λo l q _ _ a hq O=>hf o l q a _ (eZ _ _ _ _ _ _ _ _ aH o l _ rfl) А O) _ 0 0 0 _ _ rfl (by simp) (by simp) (by simp)) (by simp) (ϋ _) lemma jL (K:р kG) (n:о):(Dense.F.bc (λq=>Dense.F.dw K[q]!) n (kN n))г=n /\ ∀qDense.F.dw K[q]!) n (kN n)).data[q]! =Dense.F.dw K[q]!:=by obtain ⟨g,-,j⟩:=Dense.F.cC (λq=>Dense.F.dw K[q]!) n _ (kN n) rfl (by simp[kN,kX]) exact ⟨g,λq e=>j q (by simp[kN,kX]) 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 ⟨Aj 0,Or.inl hZ⟩ else ⟨Dense.F.bc (λq=>Dense.F.dw K[q]!) n (Aj n),Or.inr (by rw[(jL K n).1];omega)⟩ lemma kA (K:р kG) (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 (Aq k) if hg:fB 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 gS ⟨s,I,K,b,xF s I hIs hI hX32,T,D,J,k,M,L,(P+2*L-54)ж,Y,kk, (dn 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 d6 (s:lG) (J:ф) (I K b:р kG) (D:ф) (j Y:о) (U:D=false/\j=s.cin/\Y=s.cout\/D=true/\j=1/\Y=s.cin):ft s J I K b D j Y=dS s J I K b D:=by unfold ft bJ;dsimp only;split;swap;rfl;rename_i hg;obtain ⟨hs,-,aL,x,v,u,r,ah,N,l,m,aH,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[BX,BW,A,B,G,H]<;>omega obtain ⟨al,-,as⟩:=dn s I l hI e;have:=ψ;rw[gT _ _ _ _ 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 kA K _ g p m) (by exact Dense.F.cH I А v) (by exact Dense.F.cH K А u) (by exact Dense.F.cH b А r) (le_max_left _ _) (le_max_right _ _) (by exact Ϛ) ‹_› ‹_› (by dsimp only;rw[ϑ,Α (by simp only[lu];omega)]) ‹_› ‹_›];rcases U with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp only[dS,fT,AU,AM,m3,conv2dWith,depthwiseSpec,depthwiseWith,L,M]<;>refine mq (by simp[L,M]) λq _ _=>?_<;>simp only[ax,Ξ,aA,Dense.bY,ύ,pr,ϴ,ϋ] @[inline] def rs:ConvShape:= if s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\0qr J (lV (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[mw,e,g,j,l,ϧ,qj,ql,ό,BB];rw[AF А,Τ s.h s.w,Nat.mod_mul];congr 1;ring lemma jk:m3 (rs s) J I K b=m3 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 d4:р с:= ft (rs s) J I K b false (rs s).cin (rs s).cout def cf:р с:= ft s J I K b true 1 s.cin lemma d5:d4=m3:=by funext s J I K b;rw[<- jk];exact d6 (rs s) J I K b false (rs s).cin (rs s).cout (.inl ⟨rfl,rfl,rfl⟩) lemma cF:cf=depthwiseSpec:=by funext s J I K b;exact d6 s J I K b true 1 s.cin (.inr ⟨rfl,rfl,rfl⟩) lemma aR:(kI u)д=uд/2^23%256:=by unfold kI rw[Ν,Χ,show (255:Е)д=2^8-1 from rfl, θ] simp[ζ] lemma aI:(mz u)д=uд%2^23:=by unfold mz;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 iY: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) (Ϥ (m/2^23-1));rwa[<- AH,(А:24+(m/2^23-1)=m/2^23+23)] at this lemma c0 (g e:о) (h:g[omega;exact ώ А В] .have:=iY g;have:2^(e/2^23+22)<= Kf e:=by unfold Kf;rw[AF А,AF А,(А:e/2^23+22=23+(e/2^23-1)),AH];exact ν _ А have:=Κ A7 (А:g/2^23+23<= e/2^23+22);omega def kv (w:с):п:=sv w*2^idxOf w lemma ij: 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)=kR u*2^kJ u by unfold kR kJ Kf;rw[(by rw[aR];omega:u.toNat%2^31/2^23=(expOf u).toNat),(by rw[aI];exact Nat.mod_mod_of_dvd _ Б:u.toNat%2^31%2^23=(fracOf u).toNat)];simp only[<- Β,ϯ]];simp only[<- au];split_ifs<;>push_cast<;>ring lemma bW: (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[Ο,<- Β,nz]<;>omega lemma fY (a b:Е) (h:sk aomega lemma gR:Model.cmpDyadic (nU y) (nU z)=compare (kv y) (kv z):=by have e:∀w,(nU w).toReal=(kv w:ℝ)*2^(-149:п):=λw=>by rw[<- ϔ,nv];unfold kv;push_cast;rw[Ah AD,AB];ring have g:(0:ℝ)<2^(-149:п):=zpow_pos A7 _;cases h:compare (kv y) (kv z) .rw[Model.cmpDyadic_lt_iff,e,e];exact AP (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 AP (by exact_mod_cast compare_gt_iff_gt.mp h) g lemma bZ (g:kR u=0):u=0\/u=0x80000000:=by have l:=u.toNat_lt;unfold kR at g;split_ifs at g with j .have e:=aR u;have m:=aI u;rw[j] at e;rw[<- Β,<- Β];simp at e⊢;omega .omega lemma bq:nM (mx y z)=A5 (nM y) (nM z):=by unfold mx;split .rename_i h;have g:=kS y h.1;have j:=kS z h.2.1 unfold A5;rw[Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff (nM y) (nM z)).2 ⟨kQ g,kQ j⟩),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ (gR y z ▸ Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ g j)];rcases h.2.2 with e | e | rfl .rw[AI e,compare_lt_iff_lt.mpr (fY y z e)] .rw[AF (BQ e),compare_gt_iff_gt.mpr (fY z y e)] .rw[AF (UInt32.lt_irrefl _),compare_eq_iff_eq.mpr rfl] by_cases l:kR y=0 .rcases bZ y l with rfl | rfl<;>decide .simp[show Model.isZero (nM y)=false by unfold nM;rw[Model.isZero_eq_beq_zero_of_toDyadic?_some g,decodeD_sig_zero];simpa using l] .exact aK _ lemma iO: qm (ly u:Model nN)=u:=by show BP (ly u:Model nN).bits=u;rw[pM] lemma aM (e:kI u≠0): nU u=⟨kY u,2^23+(mz u)д,((kI u)д:п)-150⟩:=AF e lemma ep:k9 (m*2^23) (2^23)=m:=by unfold k9;simp lemma bL (e:r=0\/r=0x80000000) (g:kI d≠0) (j:kI d≠255) (l:kY d=false): la (Am (nM r) (nM d))=r:=by have m:nU r=⟨kY r,0,0⟩:=by rcases e with rfl | rfl<;>rfl rw[nG];unfold qs nM;rw[kS r (by rcases e with rfl | rfl<;>decide),kS d j,aM d g,l,m] simp;rcases e with rfl | rfl<;>rfl abbrev av:с:=toWord (Am (ofW (dotOf n fa λ_=>oneW)) (ofW d)) lemma gk (p:DQ d):eM r d=la (Am (nM r) (nM d)):=by obtain ⟨v,F,g⟩:=p;replace g:=n6 g;unfold eM;dsimp only;split .obtain ⟨D,o,m,j⟩:=‹_/\_›;replace j:=n6 j;replace m:=Ο.mp m have l:(kI d)д=(kI d-127)д+127:=by rw[nX _ _ o];have:=UInt32.le_iff_toNat_le.mp o;simp at this⊢;omega generalize kI d-127=q at*;symm;have K:=aR r;have L:=aI r;have o:(kI r)д≠255:=λh=>j (Β.mp (by simpa using h)) have M:=fracOf_toNat_lt r;rw[nG];unfold qs nM rw[kS r j,kS d g,aM r λh=>by simp[h] at m,aM d λh=>by simp[h] at l, D,v] have x:((2:о)^23==0)=false:=Б;have A:(2^23+(mz r)д==0)=false:=by simp simp only[ϯ,ό,Bool.xor_false,x,A,fT,AM];erw[<- nI,a8];unfold pQ;rw[show lh (2^23+(mz r)д) (2^23)=0 by unfold lh;rw[(by rw[n0 А];constructor<;>omega:An (2^23+(fracOf r).toNat)=23),Nat.log2_two_pow];simp[mQ,m5,χ]<;>omega];simp only[x,A,fT,AM,Ap,sub_zero];rw[AF А,AF А,AF А] rw[show ((23:п))=Int.ofNat 23 from rfl, my] simp only[show ∀a,Nat.shiftLeft a 23=a*2^23 from λa=>χ a 23,ep];have J:((2^23+(mz r)д:о)==qt 24)=false:=by simp[qt];omega simp only[J,fT,AM];rw[AF А];set e:=r-(q<<<23) with p;have B:(q<<<23)д=qд*2^23:=by rw[nP];simp[χ];omega have u:eд=rд-qд*2^23:=by rw[p,nX _ _ (by rw[nV,B];omega),B] rw[<- ps,<- iO e,ofUInt32_eq_ofFields];have G:kY e=kY r:=by rw[Ϣ,au,au,u];clear*-K m;omega have H:(kI e)д=(kI r)д-qд:=by rw[aR e,u];clear*-K m;omega have I:(mz e)д=(mz r)д:=by rw[aI e,u];clear*-K L m;omega rw[G,H,I,((by clear*-l m;omega):Int.toNat _=(kI r)д-qд),(Б:qt 23=2^23),nJ];rfl split .exact (bL r d (by rename_i h;have N:=r.toNat_lt;have l:=congrArg p8 h;rw[Ν,show (0x7FFFFFFF:Е)д=2^31-1 from rfl,θ] at l;rw[<- Β,<- Β];simp at l⊢;omega) F g v).symm rfl lemma gm (g:о-> Д) (m:о):∀e:Д, Z ((pX m).foldl (λe t=>e+g t) e)=Z e+∑t∈kF m,Z (g t):=by induction m with | zero=>simp | succ m j=> intro e;rw[mH,mb,lN,pu,dr,j,Μ];ring lemma iL:af 0=0:=rfl lemma gA: (decide (kR u*kR lm=0)&&Bool.xor (kY u) (kY lm))=(u==0x80000000):=by by_cases e:kR u=0 .rcases bZ u e with rfl | rfl<;>decide .simp[(Б:kR lm=2^23),(Б:kY lm=false),e];rintro rfl;exact e Б lemma dB (c:о):∀i,i+c<= n -> (pa (kT (n:=n) λj=>fa jи) (kT (n:=n) λ_=>lm) i c=true↔ ∀t,i<= t-> t< i+c-> fa t=0x80000000):=by induction c<;>intro i o .simp[pa];intros;omega rename_i m;rw[pa,ac n fa i А,ac n (λ_=>lm) i А,gA,Ε,m (i+1) А,AS] exact ⟨λ⟨e,g⟩ t l p=>l.eq_or_lt.elim (. ▸ e) λh=>g t h А,λh=>⟨h i AY А,λt e g=>h t А А⟩⟩ lemma eH (w k U m:о) (e:0 Д) (L M:п) (T:∀t ф) (I:g ()=true↔∀t kG) (u:p ()=lV n fa λ_=>lm) (d:kG) (m:DQ d): wo B A H g p d=av n fa d:=by have o:=λt e=>dg c B (fa t) x G (q t e) have K:=abs_le.mp ((lH _ _).trans ((Ϻ λt e=>(T t (mr e)).2.1).trans (by simp:_<=(n:ℤ)*L)));have N:=abs_le.mp ((lH _ _).trans ((Ϻ λt e=>(T t (mr e)).2.2).trans (by simp:_<=(n:ℤ)*M))) have F:aj n fa (λ_=>lm)=(af H*2^25+af A)*2^(Bа+149):=by rw[sZ A (∑t∈kF n,af (l (fa t))) (by simp[v,gI]) (by linarith) (by linarith), sZ H (∑t∈kF n,af (j (fa t))) (by simp[D,gI]) (by linarith) (by linarith), pv,<- nY,pv] refine Ϙ rfl λt e=>?_ rw[(T t (mr e)).1];unfold tm ed;rcases (o t (mr e)).2 with r | ⟨q,-⟩ .simp[dj _ r] rw[(Б:sv lm=2^23),(Б:kJ lm=126),Ao,Ao,<- AH,<- AH];congr 2;omega unfold wo av;split .rw[bL _ d ?_ m.2.1 (n6 m.2.2) m.1]<;>rw[aQ n fa _ λt e=>⟨(o t e).1,Б⟩,show aj n fa (λ_=>lm)=0 by simp[*,iL]]<;>simp[mi,J.ne',dB n fa n 0 А,I] exact or_iff_not_imp_right.2 λh=>by simpa using h .rw[gk _ d m,Dense.cW,dD];refine congrArg (λs=>la (Am (nM s) (nM d))) ?_;split .refine (aP n fa _ _ _ _ (λt e=>⟨(o t e).1,Б⟩) ?_ ‹_›).symm rw[F,eG,ξ,mo (by simp;omega)];rfl .exact u lemma f5 (c:Д) (x:kG) (g:Bа<=255) (p:cа<=37) (h:ok c B x=true): af 0*2^25+af (t1 B x)=ed Bа x /\ |af (t1 B x)| <= 2^(24+cа)-1 /\ |af 0| <= 0:=by obtain ⟨-,e | ⟨m,o,l⟩⟩:=dg c B x g А h .simp[t1,sg,(ς.mp (by rw[an,e];rfl):mW x=0),ed,dj x e,iL,one_le_pow₀] have j:=lE x;have:kR x*2^(kJ x-Bа)<2^(24+cа):=(by rw[AH];exact lB j (Κ Г А) В);have:2^(24+cа)<=2^61:=Κ Г А unfold t1 ed sv;rw[iL,jn]<;>rw[Ζ,an,l,χ,mo (a:=kJ x-Bа) А,mo А] .cases kY x<;>simp only[fT,AU,AM,BG,Aw]<;>refine ⟨by push_cast;ring,?_,by simp⟩<;> rw[Ae В]<;>exact Int.le_sub_one_of_lt (by exact_mod_cast ‹_<2^(24+c.toNat)›) omega lemma cx: dv Q (fa 0) (fa 1) (fa 2) (fa 3)=true↔∀t<2*2,Q (fa t)=true:=by simp only[dv,Ε];refine ⟨λ⟨⟨⟨a,b⟩,c⟩,e⟩ t g=>by interval_cases t<;>assumption,λH=>⟨⟨⟨H 0 ?_,H 1 ?_⟩,H 2 ?_⟩,H 3 ?_⟩⟩<;>decide lemma gX:(eF u)а=(kI u)д:=by unfold eF kI;simp lemma ic (x:kG):ay x<=255:=by unfold ay;split .rw[ο,am];unfold kJ;have:=mR x;split<;>simp<;>omega .decide lemma mn (a b:Д):(min a b)а=min aа bа:=UInt64.toNat_min _ _ lemma dc (a b:Д):min a b<= a:=ο.mpr (by rw[mn];omega) lemma fJ (a b:Д):min a b<= b:=ο.mpr (by rw[mn];omega) lemma fL (a b:Д):a<= max a b:=by show a<= if a<= b then b else a;split<;>simp_all lemma fO (a b:Д):b<= max a b:=ο.mpr (by rw[UInt64.toNat_max];omega) lemma ct (x:kG) (B M:Д) (j:B<= ay x) (q:eF x<= M) (o:M<= min (B+37) 254) (m:B<=255):ok 37 B x=true:=by have l:=gX x;have g:=am x;have r:=mR x;simp only[ο,mn,ξ,kC] at q o m;simp only[ok,Ε,AT,Ar,n3,AS];refine ⟨λe=>by rw[e] at l;simp at l;omega,(em _).imp id λp=>?_⟩ unfold ay at j;rw[AI (by simpa using p),ο,g] at j apply decide_eq_true;rw[ο,Ι _ _ (ο.mpr (by rw[g];omega)),g] unfold kJ at j⊢;split<;>simp<;>omega lemma gK (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): gJ h w I d g y x e=av (2*2) (poolAt h w 2 I g y x) d:=by have q:=cS 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,kK,qb,Av,add_zero] at l m o p;have:=bk;unfold gJ;dsimp only;split swap;. rfl simp (disch:=omega) only[eE,Ϯ,ϵ,aa,mo,A,l,m,o,p];split .rename_i j;refine (λu r=>f9 _ _ _ 37 _ _ (dW u) Б Б r _ (λ_=>0) _ 0 (λt B=>f5 _ _ _ (dW u) Б (r t B)) Б Б (by simp[dr,Μ]) (by simp[bI]) _ (by rw[cx];simp only[AS]) _ rfl d v) ?B ((cx _ _).1 ?_) .exact ϖ (ϖ (dc _ _) (dc _ _)) (ic _) simp only[dv,Ε];exact ⟨⟨⟨ct _ _ _ (ϖ (dc _ _) (dc _ _)) (ϖ (fL _ _) (fL _ _)) j ?B,ct _ _ _ (ϖ (dc _ _) (fJ _ _)) (ϖ (fO _ _) (fL _ _)) j ?B⟩,ct _ _ _ (ϖ (fJ _ _) (dc _ _)) (ϖ (fL _ _) (fO _ _)) j ?B⟩,ct _ _ _ (ϖ (fJ _ _) (fJ _ _)) (ϖ (fO _ _) (fO _ _)) j ?B⟩ .rfl lemma gw (B:Д) (g:т) (p:gб<= Iв):∀m (e:т) (l:Д),gб-eб=m-> dM I B g p e l=(pX m).foldl (λa j=>a+t1 B I[eб+j]!) l:=by intro m;induction m<;>intro e l r<;>rw[dM] .rw[Af (by rw[γ];omega)];rfl rename_i q;have h:esimp<;>omega lemma eL:dA=avgpoolSpec:=by funext c h w k I;unfold dA;dsimp only;split .obtain ⟨g,e,u,A,r⟩:=‹_/\_›;split .obtain ⟨rfl,G⟩:=‹_/\_›;rw[fE _ _ _ _ _ _ _ e,ύ];unfold avgpoolSpec refine mq (by simp[pA]) λq m _=>?_ simp only[ax,Ξ,pA,lL] at m⊢;have B:=(mg (ϲ 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 gK h w I _ r _ _ _ _ ?_ А rw[show (2:т)=pq 2 from rfl,<- USize.ofNat_mul,<- n5,Τ 2, <- ϝ,aa _ А] .have p:=jQ _ A;split<;>unfold iN avgpoolSpec<;>rw[AI e,fE _ _ _ _ _ _ _ e,ύ]<;>refine mq (by simp[pA]) λq m F=>?_<;>simp only[ax,Ξ,pA] on_goal 2=>split on_goal 3=>rfl on_goal 1=>simp only[gn] all_goals rename_i j;refine (λo=>f9 _ _ _ (cK (k*k)) _ _ (dW j.1) А (ϲ g g) o _ (λ_=>0) _ 0 (λt D=>f5 _ _ _ (dW j.1) p.1 (o t D)) p.2 (by simp) (by rw[cz,iR _ _ _ _ _ _ _ g,gm,bI,Ap];simp only[cS]) (by simp[bI]) _ (by simp only[eH _ _ _ _ _ _ g,cS,AS]) _ rfl _ r) ?_ exacts [λt _=>(em _).elim (λl=>by unfold poolAt;rw[AG I _ l];exact Array.all_eq_true.mp j.2 _ l) λl=>by unfold poolAt;rw[As I _ l];rfl,by simpa only[cS] using (eH _ _ _ _ _ _ g).1 j.2] .rfl @[inline] def ky (u:с):Е:=if u<0x80000000 then u+0x80000000 else 0xFFFFFFFF-u @[inline] def bN (a b:с):с:=if ky asimp_all[Ο,qd,nz]<;>omega lemma ii (a b:kG):(ky (bN a b))д=max (ky a)д (ky b)д:=by unfold bN;split<;>rename_i h<;>rw[Ο] at h<;>omega lemma ik (a b:kG) (h:(ky a)д=(ky b)д):a=b:=by rw[cO,cO] at h;have:=a.toNat_lt;have:=b.toNat_lt;rw[<- Β];split_ifs at h<;>omega lemma fK (g:kI y≠255) (j:kI z≠255):mx y z=bN y z:=by have F a b (h:sk aomega unfold mx bN;by_cases h:sk ysimp[*,F,BQ] rw[AF λ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,Ο,bW,<- Β,kZ] at h⊢;split_ifs at h<;>omega all_goals decide @[inline] def fG (x0 x1 x2 x3:с):с:= if nn x0&&nn x1&&nn x2&&nn x3 then bN (bN x0 x1) (bN x2 x3) else mx (mx (mx (mx x0 x0) x1) x2) x3 lemma m4 (j q r u:kG):fG j q r u=mx (mx (mx (mx j j) q) r) u:=by unfold fG;split .rename_i h;simp only[nn,Ε,AT,Ar] at h;obtain ⟨⟨⟨e,l⟩,m⟩,v⟩:=h have g:∀a b,kI a≠255-> kI b≠255-> kI (bN a b)≠255:=λa b x A=>by unfold bN;split<;>assumption have o:=g _ _ e e;have p:=g _ _ o l;rw[fK _ _ e e,fK _ _ o l,fK _ _ p m,fK _ _ (g _ _ p m) v];apply ik;simp only[ii,Nat.max_self,Nat.max_assoc] .rfl lemma ir {I:р kG} {v t e:т} (g:tб+vб kG): ∀m (e q:т) (a:р kG),eб+2*m=tб+1-> qб+m<= aв-> aв<2^31 -> (∀j< m,fG I[eб+2*j]! I[eб+2*j+1]! I[eб+2*j+vб]! I[eб+2*j+vб+1]! = G (qб+j))->(cQ I v t l e q a)в=aв /\ ∀iintro e q a M K L r .rw[cQ,Af (by rw[γ];omega)];exact ⟨rfl,λi _=>by rw[AF А]⟩ rename_i m H;have h:eby convert r (j+1) А using 2<;>first | omega | (congr 1;clear*-J;omega)).imp (Eq.trans · o) λB i D=>?_ rw[B i А,F,dT];rcases eq_or_ne i qб with rfl | g<;>[rw[nw _ _ _ D];rw[nW _ _ _ _ g.symm]]<;>split_ifs<;>first | rfl | omega def dJ:р с:= 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[AF (by simp),AG _ _ (by simpa using g),nE]⟩) (by simp) .refine mq (L.1.trans (by simp[nk])) λi A h2=>?_ have e:=L.2 i (L.1 ▸ A);rw[AI (by simp only[ϴ,ϋ,ύ];exact L.1 ▸ A),AG,AG] at e<;>assumption obtain ⟨s0,G⟩:=H А;have Y:=ν (w/2) O;rw[Ρ] at Y;have N:oby obtain ⟨B,D,F⟩:=be o y j (h/2) (w/2) X K;have q:=cS 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,kK,qb,Av,add_zero] at m p u v;simp (disch:=omega) only[aa];rw[Τ 2 j,m4,<- dV (mx _ _),bq,bq,bq,bq,m,p,u,v,nk,AG _ _ (by simp;omega),Ξ] simp only[B,D,F,mH,List.range_zero,mb,lN,pu] 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" => AB local notation "ZG" => UInt64.toNat_ofNat' local notation "ZH" => AK local notation "ZI" => Core.an local notation "ZJ" => Nat.div_eq_zero_iff_lt local notation "ZK" => sqrtLower local notation "ZL" => AJ local notation "ZM" => Finset.range local notation "ZO" => mantOf_lt_24 local notation "ZQ" => AD local notation "ZR" => Core.ak local notation "ZS" => Core.am local notation "ZT" => roundRational local notation "ZU" => Ay local notation "ZV" => Nat.div_le_self local notation "ZW" => mantOf local notation "ZX" => signOf local notation "ZY" => AS local notation "ZZ" => idxOf local notation "XA" => AM local notation "XB" => Ah local notation "XC" => two_ne_zero' local notation "XD" => Ao local notation "XE" => ExtendedMantissa.ofMantissaAndAccuracy local notation "XF" => UInt64.ofNat local notation "XG" => Bool.xor local notation "XH" => rowVariance local notation "XI" => (А) local notation "XJ" => (В) local notation "XK" => (by simp) namespace Elem lemma VV (w:kG):(ZC w)а<2^24:=by rw[ZI];exact ZO w lemma YB (a b:kG):(ZC a*ZC b)а=ZW a*ZW b:=by rw[ϊ,ZI,ZI];exact μ (mul_mant_lt a b) end Elem open Elem namespace Norm def Ya:Accuracy->о | .exact=>0 | .inexact _=>1 lemma Yc {α:Type} (f:α->α) (n:о) (a:α): Nat.repeat f (n+1) a=Nat.repeat f n (f a):=by induction n generalizing a with | zero=>rfl | succ n 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 ls (k+2) _= Nat.repeat ls (k+1) _ rw[Yc,Yc,Yc];congr 1;rcases e with _ | ⟨_ | _ | _⟩<;> simp[ExtendedMantissa.ofMantissaAndAccuracy,ls,Ya]<;>omega open FloatLib.Numerics in lemma VY (q r D t:о) (g:0rfl,<-h, show (q*D+r)/D=q by rw[ϕ,Ϸ _ _ g,lF e,Ap], show (q*D+r)%D=r by rw[ϕ,mY,μ 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:=lC e;have h:=Ϛ (n:=q);rw[n0 XI];omega open FloatLib.Numerics in lemma V0 (s:ф) (P g:о) (p:P≠0) (m:g≠0) (q r D:о) (y:0omega have h:=Vi q _ l z;have H:(r:ℝ)/D<1:=by rw[div_lt_one XJ];exact_mod_cast u have F:(0:ℝ)<=r/D:=XJ;push_cast at v w;have x:lh P g=(qз:п)+e:=by apply Model.floorLog2_eq_of_bounds P g _ p m .rw[j,Y5,ZL ZQ,ZF];gcongr;grind .rw[j,Y5,show (qз:п)+e+1=((qз+1:о):п)+e by push_cast;ring,ZL ZQ,ZF];gcongr;linarith have t:k9 (mc P g (23-((qз:п)+e))).1 (mc P g (23-((qз:п)+e))).2= roundShiftRightEven (2*q+if r=0 then 0 else 1) ((2*q+if r=0 then 0 else 1)з-23):=by rw[roundShiftRightEven_eq_roundQuotientEven,h,show qз+1-23=(qз-23)+1 by clear*-o;omega,<-VY q r D _ y u XI] apply Model.roundQuotientEven_eq_of_rat_eq _ _ _ _ (RationalBinary.scaleByPowerOfTwo_snd_ne_zero _ _ _ m) XJ rw[Model.scaleByPowerOfTwo_real];unfold Model.scaledRatToReal;rw[j,Y5,XD,<-ZL ZQ, show e+(23-((qз:п)+e))=-((qз-23:о):п) by clear*-o;omega, zpow_neg,ZF] push_cast;field_simp generalize G:2*q+(if r=0 then 0 else 1)=J at h t⊢;rw[kH,ite_eq_left Б,Model.ieeeRoundDyadic_eq_ieeeRoundDyadicImpl];simp only[Model.roundRat,Model.roundRatScaled,(Б:Fmt.isIEEE=true),↓reduceDIte, Model.ieeeRoundRatScaled,Model.ieeeRoundDyadicImpl,ZY,p,m,XA,x, Int.add_zero,pf,h,(Б:(FloatFormat.ieeeMaxNormalExponent nN:п)=127), show FloatFormat.ieeeMinNormalExponent nN=-126 by decide, show (FloatFormat.normalMantissaExpOffset nN:п)=150 by decide, show Fmt.fracWidth=23 by decide,show J≠0 by omega, show ((qз+1:о):п)+(e-1)=(qз:п)+e by push_cast;ring, show¬((qз:п)+e>127) by omega,show¬((qз:п)+e< -150) by omega, show¬((qз:п)+e< -126) by omega,(А:23<=qз+1),AU, l6,t] 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= la (kH nN ⟨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 (Int.toNat_of_nonneg (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[Nat.cast_natAbs,ϳ] lemma Q7 (R:о) (s:п) (h:2^25<=R): -s+1<=(ZE).targetExponent (kU R (-s)):=by have:=(lT XI).2 h;have:(ZE).mantissaBits<=25:=Б;unfold Be kU;omega lemma Vd (v:ℚ) (r:0simp lemma YN (w:kG):(sv w:ℚ)=0↔ZW w=0:=by unfold sv;split_ifs<;>simp lemma Vr (w:kG):(sv w:ℚ)=(if ZX w then-1 else 1)*ZW w:=by unfold sv;simp lemma Y7 (x:Д):(ZR x)а=xаз:=by rw[aw];rfl @[specialize] def Yh (x:ZB) (i stop:о) (u:Д):о:= if ih (by rw[<-ZI,e];rfl) grind lemma Yi (x:ZB) (e:о): ∀k i u,e-i=k->Yh x i e u<=uа/\ ∀j,i<=j->jZW x[j]! =0\/Yh x i e u<= ZZ x[j]!:=by intro k;induction k<;>intro i u h<;>unfold Yh .grind .rename_i g;rw[AI XI];dsimp only;rw[YK] have a:=g (i+1) (if decide (ZW x[i]! =0)=true then u else if ZD x[i]!grind lemma Yq (x:ZB) (i e:о):Yh x i e 255<2^64:=(Yi x e _ i 255 rfl).1.trans_lt (BL _) def VJ (x:ZB) (u j:о):о:= (ZW x[j]!*ZW x[j]!)<<<(2*(ZZ x[j]!-u)) @[specialize] def Yl (x:ZB) (u i stop:о) (l h:Д) (c big:о):о:= if i>>1)>>>(63-k) else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l'>>1)>>>(63-kж) else g<<<(kж-64))а*2^64=gа*2^k/\ (if kж<64 then (g>>>1)>>>(63-kж) else g<<<(kж-64))а<2^62:=by have j:kжа=k:=by rw[ϑ,ZG,μ XI] by_cases h:k<64 .have l:kж<64:=by rw[ι,j];simpa simp only[l,AU,Ζ,Η,Ι _ _ (show kж<=63 by rw[ο,j];simp;omega),j,kC, χ,ζ,μ h, μ (А:63-k<64),kK,lY] have e:2^1*2^(63-k)=2^(64-k):=by rw[<-AH];congr 1;clear*-h;omega have m:2^64=2^(64-k)*2^k:=by rw[<-AH];congr 1;omega rw[e,m,Nat.mul_mod_mul_right,<-ύ,<-ϙ,Nat.mod_add_div'];exact ⟨rfl,AR (ZV _ _) XI⟩ .have l:¬kж<64:=by rw[ι,j];simp;omega have o:gа*2^(k-64)<2^62:= calc _<2^48*2^14:= lB p (Κ XJ XI) XJ _=_:=rfl simp only[l,XA,ϡ,ϋ,Ζ,Ι _ _ (show (64:Д)<=kж by rw[ο,j];simp;omega),j, kC,μ (А:k-64<64),χ, μ (А:gа*2^(k-64)<2^64)] refine ⟨?_,o⟩;rw[ύ,<-AH];congr 2;omega lemma Vb (x:ZB) (u g:о): ∀k i (l h:Д) c big,g-i=k-> Yl x u i g l h c big=big+lа+hа*2^64+c*2^128+ ∑j∈ZM k,VJ x u (i+j):=by intro k;induction k<;>intro i l h c big r<;>unfold Yl .rw[AF XI];simp only[χ,Finset.range_zero,Finset.sum_empty];ring .rename_i q;rw[AI XI,lW];have e:∀j,VJ x u (i+(j+1))=VJ x u (i+1+j):=λj=>by rw[m6];rfl simp only[e,ό];have p:VJ x u i=(ZC x[i]!*ZC x[i]!)а* 2^(2*((ZD x[i]!)а-u)):=by unfold VJ;rw[χ,YB,ZS] have t:(ZC x[i]!*ZC x[i]!)а<2^48:=by rw[YB];have:=ZO x[i]! calc _<2^24*2^24:=ϛ this this _=_:=rfl rw[p];generalize (ZD x[i]!)а-u=m at* generalize ZC x[i]!*ZC x[i]! =o at* by_cases v:m<=39 .have:=VL o (2*m) t XI;generalize (if (2*m)ж<64 then o<<<(2*m)ж else 0)=w at* generalize (if (2*m)ж<64 then (o>>>1)>>>(63-(2*m)ж) else o<<<((2*m)ж-64))=y at* rw[q (i+1) _ _ _ _ XI];clear r p;have:=l.toNat_lt;have:=h.toNat_lt;have:=w.toNat_lt;simp only[ξ,ι,Al lv,kC];grind .rw[AF v,q (i+1) _ _ _ _ XI,χ];ring lemma Yk (n:о) (f:о->ℚ) (a:ℚ): (pX 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[mH,mb,e,Μ];simp;ring lemma VG (e u:о) (h:u<= e): ((2:ℚ)^((e:п)-149))^2=(2:ℚ)^(2*(e-u))*(2:ℚ)^(2*(u:п)-298):=by rw[<-ZF ((2:ℚ)^((e:п)-149)) 2,<-zpow_mul, <-ZF (2:ℚ) (2*(e-u)),<-ZL ZQ] grind lemma Ye (w:kG) (u:о) (h:ZW w=0\/u<= ZZ w): ZA w^2= (((ZW w*ZW w)<<<(2*(ZZ w-u)):о):ℚ)*2^(2*(u:п)-298):=by rw[Y1,χ];rcases h with h | h .rw[(YN w).2 h,h];simp .rw[mul_pow,show (sv w:ℚ)^2=(ZW w:ℚ)*ZW w by rw[<-sq_abs,VT];ring,VG _ _ h];grind def Yf (num den:о) (s:п):с:= toWord (Model.ofModel Fmt (roundWithAccuracy (ZE) .positive (ZK num den) (-s) (sqrtAccuracy num den))) open Float.Model in lemma Q4 (spec:Format) (h:p7) (R:о) (e:п) (g:Accuracy) (m:R≠0) (q:e+1<= spec.targetExponent (kU R e)): no 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:kU (2*R+Ya g) (e-1)=kU R e:=by unfold kU;rw[Vi R _ m o];omega unfold pJ decreaseExponent;simp only[j];rw[(А:(e-1-spec.targetExponent (kU R e))к=0)];simp;unfold no shiftToTargetExponent shiftToExponent;rw[j];generalize p:spec.targetExponent (kU 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=aD 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[aO _ _ _ 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 @[inline] def YG (num den R:о) (s:п):с:= if R>>>31==0&&-209<= s&&s<=297 then Core.aD false (XF (2*R+(if num==R*R*den then 0 else 1))) (XF (297-s)к) else Yf num den s lemma Vc (g e:о) (s:п) (j:33554432<= ZK g e): YG g e (ZK g e) s=Yf g e s:=by unfold YG;split next h=> simp at h;rw[V9 g e s j h.1.1 h.1.2 h.2];simp simp 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[zpow_neg];grind def V5 (A Dn u:о) (eps:с):с:= let E:=ZW eps let ie:=ZZ eps let w0:=min (2*u) (ie+149) let B:=(A<<<(2*u-w0))+((Dn*E)<<<(ie+149-w0)) let s:п:=(350-(w0:п)-((Bз:п)-(Dnз:п)))/2 let c:п:=(w0:п)-298+2*s let num:=V8 B c let den:=YF Dn c let R:=ZK num den if 33554432<=R then YG num den R s else sqrtRational ((A:ℚ)*2^(2*(u:п)-298)/Dn+ZA eps) lemma YW (A g u:о) (e:kG) (v:0 (2:ℚ)^j=2^k*2^((l:п)-298):=by intro k j h;rw[h,<-ZF,<-ZL ZQ];ring_nf have:=congrArg (λz:ℚ=>(z:ℝ)) (x.trans (by rw[<-w,ZL ZQ,o (2*u-l) (2*(u:п)-298) XI, o (m+149-l) ((m:п)-149) XI,χ,χ] push_cast;field_simp: _=((A:ℚ)*2^(2*(u:п)-298)/g+E*2^((m:п)-149))*2^(2*s))) push_cast at this⊢;omega .rfl @[inline] def VO (x k:о):о:= if k<63&&x>>>(63-k)==0 then (xж<<>>63==0 then (ZR xж)а else xз @[inline] def V2 (r:о) (st:ф):о:=if r !=0 || st then 1 else 0 lemma VI (N M:о) (g:0decide (v<0)=s) (q:0<=δ) (r:δ<1) (x:m=true↔δ≠0) (y:0 ((Ym x u i g P N).1:п)-(Ym x u i g P N).2= (P:п)-N+∑j∈ZM k,YS x u (i+j):=by intro k;induction k<;>intro i P N h<;>unfold Ym .rw[AF XI];simp .rename_i l;rw[AI XI];simp only[Yz,ZI,ZS,lW];have e:∀j,YS x u (i+(j+1))=YS x u (i+1+j):=λj=>by rw[m6];rfl simp only[e,ό];rw[YS];grind lemma Yx (x:ZB) (u j:о) (h:ZW x[j]! =0\/u<= ZZ x[j]!): ZA x[j]! =(YS x u j:ℚ)*2^((u:п)-149):=by rw[Y1];unfold YS;rcases h with h | h .rw[(YN _).2 h,h];simp .rw[show (2:ℚ)^((ZZ x[j]!:п)-149)=(2:ℚ)^(ZZ x[j]!-u)*2^((u:п)-149) by rw[<-ZF,<-ZL ZQ];congr 1;omega,Vr,χ];split_ifs<;>push_cast<;>ring lemma VW (n:о) (x:ZB) (r u:о) (e:∀j,r*n<=j->jZW x[j]! =0\/u<= ZZ x[j]!): (∑j∈ZM n,ZA x[r*n+j]! = ((((Ym x u (r*n) (r*n+n) 0 0).1:п)-(Ym x u (r*n) (r*n+n) 0 0).2:п):ℚ)* 2^((u:п)-149))/\ (∑j∈ZM n,ZA x[r*n+j]!^2= ((Yl x u (r*n) (r*n+n) 0 0 0 0:о):ℚ)*2^(2*(u:п)-298)):=by rw[VN x u _ n _ 0 0 XI,Vb x u _ n _ 0 0 0 0 XI];push_cast[sub_zero,Ap,ϡ,ϴ,ό,ϋ,pv];constructor<;>refine Ϙ rfl λj g=>?_<;>rw[ϩ] at g;exacts [Yx x u _ (e _ XI XI),Ye _ u (e _ XI XI)] lemma YA (n:о) (x:ZB) (r u:о) (e:∀j,r*n<=j->jZW x[j]! =0\/u<= ZZ x[j]!): XH n x r 0= ((Yl x u (r*n) (r*n+n) 0 0 0 0:о):ℚ)*2^(2*(u:п)-298)/n:=by unfold rowVariance;rw[Yk,Ap];simp only[sub_zero];rw[(VW n x r u e).2] @[inline] def Y0 (a b:о):о:=if b<=a then a-b else b-a lemma YO (a b:о):((Y0 a b*Y0 a b:о):ℚ)=((a:ℚ)-b)^2:=by unfold Y0;split_ifs with h .push_cast[h];ring .push_cast[(А:a<=b)];ring lemma VF (n:о) (x:ZB) (r u:о) (y:0jZW x[j]! =0\/u<= ZZ x[j]!): let pn:=Ym x u (r*n) (r*n+n) 0 0 let Q:=Yl x u (r*n) (r*n+n) 0 0 0 0 np n x r=((pn.1:ℚ)-pn.2)*2^((u:п)-149)/n/\ XH n x r (np n x r)= ((n*Q-Y0 pn.1 pn.2*Y0 pn.1 pn.2:о):ℚ)* 2^(2*(u:п)-298)/((n*n:о):ℚ):=by intro pn Q;obtain ⟨e,o⟩:=VW n x r u v;push_cast at e have h:np n x r=((pn.1:ℚ)-pn.2)*2^((u:п)-149)/n:=by unfold np;rw[Yk,Ap,e] set c:ℚ:=2^((u:п)-149) with t;have m:(2:ℚ)^(2*(u:п)-298)=c^2:=by rw[t,<-ZF,<-zpow_mul];ring set S:ℚ:=(pn.1:ℚ)-pn.2 with p;have l:XH n x r (np n x r)= ((n:ℚ)*Q-S^2)*c^2/((n:ℚ)*n):=by unfold rowVariance;rw[Yk,Ap,h,Ϙ rfl λj _=>show (ZA x[r*n+j]!-S*c/n)^2= ZA x[r*n+j]!^2-2*(S*c/n)*ZA x[r*n+j]!+(S*c/n)^2 by ring,nY,Finset.sum_sub_distrib, <-Bc,e,o,m,qh,p9,nsmul_eq_mul] field_simp;ring have w:(0:ℚ)<=(n:ℚ)*Q-S^2:=by have g:0<=XH n x r (np n x r):=by unfold rowVariance;rw[Yk,Ap];positivity rw[l,le_div_iff₀ XJ,qb] at g;exact (mul_nonneg_iff_of_pos_right XJ).1 g have q:Y0 pn.1 pn.2*Y0 pn.1 pn.2<=n*Q:=(Nat.cast_le (α:=ℚ)).1 (by rw[YO];push_cast;linarith) refine ⟨h,?_⟩;rw[l,Nat.cast_sub q,YO,<-p,m];simp def sg (s:ф) (M:ℚ):ℚ:=if s then-M else M lemma Q6 (w:kG):(ZC w !=0)=!decide (ZW w=0):=by rw[show (ZC w !=0)=!(ZC w==0) from rfl,YK] lemma Y2 (w:kG):ZA w=sg (ZX w) (ZW w)*2^((ZZ w:п)-149):=by rw[Y1,Vr];unfold sg;simp lemma Yn (a b:о):sg (decide (asimp only[AU,υ,AM] at l⊢<;>rw[x] at l<;> constructor<;>linarith only[l,t,u,q,r] end NF namespace NE open NF Dense.F open Dense (ao) @[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.ap (((2:Д)*q+1)<<<36)))й @[inline] def el (x g b:с) (nd nS R pz:у) (A1 A2 C1:Д) (slow:Unit-> с):с:= let v:=(dw x*nd+nS)*dw g*R+dw b*pz let B:=v.toBits let E:=eF B let σ:=E-C1 let M:=mF B let L:=M&&&0x7FFFFFF let c:=mx (mx (E+10) (Core.iW b+A1)) (Core.iW g+A2)-E if 146<= σ&&σ<=398&&c<=25&&(1<<>>63!=0) (M>>>27) σ else slow () lemma km (s:ф) (q σ:Д) (l:2^25<= qа) (m:qа<2^26) (o:146<= σа) (p:σа<=398):pk s q σ=aD s ((2:Д)*q+1) σ:=by have e:((2:Д)*q+1)а=2*qа+1:=by rw[ξ,ϊ];simp only[kC];omega have h:(((2:Д)*q+1)<<<36)а=(2*qа+1)*2^36:=by rw[Ζ,e];simp only[kC,kK,χ];omega have j:(σ-36)а=σа-36:=by rw[Ι σ 36 (ο.2 (by simp only[kC];omega))];rfl have g:aD s ((2:Д)*q+1) σ=aD s (((2:Д)*q+1)<<<36) (σ-36):=by rw[bV s ((2:Д)*q+1) σ А А, bV s (((2:Д)*q+1)<<<36) (σ-36) А А,e,h,j, show (2:п)^σа=2^36*2^(σа-36) by rw[<- AH,Nat.add_sub_cancel' (А:36<= σа)]] cases s<;>simp only[AU,AM,υ]<;>push_cast<;>ring_nf have r:(pk s q σ)д=(if s then 2^31 else 0)+((σа-146)*2^23+ (ap (((2:Д)*q+1)<<<36))а):=by obtain ⟨-,-,u⟩:=bU s (((2:Д)*q+1)<<<36) (σ-36) А А А А;unfold pk rw[Ϭ,ξ,ξ,Ζ, Ι σ 146 (ο.2 (by simp only[kC];omega))] cases s<;>simp only[AU,AM,υ,kC,kK,χ]<;>(clear*-o p u;omega) obtain ⟨t,-,-⟩:=bU s (((2:Д)*q+1)<<<36) (σ-36) А А А А;rw[g];apply Β.mp;omega lemma pB (a b:ℝ) (p q:ℕ) (e: |a| <= 2^p) (g: |b| <= 2^q): |a*b| <= 2^(p+q):=by rw[AW,AH];exact Ax e g (AN _) В lemma sB (a b:ℝ) (p:ℕ) (e: |a| <= 2^p) (g: |b| <= 2^p): |a+b| <= 2^(p+1):=by rw[pow_succ];grind lemma eB (x y:ℝ) (p:ℕ) (h: |x-y| <= |y| /2^53+1/2^1075) (j: |y| <= 2^p): |x| <= 2^(p+1):=by have g:(1:ℝ)<=2^p:=one_le_pow₀ Г;have e:(1:ℝ)/2^1075<=1/2^1:=Aa Г Г;rw[pow_one] at e;have:=AX x y;rw[pow_succ];grind lemma mo (a:ℝ) (p q:ℕ) (h: |a| <= 2^p) (e:p<= q): |a| <= 2^q:= h.trans (AV Г e) lemma z9 (a:ℝ) (p:ℕ) (h: |a| <= 2^p) (e:p<=971): |a| <= (2:ℝ)^(971:ℤ):=by rw[show (971:ℤ)=((971:ℕ):ℤ) from rfl,AB];exact mo a p 971 h e lemma wB (w:kG): |(sv w:ℝ)*2^kJ w| <= 2^(24+kJ w):=by rw[AW,Ac (by positivity:(0:ℝ)<2^idxOf w),AH] have: |(sv w:ℝ)| <= 2^24:=by rw[<- ϳ,Ϲ];exact_mod_cast (cl w).le exact AA this В lemma jR (A H w p G R κ l a t j v q:ℝ) (o c E u y x:ℕ) (hA:A=H+w) (he: |w+p| <= q) (z: |a-A| <= |A| /2^53+1/2^1075) (B: |t-a*G| <= |a*G| /2^53+1/2^1075) (D: |j-t*R| <= |t*R| /2^53+1/2^1075) (V: |v-(j+l)| <= |j+l| /2^53+1/2^1075) (g:0<= R) (hR: |R-κ| <= R/2^50) (hκ:0<= κ) (Y: |v| <= 2^53*(2:ℝ)^((o:ℤ)-1075)) (ah: |l| <= 2^(24+E+x)) (hG: |G| <= 2^(24+u)) (a0:u<=254) (a6:κ<=2^53) (al:R<=2^52) (as:10<= c) (aH:E+x+1056<= c+o) (N:q=0\/(q=2^y/\y+u+1154<= c+o)): |v-((H-p)*G*κ+l)| <= 2^c*(2:ℝ)^((o:ℤ)-1075):=by refine (?_:_<=(|v| + |l|)/2^45+q* |G| *κ+ (4*(1/2^1075)+4*(1/2^1075*R)+4*(1/2^1075*(|G| *R)))).trans ?_ .set τ:ℝ:=1/2^1075 with hτ have m:0<= τ:=В;have r:=AN G have X: |j+l| <= 2* |v| +2*τ:=by have:=AX (j+l) v;rw[A0] at this;linarith only[this,V,AN v,m] have M: |t| *R<=2* |j| +2*τ:=by have:=AX (t*R) j;rw[A0] at this;rw[AW,Ae g] at this D;linarith only[this,D,AN j,m] have K: |a| * |G| <= 2* |t| +2*τ:=by have:=AX (a*G) t;rw[A0] at this;rw[AW] at this B;linarith only[this,B,AN t,m] have J: |A| <= 2* |a| +2*τ:=by have:=AX A a;rw[A0] at this;linarith only[this,z,AN a,m] have L: |j| <= 2* |v| +2*τ+ |l| :=by have:=Ag (j+l) (-l);rw[Aw] at this;simp only[add_neg_cancel_right] at this;linarith only[this,X] rw[AW a G] at B;rw[AW t R,Ae g] at D;have p1:=AA B g;have p2:=AA K g;have p3:=AA z (Ad r g);have p4:=AA J (Ad r g);have p5:=AO hR (Ad (AN A) r) have p6: |w+p| * |G| *κ<= q* |G| *κ:= AA (AA he r) hκ have e:v-((H-p)*G*κ+l)=(v-(j+l))+(j-t*R)+(t-a*G)*R+(a-A)*(G*R) +A*G*(R-κ)+(w+p)*G*κ:=by rw[hA];ring rw[e] have T:∀a b c d e f:ℝ,|a+b+c+d+e+f| <= |a| + |b| + |c| + |d| + |e| + |f| :=λa b c d e f=>by have q1:=Ag (a+b+c+d+e) f;have q2:=Ag (a+b+c+d) e;have q3:=Ag (a+b+c) d;have q4:=Ag (a+b) c;have q5:=Ag a b;linarith only[q1,q2,q3,q4,q5] have s1:=T (v-(j+l)) (j-t*R) ((t-a*G)*R) ((a-A)*(G*R)) (A*G*(R-κ)) ((w+p)*G*κ);simp only[AW,Ae g,Ae hκ] at s1;have Y:=AN v;have hb:=AN l;have S:=AN j;have U:τ<=1/2^1075:=le_of_eq hτ;clear_value τ;have O:0<= τ*R:=Ad m g;have Q:0<= τ*(|G| *R):=Ad m (Ad r g) linarith only[s1,V,X,D,p1,p2,p3,p4,p5,p6,L,M,Y,hb,S,U,m,O,Q,r] set T:ℝ:=(2:ℝ)^((c:ℤ)-2+o-1075) with W have z:(2:ℝ)^c*(2:ℝ)^((o:ℤ)-1075)=4*T:=by rw[W,<- AB,<- AJ Г,show (4:ℝ)=2^(2:ℤ) by norm_num,<- AJ Г] ring rw[z];have F:∀a b:ℤ,a<= b->(2:ℝ)^a<=2^b:=λa b h=>AC Г h have t1: |v| /2^45<= T:=calc _<=2^53*(2:ℝ)^((o:ℤ)-1075)/2^45:=by gcongr _=(2:ℝ)^((8:ℕ)+((o:ℤ)-1075)):=by rw[AJ Г,AB];field_simp _<= T:=F _ _ А have j: |l| /2^45<= T:=calc _<=(2:ℝ)^(24+E+x)/2^45:=by gcongr _=(2:ℝ)^(((24+E+x:ℕ):ℤ)-45):=by rw[Ah Г,AB];norm_num _<= T:=F _ _ XI have t3:q* |G| *κ<= T:=by rcases N with I | ⟨I,aL⟩ .rw[I,qb,qb];positivity rw[I];calc _<=(2:ℝ)^y*2^(24+u)*2^53:=by gcongr _=(2:ℝ)^(((y+(24+u)+53:ℕ):ℤ)):=by rw[AB];ring _<= T:=F _ _ (by push_cast;omega) have g1: |G| <= 2^278:=hG.trans (AV Г А) have a2:(1:ℝ)/2^1075*R<=1/2^25:=calc _<=(1:ℝ)/2^1075*2^52:=by gcongr _=1/2^1023:=by field_simp _<= _:=Aa Г Г have a3:(1:ℝ)/2^1075*(|G| *R)<=1/2^25:=calc _<=(1:ℝ)/2^1075*(2^278*2^52):=by gcongr _=1/2^745:=by field_simp _<= _:=Aa Г Г have a4:(1:ℝ)/2^21<= T:=by rw[W,show (1:ℝ)/2^21=2^(-21:ℤ) by norm_num];exact F _ _ А have a1:(1:ℝ)/2^1075<=1/2^25:=Aa Г Г;have a5:(12:ℝ)*(1/2^25)<=1/2^21:=by grind linarith only[t1,j,t3,a1,a2,a3,a4,a5] end NE namespace NR open NF Dense.F open Dense (ao) @[inline] def pt (j:о):у:=P.get! (j+1) @[inline] def p2 (e:о):у:=pt (min e 254)*pt (e-min e 254) lemma jC (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,AG P.data (j+1) (by simp[P];omega)] simp only[P,Ξ];rw[AI А];rfl rw[h];exact iD j А lemma jA (e:о) (m:e<=508):fv (p2 e)/\rv (p2 e)=(2:ℝ)^e:=by obtain ⟨g,j⟩:=jC (min e 254) А;obtain ⟨h,l⟩:=jC (e-min e 254) А have:=aS _ _ g h 1 (e:ℤ) (by rw[j,l,<- AH,AB];push_cast;rw[Av];congr 1;omega) Б А (ci 1 e 971 А Г 1 Б) unfold p2;refine ⟨this.1,?_⟩;rw[this.2,AB];simp structure fk where td:с ok:ф nS:у R:у pz:у A1:Д A2:Д C1:Д @[inline] def ei (n:о) (t:о×о×ф×о×о×с):fk:= let k2:=t.2.1-21 let Sm:=(t.2.2.2.1<<<(t.2.1-k2))+(t.2.2.2.2.1>>>k2) let es:=k2+t.1 let d:=t.2.2.2.2.2 let D:=nж*Core.mW d let lD:=Core.ak D let s:=lD-11 let R0:=((0x8000000000000000/D)<<>>53==0&& decide (es<=500), (if t.2.2.1 then z.toInt64 else (0-z).toInt64).toFloat*p2 es, R0.toInt64.toFloat,p2 Zrа,Zr+1056,if k2==0 then 0 else esж+1154,Zr+900⟩ lemma kq (D s:Д) (e L:о) (o:Dа=e) (j:2^L<= e) (l:e<2^(L+1)) (z:sа=L-11) (u:11<= L) (v:L<=36): (((0x8000000000000000/D)<<>>(k-21))=((o<<>>(k-21):=by simp only[χ,ζ] rw[show o*2^k=o*2^(k-(k-21))*2^(k-21) by rw[Ao,<- AH];congr 2;omega, ϕ (o*2^(k-(k-21))*2^(k-21)) v,Ϸ _ _ В,ϕ] unfold ei at h⊢;dsimp only at h⊢;rw[ah] at h⊢ simp only[Ε,AK,nj,AT,Ar,ο, kC,AS] at h obtain ⟨⟨⟨⟨⟨⟨hn,a4⟩,aH⟩,t⟩,A⟩,a7⟩,Q⟩:=h;have q:((o<<>>(k-21)<2^53:=XI;generalize hS:(o<<>>j=e at q⊢;have U:=lE d;have ba:2^23<= kR d:=by unfold kR;rw[AF aH];omega have a3:nжа=n:=Α (А:n<2^64) have p:(nж*mW d)а=n*kR d:=by rw[ϊ,a3,an,μ];have:=ϛ hn U;omega generalize hD:nж*mW d=D at t A⊢;rw[hD] at p;have hL:=Y7 D;generalize bh:ak D=x at t A hL⊢;set L:=xа with bo;have w:n*kR d≠0:=XJ;have I:2^L<= n*kR d:=by rw[hL,p];exact lC w have al:n*kR d<2^(L+1):=by rw[hL,p];exact Ϛ have a5:(x-11)а=L-11:=by rw[Ι _ _ (ο.2 (show (11:Д)а<= xа from t))];rfl have J:=kq D (x-11) (n*kR d) L p I al a5 t A;generalize bp:((0x8000000000000000/D)<<<(x-11))+(((0x8000000000000000%D)<<<(x-11))/D)=g at J⊢;set y:=n*kR d with G;have l:0omega .show af (0-eж)=_;rw[ao,Λ,hz] simp only[ϡ,ό];clear*-q;omega have B:=cN _ (by rw[W];split<;>simp<;>omega) rw[W] at B;obtain ⟨f2,v2⟩:=jA (j+u) А have:=aS _ _ B.1 f2 (if X then (e:ℤ) else-(e:ℤ)) ((j+u:ℕ):ℤ) (by rw[B.2,v2,AB]) (by split<;>simp<;>omega) А (ci 53 (j+u) 971 А AY _ (by split<;>simp<;>omega)) refine ⟨this.1,?_⟩;rw[this.2,AB];simp . rw[<- as];by_cases z:j=0 .refine ⟨0,?_,Or.inl rfl⟩ rw[z] at m;rw[<- m,z,Nat.shiftRight_zero,ϋ];simp refine ⟨2^(j+u),?_,Or.inr ⟨rfl,?_⟩⟩;swap .simp only[z,AS,if_false];rw[ξ,Α (А:j+u<2^64)] simp only[kC];clear*-Q;omega have a1:((e*2^j:ℕ):ℝ)<= S:=by exact_mod_cast N have a2:(S:ℝ)<((e*2^j+2^j:ℕ):ℝ):=by exact_mod_cast O push_cast at a1 a2;have hu:(0:ℝ)<2^u:=В;have Y:=AA a1 hu.le;have b2:=AP a2 hu;have b3:(0:ℝ)<=2^j*2^u:=В;rw[AH,BA];constructor<;>linarith only[Y,b2,b3] . have B:=cN g.toInt64 (by show (af g)м<2^53;rw[ao];split<;>omega) refine ⟨B.1,?_⟩;rw[B.2];show ((af g:ℤ):ℝ)=gа;rw[ao];rw[AF А];simp . have H:(0:ℝ)linarith only[c1,c2,c3] . rw[r];exact jA (kJ d+L+52) А .rw[Rat.cast_ne_zero,Y1,V] positivity .have a6:((ZA d:ℚ):ℝ)=(kR d:ℝ)*2^kJ d/2^149:=by rw[Y1,V];push_cast;rw[Ah Г,AB];ring have h1:(n:ℝ)≠0:=by exact_mod_cast a0.ne' have h2:(kR d:ℝ)≠0:=by exact_mod_cast (by omega:mantOf d≠0) rw[a6,G];push_cast;field_simp;ring .rw[ξ,r];simp only[kC];clear*-A bt t;omega .split .simp .rw[ξ,Α (А:j+u<2^64)];simp only[kC];clear*-Q;omega .rw[ξ,r];simp only[kC];clear*-A bt t;omega lemma kl (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н=n:=by show af nж=n;rw[ao,g];split<;>omega have:=cN _ (by rw[e];simp;omega);rw[e] at this;omega lemma gY (a:ZB) (h:∀i (e:i kG) (n u k J K:ℕ) (sS:ф) (ρ:NR.fk) (l:ℚ) (hρ:ρ=NR.ei n (u,k,sS,J,K,d)) (hx:kI x≠255) (hg:kI g≠255) (hb:kI b≠255) (b6:0simp only[Aw,l7]<;>exact_mod_cast b1.le have ha:=fA (dw x*p) ρ.nS hX.1 E.1 (z9 _ _ (sB _ _ _ bX bS) Г);have ba: |rv (dw x*p+ρ.nS)| <= 2^555:=eB _ _ _ ha.2 (sB _ _ _ bX bS) have bG: |rv (dw g)| <= 2^278:=by rw[vg];exact mo _ _ _ wg А have ht:=fM (dw x*p+ρ.nS) (dw g) ha.1 fg (z9 _ _ (pB _ _ _ _ ba bG) Г);have bt: |rv ((dw x*p+ρ.nS)*dw g)| <= 2^834:=eB _ _ _ ht.2 (pB _ _ _ _ ba bG) have bR: |rv ρ.R| <= 2^52:=by rw[hR.2,l7];exact_mod_cast b0 have G:=fM ((dw x*p+ρ.nS)*dw g) ρ.R ht.1 hR.1 (z9 _ _ (pB _ _ _ _ bt bR) Г);have bh: |rv ((dw x*p+ρ.nS)*dw g*ρ.R)| <= 2^887:=eB _ _ _ G.2 (pB _ _ _ _ bt bR) have bB: |Bz| <= 2^(24+kJ b+j):=by rw[r.2,AH,<- Ao,AW,Ac (by positivity:(0:ℝ)<2^j),AH (2:ℝ) (24+kJ b)] exact AA wb В have a7: |Bz| <= 2^887:=mo _ _ _ bB А have hv:=fA ((dw x*p+ρ.nS)*dw g*ρ.R) (dw b*ρ.pz) G.1 r.1 (z9 _ _ (sB _ _ _ bh a7) Г);generalize hV:(dw x*p+ρ.nS)*dw g*ρ.R+dw b*ρ.pz=V at hc hv;simp only[Ε,AK,ο,ι,kC] at hc;obtain ⟨⟨⟨⟨cm,c2⟩,X⟩,B⟩,as⟩:=hc have em:(eF V.toBits)а<2048:=by unfold eF;rw[Θ];exact AR ϓ Б have bs:ρ.C1<= eF V.toBits:=ο.2 (by have:=Λ (eF V.toBits) ρ.C1;omega) have dt:(eF V.toBits-ρ.C1)а=(eF V.toBits)а-(900+j):=by rw[Ι _ _ bs,bp] rw[dt] at cm c2;have M:1046+j<=(eF V.toBits)а:=XI;have bw:¬eF V.toBits=0:=λh0=>by rw[h0] at M;simp at M set H:=(eF V.toBits)а with d1;have aL:=ek (eF V.toBits+10) (iW b+ρ.A1);have D:=ek (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2);have b4:(eF V.toBits+10)а=H+10:=by rw[ξ];simp;clear*-em;omega have A:(iW b+ρ.A1)а=kJ b+j+1056:=by rw[ξ,am,bo];clear*-M b4 em eq ib;omega have b5:(iW g+ρ.A2)а=kJ g+ρ.A2а:=by rw[ξ,am];clear*-dy ig;omega rw[b4,A] at aL;rw[aL,b5] at D have ah:eF V.toBits<= mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2):=by rw[ο,D];clear*-;omega have z:=Ι _ _ ah;rw[D] at z;generalize ew:mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2)-eF V.toBits=cc at z X B as;set c:=ccа with et have L:((1:Д)<<>>63!=0 then-(I:ℝ) else I)*U:=XI;have N:I<2^53:=XI;have d2:2^52<= I:=XI have bv: |rv V| <= 2^53*U:=by rw[a3,AW,Ac W,Al _root_.abs,Aw,l7,ite_self];gcongr;exact_mod_cast N.le have ds:κ<=2^53:=by grind have al:eS=0\/(eS=2^es/\es+kJ g+1154<= c+H):=b2.imp id λ⟨h0,hA⟩=>⟨h0,by clear*-hA z;omega⟩ have m:=jR _ Xn _ ((if sS then-(S:ℝ) else S)*2^u) _ _ κ Bz _ _ _ _ eS H c _ _ es j rfl (by rw[E.2];split<;>[skip;rw[<- Aw]]<;>exact (congrArg _root_.abs (by ring)).trans_le Q) ha.2 ht.2 G.2 hv.2 (by grind) (by grind) dm bv bB (by grind) ig ds (by grind) (by clear*-X z;omega) (by clear*-X z;omega) al have hY: ((sv x:ℝ)*2^kJ x*n-(if sS then-(S:ℝ) else S)*2^u)*((sv g:ℝ)*2^kJ g)*κ+ (sv b:ℝ)*2^(kJ b+j)= (((ZA x-l)*ZA g/ZA d+ZA b:ℚ):ℝ)*(2^149*2^j):=by have e:∀w:kG,((ZA w:ℚ):ℝ)=(sv w:ℝ)*2^kJ w/2^149:=by intro w;rw[Y1];push_cast;rw[Ah Г,AB];ring push_cast;rw[e x,e g,e b,o,AH];have eK:(n:ℝ)≠0:=XJ;rw[hZ];field_simp rw[show Xn=(sv x:ℝ)*2^kJ x*n by rw[hX.2];push_cast;ring,r.2,vg] at m rw[hY] at m;generalize en:(ZA x-l)*ZA g/ZA d+ZA b=Y at m a2⊢;have c3:=jm _ ((Y:ℝ)*(2^149*2^j)) _ _ _ _ c W a3 rfl B aH m;set q:=I/2^27 with hq;have cb:2^25<= q:=(by clear*-bz;omega);have ch:q<2^26:=(by clear*-bz eA;omega);set e:ℤ:=(H:ℤ)-1075+27-149-j with he have eQ:(2:ℝ)^27*U=(2:ℝ)^e*(2^149*2^j):=by rw[hU,he,<- AB (2:ℝ) 149,<- AB (2:ℝ) j,<- AB (2:ℝ) 27,<- AJ Г, <- AJ Г,<- AJ Г] congr 1;ring have hP:(0:ℝ)<2^149*2^j:=XJ;obtain ⟨lo,hi⟩:=c3;have k1:((q:ℕ):ℝ)*2^27*U=(q:ℝ)*2^e*(2^149*2^j):=by grind have k2:(((q:ℕ):ℝ)+1)*2^27*U=((q:ℝ)+1)*2^e*(2^149*2^j):=by grind rw[k1] at lo;rw[k2] at hi;set s:=V.toBits>>>63!=0 with hs have k3:(if s then-((Y:ℝ)*(2^149*2^j)) else (Y:ℝ)*(2^149*2^j))= (((if s then-Y else Y:ℚ)):ℝ)*(2^149*2^j):=by split<;>push_cast<;>ring rw[k3] at lo hi;have dx:=BK lo hP.le;have b3:=BK hi hP.le have a6:(q:ℚ)*2^e<(if s then-Y else Y):=by exact_mod_cast (by push_cast;ring:(((q:ℚ)*2^e:ℚ):ℝ)=(q:ℝ)*2^e).trans_lt dx have A:(if s then-Y else Y)<((q:ℚ)+1)*2^e:=by exact_mod_cast b3.trans_eq (by push_cast;ring:((q:ℝ)+1)*2^e=((((q:ℚ)+1)*2^e:ℚ):ℝ)) have a0:(0:ℚ)<2^e:=XJ;have v:0<(if s then-Y else Y):=AR В a6;have t: |Y| =(if s then-Y else Y):=by grind set δ:ℚ:=(if s then-Y else Y)/2^e-q with hδ;have c4:0<δ:=by rw[hδ,sub_pos,lt_div_iff₀ a0];exact a6 have dd:δ<1:=by rw[hδ,sub_lt_iff_lt_add,div_lt_iff₀ a0];linarith only[A] have d3:qз=25:=le_antisymm (Nat.lt_succ_iff.1 ((na А).2 ch)) ((lT А).2 cb) have eP:(mF V.toBits>>>27)а=q:=by rw[Η,<- O];simp only[kC,kK,ζ];omega rw[km _ _ _ XI XI XI XI] rw[<- Qx s q true 1 e Y δ ((2:Д)*(mF V.toBits>>>27)+1) (eF V.toBits-ρ.C1) (by intro _;split at t<;>rename_i h<;>simp only[h,AU,υ,AM] at v⊢<;> simp only[AK,BF,not_lt]<;>linarith only[v]) c4.le dd (by grind) one_pos (by rw[t,hδ];field_simp;ring) XI (by grind) (by grind) (by rw[ξ,ϊ,Η];simp[V2,<- O];clear*-cb ch;omega) (by clear*-M dt;omega)] end NE local instance:Inhabited NR.fk:=⟨⟨0,false,0,0,0,0,0,0⟩⟩ def Yy (n:о) (eps:с) (x:ZB) (r:о):с:= let lo:=r*n let u:=Yh x lo (lo+n) 255 V5 (Yl x u lo (lo+n) 0 0 0 0) n u eps lemma V7 (n:о) (e:kG) (x:ZB) (r:о) (h:0σ) (F:σ->т->т->с) (n rows:о):ZB:= Dense.F.Pn.l2 rows 1 (λr _ a=> let s:=G r let l:=(r*n)е let t:=(r*n+n)е if h:tб<=aв then Bn.cd t (λi _ _=>F s i (i-l)) l a h else a) 0 0 (mD (rows*n) 0) structure j7 where l:Д h:Д c:о big:о P:о N:о @[inline] def cA (P:о) (q p:Д):о:=if q

rfl @[specialize] def ce (x:ZB) (u:Д) (i stop:о) (l h:Д) (c big P N:о) (pl nl:Д):j7:= if i>>1)>>>(63-k) else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l' let s:=ce x uж i g l h c big P N o m s.big+s.lа+(s.hа+s.c<<<64)<<<64=Yl x u i g l h c big/\(s.P,s.N)=Ym x u i g (P+oа) (N+mа):=by intro k;induction k<;>intro i l h c big P N o m v<;>dsimp only<;>unfold ce Yl Ym .simp only[show ¬irename_i c<;>rw[ι,p] at c .show 0=_;omega .rw[Ι d uж (ο.2 А),p] simp only[e];generalize dа-u=s at* have f:(sж<=39)=(s<=39):=by rw[ο,j];rfl have r:2*sж=(2*s)ж:=ς.mp (by rw[ϊ,j,ϑ,ZG];rfl) simp only[f,r,j,cI] split_ifs<;>refine ⟨(q _ _ _ _ _ _ _ _ _ (by clear*-v;omega)).1,(q _ _ _ _ _ _ _ _ _ (by clear*-v;omega)).2.trans ?_⟩<;> simp (disch:=assumption) only[kc,cy,j8,m6 _ (VO _ _)] @[inline] def ar (a b:Д):Д×Д:= let a0:=a%Ж;let a1:=a/Ж;let b0:=b%Ж;let b1:=b/Ж let p00:=a0*b0;let p01:=a0*b1;let p10:=a1*b0 let m:=p00/Ж+p01%Ж+p10%Ж (a1*b1+p01/Ж+p10/Ж+m/Ж,m%Ж*Ж+p00%Ж) lemma aN (a b:Д):(ar a b).1а*2^64+(ar a b).2а=aа*bа:=by unfold ar;simp only[ξ,ϊ,ms,nK,kC];have:=a.toNat_lt;have:=b.toNat_lt;generalize aа=A,bа=B at* have e:A*B=A/Ж*(B/Ж)*2^64+(A%Ж*(B/Ж)+A/Ж*(B%Ж))*2^32+ A%Ж*(B%Ж):=by conv_lhs=>rw[<-mG A Ж,<-mG B Ж] ring obtain ⟨g,h,j,l⟩:A%Ж<=4294967295/\B%Ж<=4294967295/\A/Ж<=4294967295/\B/Ж<=4294967295:=А;have:=Ϟ g h;have:=Ϟ g l;have:=Ϟ j h;have:=Ϟ j l;omega @[inline] def cv (ah al mm:Д) (k:о):Д×Д:= let K:=kж let bl:=al+(if K<64 then mm<<>>1)>>>(63-K) else mm<<<(K-64))+(if bl>>1)>>>(63-kж) else e<<<(kж-64))=p at* have:=h.toNat_lt;have:=m.toNat_lt;simp only[ξ,ι,Al lv,kC];grind @[inline] def fD (bh bl:Д):Д:=if bh !=0 then 64+ZR bh else ZR bl lemma im (g j:Д):(fD g j)а=(gа*2^64+jа)з:=by have:=j.toNat_lt;unfold fD;split_ifs with h .have e:(gа*2^64+jа)>>>64=gа:=А have l:gа≠0:=by simpa[<-ς] using h rw[aX (gа*2^64+jа) 64 (by rw[e];exact l),e,ξ,Y7] have:=(na l).2 g.toNat_lt;grind .simp only[AT,Ar,Decidable.not_not] at h;subst h;simp[Y7] def cu (H1 H0:Д) (t:о) (st:ф) (Dn u:о) (eps:с):Д:= let sE:=ZZ eps+149-2*u let e:=cv H1 H0 (Dnж*ZC eps) (sE-t) let S2:=(1374+(ZR Dnж)а-(2*u+t+(fD e.1 e.2)а))/2 let den:=Dnж<<<(1322-(2*u+2*S2+t))ж let y:=(e.2>>>(1:Д)).toFloat let R:=(Float.sqrt ((e.1.toFloat*0x10000000000000000+(y+y))/den.toFloat)).toUInt64 let p:=ar (R*R) den let q:=ar ((R+1)*(R+1)) den if 2*u<= ZZ eps+149/\t<= sE/\sE-t<=78/\H1<0x4000000000000000/\0(cu O N t (L !=0) g u l)й=V5 A g u l:=by unfold cu;dsimp only;generalize he:cv O N _ _=e;generalize as:(fD e.1 e.2)а=LL;generalize w:(1374+_-(2*u+t+LL))/2=Q;generalize y:1322-(2*u+2*Q+t)=k;generalize x:gж<<absurd h Б rename_i hc;intro;simp only[ns];obtain ⟨W,M,h3,h1,v,o,hS,E,F,G,j,U,a1,a0⟩:=hc;have hD:gжа=g:=Α (o.trans Б);have:=ϛ o (ZO l);have hm:(gж*ZC l)а=g*ZW l:=by rw[ϊ,hD,ZI];clear*-this;omega have h6:=gd O N _ _ (by linarith) h3 (by simpa[ι] using h1) rw[he,hm] at h6 have V:(e.1а*2^64+e.2а)*2^t+Lа=A+g*ZW l*2^(ZZ l+149-2*u):=by rw[h6,<-h4,ϙ,ύ (g*_),<-pe,Nat.sub_add_cancel M];ring have a2:(L !=0)=(Lа!=0):=by rw[Ϣ];simp[AT,<-ς] rw[a2];generalize Lа=L at V hL;have D:=im e.1 e.2;have:=e.2.toNat_lt;have:=p.2.toNat_lt;have:=q.2.toNat_lt;have hR:33554432<= Rа:=U;rw[as] at D;rw[Y7,hD] at w;generalize hH:e.1а*2^64+e.2а=H at V D;generalize ah:A+_=B at V have z:rа=g*2^k:=by have:=ϛ o (pC Nat.one_lt_two ((by clear*-hS y;omega):k<44)) rw[<-x,Ζ,hD,ϑ,ZG,μ ((by clear*-y;omega):k<2^64),μ ((by clear*-hS y;omega):k<64), χ,μ this] have S:(R+1)а=Rа+1:=by rw[ξ];simp;omega have hq:∀m:Д,mа<=2^31->(m*m)а=mа*mа:=λm h=>by rw[ϊ];apply μ;have:=Ϟ h h;omega rw[hq _ j.le,z] at J;rw[hq _ (S▸j),S,z] at K;simp only[ι,ο,<-ς] at a1 a0;generalize hX:Rа*Rа*(g*2^k)=X at J;generalize hY:(Rа+1)*(Rа+1)*(g*2^k)=Y at K;have hT:=Ϥ t;have h1:=ν (2^t) (А:X<=H) have M:=ν (2^t) (А:H+1<=Y) have I:∀a,a*(g*2^(k+t))=a*(g*2^k)*2^t:=λa=>by rw[pe];ring have x:0>>t=H:=by rw[ζ,<-V,ϕ,Ϸ _ _ hT,lF hL,ϋ] rw[aX B t (by clear*-J a1 a3 e hH;omega),e,D] have aL:(p.1==e.1&&p.2==e.2&&!(L !=0))=(B==Rа*Rа*(g*2^(k+t))):=by rw[I,hX];apply Ϣ.2;simp only[Ε,ZY,<-ς,nj,bne_eq_false_iff_eq];constructor .grind .intro h4 have:X=H:=by by_contra;have:=ν (2^t) (show X+1<=H from by omega);rw[ϙ] at this;clear*-V h4 hL this;omega clear D E F G I K M S U W a0 a1 a2 a3 aH ah al as h3 h6 hD hL hR hS hT hX hY he hm hq j o v w x y z;omega unfold V5;dsimp only rw[min_eq_left W,Nat.sub_self,BR,χ,ah,al, show (350-((2*u:о):п)-(((t+LL:о):п)-(gз:п)))/2=(Q:п)-512 by clear*-F G w;omega, show ((2*u:о):п)-298+2*((Q:п)-512)=-((k+t:о):п) by clear*-E y;omega, show V8 B (-((k+t:о):п))=B by unfold V8;split_ifs .rw[show (-((k+t:о):п))к=0 by clear*-;omega,BR] .rfl, show YF g (-((k+t:о):п))=g*2^(k+t) by unfold YF;split_ifs .simp[(А:k+t=0)] .rw[Int.neg_neg,Int.toNat_natCast,χ], <-aH,AI hR];unfold YG rw[AI (show (Rа>>>31==0&&decide (-209<= (Q:п)-512)&&decide ((Q:п)-512<=297))=true by simp only[Ε,ZY,ZH];clear*-F G j;omega),<-aL] congr 1 .apply ς.1;rw[ZG,ξ,ϊ] split<;>simp<;>clear*-j<;>omega .congr 1;clear*-E F G hS;omega lemma j2 (z m a e g:Д) (h:z≠0\/¬(msimp only[Λ,kC]<;>omega lemma jJ (g e:Д): ((g/Ж)а*2^64+(g%Ж*Ж+e/Ж)а)*2^32+(e%Ж)а=gа*2^64+eа:=by have:=g.toNat_lt;have:=e.toNat_lt;simp only[ξ,ϊ,ms,nK,kC];omega @[inline] def dX (l h:Д) (c S n Dn u:о) (eps:с):Д:= let a:=ar nж l let b:=ar nж h let m:=a.1+b.2 let z:=b.1+nж*cж let s:=ar Sж Sж if n<1024/\S<2^64/\c<1024/\a.1<= m/\(z≠0\/¬(m(dX l h c S n o u e)й=V5 (n*Q-S*S) o u e:=by unfold dX;dsimp only;have r:=aN nж l;have t:=aN nж h;have m:=aN Sж Sж;generalize ar nж l=a at r⊢;generalize ar nж h=b at t⊢;generalize ar Sж Sж=s at m⊢;split;swap;exact λh=>absurd h Б rename_i v;obtain ⟨w,D,p,F,H⟩:=v;have j:nжа=n:=Α (w.trans Б);rw[j] at r t;rw[Α D] at m;have g:=j2 _ _ _ _ _ H rw[m,show (b.1+nж*cж)а*2^128+(a.1+b.2)а*2^64+a.2а=n*Q by have:=h.toNat_lt;have:=b.2.toNat_lt;have:=a.1.toNat_lt;have:n*hа<1024*2^64:=lB w (le_of_lt h.toNat_lt) Б;have:n*c<1024*1024:=ϛ w p;rw[ο,ξ] at F rw[ξ,ξ,ϊ,j,Α (p.trans Б), μ (a:=n*c) А,μ А,μ А,B] rw[Nat.mul_add,Nat.mul_add,<-ύ,<-ύ,<-r,<-t];ring] at g generalize b.1+nж*cж-_=I at g⊢;generalize a.1+b.2-s.1-_=y at g⊢;generalize a.2-s.2=x at g⊢;have:=y.toNat_lt;have:=x.toNat_lt;split .rename_i q;rw[q] at g;split .have z:=bH y x 0 0 o u (n*Q-S*S) e (by rw[<-g];simp) (by simp);simp only[bne_self_eq_false] at z split .omega .split .rename_i v;obtain ⟨q,G,-⟩:=v;rw[<-j6 _ _ _ _ A E G] exact bH _ _ _ 32 _ _ _ e (by rw[jJ,<-g,q];simp) (by simp) omega .exact bH _ _ _ 32 _ _ _ e (by rw[jJ,<-g];simp) (by simp;clear*-;omega) .exact bH _ _ _ 64 _ _ _ e (by rw[<-g];ring) x.toNat_lt def gG (n:о) (eps:с) (x:ZB) (r:о):с:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let st:=ce x uж lo (lo+n) 0 0 0 0 0 0 0 0 let F:=λ(_:Unit)=>V5 (st.big+st.lа+(st.hа+st.c<<<64)<<<64) n u eps let v:=if st.big=0 then dX st.l st.h st.c 0 1 n u eps else Ж if v<Ж then vй else F () lemma gH (n:о) (e:kG) (x:ZB) (r:о) (l:0NR.ei 1 (0,0,false,0,0,gG n eps x r)) (λe i j=> let w:=rW x i let v:=rW g j if ZC w==0 then ZT 0 else if e.ok then NE.el w v 0 nd e.nS e.R e.pz e.A1 e.A2 e.C1 (λ_=>ZT (ZA w*ZA v/ZA e.td)) else ZT (ZA w*ZA v/ZA e.td)) n rows lemma YE (i n:о):i-i/n*n=i%n:=by rw[Nat.mod_def,Τ] lemma Qg {α:Type} [Inhabited α] {m k:о} (f:Fin m->α) (h:k< m): (kT f)[k]! =f ⟨k,h⟩:=by rw[AG _ k (by simpa using h),Ξ] lemma Ys {σ:Type} (G:о->σ) (F:σ->т->т->kG) (n e:о) (f:Fin (e*n)->kG) (z:e*nF (G (i/n)) iе j=f ⟨i,h⟩): Yb G F n e=kT f:=by have c:kT f=kT (n:=e*n) λq=>if h:qиif h:qu*n<=q/\q?_) (λq o=>⟨q/n,0,Nat.div_lt_of_lt_mul (by rwa[Τ]),Nat.one_pos,Nat.div_mul_le_self q n,?_⟩) .have b:u*n+n<=e*n:=by rw[<-Ρ];exact ν n o have p:=Dense.aa (show u*nF (G u) i (i-(u*n)е)) (λq _=>F (G u) qе (qе-(u*n)е)) (λi _ _=>by simp) (u*n)е a (by rw[r,x];exact b) refine ⟨t,λq=>?_⟩;rw[w,p,r];split .rename_i d;have c:q?_⟩<;>simp[c] .simp;intro d;omega .exact Nat.lt_div_mul_add (Nat.pos_of_ne_zero (λd=>by simp[d] at o)) lemma YP (e n:о) (h:kG) (x g:ZB) (J:e*n kI x[i]!≠255) (v:∀j,j kI g[j]!≠255): Yo e n h x g=rmsnormStable e n h x g:=by dsimp only[Yo];apply Ys _ _ _ _ _ J;intro i j w Y;have z:=Ϝ (by rwa[Τ]);simp only[rE,Y,Dense.aa (show isimp[o]];simp rw[m];simp .exact (NE.jy _ _ 0 d _ 1 0 0 0 0 false _ 0 rfl (A i w) (v _ y) Б one_pos u (by simp) (congrArg ZT p).symm).trans (congrArg ZT p) .rfl @[inline] def SN (rows n:о) (eps:с) (x g:ZB):ф:= rows>0&&n>0&&xв==rows*n&&gв==n&&x.all finiteWord&&g.all finiteWord&&finiteWord eps&&(!ZX eps&&ZC eps !=0) lemma fj (h n:о) (e:kG) (x g:ZB):SN h n e x g=mv h n e x g:=by unfold SN mv;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 jt {e n:о} {l:kG} {x g:ZB} (h:mv e n l x g=true): 0 kI x[i]!≠255)/\∀j,j kI g[j]!≠255:=by simp only[mv,Ε,ZH,BE] 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.gY x (by simpa[nr] using h.1.1.1.2) i А, λj p=>NR.gY g (by simpa[nr] using h.1.1.2) j А⟩ def bF (rows n:о) (eps:с) (x g:ZB):ZB:= if SN rows n eps x g&&rows*n>>k,S&&&(VO 1 k-1),V5 (n*Q-S*S) (n*n) u eps) lemma Vn (n:о) (e:kG) (x:ZB) (r:о) (g:0jZW x[j]! =0\/t.1<= ZZ x[j]!):=by have h:=(Yi x (r*n+n) n (r*n) 255 XI).2;obtain ⟨m,o⟩:=VF n x r _ g h;refine ⟨?_,?_,h⟩ .rw[m,<-Yn];simp only[YU,Yz,χ,Av,θ, ζ,ZU] .simp only[YU];rw[YW _ _ _ _ (ϲ g g) l,o] @[inline] def gC (n:о) (eps:с) (x:ZB) (r:о):о×о×ф×о×о×с:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let st:=ce x uж lo (lo+n) 0 0 0 0 0 0 0 0 let S:=Y0 st.P st.N let k:=Q2 (max st.P st.N)-30 (u,k,decide (st.P>>k,S&&&(VO 1 k-1), let F:=λ(_:Unit)=>V5 (n*(st.big+st.lа+(st.hа+st.c<<<64)<<<64)-S*S) (n*n) u eps let v:=if st.big=0 then dX st.l st.h st.c S n (n*n) u eps else Ж if v<Ж then vй else F ()) lemma gE (n:о) (e:kG) (x:ZB) (r:о) (j:0(r,NR.ei n (gC n eps x r))) (λp i j=>let e:=p.2 if e.ok then NE.el (rW x i) (rW g j) (rW b j) nd e.nS e.R e.pz e.A1 e.A2 e.C1 λ_=>gF n eps x g b p.1 iб jб else gF n eps x g b p.1 iб jб) n rows lemma V3 (h n:о) (e:kG) (x g b:ZB) (J:h*n kI x[i]!≠255) (B:∀j,j kI g[j]!≠255) (z:∀j,j kI b[j]!≠255): Yw h n e x g b=layernormStable h n e x g b:=by dsimp only[Yw];apply Ys _ _ _ _ _ J;intro i j D Y;have E:=Ϝ (by rwa[Τ]);simp only[rE,Y,Dense.aa (show ipush_cast<;>rw[Ah Г,AB]<;>ring exact NE.jy _ _ _ d _ n u k o p w _ _ rfl (F i D) (B _ r) (z _ r) m A l rfl .rfl def aW (rows n:о) (eps:с) (x g b:ZB):ZB:= if (SN rows n eps x g&&bв==n&&b.all finiteWord)&&rows*nNR.gY b (by simpa[nr] using h.2) j А) .rfl end Norm end def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.F.Pn.eW,Dense.F.Pn.dF⟩ conv:=⟨Conv.d4,Conv.cf⟩ elem:=⟨Conv.dA,Conv.dJ,Bn.b7,Bn.aY⟩ norm:=⟨Norm.bF,Norm.aW⟩ theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm, Dense.F.Pn.gp,Dense.F.Pn.eU,Conv.d5,Conv.cF,Conv.e8,Conv.eL, Bn.du,Bn.cp,Norm.cY,Norm.co] end Submission