import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open ExactRuntime renaming idxOf->γ,Word->δ,mantOf->ε,oneW->ζ,signOf->η,expOf->θ,ofW->ι,Fmt->κ,ConvShape->ο,toWord->π,finishWord->ρ,rationalWord->ς,dotOf->Γ,windowAt->Μ,decodeD->Ν,limbVal->ϋ,sqrtLower->Ϗ,decodeD_toRat->ϙ,mantOf_lt_24->Ϛ,addLimbs64->ϛ,toDyadic_ofUInt32->Ϡ,rowVariance->ϫ,finishWord_scale->Aa,sqrtRational->Ac,decodeD_negative->Ad,ConvShape.ho->Es,ConvShape.wo->Et open Nat renaming mod_eq_of_lt->ν,shiftRight_eq_div_pow->ψ,mul_le_mul_right->ω,shiftLeft_eq->Α,zero_add->Β,two_pow_pos->Δ,mod_lt->Ε,mul_comm->Θ,pow_le_pow_right->Ι,pow_add->Κ,pos_of_ne_zero->Ο,lt_of_le_of_lt->Ρ,div_eq_of_lt->Υ,mul_pos->ϊ,le_add_right->ώ,add_zero->ϑ,add_mul_div_right->ϔ,div_lt_of_lt_mul->ϕ,cast_sub->ϗ,one_mul->Ϙ,add_comm->Ϟ,add_mul->ϟ,and_two_pow_sub_one_eq_mod->ϡ,mul_assoc->ϣ,le_mul_of_pos_right->Ϧ,div_div_eq_div_mul->ϧ,add_le_add_left->Ϯ,log2_self_le->ϰ,add_mul_mod_self_right->ϲ,le_mul_of_pos_left->ϳ,add_lt_add_left->ϴ,div_add_mod'->϶,zero_mul->ϸ,lt_trans->Ϲ,log2_lt->Ϻ,eq_zero_or_pos->Ae,log2_eq_iff->Af,lt_of_lt_of_le->Ag,succ_mul->Ah,sub_zero->Ai,mul_lt_mul_of_pos_right->Aj,lt_log2_self->Ak,lt_of_sub_eq_succ->Al,le_div_iff_mul_le->Am,div_lt_iff_lt_mul->An,lt_succ_iff->Ao,lt_or_eq_of_le->Ap,div_add_mod->Aq,mul_le_mul->Ar,mul_lt_mul_of_lt_of_le->As,le_sub_of_add_le->Au,div_mul_le_self->Av,sub_add_cancel->Aw,mul_eq_zero->Ax,le_one_iff_eq_zero_or_eq_one->Ay,shiftLeft_add_eq_or_of_lt->Bq,and_two_pow_sub_one_of_lt_two_pow->Bx,sub_lt_left_of_lt_add->Bz,one_le_two_pow->BE,testBit_eq_decide_div_mod_eq->BJ,sub_le_iff_le_add'->BK,mul_lt_mul''->BP,add_assoc->BU,reduceMod->BY,sub_le_sub_right->BZ,toUInt32_eq->Cd,mul_add_mod->Ce,mul_add_div->Cf,le_add_left->Cg,mul_le_mul_left->Ci,mul_zero->Co,le_trans->Cp,sub_right_comm->Cu,add_right_comm->Cv,mod_mul_right_div_self->Cw,sub_add_eq->Cx,add_le_add->Cy,add_sub_cancel->Cz,add_mul_mod_self_left->CF,le_log2->CH,le_of_lt_succ->CI,cast_zero->CP,pos_of_mul_pos_right->CQ,add_sub_cancel_left->CT,pos_of_mul_pos_left->CU,one_le_iff_ne_zero->Dd,sub_eq_zero_iff_le->De,toUInt64_eq->Do,add_one_mul->Dp,div_le_self->Dq,le_of_sub_eq_zero->Dw,cast_ofNat->DF,add_mul_div_left->DG,mod_mul->DH,pow_lt_pow_right->DJ,mul_ne_zero_iff->DR,reducePow->DU,mod_le->DY,not_lt->DZ,cast_pow->Ei,add_sub_of_le->Ej,zero_lt_of_lt->Ek,add_div_right->Em,le_of_not_le->Ev,zero_le->Ey,mod_add_div->Ez,cast_natAbs->EA,sub_le->EI,lt_irrefl->EN,cast_add->ER,cast_mul->ES,lt_asymm->ET,cast_one->EU,succ_pos->EV,mod_one->Fb open UInt64 renaming toNat_add->ξ,toNat_inj->σ,toNat_sub_of_le->Η,toNat_shiftRight->Ξ,toNat_sub->Τ,lt_iff_toNat_lt->Ψ,toNat_shiftLeft->ό,le_iff_toNat_le->ϐ,toNat_zero->Ϝ,toNat_mul->ϯ,toNat_lt->Az,toNat_toUInt32->AA,reduceToNat->Bc,toNat_and->BR,zero_xor->Ch,toNat_ofNat_of_lt'->CG,add_assoc->CY,toNat_not->CZ,toNat_one->Da,zero_shiftRight->Dm,toNat_or->Du,or_eq_zero_iff->DA,zero_shiftLeft->DB,toNat->Er,not_lt->EO,size->Fd open USize renaming le_size->τ,lt_iff_toNat_lt->υ,size->Λ,toNat_one->Φ,toNat_lt_size->ϝ,le_iff_toNat_le->Bs,toNat_sub_of_le->BN,toNat_mul->Dv,toNat_inj->EF,toNat_add->EG open Bool renaming false_eq_true->φ,xor->Ζ,and_eq_true->Ω,not_eq_true'->ϵ,or_eq_true->Ϸ,eq_iff_iff->AB,false_ne_true->AC,and_self->DW,and_true->DX,and_assoc->EK,and_false->EL,xor_false->EM open Array renaming replicate->Χ,ext'->ϻ,getElem_ofFn->AD,size_ofFn->AE,ofFn->AF,mkEmpty->AY,emptyWithCapacity->Ba,emptyWithCapacity_eq->Bw,size_map->CC,getElem_map->CN,getElem_replicate->CW,size_push->Dt,getElem_push_lt->Dy,getElem_push_eq->Dz,getElem_toList->DL,range->DM,size_replicate->DN,toList_push->Eo,all_eq_true->Ep,ext->EP open UInt32 renaming toNat_inj->ύ,toNat_shiftRight->Ϣ,ofNat->Ϥ,toNat_toUInt64->AG,toNat_and->AH,toNat_toUSize->AI,le_iff_toNat_le->AJ,toNat_lt_size->AK,toNat_ofNat'->AL,reduceToNat->CD,toNat_sub->CX,toNat_sub_of_le->Dj,toNat_shiftLeft->Dk,lt_iff_toNat_lt->Dl,ofNat_toNat->Ee,xor_zero->EE,size->Fc open List renaming range->ϒ,range'_succ->Ϩ,ext_getElem->ϩ,length_ofFn->AM,getElem_ofFn->AN,foldl_cons->AO,range'->Bd,drop_of_length_le->BL,mem_range->BM,range_eq_range'->Ca,map_congr_left->Ck,size_toArray->CK,append_assoc->CL,length_range->CM,map_cons->CR,map_map->Df,sum_map_mul_right->Dg,getElem_cons_zero->Dh,length_nil->Dr,length_map->Ds,length_singleton->Dx,ofFn->DP,map_add_range'->DS,sum_cons->DV,length_cons->Ex,nil_append->EB,mem_map->EZ open FloatFormat renaming toModel->ϓ,binary32->AZ,subnormalAlignExp->Cb,ieeeMinNormalExponent->Ef,ieeeMaxNormalExponent->Eg open Model.NativeBinary32 renaming mkBits->ϥ,roundRatScaled->AW,ofUInt32_roundRatScaled->Bf,ofUInt32->Bj,ofUInt32_mkBits->BB open Int renaming add_emod->Ϫ,emod_eq_emod_iff_emod_sub_eq_zero->By,ofNat->BG,toNat_of_nonneg->Cj,add_mul_emod_self_left->CA,negSucc->CJ,shiftLeft_eq->CV,ofNat_eq_natCast->DK,ModEq->DO,ModEq.add_right->DT,zero_add->EW,sub_emod->EX,toNat->Fe open Int64 renaming ofInt->ϱ open FloatLib.Numerics renaming roundQuotientEven->AP,roundShiftRightEven->AQ,shiftRightJam->AR,FixedWord.roundShiftRightEven_toNat->Bg,roundShiftRightEven_shiftRightJam->Bh,FixedWord.roundShiftRightEven->Bm,roundShiftRightEven_le_succ->Bn,or_one_eq->Bu,Dyadic->BD,roundShiftRightEven_eq_roundQuotientEven->BQ,roundShiftRightEven_mul_two_pow_of_le->Cc,roundShiftRightEven_eq_guard_sticky->Cl,div_two_pow_le_roundShiftRightEven->Cq,roundShiftRightEven_mul_two_pow->CE,shiftRightJam_ne_zero->DC,Radix.toReal->Fa open Model renaming toReal->AS,roundDyadicGeneral->AT,addDyadic->AU,roundDyadicGeneral_eq_roundDyadic->AV,isNaN_eq_false_of_toDyadic?_some->AX,isInf_eq_false_of_toDyadic?_some->Be,ofModel_finite_normalized_eq_ofFields->Bo,roundDyadic->Bt,packRoundedSubnormal->Bv,isFinite->BI,div->BO,signBit->BS,ofModel->BT,isZero->Cm,finishRoundedMantissa->Cn,add->Cr,zero->Cs,pow2->Ct,maximum->CO,packRoundedNormal->CS,toNatBits->Dn,ofUInt32->DD,nativeOverflow->DE,fma->Eu,ofFields->EH,ofBits->EQ open Or renaming inl->Ea,inr->EY open FloatLib.Numerics.Dyadic renaming cast_toRat->BC,add_toRat->BF,toRat_eq_zero_iff->Di,addFields->Eb,mul_toRat->Ec,mulFields->Ed,add->EC,mul->ED open Float.Model renaming totalExponent->Bb open Real renaming sqrt->Db open Float.Model.UnpackedFloat renaming roundWithAccuracy->Bp,accuracyOfFraction->Dc open Float.Model.Format renaming targetExponent->BH open FloatLib.Numerics.RationalBinary renaming lessThanPowerOfTwo->Bi,atLeastPowerOfTwo->Bk,scaleByPowerOfTwo->Bl,floorLog2->Br local notation:max x:max "˧"=>UInt64.toNat (x :) local notation:max x:max "؛"=>USize.toNat (x :) local notation:max x:max "؎"=>UInt32.toNat (x :) local notation:max x:max "۞"=>Nat.toUSize (x :) local notation:max x:max "܀"=>Nat.log2 (x :) local notation:max x:max "܂"=>Fin.val (x :) local notation:max x:max "܃"=>Array.size (x :) local notation:max x:max "܅"=>UInt32.toUInt64 (x :) local notation:max x:max "܉"=>UInt64.toNat_lt (x :) local notation:max x:max "܊"=>ExactRuntime.ConvShape.stride (x :) local notation:max x:max "܍"=>Array.toList (x :) local notation:max x:max "߷"=>FloatLib.Floats.Formats.BinaryInterchange.FloatFormat.fracWidth (x :) local notation:max x:max "߸"=>Nat.toUInt64 (x :) local notation:max x:max "՜"=>UInt64.toUInt32 (x :) local notation:max x:max "׆"=>Int.toNat (x :) local notation"א"=>by omega local notation"ב"=>by norm_num local notation"ג"=>by simp local notation"ד"=>by decide local notation"ה"=>by positivity local notation"ו"=>by simp;omega local notation"ז"=>by grind local notation"ח"=>by simp_all local notation"߾"=>0x80000000 local notation"߿"=>0x100000000 local notation"ק"=>0x7FFFFFFF local notation"ר"=>ite_true local notation"ש"=>ite_false local notation"ת"=>decide_eq_true_eq local notation"ؠ"=>zpow_natCast local notation"ة"=>decide_eq_true_iff local notation"ح"=>getElem!_pos local notation"ض"=>Fmt.minSubnormalExponent local notation"ػ"=>UInt64 local notation"ؼ"=>UInt32 local notation"ؽ"=>Array local notation"ؾ"=>USize local notation"ف"=>Bool local notation"ٳ"=>Nat local notation"ٴ"=>Int local postfix:max"ٽ"=>Array.size local postfix:max"پ"=>UInt64.toNat local postfix:max"پ"=>USize.toNat local postfix:max"پ"=>UInt32.toNat local postfix:max"پ"=>Int.toNat local postfix:max"ٿ"=>Nat.toUSize local postfix:max"ٿ"=>UInt64.toUSize local postfix:max"ٿ"=>UInt32.toUSize local notation:max"ڀ"k:max=>Array.ofFn (n:=k) local notation"ހ"=>4294967295 local notation"ށ"=>1048576 local notation"ނ"=>16777216 local notation"ރ"=>8388608 local notation"ބ"=>4611686018427387904 local notation"ޅ"=>0xFFFF structure Acc where pos:ؽ ٳ neg:ؽ ٳ special:ف negZero:ف def Acc.empty:Acc:=⟨Χ 18 0,Χ 18 0,false,true⟩ def Acc.total (acc:Acc):ٴ:=(ϋ acc.pos.toList:ٴ)-ϋ acc.neg.toList @[inline] def Acc.add (acc:Acc) (m idx:ٳ) (neg:ف):Acc:= match acc with | ⟨pos,ng,sp,nz⟩ => if m=0 then ⟨pos,ng,sp,nz&&neg⟩ else if neg then ⟨pos,ϛ ng m.toUInt64 idx,sp,false⟩ else ⟨ϛ pos m.toUInt64 idx,ng,sp,false⟩ @[inline] def Acc.markSpecial (acc:Acc):Acc:= match acc with | ⟨pos,ng,_,nz⟩=>⟨pos,ng,true,nz⟩ lemma Acc.add_spec (a:Acc) (m d:ٳ) (b:ف) (e:a.posٽ=18) (f:a.negٽ=18) (g:m<2^64) (h:d/32+1<18) : (a.add m d b).posٽ=18/\(a.add m d b).negٽ=18 /\ (a.add m d b).special=a.special /\ (a.add m d b).negZero=(a.negZero&&(decide (m=0)&&b)) /\ (a.add m d b).total=a.total+(if b then -(m:ٴ) else m)*2^d:=by obtain⟨pos,k,l,n⟩:=a;simp only at e f;by_cases j:m=0 . simp[add,total,j,e,f] . cases b<;>refine⟨by simp[add,j,addLimbs64_size,e],by simp[add,j,addLimbs64_size,f],by simp[add,j],by simp[add,j],?_⟩<;>simp only[add,j,ש,φ,ר,addLimbs64_eq _ _ _ g,total]<;>rw[addLimbs_val _ _ _ א]<;>push_cast<;>ring lemma Acc.total_empty:Acc.empty.total=0:=ד section open FloatLib.Numerics lemma ZbF (s:ف) (m:ٳ) (e:ٴ) (j:ٳ) (h:j+25<=m܀):Bt κ ⟨s,shiftRightJam m j,e+j⟩=Bt κ ⟨s,m,e⟩:=by obtain⟨l,b,d⟩:j<=m܀/\23<=m܀-j/\23<=m܀:=א;have f:m≠0:=by rintro rfl;simp at h have n:=ϰ f;have g:2^(j+1)<=m:=Cp (Ι ב ((ώ (j+1) 24).trans h)) n;have o:=log2_shiftRightJam m j g;have k:AR m j≠0:=DC m j (Cp (Ι ב (ώ j 1)) g);rw[<-AV,<-AV];unfold AT;have p:κ߷=23:=rfl;have q:ض=-149:=rfl;have r:κ.minNormalExponent=-126:=rfl;simp only[beq_iff_eq,o,k,f,ϗ l,sub_add_add_cancel,p,q,r,b,d,↓reduceIte];clear f n g o k l b d p q r;split_ifs;rfl;congr 1;obtain⟨a,b⟩:=Int.eq_negSucc_of_lt_zero (א:e+j- -149<0);obtain⟨d,k⟩:e- -149=CJ (j+a)/\0 ٳ | 0=>0 | k+1=>a[i]! + 2^32*Yg a (i+1) k lemma Zv (a:ؽ ٳ) (i k m:ٳ):Yg a i (k+m)=Yg a i k+2^(32*k)*Yg a (i+k) m:=by induction k generalizing i;simp[Yg];next k b=>rw[Cv _ 1,Yg,Yg,b,BU i 1 k,Ϟ 1 k];ring lemma ZbG (a b:ؽ ٳ) (i j k:ٳ) (h:∀ t,t a[i+t]! = b[j+t]!):Yg a i k=Yg b j k:=by induction k generalizing i j with |zero=>rfl |succ k d=>rw[Yg,Yg,d (i+1) (j+1) (λ t e=>by rw[(א:i+1+t=i+(t+1)),(א:j+1+t=j+(t+1))];exact h (t+1) א),show a[i]! =b[j]! by simpa using h 0 א] lemma Zw (a:ؽ ٳ) (i k:ٳ):Yg a i k=0↔∀ t,t a[i+t]! = 0:=by induction k generalizing i with |zero=>simp[Yg] |succ k d=>rw[Yg,Nat.add_eq_zero_iff,Ax,d (i+1)];have e:(2:ٳ)^32≠0:=ג;constructor;rintro⟨f,b|b⟩ t g;exact absurd b e;rcases t with _|t;simpa using f;rw[(א:i+(t+1)=i+1+t)];exact b t א;intro h;refine⟨by simpa using h 0 א,EY λ t g=>?_⟩;rw[(א:i+1+t=i+(t+1))];exact h (t+1) א lemma ZbH (a:ؽ ٳ) (i k:ٳ) (h:∀ t,t a[i+t]! < 2^32):Yg a i k<2^(32*k):=by induction k generalizing i with |zero=>simp[Yg] |succ k b=>have d:=h 0 א;have e:=b (i+1) (λ t f=>by rw[(א:i+1+t=i+(t+1))];exact h (t+1) א);simp at d;rw[Yg,show 32*(k+1)=32+32*k by ring,pow_add];linarith lemma O0 (a:ؽ ٳ) (t:ٳ) (h:a܃<=t):a[t]! = 0:=ח lemma ZbI (a:ؽ ٳ) (i k:ٳ) (h:a܃<=i+k):Yg a i k=ϋ (a܍.drop i):=by induction k generalizing i;simp[Yg,BL (by simpa using h:a܍.length<=i),ϋ];rename_i b;rw[Yg,b (i+1) א];by_cases d:i a[t]! = 0) (e:∀ t,b+n<=t -> a[t]! = 0) : ϋ a܍=2^(32*b)*Yg a b n:=by rw[<-List.drop_zero (l:=a܍),<-ZbI a 0 (b+(n+a܃)) א,Zv,Zv,(Zw a 0 b).2 (λ t f=>by simpa using d t f),(Zw a (0+b+n) a܃).2 (λ t _=>e _ א)];simp def YP (a b:ؽ ٳ) (i ca cb br:ٳ) (out:ؽ ٳ) : ٳ -> ؽ ٳ × ٳ × ٳ × ٳ | 0=>(out,ca,cb,br) | k+1 => let ta:=a[i]! + ca;let tb:=b[i]! + cb;let t:=ta%߿+߿-tb%߿-br;YP a b (i+1) (ta/߿) (tb/߿) (1-t/߿) (out.push (t%߿)) k lemma N9 (a b:ؽ ٳ) (i f g e:ٳ) (d:ؽ ٳ) (k:ٳ) (j:e<=1) (h:∀ t,t d[t]! < 2^32) : let r:=YP a b i f g e d k r.1ٽ=d܃+k/\(∀t,tr.1[t]! <2^32)/\(Yg r.1 0 r.1ٽ:ٴ)+2^(32*(d܃+k))*(r.2.1-r.2.2.1-r.2.2.2:ٴ)=Yg d 0 d܃+2^(32*d܃)*((Yg a i k:ٴ)-Yg b i k+f-g-e):=by induction k generalizing i f g e d with |zero=>exact⟨by simp[YP],by simpa[YP]using h,by simp[YP,Yg]⟩ |succ k q=>simp only[YP];set n:=a[i]!+f;set o:=b[i]!+g;set t:=n%߿+߿-o%߿-e;obtain⟨w,x,p⟩:=q (i+1) (n/߿) (o/߿) (1-t/߿) (d.push (t%߿)) א (by intro s l;simp only[Dt]at l;rcases Ap (Ao.mp l)with l|rfl;rw[ح _ s ו,Dy l,<-ح d s l];exact h s l;rw[ح _ _ ג,Dz];omega);refine⟨by simp[w];omega,x,?_⟩;simp only[Dt]at p⊢;rw[(א:d܃+(k+1)=d܃+1+k),p,(by rw[Zv,ZbG _ d 0 0 d܃ (λ s l=>by rw[ح _ _ ו,Dy א,<-ح d _ א])];simp only[Yg,Β,Co,ϑ];rw[ح _ _ ג,Dz]:Yg (d.push (t%߿)) 0 (d܃+1)=Yg d 0 d܃+2^(32*d܃)*(t%߿)),Yg,Yg];simp only[ER,ES,Ei,DF];linear_combination (2:ٴ)^(32*d܃)*(א:((t%߿:ٳ):ٴ)+߿*((n/߿:ٳ)-(o/߿:ٳ)-(1-t/߿:ٳ))=(a[i]!:ٴ)-b[i]!+f-g-e) def YW (r:ؽ ٳ):ٳ -> Option ٳ | 0=>none | k+1=>if r[k]! != 0 then some k else YW r k def YX (r:ؽ ٳ):ٳ -> ف | 0=>false | k+1=>r[k]! != 0||YX r k lemma ZbK (r:ؽ ٳ) (k:ٳ) (h:YW r k=none):∀ t,t r[t]! = 0:=by induction k with |zero=>intro t a;omega |succ k b=> simp only[YW]at h;split at h . cases h . rename_i d;intro t a;rcases Ap (Ao.mp a)with a|rfl . exact b h t a . simpa using d lemma N8 (r:ؽ ٳ) (k h:ٳ) (d:YW r k=some h):h t r[t]! = 0:=by induction k;simp[YW]at d;rename_i j;simp only[YW]at d;split at d<;>rename_i f;cases d;exact⟨א,by simpa using f,λt g e=>א⟩;obtain⟨a,b,c⟩:=j d;refine⟨א,b,λt g e=>?_⟩;rcases Ap (Ao.mp e)with e|rfl;exact c t g e;simpa using f lemma N7 (r:ؽ ٳ) (k:ٳ):YX r k=false↔∀ t,t r[t]! = 0:=by induction k with |zero=>simp[YX] |succ k b=> simp only[YX,Bool.or_eq_false_iff,bne_eq_false_iff_eq,b];constructor . rintro⟨d,e⟩ t a;rcases Ap (Ao.mp a)with a|rfl . exact e t a . exact d . intro h;exact⟨h k א,λ t a=>h t א⟩ lemma ZbL (r:ؽ ٳ) (k:ٳ):YX r k=(Yg r 0 k != 0):=by have a:=Zw r 0 k;simp at a;cases h:YX r k;rw[a.2 ((N7 r k).1 h)];rfl;simp;exact λ b=>by have:=(N7 r k).2 (a.1 b);simp_all lemma ZbM (a x y h:ٳ) (b:a<2^(32*h)):shiftRightJam (a+2^(32*h)*(x+2^32*y)) (32*h+2)=if x%4 != 0||a != 0 then (y*1073741824+x/4)|||1 else y*1073741824+x/4:=by have k:2^(32*h+2)=4*2^(32*h):=ז;have q:x%4<4:=Ε x ב;have f:a+2^(32*h)*(x%4)<4*2^(32*h):=by nlinarith have l:a+2^(32*h)*(x+2^32*y)=(a+2^(32*h)*(x%4))+4*2^(32*h)*(y*1073741824+x/4):=by conv_lhs=>rw[<-Ez x 4] ring have g:a+2^(32*h)*(x%4)=0↔¬(x%4≠0\/a≠0):=by constructor;intro d;have o:=Nat.eq_zero_of_add_eq_zero d;obtain p|p:=Ax.mp o.2<;>omega;intro d;simp at d;simp[d.1,d.2] unfold AR;dsimp only;rw[k,l,DG _ _ א,Υ f,Β,CF,ν f];by_cases j:x%4≠0\/a≠0 . have:¬(a+2^(32*h)*(x%4)=0):=λ d=>g.mp d j;have e:(x%4 !=0||a !=0)=true:=ז;simp only[beq_iff_eq,this,ש,e,ר] . have:=g.mpr j;have e:(x%4 !=0||a !=0)=false:=ז;simp only[beq_iff_eq,this,ר,e];rfl def Yas (neg:ف) (r:ؽ ٳ) (e:ٴ) (negZero:ف):ؼ:= match YW r rٽ with | none=>ρ 0 e negZero | some 0=>ρ (if neg then -(r[0]! : ٴ) else r[0]!) e negZero | some (h+1) => let x:=r[h]!;let v:=r[h+1]! * 1073741824+x/4;let m:=if x%4 != 0||YX r h then v|||1 else v;π (Bt κ ⟨neg,m,e+((32*h+2:ٳ):ٴ)⟩) lemma F9 (b:ف) (R:ٳ) (e:ٴ) (a:ف) (d:R≠0):ρ (if b then -(R:ٴ) else R) e a=π (Bt κ ⟨b,R,e⟩):=by have f:(0:ٴ)simp[ρ,ofIntDyadic,d,not_lt.2 f.le,Ο d] lemma N6 (b:ف) (r:ؽ ٳ) (e:ٴ) (a:ف) (d:∀ t,t r[t]! < 2^32) : Yas b r e a=ρ (if b then -(Yg r 0 r܃:ٴ) else Yg r 0 r܃) e a:=by unfold Yas;split;rename_i o;rw[(Zw r 0 r܃).2 (λ t f=>by simpa using ZbK r _ o t f)];simp;rename_i g;obtain⟨p,j,k⟩:=N8 r _ 0 g;rw[(א:r܃=1+(r܃-1)),Zv,(Zw r (0+1) (r܃-1)).2 (λ t f=>k _ א א)];simp[Yg] rename_i h g;obtain⟨p,j,k⟩:=N8 r _ (h+1) g;have l:Yg r 0 r܃=Yg r 0 h+2^(32*h)*(r[h]!+2^32*r[h+1]!):=by rw[(א:r܃=h+(2+(r܃-h-2))),Zv,Zv,(Zw r (0+h+2) _).2 (λ t f=>k _ א א)];simp[Yg] have q:Yg r 0 h<2^(32*h):=ZbH r 0 h (λ t f=>d _ א);have n:Yg r 0 r܃≠0:=by rw[l];have:0<2^(32*h)*(r[h]!+2^32*r[h+1]!):=(by have:=Ο j;positivity);omega have s:32*h+2+25<=(Yg r 0 r܃)܀:=by rw[CH n,l];have:=Ο j;calc 2^(32*h+2+25)<=2^(32*h)*2^32:=by rw[<-pow_add];exact Ι ב א _<=2^(32*h)*(r[h]!+2^32*r[h+1]!):=by gcongr;linarith _<=_:=א rw[F9 b _ e a n,<-ZbF b _ e _ s,l,ZbM _ _ _ h q,ZbL] def Yab (pos neg:ؽ ٳ):ٳ -> ٳ | 0=>0 | k+1=>if pos[k]! != 0||neg[k]! != 0 then k+1 else Yab pos neg k lemma ZbO (a b:ؽ ٳ) (k:ٳ):∀ t,Yab a b k<=t -> t a[t]! = 0/\b[t]! = 0:=by induction k<;>intro t d e ·omega rename_i f;simp only[Yab]at d;split at d . omega . rename_i g;rcases Ap (Ao.mp e)with e|rfl . exact f t d e . simpa[Ϸ,bne_iff_ne,not_or]using g def YaL (pos neg:ؽ ٳ) (e:ٴ) (negZero:ف):ؼ:= let lo:=lowLimb pos neg posٽ 0;let n:=Yab pos neg (max posٽ negٽ)+1-lo;let e':=e+((32*lo:ٳ):ٴ);let d:=YP pos neg lo 0 0 0 (Ba n) n;if d.2.1=0/\d.2.2.1=0/\d.2.2.2=0 then Yas false d.1 e' negZero else let d':=YP neg pos lo 0 0 0 (Ba n) n;if d'.2.1=0/\d'.2.2.1=0/\d'.2.2.2=0 then Yas true d'.1 e' negZero else finishLimbs pos neg e negZero lemma Q2 (b d:ؽ ٳ) (e:ٴ) (f:ف):YaL b d e f=ρ ((ϋ b܍:ٴ)-ϋ d܍) e f:=by unfold YaL;dsimp only;set g:=lowLimb b d b܃ 0;set n:=Yab b d (max b܃ d܃)+1-g;have o:=lowLimb_zero b d b܃ 0;have p:=ZbO b d (max b܃ d܃);have q (a:ؽ ٳ) (h:a=b\/a=d):ϋ a܍=2^(32*g)*Yg a g n:=by apply ZbJ a g n;intro t j;rcases h with rfl|rfl;exact(o t א j).1;exact(o t א j).2;intro t j;by_cases r:t< max b܃ d܃;rcases h with rfl|rfl;exact(p t א r).1;exact(p t א r).2;rcases h with rfl|rfl<;>exact O0 _ t א have s:=q b (Ea rfl);have u:=q d (EY rfl);rw[show(Ba n:ؽ ٳ)=#[] from rfl];have v:=N9 b d g 0 0 0 #[] n א ג;have w:=N9 d b g 0 0 0 #[] n א ג;have z:Yg (#[]:ؽ ٳ) 0 0=0:=rfl;simp only[CK,Dr,Co,pow_zero,one_mul,z,CP,zero_add]at v w;obtain⟨-,A,x⟩:=v;obtain⟨-,B,y⟩:=w;split_ifs with k l;rw[N6 false _ _ _ A,Aa,s,u];simp;congr 1;rw[k.1,k.2.1,k.2.2]at x;linear_combination (2:ٴ)^(32*g)*x;rw[N6 true _ _ _ B,Aa,s,u];simp;congr 1;rw[l.1,l.2.1,l.2.2]at y;linear_combination (-(2:ٴ)^(32*g))*y;exact finishLimbs_eq b d e f end @[inline] def Yy (acc:Acc) (wa wb:ؼ):Acc:= if θ wa=255\/θ wb=255 then acc.markSpecial else acc.add (ε wa*ε wb) (γ wa+γ wb) (Ζ (η wa) (η wb)) @[specialize] def Yw (fa fb:ٳ -> ؼ) (pos neg:ؽ ٳ) (sp nz:ف) (index:ٳ):ٳ -> Acc | 0=>⟨pos,neg,sp,nz⟩ | count+1 => match Yy ⟨pos,neg,sp,nz⟩ (fa index) (fb index) with | ⟨p,n,s,z⟩=>Yw fa fb p n s z (index+1) count @[inline] def Yn (n:ٳ) (fa fb:ٳ -> ؼ):ؼ:= let acc:=Yw fa fb (Χ 18 0) (Χ 18 0) false true 0 n;if acc.special then dotSpec (ڀ n λ i=>fa i) (ڀ n λ i=>fb i) else YaL acc.pos acc.neg (-298) (n≠0&&acc.negZero) lemma Zn (a b:ؼ):(if Ζ (η a) (η b) then -((ε a*ε b:ٳ):ٴ) else ((ε a*ε b:ٳ):ٴ))=sv a*sv b:=by unfold sv;cases η a<;>cases η b<;>simp lemma ZbP (g h:ٳ -> ؼ) (d e:ؽ ٳ) (f:ف) (a b:ٳ):(Yw g h d e true f a b).special=true:=by induction b generalizing d e f a ·rfl rename_i k;rw[Yw];have j:(Yy ⟨d,e,true,f⟩ (g a) (h a)).special=true:=by unfold Yy Acc.markSpecial Acc.add;split_ifs<;>rfl generalize Yy ⟨d,e,true,f⟩ (g a) (h a)=r at j⊢;obtain⟨p,q,s,z⟩:=r;subst j;exact k .. lemma Q1 (g j:ٳ -> ؼ) (A B:ؽ ؼ) (n:ٳ) (o:∀ k,k A[k]! = g k) (r:∀ k,k B[k]! = j k) (f:Acc) (e d:ٳ) (h:e+d<=n) (t:f.posٽ=18) (u:f.negٽ=18) (l:(Yw g j f.pos f.neg f.special f.negZero e d).special =false) : f.special=false /\ (∀ k,e<=k -> k < e+d -> θ A[k]! ≠ 255/\θ B[k]! ≠ 255) /\ (Yw g j f.pos f.neg f.special f.negZero e d).total=f.total+dsum A B e d /\ (Yw g j f.pos f.neg f.special f.negZero e d).negZero=(f.negZero&&dallNZ A B e d):=by induction d generalizing f e with |zero=>cases f;simp_all[Yw,dsum,dallNZ] |succ count C=>obtain⟨p,q,s,z⟩:=f;have v:=o e א;have w:=r e א;rw[Yw,Yy]at l⊢;generalize g e=a,j e=b at*;by_cases x:θ a=255\/θ b=255;simp only[if_pos x,Acc.markSpecial,ZbP,Bool.true_eq_false]at l;have y:=not_or.mp x;obtain⟨D,E,F,G,H⟩:=Acc.add_spec ⟨p,q,s,z⟩ (ε a*ε b) (γ a+γ b) (Ζ (η a) (η b)) t u (mul_mant_lt _ _) (by have:=idxOf_le _ y.1;have:=idxOf_le _ y.2;omega);rw[if_neg x]at l⊢;obtain⟨I,J,K,L⟩:=C _ (e+1) א D E l;refine⟨F▸I,?_,?_,?_⟩;intro k N O;by_cases M:k=e;subst M;rw[v,w];exact y;exact J k א א;rw[K,H,dsum,v,w,Zn];ring;rw[L,G,dallNZ,v,w];simp[EK] lemma Ze (n:ٳ) (f:ٳ -> ؼ) (k:ٳ) (a:kf i܂)[k]! = f k:=ח lemma Z5 (n:ٳ) (a b:ٳ -> ؼ):Yn n a b=dotSpec (ڀ n λ i=>a i) (ڀ n λ i=>b i):=by unfold Yn;set A:=ڀ n λ i=>a i with y;set B:=ڀ n λ i=>b i with z;set d:=Yw a b (Χ 18 0) (Χ 18 0) false true 0 n;cases l:d.special . obtain⟨-,f,g,o⟩:=Q1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א rfl rfl l;have g:d.total=dsum A B 0 n:=by rwa[Acc.total_empty,EW]at g have o:d.negZero=dallNZ A B 0 n:=o;simp only[l,φ,ש];rw[Q2,<-Acc.total];obtain⟨p,u⟩:Aٽ=n∧Bٽ=n:=by simp[y,z] obtain⟨C,D⟩:=dotStateLoop_flags A B {} 0 n (by simp[p]) (by simp[u]) f;set L:=A.map (DD (fmt:=κ)) with h;set R:=B.map (DD (fmt:=κ)) with v;obtain⟨e,w⟩:Lٽ=Rٽ∧Lٽ=n:=ז;have q:∀ k (r:kf k E א)).trans (by rw[w,g]);have x:=Model.Reduction.Internal.dotState_exact_toRat (destination:=κ) L R e q s;unfold dotSpec Model.dot;by_cases j:d.total=0 . rw[Model.Reduction.dotWithStatus_eq_zero_of_finite κ L R .nearestEven e q s (by rw[<-Di,x,t,j];simp),j,finishWord_zero];simp[Model.Reduction.Internal.dotState,Except.map,h,v,p,C,D,o] . rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero κ L R .nearestEven e q s (by rw[Model.Reduction.Semantics.finiteDot_toList_eq_slice L R e,t];simpa using j)];exact finishWord_of_ne _ _ _ _ j (by rw[x,t]) . simp[l] lemma Z6 (a:ؽ ؼ) (n:ٳ) (h:n=a܃):(ڀ n λ i=>a[i܂]!)=a:=by subst h;apply EP ג;intro i d b;rw[AD,ح a i b] lemma ZbQ (n:ٳ) (c:ؼ):(ڀ n λ _=>c)=Χ n c:=by apply EP ג;simp def YaM (a b:ؽ ؼ):ؼ:= if aٽ=bٽ then Yn aٽ (λ i=>a[i]!) (λ i=>b[i]!) else dotSpec a b def YaN (x:ؽ ؼ):ؼ:=Yn xٽ (λ i=>x[i]!) (λ _=>ζ) lemma ZbR (a b:ؽ ؼ):YaM a b=dotSpec a b:=by unfold YaM;split;next h=>rw[Z5,Z6 a _ rfl,Z6 b _ h] rfl lemma ZbS (x:ؽ ؼ):YaN x=sumSpec x:=by rw[YaN,Z5,Z6 x _ rfl,ZbQ,sumSpec] lemma Zi:Yn=Γ:=funext λ n=>funext λ a=>funext λ b=>Z5 n a b lemma Q0 (w:δ):π (ι w)=w:=by apply ύ.1;simp only[π,ι,Dn,ofUInt32_bits];exact ν w.toBitVec.isLt lemma P9 (z:Model κ):ι (π z)=z:=by have h:Dn z<2^32:=Model.toNatBits_lt_two_pow z;simp only[ι,π,DD,AL,ν h];exact Model.ofNatBits_toNatBits z @[inline] def Yz (w:δ):ٴ:= if η w then -((ε w<<<γ w:ٳ):ٴ) else ((ε w<<<γ w:ٳ):ٴ) lemma ZbT (w:δ):Yz w=sv w*2^γ w:=by unfold Yz sv;split<;>simp[Α] lemma Zx (w:δ):(Ν w).toReal=(Yz w:ℝ)*2^(-149:ٴ):=by rw[<-BC,ϙ,ZbT];push_cast;rw[zpow_sub₀ two_ne_zero,ؠ];ring lemma ZH (w:ؼ):(θ w)؎=w؎/2^23%256:=by simp only[θ,AH,Ϣ,ψ];exact ϡ _ 8 lemma ZR (w:ؼ):(fracOf w)؎=w؎%2^23:=ϡ _ 23 @[inline] def Yac (w:δ):ٴ:=let m:ٴ:=(wپ%2147483648:ٳ);if η w then -m else m def mg (n:ٳ):ٳ:=if n/2^23%256=0 then n%2^23 else (2^23+n%2^23)*2^(n/2^23%256-1) lemma K1 (w:δ):ε w<<<γ w=mg w؎:=by unfold ε γ mg;simp only[<-ύ,UInt32.toNat_zero,ZH,ZR,Α];split<;>simp lemma ZS (a b:ٳ) (h:a%2^31nlinarith[BE (n:=A-1)] lemma ZbU (a b:δ):compare (Yac a) (Yac b)=compare (Yz a) (Yz b):=by have e:∀a b:ٳ,a%2^31=b%2^31->mg a=mg b:=λ a b h=>by unfold mg;rw[show a/2^23%256=b/2^23%256 by omega,show a%2^23=b%2^23 by omega] have:=ZS a؎ b؎;have:=ZS b؎ a؎;have:=e a؎ b؎;have:=ZS 0 b؎;have:=e b؎ 0;have:mg 0=0:=rfl;unfold Yac Yz;rw[K1,K1];simp only[compare,compareOfLessAndEq,DU]at*;generalize a؎%2147483648=A at*;generalize b؎%2147483648=B at*;split_ifs<;>first|rfl|omega lemma ZbV (a:δ) (b:θ a≠255):ι a=(if Cm (ι a)&&Cm (ι a) then Cs κ (BS (ι a)&&BS (ι a)) else ι a):=by simp only[DW];split . rename_i d;obtain⟨e,f⟩:=(Model.isZero_iff_fields_of_isFinite (by simp[ι,isFinite_ofUInt32,b])).1 d;conv_lhs=>rw[<-Model.ofFields_signBit_expField_fracField (ι a),e,f] cases BS (ι a)<;>decide . rfl @[inline] def YQ (a b:δ):δ:= if θ a=255\/θ b=255 then π (CO (ι a) (ι b)) else match compare (Yac a) (Yac b) with | .lt=>b | .gt=>a | .eq=>if a=b then a else π (if Cm (ι a)&&Cm (ι b) then Cs κ (BS (ι a)&&BS (ι b)) else ι a) lemma ZbW (a b:δ):Model.cmpDyadic (Ν a) (Ν b)=compare (Yz a) (Yz b):=by have d:(0:ℝ)<2^(-149:ٴ):=zpow_pos two_pos _;cases h:compare (Yz a) (Yz b);rw[Model.cmpDyadic_lt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_lt_iff_lt.mp h) d;rw[Model.cmpDyadic_eq_iff,Zx,Zx,compare_eq_iff_eq.mp h];rw[Model.cmpDyadic_gt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_gt_iff_gt.mp h) d lemma ZbX (a b:δ):ι (YQ a b)=CO (ι a) (ι b):=by unfold YQ;split;exact P9 _;rename_i d;rw[ZbU];have e:=Ϡ a (d∘Ea);have f:=Ϡ b (d∘EY);have g:Model.compare (ι a) (ι b)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e f;rw[ZbW]at g;unfold CO;rw[Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff _ _).2 ⟨AX e,AX f⟩:Model.chooseNaN2 (ι a) (ι b)=none),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ g];cases compare (Yz a) (Yz b)<;>simp only[P9,apply_ite ofW];by_cases h:a=b;subst h;rw[if_pos rfl];exact ZbV a (d∘Ea);rw[if_neg h] def Yad (c h w k:ٳ) (inp:ؽ δ):ؽ δ:= AF (n:=c*(h/k*(w/k))) λ q => let ch:=q.val/(h/k*(w/k));let y:=q.val/(w/k)%(h/k);let x:=q.val%(w/k);(ϒ (k*k)).foldl (λ acc t=>YQ acc (poolAt h w k inp ch y x t)) (poolAt h w k inp ch y x 0) lemma ZbY (p:ٳ -> δ) (l:List ٳ) (b:δ):l.foldl (λ m t=>CO m (ι (p t))) (ι b)=ι (l.foldl (λ a t=>YQ a (p t)) b):=by induction l generalizing b;rfl;next t l d=>simp only[AO,<-ZbX,d] lemma P8:Yad=maxpoolSpec:=by funext c h w k a;simp only[Yad,maxpoolSpec,ZbY,Q0] def kernels0:Kernels where core:=⟨YaN,YaM⟩ dense:=⟨linearWith Yn,gemmWith Yn⟩ conv:=⟨conv2dWith Yn,depthwiseWith Yn⟩ elem:=⟨avgpoolWith Yn,Yad,addReluSpec,scaleShiftSpec⟩ norm:=⟨rmsnormWith Yn,layernormWith Yn⟩ lemma ZbZ:Obligation kernels0:=by simp only[Obligation,kernels0,specKernels,specCore,specDense,specConv,specElem,specNorm,linearSpec,gemmSpec,conv2dSpec,depthwiseSpec,avgpoolSpec,rmsnormSpec,layernormSpec,P8,Zi,funext ZbS,funext λ a=>funext (ZbR a)] def Yo (fa fb:ٳ -> ؼ) (i:ٳ):ٳ -> ٴ | 0=>0 | r+1=>sv (fa i)*sv (fb i)*2^(γ (fa i)+γ (fb i))+Yo fa fb (i+1) r def Yq (fa fb:ٳ -> ؼ) (i:ٳ):ٳ -> ف | 0=>true | r+1=>(decide (ε (fa i)*ε (fb i)=0)&&Ζ (η (fa i)) (η (fb i))) && Yq fa fb (i+1) r lemma Zb0 (n:ٳ) (a b:ٳ -> ؼ) (i r:ٳ) (h:i+r<=n):dsum (ڀ n λ k=>a k܂) (ڀ n λ k=>b k܂) i r=Yo a b i r:=by induction r generalizing i;rfl;next r d=>rw[dsum,Yo,Ze n a i א,Ze n b i א,d (i+1) א] lemma Zb1 (n:ٳ) (a b:ٳ -> ؼ) (i r:ٳ) (h:i+r<=n):dallNZ (ڀ n λ k=>a k܂) (ڀ n λ k=>b k܂) i r=Yq a b i r:=by induction r generalizing i;rfl;next r d=>rw[dallNZ,Yq,Ze n a i א,Ze n b i א,d (i+1) א] lemma Zb2 (f g:ٳ -> ؼ) (d e:ؽ ٳ) (j:ف) (a b:ٳ) (l:∀ k,a<=k -> k < a+b -> θ (f k)≠255/\θ (g k)≠255) : (Yw f g d e false j a b).special=false:=by induction b generalizing d e j a ·rfl rename_i t;rw[Yw];have n:=l a le_rfl א;have o:(Yy ⟨d,e,false,j⟩ (f a) (g a)).special=false:=by have u:¬(θ (f a)=255\/θ (g a)=255):=not_or.2 n;unfold Yy Acc.add;split_ifs<;>rfl generalize Yy ⟨d,e,false,j⟩ (f a) (g a)=r at o⊢;obtain⟨p,q,s,z⟩:=r;subst o;exact t _ _ _ _ (λ k v w=>l k א א) lemma Zy (n:ٳ) (a b:ٳ -> ؼ) (d:∀ k,k θ (a k)≠255/\θ (b k)≠255) : Γ n a b=ρ (Yo a b 0 n) (-298) (decide (n≠0)&&Yq a b 0 n):=by rw[<-Zi];unfold Yn;set A:=ڀ n λ i=>a i܂;set B:=ڀ n λ i=>b i܂;set e:=Yw a b (Χ 18 0) (Χ 18 0) false true 0 n;have f:e.special=false:=Zb2 a b _ _ true 0 n (λ k _ r=>d k א) obtain⟨-,-,g,h⟩:=Q1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א rfl rfl f;have j:e.total=Yo a b 0 n:=by simp only[Acc.total_empty,EW]at g;rwa[<-Zb0 n a b 0 n א] have l:e.negZero=Yq a b 0 n:=by rwa[<-Zb1 n a b 0 n א] simp only[f,φ,ש];rw[Q2,show((ϋ e.pos܍:ٴ)-ϋ e.neg܍)=e.total from rfl,j,l] noncomputable def YC (w2 w1 w0:ػ):ٴ:= ((w2پ*2^128+w1پ*2^64+w0پ:ٳ):ٴ) - (if w2پ<2^63 then 0 else 2^192) def Ym (w:ػ):ٴ:=(wپ:ٴ)-(if wپ<2^63 then 0 else 2^64) lemma Zb3 (s:ف) (E F:ٳ) (b:E<256) (a:F<2^23):(EH κ s E F).toNatBits=(if s then 2^31 else 0)+E*2^23+F:=by rw[Model.ofFields_eq_ofFieldsImpl];simp only[Model.ofFieldsImpl,Model.mkBitsImpl,EQ,Dn,BitVec.toNat_ofNatLT];have d:E&&&κ.expAllOnesNat=E:=Bx (n:=8) b;have e:F&&&κ.fracMaskNat=F:=Bx (n:=23) a;rw[d,e,show E.shiftLeft κ߷=E<<<23 from rfl,Nat.or_assoc,<-Bq a];have f:E<<<23+F<2^31:=א;cases s . simp[Α] . simp only[ר];rw[show Nat.shiftLeft 1 (κ.expWidth+κ߷)=1<<<31 from rfl,<-Bq f];simp;omega @[inline] def Yv (neg:ف) (E F:ؼ):ؼ:=(if neg then (߾:ؼ) else 0)+(E<<<23)+F lemma ZT (a:ف) (E F:ؼ) (b:E؎<256) (d:F؎<2^23):Yv a E F=π (EH κ a E؎ F؎):=by unfold π;rw[Zb3 a _ _ b d];apply ύ.1;unfold Yv;cases a<;>simp<;>omega lemma P7 (a:ف):Yv a 255 0=π (DE κ a):=by rw[Model.nativeOverflow_eq_signedInf_of_isIEEE Fmt ד];cases a<;>decide lemma Zb4 (a:ف):Yv a 0 0=π (Cs κ a):=by cases a<;>decide @[inline] def YH (x r d:ػ):ػ:=if x>>>(r+d) != 0 then r+d else r @[inline] def Yj (x:ػ):ػ:= YH x (YH x (YH x (YH x (YH x (YH x 0 32) 16) 8) 4) 2) 1 lemma Zz (x r d:ػ) (D:ٳ) (a:d˧=D) (f:1<=D) (g:r˧+2*D<=64) (b:2^r˧<=x˧) (e:x˧<2^(r˧+2*D)) : (YH x r d)˧+D<=64/\2^(YH x r d)˧<=x˧ /\ x˧<2^((YH x r d)˧+D):=by subst a;have k:(r+d)˧=r˧+d˧:=by rw[ξ];omega have l:(x>>>(r+d))˧=x˧/2^(r˧+d˧):=by rw[Ξ,k,ν א,ψ] unfold YH;by_cases j:x>>>(r+d) !=0;simp only[j,ר,k];have:x˧/2^(r˧+d˧)≠0:=(by intro h;apply(bne_iff_ne.mp j);apply σ.mp;rw[l,h];rfl);exact⟨א,(Am (Δ _)).mp (Dd.mpr this)|>.trans' ג,by rwa[(א:r˧+d˧+d˧=r˧+2*d˧)]⟩;simp only[j,ש,φ];have n:x>>>(r+d)=0:=ז;have:x˧/2^(r˧+d˧)=0:=by rw[<-l,n];rfl exact⟨א,b,(Nat.div_eq_zero_iff_lt (Δ _)).mp this⟩ lemma Zj (x:ػ) (a:x≠0):(Yj x)˧=x˧܀:=by have b:1<=x˧:=Dd.mpr λh=>a (σ.mp (by simpa using h));have d:=x܉;obtain⟨t,e,f⟩:=Zz x 0 32 32 rfl ד ד (by simpa using b) (by simpa using d);obtain⟨u,g,j⟩:=Zz x _ 16 16 rfl ד א e (by simpa using f);obtain⟨v,k,l⟩:=Zz x _ 8 8 rfl ד א g (by simpa using j);obtain⟨w,n,o⟩:=Zz x _ 4 4 rfl ד א k (by simpa using l);obtain⟨y,p,q⟩:=Zz x _ 2 2 rfl ד א n (by simpa using o);obtain⟨z,r,s⟩:=Zz x _ 1 1 rfl ד א p (by simpa using q);exact((Af א).mpr ⟨r,s⟩).symm @[inline] def Ybm (m:ػ) (e:ٴ):ػ:= match e+149 with | .ofNat k=>m<<Bm m (k+1) @[inline] def YaO (neg:ف) (m:ػ) (e:ٴ):ؼ:= let fr:=Ybm m e;if fr==0 then Yv neg 0 0 else if (0x800000:ػ)<=fr then Yv neg 1 0 else Yv neg 0 fr.toUInt32 lemma Zb5 (a:ف) (m:ػ) (e:ٴ) (b:m˧≠0) (h:(m˧܀:ٴ)+e < -126) : YaO a m e=π (Bv κ a (Cs κ a) (match e-ض with | BG shift=>m˧<<AQ m˧ (shift+1))):=by rw[show ض= -149 from rfl,Int.sub_neg];unfold YaO Ybm;generalize l:e+149=s;suffices H:∀(d:ػ) F,d˧=F→F<=2^23→(if d==0 then Yv a 0 0 else if 0x800000<=d then Yv a 1 0 else Yv a 0 d՜)=π (Bv κ a (Cs κ a) F) by rcases s with k|k ·simp at l;have o:m˧*2^k<2^23:=(Aj (Ak (n:=m˧)) (Δ k)).trans_le (by rw[<-Κ];exact Ι א א);exact H _ (m˧<<g (σ.mp h),ש];by_cases f:0x800000<=d . simp only[f,ר,show d˧>=Ct Fmt߷from f];exact ZT a 1 0 ד ד . simp only[f,ש,show¬d˧>=Ct Fmt߷from f];have j:d՜؎=d˧:=ν א;exact j▸ZT a 0 _ ד (by rw[j];exact Nat.lt_of_not_le f) @[inline] def YK (m L:ػ):ػ:= if 23<=L then Bm m (L-23).toNat else m<<<(23-L) @[inline] def Yae (neg:ف) (m L:ػ) (t:ٴ):ؼ:= let rm:=YK m L;if rm==0x1000000 then (if t+1>127 then Yv neg 255 0 else Yv neg (t+128).toNat.toUInt32 0) else Yv neg (t+127).toNat.toUInt32 (rm.toUInt32-0x800000) lemma Z7 (m:ػ) (a:m≠0):(YK m (Yj m))˧=(if κ߷<=m˧܀ then AQ m˧ (m˧܀-κ߷) else m˧<<<(κ߷-m˧܀)) /\ 2^23<=(YK m (Yj m))˧/\(YK m (Yj m))˧<=2^24:=by have k:m˧≠0:=λh=>a (σ.mp (by simpa using h));have b:=Zj m a;have f:=ϰ k;have g:m˧<2^(m˧܀+1):=Ak;rw[show κ߷=23 from rfl];unfold YK;generalize Yj m=L at b⊢;generalize q:m˧܀=N at*;by_cases h:23<=N have d:(23:ػ)<=L:=by rw[ϐ,b];exact h simp only[d,ר,h,(ח:(L-23)˧=N-23),Bg];exact⟨trivial,(by rw[Am (Δ _),<-Κ,Ej h];exact f:2^23<=m˧/2^(N-23)).trans (Cq _ _),(Bn _ _).trans (by rw[An (Δ _),<-Κ,(by clear*-h;omega:24+(N-23)=N+1)];exact g:m˧/2^(N-23)<2^24)⟩;simp only[(by rw[ϐ,b];exact h:¬(23:ػ)<=L),ש,h];have j:m˧*2^(23-N)<2^24:=(Aj g (Δ _)).trans_eq (by rw[<-Κ];congr 1;clear*-h;omega) rw[(by rw[ό,(by rw[Η _ _ (by rw[ϐ,b];exact Ev h),b];rfl:(23-L)˧=23-N),ν (Ρ (EI 23 N) ד),Α];exact ν (j.trans ד):(m<<<(23-L))˧=m˧*2^(23-N)),Α];exact⟨rfl,(by rw[<-Κ,Ej (Ev h)]:2^23=2^N*2^(23-N)).trans_le (ω _ f),j.le⟩ lemma K3 (n:ٳ) (h:n<2^32):n.toUInt32؎=n:=by rw[Cd,AL,ν h] lemma Zb6 (a:ف) (m:ػ) (e:ٴ) (b:m≠0) (d:¬ ((m˧܀:ٴ)+e>127)) (f:¬ ((m˧܀:ٴ)+e < -126)) : Yae a m (Yj m) ((m˧܀:ٴ)+e)=π (CS κ a (DE κ a) (↑m˧܀+e) (if κ߷<=m˧܀ then AQ m˧ (m˧܀-κ߷) else m˧<<<(κ߷-m˧܀))):=by obtain⟨q,r,s⟩:=Z7 m b;rw[<-q];unfold Yae CS;generalize YK m (Yj m)=g at r s⊢;generalize (m˧܀:ٴ)+e=t at d f⊢;simp only[Model.pow2_eq_two_pow,show κ߷=23 from rfl,show κ.maxNormalExponent=127 from rfl,show κ.exponentBias=127 from rfl,show κ.maxFiniteExpField=254 from rfl,show κ.maxFiniteFracField=8388607 from rfl,DU,Nat.reduceAdd,DK,DF];by_cases k:g˧=ނ . have l:(g==0x1000000)=true:=beq_iff_eq.2 (σ.1 k);simp only[l,ר,k,BEq.rfl];by_cases o:t+1>127 . simp only[o];exact P7 a . simp only[o,ש];have j:((t+128)׆.toUInt32)؎=(t+1+127)׆:=by rw[K3 (t+128)׆ א];omega rw[if_neg ז];rw[ZT a _ 0 (by rw[j];omega) ד,j];rfl . have l:(g==0x1000000)=false:=beq_eq_false_iff_ne.2 λ h=>k (by rw[h];rfl) have u:(g˧==ނ)=false:=ז;simp only[l,u,φ,ש,(א:¬t>127)];have j:=K3 (t+127)׆ א;have p:(g՜-0x800000)؎=g˧-ރ:=by rw[Dj _ _ (by rw[AJ];simp;omega)];simp;omega rw[if_neg ז];rw[ZT a _ _ (by rw[j];omega) (by rw[p];omega),j,p] @[inline] def YA (neg:ف) (m:ػ) (e:ٴ):ؼ:= let L:=Yj m;let t:ٴ:=(Lپ:ٴ)+e;if t>127 then Yv neg 255 0 else if t < -126 then YaO neg m e else Yae neg m L t lemma ZU (a:ف) (m:ػ) (e:ٴ) (b:m≠0):YA a m e=π (AT κ ⟨a,m˧,e⟩):=by have g:m˧≠0:=λh=>b (σ.mp (by simpa using h));have j:=Zj m b;unfold YA AT;simp only[show(m˧==0)=false by simpa using g,φ,ש,j,show κ.maxNormalExponent=127 from rfl,show κ.minNormalExponent= -126 from rfl];by_cases f:(m˧܀:ٴ)+e>127;simp only[f,ר];exact P7 a;simp only[f,ש];by_cases d:(m˧܀:ٴ)+e< -126;simp only[d,ר];exact Zb5 a m e g d;simp only[d,ש];exact Zb6 a m e b f d @[noinline] def Ybn (neg:ف) (m:ػ) (e:ٴ):ؼ:=YA neg m e @[noinline] def Yat (neg:ف) (m:ػ) (e:ٴ) (L c:ػ):ؼ:= YA neg m (e+((Lپ+cپ:ٳ):ٴ)) @[inline] def YY (n:ػ):ػ:= let q:=n>>>40;q+(((n&&&0xFFFFFFFFFF)+0x7FFFFFFFFF+(q&&&1))>>>40) lemma Zb7 (n:ػ):(YY n)˧=AQ n˧ 40:=by rw[Cl _ _ ד];have b:(n>>>40)˧=n˧/2^40:=by rw[Ξ,ψ];rfl have d:(n&&&0xFFFFFFFFFF)˧=n˧%2^40:=by rw[BR,show(0xFFFFFFFFFF:ػ)˧=2^40-1 from rfl,ϡ] have e:((n>>>40)&&&1)˧=n˧/2^40%2:=ח;have f:n˧/2^(40-1)%2=n˧%2^40/2^39:=by rw[(ב:(2:ٳ)^40=2^39*2),Cw] have g:n˧%2^(40-1)=n˧%2^40%2^39:=by rw[(ב:(2:ٳ)^40=2^39*2),Nat.mod_mul_right_mod] have k:=Ε n˧ (Δ 40);have l:n˧/2^40<2^24:=(An ד).2 n܉ unfold YY;simp only[ξ,Ξ,d,e,BJ,f,g];clear b d e f g;generalize n˧%2^40=R at*;simp only[Bc,ψ]at*;split<;>rename_i h<;>simp at h<;>generalize n˧/1099511627776=Q at*<;>rw[ν (a:=R+549755813887) א,ν (a:=R+549755813887+Q%2) א]<;>[rw[(א:(R+549755813887+Q%2)/1099511627776=1)];rw[(א:(R+549755813887+Q%2)/1099511627776=0)]]<;>exact ν א lemma Z8 (a:ف) (E F:ؼ) (h:E؎*2^23+F؎<2^31):(Yv a E F)؎=(if a then 2^31 else 0)+E؎*2^23+F؎:=by unfold Yv;cases a<;>simp<;>omega @[inline] def YZ (neg:ف) (u n:ػ):ؼ:= (if neg then (߾:ؼ) else 0)+((u<<<23)+YY n).toUInt32 lemma Zb8 (a:ف) (u n:ػ) (b:u˧<=253) (d:(YY n)˧<=2^24):(YZ a u n)؎=(if a then 2^31 else 0)+u˧*2^23+(YY n)˧:=by have e:(u<<<23)˧=u˧*2^23:=by rw[ό];simp;omega unfold YZ;cases a<;>simp<;>omega lemma P6 (a:ف) (m:ػ) (e:ٴ) (u:ػ) (b:m≠0) (d:(u˧:ٴ)=(m˧܀:ٴ)+e+126) (f:u˧<=253) : YZ a u (m<<<(63-Yj m))=YA a m e:=by have k:=Zj m b;obtain⟨o,p,q⟩:=Z7 m b;have j:m˧܀<64:=(Ϻ λh=>b (σ.mp h)).mpr m܉;have l:(YY (m<<<(63-Yj m)))˧=(YK m (Yj m))˧:=by rw[Zb7,o,(by rw[ό,(by rw[Τ,k];simp;clear*-j;omega:(63-Yj m)˧=63-m˧܀),ν (by clear*-;omega:63-m˧܀<64),Α];exact ν ((Aj Ak (Δ _)).trans_eq (by rw[<-Κ,(by clear*-j;omega:m˧܀+1+(63-m˧܀)=64)])):(m<<<(63-Yj m))˧=m˧*2^(63-m˧܀)),show κ߷=23 from rfl];split<;>rename_i g;rw[(by clear*-g j;omega:(40:ٳ)=m˧܀-23+(63-m˧܀)),CE];rw[Cc _ _ _ (by clear*-g j;omega),Α,(by clear*-;omega:63-m˧܀-40=23-m˧܀)] simp only[YA,k,show¬(m˧܀+e>127)by clear*-d f;omega,show¬(m˧܀+e< -126)by clear*-d f;omega,ש];apply ύ.mp;rw[Zb8 a u _ f (by clear*-l p q;omega),l];unfold Yae;generalize YK m (Yj m)=n at l p q⊢;generalize (m˧܀:ٴ)+e=t at d⊢;clear b k o j;by_cases g:n˧=ނ;simp only[show(n==0x1000000)=true by simp[<-σ,g],ר];by_cases v:t+1>127<;>simp only[v,ר,ש]<;>rw[Z8 a _ _ (by simp<;>omega)]<;>simp<;>omega;simp only[show(n==0x1000000)=false by simp[<-σ,g],φ,ש];rw[Z8 a _ _ (by simp[CX];omega)];simp[CX];omega lemma P5 (a:ف) (n:ػ) (E:ٴ) (u:ػ) (b:2^63<=n˧) (e:(u˧:ٴ)=E+189) (d:u˧<=253) : YZ a u n=YA a n E:=by have f:=Nat.pos_iff_ne_zero.mp (Ag (Δ 63) b);have g:n≠0:=λ h=>f (by rw[h];rfl);have j:n˧܀=63:=(Af f).mpr ⟨b,n܉⟩;have k:Yj n=63:=σ.mp (by rw[Zj n g,j];rfl);have:=P6 a n E u g (by rw[j];push_cast;omega) d;rw[k,show n<<<(63-63:ػ)=n from σ.mp (by rw[ό];simp only[UInt64.reduceSub];exact ν n܉)]at this exact this lemma Zb9 (e:ٴ) (c:ػ) (b:c˧<2^62) (h:(ϱ e).toInt=e) (a:((ϱ e).toUInt64+c)˧<=253) : (((ϱ e).toUInt64+c)˧:ٴ)=e+c˧:=by have d:=Int64.toInt_lt (ϱ e);have f:=Int64.le_toInt (ϱ e);have g:((ϱ e).toUInt64˧:ٴ)=e%2^64:=by simp;exact Cj (Int.emod_nonneg _ ד) rw[ξ]at a⊢;omega def Y0 (e:ٴ) (ok:ف) (B:ػ):Prop:= ∀ c:ػ,cپ<2^62 -> ok=true -> (B+c).toNat<=253 -> ((B+c).toNat:ٴ)=e+cپ lemma P4 (e:ٴ):Y0 e ((ϱ e).toInt==e) (ϱ e).toUInt64:=λ c a b d=>Zb9 e c a (beq_iff_eq.1 b) d @[inline] def Yau (neg:ف) (m:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= let L:=Yj m;let u:=b+L+126;if ok&&u<=253 then YZ neg u (m<<<(63-L)) else Ybn neg m e lemma P3 (a:ف) (m:ػ) (e:ٴ) (d:ف) (B:ػ) (b:m≠0) (f:Y0 e d B):Yau a m e d B=YA a m e:=by have k:m˧≠0:=λ h=>b (σ.mp (by simpa using h));have l:=Zj m b;have q:=(Ϻ k).mpr m܉;unfold Yau Ybn;dsimp only;split;swap;rfl rename_i h;simp at h;obtain⟨n,g⟩:=h;have o:(Yj m+126)˧=m˧܀+126:=by rw[ξ,l];simp;omega rw[CY]at g⊢;have j:(B+(Yj m+126))˧<=253:=by simpa using ϐ.mp g have p:=f _ (by rw[o];omega) n j;exact P6 a m e _ b (by rw[p];omega) j @[inline] def YaP (w:ػ) (e:ٴ) (negZero ok:ف) (B:ػ):ؼ:= if w=0 then (if negZero then ߾ else 0) else let neg:=w>>>63 != 0;Yau neg (if neg then 0-w else w) e ok B lemma L6 (w:ػ) (e:ٴ) (a b:ف) (B:ػ) (d:Y0 e b B):YaP w e a b B=ρ (Ym w) e a:=by unfold YaP ρ;by_cases f:w=0;subst f;simp[Ym];have r:w˧≠0:=λh=>f (σ.mp (by simpa using h));have s:=w܉;obtain⟨k,l,n⟩:(w>>>63 !=0)=decide (Ym w<0)/\(if (w>>>63 !=0)=true then 0-w else w)˧=(Ym w).natAbs/\Ym w≠0:=by by_cases h:w˧<2^63;rw[(by unfold Ym;omega:Ym w=(w˧:ٴ)),(by simp;apply σ.mp;simp;omega:(w>>>63 !=0)=false)];simp only[φ,ש,Int.natAbs_natCast];refine⟨ג,trivial,א⟩;rw[(by unfold Ym;simp only[h,ש]:Ym w=(w˧:ٴ)-2^64),(by simp;intro e;have:=congrArg Er e;simp at this;omega:(w>>>63 !=0)=true)];simp only[ר,(by rw[Τ];simp;omega:(0-w)˧=2^64-w˧)];refine⟨ו,א,א⟩ simp only[f,ש,n];rw[<-AV];have j:(if (w>>>63 !=0)=true then 0-w else w)≠0:=ז;rw[P3 _ _ _ _ _ j d,ZU _ _ _ j,l,k];rfl lemma Zcb (V s:ٳ) (h:s+25<=V܀):(AR V s)܀=V܀-s:=by have d:V≠0:=by intro e;subst e;simp at h have f:=ϰ d;have g:V<2^(V܀+1):=Ak;have a:2^(V܀-s)<=V/2^s:=by rw[Am (Δ _),<-Κ,(א:V܀-s+s=V܀)];exact f have b:V/2^s<2^(V܀-s+1):=by rw[An (Δ _),<-Κ,(א:V܀-s+1+s=V܀+1)];exact g unfold AR;simp only;split . exact(Af א).mpr ⟨a,b⟩ . rw[Bu];split . rename_i _ j;apply(Af א).mpr;omega . exact(Af א).mpr ⟨a,b⟩ lemma P0 (b:ف) (V s:ٳ) (e:ٴ) (h:s+25<=V܀):AT κ ⟨b,AR V s,e+s⟩=AT κ ⟨b,V,e⟩:=by have d:V≠0:=by intro j;subst j;simp at h have k:2^s<=V:=Cp (Ι ב א) (ϰ d);have l:=DC V s k;have n:=Zcb V s h;unfold AT;simp only[show(AR V s==0)=false by simpa using l,show(V==0)=false by simpa using d,φ,ש,n];rw[(א:((V܀-s:ٳ):ٴ)+(e+s)=V܀+e)];split;rfl;split;rename_i _ f;have t:ض= -149:=rfl;have u:(V܀:ٴ)+e< -126:=lt_of_lt_of_eq f rfl;obtain⟨a,g⟩:∃a:ٳ,e-ض=CJ a/\s+2<=a+1:=by refine⟨(-(e+149)-1)׆,?_,א⟩;omega rw[g.1,(א:e+(s:ٴ)-ض=CJ (a-s))];simp only;rw[(א:a-s+1=a+1-s),Bh V s (a+1) g.2];rename_i _ f;have q:κ߷<=V܀-s:=by rw[show κ߷=23 from rfl];omega simp only[q,(א:κ߷<=V܀),ר];rw[show κ߷=23 from rfl,(א:V܀-s-23=V܀-23-s),Bh V s (V܀-23) א] lemma Z9 (b a d:ػ) (L:ٳ) (e:d˧=L) (g:L<=63) (f:b˧<2^(L+1)):((b<<<(63-d))|||((a>>>d)>>>1))˧=(b˧*2^64+a˧)/2^(L+1) /\ ((a<<<(63-d)) != 0)=decide ((b˧*2^64+a˧)%2^(L+1)≠0):=by have j:(63-d)˧=63-L:=by rw[Η _ _ (by rw[ϐ,e];simp;omega),e];rfl have h:(2:ٳ)^64=2^(63-L)*2^(L+1):=by rw[<-Κ];congr 1;omega refine⟨by rw[Du,(by rw[ό,j,ν (א:63-L<64),Α,ν];rw[h,Θ (2^_)];exact Aj f (Δ _):(b<<<(63-d))˧=b˧*2^(63-L)),(by rw[Ξ,Ξ,e,ν (א:L<64)];simp only[Bc,BY,ψ,ϧ,<-Nat.pow_succ]:((a>>>d)>>>1)˧=a˧/2^(L+1)),(by rw[h,<-ϣ,Ϟ,ϔ _ _ (Δ _),Ϟ]:(b˧*2^64+a˧)/2^(L+1)=b˧*2^(63-L)+a˧/2^(L+1)),<-Α,<-Bq (by rw[An (Δ _),<-h];exact a܉:a˧/2^(L+1)<2^(63-L))],?_⟩;rw[h,<-ϣ,Nat.mul_add_mod_self_right,AB];simp[<-σ,(by rw[ό,j,ν (א:63-L<64),Α,h,Θ (2^(63-L)),Nat.mul_mod_mul_right]:(a<<<(63-d))˧=a˧%2^(L+1)*2^(63-L))] @[inline] def Yav (w0:ػ):ػ:= ~~~w0+1 @[inline] def Yaw (w1 w0:ػ):ػ:= ~~~w1+(if w0==0 then 1 else 0) @[inline] def Yax (w2 w1 w0:ػ):ػ:= ~~~w2+(if w1==0&&w0==0 then 1 else 0) lemma Zcc (d b a:ػ) (h:d˧*2^128+b˧*2^64+a˧≠0):(Yax d b a)˧*2^128+(Yaw b a)˧*2^64+(Yav a)˧=2^192-(d˧*2^128+b˧*2^64+a˧):=by have n:=d܉;have o:=b܉;have p:=a܉;unfold Yax Yaw Yav;by_cases e:a=0;have f:a˧=0:=ח;by_cases l:b=0;have g:b˧=0:=ז;simp only[e,l,DW]at*;simp at*;omega;have j:(b==0)=false:=ז;have g:b˧≠0:=λh=>l (σ.mp (by rw[h];rfl));simp only[e,j,beq_self_eq_true,Bool.false_and,φ,ש,ר,ξ,CZ]at*;simp at*;omega;have k:(a==0)=false:=ז;have f:a˧≠0:=λh=>e (σ.mp (by rw[h];rfl));simp only[k,EL,φ,ש,ξ,CZ]at*;simp at*;omega @[inline] def Yaf (neg:ف) (m2 m1 m0:ػ) (e:ٴ):ؼ:= let L:=Yj m2;let x:=(m2<<<(63-L))|||((m1>>>L)>>>1);let st:=(m1<<<(63-L)) != 0||m0 != 0;YA neg (if st then x|||1 else x) (e+((Lپ+65:ٳ):ٴ)) @[inline] def Yag (neg:ف) (m1 m0:ػ) (e:ٴ):ؼ:= let L:=Yj m1;let x:=(m1<<<(63-L))|||((m0>>>L)>>>1);let st:=(m0<<<(63-L)) != 0;YA neg (if st then x|||1 else x) (e+((Lپ+1:ٳ):ٴ)) @[inline] def Yay (neg:ف) (m2 m1 m0:ػ) (e:ٴ):ؼ:= if m2 != 0 then Yaf neg m2 m1 m0 e else if m1 != 0 then Yag neg m1 m0 e else YA neg m0 e lemma O9 (x:ػ) (a:ف) (Q R:ٳ) (b:x˧=Q) (d:a=decide (R≠0)) (e:2<=Q):(if a then x|||1 else x)˧=(if R==0 then Q else Q|||1):=by subst b d;by_cases f:R=0;simp[f];simp[f] lemma QF (m:ػ) (h:m≠0):m˧܀<=63/\m˧<2^(m˧܀+1)/\2^m˧܀<=m˧:=by have a:m˧≠0:=λ b=>h (σ.1 b);exact⟨CI ((Ϻ a).2 m܉),Ak,ϰ a⟩ lemma QH (m r K:ٳ) (a:2^K<=m):2<=(m*2^64+r)/2^(K+1):=by rw[Am (Δ _)];calc 2*2^(K+1)=2^K*2^2:=by rw[<-Κ,<-Nat.pow_succ'] _<=m*2^64:=Ar a (Ι ב ב) _<=_:=ώ _ _ lemma QL (m:ػ) (s r:ٳ) (h:m≠0) (a:r<2^s):(m˧*2^s+r)܀=s+m˧܀:=by have b:m˧≠0:=λ d=>h (σ.mp (by rw[d];rfl)) have e:=@Ak m˧;apply(Af (Nat.ne_of_gt (Ag (ϊ (Ο b) (Δ s)) (ώ _ _)))).mpr;constructor . rw[Κ,Θ];exact(ω _ (ϰ b)).trans (ώ _ _) . calc m˧*2^s+r<(m˧+1)*2^s:=by rw[Dp];omega _<=2^(m˧܀+1)*2^s:=ω _ e _=2^(s+m˧܀+1):=by rw[<-Κ];ring_nf lemma QN (x:ػ) (a:ف) (Q R:ٳ) (b:(if a then x|||1 else x)˧=(if R==0 then Q else Q|||1)) (d:2<=Q):(if a then x|||1 else x)≠0:=by intro h;have e:=congrArg Er h;rw[b,Ϝ]at e;split at e;omega;rw[Bu]at e;split at e<;>omega lemma Zcd (b:ف) (a d:ػ) (e:ٴ) (f:a≠0):Yag b a d e=π (AT κ ⟨b,a˧*2^64+d˧,e⟩):=by have s:=a܉;have p:=d܉;unfold Yag;have c:=Zj a f;obtain⟨g,h,j⟩:=QF a f;generalize q:a˧܀=K at c g h j;obtain⟨k,l⟩:=Z9 a d (Yj a) K c g h;generalize Yj a=L at c k l⊢;have n:=QH _ d˧ K j;have o:=O9 _ _ _ _ k l n;rw[ZU _ _ _ (QN _ _ _ _ o n),o,c];have r:=QL a 64 _ f p;rw[q]at r;have:=P0 b (a˧*2^64+d˧) (K+1) e א;unfold AR at this;rw[this] lemma Zce (f:ف) (a d b:ػ) (e:ٴ) (g:a≠0):Yaf f a d b e=π (AT κ ⟨f,a˧*2^128+d˧*2^64+b˧,e⟩):=by have u:=d܉;have v:=b܉;unfold Yaf;have c:=Zj a g;obtain⟨n,o,p⟩:=QF a g;generalize w:a˧܀=K at c n o p;obtain⟨h,k⟩:=Z9 a d (Yj a) K c n o;generalize Yj a=L at c h k ⊢;obtain⟨A,l⟩:∃ A,a˧*2^64+d˧=A:=⟨_,rfl⟩;rw[l]at h k;have x:=(϶ A (2^(K+1))).symm;have y:A%2^(K+1)<2^(K+1):=Ε _ (Δ _);have q:(2:ٳ)^(K+65)=2^(K+1)*2^64:=ז;have r:a˧*2^128+d˧*2^64+b˧=(A%2^(K+1)*2^64+b˧)+A/2^(K+1)*2^(K+65):=by have:a˧*2^128+d˧*2^64=A*2^64:=by rw[<- l];ring rw[this,q];conv_lhs=>rw[x] ring have s:A%2^(K+1)*2^64+b˧<2^(K+65):=by rw[q];exact Ag א (ω _ y) have z:(a˧*2^128+d˧*2^64+b˧)/2^(K+65)=A/2^(K+1):=by rw[r,ϔ _ _ (Δ _),Υ s,Β] have B:(a˧*2^128+d˧*2^64+b˧)%2^(K+65)=A%2^(K+1)*2^64+b˧:=by rw[r,ϲ,ν s] have C:((d<<<(63-L) != 0)||(b != 0))=decide ((a˧*2^128+d˧*2^64+b˧)%2^(K+65)≠0):=by rw[k,B,show(b != 0)=decide (b˧≠0) from AB.2 (by simp[← σ])];simp have j:=QH _ d˧ K p;rw[l]at j;rw[<- z]at h j;have t:=O9 _ _ _ _ h C j;rw[ZU _ _ _ (QN _ _ _ _ t j),t,c];have D:=QL a 128 (d˧*2^64+b˧) g (by clear * - v u;omega);rw[<- BU,w]at D;have:=P0 f (a˧*2^128+d˧*2^64+b˧) (K+65) e א;unfold AR at this;rw[this] lemma O8 (a:ف) (d b f:ػ) (e:ٴ) (g:d˧*2^128+b˧*2^64+f˧≠0) : Yay a d b f e=π (AT κ ⟨a,d˧*2^128+b˧*2^64+f˧,e⟩):=by unfold Yay;by_cases j:d=0 . subst j;simp only[Ϝ,ϸ,Β]at g⊢;by_cases k:b=0 . subst k;simp at g⊢;exact ZU a f e (λ h=>g (by rw[h];rfl)) . simp only[show(b !=0)=true by simpa using k,ר];exact Zcd a b f e k . simp only[show(d !=0)=true by simpa using j,ר];exact Zce a d b f e j lemma ZaP (a d b:ػ) (L:ٳ) (f:b˧=L) (g:L<=63) (h:a˧<2^(L+1)) (j:2^L<=a˧) (e:ف) : 2^63<=(if e then ((a<<<(63-b))|||((d>>>b)>>>1))|||1 else (a<<<(63-b))|||((d>>>b)>>>1))˧:=by obtain⟨k,-⟩:=Z9 a d b L f g h;have l:2^63<=(a˧*2^64+d˧)/2^(L+1):=by rw[Am (Δ _)];calc 2^63*2^(L+1)=2^L*2^64:=by rw[<-Κ,<-Κ,(א:63+(L+1)=L+64)] _<=a˧*2^64:=ω _ j _<=_:=ώ _ _ cases e . simp only[φ,ש];rw[k];exact l . simp only[ר];rw[Du,k,show(1:ػ)˧=1 from rfl,Bu];split<;>omega @[inline] def YaR (neg:ف) (m1 m0:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= let L:=Yj m1;let x:=(m1<<<(63-L))|||((m0>>>L)>>>1);let st:=(m0<<<(63-L)) != 0;let x':=if st then x|||1 else x;let u:=b+L+190;if ok&&u<=253 then YZ neg u x' else Yat neg x' e L 1 lemma K5 (a b:ػ) (h:a≠0):(Yj a)˧=a˧܀/\a˧܀<=63/\∀ g:ف,2^63<=(if g then ((a<<<(63-Yj a))|||((b>>>Yj a)>>>1))|||1 else (a<<<(63-Yj a))|||((b>>>Yj a)>>>1))˧:=by have d:a˧≠0:=λ e=>h (σ.1 e);have f:a˧܀<=63:=CI ((Ϻ d).2 a܉);exact⟨Zj a h,f,ZaP a b (Yj a) _ (Zj a h) f Ak (ϰ d)⟩ lemma X9 (a:ف) (b d:ػ) (e:ٴ) (f:ف) (B:ػ) (g:b≠0) (j:Y0 e f B):YaR a b d e f B=Yag a b d e:=by obtain⟨c,o,k⟩:=K5 b d g;generalize b˧܀=K at c o;unfold YaR Yag Yat;dsimp only;generalize Yj b=L at c k⊢;split;rename_i h;simp at h;obtain⟨p,l⟩:=h;have q:(L+190)˧=K+190:=by rw[ξ,c];simp;omega rw[CY]at l⊢;have n:(B+(L+190))˧<=253:=by simpa using ϐ.mp l exact P5 a _ _ _ (k _) (by rw[j _ (by rw[q];omega) p n];push_cast;omega) n;rfl @[inline] def YaS (neg:ف) (m2 m1 m0:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= let L:=Yj m2;let x:=(m2<<<(63-L))|||((m1>>>L)>>>1);let st:=(m1<<<(63-L)) != 0||m0 != 0;let x':=if st then x|||1 else x;let u:=b+L+254;if ok&&u<=253 then YZ neg u x' else Yat neg x' e L 65 lemma X8 (a:ف) (b d f:ػ) (e:ٴ) (g:ف) (B:ػ) (j:b≠0) (k:Y0 e g B):YaS a b d f e g B=Yaf a b d f e:=by obtain⟨c,p,l⟩:=K5 b d j;generalize b˧܀=K at c p;unfold YaS Yaf Yat;dsimp only;generalize Yj b=L at c l⊢;split . rename_i h;simp at h;obtain⟨q,n⟩:=h;have r:(L+254)˧=K+254:=by rw[ξ,c];simp;omega rw[CY]at n⊢;have o:(B+(L+254))˧<=253:=by simpa using ϐ.mp n have s:=k _ (by rw[r];omega) q o;exact P5 a _ _ _ (l _) (by rw[s];push_cast;omega) o . rfl @[inline] def Yaz (neg:ف) (m2 m1 m0:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= if m2 != 0 then YaS neg m2 m1 m0 e ok b else if m1 != 0 then YaR neg m1 m0 e ok b else Yau neg m0 e ok b lemma O7 (a:ف) (d b f:ػ) (e:ٴ) (g:ف) (B:ػ) (k:d˧*2^128+b˧*2^64+f˧≠0) (j:Y0 e g B) : Yaz a d b f e g B=Yay a d b f e:=by unfold Yaz Yay;by_cases l:d=0;subst l;by_cases n:b=0;subst n;exact P3 a f e g B (λh=>k (by rw[h];rfl)) j;simp only[show(b !=0)=true by simpa using n,ר];exact X9 a b f e g B n j;simp only[show(d !=0)=true by simpa using l,ר];exact X8 a d b f e g B l j @[inline] def YaT (w2 w1 w0:ػ) (e:ٴ) (negZero ok:ف) (B:ػ):ؼ:= if w2=0/\w1=0/\w0=0 then (if negZero then ߾ else 0) else if w2>>>63 != 0 then Yaz true (Yax w2 w1 w0) (Yaw w1 w0) (Yav w0) e ok B else Yaz false w2 w1 w0 e ok B lemma L5 (b d f:ػ) (e:ٴ) (a g:ف) (B:ػ) (j:Y0 e g B):YaT b d f e a g B=ρ (YC b d f) e a:=by have o:b˧*2^128+d˧*2^64+f˧<2^192:=by have:=b܉;have:=d܉;have:=f܉;omega unfold YaT;by_cases l:b=0/\d=0/\f=0 . obtain⟨rfl,rfl,rfl⟩:=l;simp[YC,ρ] have k:b˧*2^128+d˧*2^64+f˧≠0:=λ h=>l (by simp only[<-σ,Ϝ];omega) rw[ite_eq_right l];by_cases p:b˧<2^63 . rw[ite_eq_right (by simp[<-σ];omega:¬(b>>>63 !=0)=true),O7 _ _ _ _ _ _ _ k j,O8 _ _ _ _ _ k,AV,<-F9 _ _ _ a k,YC,ite_eq_left p,Int.sub_zero];rfl . generalize q:b˧*2^128+d˧*2^64+f˧=N at o;have n:=Zcc b d f k;rw[q]at n;have r:=n▸Nat.sub_ne_zero_of_lt o;rw[ite_eq_left (by simp[<-σ];omega:(b>>>63 !=0)=true),O7 _ _ _ _ _ _ _ r j,O8 _ _ _ _ _ r,n,AV,<-F9 _ _ _ a א,YC,q,ite_eq_right p,(א:(N:ٴ)-2^192=-((2^192-N:ٳ):ٴ)),ite_eq_left rfl] @[inline] def YauT (neg:ف) (m:ػ) (e:Unit -> ٴ) (ok:ف) (b:ػ):ؼ:= let L:=Yj m;let u:=b+L+126;if ok&&u<=253 then YZ neg u (m<<<(63-L)) else Ybn neg m (e ()) @[inline] def YaPT (w:ػ) (e:Unit -> ٴ) (negZero ok:ف) (B:ػ):ؼ:= if w=0 then (if negZero then ߾ else 0) else let neg:=w>>>63 != 0;YauT neg (if neg then 0-w else w) e ok B lemma C4 (w:ػ) (e:ٴ) (a b:ف) (B:ػ):YaPT w (λ _=>e) a b B=YaP w e a b B:=rfl def Ybo (w2 w1 w0:ػ) (e:ٴ) (negZero:ف):ؼ:= YaT w2 w1 w0 e negZero ((ϱ e).toInt==e) (ϱ e).toUInt64 lemma X7 (b d f:ػ) (e:ٴ) (a:ف):Ybo b d f e a=ρ (YC b d f) e a:= L5 b d f e a _ _ (P4 e) @[inline] def Yf (w:ؼ):ػ:= if θ w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 @[inline] def Yd (w:ؼ):ػ:= if θ w=0 then 0 else (θ w).toUInt64-1 lemma Zk (w:ؼ):(Yf w)˧=ε w:=by have:=fracOf_toNat_lt w;unfold Yf ε;split_ifs;simp;simp only[ξ];show((fracOf w)؎+ރ)%2^64=2^23+(fracOf w)؎;omega lemma Zf (w:ؼ):(Yd w)˧=γ w:=by unfold Yd γ;split_ifs with h . rfl . have b:1<=(θ w)؎:=by rcases Ae (θ w)؎with a|a . exact absurd (ύ.mp (by simpa using a)) h . exact a rw[Η _ _ (by rw[ϐ];simp;omega)];simp lemma Zc (a b:ؾ) (h:a؛+b؛<Λ):(a+b)؛=a؛+b؛:=ν h lemma A4 (A:ؽ δ) (a n k:ؾ) (b:a؛+n؛<=Aٽ) (d:a؛+n؛<Λ) (h:k>>1)>>>(63-r))˧=m˧/2^(64-r˧):=by rw[Ξ,Ξ,X6 r a,ψ,ψ,ν (Nat.sub_lt_succ 63 _),show(1:ػ)˧%64=1 from rfl,ϧ,<-Κ];congr 2;omega lemma G8 (m r:ٳ) (a:r<64):m*2^r%2^64+m/2^(64-r)*2^64=m*2^r:=by rw[<-show m*2^r/2^64=m/2^(64-r) by rw[show(2:ٳ)^64=2^r*2^(64-r) by rw[<-Κ,Ej a.le],<-ϧ,Nat.mul_div_cancel _ (Δ r)]];exact Nat.mod_add_div' _ _ lemma X5 (m s:ػ) (a:s˧<64):((m>>>1)>>>(63-(s&&&63)))˧*2^64+(m<<<(s&&&63))˧ =m˧*2^s˧:=by have b:(s&&&63)˧=s˧:=by rw[H0];exact ν a rw[C0 _ _ א,G9 _ _ א,b];have:=G8 m˧ s˧ a;omega lemma X4 (m s:ػ) (a:64<=s˧) (b:s˧<128):((m>>>1)>>>(63-(s&&&63)))˧*2^128+(m<<<(s&&&63))˧*2^64 =m˧*2^s˧:=by have d:(s&&&63)˧=s˧-64:=by rw[H0];omega rw[C0 _ _ א,G9 _ _ א,d];have:=G8 m˧ (s˧-64) א;have:m˧*2^s˧=m˧*2^(s˧-64)*2^64:=by rw[ϣ,<-Κ,Aw a] omega lemma X3 (m s:ػ) (a:s˧<128):(if s<64 then (0:ػ) else (m>>>1)>>>(63-(s&&&63)))˧*2^128 + (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˧*2^64 + (if s<64 then m<<<(s&&&63) else 0)˧=m˧*2^s˧:=by by_cases h:s<64;rw[if_pos h,if_pos h,if_pos h,Ϝ,ϸ,Β];exact X5 m s (Ψ.1 h);rw[if_neg h,if_neg h,if_neg h,Ϝ,ϑ];exact X4 m s (DZ.1 (Ψ.not.1 h)) a lemma G7 (y a:ػ) (h:a˧<=1):(y^^^(0-a))˧=if a˧=1 then 2^64-1-y˧ else y˧:=by rcases Ay.mp h with b|d;obtain rfl:a=0:=σ.mp (by simpa using b);simp;obtain rfl:a=1:=σ.mp (by simpa using d);show(y.toBitVec^^^BitVec.allOnes 64).toNat=_;rw[BitVec.xor_allOnes,BitVec.toNat_not];simp lemma ZJ (a b:ػ):(a+b)˧=(a˧+b˧)%2^64 /\ (if a+brw[Ψ,d]at h;show 1=_;omega;show 0=_;omega lemma X2 (f a d g b e:ػ):(f+g+((if a+bomega lemma L3 (a b d:ػ):((a|||b|||d)==0)=decide (d˧*2^128+b˧*2^64+a˧=0):=by rw[AB,beq_iff_eq,ة,DA,DA,<-σ,<-σ,<-σ,Ϝ];omega lemma D4 (a b:ؼ):((a^^^b)>>>31)܅˧=if Ζ (η a) (η b) then 1 else 0:=by have d:∀a:ؼ,η a=decide (a؎/2^31=1):=λa=>by have:=a.toNat_lt;unfold η;have j:(a؎&&&2^31)%2^31=0:=by rw[Nat.and_mod_two_pow,Nat.mod_self,Nat.and_zero] have k:(a؎&&&2^31)/2^31=a؎/2^31%2:=by rw[Nat.and_div_two_pow,Nat.div_self (Δ 31),Nat.and_one_is_mod] rw[(by rw[AB,bne_iff_ne,ة,ne_eq,ne_eq,<-ύ];simp:(a&&&߾!=0)=decide ((a&&&߾)؎≠0)),(ג:(a&&&߾)؎=a؎&&&2^31),AB,ة,ة];omega rw[AG,Ϣ,UInt32.toNat_xor,show(31:ؼ)؎%32=31 from rfl,Nat.shiftRight_xor_distrib,ψ,ψ,d,d];have:=a.toNat_lt;have:=b.toNat_lt;rcases Ay.mp (א:aپ/2^31<=1)with h|h<;>rcases Ay.mp (א:bپ/2^31<=1)with e|e<;>rw[h,e]<;>decide @[inline] def YL {β:Type} (lo:ػ) (a b:ؼ) (w2 w1 w0 c:ػ) (kont:ػ -> ػ -> ػ -> ػ -> β):β:= let m:=Yf a*Yf b;let s:=Yd a+Yd b-lo;let rr:=s&&&63;let x0:=m<<>>1)>>>(63-rr);let lowq:=s<64;let y0:=if lowq then x0 else 0;let y1:=if lowq then x1 else x0;let y2:=if lowq then 0 else x1;let ng:=((a^^^b)>>>31).toUInt64;let mk:ػ:=0-ng;let s0:=w0+(y0^^^mk);let k0:ػ:=if s0>>1)>>>(63-(s&&&63)))˧*2^128 + (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˧*2^64 + (if s<64 then m<<<(s&&&63) else 0)˧=0:=by have b:m=0:=σ.mp (by simpa using a);subst b;split_ifs<;>simp lemma Zg (w:ؼ):γ w<=254:=by have:=expOf_toNat_lt w;unfold γ;split_ifs<;>omega lemma ZK (a b:ؼ):ε a*ε b<2^48:=calc ε a*ε b<2^24*2^24:=BP (Ϛ a) (Ϛ b) lemma K4 (a b:δ):(Yf a*Yf b)˧=ε a*ε b:=by rw[ϯ,Zk,Zk];exact ν (by have:=ZK a b;omega) lemma B6 (a b:δ):(Yd a+Yd b)˧=γ a+γ b:=by have:=Zg a;have:=Zg b;rw[ξ,Zf,Zf,ν א] lemma K2 (a b:δ):Yf a*Yf b=0↔ε a*ε b=0:=by rw[<-K4,<-σ];rfl lemma E7 (w:δ):(Yf w==0)=decide (ε w=0):=by rw[AB,beq_iff_eq,ة,<-Zk,<-σ];rfl lemma Zr {β:Type} (d:ػ) (a b:ؼ) (f g h c:ػ) (e:ػ -> ػ -> ػ -> ػ -> β) (j:c˧+1<2^64) (k:ε a*ε b≠0 -> d˧<=γ a+γ b/\γ a+γ b>>31)܅˧<=1:=by rw[p];split<;>decide refine⟨_,_,_,_,rfl,?_,?_⟩;all_goals generalize Yf a*Yf b=m,F:Yd a+Yd b-d=s,((a^^^b)>>>31)܅=l at r p n⊢ . rw[ξ];exact(DY _ _).trans (Ϯ n _) have o:(if s<64 then (0:ػ)else (m>>>1)>>>(63-(s&&&63)))˧*2^128+(if s<64 then (m>>>1)>>>(63-(s&&&63))else m<<<(s&&&63))˧*2^64+(if s<64 then m<<<(s&&&63)else 0)˧=ε a*ε b*2^(γ a+γ b-d˧):=by by_cases t:ε a*ε b=0;rw[t,ϸ];exact X0 m s (by rw[r,t]);obtain⟨A,G⟩:=k t;have B:s˧=γ a+γ b-d˧:=(by rw[<-F,Η _ _ (by rwa[ϐ,B6]),B6]);rw[<-r,<-B];exact X3 m s (B▸Bz A G) generalize (if s<64 then (0:ػ)else (m>>>1)>>>(63-(s&&&63)))=u,(if s<64 then (m>>>1)>>>(63-(s&&&63))else m<<<(s&&&63))=v,(if s<64 then m<<<(s&&&63)else 0)=w at o⊢;unfold Yx;rw[X2,ξ,ν (a:=c˧+l˧) ((Ϯ n _).trans_lt j),<-Zn];generalize K:ε a*ε b*2^(γ a+γ b-d˧)=P at o;rw[(by rw[<-K];split_ifs<;>push_cast<;>ring:(if Ζ (η a) (η b)then-((ε a*ε b:ٳ):ٴ)else ((ε a*ε b:ٳ):ٴ))*2^(γ a+γ b-d˧)=if Ζ (η a) (η b)then-(P:ٴ)else P)];clear* -p n o;have C:=G7 u l n;have D:=G7 v l n;have E:=G7 w l n;have H:=u܉;have I:=v܉;have J:=w܉;push_cast;rw[Int.emod_add_emod];conv_rhs=>rw[<-CA _ _ (l˧:ٴ)] exact congrArg (·%_) (by linear_combination (by subst o;split_ifs at p C D E⊢<;>omega:((u^^^(0-l))˧*2^128+(v^^^(0-l))˧*2^64+(w^^^(0-l))˧+l˧:ٴ)=(if Ζ (η a) (η b)then-(P:ٴ)else P)+2^192*l˧)) @[inline] def YD (w2 w1 w0 c:ػ) (e:ٴ):ػ:= let t0:=w0+c;let k0:ػ:=if t0>>23).toNat def YM (a:ؼ):ٳ:=((a&&&ק)>>>23).toNat lemma W9 (a:ؼ):(a&&&ק)؎=(θ a)؎*2^23+(fracOf a)؎:=by simp only[AH,θ,fracOf,Ϣ];rw[show(ק:ؼ)؎=2^31-1 from rfl,show(0xFF:ؼ)؎=2^8-1 from rfl,show(0x7FFFFF:ؼ)؎=2^23-1 from rfl,show(23:ؼ)؎%32=23 from rfl,ϡ,ϡ,ϡ,ψ];omega lemma Zb (a:ؼ):YR a<=511/\YM a<=255/\(YM a<255 -> θ a≠255) /\ (ε a≠0 -> YR a<=γ a+1/\γ a+1<=max (YM a) 1):=by have e:=expOf_toNat_lt a;have f:=fracOf_toNat_lt a;unfold YR YM ε γ;simp only[Ϣ,CX,CD,BY,ψ,W9,ne_eq,<-ύ];rw[Ϟ _ (fracOf a)؎,ϔ _ _ (Δ _),Υ f,Β];generalize (θ a)؎=E at*;generalize (fracOf a)؎=F at*;have K:(2^32-1+(F+E*2^23))%2^32/2^23<=E∨E=0∧F=0:=א;refine⟨CI (ϕ (Ε _ ד)),CI e,Nat.ne_of_lt,λ d=>?_⟩;by_cases b:E=0 . rw[if_pos b]at d⊢;exact⟨(K.resolve_right λ h=>d h.2).trans (Nat.le_succ_of_le b.le),Nat.le_max_right _ _⟩ . rw[if_neg b]at d⊢;rw[Aw (Ο b)];exact⟨K.resolve_right λ h=>b h.1,Nat.le_max_left _ _⟩ def Yah (A:ؽ δ) (base n:ؾ) (hA:baseپ+nپ<=Aٽ) (hs:baseپ+nپ<Λ) (lo hi:ؼ) (k:ؾ):ؼ:= if h:k>>23)<<<16)+(hi>>>23) termination_by nپ-kپ decreasing_by exact ZI n k h lemma W8 (A:ؽ δ) (a n:ؾ) (h:a؛+n؛<=Aٽ) (f:a؛+n؛<Λ) (b e:ؼ) (k:ؾ) (j:k؛<=n؛) (g:e؎<2^31) : ∃ L H:ٳ,(Yah A a n h f b e k)؎=L*2^16+H/\L<=511/\H<=255 /\ L<=b؎/2^23/\e؎/2^23<=H /\ ∀ t,k؛<=t -> t L<=YR A[a؛+t]! /\ YM A[a؛+t]! <= H:=by generalize E:n؛-k؛=d;induction d generalizing k b e with |zero=> rw[Yah,dif_neg (mt υ.1 א)];have:=b.toNat_lt;refine⟨b؎/2^23,e؎/2^23,?_,א,א,le_rfl,le_rfl,λ t o p=>א⟩;simp only[UInt32.toNat_add,Dk,Ϣ,CD,BY];omega |succ d u=> have q:komega) א;have r:L<=b؎/2^23∧L<=YR w:=by split_ifs at y with l<;>rw[Dl]at l<;>omega have s:e؎/2^23<=H∧YM w<=H:=by split_ifs at z with l<;>rw[Dl]at l<;>omega refine⟨L,H,o,p,x,r.1,s.1,λ t K C=>?_⟩;obtain rfl|D:t=kپ∨(k+1)؛<=t:=א;rw[v];exact⟨r.2,s.2⟩;exact B t D C def YS (X W:ؽ δ) (xa wa n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW:waپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw:waپ+nپ<Λ) (lo:ػ) (e:ٴ) (bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if h:kYS X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL lo ζ bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nپ-kپ decreasing_by exact ZI n k h lemma ZL (a b:ؼ) (d:ٳ) (h:ε a*ε b≠0 -> d<=γ a+γ b/\γ a+γ b<=d+122) : -(2^170:ٴ)<=sv a*sv b*2^(γ a+γ b-d) /\ sv a*sv b*2^(γ a+γ b-d)<=2^170:=by rw[<-Zn];have g:=ZK a b;by_cases e:ε a*ε b=0 . rw[e];split_ifs<;>simp . obtain⟨j,k⟩:=h e;have f:2^(γ a+γ b-d)<=2^122:=Ι ב א;have l:ε a*ε b*2^(γ a+γ b-d)<=2^170:=calc ε a*ε b*2^(γ a+γ b-d)<=2^48*2^122:=Ar א f _=2^170:=ב have c:((ε a*ε b:ٳ):ٴ)*2^(γ a+γ b-d)=((ε a*ε b*2^(γ a+γ b-d):ٳ):ٴ):=by push_cast;ring split_ifs . rw[neg_mul,c];omega . rw[c];omega lemma ZW (a b:ٳ -> ؼ):∀ r k,Yo a b k (r+1)=Yo a b k r+sv (a (k+r))*sv (b (k+r))*2^(γ (a (k+r))+γ (b (k+r))):=by intro r;induction r;simp[Yo];next r d=>intro k;rw[Yo,d (k+1),Yo,BU k 1 r,Ϟ 1 r];ring lemma ZA (a b:ؼ) (d:ٳ) (h:ε a*ε b≠0 -> d<=γ a+γ b):sv a*sv b*2^(γ a+γ b)=2^d*(sv a*sv b*2^(γ a+γ b-d)):=by by_cases e:ε a*ε b=0 . have:sv a*sv b=0:=by rw[<-Zn,e];split_ifs<;>simp rw[this];ring rw[(א:idxOf a+idxOf b=d+(idxOf a+idxOf b-d)),pow_add];rw[(א:d+(idxOf a+idxOf b-d)-d=idxOf a+idxOf b-d)];ring @[inline] def Yc (A:ؽ δ) (inW i:ٳ):ؼ:= if h:i*inW+inW<=Aٽ/\i*inW+inW<=ހ then Yah A (i*inW).toUSize inWٿ (by rw [Za _ א,Za _ א];exact h.1) (by rw [Za _ א,Za _ א];have:=τ;omega) 0xFFFFFFFF 0 0 else 0x01FF00FF @[inline] def Yk (k:ؼ):ػ:=(if k=0 then 0 else k-1).toUInt64 @[inline] def Yp (bx bv bw:ؼ):ػ:= let lo0:=Yk (bx>>>16)+Yk (bv>>>16);let xb:=Yd ζ+Yd bw;if !(Yf bw==0)&&xbif t < inW then X[i*inW+t]! else ζ) (λ t=>if t < inW then W[j*inW+t]! else b[j]!) @[inline] def YL6 {β:Type} (lo:ػ) (a b:ؼ) (w2 w1 w0 c:ػ) (kont:ػ -> ػ -> ػ -> ػ -> β):β:= let m:=Yf a*Yf b;let s:=Yd a+Yd b-lo;let rr:=s&&&63;let y0:=m<<>>1)>>>(63-rr);let ng:=((a^^^b)>>>31).toUInt64;let mk:ػ:=0-ng;let s0:=w0+(y0^^^mk);let k0:ػ:=if s0 ػ -> ػ -> ػ -> β) (h:ε a*ε b=0\/(e˧<=γ a+γ b/\γ a+γ b<=e˧+63)) : YL6 e a b f g j c d=YL e a b f g j c d:=by unfold YL6 YL;by_cases k:Yd a+Yd b-e<64 ·simp only[k,ר,Ch] · have o:Yf a*Yf b=0:=by rcases h with h|⟨p,q⟩ · rcases Ax.mp h with h|h ·have:Yf a=0:=σ.mp (by rw[Zk,h];rfl);rw[this];simp ·have:Yf b=0:=σ.mp (by rw[Zk,h];rfl);rw[this];simp ·exfalso;apply k;have l:=Zf a;have n:=Zf b;have r:=Zg a;have s:=Zg b;rw[Ψ,Η _ _ (ϐ.mpr (by rw[ξ,l,n];norm_num;omega)),ξ,l,n];norm_num;omega simp only[k,ש,o,DB,Dm,Ch] @[inline] def YL16 {β:Type} (lo:ػ) (a b:ؼ) (_w2 h w0 c:ػ) (kont:ػ -> ػ -> ػ -> ػ -> β):β:= let m:=Yf a*Yf b;let s:=Yd a+Yd b-lo;let y0:=m<<<(s&&&63);let ng:=((a^^^b)>>>31).toUInt64;let mk:ػ:=0-ng;let s0:=w0+(y0^^^mk);let k0:ػ:=if s0>>63)) (h+mk+k0) s0 (c+ng) lemma J3 (h a b:ػ) (d:a=0\/a=0-1) (f:b=0\/b=1) (g:h˧≠2^63-1/\h˧≠2^63) : (0:ػ)-(h>>>63)+a+((if h+a>>63):=by have e:∀x:ػ,((0:ػ)-(x>>>63))˧=if x˧<2^63 then 0 else 2^64-1:=by intro x;have:=x܉;rw[Τ,Ξ,ψ];simp only[Ϝ,show(63:ػ)˧%64=63 from rfl];split_ifs<;>omega have j:=h܉;replace g:h˧<2^63-1\/2^63rcases f with rfl|rfl<;>split_ifs with k l<;> simp only[Ψ,ξ,e,Du,show(0-1:ػ)˧=2^64-1 from rfl,Ϝ,Da,Nat.zero_or,Nat.or_zero,Nat.or_self]at*<;> split_ifs at*<;>omega lemma S5 (h a b:ػ) (k:ٳ) (d:a=0\/a=0-1) (e:b=0\/b=1) (g:h˧<=k\/2^64-k<=h˧) (f:k<2^62) : (h+a+b)˧<=k+1\/2^64-(k+1)<=(h+a+b)˧:=by have j:=h܉;rcases d with rfl|rfl<;>rcases e with rfl|rfl<;>simp only[ξ,show(0-1:ػ)˧=2^64-1 from rfl,Ϝ,Da]<;>omega lemma S6 (m r:ػ) (a:m˧<2^48) (b:r˧<=16):(m>>>1)>>>(63-r)=0:=by apply σ.mp;rw[Ξ,Ξ,Η _ _ (ϐ.mpr (by show r˧<=63;omega)),ψ,ψ,show(63:ػ)˧=63 from rfl,show(1:ػ)˧%64=1 from rfl,Ϝ,ν (show 63-r˧<64 by omega),ϧ];exact Υ (a.trans_le (by rw[<-Κ];exact Ι ב א)) lemma E1 (a b:ؼ):(0:ػ)-((a^^^b)>>>31)܅=0\/(0:ػ)-((a^^^b)>>>31)܅=0-1:=by have:=D4 a b;split at this;right;rw[σ.1 (show((a^^^b)>>>31)܅˧=(1:ػ)˧from this)];left;rw[σ.1 (show((a^^^b)>>>31)܅˧=(0:ػ)˧from this)];rfl lemma C5 {β:Type} (e:ػ) (a b:ؼ) (h f c:ػ) (d:ػ -> ػ -> ػ -> ػ -> β) (g:ε a*ε b=0\/(e˧<=γ a+γ b/\γ a+γ b<=e˧+16)) (j:h˧≠2^63-1/\h˧≠2^63) : YL e a b ((0:ػ)-(h>>>63)) h f c d=YL16 e a b ((0:ػ)-(h>>>63)) h f c d:=by have n:=Zf a;have o:=Zf b;have u:=Zg a;have v:=Zg b;have k:ε a*ε b=0->Yf a*Yf b=0:=λ l=>σ.mp (by rw[ϯ,Zk,Zk,l];rfl);have p:((Yf a*Yf b)>>>1)>>>(63-((Yd a+Yd b-e)&&&63))=0:=by rcases g with l|⟨r,s⟩;rw[k l];simp;apply S6;rw[ϯ,Zk,Zk];have:=ZK a b;omega;rw[H0,Η _ _ (ϐ.mpr (by rw[ξ,n,o];omega)),ξ,n,o];omega unfold YL YL16;dsimp only;by_cases q:Yd a+Yd b-e<64;simp only[q,ר,p,Ch];rw[J3 h _ _ (E1 a b) ?_ j];split<;>simp;have t:Yf a*Yf b=0:=by rcases g with l|⟨r,s⟩;exact k l;exfalso;apply q;rw[Ψ,Η _ _ (ϐ.mpr (by rw[ξ,n,o];omega)),ξ,n,o];norm_num;omega simp only[q,ש,t,DB,Dm,Ch];rw[J3 h _ _ (E1 a b) ?_ j];split<;>simp def YS6 (q:ف) (X W:ؽ δ) (xa wa n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW:waپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw:waپ+nپ<Λ) (lo:ػ) (e:ٴ) (bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if h:kYS6 q X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL6 lo (X.uget (xa+k) (A4 X xa n k hX hx h)) (W.uget (wa+k) (A4 W wa n k hW hw h)) w2 w1 w0 c λ v2 v1 v0 c'=>YS6 q X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL lo ζ bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nپ-kپ decreasing_by all_goals exact ZI n k h lemma I6 (q:ف) (X W:ؽ δ) (a b n:ؾ) (j:a؛+n؛<=Xٽ) (l:b؛+n؛<=Wٽ) (g:a؛+n؛<Λ) (h:b؛+n؛<Λ) (f:ػ) (e:ٴ) (o:ؼ) (p:n؛<2^62) (D:ٳ) (r:q -> D<=16) (s:D<=63) (u:∀ t,t ε X[a؛+t]! * ε W[b؛+t]! ≠ 0 -> f˧<=γ X[a؛+t]! + γ W[b؛+t]! /\ γ X[a؛+t]! + γ W[b؛+t]! <= f˧+D) : ∀ (d:ٳ) (k:ؾ) (w v x c:ػ),n؛-k؛=d -> (q -> w=(0:ػ)-(v>>>63)/\(v˧<=k؛\/2^64-k؛<=v˧)) -> YS6 q X W a b n j l g h f e o w v x c k=YS X W a b n j l g h f e o w v x c k:=by intro d;induction d<;>intro k w v x c B J ·have y:=υ.not.2 (Dw B).not_gt;rw[YS6,YS,dif_neg y,dif_neg y] rename_i d E;have z:=Al B;have y:=υ.2 z;have F:=QK n k y;have G:n؛-(k+1)؛=d:=by rw[F,Cx,B];rfl rw[YS6,YS,dif_pos y,dif_pos y,B3 X a k _ ((ϴ z _).trans g),B3 W b k _ ((ϴ z _).trans h)];have C:=u k؛ z;cases q . rw[if_neg AC,I7 f _ _ w v x c _ (or_iff_not_imp_left.2 λ A=>⟨(C A).1,(C A).2.trans (by gcongr)⟩)];apply congrArg;funext K L M N;exact E (k+1) K L M N G ג . obtain⟨rfl,H⟩:=J rfl;have I:=z.trans p;rw[if_pos rfl,C5 f _ _ v x c _ (or_iff_not_imp_left.2 λ A=>⟨(C A).1,(C A).2.trans (by gcongr;exact r rfl)⟩) (by clear* -H I;omega)];unfold YL16;dsimp only;apply E (k+1) _ _ _ _ G (λ _=>⟨rfl,?_⟩);rw[F];apply S5 v _ _ k؛ (E1 _ _) ?_ H I;split<;>simp @[inline] def YaU (X W b:ؽ δ) (inW i j:ٳ) (bx bv:ؼ):δ:= if h:i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\i*inW+inW<=ހ /\ j*inW+inW<=ހ/\inW<ށ then let bw:=b[j]!;let lo:=Yp bx bv bw;let hi:=Yu bx bv bw;if (bx&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi122 then Yai X W b inW i j else have p1:(i*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];exact h.1 have p2:(j*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];exact h.2.1 have p3:(i*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have p4:(j*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega let r:=if hi-lo<=63 then YS6 (hi-lo<=16) X W (i*inW).toUSize (j*inW).toUSize inWٿ p1 p2 p3 p4 lo ((loپ:ٴ)-298) bw 0 0 0 0 0 else YS X W (i*inW).toUSize (j*inW).toUSize inWٿ p1 p2 p3 p4 lo ((loپ:ٴ)-298) bw 0 0 0 0 0 if r<߿ then r.toUInt32 else Yai X W b inW i j else Yai X W b inW i j @[inline] def YaUq (X W b:ؽ δ) (inW i j:ٳ) (bx bv:ؼ) (q:ف):δ:= if h:i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\i*inW+inW<=ހ /\ j*inW+inW<=ހ/\inW<ށ then let bw:=b[j]!;let lo:=Yp bx bv bw;let hi:=Yu bx bv bw;if (bx&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi122 then Yai X W b inW i j else have p1:(i*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];exact h.1 have p2:(j*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];exact h.2.1 have p3:(i*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have p4:(j*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega let r:=if hi-lo<=63 then YS6 q X W (i*inW).toUSize (j*inW).toUSize inWٿ p1 p2 p3 p4 lo ((loپ:ٴ)-298) bw 0 0 0 0 0 else YS X W (i*inW).toUSize (j*inW).toUSize inWٿ p1 p2 p3 p4 lo ((loپ:ٴ)-298) bw 0 0 0 0 0 if r<߿ then r.toUInt32 else Yai X W b inW i j else Yai X W b inW i j @[specialize] def Yaj (hw:ٳ) (f:ٳ -> ٳ -> δ) (ch j:ٳ) (acc:ؽ δ):ؽ δ:= if j ٳ -> δ) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if ch ٳ -> δ):ؽ δ:=Yak c hw f 0 (AY (c*hw)) lemma D3 (a:ٳ) (f:ٳ -> ٳ -> δ) (b:ٳ):∀ k j (d:ؽ δ),a-j=k -> (Yaj a f b j d)܍=d܍++(Bd j (a-j)).map (f b):=by intro k;induction k<;>intro j d h<;>unfold Yaj;rw[if_neg א];simp[h];next k e=>rw[if_pos א,e (j+1) _ א,Cx,h,Ϩ];simp lemma W5 (c a:ٳ) (f:ٳ -> ٳ -> δ):∀ k b (d:ؽ δ),c-b=k -> (Yak c a f b d)܍=d܍++(Bd (b*a) ((c-b)*a)).map (λ i=>f (i/a) (i%a)):=by intro k;induction k<;>intro b d h<;>unfold Yak ·rw[if_neg א];simp[h] rename_i e;rw[if_pos א,e (b+1) _ א,D3 a f b _ 0 _ rfl,show(c-b)*a=a+(c-(b+1))*a by rw[show c-b=(c-(b+1))+1 by omega,Dp,Ϟ],<-List.range'_append,List.map_append,Ah];simp only[CL,Ai];congr 2 . rw[show Bd (b*a) a=(Bd 0 a).map (b*a+·) by rw[DS];simp,Df];apply Ck;intro j g;rw[List.mem_range'_1]at g;have q:j ٳ -> δ):YT c a f=ڀ N λ i=>f (i܂/a) (i܂%a):=by subst b;apply ϻ;rw[YT,W5 c a f _ 0 _ rfl];apply ϩ<;>simp @[specialize] def Yaq (n:ٳ) (f:ٳ -> δ) (i:ٳ) (acc:ؽ δ):ؽ δ:= if i δ):ؽ δ:=Yaq n f 0 (AY n) @[specialize] def Yr2 (hw:ٳ) (f:ٳ -> δ × δ) (j:ٳ) (A B:ؽ δ):ؽ δ × ؽ δ:= if j ػ -> ػ -> ػ -> β) (q:ف) (X W:ؽ δ) (x1a x2a x3a x4a wa n:ؾ) (h1:x1aپ+nپ<=Xٽ) (h2:x2aپ+nپ<=Xٽ) (h3:x3aپ+nپ<=Xٽ) (h4:x4aپ+nپ<=Xٽ) (hW:waپ+nپ<=Wٽ) (g1:x1aپ+nپ<Λ) (g2:x2aپ+nپ<Λ) (g3:x3aپ+nپ<Λ) (g4:x4aپ+nپ<Λ) (hw:waپ+nپ<Λ) (lo1 lo2 lo3 lo4:ػ) (e1 e2 e3 e4:ٴ) (bw:ؼ) (a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc:ػ) (k:ؾ):β:= if h:kYL16 lo2 x2 w b2 b1 b0 bc λ b2 b1 b0 bc=>YL16 lo3 x3 w c2 c1 c0 cc λ c2 c1 c0 cc=>YL16 lo4 x4 w d2 d1 d0 dc λ d2 d1 d0 dc=>YS64 kont q X W x1a x2a x3a x4a wa n h1 h2 h3 h4 hW g1 g2 g3 g4 hw lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc (k+1) else YL6 lo1 x1 w a2 a1 a0 ac λ a2 a1 a0 ac=>YL6 lo2 x2 w b2 b1 b0 bc λ b2 b1 b0 bc=>YL6 lo3 x3 w c2 c1 c0 cc λ c2 c1 c0 cc=>YL6 lo4 x4 w d2 d1 d0 dc λ d2 d1 d0 dc=>YS64 kont q X W x1a x2a x3a x4a wa n h1 h2 h3 h4 hW g1 g2 g3 g4 hw lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc (k+1) else kont (YL lo1 ζ bw a2 a1 a0 ac λ v2 v1 v0 c'=>YD v2 v1 v0 c' e1) (YL lo2 ζ bw b2 b1 b0 bc λ v2 v1 v0 c'=>YD v2 v1 v0 c' e2) (YL lo3 ζ bw c2 c1 c0 cc λ v2 v1 v0 c'=>YD v2 v1 v0 c' e3) (YL lo4 ζ bw d2 d1 d0 dc λ v2 v1 v0 c'=>YD v2 v1 v0 c' e4) termination_by nپ-kپ decreasing_by all_goals exact ZI n k h @[inline] def YaU4 (X W b:ؽ δ) (inW i j:ٳ) (bx1 bx2 bx3 bx4 bv:ؼ):(δ × δ) × (δ × δ):= let bw:=b[j]! let lo1:=Yp bx1 bv bw;let hi1:=Yu bx1 bv bw;let lo2:=Yp bx2 bv bw;let hi2:=Yu bx2 bv bw let lo3:=Yp bx3 bv bw;let hi3:=Yu bx3 bv bw;let lo4:=Yp bx4 bv bw;let hi4:=Yu bx4 bv bw let q:=hi1-lo1<=16&&hi2-lo2<=16&&hi3-lo3<=16&&hi4-lo4<=16 if h:i*inW+inW<=Xٽ/\(i+1)*inW+inW<=Xٽ/\(i+2)*inW+inW<=Xٽ/\(i+2+1)*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\i*inW+inW<=ހ/\(i+1)*inW+inW<=ހ/\(i+2)*inW+inW<=ހ/\(i+2+1)*inW+inW<=ހ/\j*inW+inW<=ހ/\inW<ށ/\ ((bx1&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi1122)=false/\((bx2&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi2122)=false/\ ((bx3&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi3122)=false/\((bx4&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi4122)=false/\ hi1-lo1<=63/\hi2-lo2<=63/\hi3-lo3<=63/\hi4-lo4<=63 then have h1:(i*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];omega have g1:(i*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have h2:((i+1)*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];omega have g2:((i+1)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have h3:((i+2)*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];omega have g3:((i+2)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have h4:((i+2+1)*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];omega have g4:((i+2+1)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW:(j*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw:(j*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega YS64 (λ r1 r2 r3 r4=>((if r1<߿ then r1.toUInt32 else Yai X W b inW i j,if r2<߿ then r2.toUInt32 else Yai X W b inW (i+1) j),(if r3<߿ then r3.toUInt32 else Yai X W b inW (i+2) j,if r4<߿ then r4.toUInt32 else Yai X W b inW (i+2+1) j))) q X W (i*inW).toUSize ((i+1)*inW).toUSize ((i+2)*inW).toUSize ((i+2+1)*inW).toUSize (j*inW).toUSize inWٿ h1 h2 h3 h4 hW g1 g2 g3 g4 hw lo1 lo2 lo3 lo4 ((lo1پ:ٴ)-298) ((lo2پ:ٴ)-298) ((lo3پ:ٴ)-298) ((lo4پ:ٴ)-298) bw 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 else ((YaUq X W b inW i j bx1 bv q,YaUq X W b inW (i+1) j bx2 bv q),(YaUq X W b inW (i+2) j bx3 bv q,YaUq X W b inW (i+2+1) j bx4 bv q)) @[specialize] def Yr4 (hw:ٳ) (f:ٳ -> (δ × δ) × (δ × δ)) (j:ٳ) (A B C D:ؽ δ):ؽ δ × ؽ δ × ؽ δ × ؽ δ:= if j ف) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (e4:ٳ -> ف) (g4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d:ٳ -> ف) (f2:ٳ -> ٳ -> δ × δ) (f:ٳ -> ٳ -> δ) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if ch+3YL16 lo2 x w2 b2 b1 b0 bc λ b2 b1 b0 bc=>YL16 lo3 x w3 c2 c1 c0 cc λ c2 c1 c0 cc=>YL16 lo4 x w4 d2 d1 d0 dc λ d2 d1 d0 dc=>YS6c4 q X W xa w1a w2a w3a w4a n hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw1 bw2 bw3 bw4 a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc (k+1) else YL6 lo1 x w1 a2 a1 a0 ac λ a2 a1 a0 ac=>YL6 lo2 x w2 b2 b1 b0 bc λ b2 b1 b0 bc=>YL6 lo3 x w3 c2 c1 c0 cc λ c2 c1 c0 cc=>YL6 lo4 x w4 d2 d1 d0 dc λ d2 d1 d0 dc=>YS6c4 q X W xa w1a w2a w3a w4a n hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw1 bw2 bw3 bw4 a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc (k+1) else ((YL lo1 ζ bw1 a2 a1 a0 ac λ v2 v1 v0 c'=>YD v2 v1 v0 c' e1,YL lo2 ζ bw2 b2 b1 b0 bc λ v2 v1 v0 c'=>YD v2 v1 v0 c' e2),(YL lo3 ζ bw3 c2 c1 c0 cc λ v2 v1 v0 c'=>YD v2 v1 v0 c' e3,YL lo4 ζ bw4 d2 d1 d0 dc λ v2 v1 v0 c'=>YD v2 v1 v0 c' e4)) termination_by nپ-kپ decreasing_by all_goals exact ZI n k h @[inline] def YaUc4 (X W b:ؽ δ) (inW i j:ٳ) (bx bv1 bv2 bv3 bv4:ؼ):(δ × δ) × (δ × δ):= let bw1:=b[j]!;let bw2:=b[j+1]!;let bw3:=b[j+2]!;let bw4:=b[j+2+1]! let lo1:=Yp bx bv1 bw1;let hi1:=Yu bx bv1 bw1;let lo2:=Yp bx bv2 bw2;let hi2:=Yu bx bv2 bw2 let lo3:=Yp bx bv3 bw3;let hi3:=Yu bx bv3 bw3;let lo4:=Yp bx bv4 bw4;let hi4:=Yu bx bv4 bw4 let q:=hi1-lo1<=16&&hi2-lo2<=16&&hi3-lo3<=16&&hi4-lo4<=16 if h:i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\(j+1)*inW+inW<=Wٽ/\(j+2)*inW+inW<=Wٽ/\(j+2+1)*inW+inW<=Wٽ/\i*inW+inW<=ހ/\j*inW+inW<=ހ/\(j+1)*inW+inW<=ހ/\(j+2)*inW+inW<=ހ/\(j+2+1)*inW+inW<=ހ/\inW<ށ/\ ((bx&&&ޅ)=255||(bv1&&&ޅ)=255||θ bw1=255||hi1122)=false/\((bx&&&ޅ)=255||(bv2&&&ޅ)=255||θ bw2=255||hi2122)=false/\ ((bx&&&ޅ)=255||(bv3&&&ޅ)=255||θ bw3=255||hi3122)=false/\((bx&&&ޅ)=255||(bv4&&&ޅ)=255||θ bw4=255||hi4122)=false/\ hi1-lo1<=63/\hi2-lo2<=63/\hi3-lo3<=63/\hi4-lo4<=63 then have hX:(i*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];omega have hx:(i*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW1:(j*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw1:(j*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW2:((j+1)*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw2:((j+1)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW3:((j+2)*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw3:((j+2)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW4:((j+2+1)*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw4:((j+2+1)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega let r:=YS6c4 q X W (i*inW).toUSize (j*inW).toUSize ((j+1)*inW).toUSize ((j+2)*inW).toUSize ((j+2+1)*inW).toUSize inWٿ hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 ((lo1پ:ٴ)-298) ((lo2پ:ٴ)-298) ((lo3پ:ٴ)-298) ((lo4پ:ٴ)-298) bw1 bw2 bw3 bw4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ((if r.1.1<߿ then r.1.1.toUInt32 else Yai X W b inW i j,if r.1.2<߿ then r.1.2.toUInt32 else Yai X W b inW i (j+1)),(if r.2.1<߿ then r.2.1.toUInt32 else Yai X W b inW i (j+2),if r.2.2<߿ then r.2.2.toUInt32 else Yai X W b inW i (j+2+1))) else ((YaUq X W b inW i j bx bv1 q,YaUq X W b inW i (j+1) bx bv2 q),(YaUq X W b inW i (j+2) bx bv3 q,YaUq X W b inW i (j+2+1) bx bv4 q)) @[specialize] def Yaj4 (hw:ٳ) (f:ٳ -> ٳ -> δ) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4:ٳ -> ف) (ch j:ٳ) (acc:ؽ δ):ؽ δ:= if j+3 ٳ -> δ) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4:ٳ -> ف) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if chYc X inW i.val let BV:ؽ ؼ:=ڀ outW λ j=>Yc W inW j.val let F:=λ i j=>act relu (YaU X W b inW i j BX[i]! BV[j]!) let G:=λ i j=>let r:=YaU4 X W b inW i j BX[i]! BX[i+1]! BX[i+2]! BX[i+2+1]! BV[j]!;((act relu r.1.1,act relu r.1.2),(act relu r.2.1,act relu r.2.2)) if rows<2 then Yak4 rows outW F (λ i j=>let r:=YaUc4 X W b inW i j BX[i]! BV[j]! BV[j+1]! BV[j+2]! BV[j+2+1]!;((act relu r.1.1,act relu r.1.2),(act relu r.2.1,act relu r.2.2))) (λ _=>true) 0 (AY (rows*outW)) else YT4l rows outW (λ _=>false) G (λ _=>true) G (λ _=>false) (λ i j=>(F i j,F (i+1) j)) F 0 (AY (rows*outW)) lemma Zq (k:ؼ):(Yk k)˧=k؎-1:=by unfold Yk;split_ifs with h;subst h;rfl;rw[AG,Dj _ _ (by rw[AJ];exact Dd.2 λ a=>h (ύ.1 a))];rfl lemma E6 (x y:ؼ):(Yk x+Yk y)˧=x؎-1+(y؎-1):=by rw[ξ,Zq,Zq];have:x؎<2^32:=AK _;have:y؎<2^32:=AK _;exact ν א lemma ZM (a:ؼ):(Yd ζ+Yd a)˧=γ ζ+γ a:=B6 ζ a lemma D7 (b d a:ؼ):(Yp b d a)˧<=((b>>>16)؎-1)+((d>>>16)؎-1) /\ (ε a≠0 -> (Yp b d a)˧<=γ ζ+γ a):=by have h:=E6 (b>>>16) (d>>>16);have j:=ZM a;unfold Yp;dsimp only;rw[E7 a];split_ifs with e;simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ]at e;omega;simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ,not_and,not_lt]at e;constructor;omega;intro g;have:=e g;omega lemma D6 (b d a:ؼ):((b&&&ޅ)؎-1)+((d&&&ޅ)؎-1)<=(Yu b d a)˧ /\ (ε a≠0 -> γ ζ+γ a<=(Yu b d a)˧):=by have h:=E6 (b&&&ޅ) (d&&&ޅ);have j:=ZM a;unfold Yu;dsimp only;rw[E7 a];split_ifs with e;simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ]at e;omega;simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ,not_and,not_lt]at e;constructor;omega;intro g;have:=e g;omega lemma Zo (a:ؼ) (L H:ٳ) (h:a؎=L*2^16+H) (hH:H<2^16):(a>>>16)؎=L/\(a&&&ޅ)؎=H:=by constructor;rw[Ϣ,show(16:ؼ)؎%32=16 from rfl,ψ,h];omega;rw[AH,show(ޅ:ؼ)؎=2^16-1 from rfl,ϡ,h];omega lemma O2 (X W b:ؽ δ) (a i j:ٳ):Yai X W b a i j=Γ (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=by unfold Yai;rw[Zi] lemma Zp (A:ؽ δ) (a i:ٳ) (b:i*a+a<=Aٽ) (d:i*a+a<=ހ) : ∃ L H:ٳ,(Yc A a i)؎=L*2^16+H/\L<=511/\H<=255 /\ ∀ t,t < a -> L<=YR A[i*a+t]! /\ YM A[i*a+t]! <= H:=by have f:(i*a)۞؛=i*a:=Za _ א;have g:a۞؛=a:=Za _ א;unfold Yc;rw[dif_pos ⟨b,א⟩];obtain⟨L,H,e,h,c,-,-,j⟩:=W8 A (i*a)۞ a۞ (by rw[f,g];exact b) (by rw[f,g];have:=τ;omega) 0xFFFFFFFF 0 0 ג ד;refine⟨L,H,e,h,c,λt k=>?_⟩;have:=j t ג (by rw[g];exact k);rwa[f]at this lemma A9 (S:ٴ) (a:ػ) (c:ف) (b D:δ) (d:S=0 -> b=D) (e:D=ρ (S*2^a˧) (-298) c) : (if (if S=0 then ߿ else (ρ S ((a˧:ٴ)-298) false)܅)<߿ then (if S=0 then ߿ else (ρ S ((a˧:ٴ)-298) false)܅)՜ else b)=D:=by by_cases f:S=0;rw[if_pos f,if_neg ד,d f];rw[if_neg f,if_pos (by rw[Ψ];simpa using AK (ρ S ((a˧:ٴ)-298) false):(ρ S ((a˧:ٴ)-298) false)܅<߿),e,<-Aa,(by apply ύ.mp;simp:(ρ S ((a˧:ٴ)-298) false)܅՜=ρ S ((a˧:ٴ)-298) false)];unfold finishWord;rw[if_neg f,if_neg f,show(-298:ٴ)+(a˧:ٴ)=(a˧:ٴ)-298 by ring] lemma E8 (u p:ػ) (b:¬u122):p˧<=u˧/\u˧-p˧<=122:=by rw[Ψ]at b;have d:p˧<=u˧:=א;rw[gt_iff_lt,Ψ,Η _ _ (ϐ.2 d)]at a;exact⟨d,DZ.1 a⟩ lemma H4 {L r i:ٳ} (a:L<=r) (b:r<=i+1):L-1<=i:=א lemma H3 {m H i:ٳ} (a:m<=H) (b:i+1<=max m 1):i<=H-1:=א lemma ZQ {p u a b c d B:ٳ} {x w:δ} (h:p<=(a-1)+(b-1)) (j:(c-1)+(d-1)<=u) (k:u-p<=B) (e:a<=YR x/\YM x<=c) (f:b<=YR w/\YM w<=d) (g:ε x*ε w≠0):p<=γ x+γ w/\γ x+γ w<=p+B:= have l:=(Zb x).2.2.2 (left_ne_zero_of_mul g);have n:=(Zb w).2.2.2 (right_ne_zero_of_mul g);⟨h.trans (Cy (H4 e.1 l.1) (H4 f.1 n.1)),(Cy (H3 e.2 l.2) (H3 f.2 n.2)).trans (j.trans (BK.mp k))⟩ lemma O6 (x y:BD) (h:(AU x y).significand=0) : (AU x y).negative=(x.negative&&y.negative):=by unfold AU EC Eb at h⊢;dsimp only at h⊢;split_ifs at h⊢<;>simp_all only[beq_iff_eq,Int.natAbs_eq_zero] lemma O5 (d:BD) (h:d.significand=0):Bt κ d=Cs κ d.negative:=by rw[Model.roundDyadic_eq_roundDyadicImpl];unfold Model.roundDyadicImpl;rw[if_pos ד];unfold Model.ieeeRoundDyadicImpl;rw[if_pos (by simp[h])];cases d.negative<;>rfl lemma ZN (k:ٳ):(2:ℚ)^((k:ℤ)-149)=2^k*2^(-149:ℤ):=by rw[sub_eq_add_neg,zpow_add₀ two_ne_zero,ؠ] lemma ZcD (a b:δ) (d:θ a≠255) (e:θ b≠255):π (Cr (ι a) (ι b))=ρ (sv a*2^γ a+sv b*2^γ b) (-149) (η a&&η b):=by rw[Model.Proof.add_eq_spec];simp only[Model.Spec.add,ι,Ϡ a d,Ϡ b e];have h:(AU (Ν a) (Ν b)).toRat=((sv a*2^γ a+sv b*2^γ b:ٴ):ℚ)*2^(-149:ℤ):=by rw[AU,BF,ϙ,ϙ,ZN,ZN];push_cast;ring by_cases f:sv a*2^γ a+sv b*2^γ b=0 . have g:(AU (Ν a) (Ν b)).significand=0:=ח;rw[O5 _ g,O6 _ _ g,Ad,Ad,f,finishWord_zero] . exact(finishWord_of_ne _ _ _ _ f h).symm @[inline] def Yl (w:δ):ػ:= if θ w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 lemma Zs (w:δ):(Yl w)˧=ε w:=by have a:=fracOf_toNat_lt w;unfold Yl ε;split;simp;rw[ξ,AG,show(0x800000:ػ)˧=2^23 from rfl,ν א];omega lemma ZcJ (m:ػ) (a:ف) (b:m˧<2^63):Ym (if a then 0-m else m)=if a then -(m˧:ٴ) else (m˧:ٴ):=by cases a;simp only[φ,ש,Ym];rw[if_pos b];simp;simp only[ר,Ym];rw[Τ,Ϝ];by_cases d:m˧=0;simp[d];omega lemma O3 (x y:ػ) (a : -2^63<=Ym x+Ym y) (b:Ym x+Ym y<2^63):Ym (x+y)=Ym x+Ym y:=by unfold Ym at a b⊢;rw[ξ];split_ifs at a b⊢<;>omega lemma ZcL (m:ػ) (d:ٳ) (a:d<64) (h:m˧*2^d<2^64):(m<<simp[ES,Ei] lemma D5 (w:δ):(if η w then -((Yl w)˧:ٴ) else ((Yl w)˧:ٴ))=sv w:=by rw[Zs];rfl lemma ZO:sv ζ=2^23/\γ ζ=126:=ד lemma R1 (a b:δ) (e:ٳ) (h:ε a*ε b≠0 -> e<128) : -2^175constructor<;>linarith lemma ZcN (S e:ٴ) (a b:ف) (h:S≠0):ρ S e a=ρ S e b:=by simp[ρ,h] lemma ZcO (a b p q:ػ):(a≠0 -> (if a=0 then q else if b=0 then p else if p<=q then p else q)<=p) /\ (b≠0 -> (if a=0 then q else if b=0 then p else if p<=q then p else q)<=q):=ז @[inline] def Yal (a b c d:δ) (nz:ف) (slow:Unit -> δ):δ:= let p:=Yd a+Yd b;let q:=Yd c+Yd d;let m1:=Yf a*Yf b;let m2:=Yf c*Yf d;let lo:=if m1=0 then q else if m2=0 then p else if p<=q then p else q;if (m1=0\/p-lo<128)/\(m2=0\/q-lo<128) then YL lo a b 0 0 0 0 λ w2 w1 w0 k => YL lo c d w2 w1 w0 k λ v2 v1 v0 k' => let r:=YD v2 v1 v0 k' ((loپ:ٴ)-298);if r=߿ then (if nz then ߾ else 0) else r.toUInt32 else slow () lemma K6 (a b:δ) (d:ػ) (e:(Yd a+Yd b)˧=γ a+γ b) (z:Yf a*Yf b=0↔ε a*ε b=0) (L:Yf a*Yf b≠0 -> d<=Yd a+Yd b) (f:Yf a*Yf b=0\/Yd a+Yd b-d<128) : ε a*ε b≠0 -> d˧<=γ a+γ b/\γ a+γ b δ) (g:e ()=ρ (sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)) (-298) f) : Yal a b c d f e=ρ (sv a*sv b*2^(γ a+γ b)+sv c*sv d*2^(γ c+γ d)) (-298) f:=by unfold Yal;dsimp only;obtain⟨L1,L2⟩:=ZcO (Yf a*Yf b) (Yf c*Yf d) (Yd a+Yd b) (Yd c+Yd d);generalize (if Yf a*Yf b=0 then Yd c+Yd d else if Yf c*Yf d=0 then Yd a+Yd b else if Yd a+Yd b<=Yd c+Yd d then Yd a+Yd b else Yd c+Yd d)=j at L1 L2⊢;split;swap;exact g;rename_i v;have F1:=K6 a b j (B6 a b) (K2 a b) L1 v.1;have F2:=K6 c d j (B6 c d) (K2 c d) L2 v.2;let K:=λ n o p q=>let r:=YD n o p q ((j˧:ٴ)-298);if r=߿then (if f then (߾:ؼ)else 0)else r՜;obtain⟨s,t,u,k,z,A,B⟩:=Zr j a b 0 0 0 0 (YL j c d · · · · K) ג F1;rw[z];obtain⟨n,o,p,q,C,-,D⟩:=Zr j c d s t u k K (by simp at A;omega) F2;rw[C];simp only[K];have w:=R1 a b (γ a+γ b-j˧) (λ l=>א);have x:=R1 c d (γ c+γ d-j˧) (λ l=>א);rw[ZV n o p q _ _ (by linarith[w.1,x.1]) (by linarith[w.2,x.2]) (by rw[D,Ϫ,B,<-Ϫ];simp[Yx]:((Yx n o p+q˧:ٳ):ٴ)%2^192=(sv a*sv b*2^(γ a+γ b-j˧)+sv c*sv d*2^(γ c+γ d-j˧))%2^192),ZC (sv a*sv b) _ j˧ (or_iff_not_imp_left.2 λ l=>(F1 λ h=>l (by rw[<-Zn,h];simp)).1),ZC (sv c*sv d) _ j˧ (or_iff_not_imp_left.2 λ l=>(F2 λ h=>l (by rw[<-Zn,h];simp)).1),<-add_mul];split<;>rename_i y;rw[if_pos rfl,y,zero_mul];cases f<;>rfl;rw[if_neg,UInt32.toUInt32_toUInt64,sub_eq_neg_add,Aa];exact ZcN _ _ _ _ (mul_ne_zero y (pow_ne_zero _ two_ne_zero));exact λ h=>(AK _).ne (congrArg Er h) @[inline] def Y1 (ma mb:ػ) (ia ib:ٳ):ٳ:= if ma=0 then ib else if mb=0 then ia else min ia ib lemma Q9 (a b:ػ) (d e:ٳ):(a=0\/Y1 a b d e<=d)/\(b=0\/Y1 a b d e<=e):=by unfold Y1;refine⟨?_,?_⟩<;>split_ifs<;>first|(left;assumption)|(right;omega) @[inline] def Ge (w A:ػ) (e:Unit -> ٴ) (z o:ف) (B:ػ):ؼ:= if w=0 then (if z then ߾ else 0) else let n:=w>>>63 != 0;let m:=if n then 0-w else w;let L0:=A-1+(if m>>>A != 0 then 1 else 0);let L:=if m>>>L0==1 then L0&&&63 else Yj m;let u:=B+L+126;if o&&u<=253 then YZ n u (m<<<(63-L)) else Ybn n m (e ()) lemma Gc (w A:ػ) (e:Unit -> ٴ) (a b:ف) (B:ػ):Ge w A e a b B=YaPT w e a b B:=by unfold Ge YaPT YauT;simp only[(by intro m L;split<;>rename_i h;have d:=congrArg Er (eq_of_beq h);rw[Ξ,ψ,Da]at d;have p:=Δ (L˧%64);have f:=Av m˧ (2^(L˧%64));have g:=Nat.lt_div_mul_add (a:=m˧) p;rw[d,Ϙ]at f g;apply σ.mp;rw[Zj m (λ h0=>by rw[h0]at f;simp at f),BR,show(63:ػ)˧=2^6-1 from rfl,ϡ];exact((Af א).mpr ⟨f,by rw[Nat.pow_succ];omega⟩).symm;rfl:∀m L:ػ,(if m>>>L==1 then L&&&63 else Yj m)=Yj m)] lemma Y0p (k:ػ) (a:k˧<1024):Y0 ((k˧:ٴ)-149) true (k-149):=by intro c d _ b;rw[ξ,Τ,show(149:ػ)˧=149 from rfl]at b⊢;push_cast at b⊢;omega @[inline] def YaW (sa:ف) (ma ia:ػ) (sb:ف) (mb ib:ػ) (nz:ف) (slow:Unit -> δ):δ:= let k:=if ma==0 then ib else if mb==0 then ia else if ia<=ib then ia else ib;let da:=if k<=ia then ia-k else 0;let db:=if k<=ib then ib-k else 0;if da<=38&&db<=38 then let ta:=ma<<(k˧:ٴ)-149) nz true (k-149) else slow () lemma ZcP (j:ف) (a e:ػ) (l:ف) (b f:ػ) (o:ف) (g:Unit -> δ) (p:a˧<2^24) (q:b˧<2^24) (he:e˧<1024) (hf:f˧<1024) (r:g ()=ρ ((if j then -(a˧:ٴ) else a˧)*2^e˧+(if l then -(b˧:ٴ) else b˧)*2^f˧) (-149) o) : YaW j a e l b f o g=g ():=by rw[r]; have Z:∀(m:ػ) (d:ٳ),m˧<2^24→d<=38→m˧*2^d<2^62:=λ m d h s=>(As h (Ι ב s) ה).trans_eq ב;unfold YaW;dsimp only;have hk:(if a==0 then f else if b==0 then e else if e<=f then e else f)˧=Y1 a b e˧ f˧:=by unfold Y1;split_ifs<;>simp_all[ϐ,min_def] have kb:Y1 a b e˧ f˧<1024:=by unfold Y1;split_ifs<;>omega generalize (if a==0 then f else if b==0 then e else if e<=f then e else f)=K at hk⊢;have E:∀X:ػ,(if K<=X then X-K else 0)=(X˧-K˧).toUInt64:=λ X=>by have:=X܉;apply UInt64.toNat_inj.mp;split<;>rename_i h<;>[rw[Η _ _ h];simp only[ϐ]at h]<;>simp<;>omega rw[E e,E f];obtain⟨x,y⟩:=Q9 a b e˧ f˧;set k:=Y1 a b e˧ f˧;split<;>rename_i s . have s:e˧-k<=38∧f˧-k<=38:=by simp[ϐ]at s;omega rw[Gc,C4,L6 _ _ _ _ _ (Y0p K א),hk];have t:=Z a _ p s.1;have u:=Z b _ q s.2;have v:=ZY a (e˧-k) j (by omega-splitDisjunctions) t;have w:=ZY b (f˧-k) l (by omega-splitDisjunctions) u;rw[O3 _ _ ?_ ?_,v,w] . rw[show (k:ٴ)-149=-149+k by ring,Aa];have z:=ZC (if j then-(a˧:ٴ)else a˧) e˧ k (x.imp_left λ h=>by subst h;simp);have A:=ZC (if l then-(b˧:ٴ)else b˧) f˧ k (y.imp_left λ h=>by subst h;simp);rw[z,A];ring all_goals rw[v,w];have B:(a˧*2^(e˧-k):ٴ)<2^62:=mod_cast t;have C:(b˧*2^(f˧-k):ٴ)<2^62:=mod_cast u;have D:(0:ٴ)<=a˧*2^(e˧-k):=ג;have E:(0:ٴ)<=b˧*2^(f˧-k):=ג;cases j<;>cases l<;>simp<;>linarith . exact r @[inline] def YaX (a b:δ):δ:= if θ a=255\/θ b=255 then π (Cr (ι a) (ι b)) else YaW (η a) (Yl a) (Yd a) (η b) (Yl b) (Yd b) (η a&&η b) (λ _=>Yal a ζ b ζ (η a&&η b) (λ _=>π (Cr (ι a) (ι b)))) lemma ZcQ (a b:δ):YaX a b=π (Cr (ι a) (ι b)):=by unfold YaX;split;rfl rename_i h;have g:θ a≠255:=λ e=>h (Ea e);have j:θ b≠255:=λ e=>h (EY e);have d:=ZcD a b g j;have f:π (Cr (ι a) (ι b))=ρ (sv a*sv ζ*2^(γ a+γ ζ)+sv b*sv ζ*2^(γ b+γ ζ)) (-298) (η a&&η b):=by rw[d,ZO.1,ZO.2,(ב:(-149:ٴ)=-298+((149:ٳ):ٴ)),Aa];congr 1;ring have k:Yal a ζ b ζ (η a&&η b) (λ _=>π (Cr (ι a) (ι b)))=π (Cr (ι a) (ι b)):=by rw[R0 _ _ _ _ _ _ f,f] rw[<-D5 a,<-D5 b,<-Zf a,<-Zf b]at d;rw[ZcP _ _ _ _ _ _ _ _ (Zs _▸Ϛ a) (Zs _▸Ϛ b) (by rw[Zf];have:=Zg a;omega) (by rw[Zf];have:=Zg b;omega) (by rw[k];exact d)];exact k @[specialize] def YE (n:ؾ) (fx fw:(t:ؾ) -> t δ) (lo:ػ) (e:ٴ) (bx bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if h:k YE n fx fw lo e bx bw v2 v1 v0 c' (k+1) else YL lo bx bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nپ-kپ decreasing_by exact ZI n k h def Yr (fa fb:ٳ -> δ) (lo k:ٳ):ٳ -> ٴ | 0=>0 | r+1=>sv (fa k)*sv (fb k)*2^(γ (fa k)+γ (fb k)-lo)+Yr fa fb lo (k+1) r lemma H2 (n:ؾ) (l o:(t:ؾ) -> t δ) (f a:ٳ -> δ) (p:∀ t h,l t h=f t؛) (q:∀ t h,o t h=a t؛) (b:ػ) (e:ٴ) (g j:ؼ) (s:n؛<2^32) (r:ε g*ε j≠0 -> b˧<=γ g+γ j/\γ g+γ j k؛<=n؛ -> c˧<=k؛ -> (∀ t,k؛<=t -> t ε (f t)*ε (a t)≠0 -> b˧<=γ (f t)+γ (a t)/\γ (f t)+γ (a t) ((Yx z A B+c˧:ٳ):ٴ)%2^192=S0%2^192 -> S=S0+Yr f a b˧ k؛ (n؛-k؛)+sv g*sv j*2^(γ g+γ j-b˧) -> -2^191<=S -> S<2^191 -> YE n l o b e g j z A B c k=if S=0 then ߿ else (ρ S e false)܅:=by intro d;induction d<;>intro k z A B c S0 S C P K J ·rw[YE,dif_neg (υ.not.2 א)];obtain⟨u,v,w,x,E,-,F⟩:=Zr b g j z A B c (YD · · · · e) א r;rw[E,C,Yr];intro G H L M;apply ZV u v w x e S L M;rw[F,H,add_zero];exact DT _ G rename_i N;have D:=υ.2 (Al C);have y:=QK n k D;rw[YE,dif_pos D,p,q];obtain⟨u,v,w,x,E,O,F⟩:=Zr b (f k؛) (a k؛) z A B c (YE n l o b e g j · · · · (k+1)) א (J k؛ le_rfl (υ.1 D));rw[E,show n؛-k؛=(n؛-(k+1)؛)+1 by clear* -y C;omega,Yr,y];have I:=N (k+1) u v w x (S0+sv (f k؛)*sv (a k؛)*2^(γ (f k؛)+γ (a k؛)-b˧)) S (by clear* -y C;omega) (y▸υ.1 D) (y▸O.trans (Nat.succ_le_succ K)) (λ t Q=>J t א);exact λ G H=>I (F.trans (DT _ G)) (by rw[H,y];ring) lemma G4 (a b:ٳ -> δ) (d:ٳ):∀ (r k:ٳ),(∀ t,k<=t -> t ε (a t)*ε (b t)≠0 -> d<=γ (a t)+γ (b t)/\γ (a t)+γ (b t)<=d+122) -> -((r:ٴ)*2^170)<=Yr a b d k r/\Yr a b d k r<=(r:ٴ)*2^170:=by intro r;induction r<;>intro k h ·simp[Yr] rename_i e;obtain⟨f,g⟩:=ZL (a k) (b k) d (h k le_rfl א);obtain⟨j,l⟩:=e (k+1) (λ t n o=>h t א א);rw[Yr];push_cast;constructor<;>linarith lemma Q6 (a b:ٳ -> δ) (K d:ٳ) (e f:ؼ):∀ r k,k+r<=K -> (∀ t,k<=t -> t ε (a t)*ε (b t)≠0 -> d<=γ (a t)+γ (b t)) -> Yo (λ t=>if tif tintro k j h ·simp[Yo,Yr] rename_i g;rw[Yo,Yr,g (k+1) א (λ t l n=>h t א א)];simp only[show k t δ) (e a:ٳ -> δ) (o:∀ t h,f t h=e t؛) (p:∀ t h,g t h=a t؛) (b:ؼ) (d:ػ) (hK:K<ށ) (q:∀ t,t θ (e t)≠255) (r:∀ t,t θ (a t)≠255) (s:θ b≠255) (j:∀ t,t ε (e t)*ε (a t)≠0 -> d˧<=γ (e t)+γ (a t)/\γ (e t)+γ (a t)<=d˧+122) (l:ε ζ*ε b≠0 -> d˧<=γ ζ+γ b/\γ ζ+γ b<=d˧+122) (n:δ) (u:n=Γ (K+1) (λ t=>if tif tif tif tj t א v);have E:=ZL ζ b d˧ l;generalize z:Yr e a d˧ 0 K+sv ζ*sv b*2^(γ ζ+γ b-d˧)=Srel;rw[H2 K۞ f g e a o p d ((d˧:ٴ)-298) ζ b א (λ h=>by have:=l h;omega) K 0 0 0 0 0 0 Srel (by simp[x]) ג ג (λ t _ y v=>by have:=j t א v;omega) (by simp[Yx]) (by rw[<-z,x];simp) א א];exact A9 _ _ _ _ _ (λ _=>u) (by rw[Zy (K+1) _ _ (by intro k F;by_cases w:ksimp only[w,ר,ש];exact⟨q k w,r k w⟩;exact⟨ד,s⟩:∀k,kθ ((λ t=>if tif t(j t א v).1)];simp;rw[ZA oneW b d˧ (λ h=>(l h).1),<-z];ring:Γ (K+1) (λ t=>if tif tif tif t YS X W a b n f g j l o e p r s u c k=YE n (λ t h=>X.uget (a+t) (A4 X a n t f j h)) (λ t h=>W.uget (b+t) (A4 W b n t g l h)) o e ζ p r s u c k:=by intro d;induction d<;>intro k r s u c v ·have q:¬k θ X[i*a+t]! ≠ 255) (r:∀ t,t < a -> θ W[j*a+t]! ≠ 255) (s:θ b≠255) (u:∀ t,t < a -> ε X[i*a+t]! * ε W[j*a+t]! ≠ 0 -> d˧<=γ X[i*a+t]! + γ W[j*a+t]! /\ γ X[i*a+t]! + γ W[j*a+t]! <= d˧+122) (v:ε ζ*ε b≠0 -> d˧<=γ ζ+γ b/\γ ζ+γ b<=d˧+122) (l:δ) (w:l=Γ (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b)) : (if YS X W (i*a)۞ (j*a)۞ a۞ e f g k d ((d˧:ٴ)-298) b 0 0 0 0 0<߿ then (YS X W (i*a)۞ (j*a)۞ a۞ e f g k d ((d˧:ٴ)-298) b 0 0 0 0 0)՜ else l) = Γ (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b):=by rw[R7 X W _ _ _ e f g k d _ b _ 0 0 0 0 0 rfl];exact L7 a _ _ (λ t=>X[i*a+t]!) (λ t=>W[j*a+t]!) (λ t h=>by rw[B3 X _ t _ (by have:=υ.mp h;omega),n]) (λ t h=>by rw[B3 W _ t _ (by have:=υ.mp h;omega),o]) b d p q r s u v l w lemma ZcBq (q:ف) (X W b:ؽ δ) (a i j:ٳ) (hq:q=true -> Yu (Yc X a i) (Yc W a j) b[j]!-Yp (Yc X a i) (Yc W a j) b[j]!<=16):YaUq X W b a i j (Yc X a i) (Yc W a j) q=Γ (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=by have F:=O2 X W b a i j;unfold YaUq;split;swap;exact F;obtain⟨G,H,I,J,K⟩:=‹_∧_›;have w:=Za (i*a) א;have x:=Za (j*a) א;have p:=Za a א;obtain⟨Lx,Hx,y,Z,L,r⟩:=Zp X a i G I;obtain⟨Lv,Hv,z,_,M,s⟩:=Zp W a j H J;generalize Yc X a i=f at y hq⊢;generalize Yc W a j=g at z hq⊢;obtain⟨N,A⟩:=Zo f Lx Hx y א;obtain⟨O,B⟩:=Zo g Lv Hv z א;obtain⟨k,u⟩:=D7 f g b[j]!;obtain⟨l,v⟩:=D6 f g b[j]!;rw[N,O]at k;rw[A,B]at l;dsimp only;split;exact F;rename_i C;simp only[Ϸ,ת,not_or]at C;obtain⟨⟨⟨⟨P,Q⟩,R⟩,S⟩,T⟩:=C;obtain⟨Y,D⟩:=E8 _ _ S T;by_cases n:Yu f g b[j]! -Yp f g b[j]!<=63;rw[if_pos n,I6 _ X W (i*a)۞ (j*a)۞ a۞ _ _ _ _ (Yp f g b[j]!) _ b[j]! א _ (λh=>ϐ.1 (hq h)) (ϐ.1 n) (λt d o=>by rw[w,x]at o⊢;exact ZQ k l (Η _ _ (ϐ.2 Y)).ge (r t (p▸d)) (s t (p▸d)) o) a۞؛ 0 0 0 0 0 ג (λ_=>⟨rfl,ג⟩)];swap;rw[if_neg n];all_goals exact L8 X W a i j b[j]! (Yp f g b[j]!) _ _ _ _ w x p K (λt d=>(Zb _).2.2.1 ((r t d).2.trans_lt (L.lt_of_ne λh=>P (ύ.1 (A.trans h))))) (λt d=>(Zb _).2.2.1 ((s t d).2.trans_lt (M.lt_of_ne λh=>Q (ύ.1 (B.trans h))))) R (λt d=>ZQ k l D (r t d) (s t d)) (λo=>⟨u (right_ne_zero_of_mul o),(v (right_ne_zero_of_mul o)).trans (BK.1 D)⟩) _ F lemma ZcB (X W b:ؽ δ) (a i j:ٳ):YaU X W b a i j (Yc X a i) (Yc W a j)=Γ (a+1) (λ t=>if t < a then X[i*a+t]! else ζ) (λ t=>if t < a then W[j*a+t]! else b[j]!):=ZcBq _ X W b a i j (λ h=>of_decide_eq_true h) lemma ZcBe (q:ف) (X W b:ؽ δ) (a i j:ٳ) (hq:q=true -> Yu (Yc X a i) (Yc W a j) b[j]!-Yp (Yc X a i) (Yc W a j) b[j]!<=16):YaUq X W b a i j (Yc X a i) (Yc W a j) q=YaU X W b a i j (Yc X a i) (Yc W a j):=by rw[ZcBq q X W b a i j hq,ZcB] lemma Z0 (a:ؽ δ) (o k:ٳ) (h:o*k+k<=a܃/\o*k+k<=ހ) (t:ؾ) (b:t δ) (d:ٳ):∀ r k,(∀ t,k<=t -> t ε (a t)*ε (b t)≠0 -> d<=γ (a t)+γ (b t)) -> Yo a b k r=2^d*Yr a b d k r:=by intro r;induction r;intro k _;simp[Yo,Yr];next r e=>intro k h;rw[Yo,Yr,e (k+1) (λ t f g=>h t א א),ZA _ _ d (h k le_rfl א)];ring lemma ZcY (K:ٳ) (e f:(t:ؾ) -> t δ) (b a:ٳ -> δ) (k:∀ t h,e t h=b t؛) (l:∀ t h,f t h=a t؛) (d:ػ) (hK:K<ށ) (n:∀ t,t θ (b t)≠255) (o:∀ t,t θ (a t)≠255) (g:∀ t,t ε (b t)*ε (a t)≠0 -> d˧<=γ (b t)+γ (a t)/\γ (b t)+γ (a t)<=d˧+122) (j:δ) (p:j=Γ K b a) : (if YE K۞ e f d ((d˧:ٴ)-298) 0 0 0 0 0 0 0<߿ then (YE K۞ e f d ((d˧:ٴ)-298) 0 0 0 0 0 0 0)՜ else j) = Γ K b a:=by have r:K۞؛=K:=Za _ א;have B:=G4 b a d˧ K 0 (λ t _ s q=>g t א q);have w:sv (0:ؼ)=0:=ד;generalize u:Yr b a d˧ 0 K=S;have x: -2^191<=S:=א;have y:S<2^191:=א;have z:=H2 K۞ e f b a k l d ((d˧:ٴ)-298) 0 0 א (absurd ד) K 0 0 0 0 0 0 S (by simp[r]) ג ג (λ t _ s q=>by have:=g t א q;exact⟨this.1,א⟩) (by simp[Yx]) (by rw[<-u,r,w];simp) x y rw[z];have A:Γ K b a=ρ (S*2^d˧) (-298) (decide (K≠0)&&Yq b a 0 K):=by rw[Zy K b a (λ t v=>⟨n t v,o t v⟩),ZcX b a d˧ K 0 (λ t _ s q=>(g t א q).1),<-u];ring exact A9 _ _ _ _ _ (λ _=>p) A lemma N4 (B:ؽ δ) (k n a j:ٳ) (h:(a+k)*n<=Bٽ/\jA[r*k+t]!) (λ t=>B[(bk+t)*n+j]!) lemma Zam (A B:ؽ δ) (k n r a j:ٳ):Yan A B k n r a j=Γ k (λ t=>A[r*k+t]!) (λ t=>B[(a+t)*n+j]!):=by unfold Yan;rw[Zi] @[specialize] def YE16 (n:ؾ) (fx fw:(t:ؾ) -> t δ) (lo:ػ) (e:ٴ) (bx bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if h:k YE16 n fx fw lo e bx bw v2 v1 v0 c' (k+1) else YL lo bx bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nپ-kپ decreasing_by exact ZI n k h lemma YE16e (n:ؾ) (fx fw:(t:ؾ) -> t δ) (lo:ػ) (e:ٴ) (bx bw:ؼ) (p:n؛<2^62) (u:∀ t (h:t lo˧<=γ (fx t h)+γ (fw t h)/\γ (fx t h)+γ (fw t h)<=lo˧+16) : ∀ (d:ٳ) (k:ؾ) (w v x c:ػ),n؛-k؛=d -> w=(0:ػ)-(v>>>63) -> (v˧<=k؛\/2^64-k؛<=v˧) -> YE16 n fx fw lo e bx bw w v x c k=YE n fx fw lo e bx bw w v x c k:=by intro d;induction d<;>intro k w v x c B J H ·have y:=υ.not.2 (Dw B).not_gt;rw[YE16,YE,dif_neg y,dif_neg y] rename_i d E;have z:=Al B;have y:=υ.2 z;have F:=QK n k y;have G:n؛-(k+1)؛=d:=by rw[F,Cx,B];rfl subst J;have I:=z.trans p;rw[YE16,YE,dif_pos y,dif_pos y,C5 lo _ _ v x c _ (or_iff_not_imp_left.2 (u k y)) (by clear* -H I;omega)];unfold YL16;dsimp only;apply E (k+1) _ _ _ _ G rfl;rw[F];apply S5 v _ _ k؛ (E1 _ _) ?_ H I;split<;>simp @[inline] def YEq (q:ف) (n:ؾ) (fx fw:(t:ؾ) -> t δ) (lo:ػ) (e:ٴ) (bx bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if q then YE16 n fx fw lo e bx bw w2 w1 w0 c k else YE n fx fw lo e bx bw w2 w1 w0 c k lemma ZcYq (q:ف) (K:ٳ) (e f:(t:ؾ) -> t δ) (b a:ٳ -> δ) (k:∀ t h,e t h=b t؛) (l:∀ t h,f t h=a t؛) (d:ػ) (hK:K<ށ) (n:∀ t,t θ (b t)≠255) (o:∀ t,t θ (a t)≠255) (g:∀ t,t ε (b t)*ε (a t)≠0 -> d˧<=γ (b t)+γ (a t)/\γ (b t)+γ (a t)<=d˧+122) (j:δ) (p:j=Γ K b a) (s:q -> ∀ t,t ε (b t)*ε (a t)≠0 -> d˧<=γ (b t)+γ (a t)/\γ (b t)+γ (a t)<=d˧+16) : (if YEq q K۞ e f d ((d˧:ٴ)-298) 0 0 0 0 0 0 0<߿ then (YEq q K۞ e f d ((d˧:ٴ)-298) 0 0 0 0 0 0 0)՜ else j) = Γ K b a:=by have r:K۞؛=K:=Za _ א have E:YEq q K۞ e f d ((d˧:ٴ)-298) 0 0 0 0 0 0 0=YE K۞ e f d ((d˧:ٴ)-298) 0 0 0 0 0 0 0:=by unfold YEq;split;rename_i Q;exact YE16e _ e f d _ 0 0 (by rw[r];omega) (λ t h=>by rw[k,l];exact s Q t؛ (by have:=υ.1 h;rw[r]at this;exact this)) _ 0 0 0 0 0 rfl rfl (by simp);rfl rw[E];exact ZcY K e f b a k l d hK n o g j p @[inline] def Ya2 (A B:ؽ δ) (k n r bk j:ٳ) (ba bb:ؼ) (hk:k<ށ) : δ:= if h:r*k+k<=Aٽ/\r*k+k<=ހ/\((bk+k)*n<=Bٽ/\j122 then Yan A B k n r bk j else let r':=YEq (hi-lo<=16) kٿ (λ t ht=>A.uget ((r*k).toUSize+t) (by have:=Z0 A r k ⟨h.1,h.2.1⟩ t ht;rw [this.1];exact this.2)) (λ t ht=>B.uget ((bk*n+j).toUSize+t*nٿ) (by have:=N4 B k n bk j h.2.2 hk t ht;rw [this.1];exact this.2)) lo ((loپ:ٴ)-298) 0 0 0 0 0 0 0 if r'<߿ then r'.toUInt32 else Yan A B k n r bk j else Yan A B k n r bk j lemma ZcZ (A B:ؽ δ) (k n r a j:ٳ) (b:k<ށ):Ya2 A B k n r a j (Yc A k r) (Yc B Bٽ 0) b=Γ k (λ t=>A[r*k+t]!) (λ t=>B[(a+t)*n+j]!):=by have p:=Zam A B k n r a j;unfold Ya2;split;swap;exact p;rename_i e;obtain⟨c,i,s,O,H,u⟩:=Zp A k r e.1 e.2.1;obtain⟨m,R,v,P,I,w⟩:=Zp B Bٽ 0 א א;generalize Yc A k r=l,Yc B Bٽ 0=o at s v⊢;obtain⟨J,x⟩:=Zo l c i s א;obtain⟨K,y⟩:=Zo o m R v א;obtain⟨f,-⟩:=D7 l o 0;obtain⟨g,-⟩:=D6 l o 0;dsimp only;split;exact p;rename_i z;simp only[Ϸ,ת,not_or]at z;obtain⟨⟨⟨C,D⟩,L⟩,M⟩:=z;simp only[←ύ,x,y,CD]at C D;obtain⟨Q,N⟩:=E8 _ _ L M;rw[x,y]at g;rw[J,K]at f;have E:∀tB[(a+t)*n+j]!) _ _ (Yp l o 0) b . exact λ t d=>(Zb _).2.2.1 ((u t d).2.trans_lt (H.lt_of_ne C)) . intro t d;rw[F t d];exact(Zb _).2.2.1 ((w _ (E t d)).2.trans_lt (I.lt_of_ne D)) . intro t d G;rw[F t d]at G⊢;exact ZQ f g N (u t d) (w _ (E t d)) G . exact p . intro V t d G;simp only[decide_eq_true_eq]at V;replace V:(Yu l o 0)˧-(Yp l o 0)˧<=16:=by rw[ϐ,Η _ _ (ϐ.2 Q)]at V;exact V rw[F t d]at G⊢;exact ZQ f g V (u t d) (w _ (E t d)) G . intro t d;obtain⟨h,q⟩:=Z0 A r k ⟨e.1,e.2.1⟩ t d;show A[((r*k)۞+t)؛]=_;rw[<-ح A _ (by rwa[h])];simp only[h] . intro t d;obtain⟨h,q⟩:=N4 B k n a j e.2.2 b t d;show B[((a*n+j)۞+t*n۞)؛]=_;rw[<-ح B _ (by rwa[h])];simp only[h] def Ya3 (batch m k n:ٳ) (A B:ؽ δ):ؽ δ:= if hk:k<ށ then let bb:=Yc B Bٽ 0;let BA:ؽ ؼ:=ڀ (batch*m) λ r=>Yc A k r.val;YT (batch*m) n λ r j=>Ya2 A B k n r (r/m*k) j BA[r]! bb hk else gemmWith Yn batch m k n A B lemma Zc0:Ya3=gemmSpec:=by funext c m k n A B;unfold Ya3 gemmSpec;split;rename_i a;rw[ZB _ _ _ (ϣ _ _ _)];congr 1;funext q;rw[(by rw[ϧ,Θ n m]:q܂/n/m=q܂/(m*n))];conv_lhs=>rw[(by intro v;rw[Θ m n,<-ϧ];exact(϶ _ _).symm:∀v:ٳ,v/n=v/(m*n)*m+v/n%m) q܂] obtain⟨f,g,h⟩:=Zt c m n q܂ q.isLt;have e:q܂/(m*n)*m+q܂/n%mYc A k r) _ e];exact ZcZ A B k n _ _ _ a;simp only[Zi] section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Numerics open Model open RationalBinary (floorLog2 scaleByPowerOfTwo scaleByPowerOfTwo_snd_ne_zero) open FloatLib.Numerics (binaryRadix Radix.toReal) lemma bz (e:ٴ):bpow e=(2:ℝ)^e:=by simp[bpow,Formats.Flocq.bpow,binaryRadix,Fa] lemma cW (w:ؼ):π (Bj w)=w:=by simp only[π,Bj,Dn,EQ];exact Ee lemma cU {a b:ٴ} {v:ℝ} (d:bpow a<=v) (e:vlinarith[bpow_le_bpow_of_le h] lemma cB {n d:ٳ} (e:ٴ) (a:n≠0) (b:d≠0):bpow (floorLog2 n d+e)<=n/d*bpow e/\n/d*bpow eAP (Bl n d x).1 (Bl n d x).2=AP (Bl a b r).1 (Bl a b r).2:=λ x r h=>by apply roundQuotientEven_eq_of_rat_eq _ _ _ _ (scaleByPowerOfTwo_snd_ne_zero _ _ _ k) (scaleByPowerOfTwo_snd_ne_zero _ _ _ l);rw[scaleByPowerOfTwo_real,scaleByPowerOfTwo_real];rwa[mul_assoc,<-bpow_add,mul_assoc,<-bpow_add,add_sub_cancel,add_sub_cancel]at h rw[roundRatScaled_false_eq_of_isIEEE f n d e o p k,roundRatScaled_false_eq_of_isIEEE f a b g o q l];simp only;rw[u _ (g+BG (Cb f)) (by rw[j];ring_nf),u _ (BG f߷-Br a b) (by rw[j,(א:BG f߷-Br n d-e=BG f߷-Br a b-g)]),y] lemma N3 (Q:ℚ) (s:ف) (N D:ٳ) (E:ٴ) (b:0 0simp_all);obtain rfl:Q=0:=(by simp[a]);simp[roundRatScaled_num_zero _ _ _ _ b.ne'];rfl have g:(0:ℚ)simp[neg_div] have h:Q.num.natAbs≠0:=by simpa using (show Q≠0 by rw[a];cases s<;>simp[g.ne']) have k:(0:ℝ)push_cast<;>simp[abs_of_pos k] rw[show decide (Q<0)=s by rw[a];cases s<;>simp[g,not_lt.mpr g.le]];cases s;exact cV _ e _ _ _ _ _ _ h Q.den_nz f b.ne' j;rw[roundRatScaled_true_eq_neg_false _ _ _ _ e Q.den_nz,roundRatScaled_true_eq_neg_false _ _ _ _ e b.ne',cV _ e _ _ _ _ _ _ h Q.den_nz f b.ne' j] lemma Zc1 (q u D r:ٳ) (d:2<=u) (f:u%2=0) (e:0.trans ג;rw[bpow_natCast];push_cast;rw[pow_succ];linarith;rw[show((q܀+1:ℕ):ℤ)+1=((q܀+2:ℕ):ℤ) by push_cast;ring,bpow_natCast];push_cast;rw[show q܀+2=q܀+1+1 from rfl,pow_succ];linarith lemma Zc3 (s:ف) (N D:ٳ) (E:ٴ) (a:0simp[n,j]<;>omega . have:¬((q܀:ℤ)+Esimp[j]<;>omega end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Floats.Formats.Flocq open Float.Model.UnpackedFloat open FloatLib.Numerics (binaryRadix Radix.toReal) lemma Zc4 (q:ℚ) (b a:ٳ) (e:ٴ) (d:0(x:ℝ)) g;push_cast at this;rw[this,(ב:(4:ℝ)=2*2),mul_zpow,sq] rw[t,Real.sqrt_mul (by exact_mod_cast d.le),Real.sqrt_sq ה];simp only[bpow,binaryRadix,Fa];push_cast;rw[mul_assoc,<-zpow_add₀ (ב:(2:ℝ)≠0)];simp rw[s]at n o;have u:(nearestEven (scaledMantissa binaryRadix (Model.fexpOf κ) (Db (q:ℝ))))׆=(shiftToTargetExponent (ϓ κ) (Ϗ b a) e (sqrtAccuracy b a)).1.roundedMantissa:=by rw[o,<-r];simp simp only[sqrtMathWord,not_le.mpr d,ש,n,u];rw[Model.roundWithAccuracy_eq_finishRoundedMantissa,Model.shiftToTargetExponent_eq_of_le_targetExponent κ _ e _ l] end @[inline] def Y2 (x:ؽ δ) (base n:ٳ):ٳ:= (ϒ n).foldl (λ b j => let w:=x[base+j]!;if ε w=0 then b else min b (γ w)) 255 @[inline] def Y6 (x:ؽ δ) (base n b0:ٳ):ؽ ٳ:= (ϒ n).foldl (λ a j => let w:=x[base+j]!;ϛ a (ε w*ε w).toUInt64 (2*(γ w-b0))) (Χ 18 0) @[inline] def Y7 (x:ؽ δ) (base n b0:ٳ):ؽ ٳ × ؽ ٳ:= (ϒ n).foldl (λ pq j => let w:=x[base+j]!;if η w then (pq.1,ϛ pq.2 (ε w).toUInt64 (γ w-b0)) else (ϛ pq.1 (ε w).toUInt64 (γ w-b0),pq.2)) (Χ 18 0,Χ 18 0) @[inline] def sqA (num den root:ٳ):ٳ:= if num=root*root*den then 0 else if 4*num δ):δ:= let t:ٴ:=(47-(num0.log2:ٴ)+m.log2+1)/2;let num:=if 0<=t then num0<<<(2*tپ) else num0;let den:=if 0<=t then m else m<<<(2*(-t).toNat);let root:=Ϗ num den;if ރ<=root then sqW num den root (h-t) else fallback () @[inline] def YF (b0 ie:ٳ):ٳ:=min (2*b0) (ie+149)/2*2 noncomputable def Y8 (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):ٳ × ٴ × δ:= let b0:=Y2 x (r*n) n;let pq:=Y7 x (r*n) n b0;let S1:ٴ:=(limbValA pq.1:ٴ)-limbValA pq.2;let T:ٴ:=(n:ٴ)*limbValA (Y6 x (r*n) n b0)-S1*S1;let c:=YF b0 (γ eps);(b0,S1,YaD (Tپ<<<(2*b0-c)+(n*n*ε eps)<<<(γ eps+149-c)) (n*n) (((c:ٴ)-298)/2) λ _ => Ac (ϫ n x r (rowMean n x r)+ς eps)) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat lemma iB (w:δ):γ w<=254:=Zg w lemma lS (m k:ٳ -> ٳ) (d:∀ j,m j<2^64) (e:∀ j,k j/32+1<18) (l:List ٳ) (a:ؽ ٳ) (b:a܃=18) : (l.foldl (λ a j=>ϛ a (m j)߸ (k j)) a)܃=18 /\ ϋ (l.foldl (λ a j=>ϛ a (m j)߸ (k j)) a)܍=ϋ a܍+(l.map λ j=>m j*2^k j).sum:=by induction l generalizing a with |nil=>simp[b] |cons j l f=>simp;obtain⟨g,h⟩:=f (ϛ a (m j)߸ (k j)) (by rwa[addLimbs64_size]);refine⟨g,?_⟩;rw[h,addLimbs64_eq _ _ _ (d j),addLimbs_val _ _ _ (by rw[b];exact e j)];ring lemma lP (x:ؽ δ) (a b:ٳ) (f:ؽ ٳ × ؽ ٳ -> ٳ -> ؽ ٳ × ؽ ٳ) (d:∀ e j,f e j=if η x[a+j]! then (e.1,ϛ e.2 (ε x[a+j]!)߸ (γ x[a+j]! - b)) else (ϛ e.1 (ε x[a+j]!)߸ (γ x[a+j]! - b),e.2)) (l:List ٳ):∀ p q,p܃=18 -> q܃=18 -> (l.foldl f (p,q)).1ٽ=18 /\ (l.foldl f (p,q)).2ٽ=18/\((ϋ (l.foldl f (p,q)).1.toList:ٴ) - ϋ (l.foldl f (p,q)).2.toList)=(ϋ p܍:ٴ)-ϋ q܍+(l.map λ j=>sv x[a+j]! * 2^(γ x[a+j]! - b)).sum:=by induction l<;>intro p q g h;simp[g,h];rename_i j l s;simp only[AO,CR,DV,d];have t:=Ϛ x[a+j]!;have u:=iB x[a+j]!;by_cases k:η x[a+j]! =true;simp only[k,ר];obtain⟨n,o,r⟩:=s p (ϛ q (ε x[a+j]!)߸ (γ x[a+j]!-b)) g (by rw[addLimbs64_size];exact h);refine⟨n,o,?_⟩;rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by rw[h];omega)];simp only[sv,k,ר];push_cast;ring;simp only[k,φ,ש];obtain⟨n,o,r⟩:=s (ϛ p (ε x[a+j]!)߸ (γ x[a+j]!-b)) q (by rw[addLimbs64_size];exact g) h;refine⟨n,o,?_⟩;rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by rw[g];omega)];simp only[sv,k,φ,ש];push_cast;ring lemma fS (f:ٳ -> ℚ) (l:List ٳ) (a:ℚ):l.foldl (λ t j=>t+f j) a=a+(l.map f).sum:=by induction l generalizing a;simp;next j l b=>simp[AO,b,add_assoc] lemma A3 (a b:ٳ):sqrtAccuracy a b=Dc (sqA a b (Ϗ a b)) 4:=by unfold sqrtAccuracy sqA;dsimp only;simp only[sq];split_ifs<;>rfl lemma J9 (N d:ٳ):N/d<=AP N d /\ AP N d<=N/d+1:=by unfold AP;dsimp only;split_ifs<;>omega lemma J5:κ߷=23/\Ct κ߷=ރ/\Ct (κ߷+1)=ނ/\Ef κ = -126/\ BG (Eg κ)=127/\BG κ.bias=127:=ד lemma QW (E F:ٳ):π (Bj (ϥ false E F))=ϥ false E F:=cW _ lemma J4 (r:ٳ) (k:ٴ) (b:ރ<=r) (d:r<ނ) (e:-126<=k) (a:k<=127) : π (BT κ (Cn (ϓ κ) .positive (r,k-23)))=ϥ false (k+127)׆ (r-ރ):=by obtain⟨j,g,f,m,M,o⟩:=J5;rw[show(k-23:ٴ)=k-(κ߷:ٴ) by rw[j];rfl,Model.finishRoundedMantissa_normalized κ .positive r k (by rw[g];exact b) (by rw[f];exact d) (by rw[m];exact e)];erw[Bo κ false r k (by rw[g];exact b) (by rw[f];exact d) (by rw[m];exact e) (by rw[M];exact a)];have h:=QW (k+127)׆ (r-ރ);rwa[BB]at h lemma J6 (k:ٴ) (b:-126<=k) (a:k+1<=127) : π (BT κ (Cn (ϓ κ) .positive (ނ,k-23)))=ϥ false (k+1+127)׆ 0:=by obtain⟨f,g,d,c,i,l⟩:=J5;have h:=Model.finishRoundedMantissa_normalized_carry κ .positive k (by rwa[c]);rw[show(k-23:ٴ)=k-(Fmt߷:ٴ) by rw[f];rfl,show(ނ:ٳ)=Ct (κ߷+1)from d.symm,h];have j:=Bo κ false (Ct κ߷) (k+1) le_rfl (by rw[g,d];decide) (by rw[c];omega) (by rwa[i]);erw[j];have e:=QW (k+1+127)׆ 0;rwa[BB]at e theorem A8 (b d:ٳ) (e:ٴ):sqW b d (Ϗ b d) e=π (BT κ (Bp (ϓ κ) .positive (Ϗ b d) e (sqrtAccuracy b d))):=by have l:=A3 b d;unfold sqW;generalize Ϗ b d=c at l⊢;have j:(ϓ κ).mantissaBits=24:=ד;have k:(ϓ κ).minExponent= -149:=ד;by_cases u:c<ނ<;>simp only[u,ר,ש,CP,add_zero,EU] all_goals split;swap;rfl rename_i v;obtain⟨w,x,A,y,z⟩:=v;have n:sqA b d c<4:=by unfold sqA;split_ifs<;>omega generalize sqA b d c=a at l n⊢;rw[l];have g:=Model.roundWithAccuracy_quotient_eq_finishRoundedMantissa (ϓ κ) .positive (4*c+a) 4 e ב;rw[show(4*c+a)/4=c by omega,show(4*c+a)%4=a by omega]at g;have f:c≠0:=א · have o:=(CH f).mpr (show 2^23<=c by omega);have p:=(Ϻ f).mpr (show c<2^24 by omega);have h:((ϓ κ).targetExponent (Bb c e)-e)׆=0:=by simp only[BH,Bb,j,k];omega rw[g];dsimp only;rw[h];simp only[pow_zero,mul_one,CP,add_zero];obtain⟨q,s⟩:=J9 (4*c+a) 4;generalize AP (4*c+a) 4=r at q s⊢;rw[show e=(e+23)-23 by ring];split next t=>subst t;rw[J6 (e+23) א א];congr 2;omega ·rw[J4 r (e+23) א א א א];congr 2;omega · have o:=(CH f).mpr (show 2^24<=c by omega);have p:=(Ϻ f).mpr (show c<2^25 by omega);have h:((ϓ κ).targetExponent (Bb c e)-e)׆=1:=by simp only[BH,Bb,j,k];omega rw[g];dsimp only;rw[h];simp only[pow_one,EU];obtain⟨q,s⟩:=J9 (4*c+a) (4*2);generalize AP (4*c+a) (4*2)=r at q s⊢;rw[show e+1=(e+24)-23 by ring];split next t=>subst t;rw[J6 (e+24) א א];congr 2;omega ·rw[J4 r (e+24) א א א א];congr 2;omega lemma N1 (a m:ٳ) (h:ٴ) (q:ℚ) (d:0Ac q)=Ac q:=by unfold YaD;simp only[A8];generalize (47-((a܀:ٳ):ٴ)+(m܀:ٳ)+1)/2=t;have e:∀k:ٳ,(2:ℚ)^(2*k)=4^(k:ٴ):=λk=>by rw[pow_mul,ؠ];norm_num by_cases g:0<=t<;>simp only[g,ר,ש]<;>split_ifs with j<;>try rfl all_goals refine Zc4 q _ _ _ d (by first|exact b|rw[Α];exact ϊ b ה) ?_ (by rw[(by norm_num:(2:ٳ)^23=ރ)];exact j);rw[<-f,(by ring: -(h-t)=t-h),zpow_sub₀ ב];simp only[Α];push_cast;rw[e,Cj א];field_simp[zpow_neg] all_goals rw[mul_assoc,<-zpow_add₀ ב];simp lemma Zc7 (w:δ):(sv w:ℚ)^2=(ε w:ℚ)^2:=by unfold sv;split_ifs<;>push_cast<;>ring lemma N0 (a:δ) (b:0<ς a):ς a=(ε a:ℚ)*2^((γ a:ℤ)-149):=by simp only[rationalWord,ϙ]at b⊢;unfold sv at b⊢;split_ifs at b⊢with d;have:(0:ℚ)<=2^((γ a:ٴ)-149):=ה;push_cast at b;nlinarith[(ה:(0:ℚ)<=ε a)];push_cast;ring lemma M9 (x:ؽ δ) (n r a:ٳ) (b:∀ j a<=γ x[r*n+j]!) : (limbValA (Y6 x (r*n) n a):ℚ)*2^((2*a:ℤ)-298)=((ϒ n).map λ j=>(ς x[r*n+j]!)^2).sum:=by unfold Y6;rw[limbValA_eq,(lS (λ j=>ε x[r*n+j]! *ε x[r*n+j]!) (λ j=>2*(γ x[r*n+j]! -a)) (λ j=>by have:=Ϛ x[r*n+j]!;nlinarith) (λ j=>by have:=iB x[r*n+j]!;omega) _ _ ג).2] have e:ϋ (Χ 18 0)܍=0:=ד;rw[e,Β,Nat.cast_list_sum,Df,<-Dg];congr 1;apply Ck;intro j f;have g:=BM.1 f;simp only[Function.comp,ς,ϙ];by_cases d:ε x[r*n+j]! =0 . simp[d,sv] . have h:=b j g d;have k:((2:ℚ)^((γ x[r*n+j]!:ℤ)-149))^2=(2:ℚ)^(2*(γ x[r*n+j]! -a))*2^((2*a:ℤ)-298):=by rw[<-ؠ (2:ℚ) (2*(γ x[r*n+j]! -a)),<-zpow_add₀ ב,<-ؠ _ 2,<-zpow_mul];congr 1;push_cast[h];ring rw[mul_pow,Zc7,k];push_cast;ring lemma M8 (x:ؽ δ) (n r a:ٳ) (b:∀ j a<=γ x[r*n+j]!) : (((limbValA (Y7 x (r*n) n a).1:ℤ)-limbValA (Y7 x (r*n) n a).2:ℤ):ℚ)*2^((a:ℤ)-149)=((ϒ n).map λ j=>ς x[r*n+j]!).sum:=by unfold Y7;rw[limbValA_eq,limbValA_eq,(lP x (r*n) a _ (λ _ _=>rfl) (ϒ n) _ _ ג ג).2.2];have e:ϋ (Χ 18 0)܍=0:=ד;rw[e];push_cast;rw[zero_add,Df,<-Dg];congr 1;apply Ck;intro j f;simp only[Function.comp,rationalWord,ϙ];push_cast;by_cases d:ε x[r*n+j]! =0 . simp[d,sv] . have g:=b j (BM.1 f) d;rw[mul_assoc,<-ؠ,<-zpow_add₀ ב];push_cast[g];ring lemma sm (f:ٳ -> ℚ) (μ:ℚ) (l:List ٳ):(l.map λ j=>(f j-μ)^2).sum=(l.map λ j=>f j^2).sum-2*μ*(l.map f).sum+l.length*μ^2:=by induction l;simp;next j l a=>simp only[CR,DV,Ex,a];push_cast;ring lemma Z2 (x:ؽ δ) (d n j:ٳ) (e:jif ε x[d+j]! =0 then b else min b (γ x[d+j]!)) b<=b/\∀k∈l,ε x[d+k]!≠0->l.foldl (λ b j=>if ε x[d+j]! =0 then b else min b (γ x[d+j]!)) b<=γ x[d+k]! from(H _ 255).2 j (BM.2 e) f intro l;induction l with |nil=>intro b;simp |cons a l p=>intro b;simp only[AO];obtain⟨h,q⟩:=p (if ε x[d+a]! =0 then b else min b (γ x[d+a]!));refine⟨Cp h (by split_ifs<;>omega),λ k g o=>?_⟩;rcases List.mem_cons.1 g with rfl|g;exacts[Cp h (by simp[o]),q k g o] lemma Zc9 (a b:ٳ):YF a b<=2*a/\YF a b<=b+149 /\ (4:ℚ)^(((YF a b:ℤ)-298)/2)=2^((YF a b:ℤ)-298):=by unfold YF;refine⟨א,א,?_⟩;rw[show(4:ℚ)=2^(2:ℤ)from ב,<-zpow_mul];congr 1;omega lemma M7 (A n a b d:ٳ) (e:0by obtain⟨j,_,rfl⟩:=EZ.1 b;positivity) ה lemma V1 (x:ؽ δ) (n:ٳ) (a:δ) (r:ٳ) (b:0(ς x[r*n+j]!-rowMean n x r)^2),zero_add,sm,CM]:ϫ n x r (rowMean n x r)=(((ϒ n).map λj=>(ς x[r*n+j]!)^2).sum-2*rowMean n x r*((ϒ n).map λj=>ς x[r*n+j]!).sum+n*rowMean n x r^2)/n),(by unfold rowMean;rw[fS (λj=>ς x[r*n+j]!),zero_add]:rowMean n x r=((ϒ n).map λj=>ς x[r*n+j]!).sum/n),<-f,<-g,show(2:ℚ)^((2*e:ٴ)-298)=(2^((e:ٴ)-149))^2 by rw[<-ؠ _ 2,<-zpow_mul];congr 1;ring];push_cast;field_simp;ring rw[M7 _ (n*n) e (γ a) (ε a) (ϊ b b),h,show((((n:ٴ)*A-S1*S1)׆:ٳ):ℚ)=(((n:ٴ)*A-S1*S1:ٴ):ℚ) by exact_mod_cast Cj (by have:=M6 n x r (rowMean n x r);rw[h]at this;exact_mod_cast nonneg_of_mul_nonneg_left this (div_pos ה (by exact_mod_cast ϊ b b)):0<=(n:ٴ)*A-S1*S1)];push_cast;ring lemma V0 (x:ؽ δ) (n:ٳ) (a:δ) (r:ٳ) (b:0 ℚ):δ:= if sv dw<=0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let P:=((n:ٴ)*YaF w b0-S1)*sv gw<<<(b0+γ gw-c2) + (n:ٴ)*sv bw*sv dw<<<(γ bw+γ dw-c2) AW (P<0) P.natAbs (n*ε dw) ((c2:ٴ)-149-γ dw) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats lemma eD (d:δ) (h:¬sv d<=0):sv d=ε d/\0 < ε d:=by have a:η d=false:=by by_contra c;simp at c;exact h (by simp[sv,c]) have:sv d=ε d:=by simp[sv,a] exact⟨this,by omega⟩ lemma eP (P:ℤ):(if decide (P<0)=true then -((P.natAbs:ℕ):ℚ) else (P.natAbs:ℚ))=P:=by rw[EA];split_ifs with c<;>simp_all[abs_of_neg,abs_of_nonneg] lemma U8 (n:ٳ) (w e f:δ) (b:ٳ) (g:ٴ) (d:δ) (a:Unit -> ℚ) (j:0 b<=γ w) (l:a ()=(g:ℚ)*2^((b:ٴ)-149)/n) : elL n w e f b g d a=roundRational ((ς w-a ())*ς e/ς d+ς f):=by unfold elL;split_ifs with h;·rfl obtain⟨r,s⟩:=eD d h;refine(N3 _ _ _ _ _ (ϊ j s) (λ p=>by simp at p;omega) ?_).symm;simp only[ς,ϙ,l];rw[eP];generalize q:min (b+γ e) (γ f+γ d)=c;have t:=q▸min_le_left _ _;have u:=q▸min_le_right _ _;simp only[YaF,CV,r];push_cast;have o:(2:ℚ)≠0:=ג;have v:(sv w:ℚ)*2^((γ w:ℤ)-149)=sv w*2^(γ w-b)*2^((b:ℤ)-149):=by by_cases m:ε w=0;·simp[sv,m] rw[mul_assoc,<-ؠ,<-zpow_add₀ o];push_cast[k m];ring have x:(2:ℚ)^((b:ℤ)-149)*2^((γ e:ℤ)-149)=2^((c:ℤ)-149-γ d)*2^((γ d:ℤ)-149)*2^(b+γ e-c):=by rw[<-ؠ,<-zpow_add₀ o,<-zpow_add₀ o,<-zpow_add₀ o];push_cast[t];ring have y:(2:ℚ)^((γ f:ℤ)-149)=2^((c:ℤ)-149-γ d)*2^(γ f+γ d-c):=by rw[<-ؠ,<-zpow_add₀ o];congr 1;push_cast[u];ring rw[v,y];field_simp;linear_combination (((n:ℚ)*sv w*2^(γ w-b)-g)*sv e)*x end @[inline] def p2 (k:ٳ):ٳ:=if k<63 then ((1:ػ)<< ف | .ofNat s=>aa*p2 (s+1) ف | .ofNat s=>a>=b*p2 s | .negSucc s=>a*p2 (s+1)>=b @[inline] def fl2 (a b:ٳ):ٴ:= let i:ٴ:=BG (lg a)-BG (lg b);let l:=if lt2 a b i then i-1 else i;if ge2 a b (l+1) then l+1 else l @[inline] def sc2 (a b:ٳ):ٴ -> ٳ × ٳ | .ofNat s=>(a*p2 s,b) | .negSucc s=>(a,b*p2 (s+1)) @[inline] def YN (s:ف) (N D:ٳ) (E:ٴ):ؼ:= if D==0 then 0x7fc00000 else if N==0 then if s then ߾ else 0 else let r:=fl2 N D;let t:=r+E;if t>127 then if s then 0xff800000 else 0x7f800000 else if t < -150 then if s then ߾ else 0 else if t < -126 then let c:=sc2 N D (E+149);let f:=AP c.1 c.2;if f==0 then if s then ߾ else 0 else match Nat.decLe ރ f with | isTrue _=>ϥ s 1 0 | isFalse _=>ϥ s 0 f else let c:=sc2 N D (23-r);let m:=AP c.1 c.2;let k:=m==ނ;let x:=if k then t+1 else t;let y:=if k then ރ else m;if x>127 then if s then 0xff800000 else 0x7f800000 else ϥ s (Fe (x+127)) (y-ރ) @[inline] def Yap (sa:ف) (a:ٳ) (sb:ف) (b:ٳ):ف × ٳ:= if sa==sb then (sa,a+b) else if b<=a then (sa,a-b) else (sb,b-a) @[inline] def Y3 (s1:ف) (q1 r1:ٳ) (s2:ف) (B D:ٳ):ف × ٳ × ٳ:= if s1==s2 then (s1,q1+B,r1) else if B<=q1 then (s1,q1-B,r1) else if r1=0 then (s2,B-q1,0) else (s2,B-q1-1,D-r1) @[inline] def Ya8 (s:ف) (M:ػ) (E:ٴ):ؼ:= let L:=Yj M;let t:=(Lپ:ٴ)+E;if M=0\/L<24\/t < -126 then YN s Mپ 1 E else let m:=(YK M L).toNat;let k:=m==ނ;let x:=if k then t+1 else t;let y:=if k then ރ else m;if x>127 then if s then 0xff800000 else 0x7f800000 else ϥ s (Fe (x+127)) (y-ރ) @[inline] def Ya9 (s:ف) (M:ٳ) (E:ٴ):ؼ:=if M>>>62=0 then Ya8 s M.toUInt64 E else YN s M 1 E lemma ZE (k:ٳ):p2 k=2^k:=by unfold p2;split;next h=>have a:k߸˧=k:=CG (by unfold Fd;omega);rw[ό,a,ν (א:k<64),Da,Nat.one_shiftLeft];exact ν (DJ ב א) rfl lemma U7 (n:ٳ):lg n=n܀:=by unfold lg;dsimp only;split;rename_i h;by_cases a:n߸=0;have:n=0:=by rw[<-h,a];rfl subst this;decide;rw[Zj _ a,h];rfl lemma U6 (a b:ٳ) (e:ٴ):lt2 a b e=Bi a b e:=by cases e<;>simp[lt2,Bi,ZE,Α] lemma U5 (a b:ٳ) (e:ٴ):ge2 a b e=Bk a b e:=by cases e<;>simp[ge2,Bk,ZE,Α] lemma U4:sc2=Bl:=by funext a b e;cases e<;>simp[sc2,Bl,ZE,Α] lemma M5:fl2=Br:=by funext a b;simp only[fl2,Br,U7,U6,U5] lemma G2 (s:ف) (N D:ٳ) (E:ٴ):YN s N D E=AW s N D E:=by unfold YN;rw[M5,U4];rfl lemma U3 (s:ف) (M:ػ) (E:ٴ):Ya8 s M E=YN s M˧ 1 E:=by unfold Ya8;dsimp only;split;rfl;rename_i h;simp only[not_or,EO]at h;obtain⟨a,k,o⟩:=h;have d:M˧≠0:=λe=>a (σ.mp (by simpa using e));have f:=Zj M a;have p:24<=M˧܀:=by rw[<-f];exact ϐ.1 k obtain⟨g,_,_⟩:=Z7 M a;rw[if_pos (by show 23<=_;omega:κ߷<=M˧܀)]at g;rw[g,BQ,f,show κ߷=23 from rfl];unfold YN;rw[M5,Model.floorLog2_den_one _ d];simp only[show((1:ٳ)==0)=false from rfl,show(M˧==0)=false by simpa using d,(א:(23:ٴ)-(M˧܀:ٴ)=CJ (M˧܀-24)),sc2,ZE,φ,ש,Ϙ,(א:M˧܀-24+1=M˧܀-23)];by_cases j:(M˧܀:ٴ)+E>127;simp only[j,(by intro b;split<;>omega:∀b:ف,(if b=true then (M˧܀:ٴ)+E+1 else (M˧܀:ٴ)+E)>127),ר];simp only[j,ש,show¬(M˧܀:ٴ)+E< -150 by omega,show¬(M˧܀:ٴ)+E< -126 by omega] lemma U2 (s:ف) (M:ٳ) (E:ٴ):Ya9 s M E=YN s M 1 E:=by unfold Ya9;split;next h=>rw[U3];congr 1;simp[Nat.toUInt64];omega rfl def Yh (s:ف) (m:ٳ):ٴ:=if s then -(m:ٴ) else m lemma U1 (d:ف) (a:ٳ) (e:ف) (b:ٳ):Yh (Yap d a e b).1 (Yap d a e b).2=Yh d a+Yh e b:=by unfold Yap;by_cases g:d=e;subst g;cases d<;>simp[Yh];omega;rw[if_neg (by simpa using g)];by_cases f:b<=a;rw[if_pos f];cases d<;>cases e<;>simp_all[Yh,ϗ f]<;>omega;rw[if_neg f];have h:a<=b:=א;cases d<;>cases e<;>simp_all[Yh,ϗ h]<;>omega lemma M4 (s:ف) (m:ٳ):(Yh s m).natAbs=m:=by cases s<;>simp[Yh] lemma M3 (s:ف) (m:ٳ):decide (Yh s m<0)=(s&&m != 0):=by cases s;simp[Yh];by_cases h:m=0;simp[Yh,h];have:(0:ٴ) < m:=Nat.cast_pos.2 (Ο h);simp only[Yh,ר,Left.neg_neg_iff,this,decide_true,Bool.true_and];simpa using h lemma ZF (w:δ):sv w=Yh (η w) (ε w):=rfl lemma U0 (s:ف) (a b:ٳ):Yh s (a*b)=a*Yh s b:=by cases s<;>simp[Yh] lemma Z3 (s:ف) (a b:ٳ):Yh s (a*b)=Yh s a*b:=by cases s<;>simp[Yh] lemma M2 (s t:ف) (a b:ٳ):Yh (s != t) (a*b)=Yh s a*Yh t b:=by cases s<;>cases t<;>simp[Yh] lemma T9 (S:ٴ):Yh (!decide (S<0)) S.natAbs = -S:=by unfold Yh;by_cases h:S<0<;>simp[h]<;>omega lemma T7 (a:ف) (b d:ٳ) (f:ف) (B D:ٳ) (g:dsimp only[Yh]<;>simp<;>ring;obtain rfl:f=!a:=by cases a<;>cases f<;>simp_all rw[if_neg (by cases a<;>simp)];by_cases h:B<=b;rw[if_pos h];refine⟨?_,g⟩;cases a<;>simp only[Yh]<;>simp<;>push_cast[ϗ h]<;>ring;rw[if_neg h];by_cases j:d=0;rw[if_pos j];have k:b<=B:=א;refine⟨?_,by dsimp only;omega⟩;cases a<;>simp only[Yh,j]<;>simp<;>push_cast[ϗ k]<;>ring;rw[if_neg j];have k:b+1<=B:=א;have n:d<=D:=א;refine⟨?_,by dsimp only;omega⟩;cases a<;>simp only[Yh]<;>simp<;>push_cast[ϗ k,ϗ n,Nat.sub_sub]<;>ring lemma T6 (t k D:ٳ):(t/D*k+t%D*k/D)*D+t%D*k%D=t*k:=by rw[ϟ,BU,϶,Nat.mul_right_comm,<-ϟ,϶] lemma J8 (a m D:ٳ):a*m/D=a/D*m+a%D*m/D/\a*m%D=a%D*m%D:=by rcases Ae D with rfl|b;simp;rw[show a*m=a%D*m+D*(a/D*m) by rw[<-ϣ,<-ϟ,Ez],DG _ _ b,CF];exact⟨Ϟ _ _,rfl⟩ lemma gO {α:Type} [Inhabited α] (n:ٳ) (f:ٳ -> α) (k:ٳ) (a:kf i܂)[k]! = f k:=ח lemma M1 (a n:ٳ) (b:δ) (x g:ؽ δ) (h:stableNormDomain a n b x g=true):0 δ):∀ k i (a:ؽ δ),n-i=k -> (Yaq n f i a)܍=a܍ ++ (Bd i (n-i)).map f:=by intro k;induction k<;>intro i a h<;>unfold Yaq;rw[if_neg א];simp[h];next k b=>rw[if_pos א,b (i+1) _ א,Cx,h,Ϩ];simp lemma W4 (n:ٳ) (f:ٳ -> δ):Ybd n f=ڀ n λ i=>f i܂:=by apply ϻ;rw[Ybd,T1 n f _ 0 _ rfl];apply ϩ<;>simp def Ybf (relu:ف) (a b:ؽ δ):ؽ δ:= Ybd aٽ λ i=>act relu (YaX a[i]! b[i]!) lemma W1:Ybf=addReluSpec:=by funext relu a b;simp only[Ybf,W4,ZcQ];apply congrArg;funext i;rw[ح a i܂ i.isLt];rfl lemma H8 (a:ٳ) (g:ٳ -> δ × δ):∀ k j (A B:ؽ δ),a-j=k -> (Yr2 a g j A B).1.toList=A܍++(Bd j (a-j)).map (λ t=>(g t).1)/\(Yr2 a g j A B).2.toList=B܍++(Bd j (a-j)).map (λ t=>(g t).2):=by intro k;induction k<;>intro j A B h<;>unfold Yr2 ·rw[if_neg א];simp[h] rename_i b;rw[if_pos א];dsimp only;obtain⟨d,e⟩:=b (j+1) (A.push (g j).1) (B.push (g j).2) א;rw[d,e,show a-j=(a-(j+1))+1 by omega,Ϩ];simp lemma Y64 {β:Type} (kont:ػ -> ػ -> ػ -> ػ -> β) (q:ف) (X W:ؽ δ) (x1a x2a x3a x4a wa n:ؾ) (h1:x1aپ+nپ<=Xٽ) (h2:x2aپ+nپ<=Xٽ) (h3:x3aپ+nپ<=Xٽ) (h4:x4aپ+nپ<=Xٽ) (hW:waپ+nپ<=Wٽ) (g1:x1aپ+nپ<Λ) (g2:x2aپ+nپ<Λ) (g3:x3aپ+nپ<Λ) (g4:x4aپ+nپ<Λ) (hw:waپ+nپ<Λ) (lo1 lo2 lo3 lo4:ػ) (e1 e2 e3 e4:ٴ) (bw:ؼ) (a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc:ػ) (k:ؾ) : YS64 kont q X W x1a x2a x3a x4a wa n h1 h2 h3 h4 hW g1 g2 g3 g4 hw lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc k=kont (YS6 q X W x1a wa n h1 hW g1 hw lo1 e1 bw a2 a1 a0 ac k) (YS6 q X W x2a wa n h2 hW g2 hw lo2 e2 bw b2 b1 b0 bc k) (YS6 q X W x3a wa n h3 hW g3 hw lo3 e3 bw c2 c1 c0 cc k) (YS6 q X W x4a wa n h4 hW g4 hw lo4 e4 bw d2 d1 d0 dc k):=by induction E:n؛-k؛generalizing a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc k with |zero=> have o:¬k have o:ksimp only[YL16,YL6,Bool.false_eq_true,↓reduceIte]<;>apply p<;>have:=QK n k o<;>omega lemma Y4U (X W b:ؽ δ) (inW i j:ٳ) (bx1 bx2 bx3 bx4 bv:ؼ) : YaU4 X W b inW i j bx1 bx2 bx3 bx4 bv=(let q:=Yu bx1 bv b[j]!-Yp bx1 bv b[j]!<=16&&Yu bx2 bv b[j]!-Yp bx2 bv b[j]!<=16&&Yu bx3 bv b[j]!-Yp bx3 bv b[j]!<=16&&Yu bx4 bv b[j]!-Yp bx4 bv b[j]!<=16;((YaUq X W b inW i j bx1 bv q,YaUq X W b inW (i+1) j bx2 bv q),(YaUq X W b inW (i+2) j bx3 bv q,YaUq X W b inW (i+2+1) j bx4 bv q))):=by unfold YaU4;dsimp only;split . rename_i h;obtain⟨A1,A2,A3,A4,B,C1,C2,C3,C4,D,E,F1,F2,F3,F4,G1,G2,G3,G4⟩:=h;rw[Y64];unfold YaUq;simp only[A1,A2,A3,A4,B,C1,C2,C3,C4,D,E,and_self,↓reduceDIte,F1,F2,F3,F4,G1,G2,G3,G4,Bool.false_eq_true,↓reduceIte,decide_true] . rfl lemma H9 (a:ٳ) (g:ٳ -> (δ × δ) × (δ × δ)):∀ k j (A B C D:ؽ δ),a-j=k -> (Yr4 a g j A B C D).1.toList=A܍++(Bd j (a-j)).map (λ t=>(g t).1.1)/\(Yr4 a g j A B C D).2.1.toList=B܍++(Bd j (a-j)).map (λ t=>(g t).1.2)/\(Yr4 a g j A B C D).2.2.1.toList=C܍++(Bd j (a-j)).map (λ t=>(g t).2.1)/\(Yr4 a g j A B C D).2.2.2.toList=D܍++(Bd j (a-j)).map (λ t=>(g t).2.2):=by intro k;induction k<;>intro j A B C D h<;>unfold Yr4 ·rw[if_neg א];simp[h] rename_i b;rw[if_pos א];dsimp only;obtain⟨u,v,w,x⟩:=b (j+1) (A.push (g j).1.1) (B.push (g j).1.2) (C.push (g j).2.1) (D.push (g j).2.2) א;rw[u,v,w,x,show a-j=(a-(j+1))+1 by omega,Ϩ];simp lemma ZB4 (c a:ٳ) (d4:ٳ -> ف) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (e4:ٳ -> ف) (g4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d:ٳ -> ف) (b:ٳ -> ٳ -> δ × δ) (f:ٳ -> ٳ -> δ) (u:∀ i j,i+3 j f4 i j=((f i j,f (i+1) j),(f (i+2) j,f (i+2+1) j))) (v:∀ i j,i+3 j g4 i j=((f i j,f (i+1) j),(f (i+2) j,f (i+2+1) j))) (g:∀ i j,b i j=(f i j,f (i+1) j)) : ∀ k l (n:ؽ δ),c-l<=k -> YT4l c a d4 f4 e4 g4 d b f l n=Yak c a f l n:=by intro k;induction k with |zero=>intro l n h;unfold YT4l Yak;rw[if_neg א,if_neg א,if_neg א,if_neg א] |succ k p=> intro l n h have Y2:l+1Yak c a f l n=Yak c a f (l+2) (Yaj a f (l+1) 0 (Yaj a f l 0 n)):=λ o=>by conv_lhs=>unfold Yak;rw[if_pos (א:lYak c a f l n=Yak c a f (l+2+2) (Yaj a f (l+2+1) 0 (Yaj a f (l+2) 0 (Yaj a f (l+1) 0 (Yaj a f l 0 n)))):=λ o=>by rw[Y2 (by omega)];conv_lhs=>unfold Yak;rw[if_pos (א:l+2 ٳ -> (δ × δ) × (δ × δ),(∀ j,j F l j=((f l j,f (l+1) j),(f (l+2) j,f (l+2+1) j))) -> (((n++(Yr4 a (F l) 0 (AY a) (AY a) (AY a) (AY a)).1)++(Yr4 a (F l) 0 (AY a) (AY a) (AY a) (AY a)).2.1)++(Yr4 a (F l) 0 (AY a) (AY a) (AY a) (AY a)).2.2.1)++(Yr4 a (F l) 0 (AY a) (AY a) (AY a) (AY a)).2.2.2=Yaj a f (l+2+1) 0 (Yaj a f (l+2) 0 (Yaj a f (l+1) 0 (Yaj a f l 0 n))):=λ F e=>by apply ϻ;obtain⟨q,r,s,t⟩:=H9 a (F l) _ 0 (AY a) (AY a) (AY a) (AY a) rfl;simp only[Array.toList_append,q,r,s,t,D3 a f (l+2+1) _ 0 _ rfl,D3 a f (l+2) _ 0 _ rfl,D3 a f (l+1) _ 0 _ rfl,D3 a f l _ 0 _ rfl];have m:∀ x,x∈Bd 0 (a-0) -> xby simp[List.mem_range'] at h;omega);rw[List.map_congr_left (λ x h=>by rw[e x (m x h)]:∀ x∈Bd 0 (a-0),(F l x).1.1=f l x),List.map_congr_left (λ x h=>by rw[e x (m x h)]:∀ x∈Bd 0 (a-0),(F l x).1.2=f (l+1) x),List.map_congr_left (λ x h=>by rw[e x (m x h)]:∀ x∈Bd 0 (a-0),(F l x).2.1=f (l+2) x),List.map_congr_left (λ x h=>by rw[e x (m x h)]:∀ x∈Bd 0 (a-0),(F l x).2.2=f (l+2+1) x)];simp have Q2:(n++(Yr2 a (b l) 0 (AY a) (AY a)).1)++(Yr2 a (b l) 0 (AY a) (AY a)).2=Yaj a f (l+1) 0 (Yaj a f l 0 n):=by apply ϻ;obtain⟨q,r⟩:=H8 a (b l) _ 0 (AY a) (AY a) rfl;simp only[Array.toList_append,q,r,D3 a f (l+1) _ 0 _ rfl,D3 a f l _ 0 _ rfl,g];simp unfold YT4l;split · rename_i o;rw[Y4 o];split · dsimp only;rw[p _ _ (by omega)];congr 1;exact Q f4 (λ j hj=>u l j o hj) split · dsimp only;rw[p _ _ (by omega)];congr 1;exact Q g4 (λ j hj=>v l j o hj) rw[<-Y4 o,Y2 (by omega)];split · dsimp only;rw[p _ _ (by omega),Q2] · rw[p _ _ (by omega)] split · rename_i o o2;rw[Y2 o2];split · dsimp only;rw[p _ _ (by omega),Q2] · rw[p _ _ (by omega)] rename_i o o2;split · rename_i o3;unfold Yak;rw[if_pos o3];unfold Yak;rw[if_neg (by omega)] · unfold Yak;rw[if_neg ‹_›] lemma Yc64 (q:ف) (X W:ؽ δ) (xa w1a w2a w3a w4a n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW1:w1aپ+nپ<=Wٽ) (hW2:w2aپ+nپ<=Wٽ) (hW3:w3aپ+nپ<=Wٽ) (hW4:w4aپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw1:w1aپ+nپ<Λ) (hw2:w2aپ+nپ<Λ) (hw3:w3aپ+nپ<Λ) (hw4:w4aپ+nپ<Λ) (lo1 lo2 lo3 lo4:ػ) (e1 e2 e3 e4:ٴ) (bw1 bw2 bw3 bw4:ؼ) (a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc:ػ) (k:ؾ) : YS6c4 q X W xa w1a w2a w3a w4a n hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw1 bw2 bw3 bw4 a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc k=((YS6 q X W xa w1a n hX hW1 hx hw1 lo1 e1 bw1 a2 a1 a0 ac k,YS6 q X W xa w2a n hX hW2 hx hw2 lo2 e2 bw2 b2 b1 b0 bc k),(YS6 q X W xa w3a n hX hW3 hx hw3 lo3 e3 bw3 c2 c1 c0 cc k,YS6 q X W xa w4a n hX hW4 hx hw4 lo4 e4 bw4 d2 d1 d0 dc k)):=by induction E:n؛-k؛generalizing a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc k with |zero=> have o:¬k have o:ksimp only[YL16,YL6,Bool.false_eq_true,↓reduceIte]<;>apply p<;>have:=QK n k o<;>omega lemma Yuc4 (X W b:ؽ δ) (inW i j:ٳ) (bx bv1 bv2 bv3 bv4:ؼ) : YaUc4 X W b inW i j bx bv1 bv2 bv3 bv4=(let q:=Yu bx bv1 b[j]!-Yp bx bv1 b[j]!<=16&&Yu bx bv2 b[j+1]!-Yp bx bv2 b[j+1]!<=16&&Yu bx bv3 b[j+2]!-Yp bx bv3 b[j+2]!<=16&&Yu bx bv4 b[j+2+1]!-Yp bx bv4 b[j+2+1]!<=16;((YaUq X W b inW i j bx bv1 q,YaUq X W b inW i (j+1) bx bv2 q),(YaUq X W b inW i (j+2) bx bv3 q,YaUq X W b inW i (j+2+1) bx bv4 q))):=by unfold YaUc4;dsimp only;split . rename_i h;obtain⟨A,B1,B2,B3,B4,C,G1,G2,G3,G4,E,F1,F2,F3,F4,H1,H2,H3,H4⟩:=h;rw[Yc64];unfold YaUq;simp only[A,B1,B2,B3,B4,C,G1,G2,G3,G4,E,and_self,↓reduceDIte,F1,F2,F3,F4,H1,H2,H3,H4,Bool.false_eq_true,↓reduceIte,decide_true] . rfl lemma Zj4 (hw:ٳ) (f:ٳ -> ٳ -> δ) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4:ٳ -> ف) (ch:ٳ) (u:∀ j,j+3 f4 ch j=((f ch j,f ch (j+1)),(f ch (j+2),f ch (j+2+1)))) : ∀ k j (n:ؽ δ),hw-j<=k -> Yaj4 hw f f4 d4 ch j n=Yaj hw f ch j n:=by have Y1:∀ m (n:ؽ δ),mYaj hw f ch m n=Yaj hw f ch (m+1) (n.push (f ch m)):=λ m n o=>by conv_lhs=>unfold Yaj;rw[if_pos o] intro k;induction k with |zero=>intro j n h;unfold Yaj4 Yaj;rw[if_neg א,if_neg א,if_neg א] |succ k p=> intro j n h;unfold Yaj4;split · rename_i o;split · dsimp only;rw[p _ _ (by omega),u j o,Y1 j n (by omega),Y1 (j+1) _ (by omega),Y1 (j+1+1) _ (by omega),Y1 (j+1+1+1) _ (by omega)] · rw[p _ _ (by omega),Y1 j n (by omega)] split · rename_i o o2;rw[p _ _ (by omega),Y1 j n o2] · unfold Yaj;rw[if_neg ‹_›] lemma Zk4 (c hw:ٳ) (f:ٳ -> ٳ -> δ) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4:ٳ -> ف) (u:∀ i j,i j+3 f4 i j=((f i j,f i (j+1)),(f i (j+2),f i (j+2+1)))) : ∀ k l (n:ؽ δ),c-l<=k -> Yak4 c hw f f4 d4 l n=Yak c hw f l n:=by intro k;induction k with |zero=>intro l n h;unfold Yak4 Yak;rw[if_neg א,if_neg א] |succ k p=>intro l n h;unfold Yak4 Yak;by_cases o:lu l j o hj) _ 0 _ le_rfl];rw[if_neg o,if_neg o] lemma ZB6 (c a:ٳ) (f4c:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4c:ٳ -> ف) (d4:ٳ -> ف) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (e4:ٳ -> ف) (g4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d:ٳ -> ف) (b:ٳ -> ٳ -> δ × δ) (f:ٳ -> ٳ -> δ) (w:∀ i j,i j+3 f4c i j=((f i j,f i (j+1)),(f i (j+2),f i (j+2+1)))) (u:∀ i j,i+3 j f4 i j=((f i j,f (i+1) j),(f (i+2) j,f (i+2+1) j))) (v:∀ i j,i+3 j g4 i j=((f i j,f (i+1) j),(f (i+2) j,f (i+2+1) j))) (e:∀ i j,b i j=(f i j,f (i+1) j)) : (if c<2 then Yak4 c a f f4c d4c 0 (AY (c*a)) else YT4l c a d4 f4 e4 g4 d b f 0 (AY (c*a)))=YT c a f:=by split;exact Zk4 c a f f4c d4c w _ 0 _ le_rfl;exact ZB4 c a d4 f4 e4 g4 d b f u v e _ 0 _ le_rfl lemma ZcC:YaV=linearSpec:=by funext m a o p X W b;unfold YaV linearSpec linearWith;dsimp only rw[ZB6 _ _ _ _ _ _ _ _ _ _ _ (λ i j hi hj=>by simp (disch:=first|omega|simp_all) only[Yuc4,Ze,ZcBe]) (λ i j hi hj=>by simp (disch:=first|omega|simp_all) only[Y4U,Ze,ZcBe]) (λ i j hi hj=>by simp (disch:=first|omega|simp_all) only[Y4U,Ze,ZcBe]) (λ i j=>rfl),ZB _ _ _ rfl]<;>congr 1<;>funext q<;>have f:=q.isLt<;>have h:=CU (Ek f)<;>have e:=ϕ (f.trans_eq (Θ m o)) <;>rw[Ze m (Yc X a) _ e,Ze o (Yc W a) _ (Ε q܂ h),ZcB] noncomputable def MYba (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ):Word := if sv dw <= 0 then roundRational ((rationalWord w-mean ())*rationalWord gw/rationalWord dw+rationalWord bw) else let c2:=min (b0+idxOf gw) (idxOf bw+idxOf dw) let c:=Yap (signOf w) (n*(mantOf w*p2 (idxOf w-b0))) (!(S1 < 0)) S1.natAbs let D:=n*mantOf dw let t1:=c.2*mantOf gw let k1:=p2 (b0+idxOf gw-c2) let ra:=t1%D*k1 let Q:=Y3 (c.1 != signOf gw) (t1/D*k1+ra/D) (ra%D) (signOf bw) (mantOf bw*p2 (idxOf bw+idxOf dw-c2)) D if 16777216 <= Q.2.1 then Ya9 Q.1 (2*Q.2.1+(if Q.2.2=0 then 0 else 1)) ((c2:Int)-150-idxOf dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:Int)-149-idxOf dw) lemma Zdf (n:Nat):lg n=n.log2:=by unfold lg;dsimp only;split . rename_i h;by_cases h0:n.toUInt64=0 . have:n=0:=by rw [<- h,h0]; rfl subst this decide . rw [Zj _ h0,h] . rfl lemma Zbo:fl2=FloatLib.Numerics.RationalBinary.floorLog2:=by funext a b;simp only [fl2,FloatLib.Numerics.RationalBinary.floorLog2,Zdf,U6,U5] lemma Zdr (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ) (hn:0 < n) : MYba n w gw bw b0 S1 dw mean=elL n w gw bw b0 S1 dw mean:=by unfold MYba elL;split . rfl . rename_i hd have hs:signOf dw=false:=by by_contra c; simp at c; exact hd (by simp [sv,c]) have hm:0 < mantOf dw:=by by_contra c; exact hd (by simp [sv,hs]; omega) have h4:sv dw=mantOf dw:=by simp [sv,hs] simp only [U2] generalize min (b0+idxOf gw) (idxOf bw+idxOf dw)=c2 generalize h3:Yap (signOf w) (n*(mantOf w*p2 (idxOf w-b0))) (!decide (S1 < 0)) S1.natAbs=c have hc:(n:Int)*YaF w b0-S1=Yh c.1 c.2:=by rw [<- h3,U1,U0,Z3,T9,YaF,Int.shiftLeft_eq,ZF,ZE] push_cast; ring have hp : ∀ e,(2:Int)^e=((p2 e:Nat):Int):=λ e=>by rw [ZE]; push_cast; rfl rw [hc,h4,ZF gw,ZF bw,Int.shiftLeft_eq,Int.shiftLeft_eq,hp,hp] generalize p2 (b0+idxOf gw-c2)=k1 generalize p2 (idxOf bw+idxOf dw-c2)=k2 have hD:0 < n*mantOf dw:=Nat.mul_pos hn hm rw [show Yh c.1 c.2*(Yh (signOf gw) (mantOf gw)*(k1:Int)) + n*Yh (signOf bw) (mantOf bw)*(mantOf dw*(k2:Int)) = Yh (c.1 != signOf gw) (c.2*mantOf gw*k1)+Yh (signOf bw) (mantOf bw*k2*(n*mantOf dw)) by rw [Z3,M2,Z3,Z3]; push_cast; ring] generalize c.2*mantOf gw=t1 generalize mantOf bw*k2=B generalize n*mantOf dw=D at hD ⊢ obtain ⟨hv,hr⟩:=T7 (c.1 != signOf gw) (t1/D*k1+t1%D*k1/D) (t1%D*k1%D) (signOf bw) B D (Nat.mod_lt _ hD) rw [T6] at hv;rw [<- hv,M4,M3];generalize Y3 (c.1 != signOf gw) (t1/D*k1+t1%D*k1/D) (t1%D*k1%D) (signOf bw) B D=Q at hr ⊢ split . rename_i hq;have h0:(Q.2.1*D+Q.2.2)/D=Q.2.1:=by rw [Nat.add_comm,Nat.add_mul_div_right _ _ hD,Nat.div_eq_of_lt hr,Nat.zero_add] have h2:Q.2.1*D+Q.2.2≠0:=by simp;omega have h1:=Zc3 Q.1 (Q.2.1*D+Q.2.2) D ((c2:Int)-149-idxOf dw) hD (by rw [h0]; exact hq) have h5:(Q.2.1*D+Q.2.2)%D=Q.2.2:=by rw [Nat.add_comm,Nat.add_mul_mod_self_right,Nat.mod_eq_of_lt hr] rw [h0,h5,show (c2:Int)-149-idxOf dw-1=(c2:Int)-150-idxOf dw by ring] at h1;rw [G2,h1,show (Q.2.1*D+Q.2.2 != 0)=true by simpa using h2,Bool.and_true] . rw [G2] noncomputable def elS (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ):Word := if sv dw <= 0 then roundRational ((rationalWord w-mean ())*rationalWord gw/rationalWord dw+rationalWord bw) else let c2:=min (b0+idxOf gw) (idxOf bw+idxOf dw) let c:=Yap (signOf w) (n*(mantOf w*p2 (idxOf w-b0))) (!(S1 < 0)) S1.natAbs let D:=n*mantOf dw let r0:=c.2%D*mantOf gw let k1:=p2 (b0+idxOf gw-c2) let ra:=r0%D*k1 let Q:=Y3 (c.1 != signOf gw) ((c.2/D*mantOf gw+r0/D)*k1+ra/D) (ra%D) (signOf bw) (mantOf bw*p2 (idxOf bw+idxOf dw-c2)) D if 16777216 <= Q.2.1 then Ya9 Q.1 (2*Q.2.1+(if Q.2.2=0 then 0 else 1)) ((c2:Int)-150-idxOf dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:Int)-149-idxOf dw) lemma elS_eq (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ): elS n w gw bw b0 S1 dw mean=MYba n w gw bw b0 S1 dw mean:=by unfold elS MYba;dsimp only generalize Yap (signOf w) (n*(mantOf w*p2 (idxOf w-b0))) (!decide (S1 < 0)) S1.natAbs=c generalize n*mantOf dw=D rw [(J8 c.2 (mantOf gw) D).1,(J8 c.2 (mantOf gw) D).2] @[inline] def u2a (h l t:UInt64):UInt64×UInt64:=let l':=l+t;(h+(if l' < l then 1 else 0),l') lemma u2a_v (h l t:UInt64) (hb:h.toNat*18446744073709551616+l.toNat+t.toNat < 340282366920938463463374607431768211456) : (u2a h l t).1.toNat*18446744073709551616+(u2a h l t).2.toNat=h.toNat*18446744073709551616+l.toNat+t.toNat:=by unfold u2a; dsimp only have hl:=l.toNat_lt; have ht:=t.toNat_lt; have hh:=h.toNat_lt by_cases c:l.toNat+t.toNat < 18446744073709551616 · have e:(l+t).toNat=l.toNat+t.toNat:=by rw [UInt64.toNat_add]; exact Nat.mod_eq_of_lt c have nc:¬ (l+t < l):=by rw [UInt64.lt_iff_toNat_lt, e]; omega simp only [nc, if_false, e]; rw [UInt64.toNat_add]; simp; omega · have e:(l+t).toNat=l.toNat+t.toNat-18446744073709551616:=by rw [UInt64.toNat_add]; omega have cc:l+t < l:=by rw [UInt64.lt_iff_toNat_lt, e]; omega simp only [cc, if_true, e]; rw [UInt64.toNat_add]; simp; omega lemma qsplit (m s:Nat) (hm:m < 2^24) (hs:s <= 36) : (if 2*s.toUInt64 < 64 then ((m.toUInt64*m.toUInt64)>>>1)>>>(63-2*s.toUInt64) else (m.toUInt64*m.toUInt64)<<<(2*s.toUInt64-64)).toNat*18446744073709551616+(if 2*s.toUInt64 < 64 then (m.toUInt64*m.toUInt64)<<<(2*s.toUInt64) else 0).toNat=m*m*2^(2*s):=by have eq:(m.toUInt64*m.toUInt64).toNat=m*m:=by rw [UInt64.toNat_mul, UInt64.toNat_ofNat_of_lt' (by unfold UInt64.size; omega)]; exact Nat.mod_eq_of_lt (by nlinarith) have es:(2*s.toUInt64).toNat=2*s:=by rw [UInt64.toNat_mul, UInt64.toNat_ofNat_of_lt' (by unfold UInt64.size; omega)]; simp; omega have hq:m*m < 2^48:=by nlinarith have h64:(64:UInt64).toNat=64:=rfl by_cases c:2*s < 64 · have c':2*s.toUInt64 < 64:=by rw [UInt64.lt_iff_toNat_lt, es, h64]; exact c simp only [c', if_true] have e63:(63-2*s.toUInt64).toNat=63-2*s:=by rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le, es]; show 2*s <= 63; omega), es]; rfl rw [UInt64.toNat_shiftRight, UInt64.toNat_shiftRight, UInt64.toNat_shiftLeft, eq, es, e63] simp only [Nat.shiftRight_eq_div_pow, Nat.shiftLeft_eq, show (1:UInt64).toNat=1 from rfl] rw [Nat.mod_eq_of_lt (show 63-2*s < 64 by omega), Nat.mod_eq_of_lt c, Nat.div_div_eq_div_mul] have e1:m*m/(2^(1%64)*2^(63-2*s))=m*m*2^(2*s)/2^64:=by rw [show (2:Nat)^64=(2^(1%64)*2^(63-2*s))*2^(2*s) by rw [<- pow_add, <- pow_add]; congr 1; omega, Nat.mul_div_mul_right _ _ (by positivity)] rw [e1]; have:=Nat.div_add_mod (m*m*2^(2*s)) (2^64); rw [Nat.mul_comm] at this; norm_num at this ⊢; exact this · have c':¬ (2*s.toUInt64 < 64):=by rw [UInt64.lt_iff_toNat_lt, es, h64]; exact c simp only [c', if_false] have e2:(2*s.toUInt64-64).toNat=2*s-64:=by rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le, es, h64]; omega), es, h64] rw [UInt64.toNat_shiftLeft, eq, e2, Nat.shiftLeft_eq, Nat.mod_eq_of_lt (show 2*s-64 < 64 by omega)] have hb:m*m*2^(2*s-64) < 2^64:=by calc m*m*2^(2*s-64) < 2^48*2^(2*s-64):=by apply Nat.mul_lt_mul_of_pos_right hq; positivity _ <= 2^48*2^8:=by apply Nat.mul_le_mul_left; apply Nat.pow_le_pow_right <;> omega _ < 2^64:=by norm_num rw [Nat.mod_eq_of_lt hb]; simp only [show (0:UInt64).toNat=0 from rfl, add_zero] rw [show (2:Nat)^(2*s)=2^(2*s-64)*2^64 by rw [<- pow_add]; congr 1; omega]; norm_num; ring noncomputable def rsU (x:Array Word) (base n b0 j:Nat) (ph pl nh nl qh ql:UInt64) (ok:Bool):Bool×Nat×Nat×Nat:= if j < n then let w:=x[base+j]! let m:=(mantOf w).toUInt64 let s:=(idxOf w-b0).toUInt64 let t:=m<<>>1)>>>(63-2*s) else q<<<(2*s-64)) let ok':=ok&&(mantOf w=0||idxOf w-b0 <= 36) if signOf w then let p:=u2a nh nl t; rsU x base n b0 (j+1) ph pl p.1 p.2 qh' a.2 ok' else let p:=u2a ph pl t; rsU x base n b0 (j+1) p.1 p.2 nh nl qh' a.2 ok' else (ok&&n<256,ph.toNat<<<64+pl.toNat,nh.toNat<<<64+nl.toNat,qh.toNat<<<64+ql.toNat) termination_by n-j lemma rsU_ok (x:Array Word) (base n b0:Nat) : ∀ k j ph pl nh nl qh ql ok, n-j=k -> (rsU x base n b0 j ph pl nh nl qh ql ok).1=true -> ok=true /\ n < 256 /\ ∀ t,j <= t -> t < n -> (mantOf x[base+t]! = 0 \/ idxOf x[base+t]!-b0 <= 36):=by intro k; induction k with | zero=>intro j ph pl nh nl qh ql ok hk h; unfold rsU at h; rw [if_neg (by omega)] at h; simp at h; exact ⟨h.1,h.2,λ t h1 h2=>by omega⟩ | succ k ih=> intro j ph pl nh nl qh ql ok hk h; unfold rsU at h; rw [if_pos (by omega)] at h; dsimp only at h split at h all_goals (obtain ⟨o1,o2,o3⟩:=ih (j+1) _ _ _ _ _ _ _ (by omega) h; simp only [Bool.and_eq_true,Bool.or_eq_true,decide_eq_true_eq] at o1 refine ⟨o1.1,o2,λ t h1 h2=>?_⟩; rcases Nat.eq_or_lt_of_le h1 with rfl|h1 · exact o1.2 · exact o3 t (by omega) h2) lemma rsU_val (x:Array Word) (base n b0:Nat) : ∀ k j ph pl nh nl qh ql ok, n-j=k -> (∀ t,j <= t -> t < n -> (mantOf x[base+t]! = 0 \/ idxOf x[base+t]!-b0 <= 36)) -> ph.toNat*18446744073709551616+pl.toNat+((List.range' j (n-j)).map λ t=>if signOf x[base+t]! then 0 else mantOf x[base+t]!*2^(idxOf x[base+t]!-b0)).sum < 340282366920938463463374607431768211456 -> nh.toNat*18446744073709551616+nl.toNat+((List.range' j (n-j)).map λ t=>if signOf x[base+t]! then mantOf x[base+t]!*2^(idxOf x[base+t]!-b0) else 0).sum < 340282366920938463463374607431768211456 -> qh.toNat*18446744073709551616+ql.toNat+((List.range' j (n-j)).map λ t=>mantOf x[base+t]!*mantOf x[base+t]!*2^(2*(idxOf x[base+t]!-b0))).sum < 340282366920938463463374607431768211456 -> (rsU x base n b0 j ph pl nh nl qh ql ok).2.1=ph.toNat*18446744073709551616+pl.toNat+((List.range' j (n-j)).map λ t=>if signOf x[base+t]! then 0 else mantOf x[base+t]!*2^(idxOf x[base+t]!-b0)).sum /\ (rsU x base n b0 j ph pl nh nl qh ql ok).2.2.1=nh.toNat*18446744073709551616+nl.toNat+((List.range' j (n-j)).map λ t=>if signOf x[base+t]! then mantOf x[base+t]!*2^(idxOf x[base+t]!-b0) else 0).sum /\ (rsU x base n b0 j ph pl nh nl qh ql ok).2.2.2=qh.toNat*18446744073709551616+ql.toNat+((List.range' j (n-j)).map λ t=>mantOf x[base+t]!*mantOf x[base+t]!*2^(2*(idxOf x[base+t]!-b0))).sum:=by intro k; induction k with | zero=>intro j ph pl nh nl qh ql ok hk hg bP bN bQ; unfold rsU; rw [if_neg (by omega)]; simp [hk, Nat.shiftLeft_eq] | succ k ih=> intro j ph pl nh nl qh ql ok hk hg bP bN bQ have hj:j < n:=by omega have e2:n-(j+1)=k:=by omega rw [hk,List.range'_succ] at bP bN bQ ⊢ simp only [List.map_cons,List.sum_cons] at bP bN bQ ⊢ unfold rsU; rw [if_pos hj]; dsimp only have hgj:=hg j (le_refl _) hj have hg':(∀ t,j+1 <= t -> t < n -> (mantOf x[base+t]! = 0 \/ idxOf x[base+t]!-b0 <= 36)):=λ t h1 h2=>hg t (by omega) h2 generalize x[base+j]! = w at hgj bP bN bQ ⊢ have hm:=mantOf_lt_24 w have hi:=iB w have em:(mantOf w).toUInt64.toNat=mantOf w:=UInt64.toNat_ofNat_of_lt' (by unfold UInt64.size; omega) have es:(idxOf w-b0).toUInt64.toNat=idxOf w-b0:=UInt64.toNat_ofNat_of_lt' (by unfold UInt64.size; omega) have et:((mantOf w).toUInt64<<<(idxOf w-b0).toUInt64).toNat=mantOf w*2^(idxOf w-b0):=by rcases hgj with h0|h36 · rw [h0]; simp · rw [UInt64.toNat_shiftLeft,em,es,Nat.shiftLeft_eq,Nat.mod_eq_of_lt (show idxOf w-b0 < 64 by omega)] apply Nat.mod_eq_of_lt calc mantOf w*2^(idxOf w-b0) < 2^24*2^36:=Nat.mul_lt_mul_of_lt_of_le hm (Nat.pow_le_pow_right (by norm_num) h36) (by positivity) _ < 2^64:=by norm_num have eq2:(if 2*(idxOf w-b0).toUInt64 < 64 then (((mantOf w).toUInt64*(mantOf w).toUInt64)>>>1)>>>(63-2*(idxOf w-b0).toUInt64) else ((mantOf w).toUInt64*(mantOf w).toUInt64)<<<(2*(idxOf w-b0).toUInt64-64)).toNat*18446744073709551616+(if 2*(idxOf w-b0).toUInt64 < 64 then ((mantOf w).toUInt64*(mantOf w).toUInt64)<<<(2*(idxOf w-b0).toUInt64) else 0).toNat=mantOf w*mantOf w*2^(2*(idxOf w-b0)):=by rcases hgj with h0|h36 · rw [h0]; simp · exact qsplit _ _ hm h36 generalize ((mantOf w).toUInt64<<<(idxOf w-b0).toUInt64)=T at et ⊢ generalize (if 2*(idxOf w-b0).toUInt64 < 64 then ((mantOf w).toUInt64*(mantOf w).toUInt64)<<<(2*(idxOf w-b0).toUInt64) else 0)=LO at eq2 ⊢ generalize (if 2*(idxOf w-b0).toUInt64 < 64 then (((mantOf w).toUInt64*(mantOf w).toUInt64)>>>1)>>>(63-2*(idxOf w-b0).toUInt64) else ((mantOf w).toUInt64*(mantOf w).toUInt64)<<<(2*(idxOf w-b0).toUInt64-64))=HI at eq2 ⊢ have hLO:LO.toNat <= mantOf w*mantOf w*2^(2*(idxOf w-b0)):=by rw [<- eq2]; exact Nat.le_add_left _ _ have ea:=u2a_v qh ql LO (lt_of_le_of_lt (Nat.add_le_add_left (le_trans hLO (Nat.le_add_right _ _)) _) bQ) generalize u2a qh ql LO=A at ea ⊢ have k1:(A.1.toNat+HI.toNat)*18446744073709551616 < 18446744073709551616*18446744073709551616:=by calc (A.1.toNat+HI.toNat)*18446744073709551616 <= A.1.toNat*18446744073709551616+A.2.toNat+HI.toNat*18446744073709551616:=by rw [Nat.add_mul]; exact Nat.add_le_add_right (Nat.le_add_right _ _) _ _ = qh.toNat*18446744073709551616+ql.toNat+mantOf w*mantOf w*2^(2*(idxOf w-b0)):=by rw [ea, <- eq2]; ring _ <= qh.toNat*18446744073709551616+ql.toNat+(mantOf w*mantOf w*2^(2*(idxOf w-b0))+((List.map (fun t => mantOf x[base + t]! * mantOf x[base + t]! * 2 ^ (2 * (idxOf x[base + t]! - b0))) (List.range' (j + 1) k)).sum)):=Nat.add_le_add_left (Nat.le_add_right _ _) _ _ < 18446744073709551616*18446744073709551616:=bQ have eqh:(A.1+HI).toNat=A.1.toNat+HI.toNat:=by rw [UInt64.toNat_add]; exact Nat.mod_eq_of_lt (Nat.lt_of_mul_lt_mul_right k1) have eQ:(A.1.toNat+HI.toNat)*18446744073709551616+A.2.toNat=qh.toNat*18446744073709551616+ql.toNat+mantOf w*mantOf w*2^(2*(idxOf w-b0)):=by rw [Nat.add_mul]; linarith have bQ':(A.1+HI).toNat*18446744073709551616+A.2.toNat+((List.map (fun t => mantOf x[base + t]! * mantOf x[base + t]! * 2 ^ (2 * (idxOf x[base + t]! - b0))) (List.range' (j + 1) k)).sum) < 340282366920938463463374607431768211456:=by rw [eqh,eQ,Nat.add_assoc]; exact bQ by_cases hs:signOf w = true · simp only [hs,if_true,zero_add] at bP bN ⊢ have ep:=u2a_v nh nl T (lt_of_le_of_lt (Nat.add_le_add_left (by rw [et]; exact Nat.le_add_right _ _) _) bN) generalize u2a nh nl T=Pp at ep ⊢ obtain ⟨r1,r2,r3⟩:=ih (j+1) ph pl Pp.1 Pp.2 (A.1+HI) A.2 _ e2 hg' (by rw [e2]; exact bP) (by rw [e2,ep,et,Nat.add_assoc]; exact bN) (by rw [e2]; exact bQ') rw [e2] at r1 r2 r3; rw [r1,r2,r3]; refine ⟨rfl,by rw [ep,et]; ring,by rw [eqh]; linarith⟩ · simp only [hs,Bool.false_eq_true,if_false,zero_add] at bP bN ⊢ have ep:=u2a_v ph pl T (lt_of_le_of_lt (Nat.add_le_add_left (by rw [et]; exact Nat.le_add_right _ _) _) bP) generalize u2a ph pl T=Pp at ep ⊢ obtain ⟨r1,r2,r3⟩:=ih (j+1) Pp.1 Pp.2 nh nl (A.1+HI) A.2 _ e2 hg' (by rw [e2,ep,et,Nat.add_assoc]; exact bP) (by rw [e2]; exact bN) (by rw [e2]; exact bQ') rw [e2] at r1 r2 r3; rw [r1,r2,r3]; refine ⟨by rw [ep,et]; ring,rfl,by rw [eqh]; linarith⟩ lemma sumB (l:List Nat) (f:Nat -> Nat) (B:Nat) (h:∀ t ∈ l,f t <= B) : (l.map f).sum <= l.length*B:=by have:=List.sum_le_card_nsmul (l.map f) B (λ y hy=>by obtain ⟨t,ht,rfl⟩:=List.mem_map.1 hy; exact h t ht) simpa using this lemma sdif (l:List Nat) (f g:Nat -> Nat) (F:Nat -> Int) (h:∀ t,(f t:Int)-g t=F t) : ((l.map f).sum:Int)-(l.map g).sum=(l.map F).sum:=by induction l with | nil=>simp | cons a l ih=>simp only [List.map_cons,List.sum_cons]; push_cast; have:=h a; push_cast at ih; linarith lemma rsU_lim (x:Array Word) (base n b0:Nat) (h:(rsU x base n b0 0 0 0 0 0 0 0 true).1=true) : ((rsU x base n b0 0 0 0 0 0 0 0 true).2.1:Int)-(rsU x base n b0 0 0 0 0 0 0 0 true).2.2.1=(limbValA (Y7 x base n b0).1:Int)-limbValA (Y7 x base n b0).2 /\ (rsU x base n b0 0 0 0 0 0 0 0 true).2.2.2=limbValA (Y6 x base n b0):=by obtain ⟨-,hn,hg⟩:=rsU_ok x base n b0 _ 0 0 0 0 0 0 0 true rfl h have tP:∀ t ∈ List.range' 0 (n-0),mantOf x[base+t]!*2^(idxOf x[base+t]!-b0) <= 2^60:=by intro t ht; have h1:=List.mem_range'_1.1 ht; have hm:=mantOf_lt_24 x[base+t]! rcases hg t (by omega) (by omega) with h0|h36 · rw [h0]; simp · calc mantOf x[base+t]!*2^(idxOf x[base+t]!-b0) <= 2^24*2^36:=Nat.mul_le_mul (by omega) (Nat.pow_le_pow_right (by norm_num) h36) _ = 2^60:=by norm_num have tQ:∀ t ∈ List.range' 0 (n-0),mantOf x[base+t]!*mantOf x[base+t]!*2^(2*(idxOf x[base+t]!-b0)) <= 2^120:=by intro t ht; have h1:=List.mem_range'_1.1 ht; have hm:=mantOf_lt_24 x[base+t]! rcases hg t (by omega) (by omega) with h0|h36 · rw [h0]; simp · calc mantOf x[base+t]!*mantOf x[base+t]!*2^(2*(idxOf x[base+t]!-b0)) <= 2^24*2^24*2^72:=Nat.mul_le_mul (Nat.mul_le_mul (by omega) (by omega)) (Nat.pow_le_pow_right (by norm_num) (by omega)) _ = 2^120:=by norm_num have sP:=sumB _ (λ t=>if signOf x[base+t]! then 0 else mantOf x[base+t]!*2^(idxOf x[base+t]!-b0)) (2^60) (λ t ht=>by split <;> [exact Nat.zero_le _; exact tP t ht]) have sN:=sumB _ (λ t=>if signOf x[base+t]! then mantOf x[base+t]!*2^(idxOf x[base+t]!-b0) else 0) (2^60) (λ t ht=>by split <;> [exact tP t ht; exact Nat.zero_le _]) have sQ:=sumB _ (λ t=>mantOf x[base+t]!*mantOf x[base+t]!*2^(2*(idxOf x[base+t]!-b0))) (2^120) tQ simp only [List.length_range'] at sP sN sQ obtain ⟨v1,v2,v3⟩:=rsU_val x base n b0 _ 0 0 0 0 0 0 0 true rfl (λ t _ ht=>hg t (by omega) ht) (by simp only [show (0:UInt64).toNat=0 from rfl]; norm_num at sP ⊢; omega) (by simp only [show (0:UInt64).toNat=0 from rfl]; norm_num at sN ⊢; omega) (by simp only [show (0:UInt64).toNat=0 from rfl]; norm_num at sQ ⊢; omega) simp only [show (0:UInt64).toNat=0 from rfl,zero_mul,zero_add,Nat.sub_zero, <- List.range_eq_range'] at v1 v2 v3 constructor · rw [v1,v2]; unfold Y7 rw [limbValA_eq,limbValA_eq,(lP x base b0 _ (λ _ _=>rfl) (List.range n) _ _ (by simp) (by simp)).2.2] have h0:limbVal (Array.replicate 18 0).toList=0:=by decide rw [h0]; simp only [Nat.cast_zero,sub_zero,zero_add] exact sdif _ _ _ _ (λ t=>by simp only [sv]; split_ifs <;> push_cast <;> ring) · rw [v3]; unfold Y6 rw [limbValA_eq,(lS (λ j=>mantOf x[base+j]! * mantOf x[base+j]!) (λ j=>2*(idxOf x[base+j]! - b0)) (λ j=>by have:=mantOf_lt_24 x[base+j]!; nlinarith) (λ j=>by have:=iB x[base+j]!; omega) _ _ (by simp)).2] have h0:limbVal (Array.replicate 18 0).toList=0:=by decide rw [h0,zero_add] def Y2L (x:ؽ δ) (base n j b:ٳ):ٳ:= if j Y2L x base n j b=(List.range' j d).foldl (λ b j=>let w:=x[base+j]!;if ε w=0 then b else min b (γ w)) b by rw[H n 0 255 (by omega),List.range_eq_range'] intro d;induction d<;>intro j b h · rw[Y2L,if_neg (by omega)];rfl · rename_i d ih;rw[Y2L,if_pos (by omega),ih (j+1) _ (by omega),List.range'_succ];rfl lemma Tn (n X:ٳ) (S:ٴ):((n:ٴ)*X-S*S).toNat=n*X-S.natAbs*S.natAbs:=by rw[←Int.natAbs_mul_self' S,←Int.natCast_mul,←Int.natCast_mul,Int.toNat_sub] @[inline] def m64 (a b:UInt64):UInt64×UInt64:= let a0:=a&&&0xFFFFFFFF;let a1:=a>>>32;let b0:=b&&&0xFFFFFFFF;let b1:=b>>>32 let p00:=a0*b0;let p01:=a0*b1;let p10:=a1*b0;let p11:=a1*b1 let mid:=(p00>>>32)+(p01&&&0xFFFFFFFF)+(p10&&&0xFFFFFFFF) (p11+(p01>>>32)+(p10>>>32)+(mid>>>32),(mid<<<32)|||(p00&&&0xFFFFFFFF)) @[inline] def lgS (w:UInt64) (p:UInt64×UInt64):UInt64×UInt64:=(if p.2>>>w != 0 then p.1+w else p.1,if p.2>>>w != 0 then p.2>>>w else p.2) @[inline] def lg64S (x:UInt64):UInt64:= let p:=lgS 2 (lgS 4 (lgS 8 (lgS 16 (lgS 32 (0,x))))) p.1+(if p.2>>>1 != 0 then 1 else 0) @[inline] def lg64 (x:UInt64):UInt64:= let r1:UInt64:=if x>>>32 != 0 then 0+32 else 0;let x1:=if x>>>32 != 0 then x>>>32 else x let r2:=if x1>>>16 != 0 then r1+16 else r1;let x2:=if x1>>>16 != 0 then x1>>>16 else x1 let r3:=if x2>>>8 != 0 then r2+8 else r2;let x3:=if x2>>>8 != 0 then x2>>>8 else x2 let r4:=if x3>>>4 != 0 then r3+4 else r3;let x4:=if x3>>>4 != 0 then x3>>>4 else x3 let r5:=if x4>>>2 != 0 then r4+2 else r4;let x5:=if x4>>>2 != 0 then x4>>>2 else x4 r5+(if x5>>>1 != 0 then 1 else 0) @[inline] def lg128 (h l:UInt64):UInt64:=if h != 0 then 64+lg64 h else lg64 l @[inline] def shl128 (h l s:UInt64):UInt64×UInt64:= (if s==0 then h else if s<64 then (h<<>>(64-s)) else l<<<(s-64),if s==0 then l else if s<64 then l<<>>s else 0,if s==0 then l else if s<64 then (l>>>s)|||(h<<<(64-s)) else h>>>(s-64)) @[inline] def lowz128 (h l s:UInt64):Bool:= if s==0 then true else if s<64 then l&&&((1<<>>32);let q1:=x1/m;let r:=x1%m let x0:=(r<<<32)|||(l&&&0xFFFFFFFF);let q0:=x0/m;let r:=x0%m (qh,(q1<<<32)|||q0,r) noncomputable def absd (ph pl nh nl:UInt64):UInt64×UInt64:= (if nh>>62 != 0 then 0x100000000 else FY DQ.2.1.toNat DQ.2.2.toNat (((shr128 shh sl (2*k-2).toUInt64).2&&&3).toNat) (lowz128 shh sl (2*k-2).toUInt64) m c t def FW (shh sl:UInt64) (m c:Nat):UInt64:= let t:Int:=(47-((lg128 shh sl).toNat:Int)+m.log2+1)/2 if 0<=t||64<=(-t).toNat then 0x100000000 else FX shh sl m c t (-t).toNat @[inline] def FTk {β:Type} (ph pl nh nl qh ql:UInt64) (n:Nat) (k:UInt64 -> UInt64 -> Bool -> β):β:= let ge:=nh UInt64 -> Bool -> β):β:= let bt:=if th==0&&tl==0 then 0 else lg128 th tl+1 let be:=if E==0 then 0 else lg64 E+1 let T2:=shl128 th tl d1.toUInt64 let E2:=shl128 0 E d2.toUInt64 let sl:=T2.2+E2.2 let sh0:=T2.1+E2.1 k (sh0+(if sl if ok then let c:=YF b0 (idxOf eps) FNk th tl (2*b0-c) (idxOf eps+149-c) (n*n*mantOf eps).toUInt64 fun shh sl ok2=> if ok2 then FW shh sl (n*n) c else 0x100000000 else 0x100000000 @[specialize] def rsV {β:Type} (kont:Bool -> UInt64 -> UInt64 -> UInt64 -> UInt64 -> UInt64 -> UInt64 -> β) (x:Array Word) (base n b0 j:Nat) (ph pl nh nl qh ql:UInt64) (ok:Bool):β:= if j < n then let w:=x[base+j]! let m:=(mantOf w).toUInt64 let s:=(idxOf w-b0).toUInt64 let t:=m<<>>1)>>>(63-2*s) else q<<<(2*s-64)) let ok':=ok&&(mantOf w=0||idxOf w-b0 <= 36) if signOf w then let p:=u2a nh nl t; rsV kont x base n b0 (j+1) ph pl p.1 p.2 qh' a.2 ok' else let p:=u2a ph pl t; rsV kont x base n b0 (j+1) p.1 p.2 nh nl qh' a.2 ok' else kont (ok&&n<256) ph pl nh nl qh ql termination_by n-j theorem lo32 (x:UInt64):(x&&&(0xFFFFFFFF:UInt64)).toNat=x.toNat%2^32:=by rw[BR];exact ϡ x.toNat 32 theorem hi32 (x:UInt64):(x>>>(32:UInt64)).toNat=x.toNat/2^32:=by rw[Ξ];simp[ψ] theorem sh32 (x:UInt64):(x<<<(32:UInt64)).toNat=x.toNat%2^32*2^32:=by rw[ό];simp only[show (32:UInt64).toNat%64=32 from rfl,Α];have:=x.toNat_lt;omega theorem or32 (x y:UInt64) (h:y.toNat<2^32):((x<<<(32:UInt64))|||y).toNat=x.toNat%2^32*2^32+y.toNat:=by rw[Du,sh32,←Α,Bq h] theorem mul32 (x y:UInt64) (hx:x.toNat<2^32) (hy:y.toNat<2^32):(x*y).toNat=x.toNat*y.toNat:=by rw[ϯ];exact ν (by have:=BP hx hy;omega) theorem m64_v (a b:UInt64):(m64 a b).1.toNat*2^64+(m64 a b).2.toNat=a.toNat*b.toNat:=by have ha:=a.toNat_lt;have hb:=b.toNat_lt have la0:(a&&&(0xFFFFFFFF:UInt64)).toNat<2^32:=by rw[lo32];omega have la1:(a>>>(32:UInt64)).toNat<2^32:=by rw[hi32];omega have lb0:(b&&&(0xFFFFFFFF:UInt64)).toNat<2^32:=by rw[lo32];omega have lb1:(b>>>(32:UInt64)).toNat<2^32:=by rw[hi32];omega unfold m64;dsimp only have e00:=mul32 _ _ la0 lb0;have e01:=mul32 _ _ la0 lb1;have e10:=mul32 _ _ la1 lb0;have e11:=mul32 _ _ la1 lb1 have hAB:a.toNat*b.toNat=(a>>>(32:UInt64)).toNat*(b>>>(32:UInt64)).toNat*2^64+((a&&&(0xFFFFFFFF:UInt64)).toNat*(b>>>(32:UInt64)).toNat+(a>>>(32:UInt64)).toNat*(b&&&(0xFFFFFFFF:UInt64)).toNat)*2^32+(a&&&(0xFFFFFFFF:UInt64)).toNat*(b&&&(0xFFFFFFFF:UInt64)).toNat:=by rw[lo32,lo32,hi32,hi32];have u:a.toNat=a.toNat/2^32*2^32+a.toNat%2^32:=by omega have v:b.toNat=b.toNat/2^32*2^32+b.toNat%2^32:=by omega conv_lhs=>rw[u,v] ring generalize (a&&&(0xFFFFFFFF:UInt64))*(b&&&(0xFFFFFFFF:UInt64))=P00 at e00⊢ generalize (a&&&(0xFFFFFFFF:UInt64))*(b>>>(32:UInt64))=P01 at e01⊢ generalize (a>>>(32:UInt64))*(b&&&(0xFFFFFFFF:UInt64))=P10 at e10⊢ generalize (a>>>(32:UInt64))*(b>>>(32:UInt64))=P11 at e11⊢ have b00:P00.toNat<2^64:=P00.toNat_lt;have b01:P01.toNat<2^64:=P01.toNat_lt;have b10:P10.toNat<2^64:=P10.toNat_lt;have b11:P11.toNat<2^64:=P11.toNat_lt rw[←e00,←e01,←e10,←e11] at hAB have mid:((P00>>>(32:UInt64))+(P01&&&(0xFFFFFFFF:UInt64))+(P10&&&(0xFFFFFFFF:UInt64))).toNat=P00.toNat/2^32+P01.toNat%2^32+P10.toNat%2^32:=by rw[ξ,ξ,hi32,lo32,lo32];omega generalize (P00>>>(32:UInt64))+(P01&&&(0xFFFFFFFF:UInt64))+(P10&&&(0xFFFFFFFF:UInt64))=MD at mid⊢ have l6:(P00&&&(0xFFFFFFFF:UInt64)).toNat<2^32:=by rw[lo32];omega rw[or32 _ _ l6,lo32,mid] have hlt:a.toNat*b.toNat<2^64*2^64:=BP ha hb have hh:(P11+(P01>>>(32:UInt64))+(P10>>>(32:UInt64))+(MD>>>(32:UInt64))).toNat=P11.toNat+P01.toNat/2^32+P10.toNat/2^32+(P00.toNat/2^32+P01.toNat%2^32+P10.toNat%2^32)/2^32:=by rw[ξ,ξ,ξ,hi32,hi32,hi32,mid];omega rw[hh];omega theorem lg_step (n k:Nat) (h:2^k<=n):n.log2=k+(n/2^k).log2:=by have p:0<2^k:=Δ k have hd:n/2^k≠0:=by have:=(Am p).2 (by omega:1*2^k<=n);omega have hn:n≠0:=by omega rw[Af hn];have l1:=ϰ hd;have l2:=Ak (n:=n/2^k) constructor · rw[Ϟ,Κ];exact (Am p).1 l1 · rw[show k+(n/2^k).log2+1=((n/2^k).log2+1)+k by omega,Κ];exact (An p).1 l2 theorem lgS_v (w:UInt64) (p:UInt64×UInt64) (hw:w.toNat<64) (h2:p.2.toNat<2^(2*w.toNat)) (h1:p.1.toNat+w.toNat<2^64) : p.1.toNat+p.2.toNat.log2=(lgS w p).1.toNat+(lgS w p).2.toNat.log2 /\ (lgS w p).2.toNat<2^w.toNat /\ (lgS w p).1.toNat<=p.1.toNat+w.toNat:=by have sv:(p.2>>>w).toNat=p.2.toNat/2^w.toNat:=by rw[Ξ,ν hw,ψ] have q:0<2^w.toNat:=Δ _ have h2':p.2.toNat<2^w.toNat*2^w.toNat:=by rw[←Κ,←two_mul];exact h2 unfold lgS;by_cases cc:(p.2>>>w != 0)=true · simp only[cc,if_true];have c:=cc have c0:p.2>>>w≠0:=by simpa using c have c1:(p.2>>>w).toNat≠0:=fun e=>c0 (σ.1 (by rw[e];rfl)) rw[sv] at c1 have g:2^w.toNat<=p.2.toNat:=by by_contra hc;exact c1 (Υ (by omega)) refine ⟨?_,?_,?_⟩ · try dsimp only rw[ξ,ν h1,sv,lg_step _ _ g];omega · try dsimp only rw[sv];exact (An q).2 h2' · try dsimp only rw[ξ,ν h1] · simp only[cc,Bool.false_eq_true,if_false];have c:=cc have c0:p.2>>>w=0:=by simpa using c have c1:p.2.toNat/2^w.toNat=0:=by rw[←sv,c0];rfl refine ⟨by trivial,?_,by omega⟩ by_contra hc;have:=Nat.div_pos (by omega:2^w.toNat<=p.2.toNat) q;omega theorem lg64S_v (x:UInt64):(lg64S x).toNat=x.toNat.log2:=by unfold lg64S;dsimp only have hx:=x.toNat_lt obtain⟨e1,b1,c1⟩:=lgS_v 32 (0,x) (by decide) (by simpa using hx) (by simp) simp only[show (32:UInt64).toNat=32 from rfl] at e1 b1 c1 generalize lgS 32 (0,x)=p1 at e1 b1 c1 obtain⟨e2,b2,c2⟩:=lgS_v 16 p1 (by decide) (by simpa using b1) (by simp only[show (16:UInt64).toNat=16 from rfl];simp at c1;omega) simp only[show (16:UInt64).toNat=16 from rfl] at e2 b2 c2 generalize lgS 16 p1=p2 at e2 b2 c2 obtain⟨e3,b3,c3⟩:=lgS_v 8 p2 (by decide) (by simpa using b2) (by simp only[show (8:UInt64).toNat=8 from rfl];simp at c1;omega) simp only[show (8:UInt64).toNat=8 from rfl] at e3 b3 c3 generalize lgS 8 p2=p3 at e3 b3 c3 obtain⟨e4,b4,c4⟩:=lgS_v 4 p3 (by decide) (by simpa using b3) (by simp only[show (4:UInt64).toNat=4 from rfl];simp at c1;omega) simp only[show (4:UInt64).toNat=4 from rfl] at e4 b4 c4 generalize lgS 4 p3=p4 at e4 b4 c4 obtain⟨e5,b5,c5⟩:=lgS_v 2 p4 (by decide) (by simpa using b4) (by simp only[show (2:UInt64).toNat=2 from rfl];simp at c1;omega) simp only[show (2:UInt64).toNat=2 from rfl] at e5 b5 c5 generalize lgS 2 p4=p5 at e5 b5 c5 simp at e1 c1 have fin:p5.2.toNat.log2=if p5.2>>>1 != 0 then 1 else 0:=by have sv:(p5.2>>>1).toNat=p5.2.toNat/2:=by rw[Ξ];simp[ψ] split · rename_i c;have c0:p5.2>>>1≠0:=by simpa using c have c1:(p5.2>>>1).toNat≠0:=fun e=>c0 (σ.1 (by rw[e];rfl)) rw[sv] at c1;rw[Af (by omega)];omega · rename_i c;have c0:p5.2>>>1=0:=by simpa using c have c1:p5.2.toNat/2=0:=by rw[←sv,c0];rfl by_cases z:p5.2.toNat=0 · rw[z];rfl · rw[Af z];omega have hb:p5.1.toNat<=62:=by omega by_cases c:(p5.2>>>1 != 0)=true · rw[if_pos c] at fin;rw[if_pos c,ξ,show (1:UInt64).toNat=1 from rfl,ν (by omega)];omega · rw[if_neg c] at fin;rw[if_neg c,ξ,show (0:UInt64).toNat=0 from rfl,ν (by omega)];omega theorem lg64_eq (x:UInt64):lg64 x=lg64S x:=by unfold lg64 lg64S lgS;rfl theorem lg64_v (x:UInt64):(lg64 x).toNat=x.toNat.log2:=by rw[lg64_eq,lg64S_v] theorem shl_v (x s:UInt64) (h:s.toNat<64):(x<<>>s).toNat=x.toNat/2^s.toNat:=by rw[Ξ,ν h,ψ] theorem orpw (a b k:Nat) (hb:b<2^k):a*2^k|||b=a*2^k+b:=by rw[←Α,Bq hb] theorem shl128_v (h l s:UInt64) (hs:s.toNat<128) (hv:(h.toNat*2^64+l.toNat)*2^s.toNat<2^128): (shl128 h l s).1.toNat*2^64+(shl128 h l s).2.toNat=(h.toNat*2^64+l.toNat)*2^s.toNat:=by have hl:=l.toNat_lt;have hh:=h.toNat_lt unfold shl128;by_cases cA:(s==0)=true · simp only[cA,if_true];have c:=cA;have:s=0:=by simpa using c subst this;simp by_cases cB:s<64 · simp only[cA,cB,Bool.false_eq_true,if_false,if_true];have c1:=cA;have c2:=cB;have s0:s.toNat≠0:=by intro e;apply c1;simp;exact σ.1 (by rw[e];rfl) have s64:s.toNat<64:=by simpa [Ψ] using c2 have t64:(64-s).toNat=64-s.toNat:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp have u:(64-s).toNat<64:=by omega try dsimp only rw[Du,shl_v _ _ s64,shr_v _ _ u,shl_v _ _ s64,t64] generalize hk:s.toNat=k at s0 s64 hv ⊢ have pk:0<2^k:=Δ k have p64:2^64=2^(64-k)*2^k:=by rw[←Κ];congr 1;omega have hhk:h.toNat*2^k<2^64:=by by_contra hc;have:2^64*2^64<=(h.toNat*2^64+l.toNat)*2^k:=by nlinarith omega rw[ν hhk] have ldiv:l.toNat/2^(64-k)<2^k:=by rw[An (Δ _)];rw[Θ,←p64];exact hl rw[orpw _ _ _ ldiv] have lsplit:l.toNat=l.toNat/2^(64-k)*2^(64-k)+l.toNat%2^(64-k):=(϶ _ _).symm generalize ga:l.toNat/2^(64-k)=a at lsplit ldiv ⊢ generalize gb:l.toNat%2^(64-k)=b at lsplit have bl:b<2^(64-k):=by rw[←gb];exact Ε _ (Δ _) have lm:l.toNat*2^k%2^64=b*2^k:=by rw[lsplit,ϟ,ϣ,←p64,Ϟ,ϲ] exact ν (by rw[p64];exact Aj bl pk) rw[lm,lsplit,p64];ring · simp only[cA,cB,Bool.false_eq_true,if_false];have c1:=cA;have c2:=cB;have s64:64<=s.toNat:=by simpa [Ψ] using c2 have t64:(s-64).toNat=s.toNat-64:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp try dsimp only rw[shl_v _ _ (by omega),t64] generalize hk:s.toNat=k at s64 hs hv ⊢ have pk:2^k=2^(k-64)*2^64:=by rw[←Κ];congr 1;omega have h0:h.toNat=0:=by by_contra hc have h1:1<=h.toNat:=by omega have a0:=ω (2^64) h1 have a1:2^64<=h.toNat*2^64+l.toNat:=le_trans (by simpa using a0) (ώ _ _) have a2:2^64<=2^k:=Ι Nat.two_pos s64 have a3:=Ar a1 a2 rw[←Κ] at a3 exact absurd hv (DZ.2 a3) rw[h0] at hv ⊢;simp only [zero_mul,zero_add] at hv ⊢ have lt:l.toNat*2^(k-64)<2^64:=by by_contra hc;rw[pk,←ϣ] at hv;have:2^64*2^64<=l.toNat*2^(k-64)*2^64:=ω _ (by omega) omega rw[ν lt,pk];simp;ring theorem shr128_v (h l s:UInt64) (hs:s.toNat<128): (shr128 h l s).1.toNat*2^64+(shr128 h l s).2.toNat=(h.toNat*2^64+l.toNat)/2^s.toNat:=by have hl:=l.toNat_lt;have hh:=h.toNat_lt unfold shr128;by_cases cA:(s==0)=true · simp only[cA,if_true];have c:=cA;have:s=0:=by simpa using c subst this;simp by_cases cB:s<64 · simp only[cA,cB,Bool.false_eq_true,if_false,if_true];have c1:=cA;have c2:=cB;have s0:s.toNat≠0:=by intro e;apply c1;simp;exact σ.1 (by rw[e];rfl) have s64:s.toNat<64:=by simpa [Ψ] using c2 have t64:(64-s).toNat=64-s.toNat:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp have u:(64-s).toNat<64:=by omega try dsimp only rw[Du,shr_v _ _ s64,shr_v _ _ s64,shl_v _ _ u,t64] generalize hk:s.toNat=k at s0 s64 ⊢ have pk:0<2^k:=Δ k have p64:2^64=2^(64-k)*2^k:=by rw[←Κ];congr 1;omega have hsplit:h.toNat=h.toNat/2^k*2^k+h.toNat%2^k:=(϶ _ _).symm generalize ga:h.toNat/2^k=a at hsplit ⊢ generalize gb:h.toNat%2^k=b at hsplit have bl:b<2^k:=by rw[←gb];exact Ε _ pk have hm:h.toNat*2^(64-k)%2^64=b*2^(64-k):=by rw[hsplit,ϟ,ϣ,Θ (2^k),←p64,Ϟ,ϲ] exact ν (by rw[p64,Θ (2^(64-k))];exact Aj bl (Δ _)) have ld:l.toNat/2^k<2^(64-k):=by rw[An pk,←p64];exact hl rw[hm,Nat.or_comm,orpw _ _ _ ld] have:(h.toNat*2^64+l.toNat)/2^k=h.toNat*2^(64-k)+l.toNat/2^k:=by rw[p64,←ϣ,Ϟ,ϔ _ _ pk,Ϟ] rw[this,hsplit,p64];ring · simp only[cA,cB,Bool.false_eq_true,if_false];have c1:=cA;have c2:=cB;have s64:64<=s.toNat:=by simpa [Ψ] using c2 have t64:(s-64).toNat=s.toNat-64:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp try dsimp only rw[shr_v _ _ (by omega),t64] generalize hk:s.toNat=k at s64 hs ⊢ have pk:2^k=2^64*2^(k-64):=by rw[←Κ];congr 1;omega have q:(h.toNat*2^64+l.toNat)/2^64=h.toNat:=by rw[Ϟ,ϔ _ _ (Δ 64),Υ hl];simp rw[pk,←ϧ,q];simp theorem bzU (x:UInt64):(x==0)=decide (x.toNat=0):=by rw[AB];simp only[beq_iff_eq,decide_eq_true_eq];constructor · intro e;rw[e];rfl · intro e;exact σ.1 (by rw[e];rfl) theorem msk_v (x s:UInt64) (hs:s.toNat<64):(x&&&((1<<>>(32:UInt64))).toNat=h.toNat%m.toNat*2^32+l.toNat/2^32:=by rw[Du,ό,Ξ,h32,r0];simp only[show 32%64=32 from rfl,Α,ψ] rw[ν (by have:=Aj (lt_trans r0l m32) (Δ 32);omega)] exact orpw2 _ _ _ (by omega) generalize ((h%m)<<<(32:UInt64))|||(l>>>(32:UInt64))=X1 at x1⊢ have q1:(X1/m).toNat=X1.toNat/m.toNat:=UInt64.toNat_div _ _ have r1:(X1%m).toNat=X1.toNat%m.toNat:=UInt64.toNat_mod _ _ have r1l:X1.toNat%m.toNat < m.toNat:=Ε _ m0 have x0:(((X1%m)<<<(32:UInt64))|||(l&&&(0xFFFFFFFF:UInt64))).toNat=X1.toNat%m.toNat*2^32+l.toNat%2^32:=by rw[Du,ό,BR,h32,r1];simp only[show 32%64=32 from rfl,Α] rw[ν (by have:=Aj (lt_trans r1l m32) (Δ 32);omega)] rw[show (0xFFFFFFFF:UInt64).toNat=2^32-1 from rfl,ϡ] exact orpw2 _ _ _ (Ε _ (by decide)) generalize ((X1%m)<<<(32:UInt64))|||(l&&&(0xFFFFFFFF:UInt64))=X0 at x0⊢ have q0:(X0/m).toNat=X0.toNat/m.toNat:=UInt64.toNat_div _ _ have r2:(X0%m).toNat=X0.toNat%m.toNat:=UInt64.toNat_mod _ _ -- 몫 상한 have q1l:X1.toNat/m.toNat < 2^32:=by rw[An m0,x1];have:l.toNat/2^32 < 2^32:=by omega have:(h.toNat%m.toNat+1)*2^32<=m.toNat*2^32:=ω _ r0l nlinarith have q0l:X0.toNat/m.toNat < 2^32:=by rw[An m0,x0];have:l.toNat%2^32 < 2^32:=Ε _ (by decide) have:(X1.toNat%m.toNat+1)*2^32<=m.toNat*2^32:=ω _ r1l nlinarith have lo:(((X1/m)<<<(32:UInt64))|||(X0/m)).toNat=X1.toNat/m.toNat*2^32+X0.toNat/m.toNat:=by rw[Du,ό,h32,q1,q0];simp only[show 32%64=32 from rfl,Α] rw[ν (by have:=Aj q1l (Δ 32);omega)] exact orpw2 _ _ _ q0l rw[lo,qh,r2] have e1:=Aq h.toNat m.toNat have e2:=Aq X1.toNat m.toNat have e3:=Aq X0.toNat m.toNat have key:X0.toNat%m.toNat+m.toNat*(h.toNat/m.toNat*2^64+(X1.toNat/m.toNat*2^32+X0.toNat/m.toNat))=h.toNat*2^64+l.toNat:=by have ex:m.toNat*(h.toNat/m.toNat*2^64+(X1.toNat/m.toNat*2^32+X0.toNat/m.toNat))=m.toNat*(h.toNat/m.toNat)*2^64+m.toNat*(X1.toNat/m.toNat)*2^32+m.toNat*(X0.toNat/m.toNat):=by ring rw[ex];have:=Aq l.toNat (2^32);omega obtain⟨a,b⟩:=(Nat.div_mod_unique m0).2 ⟨key,Ε _ m0⟩ exact⟨by rw[←a],b.symm⟩ theorem qE1 (q R X D:Nat) (hD:0 < D) (hX:X < D):(q*D+X=R*D) ↔ (q=R/\X=0):=by constructor · intro e;rcases lt_trichotomy q R with h|h|h · have:(q+1)*D<=R*D:=ω _ h;rw[ϟ] at this;omega · subst h;omega · have:(R+1)*D<=q*D:=ω _ h;rw[ϟ] at this;omega · rintro⟨a,b⟩;subst a b;omega theorem qE2 (q S X D:Nat) (hD:0 < D) (hX:X < D):(4*(q*D+X) < D*(4*S+1)) ↔ (q < S\/(q=S/\4*X < D)):=by have e:D*(4*S+1)=4*(S*D)+D:=by ring rw[e];rcases lt_trichotomy q S with h|h|h · have:(q+1)*D<=S*D:=ω _ h;rw[ϟ] at this;constructor<;>intro<;>first|omega|exact Ea h · subst h;constructor · intro a;right;exact⟨rfl,by omega⟩ · rintro (a|⟨-,b⟩);omega;omega · have:(S+1)*D<=q*D:=ω _ h;rw[ϟ] at this;constructor · intro;omega · rintro (a|⟨a,-⟩)<;>omega theorem qE3 (q S X D:Nat) (hD:0 < D) (hX:X < D):(4*(q*D+X)=D*(4*S+1)) ↔ (q=S/\4*X=D):=by have e:D*(4*S+1)=4*(S*D)+D:=by ring rw[e];rcases lt_trichotomy q S with h|h|h · have:(q+1)*D<=S*D:=ω _ h;rw[ϟ] at this;constructor<;>intro a<;>omega · subst h;constructor<;>intro a<;>omega · have:(S+1)*D<=q*D:=ω _ h;rw[ϟ] at this;constructor<;>intro a<;>omega theorem qX (r1 b2 rest K m:Nat) (hK:0 < K) (hrest:rest < K): ((r1*(4*K)+b2*K+rest=0) ↔ (r1=0/\b2=0/\rest=0)) /\ ((4*(r1*(4*K)+b2*K+rest) < m*(4*K)) ↔ (4*r1+b2 < m)) /\ ((4*(r1*(4*K)+b2*K+rest)=m*(4*K)) ↔ (4*r1+b2=m/\rest=0)):=by have e1:4*(r1*(4*K)+b2*K+rest)=4*((4*r1+b2)*K+rest):=by ring have e2:m*(4*K)=4*(m*K):=by ring refine⟨?_,?_,?_⟩ · constructor · intro h;have a:r1*(4*K)=0:=by omega have b:b2*K=0:=by omega refine⟨?_,?_,by omega⟩ · rcases Ax.1 a with x|x;exact x;omega · rcases Ax.1 b with x|x;exact x;omega · rintro⟨a,b,c⟩;subst a b c;simp · rw[e1,e2];generalize 4*r1+b2=t;constructor · intro h;by_contra c;have:m*K<=t*K:=ω _ (by omega);omega · intro h;have:(t+1)*K<=m*K:=ω _ h;rw[ϟ] at this;omega · rw[e1,e2];generalize 4*r1+b2=t;constructor · intro h;rcases lt_trichotomy t m with c|c|c · have:(t+1)*K<=m*K:=ω _ c;rw[ϟ] at this;omega · subst c;omega · have:(m+1)*K<=t*K:=ω _ c;rw[ϟ] at this;omega · rintro⟨a,b⟩;subst a b;omega theorem sqA_q (num den root q r1 b2 rest K m:Nat) (hK:0 < K) (hm:0 < m) (hden:den=m*(4*K)) (hnum:num=q*(m*(4*K))+(r1*(4*K)+b2*K+rest)) (hr1:r1 < m) (hb2:b2 < 4) (hrest:rest < K) : sqA num den root=if q=root*root&&r1==0&&b2==0&&rest==0 then 0 else if q < root*root+root||(q=root*root+root&&4*r1+b2 < m) then 1 else if q=root*root+root&&4*r1+b2==m&&rest==0 then 2 else 3:=by have hD0:0 < m*(4*K):=by positivity have hXD:r1*(4*K)+b2*K+rest < m*(4*K):=by have:b2*K+rest < 4*K:=by have:b2*K<=3*K:=ω _ (by omega);omega have:(r1+1)*(4*K)<=m*(4*K):=ω _ hr1;rw[ϟ] at this;omega obtain⟨x1,x2,x3⟩:=qX r1 b2 rest K m hK hrest unfold sqA;rw[hden,hnum] have sq:(2*root+1)*(2*root+1)=4*(root*root+root)+1:=by ring rw[sq] simp only[qE1 _ _ _ _ hD0 hXD,qE2 _ _ _ _ hD0 hXD,qE3 _ _ _ _ hD0 hXD,x1,x2,x3,Ω,beq_iff_eq,decide_eq_true_eq,Ϸ] split_ifs<;>omega theorem lg128_v (h l:UInt64):(lg128 h l).toNat=(h.toNat*2^64+l.toNat).log2:=by have hl:=l.toNat_lt unfold lg128;split · rename_i c;have c0:h≠0:=by simpa using c have c1:h.toNat≠0:=fun e=>c0 (σ.1 (by rw[e];rfl)) have g:2^64<=h.toNat*2^64+l.toNat:=le_trans (by have:=ω (2^64) (Dd.2 c1);rwa[Ϙ] at this) (ώ _ _) have q:(h.toNat*2^64+l.toNat)/2^64=h.toNat:=by rw[Ϟ,ϔ _ _ (Δ 64),Υ hl];simp rw[lg_step _ 64 g,q,ξ,lg64_v,show (64:UInt64).toNat=64 from rfl] have:h.toNat.log2 < 64:=(Ϻ c1).2 h.toNat_lt omega · rename_i c;have c0:h=0:=by simpa using c subst c0;simp[lg64_v] theorem sqW_V (num den root:Nat) (e:Int) (hd:0 < den) (h:sqV (sqA num den root) root e < 0x100000000):(sqV (sqA num den root) root e).toUInt32=sqW num den root e:=by unfold sqV at h⊢;unfold sqW;dsimp only at h⊢ by_cases hC:8388608<=root/\root<33554432/\1<=e+(if root<16777216 then 0 else 1:Nat)+150/\e+(if root<16777216 then 0 else 1:Nat)+150<=253 · rw[if_pos hC];simp only[hC.1,hC.2.1,hd,hC.2.2.1,hC.2.2.2,and_self,ite_true];simp · rw[if_neg hC] at h;simp at h theorem FY_v (num den q r1 b2 rest K m c:Nat) (t:Int) (z:Bool) (hK:0 < K) (hm:0 < m) (hden:den=m*(4*K)) (hnum:num=q*(m*(4*K))+(r1*(4*K)+b2*K+rest)) (hr1:r1 < m) (hb2:b2 < 4) (hrest:rest < K) (hz:z=(rest==0)) (hf:FY q r1 b2 z m c t < 0x100000000) : (FY q r1 b2 z m c t).toUInt32=sqW num den (Nat.sqrt q) (((c:Int)-298)/2-t):=by have sa:=sqA_q num den (Nat.sqrt q) q r1 b2 rest K m hK hm hden hnum hr1 hb2 hrest have d0:0 < den:=by rw[hden];positivity subst hz unfold FY at hf⊢;dsimp only at hf⊢ rw[←sa] at hf⊢ exact sqW_V _ _ _ _ d0 hf theorem FY_root (q r1 b2:Nat) (z:Bool) (m c:Nat) (t:Int) (hf:FY q r1 b2 z m c t < 0x100000000):8388608<=Nat.sqrt q:=by unfold FY sqV at hf;dsimp only at hf by_contra hc;rw[if_neg (by intro h;exact hc h.1)] at hf;simp at hf theorem FX_v (shh sl:UInt64) (m c k:Nat) (t:Int) (hk1:1<=k) (hk:k < 64) (hm:0 < m) (hm32:m < 2^32) (hf:FX shh sl m c t k < 0x100000000) : (FX shh sl m c t k).toUInt32=sqW (shh.toNat*2^64+sl.toNat) (m*4^k) (Nat.sqrt ((shh.toNat*2^64+sl.toNat)/(m*4^k))) (((c:Int)-298)/2-t) /\ 8388608<=Nat.sqrt ((shh.toNat*2^64+sl.toNat)/(m*4^k)):=by have mu:m.toUInt64.toNat=m:=by simp;omega have s1:(2*k).toUInt64.toNat=2*k:=by simp;omega have s2:(2*k-2).toUInt64.toNat=2*k-2:=by simp;omega unfold FX at hf⊢;dsimp only at hf⊢ generalize hA:shr128 shh sl (2*k).toUInt64=A at hf⊢ have Av:=shr128_v shh sl (2*k).toUInt64 (by rw[s1];omega);rw[hA,s1] at Av generalize hD:dv128 A.1 A.2 m.toUInt64=DQ at hf⊢ have Dv:=dv128_v A.1 A.2 m.toUInt64 (by rw[mu];exact hm) (by rw[mu];exact hm32);rw[hD,mu,Av] at Dv split at hf · simp at hf rename_i cq;simp only[Ϸ,bne_iff_ne,ne_eq,not_or,Decidable.not_not] at cq rw[if_neg (by simp only[Ϸ,bne_iff_ne,ne_eq,not_or,Decidable.not_not];exact cq)] have d0:DQ.1.toNat=0:=by rw[cq.1];rfl rw[d0,zero_mul,zero_add] at Dv obtain⟨N,num0⟩:∃ N,shh.toNat*2^64+sl.toNat=N:=⟨_,rfl⟩ rw[num0] at Av Dv⊢ have K0:0 < 4^(k-1):=by positivity have p4:4^k=4*4^(k-1):=by rw[←pow_succ'];congr 1;omega have p2:2^(2*k)=4^k:=by rw[pow_mul];norm_num have p2':2^(2*k-2)=4^(k-1):=by rw[show 2*k-2=2*(k-1) by omega,pow_mul];norm_num rw[p2] at Dv -- b2·rest have B:((shr128 shh sl (2*k-2).toUInt64).2&&&3).toNat=N/4^(k-1)%4:=by have v:=shr128_v shh sl (2*k-2).toUInt64 (by rw[s2];omega);rw[s2,num0,p2'] at v rw[BR,show (3:UInt64).toNat=2^2-1 from rfl,ϡ,←v];omega have Z:lowz128 shh sl (2*k-2).toUInt64=(N%4^(k-1)==0):=by rw[lowz128_v _ _ _ (by rw[s2];omega),s2,num0,p2',AB];simp rw[B,Z] at hf⊢ have qv:DQ.2.1.toNat=N/(m*4^k):=by rw[Dv.1,ϧ,Θ] rw[qv] at hf⊢ have r1l:DQ.2.2.toNat < m:=by rw[Dv.2];exact Ε _ hm have hnum:N=N/(m*4^k)*(m*(4*4^(k-1)))+(DQ.2.2.toNat*(4*4^(k-1))+N/4^(k-1)%4*4^(k-1)+N%4^(k-1)):=by rw[Dv.2,←p4] have a1:=Aq N (4^k) have a2:=Aq (N/4^k) m have a3:N%4^k=N%4^(k-1)+4^(k-1)*(N/4^(k-1)%4):=by rw[p4,Θ 4,DH] have a4:N/(m*4^k)=N/4^k/m:=by rw[Θ,ϧ] rw[a4] have:N=(m*(N/4^k/m)+N/4^k%m)*4^k+(N%4^(k-1)+4^(k-1)*(N/4^(k-1)%4)):=by rw[a2,←a3];exact a1.symm.trans (by ring) conv_lhs=>rw[this] ring have fy:=FY_v N (m*4^k) (N/(m*4^k)) DQ.2.2.toNat (N/4^(k-1)%4) (N%4^(k-1)) (4^(k-1)) m c t (N%4^(k-1)==0) K0 hm (by rw[p4]) hnum r1l (Ε _ (by decide)) (Ε _ K0) rfl hf exact⟨fy,FY_root _ _ _ _ _ _ _ hf⟩ theorem FW_v (shh sl:UInt64) (m c:Nat) (fb:Unit -> Word) (hm:0 < m) (hm32:m < 2^32) (hf:FW shh sl m c < 0x100000000) : (FW shh sl m c).toUInt32=YaD (shh.toNat*2^64+sl.toNat) m (((c:Int)-298)/2) fb:=by unfold FW at hf⊢;dsimp only at hf⊢ rw[lg128_v] at hf⊢ split at hf · simp at hf rename_i ct;simp only[Ϸ,decide_eq_true_eq,not_or,not_le] at ct rw[if_neg (by simp only[Ϸ,decide_eq_true_eq,not_or,not_le];exact ct)] generalize ht:(47-((shh.toNat*2^64+sl.toNat).log2:Int)+m.log2+1)/2=t at ct hf⊢ have k1:1<=(-t).toNat:=by omega obtain⟨fx,rt⟩:=FX_v shh sl m c (-t).toNat t k1 ct.2 hm hm32 hf rw[fx] unfold YaD;dsimp only rw[ht];have nt:¬(0<=t):=by omega simp only[nt,if_false] have dn:m<<<(2*(-t).toNat)=m*4^(-t).toNat:=by rw[Α,pow_mul];norm_num rw[dn] have sr:Ϗ (shh.toNat*2^64+sl.toNat) (m*4^(-t).toNat)=Nat.sqrt ((shh.toNat*2^64+sl.toNat)/(m*4^(-t).toNat)):=rfl rw[sr,if_pos rt] theorem sub128 (ah al bh bl:UInt64) (hge:bh.toNat*2^64+bl.toNat<=ah.toNat*2^64+al.toNat) : (ah-bh-(if al < bl then 1 else 0)).toNat*2^64+(al-bl).toNat=(ah.toNat*2^64+al.toNat)-(bh.toNat*2^64+bl.toNat):=by have ha:=ah.toNat_lt;have hl:=al.toNat_lt;have hb:=bh.toNat_lt;have hbl:=bl.toNat_lt split · rename_i c;have c':al.toNat < bl.toNat:=Ψ.1 c have g:bh.toNat < ah.toNat:=by by_contra hc;have:ah.toNat*2^64<=bh.toNat*2^64:=ω _ (by omega);omega rw[Η _ _ (by rw[ϐ];simp;rw[Η _ _ (ϐ.2 (by omega))];omega), Η _ _ (ϐ.2 (by omega)),Τ];simp omega · rename_i c;have c':bl.toNat<=al.toNat:=by have:=Ψ.not.1 c;omega have g:bh.toNat<=ah.toNat:=by by_contra hc;have:(ah.toNat+1)*2^64<=bh.toNat*2^64:=ω _ (by omega);rw[ϟ] at this;omega simp only[UInt64.sub_zero] rw[Η _ _ (ϐ.2 g),Η _ _ (ϐ.2 c'),Nat.sub_mul];omega theorem absd_v (ph pl nh nl:UInt64):(absd ph pl nh nl).1.toNat*2^64+(absd ph pl nh nl).2.toNat=(((ph.toNat*2^64+pl.toNat:Nat):Int)-((nh.toNat*2^64+nl.toNat:Nat):Int)).natAbs:=by have a1:=ph.toNat_lt;have a2:=pl.toNat_lt;have a3:=nh.toNat_lt;have a4:=nl.toNat_lt unfold absd;by_cases cc:(nhsplit<;>simp_all[lg128] rw[e];exact h2) simpa using this have T2v:=shl128_v th tl d1.toUInt64 (by rw[u1];omega) (by rw[u1];exact bT);rw[u1] at T2v have E2v:=shl128_v 0 E d2.toUInt64 (by rw[u2];omega) (by rw[u2];simpa using bE);rw[u2] at E2v simp only[Ϝ,zero_mul,zero_add] at E2v generalize shl128 th tl d1.toUInt64=T2 at T2v h3 h4⊢ generalize shl128 0 E d2.toUInt64=E2 at E2v h3 h4⊢ have a1:=T2.1.toNat_lt;have a2:=T2.2.toNat_lt;have a3:=E2.1.toNat_lt;have a4:=E2.2.toNat_lt have s0:(T2.1+E2.1).toNat=T2.1.toNat+E2.1.toNat:=by have w:=ϐ.1 h3;rw[ξ] at w⊢ by_contra hc;rw[Nat.mod_eq_sub_mod (by omega),ν (by omega)] at w;omega have sl:(T2.2+E2.2).toNat=(T2.2.toNat+E2.2.toNat)%2^64:=ξ _ _ have cy:(if T2.2+E2.2 < T2.2 then (1:UInt64) else 0).toNat=if 2^64<=T2.2.toNat+E2.2.toNat then 1 else 0:=by split<;>rename_i c<;>rw[Ψ,sl] at c<;>split<;>rename_i d<;>first|rfl|omega have hi:(T2.1+E2.1+(if T2.2+E2.2 < T2.2 then 1 else 0)).toNat=T2.1.toNat+E2.1.toNat+(if 2^64<=T2.2.toNat+E2.2.toNat then 1 else 0):=by have w:=ϐ.1 h4;rw[s0,ξ (T2.1+E2.1),s0,cy] at w rw[ξ (T2.1+E2.1),s0,cy] split at w<;>split<;>rename_i c1 c2<;>first|(exfalso;exact c1 c2)|(exfalso;exact c2 c1)|skip · by_contra hc;rw[Nat.mod_eq_sub_mod (by omega),ν (by omega)] at w;omega · have:=(T2.1+E2.1).toNat_lt;rw[s0] at this;simp;omega rw[hi,sl,←T2v,←E2v];clear bT bE T2v E2v h1 h2 h3 h4 hi cy split<;>omega theorem FT_n (ph pl nh nl qh ql:UInt64) (n:Nat) (h:(FT ph pl nh nl qh ql n).2.2=true):n < 256:=by unfold FT at h;dsimp only at h obtain⟨a,-⟩:=(Ω _ _).mp h obtain⟨a,-⟩:=(Ω _ _).mp a obtain⟨-,a⟩:=(Ω _ _).mp a exact of_decide_eq_true a theorem FTk_eq {β:Type} (ph pl nh nl qh ql:UInt64) (n:Nat) (k:UInt64 -> UInt64 -> Bool -> β):FTk ph pl nh nl qh ql n k=k (FT ph pl nh nl qh ql n).1 (FT ph pl nh nl qh ql n).2.1 (FT ph pl nh nl qh ql n).2.2:=by unfold FTk FT absd mulq;rfl theorem FNk_eq {β:Type} (th tl:UInt64) (d1 d2:Nat) (E:UInt64) (k:UInt64 -> UInt64 -> Bool -> β):FNk th tl d1 d2 E k=k (FN th tl d1 d2 E).1 (FN th tl d1 d2 E).2.1 (FN th tl d1 d2 E).2.2:=by unfold FNk FN;rfl theorem FF_v (ph pl nh nl qh ql:UInt64) (n b0:Nat) (eps:Word) (fb:Unit -> Word) (hn:0 < n) (hf:FF ph pl nh nl qh ql n b0 eps < 0x100000000) : (FF ph pl nh nl qh ql n b0 eps).toUInt32=YaD ((n*(qh.toNat<<<64+ql.toNat)-(((ph.toNat<<<64+pl.toNat:Nat):Int)-((nh.toNat<<<64+nl.toNat:Nat):Int)).natAbs*(((ph.toNat<<<64+pl.toNat:Nat):Int)-((nh.toNat<<<64+nl.toNat:Nat):Int)).natAbs)<<<(2*b0-YF b0 (idxOf eps))+(n*n*mantOf eps)<<<(idxOf eps+149-YF b0 (idxOf eps))) (n*n) (((YF b0 (idxOf eps):Int)-298)/2) fb:=by simp only[Α] unfold FF at hf⊢;rw[FTk_eq] at hf⊢;dsimp only at hf⊢ by_cases hT:(FT ph pl nh nl qh ql n).2.2=true swap;rw[if_neg hT] at hf;simp at hf rw[if_pos hT] at hf⊢ have n256:=FT_n _ _ _ _ _ _ _ hT have tv:=FT_v _ _ _ _ _ _ _ hT generalize FT ph pl nh nl qh ql n=T at tv hT hf⊢ rw[FNk_eq] at hf⊢ by_cases hN:(FN T.1 T.2.1 (2*b0-YF b0 (idxOf eps)) (idxOf eps+149-YF b0 (idxOf eps)) (n*n*mantOf eps).toUInt64).2.2=true swap;rw[if_neg hN] at hf;simp at hf rw[if_pos hN] at hf⊢ have Eu:(n*n*mantOf eps).toUInt64.toNat=n*n*mantOf eps:=by have:=Ϛ eps have:n*n*mantOf eps < 2^64:=by have a:n*n < 2^16:=by nlinarith calc n*n*mantOf eps < 2^16*2^24:=BP a this _<=2^64:=by norm_num simp;omega have nv:=FN_v _ _ _ _ _ hN;rw[Eu,tv] at nv generalize FN T.1 T.2.1 (2*b0-YF b0 (idxOf eps)) (idxOf eps+149-YF b0 (idxOf eps)) (n*n*mantOf eps).toUInt64=N at nv hN hf⊢ rw[FW_v _ _ _ _ fb (by positivity) (by nlinarith) hf,nv] theorem rsV_ex (x:Array Word) (base n b0:Nat) : ∀ k j ph pl nh nl qh ql ok,n-j=k -> ∃ ok' ph' pl' nh' nl' qh' ql',(∀ {β:Type} (kont:Bool -> UInt64 -> UInt64 -> UInt64 -> UInt64 -> UInt64 -> UInt64 -> β),rsV kont x base n b0 j ph pl nh nl qh ql ok=kont ok' ph' pl' nh' nl' qh' ql') /\ rsU x base n b0 j ph pl nh nl qh ql ok=(ok',ph'.toNat<<<64+pl'.toNat,nh'.toNat<<<64+nl'.toNat,qh'.toNat<<<64+ql'.toNat):=by intro k;induction k with | zero=> intro j ph pl nh nl qh ql ok hk have c:¬j < n:=by omega refine⟨ok&&decide (n < 256),ph,pl,nh,nl,qh,ql,fun kont=>?_,?_⟩ · rw[rsV,if_neg c] · rw[rsU,if_neg c] | succ k ih=> intro j ph pl nh nl qh ql ok hk have c:j < n:=by omega by_cases hs:signOf x[base+j]! = true · obtain⟨a1,a2,a3,a4,a5,a6,a7,hV,hU⟩:=ih (j+1) ph pl (u2a nh nl ((mantOf x[base+j]!).toUInt64<<<(idxOf x[base+j]!-b0).toUInt64)).1 (u2a nh nl ((mantOf x[base+j]!).toUInt64<<<(idxOf x[base+j]!-b0).toUInt64)).2 _ _ (ok&&(mantOf x[base+j]! = 0||idxOf x[base+j]!-b0 <= 36)) (by omega) refine⟨a1,a2,a3,a4,a5,a6,a7,fun kont=>?_,?_⟩ · rw[rsV,if_pos c];simp only[hs,if_true];exact hV kont · rw[rsU,if_pos c];simp only[hs,if_true];exact hU · obtain⟨a1,a2,a3,a4,a5,a6,a7,hV,hU⟩:=ih (j+1) (u2a ph pl ((mantOf x[base+j]!).toUInt64<<<(idxOf x[base+j]!-b0).toUInt64)).1 (u2a ph pl ((mantOf x[base+j]!).toUInt64<<<(idxOf x[base+j]!-b0).toUInt64)).2 nh nl _ _ (ok&&(mantOf x[base+j]! = 0||idxOf x[base+j]!-b0 <= 36)) (by omega) refine⟨a1,a2,a3,a4,a5,a6,a7,fun kont=>?_,?_⟩ · rw[rsV,if_pos c];simp only[hs,φ,if_false];exact hV kont · rw[rsU,if_pos c];simp only[hs,φ,if_false];exact hU @[inline] def Y8f (x:Array Word) (n:Nat) (eps:Word) (r:Nat):Nat × Int × Word := let b0:=Y2L x (r*n) n 0 255 rsV (λ ok ph pl nh nl qh ql=> let S1:Int:=if ok then ((ph.toNat<<<64+pl.toNat:Nat):Int)-((nh.toNat<<<64+nl.toNat:Nat):Int) else (limbValA (Y7 x (r*n) n b0).1:Int)-limbValA (Y7 x (r*n) n b0).2 let f:=if ok&&0 sqrtRational (rowVariance n x r (rowMean n x r)+rationalWord eps))) x (r*n) n b0 0 0 0 0 0 0 0 true lemma Y8f_eq (x:Array Word) (n:Nat) (eps:Word) (r:Nat) : Y8f x n eps r=Y8 x n eps r:=by unfold Y8f Y8;rw[Y2L_eq];dsimp only obtain⟨ok,ph,pl,nh,nl,qh,ql,hV,hU⟩:=rsV_ex x (r*n) n (Y2 x (r*n) n) _ 0 0 0 0 0 0 0 true rfl rw[hV,Tn] cases ok with | false => simp only[Bool.false_and,φ,if_false];rw[if_neg (by decide)] | true => have h1:(rsU x (r*n) n (Y2 x (r*n) n) 0 0 0 0 0 0 0 true).1=true:=by rw[hU] obtain⟨e1,e2⟩:=rsU_lim x (r*n) n (Y2 x (r*n) n) h1 rw[hU] at e1 e2;dsimp only at e1 e2 simp only[if_true,Bool.true_and] by_cases hn:0 < n · simp only[hn,decide_true,if_true] split · rename_i hf rw[FF_v _ _ _ _ _ _ _ _ _ _ hn hf,e1,e2] · rw[e1,e2] · simp only[hn,decide_false,φ,if_false];rw[if_neg (by decide),e1,e2] section def MYa7b (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word):Word := let c2:=min (b0+idxOf gw) (idxOf bw+idxOf dw) let c:=Yap (signOf w) (n*(mantOf w*p2 (idxOf w-b0))) (!(S1 < 0)) S1.natAbs let D:=n*mantOf dw let r0:=c.2%D*mantOf gw let k1:=p2 (b0+idxOf gw-c2) let ra:=r0%D*k1 let Q:=Y3 (c.1 != signOf gw) ((c.2/D*mantOf gw+r0/D)*k1+ra/D) (ra%D) (signOf bw) (mantOf bw*p2 (idxOf bw+idxOf dw-c2)) D if 16777216 <= Q.2.1 then YN Q.1 (2*Q.2.1+(if Q.2.2=0 then 0 else 1)) 1 ((c2:Int)-150-idxOf dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:Int)-149-idxOf dw) @[inline] def MYa7 (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ):Word := if sv dw <= 0 then roundRational ((rationalWord w-mean ())*rationalWord gw/rationalWord dw+rationalWord bw) else MYa7b n w gw bw b0 S1 dw lemma shm (w:UInt32) (m:UInt64) (k:Nat) (hk:k <= 38) (h:mantOf w=0\/(m.toNat <= idxOf w/\idxOf w-m.toNat <= k)) : (Yf w<<<(Yd w-m)).toNat=mantOf w*2^(idxOf w-m.toNat) /\ mantOf w*2^(idxOf w-m.toNat) < 2^(24+k):=by rcases h with h0 | ⟨h1,h2⟩ . have:Yf w=0:=UInt64.toNat_inj.mp (by rw [Zk,h0]; rfl);rw [this,h0]; simp . have hsub:(Yd w-m).toNat=idxOf w-m.toNat:=by rw [UInt64.toNat_sub_of_le _ _ (UInt64.le_iff_toNat_le.mpr (by rw [Zf]; exact h1)), Zf] have hm:=mantOf_lt_24 w;have hp:mantOf w*2^(idxOf w-m.toNat) < 2^(24+k) := calc _ < 2^24*2^(idxOf w-m.toNat):=Nat.mul_lt_mul_of_pos_right hm (Nat.two_pow_pos _) _ <= 2^24*2^k:=Nat.mul_le_mul_left _ (Nat.pow_le_pow_right (by norm_num) h2) _=2^(24+k):=by rw [pow_add] refine ⟨?_,hp⟩;rw [UInt64.toNat_shiftLeft,hsub,Zk,Nat.mod_eq_of_lt (show idxOf w-m.toNat < 64 by omega), Nat.shiftLeft_eq] exact Nat.mod_eq_of_lt (lt_of_lt_of_le hp (Nat.pow_le_pow_right (by norm_num) (by omega))) end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat @[inline] def rqU (a b:UInt64):UInt64 := let q:=a/b let tw:=2*(a%b) if tw < b then q else if b < tw then q+1 else if q%2==0 then q else q+1 @[inline] def rrsG (s:Bool) (N D U V:UInt64) (fb:Unit -> Word):Word := let i:=Yj N-Yj D let R:=if N < D<<>>k=0):x < 2^k:=by rw [Nat.shiftRight_eq_div_pow] at h; exact (Nat.div_eq_zero_iff_lt (by positivity)).mp h end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Numerics open Model open RationalBinary (floorLog2 scaleByPowerOfTwo scaleByPowerOfTwo_snd_ne_zero) open FloatLib.Numerics (binaryRadix Radix.toReal) lemma flr (P Dm r:Nat) (hD:Dm≠0) (hP:P≠0) (h1:2^r*Dm <= P) (h2:P < 2^(r+1)*Dm) : fl2 P Dm = (r:Int):=by rw [Zbo] obtain ⟨b1,b2⟩:=floorLog2_bounds P Dm hP hD have hDr:(0:ℝ) < Dm:=by exact_mod_cast Nat.pos_of_ne_zero hD apply cU b1 b2 . rw [bz,zpow_natCast,le_div_iff₀ hDr]; exact_mod_cast h1 . rw [bz,show ((r:Int)+1)=((r+1:Nat):Int) by push_cast; ring,zpow_natCast,div_lt_iff₀ hDr]; exact_mod_cast h2 lemma rqge (a b:Nat):a/b <= FloatLib.Numerics.roundQuotientEven a b:=by unfold FloatLib.Numerics.roundQuotientEven; dsimp only; split_ifs <;> omega lemma rrsC (s:Bool) (P Dm:Nat) (E:Int) (R:Nat) (hP:P≠0) (hDm:Dm≠0) (h1:2^R*Dm <= P) (h2:P < 2^(R+1)*Dm) (m:Nat) (hm:FloatLib.Numerics.roundQuotientEven (sc2 P Dm (23-(R:Int))).1 (sc2 P Dm (23-(R:Int))).2 = m) (ht:-126 <= (R:Int)+E) (hx:(R:Int)+E+(if m = 16777216 then 1 else 0) <= 127) : YN s P Dm E = Model.NativeBinary32.mkBits s (Int.toNat ((R:Int)+E+(if m = 16777216 then 1 else 0)+127)) ((if m = 16777216 then 8388608 else m)-8388608):=by unfold YN rw [if_neg (by simpa using hDm),if_neg (by simpa using hP)] dsimp only rw [flr P Dm R hDm hP h1 h2,hm] have hk:(if m = 16777216 then (1:Int) else 0) <= 1 ∧ 0 <= (if m = 16777216 then (1:Int) else 0):=by split <;> omega rw [if_neg (by omega),if_neg (by omega),if_neg (by omega)] by_cases hk2:m=16777216 . simp only [hk2,beq_self_eq_true,ite_true] at hx ⊢; rw [if_neg (by omega)] . have:(m==16777216)=false:=by simpa using hk2 simp only [hk2,this,ite_false,Bool.false_eq_true] at hx ⊢; rw [if_neg (by omega)]; simp lemma rqUe2 (a b:UInt64) (hb0:0 < b.toNat) (hb:b.toNat < 2^63) (hq:a.toNat/b.toNat < 2^63) : (rqU a b).toNat = FloatLib.Numerics.roundQuotientEven a.toNat b.toNat:=by unfold rqU FloatLib.Numerics.roundQuotientEven dsimp only have hq0:(a/b).toNat=a.toNat/b.toNat:=UInt64.toNat_div a b have hr:(a%b).toNat=a.toNat%b.toNat:=UInt64.toNat_mod a b have hrl:a.toNat%b.toNat < b.toNat:=Nat.mod_lt _ hb0 have htw:(2*(a%b)).toNat=2*(a.toNat%b.toNat):=by rw [UInt64.toNat_mul,hr]; simp; omega have hq1:(a/b+1).toNat=a.toNat/b.toNat+1:=by rw [UInt64.toNat_add,hq0]; simp; omega have hm2:((a/b)%2).toNat=(a.toNat/b.toNat)%2:=by rw [UInt64.toNat_mod,hq0]; rfl have e3:((a/b)%2==0)=true ↔ (a.toNat/b.toNat)%2=0:=by simp only [beq_iff_eq]; rw [<- hm2]; exact ⟨λ h=>by rw [h]; rfl,λ h=>UInt64.toNat_inj.mp (by rw [h]; rfl)⟩ by_cases c1:2*(a.toNat%b.toNat) < b.toNat . have:2*(a%b) < b:=by rw [UInt64.lt_iff_toNat_lt,htw]; exact c1 rw [if_pos this,if_pos c1,hq0] . have:¬ 2*(a%b) < b:=by rw [UInt64.lt_iff_toNat_lt,htw]; exact c1 rw [if_neg this,if_neg c1] by_cases c2:b.toNat < 2*(a.toNat%b.toNat) . have:b < 2*(a%b):=by rw [UInt64.lt_iff_toNat_lt,htw]; exact c2 rw [if_pos this,if_pos c2,hq1] . have:¬ b < 2*(a%b):=by rw [UInt64.lt_iff_toNat_lt,htw]; exact c2 rw [if_neg this,if_neg c2] by_cases c3:(a.toNat/b.toNat)%2=0 . rw [if_pos (e3.mpr c3),if_pos (by simpa using c3),hq0] . rw [if_neg (λ h=>c3 (e3.mp h)),if_neg (by simpa using c3),hq1] lemma p2le (a b:Nat) (h:a <= b):2^a <= 2^b:=Nat.pow_le_pow_right (by norm_num) h lemma rRe (N D:UInt64) (hD0:0 < D.toNat) (hND:D.toNat <= N.toNat) (hD:D.toNat < 2^40) : let R:=if N < D<<<(Yj N-Yj D) then Yj N-Yj D-1 else Yj N-Yj D R.toNat <= 63 ∧ 2^R.toNat*D.toNat <= N.toNat ∧ N.toNat < 2^(R.toNat+1)*D.toNat:=by intro R have hN0:N≠0:=λ h=>by rw [h] at hND; simp at hND; omega have hD0':D≠0:=λ h=>by rw [h] at hD0; simp at hD0 have hln:=Zj N hN0; have hld:=Zj D hD0' have bN:=(Nat.log2_eq_iff (show N.toNat≠0 by omega)).mp rfl have bD:=(Nat.log2_eq_iff (show D.toNat≠0 by omega)).mp rfl have hN64:=N.toNat_lt generalize N.toNat.log2=ln at bN hln generalize D.toNat.log2=ld at bD hld have hle:ld <= ln:=by have:2^ld < 2^(ln+1):=lt_of_le_of_lt (le_trans bD.1 hND) bN.2 have:=(Nat.pow_lt_pow_iff_right (by norm_num : 1 < 2)).mp this; omega have hl63:ln <= 63:=by by_contra h; have:2^64 <= 2^ln:=p2le _ _ (by omega) have:N.toNat < 2^64:=hN64; omega have hi:(Yj N-Yj D).toNat=ln-ld:=by rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le,hln,hld]; exact hle),hln,hld] have e1:2^(ld+1)*2^(ln-ld)=2^(ln+1):=by rw [<- pow_add,show ld+1+(ln-ld)=ln+1 by omega] have h1:D.toNat*2^(ln-ld) < 2^(ln+1):=by rw [<- e1]; exact Nat.mul_lt_mul_of_pos_right bD.2 (by positivity) have h2:2^(ln+1) <= 2^64:=p2le _ _ (by omega) have hsh:(D<<<(Yj N-Yj D)).toNat=D.toNat*2^(ln-ld):=by rw [UInt64.toNat_shiftLeft,hi,Nat.mod_eq_of_lt (show ln-ld < 64 by omega),Nat.shiftLeft_eq] exact Nat.mod_eq_of_lt (lt_of_lt_of_le h1 h2) have e2:2^(ln-ld+1)*2^ld=2^(ln+1):=by rw [<- pow_add,show ln-ld+1+ld=ln+1 by omega] have up:N.toNat < 2^(ln-ld+1)*D.toNat:=by have:2^(ln-ld+1)*2^ld <= 2^(ln-ld+1)*D.toNat:=Nat.mul_le_mul_left _ bD.1 rw [e2] at this; omega by_cases c:N < D<<<(Yj N-Yj D) . have hR:R=Yj N-Yj D-1:=if_pos c rw [UInt64.lt_iff_toNat_lt,hsh] at c have hi1:1 <= ln-ld:=by by_contra h; have:ln-ld=0:=by omega rw [this] at c; simp at c; omega have hRn:R.toNat=ln-ld-1:=by rw [hR,UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le,hi]; simp; omega),hi]; simp rw [hRn] have e:ln-ld-1+1=ln-ld:=by omega have e3:2^(ln-ld-1)*2^(ld+1)=2^ln:=by rw [<- pow_add,show ln-ld-1+(ld+1)=ln by omega] have h3:2^(ln-ld-1)*D.toNat < 2^(ln-ld-1)*2^(ld+1):=Nat.mul_lt_mul_of_pos_left bD.2 (by positivity) rw [e3] at h3 refine ⟨by omega,by omega,by rw [e,Nat.mul_comm]; exact c⟩ . have hR:R=Yj N-Yj D:=if_neg c rw [UInt64.lt_iff_toNat_lt,hsh] at c rw [hR,hi] exact ⟨by omega,by rw [Nat.mul_comm]; omega,up⟩ lemma rrsGe (s:Bool) (N D U V:UInt64) (E:Int) (X:Word) (hD0:0 < D.toNat) (hND:D.toNat <= N.toNat) (hD:D.toNat < 2^40) (hU:U.toNat < 2^20) (hV:V.toNat < 2^20) (hE:E+127=(U.toNat:Int)-V.toNat) (hX:X=YN s N.toNat D.toNat E) : rrsG s N D U V (λ _=>X) = X:=by unfold rrsG; dsimp only obtain ⟨hR63,hr1,hr2⟩:=rRe N D hD0 hND hD generalize (if N < D<<<(Yj N-Yj D) then Yj N-Yj D-1 else Yj N-Yj D)=R at hR63 hr1 hr2 ⊢ have hN64:=N.toNat_lt have hab:∃ A B:Nat,(if R <= 23 then N<<<(23-R) else N).toNat=A ∧ (if R <= 23 then D else D<<<(R-23)).toNat=B ∧ sc2 N.toNat D.toNat (23-(R.toNat:Int))=(A,B) ∧ 0 < B ∧ B < 2^63 ∧ A/B < 2^24 ∧ 2^23*B <= A:=by by_cases hR:R <= 23 . have hRn:R.toNat <= 23:=by rw [UInt64.le_iff_toNat_le] at hR; simpa using hR have hsub:(23-R).toNat=23-R.toNat:=by rw [UInt64.toNat_sub_of_le _ _ hR]; simp have e1:2^(R.toNat+1)*2^(23-R.toNat)=2^24:=by rw [<- pow_add,show R.toNat+1+(23-R.toNat)=24 by omega] have e2:2^R.toNat*2^(23-R.toNat)=2^23:=by rw [<- pow_add,show R.toNat+(23-R.toNat)=23 by omega] have hA:N.toNat*2^(23-R.toNat) < D.toNat*2^24:=by have:=Nat.mul_lt_mul_of_pos_right hr2 (show 0 < 2^(23-R.toNat) by positivity) rw [Nat.mul_assoc,Nat.mul_comm (D.toNat),<- Nat.mul_assoc,e1] at this; linarith have hA2:2^23*D.toNat <= N.toNat*2^(23-R.toNat):=by have:=Nat.mul_le_mul_right (2^(23-R.toNat)) hr1 rw [Nat.mul_comm (2^R.toNat),Nat.mul_assoc,e2] at this; linarith have hD24:D.toNat*2^24 < 2^64:=by calc D.toNat*2^24 < 2^40*2^24:=Nat.mul_lt_mul_of_pos_right hD (by positivity) _ = 2^64:=by norm_num refine ⟨N.toNat*2^(23-R.toNat),D.toNat,?_,?_,?_,hD0,by omega,?_,hA2⟩ . rw [if_pos hR,UInt64.toNat_shiftLeft,hsub,Nat.mod_eq_of_lt (show 23-R.toNat < 64 by omega),Nat.shiftLeft_eq] exact Nat.mod_eq_of_lt (by omega) . rw [if_pos hR] . have e:(23:Int)-(R.toNat:Int)=Int.ofNat (23-R.toNat):=by rw [Int.ofNat_eq_coe]; omega rw [e]; simp [sc2,ZE] . exact (Nat.div_lt_iff_lt_mul hD0).mpr (by linarith) . have hRn:23 < R.toNat:=by rw [UInt64.le_iff_toNat_le] at hR; simp at hR; omega have hsub:(R-23).toNat=R.toNat-23:=by rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le]; simp; omega)]; simp have e1:2^23*2^(R.toNat-23)=2^R.toNat:=by rw [<- pow_add,show 23+(R.toNat-23)=R.toNat by omega] have e2:2^24*2^(R.toNat-23)=2^(R.toNat+1):=by rw [<- pow_add,show 24+(R.toNat-23)=R.toNat+1 by omega] have hB1:2^23*(D.toNat*2^(R.toNat-23)) <= N.toNat:=by rw [<- Nat.mul_assoc,Nat.mul_comm (2^23),Nat.mul_assoc,e1,Nat.mul_comm]; exact hr1 have hB2:N.toNat < 2^24*(D.toNat*2^(R.toNat-23)):=by rw [<- Nat.mul_assoc,Nat.mul_comm (2^24),Nat.mul_assoc,e2,Nat.mul_comm]; exact hr2 have hBlt:D.toNat*2^(R.toNat-23) < 2^41:=by have:2^23*(D.toNat*2^(R.toNat-23)) < 2^23*2^41:=lt_of_le_of_lt hB1 (by norm_num; omega) exact Nat.lt_of_mul_lt_mul_left this refine ⟨N.toNat,D.toNat*2^(R.toNat-23),?_,?_,?_,by positivity,by omega,?_,hB1⟩ . rw [if_neg hR] . rw [if_neg hR,UInt64.toNat_shiftLeft,hsub,Nat.mod_eq_of_lt (show R.toNat-23 < 64 by omega),Nat.shiftLeft_eq] exact Nat.mod_eq_of_lt (by omega) . have e:(23:Int)-(R.toNat:Int)=Int.negSucc (R.toNat-24):=by omega rw [e]; simp only [sc2,ZE,Prod.mk.injEq,true_and]; rw [show R.toNat-24+1=R.toNat-23 by omega] . exact (Nat.div_lt_iff_lt_mul (by positivity)).mpr (by linarith) obtain ⟨A,B,ha,hb,hsc,hB0,hB,hq,hq2⟩:=hab have hm:=rqUe2 (if R <= 23 then N<<<(23-R) else N) (if R <= 23 then D else D<<<(R-23)) (by rw [hb]; exact hB0) (by rw [hb]; exact hB) (by rw [ha,hb]; omega) rw [ha,hb] at hm have hmge:2^23 <= (rqU (if R <= 23 then N<<<(23-R) else N) (if R <= 23 then D else D<<<(R-23))).toNat:=by rw [hm]; exact le_trans ((Nat.le_div_iff_mul_le hB0).mpr (by linarith)) (rqge A B) have hm24:(rqU (if R <= 23 then N<<<(23-R) else N) (if R <= 23 then D else D<<<(R-23))).toNat <= 2^24:=by rw [hm]; unfold FloatLib.Numerics.roundQuotientEven; dsimp only; split_ifs <;> omega generalize (rqU (if R <= 23 then N<<<(23-R) else N) (if R <= 23 then D else D<<<(R-23)))=mU at hm hmge hm24 ⊢ have hk:(if mU==16777216 then (1:UInt64) else 0).toNat=(if mU.toNat=16777216 then 1 else 0):=by by_cases h:mU.toNat=16777216 . have:mU=16777216:=UInt64.toNat_inj.mp (by rw [h]; rfl) simp [this] . have:¬ mU=16777216:=λ e=>h (by rw [e]; rfl) simp [this,h] have hk2:((if (if mU==16777216 then (1:UInt64) else 0)==1 then 8388608 else mU)-8388608).toNat=(if mU.toNat=16777216 then 8388608 else mU.toNat)-8388608:=by by_cases h:mU.toNat=16777216 . have:mU=16777216:=UInt64.toNat_inj.mp (by rw [h]; rfl) simp [this] . have:¬ mU=16777216:=λ e=>h (by rw [e]; rfl) simp only [this,h,beq_iff_eq,ite_false,show ¬ ((0:UInt64)=1) by decide] rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le]; simp; omega)]; simp generalize (if mU==16777216 then (1:UInt64) else 0)=kk at hk hk2 ⊢ have hk1:(if mU.toNat=16777216 then 1 else 0) <= 1:=by split <;> omega have hRU:(R+U).toNat=R.toNat+U.toNat:=by rw [UInt64.toNat_add]; omega have hRUk:(R+U+kk).toNat=R.toNat+U.toNat+(if mU.toNat=16777216 then 1 else 0):=by rw [UInt64.toNat_add,hRU,hk]; omega by_cases hc:(decide (V < R+U) && decide (R+U+kk-V <= 254))=true . rw [if_pos hc] simp only [Bool.and_eq_true,decide_eq_true_eq] at hc obtain ⟨hc1,hc2⟩:=hc rw [UInt64.lt_iff_toNat_lt,hRU] at hc1 have hsub:(R+U+kk-V).toNat=R.toNat+U.toNat+(if mU.toNat=16777216 then 1 else 0)-V.toNat:=by rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le,hRUk]; omega),hRUk] rw [UInt64.le_iff_toNat_le,hsub] at hc2 rw [hX,rrsC s N.toNat D.toNat E R.toNat (by omega) (by omega) hr1 hr2 mU.toNat (by rw [hsc]; exact hm.symm) (by omega) (by split <;> simp_all <;> omega),hsub,hk2] congr 1 split <;> simp_all <;> omega . rw [if_neg hc] lemma eok (w:Word) (h:(expOf w).toUInt64-1 < 254) : 1 <= (expOf w).toNat ∧ (expOf w).toNat <= 254:=by have h0:=expOf_toNat_lt w rw [UInt64.lt_iff_toNat_lt] at h by_cases hz:(expOf w).toNat=0 . have:(expOf w).toUInt64=0:=UInt64.toNat_inj.mp (by simp [UInt32.toNat_toUInt64,hz]) rw [this] at h; simp at h . rw [UInt64.toNat_sub_of_le _ _ (by rw [UInt64.le_iff_toNat_le]; simp [UInt32.toNat_toUInt64]; omega)] at h simp [UInt32.toNat_toUInt64] at h; omega lemma mok (w:Word) (h:1 <= (expOf w).toNat) : mantOf w = 2^23+(fracOf w).toNat ∧ idxOf w = (expOf w).toNat-1:=by have hne:expOf w ≠ 0:=λ e=>by rw [e] at h; simp at h unfold mantOf idxOf; rw [if_neg hne,if_neg hne]; exact ⟨rfl,rfl⟩ end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats @[inline] def Ya7G (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ) (nU b0U:UInt64) (S1n:Bool) (S1a:UInt64):Word := let ed:=(expOf dw).toUInt64 if ed-1 < 254 && !signOf dw && 0 < nU && nU < 4096 && S1a < 0x1000000000000000 && expOf w != 255 && expOf gw != 255 && expOf bw != 255 then let iw:=Yd w let ig:=Yd gw let ib:=Yd bw let idd:=ed-1 let mw:=Yf w if mw == 0 || (b0U <= iw && iw-b0U <= 24) then let x:=nU*(mw<<<(iw-b0U)) let cs:Bool:=if signOf w == S1n then signOf w else if S1a <= x then signOf w else S1n let cv:=if signOf w == S1n then x+S1a else if S1a <= x then x-S1a else S1a-x let D:=nU*Yf dw let c2:=if b0U+ig <= ib+idd then b0U+ig else ib+idd let ks:=b0U+ig-c2 let bs:=ib+idd-c2 let q0:=cv/D let r0:=cv%D*Yf gw let qq:=q0*Yf gw+r0/D if ks <= 26 && qq < (1:UInt64)<<<(61-ks) && bs <= 37 then let ra:=(r0%D)<<MYa7 n w gw bw b0 S1 dw mean) else let N:=qi*D+qr if N == 0 then 0 else if N < D then MYa7 n w gw bw b0 S1 dw mean else rrsG qs N D (c2+1) (idd+23) (λ _=>MYa7 n w gw bw b0 S1 dw mean) else MYa7 n w gw bw b0 S1 dw mean else MYa7 n w gw bw b0 S1 dw mean else MYa7 n w gw bw b0 S1 dw mean end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Numerics open Model open RationalBinary (floorLog2 scaleByPowerOfTwo scaleByPowerOfTwo_snd_ne_zero) open FloatLib.Numerics (binaryRadix Radix.toReal) lemma u64m2 (a b:UInt64) (h:a.toNat*b.toNat < 2^64):(a*b).toNat=a.toNat*b.toNat:=by rw [UInt64.toNat_mul,Nat.mod_eq_of_lt h] lemma u64a2 (a b:UInt64) (h:a.toNat+b.toNat < 2^64):(a+b).toNat=a.toNat+b.toNat:=by rw [UInt64.toNat_add,Nat.mod_eq_of_lt h] lemma u64s2 (a b:UInt64) (h:b.toNat <= a.toNat):(a-b).toNat=a.toNat-b.toNat:=by rw [UInt64.toNat_sub_of_le _ _ (UInt64.le_iff_toNat_le.mpr h)] lemma u64sh (a s:UInt64) (hs:s.toNat < 64) (h:a.toNat*2^s.toNat < 2^64):(a<<f (UInt64.le_iff_toNat_le.mp h) simp only [f,f',ite_false] by_cases g:rr.toNat=0 . have g':rr=0:=UInt64.toNat_inj.mp (by rw [g]; rfl) simp only [g,g',beq_self_eq_true,ite_true]; rw [u64s2 _ _ (by omega)]; simp . have g':(rr==0)=false:=by simp only [beq_eq_false_iff_ne]; intro h; apply g; rw [h]; rfl simp only [g,g',ite_false,Bool.false_eq_true] rw [u64s2 _ _ (by rw [u64s2 _ _ (by omega)]; simp; omega),u64s2 _ _ (by omega),u64s2 _ _ (by omega)]; simp lemma Ya7Ge (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ) (nU b0U:UInt64) (S1n:Bool) (S1a:UInt64) (hn:0 < nU.toNat → nU.toNat=n) (hb:b0U.toNat=b0) (hb255:b0 < 256) (hs:S1n=!(decide (S1 < 0))) (ha:S1a.toNat < 2^60 → S1a.toNat=S1.natAbs) : Ya7G n w gw bw b0 S1 dw mean nU b0U S1n S1a = MYa7 n w gw bw b0 S1 dw mean:=by unfold Ya7G dsimp only by_cases c1:((expOf dw).toUInt64-1 < 254 && !signOf dw && 0 < nU && nU < 4096 && S1a < 0x1000000000000000 && expOf w != 255 && expOf gw != 255 && expOf bw != 255)=true . rw [if_pos c1] simp only [Bool.and_eq_true,Bool.not_eq_true',decide_eq_true_eq,bne_iff_ne,ne_eq] at c1 obtain ⟨⟨⟨⟨⟨⟨⟨c1a,c1b⟩,c1c⟩,c1d⟩,c1e⟩,c1f⟩,c1g⟩,c1h⟩:=c1 replace hn:=hn (by rw [UInt64.lt_iff_toNat_lt] at c1c; simpa using c1c) have hed:=eok dw c1a obtain ⟨hmd,hid⟩:=mok dw hed.1 have hfd:=fracOf_toNat_lt dw have hn0:0 < n:=by rw [<- hn]; rw [UInt64.lt_iff_toNat_lt] at c1c; simpa using c1c have hn1:n < 4096:=by rw [<- hn]; rw [UInt64.lt_iff_toNat_lt] at c1d; simpa using c1d have hSa:S1a.toNat < 2^60:=by rw [UInt64.lt_iff_toNat_lt] at c1e; simpa using c1e have hS1:=ha hSa have hsv:¬ (sv dw <= 0):=by unfold sv; rw [if_neg (by simp [c1b])]; push_cast; omega have hidd:((expOf dw).toUInt64-1).toNat=idxOf dw:=by rw [u64s2 _ _ (by simp [UInt32.toNat_toUInt64]; omega),hid]; simp [UInt32.toNat_toUInt64] by_cases c2:(Yf w == 0 || (b0U <= Yd w && Yd w-b0U <= 24))=true . rw [if_pos c2] have hm24:=mantOf_lt_24 w; have hg24:=mantOf_lt_24 gw; have hb24:=mantOf_lt_24 bw have hsh:mantOf w=0 ∨ (b0U.toNat <= idxOf w ∧ idxOf w-b0U.toNat <= 24):=by simp only [Bool.or_eq_true,beq_iff_eq,Bool.and_eq_true,decide_eq_true_eq] at c2 rcases c2 with h|⟨h1,h2⟩ . left; rw [<- Zk,h]; rfl . right; rw [UInt64.le_iff_toNat_le,Zf] at h1; refine ⟨h1,?_⟩ rw [UInt64.le_iff_toNat_le,u64s2 _ _ (by rw [Zf]; exact h1),Zf] at h2; simpa using h2 obtain ⟨hxs,hxs2⟩:=shm w b0U 24 (by norm_num) hsh rw [hb] at hxs hxs2 have hxb':n*(mantOf w*2^(idxOf w-b0)) < 2^60:=by have:=Nat.mul_lt_mul'' hn1 hxs2 calc n*(mantOf w*2^(idxOf w-b0)) < 4096*2^(24+24):=this _ = 2^60:=by norm_num have hxb:n*(mantOf w*p2 (idxOf w-b0)) < 2^60:=by rw [ZE]; exact hxb' have hx:(nU*(Yf w<<<(Yd w-b0U))).toNat=n*(mantOf w*p2 (idxOf w-b0)):=by rw [u64m2 _ _ (by rw [hn,hxs]; omega),hn,hxs,ZE] generalize nU*(Yf w<<<(Yd w-b0U))=x at hx ⊢ generalize (expOf dw).toUInt64-1=idd at hidd ⊢ have hiw:=iB w; have hig:=iB gw; have hib:=iB bw; have hidb:=iB dw have hyah:Yap (signOf w) (n*(mantOf w*p2 (idxOf w-b0))) (!(decide (S1 < 0))) S1.natAbs =((if (signOf w == S1n) = true then signOf w else if S1a ≤ x then signOf w else S1n), (if (signOf w == S1n) = true then x + S1a else if S1a ≤ x then x - S1a else S1a - x).toNat):=by unfold Yap; rw [<- hs,<- hS1,<- hx] by_cases e:signOf w = S1n . simp only [e,beq_self_eq_true,ite_true]; rw [u64a2 _ _ (by omega)] . have e':(signOf w == S1n)=false:=by simpa using e simp only [e',Bool.false_eq_true,ite_false] by_cases f:S1a ≤ x . have f':S1a.toNat ≤ x.toNat:=UInt64.le_iff_toNat_le.mp f simp only [f',f,ite_true]; rw [u64s2 _ _ f'] . have f':¬ S1a.toNat ≤ x.toNat:=λ h=>f (UInt64.le_iff_toNat_le.mpr h) simp only [f',f,ite_false]; rw [u64s2 _ _ (by omega)] have hcvb:(if (signOf w == S1n) = true then x + S1a else if S1a ≤ x then x - S1a else S1a - x).toNat < 2^61:=by have:=congrArg Prod.snd hyah; simp only [] at this; rw [<- this] unfold Yap; split_ifs <;> simp <;> omega generalize (if (signOf w == S1n) = true then x + S1a else if S1a ≤ x then x - S1a else S1a - x)=cv at hyah hcvb ⊢ generalize (if (signOf w == S1n) = true then signOf w else if S1a ≤ x then signOf w else S1n)=cs at hyah ⊢ have hDb:2^23 <= n*mantOf dw ∧ n*mantOf dw < 2^36:=by have u:=Nat.mul_lt_mul'' hn1 (mantOf_lt_24 dw) refine ⟨le_trans (show 2^23 <= mantOf dw by rw [hmd]; omega) (Nat.le_mul_of_pos_left _ hn0),lt_of_lt_of_eq u (by norm_num)⟩ have hD:(nU*Yf dw).toNat=n*mantOf dw:=by rw [u64m2 _ _ (by rw [hn,Zk]; omega),hn,Zk] generalize nU*Yf dw=D at hD ⊢ have hbg:(b0U+Yd gw).toNat=b0+idxOf gw:=by rw [u64a2 _ _ (by rw [hb,Zf]; omega),hb,Zf] have hbd:(Yd bw+idd).toNat=idxOf bw+idxOf dw:=by rw [u64a2 _ _ (by rw [Zf,hidd]; omega),Zf,hidd] have hc2:(if b0U+Yd gw ≤ Yd bw+idd then b0U+Yd gw else Yd bw+idd).toNat=min (b0+idxOf gw) (idxOf bw+idxOf dw):=by split <;> rename_i h <;> rw [UInt64.le_iff_toNat_le,hbg,hbd] at h . rw [hbg]; omega . rw [hbd]; omega have hks:(b0U+Yd gw-(if b0U+Yd gw ≤ Yd bw+idd then b0U+Yd gw else Yd bw+idd)).toNat=b0+idxOf gw-min (b0+idxOf gw) (idxOf bw+idxOf dw):=by rw [u64s2 _ _ (by rw [hc2,hbg]; omega),hbg,hc2] have hbs:(Yd bw+idd-(if b0U+Yd gw ≤ Yd bw+idd then b0U+Yd gw else Yd bw+idd)).toNat=idxOf bw+idxOf dw-min (b0+idxOf gw) (idxOf bw+idxOf dw):=by rw [u64s2 _ _ (by rw [hc2,hbd]; omega),hbd,hc2] generalize (if b0U+Yd gw ≤ Yd bw+idd then b0U+Yd gw else Yd bw+idd)=c2 at hc2 hks hbs ⊢ generalize b0U+Yd gw-c2=ks at hks ⊢ generalize Yd bw+idd-c2=bs at hbs ⊢ have hDp:0 < D.toNat:=by omega have hmg:=Zk gw; have hmb:=Zk bw have hq0:(cv/D).toNat=cv.toNat/D.toNat:=UInt64.toNat_div cv D have hq0b:cv.toNat/D.toNat < 2^38:=by apply (Nat.div_lt_iff_lt_mul hDp).mpr calc cv.toNat < 2^61:=hcvb _ = 2^38*2^23:=by norm_num _ <= 2^38*D.toNat:=Nat.mul_le_mul_left _ (by omega) have hr0:(cv%D).toNat=cv.toNat%D.toNat:=UInt64.toNat_mod cv D have hr0b:cv.toNat%D.toNat < 2^36:=lt_of_lt_of_le (Nat.mod_lt _ hDp) (by omega) have hA1:cv.toNat/D.toNat*mantOf gw < 2^62:=by calc cv.toNat/D.toNat*mantOf gw < 2^38*2^24:=Nat.mul_lt_mul'' hq0b hg24 _ = 2^62:=by norm_num have hA2:cv.toNat%D.toNat*mantOf gw < 2^60:=by calc cv.toNat%D.toNat*mantOf gw < 2^36*2^24:=Nat.mul_lt_mul'' hr0b hg24 _ = 2^60:=by norm_num have hA3:cv.toNat%D.toNat*mantOf gw/D.toNat < 2^24:=by apply (Nat.div_lt_iff_lt_mul hDp).mpr have:=Nat.mul_lt_mul'' (Nat.mod_lt cv.toNat hDp) hg24 linarith have hm1:(cv/D*Yf gw).toNat=cv.toNat/D.toNat*mantOf gw:=by rw [u64m2 _ _ (by rw [hq0,hmg]; omega),hq0,hmg] have hm2:(cv%D*Yf gw).toNat=cv.toNat%D.toNat*mantOf gw:=by rw [u64m2 _ _ (by rw [hr0,hmg]; omega),hr0,hmg] have hqq:(cv/D*Yf gw+cv%D*Yf gw/D).toNat=cv.toNat/D.toNat*mantOf gw+cv.toNat%D.toNat*mantOf gw/D.toNat:=by rw [u64a2 _ _ (by rw [hm1,UInt64.toNat_div,hm2]; omega),hm1,UInt64.toNat_div,hm2] generalize cv/D*Yf gw+cv%D*Yf gw/D=qq at hqq ⊢ by_cases c3:(decide (ks ≤ 26) && decide (qq < 1 <<< (61 - ks)) && decide (bs ≤ 37))=true . rw [if_pos c3] simp only [Bool.and_eq_true,decide_eq_true_eq] at c3 obtain ⟨⟨c3a,c3b⟩,c3c⟩:=c3 have hks8:ks.toNat ≤ 26:=by rw [UInt64.le_iff_toNat_le] at c3a; simpa using c3a have hbs37:bs.toNat ≤ 37:=by rw [UInt64.le_iff_toNat_le] at c3c; simpa using c3c have h61s:(61-ks).toNat=61-ks.toNat:=by rw [u64s2 _ _ (by simp; omega)]; simp have h61:((1:UInt64) <<< (61 - ks)).toNat = 2^(61-ks.toNat):=by rw [u64sh _ _ (by rw [h61s]; omega) (by rw [h61s,UInt64.toNat_one,one_mul]; exact Nat.pow_lt_pow_right (by norm_num : 1 < 2) (by omega)),h61s]; simp have hqqb:qq.toNat < 2^(61-ks.toNat):=by rw [UInt64.lt_iff_toNat_lt,h61] at c3b; exact c3b have e61:2^(61-ks.toNat)*2^ks.toNat=2^61:=by rw [<- pow_add,show 61-ks.toNat+ks.toNat=61 by omega] have hpk:2^ks.toNat <= 2^26:=Nat.pow_le_pow_right (by norm_num) hks8 have hrm:(cv % D * Yf gw % D).toNat=cv.toNat%D.toNat*mantOf gw%D.toNat:=by rw [UInt64.toNat_mod,hm2] have hrmb:cv.toNat%D.toNat*mantOf gw%D.toNat < 2^36:=lt_of_lt_of_le (Nat.mod_lt _ hDp) (by omega) have hrab:cv.toNat%D.toNat*mantOf gw%D.toNat*2^ks.toNat < 2^62:=by calc _ < 2^36*2^26:=Nat.mul_lt_mul_of_lt_of_le hrmb hpk (by positivity) _ = 2^62:=by norm_num have hra:((cv % D * Yf gw % D) <<< ks).toNat=cv.toNat%D.toNat*mantOf gw%D.toNat*2^ks.toNat:=by rw [u64sh _ _ (by omega) (by rw [hrm]; omega),hrm] generalize (cv % D * Yf gw % D) <<< ks=ra at hra ⊢ have hrdb:ra.toNat/D.toNat < 2^26:=by rw [hra]; apply (Nat.div_lt_iff_lt_mul hDp).mpr calc _ < D.toNat*2^ks.toNat:=Nat.mul_lt_mul_of_pos_right (Nat.mod_lt _ hDp) (by positivity) _ <= D.toNat*2^26:=Nat.mul_le_mul_left _ hpk _ = 2^26*D.toNat:=Nat.mul_comm _ _ have hqsb:qq.toNat*2^ks.toNat < 2^61:=by rw [<- e61]; exact Nat.mul_lt_mul_of_pos_right hqqb (by positivity) have hqs:(qq <<< ks).toNat=qq.toNat*2^ks.toNat:=by rw [u64sh _ _ (by omega) (by omega)] have hrd:ra.toNat/D.toNat <= ra.toNat:=Nat.div_le_self _ _ have hqa:(qq <<< ks + ra / D).toNat=qq.toNat*2^ks.toNat+ra.toNat/D.toNat:=by rw [u64a2 _ _ (by rw [hqs,UInt64.toNat_div]; omega),hqs,UInt64.toNat_div] generalize qq <<< ks + ra / D=qa at hqa ⊢ have hrr:(ra % D).toNat=ra.toNat%D.toNat:=UInt64.toNat_mod ra D have hrrD:ra.toNat%D.toNat < D.toNat:=Nat.mod_lt _ hDp generalize ra % D=rr at hrr ⊢ have hpb:2^bs.toNat <= 2^37:=Nat.pow_le_pow_right (by norm_num) hbs37 have hBb:mantOf bw*2^bs.toNat < 2^61:=by calc _ < 2^24*2^37:=Nat.mul_lt_mul_of_lt_of_le hb24 hpb (by positivity) _ = 2^61:=by norm_num have hB:(Yf bw <<< bs).toNat=mantOf bw*2^bs.toNat:=by rw [u64sh _ _ (by omega) (by rw [hmb]; omega),hmb] generalize Yf bw <<< bs=B at hB ⊢ have hrab2:ra.toNat < 2^62:=by rw [hra]; exact hrab have hqab:qa.toNat < 2^62:=by rw [hqa]; omega have hY1:=Y1e (cs != signOf gw) (signOf bw) qa rr B D (by clear * - hqab hB hBb;omega) (by clear * - hrr hrrD;omega) have hqib:(if (cs != signOf gw) == signOf bw then qa+B else if B ≤ qa then qa-B else if rr == 0 then B-qa else B-qa-1).toNat < 2^63:=by have:=congrArg (λ p=>p.2.1) hY1; simp only [] at this; rw [<- this] clear * - hqab hB hBb; unfold Y3; split_ifs <;> simp <;> omega have hqrb:(if (cs != signOf gw) == signOf bw then rr else if B ≤ qa then rr else if rr == 0 then 0 else D-rr).toNat < D.toNat:=by have:=congrArg (λ p=>p.2.2) hY1; simp only [] at this; rw [<- this] unfold Y3; split_ifs <;> simp <;> omega generalize (if (cs != signOf gw) == signOf bw then (cs != signOf gw) else if B ≤ qa then (cs != signOf gw) else signOf bw)=qs at hY1 ⊢ generalize (if (cs != signOf gw) == signOf bw then qa+B else if B ≤ qa then qa-B else if rr == 0 then B-qa else B-qa-1)=qi at hY1 hqib ⊢ generalize (if (cs != signOf gw) == signOf bw then rr else if B ≤ qa then rr else if rr == 0 then 0 else D-rr)=qr at hY1 hqrb ⊢ have hY7:MYa7 n w gw bw b0 S1 dw mean=(if 16777216 ≤ qi.toNat then YN qs (2*qi.toNat+(if qr.toNat=0 then 0 else 1)) 1 ((c2.toNat:Int)-150-idxOf dw) else YN (qs&&qi.toNat*D.toNat+qr.toNat != 0) (qi.toNat*D.toNat+qr.toNat) D.toNat ((c2.toNat:Int)-149-idxOf dw)):=by unfold MYa7 MYa7b; rw [if_neg hsv]; dsimp only rw [hyah]; dsimp only rw [<- hD,ZE,ZE,<- hks,<- hbs,<- hc2,<- hqq,<- hra,<- hqa,<- hrr,<- hB,hY1] have hV:(idd+23).toNat=idxOf dw+23:=by rw [u64a2 _ _ (by rw [hidd]; simp; omega),hidd]; simp by_cases h16:16777216 ≤ qi.toNat . have h16':(16777216:UInt64) ≤ qi:=UInt64.le_iff_toNat_le.mpr (by simpa using h16) rw [if_pos h16'] clear * - hDp hD hc2 hV hY7 h16 hqib hqrb hDb hiw hig hib hidb hbg hbd hidd hn0 hn1 have hM:(2*qi+(if qr == 0 then 0 else 1)).toNat=2*qi.toNat+(if qr.toNat=0 then 0 else 1):=by have h2q:(2*qi).toNat=2*qi.toNat:=by rw [UInt64.toNat_mul]; simp; omega by_cases e:qr.toNat=0 . have e':qr=0:=UInt64.toNat_inj.mp (by rw [e]; rfl) simp only [e',e,beq_self_eq_true,ite_true]; rw [u64a2 _ _ (by rw [h2q]; simp; omega),h2q]; simp . have e':(qr==0)=false:=by simp only [beq_eq_false_iff_ne]; intro h; apply e; rw [h]; rfl simp only [e',e,Bool.false_eq_true,ite_false]; rw [u64a2 _ _ (by rw [h2q]; simp; omega),h2q]; simp exact rrsGe qs (2*qi+(if qr == 0 then 0 else 1)) 1 c2 (idd+23) ((c2.toNat:Int)-150-idxOf dw) (MYa7 n w gw bw b0 S1 dw mean) (by simp) (by rw [hM]; simp; omega) (by simp) (by rw [hc2]; omega) (by rw [hV]; omega) (by rw [hV]; push_cast; omega) (by rw [hY7,if_pos h16,hM]; simp) . have h16':¬ (16777216:UInt64) ≤ qi:=λ h=>h16 (by rw [UInt64.le_iff_toNat_le] at h; simpa using h) rw [if_neg h16'] have hqi24:qi.toNat < 2^24:=by omega have hqD:qi.toNat*D.toNat < 2^60:=by calc qi.toNat*D.toNat < 2^24*2^36:=Nat.mul_lt_mul'' hqi24 (by omega) _ = 2^60:=by norm_num have hNv:(qi*D+qr).toNat=qi.toNat*D.toNat+qr.toNat:=by rw [u64a2 _ _ (by rw [u64m2 _ _ (by omega)]; omega),u64m2 _ _ (by omega)] by_cases hN0:qi.toNat*D.toNat+qr.toNat=0 . have:(qi*D+qr==0)=true:=by simp only [beq_iff_eq]; exact UInt64.toNat_inj.mp (by rw [hNv,hN0]; rfl) rw [if_pos this,hY7,if_neg h16,hN0] unfold YN; simp [show D.toNat ≠ 0 by omega] . have:¬(qi*D+qr==0)=true:=by simp only [beq_iff_eq]; intro h; apply hN0; rw [<- hNv,h]; rfl rw [if_neg this] by_cases hND:qi.toNat*D.toNat+qr.toNat < D.toNat . have:qi*D+qr < D:=by rw [UInt64.lt_iff_toNat_lt,hNv]; exact hND rw [if_pos this] . have:¬ qi*D+qr < D:=by rw [UInt64.lt_iff_toNat_lt,hNv]; exact hND rw [if_neg this] clear * - hDp hD hNv hc2 hV hN0 hND hY7 h16 hqi24 hqD hqrb hDb hiw hig hib hidb hbg hbd hn0 hn1 hidd have hU:(c2+1).toNat=c2.toNat+1:=by rw [u64a2 _ _ (by rw [hc2]; simp; omega)]; simp exact rrsGe qs (qi*D+qr) D (c2+1) (idd+23) ((c2.toNat:Int)-149-idxOf dw) (MYa7 n w gw bw b0 S1 dw mean) hDp (by rw [hNv]; omega) (by omega) (by rw [hU,hc2]; omega) (by rw [hV]; omega) (by rw [hU,hV]; push_cast; omega) (by have e:(qi.toNat*D.toNat+qr.toNat != 0)=true:=by simpa using hN0 rw [hY7,if_neg h16,hNv,e,Bool.and_true]) . rw [if_neg c3] . rw [if_neg c2] . rw [if_neg c1] end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats lemma YTle (x:Array Word) (base n:Nat):Y2 x base n <= 255:=by unfold Y2 have:∀ (l:List Nat) (b:Nat),b <= 255 → l.foldl (λ b j=>let w:=x[base+j]!; if mantOf w=0 then b else min b (idxOf w)) b <= 255:=by intro l; induction l with | nil=>intro b h; simpa using h | cons j l ih=>intro b h; simp only [List.foldl_cons]; apply ih; split <;> omega exact this _ _ le_rfl end section lemma Ya7_eq (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit -> ℚ): MYa7 n w gw bw b0 S1 dw mean=MYba n w gw bw b0 S1 dw mean:=by rw [<- elS_eq]; unfold MYa7 MYa7b elS; simp only [U2] end def MYbc (rows n:Nat) (eps:Word) (x g b:Array Word):Array Word := if stableNormDomain rows n eps x g&&b.size==n&&b.all finiteWord then let st:=Array.ofFn (n:=rows) λ r=>Y8f x n eps r.val let aux:=Array.ofFn (n:=rows) λ r=> let s:=st[r.val]! let a:=s.2.1.natAbs ((!(s.2.1 < 0)),(if a>>>60 == 0 then a.toUInt64 else 0x1000000000000000),s.1.toUInt64) let nU:=if n < 4096 then n.toUInt64 else 0 YT rows n λ r j=>let s:=st[r]!;let u:=aux[r]!;Ya7G n x[r*n+j]! g[j]! b[j]! s.1 s.2.1 s.2.2 (λ _=>rowMean n x r) nU u.2.2 u.1 u.2.1 else layernormLegacyWith Yn rows n eps x g b lemma Zdt:MYbc=layernormSpec:=by funext rows n eps x g b;unfold MYbc layernormSpec layernormWith;split . rename_i hd;have h0:stableNormDomain rows n eps x g=true:=by simp only [Bool.and_eq_true] at hd; exact hd.1.1 obtain ⟨hn,he⟩:=M1 rows n eps x g h0;unfold layernormStable;rw [ZB _ _ _ rfl];dsimp only;congr 1;funext q;rw [Nat.div_add_mod'];have hr:q.val/n < rows:=Nat.div_lt_of_lt_mul (by simpa [Nat.mul_comm] using q.isLt);have hq:q.val/n*n+q.val%n=q.val:=Nat.div_add_mod' q.val n;rw [gO rows (λ r=>(let s:=(Array.ofFn (n:=rows) λ r=>Y8f x n eps r.val)[r]!;let a:=s.2.1.natAbs ((!(s.2.1 < 0)),(if a>>>60 == 0 then a.toUInt64 else 0x1000000000000000),s.1.toUInt64))) _ hr] dsimp only rw [gO rows (λ r=>Y8f x n eps r) _ hr,Y8f_eq] rw [Ya7Ge n _ _ _ _ _ _ _ _ _ _ _ (by intro h; split at h <;> simp_all [Nat.toUInt64_eq]; omega) (by have:=YTle x (q.val/n*n) n; unfold Y8; simp [Nat.toUInt64_eq]; omega) (by have:=YTle x (q.val/n*n) n; unfold Y8; simp; omega) rfl (by split . rename_i h0; intro h; simp only [beq_iff_eq] at h0; have:=sh0 _ _ h0; simp [Nat.toUInt64_eq]; omega . intro h; simp at h),Ya7_eq] rw [gO rows (λ r=>sqrtRational (rowVariance n x r (Array.ofFn (n:=rows) λ i=>rowMean n x i.val)[r]! + rationalWord eps)) _ hr, gO rows (λ r=>rowMean n x r) _ hr,Zdr _ _ _ _ _ _ _ _ hn, U8 _ _ _ _ _ _ _ _ hn (λ hm=>by have:=Z2 x (q.val/n*n) n (q.val%n) (Nat.mod_lt _ hn) (by rwa [hq]);rwa [hq] at this) (V0 x n eps _ hn), V1 x n eps _ hn he] . simp only [Zi] lemma Yos (f g:ٳ -> ؼ):∀ r i,Yo f g i (r+1)=Yo f g i r+sv (f (i+r))*sv (g (i+r))*2^(γ (f (i+r))+γ (g (i+r))):=by intro r;induction r with |zero=>intro i;simp[Yo] |succ r ih=>intro i;rw[Yo,ih (i+1),Yo,show i+1+r=i+(r+1) by omega];ring lemma Yqs (f g:ٳ -> ؼ):∀ r i,Yq f g i (r+1)=(Yq f g i r&&((decide (ε (f (i+r))*ε (g (i+r))=0)&&Ζ (η (f (i+r))) (η (g (i+r)))))):=by intro r;induction r with |zero=>intro i;simp[Yq] |succ r ih=>intro i;rw[Yq,ih (i+1),Yq,show i+1+r=i+(r+1) by omega];simp only[EK] lemma Yoc (f g f' g':ٳ -> ؼ):∀ r i,(∀ t,i<=t -> t < i+r -> f t=f' t/\g t=g' t) -> Yo f g i r=Yo f' g' i r/\Yq f g i r=Yq f' g' i r:=by intro r;induction r with |zero=>intro i _;exact⟨rfl,rfl⟩ |succ r ih=>intro i h;obtain⟨a,b⟩:=h i le_rfl (by omega);obtain⟨c,d⟩:=ih (i+1) (λ t u v=>h t (by omega) (by omega));simp only[Yo,Yq,a,b,c,d,and_self] lemma Gsn (k:ٳ) (a b:ٳ -> ؼ) (hk:0 θ (a t)≠255/\θ (b t)≠255):Γ (k+1) (λ t=>if tif tby by_cases c:tif tif tby simp[show t ؼ) (h:∀ t,t a t=a' t/\b t=b' t):Γ k a b=Γ k a' b':=by rw[<-Zi,Z5,Z5];simp only[show ∀ i:Fin k,a i=a' i from λ i=>(h i i.isLt).1,show ∀ i:Fin k,b i=b' i from λ i=>(h i i.isLt).2] def Ya3Q (batch m k n:ٳ) (A B:ؽ δ):ؽ δ:= if k<20||!(A.all finiteWord&&B.all finiteWord) then Ya3 batch m k n A B else let Z:ؽ δ:=Χ n 0x80000000 let R:ؽ (ؽ δ):=ڀ (batch) λ β=>YaV m k n false (A.extract (β.val*m*k) ((β.val+1)*m*k)) (ڀ (n*k) λ q=>B[(β.val*k+q.val%k)*n+q.val/k]!) Z ڀ (batch*(m*n)) λ q=>(R[q.val/(m*n)]!)[q.val%(m*n)]! lemma Xg (A:ؽ δ) (s e x:ٳ) (h:s+x α) (k:ٳ) (h:kif tif t⟨Fw A hA _,Fw B hB _⟩) intro t ht by_cases c:t